forked from OSchip/llvm-project
parent
bace94eda8
commit
d09b44a752
|
@ -1413,7 +1413,7 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
|
||||||
if (B == tmpOp0) {
|
if (B == tmpOp0) {
|
||||||
std::swap(A, B);
|
std::swap(A, B);
|
||||||
}
|
}
|
||||||
// Notice that the patten (A&(~B)) is actually (A&(-1^B)), so if
|
// Notice that the pattern (A&(~B)) is actually (A&(-1^B)), so if
|
||||||
// A is originally -1 (or a vector of -1 and undefs), then we enter
|
// A is originally -1 (or a vector of -1 and undefs), then we enter
|
||||||
// an endless loop. By checking that A is non-constant we ensure that
|
// an endless loop. By checking that A is non-constant we ensure that
|
||||||
// we will never get to the loop.
|
// we will never get to the loop.
|
||||||
|
|
Loading…
Reference in New Issue