Lines Matching refs:tail
38 // of space in the heap. The head and tail are maintained so that
40 // at the tail of the list and removed from the head of the list to
89 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
97 } else { // removed tail of list
104 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
131 // Now we can fix up the tail.
147 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
155 } else { // removed tail of list
164 assert(tail() != prevFC || prevFC->next() == NULL,
165 "Next of tail should be NULL");
168 assert(((head() == NULL) + (tail() == NULL) + (count() == 0)) % 3 == 0,
177 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
179 assert(tail() == NULL || tail()->size() == size(), "wrong item on list");
189 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
196 assert(tail() == NULL, "inconsistent FreeList");
206 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
208 assert(tail() == NULL || tail()->size() == size(), "wrong item on list");
217 // Add this chunk at the tail of the list.
222 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
226 Chunk* oldTail = tail();
242 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
244 assert(tail() == NULL || tail()->size() == size(), "wrong item on list");
258 set_tail(fl->tail());
262 Chunk* fl_tail = fl->tail();