2 * HID support for Linux
4 * Copyright (c) 1999 Andreas Gal
5 * Copyright (c) 2000-2005 Vojtech Pavlik <vojtech@suse.cz>
6 * Copyright (c) 2005 Michael Haboustak <mike-@cinci.rr.com> for Concept2, Inc
7 * Copyright (c) 2006 Jiri Kosina
11 * This program is free software; you can redistribute it and/or modify it
12 * under the terms of the GNU General Public License as published by the Free
13 * Software Foundation; either version 2 of the License, or (at your option)
17 #include <linux/module.h>
18 #include <linux/slab.h>
19 #include <linux/init.h>
20 #include <linux/kernel.h>
21 #include <linux/sched.h>
22 #include <linux/list.h>
24 #include <linux/smp_lock.h>
25 #include <linux/spinlock.h>
26 #include <asm/unaligned.h>
27 #include <asm/byteorder.h>
28 #include <linux/input.h>
29 #include <linux/wait.h>
34 #include <linux/hid.h>
35 #include <linux/hiddev.h>
41 #define DRIVER_VERSION "v2.6"
42 #define DRIVER_AUTHOR "Andreas Gal, Vojtech Pavlik"
43 #define DRIVER_DESC "HID core driver"
44 #define DRIVER_LICENSE "GPL"
47 * Register a new report for a device.
50 static struct hid_report
*hid_register_report(struct hid_device
*device
, unsigned type
, unsigned id
)
52 struct hid_report_enum
*report_enum
= device
->report_enum
+ type
;
53 struct hid_report
*report
;
55 if (report_enum
->report_id_hash
[id
])
56 return report_enum
->report_id_hash
[id
];
58 if (!(report
= kzalloc(sizeof(struct hid_report
), GFP_KERNEL
)))
62 report_enum
->numbered
= 1;
67 report
->device
= device
;
68 report_enum
->report_id_hash
[id
] = report
;
70 list_add_tail(&report
->list
, &report_enum
->report_list
);
76 * Register a new field for this report.
79 static struct hid_field
*hid_register_field(struct hid_report
*report
, unsigned usages
, unsigned values
)
81 struct hid_field
*field
;
83 if (report
->maxfield
== HID_MAX_FIELDS
) {
84 dbg("too many fields in report");
88 if (!(field
= kzalloc(sizeof(struct hid_field
) + usages
* sizeof(struct hid_usage
)
89 + values
* sizeof(unsigned), GFP_KERNEL
))) return NULL
;
91 field
->index
= report
->maxfield
++;
92 report
->field
[field
->index
] = field
;
93 field
->usage
= (struct hid_usage
*)(field
+ 1);
94 field
->value
= (unsigned *)(field
->usage
+ usages
);
95 field
->report
= report
;
101 * Open a collection. The type/usage is pushed on the stack.
104 static int open_collection(struct hid_parser
*parser
, unsigned type
)
106 struct hid_collection
*collection
;
109 usage
= parser
->local
.usage
[0];
111 if (parser
->collection_stack_ptr
== HID_COLLECTION_STACK_SIZE
) {
112 dbg("collection stack overflow");
116 if (parser
->device
->maxcollection
== parser
->device
->collection_size
) {
117 collection
= kmalloc(sizeof(struct hid_collection
) *
118 parser
->device
->collection_size
* 2, GFP_KERNEL
);
119 if (collection
== NULL
) {
120 dbg("failed to reallocate collection array");
123 memcpy(collection
, parser
->device
->collection
,
124 sizeof(struct hid_collection
) *
125 parser
->device
->collection_size
);
126 memset(collection
+ parser
->device
->collection_size
, 0,
127 sizeof(struct hid_collection
) *
128 parser
->device
->collection_size
);
129 kfree(parser
->device
->collection
);
130 parser
->device
->collection
= collection
;
131 parser
->device
->collection_size
*= 2;
134 parser
->collection_stack
[parser
->collection_stack_ptr
++] =
135 parser
->device
->maxcollection
;
137 collection
= parser
->device
->collection
+
138 parser
->device
->maxcollection
++;
139 collection
->type
= type
;
140 collection
->usage
= usage
;
141 collection
->level
= parser
->collection_stack_ptr
- 1;
143 if (type
== HID_COLLECTION_APPLICATION
)
144 parser
->device
->maxapplication
++;
150 * Close a collection.
153 static int close_collection(struct hid_parser
*parser
)
155 if (!parser
->collection_stack_ptr
) {
156 dbg("collection stack underflow");
159 parser
->collection_stack_ptr
--;
164 * Climb up the stack, search for the specified collection type
165 * and return the usage.
168 static unsigned hid_lookup_collection(struct hid_parser
*parser
, unsigned type
)
171 for (n
= parser
->collection_stack_ptr
- 1; n
>= 0; n
--)
172 if (parser
->device
->collection
[parser
->collection_stack
[n
]].type
== type
)
173 return parser
->device
->collection
[parser
->collection_stack
[n
]].usage
;
174 return 0; /* we know nothing about this usage type */
178 * Add a usage to the temporary parser table.
181 static int hid_add_usage(struct hid_parser
*parser
, unsigned usage
)
183 if (parser
->local
.usage_index
>= HID_MAX_USAGES
) {
184 dbg("usage index exceeded");
187 parser
->local
.usage
[parser
->local
.usage_index
] = usage
;
188 parser
->local
.collection_index
[parser
->local
.usage_index
] =
189 parser
->collection_stack_ptr
?
190 parser
->collection_stack
[parser
->collection_stack_ptr
- 1] : 0;
191 parser
->local
.usage_index
++;
196 * Register a new field for this report.
199 static int hid_add_field(struct hid_parser
*parser
, unsigned report_type
, unsigned flags
)
201 struct hid_report
*report
;
202 struct hid_field
*field
;
207 if (!(report
= hid_register_report(parser
->device
, report_type
, parser
->global
.report_id
))) {
208 dbg("hid_register_report failed");
212 if (parser
->global
.logical_maximum
< parser
->global
.logical_minimum
) {
213 dbg("logical range invalid %d %d", parser
->global
.logical_minimum
, parser
->global
.logical_maximum
);
217 offset
= report
->size
;
218 report
->size
+= parser
->global
.report_size
* parser
->global
.report_count
;
220 if (!parser
->local
.usage_index
) /* Ignore padding fields */
223 usages
= max_t(int, parser
->local
.usage_index
, parser
->global
.report_count
);
225 if ((field
= hid_register_field(report
, usages
, parser
->global
.report_count
)) == NULL
)
228 field
->physical
= hid_lookup_collection(parser
, HID_COLLECTION_PHYSICAL
);
229 field
->logical
= hid_lookup_collection(parser
, HID_COLLECTION_LOGICAL
);
230 field
->application
= hid_lookup_collection(parser
, HID_COLLECTION_APPLICATION
);
232 for (i
= 0; i
< usages
; i
++) {
234 /* Duplicate the last usage we parsed if we have excess values */
235 if (i
>= parser
->local
.usage_index
)
236 j
= parser
->local
.usage_index
- 1;
237 field
->usage
[i
].hid
= parser
->local
.usage
[j
];
238 field
->usage
[i
].collection_index
=
239 parser
->local
.collection_index
[j
];
242 field
->maxusage
= usages
;
243 field
->flags
= flags
;
244 field
->report_offset
= offset
;
245 field
->report_type
= report_type
;
246 field
->report_size
= parser
->global
.report_size
;
247 field
->report_count
= parser
->global
.report_count
;
248 field
->logical_minimum
= parser
->global
.logical_minimum
;
249 field
->logical_maximum
= parser
->global
.logical_maximum
;
250 field
->physical_minimum
= parser
->global
.physical_minimum
;
251 field
->physical_maximum
= parser
->global
.physical_maximum
;
252 field
->unit_exponent
= parser
->global
.unit_exponent
;
253 field
->unit
= parser
->global
.unit
;
259 * Read data value from item.
262 static u32
item_udata(struct hid_item
*item
)
264 switch (item
->size
) {
265 case 1: return item
->data
.u8
;
266 case 2: return item
->data
.u16
;
267 case 4: return item
->data
.u32
;
272 static s32
item_sdata(struct hid_item
*item
)
274 switch (item
->size
) {
275 case 1: return item
->data
.s8
;
276 case 2: return item
->data
.s16
;
277 case 4: return item
->data
.s32
;
283 * Process a global item.
286 static int hid_parser_global(struct hid_parser
*parser
, struct hid_item
*item
)
290 case HID_GLOBAL_ITEM_TAG_PUSH
:
292 if (parser
->global_stack_ptr
== HID_GLOBAL_STACK_SIZE
) {
293 dbg("global enviroment stack overflow");
297 memcpy(parser
->global_stack
+ parser
->global_stack_ptr
++,
298 &parser
->global
, sizeof(struct hid_global
));
301 case HID_GLOBAL_ITEM_TAG_POP
:
303 if (!parser
->global_stack_ptr
) {
304 dbg("global enviroment stack underflow");
308 memcpy(&parser
->global
, parser
->global_stack
+ --parser
->global_stack_ptr
,
309 sizeof(struct hid_global
));
312 case HID_GLOBAL_ITEM_TAG_USAGE_PAGE
:
313 parser
->global
.usage_page
= item_udata(item
);
316 case HID_GLOBAL_ITEM_TAG_LOGICAL_MINIMUM
:
317 parser
->global
.logical_minimum
= item_sdata(item
);
320 case HID_GLOBAL_ITEM_TAG_LOGICAL_MAXIMUM
:
321 if (parser
->global
.logical_minimum
< 0)
322 parser
->global
.logical_maximum
= item_sdata(item
);
324 parser
->global
.logical_maximum
= item_udata(item
);
327 case HID_GLOBAL_ITEM_TAG_PHYSICAL_MINIMUM
:
328 parser
->global
.physical_minimum
= item_sdata(item
);
331 case HID_GLOBAL_ITEM_TAG_PHYSICAL_MAXIMUM
:
332 if (parser
->global
.physical_minimum
< 0)
333 parser
->global
.physical_maximum
= item_sdata(item
);
335 parser
->global
.physical_maximum
= item_udata(item
);
338 case HID_GLOBAL_ITEM_TAG_UNIT_EXPONENT
:
339 parser
->global
.unit_exponent
= item_sdata(item
);
342 case HID_GLOBAL_ITEM_TAG_UNIT
:
343 parser
->global
.unit
= item_udata(item
);
346 case HID_GLOBAL_ITEM_TAG_REPORT_SIZE
:
347 if ((parser
->global
.report_size
= item_udata(item
)) > 32) {
348 dbg("invalid report_size %d", parser
->global
.report_size
);
353 case HID_GLOBAL_ITEM_TAG_REPORT_COUNT
:
354 if ((parser
->global
.report_count
= item_udata(item
)) > HID_MAX_USAGES
) {
355 dbg("invalid report_count %d", parser
->global
.report_count
);
360 case HID_GLOBAL_ITEM_TAG_REPORT_ID
:
361 if ((parser
->global
.report_id
= item_udata(item
)) == 0) {
362 dbg("report_id 0 is invalid");
368 dbg("unknown global tag 0x%x", item
->tag
);
374 * Process a local item.
377 static int hid_parser_local(struct hid_parser
*parser
, struct hid_item
*item
)
382 if (item
->size
== 0) {
383 dbg("item data expected for local item");
387 data
= item_udata(item
);
391 case HID_LOCAL_ITEM_TAG_DELIMITER
:
395 * We treat items before the first delimiter
396 * as global to all usage sets (branch 0).
397 * In the moment we process only these global
398 * items and the first delimiter set.
400 if (parser
->local
.delimiter_depth
!= 0) {
401 dbg("nested delimiters");
404 parser
->local
.delimiter_depth
++;
405 parser
->local
.delimiter_branch
++;
407 if (parser
->local
.delimiter_depth
< 1) {
408 dbg("bogus close delimiter");
411 parser
->local
.delimiter_depth
--;
415 case HID_LOCAL_ITEM_TAG_USAGE
:
417 if (parser
->local
.delimiter_branch
> 1) {
418 dbg("alternative usage ignored");
423 data
= (parser
->global
.usage_page
<< 16) + data
;
425 return hid_add_usage(parser
, data
);
427 case HID_LOCAL_ITEM_TAG_USAGE_MINIMUM
:
429 if (parser
->local
.delimiter_branch
> 1) {
430 dbg("alternative usage ignored");
435 data
= (parser
->global
.usage_page
<< 16) + data
;
437 parser
->local
.usage_minimum
= data
;
440 case HID_LOCAL_ITEM_TAG_USAGE_MAXIMUM
:
442 if (parser
->local
.delimiter_branch
> 1) {
443 dbg("alternative usage ignored");
448 data
= (parser
->global
.usage_page
<< 16) + data
;
450 for (n
= parser
->local
.usage_minimum
; n
<= data
; n
++)
451 if (hid_add_usage(parser
, n
)) {
452 dbg("hid_add_usage failed\n");
459 dbg("unknown local item tag 0x%x", item
->tag
);
466 * Process a main item.
469 static int hid_parser_main(struct hid_parser
*parser
, struct hid_item
*item
)
474 data
= item_udata(item
);
477 case HID_MAIN_ITEM_TAG_BEGIN_COLLECTION
:
478 ret
= open_collection(parser
, data
& 0xff);
480 case HID_MAIN_ITEM_TAG_END_COLLECTION
:
481 ret
= close_collection(parser
);
483 case HID_MAIN_ITEM_TAG_INPUT
:
484 ret
= hid_add_field(parser
, HID_INPUT_REPORT
, data
);
486 case HID_MAIN_ITEM_TAG_OUTPUT
:
487 ret
= hid_add_field(parser
, HID_OUTPUT_REPORT
, data
);
489 case HID_MAIN_ITEM_TAG_FEATURE
:
490 ret
= hid_add_field(parser
, HID_FEATURE_REPORT
, data
);
493 dbg("unknown main item tag 0x%x", item
->tag
);
497 memset(&parser
->local
, 0, sizeof(parser
->local
)); /* Reset the local parser environment */
503 * Process a reserved item.
506 static int hid_parser_reserved(struct hid_parser
*parser
, struct hid_item
*item
)
508 dbg("reserved item type, tag 0x%x", item
->tag
);
513 * Free a report and all registered fields. The field->usage and
514 * field->value table's are allocated behind the field, so we need
515 * only to free(field) itself.
518 static void hid_free_report(struct hid_report
*report
)
522 for (n
= 0; n
< report
->maxfield
; n
++)
523 kfree(report
->field
[n
]);
528 * Free a device structure, all reports, and all fields.
531 void hid_free_device(struct hid_device
*device
)
535 for (i
= 0; i
< HID_REPORT_TYPES
; i
++) {
536 struct hid_report_enum
*report_enum
= device
->report_enum
+ i
;
538 for (j
= 0; j
< 256; j
++) {
539 struct hid_report
*report
= report_enum
->report_id_hash
[j
];
541 hid_free_report(report
);
545 kfree(device
->rdesc
);
548 EXPORT_SYMBOL_GPL(hid_free_device
);
551 * Fetch a report description item from the data stream. We support long
552 * items, though they are not used yet.
555 static u8
*fetch_item(__u8
*start
, __u8
*end
, struct hid_item
*item
)
559 if ((end
- start
) <= 0)
564 item
->type
= (b
>> 2) & 3;
565 item
->tag
= (b
>> 4) & 15;
567 if (item
->tag
== HID_ITEM_TAG_LONG
) {
569 item
->format
= HID_ITEM_FORMAT_LONG
;
571 if ((end
- start
) < 2)
574 item
->size
= *start
++;
575 item
->tag
= *start
++;
577 if ((end
- start
) < item
->size
)
580 item
->data
.longdata
= start
;
585 item
->format
= HID_ITEM_FORMAT_SHORT
;
588 switch (item
->size
) {
594 if ((end
- start
) < 1)
596 item
->data
.u8
= *start
++;
600 if ((end
- start
) < 2)
602 item
->data
.u16
= le16_to_cpu(get_unaligned((__le16
*)start
));
603 start
= (__u8
*)((__le16
*)start
+ 1);
608 if ((end
- start
) < 4)
610 item
->data
.u32
= le32_to_cpu(get_unaligned((__le32
*)start
));
611 start
= (__u8
*)((__le32
*)start
+ 1);
619 * Parse a report description into a hid_device structure. Reports are
620 * enumerated, fields are attached to these reports.
623 struct hid_device
*hid_parse_report(__u8
*start
, unsigned size
)
625 struct hid_device
*device
;
626 struct hid_parser
*parser
;
627 struct hid_item item
;
630 static int (*dispatch_type
[])(struct hid_parser
*parser
,
631 struct hid_item
*item
) = {
638 if (!(device
= kzalloc(sizeof(struct hid_device
), GFP_KERNEL
)))
641 if (!(device
->collection
= kzalloc(sizeof(struct hid_collection
) *
642 HID_DEFAULT_NUM_COLLECTIONS
, GFP_KERNEL
))) {
646 device
->collection_size
= HID_DEFAULT_NUM_COLLECTIONS
;
648 for (i
= 0; i
< HID_REPORT_TYPES
; i
++)
649 INIT_LIST_HEAD(&device
->report_enum
[i
].report_list
);
651 if (!(device
->rdesc
= kmalloc(size
, GFP_KERNEL
))) {
652 kfree(device
->collection
);
656 memcpy(device
->rdesc
, start
, size
);
657 device
->rsize
= size
;
659 if (!(parser
= kzalloc(sizeof(struct hid_parser
), GFP_KERNEL
))) {
660 kfree(device
->rdesc
);
661 kfree(device
->collection
);
665 parser
->device
= device
;
668 while ((start
= fetch_item(start
, end
, &item
)) != NULL
) {
670 if (item
.format
!= HID_ITEM_FORMAT_SHORT
) {
671 dbg("unexpected long global item");
672 kfree(device
->collection
);
673 hid_free_device(device
);
678 if (dispatch_type
[item
.type
](parser
, &item
)) {
679 dbg("item %u %u %u %u parsing failed\n",
680 item
.format
, (unsigned)item
.size
, (unsigned)item
.type
, (unsigned)item
.tag
);
681 kfree(device
->collection
);
682 hid_free_device(device
);
688 if (parser
->collection_stack_ptr
) {
689 dbg("unbalanced collection at end of report description");
690 kfree(device
->collection
);
691 hid_free_device(device
);
695 if (parser
->local
.delimiter_depth
) {
696 dbg("unbalanced delimiter at end of report description");
697 kfree(device
->collection
);
698 hid_free_device(device
);
707 dbg("item fetching failed at offset %d\n", (int)(end
- start
));
708 kfree(device
->collection
);
709 hid_free_device(device
);
713 EXPORT_SYMBOL_GPL(hid_parse_report
);
716 * Convert a signed n-bit integer to signed 32-bit integer. Common
717 * cases are done through the compiler, the screwed things has to be
721 static s32
snto32(__u32 value
, unsigned n
)
724 case 8: return ((__s8
)value
);
725 case 16: return ((__s16
)value
);
726 case 32: return ((__s32
)value
);
728 return value
& (1 << (n
- 1)) ? value
| (-1 << n
) : value
;
732 * Convert a signed 32-bit integer to a signed n-bit integer.
735 static u32
s32ton(__s32 value
, unsigned n
)
737 s32 a
= value
>> (n
- 1);
739 return value
< 0 ? 1 << (n
- 1) : (1 << (n
- 1)) - 1;
740 return value
& ((1 << n
) - 1);
744 * Extract/implement a data field from/to a little endian report (bit array).
746 * Code sort-of follows HID spec:
747 * http://www.usb.org/developers/devclass_docs/HID1_11.pdf
749 * While the USB HID spec allows unlimited length bit fields in "report
750 * descriptors", most devices never use more than 16 bits.
751 * One model of UPS is claimed to report "LINEV" as a 32-bit field.
752 * Search linux-kernel and linux-usb-devel archives for "hid-core extract".
755 static __inline__ __u32
extract(__u8
*report
, unsigned offset
, unsigned n
)
761 report
+= offset
>> 3; /* adjust byte index */
762 offset
&= 7; /* now only need bit offset into one byte */
763 x
= get_unaligned((u64
*) report
);
765 x
= (x
>> offset
) & ((1ULL << n
) - 1); /* extract bit field */
770 * "implement" : set bits in a little endian bit stream.
771 * Same concepts as "extract" (see comments above).
772 * The data mangled in the bit stream remains in little endian
773 * order the whole time. It make more sense to talk about
774 * endianness of register values by considering a register
775 * a "cached" copy of the little endiad bit stream.
777 static __inline__
void implement(__u8
*report
, unsigned offset
, unsigned n
, __u32 value
)
780 u64 m
= (1ULL << n
) - 1;
787 report
+= offset
>> 3;
790 x
= get_unaligned((u64
*)report
);
791 x
&= cpu_to_le64(~(m
<< offset
));
792 x
|= cpu_to_le64(((u64
) value
) << offset
);
793 put_unaligned(x
, (u64
*) report
);
797 * Search an array for a value.
800 static __inline__
int search(__s32
*array
, __s32 value
, unsigned n
)
803 if (*array
++ == value
)
809 static void hid_process_event(struct hid_device
*hid
, struct hid_field
*field
, struct hid_usage
*usage
, __s32 value
, int interrupt
)
811 hid_dump_input(usage
, value
);
812 if (hid
->claimed
& HID_CLAIMED_INPUT
)
813 hidinput_hid_event(hid
, field
, usage
, value
);
814 if (hid
->claimed
& HID_CLAIMED_HIDDEV
&& interrupt
&& hid
->hiddev_hid_event
)
815 hid
->hiddev_hid_event(hid
, field
, usage
, value
);
819 * Analyse a received field, and fetch the data from it. The field
820 * content is stored for next report processing (we do differential
821 * reporting to the layer).
824 void hid_input_field(struct hid_device
*hid
, struct hid_field
*field
, __u8
*data
, int interrupt
)
827 unsigned count
= field
->report_count
;
828 unsigned offset
= field
->report_offset
;
829 unsigned size
= field
->report_size
;
830 __s32 min
= field
->logical_minimum
;
831 __s32 max
= field
->logical_maximum
;
834 if (!(value
= kmalloc(sizeof(__s32
) * count
, GFP_ATOMIC
)))
837 for (n
= 0; n
< count
; n
++) {
839 value
[n
] = min
< 0 ? snto32(extract(data
, offset
+ n
* size
, size
), size
) :
840 extract(data
, offset
+ n
* size
, size
);
842 if (!(field
->flags
& HID_MAIN_ITEM_VARIABLE
) /* Ignore report if ErrorRollOver */
843 && value
[n
] >= min
&& value
[n
] <= max
844 && field
->usage
[value
[n
] - min
].hid
== HID_UP_KEYBOARD
+ 1)
848 for (n
= 0; n
< count
; n
++) {
850 if (HID_MAIN_ITEM_VARIABLE
& field
->flags
) {
851 hid_process_event(hid
, field
, &field
->usage
[n
], value
[n
], interrupt
);
855 if (field
->value
[n
] >= min
&& field
->value
[n
] <= max
856 && field
->usage
[field
->value
[n
] - min
].hid
857 && search(value
, field
->value
[n
], count
))
858 hid_process_event(hid
, field
, &field
->usage
[field
->value
[n
] - min
], 0, interrupt
);
860 if (value
[n
] >= min
&& value
[n
] <= max
861 && field
->usage
[value
[n
] - min
].hid
862 && search(field
->value
, value
[n
], count
))
863 hid_process_event(hid
, field
, &field
->usage
[value
[n
] - min
], 1, interrupt
);
866 memcpy(field
->value
, value
, count
* sizeof(__s32
));
870 EXPORT_SYMBOL_GPL(hid_input_field
);
873 * Output the field into the report.
876 static void hid_output_field(struct hid_field
*field
, __u8
*data
)
878 unsigned count
= field
->report_count
;
879 unsigned offset
= field
->report_offset
;
880 unsigned size
= field
->report_size
;
883 for (n
= 0; n
< count
; n
++) {
884 if (field
->logical_minimum
< 0) /* signed values */
885 implement(data
, offset
+ n
* size
, size
, s32ton(field
->value
[n
], size
));
886 else /* unsigned values */
887 implement(data
, offset
+ n
* size
, size
, field
->value
[n
]);
895 void hid_output_report(struct hid_report
*report
, __u8
*data
)
900 *data
++ = report
->id
;
902 for (n
= 0; n
< report
->maxfield
; n
++)
903 hid_output_field(report
->field
[n
], data
);
905 EXPORT_SYMBOL_GPL(hid_output_report
);
908 * Set a field value. The report this field belongs to has to be
909 * created and transferred to the device, to set this value in the
913 int hid_set_field(struct hid_field
*field
, unsigned offset
, __s32 value
)
915 unsigned size
= field
->report_size
;
917 hid_dump_input(field
->usage
+ offset
, value
);
919 if (offset
>= field
->report_count
) {
920 dbg("offset (%d) exceeds report_count (%d)", offset
, field
->report_count
);
921 hid_dump_field(field
, 8);
924 if (field
->logical_minimum
< 0) {
925 if (value
!= snto32(s32ton(value
, size
), size
)) {
926 dbg("value %d is out of range", value
);
930 field
->value
[offset
] = value
;
933 EXPORT_SYMBOL_GPL(hid_set_field
);
935 int hid_input_report(struct hid_device
*hid
, int type
, u8
*data
, int size
, int interrupt
)
937 struct hid_report_enum
*report_enum
= hid
->report_enum
+ type
;
938 struct hid_report
*report
;
950 printk(KERN_DEBUG __FILE__
": report (size %u) (%snumbered)\n", len
, report_enum
->numbered
? "" : "un");
953 n
= 0; /* Normally report number is 0 */
954 if (report_enum
->numbered
) { /* Device uses numbered reports, data[0] is report number */
962 printk(KERN_DEBUG __FILE__
": report %d (size %u) = ", n
, size
);
963 for (i
= 0; i
< size
; i
++)
964 printk(" %02x", data
[i
]);
969 if (!(report
= report_enum
->report_id_hash
[n
])) {
970 dbg("undefined report_id %d received", n
);
974 rsize
= ((report
->size
- 1) >> 3) + 1;
977 dbg("report %d is too short, (%d < %d)", report
->id
, size
, rsize
);
981 if ((hid
->claimed
& HID_CLAIMED_HIDDEV
) && hid
->hiddev_report_event
)
982 hid
->hiddev_report_event(hid
, report
);
984 for (n
= 0; n
< report
->maxfield
; n
++)
985 hid_input_field(hid
, report
->field
[n
], data
, interrupt
);
987 if (hid
->claimed
& HID_CLAIMED_INPUT
)
988 hidinput_report_event(hid
, report
);
992 EXPORT_SYMBOL_GPL(hid_input_report
);
994 MODULE_LICENSE(DRIVER_LICENSE
);