RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 04:02:41 +01:00
Code Issues Projects Releases Wiki Activity
36,589 Commits 4 Branches 5 Tags 704 MiB
f9d2cf4cae
Commit Graph

4723 Commits

Author SHA1 Message Date
Evan Cheng
0747381b13 Codegen improvement has reduced one spill. 
llvm-svn: 45814
 2008-01-10 02:54:40 +00:00
Chris Lattner
cce1483bcf new testcase for PR1845 
llvm-svn: 45795
 2008-01-10 00:30:38 +00:00
Evan Cheng
ba0214a6cb Special copy SUnit's do not have SDNode's. 
llvm-svn: 45787
 2008-01-09 23:01:55 +00:00
Evan Cheng
f91cfb435f Fix sse2.psrl.w and sse2.psrl.q definitions. 
llvm-svn: 45772
 2008-01-09 02:16:44 +00:00
Chris Lattner
c93ad7d569 Make load->store deletion a bit smarter. This allows us to compile this: 
void test(long long *P) { *P ^= 1; }

into just:

_test:
	movl	4(%esp), %eax
	xorl	$1, (%eax)
	ret

instead of code like this:

_test:
	movl	4(%esp), %ecx
        xorl    $1, (%ecx)
	movl	4(%ecx), %edx
	movl	%edx, 4(%ecx)
	ret

llvm-svn: 45762
 2008-01-08 23:08:06 +00:00
Duncan Sands
b3b1ae18ab Crashes llc when using Chris's new legalization logic. 
llvm-svn: 45758
 2008-01-08 21:51:53 +00:00
Chris Lattner
67f581b344 Implement PR1795, an instcombine hack for forming GEPs with integer pointer arithmetic. 
llvm-svn: 45745
 2008-01-08 07:23:51 +00:00
Chris Lattner
aeab9aefb3 remove darwin/i386 t-t 
llvm-svn: 45743
 2008-01-08 06:52:51 +00:00
Chris Lattner
cafc567fb7 Finally implement correct ordered comparisons for PPC, even though 
the code generated is not wonderful.  This turns a miscompilation into
a code quality bug (noted in the ppc readme).  This fixes PR642, which
is over 2 years old (!).  Nate, please review this.

llvm-svn: 45742
 2008-01-08 06:46:30 +00:00
Chris Lattner
7853f9d2df Testcase for PR1721 
llvm-svn: 45739
 2008-01-08 05:16:29 +00:00
Nate Begeman
98dba4b0ce Update test to catch recent x86 insert regression and improvements 
llvm-svn: 45705
 2008-01-07 17:49:23 +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
fd975e4b3d The transform that tries to turn calls to bitcast functions into 
direct calls bails out unless caller and callee have essentially
equivalent parameter attributes.  This is illogical - the callee's
attributes should be of no relevance here.  Rework the logic, which
incidentally fixes a crash when removed arguments have attributes.

llvm-svn: 45658
 2008-01-06 18:27:01 +00:00
Duncan Sands
b8489f09a2 When transforming a call to a bitcast function into 
a direct call with cast parameters and cast return
value (if any), instcombine was prepared to cast any
non-void return value into any other, whether castable
or not.  Add a new predicate for testing whether casting
is valid, and check it both for the return value and
(as a cleanup) for the parameters.

llvm-svn: 45657
 2008-01-06 10:12:28 +00:00
Nick Lewycky
e05651c6d7 Accept both %y, %x and %x, %y as valid answers. 
llvm-svn: 45649
 2008-01-06 03:12:44 +00:00
Chris Lattner
7e1c3aa702 remove a couple more unsafe xforms in the face of overflow. 
llvm-svn: 45613
 2008-01-05 01:22:42 +00:00
Duncan Sands
8a7547d26f Testcase with non-integer "bitfields" (in quotes, 
since they didn't actually need to be bitfields,
though they are marked as such).

llvm-svn: 45588
 2008-01-04 17:31:56 +00:00
Duncan Sands
93c581f2a8 Testcase for PR1386. 
llvm-svn: 45583
 2008-01-04 13:15:39 +00:00
Chris Lattner
d4c66656a1 Fix PR1896 
llvm-svn: 45568
 2008-01-04 05:04:53 +00:00
Duncan Sands
4f9b058e95 Test for handling of large bit offset from a 
variable field offset.

