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
35,142 Commits 4 Branches 5 Tags 704 MiB
594b0fe9e2
Commit Graph

35142 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
3732406cf1 complete the codegen chapter 
llvm-svn: 43245
 2007-10-23 06:23:57 +00:00
Owen Anderson
1cfa5caa21 Now with valid HTML 4.01! 
llvm-svn: 43244
 2007-10-23 06:22:21 +00:00
Owen Anderson
3c4fe7bcd5 Add a link to the "writing an optimization" tutorial. 
llvm-svn: 43243
 2007-10-23 06:17:39 +00:00
Owen Anderson
3923355119 Add downloadable code sample for tutorial 2. 
llvm-svn: 43242
 2007-10-23 06:05:37 +00:00
Owen Anderson
ba4a0f1787 Add the second of the "basic topics" tutorials. 
llvm-svn: 43241
 2007-10-23 06:03:24 +00:00
Owen Anderson
19620278d3 Reorder the optimization and bitcode tutorials. 
llvm-svn: 43240
 2007-10-23 06:02:14 +00:00
Chris Lattner
a734c6eb3f Fix up a broken #include, move code to its own section, add conclusions. 
llvm-svn: 43239
 2007-10-23 05:43:01 +00:00
Chris Lattner
e4e5ffbe15 Finish up expr codegen. 
llvm-svn: 43238
 2007-10-23 04:51:30 +00:00
Chris Lattner
0705dd275a several improvements suggested by Dan, thanks! 
llvm-svn: 43237
 2007-10-23 04:27:44 +00:00
Evan Cheng
252d9ddb4d Fix memcpy lowering when addresses are 4-byte aligned but size is not multiple of 4. 
llvm-svn: 43234
 2007-10-22 22:11:27 +00:00
Dan Gohman
e223bab494 The #include <iterator> isn't needed in this header. 
llvm-svn: 43232
 2007-10-22 20:44:10 +00:00
Dan Gohman
df1f166e4a Strength reduction improvements. 
- Avoid attempting stride-reuse in the case that there are users that
   aren't addresses. In that case, there will be places where the
   multiplications won't be folded away, so it's better to try to
   strength-reduce them.

 - Several SSE intrinsics have operands that strength-reduction can
   treat as addresses. The previous item makes this more visible, as
   any non-address use of an IV can inhibit stride-reuse.

 - Make ValidStride aware of whether there's likely to be a base
   register in the address computation. This prevents it from thinking
   that things like stride 9 are valid on x86 when the base register is
   already occupied.

Also, XFAIL the 2007-08-10-LEA16Use32.ll test; the new logic to avoid
stride-reuse elimintes the LEA in the loop, so the test is no longer
testing what it was intended to test.

llvm-svn: 43231
 2007-10-22 20:40:42 +00:00
Dan Gohman
76e104c8ad Fix the folding of multiplication into addresses on x86, which was broken 
by the recent {U,S}MUL_LOHI changes.

llvm-svn: 43230
 2007-10-22 20:22:24 +00:00
Evan Cheng
85eb733eff Use ptr type in the immediate field of a BxA instruction so we don't end up selecting 32-bit call instruction for ppc64. 
llvm-svn: 43228
 2007-10-22 19:46:19 +00:00
Evan Cheng
fdd01c99f2 Add missing paratheses. 
llvm-svn: 43227
 2007-10-22 19:42:28 +00:00
Chris Lattner
b32af54827 add a 'don't use me' marker. 
llvm-svn: 43226
 2007-10-22 19:41:46 +00:00
Duncan Sands
b47c73b341 Support for expanding extending loads of integers with 
funky bit-widths.

llvm-svn: 43225
 2007-10-22 19:00:05 +00:00
Dan Gohman
68fc6d7395 Move the SCEV object factors from being static members of the individual 
SCEV subclasses to being non-static member functions of the ScalarEvolution
class.

llvm-svn: 43224
 2007-10-22 18:31:58 +00:00
Duncan Sands
4df76bb946 Fix up the logic for result expanding the various extension 
operations so they work right for integers with funky
bit-widths.  For example, consider extending i48 to i64
on a 32 bit machine.  The i64 result is expanded to 2 x i32.
We know that the i48 operand will be promoted to i64, then
also expanded to 2 x i32.  If we had the expanded promoted
operand to hand, then expanding the result would be trivial.
Unfortunately at this stage we can only get hold of the
promoted operand.  So instead we kind of hand-expand, doing
explicit shifting and truncating to get the top and bottom
halves of the i64 operand into 2 x i32, which are then used
to expand the result.  This is harmless, because when the
promoted operand is finally expanded all this bit fiddling
turns into trivial operations which are eliminated either
by the expansion code itself or the DAG combiner.

llvm-svn: 43223
 2007-10-22 18:26:21 +00:00
Chris Lattner
ba810365f8 fit in 80 cols :) 
llvm-svn: 43222
 2007-10-22 16:44:31 +00:00
Chris Lattner
20c58b6f19 start of chapter 3 
llvm-svn: 43221
 2007-10-22 07:01:42 +00:00
Owen Anderson
4774dea928 Fix a few typos I noticed. 
llvm-svn: 43220
 2007-10-22 06:48:28 +00:00
