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);
|
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
static NTSTATUS get_value_caps_range( WINE_HIDP_PREPARSED_DATA *preparsed, HIDP_REPORT_TYPE report_type, ULONG report_len,
|
|
|
|
const struct hid_value_caps **caps, const struct hid_value_caps **caps_end )
|
|
|
|
{
|
|
|
|
if (preparsed->magic != HID_MAGIC) return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
|
|
|
switch (report_type)
|
|
|
|
{
|
|
|
|
case HidP_Input:
|
|
|
|
if (report_len && report_len != preparsed->caps.InputReportByteLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
*caps = HID_INPUT_VALUE_CAPS( preparsed );
|
|
|
|
break;
|
|
|
|
case HidP_Output:
|
|
|
|
if (report_len && report_len != preparsed->caps.OutputReportByteLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
*caps = HID_OUTPUT_VALUE_CAPS( preparsed );
|
|
|
|
break;
|
|
|
|
case HidP_Feature:
|
|
|
|
if (report_len && report_len != preparsed->caps.FeatureReportByteLength)
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
*caps = HID_FEATURE_VALUE_CAPS( preparsed );
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return HIDP_STATUS_INVALID_REPORT_TYPE;
|
|
|
|
}
|
|
|
|
|
|
|
|
*caps_end = *caps + preparsed->value_caps_count[report_type];
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
struct caps_filter
|
|
|
|
{
|
|
|
|
BOOLEAN buttons;
|
2021-06-24 10:05:55 +02:00
|
|
|
BOOLEAN values;
|
2021-06-25 10:06:48 +02:00
|
|
|
BOOLEAN array;
|
2021-06-21 09:05:23 +02:00
|
|
|
USAGE usage_page;
|
|
|
|
USHORT collection;
|
|
|
|
USAGE usage;
|
2021-06-24 10:05:57 +02:00
|
|
|
UCHAR report_id;
|
2021-06-21 09:05:23 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
static BOOL match_value_caps( const struct hid_value_caps *caps, const struct caps_filter *filter )
|
|
|
|
{
|
|
|
|
if (!caps->usage_min && !caps->usage_max) return FALSE;
|
|
|
|
if (filter->buttons && !HID_VALUE_CAPS_IS_BUTTON( caps )) return FALSE;
|
2021-06-24 10:05:55 +02:00
|
|
|
if (filter->values && HID_VALUE_CAPS_IS_BUTTON( caps )) return FALSE;
|
2021-06-21 09:05:23 +02:00
|
|
|
if (filter->usage_page && filter->usage_page != caps->usage_page) return FALSE;
|
|
|
|
if (filter->collection && filter->collection != caps->link_collection) return FALSE;
|
|
|
|
if (!filter->usage) return TRUE;
|
|
|
|
return caps->usage_min <= filter->usage && caps->usage_max >= filter->usage;
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef NTSTATUS (*enum_value_caps_callback)( const struct hid_value_caps *caps, void *user );
|
|
|
|
|
|
|
|
static NTSTATUS enum_value_caps( WINE_HIDP_PREPARSED_DATA *preparsed, HIDP_REPORT_TYPE report_type,
|
2021-06-24 10:05:57 +02:00
|
|
|
ULONG report_len, const struct caps_filter *filter,
|
|
|
|
enum_value_caps_callback callback, void *user, USHORT *count )
|
2021-06-21 09:05:23 +02:00
|
|
|
{
|
|
|
|
const struct hid_value_caps *caps, *caps_end;
|
|
|
|
NTSTATUS status;
|
|
|
|
LONG remaining = *count;
|
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
for (status = get_value_caps_range( preparsed, report_type, report_len, &caps, &caps_end );
|
2021-06-21 09:05:23 +02:00
|
|
|
status == HIDP_STATUS_SUCCESS && caps != caps_end; caps++)
|
|
|
|
{
|
|
|
|
if (!match_value_caps( caps, filter )) continue;
|
2021-06-24 10:05:57 +02:00
|
|
|
if (filter->report_id && caps->report_id != filter->report_id) continue;
|
2021-06-25 10:06:48 +02:00
|
|
|
else if (filter->array && (caps->is_range || caps->report_count <= 1)) return HIDP_STATUS_NOT_VALUE_ARRAY;
|
2021-06-24 10:05:57 +02:00
|
|
|
else if (remaining-- > 0) status = callback( caps, user );
|
2021-06-21 09:05:23 +02:00
|
|
|
}
|
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
if (status == HIDP_STATUS_NULL) status = HIDP_STATUS_SUCCESS;
|
2021-06-21 09:05:23 +02:00
|
|
|
if (status != HIDP_STATUS_SUCCESS) return status;
|
|
|
|
|
|
|
|
*count -= remaining;
|
|
|
|
if (*count == 0) return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
if (remaining < 0) return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2021-06-25 10:06:48 +02:00
|
|
|
/* copy count bits from src, starting at (-shift) bit if < 0, to dst starting at (shift) bit if > 0 */
|
|
|
|
static void copy_bits( unsigned char *dst, const unsigned char *src, int count, int shift )
|
|
|
|
{
|
|
|
|
unsigned char bits, mask;
|
|
|
|
size_t src_shift = shift < 0 ? (-shift & 7) : 0;
|
|
|
|
size_t dst_shift = shift > 0 ? (shift & 7) : 0;
|
|
|
|
if (shift < 0) src += -shift / 8;
|
|
|
|
if (shift > 0) dst += shift / 8;
|
|
|
|
|
|
|
|
if (src_shift == 0 && dst_shift == 0)
|
|
|
|
{
|
|
|
|
memcpy( dst, src, count / 8 );
|
|
|
|
dst += count / 8;
|
|
|
|
src += count / 8;
|
|
|
|
count &= 7;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!count) return;
|
|
|
|
|
|
|
|
bits = *dst << (8 - dst_shift);
|
|
|
|
count += dst_shift;
|
|
|
|
|
|
|
|
while (count > 8)
|
|
|
|
{
|
|
|
|
*dst = bits >> (8 - dst_shift);
|
|
|
|
bits = *(unsigned short *)src++ >> src_shift;
|
|
|
|
*dst++ |= bits << dst_shift;
|
|
|
|
count -= 8;
|
|
|
|
}
|
|
|
|
|
|
|
|
bits >>= (8 - dst_shift);
|
|
|
|
if (count <= 8 - src_shift) bits |= (*src >> src_shift) << dst_shift;
|
|
|
|
else bits |= (*(unsigned short *)src >> src_shift) << dst_shift;
|
|
|
|
|
|
|
|
mask = (1 << count) - 1;
|
|
|
|
*dst = (bits & mask) | (*dst & ~mask);
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2021-06-21 09:05:21 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetButtonCaps( HIDP_REPORT_TYPE report_type, HIDP_BUTTON_CAPS *caps, USHORT *caps_count,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data )
|
2015-06-30 14:39:50 +02:00
|
|
|
{
|
2021-06-21 09:05:21 +02:00
|
|
|
return HidP_GetSpecificButtonCaps( report_type, 0, 0, 0, caps, caps_count, preparsed_data );
|
2015-06-30 14:39:50 +02:00
|
|
|
}
|
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetCaps( PHIDP_PREPARSED_DATA preparsed_data, HIDP_CAPS *caps )
|
2015-06-30 14:39:40 +02:00
|
|
|
{
|
2021-06-21 09:05:23 +02:00
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
2015-06-30 14:39:40 +02:00
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
TRACE( "preparsed_data %p, caps %p.\n", preparsed_data, caps );
|
2015-06-30 14:39:40 +02:00
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
if (preparsed->magic != HID_MAGIC) return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
2015-06-30 14:39:40 +02:00
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
*caps = preparsed->caps;
|
|
|
|
caps->NumberInputButtonCaps = preparsed->new_caps.NumberInputButtonCaps;
|
|
|
|
caps->NumberOutputButtonCaps = preparsed->new_caps.NumberOutputButtonCaps;
|
|
|
|
caps->NumberFeatureButtonCaps = preparsed->new_caps.NumberFeatureButtonCaps;
|
2021-06-24 10:05:55 +02:00
|
|
|
caps->NumberInputValueCaps = preparsed->new_caps.NumberInputValueCaps;
|
|
|
|
caps->NumberOutputValueCaps = preparsed->new_caps.NumberOutputValueCaps;
|
|
|
|
caps->NumberFeatureValueCaps = preparsed->new_caps.NumberFeatureValueCaps;
|
2015-06-30 14:39:40 +02:00
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2021-06-25 10:06:48 +02:00
|
|
|
struct usage_value_params
|
|
|
|
{
|
|
|
|
void *value_buf;
|
|
|
|
USHORT value_len;
|
|
|
|
void *report_buf;
|
|
|
|
};
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
struct get_usage_params
|
2015-06-30 14:40:00 +02:00
|
|
|
{
|
2021-06-24 10:05:58 +02:00
|
|
|
USAGE *usages;
|
|
|
|
USAGE *usages_end;
|
|
|
|
char *report_buf;
|
|
|
|
};
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
static NTSTATUS get_usage( const struct hid_value_caps *caps, void *user )
|
|
|
|
{
|
|
|
|
struct get_usage_params *params = user;
|
|
|
|
ULONG bit, last;
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
for (bit = caps->start_bit, last = bit + caps->usage_max - caps->usage_min; bit <= last; ++bit)
|
2016-12-08 15:34:02 +01:00
|
|
|
{
|
2021-06-24 10:05:58 +02:00
|
|
|
if (!(params->report_buf[bit / 8] & (1 << (bit % 8)))) continue;
|
|
|
|
if (params->usages < params->usages_end) *params->usages = caps->usage_min + bit - caps->start_bit;
|
|
|
|
params->usages++;
|
2016-12-08 15:34:02 +01:00
|
|
|
}
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetUsages( HIDP_REPORT_TYPE report_type, USAGE usage_page, USHORT collection, USAGE *usages,
|
|
|
|
ULONG *usages_len, PHIDP_PREPARSED_DATA preparsed_data, char *report_buf, ULONG report_len )
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
struct get_usage_params params = {.usages = usages, .usages_end = usages + *usages_len, .report_buf = report_buf};
|
|
|
|
struct caps_filter filter = {.buttons = TRUE, .usage_page = usage_page, .collection = collection};
|
|
|
|
NTSTATUS status;
|
|
|
|
USHORT limit = -1;
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
TRACE( "report_type %d, collection %d, usages %p, usages_len %p, preparsed_data %p, report_buf %p, report_len %u.\n",
|
|
|
|
report_type, collection, usages, usages_len, preparsed_data, report_buf, report_len );
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
if (!report_len) return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
2016-12-08 15:34:02 +01:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
filter.report_id = report_buf[0];
|
|
|
|
status = enum_value_caps( preparsed, report_type, report_len, &filter, get_usage, ¶ms, &limit );
|
|
|
|
*usages_len = params.usages - usages;
|
|
|
|
if (status != HIDP_STATUS_SUCCESS) return status;
|
2015-06-30 14:40:00 +02:00
|
|
|
|
2021-06-24 10:05:58 +02:00
|
|
|
if (*usages_len == 0) return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
if (params.usages > params.usages_end) return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
return status;
|
2015-06-30 14:40:00 +02:00
|
|
|
}
|
|
|
|
|
2021-06-21 09:05:21 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetValueCaps( HIDP_REPORT_TYPE report_type, HIDP_VALUE_CAPS *caps, USHORT *caps_count,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data )
|
2015-06-30 14:39:55 +02:00
|
|
|
{
|
2021-06-21 09:05:21 +02:00
|
|
|
return HidP_GetSpecificValueCaps( report_type, 0, 0, 0, caps, caps_count, preparsed_data );
|
2015-06-30 14:39:55 +02:00
|
|
|
}
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
NTSTATUS WINAPI HidP_InitializeReportForID( HIDP_REPORT_TYPE report_type, UCHAR report_id,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data, char *report_buf, ULONG report_len )
|
2015-06-30 14:40:10 +02:00
|
|
|
{
|
2021-06-21 09:05:22 +02:00
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
const struct hid_value_caps *caps, *end;
|
|
|
|
NTSTATUS status;
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
TRACE( "report_type %d, report_id %x, preparsed_data %p, report_buf %p, report_len %u.\n", report_type,
|
|
|
|
report_id, preparsed_data, report_buf, report_len );
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
if (!report_len) return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
status = get_value_caps_range( preparsed, report_type, report_len, &caps, &end );
|
|
|
|
if (status != HIDP_STATUS_SUCCESS) return status;
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
while (caps != end && (caps->report_id != report_id || (!caps->usage_min && !caps->usage_max))) caps++;
|
|
|
|
if (caps == end) return HIDP_STATUS_REPORT_DOES_NOT_EXIST;
|
2015-06-30 14:40:10 +02:00
|
|
|
|
2021-06-21 09:05:22 +02:00
|
|
|
memset( report_buf, 0, report_len );
|
|
|
|
report_buf[0] = report_id;
|
2015-06-30 14:40:10 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2015-06-30 14:40:32 +02:00
|
|
|
|
2021-06-24 10:05:56 +02:00
|
|
|
static NTSTATUS get_usage_list_length( const struct hid_value_caps *caps, void *data )
|
2015-06-30 14:40:32 +02:00
|
|
|
{
|
2021-06-24 10:05:56 +02:00
|
|
|
*(ULONG *)data += caps->report_count;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2019-05-13 12:33:56 +02:00
|
|
|
|
2021-06-24 10:05:56 +02:00
|
|
|
ULONG WINAPI HidP_MaxUsageListLength( HIDP_REPORT_TYPE report_type, USAGE usage_page, PHIDP_PREPARSED_DATA preparsed_data )
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
struct caps_filter filter = {.buttons = TRUE, .usage_page = usage_page};
|
|
|
|
USHORT limit = -1;
|
|
|
|
ULONG count = 0;
|
2015-06-30 14:40:32 +02:00
|
|
|
|
2021-06-24 10:05:56 +02:00
|
|
|
TRACE( "report_type %d, usage_page %x, preparsed_data %p.\n", report_type, usage_page, preparsed_data );
|
2015-06-30 14:40:32 +02:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
enum_value_caps( preparsed, report_type, 0, &filter, get_usage_list_length, &count, &limit );
|
2015-06-30 14:40:32 +02:00
|
|
|
return count;
|
|
|
|
}
|
2016-09-19 15:45:34 +02:00
|
|
|
|
2021-06-25 10:06:48 +02:00
|
|
|
static NTSTATUS set_usage_value( const struct hid_value_caps *caps, void *user )
|
|
|
|
{
|
|
|
|
struct usage_value_params *params = user;
|
|
|
|
ULONG bit_count = caps->bit_size * caps->report_count;
|
|
|
|
if ((bit_count + 7) / 8 > params->value_len) return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
copy_bits( params->report_buf, params->value_buf, bit_count, caps->start_bit );
|
|
|
|
return HIDP_STATUS_NULL;
|
|
|
|
}
|
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2021-06-14 09:15:50 +02:00
|
|
|
NTSTATUS WINAPI HidP_SetUsageValueArray( HIDP_REPORT_TYPE report_type, USAGE usage_page, USHORT collection,
|
|
|
|
USAGE usage, char *value_buf, USHORT value_len,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data, char *report_buf, ULONG report_len )
|
|
|
|
{
|
2021-06-25 10:06:48 +02:00
|
|
|
struct usage_value_params params = {.value_buf = value_buf, .value_len = value_len, .report_buf = report_buf};
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
struct caps_filter filter = {.values = TRUE, .array = TRUE, .usage_page = usage_page, .collection = collection, .usage = usage};
|
|
|
|
USHORT count = 1;
|
|
|
|
|
|
|
|
TRACE( "report_type %d, usage_page %x, collection %d, usage %x, value_buf %p, value_len %u, "
|
|
|
|
"preparsed_data %p, report_buf %p, report_len %u.\n",
|
2021-06-14 09:15:50 +02:00
|
|
|
report_type, usage_page, collection, usage, value_buf, value_len, preparsed_data, report_buf, report_len );
|
|
|
|
|
2021-06-25 10:06:48 +02:00
|
|
|
if (!report_len) return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
filter.report_id = report_buf[0];
|
|
|
|
return enum_value_caps( preparsed, report_type, report_len, &filter, set_usage_value, ¶ms, &count );
|
2021-06-14 09:15:50 +02:00
|
|
|
}
|
2018-11-23 22:09:34 +01:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
struct set_usage_params
|
2019-05-03 11:59:02 +02:00
|
|
|
{
|
2021-06-24 10:05:57 +02:00
|
|
|
USAGE usage;
|
|
|
|
char *report_buf;
|
|
|
|
};
|
2019-05-03 11:59:02 +02:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
static NTSTATUS set_usage( const struct hid_value_caps *caps, void *user )
|
|
|
|
{
|
|
|
|
struct set_usage_params *params = user;
|
|
|
|
ULONG bit = caps->start_bit + params->usage - caps->usage_min;
|
|
|
|
params->report_buf[bit / 8] |= (1 << (bit % 8));
|
|
|
|
return HIDP_STATUS_NULL;
|
|
|
|
}
|
2019-05-03 11:59:02 +02:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
NTSTATUS WINAPI HidP_SetUsages( HIDP_REPORT_TYPE report_type, USAGE usage_page, USHORT collection, USAGE *usages,
|
|
|
|
ULONG *usage_count, PHIDP_PREPARSED_DATA preparsed_data, char *report_buf, ULONG report_len )
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
struct set_usage_params params = {.report_buf = report_buf};
|
|
|
|
struct caps_filter filter = {.buttons = TRUE, .usage_page = usage_page, .collection = collection};
|
|
|
|
NTSTATUS status;
|
|
|
|
USHORT limit = 1;
|
|
|
|
ULONG i, count = *usage_count;
|
2019-05-03 11:59:02 +02:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
TRACE( "report_type %d, usage_page %x, collection %d, usages %p, usage_count %p, preparsed_data %p, "
|
|
|
|
"report_buf %p, report_len %u.\n",
|
|
|
|
report_type, usage_page, collection, usages, usage_count, preparsed_data, report_buf, report_len );
|
|
|
|
|
|
|
|
if (!report_len) return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
filter.report_id = report_buf[0];
|
|
|
|
for (i = 0; i < count; ++i)
|
|
|
|
{
|
|
|
|
params.usage = filter.usage = usages[i];
|
|
|
|
status = enum_value_caps( preparsed, report_type, report_len, &filter, set_usage, ¶ms, &limit );
|
|
|
|
if (status != HIDP_STATUS_SUCCESS) return status;
|
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
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
static NTSTATUS get_button_caps( const struct hid_value_caps *caps, void *user )
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-21 09:05:23 +02:00
|
|
|
HIDP_BUTTON_CAPS **iter = user, *dst = *iter;
|
|
|
|
dst->UsagePage = caps->usage_page;
|
|
|
|
dst->ReportID = caps->report_id;
|
|
|
|
dst->LinkCollection = caps->link_collection;
|
|
|
|
dst->LinkUsagePage = caps->link_usage_page;
|
|
|
|
dst->LinkUsage = caps->link_usage;
|
|
|
|
dst->BitField = caps->bit_field;
|
|
|
|
dst->IsAlias = FALSE;
|
|
|
|
dst->IsAbsolute = HID_VALUE_CAPS_IS_ABSOLUTE( caps );
|
|
|
|
if (!(dst->IsRange = caps->is_range))
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-21 09:05:23 +02:00
|
|
|
dst->NotRange.Usage = caps->usage_min;
|
|
|
|
dst->NotRange.DataIndex = caps->data_index_min;
|
2016-11-15 15:05:38 +01:00
|
|
|
}
|
2021-06-21 09:05:23 +02:00
|
|
|
else
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-21 09:05:23 +02:00
|
|
|
dst->Range.UsageMin = caps->usage_min;
|
|
|
|
dst->Range.UsageMax = caps->usage_max;
|
|
|
|
dst->Range.DataIndexMin = caps->data_index_min;
|
|
|
|
dst->Range.DataIndexMax = caps->data_index_max;
|
2016-11-15 15:05:38 +01:00
|
|
|
}
|
2021-06-21 09:05:23 +02:00
|
|
|
if (!(dst->IsStringRange = caps->is_string_range))
|
|
|
|
dst->NotRange.StringIndex = caps->string_min;
|
|
|
|
else
|
2016-11-15 15:05:38 +01:00
|
|
|
{
|
2021-06-21 09:05:23 +02:00
|
|
|
dst->Range.StringMin = caps->string_min;
|
|
|
|
dst->Range.StringMax = caps->string_max;
|
2016-11-15 15:05:38 +01:00
|
|
|
}
|
2021-06-21 09:05:23 +02:00
|
|
|
if ((dst->IsDesignatorRange = caps->is_designator_range))
|
|
|
|
dst->NotRange.DesignatorIndex = caps->designator_min;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dst->Range.DesignatorMin = caps->designator_min;
|
|
|
|
dst->Range.DesignatorMax = caps->designator_max;
|
|
|
|
}
|
|
|
|
*iter += 1;
|
2016-11-15 15:05:38 +01:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2021-06-21 09:05:23 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetSpecificButtonCaps( HIDP_REPORT_TYPE report_type, USAGE usage_page, USHORT collection,
|
|
|
|
USAGE usage, HIDP_BUTTON_CAPS *caps, USHORT *caps_count,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data )
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
const struct caps_filter filter = {.buttons = TRUE, .usage_page = usage_page, .collection = collection, .usage = usage};
|
|
|
|
|
|
|
|
TRACE( "report_type %d, usage_page %x, collection %d, usage %x, caps %p, caps_count %p, preparsed_data %p.\n",
|
|
|
|
report_type, usage_page, collection, usage, caps, caps_count, preparsed_data );
|
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
return enum_value_caps( preparsed, report_type, 0, &filter, get_button_caps, &caps, caps_count );
|
2021-06-21 09:05:23 +02:00
|
|
|
}
|
2016-11-15 15:05:38 +01:00
|
|
|
|
2021-06-24 10:05:55 +02:00
|
|
|
static NTSTATUS get_value_caps( const struct hid_value_caps *caps, void *user )
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-24 10:05:55 +02:00
|
|
|
HIDP_VALUE_CAPS **iter = user, *dst = *iter;
|
|
|
|
dst->UsagePage = caps->usage_page;
|
|
|
|
dst->ReportID = caps->report_id;
|
|
|
|
dst->LinkCollection = caps->link_collection;
|
|
|
|
dst->LinkUsagePage = caps->link_usage_page;
|
|
|
|
dst->LinkUsage = caps->link_usage;
|
|
|
|
dst->BitField = caps->bit_field;
|
|
|
|
dst->IsAlias = FALSE;
|
|
|
|
dst->IsAbsolute = HID_VALUE_CAPS_IS_ABSOLUTE( caps );
|
|
|
|
dst->HasNull = HID_VALUE_CAPS_HAS_NULL( caps );
|
|
|
|
dst->BitSize = caps->bit_size;
|
|
|
|
dst->ReportCount = caps->is_range ? 1 : caps->report_count;
|
|
|
|
dst->UnitsExp = caps->units_exp;
|
|
|
|
dst->Units = caps->units;
|
|
|
|
dst->LogicalMin = caps->logical_min;
|
|
|
|
dst->LogicalMax = caps->logical_max;
|
|
|
|
dst->PhysicalMin = caps->physical_min;
|
|
|
|
dst->PhysicalMax = caps->physical_max;
|
|
|
|
if (!(dst->IsRange = caps->is_range))
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-24 10:05:55 +02:00
|
|
|
dst->NotRange.Usage = caps->usage_min;
|
|
|
|
dst->NotRange.DataIndex = caps->data_index_min;
|
2016-11-03 17:39:49 +01:00
|
|
|
}
|
2021-06-24 10:05:55 +02:00
|
|
|
else
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-24 10:05:55 +02:00
|
|
|
dst->Range.UsageMin = caps->usage_min;
|
|
|
|
dst->Range.UsageMax = caps->usage_max;
|
|
|
|
dst->Range.DataIndexMin = caps->data_index_min;
|
|
|
|
dst->Range.DataIndexMax = caps->data_index_max;
|
2016-11-03 17:39:49 +01:00
|
|
|
}
|
2021-06-24 10:05:55 +02:00
|
|
|
if (!(dst->IsStringRange = caps->is_string_range))
|
|
|
|
dst->NotRange.StringIndex = caps->string_min;
|
|
|
|
else
|
2016-11-03 17:39:49 +01:00
|
|
|
{
|
2021-06-24 10:05:55 +02:00
|
|
|
dst->Range.StringMin = caps->string_min;
|
|
|
|
dst->Range.StringMax = caps->string_max;
|
2016-11-03 17:39:49 +01:00
|
|
|
}
|
2021-06-24 10:05:55 +02:00
|
|
|
if ((dst->IsDesignatorRange = caps->is_designator_range))
|
|
|
|
dst->NotRange.DesignatorIndex = caps->designator_min;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dst->Range.DesignatorMin = caps->designator_min;
|
|
|
|
dst->Range.DesignatorMax = caps->designator_max;
|
|
|
|
}
|
|
|
|
*iter += 1;
|
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
NTSTATUS WINAPI HidP_GetSpecificValueCaps( HIDP_REPORT_TYPE report_type, USAGE usage_page, USHORT collection,
|
|
|
|
USAGE usage, HIDP_VALUE_CAPS *caps, USHORT *caps_count,
|
|
|
|
PHIDP_PREPARSED_DATA preparsed_data )
|
|
|
|
{
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
const struct caps_filter filter = {.values = TRUE, .usage_page = usage_page, .collection = collection, .usage = usage};
|
2016-11-03 17:39:49 +01:00
|
|
|
|
2021-06-24 10:05:55 +02:00
|
|
|
TRACE( "report_type %d, usage_page %x, collection %d, usage %x, caps %p, caps_count %p, preparsed_data %p.\n",
|
|
|
|
report_type, usage_page, collection, usage, caps, caps_count, preparsed_data );
|
2016-11-03 17:39:49 +01:00
|
|
|
|
2021-06-24 10:05:57 +02:00
|
|
|
return enum_value_caps( preparsed, report_type, 0, &filter, get_value_caps, &caps, caps_count );
|
2016-11-03 17:39:49 +01:00
|
|
|
}
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
struct get_usage_and_page_params
|
2017-01-25 14:07:04 +01:00
|
|
|
{
|
2021-06-24 10:05:59 +02:00
|
|
|
USAGE_AND_PAGE *usages;
|
|
|
|
USAGE_AND_PAGE *usages_end;
|
|
|
|
char *report_buf;
|
|
|
|
};
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
static NTSTATUS get_usage_and_page( const struct hid_value_caps *caps, void *user )
|
|
|
|
{
|
|
|
|
struct get_usage_and_page_params *params = user;
|
|
|
|
ULONG bit, last;
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
for (bit = caps->start_bit, last = bit + caps->usage_max - caps->usage_min; bit <= last; bit++)
|
2017-01-25 14:07:04 +01:00
|
|
|
{
|
2021-06-24 10:05:59 +02:00
|
|
|
if (!(params->report_buf[bit / 8] & (1 << (bit % 8)))) continue;
|
|
|
|
if (params->usages < params->usages_end)
|
2017-01-25 14:07:04 +01:00
|
|
|
{
|
2021-06-24 10:05:59 +02:00
|
|
|
params->usages->UsagePage = caps->usage_page;
|
|
|
|
params->usages->Usage = caps->usage_min + bit - caps->start_bit;
|
2017-01-25 14:07:04 +01:00
|
|
|
}
|
2021-06-24 10:05:59 +02:00
|
|
|
params->usages++;
|
2017-01-25 14:07:04 +01:00
|
|
|
}
|
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
return HIDP_STATUS_SUCCESS;
|
|
|
|
}
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
NTSTATUS WINAPI HidP_GetUsagesEx( HIDP_REPORT_TYPE report_type, USHORT collection, USAGE_AND_PAGE *usages,
|
|
|
|
ULONG *usages_len, PHIDP_PREPARSED_DATA preparsed_data, char *report_buf, ULONG report_len )
|
|
|
|
{
|
|
|
|
struct get_usage_and_page_params params = {.usages = usages, .usages_end = usages + *usages_len, .report_buf = report_buf};
|
|
|
|
WINE_HIDP_PREPARSED_DATA *preparsed = (WINE_HIDP_PREPARSED_DATA *)preparsed_data;
|
|
|
|
struct caps_filter filter = {.buttons = TRUE, .collection = collection};
|
|
|
|
NTSTATUS status;
|
|
|
|
USHORT limit = -1;
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
TRACE( "report_type %d, collection %d, usages %p, usages_len %p, preparsed_data %p, report_buf %p, report_len %u.\n",
|
|
|
|
report_type, collection, usages, usages_len, preparsed_data, report_buf, report_len );
|
2017-01-25 14:07:04 +01:00
|
|
|
|
2021-06-24 10:05:59 +02:00
|
|
|
if (!report_len) return HIDP_STATUS_INVALID_REPORT_LENGTH;
|
|
|
|
|
|
|
|
filter.report_id = report_buf[0];
|
|
|
|
status = enum_value_caps( preparsed, report_type, report_len, &filter, get_usage_and_page, ¶ms, &limit );
|
|
|
|
*usages_len = params.usages - usages;
|
|
|
|
if (status != HIDP_STATUS_SUCCESS) return status;
|
|
|
|
|
|
|
|
if (*usages_len == 0) return HIDP_STATUS_USAGE_NOT_FOUND;
|
|
|
|
if (params.usages > params.usages_end) return HIDP_STATUS_BUFFER_TOO_SMALL;
|
|
|
|
return status;
|
2017-01-25 14:07:04 +01:00
|
|
|
}
|
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
|
|
|
|
2021-06-10 10:06:24 +02:00
|
|
|
if (data->magic != HID_MAGIC)
|
|
|
|
return HIDP_STATUS_INVALID_PREPARSED_DATA;
|
|
|
|
|
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
|
|
|
}
|