Lines Matching refs:Scope
273 auto *Scope = new CHRScope(TailRegInfos, TailSubs); in split() local
276 return Scope; in split()
327 for (CHRScope *Scope : Scopes) { in ~CHR()
328 delete Scope; in ~CHR()
340 if (CHRScope *Scope = findScopes(R, nullptr, nullptr, Output)) { in findScopes() local
341 Output.push_back(Scope); in findScopes()
347 void checkScopeHoistable(CHRScope *Scope);
351 SmallVector<CHRScope *, 8> splitScope(CHRScope *Scope,
359 void classifyBiasedScopes(CHRScope *Scope, CHRScope *OutermostScope);
366 void setCHRRegions(CHRScope *Scope, CHRScope *OutermostScope);
372 void transformScopes(CHRScope *Scope, DenseSet<PHINode *> &TrivialPHIs);
373 void cloneScopeBlocks(CHRScope *Scope,
382 void fixupBranchesAndSelects(CHRScope *Scope,
387 CHRScope *Scope,
391 CHRScope *Scope,
396 CHRScope *Scope,
434 raw_ostream &operator<<(raw_ostream &OS, const CHRScope &Scope) { in operator <<() argument
435 Scope.print(OS); in operator <<()
892 void CHR::checkScopeHoistable(CHRScope *Scope) { in checkScopeHoistable() argument
893 RegInfo &RI = Scope->RegInfos[0]; in checkScopeHoistable()
1125 static void getSelectsInScope(CHRScope *Scope, in getSelectsInScope() argument
1127 for (RegInfo &RI : Scope->RegInfos) in getSelectsInScope()
1130 for (CHRScope *Sub : Scope->Subs) in getSelectsInScope()
1136 for (CHRScope *Scope : Input) { in splitScopes()
1137 assert(!Scope->BranchInsertPoint && in splitScopes()
1140 getSelectsInScope(Scope, Unhoistables); in splitScopes()
1141 splitScope(Scope, nullptr, nullptr, nullptr, Output, Unhoistables); in splitScopes()
1144 for (CHRScope *Scope : Output) { in splitScopes()
1145 assert(Scope->BranchInsertPoint && "BranchInsertPoint must be set"); in splitScopes()
1151 CHRScope *Scope, in splitScope() argument
1168 SmallVector<RegInfo, 8> RegInfos(Scope->RegInfos); // Copy in splitScope()
1214 CHRScope *Tail = Scope->split(RI.R); in splitScope()
1216 Splits.push_back(Scope); in splitScope()
1220 Scope = Tail; in splitScope()
1237 Splits.push_back(Scope); in splitScope()
1281 for (CHRScope *Scope : Scopes) { in classifyBiasedScopes()
1282 assert(Scope->TrueBiasedRegions.empty() && Scope->FalseBiasedRegions.empty() && "Empty"); in classifyBiasedScopes()
1283 classifyBiasedScopes(Scope, Scope); in classifyBiasedScopes()
1285 dbgs() << "classifyBiasedScopes " << *Scope << "\n"; in classifyBiasedScopes()
1287 for (Region *R : Scope->TrueBiasedRegions) { in classifyBiasedScopes()
1292 for (Region *R : Scope->FalseBiasedRegions) { in classifyBiasedScopes()
1297 for (SelectInst *SI : Scope->TrueBiasedSelects) { in classifyBiasedScopes()
1302 for (SelectInst *SI : Scope->FalseBiasedSelects) { in classifyBiasedScopes()
1309 void CHR::classifyBiasedScopes(CHRScope *Scope, CHRScope *OutermostScope) { in classifyBiasedScopes() argument
1310 for (RegInfo &RI : Scope->RegInfos) { in classifyBiasedScopes()
1329 for (CHRScope *Sub : Scope->Subs) { in classifyBiasedScopes()
1334 static bool hasAtLeastTwoBiasedBranches(CHRScope *Scope) { in hasAtLeastTwoBiasedBranches() argument
1335 unsigned NumBiased = Scope->TrueBiasedRegions.size() + in hasAtLeastTwoBiasedBranches()
1336 Scope->FalseBiasedRegions.size() + in hasAtLeastTwoBiasedBranches()
1337 Scope->TrueBiasedSelects.size() + in hasAtLeastTwoBiasedBranches()
1338 Scope->FalseBiasedSelects.size(); in hasAtLeastTwoBiasedBranches()
1344 for (CHRScope *Scope : Input) { in filterScopes()
1346 if (!hasAtLeastTwoBiasedBranches(Scope)) { in filterScopes()
1348 << Scope->TrueBiasedRegions.size() in filterScopes()
1349 << " falsy-regions " << Scope->FalseBiasedRegions.size() in filterScopes()
1350 << " true-selects " << Scope->TrueBiasedSelects.size() in filterScopes()
1351 << " false-selects " << Scope->FalseBiasedSelects.size() << "\n"); in filterScopes()
1356 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1363 Output.push_back(Scope); in filterScopes()
1369 for (CHRScope *Scope : Input) { in setCHRRegions()
1370 assert(Scope->HoistStopMap.empty() && Scope->CHRRegions.empty() && in setCHRRegions()
1372 setCHRRegions(Scope, Scope); in setCHRRegions()
1373 Output.push_back(Scope); in setCHRRegions()
1375 dbgs() << "setCHRRegions HoistStopMap " << *Scope << "\n"; in setCHRRegions()
1376 for (auto pair : Scope->HoistStopMap) { in setCHRRegions()
1384 for (RegInfo &RI : Scope->CHRRegions) { in setCHRRegions()
1390 void CHR::setCHRRegions(CHRScope *Scope, CHRScope *OutermostScope) { in setCHRRegions() argument
1395 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1401 for (RegInfo &RI : Scope->RegInfos) { in setCHRRegions()
1435 for (CHRScope *Sub : Scope->Subs) in setCHRRegions()
1500 static void hoistScopeConditions(CHRScope *Scope, Instruction *HoistPoint, in hoistScopeConditions() argument
1504 for (const RegInfo &RI : Scope->CHRRegions) { in hoistScopeConditions()
1506 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in hoistScopeConditions()
1507 bool IsFalseBiased = Scope->FalseBiasedRegions.count(R); in hoistScopeConditions()
1510 hoistValue(BI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions()
1514 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in hoistScopeConditions()
1515 bool IsFalseBiased = Scope->FalseBiasedSelects.count(SI); in hoistScopeConditions()
1518 hoistValue(SI->getCondition(), HoistPoint, R, Scope->HoistStopMap, in hoistScopeConditions()
1528 CHRScope *Scope) { in negateICmpIfUsedByBranchOrSelectOnly() argument
1555 if (Scope->TrueBiasedSelects.count(SI)) { in negateICmpIfUsedByBranchOrSelectOnly()
1556 assert(Scope->FalseBiasedSelects.count(SI) == 0 && in negateICmpIfUsedByBranchOrSelectOnly()
1558 Scope->FalseBiasedSelects.insert(SI); in negateICmpIfUsedByBranchOrSelectOnly()
1559 } else if (Scope->FalseBiasedSelects.count(SI)) { in negateICmpIfUsedByBranchOrSelectOnly()
1560 assert(Scope->TrueBiasedSelects.count(SI) == 0 && in negateICmpIfUsedByBranchOrSelectOnly()
1562 Scope->TrueBiasedSelects.insert(SI); in negateICmpIfUsedByBranchOrSelectOnly()
1575 static void insertTrivialPHIs(CHRScope *Scope, in insertTrivialPHIs() argument
1579 for (RegInfo &RI : Scope->RegInfos) { in insertTrivialPHIs()
1638 assertCHRRegionsHaveBiasedBranchOrSelect(CHRScope *Scope) { in assertCHRRegionsHaveBiasedBranchOrSelect() argument
1640 auto HasBiasedBranchOrSelect = [](RegInfo &RI, CHRScope *Scope) { in assertCHRRegionsHaveBiasedBranchOrSelect() argument
1641 if (Scope->TrueBiasedRegions.count(RI.R) || in assertCHRRegionsHaveBiasedBranchOrSelect()
1642 Scope->FalseBiasedRegions.count(RI.R)) in assertCHRRegionsHaveBiasedBranchOrSelect()
1645 if (Scope->TrueBiasedSelects.count(SI) || in assertCHRRegionsHaveBiasedBranchOrSelect()
1646 Scope->FalseBiasedSelects.count(SI)) in assertCHRRegionsHaveBiasedBranchOrSelect()
1650 for (RegInfo &RI : Scope->CHRRegions) { in assertCHRRegionsHaveBiasedBranchOrSelect()
1651 assert(HasBiasedBranchOrSelect(RI, Scope) && in assertCHRRegionsHaveBiasedBranchOrSelect()
1660 CHRScope *Scope, BasicBlock *PreEntryBlock) { in assertBranchOrSelectConditionHoisted() argument
1662 for (RegInfo &RI : Scope->CHRRegions) { in assertBranchOrSelectConditionHoisted()
1664 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in assertBranchOrSelectConditionHoisted()
1665 bool IsFalseBiased = Scope->FalseBiasedRegions.count(R); in assertBranchOrSelectConditionHoisted()
1673 !Scope->contains(I)) && in assertBranchOrSelectConditionHoisted()
1678 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in assertBranchOrSelectConditionHoisted()
1679 bool IsFalseBiased = Scope->FalseBiasedSelects.count(SI); in assertBranchOrSelectConditionHoisted()
1687 !Scope->contains(I)) && in assertBranchOrSelectConditionHoisted()
1694 void CHR::transformScopes(CHRScope *Scope, DenseSet<PHINode *> &TrivialPHIs) { in transformScopes() argument
1695 CHR_DEBUG(dbgs() << "transformScopes " << *Scope << "\n"); in transformScopes()
1697 assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region"); in transformScopes()
1698 Region *FirstRegion = Scope->RegInfos[0].R; in transformScopes()
1700 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R; in transformScopes()
1711 insertTrivialPHIs(Scope, EntryBlock, ExitBlock, TrivialPHIs); in transformScopes()
1722 << " at " << *Scope->BranchInsertPoint << "\n"); in transformScopes()
1724 SplitBlock(EntryBlock, Scope->BranchInsertPoint, &DT); in transformScopes()
1734 cloneScopeBlocks(Scope, PreEntryBlock, ExitBlock, LastRegion, VMap); in transformScopes()
1742 assertCHRRegionsHaveBiasedBranchOrSelect(Scope); in transformScopes()
1746 hoistScopeConditions(Scope, PreEntryBlock->getTerminator(), TrivialPHIs, DT); in transformScopes()
1749 assertBranchOrSelectConditionHoisted(Scope, PreEntryBlock); in transformScopes()
1754 fixupBranchesAndSelects(Scope, PreEntryBlock, MergedBr, in transformScopes()
1761 void CHR::cloneScopeBlocks(CHRScope *Scope, in cloneScopeBlocks() argument
1772 for (RegInfo &RI : Scope->RegInfos) in cloneScopeBlocks()
1840 void CHR::fixupBranchesAndSelects(CHRScope *Scope, in fixupBranchesAndSelects() argument
1848 for (RegInfo &RI : Scope->CHRRegions) { in fixupBranchesAndSelects()
1851 fixupBranch(R, Scope, IRB, MergedCondition, CHRBranchBias); in fixupBranchesAndSelects()
1855 fixupSelect(SI, Scope, IRB, MergedCondition, CHRBranchBias); in fixupBranchesAndSelects()
1882 void CHR::fixupBranch(Region *R, CHRScope *Scope, in fixupBranch() argument
1886 bool IsTrueBiased = Scope->TrueBiasedRegions.count(R); in fixupBranch()
1887 assert((IsTrueBiased || Scope->FalseBiasedRegions.count(R)) && in fixupBranch()
1913 addToMergedCondition(ConditionTrue, Cond, BI, Scope, IRB, in fixupBranch()
1926 void CHR::fixupSelect(SelectInst *SI, CHRScope *Scope, in fixupSelect() argument
1930 bool IsTrueBiased = Scope->TrueBiasedSelects.count(SI); in fixupSelect()
1932 Scope->FalseBiasedSelects.count(SI)) && "Must be biased"); in fixupSelect()
1941 addToMergedCondition(IsTrueBiased, Cond, SI, Scope, IRB, in fixupSelect()
1953 CHRScope *Scope, in addToMergedCondition() argument
1964 if (negateICmpIfUsedByBranchOrSelectOnly(ICmp, BranchOrSelect, Scope)) { in addToMergedCondition()
1979 for (CHRScope *Scope : CHRScopes) { in transformScopes()
1980 transformScopes(Scope, TrivialPHIs); in transformScopes()
1992 for (CHRScope *Scope : Scopes) { in dumpScopes()
1993 dbgs() << *Scope << "\n"; in dumpScopes()