Owen Anderson
3b5c6a83a5 Add downloadable code samples. 
llvm-svn: 43219
 2007-10-22 06:35:07 +00:00
Chris Lattner
18c6e1e961 Check in part 2: parser and ast. 
llvm-svn: 43218
 2007-10-22 06:34:15 +00:00
Owen Anderson
2c7fdb6067 Fix some code to make it actually work. 
llvm-svn: 43217
 2007-10-22 06:29:31 +00:00
Bill Wendling
8a53fc3a85 Put correct link in example 
llvm-svn: 43216
 2007-10-22 05:10:05 +00:00
Chris Lattner
b55013e96a add part 1, review appreciated. 
llvm-svn: 43215
 2007-10-22 04:32:37 +00:00
Chris Lattner
8d00cf26d5 add an outline for "part 2". 
llvm-svn: 43214
 2007-10-22 03:19:07 +00:00
Chris Lattner
c126b9badc rename tutorial 1 -> JITTutorial1, make unimplemented links not be dead links. 
llvm-svn: 43213
 2007-10-22 03:12:24 +00:00
Evan Cheng
ddeab10144 Fix an unfolding bug. 
llvm-svn: 43212
 2007-10-22 03:03:20 +00:00
Evan Cheng
d06938ff7f - Only perform the unfolding optimization when the folding in question is modref. 
- Remove a bogus assertion.

llvm-svn: 43211
 2007-10-22 03:01:44 +00:00
Chris Lattner
ecea068eb2 add a mechanism for the JIT to invoke a function to lazily create functions as they are referenced. 
llvm-svn: 43210
 2007-10-22 02:50:12 +00:00
Chris Lattner
14bd59e060 llvm-gcc3 is dead, along with it __main. 
llvm-svn: 43209
 2007-10-22 02:39:47 +00:00
Anton Korobeynikov
bcee4726bf Reg2Mem cleanup and optimizations: 
- enable phi instructions demotion to stack
 - create alloca instructions in the entry block

llvm-svn: 43208
 2007-10-21 23:05:16 +00:00
Chris Lattner
dce89c65cc LoadLibraryPermanently doesn't throw. 
llvm-svn: 43207
 2007-10-21 22:58:11 +00:00
Chris Lattner
712119a5ed Add a convenience method for creating EE's. 
llvm-svn: 43206
 2007-10-21 22:57:11 +00:00
Dale Johannesen
2edd0fb69d Allow for copysign having f80 second argument. 
Fixes 5550319.

llvm-svn: 43205
 2007-10-21 01:07:44 +00:00
Chris Lattner
34bb3728ff Add promote operand support for [su]int_to_fp. 
llvm-svn: 43204
 2007-10-20 22:57:56 +00:00
Owen Anderson
980bb805ec Some improvements based on feedback from Anders. 
llvm-svn: 43203
 2007-10-20 06:12:33 +00:00
Owen Anderson
96b48922ca Fix some weird indenting in code. 
llvm-svn: 43202
 2007-10-20 05:41:39 +00:00
Owen Anderson
4cefffc26c Use getOrInsertFunction() in tutorial 1. This makes for shorter, simpler, and better example code. 
llvm-svn: 43201
 2007-10-20 05:40:47 +00:00
Owen Anderson
6cfd06b796 Add the beginnings of an LLVM tutorial. If anyone has suggestions, comments, 
or would like to contribute, let me know!

llvm-svn: 43200
 2007-10-20 05:23:06 +00:00
Chris Lattner
1c4c6a384e Add result promotion of FP_TO_*INT, fixing CodeGen/X86/trunc-to-bool.ll 
with the new legalizer.

llvm-svn: 43199
 2007-10-20 04:32:38 +00:00
Chris Lattner
aa6d58c766 simplify some code. 
llvm-svn: 43198
 2007-10-20 04:09:48 +00:00
Chris Lattner
70abd7943f Implement promote and expand for operands of memcpy and friends. 
This fixes CodeGen/X86/mem*.ll.

llvm-svn: 43197
 2007-10-20 04:07:07 +00:00
Evan Cheng
7df9c5e089 Added missing curly braces which renders the if clause useless in debug build. 
llvm-svn: 43196
 2007-10-20 04:01:47 +00:00
Dale Johannesen
f28404f7e8 Fix a few places vector operations were not getting 
the operand's type from the right place.

llvm-svn: 43195
 2007-10-20 00:07:52 +00:00
Evan Cheng
b56784f9ea Resolve unfold tables ambiguity. 
llvm-svn: 43194
 2007-10-19 23:50:58 +00:00
Evan Cheng
2d53c3f15e New test case. 
llvm-svn: 43193
 2007-10-19 22:05:00 +00:00
Evan Cheng
ded6550885 Local spiller optimization: 
Turn a store folding instruction into a load folding instruction. e.g.
     xorl  %edi, %eax
     movl  %eax, -32(%ebp)
     movl  -36(%ebp), %eax
     orl   %eax, -32(%ebp)
=>
     xorl  %edi, %eax
     orl   -36(%ebp), %eax
     mov   %eax, -32(%ebp)
This enables the unfolding optimization for a subsequent instruction which will
also eliminate the newly introduced store instruction.

llvm-svn: 43192
 2007-10-19 21:23:22 +00:00