blob: cb80a51c267638a7ceb51712593169d536515c66 [file] [log] [blame]
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001/*==============================================================================
Laurence Lundbladed92a6162018-11-01 11:38:35 +07002 Copyright (c) 2016-2018, The Linux Foundation.
Laurence Lundblade240ca822024-01-16 11:11:00 -07003 Copyright (c) 2018-2024, Laurence Lundblade.
Máté Tóth-Pálef5f07a2021-09-17 19:31:37 +02004 Copyright (c) 2021, Arm Limited.
Laurence Lundbladed92a6162018-11-01 11:38:35 +07005 All rights reserved.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08006
Laurence Lundblade0dbc9172018-11-01 14:17:21 +07007Redistribution and use in source and binary forms, with or without
8modification, are permitted provided that the following conditions are
9met:
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 Lundblade3aee3a32018-12-17 16:17:45 -080020
Laurence Lundblade0dbc9172018-11-01 14:17:21 +070021THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
22WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
23MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
24ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
25BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
28BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
29WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
30OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
31IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Laurence Lundbladeee851742020-01-08 08:37:05 -080032 =============================================================================*/
Laurence Lundblade624405d2018-09-18 20:10:47 -070033
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080034
Laurence Lundblade844bb5c2020-03-01 17:27:25 -080035#include "qcbor/qcbor_encode.h"
Laurence Lundblade12d32c52018-09-19 11:25:27 -070036#include "ieee754.h"
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070037
Laurence Lundbladee75f5962024-02-15 17:51:32 -080038#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade6bef4a62024-02-16 14:59:23 -080039#include <math.h> /* Only for NAN definition */
Laurence Lundbladee75f5962024-02-15 17:51:32 -080040#endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
41
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070042
Laurence Lundblade1fa579b2020-11-25 00:31:37 -080043/**
44 * @file qcbor_encode.c
Laurence Lundblade3f1318a2021-01-04 18:26:44 -080045 *
Laurence Lundblade1fa579b2020-11-25 00:31:37 -080046 * The entire implementation of the QCBOR encoder.
47 */
48
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070049
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070050/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -080051 * == 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 Lundbladeb69cad72018-09-13 11:09:01 -070078 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -070079static void
Laurence Lundblade274ddef2022-05-17 09:12:23 -070080Nesting_Init(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070081{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -080082 /* Assumes pNesting has been zeroed. */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070083 pNesting->pCurrentNesting = &pNesting->pArrays[0];
Laurence Lundblade1fa579b2020-11-25 00:31:37 -080084 /* Implied CBOR array at the top nesting level. This is never
85 * returned, but makes the item count work correctly.
86 */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070087 pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY;
88}
89
Laurence Lundblade8e36f812024-01-26 10:59:29 -070090static uint8_t
Laurence Lundblade274ddef2022-05-17 09:12:23 -070091Nesting_Increase(QCBORTrackNesting *pNesting,
Laurence Lundblade8e36f812024-01-26 10:59:29 -070092 const uint8_t uMajorType,
93 const uint32_t uPos)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070094{
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070095 if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) {
Laurence Lundblade29497c02020-07-11 15:44:03 -070096 return QCBOR_ERR_ARRAY_NESTING_TOO_DEEP;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070097 } else {
98 pNesting->pCurrentNesting++;
99 pNesting->pCurrentNesting->uCount = 0;
100 pNesting->pCurrentNesting->uStart = uPos;
101 pNesting->pCurrentNesting->uMajorType = uMajorType;
Laurence Lundblade29497c02020-07-11 15:44:03 -0700102 return QCBOR_SUCCESS;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700103 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700104}
105
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700106static void
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700107Nesting_Decrease(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700108{
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700109 if(pNesting->pCurrentNesting > &pNesting->pArrays[0]) {
110 pNesting->pCurrentNesting--;
111 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700112}
113
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700114static uint8_t
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700115Nesting_Increment(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700116{
Laurence Lundbladedaefdec2020-11-02 20:22:03 -0800117#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800118 if(1 >= QCBOR_MAX_ITEMS_IN_ARRAY - pNesting->pCurrentNesting->uCount) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700119 return QCBOR_ERR_ARRAY_TOO_LONG;
120 }
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700121#endif /* !QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800122
Laurence Lundbladee6bcef12020-04-01 10:56:27 -0700123 pNesting->pCurrentNesting->uCount++;
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800124
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700125 return QCBOR_SUCCESS;
126}
127
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700128static void
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700129Nesting_Decrement(QCBORTrackNesting *pNesting)
Laurence Lundblade8d3b8552021-06-10 11:11:54 -0700130{
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 Lundblade8e36f812024-01-26 10:59:29 -0700137static uint16_t
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700138Nesting_GetCount(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700139{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800140 /* 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 Lundbladec5fef682020-01-25 11:38:45 -0800147 if(pNesting->pCurrentNesting->uMajorType == CBOR_MAJOR_TYPE_MAP) {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800148 /* Cast back to uint16_t after integer promotion from bit shift */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800149 return (uint16_t)(pNesting->pCurrentNesting->uCount >> 1);
150 } else {
151 return pNesting->pCurrentNesting->uCount;
152 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700153}
154
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700155static uint32_t
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700156Nesting_GetStartPos(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700157{
158 return pNesting->pCurrentNesting->uStart;
159}
160
Laurence Lundbladed8e1c512020-11-04 23:03:44 -0800161#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700162static uint8_t
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700163Nesting_GetMajorType(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700164{
165 return pNesting->pCurrentNesting->uMajorType;
166}
167
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700168static bool
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700169Nesting_IsInNest(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700170{
Laurence Lundbladeee851742020-01-08 08:37:05 -0800171 return pNesting->pCurrentNesting == &pNesting->pArrays[0] ? false : true;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700172}
Laurence Lundbladed8e1c512020-11-04 23:03:44 -0800173#endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700174
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700175
176
177
178/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800179 * == Major CBOR Types ==
180 *
181 * Encoding of the major CBOR types is by these functions:
182 *
Laurence Lundblade3f1318a2021-01-04 18:26:44 -0800183 * 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()
190 * 6 QCBOREncode_AddTag()
191 * 7 QCBOREncode_AddDouble(), QCBOREncode_AddFloat(),
192 * QCBOREncode_AddDoubleNoPreferred(),
193 * QCBOREncode_AddFloatNoPreferred(), QCBOREncode_AddType7()
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800194 *
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
230 * QCBOR_MAX_ITEMS_IN_ARRAY is very large (65,535) it is very unlikely
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 Lundbladeb69cad72018-09-13 11:09:01 -0700252 */
253
Laurence Lundbladeff8106f2024-02-05 20:02:30 -0700254
255/* Forward declaration for reference in QCBOREncode_Init() */
256static void
257QCBOREncode_Private_CloseMapUnsorted(QCBOREncodeContext *pMe);
258
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700259
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700260/*
Laurence Lundbladeff8106f2024-02-05 20:02:30 -0700261 * Public function for initialization. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700262 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700263void
264QCBOREncode_Init(QCBOREncodeContext *pMe, UsefulBuf Storage)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700265{
Laurence Lundblade240ca822024-01-16 11:11:00 -0700266 memset(pMe, 0, sizeof(QCBOREncodeContext));
267 UsefulOutBuf_Init(&(pMe->OutBuf), Storage);
268 Nesting_Init(&(pMe->nesting));
Laurence Lundbladeff8106f2024-02-05 20:02:30 -0700269 pMe->pfnCloseMap = QCBOREncode_Private_CloseMapUnsorted;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700270}
271
272
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000273/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800274 * Public function to encode a CBOR head. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700275 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700276UsefulBufC
277QCBOREncode_EncodeHead(UsefulBuf Buffer,
278 uint8_t uMajorType,
279 uint8_t uMinLen,
280 uint64_t uArgument)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700281{
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800282 /*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800283 * == 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 Lundbladec5fef682020-01-25 11:38:45 -0800421 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800422
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800423 /* 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 Lundblade8e36f812024-01-26 10:59:29 -0700427 if(Buffer.len < QCBOR_HEAD_BUFFER_SIZE) {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000428 return NULLUsefulBufC;
429 }
430
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800431 /* Pointer to last valid byte in the buffer */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700432 uint8_t * const pBufferEnd = &((uint8_t *)Buffer.ptr)[QCBOR_HEAD_BUFFER_SIZE-1];
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000433
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800434 /* Point to the last byte and work backwards */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000435 uint8_t *pByte = pBufferEnd;
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800436 /* The 5 bits in the initial byte that are not the major type */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800437 int nAdditionalInfo;
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800438
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700439#ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS
Laurence Lundblade8c858ab2020-11-02 19:53:49 -0800440 if(uMajorType > QCBOR_INDEFINITE_LEN_TYPE_MODIFIER) {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800441 /* Special case for start & end of indefinite length */
Laurence Lundblade8c858ab2020-11-02 19:53:49 -0800442 uMajorType = uMajorType - QCBOR_INDEFINITE_LEN_TYPE_MODIFIER;
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800443 /* 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 Lundblade8c858ab2020-11-02 19:53:49 -0800450 nAdditionalInfo = CBOR_SIMPLE_BREAK;
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800451
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700452 } else
453#endif /* !QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */
454 if (uArgument < CBOR_TWENTY_FOUR && uMinLen == 0) {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800455 /* Simple case where argument is < 24 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000456 nAdditionalInfo = (int)uArgument;
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800457
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800458 } else {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800459 /* 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 Lundbladee9b00322018-12-30 10:33:26 -0800467 */
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800468 static const uint8_t aIterate[] = {1,1,2,4};
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000469
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800470 /* uMinLen passed in is unsigned, but goes negative in the loop
471 * so it must be converted to a signed value.
472 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000473 int nMinLen = (int)uMinLen;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800474 int i;
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000475 for(i = 0; uArgument || nMinLen > 0; i++) {
476 const int nIterations = (int)aIterate[i];
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800477 for(int j = 0; j < nIterations; j++) {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000478 *--pByte = (uint8_t)(uArgument & 0xff);
479 uArgument = uArgument >> 8;
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800480 }
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800481 nMinLen -= nIterations;
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800482 }
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800483
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800484 nAdditionalInfo = LEN_IS_ONE_BYTE-1 + i;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700485 }
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800486
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800487 /* 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 Lundblade11654912024-05-09 11:49:24 -0700490 * conversion to uint8_t will cause an integer wrap around and
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800491 * incorrect CBOR will be generated, but no security issue will
492 * occur.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800493 */
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800494 const int nInitialByte = (uMajorType << 5) + nAdditionalInfo;
495 *--pByte = (uint8_t)nInitialByte;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800496
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000497#ifdef EXTRA_ENCODE_HEAD_CHECK
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800498 /* 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 Lundbladec5fef682020-01-25 11:38:45 -0800501 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000502 if(pBufferEnd - pByte > 9 || pBufferEnd - pByte < 1 || pByte < (uint8_t *)buffer.ptr) {
503 return NULLUsefulBufC;
504 }
Laurence Lundbladee2c893c2020-12-26 17:41:53 -0800505#endif /* EXTRA_ENCODE_HEAD_CHECK */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800506
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800507 /* 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 Lundbladec9f0fbc2020-02-07 10:48:33 +0000511 return (UsefulBufC){pByte, (size_t)(pBufferEnd - pByte)};
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700512}
513
514
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000515/**
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700516 * @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 */
523static void
524QCBOREncode_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));
532#endif /* !QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
533}
534
535
536/**
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800537 * @brief Append the CBOR head, the major type and argument
538 *
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700539 * @param pMe Encoder context.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800540 * @param uMajorType Major type to insert.
541 * @param uArgument The argument (an integer value or a length).
Laurence Lundblade6bef4a62024-02-16 14:59:23 -0800542 * @param uMinLen Minimum number of bytes for encoding the CBOR argument.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800543 *
544 * This formats the CBOR "head" and appends it to the output.
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700545 *
546 * This also increments the array/map item counter in most cases.
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000547 */
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700548void
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700549QCBOREncode_Private_AppendCBORHead(QCBOREncodeContext *pMe,
550 const uint8_t uMajorType,
551 const uint64_t uArgument,
552 const uint8_t uMinLen)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700553{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800554 /* A stack buffer large enough for a CBOR head */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000555 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 Lundblade1fa579b2020-11-25 00:31:37 -0800563 * 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 Lundbladec9f0fbc2020-02-07 10:48:33 +0000567 */
568
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700569 UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), EncodedHead);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700570
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700571 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 Lundblade274ddef2022-05-17 09:12:23 -0700578 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700579}
580
Laurence Lundblade56230d12018-11-01 11:14:51 +0700581
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700582/*
Laurence Lundblade2d493002024-02-01 11:09:17 -0700583 * Public functions for adding negative integers. See qcbor/qcbor_encode.h
584 */
Laurence Lundblade6bef4a62024-02-16 14:59:23 -0800585void
586QCBOREncode_AddNegativeUInt64(QCBOREncodeContext *pMe, const uint64_t uValue)
Laurence Lundblade2d493002024-02-01 11:09:17 -0700587{
Laurence Lundblade8e5f42d2024-02-11 14:25:32 -0800588#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Laurence Lundblade6bef4a62024-02-16 14:59:23 -0800589 if(pMe->uMode >= QCBOR_ENCODE_MODE_DCBOR) {
590 /* Never allowed in dCBOR */
591 pMe->uError = QCBOR_ERR_NOT_PREFERRED;
592 return;
593 }
594
Laurence Lundblade8e5f42d2024-02-11 14:25:32 -0800595 if(!(pMe->uAllow & QCBOR_ENCODE_ALLOW_65_BIG_NEG)) {
596 pMe->uError = QCBOR_ERR_NOT_ALLOWED;
597 return;
598 }
Laurence Lundblade4a7718a2024-06-23 11:06:22 -0700599
Laurence Lundblade8e5f42d2024-02-11 14:25:32 -0800600#endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
601
Laurence Lundblade2d493002024-02-01 11:09:17 -0700602 QCBOREncode_Private_AppendCBORHead(pMe, CBOR_MAJOR_TYPE_NEGATIVE_INT, uValue, 0);
Laurence Lundblade2d493002024-02-01 11:09:17 -0700603}
604
605
606/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800607 * Public functions for adding signed integers. See qcbor/qcbor_encode.h
Laurence Lundblade067035b2018-11-28 17:35:25 -0800608 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700609void
610QCBOREncode_AddInt64(QCBOREncodeContext *pMe, const int64_t nNum)
Laurence Lundblade067035b2018-11-28 17:35:25 -0800611{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800612 uint8_t uMajorType;
613 uint64_t uValue;
Laurence Lundbladedaefdec2020-11-02 20:22:03 -0800614
615 if(nNum < 0) {
Laurence Lundblade9c5c0ef2022-12-23 17:56:27 -0700616 /* In CBOR -1 encodes as 0x00 with major type negative int.
617 * First add one as a signed integer because that will not
Laurence Lundblade2d493002024-02-01 11:09:17 -0700618 * overflow. Then change the sign as needed for encoding (the
Laurence Lundblade9c5c0ef2022-12-23 17:56:27 -0700619 * opposite order, changing the sign and subtracting, can cause
Laurence Lundblade2d493002024-02-01 11:09:17 -0700620 * an overflow when encoding INT64_MIN). */
Laurence Lundblade9c5c0ef2022-12-23 17:56:27 -0700621 int64_t nTmp = nNum + 1;
622 uValue = (uint64_t)-nTmp;
Laurence Lundbladedaefdec2020-11-02 20:22:03 -0800623 uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT;
624 } else {
625 uValue = (uint64_t)nNum;
626 uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT;
627 }
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700628 QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, uValue, 0);
Laurence Lundblade067035b2018-11-28 17:35:25 -0800629}
630
631
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700632/**
633 * @brief Semi-private method to add a buffer full of bytes to encoded output.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800634 *
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700635 * @param[in] pMe The encoding context to add the string to.
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700636 * @param[in] uMajorType The CBOR major type of the bytes.
637 * @param[in] Bytes The bytes to add.
638 *
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700639 * Called by inline functions to add text and byte strings.
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700640 *
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700641 * (This used to support QCBOREncode_AddEncoded() and
642 * QCBOREncode_AddBytesLenOnly(), but that was pulled out to make this
643 * smaller. This is one of the most used methods and they are some of
644 * the least used).
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700645 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700646void
647QCBOREncode_Private_AddBuffer(QCBOREncodeContext *pMe,
648 const uint8_t uMajorType,
649 const UsefulBufC Bytes)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700650{
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700651 QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, Bytes.len, 0);
Laurence Lundblade15b93d42024-02-07 17:39:10 -0800652 UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), Bytes);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700653}
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700654
Laurence Lundbladecafcfe12018-10-31 21:59:50 +0700655
Laurence Lundblade55a24832018-10-30 04:35:08 +0700656/*
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700657 * Public functions for adding raw encoded CBOR. See qcbor/qcbor_encode.h
Laurence Lundblade55a24832018-10-30 04:35:08 +0700658 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700659void
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700660QCBOREncode_AddEncoded(QCBOREncodeContext *pMe, const UsefulBufC Encoded)
Laurence Lundblade55a24832018-10-30 04:35:08 +0700661{
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700662 UsefulOutBuf_AppendUsefulBuf(&(pMe->OutBuf), Encoded);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700663 QCBOREncode_Private_IncrementMapOrArrayCount(pMe);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700664}
665
666
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700667#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade8d9e0cd2024-05-25 18:12:19 -0700668/**
669 * @brief Semi-private method to add a double using preferred encoding.
670 *
671 * @param[in] pMe The encode context.
672 * @param[in] dNum The double to add.
673 *
674 * This converts the double to a float or half-precision if it can be done
675 * without a loss of precision. See QCBOREncode_AddDouble().
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700676 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700677void
Laurence Lundblade70fc1252024-05-31 10:57:28 -0700678QCBOREncode_Private_AddPreferredDouble(QCBOREncodeContext *pMe, double dNum)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700679{
Laurence Lundblade240ca822024-01-16 11:11:00 -0700680 IEEE754_union FloatResult;
681 bool bNoNaNPayload;
682 struct IEEE754_ToInt IntResult;
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700683
Laurence Lundblade8e5f42d2024-02-11 14:25:32 -0800684#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
685 if(IEEE754_IsNotStandardDoubleNaN(dNum) && !(pMe->uAllow & QCBOR_ENCODE_ALLOW_NAN_PAYLOAD)) {
686 pMe->uError = QCBOR_ERR_NOT_ALLOWED;
687 return;
688 }
689#endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
690
Laurence Lundbladed98ffbf2024-01-27 23:27:59 -0700691 if(pMe->uMode == QCBOR_ENCODE_MODE_DCBOR) {
Laurence Lundblade240ca822024-01-16 11:11:00 -0700692 IntResult = IEEE754_DoubleToInt(dNum);
693 switch(IntResult.type) {
694 case IEEE754_ToInt_IS_INT:
Laurence Lundbladed98ffbf2024-01-27 23:27:59 -0700695 QCBOREncode_AddInt64(pMe, IntResult.integer.is_signed);
Laurence Lundblade240ca822024-01-16 11:11:00 -0700696 return;
697 case IEEE754_ToInt_IS_UINT:
Laurence Lundbladed98ffbf2024-01-27 23:27:59 -0700698 QCBOREncode_AddUInt64(pMe, IntResult.integer.un_signed);
Laurence Lundblade240ca822024-01-16 11:11:00 -0700699 return;
Laurence Lundblade6bef4a62024-02-16 14:59:23 -0800700 case IEEE754_ToInt_NaN:
Laurence Lundbladee026f4f2024-01-18 13:48:34 -0700701 dNum = NAN;
702 bNoNaNPayload = true;
703 break;
Laurence Lundblade240ca822024-01-16 11:11:00 -0700704 case IEEE754_ToInt_NO_CONVERSION:
705 bNoNaNPayload = true;
706 }
707 } else {
708 bNoNaNPayload = false;
709 }
710
711 FloatResult = IEEE754_DoubleToSmaller(dNum, true, bNoNaNPayload);
712
Laurence Lundbladed98ffbf2024-01-27 23:27:59 -0700713 QCBOREncode_Private_AddType7(pMe, (uint8_t)FloatResult.uSize, FloatResult.uValue);
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700714}
Laurence Lundblade9682a532020-06-06 18:33:04 -0700715
Laurence Lundblade4a7718a2024-06-23 11:06:22 -0700716#endif /* ! QCBOR_DISABLE_PREFERRED_FLOAT */
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700717
Laurence Lundblade8d9e0cd2024-05-25 18:12:19 -0700718/**
719 * @brief Semi-private method to add a float using preferred encoding.
720 *
721 * @param[in] pMe The encode context.
722 * @param[in] fNum The float to add.
723 *
724 * This converts the float to a half-precision if it can be done
725 * without a loss of precision. See QCBOREncode_AddFloat().
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800726 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700727void
Laurence Lundblade70fc1252024-05-31 10:57:28 -0700728QCBOREncode_Private_AddPreferredFloat(QCBOREncodeContext *pMe, float fNum)
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700729{
Laurence Lundblade240ca822024-01-16 11:11:00 -0700730 IEEE754_union FloatResult;
731 bool bNoNaNPayload;
732 struct IEEE754_ToInt IntResult;
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700733
Laurence Lundblade8e5f42d2024-02-11 14:25:32 -0800734#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
735 if(IEEE754_IsNotStandardSingleNaN(fNum) && !(pMe->uAllow & QCBOR_ENCODE_ALLOW_NAN_PAYLOAD)) {
736 pMe->uError = QCBOR_ERR_NOT_ALLOWED;
737 return;
738 }
739#endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
740
741
Laurence Lundblade240ca822024-01-16 11:11:00 -0700742 if(pMe->uMode == QCBOR_ENCODE_MODE_DCBOR) {
743 IntResult = IEEE754_SingleToInt(fNum);
744 switch(IntResult.type) {
745 case IEEE754_ToInt_IS_INT:
746 QCBOREncode_AddInt64(pMe, IntResult.integer.is_signed);
747 return;
Laurence Lundbladee026f4f2024-01-18 13:48:34 -0700748 case IEEE754_ToInt_IS_UINT:
Laurence Lundblade240ca822024-01-16 11:11:00 -0700749 QCBOREncode_AddUInt64(pMe, IntResult.integer.un_signed);
750 return;
Laurence Lundblade6bef4a62024-02-16 14:59:23 -0800751 case IEEE754_ToInt_NaN:
Laurence Lundbladee026f4f2024-01-18 13:48:34 -0700752 fNum = NAN;
753 bNoNaNPayload = true;
754 break;
Laurence Lundblade240ca822024-01-16 11:11:00 -0700755 case IEEE754_ToInt_NO_CONVERSION:
756 bNoNaNPayload = true;
757 }
758 } else {
759 bNoNaNPayload = false;
760 }
761
762 FloatResult = IEEE754_SingleToHalf(fNum, bNoNaNPayload);
763
Laurence Lundblade4a7718a2024-06-23 11:06:22 -0700764 /* AppendCBORHead() does endian swapping for the float / double */
Laurence Lundbladed98ffbf2024-01-27 23:27:59 -0700765 QCBOREncode_Private_AddType7(pMe, (uint8_t)FloatResult.uSize, FloatResult.uValue);
Laurence Lundblade067035b2018-11-28 17:35:25 -0800766}
767
Laurence Lundblade067035b2018-11-28 17:35:25 -0800768
769
Laurence Lundbladedd6e76e2021-03-10 01:54:01 -0700770#ifndef QCBOR_DISABLE_EXP_AND_MANTISSA
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700771/**
772 * @brief Semi-private method to add bigfloats and decimal fractions.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800773 *
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700774 * @param[in] pMe The encoding context to add the value to.
775 * @param[in] uTag The type 6 tag indicating what this is to be.
776 * @param[in] BigNumMantissa Is @ref NULLUsefulBufC if mantissa is an
777 * @c int64_t or the actual big number mantissa
778 * if not.
779 * @param[in] bBigNumIsNegative This is @c true if the big number is negative.
780 * @param[in] nMantissa The @c int64_t mantissa if it is not a big number.
781 * @param[in] nExponent The exponent.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800782 *
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700783 * This outputs either the @ref CBOR_TAG_DECIMAL_FRACTION or
784 * @ref CBOR_TAG_BIGFLOAT tag. if @c uTag is @ref CBOR_TAG_INVALID64,
785 * then this outputs the "borrowed" content format.
786 *
787 * The tag content output by this is an array with two members, the
788 * exponent and then the mantissa. The mantissa can be either a big
789 * number or an @c int64_t.
790 *
791 * This implementation cannot output an exponent further from 0 than
792 * @c INT64_MAX.
793 *
794 * To output a mantissa that is between INT64_MAX and UINT64_MAX from 0,
795 * it must be as a big number.
796 *
797 * Typically, QCBOREncode_AddDecimalFraction(), QCBOREncode_AddBigFloat(),
798 * QCBOREncode_AddDecimalFractionBigNum() or QCBOREncode_AddBigFloatBigNum()
799 * is called instead of this.
Laurence Lundblade59289e52019-12-30 13:44:37 -0800800 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700801void
802QCBOREncode_Private_AddExpMantissa(QCBOREncodeContext *pMe,
803 const uint64_t uTag,
804 const UsefulBufC BigNumMantissa,
805 const bool bBigNumIsNegative,
806 const int64_t nMantissa,
807 const int64_t nExponent)
Laurence Lundblade59289e52019-12-30 13:44:37 -0800808{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800809 /* This is for encoding either a big float or a decimal fraction,
810 * both of which are an array of two items, an exponent and a
811 * mantissa. The difference between the two is that the exponent
812 * is base-2 for big floats and base-10 for decimal fractions, but
813 * that has no effect on the code here.
Laurence Lundbladeee851742020-01-08 08:37:05 -0800814 */
Laurence Lundbladeae66d3f2020-09-14 18:12:08 -0700815 if(uTag != CBOR_TAG_INVALID64) {
816 QCBOREncode_AddTag(pMe, uTag);
817 }
Laurence Lundblade59289e52019-12-30 13:44:37 -0800818 QCBOREncode_OpenArray(pMe);
819 QCBOREncode_AddInt64(pMe, nExponent);
820 if(!UsefulBuf_IsNULLC(BigNumMantissa)) {
821 if(bBigNumIsNegative) {
822 QCBOREncode_AddNegativeBignum(pMe, BigNumMantissa);
823 } else {
824 QCBOREncode_AddPositiveBignum(pMe, BigNumMantissa);
825 }
826 } else {
827 QCBOREncode_AddInt64(pMe, nMantissa);
828 }
829 QCBOREncode_CloseArray(pMe);
830}
Laurence Lundbladedd6e76e2021-03-10 01:54:01 -0700831#endif /* QCBOR_DISABLE_EXP_AND_MANTISSA */
Laurence Lundblade59289e52019-12-30 13:44:37 -0800832
833
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700834/**
835 * @brief Semi-private method to open a map, array or bstr-wrapped CBOR
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800836 *
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700837 * @param[in] pMe The context to add to.
838 * @param[in] uMajorType The major CBOR type to close
839 *
840 * Call QCBOREncode_OpenArray(), QCBOREncode_OpenMap() or
841 * QCBOREncode_BstrWrap() instead of this.
Laurence Lundblade274ddef2022-05-17 09:12:23 -0700842 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700843void
844QCBOREncode_Private_OpenMapOrArray(QCBOREncodeContext *pMe,
845 const uint8_t uMajorType)
Laurence Lundblade067035b2018-11-28 17:35:25 -0800846{
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800847 /* Add one item to the nesting level we are in for the new map or array */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700848 QCBOREncode_Private_IncrementMapOrArrayCount(pMe);
Laurence Lundbladed39cd392019-01-11 18:17:38 -0800849
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800850 /* The offset where the length of an array or map will get written
851 * is stored in a uint32_t, not a size_t to keep stack usage
852 * smaller. This checks to be sure there is no wrap around when
853 * recording the offset. Note that on 64-bit machines CBOR larger
854 * than 4GB can be encoded as long as no array/map offsets occur
855 * past the 4GB mark, but the public interface says that the
856 * maximum is 4GB to keep the discussion simpler.
857 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700858 size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf));
Laurence Lundbladed39cd392019-01-11 18:17:38 -0800859
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800860 /* QCBOR_MAX_ARRAY_OFFSET is slightly less than UINT32_MAX so this
861 * code can run on a 32-bit machine and tests can pass on a 32-bit
862 * machine. If it was exactly UINT32_MAX, then this code would not
863 * compile or run on a 32-bit machine and an #ifdef or some machine
864 * size detection would be needed reducing portability.
865 */
Laurence Lundblade3e0a45c2020-11-05 11:12:04 -0800866 if(uEndPosition >= QCBOR_MAX_ARRAY_OFFSET) {
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700867 pMe->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
Laurence Lundblade3e0a45c2020-11-05 11:12:04 -0800868
869 } else {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800870 /* Increase nesting level because this is a map or array. Cast
871 * from size_t to uin32_t is safe because of check above.
872 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700873 pMe->uError = Nesting_Increase(&(pMe->nesting), uMajorType, (uint32_t)uEndPosition);
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800874 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700875}
876
Laurence Lundblade59289e52019-12-30 13:44:37 -0800877
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700878#ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700879/**
880 * @brief Semi-private method to open a map, array with indefinite length
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800881 *
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700882 * @param[in] pMe The context to add to.
883 * @param[in] uMajorType The major CBOR type to close
884 *
885 * Call QCBOREncode_OpenArrayIndefiniteLength() or
886 * QCBOREncode_OpenMapIndefiniteLength() instead of this.
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800887 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700888void
889QCBOREncode_Private_OpenMapOrArrayIndefiniteLength(QCBOREncodeContext *pMe,
890 const uint8_t uMajorType)
Jan Jongboom4a93a662019-07-25 08:44:58 +0200891{
Laurence Lundblade240ca822024-01-16 11:11:00 -0700892#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
893 if(pMe->uMode >= QCBOR_ENCODE_MODE_PREFERRED) {
894 pMe->uError = QCBOR_ERR_NOT_PREFERRED;
895 return;
896 }
897#endif /* ! QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800898 /* Insert the indefinite length marker (0x9f for arrays, 0xbf for maps) */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700899 QCBOREncode_Private_AppendCBORHead(pMe, uMajorType, 0, 0);
Laurence Lundblade1fa579b2020-11-25 00:31:37 -0800900
901 /* Call the definite-length opener just to do the bookkeeping for
902 * nesting. It will record the position of the opening item in the
903 * encoded output but this is not used when closing this open.
904 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -0700905 QCBOREncode_Private_OpenMapOrArray(pMe, uMajorType);
Jan Jongboom4a93a662019-07-25 08:44:58 +0200906}
Laurence Lundbladecbd7d132024-05-19 11:11:22 -0700907#endif
908
909
910/**
911 * @brief Check for errors when decreasing nesting.
912 *
913 * @param pMe QCBOR encoding context.
914 * @param uMajorType The major type of the nesting.
915 *
916 * Check that there is no previous error, that there is actually some
917 * nesting and that the major type of the opening of the nesting
918 * matches the major type of the nesting being closed.
919 *
920 * This is called when closing maps, arrays, byte string wrapping and
921 * open/close of byte strings.
922 */
923static bool
924QCBOREncode_Private_CheckDecreaseNesting(QCBOREncodeContext *pMe,
925 const uint8_t uMajorType)
926{
927#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
928 if(pMe->uError != QCBOR_SUCCESS) {
929 return true;
930 }
931
932 if(!Nesting_IsInNest(&(pMe->nesting))) {
933 pMe->uError = QCBOR_ERR_TOO_MANY_CLOSES;
934 return true;
935 }
936
937 if(Nesting_GetMajorType(&(pMe->nesting)) != uMajorType) {
938 pMe->uError = QCBOR_ERR_CLOSE_MISMATCH;
939 return true;
940 }
941
942#else /* !QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
943 /* None of these checks are performed if the encode guards are
944 * turned off as they all relate to correct calling.
945 *
946 * Turning off all these checks does not turn off any checking for
947 * buffer overflows or pointer issues.
948 */
949
950 (void)uMajorType;
951 (void)pMe;
952#endif /* !QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
953
954 return false;
955}
956
957
958/**
959 * @brief Insert the CBOR head for a map, array or wrapped bstr
960 *
961 * @param pMe QCBOR encoding context.
962 * @param uMajorType One of CBOR_MAJOR_TYPE_XXXX.
963 * @param uLen The length of the data item.
964 *
965 * When an array, map or bstr was opened, nothing was done but note
966 * the position. This function goes back to that position and inserts
967 * the CBOR Head with the major type and length.
968 */
969static void
970QCBOREncode_Private_CloseAggregate(QCBOREncodeContext *pMe,
971 uint8_t uMajorType,
972 size_t uLen)
973{
974 if(QCBOREncode_Private_CheckDecreaseNesting(pMe, uMajorType)) {
975 return;
976 }
977
978 if(uMajorType == CBOR_MAJOR_NONE_TYPE_OPEN_BSTR) {
979 uMajorType = CBOR_MAJOR_TYPE_BYTE_STRING;
980 }
981
982 /* A stack buffer large enough for a CBOR head (9 bytes) */
983 UsefulBuf_MAKE_STACK_UB(pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE);
984
985 UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead,
986 uMajorType,
987 0,
988 uLen);
989
990 /* No check for EncodedHead == NULLUsefulBufC is performed here to
991 * save object code. It is very clear that pBufferForEncodedHead is
992 * the correct size. If EncodedHead == NULLUsefulBufC then
993 * UsefulOutBuf_InsertUsefulBuf() will do nothing so there is no
994 * security hole introduced.
995 */
996 UsefulOutBuf_InsertUsefulBuf(&(pMe->OutBuf),
997 EncodedHead,
998 Nesting_GetStartPos(&(pMe->nesting)));
999
1000 Nesting_Decrease(&(pMe->nesting));
1001}
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001002
Laurence Lundbladeee851742020-01-08 08:37:05 -08001003
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001004/**
Laurence Lundbladeff8106f2024-02-05 20:02:30 -07001005 * @brief Semi-private method to close a map, array or bstr wrapped CBOR.
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001006 *
1007 * @param[in] pMe The context to add to.
1008 * @param[in] uMajorType The major CBOR type to close.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001009 */
Laurence Lundblade240ca822024-01-16 11:11:00 -07001010void
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001011QCBOREncode_Private_CloseMapOrArray(QCBOREncodeContext *pMe,
1012 const uint8_t uMajorType)
Laurence Lundblade240ca822024-01-16 11:11:00 -07001013{
Laurence Lundbladecbd7d132024-05-19 11:11:22 -07001014 QCBOREncode_Private_CloseAggregate(pMe, uMajorType, Nesting_GetCount(&(pMe->nesting)));
Laurence Lundblade240ca822024-01-16 11:11:00 -07001015}
1016
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001017
Laurence Lundbladeff8106f2024-02-05 20:02:30 -07001018/**
1019 * @brief Private method to close a map without sorting.
1020 *
1021 * @param[in] pMe The encode context with map to close.
1022 *
Laurence Lundblade6bef4a62024-02-16 14:59:23 -08001023 * See QCBOREncode_SerializationCDE() implemention for explantion for why
1024 * this exists in this form.
Laurence Lundbladeff8106f2024-02-05 20:02:30 -07001025 */
1026static void
1027QCBOREncode_Private_CloseMapUnsorted(QCBOREncodeContext *pMe)
Laurence Lundblade240ca822024-01-16 11:11:00 -07001028{
Laurence Lundbladeff8106f2024-02-05 20:02:30 -07001029 QCBOREncode_Private_CloseMapOrArray(pMe, CBOR_MAJOR_TYPE_MAP);
Laurence Lundblade240ca822024-01-16 11:11:00 -07001030}
1031
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001032
1033/**
1034 * @brief Decode a CBOR item head.
1035 *
1036 * @param[in] pUInBuf UsefulInputBuf to read from.
1037 * @param[out] pnMajorType Major type of decoded head.
1038 * @param[out] puArgument Argument of decoded head.
1039 * @param[out] pnAdditionalInfo Additional info from decoded head.
1040 *
1041 * @return SUCCESS if a head was decoded
1042 * HIT_END if there were not enough bytes to decode a head
1043 * UNSUPPORTED if the decoded item is not one that is supported
1044 *
1045 * This is copied from qcbor_decode.c rather than referenced. This
1046 * makes the core decoder 60 bytes smaller because it gets inlined.
1047 * It would not get inlined if it was referenced. It is important to
1048 * make the core decoder as small as possible. The copy here does make
1049 * map sorting 200 bytes bigger, but map sorting is rarely used in
1050 * environments that need small object code. It would also make
1051 * qcbor_encode.c depend on qcbor_decode.c
1052 *
1053 * This is also super stable and tested. It implements the very
1054 * well-defined part of CBOR that will never change. So this won't
1055 * change.
1056 */
1057static QCBORError
1058QCBOREncodePriv_DecodeHead(UsefulInputBuf *pUInBuf,
1059 int *pnMajorType,
1060 uint64_t *puArgument,
1061 int *pnAdditionalInfo)
1062{
1063 QCBORError uReturn;
1064
1065 /* Get the initial byte that every CBOR data item has and break it
1066 * down. */
1067 const int nInitialByte = (int)UsefulInputBuf_GetByte(pUInBuf);
1068 const int nTmpMajorType = nInitialByte >> 5;
1069 const int nAdditionalInfo = nInitialByte & 0x1f;
1070
1071 /* Where the argument accumulates */
1072 uint64_t uArgument;
1073
1074 if(nAdditionalInfo >= LEN_IS_ONE_BYTE && nAdditionalInfo <= LEN_IS_EIGHT_BYTES) {
1075 /* Need to get 1,2,4 or 8 additional argument bytes. Map
1076 * LEN_IS_ONE_BYTE..LEN_IS_EIGHT_BYTES to actual length.
1077 */
1078 static const uint8_t aIterate[] = {1,2,4,8};
1079
1080 /* Loop getting all the bytes in the argument */
1081 uArgument = 0;
1082 for(int i = aIterate[nAdditionalInfo - LEN_IS_ONE_BYTE]; i; i--) {
1083 /* This shift and add gives the endian conversion. */
1084 uArgument = (uArgument << 8) + UsefulInputBuf_GetByte(pUInBuf);
1085 }
1086 } else if(nAdditionalInfo >= ADDINFO_RESERVED1 && nAdditionalInfo <= ADDINFO_RESERVED3) {
1087 /* The reserved and thus-far unused additional info values */
1088 uReturn = QCBOR_ERR_UNSUPPORTED;
1089 goto Done;
1090 } else {
1091 /* Less than 24, additional info is argument or 31, an
1092 * indefinite-length. No more bytes to get.
1093 */
1094 uArgument = (uint64_t)nAdditionalInfo;
1095 }
1096
1097 if(UsefulInputBuf_GetError(pUInBuf)) {
1098 uReturn = QCBOR_ERR_HIT_END;
1099 goto Done;
1100 }
1101
1102 /* All successful if arrived here. */
1103 uReturn = QCBOR_SUCCESS;
1104 *pnMajorType = nTmpMajorType;
1105 *puArgument = uArgument;
1106 *pnAdditionalInfo = nAdditionalInfo;
1107
1108Done:
1109 return uReturn;
1110}
1111
1112
1113/**
1114 * @brief Consume the next item from a UsefulInputBuf.
1115 *
1116 * @param[in] pInBuf UsefulInputBuf from which to consume item.
1117 *
1118 * Recursive, but stack usage is light and encoding depth limit
1119 */
1120static QCBORError
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001121QCBOR_Private_ConsumeNext(UsefulInputBuf *pInBuf)
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001122{
1123 int nMajor;
1124 uint64_t uArgument;
1125 int nAdditional;
1126 uint16_t uItemCount;
1127 uint16_t uMul;
1128 uint16_t i;
1129 QCBORError uCBORError;
1130
1131 uCBORError = QCBOREncodePriv_DecodeHead(pInBuf, &nMajor, &uArgument, &nAdditional);
1132 if(uCBORError != QCBOR_SUCCESS) {
1133 return uCBORError;
1134 }
1135
1136 uMul = 1;
1137
1138 switch(nMajor) {
1139 case CBOR_MAJOR_TYPE_POSITIVE_INT: /* Major type 0 */
1140 case CBOR_MAJOR_TYPE_NEGATIVE_INT: /* Major type 1 */
1141 break;
1142
1143 case CBOR_MAJOR_TYPE_SIMPLE:
1144 return uArgument == CBOR_SIMPLE_BREAK ? 1 : 0;
1145 break;
1146
1147 case CBOR_MAJOR_TYPE_BYTE_STRING:
1148 case CBOR_MAJOR_TYPE_TEXT_STRING:
1149 if(nAdditional == LEN_IS_INDEFINITE) {
1150 /* Segments of indefinite length */
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001151 while(QCBOR_Private_ConsumeNext(pInBuf) == 0);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001152 }
1153 (void)UsefulInputBuf_GetBytes(pInBuf, uArgument);
1154 break;
1155
1156 case CBOR_MAJOR_TYPE_TAG:
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001157 QCBOR_Private_ConsumeNext(pInBuf);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001158 break;
1159
1160 case CBOR_MAJOR_TYPE_MAP:
1161 uMul = 2;
1162 /* Fallthrough */
1163 case CBOR_MAJOR_TYPE_ARRAY:
1164 uItemCount = (uint16_t)uArgument * uMul;
1165 if(nAdditional == LEN_IS_INDEFINITE) {
1166 uItemCount = UINT16_MAX;
1167 }
1168 for(i = uItemCount; i > 0; i--) {
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001169 if(QCBOR_Private_ConsumeNext(pInBuf)) {
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001170 /* End of indefinite length */
1171 break;
1172 }
1173 }
1174 break;
1175 }
1176
1177 return QCBOR_SUCCESS;
1178}
1179
1180
1181/**
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001182 * @brief Decoded next item to get its lengths.
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001183 *
1184 * Decode the next item in map no matter what type it is. It works
1185 * recursively when an item is a map or array It returns offset just
1186 * past the item decoded or zero there are no more items in the output
1187 * buffer.
1188 *
1189 * This doesn't distinguish between end of the input and an error
1190 * because it is used to decode stuff we encoded into a buffer, not
1191 * stuff that came in from outside. We still want a check for safety
1192 * in case of bugs here, but it is OK to report end of input on error.
1193 */
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001194struct ItemLens {
1195 uint32_t uLabelLen;
1196 uint32_t uItemLen;
1197};
1198
1199static struct ItemLens
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001200QCBOREncode_Private_DecodeNextInMap(QCBOREncodeContext *pMe, uint32_t uStart)
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001201{
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001202 UsefulInputBuf InBuf;
1203 UsefulBufC EncodedMapBytes;
1204 QCBORError uCBORError;
1205 struct ItemLens Result;
1206
1207 Result.uLabelLen = 0;
1208 Result.uItemLen = 0;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001209
1210 EncodedMapBytes = UsefulOutBuf_OutUBufOffset(&(pMe->OutBuf), uStart);
1211 if(UsefulBuf_IsNULLC(EncodedMapBytes)) {
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001212 return Result;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001213 }
1214
1215 UsefulInputBuf_Init(&InBuf, EncodedMapBytes);
1216
1217 /* This is always used on maps, so consume two, the label and the value */
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001218 uCBORError = QCBOR_Private_ConsumeNext(&InBuf);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001219 if(uCBORError) {
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001220 return Result;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001221 }
1222
1223 /* Cast is safe because this is QCBOR which limits sizes to UINT32_MAX */
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001224 Result.uLabelLen = (uint32_t)UsefulInputBuf_Tell(&InBuf);
1225
1226 uCBORError = QCBOR_Private_ConsumeNext(&InBuf);
1227 if(uCBORError) {
1228 Result.uLabelLen = 0;
1229 return Result;
1230 }
1231
1232 Result.uItemLen = (uint32_t)UsefulInputBuf_Tell(&InBuf);
1233
1234 /* Cast is safe because this is QCBOR which limits sizes to UINT32_MAX */
1235 return Result;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001236}
1237
1238
1239/**
1240 * @brief Sort items lexographically by encoded labels.
1241 *
1242 * @param[in] pMe Encoding context.
1243 * @param[in] uStart Offset in outbuf of first item for sorting.
1244 *
1245 * This reaches into the UsefulOutBuf in the encoding context and
1246 * sorts encoded CBOR items. The byte offset start of the items is at
1247 * @c uStart and it goes to the end of valid bytes in the
1248 * UsefulOutBuf.
1249 */
1250static void
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001251QCBOREncode_Private_SortMap(QCBOREncodeContext *pMe, uint32_t uStart)
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001252{
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001253 bool bSwapped;
1254 int nComparison;
1255 uint32_t uStart1;
1256 uint32_t uStart2;
1257 struct ItemLens Lens1;
1258 struct ItemLens Lens2;
1259
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001260
1261 if(pMe->uError != QCBOR_SUCCESS) {
1262 return;
1263 }
1264
1265 /* Bubble sort because the sizes of all the items are not the
1266 * same. It works with adjacent pairs so the swap is not too
1267 * difficult even though sizes are different.
1268 *
1269 * While bubble sort is n-squared, it seems OK here because n will
1270 * usually be small and the comparison and swap functions aren't
1271 * too CPU intensive.
1272 *
1273 * Another approach would be to have an array of offsets to the
1274 * items. However this requires memory allocation and the swap
1275 * operation for quick sort or such is complicated because the item
1276 * sizes are not the same and overlap may occur in the bytes being
1277 * swapped.
1278 */
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001279 do { /* Loop until nothing was swapped */
1280 Lens1 = QCBOREncode_Private_DecodeNextInMap(pMe, uStart);
1281 if(Lens1.uLabelLen == 0) {
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001282 /* It's an empty map. Nothing to do. */
1283 break;
1284 }
1285 uStart1 = uStart;
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001286 uStart2 = uStart1 + Lens1.uItemLen;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001287 bSwapped = false;
1288
1289 while(1) {
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001290 Lens2 = QCBOREncode_Private_DecodeNextInMap(pMe, uStart2);
1291 if(Lens2.uLabelLen == 0) {
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001292 break;
1293 }
1294
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001295 nComparison = UsefulOutBuf_Compare(&(pMe->OutBuf),
1296 uStart1, Lens1.uLabelLen,
1297 uStart2, Lens2.uLabelLen);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001298 if(nComparison < 0) {
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001299 UsefulOutBuf_Swap(&(pMe->OutBuf), uStart1, uStart2, uStart2 + Lens2.uItemLen);
1300 uStart1 = uStart1 + Lens2.uItemLen; /* item 2 now in position of item 1 */
1301 /* Lens1 is still valid as Lens1 for the next loop */
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001302 bSwapped = true;
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001303 } else if(nComparison > 0) {
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001304 uStart1 = uStart2;
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001305 Lens1 = Lens2;
1306 } else /* nComparison == 0 */ {
1307 pMe->uError = QCBOR_ERR_DUPLICATE_LABEL;
1308 return;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001309 }
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001310 uStart2 = uStart2 + Lens2.uItemLen;
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001311 }
1312 } while(bSwapped);
1313}
1314
1315
1316/*
1317 * Public functions for closing sorted maps. See qcbor/qcbor_encode.h
1318 */
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001319void
1320QCBOREncode_CloseAndSortMap(QCBOREncodeContext *pMe)
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001321{
1322 uint32_t uStart;
1323
1324 /* The Header for the map we are about to sort hasn't been
1325 * inserted yet, so uStart is the position of the first item
1326 * and the end out the UsefulOutBuf data is the end of the
1327 * items we are about to sort.
1328 */
1329 uStart = Nesting_GetStartPos(&(pMe->nesting));
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001330 QCBOREncode_Private_SortMap(pMe, uStart);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001331
Laurence Lundblade70fc1252024-05-31 10:57:28 -07001332 QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_TYPE_MAP, Nesting_GetCount(&(pMe->nesting)));
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001333}
1334
1335
Laurence Lundbladed3f07842024-06-19 13:05:07 -07001336#ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001337/*
1338 * Public functions for closing sorted maps. See qcbor/qcbor_encode.h
1339 */
Laurence Lundbladedee0d4e2024-03-03 13:46:33 -07001340void
1341QCBOREncode_CloseAndSortMapIndef(QCBOREncodeContext *pMe)
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001342{
1343 uint32_t uStart;
1344
1345 uStart = Nesting_GetStartPos(&(pMe->nesting));
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001346 QCBOREncode_Private_SortMap(pMe, uStart);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001347
Laurence Lundblade3b703b82024-01-27 20:17:20 -07001348 QCBOREncode_Private_CloseMapOrArrayIndefiniteLength(pMe, CBOR_MAJOR_NONE_TYPE_MAP_INDEFINITE_LEN);
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001349}
Laurence Lundbladed3f07842024-06-19 13:05:07 -07001350#endif /* ! QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS */
Laurence Lundbladed6e13022023-11-26 10:14:02 -07001351
1352
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001353/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001354 * Public functions for closing bstr wrapping. See qcbor/qcbor_encode.h
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001355 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001356void
1357QCBOREncode_CloseBstrWrap2(QCBOREncodeContext *pMe,
1358 const bool bIncludeCBORHead,
1359 UsefulBufC *pWrappedCBOR)
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001360{
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001361 const size_t uInsertPosition = Nesting_GetStartPos(&(pMe->nesting));
1362 const size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001363
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001364 /* This subtraction can't go negative because the UsefulOutBuf
1365 * always only grows and never shrinks. UsefulOutBut itself also
1366 * has defenses such that it won't write where it should not even
1367 * if given incorrect input lengths.
1368 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001369 const size_t uBstrLen = uEndPosition - uInsertPosition;
1370
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001371 /* Actually insert */
Laurence Lundbladecbd7d132024-05-19 11:11:22 -07001372 QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_TYPE_BYTE_STRING, uBstrLen);
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001373
1374 if(pWrappedCBOR) {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001375 /* Return pointer and length to the enclosed encoded CBOR. The
1376 * intended use is for it to be hashed (e.g., SHA-256) in a COSE
1377 * implementation. This must be used right away, as the pointer
1378 * and length go invalid on any subsequent calls to this
1379 * function because there might be calls to
1380 * InsertEncodedTypeAndNumber() that slides data to the right.
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001381 */
1382 size_t uStartOfNew = uInsertPosition;
1383 if(!bIncludeCBORHead) {
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001384 /* Skip over the CBOR head to just get the inserted bstr */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001385 const size_t uNewEndPosition = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf));
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001386 uStartOfNew += uNewEndPosition - uEndPosition;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001387 }
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001388 const UsefulBufC PartialResult = UsefulOutBuf_OutUBuf(&(pMe->OutBuf));
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +00001389 *pWrappedCBOR = UsefulBuf_Tail(PartialResult, uStartOfNew);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001390 }
1391}
1392
Laurence Lundbladeee851742020-01-08 08:37:05 -08001393
Jan Jongboom4a93a662019-07-25 08:44:58 +02001394/*
Laurence Lundblade8d3b8552021-06-10 11:11:54 -07001395 * Public function for canceling a bstr wrap. See qcbor/qcbor_encode.h
1396 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001397void
1398QCBOREncode_CancelBstrWrap(QCBOREncodeContext *pMe)
Laurence Lundblade8d3b8552021-06-10 11:11:54 -07001399{
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001400 if(QCBOREncode_Private_CheckDecreaseNesting(pMe, CBOR_MAJOR_TYPE_BYTE_STRING)) {
Laurence Lundblade274ddef2022-05-17 09:12:23 -07001401 return;
1402 }
1403
Laurence Lundblade8d3b8552021-06-10 11:11:54 -07001404#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Laurence Lundblade274ddef2022-05-17 09:12:23 -07001405 const size_t uCurrent = UsefulOutBuf_GetEndPosition(&(pMe->OutBuf));
1406 if(pMe->nesting.pCurrentNesting->uStart != uCurrent) {
1407 pMe->uError = QCBOR_ERR_CANNOT_CANCEL;
1408 return;
Laurence Lundblade8d3b8552021-06-10 11:11:54 -07001409 }
1410 /* QCBOREncode_CancelBstrWrap() can't correctly undo
1411 * QCBOREncode_BstrWrapInMap() or QCBOREncode_BstrWrapInMapN(). It
1412 * can't undo the labels they add. It also doesn't catch the error
1413 * of using it this way. QCBOREncode_CancelBstrWrap() is used
1414 * infrequently and the the result is incorrect CBOR, not a
1415 * security hole, so no extra code or state is added to handle this
1416 * condition.
1417 */
1418#endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
1419
1420 Nesting_Decrease(&(pMe->nesting));
1421 Nesting_Decrement(&(pMe->nesting));
1422}
1423
1424
1425/*
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001426 * Public function for opening a byte string. See qcbor/qcbor_encode.h
1427 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001428void
1429QCBOREncode_OpenBytes(QCBOREncodeContext *pMe, UsefulBuf *pPlace)
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001430{
1431 *pPlace = UsefulOutBuf_GetOutPlace(&(pMe->OutBuf));
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001432#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Paul Liétar79789772022-07-26 20:33:18 +01001433 uint8_t uMajorType = Nesting_GetMajorType(&(pMe->nesting));
1434 if(uMajorType == CBOR_MAJOR_NONE_TYPE_OPEN_BSTR) {
Laurence Lundblade716d10c2024-02-07 16:54:42 -08001435 /* It's OK to nest a byte string in any type but
1436 * another open byte string. */
Paul Liétar79789772022-07-26 20:33:18 +01001437 pMe->uError = QCBOR_ERR_OPEN_BYTE_STRING;
1438 return;
1439 }
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001440#endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
1441
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001442 QCBOREncode_Private_OpenMapOrArray(pMe, CBOR_MAJOR_NONE_TYPE_OPEN_BSTR);
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001443}
1444
1445
1446/*
1447 * Public function for closing a byte string. See qcbor/qcbor_encode.h
1448 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001449void
1450QCBOREncode_CloseBytes(QCBOREncodeContext *pMe, const size_t uAmount)
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001451{
1452 UsefulOutBuf_Advance(&(pMe->OutBuf), uAmount);
1453 if(UsefulOutBuf_GetError(&(pMe->OutBuf))) {
1454 /* Advance too far. Normal off-end error handling in effect here. */
1455 return;
1456 }
1457
Laurence Lundbladecbd7d132024-05-19 11:11:22 -07001458 QCBOREncode_Private_CloseAggregate(pMe, CBOR_MAJOR_NONE_TYPE_OPEN_BSTR, uAmount);
Laurence Lundbladeb24faef2022-04-26 11:03:08 -06001459}
1460
1461
Laurence Lundbladecbd7d132024-05-19 11:11:22 -07001462#ifndef QCBOR_DISABLE_INDEFINITE_LENGTH_ARRAYS
1463
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001464/**
1465 * @brief Semi-private method to close a map, array with indefinite length
1466 *
1467 * @param[in] pMe The context to add to.
1468 * @param[in] uMajorType The major CBOR type to close.
1469 *
1470 * Call QCBOREncode_CloseArrayIndefiniteLength() or
1471 * QCBOREncode_CloseMapIndefiniteLength() instead of this.
Jan Jongboom4a93a662019-07-25 08:44:58 +02001472 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001473void
1474QCBOREncode_Private_CloseMapOrArrayIndefiniteLength(QCBOREncodeContext *pMe,
1475 const uint8_t uMajorType)
Jan Jongboom4a93a662019-07-25 08:44:58 +02001476{
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001477 if(QCBOREncode_Private_CheckDecreaseNesting(pMe, uMajorType)) {
Laurence Lundblade274ddef2022-05-17 09:12:23 -07001478 return;
Jan Jongboom4a93a662019-07-25 08:44:58 +02001479 }
Laurence Lundbladedaefdec2020-11-02 20:22:03 -08001480
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001481 /* Append the break marker (0xff for both arrays and maps) */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001482 QCBOREncode_Private_AppendCBORHead(pMe, CBOR_MAJOR_NONE_TYPE_SIMPLE_BREAK, CBOR_SIMPLE_BREAK, 0);
Laurence Lundblade274ddef2022-05-17 09:12:23 -07001483 Nesting_Decrease(&(pMe->nesting));
Jan Jongboom4a93a662019-07-25 08:44:58 +02001484}
Laurence Lundbladecbd7d132024-05-19 11:11:22 -07001485#endif
Jan Jongboom4a93a662019-07-25 08:44:58 +02001486
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001487
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001488/*
Laurence Lundblade8d3b8552021-06-10 11:11:54 -07001489 * Public function to finish and get the encoded result. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001490 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001491QCBORError
1492QCBOREncode_Finish(QCBOREncodeContext *pMe, UsefulBufC *pEncodedCBOR)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001493{
Laurence Lundbladef2f0c3f2024-04-12 13:01:54 -07001494 if(QCBOREncode_GetErrorState(pMe) != QCBOR_SUCCESS) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001495 goto Done;
Laurence Lundblade067035b2018-11-28 17:35:25 -08001496 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001497
Laurence Lundbladedaefdec2020-11-02 20:22:03 -08001498#ifndef QCBOR_DISABLE_ENCODE_USAGE_GUARDS
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001499 if(Nesting_IsInNest(&(pMe->nesting))) {
Laurence Lundbladef2f0c3f2024-04-12 13:01:54 -07001500 pMe->uError = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001501 goto Done;
1502 }
Laurence Lundbladee2c893c2020-12-26 17:41:53 -08001503#endif /* QCBOR_DISABLE_ENCODE_USAGE_GUARDS */
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001504
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001505 *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(pMe->OutBuf));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001506
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001507Done:
Laurence Lundbladef2f0c3f2024-04-12 13:01:54 -07001508 return pMe->uError;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001509}
1510
Laurence Lundblade0595e932018-11-02 22:22:47 +07001511
Laurence Lundblade067035b2018-11-28 17:35:25 -08001512/*
Laurence Lundblade1fa579b2020-11-25 00:31:37 -08001513 * Public functions to get size of the encoded result. See qcbor/qcbor_encode.h
Laurence Lundblade067035b2018-11-28 17:35:25 -08001514 */
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001515QCBORError
1516QCBOREncode_FinishGetSize(QCBOREncodeContext *pMe, size_t *puEncodedLen)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001517{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -07001518 UsefulBufC Enc;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001519
Laurence Lundblade8e36f812024-01-26 10:59:29 -07001520 QCBORError nReturn = QCBOREncode_Finish(pMe, &Enc);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001521
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001522 if(nReturn == QCBOR_SUCCESS) {
Laurence Lundbladeda3f0822018-09-18 19:49:02 -07001523 *puEncodedLen = Enc.len;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001524 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08001525
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001526 return nReturn;
1527}