| /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/Posix/ |
| 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);
|
| /external/clang/test/CodeGen/ |
| PR4611-bitfield-layout.c | 6 unsigned int type:3, pack_id:16, depth:13; member in struct:object_entry
|
| /external/valgrind/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...] |
| /cts/tests/tests/renderscript/src/android/renderscript/cts/refocus/ |
| LayerInfo.java | 21 * several consecutive depth levels.
27 LayerInfo(int depth) {
28 frontDepth = depth;
29 backDepth = depth;
|
| /external/compiler-rt/test/asan/TestCases/ |
| heavy_uar_test.cc | 27 void RecursiveFunctionWithStackFrame(int depth) {
28 if (depth <= 0) return;
30 x[0] = depth;
32 RecursiveFunctionWithStackFrame<kFrameSize>(depth - 1);
43 int depth = argc >= 3 ? atoi(argv[2]) : 500; local
45 RecursiveFunctionWithStackFrame<10>(depth);
46 RecursiveFunctionWithStackFrame<100>(depth);
47 RecursiveFunctionWithStackFrame<500>(depth);
48 RecursiveFunctionWithStackFrame<1024>(depth);
49 RecursiveFunctionWithStackFrame<2000>(depth);
[all...] |
| uar_and_exceptions.cc | 24 void Func(int depth) {
27 if (depth)
28 Func(depth - 1);
|
| /external/compiler-rt/test/msan/ |
| stack-origin2.cc | 24 int f(int depth) {
25 if (depth) return f(depth - 1);
|
| /frameworks/rs/java/tests/Refocus/src/com/android/rs/test/ |
| LayerInfo.java | 5 * several consecutive depth levels.
11 LayerInfo(int depth) {
12 frontDepth = depth;
13 backDepth = depth;
|
| /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,
|
| /external/valgrind/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/memcheck/tests/solaris/ |
| lsframe2.c | 11 int rec(int depth)
15 if (depth == 0) return 0;
17 arr[i] = i * depth;
18 zzz = rec(depth-1);
|
| /external/valgrind/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);
|
| /external/opencv3/modules/core/include/opencv2/core/ |
| traits.hpp | 60 form CV_\<bit-depth\>{U|S|F}C(\<number_of_channels\>), for example: uchar \~ CV_8UC1, 3-element
85 enum { depth = DataDepth<_Tp>::value, channels=2,
87 type=CV_MAKETYPE(depth, channels) };
98 // the statement below will print 6, 2 , that is depth == CV_64F, channels == 2
99 cout << B.depth() << ", " << B.channels() << endl;
114 depth = -1, enumerator in enum:cv::DataType::__anon22189
117 type = CV_MAKETYPE(depth, channels)
129 depth = CV_8U, enumerator in enum:cv::DataType::__anon22190
132 type = CV_MAKETYPE(depth, channels)
144 depth = CV_8U enumerator in enum:cv::DataType::__anon22191
159 depth = CV_8S, enumerator in enum:cv::DataType::__anon22192
174 depth = CV_8S, enumerator in enum:cv::DataType::__anon22193
189 depth = CV_16U, enumerator in enum:cv::DataType::__anon22194
204 depth = CV_16S, enumerator in enum:cv::DataType::__anon22195
219 depth = CV_32S, enumerator in enum:cv::DataType::__anon22196
234 depth = CV_32F, enumerator in enum:cv::DataType::__anon22197
249 depth = CV_64F, enumerator in enum:cv::DataType::__anon22198
276 enum { depth = CV_USRTYPE1 }; enumerator in enum:cv::TypeDepth::__anon22200
282 enum { depth = CV_8U }; enumerator in enum:cv::TypeDepth::__anon22201
288 enum { depth = CV_8S }; enumerator in enum:cv::TypeDepth::__anon22202
294 enum { depth = CV_16U }; enumerator in enum:cv::TypeDepth::__anon22203
300 enum { depth = CV_16S }; enumerator in enum:cv::TypeDepth::__anon22204
306 enum { depth = CV_32S }; enumerator in enum:cv::TypeDepth::__anon22205
312 enum { depth = CV_32F }; enumerator in enum:cv::TypeDepth::__anon22206
318 enum { depth = CV_64F }; enumerator in enum:cv::TypeDepth::__anon22207
[all...] |
| /dalvik/dx/src/com/android/dx/merge/ |
| SortableType.java | 39 if (a.depth != b.depth) {
40 return a.depth - b.depth;
49 private int depth = -1; field in class:SortableType
74 * Assigns this type's depth if the depths of its supertype and implemented
75 * interfaces are known. Returns false if the depth couldn't be computed
86 } else if (sortableSupertype.depth == -1) {
89 max = sortableSupertype.depth;
97 } else if (implemented.depth == -1)
[all...] |
| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| tree.go | 45 var n = flag.Int("n", 16, "depth")
52 func bottomUpTree(item, depth int) *Node {
53 if depth <= 0 {
56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
80 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
84 for depth := minDepth; depth <= maxDepth; depth += 2 {
85 iterations := 1 << uint(maxDepth-depth+minDepth
[all...] |
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| binary-tree.go | 44 var n = flag.Int("n", 15, "depth")
51 func bottomUpTree(item, depth int) *Node {
52 if depth <= 0 {
55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
77 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
81 for depth := minDepth; depth <= maxDepth; depth += 2 {
82 iterations := 1 << uint(maxDepth-depth+minDepth
[all...] |
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| tree.go | 45 var n = flag.Int("n", 16, "depth")
52 func bottomUpTree(item, depth int) *Node {
53 if depth <= 0 {
56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
80 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
84 for depth := minDepth; depth <= maxDepth; depth += 2 {
85 iterations := 1 << uint(maxDepth-depth+minDepth
[all...] |
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| binary-tree.go | 44 var n = flag.Int("n", 15, "depth")
51 func bottomUpTree(item, depth int) *Node {
52 if depth <= 0 {
55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
77 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
81 for depth := minDepth; depth <= maxDepth; depth += 2 {
82 iterations := 1 << uint(maxDepth-depth+minDepth
[all...] |
| /external/opencv3/modules/ts/src/ |
| ocl_perf.cpp | 67 if (dst.depth() == CV_8U)
69 else if (dst.depth() == CV_8S)
71 else if (dst.depth() == CV_16U)
73 else if (dst.depth() == CV_32F || dst.depth() == CV_64F)
75 else if (dst.depth() == CV_16S || dst.depth() == CV_32S)
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/particles/values/ |
| RectangleSpawnShapeValue.java | 20 float depth = spawnDepth + (spawnDepthDiff * spawnDepthValue.getScale(percent)); local
30 tz = MathUtils.random(1)==0 ? -depth/2 : depth/2;
34 tz = MathUtils.random(depth) - depth / 2;
39 tz = MathUtils.random(1)==0 ? -depth/ 2 : depth/ 2;
54 tz = MathUtils.random(1)==0 ? -depth/2 : depth/2;
58 tz = MathUtils.random(depth) - depth / 2
[all...] |
| /cts/common/util/src/com/android/compatibility/common/util/ |
| Stacktrace.java | 60 StackTraceElement[] elements, int depth, boolean includeLineNumber) {
61 depth = Math.min(depth, elements.length - 1);
63 builder.append(elements[depth].getClassName()).append("#")
64 .append(elements[depth].getMethodName());
66 builder.append(":").append(elements[depth].getLineNumber());
|
| /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...] |
