nut/drivers/hidparser.c

687 lines
21 KiB
C
Raw Normal View History

2010-03-25 23:20:59 +00:00
/*
* hidparser.c: HID Parser
*
* This file is part of the MGE UPS SYSTEMS HID Parser
*
* Copyright (C)
* 1998-2003 MGE UPS SYSTEMS, Luc Descotils
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
#include "config.h" /* must be first */
2010-03-25 23:20:59 +00:00
#include <string.h>
#include <stdlib.h>
#include "hidparser.h"
2016-07-18 00:11:41 +00:00
#include "nut_stdint.h" /* for int8_t, int16_t, int32_t */
#include "common.h" /* for fatalx() */
2010-03-25 23:20:59 +00:00
static const uint8_t ItemSize[4] = { 0, 1, 2, 4 };
/*
* HIDParser struct
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
/* FIXME? Should this structure remain with reasonable fixed int types,
* or changed to align with libusb API version and usb_ctrl_* typedefs?
*/
2010-03-25 23:20:59 +00:00
typedef struct {
const unsigned char *ReportDesc; /* Report Descriptor */
2022-06-29 10:37:36 +00:00
size_t ReportDescSize; /* Size of Report Descriptor */
2010-03-25 23:20:59 +00:00
uint16_t Pos; /* Store current pos in descriptor */
uint8_t Item; /* Store current Item */
2022-06-29 10:37:36 +00:00
uint32_t Value; /* Store current Value */
2010-03-25 23:20:59 +00:00
HIDData_t Data; /* Store current environment */
uint8_t OffsetTab[MAX_REPORT][4]; /* Store ID, Type, offset & timestamp of report */
uint8_t ReportCount; /* Store Report Count */
uint8_t Count; /* Store local report count */
uint16_t UPage; /* Global UPage */
HIDNode_t UsageTab[USAGE_TAB_SIZE]; /* Usage stack */
uint8_t UsageSize; /* Design number of usage used */
} HIDParser_t;
/* return 1 + the position of the leftmost "1" bit of an int, or 0 if
none. */
2022-06-29 10:37:36 +00:00
static inline unsigned int hibit(unsigned long x)
2010-03-25 23:20:59 +00:00
{
unsigned int res = 0;
while (x > 0xff) {
x >>= 8;
res += 8;
}
while (x) {
x >>= 1;
res += 1;
}
return res;
}
/* Note: The USB HID specification states that Local items do not
carry over to the next Main item (version 1.11, section
6.2.2.8). Therefore the local state must be reset after each main
item. In particular, any unused usages on the Usage tabs must be
discarded and must not carry over to the next Main item. Some APC
equipment actually sends multiple redundant "usage" commands for a
single control, so resetting the local state is important. */
/* Also note: UsageTab[0] is used as the usage of the next control,
even if UsageSize=0. Therefore, this must be initialized */
static void ResetLocalState(HIDParser_t* pParser)
{
pParser->UsageSize = 0;
memset(pParser->UsageTab, 0, sizeof(pParser->UsageTab));
}
/*
* GetReportOffset
*
2022-06-29 10:37:36 +00:00
* Return pointer on current offset value for Report designed by
2010-03-25 23:20:59 +00:00
* ReportID/ReportType
* -------------------------------------------------------------------------- */
static uint8_t *GetReportOffset(HIDParser_t* pParser, const uint8_t ReportID, const uint8_t ReportType)
{
int Pos;
for (Pos = 0; Pos < MAX_REPORT; Pos++) {
if (pParser->OffsetTab[Pos][0] == 0) {
pParser->OffsetTab[Pos][0] = ReportID;
pParser->OffsetTab[Pos][1] = ReportType;
pParser->OffsetTab[Pos][2] = 0;
}
if (pParser->OffsetTab[Pos][0] != ReportID) {
continue;
}
if (pParser->OffsetTab[Pos][1] != ReportType) {
continue;
}
return &pParser->OffsetTab[Pos][2];
}
return NULL;
}
/*
2022-06-29 10:37:36 +00:00
* FormatValue(uint32_t Value, uint8_t Size)
2010-03-25 23:20:59 +00:00
* Format Value to fit with long format with respect of negative values
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
static long FormatValue(uint32_t Value, uint8_t Size)
2010-03-25 23:20:59 +00:00
{
switch(Size)
{
case 1:
return (long)(int8_t)Value;
case 2:
return (long)(int16_t)Value;
case 4:
return (long)(int32_t)Value;
default:
2022-06-29 10:37:36 +00:00
return (long)Value;
2010-03-25 23:20:59 +00:00
}
}
/*
* HIDParse(HIDParser_t* pParser, HIDData_t *pData)
*
* Analyse Report descriptor stored in HIDParser struct and store local and
2022-06-29 10:37:36 +00:00
* global context.
2010-03-25 23:20:59 +00:00
* Return in pData the last object found.
* Return -1 when there is no other Item to parse, 1 if a new object was found
* or 0 if a continuation of a previous object was found.
* -------------------------------------------------------------------------- */
static int HIDParse(HIDParser_t *pParser, HIDData_t *pData)
{
2022-06-29 10:37:36 +00:00
int Found = -1, i;
2010-03-25 23:20:59 +00:00
while ((Found < 0) && (pParser->Pos < pParser->ReportDescSize)) {
/* Get new pParser->Item if current pParser->Count is empty */
if (pParser->Count == 0) {
pParser->Item = pParser->ReportDesc[pParser->Pos++];
pParser->Value = 0;
2022-06-29 10:37:36 +00:00
for (i = 0; i < ItemSize[pParser->Item & SIZE_MASK]; i++) {
pParser->Value += (uint32_t)(pParser->ReportDesc[(pParser->Pos)+i]) << (8*i);
2010-03-25 23:20:59 +00:00
}
/* Pos on next item */
2016-07-18 00:11:41 +00:00
pParser->Pos += ItemSize[pParser->Item & SIZE_MASK];
2010-03-25 23:20:59 +00:00
}
switch (pParser->Item & ITEM_MASK)
{
case ITEM_UPAGE:
/* Copy UPage in Usage stack */
pParser->UPage=(uint16_t)pParser->Value;
break;
case ITEM_USAGE:
/* Copy global or local UPage if any, in Usage stack */
if ((pParser->Item & SIZE_MASK) > 2) {
pParser->UsageTab[pParser->UsageSize] = pParser->Value;
} else {
2022-06-29 10:37:36 +00:00
pParser->UsageTab[pParser->UsageSize] = ((HIDNode_t)(pParser->UPage) << 16) | (pParser->Value & 0xFFFF);
2010-03-25 23:20:59 +00:00
}
/* Increment Usage stack size */
pParser->UsageSize++;
break;
case ITEM_COLLECTION:
/* Get UPage/Usage from UsageTab and store them in pParser->Data.Path */
pParser->Data.Path.Node[pParser->Data.Path.Size] = pParser->UsageTab[0];
pParser->Data.Path.Size++;
/* Unstack UPage/Usage from UsageTab (never remove the last) */
if (pParser->UsageSize > 0) {
2022-06-29 10:37:36 +00:00
int j;
for (j = 0; j < pParser->UsageSize; j++) {
pParser->UsageTab[j] = pParser->UsageTab[j+1];
2010-03-25 23:20:59 +00:00
}
/* Remove Usage */
pParser->UsageSize--;
}
/* Get Index if any */
if (pParser->Value >= 0x80) {
pParser->Data.Path.Node[pParser->Data.Path.Size] = 0x00ff0000 | (pParser->Value & 0x7F);
pParser->Data.Path.Size++;
}
ResetLocalState(pParser);
break;
case ITEM_END_COLLECTION :
pParser->Data.Path.Size--;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Remove Index if any */
if((pParser->Data.Path.Node[pParser->Data.Path.Size] & 0xffff0000) == 0x00ff0000) {
pParser->Data.Path.Size--;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
ResetLocalState(pParser);
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_FEATURE:
case ITEM_INPUT:
case ITEM_OUTPUT:
if (pParser->UsageTab[0] != 0x00000000) {
/* An object was found if the path does not end with 0x00000000 */
Found = 1;
} else {
/* It is a continuation of a previous object */
Found = 0;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Get new pParser->Count from global value */
if(pParser->Count == 0) {
pParser->Count = pParser->ReportCount;
}
2016-07-18 00:11:41 +00:00
2010-03-25 23:20:59 +00:00
/* Get UPage/Usage from UsageTab and store them in pParser->Data.Path */
pParser->Data.Path.Node[pParser->Data.Path.Size] = pParser->UsageTab[0];
pParser->Data.Path.Size++;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Unstack UPage/Usage from UsageTab (never remove the last) */
if(pParser->UsageSize > 0) {
2022-06-29 10:37:36 +00:00
int j;
for (j = 0; j < pParser->UsageSize; j++) {
pParser->UsageTab[j] = pParser->UsageTab[j+1];
2010-03-25 23:20:59 +00:00
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Remove Usage */
pParser->UsageSize--;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Copy data type */
pParser->Data.Type = (uint8_t)(pParser->Item & ITEM_MASK);
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Copy data attribute */
pParser->Data.Attribute = (uint8_t)pParser->Value;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Store offset */
pParser->Data.Offset = *GetReportOffset(pParser, pParser->Data.ReportID, (uint8_t)(pParser->Item & ITEM_MASK));
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Get Object in pData */
/* -------------------------------------------------------------------------- */
memcpy(pData, &pParser->Data, sizeof(HIDData_t));
/* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Increment Report Offset */
*GetReportOffset(pParser, pParser->Data.ReportID, (uint8_t)(pParser->Item & ITEM_MASK)) += pParser->Data.Size;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Remove path last node */
pParser->Data.Path.Size--;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
/* Decrement count */
pParser->Count--;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
if (pParser->Count == 0) {
ResetLocalState(pParser);
}
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_REP_ID :
pParser->Data.ReportID = (uint8_t)pParser->Value;
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_REP_SIZE :
pParser->Data.Size = (uint8_t)pParser->Value;
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_REP_COUNT :
pParser->ReportCount = (uint8_t)pParser->Value;
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_UNIT_EXP :
pParser->Data.UnitExp = (int8_t)pParser->Value;
if (pParser->Data.UnitExp > 7) {
pParser->Data.UnitExp |= 0xF0;
}
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_UNIT :
2022-06-29 10:37:36 +00:00
/* TOTHINK: Are there cases where Unit is not-signed,
* but a Value too big becomes signed after casting --
* and unintentionally so? */
pParser->Data.Unit = (long)pParser->Value;
2010-03-25 23:20:59 +00:00
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_LOG_MIN :
pParser->Data.LogMin = FormatValue(pParser->Value, ItemSize[pParser->Item & SIZE_MASK]);
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_LOG_MAX :
pParser->Data.LogMax = FormatValue(pParser->Value, ItemSize[pParser->Item & SIZE_MASK]);
2022-06-29 10:37:36 +00:00
/* HACK: If treating the value as signed (FormatValue(...)) results in a LogMax that is
* less than the LogMin value then it is likely that the LogMax value has been
* incorrectly encoded by the UPS firmware (field too short and overflowed into sign
* bit). In that case, reinterpret it as an unsigned number and log the problem.
* This hack is not correct in the sense that it only looks at the LogMin value for
* this item, whereas the HID spec says that Logical values persist in global state.
*/
if (pParser->Data.LogMax < pParser->Data.LogMin) {
upslogx(LOG_WARNING,
"%s: LogMax is less than LogMin. "
"Vendor HID report descriptor may be incorrect; "
"interpreting LogMax %ld as %u in ReportID: 0x%02x",
__func__,
pParser->Data.LogMax,
pParser->Value,
pParser->Data.ReportID);
pParser->Data.LogMax = (long) pParser->Value;
}
2010-03-25 23:20:59 +00:00
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_PHY_MIN :
pParser->Data.PhyMin=FormatValue(pParser->Value, ItemSize[pParser->Item & SIZE_MASK]);
pParser->Data.have_PhyMin = 1;
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_PHY_MAX :
pParser->Data.PhyMax=FormatValue(pParser->Value, ItemSize[pParser->Item & SIZE_MASK]);
pParser->Data.have_PhyMax = 1;
break;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
case ITEM_LONG :
/* can't handle long items, but should at least skip them */
pParser->Pos += (uint8_t)(pParser->Value & 0xff);
break;
}
} /* while ((Found < 0) && (pParser->Pos < pParser->ReportDescSize)) */
2016-07-18 00:11:41 +00:00
if(pParser->Data.Path.Size >= PATH_SIZE)
upslogx(LOG_ERR, "%s: HID path too long", __func__);
if(pParser->ReportDescSize >= REPORT_DSC_SIZE)
upslogx(LOG_ERR, "%s: Report descriptor too big", __func__);
if(pParser->UsageSize >= USAGE_TAB_SIZE)
upslogx(LOG_ERR, "%s: HID Usage too high", __func__);
2022-06-29 10:37:36 +00:00
/* FIXME: comparison is always false due to limited range of data type [-Werror=type-limits]
* with ReportID beint uint8_t and MAX_REPORT being 500 currently */
/*
2016-07-18 00:11:41 +00:00
if(pParser->Data.ReportID >= MAX_REPORT)
upslogx(LOG_ERR, "%s: Too many HID reports", __func__);
2022-06-29 10:37:36 +00:00
*/
2010-03-25 23:20:59 +00:00
return Found;
}
/*
* FindObject
* Get pData characteristics from pData->Path
* Return TRUE if object was found
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
int FindObject(HIDDesc_t *pDesc_arg, HIDData_t *pData)
2010-03-25 23:20:59 +00:00
{
2022-06-29 10:37:36 +00:00
HIDData_t *pFoundData = FindObject_with_Path(pDesc_arg, &pData->Path, pData->Type);
2010-03-25 23:20:59 +00:00
if (!pFoundData) {
return 0;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
memcpy(pData, pFoundData, sizeof(*pData));
return 1;
}
/*
* FindObject_with_Path
* Get pData item with given Path and Type. Return NULL if not found.
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
HIDData_t *FindObject_with_Path(HIDDesc_t *pDesc_arg, HIDPath_t *Path, uint8_t Type)
2010-03-25 23:20:59 +00:00
{
2022-06-29 10:37:36 +00:00
size_t i;
for (i = 0; i < pDesc_arg->nitems; i++) {
HIDData_t *pData = &pDesc_arg->item[i];
2010-03-25 23:20:59 +00:00
if (pData->Type != Type) {
continue;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
if (memcmp(pData->Path.Node, Path->Node, (Path->Size) * sizeof(HIDNode_t))) {
continue;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
return pData;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
return NULL;
}
/*
* FindObject_with_ID
* Get pData item with given ReportID, Offset, and Type. Return NULL
* if not found.
* -------------------------------------------------------------------------- */
2022-06-29 10:37:36 +00:00
HIDData_t *FindObject_with_ID(HIDDesc_t *pDesc_arg, uint8_t ReportID, uint8_t Offset, uint8_t Type)
2010-03-25 23:20:59 +00:00
{
2022-06-29 10:37:36 +00:00
size_t i;
for (i = 0; i < pDesc_arg->nitems; i++) {
HIDData_t *pData = &pDesc_arg->item[i];
2010-03-25 23:20:59 +00:00
if (pData->ReportID != ReportID) {
continue;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
if (pData->Type != Type) {
continue;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
if (pData->Offset != Offset) {
continue;
}
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
return pData;
}
2022-06-29 10:37:36 +00:00
return NULL;
}
/*
* FindObject_with_ID_Node
* Get pData item with given ReportID and Node. Return NULL if not found.
* -------------------------------------------------------------------------- */
HIDData_t *FindObject_with_ID_Node(HIDDesc_t *pDesc_arg, uint8_t ReportID, HIDNode_t Node)
{
size_t i;
for (i = 0; i < pDesc_arg->nitems; i++) {
HIDData_t *pData = &pDesc_arg->item[i];
if (pData->ReportID != ReportID) {
continue;
}
HIDPath_t * pPath = &pData->Path;
uint8_t size = pPath->Size;
if (size == 0 || pPath->Node[size-1] != Node) {
continue;
}
return pData;
}
2010-03-25 23:20:59 +00:00
return NULL;
}
/*
* GetValue
* Extract data from a report stored in Buf.
2022-06-29 10:37:36 +00:00
* Use Offset, Size, LogMin, and LogMax of pData.
* Return response in *pValue.
2010-03-25 23:20:59 +00:00
* -------------------------------------------------------------------------- */
void GetValue(const unsigned char *Buf, HIDData_t *pData, long *pValue)
{
2022-06-29 10:37:36 +00:00
/* Note: https://github.com/networkupstools/nut/issues/1023
This conversion code can easily be sensitive to 32- vs 64- bit
compilation environments. Consider the possibility of overflow
in 32-bit representations when computing with extreme values,
for example LogMax-LogMin+1.
Test carefully in both environments if changing any declarations.
*/
2010-03-25 23:20:59 +00:00
int Weight, Bit;
2022-06-29 10:37:36 +00:00
unsigned long mask, signbit, magMax, magMin;
long value = 0;
2010-03-25 23:20:59 +00:00
Bit = pData->Offset + 8; /* First byte of report is report ID */
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
for (Weight = 0; Weight < pData->Size; Weight++, Bit++) {
int State = Buf[Bit >> 3] & (1 << (Bit & 7));
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
if(State) {
2022-06-29 10:37:36 +00:00
value += (1L << Weight);
2010-03-25 23:20:59 +00:00
}
}
/* translate Value into a signed/unsigned value in the range
LogMin..LogMax, as appropriate. See HID spec, p.38: "If both the
Logical Minimum and Logical Maximum extents are defined as
positive values (0 or greater), then the report field can be
assumed to be an unsigned value. Otherwise, all integer values
are signed values represented in 2's complement format."
Also note that the variable can take values from LogMin
(inclusive) to LogMax (inclusive), so there are LogMax - LogMin +
1 possible values.
Special cases arise if the value that has been read lies outside
the interval LogMin..LogMax. Some devices, notably the APC
Back-UPS BF500, do this. In one case I observed, LogMin=0,
LogMax=0xffff, Size=32, and the supplied value is
0xffffffff80080a00. Presumably they expect us to throw away the
higher-order bits, and use 0x0a00, rather than choosing the
closest value in the interval, which would be 0xffff. However,
if LogMax - LogMin + 1 isn't a power of 2, it is not clear what
"throwing away higher-order bits" exacly means, so we try to do
something sensible. -PS */
2022-06-29 10:37:36 +00:00
/* determine representation without sign bit */
magMax = pData->LogMax >= 0 ? (unsigned long)(pData->LogMax) : (unsigned long)(-(pData->LogMax + 1));
magMin = pData->LogMin >= 0 ? (unsigned long)(pData->LogMin) : (unsigned long)(-(pData->LogMin + 1));
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
/* calculate where the sign bit will be if needed */
signbit = 1L << hibit(magMax > magMin ? magMax : magMin);
/* but only include sign bit in mask if negative numbers are involved */
mask = (signbit - 1) | ((pData->LogMin < 0) ? signbit : 0);
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
/* throw away excess high order bits (which may contain garbage) */
value = (long)((unsigned long)(value) & mask);
2010-03-25 23:20:59 +00:00
/* sign-extend it, if appropriate */
2022-06-29 10:37:36 +00:00
if (pData->LogMin < 0 && ((unsigned long)(value) & signbit) != 0) {
2010-03-25 23:20:59 +00:00
value |= ~mask;
}
2022-06-29 10:37:36 +00:00
/* clamp returned value to range [LogMin..LogMax] */
2010-03-25 23:20:59 +00:00
if (value < pData->LogMin) {
value = pData->LogMin;
} else if (value > pData->LogMax) {
value = pData->LogMax;
}
*pValue = value;
return;
}
/*
* SetValue
* Set a data in a report stored in Buf. Use Value, Offset and Size of pData.
* Return response in Buf.
* -------------------------------------------------------------------------- */
void SetValue(const HIDData_t *pData, unsigned char *Buf, long Value)
{
int Weight, Bit;
2022-06-29 10:37:36 +00:00
2010-03-25 23:20:59 +00:00
Bit = pData->Offset + 8; /* First byte of report is report ID */
for (Weight = 0; Weight < pData->Size; Weight++, Bit++) {
2022-06-29 10:37:36 +00:00
long State = Value & (1L << Weight);
2010-03-25 23:20:59 +00:00
if (State) {
Buf[Bit >> 3] |= (1 << (Bit & 7));
} else {
Buf[Bit >> 3] &= ~(1 << (Bit & 7));
}
}
}
/* ---------------------------------------------------------------------- */
/* parse HID Report Descriptor. Input: byte array ReportDesc[n].
Output: parsed data structure. Returns allocated HIDDesc structure
on success, NULL on failure with errno set. Note: the value
returned by this function must be freed with Free_ReportDesc(). */
2022-06-29 10:37:36 +00:00
HIDDesc_t *Parse_ReportDesc(const usb_ctrl_charbuf ReportDesc, const usb_ctrl_charbufsize n)
2010-03-25 23:20:59 +00:00
{
2022-06-29 10:37:36 +00:00
int ret = 0;
HIDDesc_t *pDesc_var;
2010-03-25 23:20:59 +00:00
HIDParser_t *parser;
2022-06-29 10:37:36 +00:00
pDesc_var = calloc(1, sizeof(*pDesc_var));
#if (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_PUSH_POP) && ( (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TYPE_LIMITS) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_CONSTANT_OUT_OF_RANGE_COMPARE) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_UNSIGNED_ZERO_COMPARE) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_UNREACHABLE_CODE) )
# pragma GCC diagnostic push
#endif
#ifdef HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TYPE_LIMITS
# pragma GCC diagnostic ignored "-Wtype-limits"
#endif
#ifdef HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_CONSTANT_OUT_OF_RANGE_COMPARE
# pragma GCC diagnostic ignored "-Wtautological-constant-out-of-range-compare"
#endif
#ifdef HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_UNSIGNED_ZERO_COMPARE
# pragma GCC diagnostic ignored "-Wtautological-unsigned-zero-compare"
#endif
#ifdef HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_UNREACHABLE_CODE
#pragma GCC diagnostic ignored "-Wunreachable-code"
#endif
/* Older CLANG (e.g. clang-3.4) seems to not support the GCC pragmas above */
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wunreachable-code"
#pragma clang diagnostic ignored "-Wtautological-compare"
#pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
#endif
if (!pDesc_var
|| n < 0 || (uintmax_t)n > SIZE_MAX
) {
2010-03-25 23:20:59 +00:00
return NULL;
}
2022-06-29 10:37:36 +00:00
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#if (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_PUSH_POP) && ( (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TYPE_LIMITS) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_CONSTANT_OUT_OF_RANGE_COMPARE) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_TAUTOLOGICAL_UNSIGNED_ZERO_COMPARE) || (defined HAVE_PRAGMA_GCC_DIAGNOSTIC_IGNORED_UNREACHABLE_CODE) )
# pragma GCC diagnostic pop
#endif
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
pDesc_var->item = calloc(MAX_REPORT, sizeof(*pDesc_var->item));
if (!pDesc_var->item) {
Free_ReportDesc(pDesc_var);
2010-03-25 23:20:59 +00:00
return NULL;
}
parser = calloc(1, sizeof(*parser));
if (!parser) {
2022-06-29 10:37:36 +00:00
Free_ReportDesc(pDesc_var);
2010-03-25 23:20:59 +00:00
return NULL;
}
2022-06-29 10:37:36 +00:00
parser->ReportDesc = (const unsigned char *)ReportDesc;
parser->ReportDescSize = (const size_t)n;
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
for (pDesc_var->nitems = 0; pDesc_var->nitems < MAX_REPORT; pDesc_var->nitems += (size_t)ret) {
uint8_t id;
size_t max;
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
ret = HIDParse(parser, &pDesc_var->item[pDesc_var->nitems]);
2010-03-25 23:20:59 +00:00
if (ret < 0) {
break;
}
2022-06-29 10:37:36 +00:00
id = pDesc_var->item[pDesc_var->nitems].ReportID;
2010-03-25 23:20:59 +00:00
/* calculate bit range of this item within report */
2022-06-29 10:37:36 +00:00
max = pDesc_var->item[pDesc_var->nitems].Offset + pDesc_var->item[pDesc_var->nitems].Size;
2010-03-25 23:20:59 +00:00
/* convert to bytes */
max = (max + 7) >> 3;
/* update report length */
2022-06-29 10:37:36 +00:00
if (max > pDesc_var->replen[id]) {
pDesc_var->replen[id] = max;
2010-03-25 23:20:59 +00:00
}
}
2016-07-18 00:11:41 +00:00
/* Sanity check: are there remaining HID objects that can't
* be processed? */
2022-06-29 10:37:36 +00:00
if ((pDesc_var->nitems == MAX_REPORT) && (parser->Pos < parser->ReportDescSize))
2016-07-18 00:11:41 +00:00
upslogx(LOG_ERR, "ERROR in %s: Too many HID objects", __func__);
2010-03-25 23:20:59 +00:00
free(parser);
2022-06-29 10:37:36 +00:00
if (pDesc_var->nitems == 0) {
Free_ReportDesc(pDesc_var);
2010-03-25 23:20:59 +00:00
return NULL;
}
2022-06-29 10:37:36 +00:00
pDesc_var->item = realloc(pDesc_var->item, pDesc_var->nitems * sizeof(*pDesc_var->item));
2010-03-25 23:20:59 +00:00
2022-06-29 10:37:36 +00:00
return pDesc_var;
2010-03-25 23:20:59 +00:00
}
/* free a parsed report descriptor, as allocated by Parse_ReportDesc() */
2022-06-29 10:37:36 +00:00
void Free_ReportDesc(HIDDesc_t *pDesc_arg)
2010-03-25 23:20:59 +00:00
{
2022-06-29 10:37:36 +00:00
if (!pDesc_arg) {
2010-03-25 23:20:59 +00:00
return;
}
2022-06-29 10:37:36 +00:00
free(pDesc_arg->item);
free(pDesc_arg);
2010-03-25 23:20:59 +00:00
}