| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Add a bunch more functions used by perlbmk | Chris Lattner | 2004-02-25 | 1 | -14/+50 |
| * | Add support for 'rename' | Chris Lattner | 2004-02-24 | 1 | -4/+9 |
| * | Add support for remove, fwrite, and fread | Chris Lattner | 2004-02-24 | 1 | -22/+53 |
| * | Fix a soon-to-be-missing #include | Chris Lattner | 2004-02-22 | 1 | -0/+1 |
| * | Use isNull instead of getNode() to test for existence of a node, this is chea... | Chris Lattner | 2004-02-22 | 1 | -6/+11 |
| * | Fix an iterator invalidation problem which was causing some nodes to not be | Chris Lattner | 2004-02-21 | 1 | -20/+19 |
| * | Use handy method | Chris Lattner | 2004-02-21 | 1 | -1/+1 |
| * | Instead of cloning the globals for main into the globals graph at the end of | Chris Lattner | 2004-02-21 | 1 | -17/+11 |
| * | There is no need to merge the globals graph into the function graphs at the | Chris Lattner | 2004-02-20 | 2 | -10/+3 |
| * | Add two missing returns, which caused us to be very pessimistic about the | Chris Lattner | 2004-02-20 | 2 | -2/+3 |
| * | Add support for some string functions, the scanf family, and sprintf | Chris Lattner | 2004-02-20 | 1 | -4/+66 |
| * | When we complete the bottom-up pass, make sure to merge the globals in 'main'... | Chris Lattner | 2004-02-17 | 1 | -0/+17 |
| * | Only spit out warning for functions that take pointers, not for sin and the like | Chris Lattner | 2004-02-16 | 1 | -5/+25 |
| * | memset and bcopy and now unified by the llvm.memset intrinsic | Chris Lattner | 2004-02-16 | 1 | -14/+5 |
| * | No need to scan zero initializers. This should make DSA a bit faster. | Chris Lattner | 2004-02-15 | 1 | -0/+2 |
| * | Add support for a bunch more functions | Chris Lattner | 2004-02-13 | 1 | -0/+56 |
| * | Add support for fopen/fclose. Specifically with fopen, we were marking all o... | Chris Lattner | 2004-02-13 | 1 | -0/+27 |
| * | Restructure code to handle memcpy/memmove | Chris Lattner | 2004-02-13 | 1 | -28/+33 |
| * | Cosmetic improvements to this option. | Chris Lattner | 2004-02-11 | 1 | -1/+2 |
| * | Actually load profiling information now! Block layout can use real, live, | Chris Lattner | 2004-02-11 | 1 | -4/+20 |
| * | Fix a typeo | Chris Lattner | 2004-02-11 | 1 | -1/+1 |
| * | Fix copy-and-pastos | Chris Lattner | 2004-02-11 | 1 | -2/+2 |
| * | Add skeleton profileinfoloader pass. This will be enhanced to actually LOAD | Chris Lattner | 2004-02-11 | 1 | -0/+58 |
| * | Factor this code out of llvm-prof | Chris Lattner | 2004-02-11 | 1 | -0/+180 |
| * | Make sure to register the 'no profile' implementation as the default for Prof... | Chris Lattner | 2004-02-11 | 1 | -1/+1 |
| * | Simplify implementation, and probably speed things up too. | Chris Lattner | 2004-02-11 | 1 | -9/+6 |
| * | An initial implementation of an LLVM ProfileInfo class which is designed to | Chris Lattner | 2004-02-10 | 1 | -0/+42 |
| * | Adjust to the changed StructType interface. In particular, getElementTypes()... | Chris Lattner | 2004-02-09 | 1 | -6/+6 |
| * | Add one that I missed | Chris Lattner | 2004-02-08 | 1 | -0/+1 |
| * | Instead of callign removeTriviallyDeadNodes on the global graph every time | Chris Lattner | 2004-02-08 | 4 | -8/+13 |
| * | Remove another unneeded call. | Chris Lattner | 2004-02-08 | 1 | -1/+0 |
| * | This call is no longer needed now that merging does not produce garbage | Chris Lattner | 2004-02-08 | 1 | -1/+0 |
| * | Substantially improve the DSA code by removing 'forwarding' nodes from | Chris Lattner | 2004-02-08 | 1 | -1/+5 |
| * | Bugfix for ilist conversion. The ilist wants to make an 'end' node which has | Chris Lattner | 2004-02-08 | 1 | -1/+1 |
| * | Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> | Chris Lattner | 2004-02-08 | 1 | -19/+17 |
| * | Change to use node_iterators instead of direct access to Nodes | Chris Lattner | 2004-02-08 | 1 | -34/+43 |
| * | getNodes() is gone, use node_begin/end instead | Chris Lattner | 2004-02-07 | 3 | -15/+18 |
| * | getNodes() is gone | Chris Lattner | 2004-02-07 | 2 | -42/+42 |
| * | There is no need to clone over nodes that are going to be dead anyway | Chris Lattner | 2004-02-07 | 1 | -3/+5 |
| * | In a "seeing the forest through the trees" kinda situation, I realized that a | Chris Lattner | 2004-02-05 | 1 | -227/+230 |
| * | This is a big diff with no functionality change. We just reorder some code, | Chris Lattner | 2004-02-05 | 1 | -73/+60 |
| * | finegrainify namespacification | Chris Lattner | 2004-02-05 | 1 | -5/+2 |
| * | Fixed Chris' typo. | Tanya Lattner | 2004-02-05 | 1 | -1/+1 |
| * | Implement optimizations for handling large basic blocks. | Chris Lattner | 2004-02-05 | 1 | -29/+77 |
| * | Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. This | Chris Lattner | 2004-01-31 | 1 | -9/+11 |
| * | Fix thinko | Chris Lattner | 2004-01-30 | 1 | -3/+3 |
| * | Forward method request to chained aa implementation | Chris Lattner | 2004-01-30 | 2 | -0/+8 |
| * | Implement the pointsToConstantMemory() method. | Chris Lattner | 2004-01-30 | 1 | -3/+14 |
| * | Improve mod/ref information based on the pointsToConstantMemory method. | Chris Lattner | 2004-01-30 | 1 | -2/+9 |
| * | Order #includes alphabetically, per style guide. | Misha Brukman | 2004-01-30 | 1 | -2/+2 |
