llvm-svn: 109103

llvm-svn: 109101

llvm-svn: 109100

llvm-svn: 109099

llvm-svn: 109098

llvm-svn: 109092

for creating and populating NamedMDNodes.

llvm-svn: 109061

llvm-svn: 109045

llvm-svn: 108968

llvm-svn: 108967

llvm-svn: 108962

llvm-svn: 108961

avoiding MDNode overhead.

llvm-svn: 108909

use getIncomingValueForBlock instead of
LoopInfo::getCanonicalInductionVariableIncrement.

llvm-svn: 108865

llvm-svn: 108736

llvm-svn: 108687

llvm-svn: 108614

so there is no locking involved in type refinement.

llvm-svn: 108553

a redundant loopsimplify run from the default -O2 sequence.

llvm-svn: 108539

llvm-svn: 108530

llvm-svn: 108522

llvm-svn: 108517

Working on testcases for Owen.

llvm-svn: 108494

different widths. In a use with a narrower fixup, formulae
may be wider than the fixup, in which case the high bits
aren't necessarily meaningful, so it isn't safe to reuse
them for uses with wider fixups.

This fixes PR7618, though the testcase is too large for a
reasonable regression test, since it heavily dependes on
hitting LSR's heuristics in a certain way.

llvm-svn: 108455

llvm-svn: 108453

llvm-svn: 108436

the corresponding or-icmp-and pattern.  This has the added benefit of doing
the matching earlier, and thus being less susceptible to being confused by
earlier transforms.

llvm-svn: 108429

llvm-svn: 108427

a zero. This situation arrises in Fortran code with induction variables
that start at 1 instead of 0. This fixes PR7651.

llvm-svn: 108424

This now passes LIT, nighty test, and llvm-gcc bootstrap on my machine.

llvm-svn: 108422

llvm-svn: 108418

llvm-svn: 108417

it *changing* the things it replaces, not just causing them
to drop to null.  There is no functionality change yet, but 
this is required for a subsequent patch.

llvm-svn: 108414

llvm-svn: 108389

Add instcombine transforms to optimize tests of multiple bits of the same value into a single larger comparison.

llvm-svn: 108378

"bonus" instruction to be speculatively executed.  Add a heuristic to
ensure we're not tripping up out-of-order execution by checking that this bonus
instruction only uses values that were already guaranteed to be available.

This allows us to eliminate the short circuit in (x&1)&&(x&2).

llvm-svn: 108351

llvm-svn: 108322

reapply benjamin's instcombine patch, I don't see anything wrong with it and can't repro any problems with a manual self-host.

llvm-svn: 108320

llvm-svn: 108252

by a return that returns a constant, while elsewhere in the function
another return instruction returns a different constant.  This is a
special case of accumulator recursion, so just generalize the existing
logic a bit.

llvm-svn: 108241