This is an archive of the discontinued LLVM Phabricator instance.

Differential D62262

[PGO][CHR] Speed up following long use-def chains.
ClosedPublic

Authored by hjyamauchi on May 22 2019, 9:54 AM.

Details

Reviewers
davidxl
Commits
rZORG1827e09d14ed: [PGO][CHR] Speed up following long use-def chains.
rG1827e09d14ed: [PGO][CHR] Speed up following long use-def chains.
rGdfeb79745569: [PGO][CHR] Speed up following long use-def chains.
rL361416: [PGO][CHR] Speed up following long use-def chains.
Summary

Avoid visiting an instruction more than once by using a map.

Diff Detail

Repository
rL LLVM

Event Timeline

hjyamauchi created this revision.May 22 2019, 9:54 AM
Herald added a project: Restricted Project. · View Herald TranscriptMay 22 2019, 9:54 AM
Harbormaster completed remote builds in B32323: Diff 200778.May 22 2019, 9:54 AM
davidxl added a comment.May 22 2019, 10:14 AM

was there a quadratic behavior before ? It seems linear before and after the patch -- but just cut the computation by a factor of 2 . Do you need an option to control the max chain length?

hjyamauchi added a comment.May 22 2019, 11:24 AM
In D62262#1512384, @davidxl wrote:

was there a quadratic behavior before ? It seems linear before and after the patch -- but just cut the computation by a factor of 2 . Do you need an option to control the max chain length?

I think at least something more than linear. The downstream nodes got visited many, many times (eg. in the test, imagine how many paths there are from %v301 to %v298, to %v296, then all the way down to %v0.)

We could use a max length option in the future but for now it seems fine.

davidxl accepted this revision.May 22 2019, 11:31 AM

Indeed. The original one is O(N^2). LGTM.

This revision is now accepted and ready to land.May 22 2019, 11:31 AM
Closed by commit rL361416: [PGO][CHR] Speed up following long use-def chains. (authored by hjyamauchi). · Explain WhyMay 22 2019, 11:34 AM
This revision was automatically updated to reflect the committed changes.

Revision Contents

PathSize
llvm/
trunk/
lib/
Transforms/
Instrumentation/
34 lines
test/
Transforms/
PGOProfile/
311 lines

Diff 200803

llvm/trunk/lib/Transforms/Instrumentation/ControlHeightReduction.cpp