llvm-svn: 45534
 2008-01-03 11:53:52 +00:00
Chris Lattner
26b89fd30a don't hoist FP additions into unconditional adds + selects. This 
could theoretically introduce a trap, but is also a performance issue.
This speeds up ptrdist/ks by 8%.

llvm-svn: 45533
 2008-01-03 07:25:26 +00:00
Duncan Sands
cc3a49623f An example for which the TYPE_SIZE was being set from 
the initial value, while the type fields were not (this
is a qualified union type, so not all fields are always
present).  This resulted in the size of the corresponding
LLVM type being larger than the gcc TYPE_SIZE.

llvm-svn: 45522
 2008-01-03 00:26:42 +00:00
Duncan Sands
fcb856ad1e Test handling of records for which the fields are 
not ordered by offset.

llvm-svn: 45520
 2008-01-03 00:17:02 +00:00
Chris Lattner
7d567adef9 fix this to use a valid triple. 
llvm-svn: 45509
 2008-01-02 22:21:45 +00:00
Chris Lattner
fbd8cc03c8 verify that aligned common support doesn't break. 
llvm-svn: 45495
 2008-01-02 19:48:24 +00:00
Bill Wendling
e6898cbe7a Update this testcase. The output needs to be disabled to pass. 
llvm-svn: 45478
 2008-01-01 01:34:36 +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
0f21fdb054 Another backwards compatibility fix. 
llvm-svn: 45463
 2007-12-30 22:48:58 +00:00
Gordon Henriksen
81148ffd7e Strengthening this test so it fails in release mode. 
llvm-svn: 45446
 2007-12-30 05:45:49 +00:00
Gordon Henriksen
36da9ea958 Bindings for instruction calling conventions. 
llvm-svn: 45422
 2007-12-29 20:45:00 +00:00
Chris Lattner
6aece93d5c remove attributions from the rest of the llvm makefiles. 
llvm-svn: 45416
 2007-12-29 20:11:13 +00:00
Chris Lattner
d55e743cfe One readme entry is done, one is really easy (Evan, want to investigate 
eliminating the llvm.x86.sse2.loadl.pd intrinsic?), one shuffle optzn
may be done (if shufps is better than pinsw, Evan, please review), and
we already know about LICM of simple instructions.

llvm-svn: 45407
 2007-12-29 19:31:47 +00:00
Chris Lattner
ed55329cc9 upgrade this test 
llvm-svn: 45406
 2007-12-29 19:24:06 +00:00
Chris Lattner
cd147e5596 Fold comparisons against a constant nan, and optimize ORD/UNORD 
comparisons with a constant.  This allows us to compile isnan to:

_foo:
	fcmpu cr7, f1, f1
	mfcr r2
	rlwinm r3, r2, 0, 31, 31
	blr 

instead of:

LCPI1_0:					;  float
	.space	4
_foo:
	lis r2, ha16(LCPI1_0)
	lfs f0, lo16(LCPI1_0)(r2)
	fcmpu cr7, f1, f0
	mfcr r2
	rlwinm r3, r2, 0, 31, 31
	blr 

llvm-svn: 45405
 2007-12-29 08:37:08 +00:00
Chris Lattner
b36a4a7a84 this xform is implemented. 
llvm-svn: 45404
 2007-12-29 08:19:39 +00:00
Chris Lattner
f8e408b7b1 Codegen: 
as:

_bar:
	pushl	%esi
	subl	$8, %esp
	movl	16(%esp), %esi
	call	L_foo$stub
	fstps	(%esi)
	addl	$8, %esp
	popl	%esi
	#FP_REG_KILL
	ret

instead of:

_bar:
	pushl	%esi
	subl	$8, %esp
	movl	16(%esp), %esi
	call	L_foo$stub
	fstpl	(%esi)
	cvtsd2ss	(%esi), %xmm0
	movss	%xmm0, (%esi)
	addl	$8, %esp
	popl	%esi
	#FP_REG_KILL
	ret

llvm-svn: 45401
 2007-12-29 06:57:38 +00:00
Chris Lattner
e3515220d2 avoid going through a stack slot to convert from fpstack to xmm reg 
if we are just going to store it back anyway.  This improves things 
like:
double foo();
void bar(double *P) { *P = foo(); }

llvm-svn: 45399
 2007-12-29 06:41:28 +00:00
