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

Lines Matching refs:curTL
379   TreeList<Chunk> *curTL, *prevTL;
387   for (prevTL = curTL = root(); curTL != NULL;) {
388     if (curTL->size() == size) {        // exact match
391     prevTL = curTL;
392     if (curTL->size() < size) {        // proceed to right sub-tree
393       curTL = curTL->right();
395       assert(curTL->size() > size, "size inconsistency");
396       curTL = curTL->left();
399   if (curTL == NULL) { // couldn't find exact match
404     for (curTL = prevTL; curTL != NULL;) {
405       if (curTL->size() >= size) break;
406       else curTL = curTL->parent();
408     assert(curTL == NULL || curTL->count() > 0,
411   if (curTL != NULL) {
412     assert(curTL->size() >= size, "size inconsistency");
418       if (curTL->surplus() <= 0) {
420         TreeList<Chunk>* hintTL = curTL;
425           assert(curTL != hintTL, "Infinite loop");
427               hintTL == curTL /* Should not happen but protect against it */ ) {
429             curTL->set_hint(0);
437             curTL->set_hint(hintTL->size());
439             curTL = hintTL;
445           // curTL->set_hint(hintTL->size());
450     if (splay && curTL->head()->next() != NULL) {
451       semi_splay_step(curTL);
453     retTC = curTL->first_available();
454     assert((retTC != NULL) && (curTL->count() > 0),
470   TreeList<Chunk>* curTL;
471   for (curTL = root(); curTL != NULL;) {
472     if (curTL->size() == size) {        // exact match
476     if (curTL->size() < size) {        // proceed to right sub-tree
477       curTL = curTL->right();
479       assert(curTL->size() > size, "size inconsistency");
480       curTL = curTL->left();
483   return curTL;
500   TreeList<Chunk> *curTL = root();
501   if (curTL != NULL) {
502     while(curTL->right() != NULL) curTL = curTL->right();
503     return curTL->largest_address();
657   TreeList<Chunk>* curTL = tl;
658   for (; curTL->left() != NULL; curTL = curTL->left());
659   // obviously curTL now has at most one child, a right child
660   if (curTL != root()) {  // Should this test just be removed?
661     TreeList<Chunk>* parentTL = curTL->parent();
662     if (parentTL->left() == curTL) { // curTL is a left child
663       parentTL->set_left(curTL->right());
665       // If the list tl has no left child, then curTL may be
667       assert(parentTL->right() == curTL, "should be a right child");
668       parentTL->set_right(curTL->right());
678     curTL->clear_parent();  // Test if this needs to be cleared
679     curTL->clear_right();    // recall, above, left child is already null
685   return curTL;
709   TreeList<Chunk> *curTL, *prevTL;
721   for (prevTL = curTL = root(); curTL != NULL;) {
722     if (curTL->size() == size)  // exact match
724     prevTL = curTL;
725     if (curTL->size() > size) { // follow left branch
726       curTL = curTL->left();
728       assert(curTL->size() < size, "size inconsistency");
729       curTL = curTL->right();
736   if (curTL != NULL) {          // exact match
737     tc->set_list(curTL);
738     curTL->return_chunk_at_tail(tc);