Searched defs:max (Results 1 - 18 of 18) sorted by relevance

/art/test/911-get-stack-trace/src/art/
H A DAllTraces.java74 public static void printAll(int max) { argument
75 PrintThread.printAll(getAllStackTraces(max));
81 public static native Object[][] getAllStackTraces(int max); argument
H A DThreadListTraces.java67 public static void printList(Thread[] threads, int max) { argument
68 PrintThread.printAll(getThreadListStackTraces(threads, max));
72 public static native Object[][] getThreadListStackTraces(Thread threads[], int max); argument
H A DRecurse.java20 public static int foo(int x, int start, int max, ControlData data) { argument
21 bar(x, start, max, data);
25 private static long bar(int x, int start, int max, ControlData data) { argument
26 baz(x, start, max, data);
30 private static Object baz(int x, int start, int max, ControlData data) { argument
32 printOrWait(start, max, data);
34 foo(x - 1, start, max, data);
39 private static void printOrWait(int start, int max, ControlData data) { argument
41 PrintThread.print(Thread.currentThread(), start, max);
H A DPrintThread.java37 public static void print(Thread t, int start, int max) { argument
38 print(getStackTrace(t, start, max));
91 public static native String[][] getStackTrace(Thread thread, int start, int max); argument
/art/test/133-static-invoke-super/src/
H A DMain.java12 public void testDirect(int max) { argument
13 for (int i = 0; i < max; ++i) {
14 getVarDirect(max);
17 public void testStatic(int max) { argument
18 for (int i = 0; i < max; ++i) {
19 getVar(max);
/art/cmdline/
H A Dcmdline_parse_result.h70 // which is printed from the actual/min/max values.
74 const T& max) {
78 ", max: " + art::detail::ToStringAny(max));
72 OutOfRange(const T& value, const T& min, const T& max) argument
H A Dcmdline_parser.h122 ArgumentBuilder<TArg>& WithRange(const TArg& min, const TArg& max) { argument
125 argument_info_.max_ = max;
/art/test/911-get-stack-trace/
H A Dstack_trace.cc129 JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jthread thread, jint start, jint max) {
130 std::unique_ptr<jvmtiFrameInfo[]> frames(new jvmtiFrameInfo[max]);
134 jvmtiError result = jvmti_env->GetStackTrace(thread, start, max, frames.get(), &count);
144 JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jint max) {
148 jvmtiError result = jvmti_env->GetAllStackTraces(max, &stack_infos, &thread_count);
172 JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jobjectArray jthreads, jint max) {
183 max,
128 Java_art_PrintThread_getStackTrace( JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jthread thread, jint start, jint max) argument
143 Java_art_AllTraces_getAllStackTraces( JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jint max) argument
171 Java_art_ThreadListTraces_getThreadListStackTraces( JNIEnv* env, jclass klass ATTRIBUTE_UNUSED, jobjectArray jthreads, jint max) argument
/art/libartbase/base/
H A Dbit_utils_test.cc180 static_cast<int64_t>(std::numeric_limits<int32_t>::max()) + 1;
182 static_cast<int64_t>(std::numeric_limits<uint32_t>::max()) + 1;
194 EXPECT_FALSE(IsInt<int32_t>(31, std::numeric_limits<int32_t>::max()));
196 EXPECT_TRUE(IsInt<int32_t>(32, std::numeric_limits<int32_t>::max()));
209 EXPECT_FALSE(IsInt<int64_t>(31, std::numeric_limits<int32_t>::max()));
211 EXPECT_TRUE(IsInt<int64_t>(32, std::numeric_limits<int32_t>::max()));
215 EXPECT_FALSE(IsInt<int64_t>(63, std::numeric_limits<int64_t>::max()));
217 EXPECT_TRUE(IsInt<int64_t>(64, std::numeric_limits<int64_t>::max()));
229 static_assert(!IsInt<31, int32_t>(std::numeric_limits<int32_t>::max()), "TestIsInt32#10");
231 static_assert(IsInt<32, int32_t>(std::numeric_limits<int32_t>::max()), "TestIsInt3
368 == std::numeric_limits<uint32_t>::max(), member in class:art::std::numeric_limits
371 == std::numeric_limits<int32_t>::max(), member in class:art::std::numeric_limits
[all...]
H A Dbit_vector.cc223 // Difference until max, we know both accept it:
258 storage_[idx] = std::numeric_limits<uint32_t>::max();
275 unsigned int max = storage_size_; local
276 for (int idx = max - 1; idx >= 0; idx--) {
H A Dutils.cc181 double max,
193 sane_val = iss.eof() && (value >= min) && (value <= max);
197 sane_val = *end == '\0' && value >= min && value <= max;
178 ParseDouble(const std::string& option, char after_char, double min, double max, double* parsed_value, UsageFn Usage) argument
H A Dutils.h43 if (std::numeric_limits<T>::max() < result) {
57 if (result < std::numeric_limits<T>::min() || std::numeric_limits<T>::max() < result) {
155 double max,
163 static constexpr uint32_t max() { return std::numeric_limits<uint32_t>::max(); } function in struct:art::Arc4RandomGenerator
172 static T GetRandomNumber(T min, T max) { argument
173 CHECK_LT(min, max);
174 std::uniform_int_distribution<T> dist(min, max);
/art/compiler/optimizing/
H A Dinduction_var_analysis.cc871 int64_t max = DataType::MaxValueOfIntegralType(to); local
876 IsAtMost(initial, &value) && value <= max) {
1085 int64_t max = DataType::MaxValueOfIntegralType(type); local
1091 (IsAtMost(upper_expr, &value) && value <= (max - stride_value + 1));
1093 return (IsAtMost(upper_expr, &value) && value <= (max - stride_value));
1111 int64_t max = DataType::MaxValueOfIntegralType(type); local
1116 max--;
1123 IsAtMost(lower_expr, &value) && value <= max &&
1125 IsAtMost(upper_expr, &value) && value <= max;
H A Dinduction_var_range.cc25 return std::numeric_limits<int32_t>::min() <= c && c <= std::numeric_limits<int32_t>::max();
50 if (a > 0 && b > 0 && a > (std::numeric_limits<int64_t>::max() / b)) {
169 int32_t max = DataType::MaxValueOfIntegralType(type); local
170 return (IsConstantValue(v) && min <= v.b_constant && v.b_constant <= max)
488 // in any loop, or are contained in a proper interval. This allows finding the min/max
552 // analysis (finding max a * (TC - 1) + OFFSET for a == 1 and TC = UPPER - OFFSET or finding
650 // loop-body is minimal 1 and maximal, with safe trip-count, max int,
655 return Value(std::numeric_limits<int32_t>::max());
688 return is_min ? Value(0) : Value(std::numeric_limits<int32_t>::max());
964 : std::max(v
[all...]
/art/libdexfile/dex/
H A Ddex_file.cc491 uint32_t max = tries_size; local
492 while (min < max) {
493 const uint32_t mid = (min + max) / 2;
500 max = mid;
H A Ddex_file_verifier.cc38 static constexpr uint32_t kTypeIdLimit = std::numeric_limits<uint16_t>::max();
286 uintptr_t max = 0 - 1; local
287 size_t available_bytes_till_end_of_mem = max - reinterpret_cast<uintptr_t>(start);
/art/tools/jfuzz/
H A Djfuzz.cc371 case 4: fprintf(out_, "%s.max", prefix); break;
373 case 6: fputs("Math.max", out_); break;
385 case 3: fprintf(out_, "%s.max", prefix); break;
387 case 5: fputs("Math.max", out_); break;
1255 // Return random integer in range [0,max).
1256 uint32_t random0(uint32_t max) { argument
1257 std::uniform_int_distribution<uint32_t> gen(0, max - 1);
1261 // Return random integer in range [1,max].
1262 uint32_t random1(uint32_t max) { argument
1263 std::uniform_int_distribution<uint32_t> gen(1, max);
[all...]
/art/tools/dmtracedump/
H A Dtracedump.cc45 /* thread list in key file is not reliable, so just max out */
2346 int32_t max = (d1->numMethods < d2->numMethods) ? d2->numMethods : d1->numMethods; local
2347 max++;
2348 DiffEntry* diffs = new DiffEntry[max];
2349 memset(diffs, 0, max * sizeof(DiffEntry));

Completed in 273 milliseconds