Chris Lattner
2369d2f4ab dead calls to llvm.stacksave can be deleted, even though they 
have potential side-effects.

llvm-svn: 45392
 2007-12-29 00:59:12 +00:00
Chris Lattner
e26989231e upgrade this test 
llvm-svn: 45391
 2007-12-29 00:57:06 +00:00
Devang Patel
d601ada369 Test -simplifycfg only. 
llvm-svn: 45389
 2007-12-28 22:59:48 +00:00
Owen Anderson
ddb5d73f0a Add a testcase for my recent InstCombine fix, written by Nicholas. 
llvm-svn: 45386
 2007-12-28 21:08:43 +00:00
Gordon Henriksen
86e98275ff Adding bindings for target triple and data layout. 
llvm-svn: 45369
 2007-12-27 20:13:47 +00:00
Chris Lattner
a432f12b76 one fewer uncond branch with my codegenprepare hack for single-mbb backedges. 
llvm-svn: 45360
 2007-12-26 17:23:47 +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
Gordon Henriksen
606ac32019 C and Ocaml bindings for ExecutionEngine (i.e., the JIT compiler). 
llvm-svn: 45335
 2007-12-23 16:59:28 +00:00
Gordon Henriksen
54ef30cb0e Fix a partial application typo. 
llvm-svn: 45317
 2007-12-22 19:41:30 +00:00
Chris Lattner
d64df490ca implement InstCombine/shift-trunc-shift.ll. This allows 
us to compile:
#include <math.h>
int t1(double d) { return signbit(d); }

into:

_t1:
	movd	%xmm0, %rax
	shrq	$63, %rax
	ret

instead of:

_t1:
	movd	%xmm0, %rax
	shrq	$32, %rax
	shrl	$31, %eax
	ret

on x86-64.

llvm-svn: 45311
 2007-12-22 09:07:47 +00:00
Devang Patel
e035f776e9 If succ has succ itself as one of the predecessors then do 
not merge current bb and succ even if bb's terminator is
unconditional branch to succ.

llvm-svn: 45305
 2007-12-22 01:32:53 +00:00
Duncan Sands
bc10247769 Get the verifier to check attributes on calls as well 
as on functions.  Make it verify invokes and not just
ordinary calls.  As a (desired) side-effect, it is no
longer legal to have call attributes on arguments that
are being passed to the varargs part of a varargs
function (llvm-as drops them on the floor anyway).

llvm-svn: 45286
 2007-12-21 19:19:01 +00:00
Duncan Sands
85ca85c070 Make DAE not wipe out attributes on calls, and not drop 
return attributes on the floor.  In the case of a call
to a varargs function where the varargs arguments are
being removed, any call attributes on those arguments
need to be dropped.  I didn't do this because I plan to
make it illegal to have such attributes (see next patch).
With this change, compiling the gcc filter2 eh test at -O0
and then running opt -std-compile-opts on it results in
a correctly working program (compiling at -O1 or higher
results in the test failing due to a problem with how we
output eh info into the IR).

llvm-svn: 45285
 2007-12-21 19:16:16 +00:00
Christopher Lamb
7ca648a7b1 Implement review feedback, including additional transforms 
(icmp slt (sub A B) 1) -> (icmp sle A B)
icmp sgt (sub A B) -1) -> (icmp sge A B)

and add testcase.

llvm-svn: 45256
 2007-12-20 07:21:11 +00:00
Evan Cheng
18c39c03a7 Remove xfail. This is fixed. 
llvm-svn: 45254
 2007-12-20 02:25:21 +00:00
Scott Michel
5cbdbd26a8 More working CellSPU tests: 
- vec_const.ll: Vector constant loads
- immed64.ll: i64, f64 constant loads

llvm-svn: 45242
 2007-12-20 00:44:13 +00:00
Gordon Henriksen
4c9ef1e54f Use a module to group calling convention values, too. 
llvm-svn: 45236
 2007-12-20 00:13:26 +00:00
Gordon Henriksen
fe94b95046 Using modules to group enumerations in Ocaml bindings. 
llvm-svn: 45229
 2007-12-19 22:54:12 +00:00
Gordon Henriksen
46137f1e2e Adding bindings for memory buffers and module providers. Switching 
to exceptions rather than variants for error handling in Ocaml.

llvm-svn: 45226
 2007-12-19 22:30:40 +00:00
