Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1 | /*============================================================================== |
Laurence Lundblade | d92a616 | 2018-11-01 11:38:35 +0700 | [diff] [blame] | 2 | Copyright (c) 2016-2018, The Linux Foundation. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 3 | Copyright (c) 2018-2020, Laurence Lundblade. |
Laurence Lundblade | d92a616 | 2018-11-01 11:38:35 +0700 | [diff] [blame] | 4 | All rights reserved. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 5 | |
Laurence Lundblade | 0dbc917 | 2018-11-01 14:17:21 +0700 | [diff] [blame] | 6 | Redistribution and use in source and binary forms, with or without |
| 7 | modification, are permitted provided that the following conditions are |
| 8 | met: |
| 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 19 | |
Laurence Lundblade | 0dbc917 | 2018-11-01 14:17:21 +0700 | [diff] [blame] | 20 | THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED |
| 21 | WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 22 | MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT |
| 23 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS |
| 24 | BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 25 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 26 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 27 | BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 28 | WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| 29 | OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| 30 | IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 31 | =============================================================================*/ |
Laurence Lundblade | 624405d | 2018-09-18 20:10:47 -0700 | [diff] [blame] | 32 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 33 | |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 34 | #include "qcbor/qcbor_decode.h" |
Laurence Lundblade | 12d32c5 | 2018-09-19 11:25:27 -0700 | [diff] [blame] | 35 | #include "ieee754.h" |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 36 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 37 | |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 38 | /* |
| 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 44 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 45 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 46 | /*=========================================================================== |
| 47 | DecodeNesting -- Functions for tracking array/map nesting when decoding |
| 48 | |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 49 | See qcbor/qcbor_decode.h for definition of the object |
| 50 | used here: QCBORDecodeNesting |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 51 | ===========================================================================*/ |
| 52 | |
| 53 | inline static int |
| 54 | IsMapOrArray(uint8_t uDataType) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 55 | { |
| 56 | return uDataType == QCBOR_TYPE_MAP || uDataType == QCBOR_TYPE_ARRAY; |
| 57 | } |
| 58 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 59 | inline static int |
| 60 | DecodeNesting_IsNested(const QCBORDecodeNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 61 | { |
| 62 | return pNesting->pCurrent != &(pNesting->pMapsAndArrays[0]); |
| 63 | } |
| 64 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 65 | inline static int |
| 66 | DecodeNesting_IsIndefiniteLength(const QCBORDecodeNesting *pNesting) |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 67 | { |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 68 | return pNesting->pCurrent->uCount == UINT16_MAX; |
| 69 | } |
| 70 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 71 | inline static uint8_t |
| 72 | DecodeNesting_GetLevel(QCBORDecodeNesting *pNesting) |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 73 | { |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 74 | // 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 Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 77 | } |
| 78 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 79 | inline static int |
| 80 | DecodeNesting_TypeIsMap(const QCBORDecodeNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 81 | { |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 82 | if(!DecodeNesting_IsNested(pNesting)) { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 83 | return 0; |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 84 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 85 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 86 | return CBOR_MAJOR_TYPE_MAP == pNesting->pCurrent->uMajorType; |
| 87 | } |
| 88 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 89 | // Process a break. This will either ascend the nesting or error out |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 90 | inline static QCBORError |
| 91 | DecodeNesting_BreakAscend(QCBORDecodeNesting *pNesting) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 92 | { |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 93 | // breaks must always occur when there is nesting |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 94 | if(!DecodeNesting_IsNested(pNesting)) { |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 95 | return QCBOR_ERR_BAD_BREAK; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 96 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 97 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 98 | // breaks can only occur when the map/array is indefinite length |
| 99 | if(!DecodeNesting_IsIndefiniteLength(pNesting)) { |
| 100 | return QCBOR_ERR_BAD_BREAK; |
| 101 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 102 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 103 | // if all OK, the break reduces the level of nesting |
| 104 | pNesting->pCurrent--; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 105 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 106 | return QCBOR_SUCCESS; |
| 107 | } |
| 108 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 109 | // Called on every single item except breaks including open of a map/array |
| 110 | inline static void |
| 111 | DecodeNesting_DecrementCount(QCBORDecodeNesting *pNesting) |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 112 | { |
Laurence Lundblade | 9916b1b | 2019-09-07 22:33:25 -0700 | [diff] [blame] | 113 | while(DecodeNesting_IsNested(pNesting)) { |
| 114 | // Not at the top level, so there is decrementing to be done. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 115 | |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 116 | if(!DecodeNesting_IsIndefiniteLength(pNesting)) { |
Laurence Lundblade | 9916b1b | 2019-09-07 22:33:25 -0700 | [diff] [blame] | 117 | // Decrement the current nesting level if it is not indefinite. |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 118 | pNesting->pCurrent->uCount--; |
| 119 | } |
Laurence Lundblade | 9916b1b | 2019-09-07 22:33:25 -0700 | [diff] [blame] | 120 | |
| 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 130 | } |
| 131 | } |
| 132 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 133 | // Called on every map/array |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 134 | inline static QCBORError |
| 135 | DecodeNesting_Descend(QCBORDecodeNesting *pNesting, QCBORItem *pItem) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 136 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 137 | QCBORError nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 138 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 139 | 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 Lundblade | a44d506 | 2018-10-17 18:45:12 +0530 | [diff] [blame] | 143 | // Empty indefinite length maps and arrays are handled elsewhere |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 144 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 145 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 146 | // 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 148 | nReturn = QCBOR_ERR_ARRAY_TOO_LONG; |
| 149 | goto Done; |
| 150 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 151 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 152 | // Error out if nesting is too deep |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 153 | if(pNesting->pCurrent >= &(pNesting->pMapsAndArrays[QCBOR_MAX_ARRAY_NESTING])) { |
| 154 | nReturn = QCBOR_ERR_ARRAY_NESTING_TOO_DEEP; |
| 155 | goto Done; |
| 156 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 157 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 158 | // The actual descend |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 159 | pNesting->pCurrent++; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 160 | |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 161 | // Record a few details for this nesting level |
| 162 | pNesting->pCurrent->uMajorType = pItem->uDataType; |
| 163 | pNesting->pCurrent->uCount = pItem->val.uCount; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 164 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 165 | Done: |
| 166 | return nReturn;; |
| 167 | } |
| 168 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 169 | inline static void |
| 170 | DecodeNesting_Init(QCBORDecodeNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 171 | { |
| 172 | pNesting->pCurrent = &(pNesting->pMapsAndArrays[0]); |
| 173 | } |
| 174 | |
| 175 | |
| 176 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 177 | /* |
| 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 | */ |
| 183 | static const uint16_t spBuiltInTagMap[] = { |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 184 | 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 Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 190 | 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 Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 213 | // 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 Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 222 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 223 | #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 Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 233 | 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 | |
| 239 | static inline int TagMapper_LookupBuiltIn(uint64_t uTag) |
| 240 | { |
| 241 | if(sizeof(spBuiltInTagMap)/sizeof(uint16_t) > TAG_MAPPER_MAX_SIZE_BUILT_IN_TAGS) { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 242 | /* |
| 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 Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 248 | return -1; |
| 249 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 250 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 251 | if(uTag > UINT16_MAX) { |
| 252 | // This tag map works only on 16-bit tags |
| 253 | return -1; |
| 254 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 255 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 256 | 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 | |
| 264 | static 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 271 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 272 | return -1; // Indicates no match |
| 273 | } |
| 274 | |
| 275 | /* |
| 276 | Find the tag bit index for a given tag value, or error out |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 277 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 278 | This and the above functions could probably be optimized and made |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 279 | clearer and neater. |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 280 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 281 | static QCBORError |
| 282 | TagMapper_Lookup(const QCBORTagListIn *pCallerConfiguredTagMap, |
| 283 | uint64_t uTag, |
| 284 | uint8_t *puTagBitIndex) |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 285 | { |
| 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 292 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 293 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 305 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 306 | return QCBOR_ERR_BAD_OPT_TAG; |
| 307 | } |
| 308 | |
| 309 | |
| 310 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 311 | /*=========================================================================== |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 312 | 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 Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 317 | ===========================================================================*/ |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 318 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 319 | static inline void |
| 320 | StringAllocator_Free(const QCORInternalAllocator *pMe, void *pMem) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 321 | { |
| 322 | (pMe->pfAllocator)(pMe->pAllocateCxt, pMem, 0); |
| 323 | } |
| 324 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 325 | // StringAllocator_Reallocate called with pMem NULL is |
| 326 | // equal to StringAllocator_Allocate() |
| 327 | static inline UsefulBuf |
| 328 | StringAllocator_Reallocate(const QCORInternalAllocator *pMe, |
| 329 | void *pMem, |
| 330 | size_t uSize) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 331 | { |
| 332 | return (pMe->pfAllocator)(pMe->pAllocateCxt, pMem, uSize); |
| 333 | } |
| 334 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 335 | static inline UsefulBuf |
| 336 | StringAllocator_Allocate(const QCORInternalAllocator *pMe, size_t uSize) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 337 | { |
| 338 | return (pMe->pfAllocator)(pMe->pAllocateCxt, NULL, uSize); |
| 339 | } |
| 340 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 341 | static inline void |
| 342 | StringAllocator_Destruct(const QCORInternalAllocator *pMe) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 343 | { |
| 344 | if(pMe->pfAllocator) { |
| 345 | (pMe->pfAllocator)(pMe->pAllocateCxt, NULL, 0); |
| 346 | } |
| 347 | } |
| 348 | |
| 349 | |
| 350 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 351 | /*=========================================================================== |
| 352 | QCBORDecode -- The main implementation of CBOR decoding |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 353 | |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 354 | See qcbor/qcbor_decode.h for definition of the object |
| 355 | used here: QCBORDecodeContext |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 356 | ===========================================================================*/ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 357 | /* |
| 358 | Public function, see header file |
| 359 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 360 | void QCBORDecode_Init(QCBORDecodeContext *me, |
| 361 | UsefulBufC EncodedCBOR, |
| 362 | QCBORDecodeMode nDecodeMode) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 363 | { |
| 364 | memset(me, 0, sizeof(QCBORDecodeContext)); |
| 365 | UsefulInputBuf_Init(&(me->InBuf), EncodedCBOR); |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 366 | // 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 Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 368 | me->uDecodeMode = (uint8_t)nDecodeMode; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 369 | DecodeNesting_Init(&(me->nesting)); |
| 370 | } |
| 371 | |
| 372 | |
| 373 | /* |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 374 | Public function, see header file |
| 375 | */ |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 376 | void QCBORDecode_SetUpAllocator(QCBORDecodeContext *pMe, |
| 377 | QCBORStringAllocate pfAllocateFunction, |
| 378 | void *pAllocateContext, |
| 379 | bool bAllStrings) |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 380 | { |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 381 | pMe->StringAllocator.pfAllocator = pfAllocateFunction; |
| 382 | pMe->StringAllocator.pAllocateCxt = pAllocateContext; |
| 383 | pMe->bStringAllocateAll = bAllStrings; |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 384 | } |
| 385 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 386 | |
| 387 | /* |
| 388 | Public function, see header file |
| 389 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 390 | void QCBORDecode_SetCallerConfiguredTagList(QCBORDecodeContext *me, |
| 391 | const QCBORTagListIn *pTagList) |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 392 | { |
| 393 | me->pCallerConfiguredTagList = pTagList; |
| 394 | } |
| 395 | |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 396 | |
| 397 | /* |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 398 | This decodes the fundamental part of a CBOR data item, the type and |
| 399 | number |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 400 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 401 | This is the Counterpart to InsertEncodedTypeAndNumber(). |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 402 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 403 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 406 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 407 | This returns: |
| 408 | pnMajorType -- the major type for the item |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 409 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 410 | puArgument -- the "number" which is used a the value for integers, |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 411 | tags and floats and length for strings and arrays |
| 412 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 413 | pnAdditionalInfo -- Pass this along to know what kind of float or |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 414 | if length is indefinite |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 415 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 416 | 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 419 | */ |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 420 | inline static QCBORError DecodeTypeAndNumber(UsefulInputBuf *pUInBuf, |
| 421 | int *pnMajorType, |
| 422 | uint64_t *puArgument, |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 423 | int *pnAdditionalInfo) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 424 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 425 | QCBORError nReturn; |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 426 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 427 | // Get the initial byte that every CBOR data item has |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 428 | const int nInitialByte = (int)UsefulInputBuf_GetByte(pUInBuf); |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 429 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 430 | // Break down the initial byte |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 431 | const int nTmpMajorType = nInitialByte >> 5; |
| 432 | const int nAdditionalInfo = nInitialByte & 0x1f; |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 433 | |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 434 | // Where the number or argument accumulates |
| 435 | uint64_t uArgument; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 436 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 437 | if(nAdditionalInfo >= LEN_IS_ONE_BYTE && nAdditionalInfo <= LEN_IS_EIGHT_BYTES) { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 438 | // 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 Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 440 | static const uint8_t aIterate[] = {1,2,4,8}; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 441 | |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 442 | // Loop getting all the bytes in the argument |
| 443 | uArgument = 0; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 444 | for(int i = aIterate[nAdditionalInfo - LEN_IS_ONE_BYTE]; i; i--) { |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 445 | // This shift and add gives the endian conversion |
| 446 | uArgument = (uArgument << 8) + UsefulInputBuf_GetByte(pUInBuf); |
| 447 | } |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 448 | } else if(nAdditionalInfo >= ADDINFO_RESERVED1 && nAdditionalInfo <= ADDINFO_RESERVED3) { |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 449 | // 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 Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 455 | uArgument = (uint64_t)nAdditionalInfo; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 456 | } |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 457 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 458 | if(UsefulInputBuf_GetError(pUInBuf)) { |
| 459 | nReturn = QCBOR_ERR_HIT_END; |
| 460 | goto Done; |
| 461 | } |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 462 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 463 | // All successful if we got here. |
| 464 | nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 465 | *pnMajorType = nTmpMajorType; |
Laurence Lundblade | 4c0cf84 | 2019-01-12 03:25:44 -0800 | [diff] [blame] | 466 | *puArgument = uArgument; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 467 | *pnAdditionalInfo = nAdditionalInfo; |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 468 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 469 | Done: |
| 470 | return nReturn; |
| 471 | } |
| 472 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 473 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 474 | /* |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 475 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 483 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 484 | See http://www.unix.org/whitepapers/64bit.html for reasons int isn't |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 485 | 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 491 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 492 | inline static QCBORError |
| 493 | DecodeInteger(int nMajorType, uint64_t uNumber, QCBORItem *pDecodedItem) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 494 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 495 | QCBORError nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 496 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 497 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 501 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 502 | } else { |
| 503 | pDecodedItem->val.uint64 = uNumber; |
| 504 | pDecodedItem->uDataType = QCBOR_TYPE_UINT64; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 505 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 506 | } |
| 507 | } else { |
| 508 | if(uNumber <= INT64_MAX) { |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 509 | // 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 514 | pDecodedItem->uDataType = QCBOR_TYPE_INT64; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 515 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 516 | } else { |
| 517 | // C can't represent a negative integer in this range |
Laurence Lundblade | 21d1d81 | 2019-09-28 22:47:49 -1000 | [diff] [blame] | 518 | // so it is an error. |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 519 | nReturn = QCBOR_ERR_INT_OVERFLOW; |
| 520 | } |
| 521 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 522 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 523 | 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 Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 543 | #if QCBOR_TYPE_BREAK != CBOR_SIMPLE_BREAK |
| 544 | #error QCBOR_TYPE_BREAK macro value wrong |
| 545 | #endif |
| 546 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 547 | #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 Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 558 | inline static QCBORError |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 559 | DecodeSimple(int nAdditionalInfo, uint64_t uNumber, QCBORItem *pDecodedItem) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 560 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 561 | QCBORError nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 562 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 563 | // uAdditionalInfo is 5 bits from the initial byte compile time checks |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 564 | // 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 567 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 568 | switch(nAdditionalInfo) { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 569 | // No check for ADDINFO_RESERVED1 - ADDINFO_RESERVED3 as they are |
| 570 | // caught before this is called. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 571 | |
Laurence Lundblade | cc2ed34 | 2018-09-22 17:29:55 -0700 | [diff] [blame] | 572 | case HALF_PREC_FLOAT: |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 573 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
Laurence Lundblade | 3ed0bca | 2020-07-14 22:50:10 -0700 | [diff] [blame] | 574 | // The cast to uint16_t is safe because the encoded value |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 575 | // was 16 bits. It was widened to 64 bits to be passed in here. |
Laurence Lundblade | 67bd551 | 2018-11-02 21:44:06 +0700 | [diff] [blame] | 576 | pDecodedItem->val.dfnum = IEEE754_HalfToDouble((uint16_t)uNumber); |
| 577 | pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE; |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 578 | #else |
Laurence Lundblade | 02fcf31 | 2020-07-17 02:49:46 -0700 | [diff] [blame] | 579 | nReturn = QCBOR_ERR_HALF_PRECISION_UNSUPPORTED; |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 580 | #endif |
Laurence Lundblade | 12d32c5 | 2018-09-19 11:25:27 -0700 | [diff] [blame] | 581 | break; |
Laurence Lundblade | cc2ed34 | 2018-09-22 17:29:55 -0700 | [diff] [blame] | 582 | case SINGLE_PREC_FLOAT: |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 583 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
Laurence Lundblade | 3ed0bca | 2020-07-14 22:50:10 -0700 | [diff] [blame] | 584 | // The cast to uint32_t is safe because the encoded value |
Laurence Lundblade | 8fa7d5d | 2020-07-11 16:30:47 -0700 | [diff] [blame] | 585 | // was 32 bits. It was widened to 64 bits to be passed in here. |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 586 | pDecodedItem->val.dfnum = IEEE754_FloatToDouble((uint32_t)uNumber); |
Laurence Lundblade | 3ed0bca | 2020-07-14 22:50:10 -0700 | [diff] [blame] | 587 | pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE; |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 588 | #else |
| 589 | pDecodedItem->val.fnum = UsefulBufUtil_CopyUint32ToFloat((uint32_t)uNumber); |
| 590 | pDecodedItem->uDataType = QCBOR_TYPE_FLOAT; |
| 591 | #endif |
Laurence Lundblade | 12d32c5 | 2018-09-19 11:25:27 -0700 | [diff] [blame] | 592 | break; |
| 593 | case DOUBLE_PREC_FLOAT: |
| 594 | pDecodedItem->val.dfnum = UsefulBufUtil_CopyUint64ToDouble(uNumber); |
Laurence Lundblade | 67bd551 | 2018-11-02 21:44:06 +0700 | [diff] [blame] | 595 | pDecodedItem->uDataType = QCBOR_TYPE_DOUBLE; |
Laurence Lundblade | 12d32c5 | 2018-09-19 11:25:27 -0700 | [diff] [blame] | 596 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 597 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 598 | case CBOR_SIMPLEV_FALSE: // 20 |
| 599 | case CBOR_SIMPLEV_TRUE: // 21 |
| 600 | case CBOR_SIMPLEV_NULL: // 22 |
| 601 | case CBOR_SIMPLEV_UNDEF: // 23 |
Laurence Lundblade | 0f99d69 | 2018-09-26 14:39:28 -0700 | [diff] [blame] | 602 | case CBOR_SIMPLE_BREAK: // 31 |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 603 | break; // nothing to do |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 604 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 605 | 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 Lundblade | 077475f | 2019-04-26 09:06:33 -0700 | [diff] [blame] | 608 | nReturn = QCBOR_ERR_BAD_TYPE_7; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 609 | goto Done; |
| 610 | } |
Laurence Lundblade | 5e39082 | 2019-01-06 12:35:01 -0800 | [diff] [blame] | 611 | /* FALLTHROUGH */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 612 | // fall through intentionally |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 613 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 614 | default: // 0-19 |
| 615 | pDecodedItem->uDataType = QCBOR_TYPE_UKNOWN_SIMPLE; |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 616 | /* |
| 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 622 | pDecodedItem->val.uSimple = (uint8_t)uNumber; |
| 623 | break; |
| 624 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 625 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 626 | Done: |
| 627 | return nReturn; |
| 628 | } |
| 629 | |
| 630 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 631 | /* |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 632 | Decode text and byte strings. Call the string allocator if asked to. |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 633 | */ |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 634 | inline static QCBORError DecodeBytes(const QCORInternalAllocator *pAllocator, |
| 635 | int nMajorType, |
| 636 | uint64_t uStrLen, |
| 637 | UsefulInputBuf *pUInBuf, |
| 638 | QCBORItem *pDecodedItem) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 639 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 640 | QCBORError nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 641 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 642 | // 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 Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 654 | if(UsefulBuf_IsNULLC(Bytes)) { |
| 655 | // Failed to get the bytes for this string item |
| 656 | nReturn = QCBOR_ERR_HIT_END; |
| 657 | goto Done; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 658 | } |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 659 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 660 | if(pAllocator) { |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 661 | // We are asked to use string allocator to make a copy |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 662 | UsefulBuf NewMem = StringAllocator_Allocate(pAllocator, (size_t)uStrLen); |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 663 | if(UsefulBuf_IsNULL(NewMem)) { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 664 | nReturn = QCBOR_ERR_STRING_ALLOCATE; |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 665 | goto Done; |
| 666 | } |
| 667 | pDecodedItem->val.string = UsefulBuf_Copy(NewMem, Bytes); |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 668 | pDecodedItem->uDataAlloc = 1; |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 669 | } else { |
| 670 | // Normal case with no string allocator |
| 671 | pDecodedItem->val.string = Bytes; |
| 672 | } |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 673 | const bool bIsBstr = (nMajorType == CBOR_MAJOR_TYPE_BYTE_STRING); |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 674 | // Cast because ternary operator causes promotion to integer |
| 675 | pDecodedItem->uDataType = (uint8_t)(bIsBstr ? QCBOR_TYPE_BYTE_STRING |
| 676 | : QCBOR_TYPE_TEXT_STRING); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 677 | |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 678 | Done: |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 679 | return nReturn; |
| 680 | } |
| 681 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 682 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 683 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 684 | |
| 685 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 686 | |
| 687 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 688 | // Make sure the constants align as this is assumed by |
| 689 | // the GetAnItem() implementation |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 690 | #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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 697 | /* |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 698 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 702 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 703 | 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 705 | */ |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 706 | static QCBORError GetNext_Item(UsefulInputBuf *pUInBuf, |
| 707 | QCBORItem *pDecodedItem, |
| 708 | const QCORInternalAllocator *pAllocator) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 709 | { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 710 | QCBORError nReturn; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 711 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 712 | /* |
| 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 Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 718 | int nMajorType; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 719 | uint64_t uNumber; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 720 | int nAdditionalInfo; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 721 | |
Laurence Lundblade | 4b09f63 | 2019-10-09 14:34:59 -0700 | [diff] [blame] | 722 | memset(pDecodedItem, 0, sizeof(QCBORItem)); |
| 723 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 724 | nReturn = DecodeTypeAndNumber(pUInBuf, &nMajorType, &uNumber, &nAdditionalInfo); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 725 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 726 | // 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 Lundblade | 3a6042e | 2019-06-28 19:58:04 -0700 | [diff] [blame] | 728 | if(nReturn) { |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 729 | goto Done; |
Laurence Lundblade | 3a6042e | 2019-06-28 19:58:04 -0700 | [diff] [blame] | 730 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 731 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 732 | // 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 Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 734 | switch (nMajorType) { |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 735 | case CBOR_MAJOR_TYPE_POSITIVE_INT: // Major type 0 |
| 736 | case CBOR_MAJOR_TYPE_NEGATIVE_INT: // Major type 1 |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 737 | if(nAdditionalInfo == LEN_IS_INDEFINITE) { |
Laurence Lundblade | 3a6042e | 2019-06-28 19:58:04 -0700 | [diff] [blame] | 738 | nReturn = QCBOR_ERR_BAD_INT; |
| 739 | } else { |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 740 | nReturn = DecodeInteger(nMajorType, uNumber, pDecodedItem); |
Laurence Lundblade | 3a6042e | 2019-06-28 19:58:04 -0700 | [diff] [blame] | 741 | } |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 742 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 743 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 744 | case CBOR_MAJOR_TYPE_BYTE_STRING: // Major type 2 |
| 745 | case CBOR_MAJOR_TYPE_TEXT_STRING: // Major type 3 |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 746 | 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 Lundblade | a44d506 | 2018-10-17 18:45:12 +0530 | [diff] [blame] | 750 | pDecodedItem->val.string = (UsefulBufC){NULL, SIZE_MAX}; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 751 | } else { |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 752 | nReturn = DecodeBytes(pAllocator, nMajorType, uNumber, pUInBuf, pDecodedItem); |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 753 | } |
| 754 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 755 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 756 | 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 Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 763 | if(nAdditionalInfo == LEN_IS_INDEFINITE) { |
Laurence Lundblade | a44d506 | 2018-10-17 18:45:12 +0530 | [diff] [blame] | 764 | pDecodedItem->val.uCount = UINT16_MAX; // Indicate indefinite length |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 765 | } else { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 766 | // type conversion OK because of check above |
| 767 | pDecodedItem->val.uCount = (uint16_t)uNumber; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 768 | } |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 769 | // C preproc #if above makes sure constants for major types align |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 770 | // DecodeTypeAndNumber never returns a major type > 7 so cast is safe |
| 771 | pDecodedItem->uDataType = (uint8_t)nMajorType; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 772 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 773 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 774 | case CBOR_MAJOR_TYPE_OPTIONAL: // Major type 6, optional prepended tags |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 775 | if(nAdditionalInfo == LEN_IS_INDEFINITE) { |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 776 | nReturn = QCBOR_ERR_BAD_INT; |
| 777 | } else { |
| 778 | pDecodedItem->val.uTagV = uNumber; |
| 779 | pDecodedItem->uDataType = QCBOR_TYPE_OPTTAG; |
| 780 | } |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 781 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 782 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 783 | case CBOR_MAJOR_TYPE_SIMPLE: |
| 784 | // Major type 7, float, double, true, false, null... |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 785 | nReturn = DecodeSimple(nAdditionalInfo, uNumber, pDecodedItem); |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 786 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 787 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 788 | default: |
| 789 | // Never happens because DecodeTypeAndNumber() should never return > 7 |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 790 | nReturn = QCBOR_ERR_UNSUPPORTED; |
| 791 | break; |
| 792 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 793 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 794 | Done: |
| 795 | return nReturn; |
| 796 | } |
| 797 | |
| 798 | |
| 799 | |
| 800 | /* |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 801 | This layer deals with indefinite length strings. It pulls all the |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 802 | individual chunk items together into one QCBORItem using the string |
| 803 | allocator. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 804 | |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 805 | Code Reviewers: THIS FUNCTION DOES A LITTLE POINTER MATH |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 806 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 807 | static inline QCBORError |
| 808 | GetNext_FullItem(QCBORDecodeContext *me, QCBORItem *pDecodedItem) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 809 | { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 810 | // Stack usage; int/ptr 2 UsefulBuf 2 QCBORItem -- 96 |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 811 | |
| 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 Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 816 | const QCORInternalAllocator *pAllocator = me->StringAllocator.pfAllocator ? |
| 817 | &(me->StringAllocator) : |
| 818 | NULL; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 819 | |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 820 | QCBORError nReturn; |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 821 | nReturn = GetNext_Item(&(me->InBuf), |
| 822 | pDecodedItem, |
| 823 | me->bStringAllocateAll ? pAllocator: NULL); |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 824 | if(nReturn) { |
| 825 | goto Done; |
| 826 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 827 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 828 | // To reduce code size by removing support for indefinite length strings, the |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 829 | // 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 831 | |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 832 | // Only do indefinite length processing on strings |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 833 | const uint8_t uStringType = pDecodedItem->uDataType; |
| 834 | if(uStringType!= QCBOR_TYPE_BYTE_STRING && uStringType != QCBOR_TYPE_TEXT_STRING) { |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 835 | goto Done; // no need to do any work here on non-string types |
| 836 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 837 | |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 838 | // Is this a string with an indefinite length? |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 839 | if(pDecodedItem->val.string.len != SIZE_MAX) { |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 840 | goto Done; // length is not indefinite, so no work to do here |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 841 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 842 | |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 843 | // Can't do indefinite length strings without a string allocator |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 844 | if(pAllocator == NULL) { |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 845 | nReturn = QCBOR_ERR_NO_STRING_ALLOCATOR; |
| 846 | goto Done; |
| 847 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 848 | |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 849 | // Loop getting chunk of indefinite string |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 850 | UsefulBufC FullString = NULLUsefulBufC; |
| 851 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 852 | for(;;) { |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 853 | // Get item for next chunk |
| 854 | QCBORItem StringChunkItem; |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 855 | // NULL string allocator passed here. Do not need to allocate |
| 856 | // chunks even if bStringAllocateAll is set. |
Laurence Lundblade | fae26bf | 2019-02-18 11:15:43 -0800 | [diff] [blame] | 857 | nReturn = GetNext_Item(&(me->InBuf), &StringChunkItem, NULL); |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 858 | if(nReturn) { |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 859 | break; // Error getting the next chunk |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 860 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 861 | |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 862 | // See if it is a marker at end of indefinite length string |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 863 | if(StringChunkItem.uDataType == QCBOR_TYPE_BREAK) { |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 864 | // String is complete |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 865 | pDecodedItem->val.string = FullString; |
Laurence Lundblade | 57dd144 | 2018-10-15 20:26:28 +0530 | [diff] [blame] | 866 | pDecodedItem->uDataAlloc = 1; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 867 | break; |
| 868 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 869 | |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 870 | // Match data type of chunk to type at beginning. |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 871 | // Also catches error of other non-string types that don't belong. |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 872 | // Also catches indefinite length strings inside indefinite length strings |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 873 | if(StringChunkItem.uDataType != uStringType || |
| 874 | StringChunkItem.val.string.len == SIZE_MAX) { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 875 | nReturn = QCBOR_ERR_INDEFINITE_STRING_CHUNK; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 876 | break; |
| 877 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 878 | |
Laurence Lundblade | 471a3fd | 2018-10-18 21:27:45 +0530 | [diff] [blame] | 879 | // Alloc new buffer or expand previously allocated buffer so it can fit |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 880 | // 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 Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 886 | if(UsefulBuf_IsNULL(NewMem)) { |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 887 | // Allocation of memory for the string failed |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 888 | nReturn = QCBOR_ERR_STRING_ALLOCATE; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 889 | break; |
| 890 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 891 | |
Laurence Lundblade | 2a6850e | 2018-10-28 20:13:44 +0700 | [diff] [blame] | 892 | // Copy new string chunk at the end of string so far. |
| 893 | FullString = UsefulBuf_CopyOffset(NewMem, FullString.len, StringChunkItem.val.string); |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 894 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 895 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 896 | 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 Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 899 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 900 | |
Laurence Lundblade | d6dfe6d | 2020-04-09 10:21:36 -0700 | [diff] [blame] | 901 | Done: |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 902 | return nReturn; |
| 903 | } |
| 904 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 905 | |
| 906 | /* |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 907 | 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 909 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 910 | static QCBORError |
| 911 | GetNext_TaggedItem(QCBORDecodeContext *me, |
| 912 | QCBORItem *pDecodedItem, |
| 913 | QCBORTagListOut *pTags) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 914 | { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 915 | // Stack usage: int/ptr: 3 -- 24 |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 916 | QCBORError nReturn; |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 917 | uint64_t uTagBits = 0; |
| 918 | if(pTags) { |
| 919 | pTags->uNumUsed = 0; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 920 | } |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 921 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 922 | // Loop fetching items until the item fetched is not a tag |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 923 | for(;;) { |
| 924 | nReturn = GetNext_FullItem(me, pDecodedItem); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 925 | if(nReturn) { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 926 | goto Done; // Error out of the loop |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 927 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 928 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 929 | if(pDecodedItem->uDataType != QCBOR_TYPE_OPTTAG) { |
| 930 | // Successful exit from loop; maybe got some tags, maybe not |
| 931 | pDecodedItem->uTagBits = uTagBits; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 932 | break; |
| 933 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 934 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 935 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 938 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 939 | case QCBOR_SUCCESS: |
| 940 | // Successfully mapped the tag |
| 941 | uTagBits |= 0x01ULL << uTagBitIndex; |
| 942 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 943 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 944 | case QCBOR_ERR_BAD_OPT_TAG: |
| 945 | // Tag is not recognized. Do nothing |
| 946 | break; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 947 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 948 | default: |
| 949 | // Error Condition |
| 950 | goto Done; |
| 951 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 952 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 953 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 963 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 964 | Done: |
| 965 | return nReturn; |
| 966 | } |
| 967 | |
| 968 | |
| 969 | /* |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 970 | This layer takes care of map entries. It combines the label and data |
| 971 | items into one QCBORItem. |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 972 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 973 | static inline QCBORError |
| 974 | GetNext_MapEntry(QCBORDecodeContext *me, |
| 975 | QCBORItem *pDecodedItem, |
| 976 | QCBORTagListOut *pTags) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 977 | { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 978 | // Stack use: int/ptr 1, QCBORItem -- 56 |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 979 | QCBORError nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 980 | if(nReturn) |
| 981 | goto Done; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 982 | |
Laurence Lundblade | 742df4a | 2018-10-13 20:07:17 +0800 | [diff] [blame] | 983 | if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 984 | // Break can't be a map entry |
Laurence Lundblade | 742df4a | 2018-10-13 20:07:17 +0800 | [diff] [blame] | 985 | goto Done; |
| 986 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 987 | |
Laurence Lundblade | d61cbf3 | 2018-12-09 11:42:21 -0800 | [diff] [blame] | 988 | 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 Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 994 | // Save label in pDecodedItem and get the next which will |
| 995 | // be the real data |
Laurence Lundblade | ccfb8cd | 2018-12-07 21:11:30 +0900 | [diff] [blame] | 996 | QCBORItem LabelItem = *pDecodedItem; |
| 997 | nReturn = GetNext_TaggedItem(me, pDecodedItem, pTags); |
| 998 | if(nReturn) |
| 999 | goto Done; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1000 | |
Laurence Lundblade | 57dd144 | 2018-10-15 20:26:28 +0530 | [diff] [blame] | 1001 | pDecodedItem->uLabelAlloc = LabelItem.uDataAlloc; |
Laurence Lundblade | ccfb8cd | 2018-12-07 21:11:30 +0900 | [diff] [blame] | 1002 | |
| 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 Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1008 | // It's not a string and we only want strings |
Laurence Lundblade | ccfb8cd | 2018-12-07 21:11:30 +0900 | [diff] [blame] | 1009 | 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 Lundblade | d61cbf3 | 2018-12-09 11:42:21 -0800 | [diff] [blame] | 1028 | } |
| 1029 | } else { |
| 1030 | if(pDecodedItem->uDataType == QCBOR_TYPE_MAP) { |
Laurence Lundblade | e6bcef1 | 2020-04-01 10:56:27 -0700 | [diff] [blame] | 1031 | if(pDecodedItem->val.uCount > QCBOR_MAX_ITEMS_IN_ARRAY/2) { |
| 1032 | nReturn = QCBOR_ERR_ARRAY_TOO_LONG; |
| 1033 | goto Done; |
| 1034 | } |
Laurence Lundblade | d61cbf3 | 2018-12-09 11:42:21 -0800 | [diff] [blame] | 1035 | // Decoding a map as an array |
| 1036 | pDecodedItem->uDataType = QCBOR_TYPE_MAP_AS_ARRAY; |
Laurence Lundblade | e6bcef1 | 2020-04-01 10:56:27 -0700 | [diff] [blame] | 1037 | // 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 Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1040 | } |
| 1041 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1042 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1043 | Done: |
| 1044 | return nReturn; |
| 1045 | } |
| 1046 | |
| 1047 | |
| 1048 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1049 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1050 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1051 | QCBORError QCBORDecode_GetNextMapOrArray(QCBORDecodeContext *me, |
| 1052 | QCBORItem *pDecodedItem, |
| 1053 | QCBORTagListOut *pTags) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1054 | { |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1055 | // Stack ptr/int: 2, QCBORItem : 64 |
| 1056 | |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 1057 | // The public entry point for fetching and parsing the next QCBORItem. |
| 1058 | // All the CBOR parsing work is here and in subordinate calls. |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 1059 | QCBORError nReturn; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1060 | |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 1061 | // 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 Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1067 | nReturn = GetNext_MapEntry(me, pDecodedItem, pTags); |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 1068 | if(nReturn) { |
| 1069 | goto Done; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1070 | } |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 1071 | |
| 1072 | // Break ending arrays/maps are always processed at the end of this function. |
| 1073 | // They should never show up here. |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1074 | if(pDecodedItem->uDataType == QCBOR_TYPE_BREAK) { |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1075 | nReturn = QCBOR_ERR_BAD_BREAK; |
| 1076 | goto Done; |
Laurence Lundblade | 5b8c585 | 2018-10-14 21:11:42 +0530 | [diff] [blame] | 1077 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1078 | |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1079 | // Record the nesting level for this data item before processing any of |
Laurence Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 1080 | // decrementing and descending. |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1081 | pDecodedItem->uNestingLevel = DecodeNesting_GetLevel(&(me->nesting)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1082 | |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1083 | // 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 Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 1085 | if(IsMapOrArray(pDecodedItem->uDataType)) { |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 1086 | // If the new item is array or map, the nesting level descends |
Laurence Lundblade | 3a760b0 | 2018-10-08 13:46:03 +0800 | [diff] [blame] | 1087 | nReturn = DecodeNesting_Descend(&(me->nesting), pDecodedItem); |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 1088 | // 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 Lundblade | 9916b1b | 2019-09-07 22:33:25 -0700 | [diff] [blame] | 1091 | // are opened with the exception of an empty map or array. |
| 1092 | if(pDecodedItem->val.uCount == 0) { |
| 1093 | DecodeNesting_DecrementCount(&(me->nesting)); |
| 1094 | } |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 1095 | } 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 Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1098 | // triggers a decrement in the map/array above that and |
| 1099 | // an ascend in nesting level. |
Laurence Lundblade | 9e3651c | 2018-10-10 11:49:55 +0800 | [diff] [blame] | 1100 | DecodeNesting_DecrementCount(&(me->nesting)); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1101 | } |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1102 | if(nReturn) { |
| 1103 | goto Done; |
| 1104 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1105 | |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1106 | // 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 Lundblade | 7e0d13b | 2018-10-16 19:54:13 +0530 | [diff] [blame] | 1125 | // The break is consumed. |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1126 | 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1133 | |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1134 | // 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 Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1138 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1139 | Done: |
Laurence Lundblade | e9482dd | 2019-10-11 12:58:46 -0700 | [diff] [blame] | 1140 | if(nReturn != QCBOR_SUCCESS) { |
| 1141 | // Make sure uDataType and uLabelType are QCBOR_TYPE_NONE |
| 1142 | memset(pDecodedItem, 0, sizeof(QCBORItem)); |
| 1143 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1144 | return nReturn; |
| 1145 | } |
| 1146 | |
| 1147 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1148 | /* |
| 1149 | Mostly just assign the right data type for the date string. |
| 1150 | */ |
| 1151 | inline 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 | */ |
| 1168 | inline 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 Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1176 | const bool bIsPosBigNum = (bool)(pDecodedItem->uTagBits & QCBOR_TAGFLAG_POS_BIGNUM); |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 1177 | pDecodedItem->uDataType = (uint8_t)(bIsPosBigNum ? QCBOR_TYPE_POSBIGNUM |
| 1178 | : QCBOR_TYPE_NEGBIGNUM); |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1179 | return QCBOR_SUCCESS; |
| 1180 | } |
| 1181 | |
| 1182 | |
| 1183 | /* |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1184 | The epoch formatted date. Turns lots of different forms of encoding |
| 1185 | date into uniform one |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1186 | */ |
Laurence Lundblade | 06350ea | 2020-01-27 19:32:40 -0800 | [diff] [blame] | 1187 | static QCBORError DecodeDateEpoch(QCBORItem *pDecodedItem) |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1188 | { |
| 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 Lundblade | 06350ea | 2020-01-27 19:32:40 -0800 | [diff] [blame] | 1205 | pDecodedItem->val.epochDate.nSeconds = (int64_t)pDecodedItem->val.uint64; |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1206 | break; |
| 1207 | |
| 1208 | case QCBOR_TYPE_DOUBLE: |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 1209 | case QCBOR_TYPE_FLOAT: |
| 1210 | #ifndef QCBOR_DISABLE_FLOAT_HW_USE |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1211 | { |
| 1212 | // This comparison needs to be done as a float before |
Laurence Lundblade | 7b5a3b6 | 2020-07-22 10:17:16 -0700 | [diff] [blame^] | 1213 | // conversion to an int64_t to be able to detect doubles that |
| 1214 | // are too large to fit into an int64_t. A double has 52 |
| 1215 | // bits of preceision. An int64_t has 63. Casting INT64_MAX |
| 1216 | // to a double actually causes a round up which is bad and |
| 1217 | // wrong for the comparison because it will allow conversion |
| 1218 | // of doubles that can't fit into a uint64_t. To remedy this |
| 1219 | // INT64_MAX - 0x7ff is used as the cutoff point because if |
| 1220 | // that value rounds up in conversion to double it will still |
| 1221 | // be less than INT64_MAX. 0x7ff is picked because it has 11 |
| 1222 | // bits set. |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1223 | // |
Laurence Lundblade | 7b5a3b6 | 2020-07-22 10:17:16 -0700 | [diff] [blame^] | 1224 | // INT64_MAX seconds is on the order of 10 billion years, and |
| 1225 | // the earth is less than 5 billion years old, so for most |
| 1226 | // uses this conversion error won't occur even though doubles |
| 1227 | // can go much larger. |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1228 | // |
| 1229 | // Without the 0x7ff there is a ~30 minute range of time |
| 1230 | // values 10 billion years in the past and in the future |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 1231 | // where this this code would go wrong and some compilers |
| 1232 | // will generate warnings or errors. |
Laurence Lundblade | 3ed0bca | 2020-07-14 22:50:10 -0700 | [diff] [blame] | 1233 | const double d = pDecodedItem->uDataType == QCBOR_TYPE_DOUBLE ? |
| 1234 | pDecodedItem->val.dfnum : |
| 1235 | (double)pDecodedItem->val.fnum; |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1236 | if(d > (double)(INT64_MAX - 0x7ff)) { |
| 1237 | nReturn = QCBOR_ERR_DATE_OVERFLOW; |
| 1238 | goto Done; |
| 1239 | } |
| 1240 | pDecodedItem->val.epochDate.nSeconds = (int64_t)d; |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 1241 | pDecodedItem->val.epochDate.fSecondsFraction = |
| 1242 | d - (double)pDecodedItem->val.epochDate.nSeconds; |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1243 | } |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 1244 | #else |
| 1245 | /* Disabling float support causes a floating point |
| 1246 | data to error in the default below. The above code |
| 1247 | requires floating point conversion to integers and |
| 1248 | comparison which requires either floating point HW |
| 1249 | or a SW library. */ |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 1250 | nReturn = QCBOR_ERR_FLOAT_DATE_UNSUPPORTED; |
| 1251 | #endif /* QCBOR_DISABLE_FLOAT_HW_USE */ |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1252 | break; |
| 1253 | |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 1254 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1255 | default: |
| 1256 | nReturn = QCBOR_ERR_BAD_OPT_TAG; |
| 1257 | goto Done; |
| 1258 | } |
| 1259 | pDecodedItem->uDataType = QCBOR_TYPE_DATE_EPOCH; |
| 1260 | |
| 1261 | Done: |
| 1262 | return nReturn; |
| 1263 | } |
| 1264 | |
| 1265 | |
| 1266 | #ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA |
| 1267 | /* |
| 1268 | Decode decimal fractions and big floats. |
| 1269 | |
| 1270 | When called pDecodedItem must be the array that is tagged as a big |
| 1271 | float or decimal fraction, the array that has the two members, the |
| 1272 | exponent and mantissa. |
| 1273 | |
| 1274 | This will fetch and decode the exponent and mantissa and put the |
| 1275 | result back into pDecodedItem. |
| 1276 | */ |
| 1277 | inline static QCBORError |
| 1278 | QCBORDecode_MantissaAndExponent(QCBORDecodeContext *me, QCBORItem *pDecodedItem) |
| 1279 | { |
| 1280 | QCBORError nReturn; |
| 1281 | |
| 1282 | // --- Make sure it is an array; track nesting level of members --- |
| 1283 | if(pDecodedItem->uDataType != QCBOR_TYPE_ARRAY) { |
| 1284 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1285 | goto Done; |
| 1286 | } |
| 1287 | |
| 1288 | // A check for pDecodedItem->val.uCount == 2 would work for |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1289 | // definite length arrays, but not for indefnite. Instead remember |
| 1290 | // the nesting level the two integers must be at, which is one |
| 1291 | // deeper than that of the array. |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1292 | const int nNestLevel = pDecodedItem->uNestingLevel + 1; |
| 1293 | |
| 1294 | // --- Is it a decimal fraction or a bigfloat? --- |
| 1295 | const bool bIsTaggedDecimalFraction = QCBORDecode_IsTagged(me, pDecodedItem, CBOR_TAG_DECIMAL_FRACTION); |
| 1296 | pDecodedItem->uDataType = bIsTaggedDecimalFraction ? QCBOR_TYPE_DECIMAL_FRACTION : QCBOR_TYPE_BIGFLOAT; |
| 1297 | |
| 1298 | // --- Get the exponent --- |
| 1299 | QCBORItem exponentItem; |
| 1300 | nReturn = QCBORDecode_GetNextMapOrArray(me, &exponentItem, NULL); |
| 1301 | if(nReturn != QCBOR_SUCCESS) { |
| 1302 | goto Done; |
| 1303 | } |
| 1304 | if(exponentItem.uNestingLevel != nNestLevel) { |
| 1305 | // Array is empty or a map/array encountered when expecting an int |
| 1306 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1307 | goto Done; |
| 1308 | } |
| 1309 | if(exponentItem.uDataType == QCBOR_TYPE_INT64) { |
| 1310 | // Data arriving as an unsigned int < INT64_MAX has been converted |
| 1311 | // to QCBOR_TYPE_INT64 and thus handled here. This is also means |
| 1312 | // that the only data arriving here of type QCBOR_TYPE_UINT64 data |
| 1313 | // will be too large for this to handle and thus an error that will |
| 1314 | // get handled in the next else. |
| 1315 | pDecodedItem->val.expAndMantissa.nExponent = exponentItem.val.int64; |
| 1316 | } else { |
| 1317 | // Wrong type of exponent or a QCBOR_TYPE_UINT64 > INT64_MAX |
| 1318 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1319 | goto Done; |
| 1320 | } |
| 1321 | |
| 1322 | // --- Get the mantissa --- |
| 1323 | QCBORItem mantissaItem; |
| 1324 | nReturn = QCBORDecode_GetNextWithTags(me, &mantissaItem, NULL); |
| 1325 | if(nReturn != QCBOR_SUCCESS) { |
| 1326 | goto Done; |
| 1327 | } |
| 1328 | if(mantissaItem.uNestingLevel != nNestLevel) { |
| 1329 | // Mantissa missing or map/array encountered when expecting number |
| 1330 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1331 | goto Done; |
| 1332 | } |
| 1333 | if(mantissaItem.uDataType == QCBOR_TYPE_INT64) { |
| 1334 | // Data arriving as an unsigned int < INT64_MAX has been converted |
| 1335 | // to QCBOR_TYPE_INT64 and thus handled here. This is also means |
| 1336 | // that the only data arriving here of type QCBOR_TYPE_UINT64 data |
| 1337 | // will be too large for this to handle and thus an error that |
| 1338 | // will get handled in an else below. |
| 1339 | pDecodedItem->val.expAndMantissa.Mantissa.nInt = mantissaItem.val.int64; |
| 1340 | } else if(mantissaItem.uDataType == QCBOR_TYPE_POSBIGNUM || mantissaItem.uDataType == QCBOR_TYPE_NEGBIGNUM) { |
| 1341 | // Got a good big num mantissa |
| 1342 | pDecodedItem->val.expAndMantissa.Mantissa.bigNum = mantissaItem.val.bigNum; |
| 1343 | // Depends on numbering of QCBOR_TYPE_XXX |
Laurence Lundblade | 06350ea | 2020-01-27 19:32:40 -0800 | [diff] [blame] | 1344 | pDecodedItem->uDataType = (uint8_t)(pDecodedItem->uDataType + |
| 1345 | mantissaItem.uDataType - QCBOR_TYPE_POSBIGNUM + |
| 1346 | 1); |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1347 | } else { |
| 1348 | // Wrong type of mantissa or a QCBOR_TYPE_UINT64 > INT64_MAX |
| 1349 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1350 | goto Done; |
| 1351 | } |
| 1352 | |
| 1353 | // --- Check that array only has the two numbers --- |
| 1354 | if(mantissaItem.uNextNestLevel == nNestLevel) { |
| 1355 | // Extra items in the decimal fraction / big num |
| 1356 | nReturn = QCBOR_ERR_BAD_EXP_AND_MANTISSA; |
| 1357 | goto Done; |
| 1358 | } |
| 1359 | |
| 1360 | Done: |
| 1361 | |
| 1362 | return nReturn; |
| 1363 | } |
| 1364 | #endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */ |
| 1365 | |
| 1366 | |
| 1367 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1368 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1369 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1370 | QCBORError |
| 1371 | QCBORDecode_GetNextWithTags(QCBORDecodeContext *me, |
| 1372 | QCBORItem *pDecodedItem, |
| 1373 | QCBORTagListOut *pTags) |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1374 | { |
| 1375 | QCBORError nReturn; |
| 1376 | |
| 1377 | nReturn = QCBORDecode_GetNextMapOrArray(me, pDecodedItem, pTags); |
| 1378 | if(nReturn != QCBOR_SUCCESS) { |
| 1379 | goto Done; |
| 1380 | } |
| 1381 | |
| 1382 | #ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA |
| 1383 | #define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_SIX |
| 1384 | #else |
| 1385 | #define TAG_MAPPER_FIRST_XXX TAG_MAPPER_FIRST_FOUR |
| 1386 | #endif |
| 1387 | |
| 1388 | // Only pay attention to tags this code knows how to decode. |
| 1389 | switch(pDecodedItem->uTagBits & TAG_MAPPER_FIRST_XXX) { |
| 1390 | case 0: |
| 1391 | // No tags at all or none we know about. Nothing to do. |
| 1392 | // This is the pass-through path of this function |
| 1393 | // that will mostly be taken when decoding any item. |
| 1394 | break; |
| 1395 | |
| 1396 | case QCBOR_TAGFLAG_DATE_STRING: |
| 1397 | nReturn = DecodeDateString(pDecodedItem); |
| 1398 | break; |
| 1399 | |
| 1400 | case QCBOR_TAGFLAG_DATE_EPOCH: |
| 1401 | nReturn = DecodeDateEpoch(pDecodedItem); |
| 1402 | break; |
| 1403 | |
| 1404 | case QCBOR_TAGFLAG_POS_BIGNUM: |
| 1405 | case QCBOR_TAGFLAG_NEG_BIGNUM: |
| 1406 | nReturn = DecodeBigNum(pDecodedItem); |
| 1407 | break; |
| 1408 | |
| 1409 | #ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA |
| 1410 | case QCBOR_TAGFLAG_DECIMAL_FRACTION: |
| 1411 | case QCBOR_TAGFLAG_BIGFLOAT: |
| 1412 | // For aggregate tagged types, what goes into pTags is only collected |
| 1413 | // from the surrounding data item, not the contents, so pTags is not |
| 1414 | // passed on here. |
| 1415 | |
| 1416 | nReturn = QCBORDecode_MantissaAndExponent(me, pDecodedItem); |
| 1417 | break; |
| 1418 | #endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */ |
| 1419 | |
| 1420 | default: |
| 1421 | // Encountering some mixed-up CBOR like something that |
| 1422 | // is tagged as both a string and integer date. |
| 1423 | nReturn = QCBOR_ERR_BAD_OPT_TAG; |
| 1424 | } |
| 1425 | |
| 1426 | Done: |
| 1427 | if(nReturn != QCBOR_SUCCESS) { |
| 1428 | pDecodedItem->uDataType = QCBOR_TYPE_NONE; |
| 1429 | pDecodedItem->uLabelType = QCBOR_TYPE_NONE; |
| 1430 | } |
| 1431 | return nReturn; |
| 1432 | } |
| 1433 | |
| 1434 | |
| 1435 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1436 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1437 | */ |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 1438 | QCBORError QCBORDecode_GetNext(QCBORDecodeContext *me, QCBORItem *pDecodedItem) |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1439 | { |
| 1440 | return QCBORDecode_GetNextWithTags(me, pDecodedItem, NULL); |
| 1441 | } |
| 1442 | |
| 1443 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1444 | /* |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1445 | Decoding items is done in 5 layered functions, one calling the |
Laurence Lundblade | 0fb2f64 | 2018-10-11 19:33:35 +0530 | [diff] [blame] | 1446 | next one down. If a layer has no work to do for a particular item |
| 1447 | it returns quickly. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1448 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1449 | - QCBORDecode_GetNext, GetNextWithTags -- The top layer processes |
| 1450 | tagged data items, turning them into the local C representation. |
| 1451 | For the most simple it is just associating a QCBOR_TYPE with the data. For |
| 1452 | the complex ones that an aggregate of data items, there is some further |
| 1453 | decoding and a little bit of recursion. |
| 1454 | |
| 1455 | - QCBORDecode_GetNextMapOrArray - This manages the beginnings and |
Laurence Lundblade | 0fb2f64 | 2018-10-11 19:33:35 +0530 | [diff] [blame] | 1456 | ends of maps and arrays. It tracks descending into and ascending |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1457 | out of maps/arrays. It processes all breaks that terminate |
| 1458 | maps and arrays. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1459 | |
Laurence Lundblade | 0fb2f64 | 2018-10-11 19:33:35 +0530 | [diff] [blame] | 1460 | - GetNext_MapEntry -- This handles the combining of two |
| 1461 | items, the label and the data, that make up a map entry. |
| 1462 | It only does work on maps. It combines the label and data |
| 1463 | items into one labeled item. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1464 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1465 | - GetNext_TaggedItem -- This decodes type 6 tagging. It turns the |
| 1466 | tags into bit flags associated with the data item. No actual decoding |
| 1467 | of the contents of the tagged item is performed here. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1468 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1469 | - GetNext_FullItem -- This assembles the sub-items that make up |
Laurence Lundblade | 0fb2f64 | 2018-10-11 19:33:35 +0530 | [diff] [blame] | 1470 | an indefinte length string into one string item. It uses the |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1471 | string allocater to create contiguous space for the item. It |
| 1472 | processes all breaks that are part of indefinite length strings. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1473 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1474 | - GetNext_Item -- This decodes the atomic data items in CBOR. Each |
| 1475 | atomic data item has a "major type", an integer "argument" and optionally |
| 1476 | some content. For text and byte strings, the content is the bytes |
| 1477 | that make up the string. These are the smallest data items that are |
| 1478 | considered to be well-formed. The content may also be other data items in |
| 1479 | the case of aggregate types. They are not handled in this layer. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1480 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1481 | Roughly this takes 300 bytes of stack for vars. Need to |
| 1482 | evaluate this more carefully and correctly. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1483 | |
Laurence Lundblade | 0fb2f64 | 2018-10-11 19:33:35 +0530 | [diff] [blame] | 1484 | */ |
| 1485 | |
| 1486 | |
| 1487 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1488 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1489 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1490 | int QCBORDecode_IsTagged(QCBORDecodeContext *me, |
| 1491 | const QCBORItem *pItem, |
| 1492 | uint64_t uTag) |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1493 | { |
| 1494 | const QCBORTagListIn *pCallerConfiguredTagMap = me->pCallerConfiguredTagList; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1495 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1496 | uint8_t uTagBitIndex; |
| 1497 | // Do not care about errors in pCallerConfiguredTagMap here. They are |
| 1498 | // caught during GetNext() before this is called. |
| 1499 | if(TagMapper_Lookup(pCallerConfiguredTagMap, uTag, &uTagBitIndex)) { |
| 1500 | return 0; |
| 1501 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1502 | |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1503 | const uint64_t uTagBit = 0x01ULL << uTagBitIndex; |
| 1504 | return (uTagBit & pItem->uTagBits) != 0; |
| 1505 | } |
| 1506 | |
| 1507 | |
| 1508 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1509 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | dbe6f21 | 2018-10-28 11:37:53 +0700 | [diff] [blame] | 1510 | */ |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 1511 | QCBORError QCBORDecode_Finish(QCBORDecodeContext *me) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1512 | { |
Laurence Lundblade | 06350ea | 2020-01-27 19:32:40 -0800 | [diff] [blame] | 1513 | QCBORError nReturn = QCBOR_SUCCESS; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1514 | |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 1515 | // Error out if all the maps/arrays are not closed out |
| 1516 | if(DecodeNesting_IsNested(&(me->nesting))) { |
| 1517 | nReturn = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN; |
| 1518 | goto Done; |
| 1519 | } |
| 1520 | |
| 1521 | // Error out if not all the bytes are consumed |
| 1522 | if(UsefulInputBuf_BytesUnconsumed(&(me->InBuf))) { |
| 1523 | nReturn = QCBOR_ERR_EXTRA_BYTES; |
| 1524 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1525 | |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 1526 | Done: |
Laurence Lundblade | 6de3706 | 2018-10-15 12:22:42 +0530 | [diff] [blame] | 1527 | // Call the destructor for the string allocator if there is one. |
Laurence Lundblade | 20b533d | 2018-10-08 20:44:53 +0800 | [diff] [blame] | 1528 | // Always called, even if there are errors; always have to clean up |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1529 | StringAllocator_Destruct(&(me->StringAllocator)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1530 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1531 | return nReturn; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1532 | } |
| 1533 | |
| 1534 | |
| 1535 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1536 | /* |
| 1537 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1538 | Decoder errors handled in this file |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1539 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1540 | - Hit end of input before it was expected while decoding type and |
| 1541 | number QCBOR_ERR_HIT_END |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1542 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1543 | - negative integer that is too large for C QCBOR_ERR_INT_OVERFLOW |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1544 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1545 | - Hit end of input while decoding a text or byte string |
| 1546 | QCBOR_ERR_HIT_END |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1547 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1548 | - Encountered conflicting tags -- e.g., an item is tagged both a date |
| 1549 | string and an epoch date QCBOR_ERR_UNSUPPORTED |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1550 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1551 | - Encontered an array or mapp that has too many items |
| 1552 | QCBOR_ERR_ARRAY_TOO_LONG |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1553 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1554 | - Encountered array/map nesting that is too deep |
| 1555 | QCBOR_ERR_ARRAY_NESTING_TOO_DEEP |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1556 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1557 | - An epoch date > INT64_MAX or < INT64_MIN was encountered |
| 1558 | QCBOR_ERR_DATE_OVERFLOW |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1559 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1560 | - The type of a map label is not a string or int |
| 1561 | QCBOR_ERR_MAP_LABEL_TYPE |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1562 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1563 | - Hit end with arrays or maps still open -- QCBOR_ERR_EXTRA_BYTES |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1564 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1565 | */ |
| 1566 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1567 | |
| 1568 | |
Laurence Lundblade | f653166 | 2018-12-04 10:42:22 +0900 | [diff] [blame] | 1569 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1570 | /* =========================================================================== |
| 1571 | MemPool -- BUILT-IN SIMPLE STRING ALLOCATOR |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1572 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1573 | This implements a simple sting allocator for indefinite length |
| 1574 | strings that can be enabled by calling QCBORDecode_SetMemPool(). It |
| 1575 | implements the function type QCBORStringAllocate and allows easy |
| 1576 | use of it. |
Laurence Lundblade | f653166 | 2018-12-04 10:42:22 +0900 | [diff] [blame] | 1577 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1578 | This particular allocator is built-in for convenience. The caller |
| 1579 | can implement their own. All of this following code will get |
| 1580 | dead-stripped if QCBORDecode_SetMemPool() is not called. |
| 1581 | |
| 1582 | This is a very primitive memory allocator. It does not track |
| 1583 | individual allocations, only a high-water mark. A free or |
| 1584 | reallocation must be of the last chunk allocated. |
| 1585 | |
| 1586 | The size of the pool and offset to free memory are packed into the |
| 1587 | first 8 bytes of the memory pool so we don't have to keep them in |
| 1588 | the decode context. Since the address of the pool may not be |
| 1589 | aligned, they have to be packed and unpacked as if they were |
| 1590 | serialized data of the wire or such. |
| 1591 | |
| 1592 | The sizes packed in are uint32_t to be the same on all CPU types |
| 1593 | and simplify the code. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1594 | ========================================================================== */ |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1595 | |
| 1596 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1597 | static inline int |
| 1598 | MemPool_Unpack(const void *pMem, uint32_t *puPoolSize, uint32_t *puFreeOffset) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1599 | { |
| 1600 | // Use of UsefulInputBuf is overkill, but it is convenient. |
| 1601 | UsefulInputBuf UIB; |
| 1602 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1603 | // Just assume the size here. It was checked during SetUp so |
| 1604 | // the assumption is safe. |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1605 | UsefulInputBuf_Init(&UIB, (UsefulBufC){pMem, QCBOR_DECODE_MIN_MEM_POOL_SIZE}); |
| 1606 | *puPoolSize = UsefulInputBuf_GetUint32(&UIB); |
| 1607 | *puFreeOffset = UsefulInputBuf_GetUint32(&UIB); |
| 1608 | return UsefulInputBuf_GetError(&UIB); |
| 1609 | } |
| 1610 | |
| 1611 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1612 | static inline int |
| 1613 | MemPool_Pack(UsefulBuf Pool, uint32_t uFreeOffset) |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1614 | { |
| 1615 | // Use of UsefulOutBuf is overkill, but convenient. The |
| 1616 | // length check performed here is useful. |
| 1617 | UsefulOutBuf UOB; |
| 1618 | |
| 1619 | UsefulOutBuf_Init(&UOB, Pool); |
| 1620 | UsefulOutBuf_AppendUint32(&UOB, (uint32_t)Pool.len); // size of pool |
| 1621 | UsefulOutBuf_AppendUint32(&UOB, uFreeOffset); // first free position |
| 1622 | return UsefulOutBuf_GetError(&UOB); |
| 1623 | } |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1624 | |
| 1625 | |
| 1626 | /* |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1627 | Internal function for an allocation, reallocation free and destuct. |
| 1628 | |
| 1629 | Having only one function rather than one each per mode saves space in |
| 1630 | QCBORDecodeContext. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1631 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1632 | Code Reviewers: THIS FUNCTION DOES POINTER MATH |
| 1633 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1634 | static UsefulBuf |
| 1635 | MemPool_Function(void *pPool, void *pMem, size_t uNewSize) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1636 | { |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1637 | UsefulBuf ReturnValue = NULLUsefulBuf; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1638 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1639 | uint32_t uPoolSize; |
| 1640 | uint32_t uFreeOffset; |
| 1641 | |
| 1642 | if(uNewSize > UINT32_MAX) { |
| 1643 | // This allocator is only good up to 4GB. This check should |
| 1644 | // optimize out if sizeof(size_t) == sizeof(uint32_t) |
| 1645 | goto Done; |
| 1646 | } |
| 1647 | const uint32_t uNewSize32 = (uint32_t)uNewSize; |
| 1648 | |
| 1649 | if(MemPool_Unpack(pPool, &uPoolSize, &uFreeOffset)) { |
| 1650 | goto Done; |
| 1651 | } |
| 1652 | |
| 1653 | if(uNewSize) { |
| 1654 | if(pMem) { |
| 1655 | // REALLOCATION MODE |
| 1656 | // Calculate pointer to the end of the memory pool. It is |
| 1657 | // assumed that pPool + uPoolSize won't wrap around by |
| 1658 | // assuming the caller won't pass a pool buffer in that is |
| 1659 | // not in legitimate memory space. |
| 1660 | const void *pPoolEnd = (uint8_t *)pPool + uPoolSize; |
| 1661 | |
| 1662 | // Check that the pointer for reallocation is in the range of the |
| 1663 | // pool. This also makes sure that pointer math further down |
| 1664 | // doesn't wrap under or over. |
| 1665 | if(pMem >= pPool && pMem < pPoolEnd) { |
| 1666 | // Offset to start of chunk for reallocation. This won't |
| 1667 | // wrap under because of check that pMem >= pPool. Cast |
| 1668 | // is safe because the pool is always less than UINT32_MAX |
| 1669 | // because of check in QCBORDecode_SetMemPool(). |
| 1670 | const uint32_t uMemOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool); |
| 1671 | |
| 1672 | // Check to see if the allocation will fit. uPoolSize - |
| 1673 | // uMemOffset will not wrap under because of check that |
| 1674 | // pMem is in the range of the uPoolSize by check above. |
| 1675 | if(uNewSize <= uPoolSize - uMemOffset) { |
| 1676 | ReturnValue.ptr = pMem; |
| 1677 | ReturnValue.len = uNewSize; |
| 1678 | |
| 1679 | // Addition won't wrap around over because uNewSize was |
| 1680 | // checked to be sure it is less than the pool size. |
| 1681 | uFreeOffset = uMemOffset + uNewSize32; |
| 1682 | } |
| 1683 | } |
| 1684 | } else { |
| 1685 | // ALLOCATION MODE |
| 1686 | // uPoolSize - uFreeOffset will not underflow because this |
| 1687 | // pool implementation makes sure uFreeOffset is always |
| 1688 | // smaller than uPoolSize through this check here and |
| 1689 | // reallocation case. |
| 1690 | if(uNewSize <= uPoolSize - uFreeOffset) { |
| 1691 | ReturnValue.len = uNewSize; |
| 1692 | ReturnValue.ptr = (uint8_t *)pPool + uFreeOffset; |
Laurence Lundblade | 06350ea | 2020-01-27 19:32:40 -0800 | [diff] [blame] | 1693 | uFreeOffset += (uint32_t)uNewSize; |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1694 | } |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1695 | } |
| 1696 | } else { |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1697 | if(pMem) { |
| 1698 | // FREE MODE |
| 1699 | // Cast is safe because of limit on pool size in |
| 1700 | // QCBORDecode_SetMemPool() |
| 1701 | uFreeOffset = (uint32_t)((uint8_t *)pMem - (uint8_t *)pPool); |
| 1702 | } else { |
| 1703 | // DESTRUCT MODE |
| 1704 | // Nothing to do for this allocator |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1705 | } |
| 1706 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1707 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1708 | UsefulBuf Pool = {pPool, uPoolSize}; |
| 1709 | MemPool_Pack(Pool, uFreeOffset); |
| 1710 | |
| 1711 | Done: |
| 1712 | return ReturnValue; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1713 | } |
| 1714 | |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1715 | |
Laurence Lundblade | f653166 | 2018-12-04 10:42:22 +0900 | [diff] [blame] | 1716 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 1717 | Public function, see header qcbor/qcbor_decode.h file |
Laurence Lundblade | f653166 | 2018-12-04 10:42:22 +0900 | [diff] [blame] | 1718 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1719 | QCBORError QCBORDecode_SetMemPool(QCBORDecodeContext *pMe, |
| 1720 | UsefulBuf Pool, |
| 1721 | bool bAllStrings) |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1722 | { |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1723 | // The pool size and free mem offset are packed into the beginning |
| 1724 | // of the pool memory. This compile time check make sure the |
| 1725 | // constant in the header is correct. This check should optimize |
| 1726 | // down to nothing. |
| 1727 | if(QCBOR_DECODE_MIN_MEM_POOL_SIZE < 2 * sizeof(uint32_t)) { |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 1728 | return QCBOR_ERR_BUFFER_TOO_SMALL; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1729 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1730 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1731 | // The pool size and free offset packed in to the beginning of pool |
| 1732 | // memory are only 32-bits. This check will optimize out on 32-bit |
| 1733 | // machines. |
| 1734 | if(Pool.len > UINT32_MAX) { |
| 1735 | return QCBOR_ERR_BUFFER_TOO_LARGE; |
| 1736 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1737 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1738 | // This checks that the pool buffer given is big enough. |
| 1739 | if(MemPool_Pack(Pool, QCBOR_DECODE_MIN_MEM_POOL_SIZE)) { |
| 1740 | return QCBOR_ERR_BUFFER_TOO_SMALL; |
| 1741 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1742 | |
Laurence Lundblade | 1d7eb63 | 2019-02-17 17:23:38 -0800 | [diff] [blame] | 1743 | pMe->StringAllocator.pfAllocator = MemPool_Function; |
| 1744 | pMe->StringAllocator.pAllocateCxt = Pool.ptr; |
| 1745 | pMe->bStringAllocateAll = bAllStrings; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1746 | |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 1747 | return QCBOR_SUCCESS; |
Laurence Lundblade | 041ffa5 | 2018-10-07 11:43:51 +0700 | [diff] [blame] | 1748 | } |