blob: ece04e42c1599036edd28369ac30bd2ef04ec834 [file] [log] [blame]
Laurence Lundbladeb69cad72018-09-13 11:09:01 -07001/*==============================================================================
2Copyright (c) 2016-2018, The Linux Foundation. All rights reserved.
3
4Redistribution and use in source and binary forms, with or without
5modification, are permitted provided that the following conditions are
6met:
7 * Redistributions of source code must retain the above copyright
8 notice, this list of conditions and the following disclaimer.
9 * Redistributions in binary form must reproduce the above
10 copyright notice, this list of conditions and the following
11 disclaimer in the documentation and/or other materials provided
12 with the distribution.
13 * Neither the name of The Linux Foundation nor the names of its
14 contributors may be used to endorse or promote products derived
15 from this software without specific prior written permission.
16
17THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
18WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
20ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
21BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
24BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
26OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
27IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28==============================================================================*/
29
Laurence Lundblade624405d2018-09-18 20:10:47 -070030/*==============================================================================
31 Modifications beyond the version released on CAF are under the MIT license:
32
33 Copyright 2018 Laurence Lundblade
34
35 Permission is hereby granted, free of charge, to any person obtaining
36 a copy of this software and associated documentation files (the
37 "Software"), to deal in the Software without restriction, including
38 without limitation the rights to use, copy, modify, merge, publish,
39 distribute, sublicense, and/or sell copies of the Software, and to
40 permit persons to whom the Software is furnished to do so, subject to
41 the following conditions:
42
43 The above copyright notice and this permission notice shall be included
44 in all copies or substantial portions of the Software.
45
46 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
47 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
48 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
49 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
50 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
51 ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
52 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
53 SOFTWARE.
54 ==============================================================================*/
55
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070056/*===================================================================================
57 FILE: qcbor_encode.c
58
59 DESCRIPTION: This file contains the implementation of QCBOR.
60
61 EDIT HISTORY FOR FILE:
62
63 This section contains comments describing changes made to the module.
64 Notice that changes are listed in reverse chronological order.
65
66 when who what, where, why
67 -------- ---- ---------------------------------------------------
68 02/05/18 llundbla Works on CPUs which require integer alignment.
69 Requires new version of UsefulBuf.
70 07/05/17 llundbla Add bstr wrapping of maps/arrays for COSE
71 03/01/17 llundbla More data types
72 11/13/16 llundbla Integrate most TZ changes back into github version.
73 09/30/16 gkanike Porting to TZ.
74 03/15/16 llundbla Initial Version.
75
76 =====================================================================================*/
77
78#include "qcbor.h"
Laurence Lundblade12d32c52018-09-19 11:25:27 -070079#include "ieee754.h"
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070080
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070081
82/*...... This is a ruler that is 80 characters long...........................*/
83
84
85// Used internally in the impementation here
86// Must not conflict with any of the official CBOR types
87#define CBOR_MAJOR_NONE_TYPE_RAW 9
88
89
90
91
92
93/*
94 CBOR's two nesting types, arrays and maps, are tracked here. There is a
95 limit of QCBOR_MAX_ARRAY_NESTING to the number of arrays and maps
96 that can be nested in one encoding so the encoding context stays
97 small enough to fit on the stack.
98
99 When an array / map is opened, pCurrentNesting points to the element
100 in pArrays that records the type, start position and accumluates a
101 count of the number of items added. When closed the start position is
102 used to go back and fill in the type and number of items in the array
103 / map.
104
105 Encoded output be just items like ints and strings that are
106 not part of any array / map. That is, the first thing encoded
107 does not have to be an array or a map.
108 */
109inline static void Nesting_Init(QCBORTrackNesting *pNesting)
110{
111 // assumes pNesting has been zeroed
112 pNesting->pCurrentNesting = &pNesting->pArrays[0];
113 // Implied CBOR array at the top nesting level. This is never returned,
114 // but makes the item count work correctly.
115 pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY;
116}
117
Laurence Lundbladea954db92018-09-28 19:27:31 -0700118inline static int Nesting_Increase(QCBORTrackNesting *pNesting, uint8_t uMajorType, uint32_t uPos)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700119{
120 int nReturn = QCBOR_SUCCESS;
121
122 if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) {
123 // trying to open one too many
124 nReturn = QCBOR_ERR_ARRAY_NESTING_TOO_DEEP;
125 } else {
126 pNesting->pCurrentNesting++;
127 pNesting->pCurrentNesting->uCount = 0;
128 pNesting->pCurrentNesting->uStart = uPos;
129 pNesting->pCurrentNesting->uMajorType = uMajorType;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700130 }
131 return nReturn;
132}
133
134inline static void Nesting_Decrease(QCBORTrackNesting *pNesting)
135{
136 pNesting->pCurrentNesting--;
137}
138
139inline static int Nesting_Increment(QCBORTrackNesting *pNesting, uint16_t uAmount)
140{
141 if(uAmount >= QCBOR_MAX_ITEMS_IN_ARRAY - pNesting->pCurrentNesting->uCount) {
142 return QCBOR_ERR_ARRAY_TOO_LONG;
143 }
144
145 pNesting->pCurrentNesting->uCount += uAmount;
146 return QCBOR_SUCCESS;
147}
148
149inline static uint16_t Nesting_GetCount(QCBORTrackNesting *pNesting)
150{
151 // The nesting count recorded is always the actual number of individiual
152 // data items in the array or map. For arrays CBOR uses the actual item
153 // count. For maps, CBOR uses the number of pairs. This function returns
154 // the number needed for the CBOR encoding, so it divides the number of
155 // items by two for maps to get the number of pairs. This implementation
156 // takes advantage of the map major type being one larger the array major
157 // type, hence the subtraction returns either 1 or 2.
158 return pNesting->pCurrentNesting->uCount / (pNesting->pCurrentNesting->uMajorType - CBOR_MAJOR_TYPE_ARRAY+1);
159}
160
161inline static uint32_t Nesting_GetStartPos(QCBORTrackNesting *pNesting)
162{
163 return pNesting->pCurrentNesting->uStart;
164}
165
166inline static uint8_t Nesting_GetMajorType(QCBORTrackNesting *pNesting)
167{
168 return pNesting->pCurrentNesting->uMajorType;
169}
170
171inline static int Nesting_IsInNest(QCBORTrackNesting *pNesting)
172{
173 return pNesting->pCurrentNesting == &pNesting->pArrays[0] ? 0 : 1;
174}
175
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700176
177
178
179/*
180 Error tracking plan -- Errors are tracked internally and not returned
181 until Finish is called. The CBOR errors are in me->uError.
182 UsefulOutBuf also tracks whether the the buffer is full or not in its
183 context. Once either of these errors is set they are never
184 cleared. Only Init() resets them. Or said another way, they must
185 never be cleared or we'll tell the caller all is good when it is not.
186
187 Only one error code is reported by Finish() even if there are
188 multiple errors. The last one set wins. The caller might have to fix
189 one error to reveal the next one they have to fix. This is OK.
190
191 The buffer full error tracked by UsefulBuf is only pulled out of
192 UsefulBuf in Finish() so it is the one that usually wins. UsefulBuf
193 will never go off the end of the buffer even if it is called again
194 and again when full.
195
196 It is really tempting to not check for overflow on the count in the
197 number of items in an array. It would save a lot of code, it is
198 extremely unlikely that any one will every put 65,000 items in an
199 array, and the only bad thing that would happen is the CBOR would be
200 bogus. Once we prove that is the only consequence, then we can make
201 the change.
202
203 Since this does not parse any input, you could in theory remove all
204 error checks in this code if you knew the caller called it
205 correctly. Maybe someday CDDL or some such language will be able to
206 generate the code to call this and the calling code would always be
207 correct. This could also make automatically size some of the data
208 structures like array/map nesting resulting in some good memory
209 savings.
210 */
211
212
213
214
215/*
216 Public function for initialization. See header qcbor.h
217 */
Laurence Lundblade2296db52018-09-14 18:08:39 -0700218void QCBOREncode_Init(QCBOREncodeContext *me, UsefulBuf Storage)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700219{
220 memset(me, 0, sizeof(QCBOREncodeContext));
Laurence Lundblade2296db52018-09-14 18:08:39 -0700221 if(Storage.len > UINT32_MAX) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700222 me->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
223 } else {
Laurence Lundblade2296db52018-09-14 18:08:39 -0700224 UsefulOutBuf_Init(&(me->OutBuf), Storage);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700225 Nesting_Init(&(me->nesting));
226 }
227}
228
229
230
231
232/*
233 All CBOR data items have a type and a number. The number is either
234 the value of the item for integer types, the length of the content
235 for string, byte, array and map types, a tag for major type 6, and
236 has serveral uses for major type 7.
237
238 This function encodes the type and the number. There are several
239 encodings for the number depending on how large it is and how it is
240 used.
241
242 Every encoding of the type and number has at least one byte, the
243 "initial byte".
244
245 The top three bits of the initial byte are the major type for the
246 CBOR data item. The eight major types defined by the standard are
247 defined as CBOR_MAJOR_TYPE_xxxx in qcbor.h.
248
249 The remaining five bits, known as "additional information", and
250 possibly more bytes encode the number. If the number is less than 24,
251 then it is encoded entirely in the five bits. This is neat because it
252 allows you to encode an entire CBOR data item in 1 byte for many
253 values and types (integers 0-23, true, false, and tags).
254
255 If the number is larger than 24, then it is encoded in 1,2,4 or 8
256 additional bytes, with the number of these bytes indicated by the
257 values of the 5 bits 24, 25, 25 and 27.
258
259 It is possible to encode a particular number in many ways with this
260 representation. This implementation always uses the smallest
261 possible representation. This is also the suggestion made in the RFC
262 for cannonical CBOR.
263
264 This function inserts them into the output buffer at the specified
265 position. AppendEncodedTypeAndNumber() appends to the end.
266
267 This function takes care of converting to network byte order.
268
269 This function is also used to insert floats and doubles. Before this
270 function is called the float or double must be copied into a
271 uint64_t. That is how they are passed in. They are then converted to
272 network byte order correctly. The uMinLen param makes sure that even
273 if all the digits of a float or double are 0 it is still correctly
274 encoded in 4 or 8 bytes.
275
276 */
277static void InsertEncodedTypeAndNumber(QCBOREncodeContext *me, uint8_t uMajorType, size_t uMinLen, uint64_t uNumber, size_t uPos)
278{
279 // No need to worry about integer overflow here because a) uMajorType is
280 // always generated internally, not by the caller, b) this is for CBOR
281 // _generation_, not parsing c) a mistake will result in bad CBOR generation,
282 // not a security vulnerability.
Laurence Lundbladed711fb22018-09-26 14:35:22 -0700283 uMajorType <<= 5; // TODO: make this a constant
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700284
285 if(uNumber > 0xffffffff || uMinLen >= 8) {
286 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_EIGHT_BYTES, uPos);
287 UsefulOutBuf_InsertUint64(&(me->OutBuf), (uint64_t)uNumber, uPos+1);
288
289 } else if(uNumber > 0xffff || uMinLen >= 4) {
290 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_FOUR_BYTES, uPos);
291 UsefulOutBuf_InsertUint32(&(me->OutBuf), (uint32_t)uNumber, uPos+1);
292
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700293 } else if (uNumber > 0xff || uMinLen>= 2) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700294 // Between 0 and 65535
295 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_TWO_BYTES, uPos);
296 UsefulOutBuf_InsertUint16(&(me->OutBuf), (uint16_t)uNumber, uPos+1);
297
298 } else if(uNumber >= 24) {
299 // Between 0 and 255, but only between 24 and 255 is ever encoded here
300 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_ONE_BYTE, uPos);
301 UsefulOutBuf_InsertByte(&(me->OutBuf), (uint8_t)uNumber, uPos+1);
302
303 } else {
304 // Between 0 and 23
305 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + (uint8_t)uNumber, uPos);
306 }
307}
308
309
310/*
311 Append the type and number info to the end of the buffer.
312
313 See InsertEncodedTypeAndNumber() function above for details
314*/
315inline static void AppendEncodedTypeAndNumber(QCBOREncodeContext *me, uint8_t uMajorType, uint64_t uNumber)
316{
317 // An append is an insert at the end.
318 InsertEncodedTypeAndNumber(me, uMajorType, 0, uNumber, UsefulOutBuf_GetEndPosition(&(me->OutBuf)));
319}
320
321
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700322static void AddBytesInternal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes, uint8_t uMajorType);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700323
324
325/*
326 Add an optional label and optional tag. It will go in front of a real data item.
327 */
328static void AddLabelAndOptionalTag(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag)
329{
330 if(szLabel) {
331 UsefulBufC SZText = {szLabel, strlen(szLabel)};
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700332 AddBytesInternal(me, NULL, nLabel, CBOR_TAG_NONE, SZText, CBOR_MAJOR_TYPE_TEXT_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700333 } else if (QCBOR_NO_INT_LABEL != nLabel) {
334 // Add an integer label. This is just adding an integer at this point
335 // This will result in a call right back to here, but the call won't do anything
336 // because of the params NULL, QCBOR_NO_INT_LABEL and CBOR_TAG_NONE
337 QCBOREncode_AddInt64_3(me, NULL, QCBOR_NO_INT_LABEL, CBOR_TAG_NONE, nLabel);
338 }
339 if(uTag != CBOR_TAG_NONE) {
340 AppendEncodedTypeAndNumber(me, CBOR_MAJOR_TYPE_OPTIONAL, uTag);
341 }
342}
343
344
345/*
346 Does the work of adding some bytes to the CBOR output. Works for a
347 byte and text strings, which are the same in in CBOR though they have
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700348 different major types. This is also used to insert raw
349 pre-encoded CBOR.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700350 */
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700351static void AddBytesInternal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes, uint8_t uMajorType)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700352{
353 if(Bytes.len >= UINT32_MAX) {
354 // This implementation doesn't allow buffers larger than UINT32_MAX. This is
355 // primarily because QCBORTrackNesting.pArrays[].uStart is an uint32 rather
356 // than size_t to keep the stack usage down. Also it is entirely impractical
357 // to create tokens bigger than 4GB in contiguous RAM
358 me->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
359
360 } else {
361
362 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
363
364 if(!me->uError) {
365
366 // If it is not Raw CBOR, add the type and the length
367 if(uMajorType != CBOR_MAJOR_NONE_TYPE_RAW) {
368 AppendEncodedTypeAndNumber(me, uMajorType, Bytes.len);
369 }
370
371 // Actually add the bytes
372 UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), Bytes);
373
374 // Update the array counting if there is any nesting at all
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700375 me->uError = Nesting_Increment(&(me->nesting), 1);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700376 }
377 }
378}
379
380
381
382
383/*
384 Public functions for adding strings and raw encoded CBOR. See header qcbor.h
385 */
386void QCBOREncode_AddBytes_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes)
387{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700388 AddBytesInternal(me, szLabel, nLabel, uTag, Bytes, CBOR_MAJOR_TYPE_BYTE_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700389}
390
391void QCBOREncode_AddText_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes)
392{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700393 AddBytesInternal(me, szLabel, nLabel, uTag, Bytes, CBOR_MAJOR_TYPE_TEXT_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700394}
395
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700396void QCBOREncode_AddEncodedToMap_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag, UsefulBufC Encoded)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700397{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700398 AddBytesInternal(me, szLabel, nLabel, uTag, Encoded, CBOR_MAJOR_NONE_TYPE_RAW);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700399}
400
401
402
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700403/*
404 Internal function common to opening an array or a map
405
406 QCBOR_MAX_ARRAY_NESTING is the number of times Open can be called
407 successfully. Call it one more time gives an error.
408
409 */
Laurence Lundbladea954db92018-09-28 19:27:31 -0700410static void OpenMapOrArrayInternal(QCBOREncodeContext *me, uint8_t uMajorType, const char *szLabel, uint64_t nLabel, uint64_t uTag)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700411{
412 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
413
414 if(!me->uError) {
415 // Add one item to the nesting level we are in for the new map or array
416 me->uError = Nesting_Increment(&(me->nesting), 1);
417 if(!me->uError) {
418 // Increase nesting level because this is a map or array
419 // Cast from size_t to uin32_t is safe because the UsefulOutBuf
420 // size is limited to UINT32_MAX in QCBOR_Init().
Laurence Lundbladea954db92018-09-28 19:27:31 -0700421 me->uError = Nesting_Increase(&(me->nesting), uMajorType, (uint32_t)UsefulOutBuf_GetEndPosition(&(me->OutBuf)));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700422 }
423 }
424}
425
426
427/*
428 Public functions for opening / closing arrays and maps. See header qcbor.h
429 */
Laurence Lundbladea954db92018-09-28 19:27:31 -0700430void QCBOREncode_OpenArray_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700431{
Laurence Lundbladea954db92018-09-28 19:27:31 -0700432 OpenMapOrArrayInternal(me, CBOR_MAJOR_TYPE_ARRAY, szLabel, nLabel, uTag);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700433}
434
Laurence Lundbladea954db92018-09-28 19:27:31 -0700435void QCBOREncode_OpenMap_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700436{
Laurence Lundbladea954db92018-09-28 19:27:31 -0700437 OpenMapOrArrayInternal(me, CBOR_MAJOR_TYPE_MAP, szLabel, nLabel, uTag);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700438}
439
Laurence Lundbladea954db92018-09-28 19:27:31 -0700440void QCBOREncode_OpenBstrWrap_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700441{
Laurence Lundbladea954db92018-09-28 19:27:31 -0700442 OpenMapOrArrayInternal(me, CBOR_MAJOR_TYPE_BYTE_STRING, szLabel, nLabel, uTag);
443}
444
445void QCBOREncode_Close(QCBOREncodeContext *me, uint8_t uMajorType, UsefulBufC *pWrappedCBOR)
446{
447 if(!me->uError) {
448 if(!Nesting_IsInNest(&(me->nesting))) {
449 me->uError = QCBOR_ERR_TOO_MANY_CLOSES;
450 } else if( Nesting_GetMajorType(&(me->nesting)) != uMajorType) {
451 me->uError = QCBOR_ERR_CLOSE_MISMATCH;
452 } else {
453 const uint32_t uInsertPosition = Nesting_GetStartPos(&(me->nesting));
454 // When the array, map or bstr wrap was started, nothing was done except
455 // note the position of the start of it. This code goes back and inserts
456 // the actual CBOR array, map or bstr and its length. That means all the
457 // data that is in the array, map or wrapped needs to be slid to the
458 // right. This is done by UsefulOutBuf's insert function that is called
459 // from inside InsertEncodedTypeAndNumber()
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700460
461 // Cast from size_t to uin32_t is safe because the UsefulOutBuf
462 // size is limited to UINT32_MAX in QCBOR_Init().
Laurence Lundbladea954db92018-09-28 19:27:31 -0700463 const uint32_t uEndPosition = (uint32_t)UsefulOutBuf_GetEndPosition(&(me->OutBuf));
464 const uint32_t uLenOfEncodedMapOrArray = uEndPosition - uInsertPosition;
465
466 // Length is number of bytes for a bstr and number of items for map & array
467 const uint32_t uLength = uMajorType == CBOR_MAJOR_TYPE_BYTE_STRING ?
468 uLenOfEncodedMapOrArray : Nesting_GetCount(&(me->nesting));
469
470 // Actually insert
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700471 InsertEncodedTypeAndNumber(me,
Laurence Lundbladea954db92018-09-28 19:27:31 -0700472 uMajorType, // major type bstr, array or map
473 0, // no minimum length for encoding
474 uLength, // either len of bstr or num items in array or map
475 uInsertPosition); // position in out buffer
476
477 // Return pointer and length to the enclosed encoded CBOR. The intended
478 // use is for it to be hashed (e.g., SHA-256) in a COSE implementation.
479 // This must be used right away, as the pointer and length go invalid
480 // on any subsequent calls to this function because of the
481 // InsertEncodedTypeAndNumber() call that slides data to the right.
482 if(pWrappedCBOR) {
483 UsefulBufC PartialResult = UsefulOutBuf_OutUBuf(&(me->OutBuf));
484 uint32_t uBstrLen = (uint32_t)UsefulOutBuf_GetEndPosition(&(me->OutBuf)) - uEndPosition;
485 *pWrappedCBOR = UsefulBuf_Tail(PartialResult, uInsertPosition+uBstrLen);
486 }
487 Nesting_Decrease(&(me->nesting));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700488 }
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700489 }
490}
491
492
493
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700494/*
495 Internal function for adding positive and negative integers of all different sizes
496 */
497static void AddUInt64Internal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uMajorType, uint64_t n)
498{
499 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
500 if(!me->uError) {
501 AppendEncodedTypeAndNumber(me, uMajorType, n);
502 me->uError = Nesting_Increment(&(me->nesting), 1);
503 }
504}
505
506
507/*
508 Public functions for adding integers. See header qcbor.h
509 */
510void QCBOREncode_AddUInt64_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint64_t uNum)
511{
512 AddUInt64Internal(me, szLabel, nLabel, uTag, CBOR_MAJOR_TYPE_POSITIVE_INT, uNum);
513}
514
515void QCBOREncode_AddInt64_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, int64_t nNum)
516{
517 uint8_t uMajorType;
518 uint64_t uValue;
519
520 // Handle CBOR's particular format for positive and negative integers
521 if(nNum < 0) {
522 uValue = (uint64_t)(-nNum - 1); // This is the way negative ints work in CBOR. -1 encodes as 0x00 with major type negative int.
523 uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT;
524 } else {
525 uValue = (uint64_t)nNum;
526 uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT;
527 }
528 AddUInt64Internal(me, szLabel, nLabel, uTag, uMajorType, uValue);
529}
530
531
532
533
534/*
535 Common code for adding floats and doubles and simple types like true and false
536
537 One way to look at simple values is that they are:
538 - type 7
539 - an additional integer from 0 to 255
540 - additional integer 0-19 are unassigned and could be used in an update to CBOR
541 - additional integers 20, 21, 22 and 23 are false, true, null and undef
542 - additional integer 24 is not available
543 - when the additional value is 25, 26, or 27 there is additionally a half, float or double in following bytes
544 - additional integers 28, 29 and 30 are unassigned / reserved
545 - additional integer 31 is a "break"
546 - additional integers 32-255 are unassigned and could be used in an update to CBOR
547 */
548static void AddSimpleInternal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, size_t uSize, uint64_t uNum)
549{
550 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
551 if(!me->uError) {
552 // This function call takes care of endian swapping for the float / double
553 InsertEncodedTypeAndNumber(me,
554 CBOR_MAJOR_TYPE_SIMPLE, // The major type for floats and doubles
555 uSize, // min size / tells encoder to do it right
556 uNum, // Bytes of the floating point number as a uint
557 UsefulOutBuf_GetEndPosition(&(me->OutBuf))); // end position for append
558
559 me->uError = Nesting_Increment(&(me->nesting), 1);
560 }
561}
562
563
564/*
565 Public function for adding simple values. See header qcbor.h
566 */
567void QCBOREncode_AddRawSimple_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uSimple)
568{
569 AddSimpleInternal(me, szLabel, nLabel, uTag, 0, uSimple);
570}
571
572
573/*
574 Public function for adding simple values. See header qcbor.h
575 */
576void QCBOREncode_AddSimple_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uSimple)
577{
578 if(uSimple < CBOR_SIMPLEV_FALSE || uSimple > CBOR_SIMPLEV_UNDEF) {
579 me->uError = QCBOR_ERR_BAD_SIMPLE;
580 } else {
581 QCBOREncode_AddRawSimple_3(me, szLabel, nLabel, uTag, uSimple);
582 }
583}
584
585
586/*
587 Public functions for floating point numbers. See header qcbor.h
588 */
589void QCBOREncode_AddFloat_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, float fNum)
590{
591 // Convert the *type* of the data from a float to a uint so the
592 // standard integer encoding can work. This takes advantage
593 // of CBOR's indicator for a float being the same as for a 4
594 // byte integer too.
595 const float *pfNum = &fNum;
596 const uint32_t uNum = *(uint32_t *)pfNum;
597
598 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(float), uNum);
599}
600
601void QCBOREncode_AddDouble_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, double dNum)
602{
603 // see how it is done for floats above
604 const double *pdNum = &dNum;
605 const uint64_t uNum = *(uint64_t *)pdNum;
606
607 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(double), uNum);
608}
609
Laurence Lundblade12d32c52018-09-19 11:25:27 -0700610void QCBOREncode_AddFloatAsHalf_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, float fNum)
611{
612 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(uint16_t), IEEE754_FloatToHalf(fNum));
613}
614
615static void QCBOREncode_AddFUnionAsSmallest_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, IEEE754_union uNum)
616{
617 switch(uNum.uTag) {
618 case IEEE754_UNION_IS_HALF:
619 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(uint16_t), uNum.u16);
620 break;
621 case IEEE754_UNION_IS_SINGLE:
622 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(uint32_t), uNum.u32);
623 break;
624 case IEEE754_UNION_IS_DOUBLE:
625 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(uint64_t), uNum.u64);
626 break;
627 }
628}
629
630void QCBOREncode_AddFloatAsSmallest_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, float fNum)
631{
632 QCBOREncode_AddFUnionAsSmallest_3(me, szLabel, nLabel, uTag, IEEE754_FloatToSmallest(fNum));
633}
634
635void QCBOREncode_AddDoubleAsSmallest_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, double dNum)
636{
637 QCBOREncode_AddFUnionAsSmallest_3(me, szLabel, nLabel, uTag, IEEE754_DoubleToSmallest(dNum));
638}
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700639
640
641
642/*
643 Public functions to finish and get the encoded result. See header qcbor.h
644 */
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700645int QCBOREncode_Finish2(QCBOREncodeContext *me, UsefulBufC *pEncodedCBOR)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700646{
647 if(me->uError)
648 goto Done;
649
650 if (Nesting_IsInNest(&(me->nesting))) {
651 me->uError = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
652 goto Done;
653 }
654
655 if(UsefulOutBuf_GetError(&(me->OutBuf))) {
656 // Stuff didn't fit in the buffer.
657 // This check catches this condition for all the appends and inserts so checks aren't needed
658 // when the appends and inserts are performed. And of course UsefulBuf will never
659 // overrun the input buffer given to it. No complex analysis of the error handling
660 // in this file is needed to know that is true. Just read the UsefulBuf code.
661 me->uError = QCBOR_ERR_BUFFER_TOO_SMALL;
662 goto Done;
663 }
Laurence Lundblade2296db52018-09-14 18:08:39 -0700664
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700665 *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(me->OutBuf));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700666
667Done:
668 return me->uError;
669}
670
671int QCBOREncode_Finish(QCBOREncodeContext *me, size_t *puEncodedLen)
672{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700673 UsefulBufC Enc;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700674
675 int nReturn = QCBOREncode_Finish2(me, &Enc);
676
677 if(nReturn == QCBOR_SUCCESS) {
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700678 *puEncodedLen = Enc.len;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700679 }
680
681 return nReturn;
682}
683
684