Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 1 | /*============================================================================== |
Laurence Lundblade | d92a616 | 2018-11-01 11:38:35 +0700 | [diff] [blame] | 2 | Copyright (c) 2016-2018, The Linux Foundation. |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 3 | Copyright (c) 2018-2021, Laurence Lundblade. |
Máté Tóth-Pál | ef5f07a | 2021-09-17 19:31:37 +0200 | [diff] [blame] | 4 | Copyright (c) 2021, Arm Limited. |
Laurence Lundblade | d92a616 | 2018-11-01 11:38:35 +0700 | [diff] [blame] | 5 | All rights reserved. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 6 | |
Laurence Lundblade | 0dbc917 | 2018-11-01 14:17:21 +0700 | [diff] [blame] | 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. |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 20 | |
Laurence Lundblade | 0dbc917 | 2018-11-01 14:17:21 +0700 | [diff] [blame] | 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. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 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 | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 38 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 39 | /** |
| 40 | * @file qcbor_encode.c |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 41 | * |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 42 | * The entire implementation of the QCBOR encoder. |
| 43 | */ |
| 44 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 45 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 46 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 47 | * == Nesting Tracking == |
| 48 | * |
| 49 | * The following functions and data type QCBORTrackNesting implement |
| 50 | * the nesting management for encoding. |
| 51 | * |
| 52 | * CBOR's two nesting types, arrays and maps, are tracked here. There |
| 53 | * is a limit of QCBOR_MAX_ARRAY_NESTING to the number of arrays and |
| 54 | * maps that can be nested in one encoding so the encoding context |
| 55 | * stays small enough to fit on the stack. |
| 56 | * |
| 57 | * When an array/map is opened, pCurrentNesting points to the element |
| 58 | * in pArrays that records the type, start position and accumulates a |
| 59 | * count of the number of items added. When closed the start position |
| 60 | * is used to go back and fill in the type and number of items in the |
| 61 | * array/map. |
| 62 | * |
| 63 | * Encoded output can be a CBOR Sequence (RFC 8742) in which case |
| 64 | * there is no top-level array or map. It starts out with a string, |
| 65 | * integer or other non-aggregate type. It may have an array or map |
| 66 | * other than at the start, in which case that nesting is tracked |
| 67 | * here. |
| 68 | * |
| 69 | * QCBOR has a special feature to allow constructing byte string |
| 70 | * wrapped CBOR directly into the output buffer, so no extra buffer is |
| 71 | * needed for byte string wrapping. This is implemented as nesting |
| 72 | * with the type CBOR_MAJOR_TYPE_BYTE_STRING and is tracked here. Byte |
| 73 | * 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] | 74 | */ |
| 75 | inline static void Nesting_Init(QCBORTrackNesting *pNesting) |
| 76 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 77 | /* Assumes pNesting has been zeroed. */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 78 | pNesting->pCurrentNesting = &pNesting->pArrays[0]; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 79 | /* Implied CBOR array at the top nesting level. This is never |
| 80 | * returned, but makes the item count work correctly. |
| 81 | */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 82 | pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY; |
| 83 | } |
| 84 | |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 85 | inline static uint8_t Nesting_Increase(QCBORTrackNesting *pNesting, |
Laurence Lundblade | 2c40ab8 | 2018-12-30 14:20:29 -0800 | [diff] [blame] | 86 | uint8_t uMajorType, |
| 87 | uint32_t uPos) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 88 | { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 89 | if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) { |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 90 | return QCBOR_ERR_ARRAY_NESTING_TOO_DEEP; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 91 | } else { |
| 92 | pNesting->pCurrentNesting++; |
| 93 | pNesting->pCurrentNesting->uCount = 0; |
| 94 | pNesting->pCurrentNesting->uStart = uPos; |
| 95 | pNesting->pCurrentNesting->uMajorType = uMajorType; |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 96 | return QCBOR_SUCCESS; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 97 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 98 | } |
| 99 | |
| 100 | inline static void Nesting_Decrease(QCBORTrackNesting *pNesting) |
| 101 | { |
| 102 | pNesting->pCurrentNesting--; |
| 103 | } |
| 104 | |
Laurence Lundblade | 29497c0 | 2020-07-11 15:44:03 -0700 | [diff] [blame] | 105 | inline static uint8_t Nesting_Increment(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 106 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 107 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 1ef8b2d | 2018-12-14 23:13:34 -0800 | [diff] [blame] | 108 | if(1 >= QCBOR_MAX_ITEMS_IN_ARRAY - pNesting->pCurrentNesting->uCount) { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 109 | return QCBOR_ERR_ARRAY_TOO_LONG; |
| 110 | } |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 111 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 112 | |
Laurence Lundblade | e6bcef1 | 2020-04-01 10:56:27 -0700 | [diff] [blame] | 113 | pNesting->pCurrentNesting->uCount++; |
Laurence Lundblade | 2c40ab8 | 2018-12-30 14:20:29 -0800 | [diff] [blame] | 114 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 115 | return QCBOR_SUCCESS; |
| 116 | } |
| 117 | |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 118 | inline static void Nesting_Decrement(QCBORTrackNesting *pNesting) |
| 119 | { |
| 120 | /* No error check for going below 0 here needed because this |
| 121 | * is only used by QCBOREncode_CancelBstrWrap() and it checks |
| 122 | * the nesting level before calling this. */ |
| 123 | pNesting->pCurrentNesting->uCount--; |
| 124 | } |
| 125 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 126 | inline static uint16_t Nesting_GetCount(QCBORTrackNesting *pNesting) |
| 127 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 128 | /* The nesting count recorded is always the actual number of |
| 129 | * individual data items in the array or map. For arrays CBOR uses |
| 130 | * the actual item count. For maps, CBOR uses the number of pairs. |
| 131 | * This function returns the number needed for the CBOR encoding, |
| 132 | * so it divides the number of items by two for maps to get the |
| 133 | * number of pairs. |
| 134 | */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 135 | if(pNesting->pCurrentNesting->uMajorType == CBOR_MAJOR_TYPE_MAP) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 136 | /* Cast back to uint16_t after integer promotion from bit shift */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 137 | return (uint16_t)(pNesting->pCurrentNesting->uCount >> 1); |
| 138 | } else { |
| 139 | return pNesting->pCurrentNesting->uCount; |
| 140 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 141 | } |
| 142 | |
| 143 | inline static uint32_t Nesting_GetStartPos(QCBORTrackNesting *pNesting) |
| 144 | { |
| 145 | return pNesting->pCurrentNesting->uStart; |
| 146 | } |
| 147 | |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 148 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 149 | inline static uint8_t Nesting_GetMajorType(QCBORTrackNesting *pNesting) |
| 150 | { |
| 151 | return pNesting->pCurrentNesting->uMajorType; |
| 152 | } |
| 153 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 154 | inline static bool Nesting_IsInNest(QCBORTrackNesting *pNesting) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 155 | { |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 156 | return pNesting->pCurrentNesting == &pNesting->pArrays[0] ? false : true; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 157 | } |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 158 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 159 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 160 | |
| 161 | |
| 162 | |
| 163 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 164 | * == Major CBOR Types == |
| 165 | * |
| 166 | * Encoding of the major CBOR types is by these functions: |
| 167 | * |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 168 | * CBOR Major Type Public Function |
| 169 | * 0 QCBOREncode_AddUInt64() |
| 170 | * 0, 1 QCBOREncode_AddUInt64(), QCBOREncode_AddInt64() |
| 171 | * 2, 3 QCBOREncode_AddBuffer() |
| 172 | * 4, 5 QCBOREncode_OpenMapOrArray(), QCBOREncode_CloseMapOrArray(), |
| 173 | * QCBOREncode_OpenMapOrArrayIndefiniteLength(), |
| 174 | * QCBOREncode_CloseMapOrArrayIndefiniteLength() |
| 175 | * 6 QCBOREncode_AddTag() |
| 176 | * 7 QCBOREncode_AddDouble(), QCBOREncode_AddFloat(), |
| 177 | * QCBOREncode_AddDoubleNoPreferred(), |
| 178 | * QCBOREncode_AddFloatNoPreferred(), QCBOREncode_AddType7() |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 179 | * |
| 180 | * Additionally, encoding of decimal fractions and bigfloats is by |
| 181 | * QCBOREncode_AddExponentAndMantissa() and byte strings that wrap |
| 182 | * encoded CBOR are handled by QCBOREncode_OpenMapOrArray() and |
| 183 | * QCBOREncode_CloseBstrWrap2(). |
| 184 | * |
| 185 | * |
| 186 | * == Error Tracking Plan == |
| 187 | * |
| 188 | * Errors are tracked internally and not returned until |
| 189 | * QCBOREncode_Finish() or QCBOREncode_GetErrorState() is called. The |
| 190 | * CBOR errors are in me->uError. UsefulOutBuf also tracks whether |
| 191 | * the buffer is full or not in its context. Once either of these |
| 192 | * errors is set they are never cleared. Only QCBOREncode_Init() |
| 193 | * resets them. Or said another way, they must never be cleared or |
| 194 | * we'll tell the caller all is good when it is not. |
| 195 | * |
| 196 | * Only one error code is reported by QCBOREncode_Finish() even if |
| 197 | * there are multiple errors. The last one set wins. The caller might |
| 198 | * have to fix one error to reveal the next one they have to fix. |
| 199 | * This is OK. |
| 200 | * |
| 201 | * The buffer full error tracked by UsefulBuf is only pulled out of |
| 202 | * UsefulBuf in QCBOREncode_Finish() so it is the one that usually |
| 203 | * wins. UsefulBuf will never go off the end of the buffer even if it |
| 204 | * is called again and again when full. |
| 205 | * |
| 206 | * QCBOR_DISABLE_ENCODE_USAGE_GUARDS disables about half of the error |
| 207 | * checks here to reduce code size by about 150 bytes leaving only the |
| 208 | * checks for size to avoid buffer overflow. If the calling code is |
| 209 | * completely correct, checks are completely unnecessary. For |
| 210 | * example, there is no need to check that all the opens are matched |
| 211 | * by a close. |
| 212 | * |
| 213 | * QCBOR_DISABLE_ENCODE_USAGE_GUARDS also disables the check for more |
| 214 | * than QCBOR_MAX_ITEMS_IN_ARRAY in an array. Since |
| 215 | * QCBOR_MAX_ITEMS_IN_ARRAY is very large (65,535) it is very unlikely |
| 216 | * to be reached. If it is reached, the count will wrap around to zero |
| 217 | * and CBOR that is not well formed will be produced, but there will |
| 218 | * be no buffers overrun and new security issues in the code. |
| 219 | * |
| 220 | * The 8 errors returned here fall into three categories: |
| 221 | * |
| 222 | * Sizes |
| 223 | * QCBOR_ERR_BUFFER_TOO_LARGE -- Encoded output exceeded UINT32_MAX |
| 224 | * QCBOR_ERR_BUFFER_TOO_SMALL -- Output buffer too small |
| 225 | * QCBOR_ERR_ARRAY_NESTING_TOO_DEEP -- Nesting > QCBOR_MAX_ARRAY_NESTING1 |
| 226 | * QCBOR_ERR_ARRAY_TOO_LONG -- Too many items added to an array/map [1] |
| 227 | * |
| 228 | * Nesting constructed incorrectly |
| 229 | * QCBOR_ERR_TOO_MANY_CLOSES -- More close calls than opens [1] |
| 230 | * QCBOR_ERR_CLOSE_MISMATCH -- Type of close does not match open [1] |
| 231 | * QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN -- Finish called without enough closes [1] |
| 232 | * |
| 233 | * Would generate not-well-formed CBOR |
| 234 | * QCBOR_ERR_ENCODE_UNSUPPORTED -- Simple type between 24 and 31 [1] |
| 235 | * |
| 236 | * [1] indicated disabled by QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 237 | */ |
| 238 | |
| 239 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 240 | /* |
Laurence Lundblade | 844bb5c | 2020-03-01 17:27:25 -0800 | [diff] [blame] | 241 | Public function for initialization. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 242 | */ |
Laurence Lundblade | 2296db5 | 2018-09-14 18:08:39 -0700 | [diff] [blame] | 243 | void QCBOREncode_Init(QCBOREncodeContext *me, UsefulBuf Storage) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 244 | { |
| 245 | memset(me, 0, sizeof(QCBOREncodeContext)); |
Laurence Lundblade | 1ef8b2d | 2018-12-14 23:13:34 -0800 | [diff] [blame] | 246 | UsefulOutBuf_Init(&(me->OutBuf), Storage); |
| 247 | Nesting_Init(&(me->nesting)); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 248 | } |
| 249 | |
| 250 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 251 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 252 | * Public function to encode a CBOR head. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 253 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 254 | UsefulBufC QCBOREncode_EncodeHead(UsefulBuf buffer, |
| 255 | uint8_t uMajorType, |
| 256 | uint8_t uMinLen, |
| 257 | uint64_t uArgument) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 258 | { |
Laurence Lundblade | e9b0032 | 2018-12-30 10:33:26 -0800 | [diff] [blame] | 259 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 260 | * == Description of the CBOR Head == |
| 261 | * |
| 262 | * The head of a CBOR data item |
| 263 | * +---+-----+ +--------+ +--------+ +--------+ +--------+ |
| 264 | * |M T| A R G U M E N T . . . | |
| 265 | * +---+-----+ +--------+ +--------+ +--------+ ... +--------+ |
| 266 | * |
| 267 | * Every CBOR data item has a "head". It is made up of the "major |
| 268 | * type" and the "argument". |
| 269 | * |
| 270 | * The major type indicates whether the data item is an integer, |
| 271 | * string, array or such. It is encoded in 3 bits giving it a range |
| 272 | * from 0 to 7. 0 indicates the major type is a positive integer, |
| 273 | * 1 a negative integer, 2 a byte string and so on. |
| 274 | * |
| 275 | * These 3 bits are the first part of the "initial byte" in a data |
| 276 | * item. Every data item has an initial byte, and some only have |
| 277 | * the initial byte. |
| 278 | * |
| 279 | * The argument is essentially a number between 0 and UINT64_MAX |
| 280 | * (18446744073709551615). This number is interpreted to mean |
| 281 | * different things for the different major types. For major type |
| 282 | * 0, a positive integer, it is value of the data item. For major |
| 283 | * type 2, a byte string, it is the length in bytes of the byte |
| 284 | * string. For major type 4, an array, it is the number of data |
| 285 | * items in the array. |
| 286 | * |
| 287 | * Special encoding is used so that the argument values less than |
| 288 | * 24 can be encoded very compactly in the same byte as the major |
| 289 | * type is encoded. When the lower 5 bits of the initial byte have |
| 290 | * a value less than 24, then that is the value of the argument. |
| 291 | * |
| 292 | * If the lower 5 bits of the initial byte are less than 24, then |
| 293 | * they are the value of the argument. This allows integer values 0 |
| 294 | * - 23 to be CBOR encoded in just one byte. |
| 295 | * |
| 296 | * When the value of lower 5 bits are 24, 25, 26, or 27 the |
| 297 | * argument is encoded in 1, 2, 4 or 8 bytes following the initial |
| 298 | * byte in network byte order (bit endian). The cases when it is |
| 299 | * 28, 29 and 30 are reserved for future use. The value 31 is a |
| 300 | * special indicator for indefinite length strings, arrays and |
| 301 | * maps. |
| 302 | * |
| 303 | * The lower 5 bits are called the "additional information." |
| 304 | * |
| 305 | * Thus the CBOR head may be 1, 2, 3, 5 or 9 bytes long. |
| 306 | * |
| 307 | * It is legal in CBOR to encode the argument using any of these |
| 308 | * lengths even if it could be encoded in a shorter length. For |
| 309 | * example it is legal to encode a data item representing the |
| 310 | * positive integer 0 in 9 bytes even though it could be encoded in |
| 311 | * only 0. This is legal to allow for for very simple code or even |
| 312 | * hardware-only implementations that just output a register |
| 313 | * directly. |
| 314 | * |
| 315 | * CBOR defines preferred encoding as the encoding of the argument |
| 316 | * in the smallest number of bytes needed to encode it. |
| 317 | * |
| 318 | * This function takes the major type and argument as inputs and |
| 319 | * outputs the encoded CBOR head for them. It does conversion to |
| 320 | * network byte order. It implements CBOR preferred encoding, |
| 321 | * outputting the shortest representation of the argument. |
| 322 | * |
| 323 | * == Endian Conversion == |
| 324 | * |
| 325 | * This code does endian conversion without hton() or knowing the |
| 326 | * endianness of the machine by using masks and shifts. This avoids |
| 327 | * the dependency on hton() and the mess of figuring out how to |
| 328 | * find the machine's endianness. |
| 329 | * |
| 330 | * This is a good efficient implementation on little-endian |
| 331 | * machines. A faster and smaller implementation is possible on |
| 332 | * big-endian machines because CBOR/network byte order is |
| 333 | * big-endian. However big-endian machines are uncommon. |
| 334 | * |
| 335 | * On x86, this is about 150 bytes instead of 500 bytes for the |
| 336 | * original, more formal unoptimized code. |
| 337 | * |
| 338 | * This also does the CBOR preferred shortest encoding for integers |
| 339 | * and is called to do endian conversion for floats. |
| 340 | * |
| 341 | * It works backwards from the least significant byte to the most |
| 342 | * significant byte. |
| 343 | * |
| 344 | * == Floating Point == |
| 345 | * |
| 346 | * When the major type is 7 and the 5 lower bits have the values |
| 347 | * 25, 26 or 27, the argument is a floating-point number that is |
| 348 | * half, single or double-precision. Note that it is not the |
| 349 | * conversion from a floating-point value to an integer value like |
| 350 | * converting 0x00 to 0.00, it is the interpretation of the bits in |
| 351 | * the argument as an IEEE 754 float-point number. |
| 352 | * |
| 353 | * Floating-point numbers must be converted to network byte |
| 354 | * order. That is accomplished here by exactly the same code that |
| 355 | * converts integer arguments to network byte order. |
| 356 | * |
| 357 | * There is preferred encoding for floating-point numbers in CBOR, |
| 358 | * but it is very different than for integers and it is not |
| 359 | * implemented here. Half-precision is preferred to |
| 360 | * single-precision which is preferred to double-precision only if |
| 361 | * the conversion can be performed without loss of precision. Zero |
| 362 | * and infinity can always be converted to half-precision, without |
| 363 | * loss but 3.141592653589 cannot. |
| 364 | * |
| 365 | * The way this function knows to not do preferred encoding on the |
| 366 | * argument passed here when it is a floating point number is the |
| 367 | * uMinLen parameter. It should be 2, 4 or 8 for half, single and |
| 368 | * double precision floating point values. This prevents and the |
| 369 | * incorrect removal of leading zeros when encoding arguments that |
| 370 | * are floating-point numbers. |
| 371 | * |
| 372 | * == Use of Type int and Static Analyzers == |
| 373 | * |
| 374 | * The type int is used here for several variables because of the |
| 375 | * way integer promotion works in C for variables that are uint8_t |
| 376 | * or uint16_t. The basic rule is that they will always be promoted |
| 377 | * to int if they will fit. These integer variables here need only |
| 378 | * hold values less than 255 so they will always fit into an int. |
| 379 | * |
| 380 | * Most of values stored are never negative, so one might think |
| 381 | * that unsigned int would be more correct than int. However the C |
| 382 | * integer promotion rules only promote to unsigned int if the |
| 383 | * result won't fit into an int even if the promotion is for an |
| 384 | * unsigned variable like uint8_t. |
| 385 | * |
| 386 | * By declaring these int, there are few implicit conversions and |
| 387 | * fewer casts needed. Code size is reduced a little. It makes |
| 388 | * static analyzers happier. |
| 389 | * |
| 390 | * Note also that declaring these uint8_t won't stop integer wrap |
| 391 | * around if the code is wrong. It won't make the code more |
| 392 | * correct. |
| 393 | * |
| 394 | * https://stackoverflow.com/questions/46073295/implicit-type-promotion-rules |
| 395 | * https://stackoverflow.com/questions/589575/what-does-the-c-standard-state-the-size-of-int-long-type-to-be |
| 396 | * |
| 397 | * Code Reviewers: THIS FUNCTION DOES POINTER MATH |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 398 | */ |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 399 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 400 | /* The buffer must have room for the largest CBOR HEAD + one |
| 401 | * extra. The one extra is needed for this code to work as it does |
| 402 | * a pre-decrement. |
| 403 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 404 | if(buffer.len < QCBOR_HEAD_BUFFER_SIZE) { |
| 405 | return NULLUsefulBufC; |
| 406 | } |
| 407 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 408 | /* Pointer to last valid byte in the buffer */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 409 | uint8_t * const pBufferEnd = &((uint8_t *)buffer.ptr)[QCBOR_HEAD_BUFFER_SIZE-1]; |
| 410 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 411 | /* Point to the last byte and work backwards */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 412 | uint8_t *pByte = pBufferEnd; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 413 | /* 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] | 414 | int nAdditionalInfo; |
Laurence Lundblade | 2c40ab8 | 2018-12-30 14:20:29 -0800 | [diff] [blame] | 415 | |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 416 | if(uMajorType > QCBOR_INDEFINITE_LEN_TYPE_MODIFIER) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 417 | /* Special case for start & end of indefinite length */ |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 418 | uMajorType = uMajorType - QCBOR_INDEFINITE_LEN_TYPE_MODIFIER; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 419 | /* This takes advantage of design of CBOR where additional info |
| 420 | * is 31 for both opening and closing indefinite length |
| 421 | * maps and arrays. |
| 422 | */ |
| 423 | #if CBOR_SIMPLE_BREAK != LEN_IS_INDEFINITE |
| 424 | #error additional info for opening array not the same as for closing |
| 425 | #endif |
Laurence Lundblade | 8c858ab | 2020-11-02 19:53:49 -0800 | [diff] [blame] | 426 | nAdditionalInfo = CBOR_SIMPLE_BREAK; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 427 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 428 | } else if (uArgument < CBOR_TWENTY_FOUR && uMinLen == 0) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 429 | /* Simple case where argument is < 24 */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 430 | nAdditionalInfo = (int)uArgument; |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 431 | |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 432 | } else { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 433 | /* This encodes the argument in 1,2,4 or 8 bytes. The outer loop |
| 434 | * runs once for 1 byte and 4 times for 8 bytes. The inner loop |
| 435 | * runs 1, 2 or 4 times depending on outer loop counter. This |
| 436 | * works backwards shifting 8 bits off the argument being |
| 437 | * encoded at a time until all bits from uArgument have been |
| 438 | * encoded and the minimum encoding size is reached. Minimum |
| 439 | * encoding size is for floating-point numbers that have some |
| 440 | * zero-value bytes that must be output. |
Laurence Lundblade | e9b0032 | 2018-12-30 10:33:26 -0800 | [diff] [blame] | 441 | */ |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 442 | static const uint8_t aIterate[] = {1,1,2,4}; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 443 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 444 | /* uMinLen passed in is unsigned, but goes negative in the loop |
| 445 | * so it must be converted to a signed value. |
| 446 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 447 | int nMinLen = (int)uMinLen; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 448 | int i; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 449 | for(i = 0; uArgument || nMinLen > 0; i++) { |
| 450 | const int nIterations = (int)aIterate[i]; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 451 | for(int j = 0; j < nIterations; j++) { |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 452 | *--pByte = (uint8_t)(uArgument & 0xff); |
| 453 | uArgument = uArgument >> 8; |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 454 | } |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 455 | nMinLen -= nIterations; |
Laurence Lundblade | 04a859b | 2018-12-11 12:13:02 -0800 | [diff] [blame] | 456 | } |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 457 | |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 458 | nAdditionalInfo = LEN_IS_ONE_BYTE-1 + i; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 459 | } |
Laurence Lundblade | f970f1d | 2018-12-14 01:44:23 -0800 | [diff] [blame] | 460 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 461 | /* This expression integer-promotes to type int. The code above in |
| 462 | * function guarantees that nAdditionalInfo will never be larger |
| 463 | * than 0x1f. The caller may pass in a too-large uMajor type. The |
| 464 | * conversion to unint8_t will cause an integer wrap around and |
| 465 | * incorrect CBOR will be generated, but no security issue will |
| 466 | * occur. |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 467 | */ |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 468 | const int nInitialByte = (uMajorType << 5) + nAdditionalInfo; |
| 469 | *--pByte = (uint8_t)nInitialByte; |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 470 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 471 | #ifdef EXTRA_ENCODE_HEAD_CHECK |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 472 | /* This is a sanity check that can be turned on to verify the |
| 473 | * pointer math in this function is not going wrong. Turn it on and |
| 474 | * run the whole test suite to perform the check. |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 475 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 476 | if(pBufferEnd - pByte > 9 || pBufferEnd - pByte < 1 || pByte < (uint8_t *)buffer.ptr) { |
| 477 | return NULLUsefulBufC; |
| 478 | } |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 479 | #endif /* EXTRA_ENCODE_HEAD_CHECK */ |
Laurence Lundblade | c5fef68 | 2020-01-25 11:38:45 -0800 | [diff] [blame] | 480 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 481 | /* Length will not go negative because the loops run for at most 8 decrements |
| 482 | * of pByte, only one other decrement is made, and the array is sized |
| 483 | * for this. |
| 484 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 485 | return (UsefulBufC){pByte, (size_t)(pBufferEnd - pByte)}; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 486 | } |
| 487 | |
| 488 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 489 | /** |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 490 | * @brief Append the CBOR head, the major type and argument |
| 491 | * |
| 492 | * @param me Encoder context. |
| 493 | * @param uMajorType Major type to insert. |
| 494 | * @param uArgument The argument (an integer value or a length). |
| 495 | * @param uMinLen The minimum number of bytes for encoding the CBOR argument. |
| 496 | * |
| 497 | * This formats the CBOR "head" and appends it to the output. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 498 | */ |
| 499 | static void AppendCBORHead(QCBOREncodeContext *me, uint8_t uMajorType, uint64_t uArgument, uint8_t uMinLen) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 500 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 501 | /* A stack buffer large enough for a CBOR head */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 502 | UsefulBuf_MAKE_STACK_UB (pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE); |
| 503 | |
| 504 | UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead, |
| 505 | uMajorType, |
| 506 | uMinLen, |
| 507 | uArgument); |
| 508 | |
| 509 | /* No check for EncodedHead == NULLUsefulBufC is performed here to |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 510 | * save object code. It is very clear that pBufferForEncodedHead is |
| 511 | * the correct size. If EncodedHead == NULLUsefulBufC then |
| 512 | * UsefulOutBuf_AppendUsefulBuf() will do nothing so there is no |
| 513 | * security hole introduced. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 514 | */ |
| 515 | |
| 516 | UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), EncodedHead); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 517 | } |
| 518 | |
| 519 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 520 | /** |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 521 | * @brief Insert the CBOR head for a map, array or wrapped bstr |
| 522 | * |
| 523 | * @param me QCBOR encoding context. |
| 524 | * @param uMajorType One of CBOR_MAJOR_TYPE_XXXX. |
| 525 | * @param uLen The length of the data item. |
| 526 | * |
| 527 | * When an array, map or bstr was opened, nothing was done but note |
| 528 | * the position. This function goes back to that position and inserts |
| 529 | * the CBOR Head with the major type and length. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 530 | */ |
| 531 | static void InsertCBORHead(QCBOREncodeContext *me, uint8_t uMajorType, size_t uLen) |
| 532 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 533 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 534 | if(me->uError == QCBOR_SUCCESS) { |
| 535 | if(!Nesting_IsInNest(&(me->nesting))) { |
| 536 | me->uError = QCBOR_ERR_TOO_MANY_CLOSES; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 537 | return; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 538 | } else if(Nesting_GetMajorType(&(me->nesting)) != uMajorType) { |
| 539 | me->uError = QCBOR_ERR_CLOSE_MISMATCH; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 540 | return; |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 541 | } |
| 542 | } |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 543 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 544 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 545 | /* A stack buffer large enough for a CBOR head */ |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 546 | UsefulBuf_MAKE_STACK_UB(pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE); |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 547 | |
| 548 | UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead, |
| 549 | uMajorType, |
| 550 | 0, |
| 551 | uLen); |
| 552 | |
| 553 | /* No check for EncodedHead == NULLUsefulBufC is performed here to |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 554 | * save object code. It is very clear that pBufferForEncodedHead is |
| 555 | * the correct size. If EncodedHead == NULLUsefulBufC then |
| 556 | * UsefulOutBuf_InsertUsefulBuf() will do nothing so there is no |
Laurence Lundblade | 9e2f708 | 2021-05-17 02:10:48 -0700 | [diff] [blame] | 557 | * security hole introduced. |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 558 | */ |
| 559 | UsefulOutBuf_InsertUsefulBuf(&(me->OutBuf), |
| 560 | EncodedHead, |
| 561 | Nesting_GetStartPos(&(me->nesting))); |
| 562 | |
| 563 | Nesting_Decrease(&(me->nesting)); |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 564 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 565 | |
Laurence Lundblade | 241705e | 2018-12-30 18:56:14 -0800 | [diff] [blame] | 566 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 567 | /** |
| 568 | * @brief Increment item counter for maps and arrays. |
| 569 | * |
| 570 | * @param pMe QCBOR encoding context. |
| 571 | * |
| 572 | * This is mostly a separate function to make code more readable and |
| 573 | * to have fewer occurrences of #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 574 | */ |
| 575 | static inline void IncrementMapOrArrayCount(QCBOREncodeContext *pMe) |
| 576 | { |
| 577 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 578 | if(pMe->uError == QCBOR_SUCCESS) { |
| 579 | pMe->uError = Nesting_Increment(&(pMe->nesting)); |
| 580 | } |
| 581 | #else |
| 582 | (void)Nesting_Increment(&(pMe->nesting)); |
| 583 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 584 | } |
| 585 | |
| 586 | |
| 587 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 588 | * Public functions for adding unsigned integers. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 589 | */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 590 | void QCBOREncode_AddUInt64(QCBOREncodeContext *me, uint64_t uValue) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 591 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 592 | AppendCBORHead(me, CBOR_MAJOR_TYPE_POSITIVE_INT, uValue, 0); |
| 593 | |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 594 | IncrementMapOrArrayCount(me); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 595 | } |
| 596 | |
Laurence Lundblade | 56230d1 | 2018-11-01 11:14:51 +0700 | [diff] [blame] | 597 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 598 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 599 | * Public functions for adding signed integers. See qcbor/qcbor_encode.h |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 600 | */ |
| 601 | void QCBOREncode_AddInt64(QCBOREncodeContext *me, int64_t nNum) |
| 602 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 603 | uint8_t uMajorType; |
| 604 | uint64_t uValue; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 605 | |
| 606 | if(nNum < 0) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 607 | /* In CBOR -1 encodes as 0x00 with major type negative int. */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 608 | uValue = (uint64_t)(-nNum - 1); |
| 609 | uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT; |
| 610 | } else { |
| 611 | uValue = (uint64_t)nNum; |
| 612 | uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT; |
| 613 | } |
| 614 | AppendCBORHead(me, uMajorType, uValue, 0); |
| 615 | |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 616 | IncrementMapOrArrayCount(me); |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 617 | } |
| 618 | |
| 619 | |
| 620 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 621 | * Semi-private function. It is exposed to user of the interface, but |
| 622 | * one of its inline wrappers will usually be called instead of this. |
| 623 | * |
| 624 | * See qcbor/qcbor_encode.h |
| 625 | * |
| 626 | * This does the work of adding actual strings bytes to the CBOR |
| 627 | * output (as opposed to adding numbers and opening / closing |
| 628 | * aggregate types). |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 629 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 630 | * There are four use cases: |
| 631 | * CBOR_MAJOR_TYPE_BYTE_STRING -- Byte strings |
| 632 | * CBOR_MAJOR_TYPE_TEXT_STRING -- Text strings |
| 633 | * CBOR_MAJOR_NONE_TYPE_RAW -- Already-encoded CBOR |
| 634 | * CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY -- Special case |
| 635 | * |
| 636 | * The first two add the head plus the actual bytes. The third just |
| 637 | * adds the bytes as the heas is presumed to be in the bytes. The |
| 638 | * fourth just adds the head for the very special case of |
| 639 | * QCBOREncode_AddBytesLenOnly(). |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 640 | */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 641 | void QCBOREncode_AddBuffer(QCBOREncodeContext *me, uint8_t uMajorType, UsefulBufC Bytes) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 642 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 643 | /* If it is not Raw CBOR, add the type and the length */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 644 | if(uMajorType != CBOR_MAJOR_NONE_TYPE_RAW) { |
| 645 | uint8_t uRealMajorType = uMajorType; |
| 646 | if(uRealMajorType == CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY) { |
| 647 | uRealMajorType = CBOR_MAJOR_TYPE_BYTE_STRING; |
| 648 | } |
| 649 | AppendCBORHead(me, uRealMajorType, Bytes.len, 0); |
| 650 | } |
| 651 | |
| 652 | if(uMajorType != CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 653 | /* Actually add the bytes */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 654 | UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), Bytes); |
| 655 | } |
| 656 | |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 657 | IncrementMapOrArrayCount(me); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 658 | } |
| 659 | |
Laurence Lundblade | cafcfe1 | 2018-10-31 21:59:50 +0700 | [diff] [blame] | 660 | |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 661 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 662 | * Public functions for adding a tag. See qcbor/qcbor_encode.h |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 663 | */ |
| 664 | void QCBOREncode_AddTag(QCBOREncodeContext *me, uint64_t uTag) |
| 665 | { |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 666 | AppendCBORHead(me, CBOR_MAJOR_TYPE_TAG, uTag, 0); |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 667 | } |
| 668 | |
| 669 | |
Laurence Lundblade | 56230d1 | 2018-11-01 11:14:51 +0700 | [diff] [blame] | 670 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 671 | * Semi-private function. It is exposed to user of the interface, but |
| 672 | * one of its inline wrappers will usually be called instead of this. |
| 673 | * |
| 674 | * See header qcbor/qcbor_encode.h |
Laurence Lundblade | 56230d1 | 2018-11-01 11:14:51 +0700 | [diff] [blame] | 675 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 676 | void QCBOREncode_AddType7(QCBOREncodeContext *me, uint8_t uMinLen, uint64_t uNum) |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 677 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 678 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 487930f | 2018-11-30 11:01:45 -0800 | [diff] [blame] | 679 | if(me->uError == QCBOR_SUCCESS) { |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 680 | if(uNum >= CBOR_SIMPLEV_RESERVED_START && uNum <= CBOR_SIMPLEV_RESERVED_END) { |
Laurence Lundblade | a9489f8 | 2020-09-12 13:50:56 -0700 | [diff] [blame] | 681 | me->uError = QCBOR_ERR_ENCODE_UNSUPPORTED; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 682 | return; |
Laurence Lundblade | bb1062e | 2019-08-12 23:28:54 -0700 | [diff] [blame] | 683 | } |
Laurence Lundblade | 487930f | 2018-11-30 11:01:45 -0800 | [diff] [blame] | 684 | } |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 685 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 686 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 687 | /* AppendCBORHead() does endian swapping for the float / double */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 688 | AppendCBORHead(me, CBOR_MAJOR_TYPE_SIMPLE, uNum, uMinLen); |
Laurence Lundblade | 3f1318a | 2021-01-04 18:26:44 -0800 | [diff] [blame] | 689 | |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 690 | IncrementMapOrArrayCount(me); |
Laurence Lundblade | 55a2483 | 2018-10-30 04:35:08 +0700 | [diff] [blame] | 691 | } |
| 692 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 693 | |
Máté Tóth-Pál | ef5f07a | 2021-09-17 19:31:37 +0200 | [diff] [blame] | 694 | #ifndef USEFULBUF_DISABLE_ALL_FLOAT |
Laurence Lundblade | 32f3e62 | 2020-07-13 20:35:11 -0700 | [diff] [blame] | 695 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 696 | * Public functions for adding a double. See qcbor/qcbor_encode.h |
| 697 | */ |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 698 | void QCBOREncode_AddDoubleNoPreferred(QCBOREncodeContext *me, double dNum) |
| 699 | { |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 700 | QCBOREncode_AddType7(me, |
| 701 | sizeof(uint64_t), |
| 702 | UsefulBufUtil_CopyDoubleToUint64(dNum)); |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 703 | } |
| 704 | |
Laurence Lundblade | 32f3e62 | 2020-07-13 20:35:11 -0700 | [diff] [blame] | 705 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 706 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 707 | * Public functions for adding a double. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 708 | */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 709 | void QCBOREncode_AddDouble(QCBOREncodeContext *me, double dNum) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 710 | { |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 711 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 712 | const IEEE754_union uNum = IEEE754_DoubleToSmallest(dNum); |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 713 | |
Laurence Lundblade | 487930f | 2018-11-30 11:01:45 -0800 | [diff] [blame] | 714 | QCBOREncode_AddType7(me, uNum.uSize, uNum.uValue); |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 715 | #else /* QCBOR_DISABLE_PREFERRED_FLOAT */ |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 716 | QCBOREncode_AddDoubleNoPreferred(me, dNum); |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 717 | #endif /* QCBOR_DISABLE_PREFERRED_FLOAT */ |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 718 | } |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 719 | |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 720 | |
Laurence Lundblade | 32f3e62 | 2020-07-13 20:35:11 -0700 | [diff] [blame] | 721 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 722 | * Public functions for adding a float. See qcbor/qcbor_encode.h |
| 723 | */ |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 724 | void QCBOREncode_AddFloatNoPreferred(QCBOREncodeContext *me, float fNum) |
| 725 | { |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 726 | QCBOREncode_AddType7(me, |
| 727 | sizeof(uint32_t), |
| 728 | UsefulBufUtil_CopyFloatToUint32(fNum)); |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 729 | } |
| 730 | |
| 731 | |
| 732 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 733 | * Public functions for adding a float. See qcbor/qcbor_encode.h |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 734 | */ |
| 735 | void QCBOREncode_AddFloat(QCBOREncodeContext *me, float fNum) |
| 736 | { |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 737 | #ifndef QCBOR_DISABLE_PREFERRED_FLOAT |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 738 | const IEEE754_union uNum = IEEE754_FloatToSmallest(fNum); |
Laurence Lundblade | 2feb1e1 | 2020-07-15 03:50:45 -0700 | [diff] [blame] | 739 | |
Laurence Lundblade | 9682a53 | 2020-06-06 18:33:04 -0700 | [diff] [blame] | 740 | QCBOREncode_AddType7(me, uNum.uSize, uNum.uValue); |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 741 | #else /* QCBOR_DISABLE_PREFERRED_FLOAT */ |
Laurence Lundblade | b275cdc | 2020-07-12 12:34:38 -0700 | [diff] [blame] | 742 | QCBOREncode_AddFloatNoPreferred(me, fNum); |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 743 | #endif /* QCBOR_DISABLE_PREFERRED_FLOAT */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 744 | } |
Máté Tóth-Pál | ef5f07a | 2021-09-17 19:31:37 +0200 | [diff] [blame] | 745 | #endif /* USEFULBUF_DISABLE_ALL_FLOAT */ |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 746 | |
| 747 | |
Laurence Lundblade | dd6e76e | 2021-03-10 01:54:01 -0700 | [diff] [blame] | 748 | #ifndef QCBOR_DISABLE_EXP_AND_MANTISSA |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 749 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 750 | * Semi-public function. It is exposed to the user of the interface, |
| 751 | * but one of the inline wrappers will usually be called rather than |
| 752 | * this. |
| 753 | * |
| 754 | * See qcbor/qcbor_encode.h |
| 755 | * |
| 756 | * Improvement: create another version of this that only takes a big |
| 757 | * number mantissa and converts the output to a type 0 or 1 integer |
| 758 | * when mantissa is small enough. |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 759 | */ |
| 760 | void QCBOREncode_AddExponentAndMantissa(QCBOREncodeContext *pMe, |
| 761 | uint64_t uTag, |
| 762 | UsefulBufC BigNumMantissa, |
| 763 | bool bBigNumIsNegative, |
| 764 | int64_t nMantissa, |
| 765 | int64_t nExponent) |
| 766 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 767 | /* This is for encoding either a big float or a decimal fraction, |
| 768 | * both of which are an array of two items, an exponent and a |
| 769 | * mantissa. The difference between the two is that the exponent |
| 770 | * is base-2 for big floats and base-10 for decimal fractions, but |
| 771 | * that has no effect on the code here. |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 772 | */ |
Laurence Lundblade | ae66d3f | 2020-09-14 18:12:08 -0700 | [diff] [blame] | 773 | if(uTag != CBOR_TAG_INVALID64) { |
| 774 | QCBOREncode_AddTag(pMe, uTag); |
| 775 | } |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 776 | QCBOREncode_OpenArray(pMe); |
| 777 | QCBOREncode_AddInt64(pMe, nExponent); |
| 778 | if(!UsefulBuf_IsNULLC(BigNumMantissa)) { |
| 779 | if(bBigNumIsNegative) { |
| 780 | QCBOREncode_AddNegativeBignum(pMe, BigNumMantissa); |
| 781 | } else { |
| 782 | QCBOREncode_AddPositiveBignum(pMe, BigNumMantissa); |
| 783 | } |
| 784 | } else { |
| 785 | QCBOREncode_AddInt64(pMe, nMantissa); |
| 786 | } |
| 787 | QCBOREncode_CloseArray(pMe); |
| 788 | } |
Laurence Lundblade | dd6e76e | 2021-03-10 01:54:01 -0700 | [diff] [blame] | 789 | #endif /* QCBOR_DISABLE_EXP_AND_MANTISSA */ |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 790 | |
| 791 | |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 792 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 793 | * Semi-public function. It is exposed to the user of the interface, |
| 794 | * but one of the inline wrappers will usually be called rather than |
| 795 | * this. |
| 796 | * |
| 797 | * See qcbor/qcbor_encode.h |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 798 | */ |
| 799 | void QCBOREncode_OpenMapOrArray(QCBOREncodeContext *me, uint8_t uMajorType) |
| 800 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 801 | /* Add one item to the nesting level we are in for the new map or array */ |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 802 | IncrementMapOrArrayCount(me); |
Laurence Lundblade | d39cd39 | 2019-01-11 18:17:38 -0800 | [diff] [blame] | 803 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 804 | /* The offset where the length of an array or map will get written |
| 805 | * is stored in a uint32_t, not a size_t to keep stack usage |
| 806 | * smaller. This checks to be sure there is no wrap around when |
| 807 | * recording the offset. Note that on 64-bit machines CBOR larger |
| 808 | * than 4GB can be encoded as long as no array/map offsets occur |
| 809 | * past the 4GB mark, but the public interface says that the |
| 810 | * maximum is 4GB to keep the discussion simpler. |
| 811 | */ |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 812 | size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf)); |
Laurence Lundblade | d39cd39 | 2019-01-11 18:17:38 -0800 | [diff] [blame] | 813 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 814 | /* QCBOR_MAX_ARRAY_OFFSET is slightly less than UINT32_MAX so this |
| 815 | * code can run on a 32-bit machine and tests can pass on a 32-bit |
| 816 | * machine. If it was exactly UINT32_MAX, then this code would not |
| 817 | * compile or run on a 32-bit machine and an #ifdef or some machine |
| 818 | * size detection would be needed reducing portability. |
| 819 | */ |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 820 | if(uEndPosition >= QCBOR_MAX_ARRAY_OFFSET) { |
| 821 | me->uError = QCBOR_ERR_BUFFER_TOO_LARGE; |
| 822 | |
| 823 | } else { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 824 | /* Increase nesting level because this is a map or array. Cast |
| 825 | * from size_t to uin32_t is safe because of check above. |
| 826 | */ |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 827 | me->uError = Nesting_Increase(&(me->nesting), uMajorType, (uint32_t)uEndPosition); |
Laurence Lundblade | 1ef8b2d | 2018-12-14 23:13:34 -0800 | [diff] [blame] | 828 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 829 | } |
| 830 | |
Laurence Lundblade | 59289e5 | 2019-12-30 13:44:37 -0800 | [diff] [blame] | 831 | |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 832 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 833 | * Semi-public function. It is exposed to the user of the interface, |
| 834 | * but one of the inline wrappers will usually be called rather than |
| 835 | * this. |
| 836 | * |
| 837 | * See qcbor/qcbor_encode.h |
| 838 | */ |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 839 | void QCBOREncode_OpenMapOrArrayIndefiniteLength(QCBOREncodeContext *me, uint8_t uMajorType) |
| 840 | { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 841 | /* Insert the indefinite length marker (0x9f for arrays, 0xbf for maps) */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 842 | AppendCBORHead(me, uMajorType, 0, 0); |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 843 | |
| 844 | /* Call the definite-length opener just to do the bookkeeping for |
| 845 | * nesting. It will record the position of the opening item in the |
| 846 | * encoded output but this is not used when closing this open. |
| 847 | */ |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 848 | QCBOREncode_OpenMapOrArray(me, uMajorType); |
| 849 | } |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 850 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 851 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 852 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 853 | * Public functions for closing arrays and maps. See qcbor/qcbor_encode.h |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 854 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 855 | void QCBOREncode_CloseMapOrArray(QCBOREncodeContext *me, uint8_t uMajorType) |
Laurence Lundblade | a954db9 | 2018-09-28 19:27:31 -0700 | [diff] [blame] | 856 | { |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 857 | InsertCBORHead(me, uMajorType, Nesting_GetCount(&(me->nesting))); |
| 858 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 859 | |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 860 | |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 861 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 862 | * Public functions for closing bstr wrapping. See qcbor/qcbor_encode.h |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 863 | */ |
| 864 | void QCBOREncode_CloseBstrWrap2(QCBOREncodeContext *me, bool bIncludeCBORHead, UsefulBufC *pWrappedCBOR) |
| 865 | { |
| 866 | const size_t uInsertPosition = Nesting_GetStartPos(&(me->nesting)); |
| 867 | const size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 868 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 869 | /* This subtraction can't go negative because the UsefulOutBuf |
| 870 | * always only grows and never shrinks. UsefulOutBut itself also |
| 871 | * has defenses such that it won't write where it should not even |
| 872 | * if given incorrect input lengths. |
| 873 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 874 | const size_t uBstrLen = uEndPosition - uInsertPosition; |
| 875 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 876 | /* Actually insert */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 877 | InsertCBORHead(me, CBOR_MAJOR_TYPE_BYTE_STRING, uBstrLen); |
| 878 | |
| 879 | if(pWrappedCBOR) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 880 | /* Return pointer and length to the enclosed encoded CBOR. The |
| 881 | * intended use is for it to be hashed (e.g., SHA-256) in a COSE |
| 882 | * implementation. This must be used right away, as the pointer |
| 883 | * and length go invalid on any subsequent calls to this |
| 884 | * function because there might be calls to |
| 885 | * InsertEncodedTypeAndNumber() that slides data to the right. |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 886 | */ |
| 887 | size_t uStartOfNew = uInsertPosition; |
| 888 | if(!bIncludeCBORHead) { |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 889 | /* Skip over the CBOR head to just get the inserted bstr */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 890 | const size_t uNewEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf)); |
| 891 | uStartOfNew += uNewEndPosition - uEndPosition; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 892 | } |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 893 | const UsefulBufC PartialResult = UsefulOutBuf_OutUBuf(&(me->OutBuf)); |
| 894 | *pWrappedCBOR = UsefulBuf_Tail(PartialResult, uStartOfNew); |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 895 | } |
| 896 | } |
| 897 | |
Laurence Lundblade | ee85174 | 2020-01-08 08:37:05 -0800 | [diff] [blame] | 898 | |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 899 | /* |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 900 | * Public function for canceling a bstr wrap. See qcbor/qcbor_encode.h |
| 901 | */ |
| 902 | void QCBOREncode_CancelBstrWrap(QCBOREncodeContext *pMe) |
| 903 | { |
| 904 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
| 905 | if(pMe->uError == QCBOR_SUCCESS) { |
| 906 | if(!Nesting_IsInNest(&(pMe->nesting))) { |
| 907 | pMe->uError = QCBOR_ERR_TOO_MANY_CLOSES; |
| 908 | return; |
| 909 | } else if(Nesting_GetMajorType(&(pMe->nesting)) != CBOR_MAJOR_TYPE_BYTE_STRING) { |
| 910 | pMe->uError = QCBOR_ERR_CLOSE_MISMATCH; |
| 911 | return; |
| 912 | } |
| 913 | const size_t uCurrent = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf)); |
| 914 | if(pMe->nesting.pCurrentNesting->uStart != uCurrent) { |
| 915 | pMe->uError = QCBOR_ERR_CANNOT_CANCEL; |
| 916 | return; |
| 917 | } |
| 918 | } |
| 919 | /* QCBOREncode_CancelBstrWrap() can't correctly undo |
| 920 | * QCBOREncode_BstrWrapInMap() or QCBOREncode_BstrWrapInMapN(). It |
| 921 | * can't undo the labels they add. It also doesn't catch the error |
| 922 | * of using it this way. QCBOREncode_CancelBstrWrap() is used |
| 923 | * infrequently and the the result is incorrect CBOR, not a |
| 924 | * security hole, so no extra code or state is added to handle this |
| 925 | * condition. |
| 926 | */ |
| 927 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
| 928 | |
| 929 | Nesting_Decrease(&(pMe->nesting)); |
| 930 | Nesting_Decrement(&(pMe->nesting)); |
| 931 | } |
| 932 | |
| 933 | |
| 934 | /* |
| 935 | * Public function for closing arrays and maps. See qcbor/qcbor_encode.h |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 936 | */ |
Laurence Lundblade | c9f0fbc | 2020-02-07 10:48:33 +0000 | [diff] [blame] | 937 | void QCBOREncode_CloseMapOrArrayIndefiniteLength(QCBOREncodeContext *me, uint8_t uMajorType) |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 938 | { |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 939 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 940 | if(me->uError == QCBOR_SUCCESS) { |
| 941 | if(!Nesting_IsInNest(&(me->nesting))) { |
| 942 | me->uError = QCBOR_ERR_TOO_MANY_CLOSES; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 943 | return; |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 944 | } else if(Nesting_GetMajorType(&(me->nesting)) != uMajorType) { |
| 945 | me->uError = QCBOR_ERR_CLOSE_MISMATCH; |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 946 | return; |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 947 | } |
| 948 | } |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 949 | #else /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 950 | (void) uMajorType; |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 951 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 952 | |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 953 | /* Append the break marker (0xff for both arrays and maps) */ |
Laurence Lundblade | d8e1c51 | 2020-11-04 23:03:44 -0800 | [diff] [blame] | 954 | AppendCBORHead(me, CBOR_MAJOR_NONE_TYPE_SIMPLE_BREAK, CBOR_SIMPLE_BREAK, 0); |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 955 | Nesting_Decrease(&(me->nesting)); |
Jan Jongboom | 4a93a66 | 2019-07-25 08:44:58 +0200 | [diff] [blame] | 956 | } |
| 957 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 958 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 959 | /* |
Laurence Lundblade | 8d3b855 | 2021-06-10 11:11:54 -0700 | [diff] [blame] | 960 | * 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] | 961 | */ |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 962 | QCBORError QCBOREncode_Finish(QCBOREncodeContext *me, UsefulBufC *pEncodedCBOR) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 963 | { |
Laurence Lundblade | f607a2a | 2019-07-05 21:25:25 -0700 | [diff] [blame] | 964 | QCBORError uReturn = QCBOREncode_GetErrorState(me); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 965 | |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 966 | if(uReturn != QCBOR_SUCCESS) { |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 967 | goto Done; |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 968 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 969 | |
Laurence Lundblade | daefdec | 2020-11-02 20:22:03 -0800 | [diff] [blame] | 970 | #ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS |
Laurence Lundblade | 3e0a45c | 2020-11-05 11:12:04 -0800 | [diff] [blame] | 971 | if(Nesting_IsInNest(&(me->nesting))) { |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 972 | uReturn = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 973 | goto Done; |
| 974 | } |
Laurence Lundblade | e2c893c | 2020-12-26 17:41:53 -0800 | [diff] [blame] | 975 | #endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */ |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 976 | |
Laurence Lundblade | da3f082 | 2018-09-18 19:49:02 -0700 | [diff] [blame] | 977 | *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(me->OutBuf)); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 978 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 979 | Done: |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 980 | return uReturn; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 981 | } |
| 982 | |
Laurence Lundblade | 0595e93 | 2018-11-02 22:22:47 +0700 | [diff] [blame] | 983 | |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 984 | /* |
Laurence Lundblade | 1fa579b | 2020-11-25 00:31:37 -0800 | [diff] [blame] | 985 | * Public functions to get size of the encoded result. See qcbor/qcbor_encode.h |
Laurence Lundblade | 067035b | 2018-11-28 17:35:25 -0800 | [diff] [blame] | 986 | */ |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 987 | QCBORError QCBOREncode_FinishGetSize(QCBOREncodeContext *me, size_t *puEncodedLen) |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 988 | { |
Laurence Lundblade | da3f082 | 2018-09-18 19:49:02 -0700 | [diff] [blame] | 989 | UsefulBufC Enc; |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 990 | |
Laurence Lundblade | 30816f2 | 2018-11-10 13:40:22 +0700 | [diff] [blame] | 991 | QCBORError nReturn = QCBOREncode_Finish(me, &Enc); |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 992 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 993 | if(nReturn == QCBOR_SUCCESS) { |
Laurence Lundblade | da3f082 | 2018-09-18 19:49:02 -0700 | [diff] [blame] | 994 | *puEncodedLen = Enc.len; |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 995 | } |
Laurence Lundblade | 3aee3a3 | 2018-12-17 16:17:45 -0800 | [diff] [blame] | 996 | |
Laurence Lundblade | b69cad7 | 2018-09-13 11:09:01 -0700 | [diff] [blame] | 997 | return nReturn; |
| 998 | } |