141   Value *Invariant;  member
144   CompareDesc(BranchInst *Term, Value *Invariant, BasicBlock *InLoopSucc)  in CompareDesc()
145       : Term(Term), Invariant(Invariant), InLoopSucc(InLoopSucc) {}  in CompareDesc()
235 static void replaceLoopInvariantUses(const Loop &L, Value *Invariant,  in replaceLoopInvariantUses()  argument
237   assert(!isa<Constant>(Invariant) && "Why are we unswitching on a constant?");  in replaceLoopInvariantUses()
241   for (Use &U : llvm::make_early_inc_range(Invariant->uses())) {  in replaceLoopInvariantUses()
572     for (Value *Invariant : Invariants) {  in unswitchTrivialBranch()
573       dbgs() << "      " << *Invariant << " == true";  in unswitchTrivialBranch()
574       if (Invariant != Invariants.back())  in unswitchTrivialBranch()
700   for (Value *Invariant : Invariants)  in unswitchTrivialBranch()
701     replaceLoopInvariantUses(L, Invariant, *Replacement);  in unswitchTrivialBranch()
2553     for (Value *Invariant : Invariants) {  in unswitchNontrivialInvariants()
2554       assert(!isa<Constant>(Invariant) &&  in unswitchNontrivialInvariants()
2557       for (Use &U : llvm::make_early_inc_range(Invariant->uses())) {  in unswitchNontrivialInvariants()
3192     Value *LHS = Next->Invariant;  in insertCandidatesWithPendingInjections()
3193     Value *RHS = Prev->Invariant;  in insertCandidatesWithPendingInjections()