| /dalvik/dx/src/com/android/dx/merge/ |
| SortableType.java | 40 if (a.depth != b.depth) {
41 return a.depth - b.depth;
50 private int depth = -1; field in class:SortableType
75 * Assigns this type's depth if the depths of its supertype and implemented
76 * interfaces are known. Returns false if the depth couldn't be computed
91 } else if (sortableSupertype.depth == -1) {
94 max = sortableSupertype.depth;
102 } else if (implemented.depth == -1)
[all...] |
| /external/compiler-rt/test/asan/TestCases/ |
| deep_stack_uaf.cc | 10 template <int depth>
13 DeepFree<depth - 1>::free(x);
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_clear.c | 51 double depth,
62 lp_setup_clear( llvmpipe->setup, color->f, depth, stencil, buffers );
|
| /external/mesa3d/src/mesa/main/ |
| depth.h | 2 * \file depth.h
3 * Depth buffer operations.
44 _mesa_ClearDepth( GLclampd depth );
47 _mesa_ClearDepthf( GLclampf depth );
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/X11/ |
| ImUtil.h | 9 int depth);
14 int depth);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/X11/ |
| ImUtil.h | 8 int depth);
13 int depth);
|
| /external/llvm/tools/llvm-c-test/ |
| calc.c | 45 int depth = 0; local
58 if (depth < 2) {
63 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
64 stack[depth - 1], stack[depth - 2], "");
65 depth--;
72 if (depth < 1) {
77 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, "");
78 stack[depth - 1] = LLVMBuildLoad(builder, off, "");
91 if (depth >= MAX_DEPTH)
[all...] |
| /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/icu/icu4j/samples/src/com/ibm/icu/samples/text/messagepattern/ |
| MessagePatternUtilDemo.java | 29 private static final void printMessage(MessagePatternUtil.MessageNode msg, int depth) {
30 String indent = manySpaces.substring(0, depth * 2);
38 printArg((MessagePatternUtil.ArgNode)contents, depth);
47 private static final void printArg(MessagePatternUtil.ArgNode arg, int depth) {
48 System.out.print(manySpaces.substring(0, depth * 2) + "arg: «" + arg.getName() + "»");
63 printComplexArgStyle(arg.getComplexStyle(), depth + 1); local
69 int depth) {
71 System.out.println(manySpaces.substring(0, depth * 2) + "offset: " + style.getOffset());
73 String indent = manySpaces.substring(0, depth * 2);
94 printMessage(variant.getMessage(), depth + 1) local
169 genCodeForPlural(arg.getComplexStyle(), depth, firstResult, argName); local
172 genCodeForSelect(arg.getComplexStyle(), depth, firstResult, argName); local
199 genCode(otherVariant.getMessage(), depth, firstResult, pluralNumber); local
216 genCode(otherVariant.getMessage(), depth, firstResult, ""); local
219 genCode(otherVariant.getMessage(), depth + 1, firstResult, ""); local
236 genCode(variant.getMessage(), depth, firstResult, pluralNumber); local
254 genCode(variant.getMessage(), depth, firstResult, pluralNumber); local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/web-page-replay/third_party/dns/ |
| namedict.py | 23 @ivar max_depth: the maximum depth of the keys that have ever been
35 depth = len(key)
36 if depth > self.max_depth:
37 self.max_depth = depth
51 depth = len(name)
52 if depth > self.max_depth:
53 depth = self.max_depth
54 for i in xrange(-depth, 0):
|
| /prebuilts/go/darwin-x86/test/bench/go1/ |
| binarytree_test.go | 17 func bottomUpTree(item, depth int) *binaryNode {
18 if depth <= 0 {
21 return &binaryNode{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
41 //fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
45 for depth := minDepth; depth <= maxDepth; depth += 2 {
46 iterations := 1 << uint(maxDepth-depth+minDepth)
50 check += bottomUpTree(i, depth).itemCheck(
[all...] |
| /prebuilts/go/linux-x86/test/bench/go1/ |
| binarytree_test.go | 17 func bottomUpTree(item, depth int) *binaryNode {
18 if depth <= 0 {
21 return &binaryNode{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
41 //fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
45 for depth := minDepth; depth <= maxDepth; depth += 2 {
46 iterations := 1 << uint(maxDepth-depth+minDepth)
50 check += bottomUpTree(i, depth).itemCheck(
[all...] |
| /frameworks/rs/rsov/tests/RSoVTest/src/com/android/rs/rsov/test/ |
| UT_invert.java | 31 private boolean Test(int width, int height, int depth) {
39 if (depth > 0) {
40 typeBuilder.setZ(depth);
44 if (depth < 1) {
45 depth = 1;
55 float a[] = new float[width * height * depth * 4];
56 float b[] = new float[width * height * depth * 4];
60 for (int i = 0; i < width * height * depth * 4; i++) {
77 for (int i = 0; i < width * height * depth * 4; i++) {
|
| UT_global_query.java | 31 private boolean Test(int width, int height, int depth) {
39 if (depth > 0) {
40 typeBuilder.setZ(depth);
44 if (depth < 1) {
45 depth = 1;
56 int g[] = new int[width * height * depth];
57 int d[] = new int[width * height * depth];
58 int r[] = new int[width * height * depth];
62 for (int i = 0; i < width * height * depth; i++) {
84 for (int i = 0; i < width * height * depth; i++)
[all...] |
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
| MultiSynch.java | 72 * @param depth
74 private static void run(Object[] params, Object[] synchArr, Action action, int depth) {
76 synchronized (synchArr[depth]) {
77 if (depth < synchArr.length - 1) {
78 run(params, synchArr, action, ++depth);
|
| /external/elfutils/libdw/ |
| dwarf_getscopes_die.c | 37 scope_visitor (unsigned int depth, struct Dwarf_Die_Chain *die, void *arg)
42 Dwarf_Die *scopes = malloc (depth * sizeof scopes[0]);
56 assert (i == depth);
59 return depth;
|
| /external/libcxx/test/std/experimental/filesystem/class.rec.dir.itr/rec.dir.itr.members/ |
| depth.pass.cpp | 16 // int depth() const
41 TEST_CHECK(it.depth() == 0);
50 TEST_CHECK(it.depth() == 0);
52 TEST_CHECK(it.depth() == 1);
55 TEST_CHECK(it.depth() == 2);
58 TEST_CHECK(!"Unexpected depth while iterating over static env");
|
| /external/mesa3d/src/gallium/include/state_tracker/ |
| xlib_sw_winsys.h | 18 int depth; member in struct:xlib_drawable
|
| /external/deqp/modules/glshared/ |
| glsFragmentOpUtil.hpp | 54 float depth[4]; member in struct:deqp::gls::FragmentOpUtil::Quad
60 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
61 depth[i] = 0.0f;
90 // Viewport coordinates (depth in range [0, 1]).
94 float depth[4]; member in struct:deqp::gls::FragmentOpUtil::IntegerQuad
100 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
101 depth[i] = 0.0f;
108 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
109 depth[i] = 0.0f;
|
| /external/ImageMagick/PerlMagick/t/ttf/ |
| read.t | 22 q/size=>'512x512', depth=>8/,
32 q!font=>'input.ttf', fill=>'#0000FF', pointsize=>14, size=>'245x16', depth=>8!,
41 q!size=>'250x20', depth=>8!,
|
| /external/libunwind/tests/ |
| Gtest-exc.c | 46 int depth = 13; variable
66 for (i = 0; i < depth + 2; ++i)
113 if (n == depth)
141 depth = atol (argv[1]);
142 if (depth < 1)
144 fprintf (stderr, "Usage: %s depth\n"
145 " depth must be >= 1\n", argv[0]);
150 result = a (depth);
|
| /external/ltp/testcases/kernel/fs/ext4-new-features/ext4-subdir-limit/ |
| create_long_dirs.c | 90 int depth; local
93 depth = 1;
95 depth = 2;
97 depth = 3;
101 if (depth == 1) {
110 if (depth == 2) {
|
| /external/dtc/tests/ |
| supernode_atdepth_offset.c | 33 int depth = 0; local
42 depth++;
48 return depth;
51 static int path_prefix(const char *path, int depth)
59 if (depth == 0)
63 for (i = 0; i < depth; i++)
70 int depth)
77 pathprefixlen = path_prefix(path, depth);
82 verbose_printf("Path %s (%d), depth %d, supernode is %s\n",
83 path, pdepth, depth, superpath)
[all...] |
| /prebuilts/go/darwin-x86/src/strings/ |
| export_test.go | 16 func (r *genericReplacer) printNode(t *trieNode, depth int) (s string) {
25 s += Repeat(".", depth) + t.prefix
26 s += r.printNode(t.next, depth+len(t.prefix))
30 s += Repeat(".", depth) + string([]byte{byte(b)})
31 s += r.printNode(t.table[m], depth+1)
|
| /prebuilts/go/linux-x86/src/strings/ |
| export_test.go | 16 func (r *genericReplacer) printNode(t *trieNode, depth int) (s string) {
25 s += Repeat(".", depth) + t.prefix
26 s += r.printNode(t.next, depth+len(t.prefix))
30 s += Repeat(".", depth) + string([]byte{byte(b)})
31 s += r.printNode(t.table[m], depth+1)
|
