HomeSort by relevance Sort by last modified time
    Searched refs:max (Results 126 - 150 of 11221) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/clang/test/Analysis/
additive-folding-range-constraints.c 11 // solution range across an overflow boundary (Min for <, Max for >).
39 // comparison value over an overflow boundary (Min for <, Max for >).
165 int max = INT_MAX; local
167 clang_analyzer_eval((a + 2) <= (max - 5LL)); // expected-warning{{TRUE}}
176 unsigned max = UINT_MAX; local
177 clang_analyzer_eval(a < max); // expected-warning{{UNKNOWN}}
178 clang_analyzer_eval((a + 2) < max); // expected-warning{{UNKNOWN}}
179 clang_analyzer_eval((a + 2U) < max); // expected-warning{{UNKNOWN}}
183 unsigned max = UINT_MAX; local
184 clang_analyzer_eval(a <= max); // expected-warning{{TRUE}
190 int max = INT_MAX; local
197 int max = INT_MAX; local
260 unsigned max = INT_MAX; local
267 unsigned max = INT_MAX; local
288 unsigned max = INT_MAX; local
    [all...]
  /external/google-breakpad/src/testing/gtest/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /external/googletest/googletest/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /external/ltp/testcases/lib/
tst_random.c 42 static long rand_range(long min, long max)
44 return random() % (max - min + 1) + min;
50 long min = 0, max = 0; local
70 max = strtol(argv[1], &end, 10);
89 rval = (min > max) ? rand_range(max, min) : rand_range(min, max);
  /external/protobuf/gtest/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /external/skia/tools/
