permutations of this pattern.

llvm-svn: 60312

an 128-bit-wide integer.  No testcase; the issue I ran into depends on 
local changes.

llvm-svn: 60311

This speeds up GVN from 4.0386s to 3.9376s.

llvm-svn: 60310

remove some fixme's.  This speeds up GVN very slightly on 403.gcc 
(4.06->4.03s)

llvm-svn: 60309

redundant with MemDepResult, and MemDepResult has a nicer interface.

llvm-svn: 60308

functional change.

llvm-svn: 60307

Note that the FoldOpIntoPhi call is dead because it's impossible for the 
first operand of a subtraction to be both a ConstantInt and a PHINode.

llvm-svn: 60306

llvm-svn: 60305

getAnalysis<>.  getAnalysis<> is apparently extremely expensive.
Doing this speeds up GVN on 403.gcc by 16%!

llvm-svn: 60304

llvm-svn: 60303

llvm-svn: 60301

llvm-svn: 60300

llvm-svn: 60299

llvm-svn: 60298

llvm-svn: 60297

llvm-svn: 60296

llvm-svn: 60295

llvm-svn: 60291

takes care of all permutations of this pattern.

llvm-svn: 60290

llvm-svn: 60289

APInt calls instead.

This fixes PR3144.

llvm-svn: 60288

only show up in code from front-ends besides llvm-gcc, like clang.

llvm-svn: 60287

llvm-svn: 60286

Hopefully this isn't too much stuff to dump into this file.

llvm-svn: 60285

as unsigned divisions.  Same caveats as before.

llvm-svn: 60284

multiplies.

Some more cleverness would be nice, though. It would be nice if we 
could do this transformation on illegal types.  Also, we would 
prefer a narrower constant when possible so that we can use a narrower
multiply, which can be cheaper.

llvm-svn: 60283

llvm-svn: 60282

llvm-svn: 60281

This fixes PR3127
http://llvm.org/bugs/show_bug.cgi?id=3127

llvm-svn: 60280

llvm-svn: 60279

"For signed integers, the determination of overflow of x*y is not so simple. If
x and y have the same sign, then overflow occurs iff xy > 2**31 - 1. If they
have opposite signs, then overflow occurs iff xy < -2**31."

In this case, x == -1.

llvm-svn: 60278

nearby FIXME.

I'm not sure what the right way to fix the Cell test was; if the 
approach I used isn't okay, please let me know.

llvm-svn: 60277

llvm-svn: 60276

overflowed on negation. This commit checks to make sure that neithe C nor X
overflows. This requires that the RHS of X (a subtract instruction) be a
constant integer.

llvm-svn: 60275

ReverseLocalDeps when we update it.  This fixes a regression test
failure from my last commit.

Second, for each non-local cached information structure, keep a bit that
indicates whether it is dirty or not.  This saves us a scan over the whole
thing in the common case when it isn't dirty.

llvm-svn: 60274

Hopefully this doesn't break anyone else's build... it shouldn't unless 
the MinGW variable means something other than compiling with MinGW.

llvm-svn: 60273

llvm-svn: 60272

instead of containing them by value.  This increases the density
(!) of NonLocalDeps as well as making the reallocation case 
faster.  This speeds up gvn on 403.gcc by 2% and makes room for
future improvements.

I'm not super thrilled with having to explicitly manage the new/delete
of the map, but it is necesary for the next change.

llvm-svn: 60271

initializers.  llvm-gcc appears to be more aggressive, but incorrect, 
for constructs like "const int a[] = {1,2,3};"; that said, current 
optimizers will do the appropriate optimizations when safe.

llvm-svn: 60270

llvm-svn: 60269