2015-06-30 14:39:40 +02:00
|
|
|
/*
|
|
|
|
* Human Input Devices
|
|
|
|
*
|
|
|
|
* Copyright (C) 2015 Aric Stewart
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdarg.h>
|
|
|
|
|
2016-09-19 15:45:34 +02:00
|
|
|
#include "ntstatus.h"
|
2015-06-30 14:39:40 +02:00
|
|
|
#define WIN32_NO_STATUS
|
|
|
|
#include "windef.h"
|
|
|
|
#include "winbase.h"
|
|
|
|
#include "winternl.h"
|
|
|
|
#include "winioctl.h"
|
|
|
|
#include "ddk/wdm.h"
|
|
|
|
|
|
|
|
#include "hidusage.h"
|
|
|
|
#include "ddk/hidpi.h"
|
2019-10-30 20:25:58 +01:00
|
|
|
#include "wine/hid.h"
|
2015-06-30 14:39:40 +02:00
|
|
|
#include "wine/debug.h"
|
|
|
|
|
|
|
|
WINE_DEFAULT_DEBUG_CHANNEL(hidp);
|
|
|
|
|
2015-06-30 14:40:00 +02:00
|
|
|
static NTSTATUS get_report_data(BYTE *report, INT reportLength, INT startBit, INT valueSize, PULONG value)
|
|
|
|
{
|
|
|
|
|
|
|
|
if ((startBit + valueSize) / 8 > reportLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
if (valueSize == 1)
|
|
|
|
{
|
|
|
|
ULONG byte_index = startBit / 8;
|
|
|
|
ULONG bit_index = startBit - (byte_index * 8);
|
|
|
|
INT mask = (1 << bit_index);
|
2019-05-06 15:46:42 +02:00
|
|
|
*value = !!(report[byte_index] & mask);
|
2015-06-30 14:40:00 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2019-05-06 15:46:42 +02:00
|
|
|
ULONG remaining_bits = valueSize;
|
2016-11-07 20:44:33 +01:00
|
|
|
ULONG byte_index = startBit / 8;
|
2019-05-06 15:46:42 +02:00
|
|
|
ULONG bit_index = startBit % 8;
|
2015-06-30 14:40:00 +02:00
|
|
|
ULONG data = 0;
|
2016-11-07 20:44:33 +01:00
|
|
|
ULONG shift = 0;
|
2019-05-06 15:46:42 +02:00
|
|
|
while (remaining_bits)
|
2015-06-30 14:40:00 +02:00
|
|
|
{
|
2019-05-06 15:46:42 +02:00
|
|
|
ULONG copy_bits = 8 - bit_index;
|
|
|
|
if (remaining_bits < copy_bits)
|
|
|
|
copy_bits = remaining_bits;
|
|
|
|
|
2019-05-20 17:31:37 +02:00
|
|
|
data |= ((report[byte_index] >> bit_index) & ((1 << copy_bits) - 1)) << shift;
|
2019-05-06 15:46:42 +02:00
|
|
|
|
|
|
|
shift += copy_bits;
|
|
|
|
bit_index = 0;
|
|
|
|
byte_index++;
|
|
|
|
remaining_bits -= copy_bits;
|
2015-06-30 14:40:00 +02:00
|
|
|
}
|
|
|
|
*value = data;
|
|
|
|
}
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2018-11-23 22:09:34 +01:00
|
|
|
static NTSTATUS set_report_data(BYTE *report, INT reportLength, INT startBit, INT valueSize, ULONG value)
|
|
|
|
{
|
|
|
|
if ((startBit + valueSize) / 8 > reportLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
if (valueSize == 1)
|
|
|
|
{
|
|
|
|
ULONG byte_index = startBit / 8;
|
|
|
|
ULONG bit_index = startBit - (byte_index * 8);
|
|
|
|
if (value)
|
|
|
|
report[byte_index] |= (1 << bit_index);
|
|
|
|
else
|
|
|
|
report[byte_index] &= ~(1 << bit_index);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ULONG byte_index = (startBit + valueSize - 1) / 8;
|
|
|
|
ULONG data = value;
|
|
|
|
ULONG remainingBits = valueSize;
|
|
|
|
while (remainingBits)
|
|
|
|
{
|
|
|
|
BYTE subvalue = data & 0xff;
|
|
|
|
|
|
|
|
data >>= 8;
|
|
|
|
|
|
|
|
if (remainingBits >= 8)
|
|
|
|
{
|
|
|
|
report[byte_index] = subvalue;
|
|
|
|
byte_index --;
|
|
|
|
remainingBits -= 8;
|
|
|
|
}
|
|
|
|
else if (remainingBits > 0)
|
|
|
|
{
|
|
|
|
BYTE mask = (0xff << (8-remainingBits)) & subvalue;
|
|
|
|
report[byte_index] |= mask;
|
|
|
|
remainingBits = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2020-02-26 14:03:46 +01:00
|
|
|
static NTSTATUS get_report_data_array(BYTE *report, UINT reportLength, UINT startBit, UINT elemSize,
|
|
|
|
UINT numElements, PCHAR values, UINT valuesSize)
|
|
|
|
{
|
|
|
|
BYTE byte, *end, *p = report + startBit / 8;
|
|
|
|
ULONG size = elemSize * numElements;
|
|
|
|
ULONG m, bit_index = startBit % 8;
|
|
|
|
BYTE *data = (BYTE*)values;
|
|
|
|
|
|
|
|
if ((startBit + size) / 8 > reportLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
if (valuesSize < (size + 7) / 8)
|
|
|
|
return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
|
|
|
|
end = report + (startBit + size + 7) / 8;
|
|
|
|
|
|
|
|
data--;
|
|
|
|
byte = *p++;
|
|
|
|
while (p != end)
|
|
|
|
{
|
|
|
|
*(++data) = byte >> bit_index;
|
|
|
|
byte = *p++;
|
|
|
|
*data |= byte << (8 - bit_index);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Handle the end and mask out bits beyond */
|
|
|
|
m = (startBit + size) % 8;
|
|
|
|
m = m ? m : 8;
|
|
|
|
|
|
|
|
if (m > bit_index)
|
|
|
|
*(++data) = (byte >> bit_index) & ((1 << (m - bit_index)) - 1);
|
|
|
|
else
|
|
|
|
*data &= (1 << (m + 8 - bit_index)) - 1;
|
|
|
|
|
|
|
|
if (++data < (BYTE*)values + valuesSize)
|
|
|
|
memset(data, 0, (BYTE*)values + valuesSize - data);
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2018-11-23 22:09:34 +01:00
|
|
|
|
2015-06-30 14:39:50 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetButtonCaps(HIDP_REPORT_TYPE ReportType, PHIDP_BUTTON_CAPS ButtonCaps,
|
|
|
|
PUSHORT ButtonCapsLength, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2015-06-30 14:39:50 +02:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT b_count = 0, r_count = 0;
|
|
|
|
int i,j,u;
|
|
|
|
|
|
|
|
TRACE("(%i, %p, %p, %p)\n",ReportType, ButtonCaps, ButtonCapsLength, PreparsedData);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
b_count = data->caps.NumberInputButtonCaps;
|
|
|
|
report = HID_INPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
b_count = data->caps.NumberOutputButtonCaps;
|
|
|
|
report = HID_OUTPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
b_count = data->caps.NumberFeatureButtonCaps;
|
|
|
|
report = HID_FEATURE_REPORTS(data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
2015-06-30 14:39:50 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !b_count)
|
2015-06-30 14:39:50 +02:00
|
|
|
{
|
|
|
|
*ButtonCapsLength = 0;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
b_count = min(b_count, *ButtonCapsLength);
|
|
|
|
|
|
|
|
u = 0;
|
|
|
|
for (j = 0; j < r_count && u < b_count; j++)
|
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
for (i = 0; i < report[j].elementCount && u < b_count; i++)
|
2015-06-30 14:39:50 +02:00
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report[j].elementIdx + i].caps.BitSize == 1)
|
2021-06-04 11:30:35 +02:00
|
|
|
ButtonCaps[u++] = *(HIDP_BUTTON_CAPS *)&elems[report[j].elementIdx + i].caps;
|
2015-06-30 14:39:50 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*ButtonCapsLength = b_count;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-06-30 14:39:40 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetCaps(PHIDP_PREPARSED_DATA PreparsedData,
|
|
|
|
PHIDP_CAPS Capabilities)
|
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
|
|
|
|
|
|
|
TRACE("(%p, %p)\n",PreparsedData, Capabilities);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
*Capabilities = data->caps;
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2015-06-30 14:39:55 +02:00
|
|
|
|
2019-05-13 12:34:19 +02:00
|
|
|
static NTSTATUS find_usage(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
2015-06-30 14:40:41 +02:00
|
|
|
USAGE Usage, PHIDP_PREPARSED_DATA PreparsedData, PCHAR Report,
|
2021-06-07 11:07:01 +02:00
|
|
|
USHORT bit_size, WINE_HID_ELEMENT *element)
|
2015-06-30 14:40:04 +02:00
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2015-06-30 14:40:04 +02:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT v_count = 0, r_count = 0;
|
|
|
|
int i;
|
|
|
|
|
2015-06-30 14:40:41 +02:00
|
|
|
TRACE("(%i, %x, %i, %i, %p, %p)\n", ReportType, UsagePage, LinkCollection, Usage,
|
|
|
|
PreparsedData, Report);
|
2015-06-30 14:40:04 +02:00
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
v_count = data->caps.NumberInputValueCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
v_count = data->caps.NumberOutputValueCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
v_count = data->caps.NumberFeatureValueCaps;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
report = &data->reports[data->reportIdx[ReportType][(BYTE)Report[0]]];
|
2015-06-30 14:40:04 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !v_count)
|
2015-06-30 14:40:04 +02:00
|
|
|
return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (report->reportID && report->reportID != Report[0])
|
2015-06-30 14:40:04 +02:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
|
|
|
for (i = 0; i < report->elementCount; i++)
|
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
HIDP_VALUE_CAPS *value = &elems[report->elementIdx + i].caps;
|
2019-05-03 11:59:06 +02:00
|
|
|
|
2021-06-07 11:07:01 +02:00
|
|
|
if ((elems[report->elementIdx + i].caps.BitSize == 1) != (bit_size == 1) ||
|
2019-05-03 11:59:06 +02:00
|
|
|
value->UsagePage != UsagePage)
|
|
|
|
continue;
|
|
|
|
|
2021-06-04 11:30:33 +02:00
|
|
|
if (value->IsRange && value->Range.UsageMin <= Usage && Usage <= value->Range.UsageMax)
|
2019-05-03 11:59:06 +02:00
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
*element = elems[report->elementIdx + i];
|
2021-06-04 11:30:33 +02:00
|
|
|
element->valueStartBit += value->BitSize * (Usage - value->Range.UsageMin);
|
2021-06-07 11:07:01 +02:00
|
|
|
element->bitCount = elems[report->elementIdx + i].caps.BitSize;
|
2019-05-03 11:59:06 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2021-06-04 11:30:33 +02:00
|
|
|
else if (value->NotRange.Usage == Usage)
|
2015-06-30 14:40:04 +02:00
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
*element = elems[report->elementIdx + i];
|
2021-06-07 11:07:01 +02:00
|
|
|
element->bitCount = elems[report->elementIdx + i].caps.BitSize;
|
2015-06-30 14:40:41 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
2015-06-30 14:40:04 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
}
|
|
|
|
|
2019-02-12 07:06:03 +01:00
|
|
|
static LONG sign_extend(ULONG value, const WINE_HID_ELEMENT *element)
|
|
|
|
{
|
|
|
|
UINT bit_count = element->bitCount;
|
|
|
|
|
|
|
|
if ((value & (1 << (bit_count - 1)))
|
2021-06-07 11:07:01 +02:00
|
|
|
&& element->caps.BitSize != 1
|
2021-06-04 11:30:35 +02:00
|
|
|
&& element->caps.LogicalMin < 0)
|
2019-02-12 07:06:03 +01:00
|
|
|
{
|
|
|
|
value -= (1 << bit_count);
|
|
|
|
}
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2019-02-12 07:06:04 +01:00
|
|
|
static LONG logical_to_physical(LONG value, const WINE_HID_ELEMENT *element)
|
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
if (element->caps.PhysicalMin || element->caps.PhysicalMax)
|
2019-02-12 07:06:04 +01:00
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
value = (((ULONGLONG)(value - element->caps.LogicalMin)
|
|
|
|
* (element->caps.PhysicalMax - element->caps.PhysicalMin))
|
|
|
|
/ (element->caps.LogicalMax - element->caps.LogicalMin))
|
|
|
|
+ element->caps.PhysicalMin;
|
2019-02-12 07:06:04 +01:00
|
|
|
}
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2015-06-30 14:40:41 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetScaledUsageValue(HIDP_REPORT_TYPE ReportType, USAGE UsagePage,
|
|
|
|
USHORT LinkCollection, USAGE Usage, PLONG UsageValue,
|
|
|
|
PHIDP_PREPARSED_DATA PreparsedData, PCHAR Report, ULONG ReportLength)
|
|
|
|
{
|
|
|
|
NTSTATUS rc;
|
2019-05-03 11:59:06 +02:00
|
|
|
WINE_HID_ELEMENT element;
|
2015-06-30 14:40:41 +02:00
|
|
|
TRACE("(%i, %x, %i, %i, %p, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, Usage, UsageValue,
|
|
|
|
PreparsedData, Report, ReportLength);
|
|
|
|
|
2021-06-07 11:07:01 +02:00
|
|
|
rc = find_usage(ReportType, UsagePage, LinkCollection, Usage, PreparsedData, Report, 0, &element);
|
2015-06-30 14:40:41 +02:00
|
|
|
|
|
|
|
if (rc == HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
|
|
|
ULONG rawValue;
|
|
|
|
rc = get_report_data((BYTE*)Report, ReportLength,
|
2019-05-03 11:59:06 +02:00
|
|
|
element.valueStartBit, element.bitCount, &rawValue);
|
2015-06-30 14:40:41 +02:00
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
return rc;
|
2019-05-03 11:59:06 +02:00
|
|
|
*UsageValue = logical_to_physical(sign_extend(rawValue, &element), &element);
|
2015-06-30 14:40:41 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_GetUsageValue(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
|
|
|
USAGE Usage, PULONG UsageValue, PHIDP_PREPARSED_DATA PreparsedData,
|
|
|
|
PCHAR Report, ULONG ReportLength)
|
|
|
|
{
|
2019-05-03 11:59:06 +02:00
|
|
|
WINE_HID_ELEMENT element;
|
2015-06-30 14:40:41 +02:00
|
|
|
NTSTATUS rc;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %i, %i, %p, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, Usage, UsageValue,
|
|
|
|
PreparsedData, Report, ReportLength);
|
|
|
|
|
2021-06-07 11:07:01 +02:00
|
|
|
rc = find_usage(ReportType, UsagePage, LinkCollection, Usage, PreparsedData, Report, 0, &element);
|
2015-06-30 14:40:41 +02:00
|
|
|
|
|
|
|
if (rc == HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
|
|
|
return get_report_data((BYTE*)Report, ReportLength,
|
2019-05-03 11:59:06 +02:00
|
|
|
element.valueStartBit, element.bitCount, UsageValue);
|
2015-06-30 14:40:41 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2015-06-30 14:40:04 +02:00
|
|
|
|
2020-02-26 14:03:46 +01:00
|
|
|
NTSTATUS WINAPI HidP_GetUsageValueArray(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
|
|
|
USAGE Usage, PCHAR UsageValue, USHORT UsageValueByteLength,
|
|
|
|
PHIDP_PREPARSED_DATA PreparsedData, PCHAR Report, ULONG ReportLength)
|
|
|
|
{
|
|
|
|
WINE_HID_ELEMENT element;
|
|
|
|
NTSTATUS rc;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %i, %i, %p, %u, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, Usage, UsageValue,
|
|
|
|
UsageValueByteLength, PreparsedData, Report, ReportLength);
|
|
|
|
|
2021-06-07 11:07:01 +02:00
|
|
|
rc = find_usage(ReportType, UsagePage, LinkCollection, Usage, PreparsedData, Report, 0, &element);
|
2020-02-26 14:03:46 +01:00
|
|
|
|
|
|
|
if (rc == HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
if (element.caps.IsRange || element.caps.ReportCount <= 1 || !element.bitCount)
|
2020-02-26 14:03:46 +01:00
|
|
|
return HIDP_STATUS_NOT_VALUE_ARRAY;
|
|
|
|
|
|
|
|
return get_report_data_array((BYTE*)Report, ReportLength, element.valueStartBit, element.bitCount,
|
2021-06-04 11:30:35 +02:00
|
|
|
element.caps.ReportCount, UsageValue, UsageValueByteLength);
|
2020-02-26 14:03:46 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-06-30 14:40:00 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetUsages(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
|
|
|
PUSAGE UsageList, PULONG UsageLength, PHIDP_PREPARSED_DATA PreparsedData,
|
|
|
|
PCHAR Report, ULONG ReportLength)
|
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2015-06-30 14:40:00 +02:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
BOOL found = FALSE;
|
|
|
|
USHORT b_count = 0, r_count = 0;
|
|
|
|
int i,uCount;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %i, %p, %p, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, UsageList,
|
|
|
|
UsageLength, PreparsedData, Report, ReportLength);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
2016-12-08 15:34:02 +01:00
|
|
|
{
|
|
|
|
*UsageLength = 0;
|
2015-06-30 14:40:00 +02:00
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
2016-12-08 15:34:02 +01:00
|
|
|
}
|
2015-06-30 14:40:00 +02:00
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
b_count = data->caps.NumberInputButtonCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
b_count = data->caps.NumberOutputButtonCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
b_count = data->caps.NumberFeatureButtonCaps;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
report = &data->reports[data->reportIdx[ReportType][(BYTE)Report[0]]];
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !b_count)
|
2015-06-30 14:40:00 +02:00
|
|
|
return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (report->reportID && report->reportID != Report[0])
|
2015-06-30 14:40:00 +02:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
|
|
|
uCount = 0;
|
|
|
|
for (i = 0; i < report->elementCount && uCount < *UsageLength; i++)
|
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report->elementIdx + i].caps.BitSize == 1 &&
|
2021-06-04 11:30:35 +02:00
|
|
|
elems[report->elementIdx + i].caps.UsagePage == UsagePage)
|
2015-06-30 14:40:00 +02:00
|
|
|
{
|
|
|
|
int k;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *element = &elems[report->elementIdx + i];
|
2015-06-30 14:40:00 +02:00
|
|
|
for (k=0; k < element->bitCount; k++)
|
|
|
|
{
|
|
|
|
UINT v = 0;
|
|
|
|
NTSTATUS rc = get_report_data((BYTE*)Report, ReportLength,
|
|
|
|
element->valueStartBit + k, 1, &v);
|
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
return rc;
|
|
|
|
found = TRUE;
|
|
|
|
if (v)
|
|
|
|
{
|
|
|
|
if (uCount == *UsageLength)
|
|
|
|
return HIDP_STATUS_BUFFER_TOO_SMALL;
|
2021-06-04 11:30:35 +02:00
|
|
|
UsageList[uCount] = element->caps.Range.UsageMin + k;
|
2015-06-30 14:40:00 +02:00
|
|
|
uCount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-08 15:34:02 +01:00
|
|
|
*UsageLength = uCount;
|
|
|
|
|
2015-06-30 14:40:00 +02:00
|
|
|
if (!found)
|
|
|
|
return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-06-30 14:39:55 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetValueCaps(HIDP_REPORT_TYPE ReportType, PHIDP_VALUE_CAPS ValueCaps,
|
|
|
|
PUSHORT ValueCapsLength, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2015-06-30 14:39:55 +02:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT v_count = 0, r_count = 0;
|
|
|
|
int i,j,u;
|
|
|
|
|
|
|
|
TRACE("(%i, %p, %p, %p)\n", ReportType, ValueCaps, ValueCapsLength, PreparsedData);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
v_count = data->caps.NumberInputValueCaps;
|
|
|
|
report = HID_INPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
v_count = data->caps.NumberOutputValueCaps;
|
|
|
|
report = HID_OUTPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
v_count = data->caps.NumberFeatureValueCaps;
|
|
|
|
report = HID_FEATURE_REPORTS(data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
2015-06-30 14:39:55 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !v_count)
|
2015-06-30 14:39:55 +02:00
|
|
|
{
|
|
|
|
*ValueCapsLength = 0;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
v_count = min(v_count, *ValueCapsLength);
|
|
|
|
|
|
|
|
u = 0;
|
|
|
|
for (j = 0; j < r_count && u < v_count; j++)
|
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
for (i = 0; i < report[j].elementCount && u < v_count; i++)
|
2015-06-30 14:39:55 +02:00
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report[j].elementIdx + i].caps.BitSize != 1)
|
2021-06-04 11:30:35 +02:00
|
|
|
ValueCaps[u++] = elems[report[j].elementIdx + i].caps;
|
2015-06-30 14:39:55 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*ValueCapsLength = v_count;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2015-06-30 14:40:10 +02:00
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_InitializeReportForID(HIDP_REPORT_TYPE ReportType, UCHAR ReportID,
|
|
|
|
PHIDP_PREPARSED_DATA PreparsedData, PCHAR Report,
|
|
|
|
ULONG ReportLength)
|
|
|
|
{
|
|
|
|
int size;
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
int r_count;
|
|
|
|
|
|
|
|
TRACE("(%i, %i, %p, %p, %i)\n",ReportType, ReportID, PreparsedData, Report, ReportLength);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
size = data->caps.InputReportByteLength;
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
size = data->caps.OutputReportByteLength;
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
size = data->caps.FeatureReportByteLength;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
report = &data->reports[data->reportIdx[ReportType][(BYTE)Report[0]]];
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !size)
|
2015-06-30 14:40:10 +02:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
|
|
|
if (size != ReportLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (report->reportID && report->reportID != Report[0])
|
2015-06-30 14:40:10 +02:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
ZeroMemory(Report, size);
|
|
|
|
Report[0] = ReportID;
|
2015-06-30 14:40:10 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2015-06-30 14:40:32 +02:00
|
|
|
|
|
|
|
ULONG WINAPI HidP_MaxUsageListLength(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
PWINE_HIDP_PREPARSED_DATA data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2015-06-30 14:40:32 +02:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
int r_count;
|
|
|
|
int i;
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %p)\n", ReportType, UsagePage, PreparsedData);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
report = HID_INPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
report = HID_OUTPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
report = HID_FEATURE_REPORTS(data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
|
2015-06-30 14:40:32 +02:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count)
|
2015-06-30 14:40:32 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (i = 0; i < r_count; i++)
|
|
|
|
{
|
|
|
|
int j;
|
2019-05-13 12:33:56 +02:00
|
|
|
for (j = 0; j < report[i].elementCount; j++)
|
2015-06-30 14:40:32 +02:00
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report[i].elementIdx + j].caps.BitSize == 1 &&
|
2021-06-04 11:30:35 +02:00
|
|
|
(UsagePage == 0 || elems[report[i].elementIdx + j].caps.UsagePage == UsagePage))
|
2015-06-30 14:40:32 +02:00
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
if (elems[report[i].elementIdx + j].caps.IsRange)
|
|
|
|
count += (elems[report[i].elementIdx + j].caps.Range.UsageMax -
|
|
|
|
elems[report[i].elementIdx + j].caps.Range.UsageMin) + 1;
|
2015-06-30 14:40:32 +02:00
|
|
|
else
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return count;
|
|
|
|
}
|
2016-09-19 15:45:34 +02:00
|
|
|
|
2018-11-23 22:09:34 +01:00
|
|
|
NTSTATUS WINAPI HidP_SetUsageValue(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
|
|
|
USAGE Usage, ULONG UsageValue, PHIDP_PREPARSED_DATA PreparsedData,
|
|
|
|
CHAR *Report, ULONG ReportLength)
|
|
|
|
{
|
2019-05-03 11:59:06 +02:00
|
|
|
WINE_HID_ELEMENT element;
|
2018-11-23 22:09:34 +01:00
|
|
|
NTSTATUS rc;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %i, %i, %i, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, Usage, UsageValue,
|
|
|
|
PreparsedData, Report, ReportLength);
|
|
|
|
|
2021-06-07 11:07:01 +02:00
|
|
|
rc = find_usage(ReportType, UsagePage, LinkCollection, Usage, PreparsedData, Report, 0, &element);
|
2018-11-23 22:09:34 +01:00
|
|
|
|
|
|
|
if (rc == HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
|
|
|
return set_report_data((BYTE*)Report, ReportLength,
|
2019-05-03 11:59:06 +02:00
|
|
|
element.valueStartBit, element.bitCount, UsageValue);
|
2018-11-23 22:09:34 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-05-03 11:59:02 +02:00
|
|
|
NTSTATUS WINAPI HidP_SetUsages(HIDP_REPORT_TYPE ReportType, USAGE UsagePage, USHORT LinkCollection,
|
|
|
|
PUSAGE UsageList, PULONG UsageLength, PHIDP_PREPARSED_DATA PreparsedData,
|
|
|
|
PCHAR Report, ULONG ReportLength)
|
|
|
|
{
|
2019-05-03 11:59:06 +02:00
|
|
|
WINE_HID_ELEMENT element;
|
2019-05-03 11:59:02 +02:00
|
|
|
NTSTATUS rc;
|
|
|
|
ULONG i;
|
|
|
|
|
|
|
|
TRACE("(%i, %x, %i, %p, %p, %p, %p, %i)\n", ReportType, UsagePage, LinkCollection, UsageList,
|
|
|
|
UsageLength, PreparsedData, Report, ReportLength);
|
|
|
|
|
|
|
|
for (i = 0; i < *UsageLength; i++)
|
|
|
|
{
|
2019-05-13 12:34:19 +02:00
|
|
|
rc = find_usage(ReportType, UsagePage, LinkCollection,
|
2021-06-07 11:07:01 +02:00
|
|
|
UsageList[i], PreparsedData, Report, 1, &element);
|
2019-05-03 11:59:02 +02:00
|
|
|
if (rc == HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
|
|
|
rc = set_report_data((BYTE*)Report, ReportLength,
|
2019-05-03 11:59:06 +02:00
|
|
|
element.valueStartBit, element.bitCount, -1);
|
2019-05-14 12:43:45 +02:00
|
|
|
}
|
2019-05-03 11:59:02 +02:00
|
|
|
|
2019-05-14 12:43:45 +02:00
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
{
|
|
|
|
*UsageLength = i;
|
|
|
|
return rc;
|
2019-05-03 11:59:02 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-09-19 15:45:34 +02:00
|
|
|
NTSTATUS WINAPI HidP_TranslateUsagesToI8042ScanCodes(USAGE *ChangedUsageList,
|
|
|
|
ULONG UsageListLength, HIDP_KEYBOARD_DIRECTION KeyAction,
|
|
|
|
HIDP_KEYBOARD_MODIFIER_STATE *ModifierState,
|
|
|
|
PHIDP_INSERT_SCANCODES InsertCodesProcedure, VOID *InsertCodesContext)
|
|
|
|
{
|
|
|
|
FIXME("stub: %p, %i, %i, %p, %p, %p\n", ChangedUsageList, UsageListLength,
|
|
|
|
KeyAction, ModifierState, InsertCodesProcedure, InsertCodesContext);
|
|
|
|
|
|
|
|
return STATUS_NOT_IMPLEMENTED;
|
|
|
|
}
|
2016-11-03 17:39:49 +01:00
|
|
|
|
2016-11-15 15:05:38 +01:00
|
|
|
NTSTATUS WINAPI HidP_GetSpecificButtonCaps(HIDP_REPORT_TYPE ReportType,
|
|
|
|
USAGE UsagePage, USHORT LinkCollection, USAGE Usage,
|
|
|
|
HIDP_BUTTON_CAPS *ButtonCaps, USHORT *ButtonCapsLength, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (WINE_HIDP_PREPARSED_DATA*)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2016-11-15 15:05:38 +01:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT b_count = 0, r_count = 0;
|
|
|
|
int i,j,u;
|
|
|
|
|
|
|
|
TRACE("(%i, 0x%x, %i, 0x%x, %p %p %p)\n", ReportType, UsagePage, LinkCollection,
|
|
|
|
Usage, ButtonCaps, ButtonCapsLength, PreparsedData);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
b_count = data->caps.NumberInputButtonCaps;
|
|
|
|
report = HID_INPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
b_count = data->caps.NumberOutputButtonCaps;
|
|
|
|
report = HID_OUTPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
b_count = data->caps.NumberFeatureButtonCaps;
|
|
|
|
report = HID_FEATURE_REPORTS(data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
2016-11-15 15:05:38 +01:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !b_count)
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
|
|
|
*ButtonCapsLength = 0;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
b_count = min(b_count, *ButtonCapsLength);
|
|
|
|
|
|
|
|
u = 0;
|
|
|
|
for (j = 0; j < r_count && u < b_count; j++)
|
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
for (i = 0; i < report[j].elementCount && u < b_count; i++)
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report[j].elementIdx + i].caps.BitSize == 1 &&
|
2021-06-04 11:30:35 +02:00
|
|
|
(UsagePage == 0 || UsagePage == elems[report[j].elementIdx + i].caps.UsagePage) &&
|
|
|
|
(LinkCollection == 0 || LinkCollection == elems[report[j].elementIdx + i].caps.LinkCollection) &&
|
2016-11-15 15:05:38 +01:00
|
|
|
(Usage == 0 || (
|
2021-06-04 11:30:35 +02:00
|
|
|
(!elems[report[j].elementIdx + i].caps.IsRange &&
|
|
|
|
Usage == elems[report[j].elementIdx + i].caps.NotRange.Usage)) ||
|
|
|
|
(elems[report[j].elementIdx + i].caps.IsRange &&
|
|
|
|
Usage >= elems[report[j].elementIdx + i].caps.Range.UsageMin &&
|
|
|
|
Usage <= elems[report[j].elementIdx + i].caps.Range.UsageMax)))
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
ButtonCaps[u++] = *(HIDP_BUTTON_CAPS *)&elems[report[j].elementIdx + i].caps;
|
2016-11-15 15:05:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
TRACE("Matched %i usages\n", u);
|
|
|
|
|
|
|
|
*ButtonCapsLength = u;
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-11-03 17:39:49 +01:00
|
|
|
NTSTATUS WINAPI HidP_GetSpecificValueCaps(HIDP_REPORT_TYPE ReportType,
|
|
|
|
USAGE UsagePage, USHORT LinkCollection, USAGE Usage,
|
|
|
|
HIDP_VALUE_CAPS *ValueCaps, USHORT *ValueCapsLength, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (PWINE_HIDP_PREPARSED_DATA)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2016-11-03 17:39:49 +01:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT v_count = 0, r_count = 0;
|
|
|
|
int i,j,u;
|
|
|
|
|
|
|
|
TRACE("(%i, 0x%x, %i, 0x%x, %p %p %p)\n", ReportType, UsagePage, LinkCollection,
|
|
|
|
Usage, ValueCaps, ValueCapsLength, PreparsedData);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
v_count = data->caps.NumberInputValueCaps;
|
|
|
|
report = HID_INPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
v_count = data->caps.NumberOutputValueCaps;
|
|
|
|
report = HID_OUTPUT_REPORTS(data);
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
v_count = data->caps.NumberFeatureValueCaps;
|
|
|
|
report = HID_FEATURE_REPORTS(data);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
2016-11-03 17:39:49 +01:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !v_count)
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
|
|
|
*ValueCapsLength = 0;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
v_count = min(v_count, *ValueCapsLength);
|
|
|
|
|
|
|
|
u = 0;
|
|
|
|
for (j = 0; j < r_count && u < v_count; j++)
|
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
for (i = 0; i < report[j].elementCount && u < v_count; i++)
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report[j].elementIdx + i].caps.BitSize != 1 &&
|
2021-06-04 11:30:35 +02:00
|
|
|
(UsagePage == 0 || UsagePage == elems[report[j].elementIdx + i].caps.UsagePage) &&
|
|
|
|
(LinkCollection == 0 || LinkCollection == elems[report[j].elementIdx + i].caps.LinkCollection) &&
|
|
|
|
(Usage == 0 || Usage == elems[report[j].elementIdx + i].caps.NotRange.Usage))
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
ValueCaps[u++] = elems[report[j].elementIdx + i].caps;
|
2016-11-03 17:39:49 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
TRACE("Matched %i usages\n", u);
|
|
|
|
|
|
|
|
*ValueCapsLength = u;
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2017-01-25 14:07:04 +01:00
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_GetUsagesEx(HIDP_REPORT_TYPE ReportType, USHORT LinkCollection, USAGE_AND_PAGE *ButtonList,
|
|
|
|
ULONG *UsageLength, PHIDP_PREPARSED_DATA PreparsedData, CHAR *Report, ULONG ReportLength)
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (WINE_HIDP_PREPARSED_DATA*)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2017-01-25 14:07:04 +01:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT b_count = 0, r_count = 0;
|
|
|
|
int i,uCount = 0;
|
|
|
|
NTSTATUS rc;
|
|
|
|
|
|
|
|
TRACE("(%i, %i, %p, %p(%i), %p, %p, %i)\n", ReportType, LinkCollection, ButtonList,
|
|
|
|
UsageLength, *UsageLength, PreparsedData, Report, ReportLength);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
b_count = data->caps.NumberInputButtonCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
b_count = data->caps.NumberOutputButtonCaps;
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
b_count = data->caps.NumberFeatureButtonCaps;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
report = &data->reports[data->reportIdx[ReportType][(BYTE)Report[0]]];
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || !b_count)
|
2017-01-25 14:07:04 +01:00
|
|
|
return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (report->reportID && report->reportID != Report[0])
|
2017-01-25 14:07:04 +01:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
|
|
|
for (i = 0; i < report->elementCount; i++)
|
|
|
|
{
|
2021-06-07 11:07:01 +02:00
|
|
|
if (elems[report->elementIdx + i].caps.BitSize == 1)
|
2017-01-25 14:07:04 +01:00
|
|
|
{
|
|
|
|
int k;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *element = &elems[report->elementIdx + i];
|
2017-01-25 14:07:04 +01:00
|
|
|
for (k=0; k < element->bitCount; k++)
|
|
|
|
{
|
|
|
|
UINT v = 0;
|
|
|
|
NTSTATUS rc = get_report_data((BYTE*)Report, ReportLength,
|
|
|
|
element->valueStartBit + k, 1, &v);
|
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
return rc;
|
|
|
|
if (v)
|
|
|
|
{
|
|
|
|
if (uCount < *UsageLength)
|
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
ButtonList[uCount].Usage = element->caps.Range.UsageMin + k;
|
|
|
|
ButtonList[uCount].UsagePage = element->caps.UsagePage;
|
2017-01-25 14:07:04 +01:00
|
|
|
}
|
|
|
|
uCount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TRACE("Returning %i usages\n", uCount);
|
|
|
|
|
|
|
|
if (*UsageLength < uCount)
|
|
|
|
rc = HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
else
|
|
|
|
rc = HIDP_STATUS_SUCCESS;
|
|
|
|
|
|
|
|
*UsageLength = uCount;
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
2017-01-27 14:17:53 +01:00
|
|
|
|
|
|
|
ULONG WINAPI HidP_MaxDataListLength(HIDP_REPORT_TYPE ReportType, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (WINE_HIDP_PREPARSED_DATA *)PreparsedData;
|
|
|
|
TRACE("(%i, %p)\n", ReportType, PreparsedData);
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
switch(ReportType)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
return data->caps.NumberInputDataIndices;
|
|
|
|
case HidP_Output:
|
|
|
|
return data->caps.NumberOutputDataIndices;
|
|
|
|
case HidP_Feature:
|
|
|
|
return data->caps.NumberFeatureDataIndices;
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
2017-01-27 14:18:01 +01:00
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_GetData(HIDP_REPORT_TYPE ReportType, HIDP_DATA *DataList, ULONG *DataLength,
|
|
|
|
PHIDP_PREPARSED_DATA PreparsedData,CHAR *Report, ULONG ReportLength)
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (WINE_HIDP_PREPARSED_DATA*)PreparsedData;
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *elems = HID_ELEMS(data);
|
2017-01-27 14:18:01 +01:00
|
|
|
WINE_HID_REPORT *report = NULL;
|
|
|
|
USHORT r_count = 0;
|
|
|
|
int i,uCount = 0;
|
|
|
|
NTSTATUS rc;
|
|
|
|
|
|
|
|
TRACE("(%i, %p, %p(%i), %p, %p, %i)\n", ReportType, DataList, DataLength,
|
|
|
|
DataLength?*DataLength:0, PreparsedData, Report, ReportLength);
|
|
|
|
|
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return 0;
|
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (ReportType != HidP_Input && ReportType != HidP_Output && ReportType != HidP_Feature)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
2017-01-27 14:18:01 +01:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
r_count = data->reportCount[ReportType];
|
|
|
|
report = &data->reports[data->reportIdx[ReportType][(BYTE)Report[0]]];
|
2017-01-27 14:18:01 +01:00
|
|
|
|
2019-05-13 12:33:56 +02:00
|
|
|
if (!r_count || (report->reportID && report->reportID != Report[0]))
|
2017-01-27 14:18:01 +01:00
|
|
|
return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
|
|
|
|
|
|
|
for (i = 0; i < report->elementCount; i++)
|
|
|
|
{
|
2019-05-13 12:33:56 +02:00
|
|
|
WINE_HID_ELEMENT *element = &elems[report->elementIdx + i];
|
2021-06-07 11:07:01 +02:00
|
|
|
if (element->caps.BitSize == 1)
|
2017-01-27 14:18:01 +01:00
|
|
|
{
|
|
|
|
int k;
|
|
|
|
for (k=0; k < element->bitCount; k++)
|
|
|
|
{
|
|
|
|
UINT v = 0;
|
|
|
|
NTSTATUS rc = get_report_data((BYTE*)Report, ReportLength,
|
|
|
|
element->valueStartBit + k, 1, &v);
|
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
return rc;
|
|
|
|
if (v)
|
|
|
|
{
|
|
|
|
if (uCount < *DataLength)
|
|
|
|
{
|
2021-06-04 11:30:35 +02:00
|
|
|
DataList[uCount].DataIndex = element->caps.Range.DataIndexMin + k;
|
2021-06-04 11:30:33 +02:00
|
|
|
DataList[uCount].On = v;
|
2017-01-27 14:18:01 +01:00
|
|
|
}
|
|
|
|
uCount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (uCount < *DataLength)
|
|
|
|
{
|
|
|
|
UINT v;
|
|
|
|
NTSTATUS rc = get_report_data((BYTE*)Report, ReportLength,
|
|
|
|
element->valueStartBit, element->bitCount, &v);
|
|
|
|
if (rc != HIDP_STATUS_SUCCESS)
|
|
|
|
return rc;
|
2021-06-04 11:30:35 +02:00
|
|
|
DataList[uCount].DataIndex = element->caps.NotRange.DataIndex;
|
2021-06-04 11:30:33 +02:00
|
|
|
DataList[uCount].RawValue = v;
|
2017-01-27 14:18:01 +01:00
|
|
|
}
|
|
|
|
uCount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*DataLength < uCount)
|
|
|
|
rc = HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
else
|
|
|
|
rc = HIDP_STATUS_SUCCESS;
|
|
|
|
|
|
|
|
*DataLength = uCount;
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
2020-02-11 19:13:44 +01:00
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_GetLinkCollectionNodes(HIDP_LINK_COLLECTION_NODE *LinkCollectionNode,
|
|
|
|
ULONG *LinkCollectionNodeLength, PHIDP_PREPARSED_DATA PreparsedData)
|
|
|
|
{
|
2020-02-11 19:13:46 +01:00
|
|
|
WINE_HIDP_PREPARSED_DATA *data = (WINE_HIDP_PREPARSED_DATA*)PreparsedData;
|
|
|
|
WINE_HID_LINK_COLLECTION_NODE *nodes = HID_NODES(data);
|
|
|
|
ULONG i;
|
2020-02-11 19:13:44 +01:00
|
|
|
|
2020-02-11 19:13:46 +01:00
|
|
|
TRACE("(%p, %p, %p)\n", LinkCollectionNode, LinkCollectionNodeLength, PreparsedData);
|
2020-02-11 19:13:44 +01:00
|
|
|
|
2020-02-11 19:13:46 +01:00
|
|
|
if (*LinkCollectionNodeLength < data->caps.NumberLinkCollectionNodes)
|
|
|
|
return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
|
|
|
|
for (i = 0; i < data->caps.NumberLinkCollectionNodes; ++i)
|
|
|
|
{
|
|
|
|
LinkCollectionNode[i].LinkUsage = nodes[i].LinkUsage;
|
|
|
|
LinkCollectionNode[i].LinkUsagePage = nodes[i].LinkUsagePage;
|
|
|
|
LinkCollectionNode[i].Parent = nodes[i].Parent;
|
|
|
|
LinkCollectionNode[i].NumberOfChildren = nodes[i].NumberOfChildren;
|
|
|
|
LinkCollectionNode[i].NextSibling = nodes[i].NextSibling;
|
|
|
|
LinkCollectionNode[i].FirstChild = nodes[i].FirstChild;
|
|
|
|
LinkCollectionNode[i].CollectionType = nodes[i].CollectionType;
|
|
|
|
LinkCollectionNode[i].IsAlias = nodes[i].IsAlias;
|
|
|
|
}
|
|
|
|
*LinkCollectionNodeLength = data->caps.NumberLinkCollectionNodes;
|
|
|
|
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
2020-02-11 19:13:44 +01:00
|
|
|
}
|