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.6.2.1 2002/04/03 16:48:25 joe Exp $ */
3 /* $DragonFly: src/usr.bin/usbhidctl/usbhid.c,v 1.3 2003/08/08 04:18:44 dillon Exp $ */
6 * Copyright (c) 1998 The NetBSD Foundation, Inc.
9 * This code is derived from software contributed to The NetBSD Foundation
10 * by Lennart Augustsson (augustss@netbsd.org).
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the NetBSD
23 * Foundation, Inc. and its contributors.
24 * 4. Neither the name of The NetBSD Foundation nor the names of its
25 * contributors may be used to endorse or promote products derived
26 * from this software without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
29 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
30 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
31 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
32 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
33 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
34 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
35 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
36 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
37 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
38 * POSSIBILITY OF SUCH DAMAGE.
44 #include <sys/types.h>
46 #include <sys/ioctl.h>
51 #include <libusbhid.h>
52 #include <bus/usb/usb.h>
53 #include <bus/usb/usbhid.h>
62 void prbits(int bits, char **strs, int n);
64 void dumpitem(const char *label, struct hid_item *h);
65 void dumpitems(report_desc_t r);
66 void rev(struct hid_item **p);
67 void prdata(u_char *buf, struct hid_item *h);
68 void dumpdata(int f, report_desc_t r, int loop);
76 for (i = 0; i < nnames; i++)
77 if (strcmp(names[i], n) == 0)
83 prbits(int bits, char **strs, int n)
87 for(i = 0; i < n; i++, bits >>= 1)
89 printf("%s%s", i == 0 ? "" : ", ", strs[i*2 + (bits&1)]);
95 extern char *__progname;
97 fprintf(stderr, "Usage: %s -f device [-l] [-n] [-r] [-t tablefile] [-v] name ...\n", __progname);
98 fprintf(stderr, " %s -f device [-l] [-n] [-r] [-t tablefile] [-v] -a\n", __progname);
103 dumpitem(const char *label, struct hid_item *h)
105 if ((h->flags & HIO_CONST) && !verbose)
107 printf("%s size=%d count=%d page=%s usage=%s%s", label,
108 h->report_size, h->report_count,
109 hid_usage_page(HID_PAGE(h->usage)),
110 hid_usage_in_page(h->usage),
111 h->flags & HIO_CONST ? " Const" : "");
112 printf(", logical range %d..%d",
113 h->logical_minimum, h->logical_maximum);
114 if (h->physical_minimum != h->physical_maximum)
115 printf(", physical range %d..%d",
116 h->physical_minimum, h->physical_maximum);
118 printf(", unit=0x%02x exp=%d", h->unit, h->unit_exponent);
123 dumpitems(report_desc_t r)
129 for (d = hid_start_parse(r, ~0); hid_get_item(d, &h); ) {
132 printf("Collection page=%s usage=%s\n",
133 hid_usage_page(HID_PAGE(h.usage)),
134 hid_usage_in_page(h.usage));
136 case hid_endcollection:
137 printf("End collection\n");
140 dumpitem("Input ", &h);
143 dumpitem("Output ", &h);
146 dumpitem("Feature", &h);
151 size = hid_report_size(r, 0, hid_input);
152 printf("Total input size %d bytes\n", size);
154 size = hid_report_size(r, 0, hid_output);
155 printf("Total output size %d bytes\n", size);
157 size = hid_report_size(r, 0, hid_feature);
158 printf("Total feature size %d bytes\n", size);
162 rev(struct hid_item **p)
164 struct hid_item *cur, *prev, *next;
178 prdata(u_char *buf, struct hid_item *h)
184 for (i = 0; i < h->report_count; i++) {
185 data = hid_get_data(buf, h);
186 if (h->logical_minimum < 0)
187 printf("%d", (int)data);
190 pos += h->report_size;
195 dumpdata(int f, report_desc_t rd, int loop)
198 struct hid_item h, *hids, *n;
202 u_int32_t colls[100];
205 char namebuf[10000], *namep;
208 for (d = hid_start_parse(rd, 1<<hid_input);
209 hid_get_item(d, &h); ) {
210 if (h.kind == hid_collection)
211 colls[++sp] = h.usage;
212 else if (h.kind == hid_endcollection)
214 if (h.kind != hid_input || (h.flags & HIO_CONST))
217 h.collection = colls[sp];
218 hids = malloc(sizeof *hids);
223 dlen = hid_report_size(rd, 0, hid_input);
226 if (ioctl(f, USB_SET_IMMED, &one) < 0) {
227 if (errno == EOPNOTSUPP)
228 warnx("device does not support immediate mode, only changes reported.");
230 err(1, "USB_SET_IMMED");
233 r = read(f, dbuf, dlen);
235 err(1, "bad read %d != %d", r, dlen);
237 for (n = hids; n; n = n->next) {
239 namep += sprintf(namep, "%s:%s.",
240 hid_usage_page(HID_PAGE(n->collection)),
241 hid_usage_in_page(n->collection));
242 namep += sprintf(namep, "%s:%s",
243 hid_usage_page(HID_PAGE(n->usage)),
244 hid_usage_in_page(n->usage));
245 if (all || gotname(namebuf)) {
247 printf("%s=", namebuf);
248 prdata(dbuf + (report_id != 0), n);
259 main(int argc, char **argv)
263 char devnam[100], *dev = 0;
269 while ((ch = getopt(argc, argv, "af:lnrt:v")) != -1) {
304 if (nnames == 0 && !all && !repdump)
309 snprintf(devnam, sizeof(devnam), "/dev/uhid%s", dev);
311 snprintf(devnam, sizeof(devnam), "/dev/%s", dev);
317 f = open(dev, O_RDWR);
321 r = hid_get_report_desc(f);
323 errx(1, "USB_GET_REPORT_DESC");
326 printf("Report descriptor:\n");
329 if (nnames != 0 || all)
330 dumpdata(f, r, loop);
332 hid_dispose_report_desc(r);