Lines Matching refs:node

27 coap_queue_t *node[5];  variable
42 int result = coap_insert_node(&sendqueue, node[1]); in t_sendqueue1()
46 CU_ASSERT_PTR_EQUAL(sendqueue, node[1]); in t_sendqueue1()
47 CU_ASSERT(node[1]->t == timestamp[1]); in t_sendqueue1()
54 result = coap_insert_node(&sendqueue, node[2]); in t_sendqueue2()
57 CU_ASSERT_PTR_EQUAL(sendqueue, node[1]); in t_sendqueue2()
58 CU_ASSERT_PTR_EQUAL(sendqueue->next, node[2]); in t_sendqueue2()
61 CU_ASSERT(node[2]->t == timestamp[2] - timestamp[1]); in t_sendqueue2()
68 result = coap_insert_node(&sendqueue, node[3]); in t_sendqueue3()
72 CU_ASSERT_PTR_EQUAL(sendqueue, node[3]); in t_sendqueue3()
73 CU_ASSERT(node[3]->t == timestamp[3]); in t_sendqueue3()
87 result = coap_insert_node(&sendqueue, node[4]); in t_sendqueue4()
91 CU_ASSERT_PTR_EQUAL(sendqueue, node[3]); in t_sendqueue4()
94 CU_ASSERT_PTR_EQUAL(sendqueue->next, node[1]); in t_sendqueue4()
97 CU_ASSERT_PTR_EQUAL(sendqueue->next->next, node[4]); in t_sendqueue4()
100 CU_ASSERT_PTR_EQUAL(sendqueue->next->next->next, node[2]); in t_sendqueue4()
197 CU_ASSERT_PTR_EQUAL(sendqueue, node[3]); in t_sendqueue7()
200 CU_ASSERT_PTR_EQUAL(sendqueue->next, node[1]); in t_sendqueue7()
206 CU_ASSERT_PTR_EQUAL(tmp_node, node[3]); in t_sendqueue7()
209 CU_ASSERT_PTR_EQUAL(sendqueue, node[1]); in t_sendqueue7()
223 CU_ASSERT_PTR_EQUAL(tmp_node, node[4]); in t_sendqueue8()
226 CU_ASSERT_PTR_EQUAL(sendqueue, node[1]); in t_sendqueue8()
230 CU_ASSERT_PTR_EQUAL(sendqueue->next, node[2]); in t_sendqueue8()
248 CU_ASSERT_PTR_EQUAL(tmp_node, node[1]); in t_sendqueue9()
255 CU_ASSERT_PTR_EQUAL(tmp_node, node[1]); in t_sendqueue9()
258 CU_ASSERT_PTR_EQUAL(sendqueue, node[2]); in t_sendqueue9()
279 CU_ASSERT_PTR_EQUAL(tmp_node, node[2]); in t_sendqueue10()
296 memset(node, 0, sizeof(node)); in t_sendqueue_tests_create()
297 for (n = 1; n < sizeof(node)/sizeof(coap_queue_t *); n++) { in t_sendqueue_tests_create()
298 node[n] = coap_new_node(); in t_sendqueue_tests_create()
299 if (!node[n]) { in t_sendqueue_tests_create()
304 node[n]->id = n; in t_sendqueue_tests_create()
305 node[n]->t = timestamp[n]; in t_sendqueue_tests_create()
310 for (n = 0; n < sizeof(node)/sizeof(coap_queue_t *); n++) { in t_sendqueue_tests_create()
311 if (node[n]) { in t_sendqueue_tests_create()
312 coap_delete_node(node[n]); in t_sendqueue_tests_create()
313 node[n] = NULL; in t_sendqueue_tests_create()
326 for (n = 0; n < sizeof(node)/sizeof(coap_queue_t *); n++) { in t_sendqueue_tests_remove()
327 if (node[n]) { in t_sendqueue_tests_remove()
328 coap_delete_node(node[n]); in t_sendqueue_tests_remove()