Lines Matching refs:Tmp
593 RED_BLACK_TREE_NODE *Tmp; in OrderedCollectionInsert() local
599 Tmp = Tree->Root; in OrderedCollectionInsert()
607 while (Tmp != NULL) { in OrderedCollectionInsert()
608 Result = Tree->UserStructCompare (UserStruct, Tmp->UserStruct); in OrderedCollectionInsert()
612 Parent = Tmp; in OrderedCollectionInsert()
613 Tmp = (Result < 0) ? Tmp->Left : Tmp->Right; in OrderedCollectionInsert()
616 if (Tmp != NULL) { in OrderedCollectionInsert()
618 *Node = Tmp; in OrderedCollectionInsert()
627 Tmp = AllocatePool (sizeof *Tmp); in OrderedCollectionInsert()
628 if (Tmp == NULL) { in OrderedCollectionInsert()
633 *Node = Tmp; in OrderedCollectionInsert()
639 Tmp->UserStruct = UserStruct; in OrderedCollectionInsert()
645 Tmp->Parent = Parent; in OrderedCollectionInsert()
646 Tmp->Left = NULL; in OrderedCollectionInsert()
647 Tmp->Right = NULL; in OrderedCollectionInsert()
649 Tree->Root = Tmp; in OrderedCollectionInsert()
650 Tmp->Color = RedBlackTreeBlack; in OrderedCollectionInsert()
655 Parent->Left = Tmp; in OrderedCollectionInsert()
657 Parent->Right = Tmp; in OrderedCollectionInsert()
659 Tmp->Color = RedBlackTreeRed; in OrderedCollectionInsert()
682 while (Tmp != NewRoot && Parent->Color == RedBlackTreeRed) { in OrderedCollectionInsert()
729 Tmp = GrandParent; in OrderedCollectionInsert()
730 Parent = Tmp->Parent; in OrderedCollectionInsert()
737 if (Tmp == Parent->Right) { in OrderedCollectionInsert()
751 Tmp = Parent; in OrderedCollectionInsert()
752 RedBlackTreeRotateLeft (Tmp, &NewRoot); in OrderedCollectionInsert()
753 Parent = Tmp->Parent; in OrderedCollectionInsert()
807 Tmp = GrandParent; in OrderedCollectionInsert()
808 Parent = Tmp->Parent; in OrderedCollectionInsert()
810 if (Tmp == Parent->Left) { in OrderedCollectionInsert()
811 Tmp = Parent; in OrderedCollectionInsert()
812 RedBlackTreeRotateRight (Tmp, &NewRoot); in OrderedCollectionInsert()
813 Parent = Tmp->Parent; in OrderedCollectionInsert()