RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 12:43:36 +01:00
Code Issues Projects Releases Wiki Activity
10,192 Commits 4 Branches 5 Tags 704 MiB
0344923d09
Commit Graph

1995 Commits

Author SHA1 Message Date
Alkis Evlogimenos
2ff7101cf2 Add global methods that prevent us from using ilist::iterators as 
random access iterators.

llvm-svn: 11248
 2004-02-09 22:40:50 +00:00
Brian Gaeke
00b2107e2a SchedGraph doesn't need to be friends with SchedGraphNodeCommon anymore. 
llvm-svn: 11240
 2004-02-09 18:43:06 +00:00
Chris Lattner
f231cb60f4 Now that all of the derived types have disciplined interfaces, we can eliminate 
all of the ad-hoc storage of contained types.  This allows getContainedType to
not be virtual, and allows us to entirely delete the TypeIterator class.

llvm-svn: 11230
 2004-02-09 05:40:24 +00:00
Chris Lattner
fd4417ba18 Increase encapsulation of the StructType class, eliminating the getElementTypes() member 
llvm-svn: 11227
 2004-02-09 04:36:50 +00:00
Chris Lattner
cb8c4b9d1b Improve encapsulation in the FunctionType class, by adding param_(iterator/begin/end) 
members, and eliminating the getParamTypes() method, and the associated typedef.

llvm-svn: 11223
 2004-02-09 04:12:57 +00:00
Chris Lattner
68fdb35576 rename the "exceptional" destination of an invoke instruction to the 'unwind' dest 
llvm-svn: 11202
 2004-02-08 21:44:31 +00:00
Chris Lattner
32a3eb0b88 Substantially improve the DSA code by removing 'forwarding' nodes from 
DSGraphs while they are forwarding.  When the last reference to the forwarding
node is dropped, the forwarding node is autodeleted.  This should simplify
removeTriviallyDead nodes, and is only (efficiently) possible because we are
using an ilist of dsnodes now.

llvm-svn: 11175
 2004-02-08 01:27:18 +00:00
Chris Lattner
29067016a4 Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> 
llvm-svn: 11173
 2004-02-08 00:53:26 +00:00
Chris Lattner
aaa095c8f4 One of the 'annoying' things about ilists is that the iterators don't behave 
quite the same as for non-intrusive lists of pointers to nodes.  To support
transitioning code bases, add a new 'compatibility' iterator.

llvm-svn: 11172
 2004-02-08 00:51:31 +00:00
Chris Lattner
e78429de24 Change to use iterators instead of direct access 
llvm-svn: 11170
 2004-02-08 00:22:41 +00:00
Chris Lattner
48a0d7e1c0 Abstract out the Nodes collection. Instead of providing a getNodes() method, 
provide node_begin/end iterators, which are only guaranteed to be
bidirectional, not random access.

llvm-svn: 11165
 2004-02-07 23:57:09 +00:00
Chris Lattner
2199bb0c7a Actually USE isForwarding method 
llvm-svn: 11160
 2004-02-07 23:02:32 +00:00
Chris Lattner
6337300b83 As Alkis pointed out to me, I forgot to commit this... :( 
llvm-svn: 11159
 2004-02-07 22:54:19 +00:00
Brian Gaeke
6a4cdc6ee6 Use autoconf answers from config.h (FIXME, should autoconf this file 
directly instead).

Fix LockHolder/MutexLocker typo.

llvm-svn: 11156
 2004-02-06 22:33:17 +00:00
Misha Brukman
dafb899df2 Fix grammar. 
llvm-svn: 11153
 2004-02-06 18:40:35 +00:00
Alkis Evlogimenos
676e5b8997 Modify the two address instruction pass to remove the duplicate 
operand of the instruction and thus simplify the register allocation.

llvm-svn: 11124
 2004-02-04 22:17:40 +00:00
Brian Gaeke
efde1c6bb8 Include <iosfwd> and <string> instead of <iostream>. 
Take away the default iostream argument of createMachineFunctionPrinterPass(),
at Chris's request.

llvm-svn: 11121
 2004-02-04 21:41:10 +00:00
Chris Lattner
0d6e2dfd13 Check in header file I forgot before. 
llvm-svn: 11115
 2004-02-04 03:59:08 +00:00
Chris Lattner
a762ad2a4f Delete the BasicBlock ctor that only takes a BasicBlock to insert before. This 
fails when the basic block points to the function->end.  Instead, require that
the client pass in the function AND the basicblock to insert into.

llvm-svn: 11112
 2004-02-04 03:57:34 +00:00
Alkis Evlogimenos
5e78d4bd75 When an instruction like: A += B had both A and B virtual registers 
spilled, A was loaded from its stack location twice. This fixes the bug.

llvm-svn: 11093
 2004-02-03 01:13:07 +00:00
Alkis Evlogimenos
e128cb3295 Revert changes. Will implement this using a different set of primitives 
llvm-svn: 11091
 2004-02-02 23:08:58 +00:00
Alkis Evlogimenos
e20cdc6437 Add MachineOperand::setDef() and MachineOperand::setUse() so that the 
TwoAddressInstructionPass can correctly update use/def information.

llvm-svn: 11086
 2004-02-02 21:55:18 +00:00
Brian Gaeke
a393704706 Add prototype for llvm::allocatePowerPCTargetMachine(). 
llvm-svn: 11072
 2004-02-02 19:05:08 +00:00
Chris Lattner
f5812885e3 Correct the method I just added to actually return false sometimes 
llvm-svn: 11069
 2004-02-02 18:53:04 +00:00
Chris Lattner
990f40f069 Add a new method to ConstantFP 
llvm-svn: 11068
 2004-02-02 18:40:29 +00:00
Chris Lattner
7e93bb1d9e The first half of a fix for PR218 & test/Regression/Assembler/2004-02-01-NegativeZero.llx 
llvm-svn: 11063
 2004-02-01 22:48:09 +00:00
Alkis Evlogimenos
0ec32d4118 Add MRegisterInfo::getNumRegs(). 
llvm-svn: 11058
 2004-02-01 17:14:20 +00:00
Chris Lattner
fd937e9d01 Add comments 
llvm-svn: 11042
 2004-02-01 00:32:48 +00:00
Alkis Evlogimenos
d1ec5f36ee Merge safe parts from last night's buggy commit. These do not break 
any test cases :-)

