llvm-svn: 37407

llvm-svn: 37406

llvm-svn: 37403

llvm-svn: 37402

There's no need to have an Expression class... Value works just as well!  This simplifies a lot of code.

llvm-svn: 37401

llvm-svn: 37390

llvm-svn: 37389

llvm-svn: 37386

llvm-svn: 37376

llvm-svn: 37366

llvm-svn: 37360

half of PR1421, by not decimating structs with holes that are the source and
destination of a memcpy.

llvm-svn: 37358

llvm-svn: 37350

llvm-svn: 37348

debugging lines.

llvm-svn: 37347

llvm-svn: 37346

set this way is _SLOW_.  Somewhere down the line, I'll look at speeding it up.

llvm-svn: 37345

Very first part of a GVN-PRE implementation.  It currently performs a bunch of analysis, and nothing more.  It is also quite slow for the moment.  However,
it should give a sense of what's going on.

llvm-svn: 37343

llvm-svn: 37326

llvm-svn: 37321

llvm-svn: 37297

objc code due to the way the FE lowers objc message sends.

llvm-svn: 37256

into:

_t:
        movl 8(%esp), %ecx
        movl 4(%esp), %eax
        cmpl %ecx, %eax
        je LBB1_3       #bb17
LBB1_1: #bb
        cmpl %ecx, %eax
        jg LBB1_4       #cond_true
LBB1_2: #cond_false
        subl %eax, %ecx
        cmpl %ecx, %eax
        jne LBB1_1      #bb
LBB1_3: #bb17
        ret
LBB1_4: #cond_true
        subl %ecx, %eax
        cmpl %ecx, %eax
        jne LBB1_1      #bb
        jmp LBB1_3      #bb17

instead of:

_t:
        subl $4, %esp
        movl %esi, (%esp)
        movl 12(%esp), %ecx
        movl 8(%esp), %eax
        cmpl %ecx, %eax
        je LBB1_4       #bb17
LBB1_1: #bb.outer
        movl %ecx, %edx
        negl %edx
LBB1_2: #bb
        cmpl %ecx, %eax
        jle LBB1_5      #cond_false
LBB1_3: #cond_true
        addl %edx, %eax
        cmpl %ecx, %eax
        jne LBB1_2      #bb
LBB1_4: #bb17
        movl (%esp), %esi
        addl $4, %esp
        ret
LBB1_5: #cond_false
        movl %ecx, %edx
        subl %eax, %edx
        movl %eax, %esi
        addl %esi, %esi
        cmpl %ecx, %esi
        je LBB1_4       #bb17
LBB1_6: #cond_false.bb.outer_crit_edge
        movl %edx, %ecx
        jmp LBB1_1      #bb.outer

llvm-svn: 37252

Test case at Transformations/SCCP/2007-05-16-InvokeCrash.ll

llvm-svn: 37185

llvm-svn: 37081

llvm-svn: 37057

llvm-svn: 37034

llvm-svn: 37020

llvm-svn: 36996

llvm-svn: 36994

with unknown trip counts. This is left off by default, and a
command-line option enables it. It also begins to separate loop
unrolling into a utility routine; eventually it might be made usable
from other passes.

It currently works by inserting conditional branches between each
unrolled iteration, unless it proves that the trip count is a
multiple of a constant integer > 1, which it currently only does in
the rare case that the trip count expression is a Mul operator with
a ConstantInt operand. Eventually this information might be provided
by other sources, for example by a pass that peels/splits the loop
for this purpose.

llvm-svn: 36990

Transforms/InstCombine/2006-12-08-ICmp-Combining.ll

llvm-svn: 36989

llvm-svn: 36984

Testcases :
http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20070507/049451.html
http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20070507/049452.html

llvm-svn: 36955

llvm-svn: 36936

llvm-svn: 36935

llvm-svn: 36917

llvm-svn: 36894

llvm-svn: 36873

llvm-svn: 36857