Scott Michel
83ac96e27d CellSPU testcase, extract_elt.ll: extract vector element. 
llvm-svn: 45219
 2007-12-19 21:17:42 +00:00
Duncan Sands
56f3add5b7 When inlining through an 'nounwind' call, mark inlined 
calls 'nounwind'.  It is important for correct C++
exception handling that nounwind markings do not get
lost, so this transformation is actually needed for
correctness.

llvm-svn: 45218
 2007-12-19 21:13:37 +00:00
Scott Michel
686bbd9b19 More working CellSPU test cases: 
- call.ll: Function call
- ctpop.ll: Count population
- dp_farith.ll: DP arithmetic
- eqv.ll: Equivalence primitives
- fcmp.ll: SP comparisons
- fdiv.ll: SP division
- fneg-fabs.ll: SP negation, aboslute value
- int2fp.ll: Integer -> SP conversion
- rotate_ops.ll: Rotation primitives
- select_bits.ll: (a & c) | (b & ~c) bit selection
- shift_ops.ll: Shift primitives
- sp_farith.ll: SP arithmentic

llvm-svn: 45217
 2007-12-19 20:50:49 +00:00
Scott Michel
6cb9f6d20c Two more test cases: or_ops.ll (arithmetic or operations) and vecinsert.ll 
(vector insertions)

llvm-svn: 45216
 2007-12-19 20:15:47 +00:00
Scott Michel
d4d96bb6f6 Add new immed16.ll test case, fix CellSPU errata to make test case work. 
llvm-svn: 45196
 2007-12-19 07:35:06 +00:00
Christopher Lamb
d56318b885 Remove an orthogonal transformation of the selection condition from my most recent submission. 
llvm-svn: 45169
 2007-12-18 20:30:28 +00:00
Evan Cheng
8824950e8f Fix PR1872: SrcValue and SrcValueOffset should not be used to compute load / store node id. 
llvm-svn: 45167
 2007-12-18 19:38:14 +00:00
Christopher Lamb
437b4d229e Fix typos. 
llvm-svn: 45159
 2007-12-18 09:45:40 +00:00
Christopher Lamb
aeb76743dc Fold certain additions through selects (and their compares) so as to eliminate subtractions. This code is often produced by the SMAX expansion in SCEV. 
This implements test/Transforms/InstCombine/2007-12-18-AddSelCmpSub.ll

llvm-svn: 45158
 2007-12-18 09:34:41 +00:00
Evan Cheng
36bfae49e3 FIX for PR1799: When a load is unfolded from an instruction, check if it is a new node. If not, do not create a new SUnit. 
llvm-svn: 45157
 2007-12-18 08:42:10 +00:00
Christopher Lamb
efdf2791b2 Don't forget to print address space qualifiers when printing out the type table! Thanks to Gordon Henriksen for pointing this out. 
llvm-svn: 45147
 2007-12-18 03:49:35 +00:00
Dale Johannesen
d0377b8eb2 Testcase for preceding FE fix 
llvm-svn: 45144
 2007-12-18 01:58:38 +00:00
Scott Michel
94d7a2f1f2 i32 immediate constant test case for CellSPU 
llvm-svn: 45134
 2007-12-17 23:45:52 +00:00
Evan Cheng
d9df071ead Bring back int_x86_sse2_movl_dq intrinsic for backward compatibility. Make sure 
it's auto-upgraded to a shufflevector instruction.

llvm-svn: 45131
 2007-12-17 22:33:23 +00:00
Scott Michel
4f980e1acd - Restore some i8 functionality in CellSPU 
- New test case: nand.ll

llvm-svn: 45130
 2007-12-17 22:32:34 +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
42edc61320 Disabling a RUN line that's broken until addrspace roundtrips 
through llvm-as|llvm-dis.

llvm-svn: 45097
 2007-12-17 16:09:28 +00:00
Gordon Henriksen
ef2c27d164 C and Ocaml bindings for address spaces, for that burgeoning market 
for Ocaml-based compilers targeting embedded devices. :)

llvm-svn: 45096
 2007-12-17 16:08:32 +00:00
Duncan Sands
bf62f62058 Make instcombine promote inline asm calls to 'nounwind' 
calls.  Remove special casing of inline asm from the
inliner.  There is a potential problem: the verifier
rejects invokes of inline asm (not sure why).  If an
asm call is not marked "nounwind" in some .ll, and
instcombine is not run, but the inliner is run, then
an illegal module will be created.  This is bad but
I'm not sure what the best approach is.  I'm tempted
to remove the check in the verifier...

