2 * Copyright (c) 2001 Paul Stewart
3 * Copyright (c) 2001 Vojtech Pavlik
5 * HID char devices, giving access to raw HID device events.
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 * Should you need to contact me, the author, you can do so either by
25 * e-mail - mail your message to Paul Stewart <stewart@wetlogic.net>
28 #include <linux/poll.h>
29 #include <linux/slab.h>
30 #include <linux/module.h>
31 #include <linux/init.h>
32 #include <linux/smp_lock.h>
33 #include <linux/input.h>
34 #include <linux/usb.h>
35 #include <linux/hid.h>
36 #include <linux/hiddev.h>
39 #ifdef CONFIG_USB_DYNAMIC_MINORS
40 #define HIDDEV_MINOR_BASE 0
41 #define HIDDEV_MINORS 256
43 #define HIDDEV_MINOR_BASE 96
44 #define HIDDEV_MINORS 16
46 #define HIDDEV_BUFFER_SIZE 64
51 wait_queue_head_t wait;
52 struct hid_device *hid;
53 struct list_head list;
57 struct hiddev_usage_ref buffer[HIDDEV_BUFFER_SIZE];
61 struct fasync_struct *fasync;
62 struct hiddev *hiddev;
63 struct list_head node;
66 static struct hiddev *hiddev_table[HIDDEV_MINORS];
69 * Find a report, given the report's type and ID. The ID can be specified
70 * indirectly by REPORT_ID_FIRST (which returns the first report of the given
71 * type) or by (REPORT_ID_NEXT | old_id), which returns the next report of the
72 * given type which follows old_id.
74 static struct hid_report *
75 hiddev_lookup_report(struct hid_device *hid, struct hiddev_report_info *rinfo)
77 unsigned int flags = rinfo->report_id & ~HID_REPORT_ID_MASK;
78 unsigned int rid = rinfo->report_id & HID_REPORT_ID_MASK;
79 struct hid_report_enum *report_enum;
80 struct hid_report *report;
81 struct list_head *list;
83 if (rinfo->report_type < HID_REPORT_TYPE_MIN ||
84 rinfo->report_type > HID_REPORT_TYPE_MAX)
87 report_enum = hid->report_enum +
88 (rinfo->report_type - HID_REPORT_TYPE_MIN);
91 case 0: /* Nothing to do -- report_id is already set correctly */
94 case HID_REPORT_ID_FIRST:
95 if (list_empty(&report_enum->report_list))
98 list = report_enum->report_list.next;
99 report = list_entry(list, struct hid_report, list);
100 rinfo->report_id = report->id;
103 case HID_REPORT_ID_NEXT:
104 report = report_enum->report_id_hash[rid];
108 list = report->list.next;
109 if (list == &report_enum->report_list)
112 report = list_entry(list, struct hid_report, list);
113 rinfo->report_id = report->id;
120 return report_enum->report_id_hash[rinfo->report_id];
124 * Perform an exhaustive search of the report table for a usage, given its
127 static struct hid_field *
128 hiddev_lookup_usage(struct hid_device *hid, struct hiddev_usage_ref *uref)
131 struct hid_report *report;
132 struct hid_report_enum *report_enum;
133 struct hid_field *field;
135 if (uref->report_type < HID_REPORT_TYPE_MIN ||
136 uref->report_type > HID_REPORT_TYPE_MAX)
139 report_enum = hid->report_enum +
140 (uref->report_type - HID_REPORT_TYPE_MIN);
142 list_for_each_entry(report, &report_enum->report_list, list) {
143 for (i = 0; i < report->maxfield; i++) {
144 field = report->field[i];
145 for (j = 0; j < field->maxusage; j++) {
146 if (field->usage[j].hid == uref->usage_code) {
147 uref->report_id = report->id;
148 uref->field_index = i;
149 uref->usage_index = j;
159 static void hiddev_send_event(struct hid_device *hid,
160 struct hiddev_usage_ref *uref)
162 struct hiddev *hiddev = hid->hiddev;
163 struct hiddev_list *list;
165 list_for_each_entry(list, &hiddev->list, node) {
166 if (uref->field_index != HID_FIELD_INDEX_NONE ||
167 (list->flags & HIDDEV_FLAG_REPORT) != 0) {
168 list->buffer[list->head] = *uref;
169 list->head = (list->head + 1) &
170 (HIDDEV_BUFFER_SIZE - 1);
171 kill_fasync(&list->fasync, SIGIO, POLL_IN);
175 wake_up_interruptible(&hiddev->wait);
179 * This is where hid.c calls into hiddev to pass an event that occurred over
182 void hiddev_hid_event(struct hid_device *hid, struct hid_field *field,
183 struct hid_usage *usage, __s32 value)
185 unsigned type = field->report_type;
186 struct hiddev_usage_ref uref;
189 (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :
190 ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :
191 ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));
192 uref.report_id = field->report->id;
193 uref.field_index = field->index;
194 uref.usage_index = (usage - field->usage);
195 uref.usage_code = usage->hid;
198 hiddev_send_event(hid, &uref);
200 EXPORT_SYMBOL_GPL(hiddev_hid_event);
202 void hiddev_report_event(struct hid_device *hid, struct hid_report *report)
204 unsigned type = report->type;
205 struct hiddev_usage_ref uref;
207 memset(&uref, 0, sizeof(uref));
209 (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :
210 ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :
211 ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));
212 uref.report_id = report->id;
213 uref.field_index = HID_FIELD_INDEX_NONE;
215 hiddev_send_event(hid, &uref);
220 static int hiddev_fasync(int fd, struct file *file, int on)
223 struct hiddev_list *list = file->private_data;
225 retval = fasync_helper(fd, file, on, &list->fasync);
227 return retval < 0 ? retval : 0;
234 static int hiddev_release(struct inode * inode, struct file * file)
236 struct hiddev_list *list = file->private_data;
238 hiddev_fasync(-1, file, 0);
239 list_del(&list->node);
241 if (!--list->hiddev->open) {
242 if (list->hiddev->exist)
243 usbhid_close(list->hiddev->hid);
256 static int hiddev_open(struct inode *inode, struct file *file)
258 struct hiddev_list *list;
260 int i = iminor(inode) - HIDDEV_MINOR_BASE;
262 if (i >= HIDDEV_MINORS || !hiddev_table[i])
265 if (!(list = kzalloc(sizeof(struct hiddev_list), GFP_KERNEL)))
268 list->hiddev = hiddev_table[i];
269 list_add_tail(&list->node, &hiddev_table[i]->list);
270 file->private_data = list;
272 if (!list->hiddev->open++)
273 if (list->hiddev->exist)
274 usbhid_open(hiddev_table[i]->hid);
282 static ssize_t hiddev_write(struct file * file, const char __user * buffer, size_t count, loff_t *ppos)
290 static ssize_t hiddev_read(struct file * file, char __user * buffer, size_t count, loff_t *ppos)
292 DECLARE_WAITQUEUE(wait, current);
293 struct hiddev_list *list = file->private_data;
297 event_size = ((list->flags & HIDDEV_FLAG_UREF) != 0) ?
298 sizeof(struct hiddev_usage_ref) : sizeof(struct hiddev_event);
300 if (count < event_size)
303 while (retval == 0) {
304 if (list->head == list->tail) {
305 add_wait_queue(&list->hiddev->wait, &wait);
306 set_current_state(TASK_INTERRUPTIBLE);
308 while (list->head == list->tail) {
309 if (file->f_flags & O_NONBLOCK) {
313 if (signal_pending(current)) {
314 retval = -ERESTARTSYS;
317 if (!list->hiddev->exist) {
323 set_current_state(TASK_INTERRUPTIBLE);
326 set_current_state(TASK_RUNNING);
327 remove_wait_queue(&list->hiddev->wait, &wait);
334 while (list->head != list->tail &&
335 retval + event_size <= count) {
336 if ((list->flags & HIDDEV_FLAG_UREF) == 0) {
337 if (list->buffer[list->tail].field_index !=
338 HID_FIELD_INDEX_NONE) {
339 struct hiddev_event event;
340 event.hid = list->buffer[list->tail].usage_code;
341 event.value = list->buffer[list->tail].value;
342 if (copy_to_user(buffer + retval, &event, sizeof(struct hiddev_event)))
344 retval += sizeof(struct hiddev_event);
347 if (list->buffer[list->tail].field_index != HID_FIELD_INDEX_NONE ||
348 (list->flags & HIDDEV_FLAG_REPORT) != 0) {
349 if (copy_to_user(buffer + retval, list->buffer + list->tail, sizeof(struct hiddev_usage_ref)))
351 retval += sizeof(struct hiddev_usage_ref);
354 list->tail = (list->tail + 1) & (HIDDEV_BUFFER_SIZE - 1);
364 * No kernel lock - fine
366 static unsigned int hiddev_poll(struct file *file, poll_table *wait)
368 struct hiddev_list *list = file->private_data;
370 poll_wait(file, &list->hiddev->wait, wait);
371 if (list->head != list->tail)
372 return POLLIN | POLLRDNORM;
373 if (!list->hiddev->exist)
374 return POLLERR | POLLHUP;
381 static int hiddev_ioctl(struct inode *inode, struct file *file, unsigned int cmd, unsigned long arg)
383 struct hiddev_list *list = file->private_data;
384 struct hiddev *hiddev = list->hiddev;
385 struct hid_device *hid = hiddev->hid;
386 struct usb_device *dev = to_usb_device(hid->dev);
387 struct hiddev_collection_info cinfo;
388 struct hiddev_report_info rinfo;
389 struct hiddev_field_info finfo;
390 struct hiddev_usage_ref_multi *uref_multi = NULL;
391 struct hiddev_usage_ref *uref;
392 struct hiddev_devinfo dinfo;
393 struct hid_report *report;
394 struct hid_field *field;
395 struct usbhid_device *usbhid = hid->driver_data;
396 void __user *user_arg = (void __user *)arg;
405 return put_user(HID_VERSION, (int __user *)arg);
407 case HIDIOCAPPLICATION:
408 if (arg < 0 || arg >= hid->maxapplication)
411 for (i = 0; i < hid->maxcollection; i++)
412 if (hid->collection[i].type ==
413 HID_COLLECTION_APPLICATION && arg-- == 0)
416 if (i == hid->maxcollection)
419 return hid->collection[i].usage;
422 dinfo.bustype = BUS_USB;
423 dinfo.busnum = dev->bus->busnum;
424 dinfo.devnum = dev->devnum;
425 dinfo.ifnum = usbhid->ifnum;
426 dinfo.vendor = le16_to_cpu(dev->descriptor.idVendor);
427 dinfo.product = le16_to_cpu(dev->descriptor.idProduct);
428 dinfo.version = le16_to_cpu(dev->descriptor.bcdDevice);
429 dinfo.num_applications = hid->maxapplication;
430 if (copy_to_user(user_arg, &dinfo, sizeof(dinfo)))
436 if (put_user(list->flags, (int __user *)arg))
444 if (get_user(newflags, (int __user *)arg))
447 if ((newflags & ~HIDDEV_FLAGS) != 0 ||
448 ((newflags & HIDDEV_FLAG_REPORT) != 0 &&
449 (newflags & HIDDEV_FLAG_UREF) == 0))
452 list->flags = newflags;
462 if (get_user(idx, (int __user *)arg))
465 if ((buf = kmalloc(HID_STRING_SIZE, GFP_KERNEL)) == NULL)
468 if ((len = usb_string(dev, idx, buf, HID_STRING_SIZE-1)) < 0) {
473 if (copy_to_user(user_arg+sizeof(int), buf, len+1)) {
483 case HIDIOCINITREPORT:
484 usbhid_init_reports(hid);
489 if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
492 if (rinfo.report_type == HID_REPORT_TYPE_OUTPUT)
495 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
498 usbhid_submit_report(hid, report, USB_DIR_IN);
504 if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
507 if (rinfo.report_type == HID_REPORT_TYPE_INPUT)
510 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
513 usbhid_submit_report(hid, report, USB_DIR_OUT);
518 case HIDIOCGREPORTINFO:
519 if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
522 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
525 rinfo.num_fields = report->maxfield;
527 if (copy_to_user(user_arg, &rinfo, sizeof(rinfo)))
532 case HIDIOCGFIELDINFO:
533 if (copy_from_user(&finfo, user_arg, sizeof(finfo)))
535 rinfo.report_type = finfo.report_type;
536 rinfo.report_id = finfo.report_id;
537 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
540 if (finfo.field_index >= report->maxfield)
543 field = report->field[finfo.field_index];
544 memset(&finfo, 0, sizeof(finfo));
545 finfo.report_type = rinfo.report_type;
546 finfo.report_id = rinfo.report_id;
547 finfo.field_index = field->report_count - 1;
548 finfo.maxusage = field->maxusage;
549 finfo.flags = field->flags;
550 finfo.physical = field->physical;
551 finfo.logical = field->logical;
552 finfo.application = field->application;
553 finfo.logical_minimum = field->logical_minimum;
554 finfo.logical_maximum = field->logical_maximum;
555 finfo.physical_minimum = field->physical_minimum;
556 finfo.physical_maximum = field->physical_maximum;
557 finfo.unit_exponent = field->unit_exponent;
558 finfo.unit = field->unit;
560 if (copy_to_user(user_arg, &finfo, sizeof(finfo)))
566 uref_multi = kmalloc(sizeof(struct hiddev_usage_ref_multi), GFP_KERNEL);
569 uref = &uref_multi->uref;
570 if (copy_from_user(uref, user_arg, sizeof(*uref)))
573 rinfo.report_type = uref->report_type;
574 rinfo.report_id = uref->report_id;
575 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
578 if (uref->field_index >= report->maxfield)
581 field = report->field[uref->field_index];
582 if (uref->usage_index >= field->maxusage)
585 uref->usage_code = field->usage[uref->usage_index].hid;
587 if (copy_to_user(user_arg, uref, sizeof(*uref)))
597 case HIDIOCGCOLLECTIONINDEX:
598 uref_multi = kmalloc(sizeof(struct hiddev_usage_ref_multi), GFP_KERNEL);
601 uref = &uref_multi->uref;
602 if (cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) {
603 if (copy_from_user(uref_multi, user_arg,
604 sizeof(*uref_multi)))
607 if (copy_from_user(uref, user_arg, sizeof(*uref)))
611 if (cmd != HIDIOCGUSAGE &&
612 cmd != HIDIOCGUSAGES &&
613 uref->report_type == HID_REPORT_TYPE_INPUT)
616 if (uref->report_id == HID_REPORT_ID_UNKNOWN) {
617 field = hiddev_lookup_usage(hid, uref);
621 rinfo.report_type = uref->report_type;
622 rinfo.report_id = uref->report_id;
623 if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
626 if (uref->field_index >= report->maxfield)
629 field = report->field[uref->field_index];
631 if (cmd == HIDIOCGCOLLECTIONINDEX) {
632 if (uref->usage_index >= field->maxusage)
634 } else if (uref->usage_index >= field->report_count)
637 else if ((cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) &&
638 (uref_multi->num_values > HID_MAX_MULTI_USAGES ||
639 uref->usage_index + uref_multi->num_values > field->report_count))
645 uref->value = field->value[uref->usage_index];
646 if (copy_to_user(user_arg, uref, sizeof(*uref)))
651 field->value[uref->usage_index] = uref->value;
654 case HIDIOCGCOLLECTIONINDEX:
656 return field->usage[uref->usage_index].collection_index;
658 for (i = 0; i < uref_multi->num_values; i++)
659 uref_multi->values[i] =
660 field->value[uref->usage_index + i];
661 if (copy_to_user(user_arg, uref_multi,
662 sizeof(*uref_multi)))
666 for (i = 0; i < uref_multi->num_values; i++)
667 field->value[uref->usage_index + i] =
668 uref_multi->values[i];
682 case HIDIOCGCOLLECTIONINFO:
683 if (copy_from_user(&cinfo, user_arg, sizeof(cinfo)))
686 if (cinfo.index >= hid->maxcollection)
689 cinfo.type = hid->collection[cinfo.index].type;
690 cinfo.usage = hid->collection[cinfo.index].usage;
691 cinfo.level = hid->collection[cinfo.index].level;
693 if (copy_to_user(user_arg, &cinfo, sizeof(cinfo)))
699 if (_IOC_TYPE(cmd) != 'H' || _IOC_DIR(cmd) != _IOC_READ)
702 if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGNAME(0))) {
706 len = strlen(hid->name) + 1;
707 if (len > _IOC_SIZE(cmd))
708 len = _IOC_SIZE(cmd);
709 return copy_to_user(user_arg, hid->name, len) ?
713 if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGPHYS(0))) {
717 len = strlen(hid->phys) + 1;
718 if (len > _IOC_SIZE(cmd))
719 len = _IOC_SIZE(cmd);
720 return copy_to_user(user_arg, hid->phys, len) ?
727 static const struct file_operations hiddev_fops = {
728 .owner = THIS_MODULE,
730 .write = hiddev_write,
733 .release = hiddev_release,
734 .ioctl = hiddev_ioctl,
735 .fasync = hiddev_fasync,
738 static struct usb_class_driver hiddev_class = {
740 .fops = &hiddev_fops,
741 .minor_base = HIDDEV_MINOR_BASE,
745 * This is where hid.c calls us to connect a hid device to the hiddev driver
747 int hiddev_connect(struct hid_device *hid)
749 struct hiddev *hiddev;
750 struct usbhid_device *usbhid = hid->driver_data;
754 for (i = 0; i < hid->maxcollection; i++)
755 if (hid->collection[i].type ==
756 HID_COLLECTION_APPLICATION &&
757 !IS_INPUT_APPLICATION(hid->collection[i].usage))
760 if (i == hid->maxcollection && (hid->quirks & HID_QUIRK_HIDDEV) == 0)
763 if (!(hiddev = kzalloc(sizeof(struct hiddev), GFP_KERNEL)))
766 retval = usb_register_dev(usbhid->intf, &hiddev_class);
768 err("Not able to get a minor for this device.");
773 init_waitqueue_head(&hiddev->wait);
774 INIT_LIST_HEAD(&hiddev->list);
778 hid->minor = usbhid->intf->minor;
779 hid->hiddev = hiddev;
781 hiddev_table[usbhid->intf->minor - HIDDEV_MINOR_BASE] = hiddev;
787 * This is where hid.c calls us to disconnect a hiddev device from the
788 * corresponding hid device (usually because the usb device has disconnected)
790 static struct usb_class_driver hiddev_class;
791 void hiddev_disconnect(struct hid_device *hid)
793 struct hiddev *hiddev = hid->hiddev;
794 struct usbhid_device *usbhid = hid->driver_data;
798 hiddev_table[hiddev->hid->minor - HIDDEV_MINOR_BASE] = NULL;
799 usb_deregister_dev(usbhid->intf, &hiddev_class);
802 usbhid_close(hiddev->hid);
803 wake_up_interruptible(&hiddev->wait);
809 /* Currently this driver is a USB driver. It's not a conventional one in
810 * the sense that it doesn't probe at the USB level. Instead it waits to
811 * be connected by HID through the hiddev_connect / hiddev_disconnect
812 * routines. The reason to register as a USB device is to gain part of the
813 * minor number space from the USB major.
815 * In theory, should the HID code be generalized to more than one physical
816 * medium (say, IEEE 1384), this driver will probably need to register its
817 * own major number, and in doing so, no longer need to register with USB.
818 * At that point the probe routine and hiddev_driver struct below will no
823 /* We never attach in this manner, and rely on HID to connect us. This
824 * is why there is no disconnect routine defined in the usb_driver either.
826 static int hiddev_usbd_probe(struct usb_interface *intf,
827 const struct usb_device_id *hiddev_info)
833 static /* const */ struct usb_driver hiddev_driver = {
835 .probe = hiddev_usbd_probe,
838 int __init hiddev_init(void)
840 return usb_register(&hiddev_driver);
843 void hiddev_exit(void)
845 usb_deregister(&hiddev_driver);