| /external/llvm/test/CodeGen/AArch64/ |
| D | aarch64-minmaxv.ll | 11 %rdx.minmax.cmp22 = icmp sgt <16 x i8> %arr.load, %rdx.shuf
12 …%rdx.minmax.select23 = select <16 x i1> %rdx.minmax.cmp22, <16 x i8> %arr.load, <16 x i8> %rdx.shuf
13 …%rdx.shuf24 = shufflevector <16 x i8> %rdx.minmax.select23, <16 x i8> undef, <16 x i32> <i32 4, i3…
14 %rdx.minmax.cmp25 = icmp sgt <16 x i8> %rdx.minmax.select23, %rdx.shuf24
15 …%rdx.minmax.select26 = select <16 x i1> %rdx.minmax.cmp25, <16 x i8> %rdx.minmax.select23, <16 x i…
16 …%rdx.shuf27 = shufflevector <16 x i8> %rdx.minmax.select26, <16 x i8> undef, <16 x i32> <i32 2, i3…
17 %rdx.minmax.cmp28 = icmp sgt <16 x i8> %rdx.minmax.select26, %rdx.shuf27
18 …%rdx.minmax.select29 = select <16 x i1> %rdx.minmax.cmp28, <16 x i8> %rdx.minmax.select26, <16 x i…
19 …%rdx.shuf30 = shufflevector <16 x i8> %rdx.minmax.select29, <16 x i8> undef, <16 x i32> <i32 1, i3…
20 %rdx.minmax.cmp31 = icmp sgt <16 x i8> %rdx.minmax.select29, %rdx.shuf30
[all …]
|
| /external/tensorflow/tensorflow/lite/toco/graph_transformations/ |
| D | hardcode_min_max.cc | 34 if (im2col_array.minmax) { in HardcodeMinMaxForIm2colArray()
38 if (!input_array.minmax) { in HardcodeMinMaxForIm2colArray()
42 CHECK(!im2col_array.minmax); in HardcodeMinMaxForIm2colArray()
51 if (output_array.minmax) { in HardcodeMinMaxForL2Normalization()
55 if (!input_array.minmax) { in HardcodeMinMaxForL2Normalization()
59 CHECK(!output_array.minmax); in HardcodeMinMaxForL2Normalization()
68 if (input.minmax) { in HardcodeInputMinMaxFromOutput()
69 const auto* minmax = input.minmax.get(); in HardcodeInputMinMaxFromOutput() local
70 if (minmax) { in HardcodeInputMinMaxFromOutput()
75 if (output.minmax) { in HardcodeInputMinMaxFromOutput()
[all …]
|
| D | resolve_fake_quant_args_from_vars.cc | 39 if (fakequant_op->minmax) { in Run()
58 fakequant_op->minmax.reset(new MinMax); in Run()
59 MinMax& minmax = *fakequant_op->minmax; in Run() local
60 minmax.min = min_array.GetBuffer<ArrayDataType::kFloat>().data[0]; in Run()
61 minmax.max = max_array.GetBuffer<ArrayDataType::kFloat>().data[0]; in Run()
63 if (minmax.min > 0 || minmax.max < 0) { in Run()
65 << "[" << minmax.min << ", " << minmax.max in Run()
70 minmax.min = std::min(minmax.min, 0.); in Run()
71 minmax.max = std::max(minmax.max, 0.); in Run()
|
| D | read_array_minmax_and_narrow_range_from_fake_quant.cc | 35 if (!annotated_array.minmax) { in ApplyAttrsToArray()
36 const MinMax& minmax = *fq_op.minmax; in ApplyAttrsToArray() local
37 annotated_array.GetOrCreateMinMax() = minmax; in ApplyAttrsToArray()
40 minmax.min, minmax.max); in ApplyAttrsToArray()
64 if (!fq_op->minmax) { in Run()
72 CHECK(fq_op->minmax); in Run()
|
| D | quantize.cc | 87 if (array.minmax != nullptr) { in GetOrComputeMinMax()
88 return *array.minmax; in GetOrComputeMinMax()
139 auto& minmax = array.GetOrCreateMinMax(); in GetOrComputeMinMax() local
140 minmax.min = min; in GetOrComputeMinMax()
141 minmax.max = max; in GetOrComputeMinMax()
142 return minmax; in GetOrComputeMinMax()
239 const MinMax& minmax = GetOrComputeMinMax(model, input); in ChooseQuantizationForOperatorInput() local
256 input, minmax.min, minmax.max, ArrayDataTypeName(*quantized_data_type), in ChooseQuantizationForOperatorInput()
387 const MinMax& minmax = GetOrComputeMinMax(model, output); in ChooseQuantizationForOperatorOutput() local
404 output, minmax.min, minmax.max, ArrayDataTypeName(*quantized_data_type), in ChooseQuantizationForOperatorOutput()
[all …]
|
| D | remove_trivial_fake_quant.cc | 35 if (!fakequant_op.minmax) { in IsFakeQuantTrivial()
48 if (!producing_fakequant_op.minmax) { in IsFakeQuantTrivial()
53 if (*fakequant_op.minmax == *producing_fakequant_op.minmax && in IsFakeQuantTrivial()
|
| D | propagate_default_min_max.cc | 53 if (!input_array.minmax && !input_array.buffer && in Run()
61 if (!output_array.minmax && !output_array.buffer && in Run()
75 CHECK(!array->minmax); in SetArrayMinMax()
85 if (!array->minmax) { in SetArrayMinMax()
|
| D | resolve_constant_concatenation.cc | 114 if (concatenated_array->minmax) return; in SetMinMaxForConcatenedArray()
122 if (!input_array->minmax) return; in SetMinMaxForConcatenedArray()
127 MinMax& minmax = concatenated_array->GetOrCreateMinMax(); in SetMinMaxForConcatenedArray() local
128 minmax.min = concat_min; in SetMinMaxForConcatenedArray()
129 minmax.max = concat_max; in SetMinMaxForConcatenedArray()
|
| D | quantization_util.cc | 81 array.minmax->min, array.minmax->max, array.narrow_range); in ChooseQuantizationParamsForArrayAndQuantizedDataType()
223 if (!array.minmax) { in IsArrayQuantizedRangeSubset()
234 ArrayDataTypeName(quantized_data_type), array.minmax->min, in IsArrayQuantizedRangeSubset()
235 array.minmax->max, quantization_params.zero_point, in IsArrayQuantizedRangeSubset()
|
| D | drop_fake_quant.cc | 38 if (!fakequant_op->minmax) { in Run()
43 if (!output_array.minmax) { in Run()
|
| D | graph_transformations.h | 223 MinMax minmax; in DECLARE_GRAPH_TRANSFORMATION() local
224 minmax.min = min; in DECLARE_GRAPH_TRANSFORMATION()
225 minmax.max = max; in DECLARE_GRAPH_TRANSFORMATION()
226 type_ranges_.emplace_back(data_type, minmax); in DECLARE_GRAPH_TRANSFORMATION()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_init_list.pass.cpp | 25 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); in main()
26 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); in main()
27 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); in main()
28 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); in main()
29 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); in main()
30 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); in main()
33 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); in main()
34 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); in main()
35 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), ""); in main()
36 static_assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)), ""); in main()
[all …]
|
| D | minmax_init_list_comp.pass.cpp | 32 std::pair<int, int> p = std::minmax(il, std::ref(pred)); in test_all_equal()
41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
47 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); in main()
50 …assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair<int, int>(5… in main()
68 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
[all …]
|
| D | minmax.pass.cpp | 25 std::pair<const T&, const T&> p = std::minmax(a, b); in test()
56 constexpr auto p1 = std::minmax (x, y); in main()
59 constexpr auto p2 = std::minmax (y, x); in main()
|
| D | minmax_comp.pass.cpp | 27 std::pair<const T&, const T&> p = std::minmax(a, b, c); in test()
59 constexpr auto p1 = std::minmax(x, y, std::greater<>()); in main()
62 constexpr auto p2 = std::minmax(y, x, std::greater<>()); in main()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AMDGPU/ |
| D | reduction.ll | 140 %rdx.minmax.cmp = icmp ult <4 x i16> %vec4, %rdx.shuf
141 %rdx.minmax.select = select <4 x i1> %rdx.minmax.cmp, <4 x i16> %vec4, <4 x i16> %rdx.shuf
142 …%rdx.shuf1 = shufflevector <4 x i16> %rdx.minmax.select, <4 x i16> undef, <4 x i32> <i32 1, i32 un…
143 %rdx.minmax.cmp2 = icmp ult <4 x i16> %rdx.minmax.select, %rdx.shuf1
144 …%rdx.minmax.select3 = select <4 x i1> %rdx.minmax.cmp2, <4 x i16> %rdx.minmax.select, <4 x i16> %r…
145 %res = extractelement <4 x i16> %rdx.minmax.select3, i32 0
165 %rdx.minmax.cmp = icmp ult <8 x i16> %vec8, %rdx.shuf
166 %rdx.minmax.select = select <8 x i1> %rdx.minmax.cmp, <8 x i16> %vec8, <8 x i16> %rdx.shuf
167 …%rdx.shuf1 = shufflevector <8 x i16> %rdx.minmax.select, <8 x i16> undef, <8 x i32> <i32 2, i32 3,…
168 %rdx.minmax.cmp2 = icmp ult <8 x i16> %rdx.minmax.select, %rdx.shuf1
[all …]
|
| /external/blktrace/ |
| D | stats.h | 28 struct minmax { struct
36 static inline void minmax_init(struct minmax *mm) in minmax_init() argument
45 static inline void minmax_account(struct minmax *mm, __u64 value) in minmax_account()
56 static inline void minmax_merge(struct minmax *dst, struct minmax *src) in minmax_merge()
67 static inline void minmax_to_be(struct minmax *mm) in minmax_to_be()
76 static inline double minmax_avg(struct minmax *mm) in minmax_avg()
84 static inline double minmax_var(struct minmax *mm) in minmax_var()
94 static inline int minmax_print(FILE *fp, const char *s, struct minmax *mm) in minmax_print()
|
| D | blkiomon.h | 38 struct minmax size_r;
39 struct minmax size_w;
40 struct minmax d2c_r;
41 struct minmax d2c_w;
42 struct minmax thrput_r;
43 struct minmax thrput_w;
|
| /external/u-boot/drivers/mmc/ |
| D | rockchip_dw_mmc.c | 33 u32 minmax[2]; member
79 if (dev_read_u32_array(dev, "clock-freq-min-max", priv->minmax, 2)) { in rockchip_dwmmc_ofdata_to_platdata()
85 priv->minmax[0] = 400000; /* 400 kHz */ in rockchip_dwmmc_ofdata_to_platdata()
86 priv->minmax[1] = val; in rockchip_dwmmc_ofdata_to_platdata()
115 priv->minmax[0] = 400000; /* 400 kHz */ in rockchip_dwmmc_probe()
116 priv->minmax[1] = dtplat->max_frequency; in rockchip_dwmmc_probe()
142 dwmci_setup_cfg(&plat->cfg, host, priv->minmax[1], priv->minmax[0]); in rockchip_dwmmc_probe()
|
| D | ftsdc010_mci.c | 60 u32 minmax[2]; member
405 "clock-freq-min-max", priv->minmax, 2)) { in ftsdc010_mmc_ofdata_to_platdata()
411 priv->minmax[0] = 400000; /* 400 kHz */ in ftsdc010_mmc_ofdata_to_platdata()
412 priv->minmax[1] = val; in ftsdc010_mmc_ofdata_to_platdata()
418 chip->sclk = priv->minmax[1]; in ftsdc010_mmc_ofdata_to_platdata()
439 memcpy(priv->minmax, dtplat->clock_freq_min_max, sizeof(priv->minmax)); in ftsdc010_mmc_probe()
450 priv->minmax[1] , priv->minmax[0]); in ftsdc010_mmc_probe()
|
| /external/tensorflow/tensorflow/lite/tools/optimize/calibration/ |
| D | calibration_reader.cc | 26 auto minmax = tensorid_stat.second; in GetTensorStatsAsMap() local
28 TF_LITE_ENSURE_STATUS(minmax.Get(&stats.min, &stats.max)); in GetTensorStatsAsMap()
41 auto minmax = tensorid_stat.second; in AddCalibrationToModel() local
43 TF_LITE_ENSURE_STATUS(minmax.Get(&min, &max)); in AddCalibrationToModel()
|
| /external/llvm/test/Transforms/LoopVectorize/AArch64/ |
| D | first-order-recurrence.ll | 69 ; int minmax;
71 ; minmax = min(minmax, max(a[i] - a[i-1], 0));
72 ; return minmax;
113 %minmax.0.cond.lcssa = phi i32 [ %minmax.0.cond, %scalar.body ]
117 %minmax.0.lcssa = phi i32 [ undef, %entry ], [ %minmax.0.cond.lcssa, %for.cond.cleanup.loopexit ]
118 ret i32 %minmax.0.lcssa
123 %minmax.028 = phi i32 [ undef, %for.preheader ], [ %minmax.0.cond, %scalar.body ]
129 %cmp5 = icmp slt i32 %minmax.028, %cond
130 %minmax.0.cond = select i1 %cmp5, i32 %minmax.028, i32 %cond
|
| /external/perfetto/src/trace_processor/ |
| D | trace_storage.cc | 38 std::pair<T, T> minmax = std::minmax_element(begin_it, end_it); in MaybeUpdateMinMax() local
39 *min_value = std::min(*min_value, *minmax.first); in MaybeUpdateMinMax()
40 *max_value = std::max(*max_value, *minmax.second); in MaybeUpdateMinMax()
|
| /external/clang/test/SemaCXX/ |
| D | invalid-member-expr.cpp | 29 template <typename _Tp> pair<_Tp, _Tp> minmax(initializer_list<_Tp> __l) {}; in minmax() function
32 pair<int, int> z = minmax({}); in test0()
|
| /external/tensorflow/tensorflow/lite/kernels/ |
| D | fake_quant.cc | 73 op_params.minmax.min = params->min; in Eval()
74 op_params.minmax.max = params->max; in Eval()
|