Lines Matching refs:next
48 TreeChunk<Chunk>* nextTC = (TreeChunk<Chunk>*)next();
93 (tc->size() == 0 && tc->prev() == NULL && tc->next() == NULL),
107 assert(!list || list != list->next(), "Chunk on list twice");
113 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
116 TreeChunk<Chunk>* nextTC = TreeChunk<Chunk>::as_TreeChunk(tc->next());
130 // TreeList<Chunk> from the first chunk to the next chunk and update all
145 curTC = TreeChunk<Chunk>::as_TreeChunk(curTC->next())) {
192 curFC != NULL; curFC = curFC->next()) {
213 assert(retTL->tail() == NULL || retTL->tail()->next() == NULL,
226 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
236 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
250 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
252 Chunk* fc = head()->next();
264 assert(tail() == NULL || tail()->next() == NULL, "list invariant");
277 Chunk* fc = head()->next();
294 Chunk* fc = head()->next();
302 while (fc->next() != NULL) {
306 fc = fc->next();
330 assert(root()->head()->next() == NULL, "reset check failed");
403 // try and find the next larger size by walking back up the search path
450 if (splay && curTL->head()->next() != NULL) {
511 // If it is the last chunk in the list (the next link is NULL),
641 assert(retTC->prev() == NULL && retTC->next() == NULL,
787 for (cnt = 0; tc != NULL; tc = tc->next(), cnt++);
1020 item = item->next();
1264 fc = fc->next()) {
1295 for (Chunk* curFC = tl->head(); curFC != NULL; curFC = curFC->next()) {