llvm-svn: 11032
 2004-01-31 19:59:32 +00:00
Chris Lattner
dadbb4da4d Add two static methods to avoid having client code explicitly compare against 
FirstVirtualRegister

llvm-svn: 11031
 2004-01-31 19:57:11 +00:00
Alkis Evlogimenos
b9df133d67 Revert last night's changes as they broke some tests. Will remerge parts of the patch. 
llvm-svn: 11029
 2004-01-31 14:37:41 +00:00
Alkis Evlogimenos
c0db519832 Several performance enhancements and cleanups from Chris. 
Simplification of LiveIntervals::Interval::overlaps() and addition of
examples to overlaps() and liveAt() to make them clearer.

llvm-svn: 11028
 2004-01-31 04:56:07 +00:00
Chris Lattner
bb4d6f00f9 Add a new pointsToConstantMemory method to the AliasAnalysis interface 
which can be implemented to improve the quality of mod-ref information.

llvm-svn: 11020
 2004-01-30 22:15:41 +00:00
Chris Lattner
8671a315d5 Add a new lazily constructed mapping from Idx's the MBB they represent 
llvm-svn: 11017
 2004-01-30 22:08:09 +00:00
Brian Gaeke
9cf840250b Give clients of MachineFunctionPrinter the ability to specify a banner and 
choose an ostream.

llvm-svn: 11016
 2004-01-30 21:53:46 +00:00
Misha Brukman
64f7595915 Doxygenify comments. 
llvm-svn: 11014
 2004-01-30 17:22:50 +00:00
Chris Lattner
fc239578ad Keep track of all of the globals inserted into the scalar map 
llvm-svn: 10995
 2004-01-28 03:01:22 +00:00
Chris Lattner
268db40292 Pull the ScalarMap out into something that is more structured than what we had 
before.  This allows us to have a place to implement optimizations in a
structured way.

llvm-svn: 10994
 2004-01-28 02:42:12 +00:00
Chris Lattner
2ead39d5c8 Minor tweaks 
llvm-svn: 10983
 2004-01-27 21:49:42 +00:00
Chris Lattner
16a5e6bf33 Add comments, allow DSNode "copy ctor" to ignore outgoing links, add more 
structured access to the globals list, add a couple helper methods.

llvm-svn: 10982
 2004-01-27 21:49:25 +00:00
Chris Lattner
95d03595ae * cloneReachable* and clonePartiallyInto are not obsolete 
* Make AssertNodeInGraph not be HORRIBLY time consuming
* Eliminate the dead mergeInGlobalsGraph method
*** Add the definition for the new ReachabilityCloner class

llvm-svn: 10981
 2004-01-27 21:48:35 +00:00
Alkis Evlogimenos
2a8df1739b Fix failing test cases with joined live intervals. It turns out that 
when joining we need to check if we overlap with the second interval
or any of its aliases.

Also make joining intervals the default.

llvm-svn: 10973
 2004-01-23 13:37:51 +00:00
Chris Lattner
de6ca7bf30 Add new flag, other minor modifications 
llvm-svn: 10969
 2004-01-23 01:42:32 +00:00
Chris Lattner
99f9b84640 Fix grammar 
llvm-svn: 10968
 2004-01-23 01:42:16 +00:00
Alkis Evlogimenos
b4745bda05 Add option to join live intervals. Two intervals are joined if there 
is a move between two registers, at least one of the registers is
virtual and the two live intervals do not overlap.

This results in about 40% reduction in intervals, 30% decrease in the
register allocators running time and a 20% increase in peephole
optimizations (mainly move eliminations).

The option can be enabled by passing -join-liveintervals where
appropriate.

llvm-svn: 10965
 2004-01-22 23:08:45 +00:00
Chris Lattner
a72f3a387a Eliminated the CompletedNodes argument to the cloneReachable* methods. This 
map was only used to implement a marginal GlobalsGraph optimization, and it
actually slows the analysis down (due to the overhead of keeping it), so just
eliminate it entirely.

llvm-svn: 10955
 2004-01-22 16:56:13 +00:00
Chris Lattner
7348bd20b1 It doesn't make sense for one side to be const, but not the other. 
llvm-svn: 10952
 2004-01-22 16:08:51 +00:00
Chris Lattner
5f0e00c8b2 Remove const qualifier (all Value*'s are nonconst in DSA, so it's not clear 
why this one was)

Add new method proto

llvm-svn: 10950
 2004-01-22 15:26:52 +00:00
Chris Lattner
f2a7d96dde Specialize std::swap correctly 
llvm-svn: 10949
 2004-01-22 15:26:15 +00:00
Misha Brukman
38664cbb8b To materialize a module, you need to know what functions NEED to be read and 
which ones don't, which is state that the parent class doesn't know without
knowing the implementation. Let the children classes implement
materializeModule().

llvm-svn: 10942
 2004-01-21 22:54:10 +00:00