766     RedoInsts.insert(BO);  in RewriteExprTree()
1107   MadeChange |= LinearizeExprTree(BO, Tree, RedoInsts, Flags);  in RemoveFactorFromExpression()
1157     RedoInsts.insert(BO);  in RemoveFactorFromExpression()
1283     RedoInsts.insert(T);  in CombineXorOpnd()
1360     RedoInsts.insert(T);  in CombineXorOpnd()
1362     RedoInsts.insert(T);  in CombineXorOpnd()
1525       RedoInsts.insert(Mul);  in OptimizeAdd()
1692       RedoInsts.insert(VI);  in OptimizeAdd()
1699     RedoInsts.insert(V2);  in OptimizeAdd()
1828       RedoInsts.insert(MI);  in buildMinimalMultiplyDAG()
1969   RedoInsts.remove(I);  in RecursivelyEraseDeadInsts()
1986   RedoInsts.remove(I);  in EraseInst()
2006         RedoInsts.insert(Op);  in EraseInst()
2112   RedoInsts.insert(I);  in canonicalizeNegFPConstantsForOp()
2155       RedoInsts.insert(I);  in OptimizeInst()
2193     RedoInsts.insert(I);  in OptimizeInst()
2202       Instruction *NI = BreakUpSubtract(I, RedoInsts);  in OptimizeInst()
2203       RedoInsts.insert(I);  in OptimizeInst()
2217             RedoInsts.insert(Tmp);  in OptimizeInst()
2219         RedoInsts.insert(I);  in OptimizeInst()
2227       Instruction *NI = BreakUpSubtract(I, RedoInsts);  in OptimizeInst()
2228       RedoInsts.insert(I);  in OptimizeInst()
2244             RedoInsts.insert(Tmp);  in OptimizeInst()
2246         RedoInsts.insert(I);  in OptimizeInst()
2266       RedoInsts.insert(BO->user_back());  in OptimizeInst()
2287   MadeChange |= LinearizeExprTree(I, Tree, RedoInsts, Flags);  in ReassociateExpression()
2316     RedoInsts.insert(I);  in ReassociateExpression()
2354     RedoInsts.insert(I);  in ReassociateExpression()
2582     OrderedSet ToRedo(RedoInsts);  in run()
2597     while (!RedoInsts.empty()) {  in run()
2598       Instruction *I = RedoInsts.front();  in run()
2599       RedoInsts.erase(RedoInsts.begin());  in run()