Radar 9097659

llvm-svn: 127182

then the result could go either way. If it's provably positive then so is the
srem. Fixes PR9343 #7!

llvm-svn: 127146

thing for variables.

llvm-svn: 127138

the value splatted into every element. Extend this to getTrue and getFalse which
by providing new overloads that take Types that are either i1 or <N x i1>. Use
it in InstCombine to add vector support to some code, fixing PR8469!

llvm-svn: 127116

InstCombine: We know the number of items initially added to the worklist map, reserve space early to avoid rehashing.

llvm-svn: 127089

the percentage of time spent in CodeGenPrepare when llcing 403.gcc from 12.6% to
1.8% of total llc time.

llvm-svn: 127069

possible. This goes into instcombine and instsimplify because instsimplify
doesn't need to check hasOneUse since it returns (almost exclusively) constants.

This fixes PR9343 #4 #5 and #8!

llvm-svn: 127064

true/false or "icmp slt/sge Y, 0".

llvm-svn: 127063

Avoid colliding with the sentinels, hopefully unbreaking
llvm-gcc-x86_64-linux-selfhost.

llvm-svn: 126982

llvm-svn: 126941

and siprintf is available on the target.

llvm-svn: 126940

and siprintf is available on the target.

llvm-svn: 126937

and iprintf is available on the target. Currently iprintf is only
marked as being available on the XCore.

llvm-svn: 126935

llvm-svn: 126826

llvm-svn: 126825

addressing code. On 403.gcc this almost halves CodeGenPrepare time and reduces
total llc time by 9.5%. Unfortunately, getNumUses() is still the hottest function
in llc.

llvm-svn: 126782

intersection of the LHS and RHS ConstantRanges and return "false" when
the range is empty.

This simplifies some code and catches some extra cases.

llvm-svn: 126744

llvm-svn: 126720

llvm-svn: 126715

llvm-svn: 126694

llvm-svn: 126671

only existed as the result of a misunderstanding.

llvm-svn: 126669

Based on a patch by Alistair Lynn.

llvm-svn: 126647

also have a zero when numerator = denominator. Reverts parts of r126635 and
r126637.

llvm-svn: 126644

PR9343.

llvm-svn: 126643

argument), regardless of the divisor. Teach instcombine about this and fix
test7 in PR9343!

llvm-svn: 126635

Yes, there are other types than i8* and GEPs on them can produce an add+multiply.
We don't consider that cheap enough to be speculatively executed.

llvm-svn: 126481

llvm-svn: 126452

llvm-svn: 126445

llvm-svn: 126398

trivial places.  This pass needs a lot of work.

llvm-svn: 126367

to reduce nesting.  This needs to be turned into a table.

llvm-svn: 126366

function prototype into a call to a varargs prototype.  We do
allow the xform if we have a definition, but otherwise we don't
want to risk that we're changing the abi in a subtle way.  On
X86-64, for example, varargs require passing stuff in %al.

llvm-svn: 126363

values from all of the loop's exiting blocks are equal. Patch by Andrew Clinton.

llvm-svn: 126253

itself without going via a phi node then we could return false here in
spite of making a change.  Also, tweak the comment because this method
can (and always could) return true without deleting the original phi node.
For example, if the phi node was used by a read-only invoke instruction
which is used by another phi node phi2 which is only used by and only uses
the invoke, then phi2 would be deleted but not the invoke instruction and
not the original phi node.

llvm-svn: 126129

llvm-svn: 126125

should be that if the phi is used by a side-effect free instruction with
no uses then the phi and the instruction now get zapped (checked by the
unittest).

llvm-svn: 126124

llvm-svn: 126102

test for that. With this change, test/CodeGen/X86/codegen-dce.ll no longer finds
any instructions to DCE, so delete the test.

Also renamed J and JP to I and IP in RecursivelyDeleteDeadPHINode.

llvm-svn: 126088

llvm-svn: 126082