| Age | Commit message (Expand) | Author |
|---|
| 2006-05-30 | When a priority_queue is empty, the behavior of top() operator is | Evan Cheng |
| 2006-05-27 | Fix a nasty dag combiner bug that caused nondeterminstic crashes (MY FAVORITE!): | Chris Lattner |
| 2006-05-26 | Make CALL node consistent with RET node. Signness of value has type MVT::i32 | Evan Cheng |
| 2006-05-26 | Change RET node to include signness information of the return values. e.g. | Evan Cheng |
| 2006-05-25 | Turn on -sched-commute-nodes by default. | Evan Cheng |
| 2006-05-25 | CALL node change: now including signness of every argument. | Evan Cheng |
| 2006-05-24 | Patches to make the LLVM sources more -pedantic clean. Patch provided | Chris Lattner |
| 2006-05-23 | -enable-unsafe-fp-math implies -enable-finite-only-fp-math | Evan Cheng |
| 2006-05-23 | Fix missing include | Vladimir Prus |
| 2006-05-23 | Incorrect SETCC CondCode used for FP comparisons. | Evan Cheng |
| 2006-05-18 | lib/Target/Target.td | Evan Cheng |
| 2006-05-17 | Fix the result of the call to use a correct vbitconvert. There is no need to | Chris Lattner |
| 2006-05-17 | Correct a previous patch which broke CodeGen/PowerPC/vec_call.ll | Chris Lattner |
| 2006-05-17 | Another typo. Pointed out by Nate Begeman. | Evan Cheng |
| 2006-05-17 | Fixed a LowerCallTo and LowerArguments bug. They were introducing illegal | Evan Cheng |
| 2006-05-17 | Fix an obvious bug in getPackedTypeBreakdown. Return 1 if type is legal. | Evan Cheng |
| 2006-05-17 | When we legalize target nodes, do not use getNode to create a new node, | Chris Lattner |
| 2006-05-17 | Add an assertion, avoid some unneeded work for each call. No functionality | Chris Lattner |
| 2006-05-16 | Add support for calls that pass and return legal vectors. | Chris Lattner |
| 2006-05-16 | Add a new ISD::CALL node, make the default impl of TargetLowering::LowerCallTo | Chris Lattner |
| 2006-05-16 | this should be 128 I think | Andrew Lenharth |
| 2006-05-16 | Move this code to a common place | Andrew Lenharth |
| 2006-05-16 | Add a chain to FORMAL_ARGUMENTS. This is a minimal port of the X86 backend, | Chris Lattner |
| 2006-05-16 | Move function-live-in-handling code from the sdisel code to the scheduler. | Chris Lattner |
| 2006-05-16 | Legalize FORMAL_ARGUMENTS nodes correctly, we don't want to legalize them once | Chris Lattner |
| 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 |
