commit | d9efcabad460f8af343b079289e0287752eb8835 | [log] [tgz] |
---|---|---|
author | Joe Hildebrand <joe-github@cursive.net> | Mon Mar 02 09:25:05 2015 +0100 |
committer | Joe Hildebrand <joe-github@cursive.net> | Mon Mar 02 09:25:05 2015 +0100 |
tree | 8a6a2c39d33d913016e25f3ba7fc4624a18bcf7e | |
parent | f1b4ea2929ac1e9911d168f9a95715e4135466c7 [diff] |
Make it compile with all of the warnings on
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.
(To run the test, please add cases.cbor.)
License: MIT