maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
7,236 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

594 Commits

Author SHA1 Message Date
Chris Lattner d98ac881ca Fix several bugs in basic-aa 
llvm-svn: 5643
 2003-02-26 21:28:49 +00:00
Chris Lattner dca12c77df Add new -no-aa implementation 
llvm-svn: 5641
 2003-02-26 19:57:10 +00:00
Chris Lattner d6a2a99a1b Move BasicAA pass out to it's own header file 
llvm-svn: 5640
 2003-02-26 19:41:54 +00:00
Chris Lattner e79b8319a6 Adjust to implement new AA interface 
llvm-svn: 5638
 2003-02-26 19:29:36 +00:00
Chris Lattner 13082d63dd Adjust to new AA interface 
llvm-svn: 5637
 2003-02-26 19:29:16 +00:00
Chris Lattner 71b82bb494 Convert to work with new AliasAnalysis interface by conservatively assuming all pointers are arbitrarily large accesses 
llvm-svn: 5636
 2003-02-26 19:28:57 +00:00
Chris Lattner 0edc91ff2a Calculate and pass load sizes to the alias analysis infrastructure 
llvm-svn: 5635
 2003-02-26 19:27:35 +00:00
Chris Lattner d1e3208147 Adjust to new AA interface 
Add tracking for Mod/Ref info

llvm-svn: 5634
 2003-02-26 19:27:05 +00:00
Chris Lattner 3a3118394c - Checkin of the alias analysis work: 
* Takes into account the size of the memory reference to determine aliasing.
    * Expose mod/ref information in a more consistent way
    * BasicAA can now disambiguate A[i][1] and A[j][2] for conservative request
      sizes

llvm-svn: 5633
 2003-02-26 19:26:51 +00:00
Chris Lattner 7606fb65c0 This is a substantial rewrite of the AliasSetTracker class which now uses 
a union-find based algorithm, is significantly faster, and is more general.
It will also scale to handle call instructions correctly, which is a nice
added bonus.

This includes a new pass -print-alias-sets which can be used to show how
alias sets are formed for a particular analysis.

llvm-svn: 5619
 2003-02-24 20:37:56 +00:00
Chris Lattner ef6ea65807 Dramatically simplify building of natural loops and fix a bug where the BBMap 
was not correctly computed.

llvm-svn: 5606
 2003-02-22 21:33:11 +00:00
Chris Lattner 1cbe5116ff Fix the requisite bug that I introduced 
llvm-svn: 5605
 2003-02-20 00:28:00 +00:00
Chris Lattner 1dc4c29b6d Fix 80 character formatting 
llvm-svn: 5604
 2003-02-20 00:18:07 +00:00
Chris Lattner 0049419836 Fix bug: 2003-02-19-LoopInfoNestingBug.ll 
llvm-svn: 5603
 2003-02-20 00:17:17 +00:00
Chris Lattner b39d6355e1 Fix resolution of indirect function calls... whoops 
llvm-svn: 5576
 2003-02-14 23:27:18 +00:00
Chris Lattner b5cbfa0f15 Mark function edges 
llvm-svn: 5571
 2003-02-14 20:25:47 +00:00
Chris Lattner 8acdca64fd - Eliminate provably non-pointer nodes from graphs. 
This helps a lot of testcases, for example:
            New Time  New #Nodes     Old Time    Old #Nodes
254.gap:    91.1024     21605        91.1397     22657
povray31:    2.7807      8613         3.0152     10338
255.vortex:  1.2034      8153         1.2172     8822
moria:        .6756      3150          .7054     3877
300.twolf:    .1652      2010          .1851     3270

Typically, testcases which use long and ulong integers a lot get better, f.e. povray above.

llvm-svn: 5566
 2003-02-14 06:28:00 +00:00
Chris Lattner ddd3b7fa54 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 3699ef409c Hax0r around a deficiency in the Pass infrastructure 
llvm-svn: 5555
 2003-02-13 21:44:18 +00:00
Chris Lattner 60ede774af Use the new tailclip property new added to graphviz CVS to make call nodes 
actually intelligable

llvm-svn: 5554
 2003-02-13 20:14:40 +00:00
Chris Lattner a17866894a Move node forwarding code from being inlined to being out-of-line. 
This brings a 11.6% speedup to steens, and a 3.6 overall speedup to ds-aa

