Prepare for a1 release of v2
3 files changed
tree: de3f3953f6e2d174dc4d9426061362348220ca1b
  1. .github/
  2. doc/
  3. doxygen/
  4. inc/
  5. pkg/
  6. QCBOR.xcodeproj/
  7. src/
  8. test/
  9. .gitignore
  10. CMakeLists.txt
  11. cmd_line_main.c
  12. example.c
  13. example.h
  14. LICENSE
  15. Makefile
  16. README.md
  17. SECURITY.md
  18. tag-examples.c
  19. tag-examples.h
  20. ub-example.c
  21. ub-example.h
README.md

QCBOR Logo

QCBOR 2.0 Alpha

This is a QCBOR 2.0 alpha release. It is suitable for test and prototyping, but not commerical use. The planned 2.0 changes are in, but they are not fully tested or documented. The interface is also subject to change.

QCBOR 2.0 is compatible with 1.0 with one exception that can be overriden with a call to QCBORDecode_Compatibilityv1().

Please file issues found with this release in GitHub.

Major Changes

  • Unexpected tag numbers are not silently ignored unless in v1 compatibility mode. This is more correct decoding behavior.

  • New API to explicitly decode tag numbers to make tag numbers easier to work with.

  • Plug-in API scheme for custom tag content processors.

  • Sort maps and check for duplicate labels when encoding.

  • Encode modes for dCBOR, CDE and Preferred Serialization.

  • Decode modes that check for conformance with dCBOR, CDE and Preferred Serialization.

  • Full support for preferred serialization of big numbers, decimal fractions and big numbers.

  • Full support for 65-bit negative integers.

  • The decoding interface is split into four files (sources files are too).

Compatibility with QCBOR v1

QCBOR v1 does not error out when a tag number occurs where it is not expected. QCBOR v2 does. Tag numbers really do change the type of an item, so it is more correct to error out.

For many protocols, the v2 behavior produces a more correct implementation, so it is often better to not return to QCBOR v1 behavior.

Another difference is that the tag content decoders for big numbers, big floats, URIs and such are not enabled by default. These are what notices the things like the big number and big float tags, decodes them and turns them into QCBOR types for big numbers and floats.

QCBORDecode_Compatibilityv1() disables the error out on unprocessed tag numbers and installs the same tag content decoders that v1 had.

The tag number decoders can be installed with the retention of erroring out on unprocessed tag numbers by calling QCBORDecode_InstallTagDecoders(pMe, QCBORDecode_TagDecoderTablev1, NULL);

QCBOR v2 requires tag numbers to be consumed in one of three ways. It may be consumed explicitly with QCBORDecode_GetNextTagNumber(). It may be consumed by a tag content process or like QCBORDecode_DateEpochTagCB() installed with QCBORDecode_InstallTagDecoders(). It may be consumed with a spiffy decode function like QCBORDecode_GetTBigNumber().

QCBOR is a powerful, commercial-quality CBOR encoder-decoder that implements these RFCs:

  • RFC8949 The CBOR Standard. (Nearly everything except full (complex) duplicate detection))
  • RFC7049 The previous CBOR standard. Replaced by RFC 8949.
  • RFC8742 CBOR Sequences
  • RFC8943 CBOR Dates
  • RFC8943 CBOR Dates
  • dCBOR "dCBOR, deterministic encoding"

QCBOR Characteristics

Implemented in C with minimal dependency – Dependent only on C99, <stdint.h>, <stddef.h>, <stdbool.h> and <string.h> making it highly portable. <math.h> and <fenv.h> are used too, but their use can disabled. No #ifdefs or compiler options need to be set for QCBOR to run correctly.

Focused on C / native data representation – Careful conversion of CBOR data types in to C data types, handling over and underflow, strict typing and such so the caller doesn't have to worry so much about this and so code using QCBOR passes static analyzers easier. Simpler code because there is no support for encoding/decoding to/from JSON, pretty printing, diagnostic notation... Only encoding from native C representations and decoding to native C representations is supported.

Small simple memory model – Malloc is not needed. The encode context is 176 bytes, decode context is 312 bytes and the description of decoded data item is 56 bytes. Stack use is light and there is no recursion. The caller supplies the memory to hold the encoded CBOR and encode/decode contexts so caller has full control of memory usage making it good for embedded implementations that have to run in small fixed memory.

Easy decoding of maps – The "spiffy decode" functions allow fetching map items directly by label. Detection of duplicate map items is automatically performed. This makes decoding of complex protocols much simpler, say when compared to TinyCBOR.

