| .. |
|
ADCE.cpp
|
Renamed DominatorTree::Node::getNode() -> getBlock()
|
2003-09-11 16:26:13 +00:00 |
|
ConstantProp.cpp
|
Hopefully, the final fix for `[Pp]ropogate'.
|
2003-05-20 21:01:22 +00:00 |
|
CorrelatedExprs.cpp
|
Renamed DominatorTree::Node::getNode() -> getBlock()
|
2003-09-11 16:26:13 +00:00 |
|
DCE.cpp
|
|
|
|
DecomposeMultiDimRefs.cpp
|
Factory methods for function passes now return type FunctionPass *.
|
2003-08-14 06:09:32 +00:00 |
|
GCSE.cpp
|
Don't corrupt memory when removing an instruction from the program, but
|
2003-06-17 03:57:18 +00:00 |
|
IndVarSimplify.cpp
|
Make sure to cannonicalize loops before running indvar simplify
|
2003-09-12 16:45:01 +00:00 |
|
InstructionCombining.cpp
|
pull a large nested conditional out into its own function
|
2003-09-19 17:17:26 +00:00 |
|
LICM.cpp
|
Renamed DominatorTree::Node::getNode() -> getBlock()
|
2003-09-11 16:26:13 +00:00 |
|
LoopSimplify.cpp
|
Renamed DominatorTree::Node::getNode() -> getBlock()
|
2003-09-11 16:26:13 +00:00 |
|
LowerAllocations.cpp
|
Use new interface, simplifies code
|
2003-08-31 00:22:27 +00:00 |
|
LowerSwitch.cpp
|
Fix bug: LowerSwitch/2003-08-23-EmptySwitch.ll
|
2003-08-23 22:54:34 +00:00 |
|
Makefile
|
|
|
|
Mem2Reg.cpp
|
Fix bug: Mem2Reg/2003-06-26-IterativePromote.ll
|
2003-06-25 14:58:56 +00:00 |
|
PiNodeInsertion.cpp
|
Fix spell-o's
|
2003-09-10 05:29:43 +00:00 |
|
PRE.cpp
|
Renamed DominatorTree::Node::getNode() -> getBlock()
|
2003-09-11 16:26:13 +00:00 |
|
Reassociate.cpp
|
Spell `necessary' correctly.
|
2003-08-18 14:43:39 +00:00 |
|
ScalarReplAggregates.cpp
|
Do not return success after checking only the FIRST USE of a gep instruction.
|
2003-09-12 16:02:12 +00:00 |
|
SCCP.cpp
|
Add support for the unwind instruction
|
2003-09-08 18:54:55 +00:00 |
|
SimplifyCFG.cpp
|
|
|
|
SymbolStripping.cpp
|
|
|
|
TailDuplication.cpp
|
Fix bug: TailDuplicate/2003-08-31-UnreachableBlocks.ll
|
2003-08-31 21:17:44 +00:00 |
