/external/clang/test/CodeGen/ |
H A D | PR4611-bitfield-layout.c | 5 unsigned int type:3, pack_id:16, depth:13; member in struct:object_entry
|
/external/valgrind/main/none/tests/amd64/ |
H A D | 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 [all...] |
/external/javassist/src/main/javassist/runtime/ |
H A D | Cflow.java | 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; }
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | 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) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | 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) [all...] |
/external/webkit/Source/WebKit/chromium/public/ |
H A D | 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/ |
H A D | 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/ |
H A D | stackgrowth.c | 7 static void test(int depth) argument 13 if (depth > 1) 14 test(depth-1);
|
/external/proguard/src/proguard/shrink/ |
H A D | 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/webkit/Source/WebCore/platform/qt/ |
H A D | 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/ |
H A D | 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 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; 234 depth [all...] |
/external/webkit/Source/WebCore/html/canvas/ |
H A D | WebGLContextAttributes.idl | 33 attribute boolean depth;
|
H A D | WebGLContextAttributes.cpp | 70 bool WebGLContextAttributes::depth() const function in class:WebCore::WebGLContextAttributes 72 return m_attrs.depth; 75 void WebGLContextAttributes::setDepth(bool depth) argument 77 m_attrs.depth = depth;
|
H A D | WebGLContextAttributes.h | 50 // Whether or not the drawing buffer has a depth buffer; default=true 51 bool depth() const; 52 void setDepth(bool depth);
|
/external/webkit/Source/WebKit/chromium/src/x11/ |
H A D | WebScreenInfoFactory.cpp | 48 results.depth = XDisplayPlanes(display, screenNumber); 49 results.isMonochrome = results.depth == 1;
|
/external/qemu-pc-bios/vgabios/ |
H A D | vbetables-gen.c | 10 int depth; member in struct:__anon8859 104 if (pm->depth == 4) 107 pitch = pm->width * ((pm->depth + 7) / 8); 111 pm->mode, pm->width, pm->height, pm->depth); 112 if (pm->depth == 4) 150 if (pm->depth == 4) { 155 printf("/*Bit8u BitsPerPixel*/ %d,\n", pm->depth); 159 if (pm->depth == 4) 161 else if (pm->depth == 8) 167 if (pm->depth [all...] |
/external/dbus/tools/ |
H A D | dbus-print-message.c | 50 indent (int depth) argument 52 while (depth-- > 0) 57 print_hex (unsigned char *bytes, unsigned int len, int depth) argument 63 indent (depth + 1); 66 columns = (80 - ((depth + 1) * INDENT)) / 3; 83 indent (depth + 1); 93 indent (depth); 100 print_ay (DBusMessageIter *iter, int depth) argument 139 print_hex (bytes, len, depth); 146 print_iter (DBusMessageIter *iter, dbus_bool_t literal, int depth) argument [all...] |
/external/libvpx/vpx_mem/memory_manager/include/ |
H A D | cavl_impl.h | 104 /* The maximum depth may be greater than the number of bits in a long, 106 ** depth. */ 355 /* Zero-based depth in tree. */ 356 unsigned depth = 0, unbal_depth = 0; variable 374 unbal_depth = depth; 388 L_BIT_ARR_1(branch, depth) 393 L_BIT_ARR_0(branch, depth) 397 depth++; 407 depth = unbal_depth; 413 cmp = L_BIT_ARR_VAL(branch, depth) 570 unsigned depth = 0, rm_depth; variable 865 unsigned depth = 0; variable [all...] |
/external/webkit/Source/WebCore/platform/brew/ |
H A D | ScreenBrew.cpp | 46 int depth; member in struct:WebCore::DisplayInfo 59 info.depth = bitmapInfo.nDepth; 80 return info.depth;
|
/external/chromium/base/json/ |
H A D | json_writer.h | 47 void BuildJSONString(const Value* const node, int depth, bool escape); 53 void IndentLine(int depth);
|
/external/v8/test/mjsunit/ |
H A D | deep-recursion.js | 33 function newdeep(start, depth) { 35 for (var i = 0; i < depth; i++) {
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
H A D | intermOut.cpp | 59 void OutputTreeText(TInfoSinkBase& sink, TIntermNode* node, const int depth) argument 65 for (i = 0; i < depth; ++i) 80 OutputTreeText(sink, node, depth); 90 OutputTreeText(out, node, depth); 142 OutputTreeText(out, node, depth); 211 OutputTreeText(out, node, depth); 279 OutputTreeText(out, node, depth); 284 ++depth; 286 OutputTreeText(sink, node, depth); 290 OutputTreeText(sink, node, depth); [all...] |
/external/webkit/Tools/android/flex-2.5.4a/MISC/Macintosh/ |
H A D | alloca.c | 109 (b) keep track of stack depth. 125 char *deep; /* for stack depth measure */ 144 auto char probe; /* probes stack depth: */ 145 register char *depth = &probe; local 159 if ((STACK_DIR > 0 && hp->h.deep > depth) 160 || (STACK_DIR < 0 && hp->h.deep < depth)) 185 ((header *)new)->h.deep = depth;
|
/external/llvm/lib/Analysis/ |
H A D | RegionPrinter.cpp | 102 unsigned depth = 0) { 104 O.indent(2 * depth) << "subgraph cluster_" << static_cast<const void*>(R) 106 O.indent(2 * (depth + 1)) << "label = \"\";\n"; 109 O.indent(2 * (depth + 1)) << "style = filled;\n"; 110 O.indent(2 * (depth + 1)) << "color = " 114 O.indent(2 * (depth + 1)) << "style = solid;\n"; 115 O.indent(2 * (depth + 1)) << "color = " 120 printRegionCluster(*RI, GW, depth + 1); 128 O.indent(2 * (depth + 1)) << "Node" 133 O.indent(2 * depth) << "}\ [all...] |
/external/oprofile/libop/ |
H A D | op_alloc_counter.c | 102 * @param max_depth number of entry in array ctr_arc == depth of tree 103 * @param depth current level we are exploring 126 allocate_counter(counter_arc_head const * ctr_arc, int max_depth, int depth, argument 131 if (depth == max_depth) 135 if((&ctr_arc[depth].next)->next == &ctr_arc[depth].next) { 136 counter_map[depth] = -1; 137 if (allocate_counter(ctr_arc, max_depth, depth + 1, 142 list_for_each(pos, &ctr_arc[depth].next) { 148 counter_map[depth] [all...] |