/external/smack/src/org/jivesoftware/smackx/pubsub/ |
NodeType.java | 23 leaf,
enum constant in enum:NodeType
|
/build/core/tasks/ |
factory_bundle.mk | 39 leaf := $(strip $(TARGET_PRODUCT))-factory_bundle-$(FILE_NAME_TAG) macro 40 named_dir := $(PRODUCT_OUT)/$(leaf) 41 tarball := $(PRODUCT_OUT)/$(leaf).tgz
|
/bionic/libc/include/ |
search.h | 19 leaf enumerator in enum:__anon42
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp> 110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 132 leaf, 143 leaf, 154 leaf, 165 leaf, 175 leaf, 187 leaf, 271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits 293 leaf, [all...] |
/external/quake/quake/src/QW/client/ |
gl_refrag.c | 59 prev = &ef->leaf->efrags; 94 mleaf_t *leaf; local 102 // add an efrag if the node is a leaf 109 leaf = (mleaf_t *)node; 127 // set the leaf links 128 ef->leaf = leaf; 129 ef->leafnext = leaf->efrags; 130 leaf->efrags = ef;
|
r_efrag.c | 60 prev = &ef->leaf->efrags; 95 mleaf_t *leaf; local 103 // add an efrag if the node is a leaf 110 leaf = (mleaf_t *)node; 128 // set the leaf links 129 ef->leaf = leaf; 130 ef->leafnext = leaf->efrags; 131 leaf->efrags = ef; 174 r_pefragtopnode = node; // we've reached a non-solid leaf, so it' [all...] |
/external/quake/quake/src/WinQuake/ |
gl_refrag.cpp | 59 prev = &ef->leaf->efrags; 94 mleaf_t *leaf; local 102 // add an efrag if the node is a leaf 109 leaf = (mleaf_t *)node; 127 // set the leaf links 128 ef->leaf = leaf; 129 ef->leafnext = leaf->efrags; 130 leaf->efrags = ef;
|
r_efrag.cpp | 60 prev = &ef->leaf->efrags;
95 mleaf_t *leaf;
local 103 // add an efrag if the node is a leaf
110 leaf = (mleaf_t *)node;
128 // set the leaf links
129 ef->leaf = leaf;
130 ef->leafnext = leaf->efrags;
131 leaf->efrags = ef;
174 r_pefragtopnode = node; // we've reached a non-solid leaf, so it's [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
search.h | 124 leaf enumerator in enum:__anon26846 150 or leaf. */ 158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/ |
search.h | 124 leaf enumerator in enum:__anon28437 150 or leaf. */ 158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/ |
search.h | 124 leaf enumerator in enum:__anon29951 150 or leaf. */ 158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
traits.hpp | 78 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits 81 typedef base_type::_Iter<node, leaf, head, inode, true> iterator; 82 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator; 83 typedef base_type::_Iter<node, leaf, head, inode, false> reverse_iterator; 84 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator; 88 typedef base_type::_Node_citer<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_const_iterator; 90 typedef base_type::_Node_iter<node, leaf, head, inode, const_iterator, iterator, _Alloc> node_iterator; 125 typedef base_type::_Leaf<synth_access_traits, metadata> leaf; typedef in struct:__gnu_pbds::detail::trie_traits 128 typedef base_type::_CIter<node, leaf, head, inode, true> const_iterator; 130 typedef base_type::_CIter<node, leaf, head, inode, false> const_reverse_iterator [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
tsan_mutex.cc | 26 // The leaf mutexes can be locked under any other mutexes. 54 bool leaf[N] = {}; local 61 CHECK(!leaf[i]); 62 leaf[i] = true; 71 CHECK(!leaf[i] || cnt[i] == 0); 73 // Add leaf mutexes. 75 if (!leaf[i]) 78 if (i == j || leaf[j] || j == MutexTypeInvalid)
|
/external/guava/guava-tests/test/com/google/common/collect/ |
BstNodeTest.java | 53 SimpleNode leaf = new SimpleNode('a', null, null); local 54 testLacksChild(leaf, LEFT); 55 testLacksChild(leaf, RIGHT); 59 SimpleNode leaf = new SimpleNode('a', null, null); local 60 SimpleNode node = new SimpleNode('b', leaf, null); 61 testChildIs(node, LEFT, leaf); 66 SimpleNode leaf = new SimpleNode('c', null, null); local 67 SimpleNode node = new SimpleNode('b', null, leaf); 69 testChildIs(node, RIGHT, leaf);
|
/external/qemu/elff/ |
dwarf_die.cc | 113 * Lets iterate through child DIEs to find the leaf (last DIE) that contains
117 DIEObject* leaf = child->get_leaf_for_address(address);
local 118 if (leaf != NULL) {
119 return leaf;
123 /* No child DIE contains this address. This DIE is the leaf. */
|
/external/valgrind/main/gdbserver_tests/ |
t.c | 97 static void leaf(void) {} function 101 leaf(); // ensures not leaf, as ppc unwind implies VEX iropt precise exns
|
/external/webkit/Source/JavaScriptCore/wtf/ |
TCPageMap.h | 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 111 // Leaf node 112 struct Leaf { 116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes 147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 148 if (leaf == NULL) return false; 149 memset(leaf, 0, sizeof(*leaf)) 259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local [all...] |
/external/webkit/Source/WebCore/rendering/ |
InlineBox.cpp | 246 InlineBox* leaf = 0; local 247 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine()) 248 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->firstLeafChild(); 249 if (!leaf && parent()) 250 leaf = parent()->nextLeafChild(); 251 return leaf; 256 InlineBox* leaf = 0; local 257 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine()) 258 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->lastLeafChild(); 259 if (!leaf && parent() [all...] |