RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-31 07:52:55 +01:00
Code Issues Projects Releases Wiki Activity
95,885 Commits 4 Branches 5 Tags 704 MiB
69102d22a5
Commit Graph

312 Commits

Author SHA1 Message Date
Chris Lattner
c310b1f1f3 rename *.llx -> *.ll 
llvm-svn: 49970
 2008-04-19 22:29:10 +00:00
Dan Gohman
2a124430e9 Make this test x86-specific for now; targets that don't use 
the automated CallingConv code to handle return values typically
don't support multiple return values.

llvm-svn: 48265
 2008-03-12 00:25:14 +00:00
Dan Gohman
155ffdd955 Basic feature test for multiple return values in codegen. 
llvm-svn: 48260
 2008-03-11 23:53:16 +00:00
Gabor Greif
92e00c1e50 some more spelling changes 
llvm-svn: 47996
 2008-03-06 10:51:21 +00:00
Chris Lattner
1a461075ef Fix PR2096, a regression introduced with my patch last night. This 
also fixes cfrac, flops, and 175.vpr

llvm-svn: 47605
 2008-02-26 17:09:59 +00:00
Chris Lattner
5b4101cf68 Fix isNegatibleForFree to not return true for ConstantFP nodes 
after legalize.  Just because a constant is legal (e.g. 0.0 in SSE) 
doesn't mean that its negated value is legal (-0.0).  We could make
this stronger by checking to see if the negated constant is actually
legal post negation, but it doesn't seem like a big deal.

llvm-svn: 47591
 2008-02-26 07:04:54 +00:00
Chris Lattner
2f3bffc338 testcase for PR1133 
llvm-svn: 47427
 2008-02-21 05:27:08 +00:00
Tanya Lattner
aeb9bb8ba4 Remove llvm-upgrade and update tests. 
llvm-svn: 47296
 2008-02-19 01:41:04 +00:00
Duncan Sands
2e9661573f Teach LegalizeTypes how to expand and promote CTLZ, 
CTTZ and CTPOP.  The expansion code differs from
that in LegalizeDAG in that it chooses to take the
CTLZ/CTTZ count from the Hi/Lo part depending on
whether the Hi/Lo value is zero, not on whether
CTLZ/CTTZ of Hi/Lo returned 32 (or whatever the
width of the type is) for it.  I made this change
because the optimizers may well know that Hi/Lo
is zero and exploit it.  The promotion code for
CTTZ also differs from that in LegalizeDAG: it
uses an "or" to get the right result when the
original value is zero, rather than using a compare
and select.  This also means the value doesn't
need to be zero extended.

llvm-svn: 47075
 2008-02-13 18:01:53 +00:00
Duncan Sands
b65b2462c8 Crashes LegalizeTypes with "Do not know how to 
expand the result of this operator!" (node: ctlz).

llvm-svn: 46713
 2008-02-04 18:07:02 +00:00
Duncan Sands
123f86e781 Crashes LegalizeTypes with "Do not know how to split 
this operator's operand" (node: extract_subvector).

llvm-svn: 46712
 2008-02-04 18:05:42 +00:00
Chris Lattner
cad0478491 remove target triple to make this test more "generic" 
llvm-svn: 46711
 2008-02-04 18:02:37 +00:00
Duncan Sands
36a938c4fb Crashed the new type legalizer. Not likely to catch 
any bugs in the future since to get the crash you also
need hacked in fake libcall support (which creates odd
but legal trees), but since adding it doesn't hurt...
Thanks to Chris for this ultimately reduced version.

llvm-svn: 46706
 2008-02-04 09:40:27 +00:00
Chris Lattner
53a98f46fd Fix some bugs in SimplifyNodeWithTwoResults where it would call deletenode to 
delete a node even if it was not dead in some cases.  Instead, just add it to
the worklist.  Also, make sure to use the CombineTo methods, as it was doing
things that were unsafe: the top level combine loop could touch dangling memory.