Show First 20 Lines • Show All 540 Lines • ▼ Show 20 Lines
// Return true if V is already hoisted or can be hoisted (along with its // Return true if V is already hoisted or can be hoisted (along with its
// operands) above the insert point. When it returns true and HoistStops is // operands) above the insert point. When it returns true and HoistStops is
// non-null, the instructions to stop hoisting at through the use-def chains are // non-null, the instructions to stop hoisting at through the use-def chains are
// inserted into HoistStops. // inserted into HoistStops.
static bool static bool
checkHoistValue(Value *V, Instruction *InsertPoint, DominatorTree &DT, checkHoistValue(Value *V, Instruction *InsertPoint, DominatorTree &DT,
DenseSet<Instruction *> &Unhoistables, DenseSet<Instruction *> &Unhoistables,
DenseSet<Instruction *> *HoistStops) { DenseSet<Instruction *> *HoistStops,
DenseMap<Instruction *, bool> &Visited) {
assert(InsertPoint && "Null InsertPoint"); assert(InsertPoint && "Null InsertPoint");
if (auto *I = dyn_cast<Instruction>(V)) { if (auto *I = dyn_cast<Instruction>(V)) {
if (Visited.count(I)) {
return Visited[I];
}
assert(DT.getNode(I->getParent()) && "DT must contain I's parent block"); assert(DT.getNode(I->getParent()) && "DT must contain I's parent block");
assert(DT.getNode(InsertPoint->getParent()) && "DT must contain Destination"); assert(DT.getNode(InsertPoint->getParent()) && "DT must contain Destination");
if (Unhoistables.count(I)) { if (Unhoistables.count(I)) {
// Don't hoist if they are not to be hoisted. // Don't hoist if they are not to be hoisted.
Visited[I] = false;
return false; return false;
} }
if (DT.dominates(I, InsertPoint)) { if (DT.dominates(I, InsertPoint)) {
// We are already above the insert point. Stop here. // We are already above the insert point. Stop here.
if (HoistStops) if (HoistStops)
HoistStops->insert(I); HoistStops->insert(I);
Visited[I] = true;
return true; return true;
} }
// We aren't not above the insert point, check if we can hoist it above the // We aren't not above the insert point, check if we can hoist it above the
// insert point. // insert point.
if (isHoistable(I, DT)) { if (isHoistable(I, DT)) {
// Check operands first. // Check operands first.
DenseSet<Instruction *> OpsHoistStops; DenseSet<Instruction *> OpsHoistStops;
bool AllOpsHoisted = true; bool AllOpsHoisted = true;
for (Value *Op : I->operands()) { for (Value *Op : I->operands()) {
if (!checkHoistValue(Op, InsertPoint, DT, Unhoistables, &OpsHoistStops)) { if (!checkHoistValue(Op, InsertPoint, DT, Unhoistables, &OpsHoistStops,
Visited)) {
AllOpsHoisted = false; AllOpsHoisted = false;
break; break;
} }
} }
if (AllOpsHoisted) { if (AllOpsHoisted) {
CHR_DEBUG(dbgs() << "checkHoistValue " << *I << "\n"); CHR_DEBUG(dbgs() << "checkHoistValue " << *I << "\n");
if (HoistStops) if (HoistStops)
HoistStops->insert(OpsHoistStops.begin(), OpsHoistStops.end()); HoistStops->insert(OpsHoistStops.begin(), OpsHoistStops.end());
Visited[I] = true;
return true; return true;
} }
} }
Visited[I] = false;
return false; return false;
} }
// Non-instructions are considered hoistable. // Non-instructions are considered hoistable.
return true; return true;
} }
// Returns true and sets the true probability and false probability of an // Returns true and sets the true probability and false probability of an
// MD_prof metadata if it's well-formed. // MD_prof metadata if it's well-formed.
▲ Show 20 Lines • Show All 296 Lines • ▼ Show 20 Lines if (RI.HasBranch || !Selects.empty()) {
} }
// Remove Selects that can't be hoisted. // Remove Selects that can't be hoisted.
for (auto it = Selects.begin(); it != Selects.end(); ) { for (auto it = Selects.begin(); it != Selects.end(); ) {
SelectInst *SI = *it; SelectInst *SI = *it;
if (SI == InsertPoint) { if (SI == InsertPoint) {
++it; ++it;
continue; continue;
} }
DenseMap<Instruction *, bool> Visited;
bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint, bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint,
DT, Unhoistables, nullptr); DT, Unhoistables, nullptr, Visited);
if (!IsHoistable) { if (!IsHoistable) {
CHR_DEBUG(dbgs() << "Dropping select " << *SI << "\n"); CHR_DEBUG(dbgs() << "Dropping select " << *SI << "\n");
ORE.emit([&]() { ORE.emit([&]() {
return OptimizationRemarkMissed(DEBUG_TYPE, return OptimizationRemarkMissed(DEBUG_TYPE,
"DropUnhoistableSelect", SI) "DropUnhoistableSelect", SI)
<< "Dropped unhoistable select"; << "Dropped unhoistable select";
}); });
it = Selects.erase(it); it = Selects.erase(it);
// Since we are dropping the select here, we also drop it from // Since we are dropping the select here, we also drop it from
// Unhoistables. // Unhoistables.
Unhoistables.erase(SI); Unhoistables.erase(SI);
} else } else
++it; ++it;
} }
// Update InsertPoint after potentially removing selects. // Update InsertPoint after potentially removing selects.
InsertPoint = getBranchInsertPoint(RI); InsertPoint = getBranchInsertPoint(RI);
CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n"); CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n");
if (RI.HasBranch && InsertPoint != Branch) { if (RI.HasBranch && InsertPoint != Branch) {
DenseMap<Instruction *, bool> Visited;
bool IsHoistable = checkHoistValue(Branch->getCondition(), InsertPoint, bool IsHoistable = checkHoistValue(Branch->getCondition(), InsertPoint,
DT, Unhoistables, nullptr); DT, Unhoistables, nullptr, Visited);
if (!IsHoistable) { if (!IsHoistable) {
// If the branch isn't hoistable, drop the selects in the entry // If the branch isn't hoistable, drop the selects in the entry
// block, preferring the branch, which makes the branch the hoist // block, preferring the branch, which makes the branch the hoist
// point. // point.
assert(InsertPoint != Branch && "Branch must not be the hoist point"); assert(InsertPoint != Branch && "Branch must not be the hoist point");
CHR_DEBUG(dbgs() << "Dropping selects in entry block \n"); CHR_DEBUG(dbgs() << "Dropping selects in entry block \n");
CHR_DEBUG( CHR_DEBUG(
for (SelectInst *SI : Selects) { for (SelectInst *SI : Selects) {
Show All 14 Lines if (RI.HasBranch && InsertPoint != Branch) {
InsertPoint = Branch; InsertPoint = Branch;
} }
} }
CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n"); CHR_DEBUG(dbgs() << "InsertPoint " << *InsertPoint << "\n");
#ifndef NDEBUG #ifndef NDEBUG
if (RI.HasBranch) { if (RI.HasBranch) {
assert(!DT.dominates(Branch, InsertPoint) && assert(!DT.dominates(Branch, InsertPoint) &&
"Branch can't be already above the hoist point"); "Branch can't be already above the hoist point");
DenseMap<Instruction *, bool> Visited;
assert(checkHoistValue(Branch->getCondition(), InsertPoint, assert(checkHoistValue(Branch->getCondition(), InsertPoint,
DT, Unhoistables, nullptr) && DT, Unhoistables, nullptr, Visited) &&
"checkHoistValue for branch"); "checkHoistValue for branch");
} }
for (auto *SI : Selects) { for (auto *SI : Selects) {
assert(!DT.dominates(SI, InsertPoint) && assert(!DT.dominates(SI, InsertPoint) &&
"SI can't be already above the hoist point"); "SI can't be already above the hoist point");
DenseMap<Instruction *, bool> Visited;
assert(checkHoistValue(SI->getCondition(), InsertPoint, DT, assert(checkHoistValue(SI->getCondition(), InsertPoint, DT,
Unhoistables, nullptr) && Unhoistables, nullptr, Visited) &&
"checkHoistValue for selects"); "checkHoistValue for selects");
} }
CHR_DEBUG(dbgs() << "Result\n"); CHR_DEBUG(dbgs() << "Result\n");
if (RI.HasBranch) { if (RI.HasBranch) {
CHR_DEBUG(dbgs() << "BI " << *Branch << "\n"); CHR_DEBUG(dbgs() << "BI " << *Branch << "\n");
} }
for (auto *SI : Selects) { for (auto *SI : Selects) {
CHR_DEBUG(dbgs() << "SI " << *SI << "\n"); CHR_DEBUG(dbgs() << "SI " << *SI << "\n");
▲ Show 20 Lines • Show All 84 Lines • ▼ Show 20 Lines CHR_DEBUG(
dbgs() << " ConditionValues "; dbgs() << " ConditionValues ";
for (Value *V : ConditionValues) { for (Value *V : ConditionValues) {
dbgs() << *V << ", "; dbgs() << *V << ", ";
} }
dbgs() << "\n"); dbgs() << "\n");
assert(InsertPoint && "Null InsertPoint"); assert(InsertPoint && "Null InsertPoint");
// If any of Bases isn't hoistable to the hoist point, split. // If any of Bases isn't hoistable to the hoist point, split.
for (Value *V : ConditionValues) { for (Value *V : ConditionValues) {
if (!checkHoistValue(V, InsertPoint, DT, Unhoistables, nullptr)) { DenseMap<Instruction *, bool> Visited;
if (!checkHoistValue(V, InsertPoint, DT, Unhoistables, nullptr, Visited)) {
CHR_DEBUG(dbgs() << "Split. checkHoistValue false " << *V << "\n"); CHR_DEBUG(dbgs() << "Split. checkHoistValue false " << *V << "\n");
return true; // Not hoistable, split. return true; // Not hoistable, split.
} }
} }
// If PrevConditionValues or ConditionValues is empty, don't split to avoid // If PrevConditionValues or ConditionValues is empty, don't split to avoid
// unnecessary splits at scopes with no branch/selects. If // unnecessary splits at scopes with no branch/selects. If
// PrevConditionValues and ConditionValues don't intersect at all, split. // PrevConditionValues and ConditionValues don't intersect at all, split.
if (!PrevConditionValues.empty() && !ConditionValues.empty()) { if (!PrevConditionValues.empty() && !ConditionValues.empty()) {
▲ Show 20 Lines • Show All 312 Lines • ▼ Show 20 Lines for (RegInfo &RI : Scope->RegInfos) {
DenseSet<Instruction *> HoistStops; DenseSet<Instruction *> HoistStops;
bool IsHoisted = false; bool IsHoisted = false;
if (RI.HasBranch) { if (RI.HasBranch) {
assert((OutermostScope->TrueBiasedRegions.count(R) > 0 || assert((OutermostScope->TrueBiasedRegions.count(R) > 0 ||
OutermostScope->FalseBiasedRegions.count(R) > 0) && OutermostScope->FalseBiasedRegions.count(R) > 0) &&
"Must be truthy or falsy"); "Must be truthy or falsy");
auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); auto *BI = cast<BranchInst>(R->getEntry()->getTerminator());
// Note checkHoistValue fills in HoistStops. // Note checkHoistValue fills in HoistStops.
DenseMap<Instruction *, bool> Visited;
bool IsHoistable = checkHoistValue(BI->getCondition(), InsertPoint, DT, bool IsHoistable = checkHoistValue(BI->getCondition(), InsertPoint, DT,
Unhoistables, &HoistStops); Unhoistables, &HoistStops, Visited);
assert(IsHoistable && "Must be hoistable"); assert(IsHoistable && "Must be hoistable");
(void)(IsHoistable); // Unused in release build (void)(IsHoistable); // Unused in release build
IsHoisted = true; IsHoisted = true;
} }
for (SelectInst *SI : RI.Selects) { for (SelectInst *SI : RI.Selects) {
assert((OutermostScope->TrueBiasedSelects.count(SI) > 0 || assert((OutermostScope->TrueBiasedSelects.count(SI) > 0 ||
OutermostScope->FalseBiasedSelects.count(SI) > 0) && OutermostScope->FalseBiasedSelects.count(SI) > 0) &&
"Must be true or false biased"); "Must be true or false biased");
// Note checkHoistValue fills in HoistStops. // Note checkHoistValue fills in HoistStops.
DenseMap<Instruction *, bool> Visited;
bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint, DT, bool IsHoistable = checkHoistValue(SI->getCondition(), InsertPoint, DT,
Unhoistables, &HoistStops); Unhoistables, &HoistStops, Visited);
assert(IsHoistable && "Must be hoistable"); assert(IsHoistable && "Must be hoistable");
(void)(IsHoistable); // Unused in release build (void)(IsHoistable); // Unused in release build
IsHoisted = true; IsHoisted = true;
} }
if (IsHoisted) { if (IsHoisted) {
OutermostScope->CHRRegions.push_back(RI); OutermostScope->CHRRegions.push_back(RI);
OutermostScope->HoistStopMap[R] = HoistStops; OutermostScope->HoistStopMap[R] = HoistStops;
} }
▲ Show 20 Lines • Show All 683 Lines • Show Last 20 Lines

llvm/trunk/test/Transforms/PGOProfile/chr.ll

Show First 20 Lines • Show All 1,999 Lines • ▼ Show 20 Lines
bb9: bb9:
call void @foo() call void @foo()
br label %bb10 br label %bb10
bb10: bb10:
ret i32 45 ret i32 45
} }
; Test a case with a really long use-def chains. This test checks that it's not
; really slow and doesn't appear to be hanging.
define i64 @test_chr_22(i1 %i, i64* %j, i64 %v0) !prof !14 {
bb0:
%v1 = add i64 %v0, 3
%v2 = add i64 %v1, %v0
%c1 = icmp sgt i64 %v2, 99
%v3 = select i1 %c1, i64 %v1, i64 %v2, !prof !15
%v4 = add i64 %v2, %v2
%v5 = add i64 %v4, %v2
%v6 = add i64 %v5, %v4
%v7 = add i64 %v6, %v5
%v8 = add i64 %v7, %v6
%v9 = add i64 %v8, %v7
%v10 = add i64 %v9, %v8
%v11 = add i64 %v10, %v9
%v12 = add i64 %v11, %v10
%v13 = add i64 %v12, %v11
%v14 = add i64 %v13, %v12
%v15 = add i64 %v14, %v13
%v16 = add i64 %v15, %v14
%v17 = add i64 %v16, %v15
%v18 = add i64 %v17, %v16
%v19 = add i64 %v18, %v17
%v20 = add i64 %v19, %v18
%v21 = add i64 %v20, %v19
%v22 = add i64 %v21, %v20
%v23 = add i64 %v22, %v21
%v24 = add i64 %v23, %v22
%v25 = add i64 %v24, %v23
%v26 = add i64 %v25, %v24
%v27 = add i64 %v26, %v25
%v28 = add i64 %v27, %v26
%v29 = add i64 %v28, %v27
%v30 = add i64 %v29, %v28
%v31 = add i64 %v30, %v29
%v32 = add i64 %v31, %v30
%v33 = add i64 %v32, %v31
%v34 = add i64 %v33, %v32
%v35 = add i64 %v34, %v33
%v36 = add i64 %v35, %v34
%v37 = add i64 %v36, %v35
%v38 = add i64 %v37, %v36
%v39 = add i64 %v38, %v37
%v40 = add i64 %v39, %v38
%v41 = add i64 %v40, %v39
%v42 = add i64 %v41, %v40
%v43 = add i64 %v42, %v41
%v44 = add i64 %v43, %v42
%v45 = add i64 %v44, %v43
%v46 = add i64 %v45, %v44
%v47 = add i64 %v46, %v45
%v48 = add i64 %v47, %v46
%v49 = add i64 %v48, %v47
%v50 = add i64 %v49, %v48
%v51 = add i64 %v50, %v49
%v52 = add i64 %v51, %v50
%v53 = add i64 %v52, %v51
%v54 = add i64 %v53, %v52
%v55 = add i64 %v54, %v53
%v56 = add i64 %v55, %v54
%v57 = add i64 %v56, %v55
%v58 = add i64 %v57, %v56
%v59 = add i64 %v58, %v57
%v60 = add i64 %v59, %v58
%v61 = add i64 %v60, %v59
%v62 = add i64 %v61, %v60
%v63 = add i64 %v62, %v61
%v64 = add i64 %v63, %v62
%v65 = add i64 %v64, %v63
%v66 = add i64 %v65, %v64
%v67 = add i64 %v66, %v65
%v68 = add i64 %v67, %v66
%v69 = add i64 %v68, %v67
%v70 = add i64 %v69, %v68
%v71 = add i64 %v70, %v69
%v72 = add i64 %v71, %v70
%v73 = add i64 %v72, %v71
%v74 = add i64 %v73, %v72
%v75 = add i64 %v74, %v73
%v76 = add i64 %v75, %v74
%v77 = add i64 %v76, %v75
%v78 = add i64 %v77, %v76
%v79 = add i64 %v78, %v77
%v80 = add i64 %v79, %v78
%v81 = add i64 %v80, %v79
%v82 = add i64 %v81, %v80
%v83 = add i64 %v82, %v81
%v84 = add i64 %v83, %v82
%v85 = add i64 %v84, %v83
%v86 = add i64 %v85, %v84
%v87 = add i64 %v86, %v85
%v88 = add i64 %v87, %v86
%v89 = add i64 %v88, %v87
%v90 = add i64 %v89, %v88
%v91 = add i64 %v90, %v89
%v92 = add i64 %v91, %v90
%v93 = add i64 %v92, %v91
%v94 = add i64 %v93, %v92
%v95 = add i64 %v94, %v93
%v96 = add i64 %v95, %v94
%v97 = add i64 %v96, %v95
%v98 = add i64 %v97, %v96
%v99 = add i64 %v98, %v97
%v100 = add i64 %v99, %v98
%v101 = add i64 %v100, %v99
%v102 = add i64 %v101, %v100
%v103 = add i64 %v102, %v101
%v104 = add i64 %v103, %v102
%v105 = add i64 %v104, %v103
%v106 = add i64 %v105, %v104
%v107 = add i64 %v106, %v105
%v108 = add i64 %v107, %v106
%v109 = add i64 %v108, %v107
%v110 = add i64 %v109, %v108
%v111 = add i64 %v110, %v109
%v112 = add i64 %v111, %v110
%v113 = add i64 %v112, %v111
%v114 = add i64 %v113, %v112
%v115 = add i64 %v114, %v113
%v116 = add i64 %v115, %v114
%v117 = add i64 %v116, %v115
%v118 = add i64 %v117, %v116
%v119 = add i64 %v118, %v117
%v120 = add i64 %v119, %v118
%v121 = add i64 %v120, %v119
%v122 = add i64 %v121, %v120
%v123 = add i64 %v122, %v121
%v124 = add i64 %v123, %v122
%v125 = add i64 %v124, %v123
%v126 = add i64 %v125, %v124
%v127 = add i64 %v126, %v125
%v128 = add i64 %v127, %v126
%v129 = add i64 %v128, %v127
%v130 = add i64 %v129, %v128
%v131 = add i64 %v130, %v129
%v132 = add i64 %v131, %v130
%v133 = add i64 %v132, %v131
%v134 = add i64 %v133, %v132
%v135 = add i64 %v134, %v133
%v136 = add i64 %v135, %v134
%v137 = add i64 %v136, %v135
%v138 = add i64 %v137, %v136
%v139 = add i64 %v138, %v137
%v140 = add i64 %v139, %v138
%v141 = add i64 %v140, %v139
%v142 = add i64 %v141, %v140
%v143 = add i64 %v142, %v141
%v144 = add i64 %v143, %v142
%v145 = add i64 %v144, %v143
%v146 = add i64 %v145, %v144
%v147 = add i64 %v146, %v145
%v148 = add i64 %v147, %v146
%v149 = add i64 %v148, %v147
%v150 = add i64 %v149, %v148
%v151 = add i64 %v150, %v149
%v152 = add i64 %v151, %v150
%v153 = add i64 %v152, %v151
%v154 = add i64 %v153, %v152
%v155 = add i64 %v154, %v153
%v156 = add i64 %v155, %v154
%v157 = add i64 %v156, %v155
%v158 = add i64 %v157, %v156
%v159 = add i64 %v158, %v157
%v160 = add i64 %v159, %v158
%v161 = add i64 %v160, %v159
%v162 = add i64 %v161, %v160
%v163 = add i64 %v162, %v161
%v164 = add i64 %v163, %v162
%v165 = add i64 %v164, %v163
%v166 = add i64 %v165, %v164
%v167 = add i64 %v166, %v165
%v168 = add i64 %v167, %v166
%v169 = add i64 %v168, %v167
%v170 = add i64 %v169, %v168
%v171 = add i64 %v170, %v169
%v172 = add i64 %v171, %v170
%v173 = add i64 %v172, %v171
%v174 = add i64 %v173, %v172
%v175 = add i64 %v174, %v173
%v176 = add i64 %v175, %v174
%v177 = add i64 %v176, %v175
%v178 = add i64 %v177, %v176
%v179 = add i64 %v178, %v177
%v180 = add i64 %v179, %v178
%v181 = add i64 %v180, %v179
%v182 = add i64 %v181, %v180
%v183 = add i64 %v182, %v181
%v184 = add i64 %v183, %v182
%v185 = add i64 %v184, %v183
%v186 = add i64 %v185, %v184
%v187 = add i64 %v186, %v185
%v188 = add i64 %v187, %v186
%v189 = add i64 %v188, %v187
%v190 = add i64 %v189, %v188
%v191 = add i64 %v190, %v189
%v192 = add i64 %v191, %v190
%v193 = add i64 %v192, %v191
%v194 = add i64 %v193, %v192
%v195 = add i64 %v194, %v193
%v196 = add i64 %v195, %v194
%v197 = add i64 %v196, %v195
%v198 = add i64 %v197, %v196
%v199 = add i64 %v198, %v197
%v200 = add i64 %v199, %v198
%v201 = add i64 %v200, %v199
%v202 = add i64 %v201, %v200
%v203 = add i64 %v202, %v201
%v204 = add i64 %v203, %v202
%v205 = add i64 %v204, %v203
%v206 = add i64 %v205, %v204
%v207 = add i64 %v206, %v205
%v208 = add i64 %v207, %v206
%v209 = add i64 %v208, %v207
%v210 = add i64 %v209, %v208
%v211 = add i64 %v210, %v209
%v212 = add i64 %v211, %v210
%v213 = add i64 %v212, %v211
%v214 = add i64 %v213, %v212
%v215 = add i64 %v214, %v213
%v216 = add i64 %v215, %v214
%v217 = add i64 %v216, %v215
%v218 = add i64 %v217, %v216
%v219 = add i64 %v218, %v217
%v220 = add i64 %v219, %v218
%v221 = add i64 %v220, %v219
%v222 = add i64 %v221, %v220
%v223 = add i64 %v222, %v221
%v224 = add i64 %v223, %v222
%v225 = add i64 %v224, %v223
%v226 = add i64 %v225, %v224
%v227 = add i64 %v226, %v225
%v228 = add i64 %v227, %v226
%v229 = add i64 %v228, %v227
%v230 = add i64 %v229, %v228
%v231 = add i64 %v230, %v229
%v232 = add i64 %v231, %v230
%v233 = add i64 %v232, %v231
%v234 = add i64 %v233, %v232
%v235 = add i64 %v234, %v233
%v236 = add i64 %v235, %v234
%v237 = add i64 %v236, %v235
%v238 = add i64 %v237, %v236
%v239 = add i64 %v238, %v237
%v240 = add i64 %v239, %v238
%v241 = add i64 %v240, %v239
%v242 = add i64 %v241, %v240
%v243 = add i64 %v242, %v241
%v244 = add i64 %v243, %v242
%v245 = add i64 %v244, %v243
%v246 = add i64 %v245, %v244
%v247 = add i64 %v246, %v245
%v248 = add i64 %v247, %v246
%v249 = add i64 %v248, %v247
%v250 = add i64 %v249, %v248
%v251 = add i64 %v250, %v249
%v252 = add i64 %v251, %v250
%v253 = add i64 %v252, %v251
%v254 = add i64 %v253, %v252
%v255 = add i64 %v254, %v253
%v256 = add i64 %v255, %v254
%v257 = add i64 %v256, %v255
%v258 = add i64 %v257, %v256
%v259 = add i64 %v258, %v257
%v260 = add i64 %v259, %v258
%v261 = add i64 %v260, %v259
%v262 = add i64 %v261, %v260
%v263 = add i64 %v262, %v261
%v264 = add i64 %v263, %v262
%v265 = add i64 %v264, %v263
%v266 = add i64 %v265, %v264
%v267 = add i64 %v266, %v265
%v268 = add i64 %v267, %v266
%v269 = add i64 %v268, %v267
%v270 = add i64 %v269, %v268
%v271 = add i64 %v270, %v269
%v272 = add i64 %v271, %v270
%v273 = add i64 %v272, %v271
%v274 = add i64 %v273, %v272
%v275 = add i64 %v274, %v273
%v276 = add i64 %v275, %v274
%v277 = add i64 %v276, %v275
%v278 = add i64 %v277, %v276
%v279 = add i64 %v278, %v277
%v280 = add i64 %v279, %v278
%v281 = add i64 %v280, %v279
%v282 = add i64 %v281, %v280
%v283 = add i64 %v282, %v281
%v284 = add i64 %v283, %v282
%v285 = add i64 %v284, %v283
%v286 = add i64 %v285, %v284
%v287 = add i64 %v286, %v285
%v288 = add i64 %v287, %v286
%v289 = add i64 %v288, %v287
%v290 = add i64 %v289, %v288
%v291 = add i64 %v290, %v289
%v292 = add i64 %v291, %v290
%v293 = add i64 %v292, %v291
%v294 = add i64 %v293, %v292
%v295 = add i64 %v294, %v293
%v296 = add i64 %v295, %v294
%v297 = add i64 %v296, %v295
%v298 = add i64 %v297, %v296
%v299 = add i64 %v298, %v297
%v300 = add i64 %v299, %v298
%v301 = icmp eq i64 %v300, 100
%v302 = select i1 %v301, i64 %v298, i64 %v299, !prof !15
store i64 %v302, i64* %j
ret i64 99
}
!llvm.module.flags = !{!0} !llvm.module.flags = !{!0}
!0 = !{i32 1, !"ProfileSummary", !1} !0 = !{i32 1, !"ProfileSummary", !1}
!1 = !{!2, !3, !4, !5, !6, !7, !8, !9} !1 = !{!2, !3, !4, !5, !6, !7, !8, !9}
!2 = !{!"ProfileFormat", !"InstrProf"} !2 = !{!"ProfileFormat", !"InstrProf"}
!3 = !{!"TotalCount", i64 10000} !3 = !{!"TotalCount", i64 10000}
!4 = !{!"MaxCount", i64 10} !4 = !{!"MaxCount", i64 10}
!5 = !{!"MaxInternalCount", i64 1} !5 = !{!"MaxInternalCount", i64 1}
!6 = !{!"MaxFunctionCount", i64 1000} !6 = !{!"MaxFunctionCount", i64 1000}
Show All 16 Lines