mirror of
https://github.com/opnsense/src.git
synced 2026-03-05 14:50:41 -05:00
10ff414c14
git-subtree-dir: contrib/libcbor git-subtree-mainline:293663f4dagit-subtree-split:5b2defbd2a
41 lines
1.1 KiB
C
41 lines
1.1 KiB
C
/*
|
|
* Copyright (c) 2014-2020 Pavel Kalvoda <me@pavelkalvoda.com>
|
|
*
|
|
* libcbor is free software; you can redistribute it and/or modify
|
|
* it under the terms of the MIT license. See LICENSE for details.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "cbor.h"
|
|
|
|
/*
|
|
* Illustrates how to use the contiguous storage of nested items with
|
|
* standard library functions.
|
|
*/
|
|
|
|
int comparUint(const void *a, const void *b) {
|
|
uint8_t av = cbor_get_uint8(*(cbor_item_t **)a),
|
|
bv = cbor_get_uint8(*(cbor_item_t **)b);
|
|
|
|
if (av < bv)
|
|
return -1;
|
|
else if (av == bv)
|
|
return 0;
|
|
else
|
|
return 1;
|
|
}
|
|
|
|
int main(int argc, char *argv[]) {
|
|
cbor_item_t *array = cbor_new_definite_array(4);
|
|
cbor_array_push(array, cbor_move(cbor_build_uint8(4)));
|
|
cbor_array_push(array, cbor_move(cbor_build_uint8(3)));
|
|
cbor_array_push(array, cbor_move(cbor_build_uint8(1)));
|
|
cbor_array_push(array, cbor_move(cbor_build_uint8(2)));
|
|
|
|
qsort(cbor_array_handle(array), cbor_array_size(array), sizeof(cbor_item_t *),
|
|
comparUint);
|
|
|
|
cbor_describe(array, stdout);
|
|
fflush(stdout);
|
|
}
|