1. af6926a Fix typo by Chris Lattner · 21 years ago
  2. abcdf80 The node doesn't have to be _no_ node flags, it just has to be complete and by Chris Lattner · 21 years ago
  3. 1fe9874 Add _more_ functions by Chris Lattner · 21 years ago
  4. cf14e71 Two changes: by Chris Lattner · 21 years ago
  5. c420ab6 When building local graphs, clone the initializer for constant globals into each by Chris Lattner · 21 years ago
  6. 51c06ab Simplify the dead node elimination stuff by Chris Lattner · 21 years ago
  7. 52fc8d7 Add a bunch more functions by Chris Lattner · 21 years ago
  8. 153f240 Try harder to get symbol info by Chris Lattner · 21 years ago
  9. adc1efe Add a bunch more functions used by perlbmk by Chris Lattner · 21 years ago
  10. 39bb2dc Add support for 'rename' by Chris Lattner · 21 years ago
  11. d561209 Add support for remove, fwrite, and fread by Chris Lattner · 21 years ago
  12. 0ad9170 Use isNull instead of getNode() to test for existence of a node, this is cheaper. by Chris Lattner · 21 years ago
  13. d85645f Fix an iterator invalidation problem which was causing some nodes to not be by Chris Lattner · 21 years ago
  14. 5171115 Use handy method by Chris Lattner · 21 years ago
  15. 3567937 Instead of cloning the globals for main into the globals graph at the end of by Chris Lattner · 21 years ago
  16. d10b5fd There is no need to merge the globals graph into the function graphs at the by Chris Lattner · 21 years ago
  17. 4e46e32 Add two missing returns, which caused us to be very pessimistic about the by Chris Lattner · 21 years ago
  18. 8ecc27e Add support for some string functions, the scanf family, and sprintf by Chris Lattner · 21 years ago
  19. 28a631d When we complete the bottom-up pass, make sure to merge the globals in 'main' into by Chris Lattner · 21 years ago
  20. 304e143 Only spit out warning for functions that take pointers, not for sin and the like by Chris Lattner · 21 years ago
  21. eee33b2 memset and bcopy and now unified by the llvm.memset intrinsic by Chris Lattner · 21 years ago
  22. 896481e No need to scan zero initializers. This should make DSA a bit faster. by Chris Lattner · 22 years ago
  23. 339d8df Add support for a bunch more functions by Chris Lattner · 22 years ago
  24. 68300db Add support for fopen/fclose. Specifically with fopen, we were marking all of the by Chris Lattner · 22 years ago
  25. a07b72f Restructure code to handle memcpy/memmove by Chris Lattner · 22 years ago
  26. d21cd80 Adjust to the changed StructType interface. In particular, getElementTypes() is gone. by Chris Lattner · 22 years ago
  27. 2dea8d6 Add one that I missed by Chris Lattner · 22 years ago
  28. c3f5f77 Instead of callign removeTriviallyDeadNodes on the global graph every time by Chris Lattner · 22 years ago
  29. cd90f21 Remove another unneeded call. by Chris Lattner · 22 years ago
  30. cadfac6 This call is no longer needed now that merging does not produce garbage by Chris Lattner · 22 years ago
  31. 4ff0b96 Substantially improve the DSA code by removing 'forwarding' nodes from by Chris Lattner · 22 years ago
  32. 9857c1a Bugfix for ilist conversion. The ilist wants to make an 'end' node which has by Chris Lattner · 22 years ago
  33. 28897e1 Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> by Chris Lattner · 22 years ago
  34. 9fd37ba Change to use node_iterators instead of direct access to Nodes by Chris Lattner · 22 years ago
  35. e92e764 getNodes() is gone, use node_begin/end instead by Chris Lattner · 22 years ago
  36. a84c681 getNodes() is gone by Chris Lattner · 22 years ago
  37. a5ca28c There is no need to clone over nodes that are going to be dead anyway by Chris Lattner · 22 years ago
  38. a67138d Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. This by Chris Lattner · 22 years ago
  39. 92e41d5 Forward method request to chained aa implementation by Chris Lattner · 22 years ago
  40. ead9eb7 Fix a bug aflicting 265.gap by Chris Lattner · 22 years ago
  41. 17a93e2 Minor bugfixes by Chris Lattner · 22 years ago
  42. 62482e5 Rename DSGraph::ScalarMapTy -> DSScalarMap by Chris Lattner · 22 years ago
  43. 28da03b Fix a bug by Chris Lattner · 22 years ago
  44. a3fd88d Eliminate the call to removeTriviallyDeadNodes from updateFromGlobals graph, by Chris Lattner · 22 years ago
  45. 6d8f3dc In the TD pass, iterate over globals directly instead of through the whole scalar by Chris Lattner · 22 years ago
  46. 34741cf In the TD pass, don't iterate over the scalar map to find the globals, iterate over by Chris Lattner · 22 years ago
  47. bdce7b7 In updateFromGlobalsGraph, instead of iterating over all of the scalars in the by Chris Lattner · 22 years ago
  48. a88a55c Minor tweaks, eliminate useless integer pruning optimziation, turn on by Chris Lattner · 22 years ago
  49. 239644d Further reduce the number of nodes cloned with getClonedNH, using merge instead. by Chris Lattner · 22 years ago
  50. 00948c0 Add a timer, fix a minor bug. by Chris Lattner · 22 years ago
  51. 64507e3 Another bugfix, disable "spurious" output. by Chris Lattner · 22 years ago
  52. 352e31f fix bug in previous checkin by Chris Lattner · 22 years ago
  53. 0b14487 * Add a new commandline argument to control the "global roots hack". Default by Chris Lattner · 22 years ago
  54. f325e39 Rewrite to use the reachability cloner interface. Also, make this much more by Chris Lattner · 22 years ago
  55. 02da032 minor cleanups by Chris Lattner · 22 years ago
  56. 825a02a Get clone flags right, so we don't build InlinedGlobals only to clear them by Chris Lattner · 22 years ago
  57. 091f776 Initial support for implementing clonePartiallyInto in terms of cloneReachableSubgraph, though this support is currently disabled. by Chris Lattner · 22 years ago
  58. 2f56138 Eliminated the CompletedNodes argument to the cloneReachable* methods. This by Chris Lattner · 22 years ago
  59. 93ddd7e Ok, I'm tired of pulling out all my timers to check stuff in, just do it. by Chris Lattner · 22 years ago
  60. 5254a8d Bug fix: X.mergeWith(Y) was not updating Y if Y was a null node handle! by Chris Lattner · 22 years ago
  61. 4c6cb7a Start implementing DSGraph::clonePartiallyInto and implement mergeInGraph by Chris Lattner · 22 years ago
  62. 4a85776 Allow disabling of ALL printing overhead when performing timings by Chris Lattner · 22 years ago
  63. fa3711a Do not depend on index type to determine whether it is a structure or sequential index by Chris Lattner · 22 years ago
  64. 1e2385b Finegrainify namespacification by Chris Lattner · 22 years ago
  65. 179bc7d Implement a small optimization to handling of GEP's that are equivalent to casts. by Chris Lattner · 22 years ago
  66. a366c98 Trying to get the dsgraph for an external function is bad for DSA's health by Chris Lattner · 22 years ago
  67. 79390d4 Implement the CompleteBU pass by Chris Lattner · 22 years ago
  68. 6acfe92 Minor code cleanup by Chris Lattner · 22 years ago
  69. a190766 Disable integer tracking by default by Chris Lattner · 22 years ago
  70. 95724a4 Add an initial version of the CompleteBUDataStructures class, which is currently by Chris Lattner · 22 years ago
  71. 9a92729 Fine-grainify namespaces for this library by Chris Lattner · 22 years ago
  72. afc1dba Add new argument to disable checking by Chris Lattner · 22 years ago
  73. d8ea8a5 Print return nodes for graphs with multiple functions in them correctly by Chris Lattner · 22 years ago
  74. 9dc4185 Don't crash if no gg by Chris Lattner · 22 years ago
  75. c5f0afa Cleanups by Chris Lattner · 22 years ago
  76. d0fde30 Put all LLVM code into the llvm namespace, as per bug 109. by Brian Gaeke · 22 years ago
  77. 413406c Compute node offsets correctly by Chris Lattner · 22 years ago
  78. 400433d Add new method for computing node mappings. This is used by the pool allocator by Chris Lattner · 22 years ago
  79. 67ce57a Add support for memmove by Chris Lattner · 22 years ago
  80. fb8c610 Handle bzero and memset in the local analysis, because we were missing the fact by Chris Lattner · 22 years ago
  81. 492dda9 This doesn't use DSCallSiteIterator by Chris Lattner · 22 years ago
  82. 0271345 Fix name collision by Chris Lattner · 22 years ago
  83. 15869aa All DSGraphs keep a reference to the targetdata they are created with. This is by Chris Lattner · 22 years ago
  84. dbfe36e Fix bug: test/Regression/Analysis/DSGraph/2003-11-02-NodeCollapsing.ll by Chris Lattner · 22 years ago
  85. 856ba76 Added LLVM copyright header. by John Criswell · 22 years ago
  86. e488e93 Added LLVM copyright notice to Makefiles. by John Criswell · 22 years ago
  87. b576c94 Added LLVM project notice to the top of every C++ source file. by John Criswell · 22 years ago
  88. cf00c4a Fix spelling. by Misha Brukman · 22 years ago
  89. b5c1af4 Use std::string::size_type for for ColonPos to stop gcc from giving a warning by Alkis Evlogimenos · 22 years ago
  90. fbc2d84 DOn't crash if program calls the null pointer by Chris Lattner · 22 years ago
  91. 11fc930 Functions reachable from the arguments of unresolvable call nodes should by Chris Lattner · 22 years ago
  92. ec157b7 The Globals graph must become complete at the end of the BU phase! by Chris Lattner · 22 years ago
  93. 3b0a9be Do not mark incoming arguments to functions complete if the function is pointed to by a global in the globals graph by Chris Lattner · 22 years ago
  94. 26c4fc3 Make sure to add global variable initializers to the Globals graph! by Chris Lattner · 22 years ago
  95. 9970bf6 Don't consider incomplete nodes to be typesafe! by Chris Lattner · 22 years ago
  96. bab8c28 Remove trivially dead nodes was not removing nodes that were dead due to forwarding! by Chris Lattner · 22 years ago
  97. 894263b Add special case handling for calloc and realloc by Chris Lattner · 22 years ago
  98. 808a7ae Switch from using CallInst's to represent call sites to using the LLVM by Chris Lattner · 22 years ago
  99. 192cd9c Make this work better for constants that aren't necessarily in ANY graph, such as null pointers by Chris Lattner · 22 years ago
  100. 7892549 Keep track of the number of typed/untyped memory accesses theyre are in the program by Chris Lattner · 22 years ago