RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-28 14:32:51 +01:00
Code Issues Projects Releases Wiki Activity
1,913 Commits 4 Branches 5 Tags 704 MiB
513ecd7256
Commit Graph

1094 Commits

Author SHA1 Message Date
Chris Lattner
513ecd7256 * Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodes 
to reflect that they can eliminate arbitrary nodes.
* Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the
  same reason

llvm-svn: 2020
 2002-03-28 19:16:48 +00:00
Chris Lattner
fa67ad938c Ooops, I did such a great job pruning nodes, that I accidentally deleted 
ALL allocation nodes... hrm... bad.

llvm-svn: 2018
 2002-03-28 18:38:38 +00:00
Chris Lattner
0336a78488 Initial checkin of Noop pass that will be the pool allocator 
llvm-svn: 2014
 2002-03-28 18:08:31 +00:00
Chris Lattner
55186e7abf Many changes 
* Simplify a lot of the inlining stuff.  There are still problems, but not
  many
* Break up the Function representation to have a vector for every different
  node type so it is fast to find nodes of a particular flavor.
* Do more intelligent merging of call values
* Allow elimination of unreachable shadow and allocation nodes
* Generalize indistinguishability testing to allow merging of identical calls.
* Increase shadow node merging power

llvm-svn: 2010
 2002-03-28 17:56:03 +00:00
Cameron Buschardt
49c09d5b24 * Move classes around 
* rename constructor function
* Move stuff into anonymous namespaces

llvm-svn: 2007
 2002-03-27 23:28:40 +00:00
Cameron Buschardt
bcff69b0f4 Implemented promote mem->reg pass. 
llvm-svn: 2005
 2002-03-27 23:17:37 +00:00
