Lines Matching defs:newTL
519 TreeList<Chunk> *newTL, *parentTL;
572 newTL = replacementTL->right();
576 newTL = replacementTL->left();
581 newTL = remove_tree_minimum(replacementTL->right());
582 assert(newTL != NULL && newTL->left() == NULL &&
583 newTL->right() == NULL, "sub-tree minimum exists");
585 // newTL is the replacement for the (soon to be empty) node.
586 // newTL may be NULL.
591 // first make newTL my parent's child
593 // newTL should be root
595 set_root(newTL);
596 if (newTL != NULL) {
597 newTL->clear_parent();
601 parentTL->set_right(newTL);
604 parentTL->set_left(newTL);
607 if (complicated_splice) { // we need newTL to get replacementTL's
609 assert(newTL != NULL &&
610 newTL->left() == NULL && newTL->right() == NULL,
611 "newTL should not have encumbrances from the past");
622 newTL->set_left(replacementTL->left());
623 newTL->set_right(replacementTL->right());
742 TreeList<Chunk>* newTL = TreeList<Chunk>::as_TreeList(tc);
743 assert(((TreeChunk<Chunk>*)tc)->list() == newTL,
747 set_root(newTL);
751 prevTL->set_right(newTL);
754 prevTL->set_left(newTL);