1 /* $NetBSD: usbhid.c,v 1.14 2000/07/03 02:51:37 matt 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>
50 #include <dev/usb/usbhid.h>
61 void prbits(int bits, char **strs, int n);
63 void dumpitem(const char *label, struct hid_item *h);
64 void dumpitems(report_desc_t r);
65 void rev(struct hid_item **p);
66 void prdata(u_char *buf, struct hid_item *h);
67 void dumpdata(int f, report_desc_t r, int loop);
75 for (i = 0; i < nnames; i++)
76 if (strcmp(names[i], n) == 0)
82 prbits(int bits, char **strs, int n)
86 for(i = 0; i < n; i++, bits >>= 1)
88 printf("%s%s", i == 0 ? "" : ", ", strs[i*2 + (bits&1)]);
96 "usage: %s -f device "
97 "[-l] [-n] [-r] [-t tablefile] [-v] [-x] name ...\n",
101 "[-l] [-n] [-r] [-t tablefile] [-v] [-x] -a\n",
107 dumpitem(const char *label, struct hid_item *h)
109 if ((h->flags & HIO_CONST) && !verbose)
111 printf("%s size=%d count=%d page=%s usage=%s%s", label,
112 h->report_size, h->report_count,
113 hid_usage_page(HID_PAGE(h->usage)),
114 hid_usage_in_page(h->usage),
115 h->flags & HIO_CONST ? " Const" : "");
116 printf(", logical range %d..%d",
117 h->logical_minimum, h->logical_maximum);
118 if (h->physical_minimum != h->physical_maximum)
119 printf(", physical range %d..%d",
120 h->physical_minimum, h->physical_maximum);
122 printf(", unit=0x%02x exp=%d", h->unit, h->unit_exponent);
127 dumpitems(report_desc_t r)
133 for (d = hid_start_parse(r, ~0, reportid); hid_get_item(d, &h); ) {
136 printf("Collection page=%s usage=%s\n",
137 hid_usage_page(HID_PAGE(h.usage)),
138 hid_usage_in_page(h.usage));
140 case hid_endcollection:
141 printf("End collection\n");
144 dumpitem("Input ", &h);
147 dumpitem("Output ", &h);
150 dumpitem("Feature", &h);
155 size = hid_report_size(r, hid_input, 0);
156 printf("Total input size %d bytes\n", size);
158 size = hid_report_size(r, hid_output, 0);
159 printf("Total output size %d bytes\n", size);
161 size = hid_report_size(r, hid_feature, 0);
162 printf("Total feature size %d bytes\n", size);
166 rev(struct hid_item **p)
168 struct hid_item *cur, *prev, *next;
182 prdata(u_char *buf, struct hid_item *h)
188 for (i = 0; i < h->report_count; i++) {
189 data = hid_get_data(buf, h);
190 if (h->logical_minimum < 0)
191 printf("%d", (int)data);
195 printf(" [0x%x]", data);
196 pos += h->report_size;
201 dumpdata(int f, report_desc_t rd, int loop)
204 struct hid_item h, *hids, *n;
207 u_int32_t colls[100];
209 char namebuf[10000], *namep;
212 for (d = hid_start_parse(rd, 1<<hid_input, reportid);
213 hid_get_item(d, &h); ) {
214 if (h.kind == hid_collection)
215 colls[++sp] = h.usage;
216 else if (h.kind == hid_endcollection)
218 if (h.kind != hid_input || (h.flags & HIO_CONST))
221 h.collection = colls[sp];
222 hids = malloc(sizeof *hids);
227 dlen = hid_report_size(rd, hid_input, 0);
230 if (hid_set_immed(f, 1) < 0) {
231 if (errno == EOPNOTSUPP)
232 warnx("device does not support immediate mode, only changes reported.");
234 err(1, "USB_SET_IMMED");
237 r = read(f, dbuf, dlen);
239 err(1, "bad read %d != %d", r, dlen);
241 for (n = hids; n; n = n->next) {
243 namep += sprintf(namep, "%s:%s.",
244 hid_usage_page(HID_PAGE(n->collection)),
245 hid_usage_in_page(n->collection));
246 namep += sprintf(namep, "%s:%s",
247 hid_usage_page(HID_PAGE(n->usage)),
248 hid_usage_in_page(n->usage));
249 if (all || gotname(namebuf)) {
251 printf("%s=", namebuf);
252 prdata(dbuf + (reportid != 0), n);
263 main(int argc, char **argv)
267 char devnam[100], *dev = 0;
273 while ((ch = getopt(argc, argv, "af:lnrt:vx")) != -1) {
311 if (nnames == 0 && !all && !repdump)
316 snprintf(devnam, sizeof(devnam), "/dev/uhid%s", dev);
318 snprintf(devnam, sizeof(devnam), "/dev/%s", dev);
324 f = open(dev, O_RDWR);
328 r = hid_get_report_desc(f);
330 errx(1, "USB_GET_REPORT_DESC");
333 printf("Report descriptor:\n");
336 if (nnames != 0 || all)
337 dumpdata(f, r, loop);
339 hid_dispose_report_desc(r);