| /prebuilts/ndk/9/platforms/android-21/arch-mips64/usr/include/ |
| search.h | 19 leaf enumerator in enum:__anon63297
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86/usr/include/ |
| search.h | 19 leaf enumerator in enum:__anon64074
|
| /prebuilts/ndk/9/platforms/android-21/arch-x86_64/usr/include/ |
| search.h | 19 leaf enumerator in enum:__anon64852
|
| /external/libnl/src/ |
| nl-tctree-list.c | 41 struct rtnl_qdisc *leaf; local
49 leaf = rtnl_class_leaf_qdisc(class, qdisc_cache);
50 if (leaf)
51 print_qdisc((struct nl_object *) leaf, arg + 2);
|
| /system/core/include/utils/ |
| String8.h | 211 * If leaf is a fully qualified path (i.e. starts with '/', it
214 String8& appendPath(const char* leaf);
215 String8& appendPath(const String8& leaf) { return appendPath(leaf.string()); }
220 String8 appendPathCopy(const char* leaf) const
221 { String8 p(*this); p.appendPath(leaf); return p; }
222 String8 appendPathCopy(const String8& leaf) const { return appendPathCopy(leaf.string()); }
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_mutex.cc | 26 // The leaf mutexes can be locked under any other mutexes.
55 bool leaf[N] = {}; local
62 CHECK(!leaf[i]);
63 leaf[i] = true;
72 CHECK(!leaf[i] || cnt[i] == 0);
74 // Add leaf mutexes.
76 if (!leaf[i])
79 if (i == j || leaf[j] || j == MutexTypeInvalid)
|
| /external/libnl/lib/route/ |
| class_obj.c | 89 nl_dump(p, "noop (no leaf qdisc)");
126 * @name Leaf Qdisc
131 * Lookup the leaf qdisc of a class
135 * @return The qdisc from the cache or NULL if the class has no leaf qdisc
140 struct rtnl_qdisc *leaf; local
145 leaf = rtnl_qdisc_get_by_parent(cache, class->c_ifindex,
147 if (!leaf || leaf->q_handle != class->c_info)
150 return leaf;
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 30 // Given a binary operation string and an ordered array of leaf
36 // One leaf is a leaf.
39 // More than one leaf requires an interior node.
64 // Set up leaf masks to set 6 least-significant bits.
85 // Set up leaf masks to clear 6 least-significant bits.
|
| /packages/apps/Browser/tests/src/com/android/browser/tests/utils/ |
| MockObserverNode.java | 73 // If this is the leaf node add the observer
125 private void notifyMyObservers(boolean leaf, ContentObserver observer,
138 if (leaf || (!leaf && entry.notifyForDescendents)) {
149 // This is the leaf node, notify all observers
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/editors/ |
| GLCallGroups.java | 180 GLLeafNode leaf = new GLLeafNode(c); local
182 hierarchyStack.peek().addChild(leaf);
184 items.add(leaf);
|
| /external/elfutils/src/tests/ |
| run-readelf-A.sh | 48 ABI_align8_preserved: Yes, except leaf SP
|
| /art/runtime/arch/mips/ |
| jni_entrypoints_mips.S | 50 jalr $zero, $t9 # leaf call to method's code
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| search.h | 50 leaf enumerator in enum:__anon35748
|
| /external/conscrypt/src/platform/java/org/conscrypt/ |
| TrustManagerImpl.java | 272 // this gives us a full chain from leaf to root, which we use for cert pinning and pass
367 // is the leaf certificate (server or client cert).
449 private final X509Certificate leaf; field in class:TrustManagerImpl.ExtendedKeyUsagePKIXCertPathChecker
451 private ExtendedKeyUsagePKIXCertPathChecker(boolean clientAuth, X509Certificate leaf) {
453 this.leaf = leaf;
473 // We only want to validate the EKU on the leaf certificate.
474 if (c != leaf) {
479 ekuOids = leaf.getExtendedKeyUsage();
|
| /external/valgrind/gdbserver_tests/ |
| t.c | 97 static void leaf(void) {} function
101 leaf(); // ensures not leaf, as ppc unwind implies VEX iropt precise exns
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 89 rejected leaf), then we break for the next leaf. There is the
101 for leaf in leaves:
102 current_ast_node = leaf
107 if isinstance(child, pytree.Leaf) and child.value == u";":
129 #the rest of the tree upwards has been checked, next leaf
|
| btm_utils.py | 18 pattern tree during the conversion to sets of leaf-to-root
25 self.leaf = False
149 if (isinstance(node.children[0], pytree.Leaf) and
153 if ((isinstance(node.children[0], pytree.Leaf) and
162 leaf = True
171 leaf = False
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| btm_matcher.py | 89 rejected leaf), then we break for the next leaf. There is the
101 for leaf in leaves:
102 current_ast_node = leaf
107 if isinstance(child, pytree.Leaf) and child.value == u";":
129 #the rest of the tree upwards has been checked, next leaf
|
| btm_utils.py | 18 pattern tree during the conversion to sets of leaf-to-root
25 self.leaf = False
149 if (isinstance(node.children[0], pytree.Leaf) and
153 if ((isinstance(node.children[0], pytree.Leaf) and
162 leaf = True
171 leaf = False
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 190 // Both leaf and branch nodes store vectors of pairs.
206 // 8 4 16 0 Leaf<4,4>, Branch<4>
207 // 8 8 12 0 Leaf<4,8>, Branch<8>
208 // 16 4 9 12 Leaf<8,4>
209 // 16 8 8 0 Leaf<8,8>
433 // Compute the leaf node branching factor that makes a node fit in three
447 // Now that we have the leaf branching factor, compute the actual allocation
456 /// Allocator - The recycling allocator used for both branch and leaf nodes.
479 // A NodeRef doesn't know whether it references a leaf node or a branch node.
543 // Leaf nodes store up to N disjoint intervals with corresponding values
[all...] |
| /art/runtime/arch/mips64/ |
| jni_entrypoints_mips64.S | 74 jalr $zero, $t9 # leaf call to method's code
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| search.h | 124 leaf enumerator in enum:__anon31339
150 or leaf. */
158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/ |
| search.h | 124 leaf enumerator in enum:__anon33329
150 or leaf. */
158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| dwarf_die.cc | 115 * Lets iterate through child DIEs to find the leaf (last DIE) that contains
119 DIEObject* leaf = child->get_leaf_for_address(address); local
120 if (leaf != NULL) {
121 return leaf;
125 /* No child DIE contains this address. This DIE is the leaf. */
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tsearch.c | 99 (*action)(root, leaf, level);
|
