HomeSort by relevance Sort by last modified time
    Searched refs:depth (Results 1 - 25 of 1146) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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/clang/test/CodeGen/
PR4611-bitfield-layout.c 6 unsigned int type:3, pack_id:16, depth:13; member in struct:object_entry
  /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...]
  /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/webkit/Source/WebKit/chromium/public/
WebScreenInfo.h 39 // The screen depth in bits per pixel
40 int depth; member in struct:WebKit::WebScreenInfo
67 : depth(0)
  /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/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/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...]
  /packages/apps/Email/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/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...]
  /external/compiler-rt/lib/asan/lit_tests/
deep_stack_uaf.cc 13 template <int depth>
16 DeepFree<depth - 1>::free(x);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/X11/
ImUtil.h 9 int depth);
14 int depth);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/X11/
ImUtil.h 9 int depth);
14 int depth);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/X11/
ImUtil.h 9 int depth);
14 int depth);
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
ListStack`1.cs 45 public T Peek(int depth)
48 if (!TryPeek(depth, out item))
59 public bool TryPeek(int depth, out T item)
61 if (depth >= Count)
67 item = this[Count - depth - 1];
  /external/webkit/Source/WebCore/platform/qt/
PlatformScreenQt.cpp 56 return QApplication::desktop()->screen(screenNumber(w))->depth();
61 int depth = QApplication::desktop()->screen(0)->depth(); local
68 depth = view->depth();
73 // values for each screen depth and assume RGB/RGBA where appropriate.
77 switch (depth) {
83 return qRound(depth / 3);
  /external/webkit/Source/JavaScriptCore/wtf/
AVLTree.h 124 // E.g., if, in a particular instantiation, the maximum number of nodes in a tree instance is 1,000,000, the maximum depth should be 28.
165 // Initialize depth to invalid value, to indicate iterator is
166 // invalid. (Depth is zero-base.)
167 Iterator() { depth = ~0U; }
182 depth = ~0U;
203 depth = d;
210 depth = d;
227 depth = ~0U;
232 if (depth != ~0U)
233 path_h[depth] = h
    [all...]
  /external/elfutils/libdw/
dwarf_getscopes_die.c 58 scope_visitor (unsigned int depth, struct Dwarf_Die_Chain *die, void *arg)
63 Dwarf_Die *scopes = malloc (depth * sizeof scopes[0]);
77 assert (i == depth);
80 return depth;
  /external/webkit/Source/WebCore/html/canvas/
WebGLContextAttributes.idl 33 attribute boolean depth;
  /external/webkit/Source/WebKit/chromium/src/x11/
WebScreenInfoFactory.cpp 48 results.depth = XDisplayPlanes(display, screenNumber);
49 results.isMonochrome = results.depth == 1;

Completed in 1864 milliseconds

1 2 3 4 5 6 7 8 91011>>