This fixes CodeGen/Generic/2008-01-25-dag-combine-mul.ll

llvm-svn: 46384
 2008-01-26 01:09:19 +00:00
Chris Lattner
adb8aeaf6a new testcase. 
llvm-svn: 46139
 2008-01-17 19:47:23 +00:00
Chris Lattner
ee20bcd396 add testcase that has been sitting in my tree for awhile. 
llvm-svn: 46124
 2008-01-17 06:54:09 +00:00
Chris Lattner
4d3944c554 new testcase for llvm.trap. 
llvm-svn: 46020
 2008-01-15 22:17:26 +00:00
Chris Lattner
cce1483bcf new testcase for PR1845 
llvm-svn: 45795
 2008-01-10 00:30:38 +00:00
Gordon Henriksen
edbfece273 Setting GlobalDirective in TargetAsmInfo by default rather than 
providing a misleading facility. It's used once in the MIPS backend
and hardcoded as "\t.globl\t" everywhere else.

llvm-svn: 45676
 2008-01-07 02:31:11 +00:00
Gordon Henriksen
db4f51e1b9 With this patch, the LowerGC transformation becomes the 
ShadowStackCollector, which additionally has reduced overhead with
no sacrifice in portability.

Considering a function @fun with 8 loop-local roots,
ShadowStackCollector introduces the following overhead
(x86):

; shadowstack prologue
        movl    L_llvm_gc_root_chain$non_lazy_ptr, %eax
        movl    (%eax), %ecx
        movl    $___gc_fun, 20(%esp)
        movl    $0, 24(%esp)
        movl    $0, 28(%esp)
        movl    $0, 32(%esp)
        movl    $0, 36(%esp)
        movl    $0, 40(%esp)
        movl    $0, 44(%esp)
        movl    $0, 48(%esp)
        movl    $0, 52(%esp)
        movl    %ecx, 16(%esp)
        leal    16(%esp), %ecx
        movl    %ecx, (%eax)

; shadowstack loop overhead
        (none)

; shadowstack epilogue
        movl    48(%esp), %edx
        movl    %edx, (%ecx)

; shadowstack metadata
        .align  3
___gc_fun:                              # __gc_fun
        .long   8
        .space  4

In comparison to LowerGC:

; lowergc prologue
        movl    L_llvm_gc_root_chain$non_lazy_ptr, %eax
        movl    (%eax), %ecx
        movl    %ecx, 48(%esp)
        movl    $8, 52(%esp)
        movl    $0, 60(%esp)
        movl    $0, 56(%esp)
        movl    $0, 68(%esp)
        movl    $0, 64(%esp)
        movl    $0, 76(%esp)
        movl    $0, 72(%esp)
        movl    $0, 84(%esp)
        movl    $0, 80(%esp)
        movl    $0, 92(%esp)
        movl    $0, 88(%esp)
        movl    $0, 100(%esp)
        movl    $0, 96(%esp)
        movl    $0, 108(%esp)
        movl    $0, 104(%esp)
        movl    $0, 116(%esp)
        movl    $0, 112(%esp)

; lowergc loop overhead
        leal    44(%esp), %eax
        movl    %eax, 56(%esp)
        leal    40(%esp), %eax
        movl    %eax, 64(%esp)
        leal    36(%esp), %eax
        movl    %eax, 72(%esp)
        leal    32(%esp), %eax
        movl    %eax, 80(%esp)
        leal    28(%esp), %eax
        movl    %eax, 88(%esp)
        leal    24(%esp), %eax
        movl    %eax, 96(%esp)
        leal    20(%esp), %eax
        movl    %eax, 104(%esp)
        leal    16(%esp), %eax
        movl    %eax, 112(%esp)

; lowergc epilogue
        movl    48(%esp), %edx
        movl    %edx, (%ecx)

; lowergc metadata
        (none)

llvm-svn: 45670
 2008-01-07 01:30:53 +00:00
