llvm-6502/lib/Analysis
Chris Lattner ff2f683143 remove unneeded checks of isFreeCall
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85866 91177308-0d34-0410-b5e6-96231b3b80d8
2009-11-03 05:35:19 +00:00
..
IPA Reverting 85714, 85715, 85716, which are breaking the build 2009-11-01 16:42:53 +00:00
AliasAnalysis.cpp Remove AllocationInst. Since MallocInst went away, AllocaInst is the only subclass of AllocationInst, so it no longer is necessary. 2009-10-23 21:09:37 +00:00
AliasAnalysisCounter.cpp Remove includes of Support/Compiler.h that are no longer needed after the 2009-10-25 06:57:41 +00:00
AliasAnalysisEvaluator.cpp Remove includes of Support/Compiler.h that are no longer needed after the 2009-10-25 06:57:41 +00:00
AliasDebugger.cpp Remove includes of Support/Compiler.h that are no longer needed after the 2009-10-25 06:57:41 +00:00
AliasSetTracker.cpp remove unneeded checks of isFreeCall 2009-11-03 05:35:19 +00:00
Analysis.cpp
BasicAliasAnalysis.cpp Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
CaptureTracking.cpp remove a check of isFreeCall: the argument to free is already nocapture so the generic call code works fine. 2009-11-03 05:34:51 +00:00
CFGPrinter.cpp Remove includes of Support/Compiler.h that are no longer needed after the 2009-10-25 06:57:41 +00:00
CMakeLists.txt Rename MallocFreeHelper as MemoryBuiltins 2009-10-27 20:05:49 +00:00
ConstantFolding.cpp Teach FoldBitCast to be able to handle bitcasts from (e.g.) i128 -> <4 x float>. 2009-10-25 06:15:37 +00:00
DbgInfoPrinter.cpp Remove VISIBILITY_HIDDEN from class/struct found inside anonymous namespaces. 2009-10-25 06:33:48 +00:00
DebugInfo.cpp If string field is empty then return NULL. 2009-10-30 22:52:47 +00:00
DomPrinter.cpp fix the other issue with ID's, hopefully really fixing the linux build. 2009-10-18 04:58:34 +00:00
InlineCost.cpp Add a missing closing parenthesis, and tweak to fit in 80 2009-11-01 19:12:43 +00:00
InstCount.cpp Remove FreeInst. 2009-10-26 23:43:48 +00:00
Interval.cpp
IntervalPartition.cpp
IVUsers.cpp
LibCallAliasAnalysis.cpp
LibCallSemantics.cpp
LiveValues.cpp
LoopDependenceAnalysis.cpp
LoopInfo.cpp Fix another place that calls Loop::contains a lot to construct a sorted 2009-10-20 20:41:13 +00:00
LoopPass.cpp
Makefile
MemoryBuiltins.cpp Set bit instead of calling pow() to compute 2 << n 2009-11-02 18:51:28 +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 Remove VISIBILITY_HIDDEN from class/struct found inside anonymous namespaces. 2009-10-25 06:33:48 +00:00
ProfileInfo.cpp Remove includes of Support/Compiler.h that are no longer needed after the 2009-10-25 06:57:41 +00:00
ProfileInfoLoader.cpp
ProfileInfoLoaderPass.cpp Apply fix for PR5135, Credit to Andreas Neustifter. 2009-11-02 02:55:39 +00:00
ProfileVerifierPass.cpp Apply fix for PR5135, Credit to Andreas Neustifter. 2009-11-02 02:55:39 +00:00
README.txt
ScalarEvolution.cpp Reverting 85714, 85715, 85716, which are breaking the build 2009-11-01 16:42:53 +00:00
ScalarEvolutionAliasAnalysis.cpp Make ScalarEvolutionAliasAnalysis slightly more aggressive, by making an 2009-10-31 14:32:25 +00:00
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 Remove AllocationInst. Since MallocInst went away, AllocaInst is the only subclass of AllocationInst, so it no longer is necessary. 2009-10-23 21:09:37 +00:00

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.

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