Lines Matching refs:Folded
870 // The cast wasn't folded; create an explicit cast node. We can reuse
1029 // The cast wasn't folded; create an explicit cast node.
1277 // The cast wasn't folded; create an explicit cast node.
1310 // Next try a zext cast. If the cast is folded, use it.
1315 // Next try a sext cast. If the cast is folded, use it.
1320 // Force the cast to be folded into the operands of an addrec.
1487 Ops.erase(Ops.begin()+1); // Erase the folded element
1526 // folded. eg., trunc(x) + m*trunc(n) --> trunc(x + trunc(m)*n)
1750 // Otherwise, add the folded AddRec by the non-invariant parts.
1759 // Okay, if there weren't any loop invariants to be folded, check to see if
1899 Ops.erase(Ops.begin()+1); // Erase the folded element
2007 // Otherwise, multiply the folded AddRec by the non-invariant parts.
2016 // Okay, if there weren't any loop invariants to be folded, check to see if
2120 // Determine if the division can be folded into the operands of
2135 // {X,+,N}/C --> {X/C,+,N/C} if safe and N/C can be folded.
2165 // (A*B)/C --> A*(B/C) if safe and B/C can be folded.
2183 // (A+B)/C --> (A/C + B/C) if safe and A/C and B/C can be folded.
2387 Ops.erase(Ops.begin()+1); // Erase the folded element
2491 Ops.erase(Ops.begin()+1); // Erase the folded element
2584 if (Constant *Folded = ConstantFoldConstantExpression(CE, TD))
2585 C = Folded;
2593 if (Constant *Folded = ConstantFoldConstantExpression(CE, TD))
2594 C = Folded;
2610 if (Constant *Folded = ConstantFoldConstantExpression(CE, TD))
2611 C = Folded;
2620 if (Constant *Folded = ConstantFoldConstantExpression(CE, TD))
2621 C = Folded;
4911 // Check to see if we've folded this expression at this loop before.
5016 // foldable. Build a new instance of the folded commutative expression.
5060 // foldable. Build a new instance of the folded commutative expression.
5071 // The addrec may be folded to a nonrecurrence, for example, if the
5073 // ahead and return the folded value.
5383 // this, and if they did, they would already be constant folded.
