| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | op_iterator-ify some loops, fix 80col violations | Gabor Greif | 2008-06-11 | 1 | -9/+11 |
| * | For now, avoid generating FP select instructions in order to speculatively ex... | Evan Cheng | 2008-06-11 | 1 | -4/+9 |
| * | Avoid duplicating loop header which leads to unnatural loops (and just seem l... | Evan Cheng | 2008-06-11 | 1 | -0/+18 |
| * | Teach instruction combining about the extractvalue. It can succesfully fold | Matthijs Kooijman | 2008-06-11 | 1 | -0/+157 |
| * | Clarify a comment. | Matthijs Kooijman | 2008-06-11 | 1 | -3/+3 |
| * | op_iterator-ify loops | Gabor Greif | 2008-06-10 | 1 | -13/+16 |
| * | lower calls to abs to inline code, PR2337 | Chris Lattner | 2008-06-09 | 1 | -1/+26 |
| * | Fix PR2411, where ip constant prop would propagate the | Chris Lattner | 2008-06-09 | 1 | -0/+5 |
| * | Remove comparison methods for MVT. The main cause | Duncan Sands | 2008-06-08 | 1 | -2/+2 |
| * | Limit the icmp+phi merging optimization to the cases where it is profitable: | Chris Lattner | 2008-06-08 | 1 | -4/+12 |
| * | Speculatively execute a block when the the block is the then part of a triang... | Evan Cheng | 2008-06-07 | 1 | -0/+121 |
| * | LoopSimplify preserves AA. | Devang Patel | 2008-06-06 | 1 | -3/+5 |
| * | Wrap MVT::ValueType in a struct to get type safety | Duncan Sands | 2008-06-06 | 1 | -3/+3 |
| * | As Chris suggested, handle the situation if ShAmt larger than BitWidth, | Zhou Sheng | 2008-06-06 | 1 | -1/+1 |
| * | If BitWidth equals to ShtAmt, the RHSKnownZero[BitWidth-ShiftAmt-1] will | Zhou Sheng | 2008-06-05 | 1 | -1/+1 |
| * | Learn ScalarReplAggregrates how stores and loads of first class aggregrates | Matthijs Kooijman | 2008-06-05 | 1 | -0/+51 |
| * | Let StructRetPromotion check if all if its users are really calls or invokesn, | Matthijs Kooijman | 2008-06-05 | 1 | -0/+4 |
| * | Let StructRetPromotion check if it's users are really calling it and not | Matthijs Kooijman | 2008-06-05 | 1 | -0/+4 |
| * | Use use_iterator::getOperandNo instead of CallSite::hasArgument to check if a | Matthijs Kooijman | 2008-06-05 | 1 | -7/+6 |
| * | Update comments and documentation to reflect that GCSE and ValueNumbering are | Matthijs Kooijman | 2008-06-05 | 3 | -1/+10 |
| * | Remove unneeded #include. | Owen Anderson | 2008-06-04 | 1 | -1/+0 |
| * | Replace two manual loops with calls to CallSite::hasArguments (no functional ... | Matthijs Kooijman | 2008-06-04 | 1 | -7/+5 |
| * | Change packed struct layout so that field sizes | Duncan Sands | 2008-06-04 | 1 | -7/+5 |
| * | LoopIndexSplit can sometimes result in cases where a block in its own domfron... | Owen Anderson | 2008-06-03 | 1 | -3/+6 |
| * | Fix whitespace in whitespace-significant pseudocode in a comment. | Dan Gohman | 2008-06-03 | 1 | -2/+2 |
| * | Update dom tree. Fix PR 2372. | Devang Patel | 2008-06-02 | 1 | -1/+4 |
| * | move CannotBeNegativeZero to ValueTracking. Simplify some signbit comparisons. | Chris Lattner | 2008-06-02 | 1 | -54/+2 |
| * | move ComputeMaskedBits, MaskedValueIsZero, and ComputeNumSignBits | Chris Lattner | 2008-06-02 | 1 | -651/+14 |
| * | Fix two issues that Eli Friedman pointed out, where would misoptimized code l... | Owen Anderson | 2008-06-01 | 1 | -3/+14 |
| * | Don't remove the memcpy when call slot substitution fails. | Owen Anderson | 2008-06-01 | 1 | -0/+5 |
| * | When simplifying a call to a bitcast function, tighten up | Duncan Sands | 2008-06-01 | 1 | -18/+15 |
| * | Peer through sext/zext when looking for not(cmp). | Nick Lewycky | 2008-05-31 | 1 | -0/+20 |
| * | Add more i1 optimizations. add, sub, mul, s/udiv on i1 are now simplified away. | Nick Lewycky | 2008-05-31 | 1 | -5/+15 |
| * | Adding i1 is always Xor. | Nick Lewycky | 2008-05-31 | 1 | -0/+3 |
| * | rewrite operand loops to use iterators | Gabor Greif | 2008-05-30 | 1 | -24/+26 |
| * | Since LCSSA switched over to DenseMap, we have to be more careful to avoid it... | Owen Anderson | 2008-05-30 | 1 | -4/+5 |
| * | Use eraseFromParent() instead of doing that manually in two places. | Matthijs Kooijman | 2008-05-30 | 1 | -2/+2 |
| * | const-ify getOpcode. | Dan Gohman | 2008-05-29 | 1 | -3/+3 |
| * | Add a newline at the end of this file. | Duncan Sands | 2008-05-29 | 1 | -1/+1 |
| * | Replace the old ADCE implementation with a new one that more simply solves | Owen Anderson | 2008-05-29 | 1 | -457/+62 |
| * | Remove debugging code. | Owen Anderson | 2008-05-29 | 1 | -5/+1 |
| * | convert more operand loops to iterator formulation | Gabor Greif | 2008-05-29 | 2 | -23/+29 |
| * | Implement PR2370: memmove(x,x,size) -> noop. | Chris Lattner | 2008-05-28 | 1 | -0/+4 |
| * | Fix some constructs that gcc-4.4 warns about. | Duncan Sands | 2008-05-27 | 2 | -3/+4 |
| * | InequalityGraph::node() can create new nodes, invalidating iterators across | Nick Lewycky | 2008-05-27 | 1 | -0/+1 |
| * | Grammaro. | Nick Lewycky | 2008-05-26 | 1 | -1/+1 |
| * | Factor code to copy global value attributes like | Duncan Sands | 2008-05-26 | 6 | -27/+11 |
| * | Use a DenseMap instead of an std::map, speeding up the testcase in PR2368 by ... | Owen Anderson | 2008-05-26 | 1 | -3/+3 |
| * | "ret (constexpr)" can't be folded into a Constant. Add a method to | Nick Lewycky | 2008-05-25 | 1 | -0/+10 |
| * | Fix a serious brain-o. Obviously no-one reviewed my patch :( | Chris Lattner | 2008-05-24 | 1 | -2/+4 |
