Home
last modified time | relevance | path

Searched refs:max_depth (Results 1 – 5 of 5) sorted by relevance

/aosp12/art/test/1987-structural-redefine-recursive-stack-scope/src/
H A DMain.java63 final int max_depth = 10; in main() local
64 Object[] results = new Object[max_depth]; in main()
69 for (int i = 0; i < max_depth; i++) { in main()
82 for (int i = 0; i < max_depth; i++) { in main()
/aosp12/frameworks/base/tools/localedata/
H A Dextract_icu_data.py251 max_depth = 1
257 max_depth = max(max_depth, depth)
258 assert max_depth < 5 # Our algorithms assume small max_depth
260 print 'const size_t MAX_PARENT_DEPTH = %d;' % max_depth
/aosp12/art/runtime/
H A Dbacktrace_helper.cc54 explicit UnwindHelper(size_t max_depth) in UnwindHelper()
59 unwinder_(max_depth, &maps_, memory_) { in UnwindHelper()
71 static UnwindHelper* Get(Thread* self, size_t max_depth) { in Get()
74 tls = new UnwindHelper(max_depth); in Get()
H A Dbacktrace_helper.h32 BacktraceCollector(uintptr_t* out_frames, size_t max_depth, size_t skip_count) in BacktraceCollector() argument
33 : out_frames_(out_frames), max_depth_(max_depth), skip_count_(skip_count) {} in BacktraceCollector()
/aosp12/system/extras/simpleperf/scripts/inferno/
H A Ddata_types.py116 def trim_callchain(self, min_num_events, max_depth, depth=0): argument
120 if depth <= max_depth:
124 child.trim_callchain(min_num_events, max_depth, depth + 1)