Lines Matching refs:report
771 struct hid_report *report, int count, int strict) in pidff_find_fields() argument
777 for (i = 0; i < report->maxfield; i++) { in pidff_find_fields()
778 if (report->field[i]->maxusage != in pidff_find_fields()
779 report->field[i]->report_count) { in pidff_find_fields()
783 for (j = 0; j < report->field[i]->maxusage; j++) { in pidff_find_fields()
784 if (report->field[i]->usage[j].hid == in pidff_find_fields()
788 usage[k].field = report->field[i]; in pidff_find_fields()
790 &report->field[i]->value[j]; in pidff_find_fields()
827 struct hid_report *report; in pidff_find_reports() local
830 list_for_each_entry(report, in pidff_find_reports()
832 if (report->maxfield < 1) in pidff_find_reports()
834 ret = pidff_check_usage(report->field[0]->logical); in pidff_find_reports()
838 pidff->reports[ret] = report; in pidff_find_reports()
849 i = report->field[0]->usage[0].collection_index; in pidff_find_reports()
858 pidff->reports[ret] = report; in pidff_find_reports()
883 static struct hid_field *pidff_find_special_field(struct hid_report *report, in pidff_find_special_field() argument
888 for (i = 0; i < report->maxfield; i++) { in pidff_find_special_field()
889 if (report->field[i]->logical == (HID_UP_PID | usage) && in pidff_find_special_field()
890 report->field[i]->report_count > 0) { in pidff_find_special_field()
892 report->field[i]->logical_minimum == 1) in pidff_find_special_field()
893 return report->field[i]; in pidff_find_special_field()
1067 #define PIDFF_FIND_FIELDS(name, report, strict) \ argument
1069 pidff->reports[report], \