Duncan Sands
8a4882564a Fix PR1833 - eh.exception and eh.selector return two 
values, which means doing extra legalization work.
It would be easier to get this kind of thing right if
there was some documentation...

llvm-svn: 45472
 2007-12-31 18:35:50 +00:00
Gordon Henriksen
e8226d70a9 Tests for changes made in r45356, where IPO optimizations would drop 
collector algorithms.

llvm-svn: 45357
 2007-12-26 02:47:37 +00:00
Gordon Henriksen
c0a3899bbf GC poses hazards to the inliner. Consider: 
define void @f() {
            ...
            call i32 @g()
            ...
    }

    define void @g() {
            ...
    }

The hazards are:

  - @f and @g have GC, but they differ GC. Inlining is invalid. This
    may never occur.
  - @f has no GC, but @g does. g's GC must be propagated to @f.

The other scenarios are safe:

  - @f and @g have the same GC.
  - @f and @g have no GC.
  - @g has no GC.

This patch adds inliner checks for the former two scenarios.

llvm-svn: 45351
 2007-12-25 03:10:07 +00:00
Gordon Henriksen
a9f4ed4070 Noting and enforcing that GC intrinsics are valid only within a 
function with GC.

This will catch the error when the inliner inlines a function with
GC into a caller with no GC.

llvm-svn: 45350
 2007-12-25 02:31:26 +00:00
Gordon Henriksen
44841db057 Adjusting verification of "llvm.gc*" intrinsic prototypes to match 
LangRef.

llvm-svn: 45349
 2007-12-25 02:02:10 +00:00
Duncan Sands
3a0d757bd5 Make invokes of inline asm legal. Teach codegen 
how to lower them (with no attempt made to be
efficient, since they should only occur for
unoptimized code).

llvm-svn: 45108
 2007-12-17 18:08:19 +00:00
Gordon Henriksen
5d201e0bcc Adding a collector name attribute to Function in the IR. These 
methods are new to Function:

  bool hasCollector() const;
  const std::string &getCollector() const;
  void setCollector(const std::string &);
  void clearCollector();

The assembly representation is as such:

  define void @f() gc "shadow-stack" { ...

The implementation uses an on-the-side table to map Functions to 
collector names, such that there is no overhead. A StringPool is 
further used to unique collector names, which are extremely
likely to be unique per process.

llvm-svn: 44769
 2007-12-10 03:18:06 +00:00
Gordon Henriksen
64016be9ea Upgrading this test to 2.0 .ll syntax. 
llvm-svn: 44738
 2007-12-09 15:03:01 +00:00
Chris Lattner
331852dd02 upgrade this test 
llvm-svn: 44405
 2007-11-28 18:22:12 +00:00
Chris Lattner
5e0cabc90e Fix a crash on invalid code due to memcpy lowering. 
llvm-svn: 44378
 2007-11-27 22:14:42 +00:00
Duncan Sands
7a8a7099b1 Fix a bug in which node A is replaced by node B, but later 
node A gets back into the DAG again because it was hiding in
one of the node maps: make sure that node replacement happens
in those maps too.

llvm-svn: 44263
 2007-11-21 16:43:19 +00:00
Evan Cheng
1d3c836933 -pre-RA-sched=none, simple, simple-noitin are gone. 
llvm-svn: 42505
 2007-10-01 22:17:20 +00:00
Dan Gohman
39313e0fa3 Fix a typo in a comment. 
llvm-svn: 42263
 2007-09-24 15:50:11 +00:00
Gordon Henriksen
fa3a5915b1 Fix for PR1633: Verifier doesn't fully verify GC intrinsics 
LLVM now enforces the following prototypes for the write barriers:

<ty>* @llvm.gcread(<ty2>*, <ty>**)
void @llvm.gcwrite(<ty>*, <ty2>*, <ty>**)

And for @llvm.gcroot, the first stack slot is verified to be an alloca or a 
bitcast of an alloca.

Fixes test/CodeGen/Generic/GC/lower_gcroot.ll, which violated these.

llvm-svn: 42051
 2007-09-17 20:30:04 +00:00
Anton Korobeynikov
899c0c9c8d Split eh.select / eh.typeid.for intrinsics into i32/i64 versions. This is needed, because they just "mark" register 
liveins and we let frontend solve type issue, not lowering code :)

