Lines Matching defs:report
137 struct hid_report *report;
141 list_for_each_entry(report, &hid->report_enum[k].report_list, list) {
142 for (i = 0; i < report->maxfield; i++) {
143 for (j = 0; j < report->field[i]->maxusage; j++) {
144 usage = report->field[i]->usage + j;
233 * @field: the HID report field to calculate resolution for
341 #define HID_BATTERY_QUIRK_FEATURE (1 << 1) /* ask for feature report */
573 dev->battery_report_id = field->report->id;
579 * We have to wait for the device to report it on its own.
702 /* Ignore if report count is out of bounds. */
1347 if (field->report->type == HID_OUTPUT_REPORT) {
1495 static void hid_report_release_tool(struct hid_report *report, struct input_dev *input,
1510 report->tool = 0;
1513 static void hid_report_set_tool(struct hid_report *report, struct input_dev *input,
1516 if (report->tool != new_tool)
1517 hid_report_release_tool(report, input, report->tool);
1520 report->tool = new_tool;
1526 struct hid_report *report = field->report;
1582 report->tool_active |= !!value;
1589 hid_report_set_tool(report, input, BTN_TOOL_RUBBER);
1590 else if (report->tool != BTN_TOOL_RUBBER)
1599 hid_report_release_tool(report, input, BTN_TOOL_RUBBER);
1607 report->tool_active |= !!value;
1613 hid_report_set_tool(report, input, BTN_TOOL_RUBBER);
1614 else if (!report->tool_active)
1616 hid_report_release_tool(report, input, BTN_TOOL_RUBBER);
1622 report->tool_active |= !!value;
1624 if (report->tool_active) {
1629 if (!report->tool)
1630 report->tool = usage->code;
1633 hid_report_set_tool(report, input, report->tool);
1635 hid_report_release_tool(report, input, usage->code);
1639 report->tool_active = false;
1645 report->tool_active |= !!value;
1648 if (report->tool == BTN_TOOL_RUBBER)
1660 report->tool_active = true;
1713 * 0x31 and 0x32) report multiple keys, even though a localized keyboard
1715 * report constant 0. As all map to the same keycode, they'd confuse
1726 /* report the usage code as scancode if the key status has changed */
1740 void hidinput_report_event(struct hid_device *hid, struct hid_report *report)
1755 struct hid_report *report;
1758 list_for_each_entry(report, &hid->report_enum[HID_OUTPUT_REPORT].report_list, list) {
1759 for (i = 0; i < report->maxfield; i++) {
1760 *field = report->field[i];
1771 struct hid_report *report;
1775 list_for_each_entry(report,
1778 for (i = 0; i < report->maxfield; i++) {
1779 field = report->field[i];
1791 struct hid_report *report;
1796 list_for_each_entry(report,
1799 for (i = 0; i < report->maxfield; i++) {
1800 field = report->field[i];
1816 struct hid_report *report;
1826 * field->report is accessed unlocked regarding HID core. So there might
1838 report = field->report;
1842 return hid->ll_driver->request(hid, report, HID_REQ_SET_REPORT);
1844 /* fall back to generic raw-output-report */
1845 len = hid_report_len(report);
1846 buf = hid_alloc_report_buf(report, GFP_KERNEL);
1850 hid_output_report(report, buf);
1851 /* synchronous output report */
1854 hid_hw_raw_request(hid, report->id, buf, len, HID_OUTPUT_REPORT,
1898 struct hid_report *report, bool use_logical_max)
1905 if (report->maxfield == 0)
1908 for (i = 0; i < report->maxfield; i++) {
1910 report->field[i]->logical_maximum :
1911 report->field[i]->logical_minimum;
1917 if (report->field[i]->report_count != 1)
1920 for (j = 0; j < report->field[i]->maxusage; j++) {
1921 usage = &report->field[i]->usage[j];
1928 * report we need to fill in the bits from the
1936 if (!get_report_completed && report->maxfield > 1) {
1940 hid_hw_request(hid, report, HID_REQ_GET_REPORT);
1945 report->field[i]->value[j] = value;
1989 /* Ignore if report count is out of bounds. */
2147 struct hid_report *report;
2159 list_for_each_entry(report, &hid->report_enum[k].report_list,
2162 for (i = 0; i < report->maxfield; i++)
2163 if (report->field[i]->hidinput == hidinput)
2164 report->field[i]->hidinput = NULL;
2171 static struct hid_input *hidinput_match(struct hid_report *report)
2173 struct hid_device *hid = report->device;
2177 if (hidinput->report &&
2178 hidinput->report->id == report->id)
2185 static struct hid_input *hidinput_match_application(struct hid_report *report)
2187 struct hid_device *hid = report->device;
2191 if (hidinput->application == report->application)
2198 if ((report->application == HID_GD_SYSTEM_CONTROL ||
2199 report->application == HID_CP_CONSUMER_CONTROL) &&
2209 struct hid_report *report)
2222 for (i = 0; i < report->maxfield; i++) {
2223 field = report->field[i];
2257 report->field[k]->slot_idx = slot_idx;
2263 for (i = 0; i < report->maxfield; i++)
2264 for (j = 0; j < report->field[i]->maxusage; j++)
2265 hidinput_configure_usage(hidinput, report->field[i],
2266 report->field[i]->usage + j,
2279 struct hid_report *report;
2309 list_for_each_entry(report, &hid->report_enum[k].report_list, list) {
2311 if (!report->maxfield)
2314 application = report->application;
2317 * Find the previous hidinput report attached
2318 * to this report id.
2321 hidinput = hidinput_match(report);
2324 hidinput = hidinput_match_application(report);
2332 hidinput_configure_usages(hidinput, report);
2335 hidinput->report = report;
2337 list_add_tail(&report->hidinput_list,