1 /* $NetBSD: usbhid.c,v 1.14 2000/07/03 02:51:37 matt Exp $ */
2 /* $FreeBSD: src/usr.bin/usbhidctl/usbhid.c,v 1.12 2007/12/21 03:40:36 imp Exp $ */
5 * Copyright (c) 1998 The NetBSD Foundation, Inc.
8 * This code is derived from software contributed to The NetBSD Foundation
9 * by Lennart Augustsson (augustss@netbsd.org).
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the NetBSD
22 * Foundation, Inc. and its contributors.
23 * 4. Neither the name of The NetBSD Foundation nor the names of its
24 * contributors may be used to endorse or promote products derived
25 * from this software without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 * POSSIBILITY OF SUCH DAMAGE.
43 #include <sys/types.h>
45 #include <sys/ioctl.h>
51 #include <bus/usb/usb.h>
52 #include <bus/usb/usbhid.h>
63 void prbits(int bits, char **strs, int n);
65 void dumpitem(const char *label, struct hid_item *h);
66 void dumpitems(report_desc_t r);
67 void rev(struct hid_item **p);
68 void prdata(u_char *buf, struct hid_item *h);
69 void dumpdata(int f, report_desc_t r, int loop);
77 for (i = 0; i < nnames; i++)
78 if (strcmp(names[i], n) == 0)
84 prbits(int bits, char **strs, int n)
88 for(i = 0; i < n; i++, bits >>= 1)
90 printf("%s%s", i == 0 ? "" : ", ", strs[i*2 + (bits&1)]);
97 "usage: %s -f device "
98 "[-l] [-n] [-r] [-t tablefile] [-v] [-x] name ...\n",
102 "[-l] [-n] [-r] [-t tablefile] [-v] [-x] -a\n",
108 dumpitem(const char *label, struct hid_item *h)
110 if ((h->flags & HIO_CONST) && !verbose)
112 printf("%s size=%d count=%d page=%s usage=%s%s", label,
113 h->report_size, h->report_count,
114 hid_usage_page(HID_PAGE(h->usage)),
115 hid_usage_in_page(h->usage),
116 h->flags & HIO_CONST ? " Const" : "");
117 printf(", logical range %d..%d",
118 h->logical_minimum, h->logical_maximum);
119 if (h->physical_minimum != h->physical_maximum)
120 printf(", physical range %d..%d",
121 h->physical_minimum, h->physical_maximum);
123 printf(", unit=0x%02x exp=%d", h->unit, h->unit_exponent);
128 dumpitems(report_desc_t r)
134 for (d = hid_start_parse(r, ~0, reportid); hid_get_item(d, &h); ) {
137 printf("Collection page=%s usage=%s\n",
138 hid_usage_page(HID_PAGE(h.usage)),
139 hid_usage_in_page(h.usage));
141 case hid_endcollection:
142 printf("End collection\n");
145 dumpitem("Input ", &h);
148 dumpitem("Output ", &h);
151 dumpitem("Feature", &h);
156 size = hid_report_size(r, hid_input, 0);
157 printf("Total input size %d bytes\n", size);
159 size = hid_report_size(r, hid_output, 0);
160 printf("Total output size %d bytes\n", size);
162 size = hid_report_size(r, hid_feature, 0);
163 printf("Total feature size %d bytes\n", size);
167 rev(struct hid_item **p)
169 struct hid_item *cur, *prev, *next;
183 prdata(u_char *buf, struct hid_item *h)
189 for (i = 0; i < h->report_count; i++) {
190 data = hid_get_data(buf, h);
191 if (h->logical_minimum < 0)
192 printf("%d", (int)data);
196 printf(" [0x%x]", data);
197 pos += h->report_size;
202 dumpdata(int f, report_desc_t rd, int loop)
205 struct hid_item h, *hids, *n;
209 u_int32_t colls[100];
211 char namebuf[10000], *namep;
214 for (d = hid_start_parse(rd, 1<<hid_input, reportid);
215 hid_get_item(d, &h); ) {
216 if (h.kind == hid_collection)
217 colls[++sp] = h.usage;
218 else if (h.kind == hid_endcollection)
220 if (h.kind != hid_input || (h.flags & HIO_CONST))
223 h.collection = colls[sp];
224 hids = malloc(sizeof *hids);
229 dlen = hid_report_size(rd, hid_input, 0);
232 if (ioctl(f, USB_SET_IMMED, &one) < 0) {
233 if (errno == EOPNOTSUPP)
234 warnx("device does not support immediate mode, only changes reported.");
236 err(1, "USB_SET_IMMED");
239 r = read(f, dbuf, dlen);
241 err(1, "bad read %d != %d", r, dlen);
243 for (n = hids; n; n = n->next) {
245 namep += sprintf(namep, "%s:%s.",
246 hid_usage_page(HID_PAGE(n->collection)),
247 hid_usage_in_page(n->collection));
248 namep += sprintf(namep, "%s:%s",
249 hid_usage_page(HID_PAGE(n->usage)),
250 hid_usage_in_page(n->usage));
251 if (all || gotname(namebuf)) {
253 printf("%s=", namebuf);
254 prdata(dbuf + (reportid != 0), n);
265 main(int argc, char **argv)
269 char devnam[100], *dev = NULL;
275 while ((ch = getopt(argc, argv, "af:lnrt:vx")) != -1) {
313 if (nnames == 0 && !all && !repdump)
318 snprintf(devnam, sizeof(devnam), "/dev/uhid%s", dev);
320 snprintf(devnam, sizeof(devnam), "/dev/%s", dev);
326 f = open(dev, O_RDWR);
330 r = hid_get_report_desc(f);
332 errx(1, "USB_GET_REPORT_DESC");
335 printf("Report descriptor:\n");
338 if (nnames != 0 || all)
339 dumpdata(f, r, loop);
341 hid_dispose_report_desc(r);