llvm-svn: 45073
 2007-12-16 15:51:49 +00:00
Evan Cheng
1d95b669b6 Make better use of instructions that clear high bits; fix various 2-wide shuffle bugs. 
llvm-svn: 45058
 2007-12-15 03:00:47 +00:00
Scott Michel
307f334014 Start committing working test cases for CellSPU. 
llvm-svn: 45050
 2007-12-15 00:38:50 +00:00
Duncan Sands
091a505971 Teach the interpreter to read and write memory in the 
endianness of the target not of the host.  Done by the
simple expedient of reversing bytes for primitive types
if the host and target endianness don't match.  This is
correct for integer and pointer types.  I don't know if
it is correct for floating point types.

llvm-svn: 45039
 2007-12-14 19:38:31 +00:00
Dan Gohman
5290ca3d65 Don't redirect stderr when it isn't needed. 
llvm-svn: 45033
 2007-12-14 15:15:11 +00:00
Evan Cheng
6909ff8c4b Fix ctlz and cttz. llvm definition requires them to return number of bits in of the src type when value is zero. 
llvm-svn: 45029
 2007-12-14 08:30:15 +00:00
Anders Carlsson
900a684ae7 All MMX shift instructions took a <2 x i32> vector as the shift amount parameter. Change this to be <1 x i64> instead, which matches the assembler instruction. 
llvm-svn: 45027
 2007-12-14 06:38:54 +00:00
Evan Cheng
51cf86ded0 Implement ctlz and cttz with bsr and bsf. 
llvm-svn: 45024
 2007-12-14 02:13:44 +00:00
Evan Cheng
a152909956 Be extra careful with extension use optimation. Now turned on by default. 
llvm-svn: 44981
 2007-12-13 03:32:53 +00:00
Zhou Sheng
8361abb64f Remove this testcase as it will always fail on 
platform like Darwin.

llvm-svn: 44977
 2007-12-13 02:03:57 +00:00
Evan Cheng
343929c773 Fold some and + shift in x86 addressing mode. 
llvm-svn: 44970
 2007-12-13 00:43:27 +00:00
Evan Cheng
64a1febf9a Implicit def instructions, e.g. X86::IMPLICIT_DEF_GR32, are always re-materializable and they should not be spilled. 
llvm-svn: 44960
 2007-12-12 23:12:09 +00:00
Dan Gohman
0075ea1f5f Allow vector integer constants to be created with 
SelectionDAG::getConstant, in the same way as vector floating-point
constants. This allows the legalize expansion code for @llvm.ctpop and
friends to be usable with vector types.

llvm-svn: 44954
 2007-12-12 22:21:26 +00:00
Wojciech Matyjewicz
8bb1d9e67c 1. "Upgrage" comments. 
2. Using zero-extended value of Scale and unsigned division is safe provided
   that Scale doesn't have the sign bit set.
   Previously these 2 instructions:
        %p = bitcast [100 x {i8,i8,i8}]* %x to i8*
        %q = getelementptr i8* %p, i32 -4
   were combined into:
        %q = getelementptr [100 x { i8, i8, i8 }]* %x, i32 0,
               i32 1431655764, i32 0
   what was incorrect.

llvm-svn: 44936
 2007-12-12 15:21:32 +00:00
Christopher Lamb
6d12d7c0fe Implement part of review feedback for address spaces. 
llvm-svn: 44933
 2007-12-12 08:44:39 +00:00
Evan Cheng
ad3e7f3286 Use shuffles to implement insert_vector_elt for i32, i64, f32, and f64. 
llvm-svn: 44929
 2007-12-12 07:55:34 +00:00
Evan Cheng
af6ba4dfd4 Add a test case for -optimize-ext-uses. 
llvm-svn: 44928
 2007-12-12 07:54:08 +00:00
Evan Cheng
d36d69fe92 Lower a build_vector with all constants into a constpool load unless it can be done with a move to low part. 
llvm-svn: 44921
 2007-12-12 06:45:40 +00:00
Zhou Sheng
089df5d640 Fixed PR1629. 
Make lli interpreter correctly call external functions sin()/cos(),
__cxa_guard_acquire() and __cxa_guard_release().

