hiddev.c 25 KB

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