llvm-svn: 41763
 2007-09-07 11:39:35 +00:00
Dale Johannesen
f9ca7b6094 Change all floating constants that are not exactly 
representable to use hex format.

llvm-svn: 41722
 2007-09-05 17:50:36 +00:00
Evan Cheng
9c7cff8e62 Fix a gcroot lowering bug. 
llvm-svn: 41668
 2007-09-01 02:00:51 +00:00
Duncan Sands
454200b3bf Remove this test as it is too hard to fix after the 
latest EH changes, and in any case it is hard to
imagine how the original bug could be reintroduced.

llvm-svn: 41497
 2007-08-27 17:08:14 +00:00
Duncan Sands
50af87bf0b Now that we don't output cleanups by default, the action 
offset needs to be adjusted in this test.

llvm-svn: 41490
 2007-08-27 16:30:05 +00:00
Chris Lattner
093144e147 Allow target constants to be illegal types. The target should 
know how to handle them.  This fixes 
test/CodeGen/Generic/asm-large-immediate.ll

llvm-svn: 41388
 2007-08-25 01:00:22 +00:00
Dan Gohman
34263074cb Convert tests using "grep -c ... | grep ..." to use the count script. 
llvm-svn: 41100
 2007-08-15 13:49:33 +00:00
Dan Gohman
794fa1f8f7 Convert tests using "| wc -l | grep ..." to use the count script. 
llvm-svn: 41097
 2007-08-15 13:36:28 +00:00
Chandler Carruth
00e56b0e81 This is the patch to provide clean intrinsic function overloading support in LLVM. It cleans up the intrinsic definitions and generally smooths the process for more complicated intrinsic writing. It will be used by the upcoming atomic intrinsics as well as vector and float intrinsics in the future. 
This also changes the syntax for llvm.bswap, llvm.part.set, llvm.part.select, and llvm.ct* intrinsics. They are automatically upgraded by both the LLVM ASM reader and the bitcode reader. The test cases have been updated, with special tests added to ensure the automatic upgrading is supported.

llvm-svn: 40807
 2007-08-04 01:51:18 +00:00
Dan Gohman
e3464e6bec Change the x86 assembly output to use tab characters to separate the 
mnemonics from their operands instead of single spaces. This makes the
assembly output a little more consistent with various other compilers
(f.e. GCC), and slightly easier to read. Also, update the regression
tests accordingly.

llvm-svn: 40648
 2007-07-31 20:11:57 +00:00
Tanya Lattner
1b070ae252 Don't use * in XFAIL line unless you want it to XFAIL on everything. I don't believe you can use true regular expressions here. It will just look for those keywords. Please test this on sparc and see if they still are xfailed. 
llvm-svn: 39975
 2007-07-17 18:08:32 +00:00
Gabor Greif
5bf00849d3 XFAIL these on sparc-solaris 
llvm-svn: 39969
 2007-07-17 10:25:31 +00:00
Reid Spencer
175fd0a317 For PR1558: 
Move tests that have C/C++ sources into the appropriate directory. This
allows them to be selected for testing based on whether llvm-gcc is
present or not.

llvm-svn: 39963
 2007-07-17 06:20:38 +00:00
Dan Gohman
0c1259b7e4 Remove the trailing semicolon from function declarations in LLVM, 
where it's interpreted as a comment, not part of the syntax.

llvm-svn: 39920
 2007-07-16 13:37:30 +00:00
Dale Johannesen
469ed8e17e Skeleton of post-RA scheduler; doesn't do anything yet. 
Change name of -sched option and DEBUG_TYPE to
pre-RA-sched; adjust testcases.

