[polly] 5aafc6d - [Polly] Fix typos discovered by codespell (#124545)
via llvm-commits
llvm-commits at lists.llvm.org
Mon Jan 27 07:18:51 PST 2025
Author: Christian Clauss
Date: 2025-01-27T16:18:47+01:00
New Revision: 5aafc6d58f3405662902cee006be11e599801b88
URL: https://github.com/llvm/llvm-project/commit/5aafc6d58f3405662902cee006be11e599801b88
DIFF: https://github.com/llvm/llvm-project/commit/5aafc6d58f3405662902cee006be11e599801b88.diff
LOG: [Polly] Fix typos discovered by codespell (#124545)
Patch created using the following command line:
```bash
codespell polly --skip="*.pdf,polly/lib/External/*" --write-changes \
--ignore-words-list=couter,createor,distribues,doble,identty,indention,indx,olt,ore,padd,sais,te,theses
```
Added:
Modified:
polly/docs/Architecture.rst
polly/docs/doxygen.cfg.in
polly/include/polly/CodeGen/RuntimeDebugBuilder.h
polly/include/polly/DependenceInfo.h
polly/include/polly/ScopInfo.h
polly/include/polly/Support/SCEVAffinator.h
polly/include/polly/Support/ScopHelper.h
polly/lib/Analysis/ScopBuilder.cpp
polly/lib/Analysis/ScopDetectionDiagnostic.cpp
polly/lib/CodeGen/IslNodeBuilder.cpp
polly/lib/CodeGen/Utils.cpp
polly/lib/Support/SCEVAffinator.cpp
polly/lib/Support/ScopHelper.cpp
polly/lib/Transform/DeLICM.cpp
polly/lib/Transform/ManualOptimizer.cpp
polly/lib/Transform/MatmulOptimizer.cpp
polly/lib/Transform/ScheduleOptimizer.cpp
polly/lib/Transform/ScheduleTreeTransform.cpp
polly/test/CodeGen/LoopParallelMD/do_not_mutate_debug_info.ll
polly/test/CodeGen/multiple-codegens.ll
polly/test/CodeGen/multiple-scops-in-a-row.ll
polly/test/CodeGen/reduction_2.ll
polly/test/CodeGen/scalar-store-from-same-bb.ll
polly/test/CodeGen/test-invalid-operands-for-select.ll
polly/test/DeLICM/load-in-cond-inf-loop.ll
polly/test/DeLICM/pr41656.ll
polly/test/DeLICM/pr48783.ll
polly/test/DeLICM/reject_outofquota.ll
polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_2.ll
polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_3.ll
polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_4.ll
polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm.ll
polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm_2.ll
polly/test/ScopDetect/scev_remove_max.ll
polly/test/ScopDetectionDiagnostics/ReportLoopHasNoExit.ll
polly/test/ScopInfo/NonAffine/non_affine_loop_used_later.ll
polly/test/ScopInfo/allow-all-parameters-dereferencable.ll
polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-1.ll
polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-2.ll
polly/test/ScopInfo/multidim_gep_pointercast2.ll
polly/test/ScopInfo/multidim_many_references.ll
polly/test/ScopInfo/scalar_to_array.ll
polly/test/ScopInfo/zero_ext_of_truncate.ll
polly/test/create_ll.sh
polly/utils/pyscop/isl.py
polly/www/changelog.html
polly/www/get_started.html
polly/www/index.html
polly/www/projects.html
polly/www/publications.html
Removed:
################################################################################
diff --git a/polly/docs/Architecture.rst b/polly/docs/Architecture.rst
index 645d6522e86947..506e0ff8d26be7 100644
--- a/polly/docs/Architecture.rst
+++ b/polly/docs/Architecture.rst
@@ -27,7 +27,7 @@ executed in the so-called **Inliner cycle**, This is again a set of **Scalar
Simplification** passes, a set of **Simple Loop Optimizations**, and the
**Inliner** itself. Even though these passes make up the majority of the LLVM
pass pipeline, the primary goal of these passes is still canonicalization
-without loosing semantic information that complicates later analysis. As part of
+without losing semantic information that complicates later analysis. As part of
the inliner cycle, the LLVM inliner step-by-step tries to inline functions, runs
canonicalization passes to exploit newly exposed simplification opportunities,
and then tries to inline the further simplified functions. Some simple loop
diff --git a/polly/docs/doxygen.cfg.in b/polly/docs/doxygen.cfg.in
index befe6e138ec272..a553fc8154fb11 100644
--- a/polly/docs/doxygen.cfg.in
+++ b/polly/docs/doxygen.cfg.in
@@ -1066,7 +1066,7 @@ HTML_STYLESHEET =
# defined cascading style sheet that is included after the standard style sheets
# created by doxygen. Using this option one can overrule certain style aspects.
# This is preferred over using HTML_STYLESHEET since it does not replace the
-# standard style sheet and is therefor more robust against future updates.
+# standard style sheet and is therefore more robust against future updates.
# Doxygen will copy the style sheet file to the output directory. For an example
# see the documentation.
# This tag requires that the tag GENERATE_HTML is set to YES.
@@ -1950,7 +1950,7 @@ PREDEFINED =
EXPAND_AS_DEFINED =
# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
-# remove all refrences to function-like macros that are alone on a line, have an
+# remove all references to function-like macros that are alone on a line, have an
# all uppercase name, and do not end with a semicolon. Such function macros are
# typically used for boiler-plate code, and will confuse the parser if not
# removed.
diff --git a/polly/include/polly/CodeGen/RuntimeDebugBuilder.h b/polly/include/polly/CodeGen/RuntimeDebugBuilder.h
index 46193f9ccaf2c9..2e5349d9edd6e7 100644
--- a/polly/include/polly/CodeGen/RuntimeDebugBuilder.h
+++ b/polly/include/polly/CodeGen/RuntimeDebugBuilder.h
@@ -118,7 +118,7 @@ struct RuntimeDebugBuilder {
/// Call fflush
///
- /// @parma Builder The builder used to insert the code.
+ /// @param Builder The builder used to insert the code.
static void createFlush(PollyIRBuilder &Builder);
};
} // namespace polly
diff --git a/polly/include/polly/DependenceInfo.h b/polly/include/polly/DependenceInfo.h
index 7526a294c6bafe..d562ad80592f24 100644
--- a/polly/include/polly/DependenceInfo.h
+++ b/polly/include/polly/DependenceInfo.h
@@ -211,7 +211,7 @@ struct DependenceAnalysis final : public AnalysisInfoMixin<DependenceAnalysis> {
/// Invalidate the dependence information and recompute it when needed
/// again.
- /// May be required when the underlaying Scop was changed in a way that
+ /// May be required when the underlying Scop was changed in a way that
/// would add new dependencies (e.g. between new statement instances
/// insierted into the SCoP) or intentionally breaks existing ones. It is
/// not required when updating the schedule that conforms the existing
@@ -251,7 +251,7 @@ class DependenceInfo final : public ScopPass {
const Dependences &recomputeDependences(Dependences::AnalysisLevel Level);
/// Invalidate the dependence information and recompute it when needed again.
- /// May be required when the underlaying Scop was changed in a way that would
+ /// May be required when the underlying Scop was changed in a way that would
/// add new dependencies (e.g. between new statement instances insierted into
/// the SCoP) or intentionally breaks existing ones. It is not required when
/// updating the schedule that conforms the existing dependencies.
diff --git a/polly/include/polly/ScopInfo.h b/polly/include/polly/ScopInfo.h
index 974de817e72db8..ab0f81dd2836d7 100644
--- a/polly/include/polly/ScopInfo.h
+++ b/polly/include/polly/ScopInfo.h
@@ -1494,7 +1494,7 @@ class ScopStmt final {
/// @param Access The access to add.
/// @param Prepend If true, will add @p Access before all other instructions
/// (instead of appending it).
- void addAccess(MemoryAccess *Access, bool Preprend = false);
+ void addAccess(MemoryAccess *Access, bool Prepend = false);
/// Remove a MemoryAccess from this statement.
///
diff --git a/polly/include/polly/Support/SCEVAffinator.h b/polly/include/polly/Support/SCEVAffinator.h
index 63a341a01309bc..faacfd8ba0e69d 100644
--- a/polly/include/polly/Support/SCEVAffinator.h
+++ b/polly/include/polly/Support/SCEVAffinator.h
@@ -50,7 +50,7 @@ class SCEVAffinator final : public llvm::SCEVVisitor<SCEVAffinator, PWACtx> {
/// Check an <nsw> AddRec for the loop @p L is cached.
bool hasNSWAddRecForLoop(llvm::Loop *L) const;
- /// Return the LoopInfo used by thi object.
+ /// Return the LoopInfo used by the object.
llvm::LoopInfo *getLI() const { return &LI; }
private:
diff --git a/polly/include/polly/Support/ScopHelper.h b/polly/include/polly/Support/ScopHelper.h
index 13852ecb18ee7c..7818f67b505fd9 100644
--- a/polly/include/polly/Support/ScopHelper.h
+++ b/polly/include/polly/Support/ScopHelper.h
@@ -83,7 +83,7 @@ using RecordedAssumptionsTy = llvm::SmallVector<Assumption, 8>;
///
/// This function will add the assumption to the RecordedAssumptions. This
/// collection will be added (@see addAssumption) to the assumed context once
-/// all paramaters are known and the context is fully built.
+/// all parameters are known and the context is fully built.
///
/// @param RecordedAssumption container which keeps all recorded assumptions.
/// @param Kind The assumption kind describing the underlying cause.
@@ -132,7 +132,7 @@ using BoxedLoopsSetTy = llvm::SetVector<const llvm::Loop *>;
/// isNull(), isInstruction(), isLoad(), isStore(), ..., isMemTransferInst(),
/// operator bool(), operator!()
///
-/// The functions isa, cast, cast_or_null, dyn_cast are modeled te resemble
+/// The functions isa, cast, cast_or_null, dyn_cast are modeled to resemble
/// those from llvm/Support/Casting.h. Partial template function specialization
/// is currently not supported in C++ such that those cannot be used directly.
/// (llvm::isa could, but then llvm:cast etc. would not have the expected
diff --git a/polly/lib/Analysis/ScopBuilder.cpp b/polly/lib/Analysis/ScopBuilder.cpp
index 82fa9e11550f2f..76c9b4775784e2 100644
--- a/polly/lib/Analysis/ScopBuilder.cpp
+++ b/polly/lib/Analysis/ScopBuilder.cpp
@@ -2522,7 +2522,7 @@ combineReductionType(MemoryAccess::ReductionType RT0,
return MemoryAccess::RT_NONE;
}
-/// True if @p AllAccs intersects with @p MemAccs execpt @p LoadMA and @p
+/// True if @p AllAccs intersects with @p MemAccs except @p LoadMA and @p
/// StoreMA
bool hasIntersectingAccesses(isl::set AllAccs, MemoryAccess *LoadMA,
MemoryAccess *StoreMA, isl::set Domain,
diff --git a/polly/lib/Analysis/ScopDetectionDiagnostic.cpp b/polly/lib/Analysis/ScopDetectionDiagnostic.cpp
index 14a6f074454f76..f810d543f1ac0d 100644
--- a/polly/lib/Analysis/ScopDetectionDiagnostic.cpp
+++ b/polly/lib/Analysis/ScopDetectionDiagnostic.cpp
@@ -71,7 +71,7 @@ static Statistic RejectStatistics[] = {
SCOP_STAT(LoopOnlySomeLatches, "Not all loop latches in scop"),
SCOP_STAT(FuncCall, "Function call with side effects"),
SCOP_STAT(NonSimpleMemoryAccess,
- "Compilated access semantics (volatile or atomic)"),
+ "Complicated access semantics (volatile or atomic)"),
SCOP_STAT(Alias, "Base address aliasing"),
SCOP_STAT(Other, ""),
SCOP_STAT(IntToPtr, "Integer to pointer conversions"),
diff --git a/polly/lib/CodeGen/IslNodeBuilder.cpp b/polly/lib/CodeGen/IslNodeBuilder.cpp
index 739bd63a5eb805..bbe7bc42cd8338 100644
--- a/polly/lib/CodeGen/IslNodeBuilder.cpp
+++ b/polly/lib/CodeGen/IslNodeBuilder.cpp
@@ -1159,7 +1159,7 @@ bool IslNodeBuilder::preloadInvariantEquivClass(
// For an equivalence class of invariant loads we pre-load the representing
// element with the unified execution context. However, we have to map all
// elements of the class to the one preloaded load as they are referenced
- // during the code generation and therefor need to be mapped.
+ // during the code generation and therefore need to be mapped.
const MemoryAccessList &MAs = IAClass.InvariantAccesses;
if (MAs.empty())
return true;
diff --git a/polly/lib/CodeGen/Utils.cpp b/polly/lib/CodeGen/Utils.cpp
index 3afb2e580889ba..e95705616022fe 100644
--- a/polly/lib/CodeGen/Utils.cpp
+++ b/polly/lib/CodeGen/Utils.cpp
@@ -46,7 +46,7 @@ static BasicBlock *splitEdge(BasicBlock *Prev, BasicBlock *Succ,
// llvm::SplitCriticalEdge is more efficient than
// llvm::SplitBlockPredecessors, which is more general. In the future we might
// either modify llvm::SplitCriticalEdge to allow skipping the critical edge
- // check; or Copy&Pase it here.
+ // check; or Copy&Paste it here.
BasicBlock *MiddleBlock = SplitBlockPredecessors(
Succ, ArrayRef<BasicBlock *>(Prev), Suffix, DT, LI);
diff --git a/polly/lib/Support/SCEVAffinator.cpp b/polly/lib/Support/SCEVAffinator.cpp
index ce4467f082ba43..87e0fc056ca4b5 100644
--- a/polly/lib/Support/SCEVAffinator.cpp
+++ b/polly/lib/Support/SCEVAffinator.cpp
@@ -502,7 +502,7 @@ PWACtx SCEVAffinator::visitUDivExpr(const SCEVUDivExpr *Expr) {
}
// TODO: One can represent the dividend as piece-wise function to be more
- // precise but therefor a heuristic is needed.
+ // precise but therefore a heuristic is needed.
// Assume a non-negative dividend.
takeNonNegativeAssumption(DividendPWAC, RecordedAssumptions);
diff --git a/polly/lib/Support/ScopHelper.cpp b/polly/lib/Support/ScopHelper.cpp
index bece390d31dc62..fbf891be0a1e7f 100644
--- a/polly/lib/Support/ScopHelper.cpp
+++ b/polly/lib/Support/ScopHelper.cpp
@@ -456,7 +456,7 @@ struct ScopExpander final : SCEVVisitor<ScopExpander, const SCEV *> {
// FIXME: This emits a SCEV for GenSE (since GenLRepl will refer to the
// induction variable of a generated loop), so we should not use SCEVVisitor
- // with it. Howver, it still contains references to the SCoP region.
+ // with it. However, it still contains references to the SCoP region.
return visit(Evaluated);
}
///}
diff --git a/polly/lib/Transform/DeLICM.cpp b/polly/lib/Transform/DeLICM.cpp
index b7e464e6739c67..9a9768afe113e9 100644
--- a/polly/lib/Transform/DeLICM.cpp
+++ b/polly/lib/Transform/DeLICM.cpp
@@ -1290,7 +1290,7 @@ class DeLICMImpl final : public ZoneAlgorithm {
continue;
}
- // Check for more than one element acces per statement instance.
+ // Check for more than one element access per statement instance.
// Currently we expect write accesses to be functional, eg. disallow
//
// { Stmt[0] -> [i] : 0 <= i < 2 }
diff --git a/polly/lib/Transform/ManualOptimizer.cpp b/polly/lib/Transform/ManualOptimizer.cpp
index 0e330f207fbc48..98ab9819e5b1f6 100644
--- a/polly/lib/Transform/ManualOptimizer.cpp
+++ b/polly/lib/Transform/ManualOptimizer.cpp
@@ -149,7 +149,7 @@ class SearchTransformVisitor final
// transformed in innermost-first order.
isl::schedule Result;
- /// Check wether a schedule after a transformation is legal. Return the old
+ /// Check whether a schedule after a transformation is legal. Return the old
/// schedule without the transformation.
isl::schedule
checkDependencyViolation(llvm::MDNode *LoopMD, llvm::Value *CodeRegion,
diff --git a/polly/lib/Transform/MatmulOptimizer.cpp b/polly/lib/Transform/MatmulOptimizer.cpp
index ff1683b2d63c59..01d431a97e7dbd 100644
--- a/polly/lib/Transform/MatmulOptimizer.cpp
+++ b/polly/lib/Transform/MatmulOptimizer.cpp
@@ -1759,7 +1759,7 @@ static bool isTCPattern(isl::schedule_node Node, const Dependences *D,
//
// For example, this covers the matrix multiplication pattern after a full
// run of -polly-optree and -polly-delicm, where the write access is not
- // through the original memory access, but trough a PHI node that was
+ // through the original memory access, but through a PHI node that was
// delicmed. Subsequently, such band nodes will be replaced by a single band
// node.
//
diff --git a/polly/lib/Transform/ScheduleOptimizer.cpp b/polly/lib/Transform/ScheduleOptimizer.cpp
index 55d51982d90e76..070700a64a168f 100644
--- a/polly/lib/Transform/ScheduleOptimizer.cpp
+++ b/polly/lib/Transform/ScheduleOptimizer.cpp
@@ -771,7 +771,7 @@ static void runIslScheduleOptimizer(
return;
}
- // Apply ISL's algorithm only if not overriden by the user. Note that
+ // Apply ISL's algorithm only if not overridden by the user. Note that
// post-rescheduling optimizations (tiling, pattern-based, prevectorization)
// rely on the coincidence/permutable annotations on schedule tree bands that
// are added by the rescheduling analyzer. Therefore, disabling the
diff --git a/polly/lib/Transform/ScheduleTreeTransform.cpp b/polly/lib/Transform/ScheduleTreeTransform.cpp
index f0684de825d271..3f3630027e6e33 100644
--- a/polly/lib/Transform/ScheduleTreeTransform.cpp
+++ b/polly/lib/Transform/ScheduleTreeTransform.cpp
@@ -572,13 +572,13 @@ class BandCollapseRewriter final
isl::schedule_node_band Band = RootBand;
isl::ctx Ctx = Band.ctx();
- // Do not merge permutable band to avoid loosing the permutability property.
+ // Do not merge permutable band to avoid losing the permutability property.
// Cannot collapse even two permutable loops, they might be permutable
// individually, but not necassarily across.
if (unsignedFromIslSize(Band.n_member()) > 1u && Band.permutable())
return getBase().visitBand(Band);
- // Find collapsable bands.
+ // Find collapsible bands.
SmallVector<isl::schedule_node_band> Nest;
int NumTotalLoops = 0;
isl::schedule_node Body;
@@ -884,10 +884,10 @@ class GreedyFusionRewriter final
collectPotentiallyFusableBands(Child, Bands, Child);
}
- // Direct children that had at least one of its decendants fused.
+ // Direct children that had at least one of its descendants fused.
SmallDenseSet<isl_schedule_node *, 4> ChangedDirectChildren;
- // Fuse neigboring bands until reaching the end of candidates.
+ // Fuse neighboring bands until reaching the end of candidates.
int i = 0;
while (i + 1 < (int)Bands.size()) {
isl::schedule Fused =
diff --git a/polly/test/CodeGen/LoopParallelMD/do_not_mutate_debug_info.ll b/polly/test/CodeGen/LoopParallelMD/do_not_mutate_debug_info.ll
index 28531244421d11..eb7de01ba862c8 100644
--- a/polly/test/CodeGen/LoopParallelMD/do_not_mutate_debug_info.ll
+++ b/polly/test/CodeGen/LoopParallelMD/do_not_mutate_debug_info.ll
@@ -1,4 +1,4 @@
-; This test checks that we do not accidently mutate the debug info when
+; This test checks that we do not accidentally mutate the debug info when
; inserting loop parallel metadata.
; RUN: opt %loadNPMPolly < %s -S -polly -passes=polly-codegen -polly-ast-detect-parallel | FileCheck %s
; CHECK-NOT: !7 = !{!7}
diff --git a/polly/test/CodeGen/multiple-codegens.ll b/polly/test/CodeGen/multiple-codegens.ll
index 2fa974e66df506..a63f8a615ff9e5 100644
--- a/polly/test/CodeGen/multiple-codegens.ll
+++ b/polly/test/CodeGen/multiple-codegens.ll
@@ -6,7 +6,7 @@
; RegionPassManager. -polly-codegen must not reuse the -polly-ast analysis the
; was created for the first -polly-scops pass.
; The current solution is that only the first -polly-codegen is allowed to
-; generate code, the second detects it is re-using an IslAst that belongs to a
+; generate code, the second detects it is reusing an IslAst that belongs to a
;
diff erent ScopInfo.
;
; int a, b, c;
diff --git a/polly/test/CodeGen/multiple-scops-in-a-row.ll b/polly/test/CodeGen/multiple-scops-in-a-row.ll
index b81ba04e364638..effae223c152ae 100644
--- a/polly/test/CodeGen/multiple-scops-in-a-row.ll
+++ b/polly/test/CodeGen/multiple-scops-in-a-row.ll
@@ -6,7 +6,7 @@
; We explicitly check here that the second scop is not code generated. Later
; improvements may make this possible (e.g., Polly gaining support for
-; parameteric conditional expressions or a changed code generation order).
+; parametric conditional expressions or a changed code generation order).
; However, in case this happens, we want to ensure this test case is been
; reasoned about and updated accordingly.
diff --git a/polly/test/CodeGen/reduction_2.ll b/polly/test/CodeGen/reduction_2.ll
index 4aa306775e781c..060a1866870e4b 100644
--- a/polly/test/CodeGen/reduction_2.ll
+++ b/polly/test/CodeGen/reduction_2.ll
@@ -88,7 +88,7 @@ if.end: ; preds = %if.then, %for.end
declare void @llvm.memset.p0.i64(ptr nocapture, i8, i64, i32, i1) nounwind
; This is a negative test. We can prove that RED[0] in the conditional after
-; the loop is dereferencable and consequently expand the SCoP from the
+; the loop is dereferenceable and consequently expand the SCoP from the
; loop to include the conditional. However, during SCoP generation we realize
; that, while RED[0] is invariant, it is written to as part of the same scop
; and can consequently not be hoisted. Hence, we invalidate the scop.
diff --git a/polly/test/CodeGen/scalar-store-from-same-bb.ll b/polly/test/CodeGen/scalar-store-from-same-bb.ll
index 3f232da37e4cd1..0c1164b245a43f 100644
--- a/polly/test/CodeGen/scalar-store-from-same-bb.ll
+++ b/polly/test/CodeGen/scalar-store-from-same-bb.ll
@@ -2,7 +2,7 @@
; RUN: -passes=polly-codegen -S < %s | FileCheck %s
; This test ensures that the expression N + 1 that is stored in the phi-node
-; alloca, is directly computed and not incorrectly transfered through memory.
+; alloca, is directly computed and not incorrectly transferred through memory.
; CHECK: store i64 [[REG:%.*]], ptr %res.phiops
; CHECK: [[REG]] = add i64 %N, 1
diff --git a/polly/test/CodeGen/test-invalid-operands-for-select.ll b/polly/test/CodeGen/test-invalid-operands-for-select.ll
index 9f5013cf1bb16a..fdc98fbb4d9e77 100644
--- a/polly/test/CodeGen/test-invalid-operands-for-select.ll
+++ b/polly/test/CodeGen/test-invalid-operands-for-select.ll
@@ -2,7 +2,7 @@
;
; Check that we do not crash as described here: http://llvm.org/PR21167
;
-; In case the pieceweise affine function used to create an isl_ast_expr
+; In case the piecewise affine function used to create an isl_ast_expr
; had empty cases (e.g., with contradicting constraints on the
; parameters), it was possible that the condition of the isl_ast_expr
; select was not a comparison but a constant (thus of type i64).
diff --git a/polly/test/DeLICM/load-in-cond-inf-loop.ll b/polly/test/DeLICM/load-in-cond-inf-loop.ll
index f6e23110aa6f17..a78a4691bb0d54 100644
--- a/polly/test/DeLICM/load-in-cond-inf-loop.ll
+++ b/polly/test/DeLICM/load-in-cond-inf-loop.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=print<polly-delicm>' -disable-output < %s | FileCheck %s
-; When %b is 0, %for.body13 is an infite loop. In this case the loaded
+; When %b is 0, %for.body13 is an infinite loop. In this case the loaded
; value %1 is not used anywhere.
; This is a problem when DeLICM tries to map %1 to %arrayidx16 because
; %1 has no corresponding when %b == 0 and therefore hat no location
diff --git a/polly/test/DeLICM/pr41656.ll b/polly/test/DeLICM/pr41656.ll
index d7cfde35a6e80a..2a92503809a246 100644
--- a/polly/test/DeLICM/pr41656.ll
+++ b/polly/test/DeLICM/pr41656.ll
@@ -4,7 +4,7 @@
;
; This test case has an InvalidContext such that part of the predecessors
; of for.body.us.i lie within the invalid context. This causes a
-; consistency check withing the invalid context of PR41656 to fail.
+; consistency check within the invalid context of PR41656 to fail.
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
diff --git a/polly/test/DeLICM/pr48783.ll b/polly/test/DeLICM/pr48783.ll
index e3c3eb6a19ccfb..deba8bfcc5daf6 100644
--- a/polly/test/DeLICM/pr48783.ll
+++ b/polly/test/DeLICM/pr48783.ll
@@ -4,7 +4,7 @@
;
; PHI predecessors of statement instances can only be reliably derived in defined behaviour situations. In this case, the inner loop's counter would overflow when its upper bound (%call24) is lower than its lower bound (2). However, due to the nsw flag, this would be undefined behavior and therefore not added to any runtime-check context, but to the defined-behaviour context.
;
-; Dereived from test case pr41656.ll
+; Derived from test case pr41656.ll
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
diff --git a/polly/test/DeLICM/reject_outofquota.ll b/polly/test/DeLICM/reject_outofquota.ll
index 820679a5349d2e..9bc6bf1f23733e 100644
--- a/polly/test/DeLICM/reject_outofquota.ll
+++ b/polly/test/DeLICM/reject_outofquota.ll
@@ -66,7 +66,7 @@ return:
; CHECK: maximal number of operations exceeded during zone analysis
; Check that even if the quota was exceeded in DeLICM, DependenceInfo is still
-; successfull since it uses a
diff erent operations counter.
+; successful since it uses a
diff erent operations counter.
;
; DEP: RAW dependences:
; DEP-NOT: n/a
diff --git a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_2.ll b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_2.ll
index 46b2559c6e0b1b..d7f9029fd347a8 100644
--- a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_2.ll
+++ b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_2.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=polly-import-jscop,print<polly-ast>' -polly-ast-detect-parallel -disable-output < %s | FileCheck %s
;
-; Verify that the outer dimension doesnt't carry reduction dependences
+; Verify that the outer dimension doesn't carry reduction dependences
;
; CHECK-NOT:#pragma known-parallel reduction
; CHECK: #pragma known-parallel
diff --git a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_3.ll b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_3.ll
index 6f40ee90fef53e..f18060a2e20a8d 100644
--- a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_3.ll
+++ b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_3.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=polly-import-jscop,print<polly-ast>' -polly-ast-detect-parallel -disable-output < %s | FileCheck %s
;
-; Verify that the outer dimension doesnt't carry reduction dependences
+; Verify that the outer dimension doesn't carry reduction dependences
;
; CHECK-NOT:#pragma known-parallel reduction
; CHECK: #pragma known-parallel
diff --git a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_4.ll b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_4.ll
index f82b9569a88b15..8e2a590c5f57c4 100644
--- a/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_4.ll
+++ b/polly/test/IstAstInfo/reduction_modulo_schedule_multiple_dimensions_4.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=polly-import-jscop,print<polly-ast>' -polly-ast-detect-parallel -disable-output < %s | FileCheck %s
;
-; Verify that the outer dimension doesnt't carry reduction dependences
+; Verify that the outer dimension doesn't carry reduction dependences
;
; CHECK-NOT:#pragma known-parallel reduction
; CHECK: #pragma known-parallel
diff --git a/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm.ll b/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm.ll
index 8228a5c08f5984..6e9ade869ec6cb 100644
--- a/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm.ll
+++ b/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm.ll
@@ -7,7 +7,7 @@
; Check that the pattern matching detects the matrix multiplication pattern
; after a full run of -polly-optree and -polly-delicm, where the write access
-; is not through the original memory access, but trough a PHI node that was
+; is not through the original memory access, but through a PHI node that was
; delicmed. This test covers the polybench 2mm and 3mm cases.
;
; This test case generates the following schedule, which contains filters:
diff --git a/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm_2.ll b/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm_2.ll
index 4bda7584f59627..4ef0605a0ba756 100644
--- a/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm_2.ll
+++ b/polly/test/ScheduleOptimizer/pattern-matching-based-opts-after-delicm_2.ll
@@ -5,7 +5,7 @@
;
; Check that the pattern matching detects the tensor contraction pattern
; after a full run of -polly-delicm. This test case generates the following
-; schedule, which contans two band nodes. Without DeLICM two statement are
+; schedule, which contains two band nodes. Without DeLICM two statement are
; generated.
;
; domain: "{ Stmt5[i0, i1, i2, i3, i4, i5] : 0 <= i0 <= 31 and 0 <= i1 <= 31 and
diff --git a/polly/test/ScopDetect/scev_remove_max.ll b/polly/test/ScopDetect/scev_remove_max.ll
index caf55bf87a6671..f76c832ff08f5b 100644
--- a/polly/test/ScopDetect/scev_remove_max.ll
+++ b/polly/test/ScopDetect/scev_remove_max.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=print<polly-detect>' < %s
-; This test case helps to determine wether SCEVRemoveMax::remove produces
+; This test case helps to determine whether SCEVRemoveMax::remove produces
; an infinite loop and a segmentation fault, if it processes, for example,
; '((-1 + (-1 * %b1)) umax {(-1 + (-1 * %yStart)),+,-1}<%.preheader>)'.
;
diff --git a/polly/test/ScopDetectionDiagnostics/ReportLoopHasNoExit.ll b/polly/test/ScopDetectionDiagnostics/ReportLoopHasNoExit.ll
index 92028093f70bbe..3743bfae9fcaf1 100644
--- a/polly/test/ScopDetectionDiagnostics/ReportLoopHasNoExit.ll
+++ b/polly/test/ScopDetectionDiagnostics/ReportLoopHasNoExit.ll
@@ -1,7 +1,7 @@
; XFAIL: *
; The test case stopped making sense after r310940 that added infinite loops to
-; the PostDominatorTree. Infinite loops are postdominated ony by the virtual
+; the PostDominatorTree. Infinite loops are postdominated only by the virtual
; root, which causes them not to appear in regions in ScopDetection anymore.
; RUN: opt %loadNPMPolly -pass-remarks-missed="polly-detect" -polly-allow-nonaffine-loops '-passes=print<polly-detect>' -disable-output < %s 2>&1 | FileCheck %s
diff --git a/polly/test/ScopInfo/NonAffine/non_affine_loop_used_later.ll b/polly/test/ScopInfo/NonAffine/non_affine_loop_used_later.ll
index 79b61eca258f2f..63ff354d7e5f70 100644
--- a/polly/test/ScopInfo/NonAffine/non_affine_loop_used_later.ll
+++ b/polly/test/ScopInfo/NonAffine/non_affine_loop_used_later.ll
@@ -1,7 +1,7 @@
; RUN: opt %loadNPMPolly -polly-allow-nonaffine -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops '-passes=print<polly-detect>,print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s
; RUN: opt %loadNPMPolly -polly-allow-nonaffine -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops -polly-unprofitable-scalar-accs=true -polly-process-unprofitable=false '-passes=print<polly-detect>,print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s --check-prefix=PROFIT
;
-; Verify that we over approximate the read acces of A[j] in the last statement as j is
+; Verify that we over approximate the read access of A[j] in the last statement as j is
; computed in a non-affine loop we do not model.
;
; CHECK: Function: f
diff --git a/polly/test/ScopInfo/allow-all-parameters-dereferencable.ll b/polly/test/ScopInfo/allow-all-parameters-dereferencable.ll
index cb06e352da658e..70c3c56fb31128 100644
--- a/polly/test/ScopInfo/allow-all-parameters-dereferencable.ll
+++ b/polly/test/ScopInfo/allow-all-parameters-dereferencable.ll
@@ -28,7 +28,7 @@
; CODE-RTC-NEXT: br i1 %{{[a-zA-Z0-9\.]*}}, label %polly.preload.exec, label %polly.preload.merge
; Check that we don't generate a runtime check because we treat all
-; parameters as dereferencable.
+; parameters as dereferenceable.
; CODE-NOT: polly.preload.cond: ; preds = %polly.preload.begin
; CODE-NOT: br i1 %{{r1:[a-zA-Z0-9]*}}, label %polly.preload.exec, label %polly.preload.merge
diff --git a/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-1.ll b/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-1.ll
index a473ef30376c1e..e3292b4e4aefac 100644
--- a/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-1.ll
+++ b/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-1.ll
@@ -1,7 +1,7 @@
; RUN: opt %loadNPMPolly '-passes=print<polly-function-scops>' -polly-invariant-load-hoisting=true -disable-output < %s 2>&1 | FileCheck %s
;
; Verify that we only have one parameter and one invariant load for all
-; three loads that occure in the region but actually access the same
+; three loads that occur in the region but actually access the same
; location. Also check that the execution context is the most generic
; one, e.g., here the universal set.
;
diff --git a/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-2.ll b/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-2.ll
index 66a0bc631b1dca..d69438de5817f7 100644
--- a/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-2.ll
+++ b/polly/test/ScopInfo/invariant_same_loop_bound_multiple_times-2.ll
@@ -1,7 +1,7 @@
; RUN: opt %loadNPMPolly '-passes=print<polly-function-scops>' -polly-invariant-load-hoisting=true -disable-output < %s 2>&1 | FileCheck %s
;
; Verify that we only have one parameter and one invariant load for all
-; three loads that occure in the region but actually access the same
+; three loads that occur in the region but actually access the same
; location. Also check that the execution context is the most generic
; one, e.g., here the universal set.
;
diff --git a/polly/test/ScopInfo/multidim_gep_pointercast2.ll b/polly/test/ScopInfo/multidim_gep_pointercast2.ll
index b31a0d0262db98..9daae4b1ce3db2 100644
--- a/polly/test/ScopInfo/multidim_gep_pointercast2.ll
+++ b/polly/test/ScopInfo/multidim_gep_pointercast2.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadNPMPolly '-passes=print<polly-function-scops>' -disable-output < %s 2>&1 | FileCheck %s
;
-; Verfy that we do not use the GetElementPtr information to delinearize A
+; Verify that we do not use the GetElementPtr information to delinearize A
; because of the cast in-between. Use the single-dimensional modeling instead.
;
; void f(short A[][2]) {
diff --git a/polly/test/ScopInfo/multidim_many_references.ll b/polly/test/ScopInfo/multidim_many_references.ll
index 3801fda4923c35..f0f1c2b1f39db5 100644
--- a/polly/test/ScopInfo/multidim_many_references.ll
+++ b/polly/test/ScopInfo/multidim_many_references.ll
@@ -28,7 +28,7 @@ target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
; This test case verifies that the construction of the assumed context finishes
; successfully. Depending on how constrained are accumulated in the assumed
; context, this test case can take even for a smaller number of arrays over a
-; minute to complete. With the unrolling choosen in this test, an inefficient
+; minute to complete. With the unrolling chosen in this test, an inefficient
; formulation of the assumption tracking cause LLVM to crash due to excessive
; memory usage due to an overly large number of disjuncts being formed.
diff --git a/polly/test/ScopInfo/scalar_to_array.ll b/polly/test/ScopInfo/scalar_to_array.ll
index d64f1696c30b66..3f61d0d7230464 100644
--- a/polly/test/ScopInfo/scalar_to_array.ll
+++ b/polly/test/ScopInfo/scalar_to_array.ll
@@ -109,7 +109,7 @@ return: ; preds = %for.cond
; It is not possible to have a scop which accesses a scalar element that is
; a global variable. All global variables are pointers containing possibly
; a single element. Hence they do not need to be handled anyways.
-; Please note that this is still required when scalar to array rewritting is
+; Please note that this is still required when scalar to array rewriting is
; disabled.
; CHECK-LABEL: Function: use_after_scop
diff --git a/polly/test/ScopInfo/zero_ext_of_truncate.ll b/polly/test/ScopInfo/zero_ext_of_truncate.ll
index bd3749b6aa74f4..cbe4af05169f85 100644
--- a/polly/test/ScopInfo/zero_ext_of_truncate.ll
+++ b/polly/test/ScopInfo/zero_ext_of_truncate.ll
@@ -8,7 +8,7 @@
; }
; }
;
-; FIXME: The truncated value should be a paramter.
+; FIXME: The truncated value should be a parameter.
; CHECK: Assumed Context:
; CHECK-NEXT: [N, tmp, M] -> { : }
; CHECK-NEXT: Invalid Context:
diff --git a/polly/test/create_ll.sh b/polly/test/create_ll.sh
index c44d8ed81f2b52..1c03d9a015e01f 100755
--- a/polly/test/create_ll.sh
+++ b/polly/test/create_ll.sh
@@ -12,7 +12,7 @@ opt -correlated-propagation -mem2reg -instcombine -loop-simplify -indvars \
-instnamer ${LLFILE} -S -o ${LLFILE_TMP}
# Insert a header into the new testcase containing a sample RUN line a FIXME and
-# an XFAIL. Then insert the formated C code and finally the LLVM-IR without
+# an XFAIL. Then insert the formatted C code and finally the LLVM-IR without
# attributes, the module ID or the target triple.
echo '; RUN: opt %loadPolly -S < %s | FileCheck %s' > ${LLFILE}
echo ';' >> ${LLFILE}
diff --git a/polly/utils/pyscop/isl.py b/polly/utils/pyscop/isl.py
index c06b7bca28042b..c5d92ae9812de7 100644
--- a/polly/utils/pyscop/isl.py
+++ b/polly/utils/pyscop/isl.py
@@ -72,7 +72,7 @@ def initialize_isl_methods(self):
if hasattr(self.__class__, "initialized"):
return
- self.__class__.initalized = True
+ self.__class__.initialized = True
self.get_isl_method("read_from_str").argtypes = [Context, c_char_p, c_int]
self.get_isl_method("copy").argtypes = [self.__class__]
self.get_isl_method("copy").restype = c_int
@@ -204,7 +204,7 @@ def initialize_isl_methods(self):
if hasattr(self.__class__, "initialized"):
return
- self.__class__.initalized = True
+ self.__class__.initialized = True
self.get_isl_method("copy").argtypes = [self.__class__]
self.get_isl_method("copy").restype = c_int
self.get_isl_method("free").argtypes = [self.__class__]
diff --git a/polly/www/changelog.html b/polly/www/changelog.html
index 8c789cd31f5306..6ba9ba47230585 100644
--- a/polly/www/changelog.html
+++ b/polly/www/changelog.html
@@ -40,7 +40,7 @@ <h2> 3.6</h2>
<li>Run-time alias checks</li>
<li>Computation of no-alias information for later LLVM optimizations
(vectorizer, LICM, ...)</li>
-<li>Support for multi-dimensional arrays of parameteric size (still tested)</li>
+<li>Support for multi-dimensional arrays of parametric size (still tested)</li>
<li>New assumption tracking framework</li>
<ul>
<li>Accesses to multi-dimensional arrays of fixed size are within bounds</li>
diff --git a/polly/www/get_started.html b/polly/www/get_started.html
index 70e8a6beca65cd..d5f2b0dff9b3ea 100644
--- a/polly/www/get_started.html
+++ b/polly/www/get_started.html
@@ -15,7 +15,7 @@
<div id="content">
<h1>Building and Installing Polly</h1>
-You can build Polly with <a href="https://cmake.org/">cmake</a> and your preferred geneator (e.g. Ninja, make, Visual Studio, etc.).
+You can build Polly with <a href="https://cmake.org/">cmake</a> and your preferred generator (e.g. Ninja, make, Visual Studio, etc.).
<h3 id="source">Get the code</h3>
diff --git a/polly/www/index.html b/polly/www/index.html
index 87642324eadb47..6adc43ec3c4aa3 100644
--- a/polly/www/index.html
+++ b/polly/www/index.html
@@ -90,7 +90,7 @@ <h4>AST Generation Paper published in TOPLAS</h4>
while issues like the generation of the correct loop structure and loop
bounds will be taken care of by our AST generator.
<li><b>Polyhedral unrolling:</b> We discuss techniques that allow the
- unrolling of non-trivial loops in the context of parameteric loop bounds,
+ unrolling of non-trivial loops in the context of parametric loop bounds,
complex tile shapes and conditionally executed statements. Such unrolling
support enables the generation of predicated code e.g. in the context of
GPGPU computing.
@@ -110,7 +110,7 @@ <h4>AST Generation Paper published in TOPLAS</h4>
<a href="https://www.grosser.es#pub-polyhedral-AST-generation">
<em>Polyhedral AST generation is more than scanning polyhedra</em></a><br />
Tobias Grosser, Sven Verdoolaege, Albert Cohen<br />
- ACM Transations on Programming Languages and Systems (TOPLAS), 37(4),
+ ACM Transactions on Programming Languages and Systems (TOPLAS), 37(4),
July 2015
<br>
@@ -356,13 +356,13 @@ <h4>Experimental support for the <b>new isl code generator</b></h4>
</td>
</tr>
<tr>
- <td><p>Februar</p></td>
+ <td><p>February</p></td>
<td><p>pollycc - a script to automatically compile with
polyhedral optimizations </p></td>
</tr>
<tr>
- <td><p> Januar</p></td>
+ <td><p> January</p></td>
<td><p> Basic OpenMP support, Alias analysis integration,
Pluto/POCC support </p></td>
</tr>
diff --git a/polly/www/projects.html b/polly/www/projects.html
index 915c2b93921a0a..ea7e137f031eac 100644
--- a/polly/www/projects.html
+++ b/polly/www/projects.html
@@ -42,7 +42,7 @@ <h3>Integrate Polly with the LLVM vectorizers</h3>
to bring features of Polly to standard -O3 optimizations.
<h3>Register tiling to obtain fast BLAS kernels with Polly</h3>
- Even though Polly is already able to speep up compute kernels significantly,
+ Even though Polly is already able to speed up compute kernels significantly,
when comparing to the best BLAS routines we still are at least one order of
magnitude off. In this project you will investigate what is needed to close
this performance gap. Earlier investigations have shown that register tiling
diff --git a/polly/www/publications.html b/polly/www/publications.html
index c256c8d1514755..4890568fe6d2c0 100644
--- a/polly/www/publications.html
+++ b/polly/www/publications.html
@@ -60,7 +60,7 @@ <h3> 2015 </h3>
<ul>
<li><em>Polyhedral AST generation is more than scanning polyhedra</em><br />
Tobias Grosser, Sven Verdoolaege, Albert Cohen<br />
- ACM Transations on Programming Languages and Systems (TOPLAS), 37(4), July
+ ACM Transactions on Programming Languages and Systems (TOPLAS), 37(4), July
2015<br />
<a href="https://www.grosser.es#pub-polyhedral-AST-generation">Paper</a>
</li>
More information about the llvm-commits
mailing list