Stats.h 24 min = max = mean = var = median = 0;
29 max = samples[0];
32 if (samples[i] > max) { max = samples[i]; }
52 // Normalize samples to [min, max] in as many quanta as we have distinct bars to print.
54 if (min == max) {
62 s /= (max - min);
71 double max;
  /external/skqp/tools/
Stats.h 24 min = max = mean = var = median = 0;
29 max = samples[0];
32 if (samples[i] > max) { max = samples[i]; }
52 // Normalize samples to [min, max] in as many quanta as we have distinct bars to print.
54 if (min == max) {
62 s /= (max - min);
71 double max;
  /external/v8/testing/gtest/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /frameworks/native/services/surfaceflinger/
clz.h 41 static inline T max(T a, T b) { function in namespace:android
45 static inline T max(T a, T b, T c) { function in namespace:android
46 return max(a, max(b, c));
49 static inline T max(T a, T b, T c, T d) { function in namespace:android
50 return max(a, b, max(c, d));
  /libcore/luni/src/test/java/libcore/java/lang/
ByteTest.java 23 final byte max = Byte.MAX_VALUE;
24 assertTrue(Byte.compare(max, max) == 0);
27 assertTrue(Byte.compare(max, zero) > 0);
28 assertTrue(Byte.compare(max, min) > 0);
29 assertTrue(Byte.compare(zero, max) < 0);
32 assertTrue(Byte.compare(min, max) < 0);
ShortTest.java 23 final short max = Short.MAX_VALUE; local
24 assertTrue(Short.compare(max, max) == 0);
27 assertTrue(Short.compare(max, zero) > 0);
28 assertTrue(Short.compare(max, min) > 0);
29 assertTrue(Short.compare(zero, max) < 0);
32 assertTrue(Short.compare(min, max) < 0);
  /prebuilts/ndk/r16/sources/third_party/googletest/googletest/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/samples/
prime_tables.h 82 // 'max' specifies the maximum number the prime table holds.
83 explicit PreCalculatedPrimeTable(int max)
84 : is_prime_size_(max + 1), is_prime_(new bool[max + 1]) {
85 CalculatePrimesUpTo(max);
102 void CalculatePrimesUpTo(int max) {
106 for (int i = 2; i <= max; i++) {
110 for (int j = 2*i; j <= max; j += i) {
  /system/chre/apps/chqts/src/general_test/
cell_info_lte.cc 50 constexpr int32_t max = INT32_MAX; local
55 } else if (!isBoundedInt32(strength.rsrp, 44, 140, max)) {
58 } else if (!isBoundedInt32(strength.rsrq, 3, 20, max)) {
62 } else if (!isBoundedInt32(strength.rssnr, -200, 300, max)) {
66 } else if (!isBoundedInt32(strength.cqi, 0, 15, max)) {
69 } else if (!isBoundedInt32(strength.timingAdvance, 0, max, max)) {
  /external/google-breakpad/src/testing/src/
gmock-cardinalities.cc 52 BetweenCardinalityImpl(int min, int max)
54 max_(max >= min_ ? max : min_) {
60 } else if (max < 0) {
62 << "but is actually " << max << "."; local
64 } else if (min > max) {
65 ss << "The invocation upper bound (" << max
148 // Creates a cardinality that allows between min and max calls.
149 GTEST_API_ Cardinality Between(int min, int max) {
150 return Cardinality(new BetweenCardinalityImpl(min, max));
    [all...]
  /external/googletest/googlemock/src/
gmock-cardinalities.cc 52 BetweenCardinalityImpl(int min, int max)
54 max_(max >= min_ ? max : min_) {
60 } else if (max < 0) {
62 << "but is actually " << max << "."; local
64 } else if (min > max) {
65 ss << "The invocation upper bound (" << max
148 // Creates a cardinality that allows between min and max calls.
149 GTEST_API_ Cardinality Between(int min, int max) {
150 return Cardinality(new BetweenCardinalityImpl(min, max));
    [all...]
  /external/v8/testing/gmock/src/
gmock-cardinalities.cc 52 BetweenCardinalityImpl(int min, int max)
54 max_(max >= min_ ? max : min_) {
60 } else if (max < 0) {
62 << "but is actually " << max << "."; local
64 } else if (min > max) {
65 ss << "The invocation upper bound (" << max
148 // Creates a cardinality that allows between min and max calls.
149 GTEST_API_ Cardinality Between(int min, int max) {
150 return Cardinality(new BetweenCardinalityImpl(min, max));
    [all...]
  /external/caliper/examples/src/main/java/examples/
LoopingBackwardsBenchmark.java 26 @Param({"2", "20", "2000", "20000000"}) int max; field in class:LoopingBackwardsBenchmark
31 for (int j = 0; j < max; j++) {
41 for (int j = max - 1; j >= 0; j--) {
  /external/swiftshader/src/OpenGL/compiler/
util.cpp 24 *value = std::numeric_limits<float>::max();
32 *value = std::numeric_limits<int>::max();
40 *value = std::numeric_limits<unsigned int>::max();
  /external/swiftshader/src/OpenGL/libGL/
mathutil.h 56 const unsigned int max = 0xFFFFFFFF >> (32 - n); local
60 return max;
68 return (unsigned int)(max * x + 0.5f);
  /external/swiftshader/src/OpenGL/libGLES_CM/
mathutil.h 56 const unsigned int max = 0xFFFFFFFF >> (32 - n); local
60 return max;
68 return (unsigned int)(max * x + 0.5f);
  /external/webrtc/webrtc/base/
urlencode.h 26 int UrlEncode(const char *source, char *dest, unsigned max);
30 unsigned max);
34 int UrlEncodeOnlyUnsafeChars(const char *source, char *dest, unsigned max);
  /external/webrtc/webrtc/test/testsupport/metrics/
video_metrics.h 34 min(std::numeric_limits<double>::max()),
35 max(std::numeric_limits<double>::min()),
41 double max; member in struct:webrtc::test::QualityMetricsResult
  /frameworks/base/packages/SystemUI/src/com/android/systemui/qs/touch/
OverScroll.java 41 * @param max The maximum amount that the View can overscroll.
44 public static int dampedScroll(float amount, int max) {
47 float f = amount / max;
55 return Math.round(OVERSCROLL_DAMP_FACTOR * f * max);

Completed in 978 milliseconds

1 2 3 4 56 7 8 91011>>