hiddev.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887
  1. /*
  2. * Copyright (c) 2001 Paul Stewart
  3. * Copyright (c) 2001 Vojtech Pavlik
  4. *
  5. * HID char devices, giving access to raw HID device events.
  6. *
  7. */
  8. /*
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License as published by
  11. * the Free Software Foundation; either version 2 of the License, or
  12. * (at your option) any later version.
  13. *
  14. * This program is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  17. * GNU General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU General Public License
  20. * along with this program; if not, write to the Free Software
  21. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  22. *
  23. * Should you need to contact me, the author, you can do so either by
  24. * e-mail - mail your message to Paul Stewart <stewart@wetlogic.net>
  25. */
  26. #include <linux/poll.h>
  27. #include <linux/slab.h>
  28. #include <linux/module.h>
  29. #include <linux/init.h>
  30. #include <linux/smp_lock.h>
  31. #include <linux/input.h>
  32. #include <linux/usb.h>
  33. #include <linux/hid.h>
  34. #include <linux/hiddev.h>
  35. #include <linux/compat.h>
  36. #include "usbhid.h"
  37. #ifdef CONFIG_USB_DYNAMIC_MINORS
  38. #define HIDDEV_MINOR_BASE 0
  39. #define HIDDEV_MINORS 256
  40. #else
  41. #define HIDDEV_MINOR_BASE 96
  42. #define HIDDEV_MINORS 16
  43. #endif
  44. #define HIDDEV_BUFFER_SIZE 64
  45. struct hiddev {
  46. int exist;
  47. int open;
  48. wait_queue_head_t wait;
  49. struct hid_device *hid;
  50. struct list_head list;
  51. spinlock_t list_lock;
  52. };
  53. struct hiddev_list {
  54. struct hiddev_usage_ref buffer[HIDDEV_BUFFER_SIZE];
  55. int head;
  56. int tail;
  57. unsigned flags;
  58. struct fasync_struct *fasync;
  59. struct hiddev *hiddev;
  60. struct list_head node;
  61. };
  62. static struct hiddev *hiddev_table[HIDDEV_MINORS];
  63. /*
  64. * Find a report, given the report's type and ID. The ID can be specified
  65. * indirectly by REPORT_ID_FIRST (which returns the first report of the given
  66. * type) or by (REPORT_ID_NEXT | old_id), which returns the next report of the
  67. * given type which follows old_id.
  68. */
  69. static struct hid_report *
  70. hiddev_lookup_report(struct hid_device *hid, struct hiddev_report_info *rinfo)
  71. {
  72. unsigned int flags = rinfo->report_id & ~HID_REPORT_ID_MASK;
  73. unsigned int rid = rinfo->report_id & HID_REPORT_ID_MASK;
  74. struct hid_report_enum *report_enum;
  75. struct hid_report *report;
  76. struct list_head *list;
  77. if (rinfo->report_type < HID_REPORT_TYPE_MIN ||
  78. rinfo->report_type > HID_REPORT_TYPE_MAX)
  79. return NULL;
  80. report_enum = hid->report_enum +
  81. (rinfo->report_type - HID_REPORT_TYPE_MIN);
  82. switch (flags) {
  83. case 0: /* Nothing to do -- report_id is already set correctly */
  84. break;
  85. case HID_REPORT_ID_FIRST:
  86. if (list_empty(&report_enum->report_list))
  87. return NULL;
  88. list = report_enum->report_list.next;
  89. report = list_entry(list, struct hid_report, list);
  90. rinfo->report_id = report->id;
  91. break;
  92. case HID_REPORT_ID_NEXT:
  93. report = report_enum->report_id_hash[rid];
  94. if (!report)
  95. return NULL;
  96. list = report->list.next;
  97. if (list == &report_enum->report_list)
  98. return NULL;
  99. report = list_entry(list, struct hid_report, list);
  100. rinfo->report_id = report->id;
  101. break;
  102. default:
  103. return NULL;
  104. }
  105. return report_enum->report_id_hash[rinfo->report_id];
  106. }
  107. /*
  108. * Perform an exhaustive search of the report table for a usage, given its
  109. * type and usage id.
  110. */
  111. static struct hid_field *
  112. hiddev_lookup_usage(struct hid_device *hid, struct hiddev_usage_ref *uref)
  113. {
  114. int i, j;
  115. struct hid_report *report;
  116. struct hid_report_enum *report_enum;
  117. struct hid_field *field;
  118. if (uref->report_type < HID_REPORT_TYPE_MIN ||
  119. uref->report_type > HID_REPORT_TYPE_MAX)
  120. return NULL;
  121. report_enum = hid->report_enum +
  122. (uref->report_type - HID_REPORT_TYPE_MIN);
  123. list_for_each_entry(report, &report_enum->report_list, list) {
  124. for (i = 0; i < report->maxfield; i++) {
  125. field = report->field[i];
  126. for (j = 0; j < field->maxusage; j++) {
  127. if (field->usage[j].hid == uref->usage_code) {
  128. uref->report_id = report->id;
  129. uref->field_index = i;
  130. uref->usage_index = j;
  131. return field;
  132. }
  133. }
  134. }
  135. }
  136. return NULL;
  137. }
  138. static void hiddev_send_event(struct hid_device *hid,
  139. struct hiddev_usage_ref *uref)
  140. {
  141. struct hiddev *hiddev = hid->hiddev;
  142. struct hiddev_list *list;
  143. unsigned long flags;
  144. spin_lock_irqsave(&hiddev->list_lock, flags);
  145. list_for_each_entry(list, &hiddev->list, node) {
  146. if (uref->field_index != HID_FIELD_INDEX_NONE ||
  147. (list->flags & HIDDEV_FLAG_REPORT) != 0) {
  148. list->buffer[list->head] = *uref;
  149. list->head = (list->head + 1) &
  150. (HIDDEV_BUFFER_SIZE - 1);
  151. kill_fasync(&list->fasync, SIGIO, POLL_IN);
  152. }
  153. }
  154. spin_unlock_irqrestore(&hiddev->list_lock, flags);
  155. wake_up_interruptible(&hiddev->wait);
  156. }
  157. /*
  158. * This is where hid.c calls into hiddev to pass an event that occurred over
  159. * the interrupt pipe
  160. */
  161. void hiddev_hid_event(struct hid_device *hid, struct hid_field *field,
  162. struct hid_usage *usage, __s32 value)
  163. {
  164. unsigned type = field->report_type;
  165. struct hiddev_usage_ref uref;
  166. uref.report_type =
  167. (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :
  168. ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :
  169. ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));
  170. uref.report_id = field->report->id;
  171. uref.field_index = field->index;
  172. uref.usage_index = (usage - field->usage);
  173. uref.usage_code = usage->hid;
  174. uref.value = value;
  175. hiddev_send_event(hid, &uref);
  176. }
  177. EXPORT_SYMBOL_GPL(hiddev_hid_event);
  178. void hiddev_report_event(struct hid_device *hid, struct hid_report *report)
  179. {
  180. unsigned type = report->type;
  181. struct hiddev_usage_ref uref;
  182. memset(&uref, 0, sizeof(uref));
  183. uref.report_type =
  184. (type == HID_INPUT_REPORT) ? HID_REPORT_TYPE_INPUT :
  185. ((type == HID_OUTPUT_REPORT) ? HID_REPORT_TYPE_OUTPUT :
  186. ((type == HID_FEATURE_REPORT) ? HID_REPORT_TYPE_FEATURE : 0));
  187. uref.report_id = report->id;
  188. uref.field_index = HID_FIELD_INDEX_NONE;
  189. hiddev_send_event(hid, &uref);
  190. }
  191. /*
  192. * fasync file op
  193. */
  194. static int hiddev_fasync(int fd, struct file *file, int on)
  195. {
  196. int retval;
  197. struct hiddev_list *list = file->private_data;
  198. retval = fasync_helper(fd, file, on, &list->fasync);
  199. return retval < 0 ? retval : 0;
  200. }
  201. /*
  202. * release file op
  203. */
  204. static int hiddev_release(struct inode * inode, struct file * file)
  205. {
  206. struct hiddev_list *list = file->private_data;
  207. unsigned long flags;
  208. hiddev_fasync(-1, file, 0);
  209. spin_lock_irqsave(&list->hiddev->list_lock, flags);
  210. list_del(&list->node);
  211. spin_unlock_irqrestore(&list->hiddev->list_lock, flags);
  212. if (!--list->hiddev->open) {
  213. if (list->hiddev->exist)
  214. usbhid_close(list->hiddev->hid);
  215. else
  216. kfree(list->hiddev);
  217. }
  218. kfree(list);
  219. return 0;
  220. }
  221. /*
  222. * open file op
  223. */
  224. static int hiddev_open(struct inode *inode, struct file *file)
  225. {
  226. struct hiddev_list *list;
  227. unsigned long flags;
  228. int i = iminor(inode) - HIDDEV_MINOR_BASE;
  229. if (i >= HIDDEV_MINORS || !hiddev_table[i])
  230. return -ENODEV;
  231. if (!(list = kzalloc(sizeof(struct hiddev_list), GFP_KERNEL)))
  232. return -ENOMEM;
  233. list->hiddev = hiddev_table[i];
  234. spin_lock_irqsave(&list->hiddev->list_lock, flags);
  235. list_add_tail(&list->node, &hiddev_table[i]->list);
  236. spin_unlock_irqrestore(&list->hiddev->list_lock, flags);
  237. file->private_data = list;
  238. if (!list->hiddev->open++)
  239. if (list->hiddev->exist)
  240. usbhid_open(hiddev_table[i]->hid);
  241. return 0;
  242. }
  243. /*
  244. * "write" file op
  245. */
  246. static ssize_t hiddev_write(struct file * file, const char __user * buffer, size_t count, loff_t *ppos)
  247. {
  248. return -EINVAL;
  249. }
  250. /*
  251. * "read" file op
  252. */
  253. static ssize_t hiddev_read(struct file * file, char __user * buffer, size_t count, loff_t *ppos)
  254. {
  255. DECLARE_WAITQUEUE(wait, current);
  256. struct hiddev_list *list = file->private_data;
  257. int event_size;
  258. int retval = 0;
  259. event_size = ((list->flags & HIDDEV_FLAG_UREF) != 0) ?
  260. sizeof(struct hiddev_usage_ref) : sizeof(struct hiddev_event);
  261. if (count < event_size)
  262. return 0;
  263. while (retval == 0) {
  264. if (list->head == list->tail) {
  265. add_wait_queue(&list->hiddev->wait, &wait);
  266. set_current_state(TASK_INTERRUPTIBLE);
  267. while (list->head == list->tail) {
  268. if (file->f_flags & O_NONBLOCK) {
  269. retval = -EAGAIN;
  270. break;
  271. }
  272. if (signal_pending(current)) {
  273. retval = -ERESTARTSYS;
  274. break;
  275. }
  276. if (!list->hiddev->exist) {
  277. retval = -EIO;
  278. break;
  279. }
  280. schedule();
  281. set_current_state(TASK_INTERRUPTIBLE);
  282. }
  283. set_current_state(TASK_RUNNING);
  284. remove_wait_queue(&list->hiddev->wait, &wait);
  285. }
  286. if (retval)
  287. return retval;
  288. while (list->head != list->tail &&
  289. retval + event_size <= count) {
  290. if ((list->flags & HIDDEV_FLAG_UREF) == 0) {
  291. if (list->buffer[list->tail].field_index !=
  292. HID_FIELD_INDEX_NONE) {
  293. struct hiddev_event event;
  294. event.hid = list->buffer[list->tail].usage_code;
  295. event.value = list->buffer[list->tail].value;
  296. if (copy_to_user(buffer + retval, &event, sizeof(struct hiddev_event)))
  297. return -EFAULT;
  298. retval += sizeof(struct hiddev_event);
  299. }
  300. } else {
  301. if (list->buffer[list->tail].field_index != HID_FIELD_INDEX_NONE ||
  302. (list->flags & HIDDEV_FLAG_REPORT) != 0) {
  303. if (copy_to_user(buffer + retval, list->buffer + list->tail, sizeof(struct hiddev_usage_ref)))
  304. return -EFAULT;
  305. retval += sizeof(struct hiddev_usage_ref);
  306. }
  307. }
  308. list->tail = (list->tail + 1) & (HIDDEV_BUFFER_SIZE - 1);
  309. }
  310. }
  311. return retval;
  312. }
  313. /*
  314. * "poll" file op
  315. * No kernel lock - fine
  316. */
  317. static unsigned int hiddev_poll(struct file *file, poll_table *wait)
  318. {
  319. struct hiddev_list *list = file->private_data;
  320. poll_wait(file, &list->hiddev->wait, wait);
  321. if (list->head != list->tail)
  322. return POLLIN | POLLRDNORM;
  323. if (!list->hiddev->exist)
  324. return POLLERR | POLLHUP;
  325. return 0;
  326. }
  327. /*
  328. * "ioctl" file op
  329. */
  330. static noinline int hiddev_ioctl_usage(struct hiddev *hiddev, unsigned int cmd, void __user *user_arg)
  331. {
  332. struct hid_device *hid = hiddev->hid;
  333. struct hiddev_report_info rinfo;
  334. struct hiddev_usage_ref_multi *uref_multi = NULL;
  335. struct hiddev_usage_ref *uref;
  336. struct hid_report *report;
  337. struct hid_field *field;
  338. int i;
  339. uref_multi = kmalloc(sizeof(struct hiddev_usage_ref_multi), GFP_KERNEL);
  340. if (!uref_multi)
  341. return -ENOMEM;
  342. uref = &uref_multi->uref;
  343. if (cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) {
  344. if (copy_from_user(uref_multi, user_arg,
  345. sizeof(*uref_multi)))
  346. goto fault;
  347. } else {
  348. if (copy_from_user(uref, user_arg, sizeof(*uref)))
  349. goto fault;
  350. }
  351. switch (cmd) {
  352. case HIDIOCGUCODE:
  353. rinfo.report_type = uref->report_type;
  354. rinfo.report_id = uref->report_id;
  355. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  356. goto inval;
  357. if (uref->field_index >= report->maxfield)
  358. goto inval;
  359. field = report->field[uref->field_index];
  360. if (uref->usage_index >= field->maxusage)
  361. goto inval;
  362. uref->usage_code = field->usage[uref->usage_index].hid;
  363. if (copy_to_user(user_arg, uref, sizeof(*uref)))
  364. goto fault;
  365. kfree(uref_multi);
  366. return 0;
  367. default:
  368. if (cmd != HIDIOCGUSAGE &&
  369. cmd != HIDIOCGUSAGES &&
  370. uref->report_type == HID_REPORT_TYPE_INPUT)
  371. goto inval;
  372. if (uref->report_id == HID_REPORT_ID_UNKNOWN) {
  373. field = hiddev_lookup_usage(hid, uref);
  374. if (field == NULL)
  375. goto inval;
  376. } else {
  377. rinfo.report_type = uref->report_type;
  378. rinfo.report_id = uref->report_id;
  379. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  380. goto inval;
  381. if (uref->field_index >= report->maxfield)
  382. goto inval;
  383. field = report->field[uref->field_index];
  384. if (cmd == HIDIOCGCOLLECTIONINDEX) {
  385. if (uref->usage_index >= field->maxusage)
  386. goto inval;
  387. } else if (uref->usage_index >= field->report_count)
  388. goto inval;
  389. else if ((cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) &&
  390. (uref_multi->num_values > HID_MAX_MULTI_USAGES ||
  391. uref->usage_index + uref_multi->num_values > field->report_count))
  392. goto inval;
  393. }
  394. switch (cmd) {
  395. case HIDIOCGUSAGE:
  396. uref->value = field->value[uref->usage_index];
  397. if (copy_to_user(user_arg, uref, sizeof(*uref)))
  398. goto fault;
  399. goto goodreturn;
  400. case HIDIOCSUSAGE:
  401. field->value[uref->usage_index] = uref->value;
  402. goto goodreturn;
  403. case HIDIOCGCOLLECTIONINDEX:
  404. kfree(uref_multi);
  405. return field->usage[uref->usage_index].collection_index;
  406. case HIDIOCGUSAGES:
  407. for (i = 0; i < uref_multi->num_values; i++)
  408. uref_multi->values[i] =
  409. field->value[uref->usage_index + i];
  410. if (copy_to_user(user_arg, uref_multi,
  411. sizeof(*uref_multi)))
  412. goto fault;
  413. goto goodreturn;
  414. case HIDIOCSUSAGES:
  415. for (i = 0; i < uref_multi->num_values; i++)
  416. field->value[uref->usage_index + i] =
  417. uref_multi->values[i];
  418. goto goodreturn;
  419. }
  420. goodreturn:
  421. kfree(uref_multi);
  422. return 0;
  423. fault:
  424. kfree(uref_multi);
  425. return -EFAULT;
  426. inval:
  427. kfree(uref_multi);
  428. return -EINVAL;
  429. }
  430. }
  431. static noinline int hiddev_ioctl_string(struct hiddev *hiddev, unsigned int cmd, void __user *user_arg)
  432. {
  433. struct hid_device *hid = hiddev->hid;
  434. struct usb_device *dev = hid_to_usb_dev(hid);
  435. int idx, len;
  436. char *buf;
  437. if (get_user(idx, (int __user *)user_arg))
  438. return -EFAULT;
  439. if ((buf = kmalloc(HID_STRING_SIZE, GFP_KERNEL)) == NULL)
  440. return -ENOMEM;
  441. if ((len = usb_string(dev, idx, buf, HID_STRING_SIZE-1)) < 0) {
  442. kfree(buf);
  443. return -EINVAL;
  444. }
  445. if (copy_to_user(user_arg+sizeof(int), buf, len+1)) {
  446. kfree(buf);
  447. return -EFAULT;
  448. }
  449. kfree(buf);
  450. return len;
  451. }
  452. static int hiddev_ioctl(struct inode *inode, struct file *file, unsigned int cmd, unsigned long arg)
  453. {
  454. struct hiddev_list *list = file->private_data;
  455. struct hiddev *hiddev = list->hiddev;
  456. struct hid_device *hid = hiddev->hid;
  457. struct usb_device *dev = hid_to_usb_dev(hid);
  458. struct hiddev_collection_info cinfo;
  459. struct hiddev_report_info rinfo;
  460. struct hiddev_field_info finfo;
  461. struct hiddev_devinfo dinfo;
  462. struct hid_report *report;
  463. struct hid_field *field;
  464. struct usbhid_device *usbhid = hid->driver_data;
  465. void __user *user_arg = (void __user *)arg;
  466. int i;
  467. if (!hiddev->exist)
  468. return -EIO;
  469. switch (cmd) {
  470. case HIDIOCGVERSION:
  471. return put_user(HID_VERSION, (int __user *)arg);
  472. case HIDIOCAPPLICATION:
  473. if (arg < 0 || arg >= hid->maxapplication)
  474. return -EINVAL;
  475. for (i = 0; i < hid->maxcollection; i++)
  476. if (hid->collection[i].type ==
  477. HID_COLLECTION_APPLICATION && arg-- == 0)
  478. break;
  479. if (i == hid->maxcollection)
  480. return -EINVAL;
  481. return hid->collection[i].usage;
  482. case HIDIOCGDEVINFO:
  483. dinfo.bustype = BUS_USB;
  484. dinfo.busnum = dev->bus->busnum;
  485. dinfo.devnum = dev->devnum;
  486. dinfo.ifnum = usbhid->ifnum;
  487. dinfo.vendor = le16_to_cpu(dev->descriptor.idVendor);
  488. dinfo.product = le16_to_cpu(dev->descriptor.idProduct);
  489. dinfo.version = le16_to_cpu(dev->descriptor.bcdDevice);
  490. dinfo.num_applications = hid->maxapplication;
  491. if (copy_to_user(user_arg, &dinfo, sizeof(dinfo)))
  492. return -EFAULT;
  493. return 0;
  494. case HIDIOCGFLAG:
  495. if (put_user(list->flags, (int __user *)arg))
  496. return -EFAULT;
  497. return 0;
  498. case HIDIOCSFLAG:
  499. {
  500. int newflags;
  501. if (get_user(newflags, (int __user *)arg))
  502. return -EFAULT;
  503. if ((newflags & ~HIDDEV_FLAGS) != 0 ||
  504. ((newflags & HIDDEV_FLAG_REPORT) != 0 &&
  505. (newflags & HIDDEV_FLAG_UREF) == 0))
  506. return -EINVAL;
  507. list->flags = newflags;
  508. return 0;
  509. }
  510. case HIDIOCGSTRING:
  511. return hiddev_ioctl_string(hiddev, cmd, user_arg);
  512. case HIDIOCINITREPORT:
  513. usbhid_init_reports(hid);
  514. return 0;
  515. case HIDIOCGREPORT:
  516. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  517. return -EFAULT;
  518. if (rinfo.report_type == HID_REPORT_TYPE_OUTPUT)
  519. return -EINVAL;
  520. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  521. return -EINVAL;
  522. usbhid_submit_report(hid, report, USB_DIR_IN);
  523. usbhid_wait_io(hid);
  524. return 0;
  525. case HIDIOCSREPORT:
  526. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  527. return -EFAULT;
  528. if (rinfo.report_type == HID_REPORT_TYPE_INPUT)
  529. return -EINVAL;
  530. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  531. return -EINVAL;
  532. usbhid_submit_report(hid, report, USB_DIR_OUT);
  533. usbhid_wait_io(hid);
  534. return 0;
  535. case HIDIOCGREPORTINFO:
  536. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  537. return -EFAULT;
  538. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  539. return -EINVAL;
  540. rinfo.num_fields = report->maxfield;
  541. if (copy_to_user(user_arg, &rinfo, sizeof(rinfo)))
  542. return -EFAULT;
  543. return 0;
  544. case HIDIOCGFIELDINFO:
  545. if (copy_from_user(&finfo, user_arg, sizeof(finfo)))
  546. return -EFAULT;
  547. rinfo.report_type = finfo.report_type;
  548. rinfo.report_id = finfo.report_id;
  549. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  550. return -EINVAL;
  551. if (finfo.field_index >= report->maxfield)
  552. return -EINVAL;
  553. field = report->field[finfo.field_index];
  554. memset(&finfo, 0, sizeof(finfo));
  555. finfo.report_type = rinfo.report_type;
  556. finfo.report_id = rinfo.report_id;
  557. finfo.field_index = field->report_count - 1;
  558. finfo.maxusage = field->maxusage;
  559. finfo.flags = field->flags;
  560. finfo.physical = field->physical;
  561. finfo.logical = field->logical;
  562. finfo.application = field->application;
  563. finfo.logical_minimum = field->logical_minimum;
  564. finfo.logical_maximum = field->logical_maximum;
  565. finfo.physical_minimum = field->physical_minimum;
  566. finfo.physical_maximum = field->physical_maximum;
  567. finfo.unit_exponent = field->unit_exponent;
  568. finfo.unit = field->unit;
  569. if (copy_to_user(user_arg, &finfo, sizeof(finfo)))
  570. return -EFAULT;
  571. return 0;
  572. case HIDIOCGUCODE:
  573. /* fall through */
  574. case HIDIOCGUSAGE:
  575. case HIDIOCSUSAGE:
  576. case HIDIOCGUSAGES:
  577. case HIDIOCSUSAGES:
  578. case HIDIOCGCOLLECTIONINDEX:
  579. return hiddev_ioctl_usage(hiddev, cmd, user_arg);
  580. case HIDIOCGCOLLECTIONINFO:
  581. if (copy_from_user(&cinfo, user_arg, sizeof(cinfo)))
  582. return -EFAULT;
  583. if (cinfo.index >= hid->maxcollection)
  584. return -EINVAL;
  585. cinfo.type = hid->collection[cinfo.index].type;
  586. cinfo.usage = hid->collection[cinfo.index].usage;
  587. cinfo.level = hid->collection[cinfo.index].level;
  588. if (copy_to_user(user_arg, &cinfo, sizeof(cinfo)))
  589. return -EFAULT;
  590. return 0;
  591. default:
  592. if (_IOC_TYPE(cmd) != 'H' || _IOC_DIR(cmd) != _IOC_READ)
  593. return -EINVAL;
  594. if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGNAME(0))) {
  595. int len;
  596. if (!hid->name)
  597. return 0;
  598. len = strlen(hid->name) + 1;
  599. if (len > _IOC_SIZE(cmd))
  600. len = _IOC_SIZE(cmd);
  601. return copy_to_user(user_arg, hid->name, len) ?
  602. -EFAULT : len;
  603. }
  604. if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGPHYS(0))) {
  605. int len;
  606. if (!hid->phys)
  607. return 0;
  608. len = strlen(hid->phys) + 1;
  609. if (len > _IOC_SIZE(cmd))
  610. len = _IOC_SIZE(cmd);
  611. return copy_to_user(user_arg, hid->phys, len) ?
  612. -EFAULT : len;
  613. }
  614. }
  615. return -EINVAL;
  616. }
  617. #ifdef CONFIG_COMPAT
  618. static long hiddev_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  619. {
  620. struct inode *inode = file->f_path.dentry->d_inode;
  621. return hiddev_ioctl(inode, file, cmd, (unsigned long)compat_ptr(arg));
  622. }
  623. #endif
  624. static const struct file_operations hiddev_fops = {
  625. .owner = THIS_MODULE,
  626. .read = hiddev_read,
  627. .write = hiddev_write,
  628. .poll = hiddev_poll,
  629. .open = hiddev_open,
  630. .release = hiddev_release,
  631. .ioctl = hiddev_ioctl,
  632. .fasync = hiddev_fasync,
  633. #ifdef CONFIG_COMPAT
  634. .compat_ioctl = hiddev_compat_ioctl,
  635. #endif
  636. };
  637. static struct usb_class_driver hiddev_class = {
  638. .name = "hiddev%d",
  639. .fops = &hiddev_fops,
  640. .minor_base = HIDDEV_MINOR_BASE,
  641. };
  642. /*
  643. * This is where hid.c calls us to connect a hid device to the hiddev driver
  644. */
  645. int hiddev_connect(struct hid_device *hid)
  646. {
  647. struct hiddev *hiddev;
  648. struct usbhid_device *usbhid = hid->driver_data;
  649. int i;
  650. int retval;
  651. for (i = 0; i < hid->maxcollection; i++)
  652. if (hid->collection[i].type ==
  653. HID_COLLECTION_APPLICATION &&
  654. !IS_INPUT_APPLICATION(hid->collection[i].usage))
  655. break;
  656. if (i == hid->maxcollection && (hid->quirks & HID_QUIRK_HIDDEV) == 0)
  657. return -1;
  658. if (!(hiddev = kzalloc(sizeof(struct hiddev), GFP_KERNEL)))
  659. return -1;
  660. retval = usb_register_dev(usbhid->intf, &hiddev_class);
  661. if (retval) {
  662. err_hid("Not able to get a minor for this device.");
  663. kfree(hiddev);
  664. return -1;
  665. }
  666. init_waitqueue_head(&hiddev->wait);
  667. INIT_LIST_HEAD(&hiddev->list);
  668. spin_lock_init(&hiddev->list_lock);
  669. hiddev->hid = hid;
  670. hiddev->exist = 1;
  671. hid->minor = usbhid->intf->minor;
  672. hid->hiddev = hiddev;
  673. hiddev_table[usbhid->intf->minor - HIDDEV_MINOR_BASE] = hiddev;
  674. return 0;
  675. }
  676. /*
  677. * This is where hid.c calls us to disconnect a hiddev device from the
  678. * corresponding hid device (usually because the usb device has disconnected)
  679. */
  680. static struct usb_class_driver hiddev_class;
  681. void hiddev_disconnect(struct hid_device *hid)
  682. {
  683. struct hiddev *hiddev = hid->hiddev;
  684. struct usbhid_device *usbhid = hid->driver_data;
  685. hiddev->exist = 0;
  686. hiddev_table[hiddev->hid->minor - HIDDEV_MINOR_BASE] = NULL;
  687. usb_deregister_dev(usbhid->intf, &hiddev_class);
  688. if (hiddev->open) {
  689. usbhid_close(hiddev->hid);
  690. wake_up_interruptible(&hiddev->wait);
  691. } else {
  692. kfree(hiddev);
  693. }
  694. }
  695. /* Currently this driver is a USB driver. It's not a conventional one in
  696. * the sense that it doesn't probe at the USB level. Instead it waits to
  697. * be connected by HID through the hiddev_connect / hiddev_disconnect
  698. * routines. The reason to register as a USB device is to gain part of the
  699. * minor number space from the USB major.
  700. *
  701. * In theory, should the HID code be generalized to more than one physical
  702. * medium (say, IEEE 1384), this driver will probably need to register its
  703. * own major number, and in doing so, no longer need to register with USB.
  704. * At that point the probe routine and hiddev_driver struct below will no
  705. * longer be useful.
  706. */
  707. /* We never attach in this manner, and rely on HID to connect us. This
  708. * is why there is no disconnect routine defined in the usb_driver either.
  709. */
  710. static int hiddev_usbd_probe(struct usb_interface *intf,
  711. const struct usb_device_id *hiddev_info)
  712. {
  713. return -ENODEV;
  714. }
  715. static /* const */ struct usb_driver hiddev_driver = {
  716. .name = "hiddev",
  717. .probe = hiddev_usbd_probe,
  718. };
  719. int __init hiddev_init(void)
  720. {
  721. return usb_register(&hiddev_driver);
  722. }
  723. void hiddev_exit(void)
  724. {
  725. usb_deregister(&hiddev_driver);
  726. }