RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-23 13:02:52 +02:00
Code Issues Projects Releases Wiki Activity
26,089 Commits 4 Branches 5 Tags 704 MiB
6e08e7035f
Commit Graph

1015 Commits

Author SHA1 Message Date
Evan Cheng
6e08e7035f Eliminate SelectNodeTo() and getTargetNode() variants which take more than 
3 SDOperand operands. They are replaced by versions which take an array
of SDOperand and the number of operands.

llvm-svn: 29905
 2006-08-27 08:08:54 +00:00
Nate Begeman
f94ddf0d12 Properly size the string table, and emit symbol table and string table 
entries in the correct order, fixing several fixmes.

llvm-svn: 29902
 2006-08-26 15:46:34 +00:00
Evan Cheng
1c3d571e4b SelectNodeTo now returns a SDNode*. 
llvm-svn: 29901
 2006-08-26 08:00:10 +00:00
Chris Lattner
ec9c7fa089 Completely change the way that joining with physregs is implemented. This 
paves the way for future changes, increases coallescing opportunities (in
theory, not witnessed in practice), and eliminates the really expensive
LiveIntervals::overlapsAliases method.

llvm-svn: 29890
 2006-08-25 23:41:24 +00:00
Jim Laskey
e9b0e1014e Tidy up. 
llvm-svn: 29888
 2006-08-25 22:56:30 +00:00
Jim Laskey
3af6953257 Consolidate callee saved register information so that it can me used by debug 
information and exception handling.

llvm-svn: 29881
 2006-08-25 19:45:51 +00:00
Nate Begeman
ce8ab85260 Get closer to handling globals correctly. We now generally get them in the 
right section.

llvm-svn: 29871
 2006-08-25 06:36:58 +00:00
Chris Lattner
28645a15bd Take advantage of the recent improvements to the liveintervals set (tracking 
instructions which define each value#) to simplify and improve the coallescer.
In particular, this patch:

1. Implements iterative coallescing.
2. Reverts an unsafe hack from handlePhysRegDef, superceeding it with a
   better solution.
3. Implements PR865, "coallescing" away the second copy in code like:

   A = B
   ...
   B = A

This also includes changes to symbolically print registers in intervals
when possible.

llvm-svn: 29862
 2006-08-24 22:43:55 +00:00
Reid Spencer
88bbd0bcf8 Remove a FIXME. Don't use strlcpy that isn't available on non-BSD platforms 
and ensure that a memory overrun won't occur while still writing Length
bytes in the outstring function.

llvm-svn: 29855
 2006-08-24 14:25:39 +00:00
Nate Begeman
0f0148d5f8 Correctly attribute file author & remote tabs 
llvm-svn: 29852
 2006-08-23 21:33:27 +00:00
Nate Begeman
1268d6cd46 Initial checkin of the Mach-O emitter. There's plenty of fixmes, but it 
does emit linkable .o files in very simple cases.

llvm-svn: 29850
 2006-08-23 21:08:52 +00:00
Chris Lattner
410c49afd3 Improve the LiveInterval class to keep track of which machine instruction 
defines each value# tracked by the interval.  This will be used to improve
coallescing.

llvm-svn: 29830
 2006-08-22 18:19:46 +00:00
Chris Lattner
0a5e21e28d Switch to using smallvector for liveintervals. This speeds up live interval 
analysis 11% on kc++.

llvm-svn: 29812
 2006-08-22 06:32:56 +00:00
Chris Lattner
2e9885371b move LiveInterval state all together 
llvm-svn: 29806
 2006-08-21 23:15:12 +00:00
Chris Lattner
db290f7479 Constify some methods. Patch provided by Anton Vayvod, thanks! 
llvm-svn: 29756
 2006-08-17 22:00:08 +00:00
Chris Lattner
a2eba83561 switch the SUnit pred/succ sets from being std::sets to being smallvectors. 
This reduces selectiondag time on kc++ from 5.43s to 4.98s (9%).  More
significantly, this speeds up the default ppc scheduler from ~1571ms to 1063ms,
a 33% speedup.

llvm-svn: 29743
 2006-08-17 00:09:56 +00:00
Chris Lattner
c0e2997872 add an accessor 
llvm-svn: 29739
 2006-08-16 22:57:08 +00:00
Chris Lattner
1e0b221fb2 Convert vector to smallvector: 4% speedup. 
llvm-svn: 29735
 2006-08-16 22:12:48 +00:00
Chris Lattner
c1654416d6 Change the use_list to be a smallvector instead of a vector. This reduces 
isel time from 6.79s to 5.53s (22%) on kc++ with a release build on ppc.
Go smallvector! :)

llvm-svn: 29731
 2006-08-16 21:01:10 +00:00
Chris Lattner
cb3adb8225 Start using SDVTList more consistently 
llvm-svn: 29711
 2006-08-15 19:11:05 +00:00
Chris Lattner
ff1826e850 add a new SDVTList type and new SelectionDAG::getVTList methods to streamline 
the creation of canonical VTLists.

llvm-svn: 29709
 2006-08-15 17:46:01 +00:00
Chris Lattner
28369b8d7d Make getNodeValueTypes methods public. 
llvm-svn: 29688
 2006-08-14 23:54:24 +00:00
Chris Lattner
8e8d9a3358 Add a new getNode() method that takes a pointer to an already-intern'd list 
of value-type nodes.  This avoids having to do mallocs for std::vectors of
valuetypes when a node returns more than one type.

llvm-svn: 29685
 2006-08-14 23:31:51 +00:00
Chris Lattner
9ff7eb17e0 remove SelectionDAG::InsertISelMapEntry, it is dead 
llvm-svn: 29677
 2006-08-14 22:24:39 +00:00