llvm-svn: 44910
 2007-12-12 04:55:43 +00:00
Gordon Henriksen
3f070cf3b9 Add (very basic) bindings for ModuleProvider. 
llvm-svn: 44899
 2007-12-12 01:04:30 +00:00
Dan Gohman
b658d65949 Rename these tests to use the appropriate suffixes. 
llvm-svn: 44867
 2007-12-11 15:55:52 +00:00
Dan Gohman
7867eefd96 Use not instead of ignore when an exit status is expected to always 
be non-zero.

llvm-svn: 44866
 2007-12-11 15:50:23 +00:00
Dan Gohman
7be70b555b Don't redirect stderr when it isn't needed. 
llvm-svn: 44865
 2007-12-11 15:41:11 +00:00
Christopher Lamb
7368604860 Implement address space attribute for LLVM pointer types. Address spaces are 
regions of memory that have a target specific relationship, as described in the 
Embedded C Technical Report. 

This also implements the 2007-12-11-AddressSpaces test, 
which demonstrates how address space attributes can be used in LLVM IR.

In addition, this patch changes the bitcode signature for stores (in a backwards 
compatible manner), such that the pointer type, rather than the pointee type, is 
encoded. This permits type information in the pointer (e.g. address space) to be 
preserved for stores.

LangRef updates are forthcoming.

llvm-svn: 44858
 2007-12-11 08:59:05 +00:00
Chris Lattner
568d56425b Implement constant folding if vector<->vector bitcasts where the number 
of source/dest elements changes.  This implements
test/Transforms/InstCombine/bitcast-vector-fold.ll

llvm-svn: 44855
 2007-12-11 07:29:44 +00:00
Evan Cheng
f6c2838f36 - Improved v8i16 shuffle lowering. It now uses pshuflw and pshufhw as much as 
possible before resorting to pextrw and pinsrw.
- Better codegen for v4i32 shuffles masquerading as v8i16 or v16i8 shuffles.
- Improves (i16 extract_vector_element 0) codegen by recognizing
  (i32 extract_vector_element 0) does not require a pextrw.

llvm-svn: 44836
 2007-12-11 01:46:18 +00:00
Gordon Henriksen
aff6e2bba2 Adding Ocaml bindings for the bitreader as requested by Sarah 
Thompson. Usage should be something like this:

open Llvm
open Llvm_bitreader

match read_bitcode_file fn with
  | Bitreader_failure msg ->
      prerr_endline msg
  | Bitreader_success m -> 
      ...;
      dispose_module m

Compile with: ocamlc llvm.cma llvm_bitreader.cma
              ocamlopt llvm.cmxa llvm_bitreader.cmxa

llvm-svn: 44824
 2007-12-11 00:20:48 +00:00
Chris Lattner
5ca42cd342 Fix PR1850 by removing an unsafe transformation from VMCore/ConstantFold.cpp. 
Reimplement the xform in Analysis/ConstantFolding.cpp where we can use
targetdata to validate that it is safe.  While I'm in there, fix some const
correctness issues and generalize the interface to the "operand folder".

llvm-svn: 44817
 2007-12-10 22:53:04 +00:00
Duncan Sands
b7ac459292 Make PruneEH update the nounwind/noreturn attributes 
on functions as it calculates them.

llvm-svn: 44802
 2007-12-10 19:09:40 +00:00
Duncan Sands
1279851352 Fix PR1836: in the interpreter, read and write apints 
using the minimum possible number of bytes.  For little
endian targets run on little endian machines, apints are
stored in memory from LSB to MSB as before.  For big endian
targets on big endian machines they are stored from MSB to
LSB which wasn't always the case before (if the target and
host endianness doesn't match values are stored according
to the host's endianness).  Doing this requires knowing the
endianness of the host, which is determined when configuring -
thanks go to Anton for this.  Only having access to little
endian machines I was unable to properly test the big endian
part, which is also the most complicated...

llvm-svn: 44796
 2007-12-10 17:43:13 +00:00
Christopher Lamb
5c577eb543 Improve branch folding by recgonizing that explict successor relationships impact the value of fall-through choices. 
llvm-svn: 44785
 2007-12-10 07:24:06 +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
95f9743c43 Fix PR1782, patch by Wojtek Matyjewicz! 
llvm-svn: 44733
 2007-12-09 07:35:13 +00:00
