Home
last modified time | relevance | path

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

123

/netbsd-src/external/bsd/file/dist/magic/magdir/
H A Dplan94 # plan9: file(1) magic for AT&T Bell Labs' Plan 9 executables and object files
7 0 belong 0x00000107 Plan 9 executable, Motorola 68k
8 0 belong 0x00000197 Plan 9 executable, AT&T Hobbit
9 0 belong 0x000001EB Plan 9 executable, Intel 386
10 0 belong 0x00000247 Plan 9 executable, Intel 960
11 0 belong 0x000002AB Plan 9 executable, SPARC
12 0 belong 0x00000407 Plan 9 executable, MIPS R3000
13 0 belong 0x0000048B Plan 9 executable, AT&T DSP 3210
14 0 belong 0x00000517 Plan 9 executable, MIPS R4000 BE
15 0 belong 0x000005AB Plan 9 executable, AMD 29000
[all …]
H A Dcommands70 # AT&T Bell Labs' Plan 9 shell
71 0 string/fwt #!\ /bin/rc Plan 9 rc shell script text executable
H A Dwordprocessors242 # Corel Plan Perfect
245 >>>9 byte x Corel Plan Perfect: Unknown filetype %d
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.cpp20 Loop *OrigLoop, VPlanPtr &Plan, in VPInstructionsToVPRecipes() argument
24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry()); in VPInstructionsToVPRecipes()
51 VPValue *Start = Plan->getOrAddVPValue(II.getStartValue()); in VPInstructionsToVPRecipes()
54 Plan->addVPValue(Phi, VPPhi); in VPInstructionsToVPRecipes()
64 *Load, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), in VPInstructionsToVPRecipes()
68 *Store, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), in VPInstructionsToVPRecipes()
69 Plan->getOrAddVPValue(Store->getValueOperand()), in VPInstructionsToVPRecipes()
73 GEP, Plan->mapToVPValues(GEP->operands()), OrigLoop); in VPInstructionsToVPRecipes()
76 *CI, Plan->mapToVPValues(CI->arg_operands())); in VPInstructionsToVPRecipes()
81 *SI, Plan->mapToVPValues(SI->operands()), InvariantCond); in VPInstructionsToVPRecipes()
[all …]
H A DVPRecipeBuilder.h72 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);
H A 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()
H A DVPlanHCFGBuilder.cpp43 VPlan &Plan; member in __anond1976ce30111::PlainCFGBuilder
74 : TheLoop(Lp), LI(LI), Plan(P) {} in PlainCFGBuilder()
186 Plan.addExternalDef(NewVPVal); in getOrCreateVPOperand()
262 Plan.addExternalDef(VPV); in buildPlainCFG()
339 PlainCFGBuilder PCFGBuilder(TheLoop, LI, Plan); in buildPlainCFG()
347 Plan.setEntry(TopRegion); in buildHierarchicalCFG()
348 LLVM_DEBUG(Plan.setName("HCFGBuilder: Plain CFG\n"); dbgs() << Plan); in buildHierarchicalCFG()
358 VPLoopInfo &VPLInfo = Plan.getVPLoopInfo(); in buildHierarchicalCFG()
H A DVPlan.cpp135 VPlan *VPBlockBase::getPlan() { return getPlanEntry(this)->Plan; } in getPlan()
137 const VPlan *VPBlockBase::getPlan() const { return getPlanEntry(this)->Plan; } in getPlan()
157 Plan = ParentPlan; in setPlan()
842 if (!Plan.getName().empty()) in dump()
843 OS << "\\n" << DOT::EscapeString(Plan.getName()); in dump()
844 if (Plan.BackedgeTakenCount) { in dump()
846 Plan.BackedgeTakenCount->print(OS, SlotTracker); in dump()
854 for (const VPBlockBase *Block : depth_first(Plan.getEntry())) in dump()
1235 VPInterleavedAccessInfo::VPInterleavedAccessInfo(VPlan &Plan, in VPInterleavedAccessInfo() argument
1238 visitRegion(cast<VPRegionBlock>(Plan.getEntry()), Old2New, IAI); in VPInterleavedAccessInfo()
[all …]
H A DVPlanHCFGBuilder.h48 VPlan &Plan; variable
64 : TheLoop(Lp), LI(LI), Plan(P) {} in VPlanHCFGBuilder()
H A DVPlanPredicator.h32 VPlan &Plan; variable
68 VPlanPredicator(VPlan &Plan);
H A DVPlanValue.h405 void assignSlots(const VPlan &Plan);
408 VPSlotTracker(const VPlan *Plan = nullptr) {
409 if (Plan)
410 assignSlots(*Plan);
H A DLoopVectorize.cpp3931 VPValue *Def = State.Plan->getVPValue(KV.first); in truncateToMinimalBitwidths()
4043 VPValue *Def = State.Plan->getVPValue(KV.first); in truncateToMinimalBitwidths()
4118 VPBasicBlock *Header = State.Plan->getEntry()->getEntryBasicBlock(); in fixCrossIterationPHIs()
4204 VPValue *PhiDef = State.Plan->getVPValue(Phi); in fixFirstOrderRecurrence()
4205 VPValue *PreviousDef = State.Plan->getVPValue(Previous); in fixFirstOrderRecurrence()
4333 VPValue *LoopExitInstDef = State.Plan->getVPValue(LoopExitInst); in fixReduction()
4523 Value *V = State.get(State.Plan->getVPValue(Cur), Part); in clearReductionWrapFlags()
4558 : State.get(State.Plan->getVPValue(IncomingValue), in fixLCSSAPHIs()
4631 cast<VPWidenPHIRecipe>(State.Plan->getVPValue(OrigPhi)); in fixNonInductionPHIs()
8037 erase_if(VPlans, [VF](const VPlanPtr &Plan) { in setBestPlan() argument
[all …]
H A DLoopVectorizationPlanner.h312 return any_of(VPlans, [&](const VPlanPtr &Plan) { in hasPlanWithVFs()
314 return Plan->hasVF(VF); in hasPlanWithVFs()
358 void adjustRecipesForInLoopReductions(VPlanPtr &Plan,
H A DVPlanTransforms.h28 Loop *OrigLoop, VPlanPtr &Plan,
H A DVPlan.h197 InnerLoopVectorizer *ILV, VPlan *Plan) in VPTransformState()
199 Plan(Plan) {} in VPTransformState()
341 VPlan *Plan; member
411 VPlan *Plan = nullptr; variable
2105 const VPlan &Plan;
2145 : OS(O), Plan(P), SlotTracker(&P) {}
2163 inline raw_ostream &operator<<(raw_ostream &OS, const VPlan &Plan) {
2164 Plan.print(OS);
2309 VPInterleavedAccessInfo(VPlan &Plan, InterleavedAccessInfo &IAI);
/netbsd-src/external/bsd/openldap/dist/doc/rfc/
H A Drfc2377.txt17 Naming Plan for Internet Directory-Enabled Applications
60 RFC 2377 A Directory Naming Plan September 1998
116 RFC 2377 A Directory Naming Plan September 1998
172 RFC 2377 A Directory Naming Plan September 1998
228 RFC 2377 A Directory Naming Plan September 1998
284 RFC 2377 A Directory Naming Plan September 1998
340 RFC 2377 A Directory Naming Plan September 1998
396 RFC 2377 A Directory Naming Plan September 1998
452 RFC 2377 A Directory Naming Plan September 1998
508 RFC 2377 A Directory Naming Plan September 1998
[all …]
H A DINDEX8 rfc2377.txt LDAP Naming Plan (I)
/netbsd-src/external/apache2/llvm/dist/llvm/docs/Proposals/
H A DVectorizationPlan.rst2 Vectorization Plan
17 The Vectorization Plan is an explicit model for describing vectorization
32 2. Plan Step:
212 tree, where TSLP [3]_ adds Plan Step 2.b.
217 3. Loop Vectorizer: the Vectorization Plan aims to upgrade the infrastructure of
H A DVariableNames.rst2 Variable Names Plan
264 Provisional Plan
/netbsd-src/distrib/syspkg/notes/
H A DWORKPLAN1 Work Plan: NetBSD System Packages
H A DPROPOSAL15 A. Working Plan
249 A. Working Plan
/netbsd-src/share/misc/
H A Dworld.phone256 # * These countries are part of the North America Numbering Plan
/netbsd-src/external/mpl/dhcp/dist/doc/devel/
H A Dqa.dox69 They are described by a separate document called DHCP Test Plan.
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DOpaquePointers.rst86 Transition Plan
/netbsd-src/external/bsd/libbind/dist/doc/
H A Dhesiod.cat352 `Hesiod - Project Athena Technical Plan -- Name Service'

123