llvm-svn: 5552
 2003-02-13 19:09:00 +00:00
Chris Lattner 3595c3387a Rename options 
llvm-svn: 5537
 2003-02-11 23:12:09 +00:00
Chris Lattner 7127d7db7a 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 763502671d Minor tweaks to printing. Close the file before viewing it in viewGraph 
llvm-svn: 5535
 2003-02-11 19:27:27 +00:00
Chris Lattner e715357909 Modest speedup which seems to help steens quite a bit on large graphs 
llvm-svn: 5532
 2003-02-10 18:47:23 +00:00
Chris Lattner f8292feb04 Fix problem breaking GAP, use hasNoReferrers more 
llvm-svn: 5530
 2003-02-10 18:18:18 +00:00
Chris Lattner 75007f16de Implement a new "viewGraph" method which can be used to instantly view a graph from gdb 
llvm-svn: 5528
 2003-02-10 18:17:07 +00:00
Chris Lattner b96f2123ab Rearrange code 
llvm-svn: 5527
 2003-02-10 18:16:36 +00:00
Chris Lattner 5153d44a91 Fix problem breaking Fhourstones 
llvm-svn: 5526
 2003-02-10 18:16:19 +00:00
Chris Lattner df2a78e833 Make steensgaards performance not shameful 
llvm-svn: 5524
 2003-02-10 00:14:57 +00:00
Chris Lattner 43df2886c5 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 b0208e1ae3 Allow printing of various types of alias analysis results 
llvm-svn: 5520
 2003-02-09 20:40:13 +00:00
Chris Lattner 2393160bde Implement knowledge in BasicAA that &A->field != &A and (P+1) != P 
llvm-svn: 5519
 2003-02-09 19:38:11 +00:00
Chris Lattner 1fbac976b9 - Fix BasicAA to correctly detect the non-aliasness of A[1] & A[2] 
llvm-svn: 5518
 2003-02-09 19:27:21 +00:00
Chris Lattner 4e0457a027 Switch to using the right call vector 
llvm-svn: 5517
 2003-02-09 19:26:47 +00:00
Chris Lattner 93fdaf9cb9 Fix major bugs in incompleteness marking that were pessimizing results 
llvm-svn: 5515
 2003-02-09 18:42:43 +00:00
Chris Lattner e4059b4ed6 Print out the steens graph if -debug is specified 
llvm-svn: 5514
 2003-02-09 18:42:16 +00:00
Chris Lattner 0eee7eb390 * Fix a bug where global incompleteness marking would not mark the global 
itself incomplete!
* Allow incompleteness callers to specify they don't want globals to be
  considered sources of incompleteness.

llvm-svn: 5513
 2003-02-09 18:41:49 +00:00
Chris Lattner 26bd24cd81 Add a special case for main because we know it's incoming arguments don't alias 
llvm-svn: 5511
 2003-02-08 23:08:02 +00:00
Chris Lattner d73f9f55f2 Fix a bug where we would mark the callees arguments incomplete if the caller was external. 
llvm-svn: 5510
 2003-02-08 23:07:39 +00:00
Chris Lattner eadcadc54b Fix division by zero problem 
llvm-svn: 5509
 2003-02-08 23:04:50 +00:00
Chris Lattner 63ea85f089 Remove explicit result counters 
llvm-svn: 5508
 2003-02-08 23:03:17 +00:00
Chris Lattner cb7d6429fc Add a flag which effectively disables field sensitivity 
llvm-svn: 5506
 2003-02-08 20:18:39 +00:00
Chris Lattner fdc902e6f2 Don't bother counting alias results, allow the AliasAnalysisCounter to do that. 
llvm-svn: 5505
 2003-02-07 20:39:48 +00:00
Chris Lattner 9a734b6c24 Allow counting multiple passes, and print the pass name counted 
llvm-svn: 5504
 2003-02-07 20:39:17 +00:00
Chris Lattner e996681c1c New general purpose alias analysis result auditor 
llvm-svn: 5503
 2003-02-07 19:46:03 +00:00
Chris Lattner 371fd2c59b Add a summary 
llvm-svn: 5500
 2003-02-06 22:06:08 +00:00
