Home
last modified time | relevance | path

Searched full:strategy (Results 1 – 25 of 385) sorted by relevance

12345678910>>...16

/llvm-project/mlir/include/mlir/Dialect/Affine/
H A DLoopFusionUtils.h42 /// Describes the fusion strategy to be used in the Affine loop fusion
56 // assumptions about a specific fusion strategy from AffineLoopFusion pass
74 /// Construct a generic or producer-consumer fusion strategy.
75 FusionStrategy(StrategyEnum strategy) : strategy(strategy) { in FusionStrategy() argument
76 assert(strategy != Sibling && in FusionStrategy()
77 "Sibling fusion strategy requires a specific memref"); in FusionStrategy()
80 /// Construct a sibling fusion strategy targeting 'memref'. This construct
82 FusionStrategy(Value memref) : strategy(Sibling), memref(memref) {} in FusionStrategy()
84 /// Returns the fusion strategy.
85 StrategyEnum getStrategy() const { return strategy; }; in getStrategy()
[all …]
/llvm-project/llvm/include/llvm/Analysis/
H A DGenericDomTreeUpdater.h36 : Strategy(Strategy_) {} in GenericDomTreeUpdater()
38 : DT(&DT_), Strategy(Strategy_) {} in GenericDomTreeUpdater()
40 : DT(DT_), Strategy(Strategy_) {} in GenericDomTreeUpdater()
42 : PDT(&PDT_), Strategy(Strategy_) {} in GenericDomTreeUpdater()
44 : PDT(PDT_), Strategy(Strategy_) {} in GenericDomTreeUpdater()
47 : DT(&DT_), PDT(&PDT_), Strategy(Strategy_) {} in GenericDomTreeUpdater()
50 : DT(DT_), PDT(PDT_), Strategy(Strategy_) {}
58 /// Returns true if the current strategy is Lazy. in isLazy()
59 bool isLazy() const { return Strategy == UpdateStrategy::Lazy; }
61 /// Returns true if the current strategy i
213 const UpdateStrategy Strategy; global() variable
[all...]
H A DGenericDomTreeUpdaterImpl.h30 if (Strategy == UpdateStrategy::Eager) { in recalculate()
64 if (Strategy == UpdateStrategy::Lazy) { in applyUpdates()
124 if (Strategy == UpdateStrategy::Lazy) in applyUpdatesPermissive()
140 if (Strategy == UpdateStrategy::Lazy) { in getDomTree()
186 if (Strategy == UpdateStrategy::Eager) { in dump()
276 if (Strategy != UpdateStrategy::Lazy || !DomTree) in applyPostDomTreeUpdates()
352 if (Strategy == UpdateStrategy::Eager)
/llvm-project/llvm/include/llvm/FuzzMutate/
H A DIRMutator.h39 /// Provide a weight to bias towards choosing this strategy for a mutation.
42 /// distinct ways in which this strategy can mutate a unit". This can also be
55 llvm_unreachable("Strategy does not implement any mutators"); in mutate()
80 /// Mutate given module. No change will be made if no strategy is selected.
88 /// Strategy that injects operations into the function.
111 /// Strategy that deletes instructions when the Module is too large.
122 /// Strategy that modifies instruction attributes and operands.
134 /// Strategy that generates new function calls and inserts function signatures
148 /// Strategy to split a random block and insert a random CFG in between.
168 /// Strategy to insert PHI Nodes at the head of each basic block.
[all …]
/llvm-project/llvm/include/llvm/Support/
H A DThreading.h131 /// Retrieves the max available threads for the current strategy. This
146 /// Build a strategy from a number of threads as a string provided in \p Num.
148 /// strategy, we attempt to equally allocate the threads on all CPU sockets.
149 /// "0" or an empty string will return the \p Default strategy.
154 /// Returns a thread strategy for tasks requiring significant memory or other
156 /// be less efficient. Avoid this strategy if doing lots of I/O. Currently
168 /// Like heavyweight_hardware_concurrency() above, but builds a strategy
170 /// If \p Num is invalid, returns a default strategy where one thread per
180 /// Returns a default thread strategy where all available hardware resources
190 /// Like hardware_concurrency() above, but builds a strategy
[all...]
/llvm-project/flang/lib/Lower/
H A DConvertArrayConstructor.cpp26 // - Strategy 1: runtime approach (RuntimeTempStrategy).
27 // This strategy works will all array constructors, but will create more
36 // - Strategy 2: inlined temporary approach (InlinedTempStrategyImpl)
37 // This strategy can only be used if the array constructor extent and length
44 // - Strategy 3: "function of the indices" approach (AsElementalStrategy)
45 // This strategy can only be used if the array constructor extent and length
54 // strategy = selectArrayCtorLoweringStrategy(array-ctor-expr);
57 // strategy.pushValue(ac-value);
59 // strategy.startImpliedDo(lower, upper, stride);
60 // strategy
[all...]
/llvm-project/mlir/lib/Dialect/Affine/Transforms/
H A DSuperVectorize.cpp45 /// Implements a high-level vectorization strategy on a Function.
631 VectorizationStrategy *strategy) { in vectorizeLoopIfProfitable() argument
634 if (patternDepth - depthInPattern > strategy->vectorSizes.size()) { in vectorizeLoopIfProfitable()
638 strategy->loopToVectorDim[loop] = in vectorizeLoopIfProfitable()
639 strategy->vectorSizes.size() - (patternDepth - depthInPattern); in vectorizeLoopIfProfitable()
642 /// Implements a simple strawman strategy for vectorization.
643 /// Given a matched pattern `matches` of depth `patternDepth`, this strategy
647 /// load/store MemRefs, this creates a generic vectorization strategy that works
660 VectorizationStrategy *strategy) { in analyzeProfitability() argument
663 patternDepth, strategy))) { in analyzeProfitability()
766 const VectorizationStrategy *strategy = nullptr; global() member
937 getVectorType(Type scalarTy,const VectorizationStrategy * strategy) getVectorType() argument
1099 isUniformDefinition(Value value,const VectorizationStrategy * strategy) isUniformDefinition() argument
1301 const VectorizationStrategy &strategy = *state.strategy; vectorizeAffineForOp() local
1563 vectorizeLoopNest(std::vector<SmallVector<AffineForOp,2>> & loops,const VectorizationStrategy & strategy) vectorizeLoopNest() argument
1634 vectorizeRootMatch(NestedMatch m,const VectorizationStrategy & strategy) vectorizeRootMatch() argument
1722 VectorizationStrategy strategy; vectorizeLoops() local
1887 vectorizeAffineLoopNest(std::vector<SmallVector<AffineForOp,2>> & loops,const VectorizationStrategy & strategy) vectorizeAffineLoopNest() argument
[all...]
/llvm-project/clang/test/Modules/
H A Dpr62796.cppm38 constexpr unsigned long Compute(Number<10ul>, auto strategy)
40 return strategy(Recursive(10ul));
43 template<unsigned long N, typename Strategy = DefaultStrategy>
44 constexpr unsigned long Cache = Compute(Number<N>{}, Strategy{});
/llvm-project/lldb/test/API/functionalities/breakpoint/inlined_breakpoints/
H A DTestInlinedBreakpoints.py31 # With the inline-breakpoint-strategy, our file+line breakpoint should
33 self.runCmd("settings set target.inline-breakpoint-strategy headers")
43 self.runCmd("settings set target.inline-breakpoint-strategy always")
46 lambda: self.runCmd("settings set target.inline-breakpoint-strategy always")
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Datomic_load_add.ll1 ; RUN: llc -mtriple=amdgcn -amdgpu-atomic-optimizer-strategy=None -verify-machineinstrs < %s | File…
2 ; RUN: llc -mtriple=amdgcn -mcpu=tonga -mattr=-flat-for-global -amdgpu-atomic-optimizer-strategy=No…
3 ; RUN: llc -mtriple=amdgcn -mcpu=gfx900 -amdgpu-atomic-optimizer-strategy=None -verify-machineinstr…
4 ; RUN: llc -mtriple=r600 -mcpu=redwood -amdgpu-atomic-optimizer-strategy=None < %s | FileCheck -che…
H A Datomic_load_sub.ll1 ; RUN: llc -mtriple=amdgcn -amdgpu-atomic-optimizer-strategy=None -verify-machineinstrs < %s | File…
2 ; RUN: llc -mtriple=amdgcn -mcpu=tonga -mattr=-flat-for-global -amdgpu-atomic-optimizer-strategy=No…
3 ; RUN: llc -mtriple=amdgcn -mcpu=gfx900 -mattr=-flat-for-global -amdgpu-atomic-optimizer-strategy=N…
4 ; RUN: llc -mtriple=r600 -mcpu=redwood -amdgpu-atomic-optimizer-strategy=None < %s | FileCheck -ena…
H A Dlower-module-lds-offsets.ll2 ; RUN: opt -S -mtriple=amdgcn-- -amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=module | FileCheck -check-prefix=OPT %s
3 ; RUN: opt -S -mtriple=amdgcn-- -passes=amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=module | FileCheck -check-prefix=OPT %s
4 ; RUN: llc -mtriple=amdgcn -mcpu=gfx900 -verify-machineinstrs < %s --amdgpu-lower-module-lds-strategy=module | FileCheck -check-prefix=GCN %s
H A Dlower-module-lds-single-var-ambiguous.ll2 …amdgcn-- -passes=amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=module | FileChec…
3 …amdgcn-- -passes=amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=table | FileCheck…
4 …amdgcn-- -passes=amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=kernel 2>&1 | Fil…
5 …amdgcn-- -passes=amdgpu-lower-module-lds < %s --amdgpu-lower-module-lds-strategy=hybrid | FileChec…
/llvm-project/llvm/include/llvm/IR/
H A DGCStrategy.h86 /// Return the name of the GC strategy. This is the value of the collector
87 /// name string specified on functions which use this strategy.
90 /// Returns true if this strategy is expecting the use of gc.statepoints,
109 "GC strategy has useRS4GC but not useStatepoints set"); in useRS4GC()
137 /// "my custom supper fancy gc strategy");
/llvm-project/llvm/test/CodeGen/RISCV/
H A Dmachine-combiner-strategies.ll3 ; RUN: -O1 -riscv-enable-machine-combiner=true -riscv-force-machine-combiner-strategy=local < %s | \
7 ; RUN: -O1 -riscv-enable-machine-combiner=true -riscv-force-machine-combiner-strategy=min-instr < %…
11 ; RUN: -O1 -riscv-enable-machine-combiner=true -riscv-force-machine-combiner-strategy=local < %s | \
15 ; RUN: -O1 -riscv-enable-machine-combiner=true -riscv-force-machine-combiner-strategy=min-instr < %…
/llvm-project/llvm/docs/
H A DGarbageCollection.rst18 First, you should pick a collector strategy. LLVM includes a number of built
20 Note that the collector strategy is a description of how LLVM should generate
24 Next, mark your generated functions as using your chosen collector strategy.
61 your final stack maps. Depending on the collector strategy chosen, this is
188 language. We try to mitigate this by providing built in collector strategy
201 IR features is specified by the selected :ref:`GC strategy description
211 The ``gc`` function attribute is used to specify the desired GC strategy to the
217 It is the selected GC strategy which defines the exact nature of the code
231 either implementation (on a per :ref:`GC strategy <plugin>` basis). Longer
251 :ref:`GC strategy <plugin>`. All calls to ``llvm.gcroot`` **must** reside
[all …]
/llvm-project/clang/unittests/Serialization/
H A DVarDeclConstantInitTest.cpp81 constexpr unsigned long Compute(Number<10ul>, auto strategy) in TEST_F()
83 return strategy(Recursive(10ul)); in TEST_F()
86 template<unsigned long N, typename Strategy = DefaultStrategy> in TEST_F()
87 constexpr unsigned long Cache = Compute(Number<N>{}, Strategy{}); in TEST_F()
/llvm-project/mlir/test/Dialect/SparseTensor/
H A Dsparse_parallel.mlir1 // RUN: mlir-opt %s --sparse-reinterpret-map -sparsification="parallelization-strategy=none" | \
3 // RUN: mlir-opt %s --sparse-reinterpret-map -sparsification="parallelization-strategy=dense-outer-…
5 // RUN: mlir-opt %s --sparse-reinterpret-map -sparsification="parallelization-strategy=any-storage-…
7 // RUN: mlir-opt %s --sparse-reinterpret-map -sparsification="parallelization-strategy=dense-any-lo…
9 // RUN: mlir-opt %s --sparse-reinterpret-map -sparsification="parallelization-strategy=any-storage-…
/llvm-project/clang-tools-extra/pseudo/
H A DDesignNotes.md
/llvm-project/clang-tools-extra/clang-include-fixer/
H A DSymbolIndexManager.h37 auto Strategy = std::launch::async; in addSymbolIndex() local
39 auto Strategy = std::launch::deferred; in addSymbolIndex()
41 SymbolIndices.push_back(std::async(Strategy, F)); in addSymbolIndex()
/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DResourceManager.h11 /// strategy. These classes are managed by the Scheduler.
46 /// Resource allocation strategy used by hardware scheduler resources.
61 /// The default strategy uses this information to bias its selection logic.
65 /// Default resource allocation strategy used by processor resource groups and
98 /// by other groups other than the one associated with this strategy object.
103 /// this group. The idea is to bias the selection strategy, so that resources
108 /// usage. Therefore, this strategy is expected to be less accurate when same
382 // Overrides the selection strategy for the processor resource with the given
391 // Overrides the selection strategy for the resource at index ResourceID in in setCustomStrategy()
/llvm-project/mlir/lib/Dialect/SparseTensor/Transforms/Utils/
H A DSparseTensorIterator.h180 void setSparseEmitStrategy(SparseEmitStrategy strategy) { in setSparseEmitStrategy()
181 emitStrategy = strategy;
378 SparseEmitStrategy strategy = SparseEmitStrategy::kFunctional);
384 SparseEmitStrategy strategy);
390 Value stride, Value size, SparseEmitStrategy strategy);
396 Value padHigh, SparseEmitStrategy strategy);
403 SparseEmitStrategy strategy);
410 Value loopBound, unsigned stride, SparseEmitStrategy strategy);
178 setSparseEmitStrategy(SparseEmitStrategy strategy) setSparseEmitStrategy() argument
/llvm-project/clang-tools-extra/include-cleaner/lib/
H A DIncludeSpeller.cpp23 // Fallback strategy to default spelling via header search.
54 for (const auto &Strategy : in spellHeader() local
56 Result->push_back(Strategy.instantiate()); in spellHeader()
/llvm-project/llvm/lib/IR/
H A DBuiltinGCs.cpp46 /// A GC strategy for uncooperative targets. This implements lowering for the
60 /// lowering strategy. This GCStrategy is intended to suitable as a default
88 /// A GCStrategy for the CoreCLR Runtime. The strategy is similar to
128 "an example strategy for statepoint");
/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPassRegistry.def90 [=](ScanOptions Strategy) {
91 return AMDGPUAtomicOptimizerPass(*this, Strategy);
93 parseAMDGPUAtomicOptimizerStrategy, "strategy=dpp|iterative|none")

12345678910>>...16