| commit | f28153afecabce233d4c22fe815ab181a5f31e48 | [log] [tgz] |
|---|---|---|
| author | cabo <cabo@tzi.org> | Wed Sep 02 21:09:55 2015 +0200 |
| committer | cabo <cabo@tzi.org> | Wed Sep 02 21:09:55 2015 +0200 |
| tree | 6851804d6847e68e1249d7226f35075f2a1213b3 | |
| parent | 730497991911cc59c16633684f14b0be839b862f [diff] | |
| parent | 3c9061c71d6da2dff7886aac9a468ac4a72f5f28 [diff] |
Merge pull request #41 from jimsch/bytes Declare a byte version of the data (uint8_t *).
This is a constrained node implementation of CBOR in C that I threw together in 2013, before the publication of RFC 7049, to validate certain implementability considerations.
Its API model was inspired by nxjson. It turns out that this API model actually works even better with the advantages of the CBOR format.
This code has been used in a number of research implementations on constrained nodes, with resulting code sizes appreciably under 1 KiB on ARM platforms.
I always meant to improve the interface some more with certain API changes, in order to get even closer to 0.5 KiB, but I ran out of time. So here it is. If I do get around to making these changes, the API will indeed change a bit, so please be forewarned.
There is a Simple-Makefile for playing around, as well as a complete cmake-based build environment. (You can choose what fits your needs better.)
Building with cmake:
./build.sh
Building including testing:
./build.sh all test
Generating a test coverage report (requires lcov[^1]; result in build/lcov/index.html):
./build.sh all coveralls coverage_report
License: MIT
[^1]: Installation with homebrew: brew install lcov