847 lines · 20.7 KB · C
RawDownload
/* *  Copyright (c) 2001 Paul Stewart *  Copyright (c) 2001 Vojtech Pavlik * *  HID char devices, giving access to raw HID device events. * */ /* * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * Should you need to contact me, the author, you can do so either by * e-mail - mail your message to Paul Stewart <stewart@wetlogic.net> */ #include <linux/poll.h>#include <linux/slab.h>#include <linux/module.h>#include <linux/init.h>#include <linux/smp_lock.h>#include <linux/input.h>#include <linux/usb.h>#include <linux/hid.h>#include <linux/hiddev.h>#include "usbhid.h" #ifdef CONFIG_USB_DYNAMIC_MINORS#define HIDDEV_MINOR_BASE	0#define HIDDEV_MINORS		256#else#define HIDDEV_MINOR_BASE	96#define HIDDEV_MINORS		16#endif#define HIDDEV_BUFFER_SIZE	64 struct hiddev {	int exist;	int open;	wait_queue_head_t wait;	struct hid_device *hid;	struct list_head list;}; struct hiddev_list {	struct hiddev_usage_ref buffer[HIDDEV_BUFFER_SIZE];	int head;	int tail;	unsigned flags;	struct fasync_struct *fasync;	struct hiddev *hiddev;	struct list_head node;}; static struct hiddev *hiddev_table[HIDDEV_MINORS]; /* * Find a report, given the report's type and ID.  The ID can be specified * indirectly by REPORT_ID_FIRST (which returns the first report of the given * type) or by (REPORT_ID_NEXT | old_id), which returns the next report of the * given type which follows old_id. */static struct hid_report *hiddev_lookup_report(struct hid_device *hid, struct hiddev_report_info *rinfo){	unsigned int flags = rinfo->report_id & ~HID_REPORT_ID_MASK;	unsigned int rid = rinfo->report_id & HID_REPORT_ID_MASK;	struct hid_report_enum *report_enum;	struct hid_report *report;	struct list_head *list; 	if (rinfo->report_type < HID_REPORT_TYPE_MIN ||	    rinfo->report_type > HID_REPORT_TYPE_MAX)		return NULL; 	report_enum = hid->report_enum +		(rinfo->report_type - HID_REPORT_TYPE_MIN); 	switch (flags) {	case 0: /* Nothing to do -- report_id is already set correctly */		break; 	case HID_REPORT_ID_FIRST:		if (list_empty(&report_enum->report_list))			return NULL; 		list = report_enum->report_list.next;		report = list_entry(list, struct hid_report, list);		rinfo->report_id = report->id;		break; 	case HID_REPORT_ID_NEXT:		report = report_enum->report_id_hash[rid];		if (!report)			return NULL; 		list = report->list.next;		if (list == &report_enum->report_list)			return NULL; 		report = list_entry(list, struct hid_report, list);		rinfo->report_id = report->id;		break; 	default:		return NULL;	} 	return report_enum->report_id_hash[rinfo->report_id];} /* * Perform an exhaustive search of the report table for a usage, given its * type and usage id. */static struct hid_field *hiddev_lookup_usage(struct hid_device *hid, struct hiddev_usage_ref *uref){	int i, j;	struct hid_report *report;	struct hid_report_enum *report_enum;	struct hid_field *field; 	if (uref->report_type < HID_REPORT_TYPE_MIN ||	    uref->report_type > HID_REPORT_TYPE_MAX)		return NULL; 	report_enum = hid->report_enum +		(uref->report_type - HID_REPORT_TYPE_MIN); 	list_for_each_entry(report, &report_enum->report_list, list) {		for (i = 0; i < report->maxfield; i++) {			field = report->field[i];			for (j = 0; j < field->maxusage; j++) {				if (field->usage[j].hid == uref->usage_code) {					uref->report_id = report->id;					uref->field_index = i;					uref->usage_index = j;					return field;				}			}		}	} 	return NULL;} static void hiddev_send_event(struct hid_device *hid,			      struct hiddev_usage_ref *uref){	struct hiddev *hiddev = hid->hiddev;	struct hiddev_list *list; 	list_for_each_entry(list, &hiddev->list, node) {		if (uref->field_index != HID_FIELD_INDEX_NONE ||		    (list->flags & HIDDEV_FLAG_REPORT) != 0) {			list->buffer[list->head] = *uref;			list->head = (list->head + 1) &				(HIDDEV_BUFFER_SIZE - 1);			kill_fasync(&list->fasync, SIGIO, POLL_IN);		}	} 	wake_up_interruptible(&hiddev->wait);} /* * This is where hid.c calls into hiddev to pass an event that occurred over * the interrupt pipe */void hiddev_hid_event(struct hid_device *hid, struct hid_field *field,		      struct hid_usage *usage, __s32 value){	unsigned type = field->report_type;	struct hiddev_usage_ref uref; 	uref.report_type =	  (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :	  ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :	   ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));	uref.report_id = field->report->id;	uref.field_index = field->index;	uref.usage_index = (usage - field->usage);	uref.usage_code = usage->hid;	uref.value = value; 	hiddev_send_event(hid, &uref);}EXPORT_SYMBOL_GPL(hiddev_hid_event); void hiddev_report_event(struct hid_device *hid, struct hid_report *report){	unsigned type = report->type;	struct hiddev_usage_ref uref; 	memset(&uref, 0, sizeof(uref));	uref.report_type =	  (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :	  ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :	   ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));	uref.report_id = report->id;	uref.field_index = HID_FIELD_INDEX_NONE; 	hiddev_send_event(hid, &uref);} /* * fasync file op */static int hiddev_fasync(int fd, struct file *file, int on){	int retval;	struct hiddev_list *list = file->private_data; 	retval = fasync_helper(fd, file, on, &list->fasync); 	return retval < 0 ? retval : 0;}  /* * release file op */static int hiddev_release(struct inode * inode, struct file * file){	struct hiddev_list *list = file->private_data; 	hiddev_fasync(-1, file, 0);	list_del(&list->node); 	if (!--list->hiddev->open) {		if (list->hiddev->exist)			usbhid_close(list->hiddev->hid);		else			kfree(list->hiddev);	} 	kfree(list); 	return 0;} /* * open file op */static int hiddev_open(struct inode *inode, struct file *file){	struct hiddev_list *list; 	int i = iminor(inode) - HIDDEV_MINOR_BASE; 	if (i >= HIDDEV_MINORS || !hiddev_table[i])		return -ENODEV; 	if (!(list = kzalloc(sizeof(struct hiddev_list), GFP_KERNEL)))		return -ENOMEM; 	list->hiddev = hiddev_table[i];	list_add_tail(&list->node, &hiddev_table[i]->list);	file->private_data = list; 	if (!list->hiddev->open++)		if (list->hiddev->exist)			usbhid_open(hiddev_table[i]->hid); 	return 0;} /* * "write" file op */static ssize_t hiddev_write(struct file * file, const char __user * buffer, size_t count, loff_t *ppos){	return -EINVAL;} /* * "read" file op */static ssize_t hiddev_read(struct file * file, char __user * buffer, size_t count, loff_t *ppos){	DECLARE_WAITQUEUE(wait, current);	struct hiddev_list *list = file->private_data;	int event_size;	int retval = 0; 	event_size = ((list->flags & HIDDEV_FLAG_UREF) != 0) ?		sizeof(struct hiddev_usage_ref) : sizeof(struct hiddev_event); 	if (count < event_size)		return 0; 	while (retval == 0) {		if (list->head == list->tail) {			add_wait_queue(&list->hiddev->wait, &wait);			set_current_state(TASK_INTERRUPTIBLE); 			while (list->head == list->tail) {				if (file->f_flags & O_NONBLOCK) {					retval = -EAGAIN;					break;				}				if (signal_pending(current)) {					retval = -ERESTARTSYS;					break;				}				if (!list->hiddev->exist) {					retval = -EIO;					break;				} 				schedule();				set_current_state(TASK_INTERRUPTIBLE);			} 			set_current_state(TASK_RUNNING);			remove_wait_queue(&list->hiddev->wait, &wait);		} 		if (retval)			return retval;  		while (list->head != list->tail &&		       retval + event_size <= count) {			if ((list->flags & HIDDEV_FLAG_UREF) == 0) {				if (list->buffer[list->tail].field_index !=				    HID_FIELD_INDEX_NONE) {					struct hiddev_event event;					event.hid = list->buffer[list->tail].usage_code;					event.value = list->buffer[list->tail].value;					if (copy_to_user(buffer + retval, &event, sizeof(struct hiddev_event)))						return -EFAULT;					retval += sizeof(struct hiddev_event);				}			} else {				if (list->buffer[list->tail].field_index != HID_FIELD_INDEX_NONE ||				    (list->flags & HIDDEV_FLAG_REPORT) != 0) {					if (copy_to_user(buffer + retval, list->buffer + list->tail, sizeof(struct hiddev_usage_ref)))						return -EFAULT;					retval += sizeof(struct hiddev_usage_ref);				}			}			list->tail = (list->tail + 1) & (HIDDEV_BUFFER_SIZE - 1);		} 	} 	return retval;} /* * "poll" file op * No kernel lock - fine */static unsigned int hiddev_poll(struct file *file, poll_table *wait){	struct hiddev_list *list = file->private_data; 	poll_wait(file, &list->hiddev->wait, wait);	if (list->head != list->tail)		return POLLIN | POLLRDNORM;	if (!list->hiddev->exist)		return POLLERR | POLLHUP;	return 0;} /* * "ioctl" file op */static int hiddev_ioctl(struct inode *inode, struct file *file, unsigned int cmd, unsigned long arg){	struct hiddev_list *list = file->private_data;	struct hiddev *hiddev = list->hiddev;	struct hid_device *hid = hiddev->hid;	struct usb_device *dev = hid_to_usb_dev(hid);	struct hiddev_collection_info cinfo;	struct hiddev_report_info rinfo;	struct hiddev_field_info finfo;	struct hiddev_usage_ref_multi *uref_multi = NULL;	struct hiddev_usage_ref *uref;	struct hiddev_devinfo dinfo;	struct hid_report *report;	struct hid_field *field;	struct usbhid_device *usbhid = hid->driver_data;	void __user *user_arg = (void __user *)arg;	int i; 	if (!hiddev->exist)		return -EIO; 	switch (cmd) { 	case HIDIOCGVERSION:		return put_user(HID_VERSION, (int __user *)arg); 	case HIDIOCAPPLICATION:		if (arg < 0 || arg >= hid->maxapplication)			return -EINVAL; 		for (i = 0; i < hid->maxcollection; i++)			if (hid->collection[i].type ==			    HID_COLLECTION_APPLICATION && arg-- == 0)				break; 		if (i == hid->maxcollection)			return -EINVAL; 		return hid->collection[i].usage; 	case HIDIOCGDEVINFO:		dinfo.bustype = BUS_USB;		dinfo.busnum = dev->bus->busnum;		dinfo.devnum = dev->devnum;		dinfo.ifnum = usbhid->ifnum;		dinfo.vendor = le16_to_cpu(dev->descriptor.idVendor);		dinfo.product = le16_to_cpu(dev->descriptor.idProduct);		dinfo.version = le16_to_cpu(dev->descriptor.bcdDevice);		dinfo.num_applications = hid->maxapplication;		if (copy_to_user(user_arg, &dinfo, sizeof(dinfo)))			return -EFAULT; 		return 0; 	case HIDIOCGFLAG:		if (put_user(list->flags, (int __user *)arg))			return -EFAULT; 		return 0; 	case HIDIOCSFLAG:		{			int newflags;			if (get_user(newflags, (int __user *)arg))				return -EFAULT; 			if ((newflags & ~HIDDEV_FLAGS) != 0 ||			    ((newflags & HIDDEV_FLAG_REPORT) != 0 &&			     (newflags & HIDDEV_FLAG_UREF) == 0))				return -EINVAL; 			list->flags = newflags; 			return 0;		} 	case HIDIOCGSTRING:		{			int idx, len;			char *buf; 			if (get_user(idx, (int __user *)arg))				return -EFAULT; 			if ((buf = kmalloc(HID_STRING_SIZE, GFP_KERNEL)) == NULL)				return -ENOMEM; 			if ((len = usb_string(dev, idx, buf, HID_STRING_SIZE-1)) < 0) {				kfree(buf);				return -EINVAL;			} 			if (copy_to_user(user_arg+sizeof(int), buf, len+1)) {				kfree(buf);				return -EFAULT;			} 			kfree(buf); 			return len;		} 	case HIDIOCINITREPORT:		usbhid_init_reports(hid); 		return 0; 	case HIDIOCGREPORT:		if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))			return -EFAULT; 		if (rinfo.report_type == HID_REPORT_TYPE_OUTPUT)			return -EINVAL; 		if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)			return -EINVAL; 		usbhid_submit_report(hid, report, USB_DIR_IN);		usbhid_wait_io(hid);

Lines 1–500 of 847.