blob: 3c11a641d64965a36a020785d61bddc8a8aa1207 [file] [log] [blame]
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001/*==============================================================================
Laurence Lundbladed92a6162018-11-01 11:38:35 +07002 Copyright (c) 2016-2018, The Linux Foundation.
Laurence Lundbladeee851742020-01-08 08:37:05 -08003 Copyright (c) 2018-2020, Laurence Lundblade.
Laurence Lundbladed92a6162018-11-01 11:38:35 +07004 All rights reserved.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08005
Laurence Lundblade0dbc9172018-11-01 14:17:21 +07006Redistribution and use in source and binary forms, with or without
7modification, are permitted provided that the following conditions are
8met:
9 * Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
11 * Redistributions in binary form must reproduce the above
12 copyright notice, this list of conditions and the following
13 disclaimer in the documentation and/or other materials provided
14 with the distribution.
15 * Neither the name of The Linux Foundation nor the names of its
16 contributors, nor the name "Laurence Lundblade" may be used to
17 endorse or promote products derived from this software without
18 specific prior written permission.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080019
Laurence Lundblade0dbc9172018-11-01 14:17:21 +070020THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
21WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
22MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
23ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
24BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
27BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
28WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
29OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
30IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Laurence Lundbladeee851742020-01-08 08:37:05 -080031 =============================================================================*/
Laurence Lundblade624405d2018-09-18 20:10:47 -070032
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080033
Laurence Lundblade844bb5c2020-03-01 17:27:25 -080034#include "qcbor/qcbor_decode.h"
Laurence Lundblade12d32c52018-09-19 11:25:27 -070035#include "ieee754.h"
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070036
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070037
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +053038/*
39 This casts away the const-ness of a pointer, usually so it can be
40 freed or realloced.
41 */
42#define UNCONST_POINTER(ptr) ((void *)(ptr))
43
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070044
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070045
Laurence Lundbladeee851742020-01-08 08:37:05 -080046/*===========================================================================
47 DecodeNesting -- Functions for tracking array/map nesting when decoding
48
Laurence Lundblade844bb5c2020-03-01 17:27:25 -080049 See qcbor/qcbor_decode.h for definition of the object
50 used here: QCBORDecodeNesting
Laurence Lundbladeee851742020-01-08 08:37:05 -080051 ===========================================================================*/
52
53inline static int
54IsMapOrArray(uint8_t uDataType)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070055{
56 return uDataType == QCBOR_TYPE_MAP || uDataType == QCBOR_TYPE_ARRAY;
57}
58
Laurence Lundbladeee851742020-01-08 08:37:05 -080059inline static int
60DecodeNesting_IsNested(const QCBORDecodeNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070061{
62 return pNesting->pCurrent != &(pNesting->pMapsAndArrays[0]);
63}
64
Laurence Lundbladeee851742020-01-08 08:37:05 -080065inline static int
66DecodeNesting_IsIndefiniteLength(const QCBORDecodeNesting *pNesting)
Laurence Lundblade0f99d692018-09-26 14:39:28 -070067{
Laurence Lundblade0f99d692018-09-26 14:39:28 -070068 return pNesting->pCurrent->uCount == UINT16_MAX;
69}
70
Laurence Lundbladeee851742020-01-08 08:37:05 -080071inline static uint8_t
72DecodeNesting_GetLevel(QCBORDecodeNesting *pNesting)
Laurence Lundblade3a760b02018-10-08 13:46:03 +080073{
Laurence Lundbladec5fef682020-01-25 11:38:45 -080074 // Check in DecodeNesting_Descend and never having
75 // QCBOR_MAX_ARRAY_NESTING > 255 gaurantee cast is safe
76 return (uint8_t)(pNesting->pCurrent - &(pNesting->pMapsAndArrays[0]));
Laurence Lundblade3a760b02018-10-08 13:46:03 +080077}
78
Laurence Lundbladeee851742020-01-08 08:37:05 -080079inline static int
80DecodeNesting_TypeIsMap(const QCBORDecodeNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070081{
Laurence Lundblade0f99d692018-09-26 14:39:28 -070082 if(!DecodeNesting_IsNested(pNesting)) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070083 return 0;
Laurence Lundblade0f99d692018-09-26 14:39:28 -070084 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080085
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070086 return CBOR_MAJOR_TYPE_MAP == pNesting->pCurrent->uMajorType;
87}
88
Laurence Lundblade3a760b02018-10-08 13:46:03 +080089// Process a break. This will either ascend the nesting or error out
Laurence Lundbladeee851742020-01-08 08:37:05 -080090inline static QCBORError
91DecodeNesting_BreakAscend(QCBORDecodeNesting *pNesting)
Laurence Lundblade041ffa52018-10-07 11:43:51 +070092{
Laurence Lundblade3a760b02018-10-08 13:46:03 +080093 // breaks must always occur when there is nesting
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070094 if(!DecodeNesting_IsNested(pNesting)) {
Laurence Lundblade3a760b02018-10-08 13:46:03 +080095 return QCBOR_ERR_BAD_BREAK;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070096 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080097
Laurence Lundblade3a760b02018-10-08 13:46:03 +080098 // breaks can only occur when the map/array is indefinite length
99 if(!DecodeNesting_IsIndefiniteLength(pNesting)) {
100 return QCBOR_ERR_BAD_BREAK;
101 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800102
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800103 // if all OK, the break reduces the level of nesting
104 pNesting->pCurrent--;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800105
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800106 return QCBOR_SUCCESS;
107}
108
Laurence Lundbladeee851742020-01-08 08:37:05 -0800109// Called on every single item except breaks including open of a map/array
110inline static void
111DecodeNesting_DecrementCount(QCBORDecodeNesting *pNesting)
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800112{
Laurence Lundblade9916b1b2019-09-07 22:33:25 -0700113 while(DecodeNesting_IsNested(pNesting)) {
114 // Not at the top level, so there is decrementing to be done.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800115
Laurence Lundblade9e3651c2018-10-10 11:49:55 +0800116 if(!DecodeNesting_IsIndefiniteLength(pNesting)) {
Laurence Lundblade9916b1b2019-09-07 22:33:25 -0700117 // Decrement the current nesting level if it is not indefinite.
Laurence Lundblade9e3651c2018-10-10 11:49:55 +0800118 pNesting->pCurrent->uCount--;
119 }
Laurence Lundblade9916b1b2019-09-07 22:33:25 -0700120
121 if(pNesting->pCurrent->uCount != 0) {
122 // Did not close out an array or map, so nothing further
123 break;
124 }
125
126 // Closed out an array or map so level up
127 pNesting->pCurrent--;
128
129 // Continue with loop to see if closing out this doesn't close out more
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700130 }
131}
132
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800133// Called on every map/array
Laurence Lundbladeee851742020-01-08 08:37:05 -0800134inline static QCBORError
135DecodeNesting_Descend(QCBORDecodeNesting *pNesting, QCBORItem *pItem)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700136{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700137 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800138
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800139 if(pItem->val.uCount == 0) {
140 // Nothing to do for empty definite lenth arrays. They are just are
141 // effectively the same as an item that is not a map or array
142 goto Done;
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530143 // Empty indefinite length maps and arrays are handled elsewhere
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800144 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800145
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800146 // Error out if arrays is too long to handle
147 if(pItem->val.uCount != UINT16_MAX && pItem->val.uCount > QCBOR_MAX_ITEMS_IN_ARRAY) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700148 nReturn = QCBOR_ERR_ARRAY_TOO_LONG;
149 goto Done;
150 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800151
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800152 // Error out if nesting is too deep
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700153 if(pNesting->pCurrent >= &(pNesting->pMapsAndArrays[QCBOR_MAX_ARRAY_NESTING])) {
154 nReturn = QCBOR_ERR_ARRAY_NESTING_TOO_DEEP;
155 goto Done;
156 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800157
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800158 // The actual descend
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700159 pNesting->pCurrent++;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800160
Laurence Lundblade3a760b02018-10-08 13:46:03 +0800161 // Record a few details for this nesting level
162 pNesting->pCurrent->uMajorType = pItem->uDataType;
163 pNesting->pCurrent->uCount = pItem->val.uCount;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800164
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700165Done:
166 return nReturn;;
167}
168
Laurence Lundbladeee851742020-01-08 08:37:05 -0800169inline static void
170DecodeNesting_Init(QCBORDecodeNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700171{
172 pNesting->pCurrent = &(pNesting->pMapsAndArrays[0]);
173}
174
175
176
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700177/*
178 This list of built-in tags. Only add tags here that are
179 clearly established and useful. Once a tag is added here
180 it can't be taken out as that would break backwards compatibility.
181 There are only 48 slots available forever.
182 */
183static const uint16_t spBuiltInTagMap[] = {
Laurence Lundblade59289e52019-12-30 13:44:37 -0800184 CBOR_TAG_DATE_STRING, // See TAG_MAPPER_FIRST_SIX
185 CBOR_TAG_DATE_EPOCH, // See TAG_MAPPER_FIRST_SIX
186 CBOR_TAG_POS_BIGNUM, // See TAG_MAPPER_FIRST_SIX
187 CBOR_TAG_NEG_BIGNUM, // See TAG_MAPPER_FIRST_SIX
188 CBOR_TAG_DECIMAL_FRACTION, // See TAG_MAPPER_FIRST_SIX
189 CBOR_TAG_BIGFLOAT, // See TAG_MAPPER_FIRST_SIX
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700190 CBOR_TAG_COSE_ENCRYPTO,
191 CBOR_TAG_COSE_MAC0,
192 CBOR_TAG_COSE_SIGN1,
193 CBOR_TAG_ENC_AS_B64URL,
194 CBOR_TAG_ENC_AS_B64,
195 CBOR_TAG_ENC_AS_B16,
196 CBOR_TAG_CBOR,
197 CBOR_TAG_URI,
198 CBOR_TAG_B64URL,
199 CBOR_TAG_B64,
200 CBOR_TAG_REGEX,
201 CBOR_TAG_MIME,
202 CBOR_TAG_BIN_UUID,
203 CBOR_TAG_CWT,
204 CBOR_TAG_ENCRYPT,
205 CBOR_TAG_MAC,
206 CBOR_TAG_SIGN,
207 CBOR_TAG_GEO_COORD,
208 CBOR_TAG_CBOR_MAGIC
209};
210
211// This is used in a bit of cleverness in GetNext_TaggedItem() to
212// keep code size down and switch for the internal processing of
Laurence Lundblade59289e52019-12-30 13:44:37 -0800213// these types. This will break if the first six items in
214// spBuiltInTagMap don't have values 0,1,2,3,4,5. That is the
215// mapping is 0 to 0, 1 to 1, 2 to 2 and 3 to 3....
216#define QCBOR_TAGFLAG_DATE_STRING (0x01LL << CBOR_TAG_DATE_STRING)
217#define QCBOR_TAGFLAG_DATE_EPOCH (0x01LL << CBOR_TAG_DATE_EPOCH)
218#define QCBOR_TAGFLAG_POS_BIGNUM (0x01LL << CBOR_TAG_POS_BIGNUM)
219#define QCBOR_TAGFLAG_NEG_BIGNUM (0x01LL << CBOR_TAG_NEG_BIGNUM)
220#define QCBOR_TAGFLAG_DECIMAL_FRACTION (0x01LL << CBOR_TAG_DECIMAL_FRACTION)
221#define QCBOR_TAGFLAG_BIGFLOAT (0x01LL << CBOR_TAG_BIGFLOAT)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700222
Laurence Lundblade59289e52019-12-30 13:44:37 -0800223#define TAG_MAPPER_FIRST_SIX (QCBOR_TAGFLAG_DATE_STRING |\
224 QCBOR_TAGFLAG_DATE_EPOCH |\
225 QCBOR_TAGFLAG_POS_BIGNUM |\
226 QCBOR_TAGFLAG_NEG_BIGNUM |\
227 QCBOR_TAGFLAG_DECIMAL_FRACTION |\
228 QCBOR_TAGFLAG_BIGFLOAT)
229
230#define TAG_MAPPER_FIRST_FOUR (QCBOR_TAGFLAG_DATE_STRING |\
231 QCBOR_TAGFLAG_DATE_EPOCH |\
232 QCBOR_TAGFLAG_POS_BIGNUM |\
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700233 QCBOR_TAGFLAG_NEG_BIGNUM)
234
235#define TAG_MAPPER_TOTAL_TAG_BITS 64 // Number of bits in a uint64_t
236#define TAG_MAPPER_CUSTOM_TAGS_BASE_INDEX (TAG_MAPPER_TOTAL_TAG_BITS - QCBOR_MAX_CUSTOM_TAGS) // 48
237#define TAG_MAPPER_MAX_SIZE_BUILT_IN_TAGS (TAG_MAPPER_TOTAL_TAG_BITS - QCBOR_MAX_CUSTOM_TAGS ) // 48
238
239static inline int TagMapper_LookupBuiltIn(uint64_t uTag)
240{
241 if(sizeof(spBuiltInTagMap)/sizeof(uint16_t) > TAG_MAPPER_MAX_SIZE_BUILT_IN_TAGS) {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800242 /*
243 This is a cross-check to make sure the above array doesn't
244 accidentally get made too big. In normal conditions the above
245 test should optimize out as all the values are known at compile
246 time.
247 */
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700248 return -1;
249 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800250
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700251 if(uTag > UINT16_MAX) {
252 // This tag map works only on 16-bit tags
253 return -1;
254 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800255
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700256 for(int nTagBitIndex = 0; nTagBitIndex < (int)(sizeof(spBuiltInTagMap)/sizeof(uint16_t)); nTagBitIndex++) {
257 if(spBuiltInTagMap[nTagBitIndex] == uTag) {
258 return nTagBitIndex;
259 }
260 }
261 return -1; // Indicates no match
262}
263
264static inline int TagMapper_LookupCallerConfigured(const QCBORTagListIn *pCallerConfiguredTagMap, uint64_t uTag)
265{
266 for(int nTagBitIndex = 0; nTagBitIndex < pCallerConfiguredTagMap->uNumTags; nTagBitIndex++) {
267 if(pCallerConfiguredTagMap->puTags[nTagBitIndex] == uTag) {
268 return nTagBitIndex + TAG_MAPPER_CUSTOM_TAGS_BASE_INDEX;
269 }
270 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800271
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700272 return -1; // Indicates no match
273}
274
275/*
276 Find the tag bit index for a given tag value, or error out
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800277
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700278 This and the above functions could probably be optimized and made
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800279 clearer and neater.
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700280 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800281static QCBORError
282TagMapper_Lookup(const QCBORTagListIn *pCallerConfiguredTagMap,
283 uint64_t uTag,
284 uint8_t *puTagBitIndex)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700285{
286 int nTagBitIndex = TagMapper_LookupBuiltIn(uTag);
287 if(nTagBitIndex >= 0) {
288 // Cast is safe because TagMapper_LookupBuiltIn never returns > 47
289 *puTagBitIndex = (uint8_t)nTagBitIndex;
290 return QCBOR_SUCCESS;
291 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800292
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700293 if(pCallerConfiguredTagMap) {
294 if(pCallerConfiguredTagMap->uNumTags > QCBOR_MAX_CUSTOM_TAGS) {
295 return QCBOR_ERR_TOO_MANY_TAGS;
296 }
297 nTagBitIndex = TagMapper_LookupCallerConfigured(pCallerConfiguredTagMap, uTag);
298 if(nTagBitIndex >= 0) {
299 // Cast is safe because TagMapper_LookupBuiltIn never returns > 63
300
301 *puTagBitIndex = (uint8_t)nTagBitIndex;
302 return QCBOR_SUCCESS;
303 }
304 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800305
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700306 return QCBOR_ERR_BAD_OPT_TAG;
307}
308
309
310
Laurence Lundbladeee851742020-01-08 08:37:05 -0800311/*===========================================================================
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800312 QCBORStringAllocate -- STRING ALLOCATOR INVOCATION
313
314 The following four functions are pretty wrappers for invocation of
315 the string allocator supplied by the caller.
316
Laurence Lundbladeee851742020-01-08 08:37:05 -0800317 ===========================================================================*/
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800318
Laurence Lundbladeee851742020-01-08 08:37:05 -0800319static inline void
320StringAllocator_Free(const QCORInternalAllocator *pMe, void *pMem)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800321{
322 (pMe->pfAllocator)(pMe->pAllocateCxt, pMem, 0);
323}
324
Laurence Lundbladeee851742020-01-08 08:37:05 -0800325// StringAllocator_Reallocate called with pMem NULL is
326// equal to StringAllocator_Allocate()
327static inline UsefulBuf
328StringAllocator_Reallocate(const QCORInternalAllocator *pMe,
329 void *pMem,
330 size_t uSize)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800331{
332 return (pMe->pfAllocator)(pMe->pAllocateCxt, pMem, uSize);
333}
334
Laurence Lundbladeee851742020-01-08 08:37:05 -0800335static inline UsefulBuf
336StringAllocator_Allocate(const QCORInternalAllocator *pMe, size_t uSize)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800337{
338 return (pMe->pfAllocator)(pMe->pAllocateCxt, NULL, uSize);
339}
340
Laurence Lundbladeee851742020-01-08 08:37:05 -0800341static inline void
342StringAllocator_Destruct(const QCORInternalAllocator *pMe)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800343{
344 if(pMe->pfAllocator) {
345 (pMe->pfAllocator)(pMe->pAllocateCxt, NULL, 0);
346 }
347}
348
349
350
Laurence Lundbladeee851742020-01-08 08:37:05 -0800351/*===========================================================================
352 QCBORDecode -- The main implementation of CBOR decoding
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700353
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800354 See qcbor/qcbor_decode.h for definition of the object
355 used here: QCBORDecodeContext
Laurence Lundbladeee851742020-01-08 08:37:05 -0800356 ===========================================================================*/
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700357/*
358 Public function, see header file
359 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800360void QCBORDecode_Init(QCBORDecodeContext *me,
361 UsefulBufC EncodedCBOR,
362 QCBORDecodeMode nDecodeMode)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700363{
364 memset(me, 0, sizeof(QCBORDecodeContext));
365 UsefulInputBuf_Init(&(me->InBuf), EncodedCBOR);
Laurence Lundbladeee851742020-01-08 08:37:05 -0800366 // Don't bother with error check on decode mode. If a bad value is
367 // passed it will just act as if the default normal mode of 0 was set.
Laurence Lundblade29497c02020-07-11 15:44:03 -0700368 me->uDecodeMode = (uint8_t)nDecodeMode;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700369 DecodeNesting_Init(&(me->nesting));
370}
371
372
373/*
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700374 Public function, see header file
375 */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800376void QCBORDecode_SetUpAllocator(QCBORDecodeContext *pMe,
377 QCBORStringAllocate pfAllocateFunction,
378 void *pAllocateContext,
379 bool bAllStrings)
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700380{
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800381 pMe->StringAllocator.pfAllocator = pfAllocateFunction;
382 pMe->StringAllocator.pAllocateCxt = pAllocateContext;
383 pMe->bStringAllocateAll = bAllStrings;
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700384}
385
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800386
387/*
388 Public function, see header file
389 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800390void QCBORDecode_SetCallerConfiguredTagList(QCBORDecodeContext *me,
391 const QCBORTagListIn *pTagList)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700392{
393 me->pCallerConfiguredTagList = pTagList;
394}
395
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700396
397/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800398 This decodes the fundamental part of a CBOR data item, the type and
399 number
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800400
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700401 This is the Counterpart to InsertEncodedTypeAndNumber().
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800402
Laurence Lundbladeee851742020-01-08 08:37:05 -0800403 This does the network->host byte order conversion. The conversion
404 here also results in the conversion for floats in addition to that
405 for lengths, tags and integer values.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800406
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700407 This returns:
408 pnMajorType -- the major type for the item
Laurence Lundbladeee851742020-01-08 08:37:05 -0800409
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800410 puArgument -- the "number" which is used a the value for integers,
Laurence Lundbladeee851742020-01-08 08:37:05 -0800411 tags and floats and length for strings and arrays
412
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800413 pnAdditionalInfo -- Pass this along to know what kind of float or
Laurence Lundbladeee851742020-01-08 08:37:05 -0800414 if length is indefinite
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800415
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800416 The int type is preferred to uint8_t for some variables as this
417 avoids integer promotions, can reduce code size and makes
418 static analyzers happier.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700419 */
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800420inline static QCBORError DecodeTypeAndNumber(UsefulInputBuf *pUInBuf,
421 int *pnMajorType,
422 uint64_t *puArgument,
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800423 int *pnAdditionalInfo)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700424{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700425 QCBORError nReturn;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800426
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700427 // Get the initial byte that every CBOR data item has
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800428 const int nInitialByte = (int)UsefulInputBuf_GetByte(pUInBuf);
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800429
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700430 // Break down the initial byte
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800431 const int nTmpMajorType = nInitialByte >> 5;
432 const int nAdditionalInfo = nInitialByte & 0x1f;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800433
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800434 // Where the number or argument accumulates
435 uint64_t uArgument;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800436
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800437 if(nAdditionalInfo >= LEN_IS_ONE_BYTE && nAdditionalInfo <= LEN_IS_EIGHT_BYTES) {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800438 // Need to get 1,2,4 or 8 additional argument bytes Map
439 // LEN_IS_ONE_BYTE.. LEN_IS_EIGHT_BYTES to actual length
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800440 static const uint8_t aIterate[] = {1,2,4,8};
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800441
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800442 // Loop getting all the bytes in the argument
443 uArgument = 0;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800444 for(int i = aIterate[nAdditionalInfo - LEN_IS_ONE_BYTE]; i; i--) {
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800445 // This shift and add gives the endian conversion
446 uArgument = (uArgument << 8) + UsefulInputBuf_GetByte(pUInBuf);
447 }
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800448 } else if(nAdditionalInfo >= ADDINFO_RESERVED1 && nAdditionalInfo <= ADDINFO_RESERVED3) {
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800449 // The reserved and thus-far unused additional info values
450 nReturn = QCBOR_ERR_UNSUPPORTED;
451 goto Done;
452 } else {
453 // Less than 24, additional info is argument or 31, an indefinite length
454 // No more bytes to get
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800455 uArgument = (uint64_t)nAdditionalInfo;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700456 }
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800457
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700458 if(UsefulInputBuf_GetError(pUInBuf)) {
459 nReturn = QCBOR_ERR_HIT_END;
460 goto Done;
461 }
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800462
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700463 // All successful if we got here.
464 nReturn = QCBOR_SUCCESS;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800465 *pnMajorType = nTmpMajorType;
Laurence Lundblade4c0cf842019-01-12 03:25:44 -0800466 *puArgument = uArgument;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800467 *pnAdditionalInfo = nAdditionalInfo;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800468
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700469Done:
470 return nReturn;
471}
472
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800473
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700474/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800475 CBOR doesn't explicitly specify two's compliment for integers but all
476 CPUs use it these days and the test vectors in the RFC are so. All
477 integers in the CBOR structure are positive and the major type
478 indicates positive or negative. CBOR can express positive integers
479 up to 2^x - 1 where x is the number of bits and negative integers
480 down to 2^x. Note that negative numbers can be one more away from
481 zero than positive. Stdint, as far as I can tell, uses two's
482 compliment to represent negative integers.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800483
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700484 See http://www.unix.org/whitepapers/64bit.html for reasons int isn't
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800485 used carefully here, and in particular why it isn't used in the interface.
486 Also see
487 https://stackoverflow.com/questions/17489857/why-is-int-typically-32-bit-on-64-bit-compilers
488
489 Int is used for values that need less than 16-bits and would be subject
490 to integer promotion and complaining by static analyzers.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700491 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800492inline static QCBORError
493DecodeInteger(int nMajorType, uint64_t uNumber, QCBORItem *pDecodedItem)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700494{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700495 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800496
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700497 if(nMajorType == CBOR_MAJOR_TYPE_POSITIVE_INT) {
498 if (uNumber <= INT64_MAX) {
499 pDecodedItem->val.int64 = (int64_t)uNumber;
500 pDecodedItem->uDataType = QCBOR_TYPE_INT64;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800501
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700502 } else {
503 pDecodedItem->val.uint64 = uNumber;
504 pDecodedItem->uDataType = QCBOR_TYPE_UINT64;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800505
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700506 }
507 } else {
508 if(uNumber <= INT64_MAX) {
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800509 // CBOR's representation of negative numbers lines up with the
510 // two-compliment representation. A negative integer has one
511 // more in range than a positive integer. INT64_MIN is
512 // equal to (-INT64_MAX) - 1.
513 pDecodedItem->val.int64 = (-(int64_t)uNumber) - 1;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700514 pDecodedItem->uDataType = QCBOR_TYPE_INT64;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800515
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700516 } else {
517 // C can't represent a negative integer in this range
Laurence Lundblade21d1d812019-09-28 22:47:49 -1000518 // so it is an error.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700519 nReturn = QCBOR_ERR_INT_OVERFLOW;
520 }
521 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800522
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700523 return nReturn;
524}
525
526// Make sure #define value line up as DecodeSimple counts on this.
527#if QCBOR_TYPE_FALSE != CBOR_SIMPLEV_FALSE
528#error QCBOR_TYPE_FALSE macro value wrong
529#endif
530
531#if QCBOR_TYPE_TRUE != CBOR_SIMPLEV_TRUE
532#error QCBOR_TYPE_TRUE macro value wrong
533#endif
534
535#if QCBOR_TYPE_NULL != CBOR_SIMPLEV_NULL
536#error QCBOR_TYPE_NULL macro value wrong
537#endif
538
539#if QCBOR_TYPE_UNDEF != CBOR_SIMPLEV_UNDEF
540#error QCBOR_TYPE_UNDEF macro value wrong
541#endif
542
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700543#if QCBOR_TYPE_BREAK != CBOR_SIMPLE_BREAK
544#error QCBOR_TYPE_BREAK macro value wrong
545#endif
546
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700547#if QCBOR_TYPE_DOUBLE != DOUBLE_PREC_FLOAT
548#error QCBOR_TYPE_DOUBLE macro value wrong
549#endif
550
551#if QCBOR_TYPE_FLOAT != SINGLE_PREC_FLOAT
552#error QCBOR_TYPE_FLOAT macro value wrong
553#endif
554
555/*
556 Decode true, false, floats, break...
557 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800558inline static QCBORError
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800559DecodeSimple(int nAdditionalInfo, uint64_t uNumber, QCBORItem *pDecodedItem)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700560{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700561 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800562
Laurence Lundbladeee851742020-01-08 08:37:05 -0800563 // uAdditionalInfo is 5 bits from the initial byte compile time checks
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800564 // above make sure uAdditionalInfo values line up with uDataType values.
565 // DecodeTypeAndNumber never returns a major type > 1f so cast is safe
566 pDecodedItem->uDataType = (uint8_t)nAdditionalInfo;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800567
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800568 switch(nAdditionalInfo) {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800569 // No check for ADDINFO_RESERVED1 - ADDINFO_RESERVED3 as they are
570 // caught before this is called.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800571
Laurence Lundbladecc2ed342018-09-22 17:29:55 -0700572 case HALF_PREC_FLOAT:
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700573#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade9682a532020-06-06 18:33:04 -0700574 // The caast to uint16_t is safe because the encoded value
575 // was 16 bits. It was widened to 64 bits to be passed in here.
Laurence Lundblade67bd5512018-11-02 21:44:06 +0700576 pDecodedItem->val.dfnum = IEEE754_HalfToDouble((uint16_t)uNumber);
577 pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE;
Laurence Lundblade9682a532020-06-06 18:33:04 -0700578#else
579 nReturn = QCBOR_ERR_UNSUPPORTED;
580#endif
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700581 break;
Laurence Lundbladecc2ed342018-09-22 17:29:55 -0700582 case SINGLE_PREC_FLOAT:
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700583#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade9682a532020-06-06 18:33:04 -0700584 // The caast to uint32_t is safe because the encoded value
Laurence Lundblade8fa7d5d2020-07-11 16:30:47 -0700585 // was 32 bits. It was widened to 64 bits to be passed in here.
Laurence Lundblade9682a532020-06-06 18:33:04 -0700586 pDecodedItem->val.dfnum = IEEE754_FloatToDouble((uint32_t)uNumber);
587#else
588 pDecodedItem->val.fnum = UsefulBufUtil_CopyUint32ToFloat((uint32_t)uNumber);
589 pDecodedItem->uDataType = QCBOR_TYPE_FLOAT;
590#endif
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700591 break;
592 case DOUBLE_PREC_FLOAT:
593 pDecodedItem->val.dfnum = UsefulBufUtil_CopyUint64ToDouble(uNumber);
Laurence Lundblade67bd5512018-11-02 21:44:06 +0700594 pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE;
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700595 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800596
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700597 case CBOR_SIMPLEV_FALSE: // 20
598 case CBOR_SIMPLEV_TRUE: // 21
599 case CBOR_SIMPLEV_NULL: // 22
600 case CBOR_SIMPLEV_UNDEF: // 23
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700601 case CBOR_SIMPLE_BREAK: // 31
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700602 break; // nothing to do
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800603
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700604 case CBOR_SIMPLEV_ONEBYTE: // 24
605 if(uNumber <= CBOR_SIMPLE_BREAK) {
606 // This takes out f8 00 ... f8 1f which should be encoded as e0 … f7
Laurence Lundblade077475f2019-04-26 09:06:33 -0700607 nReturn = QCBOR_ERR_BAD_TYPE_7;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700608 goto Done;
609 }
Laurence Lundblade5e390822019-01-06 12:35:01 -0800610 /* FALLTHROUGH */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700611 // fall through intentionally
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800612
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700613 default: // 0-19
614 pDecodedItem->uDataType = QCBOR_TYPE_UKNOWN_SIMPLE;
Laurence Lundbladeee851742020-01-08 08:37:05 -0800615 /*
616 DecodeTypeAndNumber will make uNumber equal to
617 uAdditionalInfo when uAdditionalInfo is < 24 This cast is
618 safe because the 2, 4 and 8 byte lengths of uNumber are in
619 the double/float cases above
620 */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700621 pDecodedItem->val.uSimple = (uint8_t)uNumber;
622 break;
623 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800624
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700625Done:
626 return nReturn;
627}
628
629
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700630/*
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530631 Decode text and byte strings. Call the string allocator if asked to.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700632 */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800633inline static QCBORError DecodeBytes(const QCORInternalAllocator *pAllocator,
634 int nMajorType,
635 uint64_t uStrLen,
636 UsefulInputBuf *pUInBuf,
637 QCBORItem *pDecodedItem)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700638{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700639 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800640
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800641 // CBOR lengths can be 64 bits, but size_t is not 64 bits on all CPUs.
642 // This check makes the casts to size_t below safe.
643
644 // 4 bytes less than the largest sizeof() so this can be tested by
645 // putting a SIZE_MAX length in the CBOR test input (no one will
646 // care the limit on strings is 4 bytes shorter).
647 if(uStrLen > SIZE_MAX-4) {
648 nReturn = QCBOR_ERR_STRING_TOO_LONG;
649 goto Done;
650 }
651
652 const UsefulBufC Bytes = UsefulInputBuf_GetUsefulBuf(pUInBuf, (size_t)uStrLen);
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530653 if(UsefulBuf_IsNULLC(Bytes)) {
654 // Failed to get the bytes for this string item
655 nReturn = QCBOR_ERR_HIT_END;
656 goto Done;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700657 }
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530658
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800659 if(pAllocator) {
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530660 // We are asked to use string allocator to make a copy
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800661 UsefulBuf NewMem = StringAllocator_Allocate(pAllocator, (size_t)uStrLen);
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530662 if(UsefulBuf_IsNULL(NewMem)) {
Laurence Lundblade30816f22018-11-10 13:40:22 +0700663 nReturn = QCBOR_ERR_STRING_ALLOCATE;
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530664 goto Done;
665 }
666 pDecodedItem->val.string = UsefulBuf_Copy(NewMem, Bytes);
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800667 pDecodedItem->uDataAlloc = 1;
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530668 } else {
669 // Normal case with no string allocator
670 pDecodedItem->val.string = Bytes;
671 }
Laurence Lundbladeee851742020-01-08 08:37:05 -0800672 const bool bIsBstr = (nMajorType == CBOR_MAJOR_TYPE_BYTE_STRING);
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800673 // Cast because ternary operator causes promotion to integer
674 pDecodedItem->uDataType = (uint8_t)(bIsBstr ? QCBOR_TYPE_BYTE_STRING
675 : QCBOR_TYPE_TEXT_STRING);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800676
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530677Done:
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700678 return nReturn;
679}
680
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700681
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800682
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700683
684
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700685
686
Laurence Lundbladeee851742020-01-08 08:37:05 -0800687// Make sure the constants align as this is assumed by
688// the GetAnItem() implementation
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700689#if QCBOR_TYPE_ARRAY != CBOR_MAJOR_TYPE_ARRAY
690#error QCBOR_TYPE_ARRAY value not lined up with major type
691#endif
692#if QCBOR_TYPE_MAP != CBOR_MAJOR_TYPE_MAP
693#error QCBOR_TYPE_MAP value not lined up with major type
694#endif
695
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700696/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800697 This gets a single data item and decodes it including preceding
698 optional tagging. This does not deal with arrays and maps and nesting
699 except to decode the data item introducing them. Arrays and maps are
700 handled at the next level up in GetNext().
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800701
Laurence Lundbladeee851742020-01-08 08:37:05 -0800702 Errors detected here include: an array that is too long to decode,
703 hit end of buffer unexpectedly, a few forms of invalid encoded CBOR
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700704 */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800705static QCBORError GetNext_Item(UsefulInputBuf *pUInBuf,
706 QCBORItem *pDecodedItem,
707 const QCORInternalAllocator *pAllocator)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700708{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700709 QCBORError nReturn;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800710
Laurence Lundbladeee851742020-01-08 08:37:05 -0800711 /*
712 Get the major type and the number. Number could be length of more
713 bytes or the value depending on the major type nAdditionalInfo is
714 an encoding of the length of the uNumber and is needed to decode
715 floats and doubles
716 */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800717 int nMajorType;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700718 uint64_t uNumber;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800719 int nAdditionalInfo;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800720
Laurence Lundblade4b09f632019-10-09 14:34:59 -0700721 memset(pDecodedItem, 0, sizeof(QCBORItem));
722
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800723 nReturn = DecodeTypeAndNumber(pUInBuf, &nMajorType, &uNumber, &nAdditionalInfo);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800724
Laurence Lundbladeee851742020-01-08 08:37:05 -0800725 // Error out here if we got into trouble on the type and number. The
726 // code after this will not work if the type and number is not good.
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700727 if(nReturn) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700728 goto Done;
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700729 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800730
Laurence Lundbladeee851742020-01-08 08:37:05 -0800731 // At this point the major type and the value are valid. We've got
732 // the type and the number that starts every CBOR data item.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800733 switch (nMajorType) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700734 case CBOR_MAJOR_TYPE_POSITIVE_INT: // Major type 0
735 case CBOR_MAJOR_TYPE_NEGATIVE_INT: // Major type 1
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800736 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700737 nReturn = QCBOR_ERR_BAD_INT;
738 } else {
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800739 nReturn = DecodeInteger(nMajorType, uNumber, pDecodedItem);
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700740 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700741 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800742
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700743 case CBOR_MAJOR_TYPE_BYTE_STRING: // Major type 2
744 case CBOR_MAJOR_TYPE_TEXT_STRING: // Major type 3
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800745 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
746 const bool bIsBstr = (nMajorType == CBOR_MAJOR_TYPE_BYTE_STRING);
747 pDecodedItem->uDataType = (uint8_t)(bIsBstr ? QCBOR_TYPE_BYTE_STRING
748 : QCBOR_TYPE_TEXT_STRING);
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530749 pDecodedItem->val.string = (UsefulBufC){NULL, SIZE_MAX};
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700750 } else {
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800751 nReturn = DecodeBytes(pAllocator, nMajorType, uNumber, pUInBuf, pDecodedItem);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700752 }
753 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800754
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700755 case CBOR_MAJOR_TYPE_ARRAY: // Major type 4
756 case CBOR_MAJOR_TYPE_MAP: // Major type 5
757 // Record the number of items in the array or map
758 if(uNumber > QCBOR_MAX_ITEMS_IN_ARRAY) {
759 nReturn = QCBOR_ERR_ARRAY_TOO_LONG;
760 goto Done;
761 }
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800762 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530763 pDecodedItem->val.uCount = UINT16_MAX; // Indicate indefinite length
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700764 } else {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800765 // type conversion OK because of check above
766 pDecodedItem->val.uCount = (uint16_t)uNumber;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700767 }
Laurence Lundbladeee851742020-01-08 08:37:05 -0800768 // C preproc #if above makes sure constants for major types align
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800769 // DecodeTypeAndNumber never returns a major type > 7 so cast is safe
770 pDecodedItem->uDataType = (uint8_t)nMajorType;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700771 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800772
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700773 case CBOR_MAJOR_TYPE_OPTIONAL: // Major type 6, optional prepended tags
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800774 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700775 nReturn = QCBOR_ERR_BAD_INT;
776 } else {
777 pDecodedItem->val.uTagV = uNumber;
778 pDecodedItem->uDataType = QCBOR_TYPE_OPTTAG;
779 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700780 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800781
Laurence Lundbladeee851742020-01-08 08:37:05 -0800782 case CBOR_MAJOR_TYPE_SIMPLE:
783 // Major type 7, float, double, true, false, null...
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800784 nReturn = DecodeSimple(nAdditionalInfo, uNumber, pDecodedItem);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700785 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800786
Laurence Lundbladeee851742020-01-08 08:37:05 -0800787 default:
788 // Never happens because DecodeTypeAndNumber() should never return > 7
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700789 nReturn = QCBOR_ERR_UNSUPPORTED;
790 break;
791 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800792
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700793Done:
794 return nReturn;
795}
796
797
798
799/*
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800800 This layer deals with indefinite length strings. It pulls all the
Laurence Lundbladeee851742020-01-08 08:37:05 -0800801 individual chunk items together into one QCBORItem using the string
802 allocator.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800803
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530804 Code Reviewers: THIS FUNCTION DOES A LITTLE POINTER MATH
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700805 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800806static inline QCBORError
807GetNext_FullItem(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700808{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700809 // Stack usage; int/ptr 2 UsefulBuf 2 QCBORItem -- 96
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700810
811 // Get pointer to string allocator. First use is to pass it to
812 // GetNext_Item() when option is set to allocate for *every* string.
813 // Second use here is to allocate space to coallese indefinite
814 // length string items into one.
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800815 const QCORInternalAllocator *pAllocator = me->StringAllocator.pfAllocator ?
816 &(me->StringAllocator) :
817 NULL;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800818
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700819 QCBORError nReturn;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800820 nReturn = GetNext_Item(&(me->InBuf),
821 pDecodedItem,
822 me->bStringAllocateAll ? pAllocator: NULL);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700823 if(nReturn) {
824 goto Done;
825 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800826
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700827 // To reduce code size by removing support for indefinite length strings, the
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530828 // code in this function from here down can be eliminated. Run tests, except
829 // indefinite length string tests, to be sure all is OK if this is removed.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800830
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800831 // Only do indefinite length processing on strings
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700832 const uint8_t uStringType = pDecodedItem->uDataType;
833 if(uStringType!= QCBOR_TYPE_BYTE_STRING && uStringType != QCBOR_TYPE_TEXT_STRING) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700834 goto Done; // no need to do any work here on non-string types
835 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800836
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800837 // Is this a string with an indefinite length?
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530838 if(pDecodedItem->val.string.len != SIZE_MAX) {
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800839 goto Done; // length is not indefinite, so no work to do here
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700840 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800841
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530842 // Can't do indefinite length strings without a string allocator
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800843 if(pAllocator == NULL) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700844 nReturn = QCBOR_ERR_NO_STRING_ALLOCATOR;
845 goto Done;
846 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800847
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700848 // Loop getting chunk of indefinite string
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700849 UsefulBufC FullString = NULLUsefulBufC;
850
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700851 for(;;) {
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700852 // Get item for next chunk
853 QCBORItem StringChunkItem;
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700854 // NULL string allocator passed here. Do not need to allocate
855 // chunks even if bStringAllocateAll is set.
Laurence Lundbladefae26bf2019-02-18 11:15:43 -0800856 nReturn = GetNext_Item(&(me->InBuf), &StringChunkItem, NULL);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700857 if(nReturn) {
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700858 break; // Error getting the next chunk
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700859 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800860
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530861 // See if it is a marker at end of indefinite length string
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700862 if(StringChunkItem.uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800863 // String is complete
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700864 pDecodedItem->val.string = FullString;
Laurence Lundblade57dd1442018-10-15 20:26:28 +0530865 pDecodedItem->uDataAlloc = 1;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700866 break;
867 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800868
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700869 // Match data type of chunk to type at beginning.
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530870 // Also catches error of other non-string types that don't belong.
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700871 // Also catches indefinite length strings inside indefinite length strings
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800872 if(StringChunkItem.uDataType != uStringType ||
873 StringChunkItem.val.string.len == SIZE_MAX) {
Laurence Lundblade30816f22018-11-10 13:40:22 +0700874 nReturn = QCBOR_ERR_INDEFINITE_STRING_CHUNK;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700875 break;
876 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800877
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530878 // Alloc new buffer or expand previously allocated buffer so it can fit
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800879 // The first time throurgh FullString.ptr is NULL and this is
880 // equivalent to StringAllocator_Allocate()
881 UsefulBuf NewMem = StringAllocator_Reallocate(pAllocator,
882 UNCONST_POINTER(FullString.ptr),
883 FullString.len + StringChunkItem.val.string.len);
884
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700885 if(UsefulBuf_IsNULL(NewMem)) {
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530886 // Allocation of memory for the string failed
Laurence Lundblade30816f22018-11-10 13:40:22 +0700887 nReturn = QCBOR_ERR_STRING_ALLOCATE;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700888 break;
889 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800890
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700891 // Copy new string chunk at the end of string so far.
892 FullString = UsefulBuf_CopyOffset(NewMem, FullString.len, StringChunkItem.val.string);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700893 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800894
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800895 if(nReturn != QCBOR_SUCCESS && !UsefulBuf_IsNULLC(FullString)) {
896 // Getting the item failed, clean up the allocated memory
897 StringAllocator_Free(pAllocator, UNCONST_POINTER(FullString.ptr));
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700898 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800899
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700900Done:
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700901 return nReturn;
902}
903
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700904
905/*
Laurence Lundblade59289e52019-12-30 13:44:37 -0800906 Gets all optional tag data items preceding a data item that is not an
907 optional tag and records them as bits in the tag map.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700908 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800909static QCBORError
910GetNext_TaggedItem(QCBORDecodeContext *me,
911 QCBORItem *pDecodedItem,
912 QCBORTagListOut *pTags)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700913{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700914 // Stack usage: int/ptr: 3 -- 24
Laurence Lundblade30816f22018-11-10 13:40:22 +0700915 QCBORError nReturn;
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700916 uint64_t uTagBits = 0;
917 if(pTags) {
918 pTags->uNumUsed = 0;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700919 }
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700920
Laurence Lundblade59289e52019-12-30 13:44:37 -0800921 // Loop fetching items until the item fetched is not a tag
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700922 for(;;) {
923 nReturn = GetNext_FullItem(me, pDecodedItem);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700924 if(nReturn) {
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700925 goto Done; // Error out of the loop
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700926 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800927
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700928 if(pDecodedItem->uDataType != QCBOR_TYPE_OPTTAG) {
929 // Successful exit from loop; maybe got some tags, maybe not
930 pDecodedItem->uTagBits = uTagBits;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700931 break;
932 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800933
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700934 uint8_t uTagBitIndex;
935 // Tag was mapped, tag was not mapped, error with tag list
936 switch(TagMapper_Lookup(me->pCallerConfiguredTagList, pDecodedItem->val.uTagV, &uTagBitIndex)) {
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800937
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700938 case QCBOR_SUCCESS:
939 // Successfully mapped the tag
940 uTagBits |= 0x01ULL << uTagBitIndex;
941 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800942
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700943 case QCBOR_ERR_BAD_OPT_TAG:
944 // Tag is not recognized. Do nothing
945 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800946
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700947 default:
948 // Error Condition
949 goto Done;
950 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800951
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700952 if(pTags) {
953 // Caller wants all tags recorded in the provided buffer
954 if(pTags->uNumUsed >= pTags->uNumAllocated) {
955 nReturn = QCBOR_ERR_TOO_MANY_TAGS;
956 goto Done;
957 }
958 pTags->puTags[pTags->uNumUsed] = pDecodedItem->val.uTagV;
959 pTags->uNumUsed++;
960 }
961 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800962
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700963Done:
964 return nReturn;
965}
966
967
968/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800969 This layer takes care of map entries. It combines the label and data
970 items into one QCBORItem.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700971 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800972static inline QCBORError
973GetNext_MapEntry(QCBORDecodeContext *me,
974 QCBORItem *pDecodedItem,
975 QCBORTagListOut *pTags)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700976{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700977 // Stack use: int/ptr 1, QCBORItem -- 56
Laurence Lundblade30816f22018-11-10 13:40:22 +0700978 QCBORError nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700979 if(nReturn)
980 goto Done;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800981
Laurence Lundblade742df4a2018-10-13 20:07:17 +0800982 if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700983 // Break can't be a map entry
Laurence Lundblade742df4a2018-10-13 20:07:17 +0800984 goto Done;
985 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800986
Laurence Lundbladed61cbf32018-12-09 11:42:21 -0800987 if(me->uDecodeMode != QCBOR_DECODE_MODE_MAP_AS_ARRAY) {
988 // In a map and caller wants maps decoded, not treated as arrays
989
990 if(DecodeNesting_TypeIsMap(&(me->nesting))) {
991 // If in a map and the right decoding mode, get the label
992
Laurence Lundbladeee851742020-01-08 08:37:05 -0800993 // Save label in pDecodedItem and get the next which will
994 // be the real data
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +0900995 QCBORItem LabelItem = *pDecodedItem;
996 nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags);
997 if(nReturn)
998 goto Done;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800999
Laurence Lundblade57dd1442018-10-15 20:26:28 +05301000 pDecodedItem->uLabelAlloc = LabelItem.uDataAlloc;
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +09001001
1002 if(LabelItem.uDataType == QCBOR_TYPE_TEXT_STRING) {
1003 // strings are always good labels
1004 pDecodedItem->label.string = LabelItem.val.string;
1005 pDecodedItem->uLabelType = QCBOR_TYPE_TEXT_STRING;
1006 } else if (QCBOR_DECODE_MODE_MAP_STRINGS_ONLY == me->uDecodeMode) {
Laurence Lundbladeee851742020-01-08 08:37:05 -08001007 // It's not a string and we only want strings
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +09001008 nReturn = QCBOR_ERR_MAP_LABEL_TYPE;
1009 goto Done;
1010 } else if(LabelItem.uDataType == QCBOR_TYPE_INT64) {
1011 pDecodedItem->label.int64 = LabelItem.val.int64;
1012 pDecodedItem->uLabelType = QCBOR_TYPE_INT64;
1013 } else if(LabelItem.uDataType == QCBOR_TYPE_UINT64) {
1014 pDecodedItem->label.uint64 = LabelItem.val.uint64;
1015 pDecodedItem->uLabelType = QCBOR_TYPE_UINT64;
1016 } else if(LabelItem.uDataType == QCBOR_TYPE_BYTE_STRING) {
1017 pDecodedItem->label.string = LabelItem.val.string;
1018 pDecodedItem->uLabelAlloc = LabelItem.uDataAlloc;
1019 pDecodedItem->uLabelType = QCBOR_TYPE_BYTE_STRING;
1020 } else {
1021 // label is not an int or a string. It is an arrray
1022 // or a float or such and this implementation doesn't handle that.
1023 // Also, tags on labels are ignored.
1024 nReturn = QCBOR_ERR_MAP_LABEL_TYPE;
1025 goto Done;
1026 }
Laurence Lundbladed61cbf32018-12-09 11:42:21 -08001027 }
1028 } else {
1029 if(pDecodedItem->uDataType == QCBOR_TYPE_MAP) {
Laurence Lundbladee6bcef12020-04-01 10:56:27 -07001030 if(pDecodedItem->val.uCount > QCBOR_MAX_ITEMS_IN_ARRAY/2) {
1031 nReturn = QCBOR_ERR_ARRAY_TOO_LONG;
1032 goto Done;
1033 }
Laurence Lundbladed61cbf32018-12-09 11:42:21 -08001034 // Decoding a map as an array
1035 pDecodedItem->uDataType = QCBOR_TYPE_MAP_AS_ARRAY;
Laurence Lundbladee6bcef12020-04-01 10:56:27 -07001036 // Cast is safe because of check against QCBOR_MAX_ITEMS_IN_ARRAY/2
1037 // Cast is needed because of integer promotion
1038 pDecodedItem->val.uCount = (uint16_t)(pDecodedItem->val.uCount * 2);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001039 }
1040 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001041
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001042Done:
1043 return nReturn;
1044}
1045
1046
1047/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001048 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001049 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001050QCBORError QCBORDecode_GetNextMapOrArray(QCBORDecodeContext *me,
1051 QCBORItem *pDecodedItem,
1052 QCBORTagListOut *pTags)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001053{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001054 // Stack ptr/int: 2, QCBORItem : 64
1055
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301056 // The public entry point for fetching and parsing the next QCBORItem.
1057 // All the CBOR parsing work is here and in subordinate calls.
Laurence Lundblade30816f22018-11-10 13:40:22 +07001058 QCBORError nReturn;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001059
Laurence Lundbladebb1062e2019-08-12 23:28:54 -07001060 // Check if there are an
1061 if(UsefulInputBuf_BytesUnconsumed(&(me->InBuf)) == 0 && !DecodeNesting_IsNested(&(me->nesting))) {
1062 nReturn = QCBOR_ERR_NO_MORE_ITEMS;
1063 goto Done;
1064 }
1065
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001066 nReturn = GetNext_MapEntry(me, pDecodedItem, pTags);
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001067 if(nReturn) {
1068 goto Done;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001069 }
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301070
1071 // Break ending arrays/maps are always processed at the end of this function.
1072 // They should never show up here.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301073 if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundblade6de37062018-10-15 12:22:42 +05301074 nReturn = QCBOR_ERR_BAD_BREAK;
1075 goto Done;
Laurence Lundblade5b8c5852018-10-14 21:11:42 +05301076 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001077
Laurence Lundblade6de37062018-10-15 12:22:42 +05301078 // Record the nesting level for this data item before processing any of
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301079 // decrementing and descending.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301080 pDecodedItem->uNestingLevel = DecodeNesting_GetLevel(&(me->nesting));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001081
Laurence Lundblade6de37062018-10-15 12:22:42 +05301082 // Process the item just received for descent or decrement, and
1083 // ascent if decrements are enough to close out a definite length array/map
Laurence Lundblade3a760b02018-10-08 13:46:03 +08001084 if(IsMapOrArray(pDecodedItem->uDataType)) {
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001085 // If the new item is array or map, the nesting level descends
Laurence Lundblade3a760b02018-10-08 13:46:03 +08001086 nReturn = DecodeNesting_Descend(&(me->nesting), pDecodedItem);
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001087 // Maps and arrays do count in as items in the map/array that encloses
1088 // them so a decrement needs to be done for them too, but that is done
1089 // only when all the items in them have been processed, not when they
Laurence Lundblade9916b1b2019-09-07 22:33:25 -07001090 // are opened with the exception of an empty map or array.
1091 if(pDecodedItem->val.uCount == 0) {
1092 DecodeNesting_DecrementCount(&(me->nesting));
1093 }
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001094 } else {
1095 // Decrement the count of items in the enclosing map/array
1096 // If the count in the enclosing map/array goes to zero, that
Laurence Lundblade6de37062018-10-15 12:22:42 +05301097 // triggers a decrement in the map/array above that and
1098 // an ascend in nesting level.
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001099 DecodeNesting_DecrementCount(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001100 }
Laurence Lundblade6de37062018-10-15 12:22:42 +05301101 if(nReturn) {
1102 goto Done;
1103 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001104
Laurence Lundblade6de37062018-10-15 12:22:42 +05301105 // For indefinite length maps/arrays, looking at any and
1106 // all breaks that might terminate them. The equivalent
1107 // for definite length maps/arrays happens in
1108 // DecodeNesting_DecrementCount().
1109 if(DecodeNesting_IsNested(&(me->nesting)) && DecodeNesting_IsIndefiniteLength(&(me->nesting))) {
1110 while(UsefulInputBuf_BytesUnconsumed(&(me->InBuf))) {
1111 // Peek forward one item to see if it is a break.
1112 QCBORItem Peek;
1113 size_t uPeek = UsefulInputBuf_Tell(&(me->InBuf));
1114 nReturn = GetNext_Item(&(me->InBuf), &Peek, NULL);
1115 if(nReturn) {
1116 goto Done;
1117 }
1118 if(Peek.uDataType != QCBOR_TYPE_BREAK) {
1119 // It is not a break, rewind so it can be processed normally.
1120 UsefulInputBuf_Seek(&(me->InBuf), uPeek);
1121 break;
1122 }
1123 // It is a break. Ascend one nesting level.
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301124 // The break is consumed.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301125 nReturn = DecodeNesting_BreakAscend(&(me->nesting));
1126 if(nReturn) {
1127 // break occured outside of an indefinite length array/map
1128 goto Done;
1129 }
1130 }
1131 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001132
Laurence Lundblade6de37062018-10-15 12:22:42 +05301133 // Tell the caller what level is next. This tells them what maps/arrays
1134 // were closed out and makes it possible for them to reconstruct
1135 // the tree with just the information returned by GetNext
1136 pDecodedItem->uNextNestLevel = DecodeNesting_GetLevel(&(me->nesting));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001137
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001138Done:
Laurence Lundbladee9482dd2019-10-11 12:58:46 -07001139 if(nReturn != QCBOR_SUCCESS) {
1140 // Make sure uDataType and uLabelType are QCBOR_TYPE_NONE
1141 memset(pDecodedItem, 0, sizeof(QCBORItem));
1142 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001143 return nReturn;
1144}
1145
1146
Laurence Lundblade59289e52019-12-30 13:44:37 -08001147/*
1148 Mostly just assign the right data type for the date string.
1149 */
1150inline static QCBORError DecodeDateString(QCBORItem *pDecodedItem)
1151{
1152 // Stack Use: UsefulBuf 1 16
1153 if(pDecodedItem->uDataType != QCBOR_TYPE_TEXT_STRING) {
1154 return QCBOR_ERR_BAD_OPT_TAG;
1155 }
1156
1157 const UsefulBufC Temp = pDecodedItem->val.string;
1158 pDecodedItem->val.dateString = Temp;
1159 pDecodedItem->uDataType = QCBOR_TYPE_DATE_STRING;
1160 return QCBOR_SUCCESS;
1161}
1162
1163
1164/*
1165 Mostly just assign the right data type for the bignum.
1166 */
1167inline static QCBORError DecodeBigNum(QCBORItem *pDecodedItem)
1168{
1169 // Stack Use: UsefulBuf 1 -- 16
1170 if(pDecodedItem->uDataType != QCBOR_TYPE_BYTE_STRING) {
1171 return QCBOR_ERR_BAD_OPT_TAG;
1172 }
1173 const UsefulBufC Temp = pDecodedItem->val.string;
1174 pDecodedItem->val.bigNum = Temp;
Laurence Lundbladeee851742020-01-08 08:37:05 -08001175 const bool bIsPosBigNum = (bool)(pDecodedItem->uTagBits & QCBOR_TAGFLAG_POS_BIGNUM);
Laurence Lundbladec5fef682020-01-25 11:38:45 -08001176 pDecodedItem->uDataType = (uint8_t)(bIsPosBigNum ? QCBOR_TYPE_POSBIGNUM
1177 : QCBOR_TYPE_NEGBIGNUM);
Laurence Lundblade59289e52019-12-30 13:44:37 -08001178 return QCBOR_SUCCESS;
1179}
1180
1181
1182/*
Laurence Lundbladeee851742020-01-08 08:37:05 -08001183 The epoch formatted date. Turns lots of different forms of encoding
1184 date into uniform one
Laurence Lundblade59289e52019-12-30 13:44:37 -08001185 */
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001186static QCBORError DecodeDateEpoch(QCBORItem *pDecodedItem)
Laurence Lundblade59289e52019-12-30 13:44:37 -08001187{
1188 // Stack usage: 1
1189 QCBORError nReturn = QCBOR_SUCCESS;
1190
1191 pDecodedItem->val.epochDate.fSecondsFraction = 0;
1192
1193 switch (pDecodedItem->uDataType) {
1194
1195 case QCBOR_TYPE_INT64:
1196 pDecodedItem->val.epochDate.nSeconds = pDecodedItem->val.int64;
1197 break;
1198
1199 case QCBOR_TYPE_UINT64:
1200 if(pDecodedItem->val.uint64 > INT64_MAX) {
1201 nReturn = QCBOR_ERR_DATE_OVERFLOW;
1202 goto Done;
1203 }
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001204 pDecodedItem->val.epochDate.nSeconds = (int64_t)pDecodedItem->val.uint64;
Laurence Lundblade59289e52019-12-30 13:44:37 -08001205 break;
1206
Laurence Lundblade9682a532020-06-06 18:33:04 -07001207 // TODO: test this with float and half input
Laurence Lundblade59289e52019-12-30 13:44:37 -08001208 case QCBOR_TYPE_DOUBLE:
Laurence Lundblade9682a532020-06-06 18:33:04 -07001209 case QCBOR_TYPE_FLOAT:
1210#ifndef QCBOR_DISABLE_FLOAT_HW_USE
Laurence Lundblade59289e52019-12-30 13:44:37 -08001211 {
1212 // This comparison needs to be done as a float before
1213 // conversion to an int64_t to be able to detect doubles
1214 // that are too large to fit into an int64_t. A double
1215 // has 52 bits of preceision. An int64_t has 63. Casting
1216 // INT64_MAX to a double actually causes a round up which
1217 // is bad and wrong for the comparison because it will
1218 // allow conversion of doubles that can't fit into a
1219 // uint64_t. To remedy this INT64_MAX - 0x7ff is used as
Laurence Lundblade9682a532020-06-06 18:33:04 -07001220 // the cutoff point because if that value rounds up in conversion to
Laurence Lundblade59289e52019-12-30 13:44:37 -08001221 // double it will still be less than INT64_MAX. 0x7ff is
1222 // picked because it has 11 bits set.
1223 //
1224 // INT64_MAX seconds is on the order of 10 billion years,
1225 // and the earth is less than 5 billion years old, so for
1226 // most uses this conversion error won't occur even though
1227 // doubles can go much larger.
1228 //
1229 // Without the 0x7ff there is a ~30 minute range of time
1230 // values 10 billion years in the past and in the future
Laurence Lundblade9682a532020-06-06 18:33:04 -07001231 // where this this code would go wrong and some compilers
1232 // will generate warnings or errors.
Laurence Lundblade59289e52019-12-30 13:44:37 -08001233 const double d = pDecodedItem->val.dfnum;
1234 if(d > (double)(INT64_MAX - 0x7ff)) {
1235 nReturn = QCBOR_ERR_DATE_OVERFLOW;
1236 goto Done;
1237 }
1238 pDecodedItem->val.epochDate.nSeconds = (int64_t)d;
1239 pDecodedItem->val.epochDate.fSecondsFraction = d - (double)pDecodedItem->val.epochDate.nSeconds;
1240 }
Laurence Lundblade9682a532020-06-06 18:33:04 -07001241#else
1242 /* Disabling float support causes a floating point
1243 data to error in the default below. The above code
1244 requires floating point conversion to integers and
1245 comparison which requires either floating point HW
1246 or a SW library. */
1247
1248 nReturn = QCBOR_ERR_FLOAT_DATE_UNSUPPORTED;
1249#endif /* QCBOR_DISABLE_FLOAT_HW_USE */
Laurence Lundblade59289e52019-12-30 13:44:37 -08001250 break;
1251
Laurence Lundblade9682a532020-06-06 18:33:04 -07001252
Laurence Lundblade59289e52019-12-30 13:44:37 -08001253 default:
1254 nReturn = QCBOR_ERR_BAD_OPT_TAG;
1255 goto Done;
1256 }
1257 pDecodedItem->uDataType = QCBOR_TYPE_DATE_EPOCH;
1258
1259Done:
1260 return nReturn;
1261}
1262
1263
1264#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1265/*
1266 Decode decimal fractions and big floats.
1267
1268 When called pDecodedItem must be the array that is tagged as a big
1269 float or decimal fraction, the array that has the two members, the
1270 exponent and mantissa.
1271
1272 This will fetch and decode the exponent and mantissa and put the
1273 result back into pDecodedItem.
1274 */
1275inline static QCBORError
1276QCBORDecode_MantissaAndExponent(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
1277{
1278 QCBORError nReturn;
1279
1280 // --- Make sure it is an array; track nesting level of members ---
1281 if(pDecodedItem->uDataType != QCBOR_TYPE_ARRAY) {
1282 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1283 goto Done;
1284 }
1285
1286 // A check for pDecodedItem->val.uCount == 2 would work for
Laurence Lundbladeee851742020-01-08 08:37:05 -08001287 // definite length arrays, but not for indefnite. Instead remember
1288 // the nesting level the two integers must be at, which is one
1289 // deeper than that of the array.
Laurence Lundblade59289e52019-12-30 13:44:37 -08001290 const int nNestLevel = pDecodedItem->uNestingLevel + 1;
1291
1292 // --- Is it a decimal fraction or a bigfloat? ---
1293 const bool bIsTaggedDecimalFraction = QCBORDecode_IsTagged(me, pDecodedItem, CBOR_TAG_DECIMAL_FRACTION);
1294 pDecodedItem->uDataType = bIsTaggedDecimalFraction ? QCBOR_TYPE_DECIMAL_FRACTION : QCBOR_TYPE_BIGFLOAT;
1295
1296 // --- Get the exponent ---
1297 QCBORItem exponentItem;
1298 nReturn = QCBORDecode_GetNextMapOrArray(me, &exponentItem, NULL);
1299 if(nReturn != QCBOR_SUCCESS) {
1300 goto Done;
1301 }
1302 if(exponentItem.uNestingLevel != nNestLevel) {
1303 // Array is empty or a map/array encountered when expecting an int
1304 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1305 goto Done;
1306 }
1307 if(exponentItem.uDataType == QCBOR_TYPE_INT64) {
1308 // Data arriving as an unsigned int < INT64_MAX has been converted
1309 // to QCBOR_TYPE_INT64 and thus handled here. This is also means
1310 // that the only data arriving here of type QCBOR_TYPE_UINT64 data
1311 // will be too large for this to handle and thus an error that will
1312 // get handled in the next else.
1313 pDecodedItem->val.expAndMantissa.nExponent = exponentItem.val.int64;
1314 } else {
1315 // Wrong type of exponent or a QCBOR_TYPE_UINT64 > INT64_MAX
1316 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1317 goto Done;
1318 }
1319
1320 // --- Get the mantissa ---
1321 QCBORItem mantissaItem;
1322 nReturn = QCBORDecode_GetNextWithTags(me, &mantissaItem, NULL);
1323 if(nReturn != QCBOR_SUCCESS) {
1324 goto Done;
1325 }
1326 if(mantissaItem.uNestingLevel != nNestLevel) {
1327 // Mantissa missing or map/array encountered when expecting number
1328 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1329 goto Done;
1330 }
1331 if(mantissaItem.uDataType == QCBOR_TYPE_INT64) {
1332 // Data arriving as an unsigned int < INT64_MAX has been converted
1333 // to QCBOR_TYPE_INT64 and thus handled here. This is also means
1334 // that the only data arriving here of type QCBOR_TYPE_UINT64 data
1335 // will be too large for this to handle and thus an error that
1336 // will get handled in an else below.
1337 pDecodedItem->val.expAndMantissa.Mantissa.nInt = mantissaItem.val.int64;
1338 } else if(mantissaItem.uDataType == QCBOR_TYPE_POSBIGNUM || mantissaItem.uDataType == QCBOR_TYPE_NEGBIGNUM) {
1339 // Got a good big num mantissa
1340 pDecodedItem->val.expAndMantissa.Mantissa.bigNum = mantissaItem.val.bigNum;
1341 // Depends on numbering of QCBOR_TYPE_XXX
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001342 pDecodedItem->uDataType = (uint8_t)(pDecodedItem->uDataType +
1343 mantissaItem.uDataType - QCBOR_TYPE_POSBIGNUM +
1344 1);
Laurence Lundblade59289e52019-12-30 13:44:37 -08001345 } else {
1346 // Wrong type of mantissa or a QCBOR_TYPE_UINT64 > INT64_MAX
1347 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1348 goto Done;
1349 }
1350
1351 // --- Check that array only has the two numbers ---
1352 if(mantissaItem.uNextNestLevel == nNestLevel) {
1353 // Extra items in the decimal fraction / big num
1354 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1355 goto Done;
1356 }
1357
1358Done:
1359
1360 return nReturn;
1361}
1362#endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */
1363
1364
1365/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001366 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade59289e52019-12-30 13:44:37 -08001367 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001368QCBORError
1369QCBORDecode_GetNextWithTags(QCBORDecodeContext *me,
1370 QCBORItem *pDecodedItem,
1371 QCBORTagListOut *pTags)
Laurence Lundblade59289e52019-12-30 13:44:37 -08001372{
1373 QCBORError nReturn;
1374
1375 nReturn = QCBORDecode_GetNextMapOrArray(me, pDecodedItem, pTags);
1376 if(nReturn != QCBOR_SUCCESS) {
1377 goto Done;
1378 }
1379
1380#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1381#define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_SIX
1382#else
1383#define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_FOUR
1384#endif
1385
1386 // Only pay attention to tags this code knows how to decode.
1387 switch(pDecodedItem->uTagBits & TAG_MAPPER_FIRST_XXX) {
1388 case 0:
1389 // No tags at all or none we know about. Nothing to do.
1390 // This is the pass-through path of this function
1391 // that will mostly be taken when decoding any item.
1392 break;
1393
1394 case QCBOR_TAGFLAG_DATE_STRING:
1395 nReturn = DecodeDateString(pDecodedItem);
1396 break;
1397
1398 case QCBOR_TAGFLAG_DATE_EPOCH:
1399 nReturn = DecodeDateEpoch(pDecodedItem);
1400 break;
1401
1402 case QCBOR_TAGFLAG_POS_BIGNUM:
1403 case QCBOR_TAGFLAG_NEG_BIGNUM:
1404 nReturn = DecodeBigNum(pDecodedItem);
1405 break;
1406
1407#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1408 case QCBOR_TAGFLAG_DECIMAL_FRACTION:
1409 case QCBOR_TAGFLAG_BIGFLOAT:
1410 // For aggregate tagged types, what goes into pTags is only collected
1411 // from the surrounding data item, not the contents, so pTags is not
1412 // passed on here.
1413
1414 nReturn = QCBORDecode_MantissaAndExponent(me, pDecodedItem);
1415 break;
1416#endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */
1417
1418 default:
1419 // Encountering some mixed-up CBOR like something that
1420 // is tagged as both a string and integer date.
1421 nReturn = QCBOR_ERR_BAD_OPT_TAG;
1422 }
1423
1424Done:
1425 if(nReturn != QCBOR_SUCCESS) {
1426 pDecodedItem->uDataType = QCBOR_TYPE_NONE;
1427 pDecodedItem->uLabelType = QCBOR_TYPE_NONE;
1428 }
1429 return nReturn;
1430}
1431
1432
1433/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001434 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade59289e52019-12-30 13:44:37 -08001435 */
Laurence Lundblade30816f22018-11-10 13:40:22 +07001436QCBORError QCBORDecode_GetNext(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001437{
1438 return QCBORDecode_GetNextWithTags(me, pDecodedItem, NULL);
1439}
1440
1441
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001442/*
Laurence Lundblade6de37062018-10-15 12:22:42 +05301443 Decoding items is done in 5 layered functions, one calling the
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301444 next one down. If a layer has no work to do for a particular item
1445 it returns quickly.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001446
Laurence Lundblade59289e52019-12-30 13:44:37 -08001447 - QCBORDecode_GetNext, GetNextWithTags -- The top layer processes
1448 tagged data items, turning them into the local C representation.
1449 For the most simple it is just associating a QCBOR_TYPE with the data. For
1450 the complex ones that an aggregate of data items, there is some further
1451 decoding and a little bit of recursion.
1452
1453 - QCBORDecode_GetNextMapOrArray - This manages the beginnings and
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301454 ends of maps and arrays. It tracks descending into and ascending
Laurence Lundblade6de37062018-10-15 12:22:42 +05301455 out of maps/arrays. It processes all breaks that terminate
1456 maps and arrays.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001457
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301458 - GetNext_MapEntry -- This handles the combining of two
1459 items, the label and the data, that make up a map entry.
1460 It only does work on maps. It combines the label and data
1461 items into one labeled item.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001462
Laurence Lundblade59289e52019-12-30 13:44:37 -08001463 - GetNext_TaggedItem -- This decodes type 6 tagging. It turns the
1464 tags into bit flags associated with the data item. No actual decoding
1465 of the contents of the tagged item is performed here.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001466
Laurence Lundblade59289e52019-12-30 13:44:37 -08001467 - GetNext_FullItem -- This assembles the sub-items that make up
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301468 an indefinte length string into one string item. It uses the
Laurence Lundblade6de37062018-10-15 12:22:42 +05301469 string allocater to create contiguous space for the item. It
1470 processes all breaks that are part of indefinite length strings.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001471
Laurence Lundblade59289e52019-12-30 13:44:37 -08001472 - GetNext_Item -- This decodes the atomic data items in CBOR. Each
1473 atomic data item has a "major type", an integer "argument" and optionally
1474 some content. For text and byte strings, the content is the bytes
1475 that make up the string. These are the smallest data items that are
1476 considered to be well-formed. The content may also be other data items in
1477 the case of aggregate types. They are not handled in this layer.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001478
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001479 Roughly this takes 300 bytes of stack for vars. Need to
1480 evaluate this more carefully and correctly.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001481
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301482 */
1483
1484
1485/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001486 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001487 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001488int QCBORDecode_IsTagged(QCBORDecodeContext *me,
1489 const QCBORItem *pItem,
1490 uint64_t uTag)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001491{
1492 const QCBORTagListIn *pCallerConfiguredTagMap = me->pCallerConfiguredTagList;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001493
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001494 uint8_t uTagBitIndex;
1495 // Do not care about errors in pCallerConfiguredTagMap here. They are
1496 // caught during GetNext() before this is called.
1497 if(TagMapper_Lookup(pCallerConfiguredTagMap, uTag, &uTagBitIndex)) {
1498 return 0;
1499 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001500
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001501 const uint64_t uTagBit = 0x01ULL << uTagBitIndex;
1502 return (uTagBit & pItem->uTagBits) != 0;
1503}
1504
1505
1506/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001507 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001508 */
Laurence Lundblade30816f22018-11-10 13:40:22 +07001509QCBORError QCBORDecode_Finish(QCBORDecodeContext *me)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001510{
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001511 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001512
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001513 // Error out if all the maps/arrays are not closed out
1514 if(DecodeNesting_IsNested(&(me->nesting))) {
1515 nReturn = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
1516 goto Done;
1517 }
1518
1519 // Error out if not all the bytes are consumed
1520 if(UsefulInputBuf_BytesUnconsumed(&(me->InBuf))) {
1521 nReturn = QCBOR_ERR_EXTRA_BYTES;
1522 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001523
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001524Done:
Laurence Lundblade6de37062018-10-15 12:22:42 +05301525 // Call the destructor for the string allocator if there is one.
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001526 // Always called, even if there are errors; always have to clean up
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001527 StringAllocator_Destruct(&(me->StringAllocator));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001528
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001529 return nReturn;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001530}
1531
1532
1533
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001534/*
1535
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001536Decoder errors handled in this file
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001537
Laurence Lundbladeee851742020-01-08 08:37:05 -08001538 - Hit end of input before it was expected while decoding type and
1539 number QCBOR_ERR_HIT_END
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001540
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001541 - negative integer that is too large for C QCBOR_ERR_INT_OVERFLOW
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001542
Laurence Lundbladeee851742020-01-08 08:37:05 -08001543 - Hit end of input while decoding a text or byte string
1544 QCBOR_ERR_HIT_END
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001545
Laurence Lundbladeee851742020-01-08 08:37:05 -08001546 - Encountered conflicting tags -- e.g., an item is tagged both a date
1547 string and an epoch date QCBOR_ERR_UNSUPPORTED
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001548
Laurence Lundbladeee851742020-01-08 08:37:05 -08001549 - Encontered an array or mapp that has too many items
1550 QCBOR_ERR_ARRAY_TOO_LONG
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001551
Laurence Lundbladeee851742020-01-08 08:37:05 -08001552 - Encountered array/map nesting that is too deep
1553 QCBOR_ERR_ARRAY_NESTING_TOO_DEEP
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001554
Laurence Lundbladeee851742020-01-08 08:37:05 -08001555 - An epoch date > INT64_MAX or < INT64_MIN was encountered
1556 QCBOR_ERR_DATE_OVERFLOW
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001557
Laurence Lundbladeee851742020-01-08 08:37:05 -08001558 - The type of a map label is not a string or int
1559 QCBOR_ERR_MAP_LABEL_TYPE
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001560
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001561 - Hit end with arrays or maps still open -- QCBOR_ERR_EXTRA_BYTES
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001562
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001563 */
1564
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001565
1566
Laurence Lundbladef6531662018-12-04 10:42:22 +09001567
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001568/* ===========================================================================
1569 MemPool -- BUILT-IN SIMPLE STRING ALLOCATOR
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001570
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001571 This implements a simple sting allocator for indefinite length
1572 strings that can be enabled by calling QCBORDecode_SetMemPool(). It
1573 implements the function type QCBORStringAllocate and allows easy
1574 use of it.
Laurence Lundbladef6531662018-12-04 10:42:22 +09001575
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001576 This particular allocator is built-in for convenience. The caller
1577 can implement their own. All of this following code will get
1578 dead-stripped if QCBORDecode_SetMemPool() is not called.
1579
1580 This is a very primitive memory allocator. It does not track
1581 individual allocations, only a high-water mark. A free or
1582 reallocation must be of the last chunk allocated.
1583
1584 The size of the pool and offset to free memory are packed into the
1585 first 8 bytes of the memory pool so we don't have to keep them in
1586 the decode context. Since the address of the pool may not be
1587 aligned, they have to be packed and unpacked as if they were
1588 serialized data of the wire or such.
1589
1590 The sizes packed in are uint32_t to be the same on all CPU types
1591 and simplify the code.
Laurence Lundbladeee851742020-01-08 08:37:05 -08001592 ========================================================================== */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001593
1594
Laurence Lundbladeee851742020-01-08 08:37:05 -08001595static inline int
1596MemPool_Unpack(const void *pMem, uint32_t *puPoolSize, uint32_t *puFreeOffset)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001597{
1598 // Use of UsefulInputBuf is overkill, but it is convenient.
1599 UsefulInputBuf UIB;
1600
Laurence Lundbladeee851742020-01-08 08:37:05 -08001601 // Just assume the size here. It was checked during SetUp so
1602 // the assumption is safe.
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001603 UsefulInputBuf_Init(&UIB, (UsefulBufC){pMem, QCBOR_DECODE_MIN_MEM_POOL_SIZE});
1604 *puPoolSize = UsefulInputBuf_GetUint32(&UIB);
1605 *puFreeOffset = UsefulInputBuf_GetUint32(&UIB);
1606 return UsefulInputBuf_GetError(&UIB);
1607}
1608
1609
Laurence Lundbladeee851742020-01-08 08:37:05 -08001610static inline int
1611MemPool_Pack(UsefulBuf Pool, uint32_t uFreeOffset)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001612{
1613 // Use of UsefulOutBuf is overkill, but convenient. The
1614 // length check performed here is useful.
1615 UsefulOutBuf UOB;
1616
1617 UsefulOutBuf_Init(&UOB, Pool);
1618 UsefulOutBuf_AppendUint32(&UOB, (uint32_t)Pool.len); // size of pool
1619 UsefulOutBuf_AppendUint32(&UOB, uFreeOffset); // first free position
1620 return UsefulOutBuf_GetError(&UOB);
1621}
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001622
1623
1624/*
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001625 Internal function for an allocation, reallocation free and destuct.
1626
1627 Having only one function rather than one each per mode saves space in
1628 QCBORDecodeContext.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001629
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001630 Code Reviewers: THIS FUNCTION DOES POINTER MATH
1631 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001632static UsefulBuf
1633MemPool_Function(void *pPool, void *pMem, size_t uNewSize)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001634{
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001635 UsefulBuf ReturnValue = NULLUsefulBuf;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001636
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001637 uint32_t uPoolSize;
1638 uint32_t uFreeOffset;
1639
1640 if(uNewSize > UINT32_MAX) {
1641 // This allocator is only good up to 4GB. This check should
1642 // optimize out if sizeof(size_t) == sizeof(uint32_t)
1643 goto Done;
1644 }
1645 const uint32_t uNewSize32 = (uint32_t)uNewSize;
1646
1647 if(MemPool_Unpack(pPool, &uPoolSize, &uFreeOffset)) {
1648 goto Done;
1649 }
1650
1651 if(uNewSize) {
1652 if(pMem) {
1653 // REALLOCATION MODE
1654 // Calculate pointer to the end of the memory pool. It is
1655 // assumed that pPool + uPoolSize won't wrap around by
1656 // assuming the caller won't pass a pool buffer in that is
1657 // not in legitimate memory space.
1658 const void *pPoolEnd = (uint8_t *)pPool + uPoolSize;
1659
1660 // Check that the pointer for reallocation is in the range of the
1661 // pool. This also makes sure that pointer math further down
1662 // doesn't wrap under or over.
1663 if(pMem >= pPool && pMem < pPoolEnd) {
1664 // Offset to start of chunk for reallocation. This won't
1665 // wrap under because of check that pMem >= pPool. Cast
1666 // is safe because the pool is always less than UINT32_MAX
1667 // because of check in QCBORDecode_SetMemPool().
1668 const uint32_t uMemOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool);
1669
1670 // Check to see if the allocation will fit. uPoolSize -
1671 // uMemOffset will not wrap under because of check that
1672 // pMem is in the range of the uPoolSize by check above.
1673 if(uNewSize <= uPoolSize - uMemOffset) {
1674 ReturnValue.ptr = pMem;
1675 ReturnValue.len = uNewSize;
1676
1677 // Addition won't wrap around over because uNewSize was
1678 // checked to be sure it is less than the pool size.
1679 uFreeOffset = uMemOffset + uNewSize32;
1680 }
1681 }
1682 } else {
1683 // ALLOCATION MODE
1684 // uPoolSize - uFreeOffset will not underflow because this
1685 // pool implementation makes sure uFreeOffset is always
1686 // smaller than uPoolSize through this check here and
1687 // reallocation case.
1688 if(uNewSize <= uPoolSize - uFreeOffset) {
1689 ReturnValue.len = uNewSize;
1690 ReturnValue.ptr = (uint8_t *)pPool + uFreeOffset;
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001691 uFreeOffset += (uint32_t)uNewSize;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001692 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001693 }
1694 } else {
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001695 if(pMem) {
1696 // FREE MODE
1697 // Cast is safe because of limit on pool size in
1698 // QCBORDecode_SetMemPool()
1699 uFreeOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool);
1700 } else {
1701 // DESTRUCT MODE
1702 // Nothing to do for this allocator
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001703 }
1704 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001705
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001706 UsefulBuf Pool = {pPool, uPoolSize};
1707 MemPool_Pack(Pool, uFreeOffset);
1708
1709Done:
1710 return ReturnValue;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001711}
1712
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001713
Laurence Lundbladef6531662018-12-04 10:42:22 +09001714/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001715 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladef6531662018-12-04 10:42:22 +09001716 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001717QCBORError QCBORDecode_SetMemPool(QCBORDecodeContext *pMe,
1718 UsefulBuf Pool,
1719 bool bAllStrings)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001720{
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001721 // The pool size and free mem offset are packed into the beginning
1722 // of the pool memory. This compile time check make sure the
1723 // constant in the header is correct. This check should optimize
1724 // down to nothing.
1725 if(QCBOR_DECODE_MIN_MEM_POOL_SIZE < 2 * sizeof(uint32_t)) {
Laurence Lundblade30816f22018-11-10 13:40:22 +07001726 return QCBOR_ERR_BUFFER_TOO_SMALL;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001727 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001728
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001729 // The pool size and free offset packed in to the beginning of pool
1730 // memory are only 32-bits. This check will optimize out on 32-bit
1731 // machines.
1732 if(Pool.len > UINT32_MAX) {
1733 return QCBOR_ERR_BUFFER_TOO_LARGE;
1734 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001735
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001736 // This checks that the pool buffer given is big enough.
1737 if(MemPool_Pack(Pool, QCBOR_DECODE_MIN_MEM_POOL_SIZE)) {
1738 return QCBOR_ERR_BUFFER_TOO_SMALL;
1739 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001740
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001741 pMe->StringAllocator.pfAllocator = MemPool_Function;
1742 pMe->StringAllocator.pAllocateCxt = Pool.ptr;
1743 pMe->bStringAllocateAll = bAllStrings;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001744
Laurence Lundblade30816f22018-11-10 13:40:22 +07001745 return QCBOR_SUCCESS;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001746}