Chris Lattner
e93a775a4d Fix a significant code quality regression I introduced on PPC64 quite 
a while ago.  We now produce:

_foo:
	mflr r0
	std r0, 16(r1)
	ld r2, 16(r1)
	std r2, 0(r3)
	ld r0, 16(r1)
	mtlr r0
	blr 

instead of:

_foo:
	mflr r0
	std r0, 16(r1)
	lis r0, 0
	ori r0, r0, 16
	ldx r2, r1, r0
	std r2, 0(r3)
	ld r0, 16(r1)
	mtlr r0
	blr 

for:

void foo(void **X) {
  *X = __builtin_return_address(0);
}

on ppc64.

llvm-svn: 44701
 2007-12-08 07:04:58 +00:00
Chris Lattner
e16166b78d implement __builtin_return_addr(0) on ppc. 
llvm-svn: 44700
 2007-12-08 06:59:59 +00:00
Evan Cheng
34c7b35135 Much improved v8i16 shuffles. (Step 1). 
llvm-svn: 44676
 2007-12-07 08:07:39 +00:00
Evan Cheng
8d1f8b2f27 New test case. 
llvm-svn: 44672
 2007-12-07 01:48:46 +00:00
Evan Cheng
cab253ba13 Fix a bogus test case. 
llvm-svn: 44668
 2007-12-06 22:12:45 +00:00
Evan Cheng
d53f72dfb1 Turning simple splitting on. Start testing new coalescer heuristics as new llcbeta. 
llvm-svn: 44660
 2007-12-06 08:54:31 +00:00
Chris Lattner
64a1a9f502 third time around: instead of disabling this completely, 
only disable it if we don't know it will be obviously profitable.
Still fixme, but less so. :)

llvm-svn: 44658
 2007-12-06 07:47:55 +00:00
Chris Lattner
bb5fb18af8 Actually, disable this code for now. More analysis and improvements to 
the X86 backend are needed before this should be enabled by default.

llvm-svn: 44657
 2007-12-06 07:44:31 +00:00
Chris Lattner
c467b49c96 implement a readme entry, compiling the code into: 
_foo:
	movl	$12, %eax
	andl	4(%esp), %eax
	movl	_array(%eax), %eax
	ret

instead of:

_foo:
	movl	4(%esp), %eax
	shrl	$2, %eax
	andl	$3, %eax
	movl	_array(,%eax,4), %eax
	ret

As it turns out, this triggers all the time, in a wide variety of
situations, for example, I see diffs like this in various programs:

-       movl    8(%eax), %eax
-       shll    $2, %eax
-       andl    $1020, %eax
-       movl    (%esi,%eax), %eax
+       movzbl  8(%eax), %eax
+       movl    (%esi,%eax,4), %eax


-       shll    $2, %edx
-       andl    $1020, %edx
-       movl    (%edi,%edx), %edx
+       andl    $255, %edx
+       movl    (%edi,%edx,4), %edx

Unfortunately, I also see stuff like this, which can be fixed in the
X86 backend:

-       andl    $85, %ebx
-       addl    _bit_count(,%ebx,4), %ebp
+       shll    $2, %ebx
+       andl    $340, %ebx
+       addl    _bit_count(%ebx), %ebp

llvm-svn: 44656
 2007-12-06 07:33:36 +00:00
Chris Lattner
1de4db0446 fix this when run on non x86 hosts. 
llvm-svn: 44645
 2007-12-06 01:05:52 +00:00
Evan Cheng
1d289d0146 Fix for PR1831: if all defs of an interval are re-materializable, then it's a preferred spill candiate. 
llvm-svn: 44644
 2007-12-06 00:01:56 +00:00
Devang Patel
c47f68e747 If ExitValue operand is also defined in Loop header then 
insert new ExitValue after this operand definition.

This fixes PR1828.

llvm-svn: 44539
 2007-12-03 19:17:21 +00:00
Gordon Henriksen
c52a9a365e Fix a typo noticed by Alain Frisch. 
llvm-svn: 44493
 2007-12-01 20:59:23 +00:00
Evan Cheng
79e8b92dc3 Allow some reloads to be folded in multi-use cases. Specifically testl r, r -> cmpl [mem], 0. 
llvm-svn: 44479
 2007-12-01 02:07:52 +00:00
