469                               ReassociatePass::OrderedSet &ToRedo,  in LinearizeExprTree()  argument
616             ToRedo.insert(UserBO);  in LinearizeExprTree()
618         ToRedo.insert(Neg);  in LinearizeExprTree()
869                           ReassociatePass::OrderedSet &ToRedo) {  in NegateValue()  argument
891     I->setOperand(0, NegateValue(I->getOperand(0), BI, ToRedo));  in NegateValue()
892     I->setOperand(1, NegateValue(I->getOperand(1), BI, ToRedo));  in NegateValue()
908     ToRedo.insert(I);  in NegateValue()
955     ToRedo.insert(TheNeg);  in NegateValue()
962   ToRedo.insert(NewNeg);  in NegateValue()
1093                                        ReassociatePass::OrderedSet &ToRedo) {  in BreakUpSubtract()  argument
1099   Value *NegVal = NegateValue(Sub->getOperand(1), Sub, ToRedo);  in BreakUpSubtract()
2665     OrderedSet ToRedo(RedoInsts);  in run()  local
2670     while (!ToRedo.empty()) {  in run()
2671       Instruction *I = ToRedo.pop_back_val();  in run()
2673         RecursivelyEraseDeadInsts(I, ToRedo);  in run()