Home
last modified time | relevance | path

Searched refs:benefit (Results 1 – 25 of 380) sorted by relevance

12345678910>>...16

/external/llvm-project/mlir/test/Dialect/PDL/
Dinvalid.mlir7 pdl.pattern : benefit(1) {
21 pdl.pattern : benefit(1) {
33 pdl.pattern : benefit(1) {
45 pdl.pattern : benefit(1) {
55 pdl.pattern : benefit(1) {
69 pdl.pattern : benefit(1) {
83 pdl.pattern : benefit(1) {
93 pdl.pattern : benefit(1) {
104 pdl.pattern : benefit(1) {
117 pdl.pattern : benefit(1) {
[all …]
Dops.mlir7 pdl.pattern @operations : benefit(1) {
21 pdl.pattern @rewrite_with_args : benefit(1) {
29 pdl.pattern @rewrite_with_params : benefit(1) {
36 pdl.pattern @rewrite_with_args_and_params : benefit(1) {
46 pdl.pattern @infer_type_from_operation_replace : benefit(1) {
61 pdl.pattern @infer_type_from_result_replace : benefit(1) {
76 pdl.pattern @infer_type_from_type_used_in_match : benefit(1) {
/external/llvm-project/mlir/lib/IR/
DPatternMatch.cpp18 PatternBenefit::PatternBenefit(unsigned benefit) : representation(benefit) { in PatternBenefit() argument
19 assert(representation == benefit && benefit != ImpossibleToMatchSentinel && in PatternBenefit()
32 Pattern::Pattern(StringRef rootName, PatternBenefit benefit, in Pattern() argument
34 : rootKind(OperationName(rootName, context)), benefit(benefit) {} in Pattern()
35 Pattern::Pattern(PatternBenefit benefit, MatchAnyOpTypeTag tag) in Pattern() argument
36 : benefit(benefit) {} in Pattern()
38 PatternBenefit benefit, MLIRContext *context) in Pattern() argument
39 : Pattern(rootName, benefit, context) { in Pattern()
46 Pattern::Pattern(ArrayRef<StringRef> generatedNames, PatternBenefit benefit, in Pattern() argument
48 : Pattern(benefit, tag) { in Pattern()
/external/llvm-project/mlir/include/mlir/Dialect/Linalg/Transforms/
DTransforms.h397 PatternBenefit benefit = 1);
402 PatternBenefit benefit = 1);
418 PatternBenefit benefit = 1)
420 marker, benefit) {} in LinalgBaseTilingPattern()
452 PatternBenefit benefit = 1);
484 PatternBenefit benefit = 1)
487 fusionOptions, marker, fusedOpMarker, originalOpMarker, benefit) {} in LinalgBaseTileAndFusePattern()
500 PatternBenefit benefit = 1);
516 PatternBenefit benefit = 1)
518 interchangeVector, marker, benefit) {} in LinalgBaseInterchangePattern()
[all …]
/external/llvm-project/mlir/test/Conversion/PDLToPDLInterp/
Dpdl-to-pdl-interp-rewriter.mlir10 pdl.pattern : benefit(1) {
25 pdl.pattern : benefit(1) {
41 pdl.pattern : benefit(1) {
61 pdl.pattern : benefit(1) {
82 pdl.pattern : benefit(1) {
101 pdl.pattern : benefit(1) {
120 pdl.pattern : benefit(1) {
139 pdl.pattern : benefit(1) {
158 pdl.pattern : benefit(1) {
176 pdl.pattern : benefit(1) {
[all …]
Dpdl-to-pdl-interp-matcher.mlir23 // CHECK-SAME: benefit(1), loc([%[[ROOT]]]), root("foo.op") -> ^bb1
29 pdl.pattern : benefit(1) {
50 pdl.pattern : benefit(1) {
68 pdl.pattern : benefit(1) {
95 pdl.pattern : benefit(1) {
119 pdl.pattern : benefit(1) {
135 pdl.pattern : benefit(1) {
140 pdl.pattern : benefit(1) {
/external/llvm-project/mlir/lib/Rewrite/
DByteCode.h71 void updatePatternBenefit(unsigned patternIndex, PatternBenefit benefit);
99 PatternBenefit benefit) in MatchResult()
100 : location(loc), pattern(&pattern), benefit(benefit) {} in MatchResult()
110 PatternBenefit benefit; member
DByteCode.cpp40 PatternBenefit benefit = matchOp.benefit(); in create() local
45 return PDLByteCodePattern(rewriterAddr, *rootKind, generatedOps, benefit, in create()
47 return PDLByteCodePattern(rewriterAddr, generatedOps, benefit, ctx, in create()
59 PatternBenefit benefit) { in updatePatternBenefit() argument
60 currentPatternBenefits[patternIndex] = benefit; in updatePatternBenefit()
1120 PatternBenefit benefit = currentPatternBenefits[patternIndex]; in execute() local
1125 if (benefit.isImpossibleToMatch()) { in execute()
1142 LLVM_DEBUG(llvm::dbgs() << " * Benefit: " << benefit.getBenefit() << "\n" in execute()
1144 matches->emplace_back(matchLoc, patterns[patternIndex], benefit); in execute()
1250 return lhs.benefit > rhs.benefit; in match()
/external/llvm-project/mlir/test/Rewrite/
Dpdl-bytecode.mlir20 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
52 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
88 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
123 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(2), loc([%root]) ->…
156 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
188 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
222 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
254 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
291 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
331 …pdl_interp.record_match @rewriters::@success(%root : !pdl.operation) : benefit(1), loc([%root]) ->…
[all …]
/external/llvm-project/mlir/lib/Dialect/Linalg/Transforms/
DTransforms.cpp110 LinalgMarker marker, PatternBenefit benefit) in LinalgBaseTilingPattern() argument
111 : RewritePattern(opName, {}, benefit, context), marker(marker), in LinalgBaseTilingPattern()
115 LinalgTilingOptions options, LinalgMarker marker, PatternBenefit benefit) in LinalgBaseTilingPattern() argument
116 : RewritePattern(benefit, MatchAnyOpTypeTag()), marker(marker), in LinalgBaseTilingPattern()
157 LinalgMarker originalOpMarker, PatternBenefit benefit) in LinalgBaseTileAndFusePattern() argument
158 : RewritePattern(opName, {}, benefit, context), in LinalgBaseTileAndFusePattern()
245 PatternBenefit benefit) in LinalgBaseInterchangePattern() argument
246 : RewritePattern(opName, {}, benefit, context), marker(marker), in LinalgBaseInterchangePattern()
271 LinalgMarker marker, PatternBenefit benefit) in LinalgBasePromotionPattern() argument
272 : RewritePattern(opName, {}, benefit, context), marker(marker), in LinalgBasePromotionPattern()
[all …]
DGeneralization.cpp67 PatternBenefit benefit = 1) in LinalgGeneralizationPattern()
68 : OpRewritePattern<RootOp>(context, benefit), marker(std::move(marker)) {} in LinalgGeneralizationPattern()
104 PatternBenefit benefit = 1) in LinalgNamedOpGeneralizationPattern()
105 : RewritePattern(benefit, MatchAnyOpTypeTag()), in LinalgNamedOpGeneralizationPattern()
/external/llvm-project/mlir/docs/
DPatternRewriter.md27 This is the expected benefit of applying a given pattern. This benefit is static
29 initialization time, e.g. allowing the benefit to be derived from domain
63 MyPattern(PatternBenefit benefit, MLIRContext *context)
64 : RewritePattern(MyOp::getOperationName(), benefit, context) {}
66 MyPattern(PatternBenefit benefit)
67 : RewritePattern(benefit, MatchAnyOpTypeTag()) {}
177 cost model. This cost model computes a final benefit for a given pattern, using
187 MyPattern(PatternBenefit benefit, MLIRContext *context)
188 : RewritePattern(MyOp::getOperationName(), benefit, context) {}
193 patterns.insert<MyPattern>(/*benefit=*/1, ctx);
[all …]
/external/mesa3d/src/intel/compiler/
Dbrw_nir_analyze_ubo_ranges.c50 int benefit; member
56 return 2 * entry->benefit - entry->range.length; in score()
194 info->offsets, entry->benefit, entry->range.length, score(entry)); in print_ubo_entry()
292 entry->benefit = 0; in brw_nir_analyze_ubo_ranges()
295 entry->benefit += info->uses[first_bit + i]; in brw_nir_analyze_ubo_ranges()
/external/llvm-project/mlir/include/mlir/IR/
DPatternMatch.h35 PatternBenefit(unsigned benefit);
84 PatternBenefit getBenefit() const { return benefit; } in getBenefit()
100 Pattern(StringRef rootName, PatternBenefit benefit, MLIRContext *context);
105 Pattern(PatternBenefit benefit, MatchAnyOpTypeTag tag);
110 PatternBenefit benefit, MLIRContext *context);
116 Pattern(ArrayRef<StringRef> generatedNames, PatternBenefit benefit,
136 const PatternBenefit benefit; variable
197 OpRewritePattern(MLIRContext *context, PatternBenefit benefit = 1)
198 : RewritePattern(SourceOp::getOperationName(), benefit, context) {} in RewritePattern()
/external/llvm-project/mlir/include/mlir/Conversion/SPIRVToLLVM/
DConvertSPIRVToLLVM.h27 PatternBenefit benefit = 1)
28 : OpConversionPattern<SPIRVOp>(context, benefit),
/external/llvm-project/mlir/include/mlir/Transforms/
DDialectConversion.h351 ConversionPattern(StringRef rootName, PatternBenefit benefit, in ConversionPattern() argument
353 : RewritePattern(rootName, benefit, ctx), typeConverter(&typeConverter) {} in ConversionPattern()
359 ConversionPattern(PatternBenefit benefit, TypeConverter &typeConverter, in ConversionPattern() argument
361 : RewritePattern(benefit, tag), typeConverter(&typeConverter) {} in ConversionPattern()
376 OpConversionPattern(MLIRContext *context, PatternBenefit benefit = 1)
377 : ConversionPattern(SourceOp::getOperationName(), benefit, context) {} in ConversionPattern()
379 PatternBenefit benefit = 1)
380 : ConversionPattern(SourceOp::getOperationName(), benefit, typeConverter, in ConversionPattern()
/external/llvm-project/mlir/include/mlir/Dialect/SPIRV/
DSPIRVLowering.h71 PatternBenefit benefit = 1)
72 : OpConversionPattern<SourceOp>(context, benefit),
/external/llvm-project/llvm/test/CodeGen/PowerPC/
Daix-cc-byval.ll124 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
139 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
153 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
166 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
227 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
248 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
267 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
286 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
476 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
487 ; The DAG block permits some invalid inputs for the benefit of allowing more valid orderings.
[all …]
/external/mesa3d/src/panfrost/util/
Dlcra.c238 float benefit = constraints / cost; in lcra_get_best_spill_node() local
240 if (benefit > best_benefit) { in lcra_get_best_spill_node()
241 best_benefit = benefit; in lcra_get_best_spill_node()
/external/tensorflow/tensorflow/compiler/xla/service/
Dconditional_code_motion.h118 Decision(Direction direction, int benefit) in Decision() argument
119 : direction_(direction), benefit_(benefit) {} in Decision()
/external/llvm-project/mlir/lib/Dialect/StandardOps/Transforms/
DDecomposeCallGraphTypes.cpp42 PatternBenefit benefit = 1) in DecomposeCallGraphTypesOpConversionPattern() argument
43 : OpConversionPattern<SourceOp>(typeConverter, context, benefit), in DecomposeCallGraphTypesOpConversionPattern()
/external/llvm-project/polly/docs/
DArchitecture.rst60 Running Polly early before the standard pass pipeline has the benefit that the
67 benefit if Polly is scheduled at this position. The additional set of
76 Running Polly right before the vectorizer has the benefit that the full inlining
78 theoretically benefit from Polly (more work is necessary to make Polly here
/external/mesa3d/src/util/
Dregister_allocate.c967 float benefit = 0; in ra_get_spill_benefit() local
978 benefit += ((float)g->regs->classes[n_class]->q[n2_class] / in ra_get_spill_benefit()
982 return benefit; in ra_get_spill_benefit()
1003 float benefit; in ra_get_best_spill_node() local
1011 benefit = ra_get_spill_benefit(g, n); in ra_get_best_spill_node()
1013 if (benefit / cost > best_benefit) { in ra_get_best_spill_node()
1014 best_benefit = benefit / cost; in ra_get_best_spill_node()
/external/webrtc/modules/third_party/g711/
DLICENSE11 * public domain for the benefit of all mankind - even the slimy
/external/arm-trusted-firmware/docs/process/
Dcode-review-guidelines.rst22 Code reviews are meant to benefit everyone through team work. It is not about
29 To ensure the code review gives the greatest possible benefit, participants in
74 benefit everyone and will be maintained over time.
194 duplicate driver is less likely to benefit from bug fixes and future
197 enhancements benefit everyone.

12345678910>>...16