static void test_clist_remove_two(void) { list_node_t *list = &test_clist; test_clist_add_two(); clist_lpop(list); clist_lpop(list); TEST_ASSERT_NULL(list->next); }
static void test_clist_lpop(void) { list_node_t *list = &test_clist; test_clist_add_three(); TEST_ASSERT(clist_lpop(list) == &tests_clist_buf[0]); TEST_ASSERT_NOT_NULL(list->next); TEST_ASSERT(clist_lpop(list) == &tests_clist_buf[1]); TEST_ASSERT_NOT_NULL(list->next); TEST_ASSERT(clist_lpop(list) == &tests_clist_buf[2]); TEST_ASSERT_NULL(list->next); TEST_ASSERT_NULL(clist_lpop(list)); }
int main(int argc, char const *argv[]) { size_t i; lock = SL_UNLOCK; cl = clist_create(); count = 0; for(i = 0; i < 6; i++) clist_lpush(cl, NULL); clist_rpop(cl); clist_rpop(cl); clist_rpop(cl); clist_rpop(cl); clist_rpop(cl); clist_rpop(cl); for(i = 0; i < 6; i++) clist_lpush(cl, NULL); clist_destroy(cl); cl = clist_create(); for(i = 0; i < 1000; i++) clist_rpush(cl, NULL); for(i = 0; i < 1000; i++) clist_lpush(cl, NULL); for(i = 0; i < 1000; i++) clist_lpop(cl); for(i = 0; i < 1000; i++) clist_rpop(cl); clist_destroy(cl); printf("%llu\n", used_mem()); return 0; }