JitIL: Fixed comment out style reviewed in r6017.

git-svn-id: https://dolphin-emu.googlecode.com/svn/trunk@6022 8ced0084-cf51-0410-be5f-012b33b47a6e
This commit is contained in:
nodchip 2010-08-01 01:23:14 +00:00
parent 76ca439bdf
commit f79eff00e4

View file

@ -1145,19 +1145,21 @@ void IRBuilder::simplifyCommutative(unsigned Opcode, InstLoc& Op1, InstLoc& Op2)
} }
// FIXME: Following code has a bug. // FIXME: Following code has a bug.
//// ((w op x) op (y op z)) => (((w op x) op y) op z) // ((w op x) op (y op z)) => (((w op x) op y) op z)
//if (getOpcode(*Op1) == Opcode && getOpcode(*Op2) == Opcode) { /*
// // Sort the operands where the complexities will be descending order. if (getOpcode(*Op1) == Opcode && getOpcode(*Op2) == Opcode) {
// std::pair<unsigned, InstLoc> ops[4]; // Sort the operands where the complexities will be descending order.
// ops[0] = std::make_pair(getComplexity(getOp1(Op1)), getOp1(Op1)); std::pair<unsigned, InstLoc> ops[4];
// ops[1] = std::make_pair(getComplexity(getOp2(Op1)), getOp2(Op1)); ops[0] = std::make_pair(getComplexity(getOp1(Op1)), getOp1(Op1));
// ops[2] = std::make_pair(getComplexity(getOp1(Op2)), getOp1(Op2)); ops[1] = std::make_pair(getComplexity(getOp2(Op1)), getOp2(Op1));
// ops[3] = std::make_pair(getComplexity(getOp2(Op2)), getOp2(Op2)); ops[2] = std::make_pair(getComplexity(getOp1(Op2)), getOp1(Op2));
// std::sort(ops, ops + 4, std::greater<std::pair<unsigned, InstLoc> >()); ops[3] = std::make_pair(getComplexity(getOp2(Op2)), getOp2(Op2));
std::sort(ops, ops + 4, std::greater<std::pair<unsigned, InstLoc> >());
// Op1 = FoldBiOp(Opcode, FoldBiOp(Opcode, ops[0].second, ops[1].second), ops[2].second); Op1 = FoldBiOp(Opcode, FoldBiOp(Opcode, ops[0].second, ops[1].second), ops[2].second);
// Op2 = ops[3].second; Op2 = ops[3].second;
//} }
*/
} }
bool IRBuilder::maskedValueIsZero(InstLoc Op1, InstLoc Op2) const { bool IRBuilder::maskedValueIsZero(InstLoc Op1, InstLoc Op2) const {