llvm-6502/lib/Analysis
2009-10-30 22:52:47 +00:00
..
IPA Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
AliasAnalysis.cpp
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasDebugger.cpp
AliasSetTracker.cpp Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
Analysis.cpp
BasicAliasAnalysis.cpp Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
CaptureTracking.cpp Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
CFGPrinter.cpp
CMakeLists.txt Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
ConstantFolding.cpp
DbgInfoPrinter.cpp
DebugInfo.cpp If string field is empty then return NULL. 2009-10-30 22:52:47 +00:00
DomPrinter.cpp
InlineCost.cpp rename indbr -> indirectbr to appease the residents of #llvm. 2009-10-28 00:19:10 +00:00
InstCount.cpp
Interval.cpp
IntervalPartition.cpp
IVUsers.cpp
LibCallAliasAnalysis.cpp
LibCallSemantics.cpp
LiveValues.cpp
LoopDependenceAnalysis.cpp
LoopInfo.cpp
LoopPass.cpp
Makefile
MemoryBuiltins.cpp fix 80-col. 2009-10-29 04:41:24 +00:00
MemoryDependenceAnalysis.cpp Treat lifetime begin/end markers as allocations/frees respectively for the 2009-10-28 07:05:35 +00:00
PointerTracking.cpp Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
PostDominators.cpp
ProfileEstimatorPass.cpp
ProfileInfo.cpp
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp
ProfileVerifierPass.cpp
README.txt
ScalarEvolution.cpp
ScalarEvolutionAliasAnalysis.cpp
ScalarEvolutionExpander.cpp
SparsePropagation.cpp rename indbr -> indirectbr to appease the residents of #llvm. 2009-10-28 00:19:10 +00:00
Trace.cpp
ValueTracking.cpp

Analysis Opportunities:

//===---------------------------------------------------------------------===//

In test/Transforms/LoopStrengthReduce/quadradic-exit-value.ll, the
ScalarEvolution expression for %r is this:

  {1,+,3,+,2}<loop>

Outside the loop, this could be evaluated simply as (%n * %n), however
ScalarEvolution currently evaluates it as

  (-2 + (2 * (trunc i65 (((zext i64 (-2 + %n) to i65) * (zext i64 (-1 + %n) to i65)) /u 2) to i64)) + (3 * %n))

In addition to being much more complicated, it involves i65 arithmetic,
which is very inefficient when expanded into code.

//===---------------------------------------------------------------------===//