RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-29 23:12:55 +01:00
Code Issues Projects Releases Wiki Activity
12,846 Commits 4 Branches 5 Tags 704 MiB
fb2f56c7c8
Commit Graph

106 Commits

Author SHA1 Message Date
Chris Lattner
8574358e8a Move usages of explicit hash_* datastructures to use typedefs 
llvm-svn: 6996
 2003-06-30 03:36:09 +00:00
Chris Lattner
203826c2e1 Revamp DSGraphs so that they can support multiple functions in the same 
DSGraph at one time

llvm-svn: 6994
 2003-06-30 03:15:25 +00:00
Chris Lattner
365e583866 * Changes to make NodeType be private to DSNode. 
* Add new MultiObject flag to DSNode which keeps track of whether or not
  multiple objects have been merged into the node, allowing must-alias info
  to be tracked.

llvm-svn: 6794
 2003-06-19 21:15:11 +00:00
Chris Lattner
2806ac8828 Nodes get forwarded when they are collapsed currently. 
llvm-svn: 6696
 2003-06-16 12:08:18 +00:00
Chris Lattner
1778154dc7 Don't apply type information to load instructions if it will cause collapsing 
llvm-svn: 5684
 2003-03-03 17:13:31 +00:00
Chris Lattner
e5dbced215 Don't put integer pointers (longs) into the scalar map. 
This speeds stuff up by 10% on some tests, woot!

llvm-svn: 5564
 2003-02-14 04:55:58 +00:00
Chris Lattner
522cb6d282 Implement a "union-findy" version of DS-Analysis, which eliminates the 
Referrers list on DSNodes.

llvm-svn: 5536
 2003-02-11 23:11:51 +00:00
Chris Lattner
f8c57bab25 Don't insert null entries into the scalar map for constexpr (cast null to Ty) 
llvm-svn: 5523
 2003-02-09 23:04:12 +00:00
Chris Lattner
2c7c54ce9d Add a flag which effectively disables field sensitivity 
llvm-svn: 5506
 2003-02-08 20:18:39 +00:00
Chris Lattner
5f3ef2f0e7 Implement optimization for direct function call case. This dramatically 
reduces the number of function nodes created and speeds up analysis by
about 10% overall.

llvm-svn: 5495
 2003-02-05 21:59:58 +00:00
Chris Lattner
4e0422745c Fix a huge bug with handling non-pointer instructions 
llvm-svn: 5491
 2003-02-04 00:59:50 +00:00
Chris Lattner
7aec6c471b Change DSGraph stuff to use hash_(set|map) instead of std::(set|map) 
This change provides a small (3%) but consistent speedup

llvm-svn: 5460
 2003-02-01 04:52:08 +00:00
Chris Lattner
6051f888b4 Remove using declarations 
llvm-svn: 5456
 2003-02-01 04:01:21 +00:00
Chris Lattner
712b3598b8 free instructions mark their operands as being heap nodes. 
llvm-svn: 5425
 2003-01-28 20:59:57 +00:00
Chris Lattner
f1afc156f8 * Eliminate boolean arguments in favor of using enums 
* T-D pass now eliminates unreachable globals

llvm-svn: 5419
 2003-01-23 22:05:33 +00:00
Chris Lattner
1c82a35a0b Slight efficiency improvement 
llvm-svn: 5418
 2003-01-23 21:31:16 +00:00
Vikram S. Adve
773fe59c79 Two bug fixes: 
(1) Make entries for Constant values in the ScalarMap.
(2) Set MOD bit for the node pointed to by the
    argument of a free instruction.

llvm-svn: 4948
 2002-12-06 21:17:10 +00:00
Chris Lattner
f179a40a00 Add peak memory usage support 
llvm-svn: 4748
 2002-11-18 21:44:19 +00:00
Chris Lattner
2597c1158f Initialize PrintAuxCalls member 
llvm-svn: 4677
 2002-11-10 06:53:38 +00:00
Chris Lattner
1fe76d2385 eliminate the ability to remove global nodes from deadNodeElminate... for now. 
This slows stuff down a bit, but it should get much better before it gets any
worse.

