1. 3770500 Fix a bug, don't drop indirect call sites, especially if there is nothing known about them yet, and restore a simple version of a removed function by Andrew Lenharth · 19 years ago
  2. d74ea2b Patches to make the LLVM sources more -pedantic clean. Patch provided by Chris Lattner · 19 years ago
  3. 9df47b5 Another simple case type merge case to try by Andrew Lenharth · 19 years ago
  4. 79acb69 If adding a link to a collapsed, node, ignore offset. by Andrew Lenharth · 19 years ago
  5. 0c3a0b6 allow field sensitivity to be a tunable parameter by Andrew Lenharth · 19 years ago
  6. 4bebcdb Handle one offset with growth case seen in povray. Namely, if we have an offset, by Andrew Lenharth · 19 years ago
  7. 7238210 Add explicit iostream #includes by Chris Lattner · 19 years ago
  8. 63320cc Don't mess up SCC traversal when a node has null edges out of it. by Chris Lattner · 20 years ago
  9. 2b37d7c Remove trailing whitespace by Misha Brukman · 20 years ago
  10. af2e3e0 Fix a crash analyzing MultiSource/Benchmarks/MallocBench/gs by Chris Lattner · 20 years ago
  11. 021decc Change the ActualCallees callgraph from hash_multimap<Instruction,Function> by Chris Lattner · 20 years ago
  12. 9342a93 Fix a problem where we not marking incoming arguments to functions with by Chris Lattner · 20 years ago
  13. ce7068d Make the spliceFrom case where one graph is completely empty be constant time. by Chris Lattner · 20 years ago
  14. 5734e43 add a new DSGraph::spliceFrom method, which violently takes the content of by Chris Lattner · 20 years ago
  15. 4da120e This replaces the correct but slow code with a more aggressive scc-finder by Chris Lattner · 20 years ago
  16. 09adbbc9 only look at successors of globals. This gets us down to "only" 22s in the by Chris Lattner · 20 years ago
  17. d864212 Unfortunately, a previous patch was not safe. Revert it, reimplement by Chris Lattner · 20 years ago
  18. c14f59c turn a dead conditional into an assert. by Chris Lattner · 20 years ago
  19. e3f1d8a Totally gut mergeInGraph. There is absolutely no reason to be merging by Chris Lattner · 20 years ago
  20. eb39492 wrap a long line by Chris Lattner · 20 years ago
  21. 1e9d147 Several changes here: by Chris Lattner · 20 years ago
  22. 3bc703b Don't use operator[], use the new method instead, which is faster. This speeds by Chris Lattner · 20 years ago
  23. a219713 Now that the dead ctor is gone, nothing uses the old node mapping exported by by Chris Lattner · 20 years ago
  24. 5805c42 remove a dead ctor by Chris Lattner · 20 years ago
  25. d65145b now that the second argument is always this->ReturnNodes, don't bother passing it. by Chris Lattner · 20 years ago
  26. 271d688 now that the valuemapping is always the local scalar map, we can eliminate by Chris Lattner · 20 years ago
  27. 3c920fa remove the second argument to cloneInto by Chris Lattner · 20 years ago
  28. 612f0b7 move this out of line by Chris Lattner · 20 years ago
  29. f09ecff allow passing clone flags down to cloneInto by Chris Lattner · 20 years ago
  30. b343937 make this const correct by Chris Lattner · 20 years ago
  31. c26f6d3 Ugh, for some reason, I can't call this unless the reference is const!?!?!? by Chris Lattner · 20 years ago
  32. 3f90a94 The reachability cloner should add arguments to merged calls when the RHS of by Chris Lattner · 20 years ago
  33. cc9bda6 Remove the ability to keep track of inlined globals, which is always dead. by Chris Lattner · 20 years ago
  34. 7cdf321 Add a new DSNode::removeGlobal method. by Chris Lattner · 20 years ago
  35. 82c6c72 Implement new methods for dealing with DSNode global lists, rename uses of by Chris Lattner · 20 years ago
  36. f4f6227 Create an equivalence class of global variables that DSA will never be able by Chris Lattner · 20 years ago
  37. 4707b89 remove a bogus optimization. This only works if there are no globals in the by Chris Lattner · 20 years ago
  38. 4ffe5d8 implement a new method. by Chris Lattner · 20 years ago
  39. 94f8470 Clean up some code, handle null pointer specially to avoid an assertion by Chris Lattner · 20 years ago
  40. ec3f5c4 Do not create ridiculously huge DSNodes, as described in the comments. by Chris Lattner · 20 years ago
  41. 84b80a2 remove use of compat_iterator. by Chris Lattner · 20 years ago
  42. 4d5af8e Fix a crash that happens when mapping something like this: by Chris Lattner · 20 years ago
  43. 36a13cd Make computeGGToGMapping compute an invnodemap by Chris Lattner · 20 years ago
  44. a5f47ea Start using retnodes_* for iteration. by Chris Lattner · 20 years ago
  45. e4d5c44 This mega patch converts us from using Function::a{iterator|begin|end} to by Chris Lattner · 20 years ago
  46. 841957e Don't crash if computing a mapping to a node with zero size by Chris Lattner · 20 years ago
  47. b0f92e3 rename method, add counterpart by Chris Lattner · 20 years ago
  48. b2b17bb add a method to compute a commonly used mapping. by Chris Lattner · 20 years ago
  49. e2bc7b2 regardless of whether or not the client things we should mark globals incomplete, by Chris Lattner · 20 years ago
  50. b5ecd2e The incoming arguments to main (the argv list) are not complete! by Chris Lattner · 20 years ago
  51. 2787e03 Replace linear search with logrithmic one. by Chris Lattner · 20 years ago
  52. a4319e5 make sure to mark nodes returned from functions as incomplete by Chris Lattner · 20 years ago
  53. f8db8a0 Fix spelling, patch contributed by Gabor Greif by Chris Lattner · 20 years ago
  54. d7642c4 Fix a bug introduced by revision 1.187 of this file. by Chris Lattner · 20 years ago
  55. 7a0c775 Add a sanity check. by Chris Lattner · 20 years ago
  56. d672ab9 Add a new method to make it easy to update graphs. by Chris Lattner · 20 years ago
  57. 6be0794 Use new edge iterators to simplify some code. by Chris Lattner · 20 years ago
  58. e859444 Split mergeInGraph into two methods. by Chris Lattner · 20 years ago
  59. bb753c4 Refactor getFunctionArgumentsForCall out of mergeInGraph. by Chris Lattner · 20 years ago
  60. f9aace2 Rename variables to work with VC++'s hokey scoping rules. by Chris Lattner · 20 years ago
  61. a9548d9 * Make some methods more const correct. by Chris Lattner · 20 years ago
  62. 507bdf9 Silence VC++ warnings. by Chris Lattner · 20 years ago
  63. b29dd0f Move method out of line for better ICC support by Chris Lattner · 21 years ago
  64. e84c23e Improve comment by Chris Lattner · 21 years ago
  65. 7d8d471 Add more paranoid assertions :) by Chris Lattner · 21 years ago
  66. 857eb06 Fix three bugs: by Chris Lattner · 21 years ago
  67. 6f96774 * Add a method by Chris Lattner · 21 years ago
  68. 551ccae Changes For Bug 352 by Reid Spencer · 21 years ago
  69. 47b14a4 Fix #includes of i*.h => Instructions.h as per PR403. by Misha Brukman · 21 years ago
  70. 5ace1e4 Disable some code that isn't helping matters by Chris Lattner · 21 years ago
  71. 4dabb2c Move all of the DSA headers into the Analysis/DataStructure subdir. by Chris Lattner · 21 years ago
  72. efffdc9 As much as I hate to say it, the whole setNode interface for DSNodeHandles by Chris Lattner · 21 years ago
  73. 37ec591 Fix merging of nodes whose incoming offset is not zero. This unbreaks DSA on by Chris Lattner · 21 years ago
  74. f70c22b Rename Type::PrimitiveID to TypeId and ::getPrimitiveID() to ::getTypeID() by Chris Lattner · 21 years ago
  75. 96a8bd7 Wrapped code and comments at 80 cols; doxygenified some comments. by Misha Brukman · 21 years ago
  76. cc7c4ac Fix a tiny bug that caused an incorrect assertion failure poolallocating by Chris Lattner · 21 years ago
  77. 85fb1be implement new method by Chris Lattner · 21 years ago
  78. d84d350 Fix a bug handling globals that are constants, but are still external by Chris Lattner · 21 years ago
  79. e6e93cc Implement a FIXME, improving the efficiency of DSA on povray. by Chris Lattner · 21 years ago
  80. f590ced Fix BU datastructures with povray! by Chris Lattner · 21 years ago
  81. 2f34690 Only clone nodes that are needed in the caller, don't clone ALL aux calls. This improves by Chris Lattner · 21 years ago
  82. c4ebdce Fix a DSA bug that caused DSA to generate incredibly huge graphs and take forever to by Chris Lattner · 21 years ago
  83. 2c7725a Deinline methods, add fast exit by Chris Lattner · 21 years ago
  84. b1aaeee Fix a node mapping problem that was causing the pool allocator to locally allocate by Chris Lattner · 21 years ago
  85. 0321b68 Only clone global nodes between graphs if both graphs have the global. by Chris Lattner · 21 years ago
  86. af6926a Fix typo by Chris Lattner · 21 years ago
  87. abcdf80 The node doesn't have to be _no_ node flags, it just has to be complete and by Chris Lattner · 21 years ago
  88. cf14e71 Two changes: by Chris Lattner · 21 years ago
  89. 51c06ab Simplify the dead node elimination stuff by Chris Lattner · 21 years ago
  90. 0ad9170 Use isNull instead of getNode() to test for existence of a node, this is cheaper. by Chris Lattner · 21 years ago
  91. d85645f Fix an iterator invalidation problem which was causing some nodes to not be by Chris Lattner · 21 years ago
  92. d21cd80 Adjust to the changed StructType interface. In particular, getElementTypes() is gone. by Chris Lattner · 21 years ago
  93. c3f5f77 Instead of callign removeTriviallyDeadNodes on the global graph every time by Chris Lattner · 21 years ago
  94. 4ff0b96 Substantially improve the DSA code by removing 'forwarding' nodes from by Chris Lattner · 21 years ago
  95. 9857c1a Bugfix for ilist conversion. The ilist wants to make an 'end' node which has by Chris Lattner · 21 years ago
  96. 28897e1 Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> by Chris Lattner · 21 years ago
  97. 9fd37ba Change to use node_iterators instead of direct access to Nodes by Chris Lattner · 21 years ago
  98. e92e764 getNodes() is gone, use node_begin/end instead by Chris Lattner · 21 years ago
  99. a5ca28c There is no need to clone over nodes that are going to be dead anyway by Chris Lattner · 21 years ago
  100. ead9eb7 Fix a bug aflicting 265.gap by Chris Lattner · 21 years ago