Lines Matching refs:tail
72 * 3: list tail will be NULL
78 fail_unless(llist.tail == NULL, "list tail should initiate to NULL");
89 * 3: list tail will be the same as list head
99 /* same goes for the list tail */
100 fail_unless(llist.tail == llist.head,
101 "tail and head should be the same");
109 * 2: the list tail should be our newly created element
116 fail_unless(llist.tail->ptr == &unusedData_case3,
117 "the list tail is not getting set correctly");
125 * 2: the list tail should different from newly created element
132 /* better safe than sorry, check that the tail isn't corrupted */
133 fail_unless(llist.tail->ptr != &unusedData_case2,
134 "the list tail is not getting set correctly");
190 * removing the tail with list having >=1 element
195 * 4: list->tail will be tail->previous
198 to_remove = llist.tail;
201 fail_unless(llist.tail == element_prev,
202 "llist tail is not being adjusted when removing tail");
210 * 3: list tail will be null
217 fail_unless(llist.tail == NULL,
218 "llist tail is not NULL while the llist is empty");