Remove an optimization that isn't.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3419 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-08-21 22:10:06 +00:00
parent d92ac5ae01
commit 905641bb01

View File

@ -88,13 +88,15 @@ IsZero(Value* idx)
bool
DecomposePass::decomposeArrayRef(BasicBlock::iterator &BBI)
{
// FIXME: If condition below
MemAccessInst &MAI = cast<MemAccessInst>(*BBI);
// FIXME: If condition below
// If this instr two or fewer arguments and the first argument is 0,
// the decomposed version is identical to the instruction itself.
// This is common enough that it is worth checking for explicitly...
if (MAI.getNumIndices() == 0 ||
(MAI.getNumIndices() <= 2 && IsZero(*MAI.idx_begin()))) {
// If this instr has no indexes, then the decomposed version is identical to
// the instruction itself. FIXME: this should go away once GEP is the only
// MAI
//
if (MAI.getNumIndices() == 0) {
++BBI;
return false;
}