tinydtls-sys 0.2.0+tinydtls-9d6cf54

Raw bindings to the TinyDTLS library.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

#include <string.h>
#include <stdio.h>

#include "utlist.h" 
#include "netq.h" 

void
dump_queue(struct netq_t *queue) {
  struct netq_t *p;
  int i = 0;

  if (!queue) {
    printf("(null)\n");
  } else {
    LL_FOREACH(queue, p) {
      printf("node #%d, timeout: %d\n", i++, p->t);
    }
  }
}

int main(int argc, char **argv) {
  struct netq_t *nq = NULL, *node;
  int i;
    
  clock_time_t timestamps[] = { 300, 100, 200, 400, 500 };

  for (i = 0; i < sizeof(timestamps)/sizeof(clock_time_t); i++) {
    node = netq_node_new(0);

    if (!node) {
      fprintf(stderr, "E: cannot create node #%d\n", i);
      exit(EXIT_FAILURE);
    }

    node->t = timestamps[i];

    if (!netq_insert_node(&nq, node)) {
      fprintf(stderr, "E: cannot add node to nodelist #%d\n", i);
      exit(EXIT_FAILURE);
    }
  }

  printf("------------------------------------------------------------------------\n");
  printf("initial queue:\n");
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("pop first element:\n");
  node = netq_pop_first(&nq);

  assert(node);
  printf("first node's timeout is %d\n", node->t);
  dump_queue(nq);

  netq_node_free(node);
  
  printf("------------------------------------------------------------------------\n");
  printf("queue head:\n");
  node = netq_head(&nq);

  printf("head's timeout is %d\n", node->t);
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("next timeout:\n");

  node = netq_next(node);

  printf("next node's timeout is %d\n", node->t);

  printf("------------------------------------------------------------------------\n");
  printf("remove next:\n");

  netq_remove(&nq, node);
  dump_queue(nq);

  netq_node_free(node);

  printf("------------------------------------------------------------------------\n");
  printf("insert new item (timeout 50):\n");
  node = netq_node_new(0);

  assert(node);
  node->t = 50;

  netq_insert_node(&nq, node);
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("insert new item (timeout 350):\n");
  node = netq_node_new(0);

  assert(node);
  node->t = 350;

  netq_insert_node(&nq, node);
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("insert new item (timeout 1000):\n");
  node = netq_node_new(0);

  assert(node);
  node->t = 1000;

  netq_insert_node(&nq, node);
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("remove all:\n");
  
  netq_delete_all(&nq);
  dump_queue(nq);

  printf("------------------------------------------------------------------------\n");
  printf("pop first element of empty queue:\n");
  node = netq_pop_first(&nq);

  assert(node == NULL);
  dump_queue(nq);

  return 0;
}