📄 hiddev.c
字号:
/* * 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> */#define HIDDEV_MINOR_BASE 96#define HIDDEV_MINORS 16#define HIDDEV_BUFFER_SIZE 64#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 "hid.h"#include <linux/hiddev.h>struct hiddev { int exist; int open; int minor; wait_queue_head_t wait; devfs_handle_t devfs; struct hid_device *hid; struct hiddev_list *list;};struct hiddev_list { struct hiddev_event buffer[HIDDEV_BUFFER_SIZE]; int head; int tail; struct fasync_struct *fasync; struct hiddev *hiddev; struct hiddev_list *next;};static struct hiddev *hiddev_table[HIDDEV_MINORS];static devfs_handle_t hiddev_devfs_handle;/* * 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){ struct hid_report_enum *report_enum; 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); if ((rinfo->report_id & ~HID_REPORT_ID_MASK) != 0) { switch (rinfo->report_id & ~HID_REPORT_ID_MASK) { case HID_REPORT_ID_FIRST: list = report_enum->report_list.next; if (list == &report_enum->report_list) return NULL; rinfo->report_id = ((struct hid_report *) list)->id; break; case HID_REPORT_ID_NEXT: list = (struct list_head *) report_enum->report_id_hash[rinfo->report_id & HID_REPORT_ID_MASK]; if (list == NULL) return NULL; list = list->next; if (list == &report_enum->report_list) return NULL; rinfo->report_id = ((struct hid_report *) list)->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 list_head *list; 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 = report_enum->report_list.next; while (list != &report_enum->report_list) { report = (struct hid_report *) 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; } } } list = list->next; } return NULL;}/* * 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, unsigned int usage, int value){ struct hiddev *hiddev = hid->hiddev; struct hiddev_list *list = hiddev->list; while (list) { list->buffer[list->head].hid = usage; list->buffer[list->head].value = value; list->head = (list->head + 1) & (HIDDEV_BUFFER_SIZE - 1); kill_fasync(&list->fasync, SIGIO, POLL_IN); list = list->next; } wake_up_interruptible(&hiddev->wait);}/* * 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;}/* * De-allocate a hiddev structure */static void hiddev_cleanup(struct hiddev *hiddev){ devfs_unregister(hiddev->devfs); hiddev_table[hiddev->minor] = NULL; kfree(hiddev);}/* * release file op */static int hiddev_release(struct inode * inode, struct file * file){ struct hiddev_list *list = file->private_data; struct hiddev_list **listptr; lock_kernel(); listptr = &list->hiddev->list; hiddev_fasync(-1, file, 0); while (*listptr && (*listptr != list)) listptr = &((*listptr)->next); *listptr = (*listptr)->next; if (!--list->hiddev->open) { if (list->hiddev->exist) hid_close(list->hiddev->hid); else hiddev_cleanup(list->hiddev); } kfree(list); unlock_kernel(); return 0;}/* * open file op */static int hiddev_open(struct inode * inode, struct file * file) { struct hiddev_list *list; int i = MINOR(inode->i_rdev) - HIDDEV_MINOR_BASE; if (i >= HIDDEV_MINORS || !hiddev_table[i]) return -ENODEV; if (!(list = kmalloc(sizeof(struct hiddev_list), GFP_KERNEL))) return -ENOMEM; memset(list, 0, sizeof(struct hiddev_list)); list->hiddev = hiddev_table[i]; list->next = hiddev_table[i]->list; hiddev_table[i]->list = list; file->private_data = list; if (!list->hiddev->open++) if (list->hiddev->exist) hid_open(hiddev_table[i]->hid); return 0;}/* * "write" file op */static ssize_t hiddev_write(struct file * file, const char * buffer, size_t count, loff_t *ppos){ return -EINVAL;}/* * "read" file op */static ssize_t hiddev_read(struct file * file, char * buffer, size_t count, loff_t *ppos){ DECLARE_WAITQUEUE(wait, current); struct hiddev_list *list = file->private_data; int 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_RUNNING); remove_wait_queue(&list->hiddev->wait, &wait); } if (retval) return retval; while (list->head != list->tail && retval + sizeof(struct hiddev_event) <= count) { if (copy_to_user(buffer + retval, list->buffer + list->tail, sizeof(struct hiddev_event))) return -EFAULT; list->tail = (list->tail + 1) & (HIDDEV_BUFFER_SIZE - 1); retval += sizeof(struct hiddev_event); } 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;}#define GET_TIMEOUT 3#define SET_TIMEOUT 3/* * "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->dev; struct hiddev_report_info rinfo; struct hiddev_usage_ref uref; struct hid_report *report; struct hid_field *field; if (!hiddev->exist) return -EIO; switch (cmd) {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -