Home
last modified time | relevance | path

Searched refs:Plan (Results 1 – 25 of 40) sorted by relevance

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPRecipeBuilder.h72 VPValue *createBlockInMask(BasicBlock *BB, VPlanPtr &Plan);
76 VPValue *createEdgeMask(BasicBlock *Src, BasicBlock *Dst, VPlanPtr &Plan);
99 tryToWidenMemory(Instruction *I, VFRange &Range, VPlanPtr &Plan);
111 VPBlendRecipe *tryToBlend(Instruction *I, VPlanPtr &Plan);
124 VPlanPtr &Plan);
134 bool tryToCreateRecipe(Instruction *Instr, VFRange &Range, VPlanPtr &Plan,
146 VPlanPtr &Plan);
DVPlanPredicator.cpp236 predicateRegionRec(cast<VPRegionBlock>(Plan.getEntry())); in predicate()
239 linearizeRegionRec(cast<VPRegionBlock>(Plan.getEntry())); in predicate()
242 VPlanPredicator::VPlanPredicator(VPlan &Plan) in VPlanPredicator() argument
243 : Plan(Plan), VPLI(&(Plan.getVPLoopInfo())) { in VPlanPredicator()
247 VPDomTree.recalculate(*(cast<VPRegionBlock>(Plan.getEntry()))); in VPlanPredicator()
DVPlanHCFGBuilder.cpp43 VPlan &Plan; member in __anon7920bfa20111::PlainCFGBuilder
74 : TheLoop(Lp), LI(LI), Plan(P) {} in PlainCFGBuilder()
184 Plan.addExternalDef(NewVPVal); in getOrCreateVPOperand()
331 PlainCFGBuilder PCFGBuilder(TheLoop, LI, Plan); in buildPlainCFG()
339 Plan.setEntry(TopRegion); in buildHierarchicalCFG()
340 LLVM_DEBUG(Plan.setName("HCFGBuilder: Plain CFG\n"); dbgs() << Plan); in buildHierarchicalCFG()
350 VPLoopInfo &VPLInfo = Plan.getVPLoopInfo(); in buildHierarchicalCFG()
DVPlanTransforms.cpp20 Loop *OrigLoop, VPlanPtr &Plan, in VPInstructionsToVPRecipes() argument
24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry()); in VPInstructionsToVPRecipes()
35 Plan->addCBV(NCondBit); in VPInstructionsToVPRecipes()
60 *Inst, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), in VPInstructionsToVPRecipes()
DVPlanHCFGBuilder.h48 VPlan &Plan; variable
64 : TheLoop(Lp), LI(LI), Plan(P) {} in VPlanHCFGBuilder()
DVPlanPredicator.h32 VPlan &Plan; variable
68 VPlanPredicator(VPlan &Plan);
DVPlan.cpp534 if (!Plan.getName().empty()) in dump()
535 OS << "\\n" << DOT::EscapeString(Plan.getName()); in dump()
536 if (!Plan.Value2VPValue.empty() || Plan.BackedgeTakenCount) { in dump()
538 if (Plan.BackedgeTakenCount) in dump()
539 OS << "\\n" << *Plan.BackedgeTakenCount << " := BackedgeTakenCount"; in dump()
540 for (auto Entry : Plan.Value2VPValue) { in dump()
551 for (const VPBlockBase *Block : depth_first(Plan.getEntry())) in dump()
801 VPInterleavedAccessInfo::VPInterleavedAccessInfo(VPlan &Plan, in VPInterleavedAccessInfo() argument
804 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI); in VPInterleavedAccessInfo()
DVPlanTransforms.h28 Loop *OrigLoop, VPlanPtr &Plan,
DLoopVectorizationPlanner.h252 for (const auto &Plan : VPlans) in printPlans() local
253 O << *Plan; in printPlans()
DLoopVectorize.cpp6548 erase_if(VPlans, [VF](const VPlanPtr &Plan) { in setBestPlan() argument
6549 return !Plan->hasVF(VF); in setBestPlan()
6704 VPlanPtr &Plan) { in createEdgeMask() argument
6713 VPValue *SrcMask = createBlockInMask(Src, Plan); in createEdgeMask()
6722 VPValue *EdgeMask = Plan->getVPValue(BI->getCondition()); in createEdgeMask()
6734 VPValue *VPRecipeBuilder::createBlockInMask(BasicBlock *BB, VPlanPtr &Plan) { in createBlockInMask() argument
6752 VPValue *IV = Plan->getVPValue(Legal->getPrimaryInduction()); in createBlockInMask()
6753 VPValue *BTC = Plan->getOrCreateBackedgeTakenCount(); in createBlockInMask()
6760 VPValue *EdgeMask = createEdgeMask(Predecessor, BB, Plan); in createBlockInMask()
6777 VPlanPtr &Plan) { in tryToWidenMemory() argument
[all …]
DVPlan.h1470 friend inline raw_ostream &operator<<(raw_ostream &OS, const VPlan &Plan);
1476 const VPlan &Plan;
1483 VPlanPrinter(raw_ostream &O, const VPlan &P) : OS(O), Plan(P) {}
1530 inline raw_ostream &operator<<(raw_ostream &OS, const VPlan &Plan) {
1531 VPlanPrinter Printer(OS, Plan);
1657 VPInterleavedAccessInfo(VPlan &Plan, InterleavedAccessInfo &IAI);
/third_party/ninja/src/
Dbuild.cc78 Plan::Plan(Builder* builder) in Plan() function in Plan
84 void Plan::Reset() { in Reset()
91 bool Plan::AddTarget(const Node* target, string* err) { in AddTarget()
95 bool Plan::AddSubTarget(const Node* node, const Node* dependent, string* err, in AddSubTarget()
145 void Plan::EdgeWanted(const Edge* edge) { in EdgeWanted()
151 Edge* Plan::FindWork() { in FindWork()
160 void Plan::ScheduleWork(map<Edge*, Want>::iterator want_e) { in ScheduleWork()
182 bool Plan::EdgeFinished(Edge* edge, EdgeResult result, string* err) { in EdgeFinished()
210 bool Plan::NodeFinished(Node* node, string* err) { in NodeFinished()
233 bool Plan::EdgeMaybeReady(map<Edge*, Want>::iterator want_e, string* err) { in EdgeMaybeReady()
[all …]
Dbuild.h40 struct Plan { struct
41 Plan(Builder* builder = NULL);
217 Plan plan_;
Dbuild_test.cc37 Plan plan_;
74 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
82 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
107 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
112 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
139 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
144 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
149 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
154 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
181 plan_.EdgeFinished(edge, Plan::kEdgeSucceeded, &err); in TEST_F()
[all …]
Dgraph_test.cc353 Plan plan_; in TEST_F()
/third_party/libphonenumber/resources/geocoding/en/
D675.txt15 # Prefixes from National Numbering Plan for Papua New Guinea, found at
D98.txt17 # Numbering Plan received from Sony Ericsson [2012-04]
/third_party/libphonenumber/resources/carrier/en/
D383.txt17 # ARKEP, National Numbering Plan: http://www.arkep-rks.org/?cid=1,48
/third_party/gstreamer/gstreamer/docs/random/matth/
Dscheduling.txt121 + Paused -> Playing: jump back where you were in the Plan and continue
125 Plan (don't run)
/third_party/node/doc/guides/
Dbackporting-to-release-lines.md22 what can be landed. Our LTS release lines (see the [Release Plan][])
93 [Release Plan]: https://github.com/nodejs/Release#release-plan
/third_party/gstreamer/gstreamer/docs/random/
Dplan-0.11.txt1 Plan for 0.11
/third_party/pulseaudio/po/
Dfr.po298 msgstr "[%s:%u] Plan de canaux « %s » invalide."
1923 " --channel-map=CHANNELMAP Plan des canaux à utiliser à la "
1981 msgstr "Plan des canaux invalide « %s »"
2319 "Plan de canaux par défaut : %s\n"
2356 " Plan des canaux : %s\n"
2415 " Plan des canaux : %s\n"
2552 " Plan des canaux : %s\n"
2597 " Plan des canaux : %s\n"
2633 " Plan des canaux : %s\n"
/third_party/vk-gl-cts/doc/testspecs/VK/
Dapitests.adoc8 Vulkan API Test Plan
/third_party/node/doc/changelogs/
DCHANGELOG_V012.md53 [Node.js Long Term Support Plan](https://github.com/nodejs/LTS) and
/third_party/python/Tools/msi/bundle/bootstrap/
DPythonBootstrapperApplication.cpp2211 hr = _engine->Plan(action); in OnPlan()

12