6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-10-26 02:22:29 +00:00
Code Issues Projects Releases Wiki Activity

Fix a comment typo and add comments.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167684 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nadav Rotem
2012-11-11 05:15:00 +00:00
parent bb51ec8b62
commit 9005b8d27d
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Transforms/Vectorize/LoopVectorize.cpp
View File

@@ -79,7 +79,7 @@ VectorizationFactor("force-vector-width", cl::init(0), cl::Hidden,
const unsigned TinyTripCountThreshold = 16; const unsigned TinyTripCountThreshold = 16;
/// When performing a runtime memory check, do not check more than this /// When performing a runtime memory check, do not check more than this
/// numner of pointers. Notice that the check is quadratic! /// number of pointers. Notice that the check is quadratic!
const unsigned RuntimeMemoryCheckThreshold = 2; const unsigned RuntimeMemoryCheckThreshold = 2;
namespace { namespace {
@@ -118,7 +118,7 @@ public:
/// Widen each instruction in the old loop to a new one in the new loop. /// Widen each instruction in the old loop to a new one in the new loop.
/// Use the Legality module to find the induction and reduction variables. /// Use the Legality module to find the induction and reduction variables.
vectorizeLoop(Legal); vectorizeLoop(Legal);
// register the new loop. // Register the new loop and update the analysis passes.
updateAnalysis(); updateAnalysis();
} }
@@ -127,7 +127,8 @@ private:
void createEmptyLoop(LoopVectorizationLegality *Legal); void createEmptyLoop(LoopVectorizationLegality *Legal);
/// Copy and widen the instructions from the old loop. /// Copy and widen the instructions from the old loop.
void vectorizeLoop(LoopVectorizationLegality *Legal); void vectorizeLoop(LoopVectorizationLegality *Legal);
/// Insert the new loop to the loop hierarchy and pass manager. /// Insert the new loop to the loop hierarchy and pass manager
/// and update the analysis passes.
void updateAnalysis(); void updateAnalysis();
/// This instruction is un-vectorizable. Implement it as a sequence /// This instruction is un-vectorizable. Implement it as a sequence
@@ -304,7 +305,7 @@ private:
bool isReductionInstr(Instruction *I, ReductionKind Kind); bool isReductionInstr(Instruction *I, ReductionKind Kind);
/// Returns True, if 'Phi' is an induction variable. /// Returns True, if 'Phi' is an induction variable.
bool isInductionVariable(PHINode *Phi); bool isInductionVariable(PHINode *Phi);
/// Return true if we /// Return true if can compute the address bounds of Ptr within the loop.
bool hasComputableBounds(Value *Ptr); bool hasComputableBounds(Value *Ptr);
/// The loop that we evaluate. /// The loop that we evaluate.