Lines Matching refs:DT
72 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { in ValueDominatesPHI() argument
79 if (DT) in ValueDominatesPHI()
80 return DT->dominates(I, P); in ValueDominatesPHI()
98 const DominatorTree *DT, unsigned MaxRecurse) { in ExpandBinOp() argument
110 if (Value *L = SimplifyBinOp(Opcode, A, C, TD, DT, MaxRecurse)) in ExpandBinOp()
111 if (Value *R = SimplifyBinOp(Opcode, B, C, TD, DT, MaxRecurse)) { in ExpandBinOp()
120 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, TD, DT, in ExpandBinOp()
134 if (Value *L = SimplifyBinOp(Opcode, A, B, TD, DT, MaxRecurse)) in ExpandBinOp()
135 if (Value *R = SimplifyBinOp(Opcode, A, C, TD, DT, MaxRecurse)) { in ExpandBinOp()
144 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, TD, DT, in ExpandBinOp()
161 const DominatorTree *DT, unsigned MaxRecurse) { in FactorizeBinOp() argument
185 if (Value *V = SimplifyBinOp(Opcode, B, DD, TD, DT, MaxRecurse)) { in FactorizeBinOp()
194 if (Value *W = SimplifyBinOp(OpcodeToExtract, A, V, TD, DT, MaxRecurse)) { in FactorizeBinOp()
208 if (Value *V = SimplifyBinOp(Opcode, A, CC, TD, DT, MaxRecurse)) { in FactorizeBinOp()
217 if (Value *W = SimplifyBinOp(OpcodeToExtract, V, B, TD, DT, MaxRecurse)) { in FactorizeBinOp()
231 const DominatorTree *DT, in SimplifyAssociativeBinOp() argument
250 if (Value *V = SimplifyBinOp(Opcode, B, C, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
255 if (Value *W = SimplifyBinOp(Opcode, A, V, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
269 if (Value *V = SimplifyBinOp(Opcode, A, B, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
274 if (Value *W = SimplifyBinOp(Opcode, V, C, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
292 if (Value *V = SimplifyBinOp(Opcode, C, A, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
297 if (Value *W = SimplifyBinOp(Opcode, V, B, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
311 if (Value *V = SimplifyBinOp(Opcode, C, A, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
316 if (Value *W = SimplifyBinOp(Opcode, B, V, TD, DT, MaxRecurse)) { in SimplifyAssociativeBinOp()
332 const DominatorTree *DT, in ThreadBinOpOverSelect() argument
350 TV = SimplifyBinOp(Opcode, SI->getTrueValue(), RHS, TD, DT, MaxRecurse); in ThreadBinOpOverSelect()
351 FV = SimplifyBinOp(Opcode, SI->getFalseValue(), RHS, TD, DT, MaxRecurse); in ThreadBinOpOverSelect()
353 TV = SimplifyBinOp(Opcode, LHS, SI->getTrueValue(), TD, DT, MaxRecurse); in ThreadBinOpOverSelect()
354 FV = SimplifyBinOp(Opcode, LHS, SI->getFalseValue(), TD, DT, MaxRecurse); in ThreadBinOpOverSelect()
406 const DominatorTree *DT, in ThreadCmpOverSelect() argument
422 if (Value *TCmp = SimplifyCmpInst(Pred, SI->getTrueValue(), RHS, TD, DT, in ThreadCmpOverSelect()
425 if (Value *FCmp = SimplifyCmpInst(Pred, SI->getFalseValue(), RHS, TD, DT, in ThreadCmpOverSelect()
436 if (Value *V = SimplifyAndInst(Cond, TCmp, TD, DT, MaxRecurse)) in ThreadCmpOverSelect()
441 if (Value *V = SimplifyOrInst(Cond, FCmp, TD, DT, MaxRecurse)) in ThreadCmpOverSelect()
448 TD, DT, MaxRecurse)) in ThreadCmpOverSelect()
461 const TargetData *TD, const DominatorTree *DT, in ThreadBinOpOverPHI() argument
471 if (!ValueDominatesPHI(RHS, PI, DT)) in ThreadBinOpOverPHI()
477 if (!ValueDominatesPHI(LHS, PI, DT)) in ThreadBinOpOverPHI()
488 SimplifyBinOp(Opcode, Incoming, RHS, TD, DT, MaxRecurse) : in ThreadBinOpOverPHI()
489 SimplifyBinOp(Opcode, LHS, Incoming, TD, DT, MaxRecurse); in ThreadBinOpOverPHI()
505 const TargetData *TD, const DominatorTree *DT, in ThreadCmpOverPHI() argument
520 if (!ValueDominatesPHI(RHS, PI, DT)) in ThreadCmpOverPHI()
529 Value *V = SimplifyCmpInst(Pred, Incoming, RHS, TD, DT, MaxRecurse); in ThreadCmpOverPHI()
543 const TargetData *TD, const DominatorTree *DT, in SimplifyAddInst() argument
579 if (Value *V = SimplifyXorInst(Op0, Op1, TD, DT, MaxRecurse-1)) in SimplifyAddInst()
583 if (Value *V = SimplifyAssociativeBinOp(Instruction::Add, Op0, Op1, TD, DT, in SimplifyAddInst()
589 TD, DT, MaxRecurse)) in SimplifyAddInst()
605 const TargetData *TD, const DominatorTree *DT) { in SimplifyAddInst() argument
606 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, TD, DT, RecursionLimit); in SimplifyAddInst()
612 const TargetData *TD, const DominatorTree *DT, in SimplifySubInst() argument
646 if (Value *V = SimplifyBinOp(Instruction::Sub, Y, Z, TD, DT, MaxRecurse-1)) in SimplifySubInst()
648 if (Value *W = SimplifyBinOp(Instruction::Add, X, V, TD, DT, in SimplifySubInst()
655 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, TD, DT, MaxRecurse-1)) in SimplifySubInst()
657 if (Value *W = SimplifyBinOp(Instruction::Add, Y, V, TD, DT, in SimplifySubInst()
670 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Y, TD, DT, MaxRecurse-1)) in SimplifySubInst()
672 if (Value *W = SimplifyBinOp(Instruction::Sub, V, Z, TD, DT, in SimplifySubInst()
679 if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, TD, DT, MaxRecurse-1)) in SimplifySubInst()
681 if (Value *W = SimplifyBinOp(Instruction::Sub, V, Y, TD, DT, in SimplifySubInst()
694 if (Value *V = SimplifyBinOp(Instruction::Sub, Z, X, TD, DT, MaxRecurse-1)) in SimplifySubInst()
696 if (Value *W = SimplifyBinOp(Instruction::Add, V, Y, TD, DT, in SimplifySubInst()
705 TD, DT, MaxRecurse)) in SimplifySubInst()
710 if (Value *V = SimplifyXorInst(Op0, Op1, TD, DT, MaxRecurse-1)) in SimplifySubInst()
726 const TargetData *TD, const DominatorTree *DT) { in SimplifySubInst() argument
727 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, TD, DT, RecursionLimit); in SimplifySubInst()
733 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyMulInst() argument
768 if (Value *V = SimplifyAndInst(Op0, Op1, TD, DT, MaxRecurse-1)) in SimplifyMulInst()
772 if (Value *V = SimplifyAssociativeBinOp(Instruction::Mul, Op0, Op1, TD, DT, in SimplifyMulInst()
778 TD, DT, MaxRecurse)) in SimplifyMulInst()
784 if (Value *V = ThreadBinOpOverSelect(Instruction::Mul, Op0, Op1, TD, DT, in SimplifyMulInst()
791 if (Value *V = ThreadBinOpOverPHI(Instruction::Mul, Op0, Op1, TD, DT, in SimplifyMulInst()
799 const DominatorTree *DT) { in SimplifyMulInst() argument
800 return ::SimplifyMulInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyMulInst()
806 const TargetData *TD, const DominatorTree *DT, in SimplifyDiv() argument
864 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyDiv()
870 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyDiv()
879 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifySDivInst() argument
880 if (Value *V = SimplifyDiv(Instruction::SDiv, Op0, Op1, TD, DT, MaxRecurse)) in SimplifySDivInst()
887 const DominatorTree *DT) { in SimplifySDivInst() argument
888 return ::SimplifySDivInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifySDivInst()
894 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyUDivInst() argument
895 if (Value *V = SimplifyDiv(Instruction::UDiv, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyUDivInst()
902 const DominatorTree *DT) { in SimplifyUDivInst() argument
903 return ::SimplifyUDivInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyUDivInst()
920 const DominatorTree *DT) { in SimplifyFDivInst() argument
921 return ::SimplifyFDivInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyFDivInst()
927 const TargetData *TD, const DominatorTree *DT, in SimplifyRem() argument
967 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyRem()
973 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyRem()
982 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifySRemInst() argument
983 if (Value *V = SimplifyRem(Instruction::SRem, Op0, Op1, TD, DT, MaxRecurse)) in SimplifySRemInst()
990 const DominatorTree *DT) { in SimplifySRemInst() argument
991 return ::SimplifySRemInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifySRemInst()
997 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyURemInst() argument
998 if (Value *V = SimplifyRem(Instruction::URem, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyURemInst()
1005 const DominatorTree *DT) { in SimplifyURemInst() argument
1006 return ::SimplifyURemInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyURemInst()
1023 const DominatorTree *DT) { in SimplifyFRemInst() argument
1024 return ::SimplifyFRemInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyFRemInst()
1030 const TargetData *TD, const DominatorTree *DT, in SimplifyShift() argument
1060 if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyShift()
1066 if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyShift()
1075 const TargetData *TD, const DominatorTree *DT, in SimplifyShlInst() argument
1077 if (Value *V = SimplifyShift(Instruction::Shl, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyShlInst()
1093 const TargetData *TD, const DominatorTree *DT) { in SimplifyShlInst() argument
1094 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, TD, DT, RecursionLimit); in SimplifyShlInst()
1100 const TargetData *TD, const DominatorTree *DT, in SimplifyLShrInst() argument
1102 if (Value *V = SimplifyShift(Instruction::LShr, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyLShrInst()
1119 const TargetData *TD, const DominatorTree *DT) { in SimplifyLShrInst() argument
1120 return ::SimplifyLShrInst(Op0, Op1, isExact, TD, DT, RecursionLimit); in SimplifyLShrInst()
1126 const TargetData *TD, const DominatorTree *DT, in SimplifyAShrInst() argument
1128 if (Value *V = SimplifyShift(Instruction::AShr, Op0, Op1, TD, DT, MaxRecurse)) in SimplifyAShrInst()
1149 const TargetData *TD, const DominatorTree *DT) { in SimplifyAShrInst() argument
1150 return ::SimplifyAShrInst(Op0, Op1, isExact, TD, DT, RecursionLimit); in SimplifyAShrInst()
1156 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyAndInst() argument
1201 if (Value *V = SimplifyAssociativeBinOp(Instruction::And, Op0, Op1, TD, DT, in SimplifyAndInst()
1207 TD, DT, MaxRecurse)) in SimplifyAndInst()
1212 TD, DT, MaxRecurse)) in SimplifyAndInst()
1217 TD, DT, MaxRecurse)) in SimplifyAndInst()
1223 if (Value *V = ThreadBinOpOverSelect(Instruction::And, Op0, Op1, TD, DT, in SimplifyAndInst()
1230 if (Value *V = ThreadBinOpOverPHI(Instruction::And, Op0, Op1, TD, DT, in SimplifyAndInst()
1238 const DominatorTree *DT) { in SimplifyAndInst() argument
1239 return ::SimplifyAndInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyAndInst()
1245 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyOrInst() argument
1300 if (Value *V = SimplifyAssociativeBinOp(Instruction::Or, Op0, Op1, TD, DT, in SimplifyOrInst()
1306 TD, DT, MaxRecurse)) in SimplifyOrInst()
1311 TD, DT, MaxRecurse)) in SimplifyOrInst()
1317 if (Value *V = ThreadBinOpOverSelect(Instruction::Or, Op0, Op1, TD, DT, in SimplifyOrInst()
1324 if (Value *V = ThreadBinOpOverPHI(Instruction::Or, Op0, Op1, TD, DT, in SimplifyOrInst()
1332 const DominatorTree *DT) { in SimplifyOrInst() argument
1333 return ::SimplifyOrInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyOrInst()
1339 const DominatorTree *DT, unsigned MaxRecurse) { in SimplifyXorInst() argument
1369 if (Value *V = SimplifyAssociativeBinOp(Instruction::Xor, Op0, Op1, TD, DT, in SimplifyXorInst()
1375 TD, DT, MaxRecurse)) in SimplifyXorInst()
1391 const DominatorTree *DT) { in SimplifyXorInst() argument
1392 return ::SimplifyXorInst(Op0, Op1, TD, DT, RecursionLimit); in SimplifyXorInst()
1422 const TargetData *TD, const DominatorTree *DT, in SimplifyICmpInst() argument
1625 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1631 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1643 SrcOp, RI->getOperand(0), TD, DT, in SimplifyICmpInst()
1659 SrcOp, Trunc, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1704 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1718 if (Value *V = SimplifyICmpInst(Pred, SrcOp, Trunc, TD, DT, in SimplifyICmpInst()
1754 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1763 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1797 TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1804 C == LHS ? D : C, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1813 if (Value *V = SimplifyICmpInst(Pred, Y, Z, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1887 RBO->getOperand(0), TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1898 RBO->getOperand(0), TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1952 if (Value *V = SimplifyICmpInst(EqP, A, B, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
1966 if (Value *V = SimplifyICmpInst(InvEqP, A, B, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
2022 if (Value *V = SimplifyICmpInst(EqP, A, B, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
2036 if (Value *V = SimplifyICmpInst(InvEqP, A, B, TD, DT, MaxRecurse-1)) in SimplifyICmpInst()
2096 if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, TD, DT, MaxRecurse)) in SimplifyICmpInst()
2102 if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, TD, DT, MaxRecurse)) in SimplifyICmpInst()
2109 const TargetData *TD, const DominatorTree *DT) { in SimplifyICmpInst() argument
2110 return ::SimplifyICmpInst(Predicate, LHS, RHS, TD, DT, RecursionLimit); in SimplifyICmpInst()
2116 const TargetData *TD, const DominatorTree *DT, in SimplifyFCmpInst() argument
2191 if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, TD, DT, MaxRecurse)) in SimplifyFCmpInst()
2197 if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, TD, DT, MaxRecurse)) in SimplifyFCmpInst()
2204 const TargetData *TD, const DominatorTree *DT) { in SimplifyFCmpInst() argument
2205 return ::SimplifyFCmpInst(Predicate, LHS, RHS, TD, DT, RecursionLimit); in SimplifyFCmpInst()
2304 static Value *SimplifyPHINode(PHINode *PN, const DominatorTree *DT) { in SimplifyPHINode() argument
2332 return ValueDominatesPHI(CommonValue, PN, DT) ? CommonValue : 0; in SimplifyPHINode()
2343 const TargetData *TD, const DominatorTree *DT, in SimplifyBinOp() argument
2348 TD, DT, MaxRecurse); in SimplifyBinOp()
2351 TD, DT, MaxRecurse); in SimplifyBinOp()
2352 case Instruction::Mul: return SimplifyMulInst (LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2353 case Instruction::SDiv: return SimplifySDivInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2354 case Instruction::UDiv: return SimplifyUDivInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2355 case Instruction::FDiv: return SimplifyFDivInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2356 case Instruction::SRem: return SimplifySRemInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2357 case Instruction::URem: return SimplifyURemInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2358 case Instruction::FRem: return SimplifyFRemInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2361 TD, DT, MaxRecurse); in SimplifyBinOp()
2363 return SimplifyLShrInst(LHS, RHS, /*isExact*/false, TD, DT, MaxRecurse); in SimplifyBinOp()
2365 return SimplifyAShrInst(LHS, RHS, /*isExact*/false, TD, DT, MaxRecurse); in SimplifyBinOp()
2366 case Instruction::And: return SimplifyAndInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2367 case Instruction::Or: return SimplifyOrInst (LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2368 case Instruction::Xor: return SimplifyXorInst(LHS, RHS, TD, DT, MaxRecurse); in SimplifyBinOp()
2378 if (Value *V = SimplifyAssociativeBinOp(Opcode, LHS, RHS, TD, DT, in SimplifyBinOp()
2385 if (Value *V = ThreadBinOpOverSelect(Opcode, LHS, RHS, TD, DT, in SimplifyBinOp()
2392 if (Value *V = ThreadBinOpOverPHI(Opcode, LHS, RHS, TD, DT, MaxRecurse)) in SimplifyBinOp()
2400 const TargetData *TD, const DominatorTree *DT) { in SimplifyBinOp() argument
2401 return ::SimplifyBinOp(Opcode, LHS, RHS, TD, DT, RecursionLimit); in SimplifyBinOp()
2407 const TargetData *TD, const DominatorTree *DT, in SimplifyCmpInst() argument
2410 return SimplifyICmpInst(Predicate, LHS, RHS, TD, DT, MaxRecurse); in SimplifyCmpInst()
2411 return SimplifyFCmpInst(Predicate, LHS, RHS, TD, DT, MaxRecurse); in SimplifyCmpInst()
2415 const TargetData *TD, const DominatorTree *DT) { in SimplifyCmpInst() argument
2416 return ::SimplifyCmpInst(Predicate, LHS, RHS, TD, DT, RecursionLimit); in SimplifyCmpInst()
2422 const DominatorTree *DT) { in SimplifyInstruction() argument
2433 TD, DT); in SimplifyInstruction()
2439 TD, DT); in SimplifyInstruction()
2442 Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2445 Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2448 Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2451 Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2454 Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2457 Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2460 Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2466 TD, DT); in SimplifyInstruction()
2471 TD, DT); in SimplifyInstruction()
2476 TD, DT); in SimplifyInstruction()
2479 Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2482 Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2485 Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2489 I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2493 I->getOperand(0), I->getOperand(1), TD, DT); in SimplifyInstruction()
2497 I->getOperand(2), TD, DT); in SimplifyInstruction()
2501 Result = SimplifyGEPInst(Ops, TD, DT); in SimplifyInstruction()
2508 IV->getIndices(), TD, DT); in SimplifyInstruction()
2512 Result = SimplifyPHINode(cast<PHINode>(I), DT); in SimplifyInstruction()
2530 const DominatorTree *DT) { in ReplaceAndSimplifyAllUses() argument
2554 SimplifiedVal = SimplifyInstruction(User, TD, DT); in ReplaceAndSimplifyAllUses()
2559 ReplaceAndSimplifyAllUses(User, SimplifiedVal, TD, DT); in ReplaceAndSimplifyAllUses()