mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-10-07 20:57:12 +00:00
3748de6e2d
This pass was based on the previous (essentially unused) profiling infrastructure and the assumption that by ordering the basic blocks at the IR level in a particular way, the correct layout would happen in the end. This sometimes worked, and mostly didn't. It also was a really naive implementation of the classical paper that dates from when branch predictors were primarily directional and when loop structure wasn't commonly available. It also didn't factor into the equation non-fallthrough branches and other machine level details. Anyways, for all of these reasons and more, I wrote MachineBlockPlacement, which completely supercedes this pass. It both uses modern profile information infrastructure, and actually works. =] git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@190748 91177308-0d34-0410-b5e6-96231b3b80d8
38 lines
722 B
CMake
38 lines
722 B
CMake
add_llvm_library(LLVMScalarOpts
|
|
ADCE.cpp
|
|
CodeGenPrepare.cpp
|
|
ConstantProp.cpp
|
|
CorrelatedValuePropagation.cpp
|
|
DCE.cpp
|
|
DeadStoreElimination.cpp
|
|
EarlyCSE.cpp
|
|
GlobalMerge.cpp
|
|
GVN.cpp
|
|
IndVarSimplify.cpp
|
|
JumpThreading.cpp
|
|
LICM.cpp
|
|
LoopDeletion.cpp
|
|
LoopIdiomRecognize.cpp
|
|
LoopInstSimplify.cpp
|
|
LoopRotation.cpp
|
|
LoopStrengthReduce.cpp
|
|
LoopUnrollPass.cpp
|
|
LoopUnswitch.cpp
|
|
LowerAtomic.cpp
|
|
MemCpyOptimizer.cpp
|
|
PartiallyInlineLibCalls.cpp
|
|
Reassociate.cpp
|
|
Reg2Mem.cpp
|
|
SCCP.cpp
|
|
SROA.cpp
|
|
Scalar.cpp
|
|
ScalarReplAggregates.cpp
|
|
SimplifyCFGPass.cpp
|
|
FlattenCFGPass.cpp
|
|
Sink.cpp
|
|
StructurizeCFG.cpp
|
|
TailRecursionElimination.cpp
|
|
)
|
|
|
|
add_dependencies(LLVMScalarOpts intrinsics_gen)
|