824     RedoInsts.insert(NodesToRewrite[i]);  in RewriteExprTree()
1163   MadeChange |= LinearizeExprTree(BO, Tree, RedoInsts);  in RemoveFactorFromExpression()
1214     RedoInsts.insert(BO);  in RemoveFactorFromExpression()
1340     RedoInsts.insert(T);  in CombineXorOpnd()
1417     RedoInsts.insert(T);  in CombineXorOpnd()
1419     RedoInsts.insert(T);  in CombineXorOpnd()
1582       RedoInsts.insert(Mul);  in OptimizeAdd()
1750       RedoInsts.insert(VI);  in OptimizeAdd()
1757     RedoInsts.insert(V2);  in OptimizeAdd()
1886       RedoInsts.insert(MI);  in buildMinimalMultiplyDAG()
2027   RedoInsts.remove(I);  in RecursivelyEraseDeadInsts()
2044   RedoInsts.remove(I);  in EraseInst()
2064         RedoInsts.insert(Op);  in EraseInst()
2170   RedoInsts.insert(I);  in canonicalizeNegFPConstantsForOp()
2213       RedoInsts.insert(I);  in OptimizeInst()
2250     RedoInsts.insert(I);  in OptimizeInst()
2259       Instruction *NI = BreakUpSubtract(I, RedoInsts);  in OptimizeInst()
2260       RedoInsts.insert(I);  in OptimizeInst()
2274             RedoInsts.insert(Tmp);  in OptimizeInst()
2276         RedoInsts.insert(I);  in OptimizeInst()
2284       Instruction *NI = BreakUpSubtract(I, RedoInsts);  in OptimizeInst()
2285       RedoInsts.insert(I);  in OptimizeInst()
2301             RedoInsts.insert(Tmp);  in OptimizeInst()
2303         RedoInsts.insert(I);  in OptimizeInst()
2323       RedoInsts.insert(BO->user_back());  in OptimizeInst()
2343   MadeChange |= LinearizeExprTree(I, Tree, RedoInsts);  in ReassociateExpression()
2372     RedoInsts.insert(I);  in ReassociateExpression()
2410     RedoInsts.insert(I);  in ReassociateExpression()
2563     OrderedSet ToRedo(RedoInsts);  in run()
2578     while (!RedoInsts.empty()) {  in run()
2579       Instruction *I = RedoInsts.front();  in run()
2580       RedoInsts.erase(RedoInsts.begin());  in run()