RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-22 04:22:57 +02:00
Code Issues Projects Releases Wiki Activity
4,906 Commits 4 Branches 5 Tags 704 MiB
8f7c7a40c5
Commit Graph

412 Commits

Author SHA1 Message Date
Chris Lattner
380395f58e Allow specification of whether the call sites should be copied, AND whether 
the aux call sites should be copied

llvm-svn: 4639
 2002-11-08 22:27:09 +00:00
Chris Lattner
5cffea23bb Reenable 'quick exit' case 
llvm-svn: 4638
 2002-11-08 22:26:43 +00:00
Chris Lattner
8cd66f734f Reduce amount of work needed to compute ip/modref 
llvm-svn: 4637
 2002-11-08 22:17:01 +00:00
Chris Lattner
b3bf781d44 Reimplement TD pass completely it now works 
llvm-svn: 4635
 2002-11-08 21:28:37 +00:00
Chris Lattner
f1e963a98c Cannot modify original call sites vector 
llvm-svn: 4634
 2002-11-08 21:27:37 +00:00
Chris Lattner
427b472549 - Add a bunch of checking to make sure that dead nodes are not used after they 
are marked DEAD.  This helped track down some bugs
- Fix a bunch of bugs where we were doing work on nodes after they became dead
- Add support for aux function call sites
- Add support for not cloning call sites

llvm-svn: 4633
 2002-11-08 21:27:12 +00:00
Chris Lattner
4feccc4d45 Remove gunk used by broken TD pass 
llvm-svn: 4632
 2002-11-08 21:25:24 +00:00
Chris Lattner
30e3d26423 Fix IPModRef to use new DS interface 
llvm-svn: 4628
 2002-11-08 19:13:14 +00:00
Chris Lattner
22e36c86cd Use DSNodeHandleMap instead to be safe 
llvm-svn: 4622
 2002-11-08 05:01:14 +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
86b5e92d45 Add flush 
llvm-svn: 4619
 2002-11-08 01:21:07 +00:00
Chris Lattner
f13f9c585e Implement ResolveCallSiteModRefInfo for IPModRef. computeModRef is not yet done though! 
llvm-svn: 4602
 2002-11-07 07:12:23 +00:00
Chris Lattner
450e1fbc76 Instead of using a bool that constant has to be explained, use a self 
explanitory enum instead.

llvm-svn: 4600
 2002-11-07 07:06:20 +00:00
Chris Lattner
7d2624d4f3 Implement a new mergeInGraph method, which basically factors code out of 
the BU class.

This will be used by the IPModRef class to do stuff, eventually perhaps the
TD pass will use it also.

Speaking of the TD pass, this also eliminates the self recursive case, which
was broken, and couldn't occur anyway.

llvm-svn: 4599
 2002-11-07 06:31:54 +00:00
Chris Lattner
dfba076f5b Rename DataStructureAnalysis namespace to DS 
llvm-svn: 4596
 2002-11-07 05:20:53 +00:00
Chris Lattner
a0d26350c6 Fix problem with dangling referrers 
llvm-svn: 4595
 2002-11-07 05:00:35 +00:00
Chris Lattner
d68d0a9037 Minor bugfix to enable generation of methcall.llvm.lib, objinst.llvm.lib, and 
The problem was merging two unsized types like function's, ie int (int*) with
int (uint *)

llvm-svn: 4594
 2002-11-07 04:59:28 +00:00
Chris Lattner
b0de126c1a Compute total number of nodes and # call nodes 
llvm-svn: 4592
 2002-11-07 02:18:46 +00:00
Chris Lattner
f352eadeb3 Move printouts to be wrapped in DEBUG() macros 
llvm-svn: 4588
 2002-11-07 01:54:56 +00:00
Chris Lattner
1efa9f0247 When the -only-print-main-ds option is specified, still print out graph size 
statistics for skipped functions

llvm-svn: 4587
 2002-11-07 01:54:44 +00:00
