6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-08-09 11:25:55 +00:00
Code Issues Projects Releases Wiki Activity

Typos.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@174723 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Jakob Stoklund Olesen
2013-02-08 17:43:32 +00:00
parent 0b821eff4c
commit 9de31bd829
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -9,10 +9,10 @@
// //
// This is the LLVM loop vectorizer. This pass modifies 'vectorizable' loops // This is the LLVM loop vectorizer. This pass modifies 'vectorizable' loops
// and generates target-independent LLVM-IR. Legalization of the IR is done // and generates target-independent LLVM-IR. Legalization of the IR is done
// in the codegen. However, the vectorizes uses (will use) the codegen // in the codegen. However, the vectorizer uses (will use) the codegen
// interfaces to generate IR that is likely to result in an optimal binary. // interfaces to generate IR that is likely to result in an optimal binary.
// //
// The loop vectorizer combines consecutive loop iteration into a single // The loop vectorizer combines consecutive loop iterations into a single
// 'wide' iteration. After this transformation the index is incremented // 'wide' iteration. After this transformation the index is incremented
// by the SIMD vector width, and not by one. // by the SIMD vector width, and not by one.
// //
@@ -637,7 +637,7 @@ struct LoopVectorize : public LoopPass {
// Use the cost model. // Use the cost model.
LoopVectorizationCostModel CM(L, SE, LI, &LVL, *TTI, DL); LoopVectorizationCostModel CM(L, SE, LI, &LVL, *TTI, DL);
// Check the function attribues to find out if this function should be // Check the function attributes to find out if this function should be
// optimized for size. // optimized for size.
Function *F = L->getHeader()->getParent(); Function *F = L->getHeader()->getParent();
Attribute::AttrKind SzAttr = Attribute::OptimizeForSize; Attribute::AttrKind SzAttr = Attribute::OptimizeForSize;
@@ -668,7 +668,7 @@ struct LoopVectorize : public LoopPass {
F->getParent()->getModuleIdentifier()<<"\n"); F->getParent()->getModuleIdentifier()<<"\n");
DEBUG(dbgs() << "LV: Unroll Factor is " << UF << "\n"); DEBUG(dbgs() << "LV: Unroll Factor is " << UF << "\n");
// If we decided that it is *legal* to vectorizer the loop then do it. // If we decided that it is *legal* to vectorize the loop then do it.
InnerLoopVectorizer LB(L, SE, LI, DT, DL, VF.Width, UF); InnerLoopVectorizer LB(L, SE, LI, DT, DL, VF.Width, UF);
LB.vectorize(&LVL); LB.vectorize(&LVL);