HomeSort by: relevance | last modified time | path
    Searched refs:Plan (Results 1 - 13 of 13) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanTransforms.cpp 20 Loop *OrigLoop, VPlanPtr &Plan,
24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry());
51 VPValue *Start = Plan->getOrAddVPValue(II.getStartValue());
54 Plan->addVPValue(Phi, VPPhi);
64 *Load, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)),
68 *Store, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)),
69 Plan->getOrAddVPValue(Store->getValueOperand()),
73 GEP, Plan->mapToVPValues(GEP->operands()), OrigLoop);
76 *CI, Plan->mapToVPValues(CI->arg_operands()));
81 *SI, Plan->mapToVPValues(SI->operands()), InvariantCond)
    [all...]
VPlanHCFGBuilder.h 48 VPlan &Plan;
64 : TheLoop(Lp), LI(LI), Plan(P) {}
66 /// Build H-CFG for TheLoop and update Plan accordingly.
VPlanPredicator.h 32 VPlan &Plan;
34 // VPLoopInfo for Plan's HCFG.
37 // Dominator tree for Plan's HCFG.
68 VPlanPredicator(VPlan &Plan);
70 /// Predicate Plan's HCFG.
VPlanTransforms.h 25 /// Replaces the VPInstructions in \p Plan with corresponding
28 Loop *OrigLoop, VPlanPtr &Plan,
VPRecipeBuilder.h 72 VFRange &Range, VPlanPtr &Plan);
83 VFRange &Range, VPlan &Plan) const;
90 VPlanPtr &Plan);
120 VFRange &Range, VPlanPtr &Plan);
135 VPValue *createBlockInMask(BasicBlock *BB, VPlanPtr &Plan);
139 VPValue *createEdgeMask(BasicBlock *Src, BasicBlock *Dst, VPlanPtr &Plan);
161 VPlanPtr &Plan);
171 VPlanPtr &Plan);
VPlanPredicator.cpp 236 predicateRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
239 linearizeRegionRec(cast<VPRegionBlock>(Plan.getEntry()));
242 VPlanPredicator::VPlanPredicator(VPlan &Plan)
243 : Plan(Plan), VPLI(&(Plan.getVPLoopInfo())) {
247 VPDomTree.recalculate(*(cast<VPRegionBlock>(Plan.getEntry())));
VPlanHCFGBuilder.cpp 42 // Vectorization plan that we are working on.
43 VPlan &Plan;
74 : TheLoop(Lp), LI(LI), Plan(P) {}
186 Plan.addExternalDef(NewVPVal);
262 Plan.addExternalDef(VPV);
339 PlainCFGBuilder PCFGBuilder(TheLoop, LI, Plan);
347 Plan.setEntry(TopRegion);
348 LLVM_DEBUG(Plan.setName("HCFGBuilder: Plain CFG\n"); dbgs() << Plan);
357 // Compute VPLInfo and keep it in Plan
    [all...]
VPlanValue.h 1 //===- VPlanValue.h - Represent Values in Vectorizer Plan -----------------===//
405 void assignSlots(const VPlan &Plan);
408 VPSlotTracker(const VPlan *Plan = nullptr) {
409 if (Plan)
410 assignSlots(*Plan);
LoopVectorizationPlanner.h 268 /// A builder used to construct the current plan.
290 /// Plan how to best vectorize, return the best VF and its cost, or None if
292 Optional<VectorizationFactor> plan(ElementCount UserVF, unsigned UserIC);
294 /// Use the VPlan-native path to plan how to best vectorize, return the best
312 return any_of(VPlans, [&](const VPlanPtr &Plan) {
314 return Plan->hasVF(VF);
358 void adjustRecipesForInLoopReductions(VPlanPtr &Plan,
VPlan.cpp 1 //===- VPlan.cpp - Vectorizer Plan ----------------------------------------===//
10 /// This is the LLVM vectorization plan. It represents a candidate for
11 /// vectorization, allowing to plan and optimize how to vectorize a given loop
14 /// candidates and if profitable to execute the desired plan, generating vector
135 VPlan *VPBlockBase::getPlan() { return getPlanEntry(this)->Plan; }
137 const VPlan *VPBlockBase::getPlan() const { return getPlanEntry(this)->Plan; }
156 "Can only set plan on its entry block.");
157 Plan = ParentPlan;
841 OS << "graph [labelloc=t, fontsize=30; label=\"Vectorization Plan";
842 if (!Plan.getName().empty()
    [all...]
LoopVectorize.cpp 3931 VPValue *Def = State.Plan->getVPValue(KV.first);
4043 VPValue *Def = State.Plan->getVPValue(KV.first);
4118 VPBasicBlock *Header = State.Plan->getEntry()->getEntryBasicBlock();
4204 VPValue *PhiDef = State.Plan->getVPValue(Phi);
4205 VPValue *PreviousDef = State.Plan->getVPValue(Previous);
4333 VPValue *LoopExitInstDef = State.Plan->getVPValue(LoopExitInst);
4523 Value *V = State.get(State.Plan->getVPValue(Cur), Part);
4558 : State.get(State.Plan->getVPValue(IncomingValue),
4631 cast<VPWidenPHIRecipe>(State.Plan->getVPValue(OrigPhi));
7890 // doesn't have a cost model that can choose which plan to execute i
    [all...]
VPlan.h 1 //===- VPlan.h - Represent A Vectorizer Plan --------------------*- C++ -*-===//
10 /// This file contains the declarations of the Vectorization Plan base classes:
20 /// 6. The VPlanPrinter class providing a way to print a plan in dot format;
197 InnerLoopVectorizer *ILV, VPlan *Plan)
199 Plan(Plan) {}
341 VPlan *Plan;
410 /// plan.
411 VPlan *Plan = nullptr;
466 /// \return A pointer to the plan containing the current block
    [all...]
  /src/crypto/dist/ipsec-tools/misc/
cvs2cl.pl 25 # The Plan:
2475 # See "The Plan" above for a full explanation.

Completed in 39 milliseconds