Chris Lattner
9870fb032e Allow the ResolveCallSiteModRefInfo method to return a mapping of nodes, 
implement the mod/ref bit masking

llvm-svn: 4578
 2002-11-06 19:59:33 +00:00
Chris Lattner
f7e839f435 Add a stub to implement the context sensitive mod/ref info for call sites 
llvm-svn: 4577
 2002-11-06 19:38:43 +00:00
Chris Lattner
00de4338dc Give a back pointer to the IPModRef object to the FunctionModRefInfo object 
llvm-svn: 4576
 2002-11-06 19:07:13 +00:00
Chris Lattner
0e158e64ff Remove a couple of #includes, move some code from .h file 
llvm-svn: 4575
 2002-11-06 18:38:18 +00:00
Chris Lattner
97722c2dad Change Steens class to build with Vikram's changes 
llvm-svn: 4572
 2002-11-06 18:08:32 +00:00
Chris Lattner
6a019cdff5 Make PointerSize & Shift be enums 
Fix problem with recursive merging

llvm-svn: 4570
 2002-11-06 18:01:39 +00:00
Vikram S. Adve
201d4e3639 Make query operations non-const to allow demand-driven analyses. 
llvm-svn: 4569
 2002-11-06 17:17:55 +00:00
Vikram S. Adve
2a1c1171e7 An interprocedural analysis pass that computes flow-insensitive 
IP Mod and Ref information for every function and every call site.

llvm-svn: 4567
 2002-11-06 17:02:03 +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
304e29942d Delete "StripScalars" argument to cloneInto method 
llvm-svn: 4560
 2002-11-06 06:16:30 +00:00
Chris Lattner
b09aadd633 Attempted fixes to the mergemap to make it work better. 
Ended up disabling merge map merging completely.  It shall be removed.

llvm-svn: 4550
 2002-11-05 00:01:58 +00:00
Vikram S. Adve
b7afa2004a Simple passes that print out SCCs in the CFGs or in the CallGraph of a module. 
llvm-svn: 4532
 2002-11-04 14:20:22 +00:00
Chris Lattner
5c467c7d99 Change the "Cannot merge two portions of the same node yet" from an assertion 
into a "oh crap, lets collapse" case

llvm-svn: 4530
 2002-11-04 06:48:26 +00:00
Chris Lattner
4e4beb637b Give a better error message in an unhandled case 
llvm-svn: 4521
 2002-11-04 02:29:15 +00:00
Chris Lattner
aaf17e11b1 Allow the call graph to be called from analyze naturally with print implemented 
llvm-svn: 4517
 2002-11-04 00:21:19 +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
7287a8f9a8 Change the letters used to represent stack and heap allocations to "S" and "H" 
respectively.  This is to make presentation easier in the paper.

llvm-svn: 4514
 2002-11-03 19:46:15 +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
53f7777f77 Oops, this was not meant to be checked in 
llvm-svn: 4489
 2002-11-02 00:26:32 +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
251a8d9df5 Fix comments, steens is context sensitive, we just haven't implemented 
mod/ref apis yet

llvm-svn: 4485
 2002-11-01 17:34:23 +00:00
Chris Lattner
52b845cd0c Add a fixme 
llvm-svn: 4479
 2002-10-31 23:24:00 +00:00
Chris Lattner
32eb8c3659 * Minor optimization: when merging nodes, merge the smaller one into the 
larger one.
     * Handle the case where we are merging two nodes of different size better.

llvm-svn: 4476
 2002-10-31 22:41:15 +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
d4c9998d7a Use new isCommutative interface, which gives us SetEQ and SetNE for free. 
Thanks fly out to Casey Carter for this fix.

llvm-svn: 4460
 2002-10-31 04:20:07 +00:00
