| 1 | /* | 
|---|
| 2 | * Copyright (c) 2010 Vojtech Horky | 
|---|
| 3 | * All rights reserved. | 
|---|
| 4 | * | 
|---|
| 5 | * Redistribution and use in source and binary forms, with or without | 
|---|
| 6 | * modification, are permitted provided that the following conditions | 
|---|
| 7 | * are met: | 
|---|
| 8 | * | 
|---|
| 9 | * - Redistributions of source code must retain the above copyright | 
|---|
| 10 | *   notice, this list of conditions and the following disclaimer. | 
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright | 
|---|
| 12 | *   notice, this list of conditions and the following disclaimer in the | 
|---|
| 13 | *   documentation and/or other materials provided with the distribution. | 
|---|
| 14 | * - The name of the author may not be used to endorse or promote products | 
|---|
| 15 | *   derived from this software without specific prior written permission. | 
|---|
| 16 | * | 
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | 
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | 
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | 
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | 
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | 
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
|---|
| 27 | */ | 
|---|
| 28 |  | 
|---|
| 29 | /** @addtogroup usbinfo | 
|---|
| 30 | * @{ | 
|---|
| 31 | */ | 
|---|
| 32 | /** | 
|---|
| 33 | * @file | 
|---|
| 34 | * USB querying. | 
|---|
| 35 | */ | 
|---|
| 36 |  | 
|---|
| 37 | #include <stdio.h> | 
|---|
| 38 | #include <stdlib.h> | 
|---|
| 39 | #include <errno.h> | 
|---|
| 40 | #include <str_error.h> | 
|---|
| 41 | #include <bool.h> | 
|---|
| 42 |  | 
|---|
| 43 | #include <usb/usb.h> | 
|---|
| 44 | #include <usb/descriptor.h> | 
|---|
| 45 | #include <usb/debug.h> | 
|---|
| 46 | #include <usb/classes/classes.h> | 
|---|
| 47 |  | 
|---|
| 48 | #include "usbinfo.h" | 
|---|
| 49 | #include <usb/dev/dp.h> | 
|---|
| 50 |  | 
|---|
| 51 | #define INDENT "  " | 
|---|
| 52 | #define BYTES_PER_LINE 12 | 
|---|
| 53 |  | 
|---|
| 54 |  | 
|---|
| 55 | const char *get_indent(size_t level) | 
|---|
| 56 | { | 
|---|
| 57 | static const char *indents[] = { | 
|---|
| 58 | INDENT, | 
|---|
| 59 | INDENT INDENT, | 
|---|
| 60 | INDENT INDENT INDENT, | 
|---|
| 61 | INDENT INDENT INDENT INDENT, | 
|---|
| 62 | INDENT INDENT INDENT INDENT INDENT | 
|---|
| 63 | }; | 
|---|
| 64 | static size_t indents_count = sizeof(indents)/sizeof(indents[0]); | 
|---|
| 65 | if (level >= indents_count) { | 
|---|
| 66 | return indents[indents_count - 1]; | 
|---|
| 67 | } | 
|---|
| 68 | return indents[level]; | 
|---|
| 69 | } | 
|---|
| 70 |  | 
|---|
| 71 | void dump_buffer(const char *msg, size_t indent, | 
|---|
| 72 | const uint8_t *buffer, size_t length) | 
|---|
| 73 | { | 
|---|
| 74 | if (msg != NULL) { | 
|---|
| 75 | printf("%s\n", msg); | 
|---|
| 76 | } | 
|---|
| 77 |  | 
|---|
| 78 | size_t i; | 
|---|
| 79 | if (length > 0) { | 
|---|
| 80 | printf("%s", get_indent(indent)); | 
|---|
| 81 | } | 
|---|
| 82 | for (i = 0; i < length; i++) { | 
|---|
| 83 | printf("0x%02X", buffer[i]); | 
|---|
| 84 | if (((i > 0) && (((i+1) % BYTES_PER_LINE) == 0)) | 
|---|
| 85 | || (i + 1 == length)) { | 
|---|
| 86 | printf("\n"); | 
|---|
| 87 | if (i + 1 < length) { | 
|---|
| 88 | printf("%s", get_indent(indent)); | 
|---|
| 89 | } | 
|---|
| 90 | } else { | 
|---|
| 91 | printf("  "); | 
|---|
| 92 | } | 
|---|
| 93 | } | 
|---|
| 94 | } | 
|---|
| 95 |  | 
|---|
| 96 | void dump_usb_descriptor(uint8_t *descriptor, size_t size) | 
|---|
| 97 | { | 
|---|
| 98 | printf("Device descriptor:\n"); | 
|---|
| 99 | usb_dump_standard_descriptor(stdout, get_indent(0), "\n", | 
|---|
| 100 | descriptor, size); | 
|---|
| 101 | } | 
|---|
| 102 |  | 
|---|
| 103 | void dump_match_ids(match_id_list_t *matches, const char *line_prefix) | 
|---|
| 104 | { | 
|---|
| 105 | list_foreach(matches->ids, link) { | 
|---|
| 106 | match_id_t *match = list_get_instance(link, match_id_t, link); | 
|---|
| 107 |  | 
|---|
| 108 | printf("%s%3d %s\n", line_prefix, match->score, match->id); | 
|---|
| 109 | } | 
|---|
| 110 | } | 
|---|
| 111 |  | 
|---|
| 112 | static void dump_tree_descriptor(uint8_t *descriptor, size_t depth) | 
|---|
| 113 | { | 
|---|
| 114 | if (descriptor == NULL) { | 
|---|
| 115 | return; | 
|---|
| 116 | } | 
|---|
| 117 | int type = (int) *(descriptor + 1); | 
|---|
| 118 | const char *name = "unknown"; | 
|---|
| 119 | switch (type) { | 
|---|
| 120 | #define _TYPE(descriptor_type) \ | 
|---|
| 121 | case USB_DESCTYPE_##descriptor_type: name = #descriptor_type; break | 
|---|
| 122 | _TYPE(DEVICE); | 
|---|
| 123 | _TYPE(CONFIGURATION); | 
|---|
| 124 | _TYPE(STRING); | 
|---|
| 125 | _TYPE(INTERFACE); | 
|---|
| 126 | _TYPE(ENDPOINT); | 
|---|
| 127 | _TYPE(HID); | 
|---|
| 128 | _TYPE(HID_REPORT); | 
|---|
| 129 | _TYPE(HID_PHYSICAL); | 
|---|
| 130 | _TYPE(HUB); | 
|---|
| 131 | #undef _TYPE | 
|---|
| 132 | } | 
|---|
| 133 | printf("%s%s (0x%02X):\n", get_indent(depth), name, type); | 
|---|
| 134 | usb_dump_standard_descriptor(stdout, get_indent(depth), "\n", | 
|---|
| 135 | descriptor, descriptor[0]); | 
|---|
| 136 | } | 
|---|
| 137 |  | 
|---|
| 138 | static void dump_tree_internal(usb_dp_parser_t *parser, usb_dp_parser_data_t *data, | 
|---|
| 139 | uint8_t *root, size_t depth) | 
|---|
| 140 | { | 
|---|
| 141 | if (root == NULL) { | 
|---|
| 142 | return; | 
|---|
| 143 | } | 
|---|
| 144 | dump_tree_descriptor(root, depth); | 
|---|
| 145 | uint8_t *child = usb_dp_get_nested_descriptor(parser, data, root); | 
|---|
| 146 | do { | 
|---|
| 147 | dump_tree_internal(parser, data, child, depth + 1); | 
|---|
| 148 | child = usb_dp_get_sibling_descriptor(parser, data, root, child); | 
|---|
| 149 | } while (child != NULL); | 
|---|
| 150 | } | 
|---|
| 151 |  | 
|---|
| 152 | static void dump_tree(usb_dp_parser_t *parser, usb_dp_parser_data_t *data) | 
|---|
| 153 | { | 
|---|
| 154 | uint8_t *ptr = data->data; | 
|---|
| 155 | printf("Descriptor tree:\n"); | 
|---|
| 156 | dump_tree_internal(parser, data, ptr, 0); | 
|---|
| 157 | } | 
|---|
| 158 |  | 
|---|
| 159 | #define NESTING(parentname, childname) \ | 
|---|
| 160 | { \ | 
|---|
| 161 | .child = USB_DESCTYPE_##childname, \ | 
|---|
| 162 | .parent = USB_DESCTYPE_##parentname, \ | 
|---|
| 163 | } | 
|---|
| 164 | #define LAST_NESTING { -1, -1 } | 
|---|
| 165 |  | 
|---|
| 166 | static usb_dp_descriptor_nesting_t descriptor_nesting[] = { | 
|---|
| 167 | NESTING(CONFIGURATION, INTERFACE), | 
|---|
| 168 | NESTING(INTERFACE, ENDPOINT), | 
|---|
| 169 | NESTING(INTERFACE, HUB), | 
|---|
| 170 | NESTING(INTERFACE, HID), | 
|---|
| 171 | NESTING(HID, HID_REPORT), | 
|---|
| 172 | LAST_NESTING | 
|---|
| 173 | }; | 
|---|
| 174 |  | 
|---|
| 175 | static usb_dp_parser_t parser = { | 
|---|
| 176 | .nesting = descriptor_nesting | 
|---|
| 177 | }; | 
|---|
| 178 |  | 
|---|
| 179 | void dump_descriptor_tree(uint8_t *descriptors, size_t length) | 
|---|
| 180 | { | 
|---|
| 181 | usb_dp_parser_data_t data = { | 
|---|
| 182 | .data = descriptors, | 
|---|
| 183 | .size = length, | 
|---|
| 184 | .arg = NULL | 
|---|
| 185 | }; | 
|---|
| 186 |  | 
|---|
| 187 | dump_tree(&parser, &data); | 
|---|
| 188 | } | 
|---|
| 189 |  | 
|---|
| 190 | /** @} | 
|---|
| 191 | */ | 
|---|