.. |
ADCE.cpp
|
At Chris' suggestion, move the liveness and worklist datastructures into
|
2008-06-23 06:13:12 +00:00 |
BasicBlockPlacement.cpp
|
Clean up the use of static and anonymous namespaces. This turned up
|
2008-05-13 00:00:25 +00:00 |
CodeGenPrepare.cpp
|
Remove comparison methods for MVT. The main cause
|
2008-06-08 20:54:56 +00:00 |
CondPropagate.cpp
|
Clean up the use of static and anonymous namespaces. This turned up
|
2008-05-13 00:00:25 +00:00 |
ConstantProp.cpp
|
Use Instruction::eraseFromParent().
|
2008-06-21 22:08:46 +00:00 |
DCE.cpp
|
Clean up the use of static and anonymous namespaces. This turned up
|
2008-05-13 00:00:25 +00:00 |
DeadStoreElimination.cpp
|
80 col / tabs fixes
|
2008-05-13 01:48:26 +00:00 |
GCSE.cpp
|
Use Instruction::eraseFromParent().
|
2008-06-21 22:08:46 +00:00 |
GVN.cpp
|
Disable PRE. It's breaking bootstrapping.
|
2008-06-23 21:22:35 +00:00 |
GVNPRE.cpp
|
Update comments and documentation to reflect that GCSE and ValueNumbering are
|
2008-06-05 07:55:49 +00:00 |
IndVarSimplify.cpp
|
Use Loop::block_iterator.
|
2008-06-22 20:18:58 +00:00 |
InstructionCombining.cpp
|
Fix for PR2479: correctly optimize expressions like (a > 13) & (a ==
|
2008-06-21 23:36:13 +00:00 |
JumpThreading.cpp
|
Fix some constructs that gcc-4.4 warns about.
|
2008-05-27 11:50:51 +00:00 |
LICM.cpp
|
Use Loop::block_iterator.
|
2008-06-22 20:18:58 +00:00 |
LoopDeletion.cpp
|
Use use_empty() instead of getNumUses(), avoiding a use list traversal.
|
2008-06-23 23:23:49 +00:00 |
LoopIndexSplit.cpp
|
Fix a typo in a comment.
|
2008-06-24 18:00:21 +00:00 |
LoopRotation.cpp
|
Avoid using BasicBlock::getInstList directly in a few places.
|
2008-06-19 17:37:25 +00:00 |
LoopStrengthReduce.cpp
|
Fix spelling and grammar in a comment.
|
2008-06-23 22:11:52 +00:00 |
LoopUnroll.cpp
|
Use Loop::block_iterator.
|
2008-06-22 20:18:58 +00:00 |
LoopUnswitch.cpp
|
Preserve dominance frontier while trivially unswitching loop.
|
2008-06-18 02:16:38 +00:00 |
Makefile
|
|
|
MemCpyOptimizer.cpp
|
Fix two issues that Eli Friedman pointed out, where would misoptimized code like:
|
2008-06-01 22:26:26 +00:00 |
PredicateSimplifier.cpp
|
InequalityGraph::node() can create new nodes, invalidating iterators across
|
2008-05-27 00:59:05 +00:00 |
Reassociate.cpp
|
API change for {BinaryOperator|CmpInst|CastInst}::create*() --> Create. Legacy interfaces will be in place for some time. (Merge from use-diet branch.)
|
2008-05-16 19:29:10 +00:00 |
Reg2Mem.cpp
|
API change for {BinaryOperator|CmpInst|CastInst}::create*() --> Create. Legacy interfaces will be in place for some time. (Merge from use-diet branch.)
|
2008-05-16 19:29:10 +00:00 |
Scalar.cpp
|
C and Objective Caml bindings for mem2reg and reg2mem.
|
2008-03-20 17:16:03 +00:00 |
ScalarReplAggregates.cpp
|
minor tidying of comments.
|
2008-06-23 17:11:23 +00:00 |
SCCP.cpp
|
Tidy up some commments and use the getAggregateOperand and
|
2008-06-20 16:41:17 +00:00 |
SimplifyCFGPass.cpp
|
rename SimplifyCFG.cpp -> SimplifyCFGPass.cpp
|
2008-05-14 20:38:44 +00:00 |
SimplifyLibCalls.cpp
|
Fix the crash on SimplifyLibCalls/2005-05-20-sprintf-crash.ll
|
2008-06-16 04:10:21 +00:00 |
TailDuplication.cpp
|
Revert 52223.
|
2008-06-12 20:55:39 +00:00 |
TailRecursionElimination.cpp
|
Fix a case where tailcallelim wouldn't set the changed bit when it made a change.
|
2008-06-14 00:49:48 +00:00 |