maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
26,700 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

26659 Commits

Author SHA1 Message Date
Chris Lattner f11327daab more notes 
llvm-svn: 30598
 2006-09-25 17:12:14 +00:00
Jim Laskey d07be232ba Core antialiasing for load and store. 
llvm-svn: 30597
 2006-09-25 16:29:54 +00:00
Andrew Lenharth 6d8e227ac7 Fix 
llvm-svn: 30596
 2006-09-25 14:04:53 +00:00
Andrew Lenharth 5e2bacd6be Fix jump tables to match gcc (and the ABI and whatnot) 
llvm-svn: 30594
 2006-09-24 19:46:56 +00:00
Andrew Lenharth 783a4a9d86 Add support for other relocation bases to jump tables, as well as custom asm directives 
llvm-svn: 30593
 2006-09-24 19:45:58 +00:00
Andrew Lenharth 3cec4952ab basic jump table test 
llvm-svn: 30592
 2006-09-24 19:42:02 +00:00
Andrew Lenharth 68324f8f85 jump table note 
llvm-svn: 30591
 2006-09-24 13:13:10 +00:00
Evan Cheng 77c0757f8b PIC jump table entries are always 32-bit. This fixes PIC jump table support on X86-64. 
llvm-svn: 30590
 2006-09-24 05:22:38 +00:00
Nick Lewycky 25587182f3 Enable 'predsimplify' optimization. 
llvm-svn: 30589
 2006-09-24 00:08:16 +00:00
Nick Lewycky 059c79264f Style changes only. Remove dead code, fix a comment. 
llvm-svn: 30588
 2006-09-23 15:13:08 +00:00
Chris Lattner 6bd6da4097 Be far more careful when splitting a loop header, either to form a preheader 
or when splitting loops with a common header into multiple loops.  In particular
the old code would always insert the preheader before the old loop header.  This
is disasterous in cases where the loop hasn't been rotated.  For example, it can
produce code like:

        .. outside the loop...
        jmp LBB1_2      #bb13.outer
LBB1_1: #bb1
        movsd 8(%esp,%esi,8), %xmm1
        mulsd (%edi), %xmm1
        addsd %xmm0, %xmm1
        addl $24, %edi
        incl %esi
        jmp LBB1_3      #bb13
LBB1_2: #bb13.outer
        leal (%edx,%eax,8), %edi
        pxor %xmm1, %xmm1
        xorl %esi, %esi
LBB1_3: #bb13
        movapd %xmm1, %xmm0
        cmpl $4, %esi
        jl LBB1_1       #bb1

Note that the loop body is actually LBB1_1 + LBB1_3, which means that the
loop now contains an uncond branch WITHIN it to jump around the inserted
loop header (LBB1_2).  Doh.

This patch changes the preheader insertion code to insert it in the right
spot, producing this code:

        ... outside the loop, fall into the header ...
LBB1_1: #bb13.outer
        leal (%edx,%eax,8), %esi
        pxor %xmm0, %xmm0
        xorl %edi, %edi
        jmp LBB1_3      #bb13
LBB1_2: #bb1
        movsd 8(%esp,%edi,8), %xmm0
        mulsd (%esi), %xmm0
        addsd %xmm1, %xmm0
        addl $24, %esi
        incl %edi
LBB1_3: #bb13
        movapd %xmm0, %xmm1
        cmpl $4, %edi
        jl LBB1_2       #bb1

Totally crazy, no branch in the loop! :)

llvm-svn: 30587
 2006-09-23 08:19:21 +00:00
Chris Lattner 608cd05e3f Teach UpdateDomInfoForRevectoredPreds to handle revectored preds that are not 
reachable, making it general purpose enough for use by InsertPreheaderForLoop.
Eliminate custom dominfo updating code in InsertPreheaderForLoop, using
UpdateDomInfoForRevectoredPreds instead.

llvm-svn: 30586
 2006-09-23 07:40:52 +00:00
Chris Lattner e4583e8c2c remove misleading comment 
llvm-svn: 30585
 2006-09-23 06:09:45 +00:00
Chris Lattner 4091f4690a add method, correct comment 
llvm-svn: 30584
 2006-09-23 04:03:45 +00:00
Evan Cheng 1da0ab2f58 Delete dead code; fix 80 col violations. 
llvm-svn: 30583
 2006-09-22 21:43:59 +00:00