llvm-svn: 39816
 2007-07-13 17:13:54 +00:00
Chris Lattner
587e824b72 remove this bogus t-t 
llvm-svn: 38464
 2007-07-09 17:31:07 +00:00
Duncan Sands
3526ada4dc Test that byte offsets are used to index into the list 
of filter ids, and not simply the id index.  Testing
this requires at least 128 type infos!

llvm-svn: 37941
 2007-07-06 12:38:27 +00:00
Chris Lattner
b11af79de8 avoid ambiguity in target selection 
llvm-svn: 37927
 2007-07-05 22:16:19 +00:00
John Criswell
57e5ed4b5a Convert .cvsignore files 
llvm-svn: 37801
 2007-06-29 16:35:07 +00:00
Duncan Sands
deef6fe78b Workaround for PR1508. 
llvm-svn: 37597
 2007-06-15 19:04:19 +00:00
Duncan Sands
e2f26d06a6 "Simplified" testcase for PR1422. 
llvm-svn: 37462
 2007-06-06 09:59:53 +00:00
Dale Johannesen
91ec0a7822 Test assumes tail merging is off; this must now be explicit. 
llvm-svn: 37286
 2007-05-22 17:18:05 +00:00
Chris Lattner
5f91019b13 add testcase for 128-bit add/sub 
llvm-svn: 37170
 2007-05-17 18:22:37 +00:00
Lauro Ramos Venancio
251ea5ab65 Fix an infinite recursion in GetNegatedExpression. 
llvm-svn: 37086
 2007-05-15 17:05:43 +00:00
Chris Lattner
7875baf30c move to CodeGen/ARM/2007-05-07-tailmerge-1.ll 
llvm-svn: 36918
 2007-05-08 02:13:52 +00:00
Evan Cheng
ffeb94f21f Fix test case. 
llvm-svn: 36911
 2007-05-07 21:38:05 +00:00
Dale Johannesen
c884abe112 Handle some non-exit blocks in tail merging. 
llvm-svn: 36907
 2007-05-07 20:57:21 +00:00
Chris Lattner
341cb5adc8 the sparc v8 backend handles this correctly 
llvm-svn: 36801
 2007-05-05 22:12:57 +00:00
Chris Lattner
67a434ebb5 unxfail this, llc doesn't support this feature yet, so don't run it. 
llvm-svn: 36796
 2007-05-05 21:51:34 +00:00
Duncan Sands
443ccb4591 Check that the right eh personality function is used. 
llvm-svn: 36788
 2007-05-05 20:22:08 +00:00
Duncan Sands
a3171eb245 Test that the eh lowering code can handle constant folded bitcasts. 
llvm-svn: 36746
 2007-05-04 17:14:42 +00:00
Reid Spencer
01a611f06a Split target dependent test portions to target-specific directories. 
llvm-svn: 36612
 2007-05-01 02:56:15 +00:00
Chris Lattner
ffb1892f98 testcase for PR1228 
llvm-svn: 36601
 2007-04-30 23:34:46 +00:00
Reid Spencer
6045236615 For PR1370: 
Rearrange some tests so that if PowerPC is not being built we don't try to
run PowerPC specific tests.

llvm-svn: 36587
 2007-04-30 05:11:58 +00:00
Chris Lattner
782ebe9f8a ensure the operand prints. 
llvm-svn: 36533
 2007-04-28 06:07:55 +00:00
Chris Lattner
4a79914438 new testcase 
llvm-svn: 36532
 2007-04-28 06:05:59 +00:00
Chris Lattner
287a590e95 update syntax 
llvm-svn: 36531
 2007-04-28 06:03:12 +00:00
Chris Lattner
d6a01ade78 make this testcase harder, to cover PR1326 
llvm-svn: 36509
 2007-04-27 17:12:23 +00:00
