Annotation of src/usr.bin/usbhidctl/usbhid.c, Revision 1.20
1.20 ! guenther 1: /* $OpenBSD: usbhid.c,v 1.19 2022/12/04 23:50:50 cheloha Exp $ */
1.4 nate 2: /* $NetBSD: usbhid.c,v 1.22 2002/02/20 20:30:42 christos Exp $ */
1.1 pvalchev 3:
4: /*
1.4 nate 5: * Copyright (c) 2001 The NetBSD Foundation, Inc.
1.1 pvalchev 6: * All rights reserved.
7: *
8: * This code is derived from software contributed to The NetBSD Foundation
9: * by David Sainty <David.Sainty@dtsp.co.nz>
10: *
11: * Redistribution and use in source and binary forms, with or without
12: * modification, are permitted provided that the following conditions
13: * are met:
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: *
20: * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21: * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22: * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23: * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24: * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30: * POSSIBILITY OF SUCH DAMAGE.
31: */
32:
33: #include <sys/types.h>
34:
35: #include <dev/usb/usb.h>
36: #include <dev/usb/usbhid.h>
37:
38: #include <ctype.h>
39: #include <err.h>
40: #include <errno.h>
41: #include <fcntl.h>
42: #include <limits.h>
43: #include <stdio.h>
44: #include <stdlib.h>
45: #include <string.h>
46: #include <unistd.h>
1.2 pvalchev 47: #include <usbhid.h>
1.1 pvalchev 48:
1.4 nate 49: /*
50: * Zero if not in a verbose mode. Greater levels of verbosity
51: * are indicated by values larger than one.
52: */
53: unsigned int verbose;
54:
1.1 pvalchev 55: /* Parser tokens */
56: #define DELIM_USAGE '.'
57: #define DELIM_PAGE ':'
58: #define DELIM_SET '='
59:
1.4 nate 60: static int reportid;
1.1 pvalchev 61:
62: struct Susbvar {
63: /* Variable name, not NUL terminated */
64: char const *variable;
65: size_t varlen;
66:
67: char const *value; /* Value to set variable to */
68:
69: #define MATCH_ALL (1 << 0)
70: #define MATCH_COLLECTIONS (1 << 1)
71: #define MATCH_NODATA (1 << 2)
72: #define MATCH_CONSTANTS (1 << 3)
73: #define MATCH_WASMATCHED (1 << 4)
74: #define MATCH_SHOWPAGENAME (1 << 5)
75: #define MATCH_SHOWNUMERIC (1 << 6)
76: #define MATCH_WRITABLE (1 << 7)
1.4 nate 77: #define MATCH_SHOWVALUES (1 << 8)
1.1 pvalchev 78: unsigned int mflags;
79:
80: /* Workspace for hidmatch() */
81: ssize_t matchindex;
82:
83: int (*opfunc)(struct hid_item *item, struct Susbvar *var,
84: u_int32_t const *collist, size_t collen, u_char *buf);
85: };
86:
87: struct Sreport {
88: struct usb_ctl_report *buffer;
89:
90: enum {srs_uninit, srs_clean, srs_dirty} status;
91: int report_id;
92: size_t size;
93: };
94:
95: static struct {
96: int uhid_report;
97: hid_kind_t hid_kind;
98: char const *name;
99: } const reptoparam[] = {
100: #define REPORT_INPUT 0
101: { UHID_INPUT_REPORT, hid_input, "input" },
102: #define REPORT_OUTPUT 1
103: { UHID_OUTPUT_REPORT, hid_output, "output" },
104: #define REPORT_FEATURE 2
105: { UHID_FEATURE_REPORT, hid_feature, "feature" }
106: #define REPORT_MAXVAL 2
107: };
108:
1.4 nate 109: /*
110: * Extract 16-bit unsigned usage ID from a numeric string. Returns -1
111: * if string failed to parse correctly.
112: */
113: static int
114: strtousage(const char *nptr, size_t nlen)
115: {
116: char *endptr;
117: long result;
118: char numstr[16];
119:
120: if (nlen >= sizeof(numstr) || !isdigit((unsigned char)*nptr))
121: return -1;
122:
123: /*
124: * We use strtol() here, but unfortunately strtol() requires a
125: * NUL terminated string - which we don't have - at least not
126: * officially.
127: */
128: memcpy(numstr, nptr, nlen);
129: numstr[nlen] = '\0';
130:
131: result = strtol(numstr, &endptr, 0);
132:
133: if (result < 0 || result > 0xffff || endptr != &numstr[nlen])
134: return -1;
135:
136: return result;
137: }
138:
139: struct usagedata {
140: char const *page_name;
141: char const *usage_name;
142: size_t page_len;
143: size_t usage_len;
144: int isfinal;
145: u_int32_t usage_id;
146: };
147:
148: /*
149: * Test a rule against the current usage data. Returns -1 on no
150: * match, 0 on partial match and 1 on complete match.
151: */
152: static int
153: hidtestrule(struct Susbvar *var, struct usagedata *cache)
154: {
155: char const *varname;
156: ssize_t matchindex, pagesplit;
157: size_t strind, varlen;
158: int numusage;
159: u_int32_t usage_id;
160:
161: matchindex = var->matchindex;
162: varname = var->variable;
163: varlen = var->varlen;
164:
165: usage_id = cache->usage_id;
166:
167: /*
168: * Parse the current variable name, locating the end of the
169: * current 'usage', and possibly where the usage page name
170: * ends.
171: */
172: pagesplit = -1;
173: for (strind = matchindex; strind < varlen; strind++) {
174: if (varname[strind] == DELIM_USAGE)
175: break;
176: if (varname[strind] == DELIM_PAGE)
177: pagesplit = strind;
178: }
179:
180: if (cache->isfinal && strind != varlen)
181: /*
182: * Variable name is too long (hit delimiter instead of
183: * end-of-variable).
184: */
185: return -1;
186:
187: if (pagesplit >= 0) {
188: /*
189: * Page name was specified, determine whether it was
190: * symbolic or numeric.
191: */
192: char const *strstart;
193: int numpage;
194:
195: strstart = &varname[matchindex];
196:
197: numpage = strtousage(strstart, pagesplit - matchindex);
198:
199: if (numpage >= 0) {
200: /* Valid numeric */
201:
202: if (numpage != HID_PAGE(usage_id))
203: /* Numeric didn't match page ID */
204: return -1;
205: } else {
206: /* Not a valid numeric */
207:
208: /*
209: * Load and cache the page name if and only if
210: * it hasn't already been loaded (it's a
211: * fairly expensive operation).
212: */
213: if (cache->page_name == NULL) {
214: cache->page_name = hid_usage_page(HID_PAGE(usage_id));
215: cache->page_len = strlen(cache->page_name);
216: }
217:
218: /*
219: * Compare specified page name to actual page
220: * name.
221: */
222: if (cache->page_len !=
223: (size_t)(pagesplit - matchindex) ||
224: memcmp(cache->page_name,
225: &varname[matchindex],
226: cache->page_len) != 0)
227: /* Mismatch, page name wrong */
228: return -1;
229: }
230:
231: /* Page matches, discard page name */
232: matchindex = pagesplit + 1;
233: }
234:
235: numusage = strtousage(&varname[matchindex], strind - matchindex);
236:
237: if (numusage >= 0) {
238: /* Valid numeric */
239:
240: if (numusage != HID_USAGE(usage_id))
241: /* Numeric didn't match usage ID */
242: return -1;
243: } else {
244: /* Not a valid numeric */
245:
246: /* Load and cache the usage name */
247: if (cache->usage_name == NULL) {
248: cache->usage_name = hid_usage_in_page(usage_id);
249: cache->usage_len = strlen(cache->usage_name);
250: }
251:
252: /*
253: * Compare specified usage name to actual usage name
254: */
255: if (cache->usage_len != (size_t)(strind - matchindex) ||
256: memcmp(cache->usage_name, &varname[matchindex],
257: cache->usage_len) != 0)
258: /* Mismatch, usage name wrong */
259: return -1;
260: }
261:
262: if (cache->isfinal)
263: /* Match */
264: return 1;
265:
266: /*
267: * Partial match: Move index past this usage string +
268: * delimiter
269: */
270: var->matchindex = strind + 1;
271:
272: return 0;
273: }
274:
275: /*
276: * hidmatch() determines whether the item specified in 'item', and
1.7 jsg 277: * nested within a hierarchy of collections specified in 'collist'
1.4 nate 278: * matches any of the rules in the list 'varlist'. Returns the
279: * matching rule on success, or NULL on no match.
280: */
1.1 pvalchev 281: static struct Susbvar*
282: hidmatch(u_int32_t const *collist, size_t collen, struct hid_item *item,
283: struct Susbvar *varlist, size_t vlsize)
284: {
1.4 nate 285: size_t colind, vlactive, vlind;
1.1 pvalchev 286: int iscollection;
287:
288: /*
289: * Keep track of how many variables are still "active". When
290: * the active count reaches zero, don't bother to continue
291: * looking for matches.
292: */
293: vlactive = vlsize;
294:
295: iscollection = item->kind == hid_collection ||
296: item->kind == hid_endcollection;
297:
298: for (vlind = 0; vlind < vlsize; vlind++) {
299: struct Susbvar *var;
300:
301: var = &varlist[vlind];
302:
303: var->matchindex = 0;
304:
305: if (!(var->mflags & MATCH_COLLECTIONS) && iscollection) {
306: /* Don't match collections for this variable */
307: var->matchindex = -1;
308: vlactive--;
309: } else if (!iscollection && !(var->mflags & MATCH_CONSTANTS) &&
310: (item->flags & HIO_CONST)) {
311: /*
312: * Don't match constants for this variable,
313: * but ignore the constant bit on collections.
314: */
315: var->matchindex = -1;
316: vlactive--;
317: } else if ((var->mflags & MATCH_WRITABLE) &&
318: ((item->kind != hid_output &&
319: item->kind != hid_feature) ||
320: (item->flags & HIO_CONST))) {
321: /*
322: * If we are only matching writable items, if
323: * this is not an output or feature kind, or
324: * it is a constant, reject it.
325: */
326: var->matchindex = -1;
327: vlactive--;
328: } else if (var->mflags & MATCH_ALL) {
329: /* Match immediately */
330: return &varlist[vlind];
331: }
332: }
333:
1.4 nate 334: /*
335: * Loop through each usage in the collection list, including
336: * the 'item' itself on the final iteration. For each usage,
337: * test which variables named in the rule list are still
338: * applicable - if any.
339: */
1.1 pvalchev 340: for (colind = 0; vlactive > 0 && colind <= collen; colind++) {
1.4 nate 341: struct usagedata cache;
1.1 pvalchev 342:
1.4 nate 343: cache.isfinal = (colind == collen);
344: if (cache.isfinal)
345: cache.usage_id = item->usage;
1.1 pvalchev 346: else
1.4 nate 347: cache.usage_id = collist[colind];
1.1 pvalchev 348:
1.4 nate 349: cache.usage_name = NULL;
350: cache.page_name = NULL;
1.1 pvalchev 351:
1.4 nate 352: /*
353: * Loop through each rule, testing whether the rule is
354: * still applicable or not. For each rule,
355: * 'matchindex' retains the current match state as an
356: * index into the variable name string, or -1 if this
357: * rule has been proven not to match.
358: */
1.1 pvalchev 359: for (vlind = 0; vlind < vlsize; vlind++) {
360: struct Susbvar *var;
1.4 nate 361: int matchres;
1.1 pvalchev 362:
363: var = &varlist[vlind];
364:
1.4 nate 365: if (var->matchindex < 0)
1.1 pvalchev 366: /* Mismatch at a previous level */
367: continue;
368:
1.4 nate 369: matchres = hidtestrule(var, &cache);
1.1 pvalchev 370:
1.4 nate 371: if (matchres < 0) {
372: /* Bad match */
1.1 pvalchev 373: var->matchindex = -1;
374: vlactive--;
375: continue;
1.4 nate 376: } else if (matchres > 0) {
377: /* Complete match */
378: return var;
1.1 pvalchev 379: }
380: }
381: }
382:
383: return NULL;
384: }
385:
386: static void
387: allocreport(struct Sreport *report, report_desc_t rd, int repindex)
388: {
389: int reptsize;
390:
1.4 nate 391: reptsize = hid_report_size(rd, reptoparam[repindex].hid_kind, reportid);
1.1 pvalchev 392: if (reptsize < 0)
393: errx(1, "Negative report size");
394: report->size = reptsize;
395:
396: if (report->size > 0) {
1.16 anton 397: report->buffer = malloc(sizeof(*report->buffer));
1.1 pvalchev 398: if (report->buffer == NULL)
399: err(1, NULL);
400: } else
401: report->buffer = NULL;
402:
403: report->status = srs_clean;
404: }
405:
406: static void
407: freereport(struct Sreport *report)
408: {
1.12 mmcc 409: free(report->buffer);
1.1 pvalchev 410: report->status = srs_uninit;
411: }
412:
413: static void
414: getreport(struct Sreport *report, int hidfd, report_desc_t rd, int repindex)
415: {
416: if (report->status == srs_uninit) {
417: allocreport(report, rd, repindex);
418: if (report->size == 0)
419: return;
420:
1.3 nate 421: report->buffer->ucr_report = reptoparam[repindex].uhid_report;
1.15 deraadt 422: if (ioctl(hidfd, USB_GET_REPORT, report->buffer) == -1)
1.4 nate 423: err(1, "USB_GET_REPORT (probably not supported by "
424: "device)");
1.1 pvalchev 425: }
426: }
427:
428: static void
429: setreport(struct Sreport *report, int hidfd, int repindex)
430: {
431: if (report->status == srs_dirty) {
1.3 nate 432: report->buffer->ucr_report = reptoparam[repindex].uhid_report;
1.1 pvalchev 433:
1.15 deraadt 434: if (ioctl(hidfd, USB_SET_REPORT, report->buffer) == -1)
1.1 pvalchev 435: err(1, "USB_SET_REPORT(%s)",
436: reptoparam[repindex].name);
437:
438: report->status = srs_clean;
439: }
440: }
441:
442: static int
443: varop_value(struct hid_item *item, struct Susbvar *var,
444: u_int32_t const *collist, size_t collen, u_char *buf)
445: {
446: printf("%d\n", hid_get_data(buf, item));
447: return 0;
448: }
449:
450: static int
451: varop_display(struct hid_item *item, struct Susbvar *var,
452: u_int32_t const *collist, size_t collen, u_char *buf)
453: {
454: size_t colitem;
1.4 nate 455: int val, i;
1.1 pvalchev 456:
1.4 nate 457: for (i = 0; i < item->report_count; i++) {
458: for (colitem = 0; colitem < collen; colitem++) {
459: if (var->mflags & MATCH_SHOWPAGENAME)
460: printf("%s:",
461: hid_usage_page(HID_PAGE(collist[colitem])));
462: printf("%s.", hid_usage_in_page(collist[colitem]));
463: }
1.1 pvalchev 464: if (var->mflags & MATCH_SHOWPAGENAME)
1.4 nate 465: printf("%s:", hid_usage_page(HID_PAGE(item->usage)));
466: val = hid_get_data(buf, item);
467: item->pos += item->report_size;
468: if (item->usage_minimum != 0 || item->usage_maximum != 0) {
469: val += item->usage_minimum;
470: printf("%s=1", hid_usage_in_page(val));
471: } else {
472: printf("%s=%d%s", hid_usage_in_page(item->usage),
473: val, item->flags & HIO_CONST ? " (const)" : "");
474: }
475: if (item->report_count > 1)
476: printf(" [%d]", i);
477: printf("\n");
1.1 pvalchev 478: }
479: return 0;
480: }
481:
482: static int
483: varop_modify(struct hid_item *item, struct Susbvar *var,
484: u_int32_t const *collist, size_t collen, u_char *buf)
485: {
486: u_int dataval;
487:
488: dataval = (u_int)strtol(var->value, NULL, 10);
489:
490: hid_set_data(buf, item, dataval);
491:
1.4 nate 492: if (var->mflags & MATCH_SHOWVALUES)
493: /* Display set value */
1.1 pvalchev 494: varop_display(item, var, collist, collen, buf);
495:
496: return 1;
497: }
498:
499: static void
500: reportitem(char const *label, struct hid_item const *item, unsigned int mflags)
501: {
1.4 nate 502: int isconst = item->flags & HIO_CONST,
503: isvar = item->flags & HIO_VARIABLE;
504: printf("%s size=%d count=%d%s%s page=%s", label,
1.1 pvalchev 505: item->report_size, item->report_count,
1.4 nate 506: isconst ? " Const" : "",
507: !isvar && !isconst ? " Array" : "",
508: hid_usage_page(HID_PAGE(item->usage)));
509: if (item->usage_minimum != 0 || item->usage_maximum != 0) {
510: printf(" usage=%s..%s", hid_usage_in_page(item->usage_minimum),
511: hid_usage_in_page(item->usage_maximum));
512: if (mflags & MATCH_SHOWNUMERIC)
513: printf(" (%u:0x%x..%u:0x%x)",
514: HID_PAGE(item->usage_minimum),
515: HID_USAGE(item->usage_minimum),
516: HID_PAGE(item->usage_maximum),
517: HID_USAGE(item->usage_maximum));
518: } else {
519: printf(" usage=%s", hid_usage_in_page(item->usage));
520: if (mflags & MATCH_SHOWNUMERIC)
521: printf(" (%u:0x%x)",
522: HID_PAGE(item->usage), HID_USAGE(item->usage));
523: }
1.1 pvalchev 524: printf(", logical range %d..%d",
525: item->logical_minimum, item->logical_maximum);
526: if (item->physical_minimum != item->physical_maximum)
527: printf(", physical range %d..%d",
528: item->physical_minimum, item->physical_maximum);
529: if (item->unit)
530: printf(", unit=0x%02x exp=%d", item->unit,
531: item->unit_exponent);
532: printf("\n");
533: }
534:
535: static int
536: varop_report(struct hid_item *item, struct Susbvar *var,
537: u_int32_t const *collist, size_t collen, u_char *buf)
538: {
539: switch (item->kind) {
540: case hid_collection:
1.4 nate 541: printf("Collection page=%s usage=%s",
1.1 pvalchev 542: hid_usage_page(HID_PAGE(item->usage)),
543: hid_usage_in_page(item->usage));
1.4 nate 544: if (var->mflags & MATCH_SHOWNUMERIC)
545: printf(" (%u:0x%x)\n",
546: HID_PAGE(item->usage), HID_USAGE(item->usage));
547: else
548: printf("\n");
1.1 pvalchev 549: break;
550: case hid_endcollection:
551: printf("End collection\n");
552: break;
553: case hid_input:
554: reportitem("Input ", item, var->mflags);
555: break;
556: case hid_output:
557: reportitem("Output ", item, var->mflags);
558: break;
559: case hid_feature:
560: reportitem("Feature", item, var->mflags);
561: break;
562: }
563:
564: return 0;
565: }
566:
567: static void
568: devloop(int hidfd, report_desc_t rd, struct Susbvar *varlist, size_t vlsize)
569: {
1.4 nate 570: u_char *dbuf;
1.1 pvalchev 571: struct hid_data *hdata;
1.4 nate 572: size_t collind, dlen;
1.1 pvalchev 573: struct hid_item hitem;
574: u_int32_t colls[128];
575: struct Sreport inreport;
576:
577: allocreport(&inreport, rd, REPORT_INPUT);
578:
579: if (inreport.size <= 0)
580: errx(1, "Input report descriptor invalid length");
581:
582: dlen = inreport.size;
1.3 nate 583: dbuf = inreport.buffer->ucr_data;
1.1 pvalchev 584:
585: for (;;) {
586: ssize_t readlen;
587:
588: readlen = read(hidfd, dbuf, dlen);
1.15 deraadt 589: if (readlen == -1)
1.4 nate 590: err(1, "Device read error");
591: if (dlen != (size_t)readlen)
592: errx(1, "Unexpected response length: %lu != %lu",
593: (unsigned long)readlen, (unsigned long)dlen);
1.1 pvalchev 594:
595: collind = 0;
1.4 nate 596: hdata = hid_start_parse(rd, 1 << hid_input, reportid);
1.1 pvalchev 597: if (hdata == NULL)
598: errx(1, "Failed to start parser");
599:
600: while (hid_get_item(hdata, &hitem)) {
601: struct Susbvar *matchvar;
602:
603: switch (hitem.kind) {
604: case hid_collection:
605: if (collind >= (sizeof(colls) / sizeof(*colls)))
606: errx(1, "Excessive nested collections");
607: colls[collind++] = hitem.usage;
608: break;
609: case hid_endcollection:
610: if (collind == 0)
611: errx(1, "Excessive collection ends");
612: collind--;
613: break;
614: case hid_input:
615: break;
616: case hid_output:
617: case hid_feature:
618: errx(1, "Unexpected non-input item returned");
619: }
620:
1.4 nate 621: if (reportid != -1 && hitem.report_ID != reportid)
622: continue;
623:
1.1 pvalchev 624: matchvar = hidmatch(colls, collind, &hitem,
625: varlist, vlsize);
626:
627: if (matchvar != NULL)
628: matchvar->opfunc(&hitem, matchvar,
629: colls, collind,
1.3 nate 630: inreport.buffer->ucr_data);
1.1 pvalchev 631: }
632: hid_end_parse(hdata);
633: printf("\n");
634: }
635: /* NOTREACHED */
636: }
637:
638: static void
639: devshow(int hidfd, report_desc_t rd, struct Susbvar *varlist, size_t vlsize,
640: int kindset)
641: {
642: struct hid_data *hdata;
1.4 nate 643: size_t collind, repind, vlind;
1.1 pvalchev 644: struct hid_item hitem;
645: u_int32_t colls[128];
646: struct Sreport reports[REPORT_MAXVAL + 1];
647:
648:
649: for (repind = 0; repind < (sizeof(reports) / sizeof(*reports));
650: repind++) {
651: reports[repind].status = srs_uninit;
652: reports[repind].buffer = NULL;
653: }
654:
655: collind = 0;
1.4 nate 656: hdata = hid_start_parse(rd, kindset, reportid);
1.1 pvalchev 657: if (hdata == NULL)
658: errx(1, "Failed to start parser");
659:
660: while (hid_get_item(hdata, &hitem)) {
661: struct Susbvar *matchvar;
662: int repindex;
663:
1.4 nate 664: if (verbose > 3)
665: printf("item: kind=%d repid=%d usage=0x%x\n",
666: hitem.kind, hitem.report_ID, hitem.usage);
1.1 pvalchev 667: repindex = -1;
668: switch (hitem.kind) {
669: case hid_collection:
670: if (collind >= (sizeof(colls) / sizeof(*colls)))
671: errx(1, "Excessive nested collections");
672: colls[collind++] = hitem.usage;
673: break;
674: case hid_endcollection:
675: if (collind == 0)
676: errx(1, "Excessive collection ends");
677: collind--;
678: break;
679: case hid_input:
680: repindex = REPORT_INPUT;
681: break;
682: case hid_output:
683: repindex = REPORT_OUTPUT;
684: break;
685: case hid_feature:
686: repindex = REPORT_FEATURE;
687: break;
688: }
689:
1.4 nate 690: if (reportid != -1 && hitem.report_ID != reportid)
691: continue;
692:
1.1 pvalchev 693: matchvar = hidmatch(colls, collind, &hitem, varlist, vlsize);
694:
695: if (matchvar != NULL) {
696: u_char *bufdata;
697: struct Sreport *repptr;
698:
699: matchvar->mflags |= MATCH_WASMATCHED;
700:
701: if (repindex >= 0)
702: repptr = &reports[repindex];
703: else
704: repptr = NULL;
705:
706: if (repptr != NULL &&
707: !(matchvar->mflags & MATCH_NODATA))
708: getreport(repptr, hidfd, rd, repindex);
709:
710: bufdata = (repptr == NULL || repptr->buffer == NULL) ?
1.3 nate 711: NULL : repptr->buffer->ucr_data;
1.1 pvalchev 712:
713: if (matchvar->opfunc(&hitem, matchvar, colls, collind,
714: bufdata))
715: repptr->status = srs_dirty;
716: }
717: }
718: hid_end_parse(hdata);
719:
720: for (repind = 0; repind < (sizeof(reports) / sizeof(*reports));
721: repind++) {
722: setreport(&reports[repind], hidfd, repind);
723: freereport(&reports[repind]);
724: }
725:
726: /* Warn about any items that we couldn't find a match for */
727: for (vlind = 0; vlind < vlsize; vlind++) {
728: struct Susbvar *var;
729:
730: var = &varlist[vlind];
731:
732: if (var->variable != NULL &&
733: !(var->mflags & MATCH_WASMATCHED))
734: warnx("Failed to match: %.*s", (int)var->varlen,
735: var->variable);
736: }
737: }
738:
739: static void
740: usage(void)
741: {
742: extern char *__progname;
743:
1.9 jakemsr 744: fprintf(stderr, "usage: %s -f device [-t table] [-alv]\n",
1.1 pvalchev 745: __progname);
1.5 jmc 746: fprintf(stderr, " %s -f device [-t table] [-v] -r\n",
1.1 pvalchev 747: __progname);
748: fprintf(stderr,
1.5 jmc 749: " %s -f device [-t table] [-lnv] name ...\n",
1.1 pvalchev 750: __progname);
751: fprintf(stderr,
1.5 jmc 752: " %s -f device [-t table] -w name=value ...\n",
1.1 pvalchev 753: __progname);
1.17 jcs 754: fprintf(stderr, " %s -f device -R\n", __progname);
1.1 pvalchev 755: exit(1);
756: }
757:
758: int
759: main(int argc, char **argv)
760: {
1.4 nate 761: char const *dev;
762: char const *table;
763: size_t varnum;
1.17 jcs 764: uint32_t repsize;
765: int aflag, lflag, nflag, rflag, Rflag, wflag;
766: int ch, hidfd, x;
767: uint8_t *repdata;
1.1 pvalchev 768: report_desc_t repdesc;
769: char devnamebuf[PATH_MAX];
770: struct Susbvar variables[128];
771:
1.17 jcs 772: wflag = aflag = nflag = verbose = rflag = Rflag = lflag = 0;
1.1 pvalchev 773: dev = NULL;
774: table = NULL;
1.19 cheloha 775: while ((ch = getopt(argc, argv, "af:lnRrt:vw")) != -1) {
1.1 pvalchev 776: switch (ch) {
777: case 'a':
778: aflag = 1;
779: break;
780: case 'f':
781: dev = optarg;
782: break;
783: case 'l':
784: lflag = 1;
785: break;
786: case 'n':
787: nflag = 1;
788: break;
789: case 'r':
790: rflag = 1;
791: break;
1.17 jcs 792: case 'R':
793: Rflag = 1;
794: break;
1.1 pvalchev 795: case 't':
796: table = optarg;
797: break;
798: case 'v':
799: verbose++;
800: break;
801: case 'w':
802: wflag = 1;
803: break;
804: default:
805: usage();
806: /* NOTREACHED */
807: }
808: }
809: argc -= optind;
810: argv += optind;
1.17 jcs 811: if (dev == NULL || (lflag && (wflag || rflag || Rflag)) ||
812: (rflag && Rflag)) {
1.1 pvalchev 813: /*
814: * No device specified, or attempting to loop and set
815: * or dump report at the same time
816: */
817: usage();
818: /* NOTREACHED */
819: }
1.9 jakemsr 820:
821: if (argc == 0 && rflag == 0)
822: aflag = 1;
1.1 pvalchev 823:
824: for (varnum = 0; varnum < (size_t)argc; varnum++) {
825: char const *name, *valuesep;
826: struct Susbvar *svar;
827:
828: svar = &variables[varnum];
829: name = argv[varnum];
830: valuesep = strchr(name, DELIM_SET);
831:
832: svar->variable = name;
833: svar->mflags = 0;
834:
835: if (valuesep == NULL) {
836: /* Read variable */
837: if (wflag)
838: errx(1, "Must not specify -w to read variables");
839: svar->value = NULL;
840: svar->varlen = strlen(name);
841:
842: if (nflag) {
843: /* Display value of variable only */
844: svar->opfunc = varop_value;
845: } else {
846: /* Display name and value of variable */
847: svar->opfunc = varop_display;
848:
849: if (verbose >= 1)
850: /* Show page names in verbose modes */
851: svar->mflags |= MATCH_SHOWPAGENAME;
852: }
853: } else {
854: /* Write variable */
855: if (!wflag)
856: errx(2, "Must specify -w to set variables");
857: svar->mflags |= MATCH_WRITABLE;
1.4 nate 858: if (verbose >= 1)
859: /*
860: * Allow displaying of set value in
861: * verbose mode. This isn't
862: * particularly useful though, so
863: * don't bother documenting it.
864: */
865: svar->mflags |= MATCH_SHOWVALUES;
1.1 pvalchev 866: svar->varlen = valuesep - name;
867: svar->value = valuesep + 1;
868: svar->opfunc = varop_modify;
869: }
870: }
871:
872: if (aflag || rflag) {
873: struct Susbvar *svar;
874:
875: svar = &variables[varnum++];
876:
877: svar->variable = NULL;
878: svar->mflags = MATCH_ALL;
879:
880: if (rflag) {
881: /*
882: * Dump report descriptor. Do dump collection
883: * items also, and hint that it won't be
884: * necessary to get the item status.
885: */
886: svar->opfunc = varop_report;
887: svar->mflags |= MATCH_COLLECTIONS | MATCH_NODATA;
888:
889: switch (verbose) {
890: default:
891: /* Level 2: Show item numerics and constants */
892: svar->mflags |= MATCH_SHOWNUMERIC;
893: /* FALLTHROUGH */
894: case 1:
895: /* Level 1: Just show constants */
896: svar->mflags |= MATCH_CONSTANTS;
897: /* FALLTHROUGH */
898: case 0:
899: break;
900: }
901: } else {
902: /* Display name and value of variable */
903: svar->opfunc = varop_display;
904:
905: switch (verbose) {
906: default:
907: /* Level 2: Show constants and page names */
908: svar->mflags |= MATCH_CONSTANTS;
909: /* FALLTHROUGH */
910: case 1:
911: /* Level 1: Just show page names */
912: svar->mflags |= MATCH_SHOWPAGENAME;
913: /* FALLTHROUGH */
914: case 0:
915: break;
916: }
917: }
918: }
919:
920: if (varnum == 0) {
921: /* Nothing to do... Display usage information. */
922: usage();
923: /* NOTREACHED */
924: }
925:
1.6 deraadt 926: if (hid_start(table) == -1)
927: errx(1, "hid_init");
1.1 pvalchev 928:
929: if (dev[0] != '/') {
930: snprintf(devnamebuf, sizeof(devnamebuf), "/dev/%s%s",
1.11 deraadt 931: isdigit((unsigned char)dev[0]) ? "uhid" : "", dev);
1.1 pvalchev 932: dev = devnamebuf;
933: }
934:
1.10 miod 935: hidfd = open(dev, wflag ? O_RDWR : O_RDONLY);
1.15 deraadt 936: if (hidfd == -1)
1.1 pvalchev 937: err(1, "%s", dev);
1.18 mestre 938:
939: if (unveil("/", "") == -1)
940: err(1, "unveil /");
941: if (unveil(NULL, NULL) == -1)
942: err(1, "unveil");
1.1 pvalchev 943:
1.15 deraadt 944: if (ioctl(hidfd, USB_GET_REPORT_ID, &reportid) == -1)
1.4 nate 945: reportid = -1;
946: if (verbose > 1)
947: printf("report ID=%d\n", reportid);
1.1 pvalchev 948: repdesc = hid_get_report_desc(hidfd);
949: if (repdesc == 0)
950: errx(1, "USB_GET_REPORT_DESC");
951:
1.17 jcs 952: if (Rflag) {
953: hid_get_report_desc_data(repdesc, &repdata, &repsize);
954:
955: for (x = 0; x < repsize; x++)
956: printf("%s0x%02x", x > 0 ? " " : "", repdata[x]);
957: printf("\n");
958: }
959:
1.1 pvalchev 960: if (lflag) {
961: devloop(hidfd, repdesc, variables, varnum);
962: /* NOTREACHED */
963: }
964:
965: if (rflag)
966: /* Report mode header */
967: printf("Report descriptor:\n");
968:
1.17 jcs 969: if (!Rflag)
970: devshow(hidfd, repdesc, variables, varnum,
971: 1 << hid_input |
972: 1 << hid_output |
973: 1 << hid_feature);
1.1 pvalchev 974:
975: if (rflag) {
976: /* Report mode trailer */
977: size_t repindex;
978: for (repindex = 0;
979: repindex < (sizeof(reptoparam) / sizeof(*reptoparam));
980: repindex++) {
1.4 nate 981: int size;
1.1 pvalchev 982: size = hid_report_size(repdesc,
983: reptoparam[repindex].hid_kind,
1.4 nate 984: reportid);
985: printf("Total %7s size %d bytes\n",
986: reptoparam[repindex].name, size);
1.1 pvalchev 987: }
988: }
989:
990: hid_dispose_report_desc(repdesc);
991: exit(0);
992: /* NOTREACHED */
993: }