summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure
Commit message (Collapse)AuthorAgeFilesLines
...
* Fix a bug in a previous checkin that broke 175.vprChris Lattner2004-03-041-1/+1
| | | | llvm-svn: 12128
* Add support for strto* and v*printfChris Lattner2004-03-041-0/+66
| | | | llvm-svn: 12127
* Add non-crappy support for varargsChris Lattner2004-03-041-6/+32
| | | | llvm-svn: 12126
* Implement a FIXME, improving the efficiency of DSA on povray.Chris Lattner2004-03-041-2/+16
| | | | | | | This reduces CBU time from 145s -> 122s (debug build), reduces # allocated nodes from 129420 to 116477. llvm-svn: 12125
* Speed up the cbu pass from taking somewhere near the age of the universe to ↵Chris Lattner2004-03-041-6/+28
| | | | | | about 90s on povray llvm-svn: 12123
* Fix BU datastructures with povray!Chris Lattner2004-03-041-11/+25
| | | | | | | | The problem was that we were merging a field of a node with a value that was deleted. Thanks to bugpoint for reducing povray to a nice small 3 function example. :) llvm-svn: 12116
* Minor changes, remove some debugging code that got checked in somehow.Chris Lattner2004-03-041-7/+10
| | | | | | | Make sure to scope the NodeMap passed into cloneInto so that it doesn't point to nodes that are deleted. Add some FIXME's for future performance enhancements. llvm-svn: 12115
* Only clone nodes that are needed in the caller, don't clone ALL aux calls. ↵Chris Lattner2004-03-041-20/+48
| | | | | | | | This improves povray from having ~600K nodes and 300K call nodes to 65K nodes and 25K call nodes. llvm-svn: 12109
* Fix a minor bug handling incomplete programsChris Lattner2004-03-031-1/+1
| | | | llvm-svn: 12105
* Fix a DSA bug that caused DSA to generate incredibly huge graphs and take ↵Chris Lattner2004-03-031-1/+34
| | | | | | | | | | forever to do it on povray. The problem is that we were not copying globals from callees to callers unless the existed in both graphs. We should have copied them in the case where the global pointed to a node that was copied as well. llvm-svn: 12104
* Deinline methods, add fast exitChris Lattner2004-03-031-0/+27
| | | | llvm-svn: 12102
* Fix a node mapping problem that was causing the pool allocator to locally ↵Chris Lattner2004-03-031-0/+3
| | | | | | | | allocate nodes that were globally live, thus breaking programs. llvm-svn: 12094
* FINALLY be able to get symbolic type names in the globals graph!Chris Lattner2004-03-021-1/+14
| | | | llvm-svn: 12082
* Really, only if reopenChris Lattner2004-03-021-1/+2
| | | | llvm-svn: 12080
* Correctly add an array marker on a node when appropriate!Chris Lattner2004-03-011-0/+4
| | | | llvm-svn: 12055
* Only clone global nodes between graphs if both graphs have the global.Chris Lattner2004-02-272-13/+9
| | | | llvm-svn: 11928
* ADD MORE FUNCTIONS!Chris Lattner2004-02-271-14/+20
| | | | llvm-svn: 11927
* Be a good little compiler and handle direct calls efficiently, even if thereChris Lattner2004-02-261-10/+13
| | | | | | are beastly ConstantPointerRefs in the way... llvm-svn: 11883
* Fix typoChris Lattner2004-02-261-1/+1
| | | | llvm-svn: 11864
* The node doesn't have to be _no_ node flags, it just has to be complete andChris Lattner2004-02-261-2/+3
| | | | | | not have any globals. llvm-svn: 11863
* Add _more_ functionsChris Lattner2004-02-261-3/+20
| | | | llvm-svn: 11862
* Two changes:Chris Lattner2004-02-251-1/+4
| | | | | | | | | | | | | 1. Functions do not make things incomplete, only variables 2. Constant global variables no longer need to be marked incomplete, because we are guaranteed that the initializer for the global will be in the graph we are hacking on now. This makes resolution of indirect calls happen a lot more in the bu pass, supports things like vtables and the C counterparts (giant constant arrays of function pointers), etc... Testcase here: test/Regression/Analysis/DSGraph/constant_globals.ll llvm-svn: 11852
* When building local graphs, clone the initializer for constant globals into eachChris Lattner2004-02-251-7/+21
| | | | | | local graph that uses the global. llvm-svn: 11850
* Simplify the dead node elimination stuffChris Lattner2004-02-251-10/+12
| | | | | | | | | | Make the incompleteness marker faster by looping directly over the globals instead of over the scalars to find the globals Fix a bug where we didn't mark a global incomplete if it didn't have any outgoing edges. This wouldn't break any current clients but is still wrong. llvm-svn: 11848
* Add a bunch more functionsChris Lattner2004-02-251-8/+55
| | | | llvm-svn: 11847
* Try harder to get symbol infoChris Lattner2004-02-251-0/+3
| | | | llvm-svn: 11846
* Add a bunch more functions used by perlbmkChris Lattner2004-02-251-14/+50
| | | | llvm-svn: 11824
* Add support for 'rename'Chris Lattner2004-02-241-4/+9
| | | | llvm-svn: 11813
* Add support for remove, fwrite, and freadChris Lattner2004-02-241-22/+53
| | | | | | | Also fix problem where we didn't check to see if a node pointer was null. Though fclose(null) doesn't make a lot of sense, 300.twolf does it. llvm-svn: 11810
* Use isNull instead of getNode() to test for existence of a node, this is ↵Chris Lattner2004-02-221-6/+11
| | | | | | | | | cheaper. FIX MAJOR BUG, whereby we didn't merge null edges correctly. Correcting this fixes poolallocation on 175.vpr, and possibly others. llvm-svn: 11695
* Fix an iterator invalidation problem which was causing some nodes to not beChris Lattner2004-02-211-20/+19
| | | | | | correctly merged over! llvm-svn: 11693
* Use handy methodChris Lattner2004-02-211-1/+1
| | | | llvm-svn: 11692
* Instead of cloning the globals for main into the globals graph at the end ofChris Lattner2004-02-211-17/+11
| | | | | | | | | BU propagation, clone the globals into the GG of EACH FUNCTION that finishes processing! The GlobalsGraph *must* include all globals and effects from all functions in the program. Fixing this makes pool allocation work better on 175.vpr, but it still ultimately crashes. llvm-svn: 11686
* There is no need to merge the globals graph into the function graphs at theChris Lattner2004-02-202-10/+3
| | | | | | | | end of the BU and CBU passes. The globals will be marked incomplete, so it doesn't matter if they are missing some info, and merging isn't guaranteed to bring everything in anyway! llvm-svn: 11684
* Add two missing returns, which caused us to be very pessimistic about theChris Lattner2004-02-202-2/+3
| | | | | | printf and scanf families! llvm-svn: 11683
* Add support for some string functions, the scanf family, and sprintfChris Lattner2004-02-201-4/+66
| | | | llvm-svn: 11673
* When we complete the bottom-up pass, make sure to merge the globals in ↵Chris Lattner2004-02-171-0/+17
| | | | | | | | 'main' into the globals graph. llvm-svn: 11562
* Only spit out warning for functions that take pointers, not for sin and the likeChris Lattner2004-02-161-5/+25
| | | | | | Add more special case handling for stdio functions. I feel dirty, how about you? llvm-svn: 11506
* memset and bcopy and now unified by the llvm.memset intrinsicChris Lattner2004-02-161-14/+5
| | | | llvm-svn: 11503
* No need to scan zero initializers. This should make DSA a bit faster.Chris Lattner2004-02-151-0/+2
| | | | llvm-svn: 11471
* Add support for a bunch more functionsChris Lattner2004-02-131-0/+56
| | | | llvm-svn: 11395
* Add support for fopen/fclose. Specifically with fopen, we were marking all ↵Chris Lattner2004-02-131-0/+27
| | | | | | | | | | of the operands as incomplete, though fopen is known to only read them. This just adds fclose for symmetry, though it doesn't gain anything. This makes the dsgraphs for 181.mcf much more precise. llvm-svn: 11390
* Restructure code to handle memcpy/memmoveChris Lattner2004-02-131-28/+33
| | | | llvm-svn: 11374
* Adjust to the changed StructType interface. In particular, ↵Chris Lattner2004-02-091-6/+6
| | | | | | getElementTypes() is gone. llvm-svn: 11228
* Add one that I missedChris Lattner2004-02-081-0/+1
| | | | llvm-svn: 11179
* Instead of callign removeTriviallyDeadNodes on the global graph every timeChris Lattner2004-02-084-8/+13
| | | | | | | | | removeDeadNodes is called, only call it at the end of the pass being run. This saves 1.3 seconds running DSA on 177.mesa (5.3->4.0s), which is pretty big. This is only possible because of the automatic garbage collection done on forwarding nodes. llvm-svn: 11178
* Remove another unneeded call.Chris Lattner2004-02-081-1/+0
| | | | llvm-svn: 11177
* This call is no longer needed now that merging does not produce garbageChris Lattner2004-02-081-1/+0
| | | | llvm-svn: 11176
* Substantially improve the DSA code by removing 'forwarding' nodes fromChris Lattner2004-02-081-1/+5
| | | | | | | | | 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
* Bugfix for ilist conversion. The ilist wants to make an 'end' node which hasChris Lattner2004-02-081-1/+1
| | | | | | G == 0 llvm-svn: 11174
OpenPOWER on IntegriCloud