Cross Reference: /openjdk7/hotspot/src/share/vm/memory/binaryTreeDictionary.cpp

Lines Matching refs:head
106   Chunk* list = head();
112   assert(head() == NULL || head()->prev() == NULL, "list invariant");
183   assert(!retTL->head() || retTL->size() == retTL->head()->size(),
191     for (Chunk* curFC = retTL->head();
211   assert(retTL->head() == NULL || retTL->head()->prev() == NULL,
225   assert(head() == NULL || head()->prev() == NULL, "list invariant");
235   assert(head() == NULL || head()->prev() == NULL, "list invariant");
239 // Add this chunk at the head of the list.  "At the head of the list"
240 // is defined to be after the chunk pointer to by head().  This is
246   assert(head() != NULL, "The tree list is embedded in the first chunk");
249   assert(head() == NULL || head()->prev() == NULL, "list invariant");
252   Chunk* fc = head()->next();
259   head()->link_after(chunk);
260   assert(!head() || size() == head()->size(), "Wrong sized chunk in list");
263   assert(head() == NULL || head()->prev() == NULL, "list invariant");
269   assert(head() == NULL || TreeChunk<Chunk>::as_TreeChunk(head())->list() == this,
271   return TreeChunk<Chunk>::as_TreeChunk(head());
276   assert(head() != NULL, "The head of the list cannot be NULL");
277   Chunk* fc = head()->next();
293   assert(head() != NULL, "The head of the list cannot be NULL");
294   Chunk* fc = head()->next();
330   assert(root()->head()->next() == NULL, "reset check failed");
331   assert(root()->head()->prev() == NULL, "reset check failed");
450     if (splay && curTL->head()->next() != NULL) {
527           assert(_root->head() == tc, "Should only be this one chunk");
554       assert(replacementTL->head() != NULL,
558       assert(rhl == replacementTL, "Broken head");
566     assert(replacementTL->head() == NULL &&
786   Chunk* tc = tl->head();
1014     Chunk* item = fl->head();
1263     for (Chunk* fc = fl->head(); fc != NULL;
1295   for (Chunk* curFC = tl->head(); curFC != NULL; curFC = curFC->next()) {
1319   guarantee(tl->head() == NULL || tl->head()->is_free(), "!Free");
1320   guarantee(tl->head() == NULL || tl->head_as_TreeChunk()->list() == tl,
1322   guarantee(tl->count() > 0 || (tl->head() == NULL && tl->tail() == NULL),
1324   guarantee(tl->count() > 1 || tl->head() == tl->tail(),
1328   if (tl->head() != NULL) {