/external/skia/src/core/ |
H A D | SkBitmapProcState_matrixProcs.cpp | 52 #define TILEX_PROCF(fx, max) SkClampMax((fx) >> 16, max) 53 #define TILEY_PROCF(fy, max) SkClampMax((fy) >> 16, max) 54 #define TILEX_LOW_BITS(fx, max) (((fx) >> 12) & 0xF) 55 #define TILEY_LOW_BITS(fy, max) (((fy) >> 12) & 0xF) 60 static unsigned X(const SkBitmapProcState&, SkFixed fx, int max) { argument 61 return SkClampMax(fx >> 16, max); 63 static unsigned Y(const SkBitmapProcState&, SkFixed fy, int max) { argument 64 return SkClampMax(fy >> 16, max); 96 X(const SkBitmapProcState&, SkFixed fx, int max) argument 99 Y(const SkBitmapProcState&, SkFixed fy, int max) argument 130 X(const SkBitmapProcState& s, SkFixed fx, int max) argument 133 Y(const SkBitmapProcState& s, SkFixed fy, int max) argument [all...] |
/external/boringssl/src/crypto/bn/ |
H A D | add.c | 103 int max, min, dif; local 112 max = a->top; 114 dif = max - min; 116 if (bn_wexpand(r, max + 1) == NULL) { 120 r->top = max; 203 int max; local 239 max = (a->top > b->top) ? a->top : b->top; 240 if (bn_wexpand(r, max) == NULL) { 260 int max, min, dif; local 264 max [all...] |
/external/openssh/ |
H A D | kexgexs.c | 77 u_int min = 0, max = 0, nbits = 0; local 84 (r = sshpkt_get_u32(ssh, &max)) != 0 || 89 kex->max = max; 91 max = MIN(DH_GRP_MAX, max); 103 kex->max = max = DH_GRP_MAX; 110 if (kex->max < kex->min || kex->nbits < kex->min || 111 kex->max < ke [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
H A D | FastCosineTransformer.java | 76 * @param max the upper bound for the interval 84 double min, double max, int n) 86 double data[] = FastFourierTransformer.sample(f, min, max, n); 117 * @param max the upper bound for the interval 125 double min, double max, int n) 128 double data[] = FastFourierTransformer.sample(f, min, max, n); 159 * @param max the upper bound for the interval 166 double min, double max, int n) 169 double data[] = FastFourierTransformer.sample(f, min, max, n); 198 * @param max th 83 transform(UnivariateRealFunction f, double min, double max, int n) argument 124 transform2(UnivariateRealFunction f, double min, double max, int n) argument 165 inversetransform(UnivariateRealFunction f, double min, double max, int n) argument 204 inversetransform2(UnivariateRealFunction f, double min, double max, int n) argument [all...] |
H A D | FastSineTransformer.java | 75 * @param max the upper bound for the interval 83 double min, double max, int n) 86 double data[] = FastFourierTransformer.sample(f, min, max, n); 115 * @param max the upper bound for the interval 123 UnivariateRealFunction f, double min, double max, int n) 126 double data[] = FastFourierTransformer.sample(f, min, max, n); 156 * @param max the upper bound for the interval 162 public double[] inversetransform(UnivariateRealFunction f, double min, double max, int n) argument 165 double data[] = FastFourierTransformer.sample(f, min, max, n); 194 * @param max th 82 transform(UnivariateRealFunction f, double min, double max, int n) argument 122 transform2( UnivariateRealFunction f, double min, double max, int n) argument 200 inversetransform2(UnivariateRealFunction f, double min, double max, int n) argument [all...] |
/external/compiler-rt/test/msan/ |
H A D | allocator_returns_null.cc | 25 volatile size_t size = std::numeric_limits<size_t>::max() - 10000; 39 volatile size_t kMaxSizeT = std::numeric_limits<size_t>::max();
|
/external/compiler-rt/test/tsan/ |
H A D | allocator_returns_null.cc | 20 volatile size_t size = std::numeric_limits<size_t>::max() - 10000; 34 volatile size_t kMaxSizeT = std::numeric_limits<size_t>::max();
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 414 int max = sz; 416 while (max > (min + 1)) { 418 * The guessIdx calculation is equivalent to ((min + max) 419 * / 2) but won't go wonky when min and max are close to 422 int guessIdx = min + ((max - min) >> 1); 426 max = guessIdx; 432 if ((max != sz)) { 433 return (value == values[max]) ? max : (-max [all...] |
/external/elfutils/src/tests/ |
H A D | run-stack-d-test.sh | 77 $STACKCMD: tid 13654: shown max number of frames (2, use -n 0 for unlimited) 89 $STACKCMD: tid 13654: shown max number of frames (2, use -n 0 for unlimited) 98 $STACKCMD: tid 13654: shown max number of frames (2, use -n 0 for unlimited) 109 $STACKCMD: tid 13654: shown max number of frames (2, use -n 0 for unlimited)
|
/external/fonttools/Lib/fontTools/ttLib/tables/ |
H A D | _m_a_x_p.py | 84 xMax = max(xMax, g.xMax) 85 yMax = max(yMax, g.yMax) 88 maxPoints = max(maxPoints, nPoints) 89 maxContours = max(maxContours, nContours) 92 maxCompositePoints = max(maxCompositePoints, nPoints) 93 maxCompositeContours = max(maxCompositeContours, nContours) 94 maxComponentElements = max(maxComponentElements, len(g.components)) 95 maxComponentDepth = max(maxComponentDepth, componentDepth)
|
/external/fonttools/Tools/fontTools/ttLib/tables/ |
H A D | _m_a_x_p.py | 84 xMax = max(xMax, g.xMax) 85 yMax = max(yMax, g.yMax) 88 maxPoints = max(maxPoints, nPoints) 89 maxContours = max(maxContours, nContours) 92 maxCompositePoints = max(maxCompositePoints, nPoints) 93 maxCompositeContours = max(maxCompositeContours, nContours) 94 maxComponentElements = max(maxComponentElements, len(g.components)) 95 maxComponentDepth = max(maxComponentDepth, componentDepth)
|
/external/icu/icu4c/source/test/intltest/ |
H A D | tzregts.h | 53 UDate findTransitionBinary(const SimpleTimeZone& tz, UDate min, UDate max); 54 UDate findTransitionStepwise(const SimpleTimeZone& tz, UDate min, UDate max);
|
H A D | tsputil.h | 26 void maxMinTest(double a, double b, double exp, UBool max);
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_hashlimit.h | 8 /* 1/10,000 sec period => max of 10,000/sec. Min rate is then 429490 33 __u32 max; /* max number of entries */ member in struct:hashlimit_cfg 57 __u32 max; /* max number of entries */ member in struct:hashlimit_cfg1
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | xt_hashlimit.h | 8 /* 1/10,000 sec period => max of 10,000/sec. Min rate is then 429490 34 __u32 max; /* max number of entries */ member in struct:hashlimit_cfg 58 __u32 max; /* max number of entries */ member in struct:hashlimit_cfg1
|
/external/libcxx/test/std/numerics/rand/rand.eng/rand.eng.sub/ |
H A D | values.pass.cpp | 24 // static constexpr result_type max() { return m-1; } 42 /*static_*/assert((E::max() == 0xFFFFFF)/*, ""*/); 58 /*static_*/assert((E::max() == 0xFFFFFFFFFFFFull)/*, ""*/);
|
/external/libcxx/test/std/utilities/memory/allocator.traits/allocator.traits.members/ |
H A D | max_size.pass.cpp | 48 std::numeric_limits<std::size_t>::max()); 53 std::numeric_limits<std::size_t>::max());
|
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | stat.c | 14 if (val > stats->max) 15 stats->max = val;
|
/external/skia/src/effects/ |
H A D | SkEmbossMask.cpp | 21 static inline int neq_to_one(int x, int max) { argument 23 return x != max; 25 SkASSERT(x >= 0 && x <= max); 26 return ((unsigned)(x - max)) >> 31; 30 static inline int neq_to_mask(int x, int max) { argument 32 return -(x != max); 34 SkASSERT(x >= 0 && x <= max); 35 return (x - max) >> 31;
|
/external/squashfs-tools/squashfs-tools/ |
H A D | progressbar.c | 93 static void progress_bar(long long current, long long max, int columns) argument 99 if(max == 0) 102 max_digits = floor(log10(max)) + 1; 104 hashes = (current * (columns - used)) / max; 107 if((current > max) || (columns - used < 0)) 117 if((current % 100) != 0 && current != max) 135 printf("] %*lld/%*lld", max_digits, current, max_digits, max); 136 printf(" %3lld%%", current * 100 / max);
|
/external/toybox/toys/other/ |
H A D | acpi.c | 66 int cap = 0, curr = 0, max = 0; local 69 if ((max = read_int_at(dfd, "charge_full")) > 0) 71 else if ((max = read_int_at(dfd, "energy_full")) > 0) 73 if (max > 0 && curr >= 0) cap = 100 * curr / max; 113 int dfd=5, cur, max; local 127 max=read_int_at(dfd, "max_state"); 130 else printf("Cooling %d: %s %d of %d\n", TT.cool++, toybuf, cur, max);
|
/external/guava/guava/src/com/google/common/escape/ |
H A D | CharEscaperBuilder.java | 76 private int max = -1; field in class:CharEscaperBuilder 90 if (c > max) { 91 max = c; 115 char[][] result = new char[max + 1][];
|
/external/icu/icu4c/source/layout/ |
H A D | ThaiLayoutEngine.cpp | 55 // Input: characters (0..max provided for context) 59 le_int32 ThaiLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument 65 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
|
/external/iptables/extensions/ |
H A D | libipt_ah.c | 36 print_spis(const char *name, uint32_t min, uint32_t max, argument 41 if (min != 0 || max != 0xFFFFFFFF || invert) { 43 if (min == max) { 50 printf("%u",max);
|
H A D | libxt_esp.c | 36 print_spis(const char *name, uint32_t min, uint32_t max, argument 41 if (min != 0 || max != 0xFFFFFFFF || invert) { 42 if (min == max) 45 printf(" %ss:%s%u:%u", name, inv, min, max);
|