Chris Lattner
d771725ed1 * Add #define to enabled debug messages 
* Move removeEdgesTo to be a member of DSNode
* Implement (but #ifdef out) the new, spiffier, method of determining
  shadow node equivalence.  This cannot be enabled until more is
  implemented.

llvm-svn: 2004
 2002-03-27 19:48:03 +00:00
Chris Lattner
4c6e9cda3f * Implement DSNode::removeAllIncomingEdges 
* Implement Critical Shadow node handling
* Implement routines to determine whether an allocation node is a malloc
  or alloca

llvm-svn: 2003
 2002-03-27 19:46:05 +00:00
Chris Lattner
a16c85b43d * Add critical node support 
* Optimize graph after building it.  This should be unneccesary in the future

llvm-svn: 2002
 2002-03-27 19:45:12 +00:00
Chris Lattner
9aff5a8047 * Destroy alloca nodes when a graph gets inlined 
* Add links to all subtrees when a shadow node gets resolved
* Add critical node handling

llvm-svn: 2001
 2002-03-27 19:44:33 +00:00
Chris Lattner
2a3d6c83ff * Optimizers return true on change 
* Implement indistinguishable shadow node elimination

llvm-svn: 1999
 2002-03-27 00:55:13 +00:00
Chris Lattner
ae0192e2f6 Fix long line 
llvm-svn: 1998
 2002-03-27 00:54:31 +00:00
Chris Lattner
8a44f81684 * Because of optimization, the shadow nodes between arguments might get 
removed.  Check to see if they are there.
* Repeat optimizations while changing

llvm-svn: 1997
 2002-03-27 00:53:57 +00:00
Chris Lattner
d5b115e687 Initial checkin of Datastructure analysis. 
Has bugs, but shouldn't crash in theory.

llvm-svn: 1994
 2002-03-26 22:39:06 +00:00
Chris Lattner
18073550b8 Change from Method to Function 
llvm-svn: 1992
 2002-03-26 18:02:30 +00:00
Chris Lattner
849c762b02 Change references from Method to Function 
change references from MethodARgument to FunctionArgument

llvm-svn: 1991
 2002-03-26 18:01:55 +00:00
Chris Lattner
8972179a78 Convert to use new style casts instead of direct checking 
llvm-svn: 1990
 2002-03-26 17:58:12 +00:00
Chris Lattner
57efd6ffd1 change refs to Method to Function 
Change references to MEthodArgument to FunctionArgument

llvm-svn: 1989
 2002-03-26 17:55:33 +00:00
Vikram S. Adve
bd1e4e8bd8 Moved to directory Scalar/ and renamed. 
llvm-svn: 1977
 2002-03-24 03:55:06 +00:00
Vikram S. Adve
3dfd5b888b Destroy MethodLiveVarInfo after register allocation. 
llvm-svn: 1976
 2002-03-24 03:54:03 +00:00
Vikram S. Adve
fa2ed7e6b1 Use deterministic iterator for SchedGraphs. This is actually not 
useful right now when we only do local scheduling.

llvm-svn: 1975
 2002-03-24 03:53:03 +00:00
Vikram S. Adve
058ec11ea3 Bug fix: nextToTry was not being initialized in one case. 
llvm-svn: 1974
 2002-03-24 03:46:15 +00:00
Vikram S. Adve
37d44e7de9 Add option to disable scheduling. 
llvm-svn: 1973
 2002-03-24 03:45:35 +00:00
Vikram S. Adve
0cdcf40121 Add option to disable scheduling. 
Destroy live-variable information after scheduling so it is
recomputed before later phases (e.g., reg. allocation).
Use deterministic iterator to enumerate sched graphs.

llvm-svn: 1972
 2002-03-24 03:44:55 +00:00
Vikram S. Adve
d18a1cc9fb Minor changes. 
llvm-svn: 1971
 2002-03-24 03:40:59 +00:00
Vikram S. Adve
e06cac463f Re-fix bug: Put back MachineCodeForInstruction::dropAllReferences. 
llvm-svn: 1970
 2002-03-24 03:40:11 +00:00
Vikram S. Adve
b347d2796c Fix padding for variables allocated on stack. 
llvm-svn: 1969
 2002-03-24 03:39:26 +00:00
Vikram S. Adve
34306e0e1c Major overhaul to FoldGetElemPtr to handle mixed array and struct refs. 
llvm-svn: 1968
 2002-03-24 03:37:53 +00:00
Vikram S. Adve
8493ae74b2 Use deterministic iterator for treeRoots. 
llvm-svn: 1967
 2002-03-24 03:36:52 +00:00
Vikram S. Adve
8ada4c031e Bug re-fix: put back MachineCodeForInstruction::get(*I).dropAllReferences(). 
Also re-enable instr. scheduling pass.

llvm-svn: 1966
 2002-03-24 03:35:16 +00:00
Vikram S. Adve
7b84ec22d8 Change latencies for Load, Store and Branch instructions. 
llvm-svn: 1965
 2002-03-24 03:33:53 +00:00
Vikram S. Adve
57d735db7a Major enhancements to how array and structure indices are handled. 
Improve checking for constants in Multiply.
Simpler method to keep track of when a node is folded into its parent.
Several other bug fixes.

llvm-svn: 1964
 2002-03-24 03:33:02 +00:00
Vikram S. Adve
a141a7190b Change treeRoots data structure to make enumeration deterministic. 
llvm-svn: 1962
 2002-03-24 03:24:00 +00:00
Vikram S. Adve
1f5e8f93cc Major overhaul to support arbitrary mixed array and structure indices. 
Also moved to the Scalar/ directory and renamed to "MultiDim".

llvm-svn: 1961
 2002-03-24 03:21:18 +00:00
Chris Lattner
c481e92886 Rename Method to Function 
llvm-svn: 1957
 2002-03-23 22:51:58 +00:00
Vikram S. Adve
3294262573 New pass to decompose multi-dimensional array references into 
a sequence of 1-D references, using a sequence of getElementPtrs.

llvm-svn: 1948
 2002-03-23 20:43:39 +00:00
Chris Lattner
0b9734b293 Add an assertion that would hopefully catch a problem that was tripping 
cameron up

llvm-svn: 1944
 2002-03-22 18:01:58 +00:00
Chris Lattner
2ed4beefea Fix bug test/Regression/Transforms/LevelRaise/2002-03-21-MissedRaise3.ll 
llvm-svn: 1943
 2002-03-21 23:02:37 +00:00
Chris Lattner
ad241cc3ea Fix test/Regression/Transforms/LevelRaise/2002-03-21-MissedRaise2.ll 
llvm-svn: 1941
 2002-03-21 22:39:59 +00:00
Chris Lattner
8051e7c953 * AllocationInst ctor moved here from iMemory.h 
* AllocationInst now always has an array size operand

llvm-svn: 1939
 2002-03-21 22:37:48 +00:00
Chris Lattner
a80b65c208 Fix test/Regression/Other/2002-03-21-LevelRaiseMiss.ll 
llvm-svn: 1933
 2002-03-21 21:21:13 +00:00
Chris Lattner
c2b5cb5619 Make ConvertableToGEP handle cases where the user is indexing into the 
first element of a structure type.  Before this would not be handled because
getStructOffset would either stop immediately (because StopEarly was true
and Offset = 0), or blast past the level we wanted.

Now ConvertableToGEP steps down through the type one level at a time, checking
the Offset and Scale conditions at each step

llvm-svn: 1931
 2002-03-21 06:27:20 +00:00
Chris Lattner
559c71f6f4 Implement the new InsertInstBeforeInst function 
llvm-svn: 1930
 2002-03-21 06:24:00 +00:00
Chris Lattner
14fe793707 Fix the: test/Regression/Other/2002-03-20-LevelRaiseCrash.ll bug. It turned 
out that almost always the result of the add was the same as the GEP that
would be generated.  In this case, however, it wasn't, so bad things happened.

llvm-svn: 1929
 2002-03-21 06:22:23 +00:00
Chris Lattner
e9ec6058e4 Declare the new InsertInstBeforeInst function 
llvm-svn: 1927
 2002-03-21 06:15:53 +00:00
Chris Lattner
ceb4e429a2 Add an assertion to catch a misuse of replaceAllUsesWith 
llvm-svn: 1924
 2002-03-21 05:38:15 +00:00
Chris Lattner
72367834b0 1. Fix bug test/Regression/Other/2002-03-20-LevelRaiseBadCodegen.ll 
2. Allow negative scales in ConvertableToGEP, so that this loop from
   alloc_tree in the Olden health benchmark is correctly raised:

       for (i = 3; i >= 0; i--)
         fval[i] = alloc_tree(level - 1, label*4 + i + 1, new);

   Stepping through the array backwards caused a negative scale.

llvm-svn: 1922
 2002-03-21 03:04:38 +00:00
Chris Lattner
db90f5f6ea Namespace qualify debugging code 
llvm-svn: 1921
 2002-03-21 03:02:07 +00:00
Vikram S. Adve
92fb8b1f9c Fixed several problems with handling arguments to Phis. 
llvm-svn: 1910
 2002-03-18 03:47:26 +00:00
Vikram S. Adve
cd6cb1962f Big bug fix: killed uses were being inserted instead of erased! 
Also added a set of debug options.

llvm-svn: 1909
 2002-03-18 03:45:41 +00:00