Supports most of RFC 8949 – With some size limits, all data types and formats in the specification are supported. Map sorting is main CBOR feature that is not supported. The same decoding API supports both definite and indefinite-length map and array decoding. Decoding indefinite length strings is supported but requires a string allocator be set up. Encoding of indefinite length strings is planned, but not yet supported.

Extensible and general – Provides a way to handle data types that are not directly supported.

Secure coding style – Uses a construct called UsefulBuf as a discipline for very safe coding and handling of binary data.

Small code size – In the smallest configuration the object code is less than 4KB on 64-bit x86 CPUs. The design is such that object code for QCBOR APIs not used is not referenced.

Clear documented public interface – The public interface is separated from the implementation. It can be put to use without reading the source.

Comprehensive test suite – Easy to verify on a new platform or OS with the test suite. The test suite dependencies are minimal and the same as the library's.

Comparison to TinyCBOR

TinyCBOR is a popular widely used implementation. Like QCBOR, it is a solid, well-maintained commercial quality implementation. This section is for folks trying to understand the difference in the approach between QCBOR and TinyCBOR.

TinyCBOR's API is more minimalist and closer to the CBOR encoding mechanics than QCBOR's. QCBOR's API is at a somewhat higher level of abstraction.

QCBOR really does implement just about everything described in RFC 8949. The main part missing is sorting of maps when encoding. TinyCBOR implements a smaller part of the standard.

No detailed code size comparison has been made, but in a spot check that encodes and decodes a single integer shows QCBOR about 25% larger. QCBOR encoding is actually smaller, but QCBOR decoding is larger. This includes the code to call the library, which is about the same for both libraries, and the code linked from the libraries. QCBOR is a bit more powerful, so you get value for the extra code brought in, especially when decoding more complex protocols.

QCBOR tracks encoding and decoding errors internally so the caller doesn't have to check the return code of every call to an encode or decode function. In many cases the error check is only needed as the last step or an encode or decode. TinyCBOR requires an error check on each call.

QCBOR provides a substantial feature that allows searching for data items in a map by label. It works for integer and text string labels (and at some point byte-string labels). This includes detection of items with duplicate labels. This makes the code for decoding CBOR simpler, similar to the encoding code and easier to read. TinyCBOR supports search by string, but no integer, nor duplicate detection.

QCBOR provides explicit support many of the registered CBOR tags. For example, QCBOR supports big numbers and decimal fractions including their conversion to floats, uint64_t and such.

Generally, QCBOR supports safe conversion of most CBOR number formats into number formats supported in C. For example, a data item can be fetched and converted to a C uint64_t whether the input CBOR is an unsigned 64-bit integer, signed 64-bit integer, floating-point number, big number, decimal fraction or a big float. The conversion is performed with full proper error detection of overflow and underflow.

QCBOR has a special feature for decoding byte-string wrapped CBOR. It treats this similar to entering an array with one item. This is particularly use for CBOR protocols like COSE that make use of byte-string wrapping. The implementation of these protocols is simpler and uses less memory.

QCBOR's test suite is written in the same portable C that QCBOR is where TinyCBOR requires Qt for its test. QCBOR's test suite is designed to be able to run on small embedded devices the same as QCBOR.

Code Status

This is the 2.0 alpha release. It has large changes and feature additions. It's not ready for commericial use yet. The main short coming is the need for more testing of the newer features. It will go through alpha, then to beta and then to an official 2.0 commerical release sometimes in 2025.

The official QCBOR commercial quality release (as of this writing) is QCBOR 1.5. It is very stable. Only small fixes and features additions have been made to it over the last years.

QCBOR was originally developed by Qualcomm. It was open sourced through CAF with a permissive Linux license, September 2018 (thanks Qualcomm!).

Other Software Using QCBOR

Credits

  • Ganesh Kanike for porting to QSEE
  • Mark Bapst for sponsorship and release as open source by Qualcomm
  • Sachin Sharma for release through CAF
  • Tamas Ban for porting to TF-M and 32-bit ARM
  • Michael Eckel for Makefile improvements
  • Jan Jongboom for indefinite length encoding
  • Peter Uiterwijk for error strings and other
  • Michael Richarson for CI set up and fixing some compiler warnings
  • Máté Tóth-Pál for float-point disabling and other
  • Dave Thaler for portability to Windows

Copyright for this README

Copyright (c) 2018-2025, Laurence Lundblade. All rights reserved. Copyright (c) 2021-2023, Arm Limited. All rights reserved.