| /freebsd-src/sys/contrib/device-tree/Bindings/dma/ti/ |
| H A D | k3-udma.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 5 --- 6 $id: http://devicetree.org/schemas/dma/ti/k3-udma.yaml# 7 $schema: http://devicetree.org/meta-schemas/core.yaml# 12 - Peter Ujfalusi <peter.ujfalusi@gmail.com> 15 The UDMA-P is intended to perform similar (but significantly upgraded) 16 functions as the packet-oriented DMA used on previous SoC devices. The UDMA-P 18 The UDMA-P architecture facilitates the segmentation and reassembly of SoC DMA 29 on the Rx PSI-L interface. 31 The UDMA-P also supports acting as both a UTC and UDMA-C for its internal [all …]
|
| H A D | k3-pktdma.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 5 --- 6 $id: http://devicetree.org/schemas/dma/ti/k3-pktdma.yaml# 7 $schema: http://devicetree.org/meta-schemas/core.yaml# 12 - Peter Ujfalusi <peter.ujfalusi@gmail.com> 16 mode channels of K3 UDMA-P. 17 PKTDMA only includes Split channels to service PSI-L based peripherals. 19 The peripherals can be PSI-L native or legacy, non PSI-L native peripherals 20 with PDMAs. PDMA is tasked to act as a bridge between the PSI-L fabric and the 27 - $ref: /schemas/dma/dma-controller.yaml# [all …]
|
| H A D | k3-bcdma.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 5 --- 6 $id: http://devicetree.org/schemas/dma/ti/k3-bcdma.yaml# 7 $schema: http://devicetree.org/meta-schemas/core.yaml# 12 - Peter Ujfalusi <peter.ujfalusi@gmail.com> 16 mode channels of K3 UDMA-P. 23 Split channels can be used to service PSI-L based peripherals. 24 The peripherals can be PSI-L native or legacy, non PSI-L native peripherals 25 with PDMAs. PDMA is tasked to act as a bridge between the PSI-L fabric and the 34 - ti,am62a-dmss-bcdma-csirx [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopLoadElimination.cpp | 1 //===- LoopLoadElimination.cpp - Loop Load Elimination Pass -------- 151 doesStoreDominatesAllLatches(BasicBlock * StoreBlock,Loop * L,DominatorTree * DT) doesStoreDominatesAllLatches() argument 161 isLoadConditional(LoadInst * Load,Loop * L) isLoadConditional() argument 170 LoadEliminationForLoop(Loop * L,LoopInfo * LI,const LoopAccessInfo & LAI,DominatorTree * DT,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI) LoadEliminationForLoop() argument 172 LoadEliminationForLoop(Loop * L,LoopInfo * LI,const LoopAccessInfo & LAI,DominatorTree * DT,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI) LoadEliminationForLoop() argument 614 Loop *L; global() member in __anon93c422380311::LoadEliminationForLoop 625 ProfileSummaryInfo *PSI; global() member in __anon93c422380311::LoadEliminationForLoop 634 eliminateLoadsAcrossLoops(Function & F,LoopInfo & LI,DominatorTree & DT,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,ScalarEvolution * SE,AssumptionCache * AC,LoopAccessInfoManager & LAIs) eliminateLoadsAcrossLoops() argument 679 auto *PSI = MAMProxy.getCachedResult<ProfileSummaryAnalysis>(*F.getParent()); run() local [all...] |
| H A D | LoopUnrollPass.cpp | 1 //===- LoopUnroll.cpp - Loop unroller pass -------- 184 gatherUnrollingPreferences(Loop * L,ScalarEvolution & SE,const TargetTransformInfo & TTI,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter & ORE,int OptLevel,std::optional<unsigned> UserThreshold,std::optional<unsigned> UserCount,std::optional<bool> UserAllowPartial,std::optional<bool> UserRuntime,std::optional<bool> UserUpperBound,std::optional<unsigned> UserFullUnrollMaxCount) gatherUnrollingPreferences() argument 185 gatherUnrollingPreferences(Loop * L,ScalarEvolution & SE,const TargetTransformInfo & TTI,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter & ORE,int OptLevel,std::optional<unsigned> UserThreshold,std::optional<unsigned> UserCount,std::optional<bool> UserAllowPartial,std::optional<bool> UserRuntime,std::optional<bool> UserUpperBound,std::optional<unsigned> UserFullUnrollMaxCount) gatherUnrollingPreferences() argument 350 analyzeLoopUnrollCost(const Loop * L,unsigned TripCount,DominatorTree & DT,ScalarEvolution & SE,const SmallPtrSetImpl<const Value * > & EphValues,const TargetTransformInfo & TTI,unsigned MaxUnrolledLoopSize,unsigned MaxIterationsCountToAnalyze) analyzeLoopUnrollCost() argument 669 UnrollCostEstimator(const Loop * L,const TargetTransformInfo & TTI,const SmallPtrSetImpl<const Value * > & EphValues,unsigned BEInsns) UnrollCostEstimator() argument 704 getUnrollMetadataForLoop(const Loop * L,StringRef Name) getUnrollMetadataForLoop() argument 711 hasUnrollFullPragma(const Loop * L) hasUnrollFullPragma() argument 717 hasUnrollEnablePragma(const Loop * L) hasUnrollEnablePragma() argument 722 hasRuntimeUnrollDisablePragma(const Loop * L) hasRuntimeUnrollDisablePragma() argument 728 unrollCountPragmaValue(const Loop * L) unrollCountPragmaValue() argument 759 shouldPragmaUnroll(Loop * L,const PragmaInfo & PInfo,const unsigned TripMultiple,const unsigned TripCount,unsigned MaxTripCount,const UnrollCostEstimator UCE,const TargetTransformInfo::UnrollingPreferences & UP) shouldPragmaUnroll() argument 791 shouldFullUnroll(Loop * L,const TargetTransformInfo & TTI,DominatorTree & DT,ScalarEvolution & SE,const SmallPtrSetImpl<const Value * > & EphValues,const unsigned FullUnrollTripCount,const UnrollCostEstimator UCE,const TargetTransformInfo::UnrollingPreferences & UP) shouldFullUnroll() argument 877 computeUnrollCount(Loop * L,const TargetTransformInfo & TTI,DominatorTree & DT,LoopInfo * LI,AssumptionCache * AC,ScalarEvolution & SE,const SmallPtrSetImpl<const Value * > & EphValues,OptimizationRemarkEmitter * ORE,unsigned TripCount,unsigned MaxTripCount,bool MaxOrZero,unsigned TripMultiple,const UnrollCostEstimator & UCE,TargetTransformInfo::UnrollingPreferences & UP,TargetTransformInfo::PeelingPreferences & PP,bool & UseUpperBound) computeUnrollCount() argument 1110 tryToUnrollLoop(Loop * L,DominatorTree & DT,LoopInfo * LI,ScalarEvolution & SE,const TargetTransformInfo & TTI,AssumptionCache & AC,OptimizationRemarkEmitter & ORE,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,bool PreserveLCSSA,int OptLevel,bool OnlyFullUnroll,bool OnlyWhenForced,bool ForgetAllSCEV,std::optional<unsigned> ProvidedCount,std::optional<unsigned> ProvidedThreshold,std::optional<bool> ProvidedAllowPartial,std::optional<bool> ProvidedRuntime,std::optional<bool> ProvidedUpperBound,std::optional<bool> ProvidedAllowPeeling,std::optional<bool> ProvidedAllowProfileBasedPeeling,std::optional<unsigned> ProvidedFullUnrollMaxCount) tryToUnrollLoop() argument 1113 tryToUnrollLoop(Loop * L,DominatorTree & DT,LoopInfo * LI,ScalarEvolution & SE,const TargetTransformInfo & TTI,AssumptionCache & AC,OptimizationRemarkEmitter & ORE,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,bool PreserveLCSSA,int OptLevel,bool OnlyFullUnroll,bool OnlyWhenForced,bool ForgetAllSCEV,std::optional<unsigned> ProvidedCount,std::optional<unsigned> ProvidedThreshold,std::optional<bool> ProvidedAllowPartial,std::optional<bool> ProvidedRuntime,std::optional<bool> ProvidedUpperBound,std::optional<bool> ProvidedAllowPeeling,std::optional<bool> ProvidedAllowProfileBasedPeeling,std::optional<unsigned> ProvidedFullUnrollMaxCount) tryToUnrollLoop() argument 1387 runOnLoop(Loop * L,LPPassManager & LPM) runOnLoop() argument 1456 run(Loop & L,LoopAnalysisManager & AM,LoopStandardAnalysisResults & AR,LPMUpdater & Updater) run() argument 1560 ProfileSummaryInfo *PSI = run() local 1572 for (const auto &L : LI) { run() local 1588 Loop &L = *Worklist.pop_back_val(); run() local [all...] |
| H A D | SimpleLoopUnswitch.cpp | 1 ///===- SimpleLoopUnswitch.cpp - Hoist loop-invariant control flow ------- 191 collectHomogenousInstGraphLoopInvariants(const Loop & L,Instruction & Root,const LoopInfo & LI) collectHomogenousInstGraphLoopInvariants() argument 233 replaceLoopInvariantUses(const Loop & L,Value * Invariant,Constant & Replacement) replaceLoopInvariantUses() argument 250 areLoopExitPHIsLoopInvariant(const Loop & L,const BasicBlock & ExitingBB,const BasicBlock & ExitBB) areLoopExitPHIsLoopInvariant() argument 292 buildPartialInvariantUnswitchConditionalBranch(BasicBlock & BB,ArrayRef<Value * > ToDuplicate,bool Direction,BasicBlock & UnswitchedSucc,BasicBlock & NormalSucc,Loop & L,MemorySSAUpdater * MSSAU) buildPartialInvariantUnswitchConditionalBranch() argument 407 hoistLoopToNewParent(Loop & L,BasicBlock & Preheader,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE) hoistLoopToNewParent() argument 507 unswitchTrivialBranch(Loop & L,BranchInst & BI,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchTrivialBranch() argument 738 unswitchTrivialSwitch(Loop & L,SwitchInst & SI,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchTrivialSwitch() argument 1039 unswitchAllTrivialConditions(Loop & L,DominatorTree & DT,LoopInfo & LI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU) unswitchAllTrivialConditions() argument 1159 buildClonedLoopBlocks(Loop & L,BasicBlock * LoopPH,BasicBlock * SplitBB,ArrayRef<BasicBlock * > ExitBlocks,BasicBlock * ParentBB,BasicBlock * UnswitchedSuccBB,BasicBlock * ContinueSuccBB,const SmallDenseMap<BasicBlock *,BasicBlock *,16> & DominatingSucc,ValueToValueMapTy & VMap,SmallVectorImpl<DominatorTree::UpdateType> & DTUpdates,AssumptionCache & AC,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE) buildClonedLoopBlocks() argument 1384 Loop *ClonedParentL, *L; cloneLoopNest() local 1659 deleteDeadClonedBlocks(Loop & L,ArrayRef<BasicBlock * > ExitBlocks,ArrayRef<std::unique_ptr<ValueToValueMapTy>> VMaps,DominatorTree & DT,MemorySSAUpdater * MSSAU) deleteDeadClonedBlocks() argument 1688 deleteDeadBlocksFromLoop(Loop & L,SmallVectorImpl<BasicBlock * > & ExitBlocks,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU,ScalarEvolution * SE,LPMUpdater & LoopUpdater) deleteDeadBlocksFromLoop() argument 1782 recomputeLoopBlockSet(Loop & L,LoopInfo & LI) recomputeLoopBlockSet() argument 1893 rebuildLoopAfterUnswitch(Loop & L,ArrayRef<BasicBlock * > ExitBlocks,LoopInfo & LI,SmallVectorImpl<Loop * > & HoistedLoops,ScalarEvolution * SE) rebuildLoopAfterUnswitch() argument 1971 __anon920b5e5e1102(Loop &L, SmallPtrSetImpl<BasicBlock *> &UnloopedBlocks) rebuildLoopAfterUnswitch() argument 2125 postUnswitch(Loop & L,LPMUpdater & U,StringRef LoopName,bool CurrentLoopValid,bool PartiallyInvariant,bool InjectedCondition,ArrayRef<Loop * > NewLoops) postUnswitch() argument 2163 unswitchNontrivialInvariants(Loop & L,Instruction & TI,ArrayRef<Value * > Invariants,IVConditionInfo & PartialIVInfo,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,LPMUpdater & LoopUpdater,bool InsertFreeze,bool InjectedCondition) unswitchNontrivialInvariants() argument 2741 turnGuardIntoBranch(IntrinsicInst * GI,Loop & L,DominatorTree & DT,LoopInfo & LI,MemorySSAUpdater * MSSAU) turnGuardIntoBranch() argument 2798 CalculateUnswitchCostMultiplier(const Instruction & TI,const Loop & L,const LoopInfo & LI,const DominatorTree & DT,ArrayRef<NonTrivialUnswitchCandidate> UnswitchCandidates) CalculateUnswitchCostMultiplier() argument 2879 collectUnswitchCandidates(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,IVConditionInfo & PartialIVInfo,Instruction * & PartialIVCondBranch,const Loop & L,const LoopInfo & LI,AAResults & AA,const MemorySSAUpdater * MSSAU) collectUnswitchCandidates() argument 2974 canonicalizeForInvariantConditionInjection(ICmpInst::Predicate & Pred,Value * & LHS,Value * & RHS,BasicBlock * & IfTrue,BasicBlock * & IfFalse,const Loop & L) canonicalizeForInvariantConditionInjection() argument 3000 shouldTryInjectInvariantCondition(const ICmpInst::Predicate Pred,const Value * LHS,const Value * RHS,const BasicBlock * IfTrue,const BasicBlock * IfFalse,const Loop & L) shouldTryInjectInvariantCondition() argument 3060 injectPendingInvariantConditions(NonTrivialUnswitchCandidate Candidate,Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,MemorySSAUpdater * MSSAU) injectPendingInvariantConditions() argument 3159 insertCandidatesWithPendingInjections(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,Loop & L,ICmpInst::Predicate Pred,ArrayRef<CompareDesc> Compares,const DominatorTree & DT) insertCandidatesWithPendingInjections() argument 3198 collectUnswitchCandidatesWithInjections(SmallVectorImpl<NonTrivialUnswitchCandidate> & UnswitchCandidates,IVConditionInfo & PartialIVInfo,Instruction * & PartialIVCondBranch,Loop & L,const DominatorTree & DT,const LoopInfo & LI,AAResults & AA,const MemorySSAUpdater * MSSAU) collectUnswitchCandidatesWithInjections() argument 3251 isSafeForNoNTrivialUnswitching(Loop & L,LoopInfo & LI) isSafeForNoNTrivialUnswitching() argument 3295 findBestNonTrivialUnswitchCandidate(ArrayRef<NonTrivialUnswitchCandidate> UnswitchCandidates,const Loop & L,const DominatorTree & DT,const LoopInfo & LI,AssumptionCache & AC,const TargetTransformInfo & TTI,const IVConditionInfo & PartialIVInfo) findBestNonTrivialUnswitchCandidate() argument 3451 shouldInsertFreeze(Loop & L,Instruction & TI,DominatorTree & DT,AssumptionCache & AC) shouldInsertFreeze() argument 3471 unswitchBestCondition(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,LPMUpdater & LoopUpdater) unswitchBestCondition() argument 3564 unswitchLoop(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,bool Trivial,bool NonTrivial,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,LPMUpdater & LoopUpdater) unswitchLoop() argument 3568 unswitchLoop(Loop & L,DominatorTree & DT,LoopInfo & LI,AssumptionCache & AC,AAResults & AA,TargetTransformInfo & TTI,bool Trivial,bool NonTrivial,ScalarEvolution * SE,MemorySSAUpdater * MSSAU,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,LPMUpdater & LoopUpdater) unswitchLoop() argument 3611 __anon920b5e5e1e02(const Loop *L) unswitchLoop() argument 3659 run(Loop & L,LoopAnalysisManager & AM,LoopStandardAnalysisResults & AR,LPMUpdater & U) run() argument 3664 ProfileSummaryInfo *PSI = nullptr; run() local [all...] |
| /freebsd-src/share/doc/usd/21.troff/ |
| H A D | table2 | 1 .\" Copyright (C) Caldera International Inc. 2001-2002. All rights reserved. 60 Input Naming Conventions for \', \`, and \- 61 and for Non-ASCII Special Characters 68 Non-\s-1ASCII\s+1 characters and \fIminus\fP on the standard fonts. 87 - \- hyphen or 89 \- \e\- current font minus 125 Non-\s-1ASCII\s+1 characters and \', \`, \_\|, \(pl, \(mi, \(eq, and \(** on the special font. 131 \fIonly\fR on the special font and are printed as a 1-em space if that font 143 .ch cl \nmu-\n(.vu-1u 165 \(*l \e\|(*l lambda [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.h | 1 //===- llvm/Transforms/Vectorize/LoopVectorizationLegality.h ----*- C++ -*-===// 5 // SPDX-License-Identifie 243 LoopVectorizationLegality(Loop * L,PredicatedScalarEvolution & PSE,DominatorTree * DT,TargetTransformInfo * TTI,TargetLibraryInfo * TLI,Function * F,LoopAccessInfoManager & LAIs,LoopInfo * LI,OptimizationRemarkEmitter * ORE,LoopVectorizationRequirements * R,LoopVectorizeHints * H,DemandedBits * DB,AssumptionCache * AC,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI) LoopVectorizationLegality() argument 247 LoopVectorizationLegality(Loop * L,PredicatedScalarEvolution & PSE,DominatorTree * DT,TargetTransformInfo * TTI,TargetLibraryInfo * TLI,Function * F,LoopAccessInfoManager & LAIs,LoopInfo * LI,OptimizationRemarkEmitter * ORE,LoopVectorizationRequirements * R,LoopVectorizeHints * H,DemandedBits * DB,AssumptionCache * AC,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI) LoopVectorizationLegality() argument 544 ProfileSummaryInfo *PSI; global() variable [all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 1 //===--- SelectOptimize.cpp - Convert select to branches if profitable ---===// 5 // SPDX-License-Identifier: Apache-2. 108 ProfileSummaryInfo *PSI = nullptr; global() member in __anoncb22ebf70111::SelectOptimizeImpl 471 Loop *L = LI->getLoopFor(&BB); optimizeSelectsBase() local 800 findProfitableSIGroupsInnerLoops(const Loop * L,SelectGroups & SIGroups,SelectGroups & ProfSIGroups) findProfitableSIGroupsInnerLoops() argument 1041 checkLoopHeuristics(const Loop * L,const CostInfo LoopCost[2]) checkLoopHeuristics() argument 1111 computeLoopCosts(const Loop * L,const SelectGroups & SIGroups,DenseMap<const Instruction *,CostInfo> & InstCostMap,CostInfo * LoopCost) computeLoopCosts() argument [all...] |
| H A D | MachineBlockPlacement.cpp | 1 //===- MachineBlockPlacement.cpp - Basic Block Code Layout optimization ---===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===- 400 ProfileSummaryInfo *PSI = nullptr; global() member in __anonf11810ff0111::MachineBlockPlacement 1667 __anonf11810ff0302(std::tuple<BranchProbability, MachineBasicBlock *> L, std::tuple<BranchProbability, MachineBasicBlock *> R) selectBestSuccessor() argument 2077 findBestLoopTopHelper(MachineBasicBlock * OldTop,const MachineLoop & L,const BlockFilterSet & LoopBlockSet) findBestLoopTopHelper() argument 2145 findBestLoopTop(const MachineLoop & L,const BlockFilterSet & LoopBlockSet) findBestLoopTop() argument 2176 findBestLoopExit(const MachineLoop & L,const BlockFilterSet & LoopBlockSet,BlockFrequency & ExitFreq) findBestLoopExit() argument 2421 rotateLoopWithProfile(BlockChain & LoopChain,const MachineLoop & L,const BlockFilterSet & LoopBlockSet) rotateLoopWithProfile() argument 2562 collectLoopBlockSet(const MachineLoop & L) collectLoopBlockSet() argument 2603 buildLoopChains(const MachineLoop & L) buildLoopChains() argument 2918 MachineLoop *L = MLI->getLoopFor(ChainBB); alignBlocks() local 3601 __anonf11810ff0a02(MachineBasicBlock &L, MachineBasicBlock &R) assignBlockOrder() argument [all...] |
| /freebsd-src/contrib/mandoc/ |
| H A D | eqn.7 | 27 language is an equation-formatting language. 59 case-sensitive literals in the input: 60 .Bd -literal -offset indent 91 White-space consists of the space, tab, circumflex, and tilde 109 lambda, mu, nu, omega, omicron, phi, pi, psi, rho, sigma, tau, theta, 110 upsilon, xi, zeta, DELTA, GAMMA, LAMBDA, OMEGA, PHI, PI, PSI, SIGMA, 113 differential), times (multiply), cdot (center-dot), nothing (zero-width 114 space), approx (approximately equals), prime (prime), half (one-half), 116 (much less), <\- (left arrow), \-> (right arrow), +\- (plus-minus), != 117 (not equal), == (equivalence), <= (less-than-equal), and >= [all …]
|
| H A D | mandoc_char.7 | 5 .\" Copyright (c) 2011, 2013, 2015, 2017-2020, 2022 61 In particular, in English manual pages, do not use special-character 67 the en-dash (\(en), 68 the em-dash (\(em), 75 .Bd -unfilled -offset indent 76 blue-eyed 77 lorry-driver 80 The en-dash is used to separate the two elements of a range, 81 or can be used the same way as an em-das [all...] |
| H A D | chars.c | 60 { "rn", "-", 0x203e }, 91 { "em", "--", 0x2014 }, 92 { "en", "-", 0x2013 }, 93 { "hy", "-", 0x2010 }, 129 { "lt", ",-", 0x23a7 }, 130 { "bracelefttp", ",-", 0x23a7 }, 133 { "lb", "`-", 0x23a9 }, 134 { "braceleftbt", "`-", 0x23a9 }, 136 { "rt", "- [all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------- 253 ProfileSummaryInfo *PSI; global() member in __anon3da3c46d0111::CallAnalyzer 498 CallAnalyzer(Function & Callee,CallBase & Call,const TargetTransformInfo & TTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<BlockFrequencyInfo & (Function &)> GetBFI=nullptr,ProfileSummaryInfo * PSI=nullptr,OptimizationRemarkEmitter * ORE=nullptr) CallAnalyzer() argument 1102 InlineCostCallAnalyzer(Function & Callee,CallBase & Call,const InlineParams & Params,const TargetTransformInfo & TTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<BlockFrequencyInfo & (Function &)> GetBFI=nullptr,ProfileSummaryInfo * PSI=nullptr,OptimizationRemarkEmitter * ORE=nullptr,bool BoostIndirect=true,bool IgnoreThreshold=false) InlineCostCallAnalyzer() argument 1346 InlineCostFeaturesAnalyzer(const TargetTransformInfo & TTI,function_ref<AssumptionCache & (Function &)> & GetAssumptionCache,function_ref<BlockFrequencyInfo & (Function &)> GetBFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter * ORE,Function & Callee,CallBase & Call) InlineCostFeaturesAnalyzer() argument 2932 getInlineCost(CallBase & Call,const InlineParams & Params,TargetTransformInfo & CalleeTTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<const TargetLibraryInfo & (Function &)> GetTLI,function_ref<BlockFrequencyInfo & (Function &)> GetBFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter * ORE) getInlineCost() argument 2941 getInliningCostEstimate(CallBase & Call,TargetTransformInfo & CalleeTTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<BlockFrequencyInfo & (Function &)> GetBFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter * ORE) getInliningCostEstimate() argument 2966 getInliningCostFeatures(CallBase & Call,TargetTransformInfo & CalleeTTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<BlockFrequencyInfo & (Function &)> GetBFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter * ORE) getInliningCostFeatures() argument 3052 getInlineCost(CallBase & Call,Function * Callee,const InlineParams & Params,TargetTransformInfo & CalleeTTI,function_ref<AssumptionCache & (Function &)> GetAssumptionCache,function_ref<const TargetLibraryInfo & (Function &)> GetTLI,function_ref<BlockFrequencyInfo & (Function &)> GetBFI,ProfileSummaryInfo * PSI,OptimizationRemarkEmitter * ORE) getInlineCost() argument 3243 ProfileSummaryInfo PSI(*M); run() local [all...] |
| H A D | InlineOrder.cpp | 1 //===- InlineOrder.cpp - Inlining order abstraction -*- C++ ---*--- 49 ProfileSummaryInfo *PSI = getInlineCostWrapper() local 203 hasLowerPriority(const CallBase * L,const CallBase * R) const hasLowerPriority() argument 236 __anon8bc167500502(const CallBase *L, const CallBase *R) PriorityInlineOrder() argument [all...] |
| /freebsd-src/sys/contrib/device-tree/Bindings/media/ |
| H A D | ti,j721e-csi2rx-shim.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 3 --- 4 $id: http://devicetree.org/schemas/media/ti,j721e-csi2rx-shim.yaml# 5 $schema: http://devicetree.org/meta-schemas/core.yaml# 11 enables sending captured frames to memory over PSI-L DMA. In the J721E 16 - Jai Luthra <j-luthra@ti.com> 20 const: ti,j721e-csi2rx-shim 25 dma-names: 27 - const: rx0 32 power-domains: [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | UnrollLoop.h | 1 //===- llvm/Transforms/Utils/UnrollLoop.h - Unrolling utilities -*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exceptio [all...] |
| /freebsd-src/contrib/netbsd-tests/sys/uvm/ |
| H A D | t_uvm_physseg_load.c | 3 /*- 57 /* Testing API - assumes userland */ 114 #define mutex_enter(l) argument 115 #define mutex_exit(l) argument 169 /* end - Provide Kernel API equivalents */ 173 #include <atf-c.h> 220 printf("%s: seg->start == %ld\n", __func__, in uvm_physseg_dump_seg() 222 printf("%s: seg->end == %ld\n", __func__, in uvm_physseg_dump_seg() 224 printf("%s: seg->avail_start == %ld\n", __func__, in uvm_physseg_dump_seg() 226 printf("%s: seg->avail_end == %ld\n", __func__, in uvm_physseg_dump_seg() [all …]
|
| /freebsd-src/tools/tools/locale/etc/charmaps/ |
| H A D | ISO8859-7.TXT | 3 # Name: ISO 8859-7:2003 to Unicode 7 # Date: 2003-Nov-12 10 # Copyright (c) 1991-2003 Unicode, Inc. All Rights reserved. 12 # This file is provided as-is by Unicode, Inc. (The Unicode Consortium). 29 # ISO 8859-7:2003 characters map into Unicode. 31 # ISO 8859-7:1987 is equivalent to ISO-IR-126, ELOT 928, 32 # and ECMA 118. ISO 8859-7:2003 adds two currency signs 35 # Format: Three tab-separated columns 36 # Column #1 is the ISO 8859-7 code (in hex as 0xXX) 40 # The entries are in ISO 8859-7 order. [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 1 //===- SampleProfile.cpp - Incorporate sample profiles into the IR -------- 768 __anone4875bea0202(const FunctionSamples *L, const FunctionSamples *R) findIndirectCallFunctionSamples() argument 948 __anone4875bea0302(const InstrProfValueData &L, const InstrProfValueData &R) updateIDTMetaData() argument 2400 const auto &L = LastMatchedNonAnchors[I]; runStaleProfileMatching() local 2727 ProfileSummaryInfo *PSI = &AM.getResult<ProfileSummaryAnalysis>(M); run() local [all...] |
| /freebsd-src/sys/dev/enetc/ |
| H A D | enetc_hw.h | 1 /* SPDX-License-Identifier: (GPL-2.0+ OR BSD-3-Clause) */ 2 /* Copyright 2017-2019 NXP */ 11 #define GENMASK(h, l) (((~0U) - (1U << (l)) + 1) & (~0U >> (32 - 1 - (h)))) argument 52 /* VF-PF Message passing */ 111 /** SI BDR sub-blocks, n = 0..7 */ 448 uint32_t sip_h[4]; /* Big-endian */ 449 uint32_t sip_m[4]; /* Big-endian */ 450 uint32_t dip_h[4]; /* Big-endian */ 451 uint32_t dip_m[4]; /* Big-endian */ 484 /* VSI-PSI command message types */ [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 1 //===- PGOInstrumentation.cpp - MST-based PGO Instrumentation ------- 1042 PGOUseFunc(Function & Func,Module * Modu,TargetLibraryInfo & TLI,std::unordered_multimap<Comdat *,GlobalValue * > & ComdatMembers,BranchProbabilityInfo * BPI,BlockFrequencyInfo * BFIin,ProfileSummaryInfo * PSI,bool IsCS,bool InstrumentFuncEntry,bool HasSingleByteCoverage) PGOUseFunc() argument 1105 ProfileSummaryInfo *PSI; global() member in __anon44f3207d0511::PGOUseFunc 1963 annotateAllFunctions(Module & M,StringRef ProfileFileName,StringRef ProfileRemappingFileName,vfs::FileSystem & FS,function_ref<TargetLibraryInfo & (Function &)> LookupTLI,function_ref<BranchProbabilityInfo * (Function &)> LookupBPI,function_ref<BlockFrequencyInfo * (Function &)> LookupBFI,ProfileSummaryInfo * PSI,bool IsCS) annotateAllFunctions() argument 2172 auto *PSI = &MAM.getResult<ProfileSummaryAnalysis>(M); run() local [all...] |
| /freebsd-src/contrib/file/tests/ |
| H A D | HWP97.hwp.testfile | 1 …llo World HWP2016… 3 XH�N[�ύ\��;��!��,��n�%���l�#N�\���T.�X��}�)u�n�k롞%]��qۃ�"��,�jv �װ�a�/���^�����u�亮h��t{��… 4 d\އ�&R/[�7�-��ہ�}��A��%�䔓���_XZ�5-r]^�� 5 …�ǿ�F���5��)_�/d��l�#�bv�׃C-�νuYwu-E�#rY���a"�"��;>A�������7����{���$��܅y҅���\t�8���#S&O�貔�… 6 �1n��n$�d���-%R!6O�B��^묘j���-x��������6��J�}��F��NK�Y�Q�u�9��F�Ŋ��0��+&�Iw4�I��{�fߍǮ����9… 8 �7�s����-đ��0�uC�D:�:�Yޣ��I�D��~��:��~V��mqL�rQ9L�#������ 9�}\��q]ɰ^6�G�����]��Փ3Q�…
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 1 //===- LoopVectorize.cpp - A Loop Vectorizer -------- 436 getSmallBestKnownTC(ScalarEvolution & SE,Loop * L) getSmallBestKnownTC() argument 519 InnerLoopVectorizer(Loop * OrigLoop,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,ElementCount VecWidth,ElementCount MinProfitableTripCount,unsigned UnrollFactor,LoopVectorizationLegality * LVL,LoopVectorizationCostModel * CM,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,GeneratedRTChecks & RTChecks) InnerLoopVectorizer() argument 778 ProfileSummaryInfo *PSI; global() member in llvm::InnerLoopVectorizer 803 InnerLoopUnroller(Loop * OrigLoop,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,unsigned UnrollFactor,LoopVectorizationLegality * LVL,LoopVectorizationCostModel * CM,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,GeneratedRTChecks & Check) InnerLoopUnroller() argument 848 InnerLoopAndEpilogueVectorizer(Loop * OrigLoop,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,EpilogueLoopVectorizationInfo & EPI,LoopVectorizationLegality * LVL,llvm::LoopVectorizationCostModel * CM,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,GeneratedRTChecks & Checks) InnerLoopAndEpilogueVectorizer() argument 888 EpilogueVectorizerMainLoop(Loop * OrigLoop,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,EpilogueLoopVectorizationInfo & EPI,LoopVectorizationLegality * LVL,llvm::LoopVectorizationCostModel * CM,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,GeneratedRTChecks & Check) EpilogueVectorizerMainLoop() argument 917 EpilogueVectorizerEpilogueLoop(Loop * OrigLoop,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,const TargetLibraryInfo * TLI,const TargetTransformInfo * TTI,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,EpilogueLoopVectorizationInfo & EPI,LoopVectorizationLegality * LVL,llvm::LoopVectorizationCostModel * CM,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,GeneratedRTChecks & Checks) EpilogueVectorizerEpilogueLoop() argument 1062 getDebugLocString(const Loop * L) getDebugLocString() argument 1198 LoopVectorizationCostModel(ScalarEpilogueLowering SEL,Loop * L,PredicatedScalarEvolution & PSE,LoopInfo * LI,LoopVectorizationLegality * Legal,const TargetTransformInfo & TTI,const TargetLibraryInfo * TLI,DemandedBits * DB,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,const Function * F,const LoopVectorizeHints * Hints,InterleavedAccessInfo & IAI) LoopVectorizationCostModel() argument 1974 Create(Loop * L,const LoopAccessInfo & LAI,const SCEVPredicate & UnionPred,ElementCount VF,unsigned IC) Create() argument 2304 collectSupportedLoops(Loop & L,LoopInfo * LI,OptimizationRemarkEmitter * ORE,SmallVectorImpl<Loop * > & V) collectSupportedLoops() argument 4896 getVScaleForTuning(const Loop * L,const TargetTransformInfo & TTI) getVScaleForTuning() argument 7449 AddRuntimeUnrollDisableMetaData(Loop * L) AddRuntimeUnrollDisableMetaData() argument 7641 Loop *L = LI->getLoopFor(State.CFG.VPBB2IRBB[HeaderVPBB]); executePlan() local 9566 getScalarEpilogueLowering(Function * F,Loop * L,LoopVectorizeHints & Hints,ProfileSummaryInfo * PSI,BlockFrequencyInfo * BFI,TargetTransformInfo * TTI,TargetLibraryInfo * TLI,LoopVectorizationLegality & LVL,InterleavedAccessInfo * IAI) getScalarEpilogueLowering() argument 9615 processLoopInVPlanNativePath(Loop * L,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,LoopVectorizationLegality * LVL,TargetTransformInfo * TTI,TargetLibraryInfo * TLI,DemandedBits * DB,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,LoopVectorizeHints & Hints,LoopVectorizationRequirements & Requirements) processLoopInVPlanNativePath() argument 9619 processLoopInVPlanNativePath(Loop * L,PredicatedScalarEvolution & PSE,LoopInfo * LI,DominatorTree * DT,LoopVectorizationLegality * LVL,TargetTransformInfo * TTI,TargetLibraryInfo * TLI,DemandedBits * DB,AssumptionCache * AC,OptimizationRemarkEmitter * ORE,BlockFrequencyInfo * BFI,ProfileSummaryInfo * PSI,LoopVectorizeHints & Hints,LoopVectorizationRequirements & Requirements) processLoopInVPlanNativePath() argument 9681 checkMixedPrecision(Loop * L,OptimizationRemarkEmitter * ORE) checkMixedPrecision() argument 9724 areRuntimeChecksProfitable(GeneratedRTChecks & Checks,VectorizationFactor & VF,std::optional<unsigned> VScale,Loop * L,ScalarEvolution & SE,ScalarEpilogueLowering SEL) areRuntimeChecksProfitable() argument 9830 processLoop(Loop * L) processLoop() argument 10324 Loop *L = Worklist.pop_back_val(); runImpl() local 10363 ProfileSummaryInfo *PSI = run() local [all...] |
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | SwitchLoweringUtils.h | 1 //===- SwitchLoweringUtils.h - Switch Lowering ------------------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 108 /// multi-case switch statements. 192 JumpTableHeader(APInt F, APInt L, const Value *SV, MachineBasicBlock *H, 194 : First(std::move(F)), Last(std::move(L)), SValue(SV), HeaderBB(H), in First() 278 ProfileSummaryInfo *PSI, BlockFrequencyInfo *BFI); 308 /// create a near-optimal (in terms of search time given key frequency) binary
|