| Age | Commit message (Expand) | Author |
|---|
| 2006-05-13 | Fixing 2006-05-01-SchedCausingSpills.ll; some clean up | Evan Cheng |
| 2006-05-13 | Revert an un-intended change | Evan Cheng |
| 2006-05-13 | Merge identical code. | Chris Lattner |
| 2006-05-12 | Remove dead vars | Chris Lattner |
| 2006-05-12 | remove dead vars | Chris Lattner |
| 2006-05-12 | Comment out dead variables | Chris Lattner |
| 2006-05-12 | Compile: | Chris Lattner |
| 2006-05-12 | Refactor a bunch of includes so that TargetMachine.h doesn't have to include | Owen Anderson |
| 2006-05-12 | Duh. That could take a long time. | Evan Cheng |
| 2006-05-12 | Two simplifications for token factor nodes: simplify tf(x,x) -> x. | Chris Lattner |
| 2006-05-12 | Add capability to scheduler to commute nodes for profit. | Evan Cheng |
| 2006-05-11 | Refactor scheduler code. Move register-reduction list scheduler to a | Evan Cheng |
| 2006-05-10 | Templatify RegReductionPriorityQueue | Evan Cheng |
| 2006-05-09 | Fix PR773 | Nate Begeman |
| 2006-05-09 | Add pseudo dependency to force a def&use operand to be scheduled last (unless | Evan Cheng |
| 2006-05-09 | Debugging info | Evan Cheng |
| 2006-05-08 | Make the case I just checked in stronger. Now we compile this: | Chris Lattner |
| 2006-05-08 | Implement and_sext.ll:test3, generating: | Chris Lattner |
| 2006-05-08 | Compile this: | Chris Lattner |
| 2006-05-08 | Fold shifts with undef operands. | Chris Lattner |
| 2006-05-08 | When tracking demanded bits, if any bits from the sext of an SRA are demanded, | Chris Lattner |
| 2006-05-08 | Make emission of jump tables a bit less conservative; they are now required | Nate Begeman |
| 2006-05-08 | Fix PR772 | Nate Begeman |
| 2006-05-06 | Use ComputeMaskedBits to determine # sign bits as a fallback. This allows us | Chris Lattner |
| 2006-05-06 | Add some more sign propagation cases | Chris Lattner |
| 2006-05-06 | Simplify some code, add a couple minor missed folds | Chris Lattner |
| 2006-05-06 | constant fold sign_extend_inreg | Chris Lattner |
| 2006-05-06 | remove cases handled elsewhere | Chris Lattner |
| 2006-05-06 | Add some more simple sign bit propagation cases. | Chris Lattner |
| 2006-05-06 | Use the new TargetLowering::ComputeNumSignBits method to eliminate | Chris Lattner |
| 2006-05-06 | Add some really really simple code for computing sign-bit propagation. | Chris Lattner |
| 2006-05-06 | When inserting casts, be careful of where we put them. We cannot insert | Chris Lattner |
| 2006-05-06 | Fold (trunc (srl x, c)) -> (srl (trunc x), c) | Chris Lattner |
| 2006-05-05 | Fold trunc(any_ext). This gives stuff like: | Chris Lattner |
| 2006-05-05 | Shrink shifts when possible. | Chris Lattner |
| 2006-05-05 | Implement ComputeMaskedBits/SimplifyDemandedBits for ISD::TRUNCATE | Chris Lattner |
| 2006-05-05 | Fold (fpext (load x)) -> (extload x) | Chris Lattner |
| 2006-05-05 | More aggressively sink GEP offsets into loops. For example, before we | Chris Lattner |
| 2006-05-05 | Fold some common code. | Chris Lattner |
| 2006-05-05 | Implement: | Chris Lattner |
| 2006-05-05 | Pull and through and/or/xor. This compiles some bitfield code to: | Chris Lattner |
| 2006-05-05 | Implement a variety of simplifications for ANY_EXTEND. | Chris Lattner |
| 2006-05-05 | Factor some code, add these transformations: | Chris Lattner |
| 2006-05-05 | Fix VC++ compilation error. | Jeff Cohen |
| 2006-05-05 | Sink noop copies into the basic block that uses them. This reduces the number | Chris Lattner |
| 2006-05-04 | Initial support for register pressure aware scheduling. The register reduction | Evan Cheng |
| 2006-05-04 | Remove and simplify some more machineinstr/machineoperand stuff. | Chris Lattner |
| 2006-05-04 | Rename MO_VirtualRegister -> MO_Register. Clean up immediate handling. | Chris Lattner |
| 2006-05-04 | Remove a bunch more SparcV9 specific stuff | Chris Lattner |
| 2006-05-03 | Finish up the initial jump table implementation by allowing jump tables to | Nate Begeman |