Chris Lattner
fe1fd00ce8 Add code to resize the CSEMap hash table. This doesn't speedup codegen of 
kimwitu, but seems like a good idea from a "avoid performance cliffs" standpoint :)

llvm-svn: 29675
 2006-08-14 22:19:25 +00:00
Nate Begeman
0e92042770 Emit .set directives for jump table entries when possible, which reduces 
the number of relocations in object files, shrinkifying them.

llvm-svn: 29650
 2006-08-12 21:29:52 +00:00
Chris Lattner
7d59e9d16c Track # nodes in a CSEMap. 
llvm-svn: 29643
 2006-08-12 01:07:51 +00:00
Chris Lattner
5510fa4ac5 Switch NodeID to track 32-bit chunks instead of 8-bit chunks, for a 2.5% 
speedup in isel time.

llvm-svn: 29640
 2006-08-11 23:55:53 +00:00
Chris Lattner
a271f8f58c Remove 8 more std::map's. 
llvm-svn: 29631
 2006-08-11 21:55:30 +00:00
Chris Lattner
173c5fb3f3 remove old piece of the V9 backend. 
llvm-svn: 29628
 2006-08-11 21:11:35 +00:00
Chris Lattner
c3f78d1407 Start moving leaf nodes over to the CSEMap. 
llvm-svn: 29625
 2006-08-11 21:00:46 +00:00
Chris Lattner
c3def8c8f4 new method for adding ints 
llvm-svn: 29622
 2006-08-11 18:53:44 +00:00
Chris Lattner
3c504c013b eliminate the NullaryOps map, use CSEMap instead. 
llvm-svn: 29621
 2006-08-11 18:38:11 +00:00
Chris Lattner
d154649343 Change one ReplaceAllUsesWith method to take an array of operands to replaceinstead of a vector of operands. 
llvm-svn: 29617
 2006-08-11 17:46:44 +00:00
Chris Lattner
cc742c4155 Remove now-dead method. 
llvm-svn: 29615
 2006-08-11 17:40:26 +00:00
Chris Lattner
587718e305 remove a (now) unused getNode method. 
llvm-svn: 29613
 2006-08-11 17:25:05 +00:00
Chris Lattner
7b1362fa52 Start eliminating temporary vectors used to create DAG nodes. Instead, pass 
in the start of an array and a count of operands where applicable.  In many
cases, the number of operands is known, so this static array can be allocated
on the stack, avoiding the heap.  In many other cases, a SmallVector can be
used, which has the same benefit in the common cases.

I updated a lot of code calling getNode that takes a vector, but ran out of
time.  The rest of the code should be updated, and these methods should be
removed.

We should also do the same thing to eliminate the methods that take a
vector of MVT::ValueTypes.

It would be extra nice to convert the dagiselemitter to avoid creating vectors
for operands when calling getTargetNode.

llvm-svn: 29566
 2006-08-08 02:23:42 +00:00
Chris Lattner
be2fc7b875 Eliminate some malloc traffic by allocating vectors on the stack. Change some 
method that took std::vector<SDOperand> to take a pointer to a first operand
and #operands.

This speeds up isel on kc++ by about 3%.

llvm-svn: 29561
 2006-08-08 01:09:31 +00:00
Chris Lattner
8058dae7a7 New CSEMap datastructure impl 
llvm-svn: 29555
 2006-08-07 23:31:24 +00:00
Chris Lattner
1661ffa2eb Revamp the "CSEMap" datastructure used in the SelectionDAG class. This 
eliminates a bunch of std::map's in the SelectionDAG, replacing them with a
home-grown hashtable.

This is still a work in progress: not all the maps have been moved over and the
hashtable never resizes.  That said, this still speeds up llc 20% on kimwitu++
with -fast -regalloc=local using a release build.

llvm-svn: 29550
 2006-08-07 23:03:03 +00:00
Evan Cheng
a42653b7ae Move DAGSize to SelectionDAGISel; it's used in tablegen'd isel code. 
llvm-svn: 29547
 2006-08-07 22:16:08 +00:00
Chris Lattner
154ffd3c8f Make SelectionDAG::RemoveDeadNodes iterative instead of recursive, which 
also make it simpler.

llvm-svn: 29524
 2006-08-04 17:45:20 +00:00
Evan Cheng
7bdbdf9ae7 AssignTopologicalOrder now returns the vector of SDNode* by reference to 
avoid the expensive operation of copying a vector.
It also returns a maximum id by value.

llvm-svn: 29478
 2006-08-02 21:58:44 +00:00
Jim Laskey
6d121090d3 Final polish on machine pass registries. 
llvm-svn: 29471
 2006-08-02 12:30:23 +00:00
Jim Laskey
f850832788 Breaking out specialized classes. 
llvm-svn: 29470
 2006-08-02 12:27:50 +00:00
Jim Laskey
f9f462bc5e Now that the ISel is available, it's possible to create a default instruction 
scheduler creator.

llvm-svn: 29452
 2006-08-01 19:14:14 +00:00
Jim Laskey
f5e160063e 1. Change use of "Cache" to "Default". 
2. Added argument to instruction scheduler creators so the creators can do
special things.
3. Repaired target hazard code.
4. Misc.

More to follow.

llvm-svn: 29450
 2006-08-01 18:29:48 +00:00
Jim Laskey
29880272a9 Forgot the added files for plugable machine passes. 
llvm-svn: 29436
 2006-08-01 16:31:08 +00:00
Jim Laskey
b92b14f422 Introducing plugable register allocators and instruction schedulers. 
llvm-svn: 29434
 2006-08-01 14:21:23 +00:00
Evan Cheng
e4fdb294ae Added AssignTopologicalOrder() to assign each node an unique id based on their topological order. 
llvm-svn: 29431
 2006-08-01 08:20:41 +00:00