nicolas/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix some typos in comments

Browse Source 
llvm-svn: 291247
This commit is contained in:
Tobias Grosser
2017-01-06 17:30:34 +00:00
parent 31dbb0391d
commit cdbe5c9d6c
2 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
polly/lib/Analysis/ScopBuilder.cpp
View File

@@ -509,7 +509,7 @@ MemoryAccess *ScopBuilder::addMemoryAccess(
} }
// Non-affine PHI writes do not "happen" at a particular instruction, but // Non-affine PHI writes do not "happen" at a particular instruction, but
// after exiting the statement. Therefore they are guaranteed execute and // after exiting the statement. Therefore they are guaranteed to execute and
// overwrite the old value. // overwrite the old value.
if (Kind == ScopArrayInfo::MK_PHI || Kind == ScopArrayInfo::MK_ExitPHI) if (Kind == ScopArrayInfo::MK_PHI || Kind == ScopArrayInfo::MK_ExitPHI)
isKnownMustAccess = true; isKnownMustAccess = true;

20
polly/lib/Analysis/ScopInfo.cpp
View File

@@ -2037,10 +2037,10 @@ void Scop::realignParams() {
static __isl_give isl_set * static __isl_give isl_set *
simplifyAssumptionContext(__isl_take isl_set *AssumptionContext, simplifyAssumptionContext(__isl_take isl_set *AssumptionContext,
const Scop &S) { const Scop &S) {
// If we modelt all blocks in the SCoP that have side effects we can simplify // If we have modeled all blocks in the SCoP that have side effects we can
// the context with the constraints that are needed for anything to be // simplify the context with the constraints that are needed for anything to
// executed at all. However, if we have error blocks in the SCoP we already // be executed at all. However, if we have error blocks in the SCoP we already
// assumed some parameter combinations cannot occure and removed them from the // assumed some parameter combinations cannot occur and removed them from the
// domains, thus we cannot use the remaining domain to simplify the // domains, thus we cannot use the remaining domain to simplify the
// assumptions. // assumptions.
if (!S.hasErrorBlock()) { if (!S.hasErrorBlock()) {
@@ -2456,7 +2456,7 @@ void Scop::propagateDomainConstraintsToRegionExit(
auto &BoxedLoops = getBoxedLoops(); auto &BoxedLoops = getBoxedLoops();
// Do not propagate the domain if there is a loop backedge inside the region // Do not propagate the domain if there is a loop backedge inside the region
// that would prevent the exit block from beeing executed. // that would prevent the exit block from being executed.
auto *L = BBLoop; auto *L = BBLoop;
while (L && contains(L)) { while (L && contains(L)) {
SmallVector<BasicBlock *, 4> LatchBBs; SmallVector<BasicBlock *, 4> LatchBBs;
@@ -3052,7 +3052,7 @@ bool Scop::buildAliasGroups(AliasAnalysis &AA) {
MinMaxAccessesNonReadOnly); MinMaxAccessesNonReadOnly);
// Bail out if the number of values we need to compare is too large. // Bail out if the number of values we need to compare is too large.
// This is important as the number of comparisions grows quadratically with // This is important as the number of comparisons grows quadratically with
// the number of values we need to compare. // the number of values we need to compare.
if (!Valid || (MinMaxAccessesNonReadOnly.size() + ReadOnlyPairs.size() > if (!Valid || (MinMaxAccessesNonReadOnly.size() + ReadOnlyPairs.size() >
RunTimeChecksMaxArraysPerGroup)) RunTimeChecksMaxArraysPerGroup))
@@ -3330,7 +3330,7 @@ Scop::~Scop() {
isl_set_free(IAClass.ExecutionContext); isl_set_free(IAClass.ExecutionContext);
// Explicitly release all Scop objects and the underlying isl objects before // Explicitly release all Scop objects and the underlying isl objects before
// we relase the isl context. // we release the isl context.
Stmts.clear(); Stmts.clear();
ScopArrayInfoSet.clear(); ScopArrayInfoSet.clear();
ScopArrayInfoMap.clear(); ScopArrayInfoMap.clear();
@@ -3459,7 +3459,7 @@ static bool canAlwaysBeHoisted(MemoryAccess *MA, bool StmtInvalidCtxIsEmpty,
return true; return true;
// Even if the statement is not modeled precisely we can hoist the load if it // Even if the statement is not modeled precisely we can hoist the load if it
// does not involve any parameters that might have been specilized by the // does not involve any parameters that might have been specialized by the
// statement domain. // statement domain.
for (unsigned u = 0, e = MA->getNumSubscripts(); u < e; u++) for (unsigned u = 0, e = MA->getNumSubscripts(); u < e; u++)
if (!isa<SCEVConstant>(MA->getSubscript(u))) if (!isa<SCEVConstant>(MA->getSubscript(u)))
@@ -3976,7 +3976,7 @@ void Scop::addRecordedAssumptions() {
// _ _____ // _ _____
// Dom => S <==> A v B <==> A - B // Dom => S <==> A v B <==> A - B
// //
// To avoid the complement we will register A - B as a restricton not an // To avoid the complement we will register A - B as a restriction not an
// assumption. // assumption.
isl_set *S = AS.Set; isl_set *S = AS.Set;
if (AS.Sign == AS_RESTRICTION) if (AS.Sign == AS_RESTRICTION)
@@ -4107,7 +4107,7 @@ __isl_give PWACtx Scop::getPwAff(const SCEV *E, BasicBlock *BB,
// affine function from @p E in the context of @p BB. If that tasks becomes to // affine function from @p E in the context of @p BB. If that tasks becomes to
// complex the affinator might return a nullptr. In such a case we invalidate // complex the affinator might return a nullptr. In such a case we invalidate
// the SCoP and return a dummy value. This way we do not need to add error // the SCoP and return a dummy value. This way we do not need to add error
// handling cdoe to all users of this function. // handling code to all users of this function.
auto PWAC = Affinator.getPwAff(E, BB); auto PWAC = Affinator.getPwAff(E, BB);
if (PWAC.first) { if (PWAC.first) {
// TODO: We could use a heuristic and either use: // TODO: We could use a heuristic and either use: