Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
W
wine-winehq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
wine
wine-winehq
Commits
51560aab
Commit
51560aab
authored
Jun 21, 2021
by
Rémi Bernon
Committed by
Alexandre Julliard
Jun 23, 2021
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
hidclass.sys: Build an alternate value array.
Signed-off-by:
Rémi Bernon
<
rbernon@codeweavers.com
>
Signed-off-by:
Alexandre Julliard
<
julliard@winehq.org
>
parent
7af8ca63
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
109 additions
and
1 deletion
+109
-1
descriptor.c
dlls/hidclass.sys/descriptor.c
+98
-1
hid.h
include/wine/hid.h
+11
-0
No files found.
dlls/hidclass.sys/descriptor.c
View file @
51560aab
...
@@ -287,8 +287,13 @@ struct hid_parser_state
...
@@ -287,8 +287,13 @@ struct hid_parser_state
struct
hid_value_caps
*
collections
;
struct
hid_value_caps
*
collections
;
DWORD
collections_size
;
DWORD
collections_size
;
struct
hid_value_caps
*
values
[
3
];
ULONG
values_size
[
3
];
ULONG
bit_size
[
3
][
256
];
ULONG
bit_size
[
3
][
256
];
USHORT
*
byte_size
[
3
];
/* pointers to caps */
USHORT
*
byte_size
[
3
];
/* pointers to caps */
USHORT
*
value_idx
[
3
];
/* pointers to caps */
USHORT
*
data_idx
[
3
];
/* pointers to caps */
};
};
static
BOOL
array_reserve
(
struct
hid_value_caps
**
array
,
DWORD
*
array_size
,
DWORD
index
)
static
BOOL
array_reserve
(
struct
hid_value_caps
**
array
,
DWORD
*
array_size
,
DWORD
index
)
...
@@ -447,7 +452,12 @@ static BOOL parse_end_collection( struct hid_parser_state *state )
...
@@ -447,7 +452,12 @@ static BOOL parse_end_collection( struct hid_parser_state *state )
static
BOOL
parse_new_value_caps
(
struct
hid_parser_state
*
state
,
HIDP_REPORT_TYPE
type
,
struct
collection
*
collection
)
static
BOOL
parse_new_value_caps
(
struct
hid_parser_state
*
state
,
HIDP_REPORT_TYPE
type
,
struct
collection
*
collection
)
{
{
struct
hid_value_caps
*
value
;
USAGE
usage_page
=
state
->
items
.
usage_page
;
DWORD
usages_size
=
max
(
1
,
state
->
usages_size
);
USHORT
*
byte_size
=
state
->
byte_size
[
type
];
USHORT
*
byte_size
=
state
->
byte_size
[
type
];
USHORT
*
value_idx
=
state
->
value_idx
[
type
];
USHORT
*
data_idx
=
state
->
data_idx
[
type
];
ULONG
*
bit_size
=
&
state
->
bit_size
[
type
][
state
->
items
.
report_id
];
ULONG
*
bit_size
=
&
state
->
bit_size
[
type
][
state
->
items
.
report_id
];
struct
feature
*
feature
;
struct
feature
*
feature
;
int
j
;
int
j
;
...
@@ -472,6 +482,34 @@ static BOOL parse_new_value_caps( struct hid_parser_state *state, HIDP_REPORT_TY
...
@@ -472,6 +482,34 @@ static BOOL parse_new_value_caps( struct hid_parser_state *state, HIDP_REPORT_TY
*
bit_size
+=
state
->
items
.
bit_size
*
state
->
items
.
report_count
;
*
bit_size
+=
state
->
items
.
bit_size
*
state
->
items
.
report_count
;
*
byte_size
=
max
(
*
byte_size
,
(
*
bit_size
+
7
)
/
8
);
*
byte_size
=
max
(
*
byte_size
,
(
*
bit_size
+
7
)
/
8
);
if
(
!
state
->
items
.
report_count
)
{
reset_local_items
(
state
);
return
TRUE
;
}
if
(
!
array_reserve
(
&
state
->
values
[
type
],
&
state
->
values_size
[
type
],
*
value_idx
+
usages_size
))
{
ERR
(
"HID parser values overflow!
\n
"
);
return
FALSE
;
}
value
=
state
->
values
[
type
]
+
*
value_idx
;
state
->
items
.
report_count
-=
usages_size
-
1
;
while
(
usages_size
--
)
{
state
->
items
.
usage_page
=
state
->
usages_page
[
usages_size
];
state
->
items
.
usage_min
=
state
->
usages_min
[
usages_size
];
state
->
items
.
usage_max
=
state
->
usages_max
[
usages_size
];
state
->
items
.
data_index_min
=
*
data_idx
;
state
->
items
.
data_index_max
=
*
data_idx
+
state
->
items
.
usage_max
-
state
->
items
.
usage_min
;
if
(
state
->
items
.
usage_max
||
state
->
items
.
usage_min
)
*
data_idx
=
state
->
items
.
data_index_max
+
1
;
*
value
++
=
state
->
items
;
*
value_idx
+=
1
;
state
->
items
.
report_count
=
1
;
}
state
->
items
.
usage_page
=
usage_page
;
reset_local_items
(
state
);
reset_local_items
(
state
);
return
TRUE
;
return
TRUE
;
}
}
...
@@ -482,6 +520,14 @@ static void init_parser_state( struct hid_parser_state *state )
...
@@ -482,6 +520,14 @@ static void init_parser_state( struct hid_parser_state *state )
state
->
byte_size
[
HidP_Input
]
=
&
state
->
caps
.
InputReportByteLength
;
state
->
byte_size
[
HidP_Input
]
=
&
state
->
caps
.
InputReportByteLength
;
state
->
byte_size
[
HidP_Output
]
=
&
state
->
caps
.
OutputReportByteLength
;
state
->
byte_size
[
HidP_Output
]
=
&
state
->
caps
.
OutputReportByteLength
;
state
->
byte_size
[
HidP_Feature
]
=
&
state
->
caps
.
FeatureReportByteLength
;
state
->
byte_size
[
HidP_Feature
]
=
&
state
->
caps
.
FeatureReportByteLength
;
state
->
value_idx
[
HidP_Input
]
=
&
state
->
caps
.
NumberInputValueCaps
;
state
->
value_idx
[
HidP_Output
]
=
&
state
->
caps
.
NumberOutputValueCaps
;
state
->
value_idx
[
HidP_Feature
]
=
&
state
->
caps
.
NumberFeatureValueCaps
;
state
->
data_idx
[
HidP_Input
]
=
&
state
->
caps
.
NumberInputDataIndices
;
state
->
data_idx
[
HidP_Output
]
=
&
state
->
caps
.
NumberOutputDataIndices
;
state
->
data_idx
[
HidP_Feature
]
=
&
state
->
caps
.
NumberFeatureDataIndices
;
}
}
static
void
free_parser_state
(
struct
hid_parser_state
*
state
)
static
void
free_parser_state
(
struct
hid_parser_state
*
state
)
...
@@ -490,6 +536,9 @@ static void free_parser_state( struct hid_parser_state *state )
...
@@ -490,6 +536,9 @@ static void free_parser_state( struct hid_parser_state *state )
if
(
state
->
collection_idx
)
ERR
(
"%u unpopped device collection on the stack
\n
"
,
state
->
collection_idx
);
if
(
state
->
collection_idx
)
ERR
(
"%u unpopped device collection on the stack
\n
"
,
state
->
collection_idx
);
free
(
state
->
stack
);
free
(
state
->
stack
);
free
(
state
->
collections
);
free
(
state
->
collections
);
free
(
state
->
values
[
HidP_Input
]
);
free
(
state
->
values
[
HidP_Output
]
);
free
(
state
->
values
[
HidP_Feature
]
);
free
(
state
);
free
(
state
);
}
}
...
@@ -785,9 +834,10 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
...
@@ -785,9 +834,10 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
{
{
WINE_HID_LINK_COLLECTION_NODE
*
nodes
;
WINE_HID_LINK_COLLECTION_NODE
*
nodes
;
WINE_HIDP_PREPARSED_DATA
*
data
;
WINE_HIDP_PREPARSED_DATA
*
data
;
struct
hid_value_caps
*
caps
;
unsigned
int
report_count
;
unsigned
int
report_count
;
unsigned
int
size
;
unsigned
int
size
;
DWORD
i
;
DWORD
i
,
button
,
filler
,
caps_len
,
caps_off
;
struct
preparse_ctx
ctx
;
struct
preparse_ctx
ctx
;
unsigned
int
element_off
;
unsigned
int
element_off
;
...
@@ -804,13 +854,26 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
...
@@ -804,13 +854,26 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
nodes_offset
=
size
;
nodes_offset
=
size
;
size
+=
state
->
caps
.
NumberLinkCollectionNodes
*
sizeof
(
WINE_HID_LINK_COLLECTION_NODE
);
size
+=
state
->
caps
.
NumberLinkCollectionNodes
*
sizeof
(
WINE_HID_LINK_COLLECTION_NODE
);
caps_len
=
state
->
caps
.
NumberInputValueCaps
+
state
->
caps
.
NumberOutputValueCaps
+
state
->
caps
.
NumberFeatureValueCaps
;
caps_off
=
size
;
size
+=
caps_len
*
sizeof
(
*
caps
);
if
(
!
(
data
=
calloc
(
1
,
size
)))
return
NULL
;
if
(
!
(
data
=
calloc
(
1
,
size
)))
return
NULL
;
data
->
magic
=
HID_MAGIC
;
data
->
magic
=
HID_MAGIC
;
data
->
dwSize
=
size
;
data
->
dwSize
=
size
;
data
->
caps
=
state
->
caps
;
data
->
caps
=
state
->
caps
;
data
->
new_caps
=
state
->
caps
;
data
->
elementOffset
=
element_off
;
data
->
elementOffset
=
element_off
;
data
->
nodesOffset
=
nodes_offset
;
data
->
nodesOffset
=
nodes_offset
;
data
->
value_caps_offset
=
caps_off
;
data
->
value_caps_count
[
HidP_Input
]
=
state
->
caps
.
NumberInputValueCaps
;
data
->
value_caps_count
[
HidP_Output
]
=
state
->
caps
.
NumberOutputValueCaps
;
data
->
value_caps_count
[
HidP_Feature
]
=
state
->
caps
.
NumberFeatureValueCaps
;
data
->
caps
.
NumberInputValueCaps
=
data
->
caps
.
NumberInputButtonCaps
=
data
->
caps
.
NumberInputDataIndices
=
0
;
data
->
caps
.
NumberOutputValueCaps
=
data
->
caps
.
NumberOutputButtonCaps
=
data
->
caps
.
NumberOutputDataIndices
=
0
;
data
->
caps
.
NumberFeatureValueCaps
=
data
->
caps
.
NumberFeatureButtonCaps
=
data
->
caps
.
NumberFeatureDataIndices
=
0
;
preparse_collection
(
base_collection
,
base_collection
,
data
,
&
ctx
);
preparse_collection
(
base_collection
,
base_collection
,
data
,
&
ctx
);
nodes
=
HID_NODES
(
data
);
nodes
=
HID_NODES
(
data
);
...
@@ -830,6 +893,40 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
...
@@ -830,6 +893,40 @@ static WINE_HIDP_PREPARSED_DATA *build_preparsed_data( struct collection *base_c
}
}
}
}
/* fixup value vs button vs filler counts */
caps
=
HID_INPUT_VALUE_CAPS
(
data
);
memcpy
(
caps
,
state
->
values
[
0
],
data
->
new_caps
.
NumberInputValueCaps
*
sizeof
(
*
caps
)
);
for
(
i
=
0
,
button
=
0
,
filler
=
0
;
i
<
data
->
new_caps
.
NumberInputValueCaps
;
++
i
)
{
if
(
!
caps
[
i
].
usage_min
&&
!
caps
[
i
].
usage_max
)
filler
++
;
else
if
(
HID_VALUE_CAPS_IS_BUTTON
(
caps
+
i
))
button
++
;
}
data
->
new_caps
.
NumberInputButtonCaps
=
button
;
data
->
new_caps
.
NumberInputValueCaps
-=
filler
+
button
;
caps
=
HID_OUTPUT_VALUE_CAPS
(
data
);
memcpy
(
caps
,
state
->
values
[
1
],
data
->
new_caps
.
NumberOutputValueCaps
*
sizeof
(
*
caps
)
);
for
(
i
=
0
,
button
=
0
,
filler
=
0
;
i
<
data
->
new_caps
.
NumberOutputValueCaps
;
++
i
)
{
if
(
!
caps
[
i
].
usage_min
&&
!
caps
[
i
].
usage_max
)
filler
++
;
else
if
(
HID_VALUE_CAPS_IS_BUTTON
(
caps
+
i
))
button
++
;
}
caps
+=
data
->
new_caps
.
NumberOutputValueCaps
;
data
->
new_caps
.
NumberOutputButtonCaps
=
button
;
data
->
new_caps
.
NumberOutputValueCaps
-=
filler
+
button
;
caps
=
HID_FEATURE_VALUE_CAPS
(
data
);
memcpy
(
caps
,
state
->
values
[
2
],
data
->
new_caps
.
NumberFeatureValueCaps
*
sizeof
(
*
caps
)
);
for
(
i
=
0
,
button
=
0
,
filler
=
0
;
i
<
data
->
new_caps
.
NumberFeatureValueCaps
;
++
i
)
{
if
(
!
caps
[
i
].
usage_min
&&
!
caps
[
i
].
usage_max
)
filler
++
;
else
if
(
HID_VALUE_CAPS_IS_BUTTON
(
caps
+
i
))
button
++
;
}
caps
+=
data
->
new_caps
.
NumberFeatureValueCaps
;
data
->
new_caps
.
NumberFeatureButtonCaps
=
button
;
data
->
new_caps
.
NumberFeatureValueCaps
-=
filler
+
button
;
return
data
;
return
data
;
}
}
...
...
include/wine/hid.h
View file @
51560aab
...
@@ -73,6 +73,8 @@ struct hid_value_caps
...
@@ -73,6 +73,8 @@ struct hid_value_caps
USAGE
usage_page
;
USAGE
usage_page
;
USAGE
usage_min
;
USAGE
usage_min
;
USAGE
usage_max
;
USAGE
usage_max
;
USHORT
data_index_min
;
USHORT
data_index_max
;
USHORT
string_min
;
USHORT
string_min
;
USHORT
string_max
;
USHORT
string_max
;
USHORT
designator_min
;
USHORT
designator_min
;
...
@@ -97,6 +99,8 @@ struct hid_value_caps
...
@@ -97,6 +99,8 @@ struct hid_value_caps
#define HID_VALUE_CAPS_IS_ABSOLUTE(x) (((x)->bit_field & 0x04) == 0)
#define HID_VALUE_CAPS_IS_ABSOLUTE(x) (((x)->bit_field & 0x04) == 0)
#define HID_VALUE_CAPS_HAS_NULL(x) (((x)->bit_field & 0x40) != 0)
#define HID_VALUE_CAPS_HAS_NULL(x) (((x)->bit_field & 0x40) != 0)
#define HID_VALUE_CAPS_IS_ARRAY(c) (((c)->bit_field & 2) == 0)
#define HID_VALUE_CAPS_IS_BUTTON(c) ((c)->bit_size == 1 || HID_VALUE_CAPS_IS_ARRAY(c))
typedef
struct
__WINE_HID_REPORT
typedef
struct
__WINE_HID_REPORT
{
{
...
@@ -122,12 +126,15 @@ typedef struct __WINE_HIDP_PREPARSED_DATA
...
@@ -122,12 +126,15 @@ typedef struct __WINE_HIDP_PREPARSED_DATA
DWORD
magic
;
DWORD
magic
;
DWORD
dwSize
;
DWORD
dwSize
;
HIDP_CAPS
caps
;
HIDP_CAPS
caps
;
HIDP_CAPS
new_caps
;
DWORD
elementOffset
;
DWORD
elementOffset
;
DWORD
nodesOffset
;
DWORD
nodesOffset
;
DWORD
reportCount
[
3
];
DWORD
reportCount
[
3
];
BYTE
reportIdx
[
3
][
256
];
BYTE
reportIdx
[
3
][
256
];
DWORD
value_caps_offset
;
USHORT
value_caps_count
[
3
];
WINE_HID_REPORT
reports
[
1
];
WINE_HID_REPORT
reports
[
1
];
}
WINE_HIDP_PREPARSED_DATA
,
*
PWINE_HIDP_PREPARSED_DATA
;
}
WINE_HIDP_PREPARSED_DATA
,
*
PWINE_HIDP_PREPARSED_DATA
;
...
@@ -137,4 +144,8 @@ typedef struct __WINE_HIDP_PREPARSED_DATA
...
@@ -137,4 +144,8 @@ typedef struct __WINE_HIDP_PREPARSED_DATA
#define HID_ELEMS(d) ((WINE_HID_ELEMENT*)((BYTE*)(d) + (d)->elementOffset))
#define HID_ELEMS(d) ((WINE_HID_ELEMENT*)((BYTE*)(d) + (d)->elementOffset))
#define HID_NODES(d) ((WINE_HID_LINK_COLLECTION_NODE*)((BYTE*)(d) + (d)->nodesOffset))
#define HID_NODES(d) ((WINE_HID_LINK_COLLECTION_NODE*)((BYTE*)(d) + (d)->nodesOffset))
#define HID_INPUT_VALUE_CAPS(d) ((struct hid_value_caps*)((char *)(d) + (d)->value_caps_offset))
#define HID_OUTPUT_VALUE_CAPS(d) (HID_INPUT_VALUE_CAPS(d) + (d)->value_caps_count[0])
#define HID_FEATURE_VALUE_CAPS(d) (HID_OUTPUT_VALUE_CAPS(d) + (d)->value_caps_count[1])
#endif
/* __WINE_PARSE_H */
#endif
/* __WINE_PARSE_H */
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment