Lines Matching refs:Scope
233 auto *Scope = new CHRScope(TailRegInfos, TailSubs); in split() local
236 return Scope; in split()
287 for (CHRScope *Scope : Scopes) { in ~CHR()
288 delete Scope; in ~CHR()
300 if (CHRScope *Scope = findScopes(R, nullptr, nullptr, Output)) { in findScopes() local
301 Output.push_back(Scope); in findScopes()
307 void checkScopeHoistable(CHRScope *Scope);
311 SmallVector<CHRScope *, 8> splitScope(CHRScope *Scope,
319 void classifyBiasedScopes(CHRScope *Scope, CHRScope *OutermostScope);
326 void setCHRRegions(CHRScope *Scope, CHRScope *OutermostScope);
332 void transformScopes(CHRScope *Scope, DenseSet<PHINode *> &TrivialPHIs);
333 void cloneScopeBlocks(CHRScope *Scope,
342 void fixupBranchesAndSelects(CHRScope *Scope,
347 CHRScope *Scope,
351 CHRScope *Scope,
356 CHRScope *Scope,
394 raw_ostream &operator<<(raw_ostream &OS, const CHRScope &Scope) { in operator <<() argument
395 Scope.print(OS); in operator <<()
864 void CHR::checkScopeHoistable(CHRScope *Scope) { in checkScopeHoistable() argument
865 RegInfo &RI = Scope->RegInfos[0]; in checkScopeHoistable()
1097 static void getSelectsInScope(CHRScope *Scope, in getSelectsInScope() argument
1099 for (RegInfo &RI : Scope->RegInfos) in getSelectsInScope()
1102 for (CHRScope *Sub : Scope->Subs) in getSelectsInScope()
1108 for (CHRScope *Scope : Input) { in splitScopes()
1109 assert(!Scope->BranchInsertPoint && in splitScopes()
1112 getSelectsInScope(Scope, Unhoistables); in splitScopes()
1113 splitScope(Scope, nullptr, nullptr, nullptr, Output, Unhoistables); in splitScopes()
1116 for (CHRScope *Scope : Output) { in splitScopes()
1117 assert(Scope->BranchInsertPoint && "BranchInsertPoint must be set"); in splitScopes()
1123 CHRScope *Scope, in splitScope() argument
1140 SmallVector<RegInfo, 8> RegInfos(Scope->RegInfos); // Copy in splitScope()
1186 CHRScope *Tail = Scope->split(RI.R); in splitScope()
1188 Splits.push_back(Scope); in splitScope()
1192 Scope = Tail; in splitScope()
1209 Splits.push_back(Scope); in splitScope()
1253 for (CHRScope *Scope : Scopes) { in classifyBiasedScopes()
1254 assert(Scope->TrueBiasedRegions.empty() && Scope->FalseBiasedRegions.empty() && "Empty"); in classifyBiasedScopes()
1255 classifyBiasedScopes(Scope, Scope); in classifyBiasedScopes()
1257 dbgs() << "classifyBiasedScopes " << *Scope << "\n"; in classifyBiasedScopes()
1259 for (Region *R : Scope->TrueBiasedRegions) { in classifyBiasedScopes()
1264 for (Region *R : Scope->FalseBiasedRegions) { in classifyBiasedScopes()
1269 for (SelectInst *SI : Scope->TrueBiasedSelects) { in classifyBiasedScopes()
1274 for (SelectInst *SI : Scope->FalseBiasedSelects) { in classifyBiasedScopes()
1281 void CHR::classifyBiasedScopes(CHRScope *Scope, CHRScope *OutermostScope) { in classifyBiasedScopes() argument
1282 for (RegInfo &RI : Scope->RegInfos) { in classifyBiasedScopes()
1301 for (CHRScope *Sub : Scope->Subs) { in classifyBiasedScopes()
1306 static bool hasAtLeastTwoBiasedBranches(CHRScope *Scope) { in hasAtLeastTwoBiasedBranches() argument
1307 unsigned NumBiased = Scope->TrueBiasedRegions.size() + in hasAtLeastTwoBiasedBranches()
1308 Scope->FalseBiasedRegions.size() + in hasAtLeastTwoBiasedBranches()
1309 Scope->TrueBiasedSelects.size() + in hasAtLeastTwoBiasedBranches()
1310 Scope->FalseBiasedSelects.size(); in hasAtLeastTwoBiasedBranches()
1316 for (CHRScope *Scope : Input) { in filterScopes()
1318 if (!hasAtLeastTwoBiasedBranches(Scope)) { in filterScopes()
1320 << Scope->TrueBiasedRegions.size() in filterScopes()
1321 << " falsy-regions " << Scope->FalseBiasedRegions.size() in filterScopes()
1322 << " true-selects " << Scope->TrueBiasedSelects.size() in filterScopes()
1323 << " false-selects " << Scope->FalseBiasedSelects.size() << "\n"); in filterScopes()
1328 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1335 Output.push_back(Scope); in filterScopes()
1341 for (CHRScope *Scope : Input) { in setCHRRegions()
1342 assert(Scope->HoistStopMap.empty() && Scope->CHRRegions.empty() && in setCHRRegions()
1344 setCHRRegions(Scope, Scope); in setCHRRegions()
1345 Output.push_back(Scope); in setCHRRegions()
1347 dbgs() << "setCHRRegions HoistStopMap " << *Scope << "\n"; in setCHRRegions()
1348 for (auto pair : Scope->HoistStopMap) { in setCHRRegions()
1356 for (RegInfo &RI : Scope->CHRRegions) { in setCHRRegions()
1362 void CHR::setCHRRegions(CHRScope *Scope, CHRScope *OutermostScope) { in setCHRRegions() argument
1367 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1373 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1407 for (CHRScope *Sub : Scope->Subs) in setCHRRegions()
1472 static void hoistScopeConditions(CHRScope *Scope, Instruction *HoistPoint, in hoistScopeConditions() argument
1476 for (const RegInfo &RI : Scope->CHRRegions) { in hoistScopeConditions()
1478 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in hoistScopeConditions()
1479 bool IsFalseBiased = Scope->FalseBiasedRegions.count(R); in hoistScopeConditions()
1482 hoistValue(BI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions()
1486 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in hoistScopeConditions()
1487 bool IsFalseBiased = Scope->FalseBiasedSelects.count(SI); in hoistScopeConditions()
1490 hoistValue(SI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions()
1500 CHRScope *Scope) { in negateICmpIfUsedByBranchOrSelectOnly() argument
1527 if (Scope->TrueBiasedSelects.count(SI)) { in negateICmpIfUsedByBranchOrSelectOnly()
1528 assert(!Scope->FalseBiasedSelects.contains(SI) && in negateICmpIfUsedByBranchOrSelectOnly()
1530 Scope->FalseBiasedSelects.insert(SI); in negateICmpIfUsedByBranchOrSelectOnly()
1531 } else if (Scope->FalseBiasedSelects.count(SI)) { in negateICmpIfUsedByBranchOrSelectOnly()
1532 assert(!Scope->TrueBiasedSelects.contains(SI) && in negateICmpIfUsedByBranchOrSelectOnly()
1534 Scope->TrueBiasedSelects.insert(SI); in negateICmpIfUsedByBranchOrSelectOnly()
1547 static void insertTrivialPHIs(CHRScope *Scope, in insertTrivialPHIs() argument
1551 for (RegInfo &RI : Scope->RegInfos) { in insertTrivialPHIs()
1610 assertCHRRegionsHaveBiasedBranchOrSelect(CHRScope *Scope) { in assertCHRRegionsHaveBiasedBranchOrSelect() argument
1612 auto HasBiasedBranchOrSelect = [](RegInfo &RI, CHRScope *Scope) { in assertCHRRegionsHaveBiasedBranchOrSelect() argument
1613 if (Scope->TrueBiasedRegions.count(RI.R) || in assertCHRRegionsHaveBiasedBranchOrSelect()
1614 Scope->FalseBiasedRegions.count(RI.R)) in assertCHRRegionsHaveBiasedBranchOrSelect()
1617 if (Scope->TrueBiasedSelects.count(SI) || in assertCHRRegionsHaveBiasedBranchOrSelect()
1618 Scope->FalseBiasedSelects.count(SI)) in assertCHRRegionsHaveBiasedBranchOrSelect()
1622 for (RegInfo &RI : Scope->CHRRegions) { in assertCHRRegionsHaveBiasedBranchOrSelect()
1623 assert(HasBiasedBranchOrSelect(RI, Scope) && in assertCHRRegionsHaveBiasedBranchOrSelect()
1632 CHRScope *Scope, BasicBlock *PreEntryBlock) { in assertBranchOrSelectConditionHoisted() argument
1634 for (RegInfo &RI : Scope->CHRRegions) { in assertBranchOrSelectConditionHoisted()
1636 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in assertBranchOrSelectConditionHoisted()
1637 bool IsFalseBiased = Scope->FalseBiasedRegions.count(R); in assertBranchOrSelectConditionHoisted()
1645 !Scope->contains(I)) && in assertBranchOrSelectConditionHoisted()
1650 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in assertBranchOrSelectConditionHoisted()
1651 bool IsFalseBiased = Scope->FalseBiasedSelects.count(SI); in assertBranchOrSelectConditionHoisted()
1659 !Scope->contains(I)) && in assertBranchOrSelectConditionHoisted()
1666 void CHR::transformScopes(CHRScope *Scope, DenseSet<PHINode *> &TrivialPHIs) { in transformScopes() argument
1667 CHR_DEBUG(dbgs() << "transformScopes " << *Scope << "\n"); in transformScopes()
1669 assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region"); in transformScopes()
1670 Region *FirstRegion = Scope->RegInfos[0].R; in transformScopes()
1672 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R; in transformScopes()
1683 insertTrivialPHIs(Scope, EntryBlock, ExitBlock, TrivialPHIs); in transformScopes()
1694 << " at " << *Scope->BranchInsertPoint << "\n"); in transformScopes()
1696 SplitBlock(EntryBlock, Scope->BranchInsertPoint, &DT); in transformScopes()
1706 cloneScopeBlocks(Scope, PreEntryBlock, ExitBlock, LastRegion, VMap); in transformScopes()
1714 assertCHRRegionsHaveBiasedBranchOrSelect(Scope); in transformScopes()
1718 hoistScopeConditions(Scope, PreEntryBlock->getTerminator(), TrivialPHIs, DT); in transformScopes()
1721 assertBranchOrSelectConditionHoisted(Scope, PreEntryBlock); in transformScopes()
1726 fixupBranchesAndSelects(Scope, PreEntryBlock, MergedBr, in transformScopes()
1733 void CHR::cloneScopeBlocks(CHRScope *Scope, in cloneScopeBlocks() argument
1744 for (RegInfo &RI : Scope->RegInfos) in cloneScopeBlocks()
1812 void CHR::fixupBranchesAndSelects(CHRScope *Scope, in fixupBranchesAndSelects() argument
1820 for (RegInfo &RI : Scope->CHRRegions) { in fixupBranchesAndSelects()
1823 fixupBranch(R, Scope, IRB, MergedCondition, CHRBranchBias); in fixupBranchesAndSelects()
1827 fixupSelect(SI, Scope, IRB, MergedCondition, CHRBranchBias); in fixupBranchesAndSelects()
1854 void CHR::fixupBranch(Region *R, CHRScope *Scope, in fixupBranch() argument
1858 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in fixupBranch()
1859 assert((IsTrueBiased || Scope->FalseBiasedRegions.count(R)) && in fixupBranch()
1885 addToMergedCondition(ConditionTrue, Cond, BI, Scope, IRB, in fixupBranch()
1898 void CHR::fixupSelect(SelectInst *SI, CHRScope *Scope, in fixupSelect() argument
1902 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in fixupSelect()
1904 Scope->FalseBiasedSelects.count(SI)) && "Must be biased"); in fixupSelect()
1913 addToMergedCondition(IsTrueBiased, Cond, SI, Scope, IRB, in fixupSelect()
1924 Instruction *BranchOrSelect, CHRScope *Scope, in addToMergedCondition() argument
1932 !negateICmpIfUsedByBranchOrSelectOnly(ICmp, BranchOrSelect, Scope)) in addToMergedCondition()
1950 for (CHRScope *Scope : CHRScopes) { in transformScopes()
1951 transformScopes(Scope, TrivialPHIs); in transformScopes()
1963 for (CHRScope *Scope : Scopes) { in dumpScopes()
1964 dbgs() << *Scope << "\n"; in dumpScopes()