Chris Lattner 4fdb75f223 Simple N^2 alias anlysis accuracy checker 
llvm-svn: 5498
 2003-02-06 21:29:49 +00:00
Chris Lattner f7979c2f2b Fix an assertion failure 
llvm-svn: 5496
 2003-02-06 00:15:08 +00:00
Chris Lattner 80614ee5ef 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 d7357ab5d1 Remove bogus assertion 
llvm-svn: 5492
 2003-02-04 16:33:23 +00:00
Chris Lattner 04fb4b5808 Fix a huge bug with handling non-pointer instructions 
llvm-svn: 5491
 2003-02-04 00:59:50 +00:00
Chris Lattner 36fd3eccbd Make the TD pass not include all of the call nodes from the local pass, 
eliminating incomplete markers from them

llvm-svn: 5490
 2003-02-04 00:59:32 +00:00
Chris Lattner a0e9e6ec8c Add sanity check 
llvm-svn: 5489
 2003-02-04 00:03:57 +00:00
Chris Lattner 7e41fedd3a Fix steensgaard to work on a lot more cases... 
llvm-svn: 5488
 2003-02-04 00:03:37 +00:00
Chris Lattner 4113571cd1 Fix printing of nonfunction graphs 
llvm-svn: 5487
 2003-02-04 00:03:18 +00:00
Chris Lattner eededa396e Rename variable 
llvm-svn: 5486
 2003-02-03 22:51:53 +00:00
Chris Lattner 390cec0c77 Hack to work around deficiency in pass infrastructure 
llvm-svn: 5485
 2003-02-03 22:51:28 +00:00
Chris Lattner 8fd2b77547 Initial implementation of ds-aa 
llvm-svn: 5484
 2003-02-03 22:50:46 +00:00
Chris Lattner 4b9eb3d2a1 Add statistics to basicAA pass 
llvm-svn: 5480
 2003-02-03 21:16:17 +00:00
Chris Lattner 1d3922ac0b * Fix a bug introduced in the last checkin wrt Stack markers 
* Make cloning more efficient in the process...

llvm-svn: 5479
 2003-02-03 20:08:51 +00:00
Chris Lattner 8bb9513bd8 Implement the globals graph! 
llvm-svn: 5477
 2003-02-03 19:12:15 +00:00
Chris Lattner e396e9bbae Add better debug output 
llvm-svn: 5476
 2003-02-03 19:11:38 +00:00
Chris Lattner 07ba9d9010 Be a bit more specific in caption 
llvm-svn: 5469
 2003-02-02 16:42:01 +00:00
Chris Lattner 9e75f38bb9 Fix a bug where we would delete neccesary calls in bu pass 
llvm-svn: 5465
 2003-02-01 06:54:31 +00:00
Chris Lattner 5965bbb02f Fix a bug where we would incorrectly delete globals which had edges to alive nodes in 
a graph in the t-d pass.  This slows down the TD pass by quite a bit (1/3), but is
needed for correctness.

llvm-svn: 5464
 2003-02-01 06:51:17 +00:00
Chris Lattner c154bdcd4c Delete nodes more efficiently 
llvm-svn: 5463
 2003-02-01 06:41:15 +00:00
Chris Lattner 71449ba556 Remove dead nodes more efficiently 
llvm-svn: 5462
 2003-02-01 06:23:33 +00:00
Chris Lattner 4f276cc4dd Improve efficiency of aliveness traversal code 
llvm-svn: 5461
 2003-02-01 06:17:02 +00:00
Chris Lattner c44c04af44 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 ee97c8b08a Remove using declarations 
llvm-svn: 5456
 2003-02-01 04:01:21 +00:00
Chris Lattner 87d76c7f01 Remove globals on the bottom up pass which do not contain any information 
llvm-svn: 5451
 2003-01-31 23:57:36 +00:00
Chris Lattner 0cd81260e6 Add functions to the ban list 
llvm-svn: 5450
 2003-01-31 23:57:10 +00:00
Chris Lattner c5497c816f Use and implement API for graph traversals 
llvm-svn: 5431
 2003-01-29 21:10:20 +00:00
Chris Lattner 362dab3705 free instructions mark their operands as being heap nodes. 
llvm-svn: 5425
 2003-01-28 20:59:57 +00:00
Chris Lattner 38c5e417a7 * Eliminate boolean arguments in favor of using enums 
llvm-svn: 5420
 2003-01-23 22:06:33 +00:00
