Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1 | /* =========================================================================== |
| 2 | * Copyright (c) 2016-2018, The Linux Foundation. |
| 3 | * Copyright (c) 2018-2024, Laurence Lundblade. |
| 4 | * Copyright (c) 2021, Arm Limited. |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions are |
| 9 | * met: |
| 10 | * * Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * * Redistributions in binary form must reproduce the above |
| 13 | * copyright notice, this list of conditions and the following |
| 14 | * disclaimer in the documentation and/or other materials provided |
| 15 | * with the distribution. |
| 16 | * * Neither the name of The Linux Foundation nor the names of its |
| 17 | * contributors, nor the name "Laurence Lundblade" may be used to |
| 18 | * endorse or promote products derived from this software without |
| 19 | * specific prior written permission. |
| 20 | * |
| 21 | * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED |
| 22 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 23 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT |
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS |
| 25 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 26 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 27 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 28 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 29 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| 30 | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| 31 | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 32 | * ========================================================================= */ |
Laurence Lundblade | 624405d | 2018-09-18 20:10:47 -0700 | [diff] [blame] | 33 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 34 | |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 35 | #include "qcbor/qcbor_encode.h" |
Laurence Lundblade | 12d32c5 | 2018-09-19 11:25:27 -0700 | [diff] [blame] | 36 | #include "ieee754.h" |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 37 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 38 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
| 39 | #include <math.h> /* Only for NAN definition */ |
| 40 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 41 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 42 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 43 | /** |
| 44 | * @file qcbor_encode.c |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 45 | * |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 46 | * The entire implementation of the QCBOR encoder. |
| 47 | */ |
| 48 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 49 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 50 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 51 | * == Nesting Tracking == |
| 52 | * |
| 53 | * The following functions and data type QCBORTrackNesting implement |
| 54 | * the nesting management for encoding. |
| 55 | * |
| 56 | * CBOR's two nesting types, arrays and maps, are tracked here. There |
| 57 | * is a limit of QCBOR_MAX_ARRAY_NESTING to the number of arrays and |
| 58 | * maps that can be nested in one encoding so the encoding context |
| 59 | * stays small enough to fit on the stack. |
| 60 | * |
| 61 | * When an array/map is opened, pCurrentNesting points to the element |
| 62 | * in pArrays that records the type, start position and accumulates a |
| 63 | * count of the number of items added. When closed the start position |
| 64 | * is used to go back and fill in the type and number of items in the |
| 65 | * array/map. |
| 66 | * |
| 67 | * Encoded output can be a CBOR Sequence (RFC 8742) in which case |
| 68 | * there is no top-level array or map. It starts out with a string, |
| 69 | * integer or other non-aggregate type. It may have an array or map |
| 70 | * other than at the start, in which case that nesting is tracked |
| 71 | * here. |
| 72 | * |
| 73 | * QCBOR has a special feature to allow constructing byte string |
| 74 | * wrapped CBOR directly into the output buffer, so no extra buffer is |
| 75 | * needed for byte string wrapping. This is implemented as nesting |
| 76 | * with the type CBOR_MAJOR_TYPE_BYTE_STRING and is tracked here. Byte |
| 77 | * string wrapped CBOR is used by COSE for data that is to be hashed. |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 78 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 79 | static void |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 80 | Nesting_Init(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 81 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 82 | /* Assumes pNesting has been zeroed. */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 83 | pNesting->pCurrentNesting = &pNesting->pArrays[0]; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 84 | /* Implied CBOR array at the top nesting level. This is never |
| 85 | * returned, but makes the item count work correctly. |
| 86 | */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 87 | pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY; |
| 88 | } |
| 89 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 90 | static uint8_t |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 91 | Nesting_Increase(QCBORTrackNesting *pNesting, |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 92 | const uint8_t uMajorType, |
| 93 | const uint32_t uPos) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 94 | { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 95 | if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) { |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 96 | return QCBOR_ERR_ARRAY_NESTING_TOO_DEEP; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 97 | } else { |
| 98 | pNesting->pCurrentNesting++; |
| 99 | pNesting->pCurrentNesting->uCount = 0; |
| 100 | pNesting->pCurrentNesting->uStart = uPos; |
| 101 | pNesting->pCurrentNesting->uMajorType = uMajorType; |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 102 | return QCBOR_SUCCESS; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 103 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 104 | } |
| 105 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 106 | static void |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 107 | Nesting_Decrease(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 108 | { |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 109 | if(pNesting->pCurrentNesting > &pNesting->pArrays[0]) { |
| 110 | pNesting->pCurrentNesting--; |
| 111 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 112 | } |
| 113 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 114 | static uint8_t |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 115 | Nesting_Increment(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 116 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 117 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | b95afec | 2024-08-26 10:51:28 -0700 | [diff] [blame] | 118 | if(pNesting->pCurrentNesting->uCount >= QCBOR_MAX_ITEMS_IN_ARRAY) { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 119 | return QCBOR_ERR_ARRAY_TOO_LONG; |
| 120 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 121 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 122 | |
Laurence Lundblade | e6bcef1 | 2020-04-01 10:56:27 -0700 | [diff] [blame] | 123 | pNesting->pCurrentNesting->uCount++; |
Laurence Lundblade | 2c40ab8 | 2018-12-30 14:20:29 -0800 | [diff] [blame] | 124 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 125 | return QCBOR_SUCCESS; |
| 126 | } |
| 127 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 128 | static void |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 129 | Nesting_Decrement(QCBORTrackNesting *pNesting) |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 130 | { |
| 131 | /* No error check for going below 0 here needed because this |
| 132 | * is only used by QCBOREncode_CancelBstrWrap() and it checks |
| 133 | * the nesting level before calling this. */ |
| 134 | pNesting->pCurrentNesting->uCount--; |
| 135 | } |
| 136 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 137 | static uint16_t |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 138 | Nesting_GetCount(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 139 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 140 | /* The nesting count recorded is always the actual number of |
| 141 | * individual data items in the array or map. For arrays CBOR uses |
| 142 | * the actual item count. For maps, CBOR uses the number of pairs. |
| 143 | * This function returns the number needed for the CBOR encoding, |
| 144 | * so it divides the number of items by two for maps to get the |
| 145 | * number of pairs. |
| 146 | */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 147 | if(pNesting->pCurrentNesting->uMajorType == CBOR_MAJOR_TYPE_MAP) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 148 | /* Cast back to uint16_t after integer promotion from bit shift */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 149 | return (uint16_t)(pNesting->pCurrentNesting->uCount >> 1); |
| 150 | } else { |
| 151 | return pNesting->pCurrentNesting->uCount; |
| 152 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 153 | } |
| 154 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 155 | static uint32_t |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 156 | Nesting_GetStartPos(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 157 | { |
| 158 | return pNesting->pCurrentNesting->uStart; |
| 159 | } |
| 160 | |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 161 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 162 | static uint8_t |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 163 | Nesting_GetMajorType(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 164 | { |
| 165 | return pNesting->pCurrentNesting->uMajorType; |
| 166 | } |
| 167 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 168 | static bool |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 169 | Nesting_IsInNest(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 170 | { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 171 | return pNesting->pCurrentNesting == &pNesting->pArrays[0] ? false : true; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 172 | } |
Laurence Lundblade | e222674 | 2024-08-16 10:50:23 -0700 | [diff] [blame] | 173 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 174 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 175 | |
| 176 | |
| 177 | |
| 178 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 179 | * == Major CBOR Types == |
| 180 | * |
| 181 | * Encoding of the major CBOR types is by these functions: |
| 182 | * |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 183 | * CBOR Major Type Public Function |
| 184 | * 0 QCBOREncode_AddUInt64() |
| 185 | * 0, 1 QCBOREncode_AddUInt64(), QCBOREncode_AddInt64() |
| 186 | * 2, 3 QCBOREncode_AddBuffer() |
| 187 | * 4, 5 QCBOREncode_OpenMapOrArray(), QCBOREncode_CloseMapOrArray(), |
| 188 | * QCBOREncode_OpenMapOrArrayIndefiniteLength(), |
| 189 | * QCBOREncode_CloseMapOrArrayIndefiniteLength() |
Laurence Lundblade | 721b56e | 2024-10-22 03:02:04 -0700 | [diff] [blame] | 190 | * 6 QCBOREncode_AddTagNumber() |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 191 | * 7 QCBOREncode_AddDouble(), QCBOREncode_AddFloat(), |
| 192 | * QCBOREncode_AddDoubleNoPreferred(), |
| 193 | * QCBOREncode_AddFloatNoPreferred(), QCBOREncode_AddType7() |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 194 | * |
| 195 | * Additionally, encoding of decimal fractions and bigfloats is by |
| 196 | * QCBOREncode_AddExponentAndMantissa() and byte strings that wrap |
| 197 | * encoded CBOR are handled by QCBOREncode_OpenMapOrArray() and |
| 198 | * QCBOREncode_CloseBstrWrap2(). |
| 199 | * |
| 200 | * |
| 201 | * == Error Tracking Plan == |
| 202 | * |
| 203 | * Errors are tracked internally and not returned until |
| 204 | * QCBOREncode_Finish() or QCBOREncode_GetErrorState() is called. The |
| 205 | * CBOR errors are in me->uError. UsefulOutBuf also tracks whether |
| 206 | * the buffer is full or not in its context. Once either of these |
| 207 | * errors is set they are never cleared. Only QCBOREncode_Init() |
| 208 | * resets them. Or said another way, they must never be cleared or |
| 209 | * we'll tell the caller all is good when it is not. |
| 210 | * |
| 211 | * Only one error code is reported by QCBOREncode_Finish() even if |
| 212 | * there are multiple errors. The last one set wins. The caller might |
| 213 | * have to fix one error to reveal the next one they have to fix. |
| 214 | * This is OK. |
| 215 | * |
| 216 | * The buffer full error tracked by UsefulBuf is only pulled out of |
| 217 | * UsefulBuf in QCBOREncode_Finish() so it is the one that usually |
| 218 | * wins. UsefulBuf will never go off the end of the buffer even if it |
| 219 | * is called again and again when full. |
| 220 | * |
| 221 | * QCBOR_DISABLE_ENCODE_USAGE_GUARDS disables about half of the error |
| 222 | * checks here to reduce code size by about 150 bytes leaving only the |
| 223 | * checks for size to avoid buffer overflow. If the calling code is |
| 224 | * completely correct, checks are completely unnecessary. For |
| 225 | * example, there is no need to check that all the opens are matched |
| 226 | * by a close. |
| 227 | * |
| 228 | * QCBOR_DISABLE_ENCODE_USAGE_GUARDS also disables the check for more |
| 229 | * than QCBOR_MAX_ITEMS_IN_ARRAY in an array. Since |
Laurence Lundblade | b95afec | 2024-08-26 10:51:28 -0700 | [diff] [blame] | 230 | * QCBOR_MAX_ITEMS_IN_ARRAY is very large (65,534) it is very unlikely |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 231 | * to be reached. If it is reached, the count will wrap around to zero |
| 232 | * and CBOR that is not well formed will be produced, but there will |
| 233 | * be no buffers overrun and new security issues in the code. |
| 234 | * |
| 235 | * The 8 errors returned here fall into three categories: |
| 236 | * |
| 237 | * Sizes |
| 238 | * QCBOR_ERR_BUFFER_TOO_LARGE -- Encoded output exceeded UINT32_MAX |
| 239 | * QCBOR_ERR_BUFFER_TOO_SMALL -- Output buffer too small |
| 240 | * QCBOR_ERR_ARRAY_NESTING_TOO_DEEP -- Nesting > QCBOR_MAX_ARRAY_NESTING1 |
| 241 | * QCBOR_ERR_ARRAY_TOO_LONG -- Too many items added to an array/map [1] |
| 242 | * |
| 243 | * Nesting constructed incorrectly |
| 244 | * QCBOR_ERR_TOO_MANY_CLOSES -- More close calls than opens [1] |
| 245 | * QCBOR_ERR_CLOSE_MISMATCH -- Type of close does not match open [1] |
| 246 | * QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN -- Finish called without enough closes [1] |
| 247 | * |
| 248 | * Would generate not-well-formed CBOR |
| 249 | * QCBOR_ERR_ENCODE_UNSUPPORTED -- Simple type between 24 and 31 [1] |
| 250 | * |
| 251 | * [1] indicated disabled by QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 252 | */ |
| 253 | |
| 254 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 255 | /* Forward declaration for reference in QCBOREncode_Init() */ |
| 256 | static void |
| 257 | QCBOREncode_Private_CloseMapUnsorted(QCBOREncodeContext *pMe); |
| 258 | |
| 259 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 260 | /* |
Laurence Lundblade | b9ccd6b | 2024-02-06 05:44:25 -0700 | [diff] [blame] | 261 | * Public function for initialization. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 262 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 263 | void |
| 264 | QCBOREncode_Init(QCBOREncodeContext *pMe, UsefulBuf Storage) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 265 | { |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 266 | memset(pMe, 0, sizeof(QCBOREncodeContext)); |
| 267 | UsefulOutBuf_Init(&(pMe->OutBuf), Storage); |
| 268 | Nesting_Init(&(pMe->nesting)); |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 269 | pMe->pfnCloseMap = QCBOREncode_Private_CloseMapUnsorted; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 270 | } |
| 271 | |
| 272 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 273 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 274 | * Public function to encode a CBOR head. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 275 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 276 | UsefulBufC |
| 277 | QCBOREncode_EncodeHead(UsefulBuf Buffer, |
| 278 | uint8_t uMajorType, |
| 279 | uint8_t uMinLen, |
| 280 | uint64_t uArgument) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 281 | { |
Laurence Lundblade | e9b0032 | 2018-12-30 10:33:26 -0800 | [diff] [blame] | 282 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 283 | * == Description of the CBOR Head == |
| 284 | * |
| 285 | * The head of a CBOR data item |
| 286 | * +---+-----+ +--------+ +--------+ +--------+ +--------+ |
| 287 | * |M T| A R G U M E N T . . . | |
| 288 | * +---+-----+ +--------+ +--------+ +--------+ ... +--------+ |
| 289 | * |
| 290 | * Every CBOR data item has a "head". It is made up of the "major |
| 291 | * type" and the "argument". |
| 292 | * |
| 293 | * The major type indicates whether the data item is an integer, |
| 294 | * string, array or such. It is encoded in 3 bits giving it a range |
| 295 | * from 0 to 7. 0 indicates the major type is a positive integer, |
| 296 | * 1 a negative integer, 2 a byte string and so on. |
| 297 | * |
| 298 | * These 3 bits are the first part of the "initial byte" in a data |
| 299 | * item. Every data item has an initial byte, and some only have |
| 300 | * the initial byte. |
| 301 | * |
| 302 | * The argument is essentially a number between 0 and UINT64_MAX |
| 303 | * (18446744073709551615). This number is interpreted to mean |
| 304 | * different things for the different major types. For major type |
| 305 | * 0, a positive integer, it is value of the data item. For major |
| 306 | * type 2, a byte string, it is the length in bytes of the byte |
| 307 | * string. For major type 4, an array, it is the number of data |
| 308 | * items in the array. |
| 309 | * |
| 310 | * Special encoding is used so that the argument values less than |
| 311 | * 24 can be encoded very compactly in the same byte as the major |
| 312 | * type is encoded. When the lower 5 bits of the initial byte have |
| 313 | * a value less than 24, then that is the value of the argument. |
| 314 | * |
| 315 | * If the lower 5 bits of the initial byte are less than 24, then |
| 316 | * they are the value of the argument. This allows integer values 0 |
| 317 | * - 23 to be CBOR encoded in just one byte. |
| 318 | * |
| 319 | * When the value of lower 5 bits are 24, 25, 26, or 27 the |
| 320 | * argument is encoded in 1, 2, 4 or 8 bytes following the initial |
| 321 | * byte in network byte order (bit endian). The cases when it is |
| 322 | * 28, 29 and 30 are reserved for future use. The value 31 is a |
| 323 | * special indicator for indefinite length strings, arrays and |
| 324 | * maps. |
| 325 | * |
| 326 | * The lower 5 bits are called the "additional information." |
| 327 | * |
| 328 | * Thus the CBOR head may be 1, 2, 3, 5 or 9 bytes long. |
| 329 | * |
| 330 | * It is legal in CBOR to encode the argument using any of these |
| 331 | * lengths even if it could be encoded in a shorter length. For |
| 332 | * example it is legal to encode a data item representing the |
| 333 | * positive integer 0 in 9 bytes even though it could be encoded in |
| 334 | * only 0. This is legal to allow for for very simple code or even |
| 335 | * hardware-only implementations that just output a register |
| 336 | * directly. |
| 337 | * |
| 338 | * CBOR defines preferred encoding as the encoding of the argument |
| 339 | * in the smallest number of bytes needed to encode it. |
| 340 | * |
| 341 | * This function takes the major type and argument as inputs and |
| 342 | * outputs the encoded CBOR head for them. It does conversion to |
| 343 | * network byte order. It implements CBOR preferred encoding, |
| 344 | * outputting the shortest representation of the argument. |
| 345 | * |
| 346 | * == Endian Conversion == |
| 347 | * |
| 348 | * This code does endian conversion without hton() or knowing the |
| 349 | * endianness of the machine by using masks and shifts. This avoids |
| 350 | * the dependency on hton() and the mess of figuring out how to |
| 351 | * find the machine's endianness. |
| 352 | * |
| 353 | * This is a good efficient implementation on little-endian |
| 354 | * machines. A faster and smaller implementation is possible on |
| 355 | * big-endian machines because CBOR/network byte order is |
| 356 | * big-endian. However big-endian machines are uncommon. |
| 357 | * |
| 358 | * On x86, this is about 150 bytes instead of 500 bytes for the |
| 359 | * original, more formal unoptimized code. |
| 360 | * |
| 361 | * This also does the CBOR preferred shortest encoding for integers |
| 362 | * and is called to do endian conversion for floats. |
| 363 | * |
| 364 | * It works backwards from the least significant byte to the most |
| 365 | * significant byte. |
| 366 | * |
| 367 | * == Floating Point == |
| 368 | * |
| 369 | * When the major type is 7 and the 5 lower bits have the values |
| 370 | * 25, 26 or 27, the argument is a floating-point number that is |
| 371 | * half, single or double-precision. Note that it is not the |
| 372 | * conversion from a floating-point value to an integer value like |
| 373 | * converting 0x00 to 0.00, it is the interpretation of the bits in |
| 374 | * the argument as an IEEE 754 float-point number. |
| 375 | * |
| 376 | * Floating-point numbers must be converted to network byte |
| 377 | * order. That is accomplished here by exactly the same code that |
| 378 | * converts integer arguments to network byte order. |
| 379 | * |
| 380 | * There is preferred encoding for floating-point numbers in CBOR, |
| 381 | * but it is very different than for integers and it is not |
| 382 | * implemented here. Half-precision is preferred to |
| 383 | * single-precision which is preferred to double-precision only if |
| 384 | * the conversion can be performed without loss of precision. Zero |
| 385 | * and infinity can always be converted to half-precision, without |
| 386 | * loss but 3.141592653589 cannot. |
| 387 | * |
| 388 | * The way this function knows to not do preferred encoding on the |
| 389 | * argument passed here when it is a floating point number is the |
| 390 | * uMinLen parameter. It should be 2, 4 or 8 for half, single and |
| 391 | * double precision floating point values. This prevents and the |
| 392 | * incorrect removal of leading zeros when encoding arguments that |
| 393 | * are floating-point numbers. |
| 394 | * |
| 395 | * == Use of Type int and Static Analyzers == |
| 396 | * |
| 397 | * The type int is used here for several variables because of the |
| 398 | * way integer promotion works in C for variables that are uint8_t |
| 399 | * or uint16_t. The basic rule is that they will always be promoted |
| 400 | * to int if they will fit. These integer variables here need only |
| 401 | * hold values less than 255 so they will always fit into an int. |
| 402 | * |
| 403 | * Most of values stored are never negative, so one might think |
| 404 | * that unsigned int would be more correct than int. However the C |
| 405 | * integer promotion rules only promote to unsigned int if the |
| 406 | * result won't fit into an int even if the promotion is for an |
| 407 | * unsigned variable like uint8_t. |
| 408 | * |
| 409 | * By declaring these int, there are few implicit conversions and |
| 410 | * fewer casts needed. Code size is reduced a little. It makes |
| 411 | * static analyzers happier. |
| 412 | * |
| 413 | * Note also that declaring these uint8_t won't stop integer wrap |
| 414 | * around if the code is wrong. It won't make the code more |
| 415 | * correct. |
| 416 | * |
| 417 | * https://stackoverflow.com/questions/46073295/implicit-type-promotion-rules |
| 418 | * https://stackoverflow.com/questions/589575/what-does-the-c-standard-state-the-size-of-int-long-type-to-be |
| 419 | * |
| 420 | * Code Reviewers: THIS FUNCTION DOES POINTER MATH |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 421 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 422 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 423 | /* The buffer must have room for the largest CBOR HEAD + one |
| 424 | * extra. The one extra is needed for this code to work as it does |
| 425 | * a pre-decrement. |
| 426 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 427 | if(Buffer.len < QCBOR_HEAD_BUFFER_SIZE) { |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 428 | return NULLUsefulBufC; |
| 429 | } |
| 430 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 431 | /* Pointer to last valid byte in the buffer */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 432 | uint8_t * const pBufferEnd = &((uint8_t *)Buffer.ptr)[QCBOR_HEAD_BUFFER_SIZE-1]; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 433 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 434 | /* Point to the last byte and work backwards */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 435 | uint8_t *pByte = pBufferEnd; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 436 | /* The 5 bits in the initial byte that are not the major type */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 437 | int nAdditionalInfo; |
Laurence Lundblade | 2c40ab8 | 2018-12-30 14:20:29 -0800 | [diff] [blame] | 438 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 439 | #ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 440 | if(uMajorType > QCBOR_INDEFINITE_LEN_TYPE_MODIFIER) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 441 | /* Special case for start & end of indefinite length */ |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 442 | uMajorType = uMajorType - QCBOR_INDEFINITE_LEN_TYPE_MODIFIER; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 443 | /* This takes advantage of design of CBOR where additional info |
| 444 | * is 31 for both opening and closing indefinite length |
| 445 | * maps and arrays. |
| 446 | */ |
| 447 | #if CBOR_SIMPLE_BREAK != LEN_IS_INDEFINITE |
| 448 | #error additional info for opening array not the same as for closing |
| 449 | #endif |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 450 | nAdditionalInfo = CBOR_SIMPLE_BREAK; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 451 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 452 | } else |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 453 | #endif /* ! QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 454 | if (uArgument < CBOR_TWENTY_FOUR && uMinLen == 0) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 455 | /* Simple case where argument is < 24 */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 456 | nAdditionalInfo = (int)uArgument; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 457 | |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 458 | } else { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 459 | /* This encodes the argument in 1,2,4 or 8 bytes. The outer loop |
| 460 | * runs once for 1 byte and 4 times for 8 bytes. The inner loop |
| 461 | * runs 1, 2 or 4 times depending on outer loop counter. This |
| 462 | * works backwards shifting 8 bits off the argument being |
| 463 | * encoded at a time until all bits from uArgument have been |
| 464 | * encoded and the minimum encoding size is reached. Minimum |
| 465 | * encoding size is for floating-point numbers that have some |
| 466 | * zero-value bytes that must be output. |
Laurence Lundblade | e9b0032 | 2018-12-30 10:33:26 -0800 | [diff] [blame] | 467 | */ |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 468 | static const uint8_t aIterate[] = {1,1,2,4}; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 469 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 470 | /* uMinLen passed in is unsigned, but goes negative in the loop |
| 471 | * so it must be converted to a signed value. |
| 472 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 473 | int nMinLen = (int)uMinLen; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 474 | int i; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 475 | for(i = 0; uArgument || nMinLen > 0; i++) { |
| 476 | const int nIterations = (int)aIterate[i]; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 477 | for(int j = 0; j < nIterations; j++) { |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 478 | *--pByte = (uint8_t)(uArgument & 0xff); |
| 479 | uArgument = uArgument >> 8; |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 480 | } |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 481 | nMinLen -= nIterations; |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 482 | } |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 483 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 484 | nAdditionalInfo = LEN_IS_ONE_BYTE-1 + i; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 485 | } |
Laurence Lundblade | f970f1d | 2018-12-14 01:44:23 -0800 | [diff] [blame] | 486 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 487 | /* This expression integer-promotes to type int. The code above in |
| 488 | * function guarantees that nAdditionalInfo will never be larger |
| 489 | * than 0x1f. The caller may pass in a too-large uMajor type. The |
Laurence Lundblade | 1165491 | 2024-05-09 11:49:24 -0700 | [diff] [blame] | 490 | * conversion to uint8_t will cause an integer wrap around and |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 491 | * incorrect CBOR will be generated, but no security issue will |
| 492 | * occur. |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 493 | */ |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 494 | const int nInitialByte = (uMajorType << 5) + nAdditionalInfo; |
| 495 | *--pByte = (uint8_t)nInitialByte; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 496 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 497 | #ifdef EXTRA_ENCODE_HEAD_CHECK |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 498 | /* This is a sanity check that can be turned on to verify the |
| 499 | * pointer math in this function is not going wrong. Turn it on and |
| 500 | * run the whole test suite to perform the check. |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 501 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 502 | if(pBufferEnd - pByte > 9 || pBufferEnd - pByte < 1 || pByte < (uint8_t *)buffer.ptr) { |
| 503 | return NULLUsefulBufC; |
| 504 | } |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 505 | #endif /* EXTRA_ENCODE_HEAD_CHECK */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 506 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 507 | /* Length will not go negative because the loops run for at most 8 decrements |
| 508 | * of pByte, only one other decrement is made, and the array is sized |
| 509 | * for this. |
| 510 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 511 | return (UsefulBufC){pByte, (size_t)(pBufferEnd - pByte)}; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 512 | } |
| 513 | |
| 514 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 515 | /** |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 516 | * @brief Increment item counter for maps and arrays. |
| 517 | * |
| 518 | * @param pMe QCBOR encoding context. |
| 519 | * |
| 520 | * This is mostly a separate function to make code more readable and |
| 521 | * to have fewer occurrences of #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 522 | */ |
| 523 | static void |
| 524 | QCBOREncode_Private_IncrementMapOrArrayCount(QCBOREncodeContext *pMe) |
| 525 | { |
| 526 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 527 | if(pMe->uError == QCBOR_SUCCESS) { |
| 528 | pMe->uError = Nesting_Increment(&(pMe->nesting)); |
| 529 | } |
| 530 | #else |
| 531 | (void)Nesting_Increment(&(pMe->nesting)); |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 532 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 533 | } |
| 534 | |
| 535 | |
| 536 | /** |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 537 | * @brief Append the CBOR head, the major type and argument |
| 538 | * |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 539 | * @param pMe Encoder context. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 540 | * @param uMajorType Major type to insert. |
| 541 | * @param uArgument The argument (an integer value or a length). |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 542 | * @param uMinLen Minimum number of bytes for encoding the CBOR argument. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 543 | * |
| 544 | * This formats the CBOR "head" and appends it to the output. |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 545 | * |
| 546 | * This also increments the array/map item counter in most cases. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 547 | */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 548 | void |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 549 | QCBOREncode_Private_AppendCBORHead(QCBOREncodeContext *pMe, |
| 550 | const uint8_t uMajorType, |
| 551 | const uint64_t uArgument, |
| 552 | const uint8_t uMinLen) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 553 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 554 | /* A stack buffer large enough for a CBOR head */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 555 | UsefulBuf_MAKE_STACK_UB (pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE); |
| 556 | |
| 557 | UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead, |
| 558 | uMajorType, |
| 559 | uMinLen, |
| 560 | uArgument); |
| 561 | |
| 562 | /* No check for EncodedHead == NULLUsefulBufC is performed here to |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 563 | * save object code. It is very clear that pBufferForEncodedHead is |
| 564 | * the correct size. If EncodedHead == NULLUsefulBufC then |
| 565 | * UsefulOutBuf_AppendUsefulBuf() will do nothing so there is no |
| 566 | * security hole introduced. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 567 | */ |
| 568 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 569 | UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), EncodedHead); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 570 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 571 | if(!(uMajorType & QCBOR_INDEFINITE_LEN_TYPE_MODIFIER || uMajorType == CBOR_MAJOR_TYPE_TAG)) { |
| 572 | /* Don't increment the map count for tag or break because that is |
| 573 | * not needed. Don't do it for indefinite-length arrays and maps |
| 574 | * because it is done elsewhere. This is never called for definite-length |
| 575 | * arrays and maps. |
| 576 | */ |
| 577 | QCBOREncode_Private_IncrementMapOrArrayCount(pMe); |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 578 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 579 | } |
| 580 | |
Laurence Lundblade | 56230d1 | 2018-11-01 11:14:51 +0700 | [diff] [blame] | 581 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 582 | /* |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 583 | * Public function for adding signed integers. See qcbor/qcbor_encode.h |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 584 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 585 | void |
| 586 | QCBOREncode_AddInt64(QCBOREncodeContext *pMe, const int64_t nNum) |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 587 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 588 | uint8_t uMajorType; |
| 589 | uint64_t uValue; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 590 | |
| 591 | if(nNum < 0) { |
Laurence Lundblade | 9c5c0ef | 2022-12-23 17:56:27 -0700 | [diff] [blame] | 592 | /* In CBOR -1 encodes as 0x00 with major type negative int. |
| 593 | * First add one as a signed integer because that will not |
Laurence Lundblade | 2d49300 | 2024-02-01 11:09:17 -0700 | [diff] [blame] | 594 | * overflow. Then change the sign as needed for encoding (the |
Laurence Lundblade | 9c5c0ef | 2022-12-23 17:56:27 -0700 | [diff] [blame] | 595 | * opposite order, changing the sign and subtracting, can cause |
Laurence Lundblade | 2d49300 | 2024-02-01 11:09:17 -0700 | [diff] [blame] | 596 | * an overflow when encoding INT64_MIN). */ |
Laurence Lundblade | 9c5c0ef | 2022-12-23 17:56:27 -0700 | [diff] [blame] | 597 | int64_t nTmp = nNum + 1; |
| 598 | uValue = (uint64_t)-nTmp; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 599 | uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT; |
| 600 | } else { |
| 601 | uValue = (uint64_t)nNum; |
| 602 | uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT; |
| 603 | } |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 604 | QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, uValue, 0); |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 605 | } |
| 606 | |
| 607 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 608 | /** |
| 609 | * @brief Semi-private method to add a buffer full of bytes to encoded output. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 610 | * |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 611 | * @param[in] pMe The encoding context to add the string to. |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 612 | * @param[in] uMajorType The CBOR major type of the bytes. |
| 613 | * @param[in] Bytes The bytes to add. |
| 614 | * |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 615 | * Called by inline functions to add text and byte strings. |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 616 | * |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 617 | * (This used to support QCBOREncode_AddEncoded() and |
| 618 | * QCBOREncode_AddBytesLenOnly(), but that was pulled out to make this |
| 619 | * smaller. This is one of the most used methods and they are some of |
| 620 | * the least used). |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 621 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 622 | void |
| 623 | QCBOREncode_Private_AddBuffer(QCBOREncodeContext *pMe, |
| 624 | const uint8_t uMajorType, |
| 625 | const UsefulBufC Bytes) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 626 | { |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 627 | QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, Bytes.len, 0); |
Laurence Lundblade | 15b93d4 | 2024-02-07 17:39:10 -0800 | [diff] [blame] | 628 | UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), Bytes); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 629 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 630 | |
Laurence Lundblade | cafcfe1 | 2018-10-31 21:59:50 +0700 | [diff] [blame] | 631 | |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 632 | /* |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 633 | * Public function for adding raw encoded CBOR. See qcbor/qcbor_encode.h |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 634 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 635 | void |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 636 | QCBOREncode_AddEncoded(QCBOREncodeContext *pMe, const UsefulBufC Encoded) |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 637 | { |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 638 | UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), Encoded); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 639 | QCBOREncode_Private_IncrementMapOrArrayCount(pMe); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 640 | } |
| 641 | |
| 642 | |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 643 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
Laurence Lundblade | 8d9e0cd | 2024-05-25 18:12:19 -0700 | [diff] [blame] | 644 | /** |
| 645 | * @brief Semi-private method to add a double using preferred encoding. |
| 646 | * |
| 647 | * @param[in] pMe The encode context. |
| 648 | * @param[in] dNum The double to add. |
| 649 | * |
| 650 | * This converts the double to a float or half-precision if it can be done |
| 651 | * without a loss of precision. See QCBOREncode_AddDouble(). |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 652 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 653 | void |
Laurence Lundblade | 70fc125 | 2024-05-31 10:57:28 -0700 | [diff] [blame] | 654 | QCBOREncode_Private_AddPreferredDouble(QCBOREncodeContext *pMe, double dNum) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 655 | { |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 656 | IEEE754_union FloatResult; |
| 657 | bool bNoNaNPayload; |
| 658 | struct IEEE754_ToInt IntResult; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 659 | uint64_t uNegValue; |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 660 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 661 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 9b2ae8a | 2024-07-12 11:00:20 -0700 | [diff] [blame] | 662 | if(IEEE754_DoubleHasNaNPayload(dNum) && !(pMe->uAllow & QCBOR_ENCODE_ALLOW_NAN_PAYLOAD)) { |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 663 | pMe->uError = QCBOR_ERR_NOT_ALLOWED; |
| 664 | return; |
| 665 | } |
| 666 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 667 | |
| 668 | if(pMe->uMode == QCBOR_ENCODE_MODE_DCBOR) { |
| 669 | IntResult = IEEE754_DoubleToInt(dNum); |
| 670 | switch(IntResult.type) { |
| 671 | case IEEE754_ToInt_IS_INT: |
| 672 | QCBOREncode_AddInt64(pMe, IntResult.integer.is_signed); |
| 673 | return; |
| 674 | case IEEE754_ToInt_IS_UINT: |
| 675 | QCBOREncode_AddUInt64(pMe, IntResult.integer.un_signed); |
| 676 | return; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 677 | case IEEE754_ToInt_IS_65BIT_NEG: |
| 678 | { |
| 679 | if(IntResult.integer.un_signed == 0) { |
| 680 | uNegValue = UINT64_MAX; |
| 681 | } else { |
| 682 | uNegValue = IntResult.integer.un_signed-1; |
| 683 | } |
| 684 | QCBOREncode_AddNegativeUInt64(pMe, uNegValue); |
| 685 | } |
| 686 | return; |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 687 | case IEEE754_ToInt_NaN: |
| 688 | dNum = NAN; |
| 689 | bNoNaNPayload = true; |
| 690 | break; |
| 691 | case IEEE754_ToInt_NO_CONVERSION: |
| 692 | bNoNaNPayload = true; |
| 693 | } |
| 694 | } else { |
| 695 | bNoNaNPayload = false; |
| 696 | } |
| 697 | |
| 698 | FloatResult = IEEE754_DoubleToSmaller(dNum, true, bNoNaNPayload); |
| 699 | |
| 700 | QCBOREncode_Private_AddType7(pMe, (uint8_t)FloatResult.uSize, FloatResult.uValue); |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 701 | } |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 702 | |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 703 | |
Laurence Lundblade | 8d9e0cd | 2024-05-25 18:12:19 -0700 | [diff] [blame] | 704 | /** |
| 705 | * @brief Semi-private method to add a float using preferred encoding. |
| 706 | * |
| 707 | * @param[in] pMe The encode context. |
| 708 | * @param[in] fNum The float to add. |
| 709 | * |
| 710 | * This converts the float to a half-precision if it can be done |
| 711 | * without a loss of precision. See QCBOREncode_AddFloat(). |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 712 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 713 | void |
Laurence Lundblade | 70fc125 | 2024-05-31 10:57:28 -0700 | [diff] [blame] | 714 | QCBOREncode_Private_AddPreferredFloat(QCBOREncodeContext *pMe, float fNum) |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 715 | { |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 716 | IEEE754_union FloatResult; |
| 717 | bool bNoNaNPayload; |
| 718 | struct IEEE754_ToInt IntResult; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 719 | uint64_t uNegValue; |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 720 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 721 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 9b2ae8a | 2024-07-12 11:00:20 -0700 | [diff] [blame] | 722 | if(IEEE754_SingleHasNaNPayload(fNum) && !(pMe->uAllow & QCBOR_ENCODE_ALLOW_NAN_PAYLOAD)) { |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 723 | pMe->uError = QCBOR_ERR_NOT_ALLOWED; |
| 724 | return; |
| 725 | } |
| 726 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 727 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 728 | if(pMe->uMode == QCBOR_ENCODE_MODE_DCBOR) { |
| 729 | IntResult = IEEE754_SingleToInt(fNum); |
| 730 | switch(IntResult.type) { |
| 731 | case IEEE754_ToInt_IS_INT: |
| 732 | QCBOREncode_AddInt64(pMe, IntResult.integer.is_signed); |
| 733 | return; |
| 734 | case IEEE754_ToInt_IS_UINT: |
| 735 | QCBOREncode_AddUInt64(pMe, IntResult.integer.un_signed); |
| 736 | return; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 737 | case IEEE754_ToInt_IS_65BIT_NEG: |
| 738 | { |
| 739 | if(IntResult.integer.un_signed == 0) { |
| 740 | uNegValue = UINT64_MAX; |
| 741 | } else { |
| 742 | uNegValue = IntResult.integer.un_signed-1; |
| 743 | } |
| 744 | QCBOREncode_AddNegativeUInt64(pMe, uNegValue); |
| 745 | } |
| 746 | return; |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 747 | case IEEE754_ToInt_NaN: |
| 748 | fNum = NAN; |
| 749 | bNoNaNPayload = true; |
| 750 | break; |
| 751 | case IEEE754_ToInt_NO_CONVERSION: |
| 752 | bNoNaNPayload = true; |
| 753 | } |
| 754 | } else { |
| 755 | bNoNaNPayload = false; |
| 756 | } |
| 757 | |
| 758 | FloatResult = IEEE754_SingleToHalf(fNum, bNoNaNPayload); |
| 759 | |
| 760 | QCBOREncode_Private_AddType7(pMe, (uint8_t)FloatResult.uSize, FloatResult.uValue); |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 761 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 762 | #endif /* ! QCBOR_DISABLE_PREFERRED_FLOAT */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 763 | |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 764 | |
| 765 | |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 766 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 767 | /** |
| 768 | * @brief Convert a big number to unsigned integer. |
| 769 | * |
| 770 | * @param[in] BigNumber Big number to convert. |
| 771 | * |
| 772 | * @return Converted unsigned. |
| 773 | * |
| 774 | * The big number must be less than 8 bytes long. |
| 775 | **/ |
| 776 | static uint64_t |
| 777 | QCBOREncode_Private_BigNumberToUInt(const UsefulBufC BigNumber) |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 778 | { |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 779 | uint64_t uInt; |
| 780 | size_t uIndex; |
| 781 | |
| 782 | uInt = 0; |
| 783 | for(uIndex = 0; uIndex < BigNumber.len; uIndex++) { |
| 784 | uInt = (uInt << 8) + UsefulBufC_NTH_BYTE(BigNumber, uIndex); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 785 | } |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 786 | |
| 787 | return uInt; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 788 | } |
| 789 | |
| 790 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 791 | /** |
| 792 | * @brief Is there a carry when you subtract 1 from the BigNumber. |
| 793 | * |
| 794 | * @param[in] BigNumber Big number to check for carry. |
| 795 | * |
| 796 | * @return If there is a carry, \c true. |
| 797 | * |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 798 | * If this returns @c true, then @c BigNumber - 1 is one byte shorter |
| 799 | * than @c BigNumber. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 800 | **/ |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 801 | static bool |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 802 | QCBOREncode_Private_BigNumberCarry(const UsefulBufC BigNumber) |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 803 | { |
| 804 | bool bCarry; |
| 805 | UsefulBufC SubBigNum; |
| 806 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 807 | // Improvement: rework without recursion? |
| 808 | |
| 809 | if(BigNumber.len == 0) { |
| 810 | return true; /* Subtracting one from zero-length string gives a carry */ |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 811 | } else { |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 812 | SubBigNum = UsefulBuf_Tail(BigNumber, 1); |
| 813 | bCarry = QCBOREncode_Private_BigNumberCarry(SubBigNum); |
| 814 | if(UsefulBufC_NTH_BYTE(BigNumber, 0) == 0x00 && bCarry) { |
| 815 | /* Subtracting one from 0 gives a carry */ |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 816 | return true; |
| 817 | } else { |
| 818 | return false; |
| 819 | } |
| 820 | } |
| 821 | } |
| 822 | |
| 823 | |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 824 | /** |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 825 | * @brief Output negative bignum bytes with subtraction of 1. |
| 826 | * |
| 827 | * @param[in] pMe The decode context. |
| 828 | * @param[in] uTagRequirement Either @ref QCBOR_ENCODE_AS_TAG or |
| 829 | * @ref QCBOR_ENCODE_AS_BORROWED. |
| 830 | * @param[in] BigNumber The negative big number. |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 831 | */ |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 832 | static void |
| 833 | QCBOREncode_Private_AddTNegativeBigNumber(QCBOREncodeContext *pMe, |
| 834 | const uint8_t uTagRequirement, |
| 835 | const UsefulBufC BigNumber) |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 836 | { |
| 837 | size_t uLen; |
| 838 | bool bCarry; |
| 839 | bool bCopiedSomething; |
| 840 | uint8_t uByte; |
| 841 | UsefulBufC SubString; |
| 842 | UsefulBufC NextSubString; |
| 843 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 844 | QCBOREncode_Private_BigNumberTag(pMe, uTagRequirement, true); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 845 | |
| 846 | /* This works on any length without the need of an additional buffer */ |
| 847 | |
| 848 | /* This subtracts one, possibly making the string shorter by one |
| 849 | * 0x01 -> 0x00 |
| 850 | * 0x01 0x00 -> 0xff |
| 851 | * 0x00 0x01 0x00 -> 0x00 0xff |
| 852 | * 0x02 0x00 -> 0x01 0xff |
| 853 | * 0xff -> 0xfe |
| 854 | * 0xff 0x00 -> 0xfe 0xff |
| 855 | * 0x01 0x00 0x00 -> 0xff 0xff |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 856 | * |
| 857 | * This outputs the big number a byte at a time to be able to operate on |
| 858 | * a big number of any length without memory allocation. |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 859 | */ |
| 860 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 861 | /* Compute the length up front because it goes in the encoded head */ |
| 862 | bCarry = QCBOREncode_Private_BigNumberCarry(UsefulBuf_Tail(BigNumber, 1)); |
| 863 | uLen = BigNumber.len; |
| 864 | if(bCarry && BigNumber.len > 1 && UsefulBufC_NTH_BYTE(BigNumber, 0) >= 1) { |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 865 | uLen--; |
| 866 | } |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 867 | QCBOREncode_Private_AppendCBORHead(pMe, CBOR_MAJOR_TYPE_BYTE_STRING, uLen,0); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 868 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 869 | SubString = BigNumber; |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 870 | bCopiedSomething = false; |
| 871 | while(SubString.len) { |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 872 | uByte = UsefulBufC_NTH_BYTE(SubString, 0); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 873 | NextSubString = UsefulBuf_Tail(SubString, 1); |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 874 | bCarry = QCBOREncode_Private_BigNumberCarry(NextSubString); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 875 | if(bCarry) { |
| 876 | uByte--; |
| 877 | } |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 878 | /* This avoids all but the last leading zero. See |
| 879 | * QCBOREncode_Private_SkipLeadingZeros() */ |
| 880 | if(bCopiedSomething || NextSubString.len == 0 || uByte != 0) { |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 881 | UsefulOutBuf_AppendByte(&(pMe->OutBuf), uByte); |
| 882 | bCopiedSomething = true; |
| 883 | } |
| 884 | SubString = NextSubString; |
| 885 | } |
| 886 | } |
| 887 | |
| 888 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 889 | /** |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 890 | * @brief Remove leading zeros. |
| 891 | * |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 892 | * @param[in] BigNumber The big number. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 893 | * |
| 894 | * @return Big number with no leading zeros. |
| 895 | * |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 896 | * If the big number is all zeros, this returns a big number that is |
| 897 | * one zero rather than the empty string. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 898 | * |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 899 | * RFC 8949 3.4.3 does not explicitly decoders MUST handle the empty |
| 900 | * string, but does say decoders MUST handle leading zeros. So |
| 901 | * Postel's Law is applied here and 0 is not encoded as an empty |
| 902 | * string. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 903 | */ |
| 904 | static UsefulBufC |
| 905 | QCBOREncode_Private_SkipLeadingZeros(const UsefulBufC BigNumber) |
| 906 | { |
| 907 | UsefulBufC NLZ; |
| 908 | NLZ = UsefulBuf_SkipLeading(BigNumber, 0x00); |
| 909 | |
| 910 | /* An all-zero string reduces to one 0, not an empty string. */ |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 911 | if(NLZ.len == 0 && |
| 912 | BigNumber.len > 0 && |
| 913 | UsefulBufC_NTH_BYTE(BigNumber, 0) == 0x00) { |
| 914 | NLZ.len = 1; |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 915 | } |
| 916 | |
| 917 | return NLZ; |
| 918 | } |
| 919 | |
| 920 | |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 921 | /** |
| 922 | * @brief Output a big number, preferred or not, with negative offset |
| 923 | * |
| 924 | * @param[in] pMe The decode context. |
| 925 | * @param[in] uTagRequirement Either @ref QCBOR_ENCODE_AS_TAG or |
| 926 | * @ref QCBOR_ENCODE_AS_BORROWED. |
| 927 | * @param[in] bPreferred Uses preferred serialization if true |
| 928 | * @param[in] bNegative Indicates big number is negative or postive. |
| 929 | * @param[in] BigNumber The big number. |
| 930 | * |
| 931 | * Regardless of whether preferred serialization is used, if the big |
| 932 | * number is negative, one is subtracted before is output per CBOR |
| 933 | * convetion for big numbers. This requires a little big number |
| 934 | * arithmetic and adds some object code. |
| 935 | * |
| 936 | * If preferred serialization is used, then if the number is smaller |
| 937 | * than UINT64_MAX and postive it is output as type 0 and if it is |
| 938 | * equal to or smaller than UINT64_MAX it is output as a type 1 |
| 939 | * integer minus one. |
| 940 | * |
| 941 | * See QCBOREncode_AddTBigNumberRaw() for simple copy through. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 942 | */ |
| 943 | void |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 944 | QCBOREncode_Private_AddTBigNumberMain(QCBOREncodeContext *pMe, |
| 945 | const uint8_t uTagRequirement, |
| 946 | const bool bPreferred, |
| 947 | const bool bNegative, |
| 948 | const UsefulBufC BigNumber) |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 949 | { |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 950 | uint64_t uInt; |
| 951 | bool bIs2exp64; |
| 952 | uint8_t uMajorType; |
| 953 | UsefulBufC BigNumberNLZ; |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 954 | |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 955 | BigNumberNLZ = QCBOREncode_Private_SkipLeadingZeros(BigNumber); |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 956 | |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 957 | static const uint8_t twoExp64[] = {0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; |
| 958 | bIs2exp64 = ! UsefulBuf_Compare(BigNumber, UsefulBuf_FROM_BYTE_ARRAY_LITERAL(twoExp64)); |
| 959 | |
| 960 | if(bPreferred && (BigNumberNLZ.len <= 8 || (bNegative && bIs2exp64))) { |
| 961 | if(bIs2exp64) { |
| 962 | /* 2^64 is a 9 byte big number. Since negative numbers are offset |
| 963 | * by one in CBOR, it can be encoded as a type 1 negative. The |
| 964 | * conversion below won't work because the uInt will overflow |
| 965 | * before the subtraction of 1. |
| 966 | */ |
| 967 | uInt = UINT64_MAX; |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 968 | } else { |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 969 | uInt = QCBOREncode_Private_BigNumberToUInt(BigNumberNLZ); |
| 970 | if(bNegative) { |
| 971 | uInt--; |
| 972 | } |
| 973 | } |
| 974 | uMajorType = bNegative ? CBOR_MAJOR_TYPE_NEGATIVE_INT : |
| 975 | CBOR_MAJOR_TYPE_POSITIVE_INT; |
| 976 | QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, uInt, 0); |
| 977 | } else { |
| 978 | if(bNegative) { |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 979 | QCBOREncode_Private_AddTNegativeBigNumber(pMe, uTagRequirement, BigNumberNLZ); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 980 | } else { |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 981 | QCBOREncode_AddTBigNumberRaw(pMe, false, uTagRequirement, BigNumberNLZ); |
Laurence Lundblade | 14ce228 | 2024-07-24 22:13:35 -0700 | [diff] [blame] | 982 | } |
| 983 | } |
| 984 | } |
| 985 | |
| 986 | |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 987 | |
| 988 | |
Laurence Lundblade | dd6e76e | 2021-03-10 01:54:01 -0700 | [diff] [blame] | 989 | #ifndef QCBOR_DISABLE_EXP_AND_MANTISSA |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 990 | /** |
| 991 | * @brief Semi-private method to add bigfloats and decimal fractions. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 992 | * |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 993 | * @param[in] pMe The encoding context to add the value to. |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 994 | * @param[in] uTagNumber The type 6 tag indicating what this is to be. |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 995 | * @param[in] nMantissa The @c int64_t mantissa if it is not a big number. |
| 996 | * @param[in] nExponent The exponent. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 997 | * |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 998 | * This outputs either the @ref CBOR_TAG_DECIMAL_FRACTION or |
| 999 | * @ref CBOR_TAG_BIGFLOAT tag. if @c uTag is @ref CBOR_TAG_INVALID64, |
| 1000 | * then this outputs the "borrowed" content format. |
| 1001 | * |
| 1002 | * The tag content output by this is an array with two members, the |
| 1003 | * exponent and then the mantissa. The mantissa can be either a big |
| 1004 | * number or an @c int64_t. |
| 1005 | * |
| 1006 | * This implementation cannot output an exponent further from 0 than |
| 1007 | * @c INT64_MAX. |
| 1008 | * |
| 1009 | * To output a mantissa that is between INT64_MAX and UINT64_MAX from 0, |
| 1010 | * it must be as a big number. |
| 1011 | * |
Laurence Lundblade | 0f14365 | 2024-10-06 11:06:19 -0700 | [diff] [blame] | 1012 | * Typically, QCBOREncode_AddTDecimalFraction(), QCBOREncode_AddTBigFloat(), |
| 1013 | * QCBOREncode_AddTDecimalFractionBigNum() or QCBOREncode_AddTBigFloatBigNum() |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1014 | * is called instead of this. |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1015 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1016 | void |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1017 | QCBOREncode_Private_AddTExpIntMantissa(QCBOREncodeContext *pMe, |
| 1018 | const int uTagRequirement, |
| 1019 | const uint64_t uTagNumber, |
| 1020 | const int64_t nExponent, |
| 1021 | const int64_t nMantissa) |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1022 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1023 | /* This is for encoding either a big float or a decimal fraction, |
| 1024 | * both of which are an array of two items, an exponent and a |
| 1025 | * mantissa. The difference between the two is that the exponent |
| 1026 | * is base-2 for big floats and base-10 for decimal fractions, but |
| 1027 | * that has no effect on the code here. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1028 | */ |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1029 | /* Separate from QCBOREncode_Private_AddTExpBigMantissa() because |
| 1030 | * linking QCBOREncode_AddTBigNumber() adds a lot because it |
| 1031 | * does preferred serialization of big numbers and the offset of 1 |
| 1032 | * for CBOR negative numbers. |
| 1033 | */ |
| 1034 | if(uTagRequirement == QCBOR_ENCODE_AS_TAG) { |
| 1035 | QCBOREncode_AddTagNumber(pMe, uTagNumber); |
Laurence Lundblade | ae66d3f | 2020-09-14 18:12:08 -0700 | [diff] [blame] | 1036 | } |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1037 | QCBOREncode_OpenArray(pMe); |
| 1038 | QCBOREncode_AddInt64(pMe, nExponent); |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1039 | QCBOREncode_AddInt64(pMe, nMantissa); |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1040 | QCBOREncode_CloseArray(pMe); |
| 1041 | } |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1042 | |
| 1043 | void |
| 1044 | QCBOREncode_Private_AddTExpBigMantissa(QCBOREncodeContext *pMe, |
| 1045 | const int uTagRequirement, |
| 1046 | const uint64_t uTagNumber, |
| 1047 | const int64_t nExponent, |
| 1048 | const UsefulBufC BigNumMantissa, |
| 1049 | const bool bBigNumIsNegative) |
| 1050 | { |
| 1051 | /* This is for encoding either a big float or a decimal fraction, |
| 1052 | * both of which are an array of two items, an exponent and a |
| 1053 | * mantissa. The difference between the two is that the exponent |
| 1054 | * is base-2 for big floats and base-10 for decimal fractions, but |
| 1055 | * that has no effect on the code here. |
| 1056 | */ |
| 1057 | if(uTagRequirement == QCBOR_ENCODE_AS_TAG) { |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 1058 | QCBOREncode_AddTagNumber(pMe, uTagNumber); |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1059 | } |
| 1060 | QCBOREncode_OpenArray(pMe); |
| 1061 | QCBOREncode_AddInt64(pMe, nExponent); |
| 1062 | QCBOREncode_AddTBigNumber(pMe, QCBOR_ENCODE_AS_TAG, bBigNumIsNegative, BigNumMantissa); |
| 1063 | QCBOREncode_CloseArray(pMe); |
| 1064 | } |
| 1065 | |
| 1066 | |
| 1067 | void |
| 1068 | QCBOREncode_Private_AddTExpBigMantissaRaw(QCBOREncodeContext *pMe, |
| 1069 | const int uTagRequirement, |
| 1070 | const uint64_t uTagNumber, |
| 1071 | const int64_t nExponent, |
| 1072 | const UsefulBufC BigNumMantissa, |
| 1073 | const bool bBigNumIsNegative) |
| 1074 | { |
| 1075 | /* This is for encoding either a big float or a decimal fraction, |
| 1076 | * both of which are an array of two items, an exponent and a |
| 1077 | * mantissa. The difference between the two is that the exponent |
| 1078 | * is base-2 for big floats and base-10 for decimal fractions, but |
| 1079 | * that has no effect on the code here. |
| 1080 | */ |
| 1081 | /* Separate from QCBOREncode_Private_AddTExpBigMantissa() because |
| 1082 | * linking QCBOREncode_AddTBigNumber() adds a lot because it |
| 1083 | * does preferred serialization of big numbers and the offset of 1 |
| 1084 | * for CBOR negative numbers. |
| 1085 | */ |
| 1086 | if(uTagRequirement == QCBOR_ENCODE_AS_TAG) { |
Laurence Lundblade | 05369de | 2024-11-17 17:00:28 -0800 | [diff] [blame^] | 1087 | QCBOREncode_AddTagNumber(pMe, uTagNumber); |
Laurence Lundblade | 6876933 | 2024-11-03 13:09:20 -0800 | [diff] [blame] | 1088 | } |
| 1089 | QCBOREncode_OpenArray(pMe); |
| 1090 | QCBOREncode_AddInt64(pMe, nExponent); |
| 1091 | QCBOREncode_AddTBigNumberRaw(pMe, QCBOR_ENCODE_AS_TAG, bBigNumIsNegative, BigNumMantissa); |
| 1092 | QCBOREncode_CloseArray(pMe); |
| 1093 | } |
| 1094 | |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1095 | #endif /* ! QCBOR_DISABLE_EXP_AND_MANTISSA */ |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1096 | |
| 1097 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1098 | /** |
| 1099 | * @brief Semi-private method to open a map, array or bstr-wrapped CBOR |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1100 | * |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1101 | * @param[in] pMe The context to add to. |
| 1102 | * @param[in] uMajorType The major CBOR type to close |
| 1103 | * |
| 1104 | * Call QCBOREncode_OpenArray(), QCBOREncode_OpenMap() or |
| 1105 | * QCBOREncode_BstrWrap() instead of this. |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 1106 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1107 | void |
| 1108 | QCBOREncode_Private_OpenMapOrArray(QCBOREncodeContext *pMe, |
| 1109 | const uint8_t uMajorType) |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 1110 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1111 | /* Add one item to the nesting level we are in for the new map or array */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1112 | QCBOREncode_Private_IncrementMapOrArrayCount(pMe); |
Laurence Lundblade | d39cd39 | 2019-01-11 18:17:38 -0800 | [diff] [blame] | 1113 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1114 | /* The offset where the length of an array or map will get written |
| 1115 | * is stored in a uint32_t, not a size_t to keep stack usage |
| 1116 | * smaller. This checks to be sure there is no wrap around when |
| 1117 | * recording the offset. Note that on 64-bit machines CBOR larger |
| 1118 | * than 4GB can be encoded as long as no array/map offsets occur |
| 1119 | * past the 4GB mark, but the public interface says that the |
| 1120 | * maximum is 4GB to keep the discussion simpler. |
| 1121 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1122 | size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf)); |
Laurence Lundblade | d39cd39 | 2019-01-11 18:17:38 -0800 | [diff] [blame] | 1123 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1124 | /* QCBOR_MAX_ARRAY_OFFSET is slightly less than UINT32_MAX so this |
| 1125 | * code can run on a 32-bit machine and tests can pass on a 32-bit |
| 1126 | * machine. If it was exactly UINT32_MAX, then this code would not |
| 1127 | * compile or run on a 32-bit machine and an #ifdef or some machine |
| 1128 | * size detection would be needed reducing portability. |
| 1129 | */ |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 1130 | if(uEndPosition >= QCBOR_MAX_ARRAY_OFFSET) { |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1131 | pMe->uError = QCBOR_ERR_BUFFER_TOO_LARGE; |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 1132 | |
| 1133 | } else { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1134 | /* Increase nesting level because this is a map or array. Cast |
| 1135 | * from size_t to uin32_t is safe because of check above. |
| 1136 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1137 | pMe->uError = Nesting_Increase(&(pMe->nesting), uMajorType, (uint32_t)uEndPosition); |
Laurence Lundblade | 1ef8b2d | 2018-12-14 23:13:34 -0800 | [diff] [blame] | 1138 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1139 | } |
| 1140 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 1141 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1142 | #ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1143 | /** |
| 1144 | * @brief Semi-private method to open a map, array with indefinite length |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1145 | * |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1146 | * @param[in] pMe The context to add to. |
| 1147 | * @param[in] uMajorType The major CBOR type to close |
| 1148 | * |
| 1149 | * Call QCBOREncode_OpenArrayIndefiniteLength() or |
| 1150 | * QCBOREncode_OpenMapIndefiniteLength() instead of this. |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1151 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1152 | void |
| 1153 | QCBOREncode_Private_OpenMapOrArrayIndefiniteLength(QCBOREncodeContext *pMe, |
| 1154 | const uint8_t uMajorType) |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1155 | { |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 1156 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 1157 | if(pMe->uMode >= QCBOR_ENCODE_MODE_PREFERRED) { |
| 1158 | pMe->uError = QCBOR_ERR_NOT_PREFERRED; |
| 1159 | return; |
| 1160 | } |
| 1161 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1162 | /* Insert the indefinite length marker (0x9f for arrays, 0xbf for maps) */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1163 | QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, 0, 0); |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1164 | |
| 1165 | /* Call the definite-length opener just to do the bookkeeping for |
| 1166 | * nesting. It will record the position of the opening item in the |
| 1167 | * encoded output but this is not used when closing this open. |
| 1168 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1169 | QCBOREncode_Private_OpenMapOrArray(pMe, uMajorType); |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1170 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1171 | #endif /* ! QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1172 | |
| 1173 | |
| 1174 | /** |
| 1175 | * @brief Check for errors when decreasing nesting. |
| 1176 | * |
| 1177 | * @param pMe QCBOR encoding context. |
| 1178 | * @param uMajorType The major type of the nesting. |
| 1179 | * |
| 1180 | * Check that there is no previous error, that there is actually some |
| 1181 | * nesting and that the major type of the opening of the nesting |
| 1182 | * matches the major type of the nesting being closed. |
| 1183 | * |
| 1184 | * This is called when closing maps, arrays, byte string wrapping and |
| 1185 | * open/close of byte strings. |
| 1186 | */ |
| 1187 | static bool |
| 1188 | QCBOREncode_Private_CheckDecreaseNesting(QCBOREncodeContext *pMe, |
| 1189 | const uint8_t uMajorType) |
| 1190 | { |
| 1191 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 1192 | if(pMe->uError != QCBOR_SUCCESS) { |
| 1193 | return true; |
| 1194 | } |
| 1195 | |
| 1196 | if(!Nesting_IsInNest(&(pMe->nesting))) { |
| 1197 | pMe->uError = QCBOR_ERR_TOO_MANY_CLOSES; |
| 1198 | return true; |
| 1199 | } |
| 1200 | |
| 1201 | if(Nesting_GetMajorType(&(pMe->nesting)) != uMajorType) { |
| 1202 | pMe->uError = QCBOR_ERR_CLOSE_MISMATCH; |
| 1203 | return true; |
| 1204 | } |
| 1205 | |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1206 | #else /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1207 | /* None of these checks are performed if the encode guards are |
| 1208 | * turned off as they all relate to correct calling. |
| 1209 | * |
| 1210 | * Turning off all these checks does not turn off any checking for |
| 1211 | * buffer overflows or pointer issues. |
| 1212 | */ |
| 1213 | |
| 1214 | (void)uMajorType; |
| 1215 | (void)pMe; |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1216 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1217 | |
| 1218 | return false; |
| 1219 | } |
| 1220 | |
| 1221 | |
| 1222 | /** |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1223 | * @brief Insert the CBOR head for a map, array or wrapped bstr. |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1224 | * |
| 1225 | * @param pMe QCBOR encoding context. |
| 1226 | * @param uMajorType One of CBOR_MAJOR_TYPE_XXXX. |
| 1227 | * @param uLen The length of the data item. |
| 1228 | * |
| 1229 | * When an array, map or bstr was opened, nothing was done but note |
| 1230 | * the position. This function goes back to that position and inserts |
| 1231 | * the CBOR Head with the major type and length. |
| 1232 | */ |
| 1233 | static void |
| 1234 | QCBOREncode_Private_CloseAggregate(QCBOREncodeContext *pMe, |
| 1235 | uint8_t uMajorType, |
| 1236 | size_t uLen) |
| 1237 | { |
| 1238 | if(QCBOREncode_Private_CheckDecreaseNesting(pMe, uMajorType)) { |
| 1239 | return; |
| 1240 | } |
| 1241 | |
| 1242 | if(uMajorType == CBOR_MAJOR_NONE_TYPE_OPEN_BSTR) { |
| 1243 | uMajorType = CBOR_MAJOR_TYPE_BYTE_STRING; |
| 1244 | } |
| 1245 | |
| 1246 | /* A stack buffer large enough for a CBOR head (9 bytes) */ |
| 1247 | UsefulBuf_MAKE_STACK_UB(pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE); |
| 1248 | |
| 1249 | UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead, |
| 1250 | uMajorType, |
| 1251 | 0, |
| 1252 | uLen); |
| 1253 | |
| 1254 | /* No check for EncodedHead == NULLUsefulBufC is performed here to |
| 1255 | * save object code. It is very clear that pBufferForEncodedHead is |
| 1256 | * the correct size. If EncodedHead == NULLUsefulBufC then |
| 1257 | * UsefulOutBuf_InsertUsefulBuf() will do nothing so there is no |
| 1258 | * security hole introduced. |
| 1259 | */ |
| 1260 | UsefulOutBuf_InsertUsefulBuf(&(pMe->OutBuf), |
| 1261 | EncodedHead, |
| 1262 | Nesting_GetStartPos(&(pMe->nesting))); |
| 1263 | |
| 1264 | Nesting_Decrease(&(pMe->nesting)); |
| 1265 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1266 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1267 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1268 | /** |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 1269 | * @brief Semi-private method to close a map, array or bstr wrapped CBOR. |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1270 | * |
| 1271 | * @param[in] pMe The context to add to. |
| 1272 | * @param[in] uMajorType The major CBOR type to close. |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1273 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1274 | void |
| 1275 | QCBOREncode_Private_CloseMapOrArray(QCBOREncodeContext *pMe, |
| 1276 | const uint8_t uMajorType) |
Laurence Lundblade | a954db9 | 2018-09-28 19:27:31 -0700 | [diff] [blame] | 1277 | { |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1278 | QCBOREncode_Private_CloseAggregate(pMe, uMajorType, Nesting_GetCount(&(pMe->nesting))); |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1279 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1280 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1281 | |
Laurence Lundblade | eb3cdef | 2024-02-17 20:38:55 -0800 | [diff] [blame] | 1282 | /** |
| 1283 | * @brief Private method to close a map without sorting. |
| 1284 | * |
| 1285 | * @param[in] pMe The encode context with map to close. |
| 1286 | * |
| 1287 | * See QCBOREncode_SerializationCDE() implemention for explantion for why |
| 1288 | * this exists in this form. |
| 1289 | */ |
| 1290 | static void |
| 1291 | QCBOREncode_Private_CloseMapUnsorted(QCBOREncodeContext *pMe) |
| 1292 | { |
| 1293 | QCBOREncode_Private_CloseMapOrArray(pMe, CBOR_MAJOR_TYPE_MAP); |
| 1294 | } |
| 1295 | |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1296 | |
| 1297 | /** |
| 1298 | * @brief Decode a CBOR item head. |
| 1299 | * |
| 1300 | * @param[in] pUInBuf UsefulInputBuf to read from. |
| 1301 | * @param[out] pnMajorType Major type of decoded head. |
| 1302 | * @param[out] puArgument Argument of decoded head. |
| 1303 | * @param[out] pnAdditionalInfo Additional info from decoded head. |
| 1304 | * |
| 1305 | * @return SUCCESS if a head was decoded |
| 1306 | * HIT_END if there were not enough bytes to decode a head |
| 1307 | * UNSUPPORTED if the decoded item is not one that is supported |
| 1308 | * |
| 1309 | * This is copied from qcbor_decode.c rather than referenced. This |
| 1310 | * makes the core decoder 60 bytes smaller because it gets inlined. |
| 1311 | * It would not get inlined if it was referenced. It is important to |
| 1312 | * make the core decoder as small as possible. The copy here does make |
| 1313 | * map sorting 200 bytes bigger, but map sorting is rarely used in |
| 1314 | * environments that need small object code. It would also make |
| 1315 | * qcbor_encode.c depend on qcbor_decode.c |
| 1316 | * |
| 1317 | * This is also super stable and tested. It implements the very |
| 1318 | * well-defined part of CBOR that will never change. So this won't |
| 1319 | * change. |
| 1320 | */ |
| 1321 | static QCBORError |
| 1322 | QCBOREncodePriv_DecodeHead(UsefulInputBuf *pUInBuf, |
| 1323 | int *pnMajorType, |
| 1324 | uint64_t *puArgument, |
| 1325 | int *pnAdditionalInfo) |
| 1326 | { |
| 1327 | QCBORError uReturn; |
| 1328 | |
| 1329 | /* Get the initial byte that every CBOR data item has and break it |
| 1330 | * down. */ |
| 1331 | const int nInitialByte = (int)UsefulInputBuf_GetByte(pUInBuf); |
| 1332 | const int nTmpMajorType = nInitialByte >> 5; |
| 1333 | const int nAdditionalInfo = nInitialByte & 0x1f; |
| 1334 | |
| 1335 | /* Where the argument accumulates */ |
| 1336 | uint64_t uArgument; |
| 1337 | |
| 1338 | if(nAdditionalInfo >= LEN_IS_ONE_BYTE && nAdditionalInfo <= LEN_IS_EIGHT_BYTES) { |
| 1339 | /* Need to get 1,2,4 or 8 additional argument bytes. Map |
| 1340 | * LEN_IS_ONE_BYTE..LEN_IS_EIGHT_BYTES to actual length. |
| 1341 | */ |
| 1342 | static const uint8_t aIterate[] = {1,2,4,8}; |
| 1343 | |
| 1344 | /* Loop getting all the bytes in the argument */ |
| 1345 | uArgument = 0; |
| 1346 | for(int i = aIterate[nAdditionalInfo - LEN_IS_ONE_BYTE]; i; i--) { |
| 1347 | /* This shift and add gives the endian conversion. */ |
| 1348 | uArgument = (uArgument << 8) + UsefulInputBuf_GetByte(pUInBuf); |
| 1349 | } |
| 1350 | } else if(nAdditionalInfo >= ADDINFO_RESERVED1 && nAdditionalInfo <= ADDINFO_RESERVED3) { |
| 1351 | /* The reserved and thus-far unused additional info values */ |
| 1352 | uReturn = QCBOR_ERR_UNSUPPORTED; |
| 1353 | goto Done; |
| 1354 | } else { |
| 1355 | /* Less than 24, additional info is argument or 31, an |
| 1356 | * indefinite-length. No more bytes to get. |
| 1357 | */ |
| 1358 | uArgument = (uint64_t)nAdditionalInfo; |
| 1359 | } |
| 1360 | |
| 1361 | if(UsefulInputBuf_GetError(pUInBuf)) { |
| 1362 | uReturn = QCBOR_ERR_HIT_END; |
| 1363 | goto Done; |
| 1364 | } |
| 1365 | |
| 1366 | /* All successful if arrived here. */ |
| 1367 | uReturn = QCBOR_SUCCESS; |
| 1368 | *pnMajorType = nTmpMajorType; |
| 1369 | *puArgument = uArgument; |
| 1370 | *pnAdditionalInfo = nAdditionalInfo; |
| 1371 | |
| 1372 | Done: |
| 1373 | return uReturn; |
| 1374 | } |
| 1375 | |
| 1376 | |
| 1377 | /** |
| 1378 | * @brief Consume the next item from a UsefulInputBuf. |
| 1379 | * |
| 1380 | * @param[in] pInBuf UsefulInputBuf from which to consume item. |
| 1381 | * |
| 1382 | * Recursive, but stack usage is light and encoding depth limit |
| 1383 | */ |
| 1384 | static QCBORError |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1385 | QCBOR_Private_ConsumeNext(UsefulInputBuf *pInBuf) |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1386 | { |
| 1387 | int nMajor; |
| 1388 | uint64_t uArgument; |
| 1389 | int nAdditional; |
| 1390 | uint16_t uItemCount; |
| 1391 | uint16_t uMul; |
| 1392 | uint16_t i; |
| 1393 | QCBORError uCBORError; |
| 1394 | |
| 1395 | uCBORError = QCBOREncodePriv_DecodeHead(pInBuf, &nMajor, &uArgument, &nAdditional); |
| 1396 | if(uCBORError != QCBOR_SUCCESS) { |
| 1397 | return uCBORError; |
| 1398 | } |
| 1399 | |
| 1400 | uMul = 1; |
| 1401 | |
| 1402 | switch(nMajor) { |
| 1403 | case CBOR_MAJOR_TYPE_POSITIVE_INT: /* Major type 0 */ |
| 1404 | case CBOR_MAJOR_TYPE_NEGATIVE_INT: /* Major type 1 */ |
| 1405 | break; |
| 1406 | |
| 1407 | case CBOR_MAJOR_TYPE_SIMPLE: |
| 1408 | return uArgument == CBOR_SIMPLE_BREAK ? 1 : 0; |
| 1409 | break; |
| 1410 | |
| 1411 | case CBOR_MAJOR_TYPE_BYTE_STRING: |
| 1412 | case CBOR_MAJOR_TYPE_TEXT_STRING: |
| 1413 | if(nAdditional == LEN_IS_INDEFINITE) { |
| 1414 | /* Segments of indefinite length */ |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1415 | while(QCBOR_Private_ConsumeNext(pInBuf) == 0); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1416 | } |
| 1417 | (void)UsefulInputBuf_GetBytes(pInBuf, uArgument); |
| 1418 | break; |
| 1419 | |
| 1420 | case CBOR_MAJOR_TYPE_TAG: |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1421 | QCBOR_Private_ConsumeNext(pInBuf); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1422 | break; |
| 1423 | |
| 1424 | case CBOR_MAJOR_TYPE_MAP: |
| 1425 | uMul = 2; |
| 1426 | /* Fallthrough */ |
| 1427 | case CBOR_MAJOR_TYPE_ARRAY: |
| 1428 | uItemCount = (uint16_t)uArgument * uMul; |
| 1429 | if(nAdditional == LEN_IS_INDEFINITE) { |
| 1430 | uItemCount = UINT16_MAX; |
| 1431 | } |
| 1432 | for(i = uItemCount; i > 0; i--) { |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1433 | if(QCBOR_Private_ConsumeNext(pInBuf)) { |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1434 | /* End of indefinite length */ |
| 1435 | break; |
| 1436 | } |
| 1437 | } |
| 1438 | break; |
| 1439 | } |
| 1440 | |
| 1441 | return QCBOR_SUCCESS; |
| 1442 | } |
| 1443 | |
| 1444 | |
| 1445 | /** |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1446 | * @brief Decoded next item to get its lengths. |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1447 | * |
| 1448 | * Decode the next item in map no matter what type it is. It works |
| 1449 | * recursively when an item is a map or array It returns offset just |
| 1450 | * past the item decoded or zero there are no more items in the output |
| 1451 | * buffer. |
| 1452 | * |
| 1453 | * This doesn't distinguish between end of the input and an error |
| 1454 | * because it is used to decode stuff we encoded into a buffer, not |
| 1455 | * stuff that came in from outside. We still want a check for safety |
| 1456 | * in case of bugs here, but it is OK to report end of input on error. |
| 1457 | */ |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1458 | struct ItemLens { |
| 1459 | uint32_t uLabelLen; |
| 1460 | uint32_t uItemLen; |
| 1461 | }; |
| 1462 | |
| 1463 | static struct ItemLens |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1464 | QCBOREncode_Private_DecodeNextInMap(QCBOREncodeContext *pMe, uint32_t uStart) |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1465 | { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1466 | UsefulInputBuf InBuf; |
| 1467 | UsefulBufC EncodedMapBytes; |
| 1468 | QCBORError uCBORError; |
| 1469 | struct ItemLens Result; |
| 1470 | |
| 1471 | Result.uLabelLen = 0; |
| 1472 | Result.uItemLen = 0; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1473 | |
| 1474 | EncodedMapBytes = UsefulOutBuf_OutUBufOffset(&(pMe->OutBuf), uStart); |
| 1475 | if(UsefulBuf_IsNULLC(EncodedMapBytes)) { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1476 | return Result; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1477 | } |
| 1478 | |
| 1479 | UsefulInputBuf_Init(&InBuf, EncodedMapBytes); |
| 1480 | |
| 1481 | /* This is always used on maps, so consume two, the label and the value */ |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1482 | uCBORError = QCBOR_Private_ConsumeNext(&InBuf); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1483 | if(uCBORError) { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1484 | return Result; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1485 | } |
| 1486 | |
| 1487 | /* Cast is safe because this is QCBOR which limits sizes to UINT32_MAX */ |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1488 | Result.uLabelLen = (uint32_t)UsefulInputBuf_Tell(&InBuf); |
| 1489 | |
| 1490 | uCBORError = QCBOR_Private_ConsumeNext(&InBuf); |
| 1491 | if(uCBORError) { |
| 1492 | Result.uLabelLen = 0; |
| 1493 | return Result; |
| 1494 | } |
| 1495 | |
| 1496 | Result.uItemLen = (uint32_t)UsefulInputBuf_Tell(&InBuf); |
| 1497 | |
| 1498 | /* Cast is safe because this is QCBOR which limits sizes to UINT32_MAX */ |
| 1499 | return Result; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1500 | } |
| 1501 | |
| 1502 | |
| 1503 | /** |
| 1504 | * @brief Sort items lexographically by encoded labels. |
| 1505 | * |
| 1506 | * @param[in] pMe Encoding context. |
| 1507 | * @param[in] uStart Offset in outbuf of first item for sorting. |
| 1508 | * |
| 1509 | * This reaches into the UsefulOutBuf in the encoding context and |
| 1510 | * sorts encoded CBOR items. The byte offset start of the items is at |
| 1511 | * @c uStart and it goes to the end of valid bytes in the |
| 1512 | * UsefulOutBuf. |
| 1513 | */ |
| 1514 | static void |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1515 | QCBOREncode_Private_SortMap(QCBOREncodeContext *pMe, uint32_t uStart) |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1516 | { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1517 | bool bSwapped; |
| 1518 | int nComparison; |
| 1519 | uint32_t uStart1; |
| 1520 | uint32_t uStart2; |
| 1521 | struct ItemLens Lens1; |
| 1522 | struct ItemLens Lens2; |
| 1523 | |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1524 | |
| 1525 | if(pMe->uError != QCBOR_SUCCESS) { |
| 1526 | return; |
| 1527 | } |
| 1528 | |
| 1529 | /* Bubble sort because the sizes of all the items are not the |
| 1530 | * same. It works with adjacent pairs so the swap is not too |
| 1531 | * difficult even though sizes are different. |
| 1532 | * |
| 1533 | * While bubble sort is n-squared, it seems OK here because n will |
| 1534 | * usually be small and the comparison and swap functions aren't |
| 1535 | * too CPU intensive. |
| 1536 | * |
| 1537 | * Another approach would be to have an array of offsets to the |
| 1538 | * items. However this requires memory allocation and the swap |
| 1539 | * operation for quick sort or such is complicated because the item |
| 1540 | * sizes are not the same and overlap may occur in the bytes being |
| 1541 | * swapped. |
| 1542 | */ |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1543 | do { /* Loop until nothing was swapped */ |
| 1544 | Lens1 = QCBOREncode_Private_DecodeNextInMap(pMe, uStart); |
| 1545 | if(Lens1.uLabelLen == 0) { |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1546 | /* It's an empty map. Nothing to do. */ |
| 1547 | break; |
| 1548 | } |
| 1549 | uStart1 = uStart; |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1550 | uStart2 = uStart1 + Lens1.uItemLen; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1551 | bSwapped = false; |
| 1552 | |
| 1553 | while(1) { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1554 | Lens2 = QCBOREncode_Private_DecodeNextInMap(pMe, uStart2); |
| 1555 | if(Lens2.uLabelLen == 0) { |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1556 | break; |
| 1557 | } |
| 1558 | |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1559 | nComparison = UsefulOutBuf_Compare(&(pMe->OutBuf), |
| 1560 | uStart1, Lens1.uLabelLen, |
| 1561 | uStart2, Lens2.uLabelLen); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1562 | if(nComparison < 0) { |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1563 | UsefulOutBuf_Swap(&(pMe->OutBuf), uStart1, uStart2, uStart2 + Lens2.uItemLen); |
| 1564 | uStart1 = uStart1 + Lens2.uItemLen; /* item 2 now in position of item 1 */ |
| 1565 | /* Lens1 is still valid as Lens1 for the next loop */ |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1566 | bSwapped = true; |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1567 | } else if(nComparison > 0) { |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1568 | uStart1 = uStart2; |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1569 | Lens1 = Lens2; |
| 1570 | } else /* nComparison == 0 */ { |
| 1571 | pMe->uError = QCBOR_ERR_DUPLICATE_LABEL; |
| 1572 | return; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1573 | } |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1574 | uStart2 = uStart2 + Lens2.uItemLen; |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1575 | } |
| 1576 | } while(bSwapped); |
| 1577 | } |
| 1578 | |
| 1579 | |
| 1580 | /* |
| 1581 | * Public functions for closing sorted maps. See qcbor/qcbor_encode.h |
| 1582 | */ |
Laurence Lundblade | 721b56e | 2024-10-22 03:02:04 -0700 | [diff] [blame] | 1583 | void |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1584 | QCBOREncode_CloseAndSortMap(QCBOREncodeContext *pMe) |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1585 | { |
| 1586 | uint32_t uStart; |
| 1587 | |
| 1588 | /* The Header for the map we are about to sort hasn't been |
| 1589 | * inserted yet, so uStart is the position of the first item |
| 1590 | * and the end out the UsefulOutBuf data is the end of the |
| 1591 | * items we are about to sort. |
| 1592 | */ |
| 1593 | uStart = Nesting_GetStartPos(&(pMe->nesting)); |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1594 | QCBOREncode_Private_SortMap(pMe, uStart); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1595 | |
Laurence Lundblade | 70fc125 | 2024-05-31 10:57:28 -0700 | [diff] [blame] | 1596 | QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_TYPE_MAP, Nesting_GetCount(&(pMe->nesting))); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1597 | } |
| 1598 | |
| 1599 | |
Laurence Lundblade | d3f0784 | 2024-06-19 13:05:07 -0700 | [diff] [blame] | 1600 | #ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1601 | /* |
| 1602 | * Public functions for closing sorted maps. See qcbor/qcbor_encode.h |
| 1603 | */ |
Laurence Lundblade | 721b56e | 2024-10-22 03:02:04 -0700 | [diff] [blame] | 1604 | void |
Laurence Lundblade | dee0d4e | 2024-03-03 13:46:33 -0700 | [diff] [blame] | 1605 | QCBOREncode_CloseAndSortMapIndef(QCBOREncodeContext *pMe) |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1606 | { |
| 1607 | uint32_t uStart; |
| 1608 | |
| 1609 | uStart = Nesting_GetStartPos(&(pMe->nesting)); |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1610 | QCBOREncode_Private_SortMap(pMe, uStart); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1611 | |
Laurence Lundblade | 3b703b8 | 2024-01-27 20:17:20 -0700 | [diff] [blame] | 1612 | QCBOREncode_Private_CloseMapOrArrayIndefiniteLength(pMe, CBOR_MAJOR_NONE_TYPE_MAP_INDEFINITE_LEN); |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1613 | } |
Laurence Lundblade | d3f0784 | 2024-06-19 13:05:07 -0700 | [diff] [blame] | 1614 | #endif /* ! QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */ |
Laurence Lundblade | d6e1302 | 2023-11-26 10:14:02 -0700 | [diff] [blame] | 1615 | |
| 1616 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1617 | /* |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1618 | * Public function for closing bstr wrapping. See qcbor/qcbor_encode.h |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1619 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1620 | void |
| 1621 | QCBOREncode_CloseBstrWrap2(QCBOREncodeContext *pMe, |
| 1622 | const bool bIncludeCBORHead, |
| 1623 | UsefulBufC *pWrappedCBOR) |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1624 | { |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1625 | const size_t uInsertPosition = Nesting_GetStartPos(&(pMe->nesting)); |
| 1626 | const size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1627 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1628 | /* This subtraction can't go negative because the UsefulOutBuf |
| 1629 | * always only grows and never shrinks. UsefulOutBut itself also |
| 1630 | * has defenses such that it won't write where it should not even |
| 1631 | * if given incorrect input lengths. |
| 1632 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1633 | const size_t uBstrLen = uEndPosition - uInsertPosition; |
| 1634 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1635 | /* Actually insert */ |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1636 | QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_TYPE_BYTE_STRING, uBstrLen); |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1637 | |
| 1638 | if(pWrappedCBOR) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1639 | /* Return pointer and length to the enclosed encoded CBOR. The |
| 1640 | * intended use is for it to be hashed (e.g., SHA-256) in a COSE |
| 1641 | * implementation. This must be used right away, as the pointer |
| 1642 | * and length go invalid on any subsequent calls to this |
| 1643 | * function because there might be calls to |
| 1644 | * InsertEncodedTypeAndNumber() that slides data to the right. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1645 | */ |
| 1646 | size_t uStartOfNew = uInsertPosition; |
| 1647 | if(!bIncludeCBORHead) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1648 | /* Skip over the CBOR head to just get the inserted bstr */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1649 | const size_t uNewEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf)); |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1650 | uStartOfNew += uNewEndPosition - uEndPosition; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1651 | } |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1652 | const UsefulBufC PartialResult = UsefulOutBuf_OutUBuf(&(pMe->OutBuf)); |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 1653 | *pWrappedCBOR = UsefulBuf_Tail(PartialResult, uStartOfNew); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1654 | } |
| 1655 | } |
| 1656 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 1657 | |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1658 | /* |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1659 | * Public function for canceling a bstr wrap. See qcbor/qcbor_encode.h |
| 1660 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1661 | void |
| 1662 | QCBOREncode_CancelBstrWrap(QCBOREncodeContext *pMe) |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1663 | { |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1664 | if(QCBOREncode_Private_CheckDecreaseNesting(pMe, CBOR_MAJOR_TYPE_BYTE_STRING)) { |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 1665 | return; |
| 1666 | } |
| 1667 | |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1668 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 1669 | const size_t uCurrent = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf)); |
| 1670 | if(pMe->nesting.pCurrentNesting->uStart != uCurrent) { |
| 1671 | pMe->uError = QCBOR_ERR_CANNOT_CANCEL; |
| 1672 | return; |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1673 | } |
| 1674 | /* QCBOREncode_CancelBstrWrap() can't correctly undo |
Laurence Lundblade | 0f14365 | 2024-10-06 11:06:19 -0700 | [diff] [blame] | 1675 | * QCBOREncode_BstrWrapInMapSZ() or QCBOREncode_BstrWrapInMapN(). It |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1676 | * can't undo the labels they add. It also doesn't catch the error |
| 1677 | * of using it this way. QCBOREncode_CancelBstrWrap() is used |
| 1678 | * infrequently and the the result is incorrect CBOR, not a |
| 1679 | * security hole, so no extra code or state is added to handle this |
| 1680 | * condition. |
| 1681 | */ |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1682 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1683 | |
| 1684 | Nesting_Decrease(&(pMe->nesting)); |
| 1685 | Nesting_Decrement(&(pMe->nesting)); |
| 1686 | } |
| 1687 | |
| 1688 | |
| 1689 | /* |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1690 | * Public function for opening a byte string. See qcbor/qcbor_encode.h |
| 1691 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1692 | void |
| 1693 | QCBOREncode_OpenBytes(QCBOREncodeContext *pMe, UsefulBuf *pPlace) |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1694 | { |
| 1695 | *pPlace = UsefulOutBuf_GetOutPlace(&(pMe->OutBuf)); |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1696 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Paul Liétar | 7978977 | 2022-07-26 20:33:18 +0100 | [diff] [blame] | 1697 | uint8_t uMajorType = Nesting_GetMajorType(&(pMe->nesting)); |
| 1698 | if(uMajorType == CBOR_MAJOR_NONE_TYPE_OPEN_BSTR) { |
Laurence Lundblade | 716d10c | 2024-02-07 16:54:42 -0800 | [diff] [blame] | 1699 | /* It's OK to nest a byte string in any type but |
| 1700 | * another open byte string. */ |
Paul Liétar | 7978977 | 2022-07-26 20:33:18 +0100 | [diff] [blame] | 1701 | pMe->uError = QCBOR_ERR_OPEN_BYTE_STRING; |
| 1702 | return; |
| 1703 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1704 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1705 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1706 | QCBOREncode_Private_OpenMapOrArray(pMe, CBOR_MAJOR_NONE_TYPE_OPEN_BSTR); |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1707 | } |
| 1708 | |
| 1709 | |
| 1710 | /* |
| 1711 | * Public function for closing a byte string. See qcbor/qcbor_encode.h |
| 1712 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1713 | void |
| 1714 | QCBOREncode_CloseBytes(QCBOREncodeContext *pMe, const size_t uAmount) |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1715 | { |
| 1716 | UsefulOutBuf_Advance(&(pMe->OutBuf), uAmount); |
| 1717 | if(UsefulOutBuf_GetError(&(pMe->OutBuf))) { |
| 1718 | /* Advance too far. Normal off-end error handling in effect here. */ |
| 1719 | return; |
| 1720 | } |
| 1721 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1722 | QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_NONE_TYPE_OPEN_BSTR, uAmount); |
Laurence Lundblade | b24faef | 2022-04-26 11:03:08 -0600 | [diff] [blame] | 1723 | } |
| 1724 | |
| 1725 | |
Laurence Lundblade | cbd7d13 | 2024-05-19 11:11:22 -0700 | [diff] [blame] | 1726 | #ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1727 | /** |
| 1728 | * @brief Semi-private method to close a map, array with indefinite length |
| 1729 | * |
| 1730 | * @param[in] pMe The context to add to. |
| 1731 | * @param[in] uMajorType The major CBOR type to close. |
| 1732 | * |
| 1733 | * Call QCBOREncode_CloseArrayIndefiniteLength() or |
| 1734 | * QCBOREncode_CloseMapIndefiniteLength() instead of this. |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1735 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1736 | void |
| 1737 | QCBOREncode_Private_CloseMapOrArrayIndefiniteLength(QCBOREncodeContext *pMe, |
| 1738 | const uint8_t uMajorType) |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1739 | { |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1740 | if(QCBOREncode_Private_CheckDecreaseNesting(pMe, uMajorType)) { |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 1741 | return; |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1742 | } |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 1743 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 1744 | /* Append the break marker (0xff for both arrays and maps) */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1745 | QCBOREncode_Private_AppendCBORHead(pMe, CBOR_MAJOR_NONE_TYPE_SIMPLE_BREAK, CBOR_SIMPLE_BREAK, 0); |
Laurence Lundblade | 274ddef | 2022-05-17 09:12:23 -0700 | [diff] [blame] | 1746 | Nesting_Decrease(&(pMe->nesting)); |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1747 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1748 | #endif /* ! QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */ |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 1749 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1750 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1751 | /* |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 1752 | * Public function to finish and get the encoded result. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1753 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1754 | QCBORError |
| 1755 | QCBOREncode_Finish(QCBOREncodeContext *pMe, UsefulBufC *pEncodedCBOR) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1756 | { |
Laurence Lundblade | f2f0c3f | 2024-04-12 13:01:54 -0700 | [diff] [blame] | 1757 | if(QCBOREncode_GetErrorState(pMe) != QCBOR_SUCCESS) { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1758 | goto Done; |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 1759 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1760 | |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 1761 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1762 | if(Nesting_IsInNest(&(pMe->nesting))) { |
Laurence Lundblade | f2f0c3f | 2024-04-12 13:01:54 -0700 | [diff] [blame] | 1763 | pMe->uError = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1764 | goto Done; |
| 1765 | } |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1766 | #endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1767 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1768 | *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(pMe->OutBuf)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1769 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1770 | Done: |
Laurence Lundblade | f2f0c3f | 2024-04-12 13:01:54 -0700 | [diff] [blame] | 1771 | return pMe->uError; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1772 | } |
| 1773 | |
Laurence Lundblade | 0595e93 | 2018-11-02 22:22:47 +0700 | [diff] [blame] | 1774 | |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 1775 | /* |
Laurence Lundblade | d253e41 | 2024-08-21 11:02:56 -0700 | [diff] [blame] | 1776 | * Public function to get size of the encoded result. See qcbor/qcbor_encode.h |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 1777 | */ |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1778 | QCBORError |
| 1779 | QCBOREncode_FinishGetSize(QCBOREncodeContext *pMe, size_t *puEncodedLen) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1780 | { |
Laurence Lundblade | da3f082 | 2018-09-18 19:49:02 -0700 | [diff] [blame] | 1781 | UsefulBufC Enc; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1782 | |
Laurence Lundblade | 8e36f81 | 2024-01-26 10:59:29 -0700 | [diff] [blame] | 1783 | QCBORError nReturn = QCBOREncode_Finish(pMe, &Enc); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1784 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1785 | if(nReturn == QCBOR_SUCCESS) { |
Laurence Lundblade | da3f082 | 2018-09-18 19:49:02 -0700 | [diff] [blame] | 1786 | *puEncodedLen = Enc.len; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1787 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 1788 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1789 | return nReturn; |
| 1790 | } |
Laurence Lundblade | e222674 | 2024-08-16 10:50:23 -0700 | [diff] [blame] | 1791 | |
| 1792 | |
| 1793 | /* |
| 1794 | * Public function to get substring of encoded-so-far. See qcbor/qcbor_encode.h |
| 1795 | */ |
| 1796 | UsefulBufC |
| 1797 | QCBOREncode_SubString(QCBOREncodeContext *pMe, const size_t uStart) |
| 1798 | { |
| 1799 | if(pMe->uError) { |
| 1800 | return NULLUsefulBufC; |
| 1801 | } |
| 1802 | |
| 1803 | /* An attempt was made to detect usage errors by comparing uStart |
| 1804 | * to offsets of open arrays and maps in pMe->nesting, but it is |
| 1805 | * not possible because there's not enough information in just |
| 1806 | * the offset. It's not possible to known if Tell() was called before |
| 1807 | * or after an Open(). To detect this error, the nesting level |
| 1808 | * would also need to be known. This is not frequently used, so |
| 1809 | * it is not worth adding this complexity. |
| 1810 | */ |
| 1811 | |
| 1812 | const size_t uEnd = QCBOREncode_Tell(pMe); |
| 1813 | |
| 1814 | return UsefulOutBuf_SubString(&(pMe->OutBuf), uStart, uEnd - uStart); |
| 1815 | } |