maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[NFC] Adjust naming scheme of statistic variables 

Suggested-by: Tobias Grosser <tobias@grosser.es>
llvm-svn: 287347
This commit is contained in:
Johannes Doerfert 2016-11-18 14:37:08 +00:00
parent ff23d3e741
commit 81aa6e882f
3 changed files with 25 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -28,7 +28,7 @@ using namespace polly;
STATISTIC(ScopFound, "Number of valid Scops");
STATISTIC(RichScopFound, "Number of Scops containing a loop");
STATISTIC(INFEASIBLE_SCOPS,
STATISTIC(InfeasibleScops,
"Number of SCoPs with statically infeasible context.");
// If the loop is nonaffine/boxed, return the first non-boxed surrounding loop
@ -689,7 +689,7 @@ ScopBuilder::ScopBuilder(Region *R, AssumptionCache &AC, AliasAnalysis &AA,
DEBUG(scop->print(dbgs()));
if (!scop->hasFeasibleRuntimeContext()) {
INFEASIBLE_SCOPS++;
InfeasibleScops++;
Msg = "SCoP ends here but was dismissed.";
scop.reset();
} else {

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

@ -61,17 +61,17 @@ using namespace polly;
#define DEBUG_TYPE "polly-scops"
STATISTIC(ASSUMPTION_ALIASING, "Number of aliasing assumptions taken.");
STATISTIC(ASSUMPTION_INBOUNDS, "Number of inbounds assumptions taken.");
STATISTIC(ASSUMPTION_WRAPPING, "Number of wrapping assumptions taken.");
STATISTIC(ASSUMPTION_UNSIGNED, "Number of unsigned assumptions taken.");
STATISTIC(ASSUMPTION_COMPLEXITY, "Number of too complex SCoPs.");
STATISTIC(ASSUMPTION_UNPROFITABLE, "Number of unprofitable SCoPs.");
STATISTIC(ASSUMPTION_ERRORBLOCK, "Number of error block assumptions taken.");
STATISTIC(ASSUMPTION_INFINITELOOP, "Number of bounded loop assumptions taken.");
STATISTIC(ASSUMPTION_INVARIANTLOAD,
STATISTIC(AssumptionsAliasing, "Number of aliasing assumptions taken.");
STATISTIC(AssumptionsInbounds, "Number of inbounds assumptions taken.");
STATISTIC(AssumptionsWrapping, "Number of wrapping assumptions taken.");
STATISTIC(AssumptionsUnsigned, "Number of unsigned assumptions taken.");
STATISTIC(AssumptionsComplexity, "Number of too complex SCoPs.");
STATISTIC(AssumptionsUnprofitable, "Number of unprofitable SCoPs.");
STATISTIC(AssumptionsErrorBlock, "Number of error block assumptions taken.");
STATISTIC(AssumptionsInfiniteLoop, "Number of bounded loop assumptions taken.");
STATISTIC(AssumptionsInvariantLoad,
"Number of invariant loads assumptions taken.");
STATISTIC(ASSUMPTION_DELINERIZATION,
STATISTIC(AssumptionsDelinearization,
"Number of delinearization assumptions taken.");
// The maximal number of basic sets we allow during domain construction to
@ -2907,7 +2907,7 @@ bool Scop::buildAliasChecks(AliasAnalysis &AA) {
// Aliasing assumptions do not go through addAssumption but we still want to
// collect statistics so we do it here explicitly.
if (MinMaxAliasGroups.size())
ASSUMPTION_ALIASING++;
AssumptionsAliasing++;
return true;
}
@ -3775,34 +3775,34 @@ bool Scop::trackAssumption(AssumptionKind Kind, __isl_keep isl_set *Set,
switch (Kind) {
case ALIASING:
ASSUMPTION_ALIASING++;
AssumptionsAliasing++;
break;
case INBOUNDS:
ASSUMPTION_INBOUNDS++;
AssumptionsInbounds++;
break;
case WRAPPING:
ASSUMPTION_WRAPPING++;
AssumptionsWrapping++;
break;
case UNSIGNED:
ASSUMPTION_UNSIGNED++;
AssumptionsUnsigned++;
break;
case COMPLEXITY:
ASSUMPTION_COMPLEXITY++;
AssumptionsComplexity++;
break;
case PROFITABLE:
ASSUMPTION_UNPROFITABLE++;
AssumptionsUnprofitable++;
break;
case ERRORBLOCK:
ASSUMPTION_ERRORBLOCK++;
AssumptionsErrorBlock++;
break;
case INFINITELOOP:
ASSUMPTION_INFINITELOOP++;
AssumptionsInfiniteLoop++;
break;
case INVARIANTLOAD:
ASSUMPTION_INVARIANTLOAD++;
AssumptionsInvariantLoad++;
break;
case DELINEARIZATION:
ASSUMPTION_DELINERIZATION++;
AssumptionsDelinearization++;
break;
}

4
polly/lib/CodeGen/IslNodeBuilder.cpp
View File

@ -52,7 +52,7 @@ using namespace llvm;
#define DEBUG_TYPE "polly-codegen"
STATISTIC(VERSIONED_SCOPS, "Number of SCoPs that required versioning.");
STATISTIC(VersionedScops, "Number of SCoPs that required versioning.");
// The maximal number of dimensions we allow during invariant load construction.
// More complex access ranges will result in very high compile time and are also
@ -1344,7 +1344,7 @@ Value *IslNodeBuilder::createRTC(isl_ast_expr *Condition) {
ExprBuilder.setTrackOverflow(false);
if (!isa<ConstantInt>(RTC))
VERSIONED_SCOPS++;
VersionedScops++;
return RTC;
}