Rafael Espindola 72d4c070c0 add a note 
llvm-svn: 30581
 2006-09-22 11:36:17 +00:00
Bill Wendling fc0e612b65 Use "%llvmgxx" instead of "llvm-g++". 
llvm-svn: 30580
 2006-09-22 07:09:01 +00:00
Nate Begeman 9007f5a48d Testcase for better rotate left and mask support 
llvm-svn: 30579
 2006-09-22 05:49:57 +00:00
Bill Wendling fe95123f58 Regression testcase for PR855. 
llvm-svn: 30578
 2006-09-22 05:34:25 +00:00
Nate Begeman d31efd190f Fold AND and ROTL more often 
llvm-svn: 30577
 2006-09-22 05:01:56 +00:00
Devang Patel 81c9e42bea remove extra white spaces. 
llvm-svn: 30576
 2006-09-22 01:07:57 +00:00
Devang Patel 0c4e730c9c Use iterative algorith to assign DFS number. This reduces 
call stack depth.

llvm-svn: 30575
 2006-09-22 01:05:33 +00:00
Chris Lattner 7d3fd4f888 don't allow 'imm' or specific imms, like '1' on the LHS of a binop. 
This shrinks X86GenDAGISel by ~330 lines.

llvm-svn: 30574
 2006-09-21 20:46:13 +00:00
Evan Cheng 449a0c7e33 Make it work for DAG combine of multi-value nodes. 
llvm-svn: 30573
 2006-09-21 19:04:05 +00:00
Chris Lattner 99ae714459 Fit to 80 columns. 
llvm-svn: 30572
 2006-09-21 18:28:27 +00:00
Jim Laskey 35f7eebb49 core corrections 
llvm-svn: 30570
 2006-09-21 17:35:47 +00:00
Devang Patel 5af1651f7d Use abstract class to facilitate dlopen() interface. 
llvm-svn: 30569
 2006-09-21 17:22:55 +00:00
Jim Laskey 5d19d59017 Basic "in frame" alias analysis. 
llvm-svn: 30568
 2006-09-21 16:28:59 +00:00
Rafael Espindola 7b700e517a more condition codes 
llvm-svn: 30567
 2006-09-21 13:06:26 +00:00
Rafael Espindola 0c71a5adc8 if a constant can't be an immediate, add it to the constant pool 
llvm-svn: 30566
 2006-09-21 11:29:52 +00:00
Chris Lattner 082db3f9aa fold (aext (and (trunc x), cst)) -> (and x, cst). 
llvm-svn: 30561
 2006-09-21 06:40:43 +00:00
Chris Lattner fa9f92cf65 Check the right value type. This fixes 186.crafty on x86 
llvm-svn: 30560
 2006-09-21 06:17:39 +00:00
Chris Lattner 08a8ccaaf1 implemented 
llvm-svn: 30559
 2006-09-21 06:14:54 +00:00