Chris Lattner a1d9011d6e * 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 98034fa407 Slight efficiency improvement 
llvm-svn: 5418
 2003-01-23 21:31:16 +00:00
Chris Lattner 2d4945580f Fix analysis of the Burg program 
llvm-svn: 5401
 2003-01-22 22:00:24 +00:00
Chris Lattner 24c1d5e551 Rename llvm/Analysis/LiveVar/FunctionLiveVarInfo.h -> llvm/CodeGen/FunctionLiveVarInfo.h 
llvm-svn: 5284
 2003-01-14 23:05:08 +00:00
Chris Lattner de1d729747 Move llvm/Analysis/LiveVar/ValueSet.h to CodeGen/ValueSet.h 
llvm-svn: 5282
 2003-01-14 22:56:37 +00:00
Chris Lattner 0b2f0ed730 Move annotations to support library 
llvm-svn: 5270
 2003-01-14 21:31:39 +00:00
Misha Brukman 1028ac46d6 'graph' is spelled without a 'c'. 
Also added Statistic counters for NoAlias and MayAlias.

llvm-svn: 4972
 2002-12-12 05:34:10 +00:00
Chris Lattner c42ada2e5e Remove #includes 
llvm-svn: 4968
 2002-12-12 03:47:27 +00:00
Vikram S. Adve 775e51d87a Iterator that enumerates the ProgramDependenceGraph (PDG) for a function, 
i.e., enumerates all data and control dependences for the function.

llvm-svn: 4958
 2002-12-08 14:13:19 +00:00
Vikram S. Adve 8975afdfc4 An explicit representation of dependence graphs, and a pass that 
computes a dependence graph for data dependences on memory locations
using interprocedural Mod/Ref information.

llvm-svn: 4957
 2002-12-08 13:26:29 +00:00
Chris Lattner 3935d2b1ec Add total instruction, bb, & function counts 
llvm-svn: 4954
 2002-12-07 23:24:24 +00:00
Vikram S. Adve 04aee9478c 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
Vikram S. Adve 0d5559fdfb Fix several related bugs in DSNode::mergeWith() caused by the 
fact that the incoming nodes may be merged away at intermediate
steps.  Use an extra level of indirection via DSNodeHandles
to track the nodes being merged.  All this now happens in a
static helper function MergeNodes().

llvm-svn: 4947
 2002-12-06 21:15:21 +00:00
Vikram S. Adve bfff743897 Cute bug fix: when moving links from N to this, some links could have 
been missed if node *this got merged away due to recursive merging!
Also, links were not moved correctly if a node is collapsed.

llvm-svn: 4933
 2002-12-05 17:17:26 +00:00
Chris Lattner 5e05817565 Simplify code 
llvm-svn: 4886
 2002-12-03 19:40:16 +00:00
Vikram S. Adve 2d2303db22 Fix logical error in TD pass: we should clear Mod/Ref bits of each caller 
before inlining their graphs into a function.  To support this,
added flags to CloneFlags to strip/keep Mod/Ref bits.

llvm-svn: 4836
 2002-11-27 17:41:13 +00:00
Vikram S. Adve 19b3303f3d (1) Bug fix that was causing nodes with dangling references to be freed. 
We run removeDeadNodes() on the TD graph up front before using it.
(2) Major enhancement to printing of results: now we list the actual objects
    that are mod/ref instead of just printing the bit vectors.
Also an important bug fix in TDDataStructures pass (no change here):
clear Mod/Ref bits of callers before inlining into a function.

llvm-svn: 4833
 2002-11-27 17:37:46 +00:00
Vikram S. Adve 68690673ad Keep global nodes in each DS Graph (by forcing them to be marked live). 
llvm-svn: 4831
 2002-11-25 18:21:25 +00:00
Chris Lattner 79d943eb67 Add peak memory usage measurement stuff 
Add structure padding optimizations

llvm-svn: 4749
 2002-11-18 21:44:46 +00:00
Chris Lattner 63a9e5c068 Add peak memory usage support 
llvm-svn: 4748
 2002-11-18 21:44:19 +00:00
Chris Lattner 77b80616b0 Add stats 
llvm-svn: 4747
 2002-11-18 21:42:45 +00:00
