hiddev.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974
  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 2048
  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. struct hiddev_list *list = file->private_data;
  199. return fasync_helper(fd, file, on, &list->fasync);
  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. spin_lock_irqsave(&list->hiddev->list_lock, flags);
  209. list_del(&list->node);
  210. spin_unlock_irqrestore(&list->hiddev->list_lock, flags);
  211. if (!--list->hiddev->open) {
  212. if (list->hiddev->exist) {
  213. usbhid_close(list->hiddev->hid);
  214. usbhid_put_power(list->hiddev->hid);
  215. } else {
  216. kfree(list->hiddev);
  217. }
  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. if (!list->hiddev->open++)
  257. if (list->hiddev->exist) {
  258. struct hid_device *hid = hiddev_table[i]->hid;
  259. res = usbhid_get_power(hid);
  260. if (res < 0) {
  261. res = -EIO;
  262. goto bail;
  263. }
  264. usbhid_open(hid);
  265. }
  266. return 0;
  267. bail:
  268. file->private_data = NULL;
  269. kfree(list);
  270. return res;
  271. }
  272. /*
  273. * "write" file op
  274. */
  275. static ssize_t hiddev_write(struct file * file, const char __user * buffer, size_t count, loff_t *ppos)
  276. {
  277. return -EINVAL;
  278. }
  279. /*
  280. * "read" file op
  281. */
  282. static ssize_t hiddev_read(struct file * file, char __user * buffer, size_t count, loff_t *ppos)
  283. {
  284. DEFINE_WAIT(wait);
  285. struct hiddev_list *list = file->private_data;
  286. int event_size;
  287. int retval;
  288. event_size = ((list->flags & HIDDEV_FLAG_UREF) != 0) ?
  289. sizeof(struct hiddev_usage_ref) : sizeof(struct hiddev_event);
  290. if (count < event_size)
  291. return 0;
  292. /* lock against other threads */
  293. retval = mutex_lock_interruptible(&list->thread_lock);
  294. if (retval)
  295. return -ERESTARTSYS;
  296. while (retval == 0) {
  297. if (list->head == list->tail) {
  298. prepare_to_wait(&list->hiddev->wait, &wait, TASK_INTERRUPTIBLE);
  299. while (list->head == list->tail) {
  300. if (file->f_flags & O_NONBLOCK) {
  301. retval = -EAGAIN;
  302. break;
  303. }
  304. if (signal_pending(current)) {
  305. retval = -ERESTARTSYS;
  306. break;
  307. }
  308. if (!list->hiddev->exist) {
  309. retval = -EIO;
  310. break;
  311. }
  312. /* let O_NONBLOCK tasks run */
  313. mutex_unlock(&list->thread_lock);
  314. schedule();
  315. if (mutex_lock_interruptible(&list->thread_lock))
  316. return -EINTR;
  317. set_current_state(TASK_INTERRUPTIBLE);
  318. }
  319. finish_wait(&list->hiddev->wait, &wait);
  320. }
  321. if (retval) {
  322. mutex_unlock(&list->thread_lock);
  323. return retval;
  324. }
  325. while (list->head != list->tail &&
  326. retval + event_size <= count) {
  327. if ((list->flags & HIDDEV_FLAG_UREF) == 0) {
  328. if (list->buffer[list->tail].field_index != HID_FIELD_INDEX_NONE) {
  329. struct hiddev_event event;
  330. event.hid = list->buffer[list->tail].usage_code;
  331. event.value = list->buffer[list->tail].value;
  332. if (copy_to_user(buffer + retval, &event, sizeof(struct hiddev_event))) {
  333. mutex_unlock(&list->thread_lock);
  334. return -EFAULT;
  335. }
  336. retval += sizeof(struct hiddev_event);
  337. }
  338. } else {
  339. if (list->buffer[list->tail].field_index != HID_FIELD_INDEX_NONE ||
  340. (list->flags & HIDDEV_FLAG_REPORT) != 0) {
  341. if (copy_to_user(buffer + retval, list->buffer + list->tail, sizeof(struct hiddev_usage_ref))) {
  342. mutex_unlock(&list->thread_lock);
  343. return -EFAULT;
  344. }
  345. retval += sizeof(struct hiddev_usage_ref);
  346. }
  347. }
  348. list->tail = (list->tail + 1) & (HIDDEV_BUFFER_SIZE - 1);
  349. }
  350. }
  351. mutex_unlock(&list->thread_lock);
  352. return retval;
  353. }
  354. /*
  355. * "poll" file op
  356. * No kernel lock - fine
  357. */
  358. static unsigned int hiddev_poll(struct file *file, poll_table *wait)
  359. {
  360. struct hiddev_list *list = file->private_data;
  361. poll_wait(file, &list->hiddev->wait, wait);
  362. if (list->head != list->tail)
  363. return POLLIN | POLLRDNORM;
  364. if (!list->hiddev->exist)
  365. return POLLERR | POLLHUP;
  366. return 0;
  367. }
  368. /*
  369. * "ioctl" file op
  370. */
  371. static noinline int hiddev_ioctl_usage(struct hiddev *hiddev, unsigned int cmd, void __user *user_arg)
  372. {
  373. struct hid_device *hid = hiddev->hid;
  374. struct hiddev_report_info rinfo;
  375. struct hiddev_usage_ref_multi *uref_multi = NULL;
  376. struct hiddev_usage_ref *uref;
  377. struct hid_report *report;
  378. struct hid_field *field;
  379. int i;
  380. uref_multi = kmalloc(sizeof(struct hiddev_usage_ref_multi), GFP_KERNEL);
  381. if (!uref_multi)
  382. return -ENOMEM;
  383. uref = &uref_multi->uref;
  384. if (cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) {
  385. if (copy_from_user(uref_multi, user_arg,
  386. sizeof(*uref_multi)))
  387. goto fault;
  388. } else {
  389. if (copy_from_user(uref, user_arg, sizeof(*uref)))
  390. goto fault;
  391. }
  392. switch (cmd) {
  393. case HIDIOCGUCODE:
  394. rinfo.report_type = uref->report_type;
  395. rinfo.report_id = uref->report_id;
  396. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  397. goto inval;
  398. if (uref->field_index >= report->maxfield)
  399. goto inval;
  400. field = report->field[uref->field_index];
  401. if (uref->usage_index >= field->maxusage)
  402. goto inval;
  403. uref->usage_code = field->usage[uref->usage_index].hid;
  404. if (copy_to_user(user_arg, uref, sizeof(*uref)))
  405. goto fault;
  406. goto goodreturn;
  407. default:
  408. if (cmd != HIDIOCGUSAGE &&
  409. cmd != HIDIOCGUSAGES &&
  410. uref->report_type == HID_REPORT_TYPE_INPUT)
  411. goto inval;
  412. if (uref->report_id == HID_REPORT_ID_UNKNOWN) {
  413. field = hiddev_lookup_usage(hid, uref);
  414. if (field == NULL)
  415. goto inval;
  416. } else {
  417. rinfo.report_type = uref->report_type;
  418. rinfo.report_id = uref->report_id;
  419. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  420. goto inval;
  421. if (uref->field_index >= report->maxfield)
  422. goto inval;
  423. field = report->field[uref->field_index];
  424. if (cmd == HIDIOCGCOLLECTIONINDEX) {
  425. if (uref->usage_index >= field->maxusage)
  426. goto inval;
  427. } else if (uref->usage_index >= field->report_count)
  428. goto inval;
  429. else if ((cmd == HIDIOCGUSAGES || cmd == HIDIOCSUSAGES) &&
  430. (uref_multi->num_values > HID_MAX_MULTI_USAGES ||
  431. uref->usage_index + uref_multi->num_values > field->report_count))
  432. goto inval;
  433. }
  434. switch (cmd) {
  435. case HIDIOCGUSAGE:
  436. uref->value = field->value[uref->usage_index];
  437. if (copy_to_user(user_arg, uref, sizeof(*uref)))
  438. goto fault;
  439. goto goodreturn;
  440. case HIDIOCSUSAGE:
  441. field->value[uref->usage_index] = uref->value;
  442. goto goodreturn;
  443. case HIDIOCGCOLLECTIONINDEX:
  444. i = field->usage[uref->usage_index].collection_index;
  445. kfree(uref_multi);
  446. return i;
  447. case HIDIOCGUSAGES:
  448. for (i = 0; i < uref_multi->num_values; i++)
  449. uref_multi->values[i] =
  450. field->value[uref->usage_index + i];
  451. if (copy_to_user(user_arg, uref_multi,
  452. sizeof(*uref_multi)))
  453. goto fault;
  454. goto goodreturn;
  455. case HIDIOCSUSAGES:
  456. for (i = 0; i < uref_multi->num_values; i++)
  457. field->value[uref->usage_index + i] =
  458. uref_multi->values[i];
  459. goto goodreturn;
  460. }
  461. goodreturn:
  462. kfree(uref_multi);
  463. return 0;
  464. fault:
  465. kfree(uref_multi);
  466. return -EFAULT;
  467. inval:
  468. kfree(uref_multi);
  469. return -EINVAL;
  470. }
  471. }
  472. static noinline int hiddev_ioctl_string(struct hiddev *hiddev, unsigned int cmd, void __user *user_arg)
  473. {
  474. struct hid_device *hid = hiddev->hid;
  475. struct usb_device *dev = hid_to_usb_dev(hid);
  476. int idx, len;
  477. char *buf;
  478. if (get_user(idx, (int __user *)user_arg))
  479. return -EFAULT;
  480. if ((buf = kmalloc(HID_STRING_SIZE, GFP_KERNEL)) == NULL)
  481. return -ENOMEM;
  482. if ((len = usb_string(dev, idx, buf, HID_STRING_SIZE-1)) < 0) {
  483. kfree(buf);
  484. return -EINVAL;
  485. }
  486. if (copy_to_user(user_arg+sizeof(int), buf, len+1)) {
  487. kfree(buf);
  488. return -EFAULT;
  489. }
  490. kfree(buf);
  491. return len;
  492. }
  493. static long hiddev_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  494. {
  495. struct hiddev_list *list = file->private_data;
  496. struct hiddev *hiddev = list->hiddev;
  497. struct hid_device *hid = hiddev->hid;
  498. struct usb_device *dev = hid_to_usb_dev(hid);
  499. struct hiddev_collection_info cinfo;
  500. struct hiddev_report_info rinfo;
  501. struct hiddev_field_info finfo;
  502. struct hiddev_devinfo dinfo;
  503. struct hid_report *report;
  504. struct hid_field *field;
  505. struct usbhid_device *usbhid = hid->driver_data;
  506. void __user *user_arg = (void __user *)arg;
  507. int i, r;
  508. /* Called without BKL by compat methods so no BKL taken */
  509. /* FIXME: Who or what stop this racing with a disconnect ?? */
  510. if (!hiddev->exist)
  511. return -EIO;
  512. switch (cmd) {
  513. case HIDIOCGVERSION:
  514. return put_user(HID_VERSION, (int __user *)arg);
  515. case HIDIOCAPPLICATION:
  516. if (arg < 0 || arg >= hid->maxapplication)
  517. return -EINVAL;
  518. for (i = 0; i < hid->maxcollection; i++)
  519. if (hid->collection[i].type ==
  520. HID_COLLECTION_APPLICATION && arg-- == 0)
  521. break;
  522. if (i == hid->maxcollection)
  523. return -EINVAL;
  524. return hid->collection[i].usage;
  525. case HIDIOCGDEVINFO:
  526. dinfo.bustype = BUS_USB;
  527. dinfo.busnum = dev->bus->busnum;
  528. dinfo.devnum = dev->devnum;
  529. dinfo.ifnum = usbhid->ifnum;
  530. dinfo.vendor = le16_to_cpu(dev->descriptor.idVendor);
  531. dinfo.product = le16_to_cpu(dev->descriptor.idProduct);
  532. dinfo.version = le16_to_cpu(dev->descriptor.bcdDevice);
  533. dinfo.num_applications = hid->maxapplication;
  534. if (copy_to_user(user_arg, &dinfo, sizeof(dinfo)))
  535. return -EFAULT;
  536. return 0;
  537. case HIDIOCGFLAG:
  538. if (put_user(list->flags, (int __user *)arg))
  539. return -EFAULT;
  540. return 0;
  541. case HIDIOCSFLAG:
  542. {
  543. int newflags;
  544. if (get_user(newflags, (int __user *)arg))
  545. return -EFAULT;
  546. if ((newflags & ~HIDDEV_FLAGS) != 0 ||
  547. ((newflags & HIDDEV_FLAG_REPORT) != 0 &&
  548. (newflags & HIDDEV_FLAG_UREF) == 0))
  549. return -EINVAL;
  550. list->flags = newflags;
  551. return 0;
  552. }
  553. case HIDIOCGSTRING:
  554. mutex_lock(&hiddev->existancelock);
  555. if (hiddev->exist)
  556. r = hiddev_ioctl_string(hiddev, cmd, user_arg);
  557. else
  558. r = -ENODEV;
  559. mutex_unlock(&hiddev->existancelock);
  560. return r;
  561. case HIDIOCINITREPORT:
  562. mutex_lock(&hiddev->existancelock);
  563. if (!hiddev->exist) {
  564. mutex_unlock(&hiddev->existancelock);
  565. return -ENODEV;
  566. }
  567. usbhid_init_reports(hid);
  568. mutex_unlock(&hiddev->existancelock);
  569. return 0;
  570. case HIDIOCGREPORT:
  571. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  572. return -EFAULT;
  573. if (rinfo.report_type == HID_REPORT_TYPE_OUTPUT)
  574. return -EINVAL;
  575. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  576. return -EINVAL;
  577. mutex_lock(&hiddev->existancelock);
  578. if (hiddev->exist) {
  579. usbhid_submit_report(hid, report, USB_DIR_IN);
  580. usbhid_wait_io(hid);
  581. }
  582. mutex_unlock(&hiddev->existancelock);
  583. return 0;
  584. case HIDIOCSREPORT:
  585. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  586. return -EFAULT;
  587. if (rinfo.report_type == HID_REPORT_TYPE_INPUT)
  588. return -EINVAL;
  589. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  590. return -EINVAL;
  591. mutex_lock(&hiddev->existancelock);
  592. if (hiddev->exist) {
  593. usbhid_submit_report(hid, report, USB_DIR_OUT);
  594. usbhid_wait_io(hid);
  595. }
  596. mutex_unlock(&hiddev->existancelock);
  597. return 0;
  598. case HIDIOCGREPORTINFO:
  599. if (copy_from_user(&rinfo, user_arg, sizeof(rinfo)))
  600. return -EFAULT;
  601. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  602. return -EINVAL;
  603. rinfo.num_fields = report->maxfield;
  604. if (copy_to_user(user_arg, &rinfo, sizeof(rinfo)))
  605. return -EFAULT;
  606. return 0;
  607. case HIDIOCGFIELDINFO:
  608. if (copy_from_user(&finfo, user_arg, sizeof(finfo)))
  609. return -EFAULT;
  610. rinfo.report_type = finfo.report_type;
  611. rinfo.report_id = finfo.report_id;
  612. if ((report = hiddev_lookup_report(hid, &rinfo)) == NULL)
  613. return -EINVAL;
  614. if (finfo.field_index >= report->maxfield)
  615. return -EINVAL;
  616. field = report->field[finfo.field_index];
  617. memset(&finfo, 0, sizeof(finfo));
  618. finfo.report_type = rinfo.report_type;
  619. finfo.report_id = rinfo.report_id;
  620. finfo.field_index = field->report_count - 1;
  621. finfo.maxusage = field->maxusage;
  622. finfo.flags = field->flags;
  623. finfo.physical = field->physical;
  624. finfo.logical = field->logical;
  625. finfo.application = field->application;
  626. finfo.logical_minimum = field->logical_minimum;
  627. finfo.logical_maximum = field->logical_maximum;
  628. finfo.physical_minimum = field->physical_minimum;
  629. finfo.physical_maximum = field->physical_maximum;
  630. finfo.unit_exponent = field->unit_exponent;
  631. finfo.unit = field->unit;
  632. if (copy_to_user(user_arg, &finfo, sizeof(finfo)))
  633. return -EFAULT;
  634. return 0;
  635. case HIDIOCGUCODE:
  636. /* fall through */
  637. case HIDIOCGUSAGE:
  638. case HIDIOCSUSAGE:
  639. case HIDIOCGUSAGES:
  640. case HIDIOCSUSAGES:
  641. case HIDIOCGCOLLECTIONINDEX:
  642. mutex_lock(&hiddev->existancelock);
  643. if (hiddev->exist)
  644. r = hiddev_ioctl_usage(hiddev, cmd, user_arg);
  645. else
  646. r = -ENODEV;
  647. mutex_unlock(&hiddev->existancelock);
  648. return r;
  649. case HIDIOCGCOLLECTIONINFO:
  650. if (copy_from_user(&cinfo, user_arg, sizeof(cinfo)))
  651. return -EFAULT;
  652. if (cinfo.index >= hid->maxcollection)
  653. return -EINVAL;
  654. cinfo.type = hid->collection[cinfo.index].type;
  655. cinfo.usage = hid->collection[cinfo.index].usage;
  656. cinfo.level = hid->collection[cinfo.index].level;
  657. if (copy_to_user(user_arg, &cinfo, sizeof(cinfo)))
  658. return -EFAULT;
  659. return 0;
  660. default:
  661. if (_IOC_TYPE(cmd) != 'H' || _IOC_DIR(cmd) != _IOC_READ)
  662. return -EINVAL;
  663. if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGNAME(0))) {
  664. int len;
  665. if (!hid->name)
  666. return 0;
  667. len = strlen(hid->name) + 1;
  668. if (len > _IOC_SIZE(cmd))
  669. len = _IOC_SIZE(cmd);
  670. return copy_to_user(user_arg, hid->name, len) ?
  671. -EFAULT : len;
  672. }
  673. if (_IOC_NR(cmd) == _IOC_NR(HIDIOCGPHYS(0))) {
  674. int len;
  675. if (!hid->phys)
  676. return 0;
  677. len = strlen(hid->phys) + 1;
  678. if (len > _IOC_SIZE(cmd))
  679. len = _IOC_SIZE(cmd);
  680. return copy_to_user(user_arg, hid->phys, len) ?
  681. -EFAULT : len;
  682. }
  683. }
  684. return -EINVAL;
  685. }
  686. #ifdef CONFIG_COMPAT
  687. static long hiddev_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  688. {
  689. return hiddev_ioctl(file, cmd, (unsigned long)compat_ptr(arg));
  690. }
  691. #endif
  692. static const struct file_operations hiddev_fops = {
  693. .owner = THIS_MODULE,
  694. .read = hiddev_read,
  695. .write = hiddev_write,
  696. .poll = hiddev_poll,
  697. .open = hiddev_open,
  698. .release = hiddev_release,
  699. .unlocked_ioctl = hiddev_ioctl,
  700. .fasync = hiddev_fasync,
  701. #ifdef CONFIG_COMPAT
  702. .compat_ioctl = hiddev_compat_ioctl,
  703. #endif
  704. };
  705. static char *hiddev_devnode(struct device *dev, mode_t *mode)
  706. {
  707. return kasprintf(GFP_KERNEL, "usb/%s", dev_name(dev));
  708. }
  709. static struct usb_class_driver hiddev_class = {
  710. .name = "hiddev%d",
  711. .devnode = hiddev_devnode,
  712. .fops = &hiddev_fops,
  713. .minor_base = HIDDEV_MINOR_BASE,
  714. };
  715. /*
  716. * This is where hid.c calls us to connect a hid device to the hiddev driver
  717. */
  718. int hiddev_connect(struct hid_device *hid, unsigned int force)
  719. {
  720. struct hiddev *hiddev;
  721. struct usbhid_device *usbhid = hid->driver_data;
  722. int retval;
  723. if (!force) {
  724. unsigned int i;
  725. for (i = 0; i < hid->maxcollection; i++)
  726. if (hid->collection[i].type ==
  727. HID_COLLECTION_APPLICATION &&
  728. !IS_INPUT_APPLICATION(hid->collection[i].usage))
  729. break;
  730. if (i == hid->maxcollection)
  731. return -1;
  732. }
  733. if (!(hiddev = kzalloc(sizeof(struct hiddev), GFP_KERNEL)))
  734. return -1;
  735. init_waitqueue_head(&hiddev->wait);
  736. INIT_LIST_HEAD(&hiddev->list);
  737. spin_lock_init(&hiddev->list_lock);
  738. mutex_init(&hiddev->existancelock);
  739. hid->hiddev = hiddev;
  740. hiddev->hid = hid;
  741. hiddev->exist = 1;
  742. /* when lock_kernel() usage is fixed in usb_open(),
  743. * we could also fix it here */
  744. lock_kernel();
  745. retval = usb_register_dev(usbhid->intf, &hiddev_class);
  746. if (retval) {
  747. err_hid("Not able to get a minor for this device.");
  748. hid->hiddev = NULL;
  749. unlock_kernel();
  750. kfree(hiddev);
  751. return -1;
  752. } else {
  753. hid->minor = usbhid->intf->minor;
  754. hiddev_table[usbhid->intf->minor - HIDDEV_MINOR_BASE] = hiddev;
  755. }
  756. unlock_kernel();
  757. return 0;
  758. }
  759. /*
  760. * This is where hid.c calls us to disconnect a hiddev device from the
  761. * corresponding hid device (usually because the usb device has disconnected)
  762. */
  763. static struct usb_class_driver hiddev_class;
  764. void hiddev_disconnect(struct hid_device *hid)
  765. {
  766. struct hiddev *hiddev = hid->hiddev;
  767. struct usbhid_device *usbhid = hid->driver_data;
  768. mutex_lock(&hiddev->existancelock);
  769. hiddev->exist = 0;
  770. mutex_unlock(&hiddev->existancelock);
  771. hiddev_table[hiddev->hid->minor - HIDDEV_MINOR_BASE] = NULL;
  772. usb_deregister_dev(usbhid->intf, &hiddev_class);
  773. if (hiddev->open) {
  774. usbhid_close(hiddev->hid);
  775. wake_up_interruptible(&hiddev->wait);
  776. } else {
  777. kfree(hiddev);
  778. }
  779. }
  780. /* Currently this driver is a USB driver. It's not a conventional one in
  781. * the sense that it doesn't probe at the USB level. Instead it waits to
  782. * be connected by HID through the hiddev_connect / hiddev_disconnect
  783. * routines. The reason to register as a USB device is to gain part of the
  784. * minor number space from the USB major.
  785. *
  786. * In theory, should the HID code be generalized to more than one physical
  787. * medium (say, IEEE 1384), this driver will probably need to register its
  788. * own major number, and in doing so, no longer need to register with USB.
  789. * At that point the probe routine and hiddev_driver struct below will no
  790. * longer be useful.
  791. */
  792. /* We never attach in this manner, and rely on HID to connect us. This
  793. * is why there is no disconnect routine defined in the usb_driver either.
  794. */
  795. static int hiddev_usbd_probe(struct usb_interface *intf,
  796. const struct usb_device_id *hiddev_info)
  797. {
  798. return -ENODEV;
  799. }
  800. static /* const */ struct usb_driver hiddev_driver = {
  801. .name = "hiddev",
  802. .probe = hiddev_usbd_probe,
  803. };
  804. int __init hiddev_init(void)
  805. {
  806. return usb_register(&hiddev_driver);
  807. }
  808. void hiddev_exit(void)
  809. {
  810. usb_deregister(&hiddev_driver);
  811. }