1.1 --- a/test/test_list.c Sun Oct 03 13:07:48 2021 +0200
1.2 +++ b/test/test_list.c Sun Oct 03 14:06:57 2021 +0200
1.3 @@ -112,16 +112,13 @@
1.4 ptrdiff_t loc_prev = offsetof(struct node, prev);
1.5 ptrdiff_t loc_next = offsetof(struct node, next);
1.6
1.7 - int ret;
1.8 - ret = cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
1.9 - CU_ASSERT_EQUAL(ret, 0)
1.10 + cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
1.11 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
1.12 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
1.13 CU_ASSERT_PTR_EQUAL(nodes[0].prev, NULL)
1.14 CU_ASSERT_PTR_EQUAL(nodes[0].next, NULL)
1.15
1.16 - ret = cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
1.17 - CU_ASSERT_EQUAL(ret, 0)
1.18 + cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
1.19 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
1.20 CU_ASSERT_PTR_EQUAL(end, &nodes[1])
1.21 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
1.22 @@ -132,16 +129,14 @@
1.23 begin = NULL;
1.24 end = NULL;
1.25
1.26 - ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);
1.27 - CU_ASSERT_EQUAL(ret, 0)
1.28 + cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);
1.29 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
1.30 - ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);
1.31 - CU_ASSERT_EQUAL(ret, 0)
1.32 + cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);
1.33 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
1.34 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
1.35 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0])
1.36
1.37 - ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);
1.38 + cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);
1.39 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2])
1.40 CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1])
1.41
1.42 @@ -150,12 +145,10 @@
1.43 begin = NULL;
1.44 end = NULL;
1.45
1.46 - ret = cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
1.47 - CU_ASSERT_EQUAL(ret, 0)
1.48 + cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
1.49 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
1.50 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
1.51 - ret = cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
1.52 - CU_ASSERT_EQUAL(ret, 0)
1.53 + cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
1.54 CU_ASSERT_PTR_EQUAL(end, &nodes[1])
1.55 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
1.56 CU_ASSERT_PTR_NULL(nodes[1].prev)