Chris Lattner 29a320bfcf Add hack to only consider indirect calls indirect if they do more than cast 
their source function

llvm-svn: 4723
 2002-11-17 22:17:12 +00:00
Chris Lattner 1e3652955b Add MaxSCC statistics 
llvm-svn: 4722
 2002-11-17 22:16:28 +00:00
Chris Lattner 342f68151e Count CallInsts correctly, remove unneccesary initializers 
S: ----------------------------------------------------------------------

llvm-svn: 4721
 2002-11-17 22:15:40 +00:00
Dinakar Dhurjati a7be9a7db7 Gives the count for various instructions. 
llvm-svn: 4706
 2002-11-13 18:22:13 +00:00
Vikram S. Adve 16eac628f4 Pass to compute various statisics related to DSGraphs. 
For now, this just computes the #indirect call sites and
the avg. #callees per indirect call site (actually it prints
both totals and the average is their ratio).

llvm-svn: 4705
 2002-11-13 15:41:00 +00:00
Chris Lattner ccc27ecd35 Inline graphs from outside the SCC into the SCC before SCC resolution starts 
llvm-svn: 4701
 2002-11-12 15:58:08 +00:00
Chris Lattner dcb4ac9594 Fix two bugs: 
* The globals vector was getting broken and unsorted, this caused vortex
   to get badly pessimized
 * Node offset handling was being handled really poorly, and in particular
   we were not merging types with offsets right.  This causes several graphs
   to be non-merged.

llvm-svn: 4699
 2002-11-12 07:20:45 +00:00
Chris Lattner 1aeca4d0e6 Fix bug 
llvm-svn: 4697
 2002-11-11 22:23:56 +00:00
Chris Lattner eb10d4cbce Handle a mismatch between # function args and call site args 
llvm-svn: 4696
 2002-11-11 21:36:05 +00:00
Chris Lattner 8aed9820e2 Elimiante calls to a node with nothing in it. 
llvm-svn: 4695
 2002-11-11 21:35:38 +00:00
Chris Lattner 59821c5ce6 Complete rewrite of BU code to use Tarjan's SCC finding algorithm to drive 
the algorithm instead of hand coded depth first iteration

llvm-svn: 4694
 2002-11-11 21:35:13 +00:00
Chris Lattner dd3dd4abeb Mark stuff reachable by _AUX_ calls as incomplete in the BU graph 
llvm-svn: 4690
 2002-11-11 03:36:55 +00:00
Chris Lattner cca3599c0b Fix infinite loop in the BU algorithm. Unfortunately this dies a serious 
death when handling moderately sized SCC's, but what can you do

llvm-svn: 4689
 2002-11-11 00:01:34 +00:00
Chris Lattner 773da868a0 Print the right call set size 
llvm-svn: 4688
 2002-11-11 00:01:02 +00:00
Chris Lattner 6fa9a7f7f4 Use call site mergeWith method to simplify code 
llvm-svn: 4687
 2002-11-11 00:00:46 +00:00
Chris Lattner d7f9f635ec Fix a bug that could trigger when varargs call sites had non-matching number of arguments 
llvm-svn: 4683
 2002-11-10 07:46:08 +00:00
Chris Lattner 7b61563d99 * Dramatically rework liveness evaluation. 
* Implement the first step of the Globals graph: Deleting nodes from function
  graphs.  In practice, these nodes need to be moved to the globals graph, but
  this will be taken care of later.  Note that the graphs computed right now are
  not strictly correct!

llvm-svn: 4681
 2002-11-10 06:59:55 +00:00
Chris Lattner e79ce7d359 Honor the shouldPrintAuxCalls flag 
llvm-svn: 4678
 2002-11-10 06:53:59 +00:00
Chris Lattner 17da287408 Initialize PrintAuxCalls member 
llvm-svn: 4677
 2002-11-10 06:53:38 +00:00
Chris Lattner 3b83d797d6 * Bottom-Up graphs print the Aux call vector 
* Significantly improve DEBUG output
* Aggressively fold calls together if we inlined a graph that provides
  call nodes.
* Add a bailout if the current graph has over 200 call nodes in it, this is
  a really whacky case that should never happen.

llvm-svn: 4675
 2002-11-10 06:52:47 +00:00
