mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 12:02:58 +02:00
Move this debug statement earlier so it is easy to see the order in
which operands come flying out of the linearization stage. llvm-svn: 157512
This commit is contained in:
parent
c2a0abf91f
commit
ac716e0801
@ -1446,6 +1446,8 @@ Value *Reassociate::ReassociateExpression(BinaryOperator *I) {
|
|||||||
SmallVector<ValueEntry, 8> Ops;
|
SmallVector<ValueEntry, 8> Ops;
|
||||||
LinearizeExprTree(I, Ops);
|
LinearizeExprTree(I, Ops);
|
||||||
|
|
||||||
|
DEBUG(dbgs() << "RAIn:\t"; PrintOps(I, Ops); dbgs() << '\n');
|
||||||
|
|
||||||
// Now that we have linearized the tree to a list and have gathered all of
|
// Now that we have linearized the tree to a list and have gathered all of
|
||||||
// the operands and their ranks, sort the operands by their rank. Use a
|
// the operands and their ranks, sort the operands by their rank. Use a
|
||||||
// stable_sort so that values with equal ranks will have their relative
|
// stable_sort so that values with equal ranks will have their relative
|
||||||
@ -1454,8 +1456,6 @@ Value *Reassociate::ReassociateExpression(BinaryOperator *I) {
|
|||||||
// the vector.
|
// the vector.
|
||||||
std::stable_sort(Ops.begin(), Ops.end());
|
std::stable_sort(Ops.begin(), Ops.end());
|
||||||
|
|
||||||
DEBUG(dbgs() << "RAIn:\t"; PrintOps(I, Ops); dbgs() << '\n');
|
|
||||||
|
|
||||||
// OptimizeExpression - Now that we have the expression tree in a convenient
|
// OptimizeExpression - Now that we have the expression tree in a convenient
|
||||||
// sorted form, optimize it globally if possible.
|
// sorted form, optimize it globally if possible.
|
||||||
if (Value *V = OptimizeExpression(I, Ops)) {
|
if (Value *V = OptimizeExpression(I, Ops)) {
|
||||||
|
Loading…
Reference in New Issue
Block a user