| /external/openssh/ |
| kexgexs.c | 75 u_int min = 0, max = 0, nbits = 0; local
80 (r = sshpkt_get_u32(ssh, &max)) != 0 ||
85 kex->max = max;
87 max = MINIMUM(DH_GRP_MAX, max);
91 if (kex->max < kex->min || kex->nbits < kex->min ||
92 kex->max < kex->nbits || kex->max < DH_GRP_MIN) {
98 kex->dh = PRIVSEP(choose_dh(min, nbits, max));
[all...] |
| /external/pdfium/third_party/base/numerics/ |
| safe_conversions.h | 84 // Default boundaries for integral/float: max/infinity, lowest/-infinity, 0/NaN.
92 static constexpr T max() { return std::numeric_limits<T>::max(); } function in struct:pdfium::base::SaturationDefaultHandler
96 : std::numeric_limits<T>::max();
|
| /external/perfetto/src/trace_processor/ |
| storage_columns.h | 36 uint32_t max_idx = std::numeric_limits<uint32_t>::max();
155 NumericType max = kTMax; variable
159 max = FindLtBound<NumericType>(IsOpLe(op), sqlite_val);
163 max = val;
166 if (min <= kTMin && max >= kTMax)
170 bounds.max_idx = accessor_.UpperBoundIndex(max);
234 NumericType kTMax = std::numeric_limits<NumericType>::max();
420 return std::numeric_limits<uint32_t>::max();
437 return std::numeric_limits<uint32_t>::max();
|
| /external/python/cpython2/Modules/zlib/ |
| gzwrite.c | 78 unsigned have, put, max = ((unsigned)-1 >> 2) + 1; local
88 put = strm->avail_in > max ? max : strm->avail_in;
108 put = strm->next_out - state->x.next > (int)max ? max :
|
| inftrees.c | 42 unsigned min, max; /* minimum and maximum code lengths */ local
114 for (max = MAXBITS; max >= 1; max--)
115 if (count[max] != 0) break;
116 if (root > max) root = max;
117 if (max == 0) { /* no symbols to code at all */
126 for (min = 1; min < max; min++)
137 if (left > 0 && (type == CODES || max != 1)
[all...] |
| /external/skia/src/gpu/ |
| GrResourceAllocator.cpp | 366 this->expire(std::numeric_limits<unsigned int>::max());
423 this->expire(std::numeric_limits<unsigned int>::max());
431 this->expire(std::numeric_limits<unsigned int>::max());
440 unsigned int max = 0; local
452 max = SkTMax(max, cur->end());
460 for (unsigned int i = min; i <= max; ++i) {
|
| /external/skqp/src/gpu/ |
| GrResourceAllocator.cpp | 366 this->expire(std::numeric_limits<unsigned int>::max());
423 this->expire(std::numeric_limits<unsigned int>::max());
431 this->expire(std::numeric_limits<unsigned int>::max());
440 unsigned int max = 0; local
452 max = SkTMax(max, cur->end());
460 for (unsigned int i = min; i <= max; ++i) {
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/ |
| RepresentIterableTest.java | 54 private int max = 0; field in class:RepresentIterableTest.Counter
57 public Counter(int max) {
58 this.max = max;
62 return counter < max;
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| StringRef.h | 48 static size_t max(size_t a, size_t b) { return a > b ? a : b; } function in class:llvm::StringRef
359 End = min(max(Start, End), Length);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARC/Disassembler/ |
| ARCDisassembler.cpp | 213 const unsigned max = (1u << B) - 1; local
215 MCOperand::createImm(InsnS < max ? static_cast<int>(InsnS) : -1));
|
| /external/tensorflow/tensorflow/core/kernels/ |
| mkl_requantization_range_per_channel_op.cc | 66 // TODO: verify performance of not transposing and finding the min max
76 #pragma omp parallel for reduction(max : out_min_max)
80 Eigen::Tensor<qint32, 0, Eigen::RowMajor> max = variable
83 const int32_t max_per_channel = max();
85 std::max(std::abs(min_per_channel), std::abs(max_per_channel));
87 std::max(std::abs(input_min_data[i]), std::abs(input_max_data[i]));
93 out_min_max = std::max(out_min_max, ranges[i]);
95 // All local out_min_max gets max-reduced into one global out_min_max at
96 // the end of the loop by specifying reduction(max:out_min_max) along with
99 // Fixing max to clip_value_max_ (example 6.0 to support relu6
[all...] |
| /external/tensorflow/tensorflow/lite/kernels/internal/reference/integer_ops/ |
| pooling.h | 49 const int filter_x_start = std::max(0, -in_x_origin);
52 const int filter_y_start = std::max(0, -in_y_origin);
71 acc = std::max(acc, params.quantized_activation_min);
89 std::numeric_limits<int8_t>::max());
110 const int filter_x_start = std::max(0, -in_x_origin);
113 const int filter_y_start = std::max(0, -in_y_origin);
116 int8_t max = std::numeric_limits<int8_t>::lowest(); local
123 max = std::max(
124 max,
[all...] |
| /external/tensorflow/tensorflow/lite/kernels/internal/reference/ |
| softmax.h | 38 // Find max element value which we'll use to ensure numerical stability
41 float max = std::numeric_limits<float>::lowest(); local
43 max = std::max(max, input_data[i * depth + c]);
49 sum += std::exp((input_data[i * depth + c] - max) * params.beta);
55 std::exp((input_data[i * depth + c] - max) * params.beta) / sum;
87 max_in_row = std::max(max_in_row, input_data[i * depth + c]);
124 std::max(std::min(unsat_output, static_cast<int32>(255)),
141 // Find the max coeff
[all...] |
| /external/tensorflow/tensorflow/lite/models/smartreply/ |
| predictor_test.cc | 76 float max = 0; local
78 if (item.GetScore() > max) {
79 max = item.GetScore();
83 EXPECT_GT(max, 0.3);
96 float max = 0; local
98 if (item.GetScore() > max) {
99 max = item.GetScore();
103 EXPECT_GT(max, 0.3);
|
| /external/tensorflow/tensorflow/lite/toco/graph_transformations/ |
| propagate_fake_quant_num_bits.cc | 41 // The array is already quantized and has min/max info.
42 // As we are changing the data type we need to fix up the existing min/max
59 double max = local
62 max = max - 1.0 / (new_quantized_max + 1);
66 "Rescaling min/max from %g,%g (%s) to %g,%g (%s)", array_minmax.min,
67 array_minmax.max, ArrayDataTypeName(array->data_type), min, max,
70 array_minmax.max = max;
[all...] |
| /external/tremolo/Tremolo/ |
| res012.c | 123 int max=pcmend>>1; local
124 int end=(info->end<max?info->end:max);
206 int max=(pcmend*ch)>>1; local
207 int end=(info->end<max?info->end:max);
|
| /external/u-boot/arch/arm/mach-omap2/am33xx/ |
| clock.c | 191 u32 i, max = 100; local
194 for (i = 0; (i < max) && clk_domains[i]; i++) {
200 for (i = 0; (i < max) && clk_modules_explicit_en[i]; i++) {
211 u32 i, max = 100; local
215 for (i = 0; (i < max) && clk_modules_disable[i]; i++)
220 for (i = 0; (i < max) && clk_domains[i]; i++)
|
| /external/u-boot/board/ge/common/ |
| vpd_reader.c | 19 int max; member in struct:__anon47109::__anon47110
27 .max = 15,
35 for (; gfo < bch_configuration.galois_field_order.max &&
40 if (gfo == bch_configuration.galois_field_order.max)
|
| /external/u-boot/board/synopsys/hsdk/ |
| env-lib.c | 74 u32 max = map[index].max; local
85 if (set && (value < min || value > max)) {
88 map[index].env_name, min, max);
91 map[index].env_name, min, max);
105 u32 min, max; local
120 max = map[index].max[i];
123 if (set && (value < min || value > max)) {
126 map[index].env_name, i, min, max);
[all...] |
| /external/u-boot/lib/zlib/ |
| inftrees.c | 38 unsigned min, max; /* minimum and maximum code lengths */ local
110 for (max = MAXBITS; max >= 1; max--)
111 if (count[max] != 0) break;
112 if (root > max) root = max;
113 if (max == 0) { /* no symbols to code at all */
133 if (left > 0 && (type == CODES || max != 1))
172 all codes of length max, i.e. all codes, have been processed. Thi
[all...] |
| /external/v8/src/compiler/ |
| control-equivalence.cc | 180 int max = NodeProperties::PastControlIndex(node); local
181 for (int i = NodeProperties::FirstControlIndex(node); i < max; i++) {
|
| /external/vboot_reference/futility/ |
| misc.c | 51 static inline uint32_t max(uint32_t a, uint32_t b) function
85 maxlen = max(maxlen,
87 maxlen = max(maxlen,
89 maxlen = max(maxlen,
91 maxlen = max(maxlen,
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| xcorr_coef.c | 37 int16_t max; local
58 max=WebRtcSpl_MaxAbsValueW16(regressor, subl + searchLen - 1);
62 max = WebRtcSpl_MaxAbsValueW16(regressor - searchLen, subl + searchLen - 1);
71 if (max>5000) {
|
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| echo_cancellation.h | 50 int max; member in struct:__anon49853
|
| /external/zlib/src/contrib/infback9/ |
| inftree9.c | 42 unsigned min, max; /* minimum and maximum code lengths */ local
116 for (max = MAXBITS; max >= 1; max--)
117 if (count[max] != 0) break;
118 if (root > max) root = max;
119 if (max == 0) return -1; /* no codes! */
131 if (left > 0 && (type == CODES || max != 1))
169 all codes of length max, i.e. all codes, have been processed. Thi
[all...] |
