1. 37bfbb4 add a new TargetConstant node by Chris Lattner · 19 years ago
  2. d5d0f9b Eliminate the RegSDNode class, which 3 nodes (CopyFromReg/CopyToReg/ImplicitDef) by Chris Lattner · 19 years ago
  3. 7cbd525 Implement BR_CC and BRTWOWAY_CC. This allows the removal of a rather nasty by Nate Begeman · 19 years ago
  4. f3e133a Allow passing a dag into dump and getOperationName. If one is available by Chris Lattner · 19 years ago
  5. 149c58c Add some methods for dag->dag isel. by Chris Lattner · 19 years ago
  6. ff66368 Remove an unncessary argument to SimplifySelectCC and add an additional by Nate Begeman · 19 years ago
  7. 32c392a Fix the fabs regression on x86 by abstracting the select_cc optimization by Nate Begeman · 19 years ago
  8. 3e27b1f implement a couple of simple shift foldings. by Chris Lattner · 19 years ago
  9. e1fae4a Add a select_cc optimization for recognizing abs(int). This speeds up an by Nate Begeman · 19 years ago
  10. e5d6382 Some SELECT_CC cleanups: by Nate Begeman · 19 years ago
  11. 9373a81 Add new node, SELECT_CC. This node is for targets that don't natively by Nate Begeman · 19 years ago
  12. 7c6e452 Fix an oversight that may be causing PR617. by Chris Lattner · 19 years ago
  13. bd8625b Fix spelling, fix some broken canonicalizations by my last patch by Chris Lattner · 19 years ago
  14. 079a27a add cc nodes to the AllNodes list so they show up in Graphviz output by Chris Lattner · 19 years ago
  15. 7cf7e3f Eliminate the SetCCSDNode in favor of a CondCodeSDNode class. This pulls the by Chris Lattner · 19 years ago
  16. bf3fa97 add a small simplification that can be exposed after promotion/expansion by Chris Lattner · 19 years ago
  17. c534395 Fix a use-of-dangling-pointer bug, from the introduction of SrcValue's. by Chris Lattner · 19 years ago
  18. 0561b3f Update to use the new MathExtras.h support for log2 computation. by Chris Lattner · 19 years ago
  19. 00b16889 Eliminate all remaining tabs and trailing spaces. by Jeff Cohen · 19 years ago
  20. 5f056bf Change *EXTLOAD to use an VTSDNode operand instead of being an MVTSDNode. by Chris Lattner · 19 years ago
  21. 9fadb4c Change TRUNCSTORE to use a VTSDNode operand instead of being an MVTSTDNode by Chris Lattner · 19 years ago
  22. 15e4b01 Introduce a new VTSDNode class with the ultimate goal of eliminating the by Chris Lattner · 19 years ago
  23. 06ef884 restore old srcValueNode behavior and try to to work around it by Andrew Lenharth · 19 years ago
  24. 782ad62 tracking the instructions causing loads and stores provides more information than just the pointer being loaded or stored by Andrew Lenharth · 19 years ago
  25. 41aaf70 Fix bug 537 test 2, which checks to make sure that we fold A+(B-A) -> B for by Nate Begeman · 19 years ago
  26. e5eb6f8 Add some simplifications for MULH[SU]. This allows us to compile this: by Chris Lattner · 20 years ago
  27. 3e01136 remove special case hacks for readport/readio from the binary operator codepath by Chris Lattner · 20 years ago
  28. 385328c Implement fixme's by memoizing nodes. by Chris Lattner · 20 years ago
  29. b7f7d51 Turn this into a wrapper for a simpler version of getNode. by Chris Lattner · 20 years ago
  30. adf6c2a Eliminate special purpose hacks for dynamic_stack_alloc. by Chris Lattner · 20 years ago
  31. e89083a Use the general mechanism for creating multi-value nodes instead of using by Chris Lattner · 20 years ago
  32. 5fa4fa4 Wrap long line, actually add node to the graph. by Chris Lattner · 20 years ago
  33. 89c3463 add a getNode() version that allows construction of any node type. by Chris Lattner · 20 years ago
  34. d71c041 Handle TAILCALL node by Chris Lattner · 20 years ago
  35. a364fa1 fix a bad typeo by Chris Lattner · 20 years ago
  36. 16cd04d rename the ADJCALLSTACKDOWN/ADJCALLSTACKUP nodes to be CALLSEQ_START/BEGIN. by Chris Lattner · 20 years ago
  37. 6980d82 handle a common case generated by the uint64 -> FP code path better by Chris Lattner · 20 years ago
  38. 88de6e7 Make legalize a bit more efficient, and canonicalize sub X, C -> add X, -C by Chris Lattner · 20 years ago
  39. 27e9b41 Do not memoize ADJCALLSTACKDOWN nodes, provide a method to hack on them. by Chris Lattner · 20 years ago
  40. 276260b Print bit count nodes correctly by Chris Lattner · 20 years ago
  41. 19bb228 Silence some VC++ warnings by Jeff Cohen · 20 years ago
  42. 3c69101 Add support for READPORT, WRITEPORT, READIO, WRITEIO by Chris Lattner · 20 years ago
  43. 57aa596 Fold shifts into subsequent SHL's. These shifts often arise due to addrses by Chris Lattner · 20 years ago
  44. fd414a2 Don't use the load/store instruction as the source pointer, use the pointer by Chris Lattner · 20 years ago
  45. 0437cdd memoize all nodes, even null Value* nodes. Do not add two token chain outputs by Chris Lattner · 20 years ago
  46. 2bf3c26 Print SrcValue nodes correctly by Chris Lattner · 20 years ago
  47. 691ef2b Implement count leading zeros (ctlz), count trailing zeros (cttz), and count by Andrew Lenharth · 20 years ago
  48. 7f64464 Add FSQRT, FSIN, FCOS nodes, patch contributed by Morten Ofstad by Chris Lattner · 20 years ago
  49. 2d86ea2 Implement Value* tracking for loads and stores in the selection DAG. This enables one to use alias analysis in the backends. by Andrew Lenharth · 20 years ago
  50. d36f979 Fold (X > -1) | (Y > -1) --> (X&Y > -1) by Chris Lattner · 20 years ago
  51. 229ab2e implement some more logical compares with constants, so that: by Chris Lattner · 20 years ago
  52. 6ea9279 Codegen x < 0 | y < 0 as (x|y) < 0. This allows us to compile this to: by Chris Lattner · 20 years ago
  53. dedf2bd Convert tabs to spaces by Misha Brukman · 20 years ago
  54. edf128a Remove trailing whitespace by Misha Brukman · 20 years ago
  55. 588bbbf Improve and elimination. On PPC, for: by Chris Lattner · 20 years ago
  56. 1c2a9b9 Fold (x & 8) != 0 and (x & 8) == 8 into (x & 8) >> 3. by Chris Lattner · 20 years ago
  57. fda2b55 Fold setcc of MVT::i1 operands into logical operations by Chris Lattner · 20 years ago
  58. 4a44c8d Another minor simplification: handle setcc (zero_extend x), c -> setcc(x, c') by Chris Lattner · 20 years ago
  59. 7467c9b Another simple xform by Chris Lattner · 20 years ago
  60. 706aa96 Fold: by Chris Lattner · 20 years ago
  61. 36019aa Make the AND elimination operation recursive and significantly more powerful, by Chris Lattner · 20 years ago
  62. 72ea281 Add a couple missing transforms in getSetCC that were triggering assertions by Nate Begeman · 20 years ago
  63. eea805e Disbale the broken fold of shift + sz[ext] for now by Nate Begeman · 20 years ago
  64. 97e001d fix an infinite loop by Chris Lattner · 20 years ago
  65. fd8d389 fix some serious miscompiles on ia64, alpha, and ppc by Chris Lattner · 20 years ago
  66. 51679c4 avoid work when possible, perhaps fix the problem nate and andrew are seeing by Chris Lattner · 20 years ago
  67. e666fcf add back the optimization that Nate added for shl X, (zext_inreg y) by Chris Lattner · 20 years ago
  68. 8a8dbfa Oops, remove these too. by Chris Lattner · 20 years ago
  69. 0f2287b Remove all foldings of ZERO_EXTEND_INREG, moving them to work for AND nodes by Chris Lattner · 20 years ago
  70. db81eba Fold shift x, [sz]ext(y) -> shift x, y by Nate Begeman · 20 years ago
  71. b882752 Fold shift by size larger than type size to undef by Nate Begeman · 20 years ago
  72. fd1f1ee Remove some redundant checks, add a couple of new ones. This allows us to by Chris Lattner · 20 years ago
  73. 3b2c1d9 canonicalize x <u 1 -> x == 0. On this testcase: by Chris Lattner · 20 years ago
  74. 2bb6f41 Don't bother sign/zext_inreg'ing the result of an and operation if we know by Chris Lattner · 20 years ago
  75. 45278e3 Fold zext_inreg(zextload), likewise for sext's by Chris Lattner · 20 years ago
  76. edeecfc add a simple xform by Chris Lattner · 20 years ago
  77. dea29e2 Fix a thinko. If the operand is promoted, pass the promoted value into by Chris Lattner · 20 years ago
  78. a2daa8c add a little peephole optimization. This allows us to codegen: by Chris Lattner · 20 years ago
  79. 59723e9 recognize some patterns as fabs operations, so that fabs at the source level by Chris Lattner · 20 years ago
  80. ef847df print and fold BRCONDTWOWAY correctly by Chris Lattner · 20 years ago
  81. 485df9b canonicalize a bunch of operations involving fneg by Chris Lattner · 20 years ago
  82. 5a6bace If a target zero or sign extends the result of its setcc, allow folding of by Chris Lattner · 20 years ago
  83. 2467392 Remove somethign I had for testing by Chris Lattner · 20 years ago
  84. 67255a1 This patch does two things. First, it canonicalizes 'X >= C' -> 'X > C-1' by Chris Lattner · 20 years ago
  85. 8e8bd65 Fix a really scary bug that Nate found where we weren't deleting the right by Chris Lattner · 20 years ago
  86. 1867054 Add MULHU and MULHS nodes for the high part of an (un)signed 32x32=64b multiply. by Nate Begeman · 20 years ago
  87. ff9fd0a print fneg/fabs by Chris Lattner · 20 years ago
  88. 5b359c6 fix some bugs in the implementation of SHL_PARTS and friends. by Chris Lattner · 20 years ago
  89. 41be951 Print some new nodes by Chris Lattner · 20 years ago
  90. fc1b1da Add ISD::UNDEF node by Nate Begeman · 20 years ago
  91. 9576212 PCMarker support for DAG and Alpha by Andrew Lenharth · 20 years ago
  92. ee639f1 Fix a bug where we would incorrectly do a sign ext instead of a zero ext by Chris Lattner · 20 years ago
  93. 14723c2 constant fold FP_ROUND_INREG, ZERO_EXTEND_INREG, and SIGN_EXTEND_INREG by Chris Lattner · 20 years ago
  94. d865861 Don't rely on doubles comparing identical to each other, which doesn't work by Chris Lattner · 20 years ago
  95. b48da39 Remove the 3 HACK HACK HACKs I put in before, fixing them properly with by Chris Lattner · 20 years ago
  96. 7cd50cf More bugfixes for IA64 shifts. by Chris Lattner · 20 years ago
  97. a7306db Add a nasty hack to fix Alpha/IA64 multiplies by a power of two. by Chris Lattner · 20 years ago
  98. 9bb86f4 Remove unneeded line. by Chris Lattner · 20 years ago
  99. 1e7ceaf test commit by Chris Lattner · 20 years ago
  100. a93ec3e Unary token factor nodes are unneeded. by Chris Lattner · 20 years ago