Duncan Sands
4444cfb768 Test that eh_selector lowering accepts global variables as well as bitcasts 
of global variables.

llvm-svn: 36500
 2007-04-27 06:56:53 +00:00
Anton Korobeynikov
0c27d56340 Unxfail tests 
llvm-svn: 36497
 2007-04-26 21:20:04 +00:00
Anton Korobeynikov
4ddd712259 Add test to proper place. Also, XFAIL until ppc bootstrap will be ok. 
llvm-svn: 36491
 2007-04-26 20:49:05 +00:00
Chris Lattner
14205a32d2 new testcase 
llvm-svn: 36230
 2007-04-17 23:43:31 +00:00
Reid Spencer
37a1d7f441 Also validate that the code generation of IntrinsicLowering for LLI works. 
llvm-svn: 36175
 2007-04-16 21:52:56 +00:00
Reid Spencer
df17fa8ef9 For PR1319: 
Remove && from the end of the lines to prevent tests from throwing run
lines into the background. Also, clean up places where the same command
is run multiple times by using a temporary file.

llvm-svn: 36142
 2007-04-16 17:36:08 +00:00
Reid Spencer
43899915e9 For PR1319: 
Fix syntax of tests to ensure grep pattern is properly quoted.

llvm-svn: 36134
 2007-04-16 15:31:49 +00:00
Reid Spencer
ac781b1f94 For PR1336: 
Un-XFAIL this test now that llvm-ugprade knows how to create functions with
empty names.

llvm-svn: 36107
 2007-04-16 03:06:39 +00:00
Reid Spencer
8f0fe6f2cf For PR1336: 
XFAIL tests covered by the PR. These will be un-XFAILed as they are fixed.

llvm-svn: 36093
 2007-04-15 23:00:46 +00:00
Reid Spencer
47d1aeeb51 For PR1319: Upgrade to new test harness. 
llvm-svn: 36086
 2007-04-15 20:48:50 +00:00
Reid Spencer
a67bc1c0e9 For PR1319: Upgrade to new test harness. 
llvm-svn: 36080
 2007-04-15 19:35:51 +00:00
Chris Lattner
72c75b766c xfail for now 
llvm-svn: 36033
 2007-04-14 23:40:49 +00:00
Anton Korobeynikov
bdb4f560da Fix PR1325: Case range optimization was performed in the case it 
shouldn't. Also fix some "latent" bug on 64-bit platforms

llvm-svn: 35990
 2007-04-14 13:25:55 +00:00
Anton Korobeynikov
5bb6590218 Fix PR1323 : we haven't updated phi nodes in good manner :) 
llvm-svn: 35963
 2007-04-13 06:53:51 +00:00
Chris Lattner
ee73b503a4 make this really work on linux :) 
llvm-svn: 35948
 2007-04-12 18:10:16 +00:00
Chris Lattner
62374cc05e make this happier on linux hosts 
llvm-svn: 35947
 2007-04-12 18:09:06 +00:00
Reid Spencer
56b310ae49 Make the llvm-runtest function much more amenable by eliminating all the 
global variables that needed to be passed in. This makes it possible to
add new global variables with only a couple changes (Makefile and llvm-dg.exp)
instead of touching every single dg.exp file.

llvm-svn: 35918
 2007-04-11 19:56:59 +00:00
Chris Lattner
0bf024fb83 change test name. 
llvm-svn: 35904
 2007-04-11 15:24:04 +00:00
Chris Lattner
787c0a4e5b new testcase 
llvm-svn: 35882
 2007-04-11 05:32:13 +00:00
Anton Korobeynikov
6ee97ee42a Next stage into switch lowering refactoring 
1. Fix some bugs in the jump table lowering threshold
2. Implement much better metric for optimal pivot selection
3. Tune thresholds for different lowering methods
4. Implement shift-and trick for lowering small (<machine word
length) cases with few destinations. Good testcase will follow.

llvm-svn: 35816
 2007-04-09 12:31:58 +00:00
