blob: 60e699f0f60e09ad3b8444801f081b91161721ee [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 Lundbladeb69cad72018-09-13 11:09:01 -070079
Laurence Lundbladeb69cad72018-09-13 11:09:01 -070080
81/*...... This is a ruler that is 80 characters long...........................*/
82
83
84// Used internally in the impementation here
85// Must not conflict with any of the official CBOR types
86#define CBOR_MAJOR_NONE_TYPE_RAW 9
87
88
89
90
91
92/*
93 CBOR's two nesting types, arrays and maps, are tracked here. There is a
94 limit of QCBOR_MAX_ARRAY_NESTING to the number of arrays and maps
95 that can be nested in one encoding so the encoding context stays
96 small enough to fit on the stack.
97
98 When an array / map is opened, pCurrentNesting points to the element
99 in pArrays that records the type, start position and accumluates a
100 count of the number of items added. When closed the start position is
101 used to go back and fill in the type and number of items in the array
102 / map.
103
104 Encoded output be just items like ints and strings that are
105 not part of any array / map. That is, the first thing encoded
106 does not have to be an array or a map.
107 */
108inline static void Nesting_Init(QCBORTrackNesting *pNesting)
109{
110 // assumes pNesting has been zeroed
111 pNesting->pCurrentNesting = &pNesting->pArrays[0];
112 // Implied CBOR array at the top nesting level. This is never returned,
113 // but makes the item count work correctly.
114 pNesting->pCurrentNesting->uMajorType = CBOR_MAJOR_TYPE_ARRAY;
115}
116
117inline static int Nesting_Increase(QCBORTrackNesting *pNesting, uint8_t uMajorType, uint32_t uPos, bool bBstWrap)
118{
119 int nReturn = QCBOR_SUCCESS;
120
121 if(pNesting->pCurrentNesting == &pNesting->pArrays[QCBOR_MAX_ARRAY_NESTING]) {
122 // trying to open one too many
123 nReturn = QCBOR_ERR_ARRAY_NESTING_TOO_DEEP;
124 } else {
125 pNesting->pCurrentNesting++;
126 pNesting->pCurrentNesting->uCount = 0;
127 pNesting->pCurrentNesting->uStart = uPos;
128 pNesting->pCurrentNesting->uMajorType = uMajorType;
129 pNesting->pCurrentNesting->bBstrWrap = bBstWrap;
130 }
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
176inline static bool Nesting_IsBstrWrapped(QCBORTrackNesting *pNesting)
177{
178 return pNesting->pCurrentNesting->bBstrWrap;
179}
180
181
182
183/*
184 Error tracking plan -- Errors are tracked internally and not returned
185 until Finish is called. The CBOR errors are in me->uError.
186 UsefulOutBuf also tracks whether the the buffer is full or not in its
187 context. Once either of these errors is set they are never
188 cleared. Only Init() resets them. Or said another way, they must
189 never be cleared or we'll tell the caller all is good when it is not.
190
191 Only one error code is reported by Finish() even if there are
192 multiple errors. The last one set wins. The caller might have to fix
193 one error to reveal the next one they have to fix. This is OK.
194
195 The buffer full error tracked by UsefulBuf is only pulled out of
196 UsefulBuf in Finish() so it is the one that usually wins. UsefulBuf
197 will never go off the end of the buffer even if it is called again
198 and again when full.
199
200 It is really tempting to not check for overflow on the count in the
201 number of items in an array. It would save a lot of code, it is
202 extremely unlikely that any one will every put 65,000 items in an
203 array, and the only bad thing that would happen is the CBOR would be
204 bogus. Once we prove that is the only consequence, then we can make
205 the change.
206
207 Since this does not parse any input, you could in theory remove all
208 error checks in this code if you knew the caller called it
209 correctly. Maybe someday CDDL or some such language will be able to
210 generate the code to call this and the calling code would always be
211 correct. This could also make automatically size some of the data
212 structures like array/map nesting resulting in some good memory
213 savings.
214 */
215
216
217
218
219/*
220 Public function for initialization. See header qcbor.h
221 */
Laurence Lundblade2296db52018-09-14 18:08:39 -0700222void QCBOREncode_Init(QCBOREncodeContext *me, UsefulBuf Storage)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700223{
224 memset(me, 0, sizeof(QCBOREncodeContext));
Laurence Lundblade2296db52018-09-14 18:08:39 -0700225 if(Storage.len > UINT32_MAX) {
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700226 me->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
227 } else {
Laurence Lundblade2296db52018-09-14 18:08:39 -0700228 UsefulOutBuf_Init(&(me->OutBuf), Storage);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700229 Nesting_Init(&(me->nesting));
230 }
231}
232
233
234
235
236/*
237 All CBOR data items have a type and a number. The number is either
238 the value of the item for integer types, the length of the content
239 for string, byte, array and map types, a tag for major type 6, and
240 has serveral uses for major type 7.
241
242 This function encodes the type and the number. There are several
243 encodings for the number depending on how large it is and how it is
244 used.
245
246 Every encoding of the type and number has at least one byte, the
247 "initial byte".
248
249 The top three bits of the initial byte are the major type for the
250 CBOR data item. The eight major types defined by the standard are
251 defined as CBOR_MAJOR_TYPE_xxxx in qcbor.h.
252
253 The remaining five bits, known as "additional information", and
254 possibly more bytes encode the number. If the number is less than 24,
255 then it is encoded entirely in the five bits. This is neat because it
256 allows you to encode an entire CBOR data item in 1 byte for many
257 values and types (integers 0-23, true, false, and tags).
258
259 If the number is larger than 24, then it is encoded in 1,2,4 or 8
260 additional bytes, with the number of these bytes indicated by the
261 values of the 5 bits 24, 25, 25 and 27.
262
263 It is possible to encode a particular number in many ways with this
264 representation. This implementation always uses the smallest
265 possible representation. This is also the suggestion made in the RFC
266 for cannonical CBOR.
267
268 This function inserts them into the output buffer at the specified
269 position. AppendEncodedTypeAndNumber() appends to the end.
270
271 This function takes care of converting to network byte order.
272
273 This function is also used to insert floats and doubles. Before this
274 function is called the float or double must be copied into a
275 uint64_t. That is how they are passed in. They are then converted to
276 network byte order correctly. The uMinLen param makes sure that even
277 if all the digits of a float or double are 0 it is still correctly
278 encoded in 4 or 8 bytes.
279
280 */
281static void InsertEncodedTypeAndNumber(QCBOREncodeContext *me, uint8_t uMajorType, size_t uMinLen, uint64_t uNumber, size_t uPos)
282{
283 // No need to worry about integer overflow here because a) uMajorType is
284 // always generated internally, not by the caller, b) this is for CBOR
285 // _generation_, not parsing c) a mistake will result in bad CBOR generation,
286 // not a security vulnerability.
287 uMajorType <<= 5;
288
289 if(uNumber > 0xffffffff || uMinLen >= 8) {
290 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_EIGHT_BYTES, uPos);
291 UsefulOutBuf_InsertUint64(&(me->OutBuf), (uint64_t)uNumber, uPos+1);
292
293 } else if(uNumber > 0xffff || uMinLen >= 4) {
294 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_FOUR_BYTES, uPos);
295 UsefulOutBuf_InsertUint32(&(me->OutBuf), (uint32_t)uNumber, uPos+1);
296
297 } else if (uNumber > 0xff) {
298 // Between 0 and 65535
299 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_TWO_BYTES, uPos);
300 UsefulOutBuf_InsertUint16(&(me->OutBuf), (uint16_t)uNumber, uPos+1);
301
302 } else if(uNumber >= 24) {
303 // Between 0 and 255, but only between 24 and 255 is ever encoded here
304 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + LEN_IS_ONE_BYTE, uPos);
305 UsefulOutBuf_InsertByte(&(me->OutBuf), (uint8_t)uNumber, uPos+1);
306
307 } else {
308 // Between 0 and 23
309 UsefulOutBuf_InsertByte(&(me->OutBuf), uMajorType + (uint8_t)uNumber, uPos);
310 }
311}
312
313
314/*
315 Append the type and number info to the end of the buffer.
316
317 See InsertEncodedTypeAndNumber() function above for details
318*/
319inline static void AppendEncodedTypeAndNumber(QCBOREncodeContext *me, uint8_t uMajorType, uint64_t uNumber)
320{
321 // An append is an insert at the end.
322 InsertEncodedTypeAndNumber(me, uMajorType, 0, uNumber, UsefulOutBuf_GetEndPosition(&(me->OutBuf)));
323}
324
325
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700326static 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 -0700327
328
329/*
330 Add an optional label and optional tag. It will go in front of a real data item.
331 */
332static void AddLabelAndOptionalTag(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag)
333{
334 if(szLabel) {
335 UsefulBufC SZText = {szLabel, strlen(szLabel)};
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700336 AddBytesInternal(me, NULL, nLabel, CBOR_TAG_NONE, SZText, CBOR_MAJOR_TYPE_TEXT_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700337 } else if (QCBOR_NO_INT_LABEL != nLabel) {
338 // Add an integer label. This is just adding an integer at this point
339 // This will result in a call right back to here, but the call won't do anything
340 // because of the params NULL, QCBOR_NO_INT_LABEL and CBOR_TAG_NONE
341 QCBOREncode_AddInt64_3(me, NULL, QCBOR_NO_INT_LABEL, CBOR_TAG_NONE, nLabel);
342 }
343 if(uTag != CBOR_TAG_NONE) {
344 AppendEncodedTypeAndNumber(me, CBOR_MAJOR_TYPE_OPTIONAL, uTag);
345 }
346}
347
348
349/*
350 Does the work of adding some bytes to the CBOR output. Works for a
351 byte and text strings, which are the same in in CBOR though they have
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700352 different major types. This is also used to insert raw
353 pre-encoded CBOR.
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700354 */
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700355static 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 -0700356{
357 if(Bytes.len >= UINT32_MAX) {
358 // This implementation doesn't allow buffers larger than UINT32_MAX. This is
359 // primarily because QCBORTrackNesting.pArrays[].uStart is an uint32 rather
360 // than size_t to keep the stack usage down. Also it is entirely impractical
361 // to create tokens bigger than 4GB in contiguous RAM
362 me->uError = QCBOR_ERR_BUFFER_TOO_LARGE;
363
364 } else {
365
366 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
367
368 if(!me->uError) {
369
370 // If it is not Raw CBOR, add the type and the length
371 if(uMajorType != CBOR_MAJOR_NONE_TYPE_RAW) {
372 AppendEncodedTypeAndNumber(me, uMajorType, Bytes.len);
373 }
374
375 // Actually add the bytes
376 UsefulOutBuf_AppendUsefulBuf(&(me->OutBuf), Bytes);
377
378 // Update the array counting if there is any nesting at all
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700379 me->uError = Nesting_Increment(&(me->nesting), 1);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700380 }
381 }
382}
383
384
385
386
387/*
388 Public functions for adding strings and raw encoded CBOR. See header qcbor.h
389 */
390void QCBOREncode_AddBytes_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes)
391{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700392 AddBytesInternal(me, szLabel, nLabel, uTag, Bytes, CBOR_MAJOR_TYPE_BYTE_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700393}
394
395void QCBOREncode_AddText_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, UsefulBufC Bytes)
396{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700397 AddBytesInternal(me, szLabel, nLabel, uTag, Bytes, CBOR_MAJOR_TYPE_TEXT_STRING);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700398}
399
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700400void QCBOREncode_AddEncodedToMap_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag, UsefulBufC Encoded)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700401{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700402 AddBytesInternal(me, szLabel, nLabel, uTag, Encoded, CBOR_MAJOR_NONE_TYPE_RAW);
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700403}
404
405
406
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700407/*
408 Internal function common to opening an array or a map
409
410 QCBOR_MAX_ARRAY_NESTING is the number of times Open can be called
411 successfully. Call it one more time gives an error.
412
413 */
414static void OpenMapOrArrayInternal(QCBOREncodeContext *me, uint8_t uMajorType, const char *szLabel, uint64_t nLabel, uint64_t uTag, bool bBstrWrap)
415{
416 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
417
418 if(!me->uError) {
419 // Add one item to the nesting level we are in for the new map or array
420 me->uError = Nesting_Increment(&(me->nesting), 1);
421 if(!me->uError) {
422 // Increase nesting level because this is a map or array
423 // Cast from size_t to uin32_t is safe because the UsefulOutBuf
424 // size is limited to UINT32_MAX in QCBOR_Init().
425 me->uError = Nesting_Increase(&(me->nesting),
426 uMajorType, (uint32_t)UsefulOutBuf_GetEndPosition(&(me->OutBuf)),
427 bBstrWrap);
428 }
429 }
430}
431
432
433/*
434 Public functions for opening / closing arrays and maps. See header qcbor.h
435 */
436void QCBOREncode_OpenArray_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag, bool bBstrWrap)
437{
438 OpenMapOrArrayInternal(me, CBOR_MAJOR_TYPE_ARRAY, szLabel, nLabel, uTag, bBstrWrap);
439}
440
441void QCBOREncode_OpenMap_3(QCBOREncodeContext *me, const char *szLabel, uint64_t nLabel, uint64_t uTag, uint8_t bBstrWrap)
442{
443 OpenMapOrArrayInternal(me, CBOR_MAJOR_TYPE_MAP, szLabel, nLabel, uTag, bBstrWrap);
444}
445
446void QCBOREncode_CloseArray(QCBOREncodeContext *me)
447{
448 if(!Nesting_IsInNest(&(me->nesting))) {
449 me->uError = QCBOR_ERR_TOO_MANY_CLOSES;
450
451 } else {
452 // When the array was opened, nothing was done except note the position
453 // of the start of the array. This code goes back and inserts the type
454 // (array or map) and length. That means all the data in the array or map
455 // and any nested arrays or maps have to be slid right. This is done
456 // by UsefulOutBuf's insert function that is called from inside
457 // InsertEncodedTypeAndNumber()
458
459 const uint32_t uInsertPosition = Nesting_GetStartPos(&(me->nesting));
460
461 InsertEncodedTypeAndNumber(me,
462 Nesting_GetMajorType(&(me->nesting)), // the major type (array or map)
463 0, // no minimum length for encoding
464 Nesting_GetCount(&(me->nesting)), // number of items in array or map
465 uInsertPosition); // position in output buffer
466
467 if(Nesting_IsBstrWrapped(&(me->nesting))) {
468 // This map or array is to be wrapped in a byte string. This is typically because
469 // the data is to be hashed or cryprographically signed. This is what COSE
470 // signing does.
471
472 // Cast from size_t to uin32_t is safe because the UsefulOutBuf
473 // size is limited to UINT32_MAX in QCBOR_Init().
474 uint32_t uLenOfEncodedMapOrArray = (uint32_t)UsefulOutBuf_GetEndPosition(&(me->OutBuf)) - uInsertPosition;
475
476 // Insert the bstring wrapping
477 InsertEncodedTypeAndNumber(me,
478 CBOR_MAJOR_TYPE_BYTE_STRING, // major type bstring
479 0, // no minimum length for encoding
480 uLenOfEncodedMapOrArray, // length of the map
481 uInsertPosition); // position in out buffer
482 }
483
484 Nesting_Decrease(&(me->nesting));
485 }
486}
487
488
489
490
491/*
492 Internal function for adding positive and negative integers of all different sizes
493 */
494static void AddUInt64Internal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uMajorType, uint64_t n)
495{
496 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
497 if(!me->uError) {
498 AppendEncodedTypeAndNumber(me, uMajorType, n);
499 me->uError = Nesting_Increment(&(me->nesting), 1);
500 }
501}
502
503
504/*
505 Public functions for adding integers. See header qcbor.h
506 */
507void QCBOREncode_AddUInt64_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint64_t uNum)
508{
509 AddUInt64Internal(me, szLabel, nLabel, uTag, CBOR_MAJOR_TYPE_POSITIVE_INT, uNum);
510}
511
512void QCBOREncode_AddInt64_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, int64_t nNum)
513{
514 uint8_t uMajorType;
515 uint64_t uValue;
516
517 // Handle CBOR's particular format for positive and negative integers
518 if(nNum < 0) {
519 uValue = (uint64_t)(-nNum - 1); // This is the way negative ints work in CBOR. -1 encodes as 0x00 with major type negative int.
520 uMajorType = CBOR_MAJOR_TYPE_NEGATIVE_INT;
521 } else {
522 uValue = (uint64_t)nNum;
523 uMajorType = CBOR_MAJOR_TYPE_POSITIVE_INT;
524 }
525 AddUInt64Internal(me, szLabel, nLabel, uTag, uMajorType, uValue);
526}
527
528
529
530
531/*
532 Common code for adding floats and doubles and simple types like true and false
533
534 One way to look at simple values is that they are:
535 - type 7
536 - an additional integer from 0 to 255
537 - additional integer 0-19 are unassigned and could be used in an update to CBOR
538 - additional integers 20, 21, 22 and 23 are false, true, null and undef
539 - additional integer 24 is not available
540 - when the additional value is 25, 26, or 27 there is additionally a half, float or double in following bytes
541 - additional integers 28, 29 and 30 are unassigned / reserved
542 - additional integer 31 is a "break"
543 - additional integers 32-255 are unassigned and could be used in an update to CBOR
544 */
545static void AddSimpleInternal(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, size_t uSize, uint64_t uNum)
546{
547 AddLabelAndOptionalTag(me, szLabel, nLabel, uTag);
548 if(!me->uError) {
549 // This function call takes care of endian swapping for the float / double
550 InsertEncodedTypeAndNumber(me,
551 CBOR_MAJOR_TYPE_SIMPLE, // The major type for floats and doubles
552 uSize, // min size / tells encoder to do it right
553 uNum, // Bytes of the floating point number as a uint
554 UsefulOutBuf_GetEndPosition(&(me->OutBuf))); // end position for append
555
556 me->uError = Nesting_Increment(&(me->nesting), 1);
557 }
558}
559
560
561/*
562 Public function for adding simple values. See header qcbor.h
563 */
564void QCBOREncode_AddRawSimple_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uSimple)
565{
566 AddSimpleInternal(me, szLabel, nLabel, uTag, 0, uSimple);
567}
568
569
570/*
571 Public function for adding simple values. See header qcbor.h
572 */
573void QCBOREncode_AddSimple_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, uint8_t uSimple)
574{
575 if(uSimple < CBOR_SIMPLEV_FALSE || uSimple > CBOR_SIMPLEV_UNDEF) {
576 me->uError = QCBOR_ERR_BAD_SIMPLE;
577 } else {
578 QCBOREncode_AddRawSimple_3(me, szLabel, nLabel, uTag, uSimple);
579 }
580}
581
582
583/*
584 Public functions for floating point numbers. See header qcbor.h
585 */
586void QCBOREncode_AddFloat_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, float fNum)
587{
588 // Convert the *type* of the data from a float to a uint so the
589 // standard integer encoding can work. This takes advantage
590 // of CBOR's indicator for a float being the same as for a 4
591 // byte integer too.
592 const float *pfNum = &fNum;
593 const uint32_t uNum = *(uint32_t *)pfNum;
594
595 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(float), uNum);
596}
597
598void QCBOREncode_AddDouble_3(QCBOREncodeContext *me, const char *szLabel, int64_t nLabel, uint64_t uTag, double dNum)
599{
600 // see how it is done for floats above
601 const double *pdNum = &dNum;
602 const uint64_t uNum = *(uint64_t *)pdNum;
603
604 AddSimpleInternal(me, szLabel, nLabel, uTag, sizeof(double), uNum);
605}
606
607
608
609
610/*
611 Public functions to finish and get the encoded result. See header qcbor.h
612 */
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700613int QCBOREncode_Finish2(QCBOREncodeContext *me, UsefulBufC *pEncodedCBOR)
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700614{
615 if(me->uError)
616 goto Done;
617
618 if (Nesting_IsInNest(&(me->nesting))) {
619 me->uError = QCBOR_ERR_ARRAY_OR_MAP_STILL_OPEN;
620 goto Done;
621 }
622
623 if(UsefulOutBuf_GetError(&(me->OutBuf))) {
624 // Stuff didn't fit in the buffer.
625 // This check catches this condition for all the appends and inserts so checks aren't needed
626 // when the appends and inserts are performed. And of course UsefulBuf will never
627 // overrun the input buffer given to it. No complex analysis of the error handling
628 // in this file is needed to know that is true. Just read the UsefulBuf code.
629 me->uError = QCBOR_ERR_BUFFER_TOO_SMALL;
630 goto Done;
631 }
Laurence Lundblade2296db52018-09-14 18:08:39 -0700632
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700633 *pEncodedCBOR = UsefulOutBuf_OutUBuf(&(me->OutBuf));
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700634
635Done:
636 return me->uError;
637}
638
639int QCBOREncode_Finish(QCBOREncodeContext *me, size_t *puEncodedLen)
640{
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700641 UsefulBufC Enc;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700642
643 int nReturn = QCBOREncode_Finish2(me, &Enc);
644
645 if(nReturn == QCBOR_SUCCESS) {
Laurence Lundbladeda3f0822018-09-18 19:49:02 -0700646 *puEncodedLen = Enc.len;
Laurence Lundbladeb69cad72018-09-13 11:09:01 -0700647 }
648
649 return nReturn;
650}
651
652