Chris Lattner 8d8a3bf9c9 Compile: 
int %test(ulong *%tmp) {
        %tmp = load ulong* %tmp         ; <ulong> [#uses=1]
        %tmp.mask = shr ulong %tmp, ubyte 50            ; <ulong> [#uses=1]
        %tmp.mask = cast ulong %tmp.mask to ubyte
        %tmp2 = and ubyte %tmp.mask, 3          ; <ubyte> [#uses=1]
        %tmp2 = cast ubyte %tmp2 to int         ; <int> [#uses=1]
        ret int %tmp2
}

to:

_test:
        movl 4(%esp), %eax
        movl 4(%eax), %eax
        shrl $18, %eax
        andl $3, %eax
        ret

instead of:

_test:
        movl 4(%esp), %eax
        movl 4(%eax), %eax
        shrl $18, %eax
        # TRUNCATE movb %al, %al
        andb $3, %al
        movzbl %al, %eax
        ret

llvm-svn: 30558
 2006-09-21 06:14:31 +00:00
Chris Lattner a31f0a622b Generalize (zext (truncate x)) and (sext (truncate x)) folding to work when 
the src/dst are not the same size.  This catches things like "truncate
32-bit X to 8 bits, then zext to 16", which happens a bit on X86.

llvm-svn: 30557
 2006-09-21 06:00:20 +00:00
Chris Lattner 1c18c0db79 Fit in 80-cols 
llvm-svn: 30556
 2006-09-21 05:46:00 +00:00
Chris Lattner 51c95cdd82 Fix Transforms/IndVarsSimplify/2006-09-20-LFTR-Crash.ll 
llvm-svn: 30555
 2006-09-21 05:12:20 +00:00
Chris Lattner 6597e053e1 new testcase 
llvm-svn: 30554
 2006-09-21 05:11:01 +00:00
Nick Lewycky c68bbef874 Fix compile error. 
llvm-svn: 30553
 2006-09-21 02:08:31 +00:00
Nick Lewycky fde9c308b2 Don't rewrite ConstantExpr::get. 
llvm-svn: 30552
 2006-09-21 01:05:35 +00:00
Nick Lewycky d74c55f483 Once we're down to "setcc type constant1, constant2", at least come up 
with the right answer.

llvm-svn: 30550
 2006-09-20 23:02:24 +00:00
Anton Korobeynikov 3c5b3df6a0 Adding codegeneration for StdCall & FastCall calling conventions 
llvm-svn: 30549
 2006-09-20 22:03:51 +00:00
Andrew Lenharth ccdaecc448 Account for pseudo-ops correctly 
llvm-svn: 30548
 2006-09-20 20:08:52 +00:00
Chris Lattner a81a75c390 The DarwinAsmPrinter need not check for isDarwin. createPPCAsmPrinterPass 
should create the right asmprinter subclass.

llvm-svn: 30542
 2006-09-20 17:12:19 +00:00
Chris Lattner 8597a2fc4e Wrap some darwin'isms with isDarwin checks. 
llvm-svn: 30541
 2006-09-20 17:07:15 +00:00
Nick Lewycky cfff1c3f86 Use a total ordering to compare instructions. 
Fixes infinite loop in resolve().

llvm-svn: 30540
 2006-09-20 17:04:01 +00:00
Andrew Lenharth 44cb67af5c simplify 
llvm-svn: 30535
 2006-09-20 15:37:57 +00:00
Andrew Lenharth f007f21c8a catch constants more often 
llvm-svn: 30534
 2006-09-20 15:05:49 +00:00
Andrew Lenharth b04e899bb4 catch another constant 
llvm-svn: 30533
 2006-09-20 15:04:55 +00:00
Andrew Lenharth 97a4e99aff clarify with test case 
llvm-svn: 30531
 2006-09-20 14:48:00 +00:00
Andrew Lenharth e2d138a462 Add Note 
llvm-svn: 30530
 2006-09-20 14:40:01 +00:00
Jim Laskey fbeab72759 Trim the home directory from the dejagnu test 
llvm-svn: 30519
 2006-09-20 09:20:22 +00:00
Chris Lattner fba9e8f422 item done 
llvm-svn: 30518
 2006-09-20 06:41:56 +00:00
Chris Lattner c8cd62d381 Compile: 
int test3(int a, int b) { return (a < 0) ? a : 0; }

to:

_test3:
        srawi r2, r3, 31
        and r3, r2, r3
        blr

instead of:

_test3:
        cmpwi cr0, r3, 1
        li r2, 0
        blt cr0, LBB2_2 ;entry
LBB2_1: ;entry
        mr r3, r2
LBB2_2: ;entry
        blr


This implements: PowerPC/select_lt0.ll:seli32_a_a

llvm-svn: 30517
 2006-09-20 06:41:35 +00:00
Chris Lattner 2b09e1d2fc new testcase 
llvm-svn: 30516
 2006-09-20 06:40:37 +00:00
Chris Lattner 27d8985a71 add a note 
llvm-svn: 30515
 2006-09-20 06:32:10 +00:00
Chris Lattner 8746e2cd57 Fold the full generality of (any_extend (truncate x)) 
llvm-svn: 30514
 2006-09-20 06:29:17 +00:00
Chris Lattner 8b68decb27 Two things: 
1. teach SimplifySetCC that '(srl (ctlz x), 5) == 0' is really x != 0.
2. Teach visitSELECT_CC to use SimplifySetCC instead of calling it and
   ignoring the result.  This allows us to compile:

bool %test(ulong %x) {
  %tmp = setlt ulong %x, 4294967296
  ret bool %tmp
}

to:

_test:
        cntlzw r2, r3
        cmplwi cr0, r3, 1
        srwi r2, r2, 5
        li r3, 0
        beq cr0, LBB1_2 ;
LBB1_1: ;
        mr r3, r2
LBB1_2: ;
        blr

instead of:

_test:
        addi r2, r3, -1
        cntlzw r2, r2
        cntlzw r3, r3
        srwi r2, r2, 5
        cmplwi cr0, r2, 0
        srwi r2, r3, 5
        li r3, 0
        bne cr0, LBB1_2 ;
LBB1_1: ;
        mr r3, r2
LBB1_2: ;
        blr

This isn't wonderful, but it's an improvement.

llvm-svn: 30513
 2006-09-20 06:19:26 +00:00
Chris Lattner f62f090ea1 This is already done 
llvm-svn: 30512
 2006-09-20 04:59:33 +00:00
Chris Lattner 380c7e9a59 We went through all that trouble to compute whether it was safe to transform 
this comparison, but never checked it.  Whoops, no wonder we miscompiled
177.mesa!

llvm-svn: 30511
 2006-09-20 04:44:59 +00:00
Chris Lattner da9b1a9322 Improve PPC64 equality comparisons like PPC32 comparisons. 
llvm-svn: 30510
 2006-09-20 04:33:27 +00:00
Chris Lattner aa3926b7ea Two improvements: 
1. Codegen this comparison:
     if (X == 0x8000)

as:

        cmplwi cr0, r3, 32768
        bne cr0, LBB1_2 ;cond_next

instead of:

        lis r2, 0
        ori r2, r2, 32768
        cmpw cr0, r3, r2
        bne cr0, LBB1_2 ;cond_next


2. Codegen this comparison:
      if (X == 0x12345678)

as:

        xoris r2, r3, 4660
        cmplwi cr0, r2, 22136
        bne cr0, LBB1_2 ;cond_next

instead of:

        lis r2, 4660
        ori r2, r2, 22136
        cmpw cr0, r3, r2
        bne cr0, LBB1_2 ;cond_next

llvm-svn: 30509
 2006-09-20 04:25:47 +00:00
Chris Lattner ab33d350a7 Add a note that we should match rlwnm better 
llvm-svn: 30508
 2006-09-20 03:59:25 +00:00
Chris Lattner 601b86513d Legalize is no longer limited to cleverness with just constant shift amounts. 
Allow it to be clever when possible and fall back to the gross code when needed.

This allows us to compile:

long long foo1(long long X, int C) {
  return X << (C|32);
}
long long foo2(long long X, int C) {
  return X << (C&~32);
}

to:
_foo1:
        rlwinm r2, r5, 0, 27, 31
        slw r3, r4, r2
        li r4, 0
        blr


        .globl  _foo2
        .align  4
_foo2:
        rlwinm r2, r5, 0, 27, 25
        subfic r5, r2, 32
        slw r3, r3, r2
        srw r5, r4, r5
        or r3, r3, r5
        slw r4, r4, r2
        blr

instead of:

_foo1:
        ori r2, r5, 32
        subfic r5, r2, 32
        addi r6, r2, -32
        srw r5, r4, r5
        slw r3, r3, r2
        slw r6, r4, r6
        or r3, r3, r5
        slw r4, r4, r2
        or r3, r3, r6
        blr


        .globl  _foo2
        .align  4
_foo2:
        rlwinm r2, r5, 0, 27, 25
        subfic r5, r2, 32
        addi r6, r2, -32
        srw r5, r4, r5
        slw r3, r3, r2
        slw r6, r4, r6
        or r3, r3, r5
        slw r4, r4, r2
        or r3, r3, r6
        blr

llvm-svn: 30507
 2006-09-20 03:47:40 +00:00
Chris Lattner 875ea0cdbd Expand 64-bit shifts more optimally if we know that the high bit of the 
shift amount is one or zero.  For example, for:

long long foo1(long long X, int C) {
  return X << (C|32);
}

long long foo2(long long X, int C) {
  return X << (C&~32);
}

we get:

_foo1:
        movb $31, %cl
        movl 4(%esp), %edx
        andb 12(%esp), %cl
        shll %cl, %edx
        xorl %eax, %eax
        ret
_foo2:
        movb $223, %cl
        movl 4(%esp), %eax
        movl 8(%esp), %edx
        andb 12(%esp), %cl
        shldl %cl, %eax, %edx
        shll %cl, %eax
        ret

instead of:

_foo1:
        subl $4, %esp
        movl %ebx, (%esp)
        movb $32, %bl
        movl 8(%esp), %eax
        movl 12(%esp), %edx
        movb %bl, %cl
        orb 16(%esp), %cl
        shldl %cl, %eax, %edx
        shll %cl, %eax
        xorl %ecx, %ecx
        testb %bl, %bl
        cmovne %eax, %edx
        cmovne %ecx, %eax
        movl (%esp), %ebx
        addl $4, %esp
        ret
_foo2:
        subl $4, %esp
        movl %ebx, (%esp)
        movb $223, %cl
        movl 8(%esp), %eax
        movl 12(%esp), %edx
        andb 16(%esp), %cl
        shldl %cl, %eax, %edx
        shll %cl, %eax
        xorl %ecx, %ecx
        xorb %bl, %bl
        testb %bl, %bl
        cmovne %eax, %edx
        cmovne %ecx, %eax
        movl (%esp), %ebx
        addl $4, %esp
        ret

llvm-svn: 30506
 2006-09-20 03:38:48 +00:00
Evan Cheng cd3f6ff0e5 Back out Chris' last set of changes. This breaks 177.mesa and povray somehow. 
llvm-svn: 30505
 2006-09-20 01:39:40 +00:00
Evan Cheng 453280b94d 80 col. 
llvm-svn: 30504
 2006-09-20 01:10:02 +00:00
Evan Cheng 9de003670f Allow PatFrag to be a leaf node. 
llvm-svn: 30498
 2006-09-19 19:08:04 +00:00
Evan Cheng 00b2848adb Add result of a Xform to isel queue. 
llvm-svn: 30497
 2006-09-19 18:40:15 +00:00
Andrew Lenharth 4f339bebb0 If we have an add, do it in the pointer realm, not the int realm. This is critical in the linux kernel for pointer analysis correctness 
llvm-svn: 30496
 2006-09-19 18:24:51 +00:00
Andrew Lenharth 731f2d52a3 Inspired by the linux kernel, the more we keep adds in the pointer realm, the better pointer analysis works. 
llvm-svn: 30495
 2006-09-19 18:23:39 +00:00
Chris Lattner 698000b0da Fix UnitTests/2005-05-12-Int64ToFP.c with llc-beta. In particular, do not 
allow it to go into an infinite loop, filling up the disk!

llvm-svn: 30494
 2006-09-19 18:02:01 +00:00
Rafael Espindola fa7217f970 fix header 
add comments
untabify

llvm-svn: 30486
 2006-09-19 16:41:40 +00:00
Rafael Espindola f7d4a9900c Implement a MachineFunctionPass to fix the mul instruction 
llvm-svn: 30485
 2006-09-19 15:49:25 +00:00
Chris Lattner dc892c6221 number test right 
llvm-svn: 30484
 2006-09-19 06:19:19 +00:00
Chris Lattner b94df039c0 item done 
llvm-svn: 30483
 2006-09-19 06:19:03 +00:00
Chris Lattner 12f52faf93 implement select.ll:test19-22 
llvm-svn: 30482
 2006-09-19 06:18:21 +00:00
Chris Lattner aa0ad47e97 make this harder 
llvm-svn: 30481
 2006-09-19 06:17:55 +00:00
Chris Lattner db4fbdd1a6 new testcases 
llvm-svn: 30480
 2006-09-19 06:16:46 +00:00
Chris Lattner 3c48ea54ee Fold the PPCISD shifts when presented with 0 inputs. This occurs for code 
like:
long long test(long long X, int Y) {
  return 1ULL << Y;
}
long long test2(long long X, int Y) {
  return -1LL << Y;
}

which we used to compile to:

_test:
        li r2, 1
        subfic r3, r5, 32
        li r4, 0
        addi r6, r5, -32
        srw r3, r2, r3
        slw r4, r4, r5
        slw r6, r2, r6
        or r3, r4, r3
        slw r4, r2, r5
        or r3, r3, r6
        blr
_test2:
        li r2, -1
        subfic r3, r5, 32
        addi r6, r5, -32
        srw r3, r2, r3
        slw r4, r2, r5
        slw r2, r2, r6
        or r3, r4, r3
        or r3, r3, r2
        blr

Now we produce:

_test:
        li r2, 1
        addi r3, r5, -32
        subfic r4, r5, 32
        slw r3, r2, r3
        srw r4, r2, r4
        or r3, r4, r3
        slw r4, r2, r5
        blr
_test2:
        li r2, -1
        subfic r3, r5, 32
        addi r6, r5, -32
        srw r3, r2, r3
        slw r4, r2, r5
        slw r2, r2, r6
        or r3, r4, r3
        or r3, r3, r2
        blr

llvm-svn: 30479
 2006-09-19 05:22:59 +00:00
Chris Lattner 5a42ebcff3 Fold extract_element(cst) to cst 
llvm-svn: 30478
 2006-09-19 05:02:39 +00:00
Chris Lattner 4c059f4962 Minor speedup for legalize by avoiding some malloc traffic 
llvm-svn: 30477
 2006-09-19 04:51:23 +00:00
Chris Lattner bea5f91946 If multiple predicates are listed, they must all pass 
llvm-svn: 30476
 2006-09-19 00:41:36 +00:00
Nick Lewycky 5cc1e9b51d Enable dejagnu tests for predicate simplifier. 
llvm-svn: 30475
 2006-09-19 00:31:54 +00:00
Evan Cheng 1fc7c363e6 Fix a typo. 
llvm-svn: 30474
 2006-09-18 23:28:33 +00:00
Chris Lattner bba17b9913 There! 
llvm-svn: 30473
 2006-09-18 22:41:07 +00:00
Chris Lattner 82a73a1989 Fix Regression/TableGen/2006-09-18-LargeInt.td 
llvm-svn: 30472
 2006-09-18 22:28:27 +00:00
Chris Lattner 165f344721 new testcase 
llvm-svn: 30471
 2006-09-18 22:28:07 +00:00
Evan Cheng 4bfaf0bd2c Allow i32 UDIV, SDIV, UREM, SREM to be expanded into libcalls. 
llvm-svn: 30470
 2006-09-18 21:49:04 +00:00
Nick Lewycky b9c5483a93 Walk down the dominator tree instead of the control flow graph. That means 
that we can't modify the CFG any more, at least not until it's possible
to update the dominator tree (PR217).

llvm-svn: 30469
 2006-09-18 21:09:35 +00:00
Nick Lewycky 86bda361b0 Fix findCaseDest to return null when BB is both the default dest and one 
of the numeric cases.

llvm-svn: 30468
 2006-09-18 20:44:37 +00:00
Andrew Lenharth f23e3bfcb2 A pass to remove the worst of the replay trap offenders, and as a bonus, align basic blocks when it is free to do so 
llvm-svn: 30467
 2006-09-18 19:44:29 +00:00
Nick Lewycky 51cb632a1b Add a new helper method to SwitchInst. Useful when you've got a BB from 
somewhere (like the dominator graph) and would like to know which case it
came from.

llvm-svn: 30466
 2006-09-18 19:03:59 +00:00
Chris Lattner de07792595 Fix an infinite loop building the CFE 
llvm-svn: 30465
 2006-09-18 18:27:05 +00:00
Chris Lattner 3425123ced new testcase 
llvm-svn: 30464
 2006-09-18 18:07:51 +00:00
Andrew Lenharth 3aa3ad780e Jump tables on Alpha 
llvm-svn: 30463
 2006-09-18 18:01:03 +00:00
Andrew Lenharth 51ad73c98c oops 
llvm-svn: 30462
 2006-09-18 18:00:18 +00:00
Andrew Lenharth c50458fb90 absolute addresses must match pointer size 
llvm-svn: 30461
 2006-09-18 17:59:35 +00:00
Jim Laskey d30bba331f Sort out mangled names for globals 
llvm-svn: 30460
 2006-09-18 14:47:26 +00:00
Chris Lattner 67a35bbce7 Implement a trivial optzn: of vastart is never called in a function that takes 
... args, remove the '...'.

This is Transforms/DeadArgElim/dead_vaargs.ll

llvm-svn: 30459
 2006-09-18 07:02:31 +00:00
Chris Lattner 5c1bfd0311 new testcase 
llvm-svn: 30458
 2006-09-18 07:01:39 +00:00
Chris Lattner 523dbc5c19 add a note. Our 64-bit shifts are ~30% slower than gcc's 
llvm-svn: 30457
 2006-09-18 05:36:54 +00:00
Chris Lattner 4922a0e53f Implement InstCombine/cast.ll:test31. This speeds up 462.libquantum by 26%. 
llvm-svn: 30456
 2006-09-18 05:27:43 +00:00
Chris Lattner 52d170fc94 new testcase 
llvm-svn: 30455
 2006-09-18 05:25:10 +00:00
Chris Lattner 04fb628ea6 Add support for pattern matching cast operations 
llvm-svn: 30454
 2006-09-18 05:17:11 +00:00
Chris Lattner 8f499f1772 fix typo 
llvm-svn: 30453
 2006-09-18 04:58:06 +00:00
Chris Lattner b0b8ddd175 add a helper method 
llvm-svn: 30452
 2006-09-18 04:54:57 +00:00
Chris Lattner 4a13d3b391 This is closer to what we really want. 
llvm-svn: 30451
 2006-09-18 04:54:35 +00:00
Chris Lattner 420c4bcc8d Implement Transforms/InstCombine/shift-sra.ll:test0 
llvm-svn: 30450
 2006-09-18 04:31:40 +00:00
Chris Lattner 00a07af638 New testcase, can be an srl instead of sra 
llvm-svn: 30449
 2006-09-18 04:31:18 +00:00
Chris Lattner b3f24c91b0 Rewrite shift/and/compare sequences to promote better licm of the RHS. 
Use isLogicalShift/isArithmeticShift to simplify code.

llvm-svn: 30448
 2006-09-18 04:22:48 +00:00
Reid Spencer 99dedf4a44 Make the LLVM Publications link point to /pubs/ since this has moved to 
its own page on the LLVM web site.

llvm-svn: 30447
 2006-09-17 23:05:15 +00:00
Anton Korobeynikov 6f7072c66a Added some eye-candy for Subtarget type checking 
Added X86 StdCall & FastCall calling conventions. Codegen will follow.

llvm-svn: 30446
 2006-09-17 20:25:45 +00:00
Chris Lattner f16dc007e6 Add ShiftInst::isLogical/ArithmeticShift methods. 
llvm-svn: 30445
 2006-09-17 19:29:56 +00:00
Chris Lattner e1496fbb33 Add new SetCondInst::isRelational/isEquality methods. Rename 
Instruction::isRelational to Instruction::isComparison.

llvm-svn: 30444
 2006-09-17 19:14:47 +00:00
Nick Lewycky 241211939d Explain change with a comment. 
llvm-svn: 30443
 2006-09-17 17:51:00 +00:00
Nick Lewycky c7b465366a Fix PR912. The input to erase() must not be a reference to the data 
being erased.

llvm-svn: 30442
 2006-09-17 16:23:36 +00:00
Anton Korobeynikov 0ab01ff6e2 Small fixes for supporting dll* linkage types 
llvm-svn: 30441
 2006-09-17 13:06:18 +00:00
Chris Lattner f7e3478745 add a note noticed through source inspection 
llvm-svn: 30418
 2006-09-16 23:57:51 +00:00
Chris Lattner e50f5d1fb1 Oh yeah, this is needed too 
llvm-svn: 30407
 2006-09-16 05:08:34 +00:00
Chris Lattner 63b113f68c add a note 
llvm-svn: 30406
 2006-09-16 03:30:19 +00:00
Chris Lattner 850465d53f Fix Transforms/InstCombine/2006-09-15-CastToBool.ll and PR913 
llvm-svn: 30405
 2006-09-16 03:14:10 +00:00
Chris Lattner 5772ba4f50 Testcase for PR913 
llvm-svn: 30404
 2006-09-16 03:13:22 +00:00
Chris Lattner 1b63391fdf simplify control flow, no functionality change 
llvm-svn: 30403
 2006-09-16 00:21:44 +00:00
Chris Lattner fbadbda6ba Allow custom expand of mul 
llvm-svn: 30402
 2006-09-16 00:09:24 +00:00
Chris Lattner ff8a6b86db comment out debug code 
llvm-svn: 30401
 2006-09-15 23:01:10 +00:00
Chris Lattner 634bc046ca Add a new -cbe-bug mode, which works just like -run-llc, except that it uses 
LLC as the reference compiler to reduce testcases for bugs in GCC.

llvm-svn: 30400
 2006-09-15 21:29:15 +00:00
Chris Lattner c9dc375d3e add a nate note 
llvm-svn: 30399
 2006-09-15 20:31:36 +00:00
Chris Lattner 1bcb3d16cc xfail this for now 
llvm-svn: 30398
 2006-09-15 17:25:22 +00:00
Chris Lattner 9482cc5b16 revert previous two patches. They cause miscompilation of MultiSource/Applications/Burg 
llvm-svn: 30397
 2006-09-15 17:24:45 +00:00
Jim Laskey ee7929db34 Switching to NewNightlyTest.php 
llvm-svn: 30394
 2006-09-15 17:03:36 +00:00
Chris Lattner 84890d2da1 The inliner strips dead allocas now. Add a use to allow this test to 
test the right thing.

llvm-svn: 30393
 2006-09-15 16:53:11 +00:00
Owen Anderson edadd3faee Revert my previous work on ArgumentPromotion. Further investigation has revealed these 
changes to be incorrect.  They just weren't showing up in any of our current testcases.

llvm-svn: 30385
 2006-09-15 05:22:51 +00:00
Chris Lattner 8d2b9a431b Unbreak the JIT 
llvm-svn: 30384
 2006-09-15 04:56:11 +00:00
Chris Lattner 8fb3d445f5 Keep track of the start of MBB's in a separate map from instructions. This 
is faster and is needed for future improvements.

llvm-svn: 30383
 2006-09-15 03:57:23 +00:00
Evan Cheng f8464da015 Remove a unnecessary check. 
llvm-svn: 30382
 2006-09-14 23:55:02 +00:00
Chris Lattner 3ffda067e3 Relax this check. 
llvm-svn: 30381
 2006-09-14 23:54:24 +00:00
Devang Patel 9ce9df5912 Undo previous check-in. 
Reintroduce recursive assignDFSNumber().

llvm-svn: 30380
 2006-09-14 21:43:24 +00:00
Chris Lattner 46d710e6ea Fold (X & C1) | (Y & C2) -> (X|Y) & C3 when possible. 
This implements CodeGen/X86/and-or-fold.ll

llvm-svn: 30379
 2006-09-14 21:11:37 +00:00
Chris Lattner 4c4e077546 New testcase 
llvm-svn: 30378
 2006-09-14 21:10:06 +00:00
Chris Lattner 2aa98e0363 add a note 
llvm-svn: 30377
 2006-09-14 20:56:30 +00:00
Chris Lattner 97614c86ce Split rotate matching code out to its own function. Make it stronger, by 
matching things like ((x >> c1) & c2) | ((x << c3) & c4) to (rot x, c5) & c6

llvm-svn: 30376
 2006-09-14 20:50:57 +00:00
Anton Korobeynikov 73441cd099 Adding generated files for the last commit 
llvm-svn: 30375
 2006-09-14 18:25:26 +00:00
Anton Korobeynikov d61d39ec53 Adding dllimport, dllexport and external weak linkage types. 
DLL* linkages got full (I hope) codegeneration support in C & both x86
assembler backends.
External weak linkage added for future use, we don't provide any
codegeneration, etc. support for it.

llvm-svn: 30374
 2006-09-14 18:23:27 +00:00
Evan Cheng 616aa548b2 Use getOffset() instead. 
llvm-svn: 30327
 2006-09-14 07:41:12 +00:00
Evan Cheng 2ad050fb3e Use MachineConstantPoolEntry getOffset() and getType() accessors. 
llvm-svn: 30326
 2006-09-14 07:35:00 +00:00
Evan Cheng 0460f42da9 Add MachineConstantPoolEntry getOffset() accessor. 
llvm-svn: 30325
 2006-09-14 07:32:32 +00:00
Evan Cheng 316843372e The top bit is used to determine whether it's a MachineConstantPoolValue. 
llvm-svn: 30324
 2006-09-14 07:30:48 +00:00
Chris Lattner 3a68d40dd3 revert accidentally committed file 
llvm-svn: 30323
 2006-09-14 06:42:17 +00:00
Chris Lattner e1a6cec41b Remove dead methods, add getNumBlockIDs() method 
llvm-svn: 30322
 2006-09-14 06:40:48 +00:00