Chris Lattner d22fe2b51f make the common case of a single store (which clearly shouldn't be turned ...

into a memset!) faster by avoiding an allocation of an std::list node.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@48939 91177308-0d34-0410-b5e6-96231b3b80d8

2008-03-29 04:52:12 +00:00

..

ADCE.cpp

…

BasicBlockPlacement.cpp

…

CodeGenPrepare.cpp

Handle getresult instructions in different basic blocks

2008-03-21 21:01:32 +00:00

CondPropagate.cpp

…

ConstantProp.cpp

…

DCE.cpp

…

DeadStoreElimination.cpp

…

GCSE.cpp

…

GVN.cpp

make the common case of a single store (which clearly shouldn't be turned

2008-03-29 04:52:12 +00:00

GVNPRE.cpp

…

IndVarSimplify.cpp

…

InstructionCombining.cpp

Handle a special case xor undef, undef -> 0. Technically this should be transformed to undef. But this is such a common idiom (misuse) we are going to handle it.

2008-03-25 20:07:13 +00:00

LICM.cpp

…

LoopIndexSplit.cpp

PHI->removeIncomingValue may remove PHInode.

2008-03-27 17:32:46 +00:00

LoopRotation.cpp

…

LoopStrengthReduce.cpp

Remove dead options.

2008-03-19 22:02:26 +00:00

LoopUnroll.cpp

Add comment.

2008-03-19 23:05:52 +00:00

LoopUnswitch.cpp

…

Makefile

…

PredicateSimplifier.cpp

…

Reassociate.cpp

Don't include <map> in Pass.h, which doesn't need it. This requires

2008-03-21 23:51:57 +00:00

Reg2Mem.cpp

…

Scalar.cpp

C and Objective Caml bindings for mem2reg and reg2mem.

2008-03-20 17:16:03 +00:00

ScalarReplAggregates.cpp

…

SCCP.cpp

Don't include <map> in Pass.h, which doesn't need it. This requires

2008-03-21 23:51:57 +00:00

SimplifyCFG.cpp

…

TailDuplication.cpp

Don't include <map> in Pass.h, which doesn't need it. This requires

2008-03-21 23:51:57 +00:00

TailRecursionElimination.cpp

Become multiple return value aware.

2008-03-11 17:33:32 +00:00