blob: a53f7753cf8ecad34a62944b4401b94ed74f1b6e [file] [log] [blame]
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001/*==============================================================================
Laurence Lundbladed92a6162018-11-01 11:38:35 +07002 Copyright (c) 2016-2018, The Linux Foundation.
Laurence Lundbladeee851742020-01-08 08:37:05 -08003 Copyright (c) 2018-2020, Laurence Lundblade.
Laurence Lundbladed92a6162018-11-01 11:38:35 +07004 All rights reserved.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -08005
Laurence Lundblade0dbc9172018-11-01 14:17:21 +07006Redistribution and use in source and binary forms, with or without
7modification, are permitted provided that the following conditions are
8met:
9 * Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
11 * Redistributions in binary form must reproduce the above
12 copyright notice, this list of conditions and the following
13 disclaimer in the documentation and/or other materials provided
14 with the distribution.
15 * Neither the name of The Linux Foundation nor the names of its
16 contributors, nor the name "Laurence Lundblade" may be used to
17 endorse or promote products derived from this software without
18 specific prior written permission.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080019
Laurence Lundblade0dbc9172018-11-01 14:17:21 +070020THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
21WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
22MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
23ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
24BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
27BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
28WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
29OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
30IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Laurence Lundbladeee851742020-01-08 08:37:05 -080031 =============================================================================*/
Laurence Lundblade624405d2018-09-18 20:10:47 -070032
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080033
Laurence Lundblade844bb5c2020-03-01 17:27:25 -080034#include "qcbor/qcbor_encode.h"
Laurence Lundblade12d32c52018-09-19 11:25:27 -070035#include "ieee754.h"
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070036
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070037
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070038
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070039/*
Laurence Lundbladeee851742020-01-08 08:37:05 -080040 Nesting -- This tracks the nesting of maps and arrays.
41
42 The following functions and data type QCBORTrackNesting implement the
43 nesting management for encoding.
44
45 CBOR's two nesting types, arrays and maps, are tracked here. There is
46 a limit of QCBOR_MAX_ARRAY_NESTING to the number of arrays and maps
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070047 that can be nested in one encoding so the encoding context stays
48 small enough to fit on the stack.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080049
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070050 When an array / map is opened, pCurrentNesting points to the element
Laurence Lundbladeee851742020-01-08 08:37:05 -080051 in pArrays that records the type, start position and accumulates a
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070052 count of the number of items added. When closed the start position is
53 used to go back and fill in the type and number of items in the array
54 / map.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -080055
Laurence Lundbladeee851742020-01-08 08:37:05 -080056 Encoded output can be just items like ints and strings that are not
57 part of any array / map. That is, the first thing encoded does not
58 have to be an array or a map.
59
60 QCBOR has a special feature to allow constructing bstr-wrapped CBOR
61 directly into the output buffer, so an extra buffer for it is not
62 needed. This is implemented as nesting with type
63 CBOR_MAJOR_TYPE_BYTE_STRING and uses this code. Bstr-wrapped CBOR is
64 used by COSE for data that is to be hashed.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070065 */
66inline static void Nesting_Init(QCBORTrackNesting *pNesting)
67{
Laurence Lundbladeee851742020-01-08 08:37:05 -080068 // Assumes pNesting has been zeroed
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070069 pNesting->pCurrentNesting = &pNesting->pArrays[0];
70 // Implied CBOR array at the top nesting level. This is never returned,
71 // but makes the item count work correctly.
72 pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY;
73}
74
Laurence Lundblade29497c02020-07-11 15:44:03 -070075inline static uint8_t Nesting_Increase(QCBORTrackNesting *pNesting,
Laurence Lundblade2c40ab82018-12-30 14:20:29 -080076 uint8_t uMajorType,
77 uint32_t uPos)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070078{
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070079 if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) {
Laurence Lundbladeee851742020-01-08 08:37:05 -080080 // Trying to open one too many
Laurence Lundblade29497c02020-07-11 15:44:03 -070081 return QCBOR_ERR_ARRAY_NESTING_TOO_DEEP;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070082 } else {
83 pNesting->pCurrentNesting++;
84 pNesting->pCurrentNesting->uCount = 0;
85 pNesting->pCurrentNesting->uStart = uPos;
86 pNesting->pCurrentNesting->uMajorType = uMajorType;
Laurence Lundblade29497c02020-07-11 15:44:03 -070087 return QCBOR_SUCCESS;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070088 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070089}
90
91inline static void Nesting_Decrease(QCBORTrackNesting *pNesting)
92{
93 pNesting->pCurrentNesting--;
94}
95
Laurence Lundblade29497c02020-07-11 15:44:03 -070096inline static uint8_t Nesting_Increment(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070097{
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -080098 if(1 >= QCBOR_MAX_ITEMS_IN_ARRAY - pNesting->pCurrentNesting->uCount) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070099 return QCBOR_ERR_ARRAY_TOO_LONG;
100 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800101
Laurence Lundbladee6bcef12020-04-01 10:56:27 -0700102 pNesting->pCurrentNesting->uCount++;
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800103
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700104 return QCBOR_SUCCESS;
105}
106
107inline static uint16_t Nesting_GetCount(QCBORTrackNesting *pNesting)
108{
109 // The nesting count recorded is always the actual number of individiual
110 // data items in the array or map. For arrays CBOR uses the actual item
111 // count. For maps, CBOR uses the number of pairs. This function returns
112 // the number needed for the CBOR encoding, so it divides the number of
113 // items by two for maps to get the number of pairs. This implementation
114 // takes advantage of the map major type being one larger the array major
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800115 // type, hence uDivisor is either 1 or 2.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800116
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800117 if(pNesting->pCurrentNesting->uMajorType == CBOR_MAJOR_TYPE_MAP) {
118 // Cast back to uint16_t after integer promotion for bit shift
119 return (uint16_t)(pNesting->pCurrentNesting->uCount >> 1);
120 } else {
121 return pNesting->pCurrentNesting->uCount;
122 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700123}
124
125inline static uint32_t Nesting_GetStartPos(QCBORTrackNesting *pNesting)
126{
127 return pNesting->pCurrentNesting->uStart;
128}
129
130inline static uint8_t Nesting_GetMajorType(QCBORTrackNesting *pNesting)
131{
132 return pNesting->pCurrentNesting->uMajorType;
133}
134
Laurence Lundbladeee851742020-01-08 08:37:05 -0800135inline static bool Nesting_IsInNest(QCBORTrackNesting *pNesting)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700136{
Laurence Lundbladeee851742020-01-08 08:37:05 -0800137 return pNesting->pCurrentNesting == &pNesting->pArrays[0] ? false : true;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700138}
139
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700140
141
142
143/*
Laurence Lundbladeee851742020-01-08 08:37:05 -0800144 Encoding of the major CBOR types is by these functions:
145
146 CBOR Major Type Public Function
147 0 QCBOREncode_AddUInt64()
148 0, 1 QCBOREncode_AddUInt64(), QCBOREncode_AddInt64()
149 2, 3 QCBOREncode_AddBuffer(), Also QCBOREncode_OpenMapOrArray(),
150 QCBOREncode_CloseMapOrArray()
151 4, 5 QCBOREncode_OpenMapOrArray(), QCBOREncode_CloseMapOrArray(),
152 QCBOREncode_OpenMapOrArrayIndefiniteLength(),
153 QCBOREncode_CloseMapOrArrayIndefiniteLength()
154 6 QCBOREncode_AddTag()
155 7 QCBOREncode_AddDouble(), QCBOREncode_AddType7()
156
157 Additionally, encoding of decimal fractions and bigfloats is by
158 QCBOREncode_AddExponentAndMantissa()
159*/
160
161/*
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700162 Error tracking plan -- Errors are tracked internally and not returned
Laurence Lundbladeee851742020-01-08 08:37:05 -0800163 until QCBOREncode_Finish is called. The CBOR errors are in me->uError.
Laurence Lundblade067035b2018-11-28 17:35:25 -0800164 UsefulOutBuf also tracks whether the buffer is full or not in its
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700165 context. Once either of these errors is set they are never
Laurence Lundblade241705e2018-12-30 18:56:14 -0800166 cleared. Only QCBOREncode_Init() resets them. Or said another way, they must
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700167 never be cleared or we'll tell the caller all is good when it is not.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800168
Laurence Lundblade241705e2018-12-30 18:56:14 -0800169 Only one error code is reported by QCBOREncode_Finish() even if there are
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700170 multiple errors. The last one set wins. The caller might have to fix
171 one error to reveal the next one they have to fix. This is OK.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800172
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700173 The buffer full error tracked by UsefulBuf is only pulled out of
174 UsefulBuf in Finish() so it is the one that usually wins. UsefulBuf
175 will never go off the end of the buffer even if it is called again
176 and again when full.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800177
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700178 It is really tempting to not check for overflow on the count in the
179 number of items in an array. It would save a lot of code, it is
180 extremely unlikely that any one will every put 65,000 items in an
181 array, and the only bad thing that would happen is the CBOR would be
Laurence Lundblade241705e2018-12-30 18:56:14 -0800182 bogus.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800183
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700184 Since this does not parse any input, you could in theory remove all
185 error checks in this code if you knew the caller called it
186 correctly. Maybe someday CDDL or some such language will be able to
187 generate the code to call this and the calling code would always be
Laurence Lundblade56230d12018-11-01 11:14:51 +0700188 correct. This could also automatically size some of the data
Laurence Lundblade241705e2018-12-30 18:56:14 -0800189 structures like array/map nesting resulting in some stack memory
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700190 savings.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800191
Laurence Lundbladeee851742020-01-08 08:37:05 -0800192 The 8 errors returned here fall into three categories:
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800193
Laurence Lundblade067035b2018-11-28 17:35:25 -0800194 Sizes
Laurence Lundbladeee851742020-01-08 08:37:05 -0800195 QCBOR_ERR_BUFFER_TOO_LARGE -- Encoded output exceeded UINT32_MAX
196 QCBOR_ERR_BUFFER_TOO_SMALL -- Output buffer too small
197 QCBOR_ERR_ARRAY_NESTING_TOO_DEEP -- Nesting > QCBOR_MAX_ARRAY_NESTING1
198 QCBOR_ERR_ARRAY_TOO_LONG -- Too many things added to an array/map
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800199
Laurence Lundblade067035b2018-11-28 17:35:25 -0800200 Nesting constructed incorrectly
Laurence Lundbladeee851742020-01-08 08:37:05 -0800201 QCBOR_ERR_TOO_MANY_CLOSES -- More close calls than opens
202 QCBOR_ERR_CLOSE_MISMATCH -- Type of close does not match open
Laurence Lundblade067035b2018-11-28 17:35:25 -0800203 QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN -- Finish called without enough closes
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700204
205 Would generate not-well-formed CBOR
Laurence Lundbladea9489f82020-09-12 13:50:56 -0700206 QCBOR_ERR_ENCODE_UNSUPPORTED -- Simple type between 24 and 31
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700207 */
208
209
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700210/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800211 Public function for initialization. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700212 */
Laurence Lundblade2296db52018-09-14 18:08:39 -0700213void QCBOREncode_Init(QCBOREncodeContext *me, UsefulBuf Storage)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700214{
215 memset(me, 0, sizeof(QCBOREncodeContext));
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800216 UsefulOutBuf_Init(&(me->OutBuf), Storage);
217 Nesting_Init(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700218}
219
220
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000221/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800222 Public function to encode a CBOR head. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700223 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000224UsefulBufC QCBOREncode_EncodeHead(UsefulBuf buffer,
225 uint8_t uMajorType,
226 uint8_t uMinLen,
227 uint64_t uArgument)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700228{
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000229 /**
230 All CBOR data items have a type and an "argument". The argument is
231 either the value of the item for integer types, the length of the
232 content for string, byte, array and map types, a tag for major type
233 6, and has several uses for major type 7.
234
235 This function encodes the type and the argument. There are several
236 encodings for the argument depending on how large it is and how it is
237 used.
238
239 Every encoding of the type and argument has at least one byte, the
240 "initial byte".
241
242 The top three bits of the initial byte are the major type for the
243 CBOR data item. The eight major types defined by the standard are
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800244 defined as CBOR_MAJOR_TYPE_xxxx in qcbor/qcbor_common.h.
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000245
246 The remaining five bits, known as "additional information", and
247 possibly more bytes encode the argument. If the argument is less than
248 24, then it is encoded entirely in the five bits. This is neat
249 because it allows you to encode an entire CBOR data item in 1 byte
250 for many values and types (integers 0-23, true, false, and tags).
251
252 If the argument is larger than 24, then it is encoded in 1,2,4 or 8
253 additional bytes, with the number of these bytes indicated by the
254 values of the 5 bits 24, 25, 25 and 27.
255
256 It is possible to encode a particular argument in many ways with this
257 representation. This implementation always uses the smallest
258 possible representation. This conforms with CBOR preferred encoding.
259
260 This function inserts them into the output buffer at the specified
261 position. AppendEncodedTypeAndNumber() appends to the end.
262
263 This function takes care of converting to network byte order.
264
265 This function is also used to insert floats and doubles. Before this
266 function is called the float or double must be copied into a
267 uint64_t. That is how they are passed in. They are then converted to
268 network byte order correctly. The uMinLen parameter makes sure that
269 even if all the digits of a half, float or double are 0 it is still
270 correctly encoded in 2, 4 or 8 bytes.
271 */
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800272 /*
273 This code does endian conversion without hton or knowing the
Laurence Lundblade241705e2018-12-30 18:56:14 -0800274 endianness of the machine using masks and shifts. This avoids the
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800275 dependency on hton and the mess of figuring out how to find the
276 machine's endianness.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800277
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800278 This is a good efficient implementation on little-endian machines.
279 A faster and small implementation is possible on big-endian
280 machines because CBOR/network byte order is big endian. However
281 big endian machines are uncommon.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800282
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800283 On x86, it is about 200 bytes instead of 500 bytes for the more
284 formal unoptimized code.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800285
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800286 This also does the CBOR preferred shortest encoding for integers
287 and is called to do endian conversion for floats.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800288
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800289 It works backwards from the LSB to the MSB as needed.
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800290
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800291 Code Reviewers: THIS FUNCTION DOES POINTER MATH
292 */
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800293 /*
294 The type int is used here for several variables because of the way
295 integer promotion works in C for integer variables that are
296 uint8_t or uint16_t. The basic rule is that they will always be
297 promoted to int if they will fit. All of these integer variables
298 need only hold values less than 255 or are promoted from uint8_t,
299 so they will always fit into an int. Note that promotion is only
300 to unsigned int if the value won't fit into an int even if the
301 promotion is for an unsigned like uint8_t.
302
303 By declaring them int, there are few implicit conversions and fewer
304 casts needed. Code size is reduced a little. It also makes static
305 analyzers happier.
306
307 Note also that declaring them uint8_t won't stop integer wrap
308 around if the code is wrong. It won't make the code more correct.
309
310 https://stackoverflow.com/questions/46073295/implicit-type-promotion-rules
311 https://stackoverflow.com/questions/589575/what-does-the-c-standard-state-the-size-of-int-long-type-to-be
312 */
Laurence Lundbladeee851742020-01-08 08:37:05 -0800313
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000314 // Buffer must have room for the largest CBOR HEAD + one extra as the
315 // one extra is needed for this code to work as it does a pre-decrement.
316 if(buffer.len < QCBOR_HEAD_BUFFER_SIZE) {
317 return NULLUsefulBufC;
318 }
319
320 // Pointer to last valid byte in the buffer
321 uint8_t * const pBufferEnd = &((uint8_t *)buffer.ptr)[QCBOR_HEAD_BUFFER_SIZE-1];
322
323 // Point to the last byte and work backwards
324 uint8_t *pByte = pBufferEnd;
325 // The 5 bits in the initial byte that are not the major type
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800326 int nAdditionalInfo;
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800327
Jan Jongboom5d827882019-08-07 12:51:15 +0200328 if (uMajorType == CBOR_MAJOR_NONE_TYPE_ARRAY_INDEFINITE_LEN) {
329 uMajorType = CBOR_MAJOR_TYPE_ARRAY;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800330 nAdditionalInfo = LEN_IS_INDEFINITE;
Jan Jongboom5d827882019-08-07 12:51:15 +0200331 } else if (uMajorType == CBOR_MAJOR_NONE_TYPE_MAP_INDEFINITE_LEN) {
332 uMajorType = CBOR_MAJOR_TYPE_MAP;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800333 nAdditionalInfo = LEN_IS_INDEFINITE;
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000334 } else if (uArgument < CBOR_TWENTY_FOUR && uMinLen == 0) {
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800335 // Simple case where argument is < 24
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000336 nAdditionalInfo = (int)uArgument;
337 } else if (uMajorType == CBOR_MAJOR_TYPE_SIMPLE && uArgument == CBOR_SIMPLE_BREAK) {
Jan Jongboom4a93a662019-07-25 08:44:58 +0200338 // Break statement can be encoded in single byte too (0xff)
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000339 nAdditionalInfo = (int)uArgument;
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800340 } else {
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800341 /*
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000342 Encode argument in 1,2,4 or 8 bytes. Outer loop
343 runs once for 1 byte and 4 times for 8 bytes.
344 Inner loop runs 1, 2 or 4 times depending on
345 outer loop counter. This works backwards taking
346 8 bits off the argument being encoded at a time
347 until all bits from uNumber have been encoded
348 and the minimum encoding size is reached.
349 Minimum encoding size is for floating point
350 numbers with zero bytes.
Laurence Lundbladee9b00322018-12-30 10:33:26 -0800351 */
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800352 static const uint8_t aIterate[] = {1,1,2,4};
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000353
354 // The parameter passed in is unsigned, but goes negative in the loop
355 // so it must be converted to a signed value.
356 int nMinLen = (int)uMinLen;
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800357 int i;
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000358 for(i = 0; uArgument || nMinLen > 0; i++) {
359 const int nIterations = (int)aIterate[i];
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800360 for(int j = 0; j < nIterations; j++) {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000361 *--pByte = (uint8_t)(uArgument & 0xff);
362 uArgument = uArgument >> 8;
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800363 }
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800364 nMinLen -= nIterations;
Laurence Lundblade04a859b2018-12-11 12:13:02 -0800365 }
Laurence Lundbladeee851742020-01-08 08:37:05 -0800366 // Additional info is the encoding of the number of additional
367 // bytes to encode argument.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800368 nAdditionalInfo = LEN_IS_ONE_BYTE-1 + i;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700369 }
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800370
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800371 /*
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000372 This expression integer-promotes to type int. The code above in
373 function guarantees that nAdditionalInfo will never be larger than
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800374 0x1f. The caller may pass in a too-large uMajor type. The
375 conversion to unint8_t will cause an integer wrap around and
376 incorrect CBOR will be generated, but no security issue will
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000377 occur.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800378 */
379 *--pByte = (uint8_t)((uMajorType << 5) + nAdditionalInfo);
380
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000381#ifdef EXTRA_ENCODE_HEAD_CHECK
382 /* This is a sanity check that can be turned on to verify the pointer
383 * math in this function is not going wrong. Turn it on and run the
384 * whole test suite to perform the check.
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800385 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000386 if(pBufferEnd - pByte > 9 || pBufferEnd - pByte < 1 || pByte < (uint8_t *)buffer.ptr) {
387 return NULLUsefulBufC;
388 }
389#endif
Laurence Lundbladec5fef682020-01-25 11:38:45 -0800390
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000391 // Length will not go negative because the loops run for at most 8 decrements
392 // of pByte, only one other decrement is made, and the array is sized
393 // for this.
394 return (UsefulBufC){pByte, (size_t)(pBufferEnd - pByte)};
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700395}
396
397
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000398/**
399 @brief Append the CBOR head, the major type and argument
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800400
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000401 @param me Encoder context.
402 @param uMajorType Major type to insert.
403 @param uArgument The argument (an integer value or a length).
404 @param uMinLen The minimum number of bytes for encoding the CBOR argument.
405
406 This formats the CBOR "head" and appends it to the output.
407 */
408static void AppendCBORHead(QCBOREncodeContext *me, uint8_t uMajorType, uint64_t uArgument, uint8_t uMinLen)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700409{
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000410 // A stack buffer large enough for a CBOR head
411 UsefulBuf_MAKE_STACK_UB (pBufferForEncodedHead, QCBOR_HEAD_BUFFER_SIZE);
412
413 UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead,
414 uMajorType,
415 uMinLen,
416 uArgument);
417
418 /* No check for EncodedHead == NULLUsefulBufC is performed here to
419 * save object code. It is very clear that pBufferForEncodedHead
420 * is the correct size. If EncodedHead == NULLUsefulBufC then
421 * UsefulOutBuf_AppendUsefulBuf() will do nothing so there is
422 * no security hole introduced.
423 */
424
425 UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), EncodedHead);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700426}
427
428
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000429/**
430 @brief Insert the CBOR head for a map, array or wrapped bstr
431
432 @param me QCBOR encoding context.
433 @param uMajorType One of CBOR_MAJOR_TYPE_XXXX.
434 @param uLen The length of the data item.
435
436 When an array, map or bstr was opened, nothing was done but note
437 the position. This function goes back to that position and inserts
438 the CBOR Head with the major type and length.
439 */
440static void InsertCBORHead(QCBOREncodeContext *me, uint8_t uMajorType, size_t uLen)
441{
442 if(me->uError == QCBOR_SUCCESS) {
443 if(!Nesting_IsInNest(&(me->nesting))) {
444 me->uError = QCBOR_ERR_TOO_MANY_CLOSES;
445 } else if(Nesting_GetMajorType(&(me->nesting)) != uMajorType) {
446 me->uError = QCBOR_ERR_CLOSE_MISMATCH;
447 } else {
448 // A stack buffer large enough for a CBOR head
449 UsefulBuf_MAKE_STACK_UB (pBufferForEncodedHead,QCBOR_HEAD_BUFFER_SIZE);
450
451 UsefulBufC EncodedHead = QCBOREncode_EncodeHead(pBufferForEncodedHead,
452 uMajorType,
453 0,
454 uLen);
455
456 /* No check for EncodedHead == NULLUsefulBufC is performed here to
457 * save object code. It is very clear that pBufferForEncodedHead
458 * is the correct size. If EncodedHead == NULLUsefulBufC then
459 * UsefulOutBuf_InsertUsefulBuf() will do nothing so there is
460 * no security whole introduced.
461 */
462 UsefulOutBuf_InsertUsefulBuf(&(me->OutBuf), EncodedHead, Nesting_GetStartPos(&(me->nesting)) );
463
464 Nesting_Decrease(&(me->nesting));
465 }
466 }
467}
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700468
Laurence Lundblade241705e2018-12-30 18:56:14 -0800469
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700470/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800471 Public functions for adding integers. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700472 */
Laurence Lundblade067035b2018-11-28 17:35:25 -0800473void QCBOREncode_AddUInt64(QCBOREncodeContext *me, uint64_t uValue)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700474{
Laurence Lundblade067035b2018-11-28 17:35:25 -0800475 if(me->uError == QCBOR_SUCCESS) {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000476 AppendCBORHead(me, CBOR_MAJOR_TYPE_POSITIVE_INT, uValue, 0);
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800477 me->uError = Nesting_Increment(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700478 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700479}
480
Laurence Lundblade56230d12018-11-01 11:14:51 +0700481
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700482/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800483 Public functions for adding unsigned. See qcbor/qcbor_encode.h
Laurence Lundblade067035b2018-11-28 17:35:25 -0800484 */
485void QCBOREncode_AddInt64(QCBOREncodeContext *me, int64_t nNum)
486{
487 if(me->uError == QCBOR_SUCCESS) {
488 uint8_t uMajorType;
489 uint64_t uValue;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800490
Laurence Lundblade067035b2018-11-28 17:35:25 -0800491 if(nNum < 0) {
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800492 // In CBOR -1 encodes as 0x00 with major type negative int.
493 uValue = (uint64_t)(-nNum - 1);
Laurence Lundblade067035b2018-11-28 17:35:25 -0800494 uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT;
495 } else {
496 uValue = (uint64_t)nNum;
497 uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT;
498 }
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000499 AppendCBORHead(me, uMajorType, uValue, 0);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800500
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800501 me->uError = Nesting_Increment(&(me->nesting));
Laurence Lundblade067035b2018-11-28 17:35:25 -0800502 }
503}
504
505
506/*
Laurence Lundbladeda532272019-04-07 11:40:17 -0700507 Semi-private function. It is exposed to user of the interface, but
508 they will usually call one of the inline wrappers rather than this.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800509
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800510 See qcbor/qcbor_encode.h
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800511
Laurence Lundbladeda532272019-04-07 11:40:17 -0700512 Does the work of adding actual strings bytes to the CBOR output (as
513 opposed to numbers and opening / closing aggregate types).
514
515 There are four use cases:
516 CBOR_MAJOR_TYPE_BYTE_STRING -- Byte strings
517 CBOR_MAJOR_TYPE_TEXT_STRING -- Text strings
518 CBOR_MAJOR_NONE_TYPE_RAW -- Already-encoded CBOR
519 CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY -- Special case
520
521 The first two add the type and length plus the actual bytes. The
522 third just adds the bytes as the type and length are presumed to be
523 in the bytes. The fourth just adds the type and length for the very
524 special case of QCBOREncode_AddBytesLenOnly().
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700525 */
Laurence Lundblade067035b2018-11-28 17:35:25 -0800526void QCBOREncode_AddBuffer(QCBOREncodeContext *me, uint8_t uMajorType, UsefulBufC Bytes)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700527{
Laurence Lundblade241705e2018-12-30 18:56:14 -0800528 if(me->uError == QCBOR_SUCCESS) {
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800529 // If it is not Raw CBOR, add the type and the length
530 if(uMajorType != CBOR_MAJOR_NONE_TYPE_RAW) {
Laurence Lundbladeda532272019-04-07 11:40:17 -0700531 uint8_t uRealMajorType = uMajorType;
532 if(uRealMajorType == CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY) {
533 uRealMajorType = CBOR_MAJOR_TYPE_BYTE_STRING;
534 }
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000535 AppendCBORHead(me, uRealMajorType, Bytes.len, 0);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700536 }
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800537
Laurence Lundbladeda532272019-04-07 11:40:17 -0700538 if(uMajorType != CBOR_MAJOR_NONE_TYPE_BSTR_LEN_ONLY) {
539 // Actually add the bytes
540 UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), Bytes);
541 }
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800542
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800543 // Update the array counting if there is any nesting at all
544 me->uError = Nesting_Increment(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700545 }
546}
547
Laurence Lundbladecafcfe12018-10-31 21:59:50 +0700548
Laurence Lundblade55a24832018-10-30 04:35:08 +0700549/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800550 Public functions for adding a tag. See qcbor/qcbor_encode.h
Laurence Lundblade55a24832018-10-30 04:35:08 +0700551 */
552void QCBOREncode_AddTag(QCBOREncodeContext *me, uint64_t uTag)
553{
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000554 AppendCBORHead(me, CBOR_MAJOR_TYPE_OPTIONAL, uTag, 0);
Laurence Lundblade55a24832018-10-30 04:35:08 +0700555}
556
557
Laurence Lundblade56230d12018-11-01 11:14:51 +0700558/*
Laurence Lundblade487930f2018-11-30 11:01:45 -0800559 Semi-private function. It is exposed to user of the interface,
560 but they will usually call one of the inline wrappers rather than this.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800561
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800562 See header qcbor/qcbor_encode.h
Laurence Lundblade56230d12018-11-01 11:14:51 +0700563 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000564void QCBOREncode_AddType7(QCBOREncodeContext *me, uint8_t uMinLen, uint64_t uNum)
Laurence Lundblade55a24832018-10-30 04:35:08 +0700565{
Laurence Lundblade487930f2018-11-30 11:01:45 -0800566 if(me->uError == QCBOR_SUCCESS) {
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700567 if(uNum >= CBOR_SIMPLEV_RESERVED_START && uNum <= CBOR_SIMPLEV_RESERVED_END) {
Laurence Lundbladea9489f82020-09-12 13:50:56 -0700568 me->uError = QCBOR_ERR_ENCODE_UNSUPPORTED;
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700569 } else {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000570 // AppendHead() does endian swapping for the float / double
571 AppendCBORHead(me, CBOR_MAJOR_TYPE_SIMPLE, uNum, uMinLen);
Laurence Lundbladebb1062e2019-08-12 23:28:54 -0700572 me->uError = Nesting_Increment(&(me->nesting));
573 }
Laurence Lundblade487930f2018-11-30 11:01:45 -0800574 }
Laurence Lundblade55a24832018-10-30 04:35:08 +0700575}
576
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700577
Laurence Lundblade32f3e622020-07-13 20:35:11 -0700578/*
579 Public functions for adding a double. See qcbor/qcbor_encode.h
580*/
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700581void QCBOREncode_AddDoubleNoPreferred(QCBOREncodeContext *me, double dNum)
582{
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700583 QCBOREncode_AddType7(me,
584 sizeof(uint64_t),
585 UsefulBufUtil_CopyDoubleToUint64(dNum));
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700586}
587
Laurence Lundblade32f3e622020-07-13 20:35:11 -0700588
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700589/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800590 Public functions for adding a double. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700591 */
Laurence Lundblade067035b2018-11-28 17:35:25 -0800592void QCBOREncode_AddDouble(QCBOREncodeContext *me, double dNum)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700593{
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700594#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade067035b2018-11-28 17:35:25 -0800595 const IEEE754_union uNum = IEEE754_DoubleToSmallest(dNum);
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700596
Laurence Lundblade487930f2018-11-30 11:01:45 -0800597 QCBOREncode_AddType7(me, uNum.uSize, uNum.uValue);
Laurence Lundblade9682a532020-06-06 18:33:04 -0700598#else
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700599 QCBOREncode_AddDoubleNoPreferred(me, dNum);
Laurence Lundblade9682a532020-06-06 18:33:04 -0700600#endif
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700601}
Laurence Lundblade9682a532020-06-06 18:33:04 -0700602
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700603
Laurence Lundblade32f3e622020-07-13 20:35:11 -0700604/*
605 Public functions for adding a float. See qcbor/qcbor_encode.h
606*/
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700607void QCBOREncode_AddFloatNoPreferred(QCBOREncodeContext *me, float fNum)
608{
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700609 QCBOREncode_AddType7(me,
610 sizeof(uint32_t),
611 UsefulBufUtil_CopyFloatToUint32(fNum));
Laurence Lundblade9682a532020-06-06 18:33:04 -0700612}
613
614
615/*
Laurence Lundblade32f3e622020-07-13 20:35:11 -0700616 Public functions for adding a float. See qcbor/qcbor_encode.h
Laurence Lundblade9682a532020-06-06 18:33:04 -0700617 */
618void QCBOREncode_AddFloat(QCBOREncodeContext *me, float fNum)
619{
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700620#ifndef QCBOR_DISABLE_PREFERRED_FLOAT
Laurence Lundblade9682a532020-06-06 18:33:04 -0700621 const IEEE754_union uNum = IEEE754_FloatToSmallest(fNum);
Laurence Lundblade2feb1e12020-07-15 03:50:45 -0700622
Laurence Lundblade9682a532020-06-06 18:33:04 -0700623 QCBOREncode_AddType7(me, uNum.uSize, uNum.uValue);
624#else
Laurence Lundbladeb275cdc2020-07-12 12:34:38 -0700625 QCBOREncode_AddFloatNoPreferred(me, fNum);
Laurence Lundblade9682a532020-06-06 18:33:04 -0700626#endif
Laurence Lundblade067035b2018-11-28 17:35:25 -0800627}
628
629
Laurence Lundblade59289e52019-12-30 13:44:37 -0800630#ifndef QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA
631/*
632 Semi-public function. It is exposed to the user of the interface, but
633 one of the inline wrappers will usually be called rather than this.
634
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800635 See qcbor/qcbor_encode.h
Laurence Lundblade59289e52019-12-30 13:44:37 -0800636 */
637void QCBOREncode_AddExponentAndMantissa(QCBOREncodeContext *pMe,
638 uint64_t uTag,
639 UsefulBufC BigNumMantissa,
640 bool bBigNumIsNegative,
641 int64_t nMantissa,
642 int64_t nExponent)
643{
Laurence Lundbladeee851742020-01-08 08:37:05 -0800644 /*
645 This is for encoding either a big float or a decimal fraction,
646 both of which are an array of two items, an exponent and a
647 mantissa. The difference between the two is that the exponent is
648 base-2 for big floats and base-10 for decimal fractions, but that
649 has no effect on the code here.
650 */
Laurence Lundblade59289e52019-12-30 13:44:37 -0800651 QCBOREncode_AddTag(pMe, uTag);
652 QCBOREncode_OpenArray(pMe);
653 QCBOREncode_AddInt64(pMe, nExponent);
654 if(!UsefulBuf_IsNULLC(BigNumMantissa)) {
655 if(bBigNumIsNegative) {
656 QCBOREncode_AddNegativeBignum(pMe, BigNumMantissa);
657 } else {
658 QCBOREncode_AddPositiveBignum(pMe, BigNumMantissa);
659 }
660 } else {
661 QCBOREncode_AddInt64(pMe, nMantissa);
662 }
663 QCBOREncode_CloseArray(pMe);
664}
665#endif /* QCBOR_CONFIG_DISABLE_EXP_AND_MANTISSA */
666
667
Laurence Lundblade067035b2018-11-28 17:35:25 -0800668/*
669 Semi-public function. It is exposed to user of the interface,
670 but they will usually call one of the inline wrappers rather than this.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800671
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800672 See qcbor/qcbor_encode.h
Laurence Lundblade067035b2018-11-28 17:35:25 -0800673*/
674void QCBOREncode_OpenMapOrArray(QCBOREncodeContext *me, uint8_t uMajorType)
675{
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800676 // Add one item to the nesting level we are in for the new map or array
677 me->uError = Nesting_Increment(&(me->nesting));
Laurence Lundblade241705e2018-12-30 18:56:14 -0800678 if(me->uError == QCBOR_SUCCESS) {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800679 /*
680 The offset where the length of an array or map will get written
681 is stored in a uint32_t, not a size_t to keep stack usage
682 smaller. This checks to be sure there is no wrap around when
683 recording the offset. Note that on 64-bit machines CBOR larger
684 than 4GB can be encoded as long as no array / map offsets occur
685 past the 4GB mark, but the public interface says that the
686 maximum is 4GB to keep the discussion simpler.
687 */
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800688 size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf));
Laurence Lundbladed39cd392019-01-11 18:17:38 -0800689
Laurence Lundbladeee851742020-01-08 08:37:05 -0800690 /*
691 QCBOR_MAX_ARRAY_OFFSET is slightly less than UINT32_MAX so this
692 code can run on a 32-bit machine and tests can pass on a 32-bit
693 machine. If it was exactly UINT32_MAX, then this code would not
694 compile or run on a 32-bit machine and an #ifdef or some
695 machine size detection would be needed reducing portability.
696 */
Laurence Lundbladed39cd392019-01-11 18:17:38 -0800697 if(uEndPosition >= QCBOR_MAX_ARRAY_OFFSET) {
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800698 me->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
Laurence Lundbladed39cd392019-01-11 18:17:38 -0800699
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800700 } else {
Laurence Lundbladeee851742020-01-08 08:37:05 -0800701 // Increase nesting level because this is a map or array. Cast
702 // from size_t to uin32_t is safe because of check above
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800703 me->uError = Nesting_Increase(&(me->nesting), uMajorType, (uint32_t)uEndPosition);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700704 }
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800705 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700706}
707
Laurence Lundblade59289e52019-12-30 13:44:37 -0800708
Jan Jongboom4a93a662019-07-25 08:44:58 +0200709/*
710 Semi-public function. It is exposed to user of the interface,
711 but they will usually call one of the inline wrappers rather than this.
712
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800713 See qcbor/qcbor_encode.h
Jan Jongboom4a93a662019-07-25 08:44:58 +0200714*/
715void QCBOREncode_OpenMapOrArrayIndefiniteLength(QCBOREncodeContext *me, uint8_t uMajorType)
716{
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000717 // Insert the indefinite length marker (0x9f for arrays, 0xbf for maps)
718 AppendCBORHead(me, uMajorType, 0, 0);
719 // Call the definite-length opener just to do the bookkeeping for
720 // nesting. It will record the position of the opening item in
721 // the encoded output but this is not used when closing this open.
Jan Jongboom4a93a662019-07-25 08:44:58 +0200722 QCBOREncode_OpenMapOrArray(me, uMajorType);
723}
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700724
Laurence Lundbladeee851742020-01-08 08:37:05 -0800725
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700726/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800727 Public functions for closing arrays and maps. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700728 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000729void QCBOREncode_CloseMapOrArray(QCBOREncodeContext *me, uint8_t uMajorType)
Laurence Lundbladea954db92018-09-28 19:27:31 -0700730{
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000731 InsertCBORHead(me, uMajorType, Nesting_GetCount(&(me->nesting)));
732}
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800733
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800734
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000735/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800736 Public functions for closing bstr wrapping. See qcbor/qcbor_encode.h
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000737 */
738void QCBOREncode_CloseBstrWrap2(QCBOREncodeContext *me, bool bIncludeCBORHead, UsefulBufC *pWrappedCBOR)
739{
740 const size_t uInsertPosition = Nesting_GetStartPos(&(me->nesting));
741 const size_t uEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800742
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000743 // This can't go negative because the UsefulOutBuf always only grows
744 // and never shrinks. UsefulOutBut itself also has defenses such that
745 // it won't write where it should not even if given hostile input lengths.
746 const size_t uBstrLen = uEndPosition - uInsertPosition;
747
748 // Actually insert
749 InsertCBORHead(me, CBOR_MAJOR_TYPE_BYTE_STRING, uBstrLen);
750
751 if(pWrappedCBOR) {
752 /*
753 Return pointer and length to the enclosed encoded CBOR. The
754 intended use is for it to be hashed (e.g., SHA-256) in a COSE
755 implementation. This must be used right away, as the pointer
756 and length go invalid on any subsequent calls to this function
757 because there might be calls to InsertEncodedTypeAndNumber()
758 that slides data to the right.
759 */
760 size_t uStartOfNew = uInsertPosition;
761 if(!bIncludeCBORHead) {
762 // Skip over the CBOR head to just get the inserted bstr
763 const size_t uNewEndPosition = UsefulOutBuf_GetEndPosition(&(me->OutBuf));
764 uStartOfNew += uNewEndPosition - uEndPosition;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700765 }
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000766 const UsefulBufC PartialResult = UsefulOutBuf_OutUBuf(&(me->OutBuf));
767 *pWrappedCBOR = UsefulBuf_Tail(PartialResult, uStartOfNew);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700768 }
769}
770
Laurence Lundbladeee851742020-01-08 08:37:05 -0800771
Jan Jongboom4a93a662019-07-25 08:44:58 +0200772/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800773 Public functions for closing arrays and maps. See qcbor/qcbor_encode.h
Jan Jongboom4a93a662019-07-25 08:44:58 +0200774 */
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000775void QCBOREncode_CloseMapOrArrayIndefiniteLength(QCBOREncodeContext *me, uint8_t uMajorType)
Jan Jongboom4a93a662019-07-25 08:44:58 +0200776{
777 if(me->uError == QCBOR_SUCCESS) {
778 if(!Nesting_IsInNest(&(me->nesting))) {
779 me->uError = QCBOR_ERR_TOO_MANY_CLOSES;
780 } else if(Nesting_GetMajorType(&(me->nesting)) != uMajorType) {
781 me->uError = QCBOR_ERR_CLOSE_MISMATCH;
782 } else {
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000783 // Append the break marker (0xff for both arrays and maps)
784 AppendCBORHead(me, CBOR_MAJOR_TYPE_SIMPLE, CBOR_SIMPLE_BREAK, 0);
Jan Jongboom4a93a662019-07-25 08:44:58 +0200785
Jan Jongboom4a93a662019-07-25 08:44:58 +0200786 Nesting_Decrease(&(me->nesting));
787 }
788 }
789}
790
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700791
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700792/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800793 Public functions to finish and get the encoded result. See qcbor/qcbor_encode.h
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700794 */
Laurence Lundblade30816f22018-11-10 13:40:22 +0700795QCBORError QCBOREncode_Finish(QCBOREncodeContext *me, UsefulBufC *pEncodedCBOR)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700796{
Laurence Lundbladef607a2a2019-07-05 21:25:25 -0700797 QCBORError uReturn = QCBOREncode_GetErrorState(me);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800798
Laurence Lundblade067035b2018-11-28 17:35:25 -0800799 if(uReturn != QCBOR_SUCCESS) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700800 goto Done;
Laurence Lundblade067035b2018-11-28 17:35:25 -0800801 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800802
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700803 if (Nesting_IsInNest(&(me->nesting))) {
Laurence Lundblade067035b2018-11-28 17:35:25 -0800804 uReturn = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700805 goto Done;
806 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800807
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700808 *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(me->OutBuf));
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800809
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700810Done:
Laurence Lundblade067035b2018-11-28 17:35:25 -0800811 return uReturn;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700812}
813
Laurence Lundblade0595e932018-11-02 22:22:47 +0700814
Laurence Lundblade067035b2018-11-28 17:35:25 -0800815/*
Laurence Lundblade844bb5c2020-03-01 17:27:25 -0800816 Public functions to finish and get the encoded result. See qcbor/qcbor_encode.h
Laurence Lundblade067035b2018-11-28 17:35:25 -0800817 */
Laurence Lundblade30816f22018-11-10 13:40:22 +0700818QCBORError QCBOREncode_FinishGetSize(QCBOREncodeContext *me, size_t *puEncodedLen)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700819{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700820 UsefulBufC Enc;
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800821
Laurence Lundblade30816f22018-11-10 13:40:22 +0700822 QCBORError nReturn = QCBOREncode_Finish(me, &Enc);
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800823
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700824 if(nReturn == QCBOR_SUCCESS) {
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700825 *puEncodedLen = Enc.len;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700826 }
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800827
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700828 return nReturn;
829}
830
831
Laurence Lundblade067035b2018-11-28 17:35:25 -0800832
833
834/*
Laurence Lundbladec9f0fbc2020-02-07 10:48:33 +0000835Object code sizes on 64-bit x86 with GCC -Os Jan 2020. GCC compiles smaller
836than LLVM and optimizations have been made to decrease code size. Bigfloat,
837Decimal fractions and indefinite length encoding were added to increase code
838size. Bstr wrapping is now separate which means if you don't use it, it gets
839dead stripped.
840
841_QCBOREncode_EncodeHead 187
842_QCBOREncode_CloseBstrWrap2: 154
843_QCBOREncode_AddExponentAndMantissa: 144
844_QCBOREncode_AddBuffer 105
845_QCBOREncode_OpenMapOrArray 101
846_QCBOREncode_CloseMapOrArrayIndefiniteLength: 72
847_QCBOREncode_Finish 71
848_InsertCBORHead.part.0 66
849_QCBOREncode_CloseMapOrArray 64
850_QCBOREncode_AddType7 58
851_QCBOREncode_AddInt64 57
852_AppendCBORHead 54
853_QCBOREncode_AddUInt64 40
854_QCBOREncode_Init 38
855_Nesting_Increment.isra.0 36
856_QCBOREncode_FinishGetSize: 34
857_QCBOREncode_AddDouble: 26
858_QCBOREncode_AddTag: 15
859Total 1322
860Min_encode use case 776
861
862
Laurence Lundblade241705e2018-12-30 18:56:14 -0800863 Object code sizes on X86 with LLVM compiler and -Os (Dec 30, 2018)
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800864
Laurence Lundblade9c097392018-12-30 13:52:24 -0800865 _QCBOREncode_Init 69
Laurence Lundblade067035b2018-11-28 17:35:25 -0800866 _QCBOREncode_AddUInt64 76
867 _QCBOREncode_AddInt64 87
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800868 _QCBOREncode_AddBuffer 113
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800869 _QCBOREncode_AddTag 27
Laurence Lundblade9c097392018-12-30 13:52:24 -0800870 _QCBOREncode_AddType7 87
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800871 _QCBOREncode_AddDouble 36
Laurence Lundblade1ef8b2d2018-12-14 23:13:34 -0800872 _QCBOREncode_OpenMapOrArray 103
Laurence Lundblade067035b2018-11-28 17:35:25 -0800873 _QCBOREncode_CloseMapOrArray 181
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800874 _InsertEncodedTypeAndNumber 190
Laurence Lundblade067035b2018-11-28 17:35:25 -0800875 _QCBOREncode_Finish 72
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800876 _QCBOREncode_FinishGetSize 70
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800877
Laurence Lundbladef970f1d2018-12-14 01:44:23 -0800878 Total is about 1.1KB
Laurence Lundblade2c40ab82018-12-30 14:20:29 -0800879
Laurence Lundblade067035b2018-11-28 17:35:25 -0800880 _QCBOREncode_CloseMapOrArray is larger because it has a lot
881 of nesting tracking to do and much of Nesting_ inlines
882 into it. It probably can't be reduced much.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800883
Laurence Lundblade067035b2018-11-28 17:35:25 -0800884 If the error returned by Nesting_Increment() can be ignored
885 because the limit is so high and the consequence of exceeding
886 is proved to be inconsequential, then a lot of if(me->uError)
887 instance can be removed, saving some code.
Laurence Lundblade3aee3a32018-12-17 16:17:45 -0800888
Laurence Lundblade067035b2018-11-28 17:35:25 -0800889 */