Chris Lattner
5a5aeaf596 new testcase for PR1308 
llvm-svn: 35784
 2007-04-09 00:45:42 +00:00
Reid Spencer
f71d4af0e5 XFAIL this test for now. It will be a while before I can implement this 
intrinsic properly in SDISel.

llvm-svn: 35692
 2007-04-05 22:57:45 +00:00
Anton Korobeynikov
ceb6667a6f Fix test 
llvm-svn: 35683
 2007-04-05 16:43:09 +00:00
Reid Spencer
6eb55df794 Implement the llvm.bit.part_select.iN.iN.iN overloaded intrinsic. 
llvm-svn: 35678
 2007-04-04 23:48:25 +00:00
Anton Korobeynikov
e16f421e0e Properly emit range comparisons for switch cases, where neighbour cases 
go to the same destination. Now we're producing really good code for
switch-lower-feature.ll testcase

llvm-svn: 35672
 2007-04-04 21:14:49 +00:00
Chris Lattner
e431a9d714 new testcase for PR1296 
llvm-svn: 35574
 2007-04-02 01:32:59 +00:00
Reid Spencer
81c0ac434f Revert the name changes for llvm.bswap to allow (and test) llvm-upgrade of 
this intrinsic.

llvm-svn: 35566
 2007-04-02 00:51:15 +00:00
Reid Spencer
f5e95d339f For PR1297: 
Update these test cases to use proper signatures for bswap which is now
and overloaded intrinsic. Its name must be of the form llvm.bswap.i32.i32
since both the parameter and the result or of type "iAny". Also, the
bit counting intrinsics changed to always return i32.

llvm-svn: 35548
 2007-04-01 07:36:28 +00:00
Reid Spencer
50ee6b8557 Remove use of implementation keyword. 
llvm-svn: 35412
 2007-03-28 02:38:26 +00:00
Anton Korobeynikov
e1787d5f46 Add "feature" testcase for new switch lowering code 
llvm-svn: 35345
 2007-03-25 22:01:14 +00:00
Chris Lattner
fc3b6903e3 new testcase, corresponds to: 
long long test(long long A, unsigned B) {
  return (A + ((long long)B << 32));
}

llvm-svn: 34911
 2007-03-04 20:39:47 +00:00
Chris Lattner
e6d3ae4f2c New testcase for PR1239 
llvm-svn: 34892
 2007-03-03 23:42:50 +00:00
Jim Laskey
1c9a412982 Test for PR1224. 
llvm-svn: 34609
 2007-02-25 21:43:21 +00:00
Chris Lattner
e7afa2a6d9 testcase for PR1219 
llvm-svn: 34550
 2007-02-24 02:08:00 +00:00
Dale Johannesen
e864bf486f adding PR 1200 comment by request 
llvm-svn: 34360
 2007-02-17 01:12:15 +00:00
Dale Johannesen
960bd79f88 Fixes PR 1200 
llvm-svn: 34359
 2007-02-17 00:44:34 +00:00
Chris Lattner
b72af5df9b sanity check for *basic* i128 arithmetic on all hosts. 
llvm-svn: 34259
 2007-02-13 23:59:21 +00:00
Chris Lattner
95c32f113a new testcase for PR1197 
llvm-svn: 34215
 2007-02-13 01:05:10 +00:00
Reid Spencer
6a31ec1259 For PR761: 
Remove "target endian/pointersize" or add "target datalayout" to make
the test parse properly or set the datalayout because defaults changes.

For PR645:
Make global names use the @ prefix.

For llvm-upgrade changes:
Fix test cases or completely remove use of llvm-upgrade for test cases
that cannot survive the new renaming or upgrade capabilities.

llvm-svn: 33533
 2007-01-26 08:25:06 +00:00
Reid Spencer
4572ce85b0 Regression is gone, don't try to find it on clean target. 
llvm-svn: 33296
 2007-01-17 07:59:14 +00:00