Chris Lattner 715a3a3b5c 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 3e32cd8e8b Remove obsolete code 
llvm-svn: 4665
 2002-11-09 21:41:44 +00:00
Chris Lattner d185d2ce9d Fix logic 
llvm-svn: 4664
 2002-11-09 21:40:58 +00:00
Chris Lattner 4b1be35569 Add globals graphs to all three passes 
llvm-svn: 4663
 2002-11-09 21:12:07 +00:00
Chris Lattner 0de21ea32d Move maskNodeTypes to header file 
llvm-svn: 4661
 2002-11-09 21:02:26 +00:00
Chris Lattner 380d1ad4ab Clean up DSGraph::removeDeadNodes interface 
llvm-svn: 4660
 2002-11-09 21:00:49 +00:00
Chris Lattner e703c52b20 Make removeTriviallyDeadNodes a private interface of DSGraph 
llvm-svn: 4659
 2002-11-09 20:55:24 +00:00
Chris Lattner 2dd1adafa6 Don't put constants into the scalar map! 
llvm-svn: 4657
 2002-11-09 20:14:03 +00:00
Chris Lattner e742f31e0c Add initial support for a globals graph 
llvm-svn: 4656
 2002-11-09 20:01:01 +00:00
Chris Lattner 5737a600d7 Tighten up array handling 
llvm-svn: 4655
 2002-11-09 19:25:27 +00:00
Chris Lattner bcc12023ce #include Datastructure.h first 
llvm-svn: 4654
 2002-11-09 19:25:10 +00:00
Chris Lattner a2620ac156 Fix warning 
llvm-svn: 4649
 2002-11-09 00:49:43 +00:00
Chris Lattner 63aeefeafb Fix warning & release build 
llvm-svn: 4648
 2002-11-09 00:49:05 +00:00
Chris Lattner be46569ba1 Fold arrays down to a single element. This causes huge wins on some benchmarks 
for example: 197.parser (64M->14M), 164.gzip (14M->2.7M).  The actual graphs
represented should not change at all.

llvm-svn: 4643
 2002-11-08 22:49:57 +00:00
Chris Lattner 09a21dc2f5 ONLY merge in the aux call sites, this causes a HUGE speedup 
llvm-svn: 4640
 2002-11-08 22:27:25 +00:00
Chris Lattner 56363a05e6 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 ef305cec98 Reenable 'quick exit' case 
llvm-svn: 4638
 2002-11-08 22:26:43 +00:00
Chris Lattner 2ea00e994e Reduce amount of work needed to compute ip/modref 
llvm-svn: 4637
 2002-11-08 22:17:01 +00:00
Chris Lattner 0c2f4bab3a Reimplement TD pass completely it now works 
llvm-svn: 4635
 2002-11-08 21:28:37 +00:00
Chris Lattner a06ac62a5e Cannot modify original call sites vector 
llvm-svn: 4634
 2002-11-08 21:27:37 +00:00
Chris Lattner c20122732e - 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 639898c9bb Remove gunk used by broken TD pass 
llvm-svn: 4632
 2002-11-08 21:25:24 +00:00
Chris Lattner 465668552a Fix IPModRef to use new DS interface 
llvm-svn: 4628
 2002-11-08 19:13:14 +00:00
Chris Lattner a075a5801b Use DSNodeHandleMap instead to be safe 
llvm-svn: 4622
 2002-11-08 05:01:14 +00:00
Chris Lattner 5e730ed972 * 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 b0c9b37048 Add flush 
llvm-svn: 4619
 2002-11-08 01:21:07 +00:00
Chris Lattner 5904e63465 Implement ResolveCallSiteModRefInfo for IPModRef. computeModRef is not yet done though! 
llvm-svn: 4602
 2002-11-07 07:12:23 +00:00
Chris Lattner 5e865cdbe2 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 df307e6fd0 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 ca03c3b516 Rename DataStructureAnalysis namespace to DS 
llvm-svn: 4596
 2002-11-07 05:20:53 +00:00
Chris Lattner 28c34bd8eb Fix problem with dangling referrers 
llvm-svn: 4595
 2002-11-07 05:00:35 +00:00
Chris Lattner f9d29b3299 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 c03a377f6a Compute total number of nodes and # call nodes 
llvm-svn: 4592
 2002-11-07 02:18:46 +00:00