RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity
14,589 Commits 4 Branches 5 Tags 704 MiB
fff02e213b
Commit Graph

14589 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
fff02e213b This pass is not needed, as there is only ever one global: the stack 
llvm-svn: 16800
 2004-10-07 04:10:36 +00:00
Chris Lattner
a705773db7 Add new testcase, rename pass 
llvm-svn: 16799
 2004-10-07 04:07:08 +00:00
Chris Lattner
3a2af6b431 Don't add libz or libbz2 to the USEDLIBS lists, those are for LLVM libraries. 
llvm-svn: 16798
 2004-10-07 00:03:11 +00:00
Chris Lattner
6211fd3b08 Don't call memset if malloc returns a null pointer 
llvm-svn: 16797
 2004-10-06 23:08:03 +00:00
Chris Lattner
4a19983f2d Implement GlobalConstifier/trivialstore.llx, and also do some 
simplifications of the resultant program to avoid making later passes
do it all.

This allows us to constify globals that just have the same constant that
they are initialized stored into them.

Suprisingly this comes up ALL of the freaking time, dozens of times in
SPEC, 30 times in vortex alone.

For example, on 256.bzip2, it allows us to constify these two globals:

%smallMode = internal global ubyte 0             ; <ubyte*> [#uses=8]
%verbosity = internal global int 0               ; <int*> [#uses=49]

Which (with later optimizations) results in the bytecode file shrinking
from 82286 to 69686 bytes!  Lets hear it for IPO :)

For the record, it's nuking lots of "if (verbosity > 2) { do lots of stuff }"
code.

llvm-svn: 16793
 2004-10-06 20:57:02 +00:00
Chris Lattner
c128e52a90 New testcase 
llvm-svn: 16791
 2004-10-06 20:42:51 +00:00
Chris Lattner
e412d10cc0 Dont' let null nodes sneak past cast instructions 
llvm-svn: 16779
 2004-10-06 19:29:13 +00:00
Misha Brukman
9ed0f36e93 Undoxyfy internal method. 
llvm-svn: 16774
 2004-10-06 17:19:58 +00:00
Misha Brukman
80dedeb9fd Doxygen-ify comments 
llvm-svn: 16773
 2004-10-06 16:56:16 +00:00
Chris Lattner
c2563bf614 Change Type::isAbstract to have better comments, a more correct name 
(PromoteAbstractToConcrete), and to use a set to avoid recomputation.
In particular, this set eliminates the potentially exponential cases
from this little recursive algorithm.

On a particularly nasty testcase, llvm-dis on the .bc file went from 34
minutes (which is when I killed it, it still hadn't finished) to 0.57s.
Remember kids, exponential algorithms are bad.

llvm-svn: 16772
 2004-10-06 16:36:46 +00:00
Chris Lattner
3f0662954e Rename method, change comment, add argument 
llvm-svn: 16771
 2004-10-06 16:34:23 +00:00
Chris Lattner
38fbf09104 Correct some typeos 
llvm-svn: 16770
 2004-10-06 16:28:24 +00:00
Chris Lattner
ff8cbd01e7 Instcombine: -(X sdiv C) -> (X sdiv -C), tested by sub.ll:test16 
llvm-svn: 16769
 2004-10-06 15:08:25 +00:00
Chris Lattner
8d0c024ff3 New testcase 
llvm-svn: 16768
 2004-10-06 15:07:56 +00:00
Chris Lattner
82aa8544a5 Remove debugging code, fix encoding problem. This fixes the problems 
the JIT had last night.

llvm-svn: 16766
 2004-10-06 14:31:50 +00:00
Nate Begeman
79d42a185e Turning on fsel code gen now that we can do so would be good. 
llvm-svn: 16765
 2004-10-06 11:03:30 +00:00
Nate Begeman
7b4fe83ba8 Implement floating point select for lt, gt, le, ge using the powerpc fsel 
instruction.

Now, rather than emitting the following loop out of bisect:
.LBB_main_19:	; no_exit.0.i
	rlwinm r3, r2, 3, 0, 28
	lfdx f1, r3, r27
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f2, lo16(.CPI_main_1-"L00000$pb")(r3)
	fsub f2, f2, f1
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f4, lo16(.CPI_main_1-"L00000$pb")(r3)
	fcmpu cr0, f1, f4
	bge .LBB_main_64	; no_exit.0.i
.LBB_main_63:	; no_exit.0.i
	b .LBB_main_65	; no_exit.0.i
.LBB_main_64:	; no_exit.0.i
	fmr f2, f1
.LBB_main_65:	; no_exit.0.i
	addi r3, r2, 1
	rlwinm r3, r3, 3, 0, 28
	lfdx f1, r3, r27
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f4, lo16(.CPI_main_1-"L00000$pb")(r3)
	fsub f4, f4, f1
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f5, lo16(.CPI_main_1-"L00000$pb")(r3)
	fcmpu cr0, f1, f5
	bge .LBB_main_67	; no_exit.0.i
.LBB_main_66:	; no_exit.0.i
	b .LBB_main_68	; no_exit.0.i
.LBB_main_67:	; no_exit.0.i
	fmr f4, f1
.LBB_main_68:	; no_exit.0.i
	fadd f1, f2, f4
	addis r3, r30, ha16(.CPI_main_2-"L00000$pb")
	lfd f2, lo16(.CPI_main_2-"L00000$pb")(r3)
	fmul f1, f1, f2
	rlwinm r3, r2, 3, 0, 28
	lfdx f2, r3, r28
	fadd f4, f2, f1
	fcmpu cr0, f4, f0
	bgt .LBB_main_70	; no_exit.0.i
.LBB_main_69:	; no_exit.0.i
	b .LBB_main_71	; no_exit.0.i
.LBB_main_70:	; no_exit.0.i
	fmr f0, f4
.LBB_main_71:	; no_exit.0.i
	fsub f1, f2, f1
	addi r2, r2, -1
	fcmpu cr0, f1, f3
	blt .LBB_main_73	; no_exit.0.i
.LBB_main_72:	; no_exit.0.i
	b .LBB_main_74	; no_exit.0.i
.LBB_main_73:	; no_exit.0.i
	fmr f3, f1
.LBB_main_74:	; no_exit.0.i
	cmpwi cr0, r2, -1
	fmr f16, f0
	fmr f17, f3
	bgt .LBB_main_19	; no_exit.0.i

We emit this instead:
.LBB_main_19:	; no_exit.0.i
	rlwinm r3, r2, 3, 0, 28
	lfdx f1, r3, r27
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f2, lo16(.CPI_main_1-"L00000$pb")(r3)
	fsub f2, f2, f1
	fsel f1, f1, f1, f2
	addi r3, r2, 1
	rlwinm r3, r3, 3, 0, 28
	lfdx f2, r3, r27
	addis r3, r30, ha16(.CPI_main_1-"L00000$pb")
	lfd f4, lo16(.CPI_main_1-"L00000$pb")(r3)
	fsub f4, f4, f2
	fsel f2, f2, f2, f4
	fadd f1, f1, f2
	addis r3, r30, ha16(.CPI_main_2-"L00000$pb")
	lfd f2, lo16(.CPI_main_2-"L00000$pb")(r3)
	fmul f1, f1, f2
	rlwinm r3, r2, 3, 0, 28
	lfdx f2, r3, r28
	fadd f4, f2, f1
	fsub f5, f0, f4
	fsel f0, f5, f0, f4
	fsub f1, f2, f1
	addi r2, r2, -1
	fsub f2, f1, f3
	fsel f3, f2, f3, f1
	cmpwi cr0, r2, -1
	fmr f16, f0
	fmr f17, f3
	bgt .LBB_main_19	; no_exit.0.i

llvm-svn: 16764
 2004-10-06 09:53:04 +00:00
Chris Lattner
b0e465f0cb Codegen signed mod by 2 or -2 more efficiently. Instead of generating: 
t:
        mov %EDX, DWORD PTR [%ESP + 4]
        mov %ECX, 2
        mov %EAX, %EDX
        sar %EDX, 31
        idiv %ECX
        mov %EAX, %EDX
        ret

Generate:
t:
        mov %ECX, DWORD PTR [%ESP + 4]
***     mov %EAX, %ECX
        cdq
        and %ECX, 1
        xor %ECX, %EDX
        sub %ECX, %EDX
***     mov %EAX, %ECX
        ret

Note that the two marked moves are redundant, and should be eliminated by the
register allocator, but aren't.

Compare this to GCC, which generates:

t:
        mov     %eax, DWORD PTR [%esp+4]
        mov     %edx, %eax
        shr     %edx, 31
        lea     %ecx, [%edx+%eax]
        and     %ecx, -2
        sub     %eax, %ecx
        ret

or ICC 8.0, which generates:

t:
        movl      4(%esp), %ecx                                 #3.5
        movl      $-2147483647, %eax                            #3.25
        imull     %ecx                                          #3.25
        movl      %ecx, %eax                                    #3.25
        sarl      $31, %eax                                     #3.25
        addl      %ecx, %edx                                    #3.25
        subl      %edx, %eax                                    #3.25
        addl      %eax, %eax                                    #3.25
        negl      %eax                                          #3.25
        subl      %eax, %ecx                                    #3.25
        movl      %ecx, %eax                                    #3.25
        ret                                                     #3.25

We would be in great shape if not for the moves.

llvm-svn: 16763
 2004-10-06 05:01:07 +00:00
Chris Lattner
c959314701 Really fix FreeBSD, which apparently doesn't tolerate the extern. 
Thanks to Jeff Cohen for pointing out my goof.

llvm-svn: 16762
 2004-10-06 04:21:52 +00:00
Chris Lattner
09b6b3f514 Fix a scary bug with signed division by a power of two. We used to generate: 
s:   ;; X / 4
        mov %EAX, DWORD PTR [%ESP + 4]
        mov %ECX, %EAX
        sar %ECX, 1
        shr %ECX, 30
        mov %EDX, %EAX
        add %EDX, %ECX
        sar %EAX, 2
        ret

When we really meant:

s:
        mov %EAX, DWORD PTR [%ESP + 4]
        mov %ECX, %EAX
        sar %ECX, 1
        shr %ECX, 30
        add %EAX, %ECX
        sar %EAX, 2
        ret

Hey, this also reduces register pressure too :)

llvm-svn: 16761
 2004-10-06 04:19:43 +00:00
Chris Lattner
9258948b08 Codegen signed divides by 2 and -2 more efficiently. In particular 
instead of:

s:   ;; X / 2
        movl 4(%esp), %eax
        movl %eax, %ecx
        shrl $31, %ecx
        movl %eax, %edx
        addl %ecx, %edx
        sarl $1, %eax
        ret

t:   ;; X / -2
        movl 4(%esp), %eax
        movl %eax, %ecx
        shrl $31, %ecx
        movl %eax, %edx
        addl %ecx, %edx
        sarl $1, %eax
        negl %eax
        ret

Emit:

s:
        movl 4(%esp), %eax
        cmpl $-2147483648, %eax
        sbbl $-1, %eax
        sarl $1, %eax
        ret

t:
        movl 4(%esp), %eax
        cmpl $-2147483648, %eax
        sbbl $-1, %eax
        sarl $1, %eax
        negl %eax
        ret

llvm-svn: 16760
 2004-10-06 04:02:39 +00:00
Chris Lattner
acd213fba3 Add some new instructions. Fix the asm string for sbb32rr 
llvm-svn: 16759
 2004-10-06 04:01:02 +00:00
Chris Lattner
5f0c904ec0 Reduce code growth implied by the tail duplication pass by not duplicating 
an instruction if it can be hoisted to a common dominator of the block.
This implements: test/Regression/Transforms/TailDup/MergeTest.ll

llvm-svn: 16758
 2004-10-06 03:27:37 +00:00
Chris Lattner
7a3968b6c0 When tail duplicating these functions, the add instruction should not be 
duplicated, even though the block it is in is duplicated.

llvm-svn: 16757
 2004-10-06 03:26:38 +00:00
Chris Lattner
b2e8fdc431 FreeBSD uses GCC. Patch contributed by Jeff Cohen! 
llvm-svn: 16756
 2004-10-06 03:15:44 +00:00
Chris Lattner
231c7ddfee Fix the path to the fixinc'd headers. Patch contributed by Jeff Cohen! 
llvm-svn: 16755
 2004-10-06 03:13:47 +00:00
Brian Gaeke
38641114a3 Must include sys/stat.h before declaring a 'struct stat' 
llvm-svn: 16728
 2004-10-05 18:46:59 +00:00
Brian Gaeke
109b8c6ede Build BFtoLLVM example front-end by default 
llvm-svn: 16719
 2004-10-05 18:05:53 +00:00
Brian Gaeke
bbe7875896 Add BFtoLLVM example front end 
llvm-svn: 16714
 2004-10-05 18:05:25 +00:00
Chris Lattner
6023408a6e Make sure the const bit gets inherited correctly when linking declarations 
of disagreeing constness.  This fixes
test/Regression/Linker/ConstantGlobals[123].ll

llvm-svn: 16692
 2004-10-05 02:28:11 +00:00
Chris Lattner
c8991a1e98 Another testcase for constness linkage 
llvm-svn: 16691
 2004-10-05 02:16:01 +00:00
Chris Lattner
84fddeb7a6 Testcase to ensure that the 'constant' flag follows the definition when there 
is a question.

llvm-svn: 16690
 2004-10-05 02:12:20 +00:00
Reid Spencer
bba26329ab Adjust sys/stat.h inclusion so its only for SunOS. 
llvm-svn: 16686
 2004-10-05 00:56:46 +00:00
Tanya Lattner
7198953962 Added a couple of includes to get this to compile on Sparc. 
llvm-svn: 16685
 2004-10-05 00:51:26 +00:00
Chris Lattner
6547451f32 Solaris doesn't have MAP_FILE. 
llvm-svn: 16682
 2004-10-05 00:46:21 +00:00
Chris Lattner
52a451f4b8 Bug fixed 
llvm-svn: 16671
 2004-10-05 00:23:02 +00:00
Chris Lattner
6df035f866 New testcase for PR450 
llvm-svn: 16670
 2004-10-05 00:18:21 +00:00
Reid Spencer
010dec5772 Add checks for the ZLIB and BZIP2 header files, not just the libraries. 
llvm-svn: 16669
 2004-10-04 22:05:53 +00:00
Chris Lattner
4463fcc2f8 Fix #include flavor 
llvm-svn: 16658
 2004-10-04 18:10:18 +00:00
Reid Spencer
5638e9632d Move the warning about no compression library down to the bottom, away 
from the fray, so it gets noticed. This commit is made without the
corresponding configure script commit because it doesn't affect
functionality and we don't want to force everyone into another reconfigure

llvm-svn: 16657
 2004-10-04 18:02:55 +00:00
Reid Spencer
5c3b0b7e23 Fix typo in makefile variable name that prevents zlib from being recognized 
llvm-svn: 16656
 2004-10-04 17:49:19 +00:00
Reid Spencer
fdf5f0f13a Add HAVE_BZIP2 and HAVE_ZLIB 
llvm-svn: 16655
 2004-10-04 17:48:37 +00:00
Reid Spencer
079b225788 Excise the ill-advised RLCOMP compression algorithm and simply leave the 
previously temporary NULLCOMP implementation that merely copies the data
verbatim without compression. Also, don't warn if there's no compression
library as that is taken care of during configuration time.

llvm-svn: 16654
 2004-10-04 17:45:44 +00:00
Misha Brukman
fd3ade5075 Add example 'abstract' architectures for LLI: MIX, MMIX, and DLX 
llvm-svn: 16653
 2004-10-04 17:36:35 +00:00
Reid Spencer
49089d64c2 Add a context for the callback so different compression scenarios can be 
distinguished. Tidy up documentation.  Thanks, Chris.

llvm-svn: 16652
 2004-10-04 17:29:25 +00:00
Reid Spencer
024857a516 Minor corrections suggested by Chris' ever-watchful eye. 
llvm-svn: 16651
 2004-10-04 17:26:26 +00:00
Chris Lattner
9f6c72d660 Fix build if not HAVE_BZIP2 
llvm-svn: 16650
 2004-10-04 16:33:25 +00:00
Reid Spencer
da2e8b9943 First version of the MappedFile abstraction for operating system idependent 
mapping of files. This first version uses mmap where its available. The
class needs to implement an alternate mechanism based on malloc'd memory
and file reading/writing for platforms without virtual memory.

llvm-svn: 16649
 2004-10-04 11:08:32 +00:00
Reid Spencer
d2bedc512d First version of a support utility to provide generalized compression in 
LLVM that handles availability and unavailability of bzip2 and zlib.

llvm-svn: 16648
 2004-10-04 10:49:41 +00:00
Chris Lattner
0228f228df * Prune #includes 
* Update comments
* Rearrange code a bit
* Finally ELIMINATE the GAS workaround emitter for Intel mode.  woot!

llvm-svn: 16647
 2004-10-04 07:31:08 +00:00