Misha Brukman
c9c721edf0 Fix spelling of `propagate'. 
llvm-svn: 4423
 2002-10-29 23:06:16 +00:00
Chris Lattner
d6e5d73aa8 Eliminate uses of MachineBasicBlock::get 
llvm-svn: 4340
 2002-10-28 18:01:21 +00:00
Chris Lattner
b8c6acfbc0 Rename MachineCodeForBasicBlock to MachineBasicBlock 
llvm-svn: 4318
 2002-10-28 01:41:47 +00:00
Chris Lattner
296c58a00c - Make sure to only keep track of mappings that the TD pass may need in the 
future.  This prevents having spurious map entries to nodes that we really
    don't care about.  This allows us to reenable the DeadNodeElim, which was
    disabled.

llvm-svn: 4260
 2002-10-22 16:01:03 +00:00
Chris Lattner
61b32b3ab0 The callee is not correct, and confuses the TD pass. Null it out. 
llvm-svn: 4259
 2002-10-22 15:58:46 +00:00
Chris Lattner
1157e5dafb Delete unused arguments to DSGraph::cloneInto method 
llvm-svn: 4253
 2002-10-21 19:50:29 +00:00
Chris Lattner
4410178282 - Add "ResolvingCaller" to the CallSite record. This keeps track of which 
function was finally able to resolve the function call.  Adding this allows
    the TD pass to actually work right!
  - Temporarily disable dead node pruning.  This will be reenabled soon.

llvm-svn: 4252
 2002-10-21 19:47:18 +00:00
Chris Lattner
7588e35aa8 Add another copy ctor form 
llvm-svn: 4251
 2002-10-21 15:32:34 +00:00
Chris Lattner
1276c50e7b As it turns out, we don't need a fully generic mapping copy ctor, we just need 
something that maps through a std::map.  Since this simplified the client and
implementation code, do so now.

llvm-svn: 4250
 2002-10-21 15:04:18 +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
9f6ddf9bdd Fix a confusing bug that caused return value and callee pointers to not 
be printed!

llvm-svn: 4248
 2002-10-21 13:47:57 +00:00
Chris Lattner
01fc78de5f Remove some unneccesary 'using' directives 
llvm-svn: 4246
 2002-10-21 13:31:48 +00:00
Chris Lattner
1953a9de17 Fix bug with prior checkin 
llvm-svn: 4242
 2002-10-21 02:18:55 +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
Chris Lattner
9d0418d007 Simplify code a bit, add comment flyer 
llvm-svn: 4238
 2002-10-20 22:11:44 +00:00
Chris Lattner
4eec37a762 Split some long lines 
llvm-svn: 4237
 2002-10-20 22:11:17 +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
Chris Lattner
ff8176c481 This function can be static 
llvm-svn: 4234
 2002-10-20 20:39:31 +00:00
Chris Lattner
cf6f36ae27 Fix previous checkin :( 
llvm-svn: 4233
 2002-10-20 20:39:17 +00:00
Chris Lattner
2f778ae5aa Avoid extra callSite copy 
llvm-svn: 4232
 2002-10-20 20:32:13 +00:00
Chris Lattner
3af7377974 Print the array flag 
llvm-svn: 4231
 2002-10-20 20:29:10 +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
bd5e932aeb Print Mod/ref info 
llvm-svn: 4224
 2002-10-17 22:13:28 +00:00
Chris Lattner
51b2abb899 Calculate mod/ref info 
llvm-svn: 4223
 2002-10-17 22:13:19 +00:00
Chris Lattner
4e44ccce8a Remove more obsolete code 
llvm-svn: 4221
 2002-10-17 20:53:12 +00:00
Chris Lattner
2ffe6a8e0b * Make the DSGraph cloner automatically merge global nodes 
* BUClosure doesn't have to worry about global nodes
 * TDClosure now works with global nodes
 * Reenable DNE on TD pass, now that globals work right

llvm-svn: 4220
 2002-10-17 20:09:52 +00:00
Chris Lattner
920190f83a Remove obsolete code 
llvm-svn: 4218
 2002-10-17 04:58:10 +00:00
Chris Lattner
90ccd73585 Enable incompleteness marking 
llvm-svn: 4217
 2002-10-17 04:57:28 +00:00
Chris Lattner
5028142e9a * First try at implementing TD pass this does not merge global nodes yet, 
among other things.
  * Significant rewrite of TD pass to avoid potentially N^2 algorithms if
    possible.  It is still not complete, but at least it's checked in now.

llvm-svn: 4215
 2002-10-17 04:26:54 +00:00
Chris Lattner
b61fe19f98 Reenable printing of TD analysis 
llvm-svn: 4214
 2002-10-17 04:24:30 +00:00
Chris Lattner
0c48561a9e * Add data structures and code to track the call sites for each function 
llvm-svn: 4213
 2002-10-17 04:24:08 +00:00
Chris Lattner
516c8391c7 Cleanup data structure graph printer, eliminate hard coded printing in 
favor of generic printer.

llvm-svn: 4209
 2002-10-17 01:02:46 +00:00
Chris Lattner
1e46327844 Make sure to print out the call nodes as well 
llvm-svn: 4203
 2002-10-16 20:16:16 +00:00
Chris Lattner
278e5a3fe6 * Print the "return" node in the graphs 
llvm-svn: 4199
 2002-10-16 02:04:36 +00:00
Chris Lattner
3702063ff3 The second element of the iterator is really an offset, not a link 
llvm-svn: 4196
 2002-10-16 01:43:11 +00:00
Chris Lattner
9ed6bfa052 Specify the graph name 
llvm-svn: 4195
 2002-10-16 01:34:28 +00:00
Chris Lattner
afeca1f7f6 - DSGraph Printing Improvements: 
* Print edge source labels again
     * Override node shape to be Mrecord again, instead of just record.

llvm-svn: 4193
 2002-10-16 01:18:27 +00:00
Chris Lattner
ee64370eb5 Halfway conversion from custom printing to GraphWriter printing 
llvm-svn: 4146
 2002-10-13 19:31:57 +00:00
Vikram S. Adve
5b3555bdd3 Use PARALLEL_DIRS. 
llvm-svn: 4114
 2002-10-11 16:08:17 +00:00
Misha Brukman
b4940744de Added capability to get execution count of a loop if it is a predictable 
number of iterations.

llvm-svn: 4113
 2002-10-11 05:34:32 +00:00
Misha Brukman
d55cfa6b94 Added helper functions in LoopInfo: isLoopExit and numBackEdges. 
llvm-svn: 4112
 2002-10-11 05:31:10 +00:00
Chris Lattner
a923b0f49f Handle post dominance correctly in the case where blocks do not have a path to 
the exit node.

llvm-svn: 4038
 2002-10-04 14:50:20 +00:00
Chris Lattner
eeecc3e1b3 Prune function nodes that are no longer referenced due to inlining 
llvm-svn: 4036
 2002-10-03 21:55:28 +00:00
Chris Lattner
8f603615d8 sgefa uses truely huge data structures nodes. Only print part of them if they 
are so big

llvm-svn: 4035
 2002-10-03 21:55:13 +00:00
Chris Lattner
31d4a68166 Handle bug exposed by power benchmark 
llvm-svn: 4033
 2002-10-03 21:06:38 +00:00
Chris Lattner
fcdb95cd42 Reimplement/port the Bottom Up Closure pass 
llvm-svn: 4031
 2002-10-03 20:38:41 +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
5f38d9c112 When printing DS nodes, print the mergemap index as well to allow easier 
debugging of merging process.

llvm-svn: 4010
 2002-10-02 05:17:55 +00:00
Chris Lattner
8c25c1a641 * Significant rework of DSNode to support arbitrary aliasing due to merging 
* Now all and any bytes of a DSNode can be merged together individually.  This
  is neccesary to support the full generality of C and support aliasing
  correctly.

llvm-svn: 4008
 2002-10-02 04:57:39 +00:00
Chris Lattner
9fc451723d Initial checkin of Steensgaards context insensitive flow insensitive 
alias analysis

llvm-svn: 3997
 2002-10-01 22:34:12 +00:00