| /external/clang/test/SemaCXX/ |
| constexpr-depth.cpp | 1 // RUN: %clang_cc1 -std=c++11 -fsyntax-only -verify %s -DMAX=128 -fconstexpr-depth 128
2 // RUN: %clang_cc1 -std=c++11 -fsyntax-only -verify %s -DMAX=2 -fconstexpr-depth 2
3 // RUN: %clang -std=c++11 -fsyntax-only -Xclang -verify %s -DMAX=10 -fconstexpr-depth=10
5 constexpr int depth(int n) { return n > 1 ? depth(n-1) : 0; } // expected-note {{exceeded maximum depth}} expected-note +{{}} function
7 constexpr int kBad = depth(MAX + 1); // expected-error {{must be initialized by a constant expression}} expected-note {{in call to 'depth(}}
8 constexpr int kGood = depth(MAX);
|
| /external/compiler-rt/test/asan/TestCases/ |
| deep_call_stack.cc | 10 void RecursiveFunc(int depth, int *ptr) {
11 if ((depth % 1000) == 0)
12 printf("[%05d] ptr: %p\n", depth, ptr);
13 if (depth == 0)
16 RecursiveFunc(depth - 1, &local);
|
| uar_and_exceptions.cc | 24 void Func(int depth) {
27 if (depth)
28 Func(depth - 1);
|
| /external/lldb/test/lang/c/recurse/ |
| main.c | 5 recurse_crash (uint32_t depth)
7 if (depth > 0)
8 return recurse_crash (depth - 1);
15 // If we have more than one argument, then it should a depth to recurse to.
18 uint32_t depth = UINT32_MAX; local
22 depth = strtoul (argv[1], &end, 0);
24 depth = UINT32_MAX;
26 recurse_crash (depth);
|
| /external/clang/test/CodeGen/ |
| PR4611-bitfield-layout.c | 6 unsigned int type:3, pack_id:16, depth:13; member in struct:object_entry
|
| /bionic/libc/bionic/ |
| malloc_debug_backtrace.h | 34 #define GET_BACKTRACE(bt, depth) \
35 (g_backtrace_enabled ? get_backtrace(bt, depth) : 0)
|
| /external/valgrind/main/none/tests/amd64/ |
| bug156404-amd64.stdout.exp | 0 depth 0: r = 1
2 depth 1: r = 1
3 depth 2: r = 1
4 depth 3: r = 1
5 depth 4: r = 1
6 depth 5: r = 1
7 depth 6: r = 1
8 depth 7: r = 1
9 depth 8: r = 1
10 depth 9: r =
[all...] |
| /external/javassist/src/main/javassist/runtime/ |
| Cflow.java | 26 private static class Depth {
27 private int depth; field in class:Cflow.Depth
28 Depth() { depth = 0; }
29 int get() { return depth; }
30 void inc() { ++depth; }
31 void dec() { --depth; }
35 return new Depth();
41 public void enter() { ((Depth)get()).inc(); }
46 public void exit() { ((Depth)get()).dec();
[all...] |
| /external/compiler-rt/test/asan/TestCases/Linux/ |
| heavy_uar_test.cc | 30 void RecuriveFunctionWithStackFrame(int depth) {
31 if (depth <= 0) return;
33 x[0] = depth;
35 RecuriveFunctionWithStackFrame<kFrameSize>(depth - 1);
40 int depth = argc >= 3 ? atoi(argv[2]) : 500; local
42 RecuriveFunctionWithStackFrame<10>(depth);
43 RecuriveFunctionWithStackFrame<100>(depth);
44 RecuriveFunctionWithStackFrame<500>(depth);
45 RecuriveFunctionWithStackFrame<1024>(depth);
46 RecuriveFunctionWithStackFrame<2000>(depth);
[all...] |
| /libcore/dalvik/src/main/java/dalvik/system/profiler/ |
| PortableThreadSampler.java | 27 private int depth; field in class:PortableThreadSampler
29 @Override public void setDepth(int depth) {
30 this.depth = depth;
38 if (stackFrames.length > depth) {
39 stackFrames = Arrays.copyOfRange(stackFrames, 0, depth);
|
| DalvikThreadSampler.java | 24 private int depth; field in class:DalvikThreadSampler
27 * Reusable storage for sampling sized for the specified depth.
31 @Override public void setDepth(int depth) {
32 this.depth = depth;
33 this.mutableStackTraceElements = new StackTraceElement[depth+1][];
40 int count = VMStack.fillStackTraceElements(thread, mutableStackTraceElements[depth]);
44 if (count < depth) {
45 System.arraycopy(mutableStackTraceElements[depth], 0,
|
| ThreadSampler.java | 29 * Used to specify the maximum stack depth to collect.
31 public void setDepth(int depth);
35 * maximum depth specified by {@link #setDepth setDepth}. May
|
| /external/chromium_org/third_party/cld/base/ |
| crash.h | 13 CrashReason() : filename(0), line_number(0), message(0), depth(0) {}
22 int depth; member in struct:base::CrashReason
|
| /external/valgrind/main/memcheck/tests/linux/ |
| lsframe2.c | 13 int rec ( int depth )
17 if (depth == 0) return 0;
19 arr[i] = i * depth;
20 zzz = rec(depth-1);
|
| /external/valgrind/main/none/tests/ |
| stackgrowth.c | 4 #define DEPTH (4*1024)
7 static void test(int depth)
13 if (depth > 1)
14 test(depth-1);
19 test(DEPTH);
|
| /dalvik/dx/src/com/android/dx/merge/ |
| SortableType.java | 39 if (a.depth != b.depth) {
40 return a.depth - b.depth;
48 private int depth = -1; field in class:SortableType
68 * Assigns this type's depth if the depths of its supertype and implemented
69 * interfaces are known. Returns false if the depth couldn't be computed
80 } else if (sortableSupertype.depth == -1) {
83 max = sortableSupertype.depth;
91 } else if (implemented.depth == -1)
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| access-binary-trees.js | 16 function bottomUpTree(item,depth){
17 if (depth>0){
19 bottomUpTree(2*item-1, depth-1)
20 ,bottomUpTree(2*item, depth-1)
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
44 check += bottomUpTree(i,depth).itemCheck();
45 check += bottomUpTree(-i,depth).itemCheck()
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| access-binary-trees.js | 16 function bottomUpTree(item,depth){
17 if (depth>0){
19 bottomUpTree(2*item-1, depth-1)
20 ,bottomUpTree(2*item, depth-1)
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
44 check += bottomUpTree(i,depth).itemCheck();
45 check += bottomUpTree(-i,depth).itemCheck()
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| access-binary-trees.js | 16 function bottomUpTree(item,depth){
17 if (depth>0){
19 bottomUpTree(2*item-1, depth-1)
20 ,bottomUpTree(2*item, depth-1)
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
44 check += bottomUpTree(i,depth).itemCheck();
45 check += bottomUpTree(-i,depth).itemCheck()
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/ |
| DirectoryWalker.java | 32 * This class operates with a {@link FileFilter} and maximum depth to
65 * protected boolean handleDirectory(File directory, int depth, Collection results) {
76 * protected void handleFile(File file, int depth, Collection results) {
206 * private void handleIsCancelled(File file, int depth, Collection results) {
226 * protected boolean handleDirectory(File directory, int depth, Collection results) throws IOException {
229 * throw new CancelException(file, depth);
234 * protected void handleFile(File file, int depth, Collection results) throws IOException {
237 * throw new CancelException(file, depth);
258 * The limit on the directory depth to walk.
263 * Construct an instance with no filtering and unlimited <i>depth</i>
574 private int depth = -1; field in class:DirectoryWalker.CancelException
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_clear.h | 41 double depth, unsigned stencil);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
| sp_clear.h | 40 double depth, unsigned stencil);
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_clear.h | 41 double depth, unsigned stencil);
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_clear.h | 40 double depth, unsigned stencil);
|
| /external/proguard/src/proguard/shrink/ |
| ShortestUsageMark.java | 40 private final int depth; field in class:ShortestUsageMark
53 this.depth = 0;
88 this.depth = previousUsageMark.depth + cost;
104 this.depth = otherUsageMark.depth;
134 return this.depth < otherUsageMark.depth;
178 return "certain=" + certain + ", depth="+depth+": "
[all...] |