llvm-svn: 4666
 2002-11-09 22:07:02 +00:00
Chris Lattner
0752756a6a Add globals graphs to all three passes 
llvm-svn: 4663
 2002-11-09 21:12:07 +00:00
Chris Lattner
e726eb5ea7 Clean up DSGraph::removeDeadNodes interface 
llvm-svn: 4660
 2002-11-09 21:00:49 +00:00
Chris Lattner
3e54e8f3ca Make removeTriviallyDeadNodes a private interface of DSGraph 
llvm-svn: 4659
 2002-11-09 20:55:24 +00:00
Chris Lattner
082bbe3069 Don't put constants into the scalar map! 
llvm-svn: 4657
 2002-11-09 20:14:03 +00:00
Chris Lattner
1c5c03d6f7 Add initial support for a globals graph 
llvm-svn: 4656
 2002-11-09 20:01:01 +00:00
Chris Lattner
6172544663 #include Datastructure.h first 
llvm-svn: 4654
 2002-11-09 19:25:10 +00:00
Chris Lattner
986ec528fd * actually handle constants (especially constantexprs) correctly. 
- This seems to dramatically improve many benchmarks, only slowing down
    gzip significantly.

llvm-svn: 4621
 2002-11-08 05:00:44 +00:00
Chris Lattner
dfba076f5b Rename DataStructureAnalysis namespace to DS 
llvm-svn: 4596
 2002-11-07 05:20:53 +00:00
Chris Lattner
d0387e7e11 Dramatically simplify internal DSNode representation, get implementation 
*FULLY OPERATIONAL* and safe.  We are now capable of completely analyzing
at LEAST the Olden benchmarks + 181.mcf

llvm-svn: 4562
 2002-11-06 06:20:27 +00:00
Chris Lattner
8d63aab886 Rename ValueMap to ScalarMap 
llvm-svn: 4516
 2002-11-03 21:27:48 +00:00
Chris Lattner
0ee058644e Rename NewNode flag to HeapNode 
llvm-svn: 4515
 2002-11-03 21:24:04 +00:00
Chris Lattner
702ac95902 Implement the "unknown flag" which mainly consists of aligning printing code 
llvm-svn: 4490
 2002-11-02 00:36:03 +00:00
Chris Lattner
226c503f31 Stop representing scalars as explicit nodes in the graph. Now the only 
nodes in the graph are memory objects, which is very nice.  This also greatly
reduces the size and memory footprint for DSGraphs.  For example, the local
DSGraph for llu went from 65 to 13 nodes with this change.  As a side bonus,
dot seems to lay out the graphs slightly better too.  :)

llvm-svn: 4488
 2002-11-02 00:13:20 +00:00
Chris Lattner
07c1f70586 Remove dead code 
llvm-svn: 4467
 2002-10-31 06:52:26 +00:00
Chris Lattner
317daff9bf This fixes all kinds of problems with array handling. There are still bugs to 
be fixed, but we are getting much closer now.

    * Make DSNode::TypeRec a full fledged DSTypeRec type.
    * Add methods used to update and access the typerecords elements
    * Add methods to query if and to cause a node to be completely folded
    * DSGraph construction doesn't use the allocation type for anything at all,
      now nodes get their type information based on how they are used.
    * Fixed a bug with global value handling introduced in the last checkin
    * GEP support is now much better, arrays are handled correctly.  The array
      flag is now updated in type records.  There are still cases that are not
      handled yet (we do not detect pessimizations), but getting much closer.

llvm-svn: 4465
 2002-10-31 05:45:02 +00:00
Chris Lattner
8929f75913 Don't create a new node for every reference to a global. This caused a huge 
node explosion that doesn't help anything at all.  In previous versions of
the representation this DID help, but not anymore.

llvm-svn: 4249
 2002-10-21 13:51:30 +00:00
Chris Lattner
2914391ab6 - Make DSCallSite not inherit from std::vector. Renamed methods slightly. 
Make copy ctor have two versions to avoid dealing with conditional template
    argument.  DSCallSite ctor now takes all arguments instead of taking one
    and being populated later.

