734   LeaderListNode &Curr = NumToLeaders[N];  in insert()  local
735   if (!Curr.Entry.Val) {  in insert()
736     Curr.Entry.Val = V;  in insert()
737     Curr.Entry.BB = BB;  in insert()
744   Node->Next = Curr.Next;  in insert()
745   Curr.Next = Node;  in insert()
753   LeaderListNode *Curr = &NumToLeaders[N];  in erase()  local
755   while (Curr && (Curr->Entry.Val != I || Curr->Entry.BB != BB)) {  in erase()
756     Prev = Curr;  in erase()
757     Curr = Curr->Next;  in erase()
760   if (!Curr)  in erase()
764     Prev->Next = Curr->Next;  in erase()
766     if (!Curr->Next) {  in erase()
767       Curr->Entry.Val = nullptr;  in erase()
768       Curr->Entry.BB = nullptr;  in erase()
770       LeaderListNode *Next = Curr->Next;  in erase()
771       Curr->Entry.Val = Next->Entry.Val;  in erase()
772       Curr->Entry.BB = Next->Entry.BB;  in erase()
773       Curr->Next = Next->Next;  in erase()
2890                                         BasicBlock *Curr, unsigned int ValNo) {  in performScalarPREInsertion()  argument
2909         VN.phiTranslate(Pred, Curr, VN.lookup(Op), *this);  in performScalarPREInsertion()