Lines Matching defs:node
28 /* nodes for testing. node[0] is left empty */
29 coap_queue_t *node[5];
44 int result = coap_insert_node(&ctx->sendqueue, node[1]);
48 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[1]);
49 CU_ASSERT(node[1]->t == timestamp[1]);
56 result = coap_insert_node(&ctx->sendqueue, node[2]);
59 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[1]);
60 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next, node[2]);
63 CU_ASSERT(node[2]->t == timestamp[2] - timestamp[1]);
66 /* insert new node as first element in queue */
70 result = coap_insert_node(&ctx->sendqueue, node[3]);
74 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[3]);
75 CU_ASSERT(node[3]->t == timestamp[3]);
84 /* insert new node as fourth element in queue */
89 result = coap_insert_node(&ctx->sendqueue, node[4]);
93 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[3]);
96 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next, node[1]);
99 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next->next, node[4]);
102 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next->next->next, node[2]);
117 /* space for saving the current node timestamps */
165 /* space for saving the current node timestamps */
195 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[3]);
198 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next, node[1]);
204 CU_ASSERT_PTR_EQUAL(tmp_node, node[3]);
207 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[1]);
221 CU_ASSERT_PTR_EQUAL(tmp_node, node[4]);
224 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[1]);
228 CU_ASSERT_PTR_EQUAL(ctx->sendqueue->next, node[2]);
240 CU_ASSERT_PTR_EQUAL(tmp_node, node[1]);
246 CU_ASSERT_PTR_EQUAL(tmp_node, node[1]);
249 CU_ASSERT_PTR_EQUAL(ctx->sendqueue, node[2]);
264 CU_ASSERT_PTR_EQUAL(tmp_node, node[2]);
293 memset(node, 0, sizeof(node));
294 for (n = 1; n < sizeof(node)/sizeof(coap_queue_t *); n++) {
295 node[n] = coap_new_node();
296 if (!node[n]) {
301 node[n]->id = n;
302 node[n]->t = timestamp[n];
303 node[n]->session = coap_session_reference(session);
308 for (n = 0; n < sizeof(node)/sizeof(coap_queue_t *); n++) {
309 if (node[n]) {
310 coap_delete_node(node[n]);
311 node[n] = NULL;
324 for (n = 0; n < sizeof(node)/sizeof(coap_queue_t *); n++) {
325 if (node[n]) {
326 coap_delete_node(node[n]);
327 node[n] = NULL;