Evan Cheng
90c548af8e Do not fold reload into an instruction with multiple uses. It issues one extra load. 
llvm-svn: 44467
 2007-11-30 21:23:43 +00:00
Evan Cheng
1aa45b56a3 Update tests. 
llvm-svn: 44435
 2007-11-29 10:03:54 +00:00
Chris Lattner
79cd8c14c5 New testcase for PR1744 
llvm-svn: 44418
 2007-11-28 22:43:34 +00:00
Chris Lattner
331852dd02 upgrade this test 
llvm-svn: 44405
 2007-11-28 18:22:12 +00:00
Chris Lattner
863d6e8741 make this test have a deterministic result. 
llvm-svn: 44404
 2007-11-28 18:20:49 +00:00
Duncan Sands
1b0feb42e2 Add some convenience methods for querying attributes, and 
use them.

llvm-svn: 44403
 2007-11-28 17:07:01 +00:00
Duncan Sands
a3c32699ce Revert previous "fix" - the breakage was due to some 
local changes, not the "not".

llvm-svn: 44402
 2007-11-28 16:50:29 +00:00
Duncan Sands
0106c9a15b This test somehow got an extra "not" during the 
recent stderr updates.

llvm-svn: 44401
 2007-11-28 15:36:27 +00:00
Chris Lattner
f35bff85c5 xfail a test 
llvm-svn: 44395
 2007-11-28 05:37:13 +00:00
Chris Lattner
a9dc7d650b update this test after the fmrrd fix 
llvm-svn: 44393
 2007-11-28 05:27:07 +00:00
Tanya Lattner
c33660d278 Fix bug in regression tests that ignored stderr output in RUN lines. Updated tests and fixed broken run lines. 
XFAILed 3 arm regressions (will file bugs)

llvm-svn: 44389
 2007-11-28 04:57:00 +00:00
Chris Lattner
98fe074d3d commit testcase I forgot to svn add. 
llvm-svn: 44383
 2007-11-27 22:43:37 +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
Andrew Lenharth
6e449dc482 something wrong with this opt 
llvm-svn: 44370
 2007-11-27 18:31:30 +00:00
Anton Korobeynikov
49e06eb17d Add testcase for last llvm-gcc tweaks 
llvm-svn: 44368
 2007-11-27 18:21:29 +00:00
Duncan Sands
3602011bec Fix PR1146: parameter attributes are longer part of 
the function type, instead they belong to functions
and function calls.  This is an updated and slightly
corrected version of Reid Spencer's original patch.
The only known problem is that auto-upgrading of
bitcode files doesn't seem to work properly (see
test/Bitcode/AutoUpgradeIntrinsics.ll).  Hopefully
a bitcode guru (who might that be? :) ) will fix it.

llvm-svn: 44359
 2007-11-27 13:23:08 +00:00
Zhou Sheng
cc5e89d3c1 Make this pass for CYGWIN. 
llvm-svn: 44354
 2007-11-27 06:23:59 +00:00
Zhou Sheng
1fec3fccb0 Make this testcase compatible with CYGWIN. 
llvm-svn: 44353
 2007-11-27 06:17:01 +00:00
Dan Gohman
074a744147 Change &| to |&. 
llvm-svn: 44345
 2007-11-27 00:50:57 +00:00
Dan Gohman
dfda7ca2cc Change grep '' to grep {}. 
Change 2>&1 | to |&.

llvm-svn: 44344
 2007-11-27 00:10:35 +00:00
Dan Gohman
21665f8f17 Don't redirect llvm-as's stderr to llvm-dis. 
Change grep '' to grep {}.

llvm-svn: 44343
 2007-11-27 00:07:33 +00:00
Dan Gohman
d12155d8c8 Remove unnecessary && from the RUN lines of this test. 
llvm-svn: 44342
 2007-11-27 00:03:38 +00:00
Dan Gohman
a9f8208852 Don't lower srem/urem X%C to X-X/C*C unless the division is actually 
optimized. This avoids creating illegal divisions when the combiner is
running after legalize; this fixes PR1815. Also, it produces better
code in the included testcase by avoiding the subtract and multiply
when the division isn't optimized.

llvm-svn: 44341
 2007-11-26 23:46:11 +00:00
Owen Anderson
05275b7b14 Allow GVN to eliminate read-only function calls when it can detect that they are redundant. 
llvm-svn: 44323
 2007-11-26 02:26:36 +00:00