| /external/libvorbis/vq/ |
| distribution.c | 37 float max; local
79 max=min=_float32_unpack(c->q_min);
84 if(val>max)max=val;
88 printf("Maximum scalar value: %f\n",max);
169 sprintf(buf,"getting min/max (%.2f::%.2f). lines...",min,max);
174 min=max=code;
182 if(code>max)max=code
[all...] |
| vqgen.h | 42 float *max; member in struct:vqgen
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_highbd_block_error_intrin_sse2.c | 21 __m128i max, min, cmp0, cmp1, cmp2, cmp3; local
33 max = _mm_set1_epi32(0x3fff);
35 cmp0 = _mm_xor_si128(_mm_cmpgt_epi32(mm_coeff, max),
37 cmp1 = _mm_xor_si128(_mm_cmpgt_epi32(mm_coeff2, max),
39 cmp2 = _mm_xor_si128(_mm_cmpgt_epi32(mm_dqcoeff, max),
41 cmp3 = _mm_xor_si128(_mm_cmpgt_epi32(mm_dqcoeff2, max),
|
| /external/libweave/third_party/chromium/base/numerics/ |
| safe_conversions_impl.h | 33 // type if both numeric_limits<Src>::max() <= numeric_limits<Dst>::max() and
138 static Dst max() { function in struct:base::internal::NarrowingRange
139 // The following logic avoids warnings where the max function is
152 return DstLimits::max() - static_cast<Dst>((UINTMAX_C(1) << shift) - 1);
156 return std::numeric_limits<Dst>::is_iec559 ? -DstLimits::max()
200 return GetRangeConstraint((value <= NarrowingRange<Dst, Src>::max()),
213 return GetRangeConstraint(value <= NarrowingRange<Dst, Src>::max(), true);
228 value <= static_cast<Src>(NarrowingRange<Dst, Src>::max()),
245 value <= static_cast<Src>(NarrowingRange<Dst, Src>::max()),
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_format_parse.py | 75 def max(self): member in class:Channel
|
| /external/mesa3d/src/gallium/drivers/svga/ |
| svga_tgsi.c | 240 int i, max = 0; local
242 max = MAX2(max, remap_table[i]);
244 remap_table[generic_index] = max + 1;
|
| /external/mesa3d/src/mesa/main/ |
| api_validate.c | 58 * Find the max index in the given element/index buffer
66 GLuint max = 0; local
79 if (((GLuint *) indices)[i] > max)
80 max = ((GLuint *) indices)[i];
84 if (((GLushort *) indices)[i] > max)
85 max = ((GLushort *) indices)[i];
90 if (((GLubyte *) indices)[i] > max)
91 max = ((GLubyte *) indices)[i];
98 return max;
175 GLuint min, max; local
[all...] |
| version.c | 88 static const int max = 100; local
227 ctx->VersionString = (char *) malloc(max);
229 _mesa_snprintf(ctx->VersionString, max,
242 static const int max = 100; local
259 ctx->VersionString = (char *) malloc(max);
261 _mesa_snprintf(ctx->VersionString, max,
274 static const int max = 100; local
292 ctx->VersionString = (char *) malloc(max);
294 _mesa_snprintf(ctx->VersionString, max,
|
| /external/nanopb-c/tests/encode_unittests/ |
| encode_unittests.c | 128 int32_t max = INT32_MAX; local
137 field.data_size = sizeof(max);
138 TEST(WRITES(pb_enc_svarint(&s, &field, &max), "\xfe\xff\xff\xff\x0f"));
|
| /external/oauth/core/src/main/java/net/oauth/ |
| SimpleOAuthValidator.java | 92 long max = now + timestampWindow; local
93 if (timestamp < min || max < timestamp) {
95 problem.setParameter("oauth_acceptable_timestamps", min + "-" + max);
|
| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathBox.h | 80 T max; member in class:Imath::Box
156 max = point;
164 max = maxT;
172 return (min == src.min && max == src.max);
180 return (min != src.min || max != src.max);
188 max = T(T::baseTypeMin());
195 max = T(T::baseTypeMax());
208 if (point[i] > max[i]
351 Vec2<T> max; member in class:Imath::Box
593 Vec3<T> max; member in class:Imath::Box
[all...] |
| ImathColorAlgo.cpp | 119 double max = (x > y) ? ((x > z) ? x : z) : ((y > z) ? y : z); local
121 double range = max - min;
122 double val = max;
126 if (max != 0) sat = range/max;
132 if (x == max) h = (y - z) / range;
133 else if (y == max) h = 2 + (z - x) / range;
152 double max = (r > g) ? ((r > b) ? r : b) : ((g > b) ? g : b); local
154 double range = max - min;
155 double val = max;
[all...] |
| /external/opencv3/3rdparty/zlib/ |
| 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/opencv3/modules/cudaarithm/src/ |
| element_operations.cpp | 74 void cv::cuda::max(InputArray, InputArray, OutputArray, Stream&) { throw_no_cuda(); } function in class:cv::cuda
454 void cv::cuda::max(InputArray src1, InputArray src2, OutputArray dst, Stream& stream)
|
| /external/opencv3/samples/gpu/ |
| driver_api_stereo_multi.cpp | 22 # undef max macro
|
| /external/pdfium/third_party/zlib_v128/ |
| 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/pdfium/xfa/src/fxbarcode/datamatrix/ |
| BC_DataMatrixDataBlock.cpp | 86 int32_t max =
local
88 for (i = longerBlocksNumDataCodewords; i < max; i++) {
|
| /external/pdfium/xfa/src/fxbarcode/qrcode/ |
| BC_QRAlignmentPatternFinder.cpp | 189 int32_t max = m_possibleCenters.GetSize();
local
190 for (int32_t index = 0; index < max; index++) {
|
| BC_QRDataBlock.cpp | 102 int32_t max = ((CBC_QRDataBlock*)(*result)[0])->m_codewords->GetSize();
local
103 for (i = shorterBlocksNumDataCodewords; i < max; i++) {
|
| /external/regex-re2/re2/ |
| simplify.cc | 122 // Simplifies the expression re{min,max} in terms of *, +, and ?.
125 static Regexp* SimplifyRepeat(Regexp* re, int min, int max,
307 // Simplifies the expression re{min,max} in terms of *, +, and ?.
313 Regexp* SimplifyWalker::SimplifyRepeat(Regexp* re, int min, int max,
316 if (max == -1) {
337 if (min == 0 && max == 0)
341 if (min == 1 && max == 1)
359 if (max > min) {
361 for (int i = min+1; i < max; i++)
370 // Some degenerate case, like min > max, or min < max < 0
372 LOG(DFATAL) << "Malformed repeat " << re->ToString() << " " << min << " " << max; local
[all...] |
| /external/regex-re2/re2/testing/ |
| possible_match_test.cc | 27 const char* max; member in struct:re2::PrefixTest
107 string min, max; local
114 CHECK(prog->PossibleMatchRange(&min, &max, t.maxlen))
119 CHECK(RE2(t.regexp).PossibleMatchRange(&min, &max, t.maxlen));
122 EXPECT_EQ(t.max, max) << t.regexp;
129 string min, max; local
131 // Fails because no room to write max.
132 EXPECT_FALSE(RE2("abc").PossibleMatchRange(&min, &max, 0));
134 // Fails because there is no max -- any non-empty string matche
202 string min, max; local
218 CHECK_GE(s, min) << " regexp: " << regexp << " max: " << max; local
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowProgressBar.java | 13 private int max = 100; field in class:ShadowProgressBar
20 final int max = attributeSet.getAttributeIntValue("android", "max", this.max); local
22 if (max >= 0)
23 setMax(max);
27 public void setMax(int max) {
28 this.max = max;
29 if (progress > max) {
[all...] |
| /external/skia/src/core/ |
| SkRect.cpp | 63 Sk4s min, max, accum; local
74 accum = max = min;
82 max = Sk4s::Max(max, xy);
87 * With some trickery, we may be able to use Min/Max to also propogate non-finites,
88 * in which case we could eliminate accum entirely, and just check min and max for
94 max.store(maxArray);
|
| /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/tinyalsa/ |
| tinymix.c | 130 int min, max; local
192 max = mixer_ctl_get_range_max(ctl);
193 printf(" (range %d->%d)", min, max);
|
