linuxppc-dev.lists.ozlabs.org archive mirror
 help / color / mirror / Atom feed
* [PATCH] Fix compilation problem with 2.6.0-test2 on PPC
@ 2003-08-05 20:11 Jocelyn Mayer
  2003-08-24 19:44 ` Vojtech Pavlik
  0 siblings, 1 reply; 2+ messages in thread
From: Jocelyn Mayer @ 2003-08-05 20:11 UTC (permalink / raw)
  To: Linux PPC, linux-usb-devel, vojtech

[-- Attachment #1: Type: text/plain, Size: 309 bytes --]

Hi,

There is a compilation issue in driver/input/evdev.c
due to the fact a "complex" expression is used as an argument
for an inline assembly construction (get_user)
The fix I done is to use a temporary variable to get the argument
and then use this variable for get_user.

--
Jocelyn Mayer <jma@netgem.com>

[-- Attachment #2: evdev.c.diff --]
[-- Type: text/plain, Size: 733 bytes --]

--- evdev.c.orig	Mon Jun 16 06:39:02 2003
+++ evdev.c	Thu Jul 31 02:41:35 2003
@@ -208,7 +208,7 @@
 	struct evdev *evdev = list->evdev;
 	struct input_dev *dev = evdev->handle.dev;
 	struct input_absinfo abs;
-	int i, t, u;
+	int i, t, u, v;

 	if (!evdev->exist) return -ENODEV;

@@ -240,7 +240,8 @@
 			if (get_user(t, ((int *) arg) + 0)) return -EFAULT;
 			if (t < 0 || t > dev->keycodemax || !dev->keycodesize) return -EINVAL;
 			u = INPUT_KEYCODE(dev, t);
-			if (get_user(INPUT_KEYCODE(dev, t), ((int *) arg) + 1)) return -EFAULT;
+                        v = INPUT_KEYCODE(dev, t);
+			if (get_user(v, ((int *) arg) + 1)) return -EFAULT;

 			for (i = 0; i < dev->keycodemax; i++)
 				if(INPUT_KEYCODE(dev, t) == u) break;

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2003-08-24 19:44 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2003-08-05 20:11 [PATCH] Fix compilation problem with 2.6.0-test2 on PPC Jocelyn Mayer
2003-08-24 19:44 ` Vojtech Pavlik

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).