blob: 6accc833dc63171386f95c79c63da9cfac818cc5 [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 Lundblade3ed0bca2020-07-14 22:50:10 -0700574 // The cast to uint16_t is safe because the encoded value
Laurence Lundblade9682a532020-06-06 18:33:04 -0700575 // 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 Lundblade3ed0bca2020-07-14 22:50:10 -0700584 // The cast 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);
Laurence Lundblade3ed0bca2020-07-14 22:50:10 -0700587 pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE;
Laurence Lundblade9682a532020-06-06 18:33:04 -0700588#else
589 pDecodedItem->val.fnum = UsefulBufUtil_CopyUint32ToFloat((uint32_t)uNumber);
590 pDecodedItem->uDataType = QCBOR_TYPE_FLOAT;
591#endif
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700592 break;
593 case DOUBLE_PREC_FLOAT:
594 pDecodedItem->val.dfnum = UsefulBufUtil_CopyUint64ToDouble(uNumber);
Laurence Lundblade67bd5512018-11-02 21:44:06 +0700595 pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE;
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700596 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800597
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700598 case CBOR_SIMPLEV_FALSE: // 20
599 case CBOR_SIMPLEV_TRUE: // 21
600 case CBOR_SIMPLEV_NULL: // 22
601 case CBOR_SIMPLEV_UNDEF: // 23
Laurence Lundblade0f99d692018-09-26 14:39:28 -0700602 case CBOR_SIMPLE_BREAK: // 31
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700603 break; // nothing to do
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800604
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700605 case CBOR_SIMPLEV_ONEBYTE: // 24
606 if(uNumber <= CBOR_SIMPLE_BREAK) {
607 // This takes out f8 00 ... f8 1f which should be encoded as e0 … f7
Laurence Lundblade077475f2019-04-26 09:06:33 -0700608 nReturn = QCBOR_ERR_BAD_TYPE_7;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700609 goto Done;
610 }
Laurence Lundblade5e390822019-01-06 12:35:01 -0800611 /* FALLTHROUGH */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700612 // fall through intentionally
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800613
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700614 default: // 0-19
615 pDecodedItem->uDataType = QCBOR_TYPE_UKNOWN_SIMPLE;
Laurence Lundbladeee851742020-01-08 08:37:05 -0800616 /*
617 DecodeTypeAndNumber will make uNumber equal to
618 uAdditionalInfo when uAdditionalInfo is < 24 This cast is
619 safe because the 2, 4 and 8 byte lengths of uNumber are in
620 the double/float cases above
621 */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700622 pDecodedItem->val.uSimple = (uint8_t)uNumber;
623 break;
624 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800625
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700626Done:
627 return nReturn;
628}
629
630
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700631/*
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530632 Decode text and byte strings. Call the string allocator if asked to.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700633 */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800634inline static QCBORError DecodeBytes(const QCORInternalAllocator *pAllocator,
635 int nMajorType,
636 uint64_t uStrLen,
637 UsefulInputBuf *pUInBuf,
638 QCBORItem *pDecodedItem)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700639{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700640 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800641
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800642 // CBOR lengths can be 64 bits, but size_t is not 64 bits on all CPUs.
643 // This check makes the casts to size_t below safe.
644
645 // 4 bytes less than the largest sizeof() so this can be tested by
646 // putting a SIZE_MAX length in the CBOR test input (no one will
647 // care the limit on strings is 4 bytes shorter).
648 if(uStrLen > SIZE_MAX-4) {
649 nReturn = QCBOR_ERR_STRING_TOO_LONG;
650 goto Done;
651 }
652
653 const UsefulBufC Bytes = UsefulInputBuf_GetUsefulBuf(pUInBuf, (size_t)uStrLen);
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530654 if(UsefulBuf_IsNULLC(Bytes)) {
655 // Failed to get the bytes for this string item
656 nReturn = QCBOR_ERR_HIT_END;
657 goto Done;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700658 }
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530659
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800660 if(pAllocator) {
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530661 // We are asked to use string allocator to make a copy
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800662 UsefulBuf NewMem = StringAllocator_Allocate(pAllocator, (size_t)uStrLen);
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530663 if(UsefulBuf_IsNULL(NewMem)) {
Laurence Lundblade30816f22018-11-10 13:40:22 +0700664 nReturn = QCBOR_ERR_STRING_ALLOCATE;
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530665 goto Done;
666 }
667 pDecodedItem->val.string = UsefulBuf_Copy(NewMem, Bytes);
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800668 pDecodedItem->uDataAlloc = 1;
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530669 } else {
670 // Normal case with no string allocator
671 pDecodedItem->val.string = Bytes;
672 }
Laurence Lundbladeee851742020-01-08 08:37:05 -0800673 const bool bIsBstr = (nMajorType == CBOR_MAJOR_TYPE_BYTE_STRING);
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800674 // Cast because ternary operator causes promotion to integer
675 pDecodedItem->uDataType = (uint8_t)(bIsBstr ? QCBOR_TYPE_BYTE_STRING
676 : QCBOR_TYPE_TEXT_STRING);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800677
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530678Done:
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700679 return nReturn;
680}
681
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700682
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800683
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700684
685
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700686
687
Laurence Lundbladeee851742020-01-08 08:37:05 -0800688// Make sure the constants align as this is assumed by
689// the GetAnItem() implementation
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700690#if QCBOR_TYPE_ARRAY != CBOR_MAJOR_TYPE_ARRAY
691#error QCBOR_TYPE_ARRAY value not lined up with major type
692#endif
693#if QCBOR_TYPE_MAP != CBOR_MAJOR_TYPE_MAP
694#error QCBOR_TYPE_MAP value not lined up with major type
695#endif
696
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700697/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800698 This gets a single data item and decodes it including preceding
699 optional tagging. This does not deal with arrays and maps and nesting
700 except to decode the data item introducing them. Arrays and maps are
701 handled at the next level up in GetNext().
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800702
Laurence Lundbladeee851742020-01-08 08:37:05 -0800703 Errors detected here include: an array that is too long to decode,
704 hit end of buffer unexpectedly, a few forms of invalid encoded CBOR
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700705 */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800706static QCBORError GetNext_Item(UsefulInputBuf *pUInBuf,
707 QCBORItem *pDecodedItem,
708 const QCORInternalAllocator *pAllocator)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700709{
Laurence Lundblade30816f22018-11-10 13:40:22 +0700710 QCBORError nReturn;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800711
Laurence Lundbladeee851742020-01-08 08:37:05 -0800712 /*
713 Get the major type and the number. Number could be length of more
714 bytes or the value depending on the major type nAdditionalInfo is
715 an encoding of the length of the uNumber and is needed to decode
716 floats and doubles
717 */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800718 int nMajorType;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700719 uint64_t uNumber;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800720 int nAdditionalInfo;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800721
Laurence Lundblade4b09f632019-10-09 14:34:59 -0700722 memset(pDecodedItem, 0, sizeof(QCBORItem));
723
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800724 nReturn = DecodeTypeAndNumber(pUInBuf, &nMajorType, &uNumber, &nAdditionalInfo);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800725
Laurence Lundbladeee851742020-01-08 08:37:05 -0800726 // Error out here if we got into trouble on the type and number. The
727 // code after this will not work if the type and number is not good.
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700728 if(nReturn) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700729 goto Done;
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700730 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800731
Laurence Lundbladeee851742020-01-08 08:37:05 -0800732 // At this point the major type and the value are valid. We've got
733 // the type and the number that starts every CBOR data item.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800734 switch (nMajorType) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700735 case CBOR_MAJOR_TYPE_POSITIVE_INT: // Major type 0
736 case CBOR_MAJOR_TYPE_NEGATIVE_INT: // Major type 1
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800737 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700738 nReturn = QCBOR_ERR_BAD_INT;
739 } else {
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800740 nReturn = DecodeInteger(nMajorType, uNumber, pDecodedItem);
Laurence Lundblade3a6042e2019-06-28 19:58:04 -0700741 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700742 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800743
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700744 case CBOR_MAJOR_TYPE_BYTE_STRING: // Major type 2
745 case CBOR_MAJOR_TYPE_TEXT_STRING: // Major type 3
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800746 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
747 const bool bIsBstr = (nMajorType == CBOR_MAJOR_TYPE_BYTE_STRING);
748 pDecodedItem->uDataType = (uint8_t)(bIsBstr ? QCBOR_TYPE_BYTE_STRING
749 : QCBOR_TYPE_TEXT_STRING);
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530750 pDecodedItem->val.string = (UsefulBufC){NULL, SIZE_MAX};
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700751 } else {
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800752 nReturn = DecodeBytes(pAllocator, nMajorType, uNumber, pUInBuf, pDecodedItem);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700753 }
754 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800755
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700756 case CBOR_MAJOR_TYPE_ARRAY: // Major type 4
757 case CBOR_MAJOR_TYPE_MAP: // Major type 5
758 // Record the number of items in the array or map
759 if(uNumber > QCBOR_MAX_ITEMS_IN_ARRAY) {
760 nReturn = QCBOR_ERR_ARRAY_TOO_LONG;
761 goto Done;
762 }
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800763 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundbladea44d5062018-10-17 18:45:12 +0530764 pDecodedItem->val.uCount = UINT16_MAX; // Indicate indefinite length
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700765 } else {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800766 // type conversion OK because of check above
767 pDecodedItem->val.uCount = (uint16_t)uNumber;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700768 }
Laurence Lundbladeee851742020-01-08 08:37:05 -0800769 // C preproc #if above makes sure constants for major types align
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800770 // DecodeTypeAndNumber never returns a major type > 7 so cast is safe
771 pDecodedItem->uDataType = (uint8_t)nMajorType;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700772 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800773
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700774 case CBOR_MAJOR_TYPE_OPTIONAL: // Major type 6, optional prepended tags
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800775 if(nAdditionalInfo == LEN_IS_INDEFINITE) {
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700776 nReturn = QCBOR_ERR_BAD_INT;
777 } else {
778 pDecodedItem->val.uTagV = uNumber;
779 pDecodedItem->uDataType = QCBOR_TYPE_OPTTAG;
780 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700781 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800782
Laurence Lundbladeee851742020-01-08 08:37:05 -0800783 case CBOR_MAJOR_TYPE_SIMPLE:
784 // Major type 7, float, double, true, false, null...
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800785 nReturn = DecodeSimple(nAdditionalInfo, uNumber, pDecodedItem);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700786 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800787
Laurence Lundbladeee851742020-01-08 08:37:05 -0800788 default:
789 // Never happens because DecodeTypeAndNumber() should never return > 7
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700790 nReturn = QCBOR_ERR_UNSUPPORTED;
791 break;
792 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800793
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700794Done:
795 return nReturn;
796}
797
798
799
800/*
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800801 This layer deals with indefinite length strings. It pulls all the
Laurence Lundbladeee851742020-01-08 08:37:05 -0800802 individual chunk items together into one QCBORItem using the string
803 allocator.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800804
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530805 Code Reviewers: THIS FUNCTION DOES A LITTLE POINTER MATH
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700806 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800807static inline QCBORError
808GetNext_FullItem(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700809{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700810 // Stack usage; int/ptr 2 UsefulBuf 2 QCBORItem -- 96
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700811
812 // Get pointer to string allocator. First use is to pass it to
813 // GetNext_Item() when option is set to allocate for *every* string.
814 // Second use here is to allocate space to coallese indefinite
815 // length string items into one.
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800816 const QCORInternalAllocator *pAllocator = me->StringAllocator.pfAllocator ?
817 &(me->StringAllocator) :
818 NULL;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800819
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700820 QCBORError nReturn;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800821 nReturn = GetNext_Item(&(me->InBuf),
822 pDecodedItem,
823 me->bStringAllocateAll ? pAllocator: NULL);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700824 if(nReturn) {
825 goto Done;
826 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800827
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700828 // To reduce code size by removing support for indefinite length strings, the
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530829 // code in this function from here down can be eliminated. Run tests, except
830 // indefinite length string tests, to be sure all is OK if this is removed.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800831
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800832 // Only do indefinite length processing on strings
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700833 const uint8_t uStringType = pDecodedItem->uDataType;
834 if(uStringType!= QCBOR_TYPE_BYTE_STRING && uStringType != QCBOR_TYPE_TEXT_STRING) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700835 goto Done; // no need to do any work here on non-string types
836 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800837
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800838 // Is this a string with an indefinite length?
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530839 if(pDecodedItem->val.string.len != SIZE_MAX) {
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800840 goto Done; // length is not indefinite, so no work to do here
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700841 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800842
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530843 // Can't do indefinite length strings without a string allocator
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800844 if(pAllocator == NULL) {
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700845 nReturn = QCBOR_ERR_NO_STRING_ALLOCATOR;
846 goto Done;
847 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800848
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700849 // Loop getting chunk of indefinite string
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700850 UsefulBufC FullString = NULLUsefulBufC;
851
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700852 for(;;) {
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700853 // Get item for next chunk
854 QCBORItem StringChunkItem;
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700855 // NULL string allocator passed here. Do not need to allocate
856 // chunks even if bStringAllocateAll is set.
Laurence Lundbladefae26bf2019-02-18 11:15:43 -0800857 nReturn = GetNext_Item(&(me->InBuf), &StringChunkItem, NULL);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700858 if(nReturn) {
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700859 break; // Error getting the next chunk
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700860 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800861
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530862 // See if it is a marker at end of indefinite length string
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700863 if(StringChunkItem.uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundblade20b533d2018-10-08 20:44:53 +0800864 // String is complete
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700865 pDecodedItem->val.string = FullString;
Laurence Lundblade57dd1442018-10-15 20:26:28 +0530866 pDecodedItem->uDataAlloc = 1;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700867 break;
868 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800869
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700870 // Match data type of chunk to type at beginning.
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530871 // Also catches error of other non-string types that don't belong.
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700872 // Also catches indefinite length strings inside indefinite length strings
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800873 if(StringChunkItem.uDataType != uStringType ||
874 StringChunkItem.val.string.len == SIZE_MAX) {
Laurence Lundblade30816f22018-11-10 13:40:22 +0700875 nReturn = QCBOR_ERR_INDEFINITE_STRING_CHUNK;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700876 break;
877 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800878
Laurence Lundblade471a3fd2018-10-18 21:27:45 +0530879 // Alloc new buffer or expand previously allocated buffer so it can fit
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800880 // The first time throurgh FullString.ptr is NULL and this is
881 // equivalent to StringAllocator_Allocate()
882 UsefulBuf NewMem = StringAllocator_Reallocate(pAllocator,
883 UNCONST_POINTER(FullString.ptr),
884 FullString.len + StringChunkItem.val.string.len);
885
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700886 if(UsefulBuf_IsNULL(NewMem)) {
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +0530887 // Allocation of memory for the string failed
Laurence Lundblade30816f22018-11-10 13:40:22 +0700888 nReturn = QCBOR_ERR_STRING_ALLOCATE;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700889 break;
890 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800891
Laurence Lundblade2a6850e2018-10-28 20:13:44 +0700892 // Copy new string chunk at the end of string so far.
893 FullString = UsefulBuf_CopyOffset(NewMem, FullString.len, StringChunkItem.val.string);
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700894 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800895
Laurence Lundblade1d7eb632019-02-17 17:23:38 -0800896 if(nReturn != QCBOR_SUCCESS && !UsefulBuf_IsNULLC(FullString)) {
897 // Getting the item failed, clean up the allocated memory
898 StringAllocator_Free(pAllocator, UNCONST_POINTER(FullString.ptr));
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700899 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800900
Laurence Lundbladed6dfe6d2020-04-09 10:21:36 -0700901Done:
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700902 return nReturn;
903}
904
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700905
906/*
Laurence Lundblade59289e52019-12-30 13:44:37 -0800907 Gets all optional tag data items preceding a data item that is not an
908 optional tag and records them as bits in the tag map.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700909 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800910static QCBORError
911GetNext_TaggedItem(QCBORDecodeContext *me,
912 QCBORItem *pDecodedItem,
913 QCBORTagListOut *pTags)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700914{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700915 // Stack usage: int/ptr: 3 -- 24
Laurence Lundblade30816f22018-11-10 13:40:22 +0700916 QCBORError nReturn;
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700917 uint64_t uTagBits = 0;
918 if(pTags) {
919 pTags->uNumUsed = 0;
Laurence Lundblade041ffa52018-10-07 11:43:51 +0700920 }
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700921
Laurence Lundblade59289e52019-12-30 13:44:37 -0800922 // Loop fetching items until the item fetched is not a tag
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700923 for(;;) {
924 nReturn = GetNext_FullItem(me, pDecodedItem);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700925 if(nReturn) {
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700926 goto Done; // Error out of the loop
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700927 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800928
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700929 if(pDecodedItem->uDataType != QCBOR_TYPE_OPTTAG) {
930 // Successful exit from loop; maybe got some tags, maybe not
931 pDecodedItem->uTagBits = uTagBits;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700932 break;
933 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800934
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700935 uint8_t uTagBitIndex;
936 // Tag was mapped, tag was not mapped, error with tag list
937 switch(TagMapper_Lookup(me->pCallerConfiguredTagList, pDecodedItem->val.uTagV, &uTagBitIndex)) {
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800938
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700939 case QCBOR_SUCCESS:
940 // Successfully mapped the tag
941 uTagBits |= 0x01ULL << uTagBitIndex;
942 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800943
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700944 case QCBOR_ERR_BAD_OPT_TAG:
945 // Tag is not recognized. Do nothing
946 break;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800947
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700948 default:
949 // Error Condition
950 goto Done;
951 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800952
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700953 if(pTags) {
954 // Caller wants all tags recorded in the provided buffer
955 if(pTags->uNumUsed >= pTags->uNumAllocated) {
956 nReturn = QCBOR_ERR_TOO_MANY_TAGS;
957 goto Done;
958 }
959 pTags->puTags[pTags->uNumUsed] = pDecodedItem->val.uTagV;
960 pTags->uNumUsed++;
961 }
962 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800963
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700964Done:
965 return nReturn;
966}
967
968
969/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800970 This layer takes care of map entries. It combines the label and data
971 items into one QCBORItem.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700972 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800973static inline QCBORError
974GetNext_MapEntry(QCBORDecodeContext *me,
975 QCBORItem *pDecodedItem,
976 QCBORTagListOut *pTags)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700977{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700978 // Stack use: int/ptr 1, QCBORItem -- 56
Laurence Lundblade30816f22018-11-10 13:40:22 +0700979 QCBORError nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700980 if(nReturn)
981 goto Done;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800982
Laurence Lundblade742df4a2018-10-13 20:07:17 +0800983 if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundbladedbe6f212018-10-28 11:37:53 +0700984 // Break can't be a map entry
Laurence Lundblade742df4a2018-10-13 20:07:17 +0800985 goto Done;
986 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800987
Laurence Lundbladed61cbf32018-12-09 11:42:21 -0800988 if(me->uDecodeMode != QCBOR_DECODE_MODE_MAP_AS_ARRAY) {
989 // In a map and caller wants maps decoded, not treated as arrays
990
991 if(DecodeNesting_TypeIsMap(&(me->nesting))) {
992 // If in a map and the right decoding mode, get the label
993
Laurence Lundbladeee851742020-01-08 08:37:05 -0800994 // Save label in pDecodedItem and get the next which will
995 // be the real data
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +0900996 QCBORItem LabelItem = *pDecodedItem;
997 nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags);
998 if(nReturn)
999 goto Done;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001000
Laurence Lundblade57dd1442018-10-15 20:26:28 +05301001 pDecodedItem->uLabelAlloc = LabelItem.uDataAlloc;
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +09001002
1003 if(LabelItem.uDataType == QCBOR_TYPE_TEXT_STRING) {
1004 // strings are always good labels
1005 pDecodedItem->label.string = LabelItem.val.string;
1006 pDecodedItem->uLabelType = QCBOR_TYPE_TEXT_STRING;
1007 } else if (QCBOR_DECODE_MODE_MAP_STRINGS_ONLY == me->uDecodeMode) {
Laurence Lundbladeee851742020-01-08 08:37:05 -08001008 // It's not a string and we only want strings
Laurence Lundbladeccfb8cd2018-12-07 21:11:30 +09001009 nReturn = QCBOR_ERR_MAP_LABEL_TYPE;
1010 goto Done;
1011 } else if(LabelItem.uDataType == QCBOR_TYPE_INT64) {
1012 pDecodedItem->label.int64 = LabelItem.val.int64;
1013 pDecodedItem->uLabelType = QCBOR_TYPE_INT64;
1014 } else if(LabelItem.uDataType == QCBOR_TYPE_UINT64) {
1015 pDecodedItem->label.uint64 = LabelItem.val.uint64;
1016 pDecodedItem->uLabelType = QCBOR_TYPE_UINT64;
1017 } else if(LabelItem.uDataType == QCBOR_TYPE_BYTE_STRING) {
1018 pDecodedItem->label.string = LabelItem.val.string;
1019 pDecodedItem->uLabelAlloc = LabelItem.uDataAlloc;
1020 pDecodedItem->uLabelType = QCBOR_TYPE_BYTE_STRING;
1021 } else {
1022 // label is not an int or a string. It is an arrray
1023 // or a float or such and this implementation doesn't handle that.
1024 // Also, tags on labels are ignored.
1025 nReturn = QCBOR_ERR_MAP_LABEL_TYPE;
1026 goto Done;
1027 }
Laurence Lundbladed61cbf32018-12-09 11:42:21 -08001028 }
1029 } else {
1030 if(pDecodedItem->uDataType == QCBOR_TYPE_MAP) {
Laurence Lundbladee6bcef12020-04-01 10:56:27 -07001031 if(pDecodedItem->val.uCount > QCBOR_MAX_ITEMS_IN_ARRAY/2) {
1032 nReturn = QCBOR_ERR_ARRAY_TOO_LONG;
1033 goto Done;
1034 }
Laurence Lundbladed61cbf32018-12-09 11:42:21 -08001035 // Decoding a map as an array
1036 pDecodedItem->uDataType = QCBOR_TYPE_MAP_AS_ARRAY;
Laurence Lundbladee6bcef12020-04-01 10:56:27 -07001037 // Cast is safe because of check against QCBOR_MAX_ITEMS_IN_ARRAY/2
1038 // Cast is needed because of integer promotion
1039 pDecodedItem->val.uCount = (uint16_t)(pDecodedItem->val.uCount * 2);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001040 }
1041 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001042
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001043Done:
1044 return nReturn;
1045}
1046
1047
1048/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001049 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001050 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001051QCBORError QCBORDecode_GetNextMapOrArray(QCBORDecodeContext *me,
1052 QCBORItem *pDecodedItem,
1053 QCBORTagListOut *pTags)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001054{
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001055 // Stack ptr/int: 2, QCBORItem : 64
1056
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301057 // The public entry point for fetching and parsing the next QCBORItem.
1058 // All the CBOR parsing work is here and in subordinate calls.
Laurence Lundblade30816f22018-11-10 13:40:22 +07001059 QCBORError nReturn;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001060
Laurence Lundbladebb1062e2019-08-12 23:28:54 -07001061 // Check if there are an
1062 if(UsefulInputBuf_BytesUnconsumed(&(me->InBuf)) == 0 && !DecodeNesting_IsNested(&(me->nesting))) {
1063 nReturn = QCBOR_ERR_NO_MORE_ITEMS;
1064 goto Done;
1065 }
1066
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001067 nReturn = GetNext_MapEntry(me, pDecodedItem, pTags);
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001068 if(nReturn) {
1069 goto Done;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001070 }
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301071
1072 // Break ending arrays/maps are always processed at the end of this function.
1073 // They should never show up here.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301074 if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) {
Laurence Lundblade6de37062018-10-15 12:22:42 +05301075 nReturn = QCBOR_ERR_BAD_BREAK;
1076 goto Done;
Laurence Lundblade5b8c5852018-10-14 21:11:42 +05301077 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001078
Laurence Lundblade6de37062018-10-15 12:22:42 +05301079 // Record the nesting level for this data item before processing any of
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301080 // decrementing and descending.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301081 pDecodedItem->uNestingLevel = DecodeNesting_GetLevel(&(me->nesting));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001082
Laurence Lundblade6de37062018-10-15 12:22:42 +05301083 // Process the item just received for descent or decrement, and
1084 // ascent if decrements are enough to close out a definite length array/map
Laurence Lundblade3a760b02018-10-08 13:46:03 +08001085 if(IsMapOrArray(pDecodedItem->uDataType)) {
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001086 // If the new item is array or map, the nesting level descends
Laurence Lundblade3a760b02018-10-08 13:46:03 +08001087 nReturn = DecodeNesting_Descend(&(me->nesting), pDecodedItem);
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001088 // Maps and arrays do count in as items in the map/array that encloses
1089 // them so a decrement needs to be done for them too, but that is done
1090 // only when all the items in them have been processed, not when they
Laurence Lundblade9916b1b2019-09-07 22:33:25 -07001091 // are opened with the exception of an empty map or array.
1092 if(pDecodedItem->val.uCount == 0) {
1093 DecodeNesting_DecrementCount(&(me->nesting));
1094 }
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001095 } else {
1096 // Decrement the count of items in the enclosing map/array
1097 // If the count in the enclosing map/array goes to zero, that
Laurence Lundblade6de37062018-10-15 12:22:42 +05301098 // triggers a decrement in the map/array above that and
1099 // an ascend in nesting level.
Laurence Lundblade9e3651c2018-10-10 11:49:55 +08001100 DecodeNesting_DecrementCount(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001101 }
Laurence Lundblade6de37062018-10-15 12:22:42 +05301102 if(nReturn) {
1103 goto Done;
1104 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001105
Laurence Lundblade6de37062018-10-15 12:22:42 +05301106 // For indefinite length maps/arrays, looking at any and
1107 // all breaks that might terminate them. The equivalent
1108 // for definite length maps/arrays happens in
1109 // DecodeNesting_DecrementCount().
1110 if(DecodeNesting_IsNested(&(me->nesting)) && DecodeNesting_IsIndefiniteLength(&(me->nesting))) {
1111 while(UsefulInputBuf_BytesUnconsumed(&(me->InBuf))) {
1112 // Peek forward one item to see if it is a break.
1113 QCBORItem Peek;
1114 size_t uPeek = UsefulInputBuf_Tell(&(me->InBuf));
1115 nReturn = GetNext_Item(&(me->InBuf), &Peek, NULL);
1116 if(nReturn) {
1117 goto Done;
1118 }
1119 if(Peek.uDataType != QCBOR_TYPE_BREAK) {
1120 // It is not a break, rewind so it can be processed normally.
1121 UsefulInputBuf_Seek(&(me->InBuf), uPeek);
1122 break;
1123 }
1124 // It is a break. Ascend one nesting level.
Laurence Lundblade7e0d13b2018-10-16 19:54:13 +05301125 // The break is consumed.
Laurence Lundblade6de37062018-10-15 12:22:42 +05301126 nReturn = DecodeNesting_BreakAscend(&(me->nesting));
1127 if(nReturn) {
1128 // break occured outside of an indefinite length array/map
1129 goto Done;
1130 }
1131 }
1132 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001133
Laurence Lundblade6de37062018-10-15 12:22:42 +05301134 // Tell the caller what level is next. This tells them what maps/arrays
1135 // were closed out and makes it possible for them to reconstruct
1136 // the tree with just the information returned by GetNext
1137 pDecodedItem->uNextNestLevel = DecodeNesting_GetLevel(&(me->nesting));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001138
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001139Done:
Laurence Lundbladee9482dd2019-10-11 12:58:46 -07001140 if(nReturn != QCBOR_SUCCESS) {
1141 // Make sure uDataType and uLabelType are QCBOR_TYPE_NONE
1142 memset(pDecodedItem, 0, sizeof(QCBORItem));
1143 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001144 return nReturn;
1145}
1146
1147
Laurence Lundblade59289e52019-12-30 13:44:37 -08001148/*
1149 Mostly just assign the right data type for the date string.
1150 */
1151inline static QCBORError DecodeDateString(QCBORItem *pDecodedItem)
1152{
1153 // Stack Use: UsefulBuf 1 16
1154 if(pDecodedItem->uDataType != QCBOR_TYPE_TEXT_STRING) {
1155 return QCBOR_ERR_BAD_OPT_TAG;
1156 }
1157
1158 const UsefulBufC Temp = pDecodedItem->val.string;
1159 pDecodedItem->val.dateString = Temp;
1160 pDecodedItem->uDataType = QCBOR_TYPE_DATE_STRING;
1161 return QCBOR_SUCCESS;
1162}
1163
1164
1165/*
1166 Mostly just assign the right data type for the bignum.
1167 */
1168inline static QCBORError DecodeBigNum(QCBORItem *pDecodedItem)
1169{
1170 // Stack Use: UsefulBuf 1 -- 16
1171 if(pDecodedItem->uDataType != QCBOR_TYPE_BYTE_STRING) {
1172 return QCBOR_ERR_BAD_OPT_TAG;
1173 }
1174 const UsefulBufC Temp = pDecodedItem->val.string;
1175 pDecodedItem->val.bigNum = Temp;
Laurence Lundbladeee851742020-01-08 08:37:05 -08001176 const bool bIsPosBigNum = (bool)(pDecodedItem->uTagBits & QCBOR_TAGFLAG_POS_BIGNUM);
Laurence Lundbladec5fef682020-01-25 11:38:45 -08001177 pDecodedItem->uDataType = (uint8_t)(bIsPosBigNum ? QCBOR_TYPE_POSBIGNUM
1178 : QCBOR_TYPE_NEGBIGNUM);
Laurence Lundblade59289e52019-12-30 13:44:37 -08001179 return QCBOR_SUCCESS;
1180}
1181
1182
1183/*
Laurence Lundbladeee851742020-01-08 08:37:05 -08001184 The epoch formatted date. Turns lots of different forms of encoding
1185 date into uniform one
Laurence Lundblade59289e52019-12-30 13:44:37 -08001186 */
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001187static QCBORError DecodeDateEpoch(QCBORItem *pDecodedItem)
Laurence Lundblade59289e52019-12-30 13:44:37 -08001188{
1189 // Stack usage: 1
1190 QCBORError nReturn = QCBOR_SUCCESS;
1191
1192 pDecodedItem->val.epochDate.fSecondsFraction = 0;
1193
1194 switch (pDecodedItem->uDataType) {
1195
1196 case QCBOR_TYPE_INT64:
1197 pDecodedItem->val.epochDate.nSeconds = pDecodedItem->val.int64;
1198 break;
1199
1200 case QCBOR_TYPE_UINT64:
1201 if(pDecodedItem->val.uint64 > INT64_MAX) {
1202 nReturn = QCBOR_ERR_DATE_OVERFLOW;
1203 goto Done;
1204 }
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001205 pDecodedItem->val.epochDate.nSeconds = (int64_t)pDecodedItem->val.uint64;
Laurence Lundblade59289e52019-12-30 13:44:37 -08001206 break;
1207
Laurence Lundblade9682a532020-06-06 18:33:04 -07001208 // TODO: test this with float and half input
Laurence Lundblade59289e52019-12-30 13:44:37 -08001209 case QCBOR_TYPE_DOUBLE:
Laurence Lundblade9682a532020-06-06 18:33:04 -07001210 case QCBOR_TYPE_FLOAT:
1211#ifndef QCBOR_DISABLE_FLOAT_HW_USE
Laurence Lundblade59289e52019-12-30 13:44:37 -08001212 {
1213 // This comparison needs to be done as a float before
1214 // conversion to an int64_t to be able to detect doubles
1215 // that are too large to fit into an int64_t. A double
1216 // has 52 bits of preceision. An int64_t has 63. Casting
1217 // INT64_MAX to a double actually causes a round up which
1218 // is bad and wrong for the comparison because it will
1219 // allow conversion of doubles that can't fit into a
1220 // uint64_t. To remedy this INT64_MAX - 0x7ff is used as
Laurence Lundblade9682a532020-06-06 18:33:04 -07001221 // the cutoff point because if that value rounds up in conversion to
Laurence Lundblade59289e52019-12-30 13:44:37 -08001222 // double it will still be less than INT64_MAX. 0x7ff is
1223 // picked because it has 11 bits set.
1224 //
1225 // INT64_MAX seconds is on the order of 10 billion years,
1226 // and the earth is less than 5 billion years old, so for
1227 // most uses this conversion error won't occur even though
1228 // doubles can go much larger.
1229 //
1230 // Without the 0x7ff there is a ~30 minute range of time
1231 // values 10 billion years in the past and in the future
Laurence Lundblade9682a532020-06-06 18:33:04 -07001232 // where this this code would go wrong and some compilers
1233 // will generate warnings or errors.
Laurence Lundblade3ed0bca2020-07-14 22:50:10 -07001234 const double d = pDecodedItem->uDataType == QCBOR_TYPE_DOUBLE ?
1235 pDecodedItem->val.dfnum :
1236 (double)pDecodedItem->val.fnum;
Laurence Lundblade59289e52019-12-30 13:44:37 -08001237 if(d > (double)(INT64_MAX - 0x7ff)) {
1238 nReturn = QCBOR_ERR_DATE_OVERFLOW;
1239 goto Done;
1240 }
1241 pDecodedItem->val.epochDate.nSeconds = (int64_t)d;
Laurence Lundblade2feb1e12020-07-15 03:50:45 -07001242 pDecodedItem->val.epochDate.fSecondsFraction =
1243 d - (double)pDecodedItem->val.epochDate.nSeconds;
Laurence Lundblade59289e52019-12-30 13:44:37 -08001244 }
Laurence Lundblade9682a532020-06-06 18:33:04 -07001245#else
1246 /* Disabling float support causes a floating point
1247 data to error in the default below. The above code
1248 requires floating point conversion to integers and
1249 comparison which requires either floating point HW
1250 or a SW library. */
Laurence Lundblade9682a532020-06-06 18:33:04 -07001251 nReturn = QCBOR_ERR_FLOAT_DATE_UNSUPPORTED;
1252#endif /* QCBOR_DISABLE_FLOAT_HW_USE */
Laurence Lundblade59289e52019-12-30 13:44:37 -08001253 break;
1254
Laurence Lundblade9682a532020-06-06 18:33:04 -07001255
Laurence Lundblade59289e52019-12-30 13:44:37 -08001256 default:
1257 nReturn = QCBOR_ERR_BAD_OPT_TAG;
1258 goto Done;
1259 }
1260 pDecodedItem->uDataType = QCBOR_TYPE_DATE_EPOCH;
1261
1262Done:
1263 return nReturn;
1264}
1265
1266
1267#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1268/*
1269 Decode decimal fractions and big floats.
1270
1271 When called pDecodedItem must be the array that is tagged as a big
1272 float or decimal fraction, the array that has the two members, the
1273 exponent and mantissa.
1274
1275 This will fetch and decode the exponent and mantissa and put the
1276 result back into pDecodedItem.
1277 */
1278inline static QCBORError
1279QCBORDecode_MantissaAndExponent(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
1280{
1281 QCBORError nReturn;
1282
1283 // --- Make sure it is an array; track nesting level of members ---
1284 if(pDecodedItem->uDataType != QCBOR_TYPE_ARRAY) {
1285 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1286 goto Done;
1287 }
1288
1289 // A check for pDecodedItem->val.uCount == 2 would work for
Laurence Lundbladeee851742020-01-08 08:37:05 -08001290 // definite length arrays, but not for indefnite. Instead remember
1291 // the nesting level the two integers must be at, which is one
1292 // deeper than that of the array.
Laurence Lundblade59289e52019-12-30 13:44:37 -08001293 const int nNestLevel = pDecodedItem->uNestingLevel + 1;
1294
1295 // --- Is it a decimal fraction or a bigfloat? ---
1296 const bool bIsTaggedDecimalFraction = QCBORDecode_IsTagged(me, pDecodedItem, CBOR_TAG_DECIMAL_FRACTION);
1297 pDecodedItem->uDataType = bIsTaggedDecimalFraction ? QCBOR_TYPE_DECIMAL_FRACTION : QCBOR_TYPE_BIGFLOAT;
1298
1299 // --- Get the exponent ---
1300 QCBORItem exponentItem;
1301 nReturn = QCBORDecode_GetNextMapOrArray(me, &exponentItem, NULL);
1302 if(nReturn != QCBOR_SUCCESS) {
1303 goto Done;
1304 }
1305 if(exponentItem.uNestingLevel != nNestLevel) {
1306 // Array is empty or a map/array encountered when expecting an int
1307 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1308 goto Done;
1309 }
1310 if(exponentItem.uDataType == QCBOR_TYPE_INT64) {
1311 // Data arriving as an unsigned int < INT64_MAX has been converted
1312 // to QCBOR_TYPE_INT64 and thus handled here. This is also means
1313 // that the only data arriving here of type QCBOR_TYPE_UINT64 data
1314 // will be too large for this to handle and thus an error that will
1315 // get handled in the next else.
1316 pDecodedItem->val.expAndMantissa.nExponent = exponentItem.val.int64;
1317 } else {
1318 // Wrong type of exponent or a QCBOR_TYPE_UINT64 > INT64_MAX
1319 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1320 goto Done;
1321 }
1322
1323 // --- Get the mantissa ---
1324 QCBORItem mantissaItem;
1325 nReturn = QCBORDecode_GetNextWithTags(me, &mantissaItem, NULL);
1326 if(nReturn != QCBOR_SUCCESS) {
1327 goto Done;
1328 }
1329 if(mantissaItem.uNestingLevel != nNestLevel) {
1330 // Mantissa missing or map/array encountered when expecting number
1331 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1332 goto Done;
1333 }
1334 if(mantissaItem.uDataType == QCBOR_TYPE_INT64) {
1335 // Data arriving as an unsigned int < INT64_MAX has been converted
1336 // to QCBOR_TYPE_INT64 and thus handled here. This is also means
1337 // that the only data arriving here of type QCBOR_TYPE_UINT64 data
1338 // will be too large for this to handle and thus an error that
1339 // will get handled in an else below.
1340 pDecodedItem->val.expAndMantissa.Mantissa.nInt = mantissaItem.val.int64;
1341 } else if(mantissaItem.uDataType == QCBOR_TYPE_POSBIGNUM || mantissaItem.uDataType == QCBOR_TYPE_NEGBIGNUM) {
1342 // Got a good big num mantissa
1343 pDecodedItem->val.expAndMantissa.Mantissa.bigNum = mantissaItem.val.bigNum;
1344 // Depends on numbering of QCBOR_TYPE_XXX
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001345 pDecodedItem->uDataType = (uint8_t)(pDecodedItem->uDataType +
1346 mantissaItem.uDataType - QCBOR_TYPE_POSBIGNUM +
1347 1);
Laurence Lundblade59289e52019-12-30 13:44:37 -08001348 } else {
1349 // Wrong type of mantissa or a QCBOR_TYPE_UINT64 > INT64_MAX
1350 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1351 goto Done;
1352 }
1353
1354 // --- Check that array only has the two numbers ---
1355 if(mantissaItem.uNextNestLevel == nNestLevel) {
1356 // Extra items in the decimal fraction / big num
1357 nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA;
1358 goto Done;
1359 }
1360
1361Done:
1362
1363 return nReturn;
1364}
1365#endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */
1366
1367
1368/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001369 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade59289e52019-12-30 13:44:37 -08001370 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001371QCBORError
1372QCBORDecode_GetNextWithTags(QCBORDecodeContext *me,
1373 QCBORItem *pDecodedItem,
1374 QCBORTagListOut *pTags)
Laurence Lundblade59289e52019-12-30 13:44:37 -08001375{
1376 QCBORError nReturn;
1377
1378 nReturn = QCBORDecode_GetNextMapOrArray(me, pDecodedItem, pTags);
1379 if(nReturn != QCBOR_SUCCESS) {
1380 goto Done;
1381 }
1382
1383#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1384#define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_SIX
1385#else
1386#define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_FOUR
1387#endif
1388
1389 // Only pay attention to tags this code knows how to decode.
1390 switch(pDecodedItem->uTagBits & TAG_MAPPER_FIRST_XXX) {
1391 case 0:
1392 // No tags at all or none we know about. Nothing to do.
1393 // This is the pass-through path of this function
1394 // that will mostly be taken when decoding any item.
1395 break;
1396
1397 case QCBOR_TAGFLAG_DATE_STRING:
1398 nReturn = DecodeDateString(pDecodedItem);
1399 break;
1400
1401 case QCBOR_TAGFLAG_DATE_EPOCH:
1402 nReturn = DecodeDateEpoch(pDecodedItem);
1403 break;
1404
1405 case QCBOR_TAGFLAG_POS_BIGNUM:
1406 case QCBOR_TAGFLAG_NEG_BIGNUM:
1407 nReturn = DecodeBigNum(pDecodedItem);
1408 break;
1409
1410#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
1411 case QCBOR_TAGFLAG_DECIMAL_FRACTION:
1412 case QCBOR_TAGFLAG_BIGFLOAT:
1413 // For aggregate tagged types, what goes into pTags is only collected
1414 // from the surrounding data item, not the contents, so pTags is not
1415 // passed on here.
1416
1417 nReturn = QCBORDecode_MantissaAndExponent(me, pDecodedItem);
1418 break;
1419#endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */
1420
1421 default:
1422 // Encountering some mixed-up CBOR like something that
1423 // is tagged as both a string and integer date.
1424 nReturn = QCBOR_ERR_BAD_OPT_TAG;
1425 }
1426
1427Done:
1428 if(nReturn != QCBOR_SUCCESS) {
1429 pDecodedItem->uDataType = QCBOR_TYPE_NONE;
1430 pDecodedItem->uLabelType = QCBOR_TYPE_NONE;
1431 }
1432 return nReturn;
1433}
1434
1435
1436/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001437 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundblade59289e52019-12-30 13:44:37 -08001438 */
Laurence Lundblade30816f22018-11-10 13:40:22 +07001439QCBORError QCBORDecode_GetNext(QCBORDecodeContext *me, QCBORItem *pDecodedItem)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001440{
1441 return QCBORDecode_GetNextWithTags(me, pDecodedItem, NULL);
1442}
1443
1444
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001445/*
Laurence Lundblade6de37062018-10-15 12:22:42 +05301446 Decoding items is done in 5 layered functions, one calling the
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301447 next one down. If a layer has no work to do for a particular item
1448 it returns quickly.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001449
Laurence Lundblade59289e52019-12-30 13:44:37 -08001450 - QCBORDecode_GetNext, GetNextWithTags -- The top layer processes
1451 tagged data items, turning them into the local C representation.
1452 For the most simple it is just associating a QCBOR_TYPE with the data. For
1453 the complex ones that an aggregate of data items, there is some further
1454 decoding and a little bit of recursion.
1455
1456 - QCBORDecode_GetNextMapOrArray - This manages the beginnings and
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301457 ends of maps and arrays. It tracks descending into and ascending
Laurence Lundblade6de37062018-10-15 12:22:42 +05301458 out of maps/arrays. It processes all breaks that terminate
1459 maps and arrays.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001460
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301461 - GetNext_MapEntry -- This handles the combining of two
1462 items, the label and the data, that make up a map entry.
1463 It only does work on maps. It combines the label and data
1464 items into one labeled item.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001465
Laurence Lundblade59289e52019-12-30 13:44:37 -08001466 - GetNext_TaggedItem -- This decodes type 6 tagging. It turns the
1467 tags into bit flags associated with the data item. No actual decoding
1468 of the contents of the tagged item is performed here.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001469
Laurence Lundblade59289e52019-12-30 13:44:37 -08001470 - GetNext_FullItem -- This assembles the sub-items that make up
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301471 an indefinte length string into one string item. It uses the
Laurence Lundblade6de37062018-10-15 12:22:42 +05301472 string allocater to create contiguous space for the item. It
1473 processes all breaks that are part of indefinite length strings.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001474
Laurence Lundblade59289e52019-12-30 13:44:37 -08001475 - GetNext_Item -- This decodes the atomic data items in CBOR. Each
1476 atomic data item has a "major type", an integer "argument" and optionally
1477 some content. For text and byte strings, the content is the bytes
1478 that make up the string. These are the smallest data items that are
1479 considered to be well-formed. The content may also be other data items in
1480 the case of aggregate types. They are not handled in this layer.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001481
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001482 Roughly this takes 300 bytes of stack for vars. Need to
1483 evaluate this more carefully and correctly.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001484
Laurence Lundblade0fb2f642018-10-11 19:33:35 +05301485 */
1486
1487
1488/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001489 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001490 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001491int QCBORDecode_IsTagged(QCBORDecodeContext *me,
1492 const QCBORItem *pItem,
1493 uint64_t uTag)
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001494{
1495 const QCBORTagListIn *pCallerConfiguredTagMap = me->pCallerConfiguredTagList;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001496
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001497 uint8_t uTagBitIndex;
1498 // Do not care about errors in pCallerConfiguredTagMap here. They are
1499 // caught during GetNext() before this is called.
1500 if(TagMapper_Lookup(pCallerConfiguredTagMap, uTag, &uTagBitIndex)) {
1501 return 0;
1502 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001503
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001504 const uint64_t uTagBit = 0x01ULL << uTagBitIndex;
1505 return (uTagBit & pItem->uTagBits) != 0;
1506}
1507
1508
1509/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001510 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladedbe6f212018-10-28 11:37:53 +07001511 */
Laurence Lundblade30816f22018-11-10 13:40:22 +07001512QCBORError QCBORDecode_Finish(QCBORDecodeContext *me)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001513{
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001514 QCBORError nReturn = QCBOR_SUCCESS;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001515
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001516 // Error out if all the maps/arrays are not closed out
1517 if(DecodeNesting_IsNested(&(me->nesting))) {
1518 nReturn = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
1519 goto Done;
1520 }
1521
1522 // Error out if not all the bytes are consumed
1523 if(UsefulInputBuf_BytesUnconsumed(&(me->InBuf))) {
1524 nReturn = QCBOR_ERR_EXTRA_BYTES;
1525 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001526
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001527Done:
Laurence Lundblade6de37062018-10-15 12:22:42 +05301528 // Call the destructor for the string allocator if there is one.
Laurence Lundblade20b533d2018-10-08 20:44:53 +08001529 // Always called, even if there are errors; always have to clean up
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001530 StringAllocator_Destruct(&(me->StringAllocator));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001531
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001532 return nReturn;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001533}
1534
1535
1536
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001537/*
1538
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001539Decoder errors handled in this file
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001540
Laurence Lundbladeee851742020-01-08 08:37:05 -08001541 - Hit end of input before it was expected while decoding type and
1542 number QCBOR_ERR_HIT_END
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001543
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001544 - negative integer that is too large for C QCBOR_ERR_INT_OVERFLOW
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001545
Laurence Lundbladeee851742020-01-08 08:37:05 -08001546 - Hit end of input while decoding a text or byte string
1547 QCBOR_ERR_HIT_END
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001548
Laurence Lundbladeee851742020-01-08 08:37:05 -08001549 - Encountered conflicting tags -- e.g., an item is tagged both a date
1550 string and an epoch date QCBOR_ERR_UNSUPPORTED
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001551
Laurence Lundbladeee851742020-01-08 08:37:05 -08001552 - Encontered an array or mapp that has too many items
1553 QCBOR_ERR_ARRAY_TOO_LONG
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001554
Laurence Lundbladeee851742020-01-08 08:37:05 -08001555 - Encountered array/map nesting that is too deep
1556 QCBOR_ERR_ARRAY_NESTING_TOO_DEEP
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001557
Laurence Lundbladeee851742020-01-08 08:37:05 -08001558 - An epoch date > INT64_MAX or < INT64_MIN was encountered
1559 QCBOR_ERR_DATE_OVERFLOW
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001560
Laurence Lundbladeee851742020-01-08 08:37:05 -08001561 - The type of a map label is not a string or int
1562 QCBOR_ERR_MAP_LABEL_TYPE
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001563
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001564 - Hit end with arrays or maps still open -- QCBOR_ERR_EXTRA_BYTES
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001565
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001566 */
1567
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001568
1569
Laurence Lundbladef6531662018-12-04 10:42:22 +09001570
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001571/* ===========================================================================
1572 MemPool -- BUILT-IN SIMPLE STRING ALLOCATOR
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001573
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001574 This implements a simple sting allocator for indefinite length
1575 strings that can be enabled by calling QCBORDecode_SetMemPool(). It
1576 implements the function type QCBORStringAllocate and allows easy
1577 use of it.
Laurence Lundbladef6531662018-12-04 10:42:22 +09001578
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001579 This particular allocator is built-in for convenience. The caller
1580 can implement their own. All of this following code will get
1581 dead-stripped if QCBORDecode_SetMemPool() is not called.
1582
1583 This is a very primitive memory allocator. It does not track
1584 individual allocations, only a high-water mark. A free or
1585 reallocation must be of the last chunk allocated.
1586
1587 The size of the pool and offset to free memory are packed into the
1588 first 8 bytes of the memory pool so we don't have to keep them in
1589 the decode context. Since the address of the pool may not be
1590 aligned, they have to be packed and unpacked as if they were
1591 serialized data of the wire or such.
1592
1593 The sizes packed in are uint32_t to be the same on all CPU types
1594 and simplify the code.
Laurence Lundbladeee851742020-01-08 08:37:05 -08001595 ========================================================================== */
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001596
1597
Laurence Lundbladeee851742020-01-08 08:37:05 -08001598static inline int
1599MemPool_Unpack(const void *pMem, uint32_t *puPoolSize, uint32_t *puFreeOffset)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001600{
1601 // Use of UsefulInputBuf is overkill, but it is convenient.
1602 UsefulInputBuf UIB;
1603
Laurence Lundbladeee851742020-01-08 08:37:05 -08001604 // Just assume the size here. It was checked during SetUp so
1605 // the assumption is safe.
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001606 UsefulInputBuf_Init(&UIB, (UsefulBufC){pMem, QCBOR_DECODE_MIN_MEM_POOL_SIZE});
1607 *puPoolSize = UsefulInputBuf_GetUint32(&UIB);
1608 *puFreeOffset = UsefulInputBuf_GetUint32(&UIB);
1609 return UsefulInputBuf_GetError(&UIB);
1610}
1611
1612
Laurence Lundbladeee851742020-01-08 08:37:05 -08001613static inline int
1614MemPool_Pack(UsefulBuf Pool, uint32_t uFreeOffset)
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001615{
1616 // Use of UsefulOutBuf is overkill, but convenient. The
1617 // length check performed here is useful.
1618 UsefulOutBuf UOB;
1619
1620 UsefulOutBuf_Init(&UOB, Pool);
1621 UsefulOutBuf_AppendUint32(&UOB, (uint32_t)Pool.len); // size of pool
1622 UsefulOutBuf_AppendUint32(&UOB, uFreeOffset); // first free position
1623 return UsefulOutBuf_GetError(&UOB);
1624}
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001625
1626
1627/*
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001628 Internal function for an allocation, reallocation free and destuct.
1629
1630 Having only one function rather than one each per mode saves space in
1631 QCBORDecodeContext.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001632
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001633 Code Reviewers: THIS FUNCTION DOES POINTER MATH
1634 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001635static UsefulBuf
1636MemPool_Function(void *pPool, void *pMem, size_t uNewSize)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001637{
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001638 UsefulBuf ReturnValue = NULLUsefulBuf;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001639
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001640 uint32_t uPoolSize;
1641 uint32_t uFreeOffset;
1642
1643 if(uNewSize > UINT32_MAX) {
1644 // This allocator is only good up to 4GB. This check should
1645 // optimize out if sizeof(size_t) == sizeof(uint32_t)
1646 goto Done;
1647 }
1648 const uint32_t uNewSize32 = (uint32_t)uNewSize;
1649
1650 if(MemPool_Unpack(pPool, &uPoolSize, &uFreeOffset)) {
1651 goto Done;
1652 }
1653
1654 if(uNewSize) {
1655 if(pMem) {
1656 // REALLOCATION MODE
1657 // Calculate pointer to the end of the memory pool. It is
1658 // assumed that pPool + uPoolSize won't wrap around by
1659 // assuming the caller won't pass a pool buffer in that is
1660 // not in legitimate memory space.
1661 const void *pPoolEnd = (uint8_t *)pPool + uPoolSize;
1662
1663 // Check that the pointer for reallocation is in the range of the
1664 // pool. This also makes sure that pointer math further down
1665 // doesn't wrap under or over.
1666 if(pMem >= pPool && pMem < pPoolEnd) {
1667 // Offset to start of chunk for reallocation. This won't
1668 // wrap under because of check that pMem >= pPool. Cast
1669 // is safe because the pool is always less than UINT32_MAX
1670 // because of check in QCBORDecode_SetMemPool().
1671 const uint32_t uMemOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool);
1672
1673 // Check to see if the allocation will fit. uPoolSize -
1674 // uMemOffset will not wrap under because of check that
1675 // pMem is in the range of the uPoolSize by check above.
1676 if(uNewSize <= uPoolSize - uMemOffset) {
1677 ReturnValue.ptr = pMem;
1678 ReturnValue.len = uNewSize;
1679
1680 // Addition won't wrap around over because uNewSize was
1681 // checked to be sure it is less than the pool size.
1682 uFreeOffset = uMemOffset + uNewSize32;
1683 }
1684 }
1685 } else {
1686 // ALLOCATION MODE
1687 // uPoolSize - uFreeOffset will not underflow because this
1688 // pool implementation makes sure uFreeOffset is always
1689 // smaller than uPoolSize through this check here and
1690 // reallocation case.
1691 if(uNewSize <= uPoolSize - uFreeOffset) {
1692 ReturnValue.len = uNewSize;
1693 ReturnValue.ptr = (uint8_t *)pPool + uFreeOffset;
Laurence Lundblade06350ea2020-01-27 19:32:40 -08001694 uFreeOffset += (uint32_t)uNewSize;
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001695 }
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001696 }
1697 } else {
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001698 if(pMem) {
1699 // FREE MODE
1700 // Cast is safe because of limit on pool size in
1701 // QCBORDecode_SetMemPool()
1702 uFreeOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool);
1703 } else {
1704 // DESTRUCT MODE
1705 // Nothing to do for this allocator
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001706 }
1707 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001708
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001709 UsefulBuf Pool = {pPool, uPoolSize};
1710 MemPool_Pack(Pool, uFreeOffset);
1711
1712Done:
1713 return ReturnValue;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001714}
1715
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001716
Laurence Lundbladef6531662018-12-04 10:42:22 +09001717/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -08001718 Public function, see header qcbor/qcbor_decode.h file
Laurence Lundbladef6531662018-12-04 10:42:22 +09001719 */
Laurence Lundbladeee851742020-01-08 08:37:05 -08001720QCBORError QCBORDecode_SetMemPool(QCBORDecodeContext *pMe,
1721 UsefulBuf Pool,
1722 bool bAllStrings)
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001723{
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001724 // The pool size and free mem offset are packed into the beginning
1725 // of the pool memory. This compile time check make sure the
1726 // constant in the header is correct. This check should optimize
1727 // down to nothing.
1728 if(QCBOR_DECODE_MIN_MEM_POOL_SIZE < 2 * sizeof(uint32_t)) {
Laurence Lundblade30816f22018-11-10 13:40:22 +07001729 return QCBOR_ERR_BUFFER_TOO_SMALL;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001730 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001731
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001732 // The pool size and free offset packed in to the beginning of pool
1733 // memory are only 32-bits. This check will optimize out on 32-bit
1734 // machines.
1735 if(Pool.len > UINT32_MAX) {
1736 return QCBOR_ERR_BUFFER_TOO_LARGE;
1737 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001738
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001739 // This checks that the pool buffer given is big enough.
1740 if(MemPool_Pack(Pool, QCBOR_DECODE_MIN_MEM_POOL_SIZE)) {
1741 return QCBOR_ERR_BUFFER_TOO_SMALL;
1742 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001743
Laurence Lundblade1d7eb632019-02-17 17:23:38 -08001744 pMe->StringAllocator.pfAllocator = MemPool_Function;
1745 pMe->StringAllocator.pAllocateCxt = Pool.ptr;
1746 pMe->bStringAllocateAll = bAllStrings;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001747
Laurence Lundblade30816f22018-11-10 13:40:22 +07001748 return QCBOR_SUCCESS;
Laurence Lundblade041ffa52018-10-07 11:43:51 +07001749}