382                               ReassociatePass::OrderedSet &ToRedo,  in LinearizeExprTree()  argument
512             ToRedo.insert(UserBO);  in LinearizeExprTree()
514         ToRedo.insert(Neg);  in LinearizeExprTree()
777                           ReassociatePass::OrderedSet &ToRedo) {  in NegateValue()  argument
799     I->setOperand(0, NegateValue(I->getOperand(0), BI, ToRedo));  in NegateValue()
800     I->setOperand(1, NegateValue(I->getOperand(1), BI, ToRedo));  in NegateValue()
816     ToRedo.insert(I);  in NegateValue()
869     ToRedo.insert(TheNeg);  in NegateValue()
877   ToRedo.insert(NewNeg);  in NegateValue()
1008                                        ReassociatePass::OrderedSet &ToRedo) {  in BreakUpSubtract()  argument
1014   Value *NegVal = NegateValue(Sub->getOperand(1), Sub, ToRedo);  in BreakUpSubtract()
2582     OrderedSet ToRedo(RedoInsts);  in run()  local
2587     while (!ToRedo.empty()) {  in run()
2588       Instruction *I = ToRedo.pop_back_val();  in run()
2590         RecursivelyEraseDeadInsts(I, ToRedo);  in run()