llvm-svn: 4240
 2002-10-21 02:08:03 +00:00
Chris Lattner
189b9b5397 Avoid extra copy 
llvm-svn: 4239
 2002-10-20 22:12:06 +00:00
Vikram S. Adve
85a358583f Remove spurious caller pointer in DSCallSite. 
Also add functions to access pointer argument nodes cleanly.

llvm-svn: 4235
 2002-10-20 21:41:02 +00:00
Vikram S. Adve
c02c96c3de Added a first-class representation for each call site that can be 
used in the DS graphs.  Essentially, what was vector<DSNodeHandle>
before is now a DSCallSite with the same vector, plus pointers to the
CallInst and the caller Function.  The special-purpose class
BUDataStructure::CallSite is no longer needed.

llvm-svn: 4228
 2002-10-20 18:07:37 +00:00
Chris Lattner
efc251af3d Convert typerec to be a structure instead of a pair 
llvm-svn: 4226
 2002-10-18 18:22:46 +00:00
Chris Lattner
51b2abb899 Calculate mod/ref info 
llvm-svn: 4223
 2002-10-17 22:13:19 +00:00
Chris Lattner
e52f808665 DataStructure.h doesn't include DSGraph.h 
llvm-svn: 4029
 2002-10-02 22:14:38 +00:00
Chris Lattner
62ca2aa593 * Implement fully general merging of array subscripts on demand! This 
does not handle the initial pointer index case yet though.

llvm-svn: 4012
 2002-10-02 06:24:36 +00:00
Chris Lattner
c1b7de86d5 Checkin some major reworks of data structure analysis. This is not done, 
nor does it work very well, but I need to get it checked in before I break
the tree unintentionally.

llvm-svn: 3996
 2002-10-01 22:33:50 +00:00
Chris Lattner
9f18db8156 Eliminated the MemAccessInst class, folding contents into GEP class. 
llvm-svn: 3488
 2002-08-22 23:37:24 +00:00
Chris Lattner
969c616d51 Load & StoreInst no longer derive from MemAccessInst, so we don't have 
to handle indexing anymore

llvm-svn: 3485
 2002-08-22 22:49:05 +00:00
Chris Lattner
b90f78e2b3 - Do not expose ::ID from any of the analyses anymore. 
llvm-svn: 3416
 2002-08-21 17:09:45 +00:00
Vikram S. Adve
6162134b47 Add GlobalDSGraph -- a common graph that holds externally visible nodes. 
llvm-svn: 3173
 2002-07-30 22:08:08 +00:00
Chris Lattner
3f47f1065b * Standardize how analysis results/passes as printed with the print() virtual 
methods
* Eliminate AnalysisID:  Now it is just a typedef for const PassInfo*
* Simplify how AnalysisID's are initialized
* Eliminate Analysis/Writer.cpp/.h: incorporate printing functionality into
  the analyses themselves.

llvm-svn: 3115
 2002-07-27 01:12:15 +00:00
Chris Lattner
748999282f Always create a shadow node for a store instruction, even if it's storing 
a scalar value.  Likewise for load instructions.

llvm-svn: 2990
 2002-07-22 16:35:53 +00:00
Chris Lattner
556ab513cc Rename removeDeadNodes to removeTriviallyDeadNodes 
llvm-svn: 2969
 2002-07-18 18:19:09 +00:00
Chris Lattner
da58a2a5ed Implement cast nodes correctly. 
llvm-svn: 2964
 2002-07-18 15:54:42 +00:00
Chris Lattner
9c49e62315 Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. 
llvm-svn: 2945
 2002-07-18 00:12:30 +00:00
Chris Lattner
809bd75ead * Nodes now keep track of any global variables in them 
* Only dead-node-eliminate nodes with no flags
* Don't merge scalars, only merge what they point to.

llvm-svn: 2878
 2002-07-11 20:32:02 +00:00
Chris Lattner
5d62e136c5 New implementation of data structure analysis. Only local analysis has been 
implemented so far.

llvm-svn: 2871
 2002-07-10 22:38:08 +00:00