hiddev.c 23 KB

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