llvm-6502

mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-09 10:31:14 +00:00

History

Duncan Sands 890edda7c2 When constant folding GEP of GEP, do not crash if an index of the inner GEP is not a ConstantInt. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@98359 91177308-0d34-0410-b5e6-96231b3b80d8		2010-03-12 17:55:20 +00:00
..
IPA
AliasAnalysis.cpp
AliasAnalysisCounter.cpp
AliasAnalysisEvaluator.cpp
AliasDebugger.cpp
AliasSetTracker.cpp
Analysis.cpp
BasicAliasAnalysis.cpp
CaptureTracking.cpp
CFGPrinter.cpp
CMakeLists.txt
ConstantFolding.cpp
DbgInfoPrinter.cpp	Remove dead debug info intrinsics.	2010-01-05 01:10:40 +00:00
DebugInfo.cpp
DomPrinter.cpp
InlineCost.cpp
InstCount.cpp
InstructionSimplify.cpp
Interval.cpp
IntervalPartition.cpp
IVUsers.cpp
LazyValueInfo.cpp	Convert debug messages to use dbgs(). Generally this means	2009-12-23 20:43:58 +00:00
LibCallAliasAnalysis.cpp	LibCallAliasAnalysis doesn't use TargetData.	2009-07-31 20:56:29 +00:00
LibCallSemantics.cpp
LiveValues.cpp
LoopDependenceAnalysis.cpp	Convert debug messages to use dbgs(). Generally this means	2009-12-23 20:52:41 +00:00
LoopInfo.cpp
LoopPass.cpp
Makefile
MemoryBuiltins.cpp
MemoryDependenceAnalysis.cpp
PHITransAddr.cpp
PointerTracking.cpp
PostDominators.cpp
ProfileEstimatorPass.cpp
ProfileInfo.cpp
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp	adopt getAdjustedAnalysisPointer in a few more passes.	2010-01-20 20:09:02 +00:00
ProfileVerifierPass.cpp
README.txt
ScalarEvolution.cpp
ScalarEvolutionAliasAnalysis.cpp
ScalarEvolutionExpander.cpp
SparsePropagation.cpp
Trace.cpp	Convert debug messages to use dbgs(). Generally this means	2009-12-23 22:35:10 +00:00
ValueTracking.cpp

README.txt

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.

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