llvm-svn: 50080

getelementptr-seteq.ll into:

define i1 @test(i64 %X, %S* %P) {
	%C = icmp eq i64 %X, -1		; <i1> [#uses=1]
	ret i1 %C
}

instead of:

define i1 @test(i64 %X, %S* %P) {
	%A.idx.mask = and i64 %X, 4611686018427387903		; <i64> [#uses=1]
	%C = icmp eq i64 %A.idx.mask, 4611686018427387903		; <i1> [#uses=1]
	ret i1 %C
}

And fixes the second half of PR2235.  This speeds up the insertion sort
case by 45%, from 1.12s to 0.77s.  In practice, this will significantly
speed up for loops structured like:

for (double *P = Base + N; P != Base; --P)
  ...

Which happens frequently for C++ iterators.

llvm-svn: 50079

llvm-svn: 50047

llvm-svn: 50035

and simplify code that was fallout from the separation of memcpyopt and gvn.

llvm-svn: 50034

fixes a crash in opt on 433.milc.

llvm-svn: 50023

llvm-svn: 50022

as a global helper function.  At the same type, switch it from taking
a vector of predecessors to an arbitrary sequential input.  This allows
us to switch LoopSimplify to use a SmallVector for various temporary
vectors that it passed into SplitBlockPredecessors.

llvm-svn: 50020

nodes, removing a hack.

llvm-svn: 50019

instead of doing it after every call.

llvm-svn: 50018

llvm-svn: 50016

llvm-svn: 50015

llvm-svn: 50014

llvm-svn: 50006

a call to Instruction::isUsedOutsideOfBlock.

llvm-svn: 50005

llvm-svn: 50003

Add a cost function.

llvm-svn: 50002

such as those in PR2235.  Right now the pass is not very
effective. :)

llvm-svn: 50000

llvm-svn: 49989

llvm-svn: 49977

of elements.  Patch by Matthijs Kooijman!

llvm-svn: 49962

llvm-svn: 49842

llvm-svn: 49838

wee problem in Xcode 2.[45]/gcc 4.0.1.

llvm-svn: 49831

VisualStudio project files updated.  #include <algorithm> added to make VisualStudio happy.  Also had to undefine setjmp because of #include <csetjmp> turning setjmp into _setjmp in VisualStudio.

llvm-svn: 49743

llvm-svn: 49681

llvm-svn: 49671

llvm-svn: 49657

which is significantly more efficient.

llvm-svn: 49614

of calls and less aggressive with non-readnone calls.

llvm-svn: 49516

in addition to integer expressions. Rewrite GetOrEnforceKnownAlignment
as a ComputeMaskedBits problem, moving all of its special alignment
knowledge to ComputeMaskedBits as low-zero-bits knowledge.

Also, teach ComputeMaskedBits a few basic things about Mul and PHI
instructions.

This improves ComputeMaskedBits-based simplifications in a few cases,
but more noticeably it significantly improves instcombine's alignment
detection for loads, stores, and memory intrinsics.

llvm-svn: 49492

This is not safe for all inputs.

llvm-svn: 49458

figuring out the suffix to use.  implement pow(2,x) -> exp2(x).

llvm-svn: 49437

long double and simplify the code.

llvm-svn: 49435

llvm-svn: 49430

GVN and into its own pass.

llvm-svn: 49419

llvm-svn: 49418

add support for  pow(x, 2.0) -> x*x.

llvm-svn: 49411

llvm-svn: 49367

in both time and memory savings for GVN.  For example, one testcase went from 10.5s to 6s with
this patch.

llvm-svn: 49345