1 /* $NetBSD: hid.c,v 1.17 2001/11/13 06:24:53 lukem Exp $ */
7 * Copyright (c) 1998 The NetBSD Foundation, Inc.
10 * This code is derived from software contributed to The NetBSD Foundation
11 * by Lennart Augustsson (lennart@augustsson.net) at
12 * Carlstedt Research & Technology.
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
17 * 1. Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in the
21 * documentation and/or other materials provided with the distribution.
23 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
24 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
25 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
26 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
27 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
29 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
30 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
31 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
32 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
36 #include <sys/stdint.h>
37 #include <sys/stddef.h>
38 #include <sys/param.h>
39 #include <sys/queue.h>
40 #include <sys/types.h>
41 #include <sys/systm.h>
42 #include <sys/kernel.h>
44 #include <sys/linker_set.h>
45 #include <sys/module.h>
47 #include <sys/mutex.h>
48 #include <sys/condvar.h>
49 #include <sys/sysctl.h>
51 #include <sys/unistd.h>
52 #include <sys/callout.h>
53 #include <sys/malloc.h>
56 #include <dev/usb/usb.h>
57 #include <dev/usb/usbdi.h>
58 #include <dev/usb/usbdi_util.h>
59 #include <dev/usb/usbhid.h>
61 #define USB_DEBUG_VAR usb_debug
63 #include <dev/usb/usb_core.h>
64 #include <dev/usb/usb_debug.h>
65 #include <dev/usb/usb_process.h>
66 #include <dev/usb/usb_device.h>
67 #include <dev/usb/usb_request.h>
69 static void hid_clear_local(struct hid_item *);
70 static uint8_t hid_get_byte(struct hid_data *s, const uint16_t wSize);
85 struct hid_item cur[MAXPUSH];
86 struct hid_pos_data last_pos[MAXID];
87 int32_t usages_min[MAXUSAGE];
88 int32_t usages_max[MAXUSAGE];
89 int32_t usage_last; /* last seen usage */
90 uint32_t loc_size; /* last seen size */
91 uint32_t loc_count; /* last seen count */
92 uint8_t kindset; /* we have 5 kinds so 8 bits are enough */
93 uint8_t pushlevel; /* current pushlevel */
94 uint8_t ncount; /* end usage item count */
95 uint8_t icount; /* current usage item count */
96 uint8_t nusage; /* end "usages_min/max" index */
97 uint8_t iusage; /* current "usages_min/max" index */
98 uint8_t ousage; /* current "usages_min/max" offset */
99 uint8_t susage; /* usage set flags */
102 /*------------------------------------------------------------------------*
104 *------------------------------------------------------------------------*/
106 hid_clear_local(struct hid_item *c)
112 c->usage_minimum = 0;
113 c->usage_maximum = 0;
114 c->designator_index = 0;
115 c->designator_minimum = 0;
116 c->designator_maximum = 0;
118 c->string_minimum = 0;
119 c->string_maximum = 0;
120 c->set_delimiter = 0;
124 hid_switch_rid(struct hid_data *s, struct hid_item *c, int32_t next_rID)
128 /* check for same report ID - optimise */
130 if (c->report_ID == next_rID)
133 /* save current position for current rID */
135 if (c->report_ID == 0) {
138 for (i = 1; i != MAXID; i++) {
139 if (s->last_pos[i].rid == c->report_ID)
141 if (s->last_pos[i].rid == 0)
146 s->last_pos[i].rid = c->report_ID;
147 s->last_pos[i].pos = c->loc.pos;
150 /* store next report ID */
152 c->report_ID = next_rID;
154 /* lookup last position for next rID */
159 for (i = 1; i != MAXID; i++) {
160 if (s->last_pos[i].rid == next_rID)
162 if (s->last_pos[i].rid == 0)
167 s->last_pos[i].rid = next_rID;
168 c->loc.pos = s->last_pos[i].pos;
170 DPRINTF("Out of RID entries, position is set to zero!\n");
175 /*------------------------------------------------------------------------*
177 *------------------------------------------------------------------------*/
179 hid_start_parse(const void *d, usb_size_t len, int kindset)
183 if ((kindset-1) & kindset) {
184 DPRINTFN(0, "Only one bit can be "
185 "set in the kindset\n");
189 s = malloc(sizeof *s, M_TEMP, M_WAITOK | M_ZERO);
191 s->end = ((const uint8_t *)d) + len;
192 s->kindset = kindset;
196 /*------------------------------------------------------------------------*
198 *------------------------------------------------------------------------*/
200 hid_end_parse(struct hid_data *s)
208 /*------------------------------------------------------------------------*
209 * get byte from HID descriptor
210 *------------------------------------------------------------------------*/
212 hid_get_byte(struct hid_data *s, const uint16_t wSize)
219 /* check if end is reached */
223 /* read out a byte */
226 /* check if data pointer can be advanced by "wSize" bytes */
227 if ((s->end - ptr) < wSize)
238 /*------------------------------------------------------------------------*
240 *------------------------------------------------------------------------*/
242 hid_get_item(struct hid_data *s, struct hid_item *h)
245 unsigned int bTag, bType, bSize;
253 c = &s->cur[s->pushlevel];
256 /* check if there is an array of items */
257 if (s->icount < s->ncount) {
258 /* get current usage */
259 if (s->iusage < s->nusage) {
260 dval = s->usages_min[s->iusage] + s->ousage;
262 s->usage_last = dval;
263 if (dval == s->usages_max[s->iusage]) {
270 DPRINTFN(1, "Using last usage\n");
271 dval = s->usage_last;
275 * Only copy HID item, increment position and return
276 * if correct kindset!
278 if (s->kindset & (1 << c->kind)) {
280 DPRINTFN(1, "%u,%u,%u\n", h->loc.pos,
281 h->loc.size, h->loc.count);
282 c->loc.pos += c->loc.size * c->loc.count;
287 /* reset state variables */
297 while (s->p != s->end) {
299 bSize = hid_get_byte(s, 1);
302 bSize = hid_get_byte(s, 1);
303 bSize |= hid_get_byte(s, 1) << 8;
304 bTag = hid_get_byte(s, 1);
305 bType = 0xff; /* XXX what should it be */
309 bType = (bSize >> 2) & 3;
320 dval = (int8_t)hid_get_byte(s, 1);
324 dval = hid_get_byte(s, 1);
325 dval |= hid_get_byte(s, 1) << 8;
326 dval = (int16_t)dval;
330 dval = hid_get_byte(s, 1);
331 dval |= hid_get_byte(s, 1) << 8;
332 dval |= hid_get_byte(s, 1) << 16;
333 dval |= hid_get_byte(s, 1) << 24;
337 dval = hid_get_byte(s, bSize);
338 DPRINTFN(0, "bad length %u (data=0x%02x)\n",
350 c->loc.count = s->loc_count;
351 c->loc.size = s->loc_size;
353 if (c->flags & HIO_VARIABLE) {
354 /* range check usage count */
355 if (c->loc.count > 255) {
356 DPRINTFN(0, "Number of "
357 "items truncated to 255\n");
360 s->ncount = c->loc.count;
363 * The "top" loop will return
373 c->kind = hid_output;
376 case 10: /* Collection */
377 c->kind = hid_collection;
378 c->collection = dval;
380 c->usage = s->usage_last;
383 case 11: /* Feature */
384 c->kind = hid_feature;
387 case 12: /* End collection */
388 c->kind = hid_endcollection;
389 if (c->collevel == 0) {
390 DPRINTFN(0, "invalid end collection\n");
397 DPRINTFN(0, "Main bTag=%d\n", bTag);
404 c->_usage_page = dval << 16;
407 c->logical_minimum = dval;
410 c->logical_maximum = dval;
413 c->physical_minimum = dval;
416 c->physical_maximum = dval;
419 c->unit_exponent = dval;
425 /* mask because value is unsigned */
426 s->loc_size = dval & mask;
429 hid_switch_rid(s, c, dval);
432 /* mask because value is unsigned */
433 s->loc_count = dval & mask;
437 if (s->pushlevel < MAXPUSH) {
438 s->cur[s->pushlevel] = *c;
439 /* store size and count */
440 c->loc.size = s->loc_size;
441 c->loc.count = s->loc_count;
442 /* update current item pointer */
443 c = &s->cur[s->pushlevel];
445 DPRINTFN(0, "Cannot push "
446 "item @ %d\n", s->pushlevel);
451 if (s->pushlevel < MAXPUSH) {
452 /* preserve position */
454 c = &s->cur[s->pushlevel];
455 /* restore size and count */
456 s->loc_size = c->loc.size;
457 s->loc_count = c->loc.count;
458 /* set default item location */
463 DPRINTFN(0, "Cannot pop "
464 "item @ %d\n", s->pushlevel);
468 DPRINTFN(0, "Global bTag=%d\n", bTag);
476 dval = (dval & mask) | c->_usage_page;
478 /* set last usage, in case of a collection */
479 s->usage_last = dval;
481 if (s->nusage < MAXUSAGE) {
482 s->usages_min[s->nusage] = dval;
483 s->usages_max[s->nusage] = dval;
486 DPRINTFN(0, "max usage reached\n");
489 /* clear any pending usage sets */
496 dval = (dval & mask) | c->_usage_page;
497 c->usage_minimum = dval;
504 dval = (dval & mask) | c->_usage_page;
505 c->usage_maximum = dval;
512 if ((s->nusage < MAXUSAGE) &&
513 (c->usage_minimum <= c->usage_maximum)) {
514 /* add usage range */
515 s->usages_min[s->nusage] =
517 s->usages_max[s->nusage] =
521 DPRINTFN(0, "Usage set dropped\n");
526 c->designator_index = dval;
529 c->designator_minimum = dval;
532 c->designator_maximum = dval;
535 c->string_index = dval;
538 c->string_minimum = dval;
541 c->string_maximum = dval;
544 c->set_delimiter = dval;
547 DPRINTFN(0, "Local bTag=%d\n", bTag);
552 DPRINTFN(0, "default bType=%d\n", bType);
559 /*------------------------------------------------------------------------*
561 *------------------------------------------------------------------------*/
563 hid_report_size(const void *buf, usb_size_t len, enum hid_kind k, uint8_t *id)
576 for (d = hid_start_parse(buf, len, 1 << k); hid_get_item(d, &h);) {
578 /* check for ID-byte presense */
579 if ((h.report_ID != 0) && !any_id) {
584 /* compute minimum */
585 if (lpos > h.loc.pos)
587 /* compute end position */
588 temp = h.loc.pos + (h.loc.size * h.loc.count);
589 /* compute maximum */
596 /* safety check - can happen in case of currupt descriptors */
602 /* check for ID byte */
608 /* return length in bytes rounded up */
609 return ((temp + 7) / 8);
612 /*------------------------------------------------------------------------*
614 *------------------------------------------------------------------------*/
616 hid_locate(const void *desc, usb_size_t size, uint32_t u, enum hid_kind k,
617 uint8_t index, struct hid_location *loc, uint32_t *flags, uint8_t *id)
622 for (d = hid_start_parse(desc, size, 1 << k); hid_get_item(d, &h);) {
623 if (h.kind == k && !(h.flags & HIO_CONST) && h.usage == u) {
646 /*------------------------------------------------------------------------*
648 *------------------------------------------------------------------------*/
650 hid_get_data_sub(const uint8_t *buf, usb_size_t len, struct hid_location *loc,
653 uint32_t hpos = loc->pos;
654 uint32_t hsize = loc->size;
659 DPRINTFN(11, "hid_get_data: loc %d/%d\n", hpos, hsize);
661 /* Range check and limit */
667 /* Get data in a safe way */
675 data |= buf[rpos] << (8 * n);
678 /* Correctly shift down data */
679 data = (data >> (hpos % 8));
682 /* Mask and sign extend in one */
684 data = (int32_t)((int32_t)data << n) >> n;
686 data = (uint32_t)((uint32_t)data << n) >> n;
688 DPRINTFN(11, "hid_get_data: loc %d/%d = %lu\n",
689 loc->pos, loc->size, (long)data);
694 hid_get_data(const uint8_t *buf, usb_size_t len, struct hid_location *loc)
696 return (hid_get_data_sub(buf, len, loc, 1));
700 hid_get_data_unsigned(const uint8_t *buf, usb_size_t len, struct hid_location *loc)
702 return (hid_get_data_sub(buf, len, loc, 0));
705 /*------------------------------------------------------------------------*
707 *------------------------------------------------------------------------*/
709 hid_is_collection(const void *desc, usb_size_t size, uint32_t usage)
715 hd = hid_start_parse(desc, size, hid_input);
719 while ((err = hid_get_item(hd, &hi))) {
720 if (hi.kind == hid_collection &&
728 /*------------------------------------------------------------------------*
729 * hid_get_descriptor_from_usb
731 * This function will search for a HID descriptor between two USB
732 * interface descriptors.
735 * NULL: No more HID descriptors.
736 * Else: Pointer to HID descriptor.
737 *------------------------------------------------------------------------*/
738 struct usb_hid_descriptor *
739 hid_get_descriptor_from_usb(struct usb_config_descriptor *cd,
740 struct usb_interface_descriptor *id)
742 struct usb_descriptor *desc = (void *)id;
747 while ((desc = usb_desc_foreach(cd, desc))) {
748 if ((desc->bDescriptorType == UDESC_HID) &&
749 (desc->bLength >= USB_HID_DESCRIPTOR_SIZE(0))) {
752 if (desc->bDescriptorType == UDESC_INTERFACE) {
759 /*------------------------------------------------------------------------*
760 * usbd_req_get_hid_desc
762 * This function will read out an USB report descriptor from the USB
767 * Else: Success. The pointer should eventually be passed to free().
768 *------------------------------------------------------------------------*/
770 usbd_req_get_hid_desc(struct usb_device *udev, struct mtx *mtx,
771 void **descp, uint16_t *sizep,
772 struct malloc_type *mem, uint8_t iface_index)
774 struct usb_interface *iface = usbd_get_iface(udev, iface_index);
775 struct usb_hid_descriptor *hid;
778 if ((iface == NULL) || (iface->idesc == NULL)) {
779 return (USB_ERR_INVAL);
781 hid = hid_get_descriptor_from_usb
782 (usbd_get_config_descriptor(udev), iface->idesc);
785 return (USB_ERR_IOERROR);
787 *sizep = UGETW(hid->descrs[0].wDescriptorLength);
789 return (USB_ERR_IOERROR);
794 *descp = malloc(*sizep, mem, M_ZERO | M_WAITOK);
799 if (*descp == NULL) {
800 return (USB_ERR_NOMEM);
802 err = usbd_req_get_report_descriptor
803 (udev, mtx, *descp, *sizep, iface_index);
810 return (USB_ERR_NORMAL_COMPLETION);