mirror of
https://github.com/oopuuu/zTC1.git
synced 2025-12-15 06:28:14 +08:00
68 lines
2.3 KiB
C
68 lines
2.3 KiB
C
/**
|
|
******************************************************************************
|
|
* @file TLVUtils.c
|
|
* @author William Xu
|
|
* @version V1.0.0
|
|
* @date 05-May-2014
|
|
* @brief This file contains function that assist in TLV parsing and creation.
|
|
******************************************************************************
|
|
*
|
|
* The MIT License
|
|
* Copyright (c) 2014 MXCHIP Inc.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is furnished
|
|
* to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
|
|
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
******************************************************************************
|
|
*/
|
|
|
|
#include "TLVUtils.h"
|
|
|
|
#include "debug.h"
|
|
|
|
|
|
OSStatus TLVGetNext( const uint8_t * inSrc,
|
|
const uint8_t * inEnd,
|
|
uint8_t * outID,
|
|
const uint8_t ** outData,
|
|
size_t * outLen,
|
|
const uint8_t ** outNext )
|
|
{
|
|
const uint8_t * ptr;
|
|
size_t len;
|
|
const uint8_t * next;
|
|
|
|
//check( inSrc <= inEnd );
|
|
len = (size_t)( inEnd - inSrc );
|
|
if( len < 2 )
|
|
return( kNotFoundErr );
|
|
|
|
len = inSrc[ 1 ];
|
|
ptr = inSrc + 2;
|
|
next = ptr + len;
|
|
if( ( next < inSrc ) || ( next > inEnd ) )
|
|
return( kUnderrunErr );
|
|
|
|
*outID = inSrc[ 0 ];
|
|
*outData = ptr;
|
|
*outLen = len;
|
|
if( outNext )
|
|
*outNext = next;
|
|
|
|
return( kNoErr );
|
|
}
|
|
|