| /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...] |
| /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
|
| /external/webkit/Source/WebCore/rendering/svg/ |
| SVGRootInlineBox.cpp | 216 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) {
217 if (!leaf->isSVGInlineTextBox())
219 if (point.y() < leaf->m_y)
221 if (point.y() > leaf->m_y + leaf->virtualLogicalHeight())
224 closestLeaf = leaf;
225 if (point.x() < leaf->m_x + leaf->m_logicalWidth
[all...] |
| /frameworks/native/include/utils/ |
| String8.h | 194 * If leaf is a fully qualified path (i.e. starts with '/', it
197 String8& appendPath(const char* leaf);
198 String8& appendPath(const String8& leaf) { return appendPath(leaf.string()); }
203 String8 appendPathCopy(const char* leaf) const
204 { String8 p(*this); p.appendPath(leaf); return p; }
205 String8 appendPathCopy(const String8& leaf) const { return appendPathCopy(leaf.string()); }
|
| /external/chromium/chrome/browser/resources/sync_internals/ |
| sync_node_browser.css | 28 /* TODO(akalin): Find a better icon to use for leaf nodes. */
29 #sync-node-tree .leaf .tree-label {
|
| /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/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.
63 // Set up leaf masks to set 8 least-significant bits.
86 // Set up leaf masks to clear 8 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/webkit/Source/WebCore/rendering/ |
| RootInlineBox.cpp | 456 static bool isEditableLeaf(InlineBox* leaf)
458 return leaf && leaf->renderer() && leaf->renderer()->node() && leaf->renderer()->node()->rendererIsEditable();
480 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) {
481 if (!leaf->renderer()->isListMarker() && (!onlyEditableLeaves || isEditableLeaf(leaf)))
[all...] |
| InlineFlowBox.cpp | 1242 InlineBox* leaf = 0; local
1250 InlineBox* leaf = 0; local
1382 InlineBox* leaf = firstLeafChild(); local
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| TrustManagerImpl.java | 236 // this gives us a full chain from leaf to root, which we use for cert pinning and pass
331 // is the leaf certificate (server or client cert).
413 private final X509Certificate leaf; field in class:TrustManagerImpl.ExtendedKeyUsagePKIXCertPathChecker
415 private ExtendedKeyUsagePKIXCertPathChecker(boolean clientAuth, X509Certificate leaf) {
417 this.leaf = leaf;
433 // We only want to validate the EKU on the leaf certificate.
434 if (c != leaf) {
439 ekuOids = leaf.getExtendedKeyUsage();
|
| /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/llvm/include/llvm/ADT/ |
| IntervalMap.h | 189 // Both leaf and branch nodes store vectors of pairs.
205 // 8 4 16 0 Leaf<4,4>, Branch<4>
206 // 8 8 12 0 Leaf<4,8>, Branch<8>
207 // 16 4 9 12 Leaf<8,4>
208 // 16 8 8 0 Leaf<8,8>
432 // Compute the leaf node branching factor that makes a node fit in three
446 // Now that we have the leaf branching factor, compute the actual allocation
455 /// Allocator - The recycling allocator used for both branch and leaf nodes.
478 // A NodeRef doesn't know whether it references a leaf node or a branch node.
542 // Leaf nodes store up to N disjoint intervals with corresponding values
[all...] |
| /external/quake/quake/src/QW/client/ |
| render.h | 30 struct mleaf_s *leaf; member in struct:efrag_s
53 // found in an active leaf
|
| /external/quake/quake/src/WinQuake/ |
| render.h | 32 struct mleaf_s *leaf;
member in struct:efrag_s
60 // found in an active leaf
|
| /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. */
|
| /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. */
|
| /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. */
|
| /external/quake/quake/src/QW/server/ |
| sv_send.c | 259 mleaf_t *leaf; local
264 leaf = Mod_PointInLeaf (origin, sv.worldmodel);
265 if (!leaf)
268 leafnum = leaf - sv.worldmodel->leafs;
277 mask = sv.pvs; // leaf 0 is everything;
310 leaf = Mod_PointInLeaf (client->edict->v.origin, sv.worldmodel);
311 if (leaf)
314 leafnum = leaf - sv.worldmodel->leafs - 1;
|
| /external/grub/netboot/ |
| tulip.c | 841 struct medialeaf *leaf = &mtable->mleaf[i];
844 leaf->type = 0;
845 leaf->media = p[0] & 0x3f;
846 leaf->leafdata = p;
851 switch(leaf->type = p[1]) {
854 leaf->media = p[2] & 0x0f;
858 leaf->media = 11;
835 struct medialeaf *leaf = &mtable->mleaf[i]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 129 typedef typename traits_type::leaf leaf; typedef in class:__gnu_pbds::detail::PB_DS_PAT_TRIE_NAME
130 typedef typename _Alloc::template rebind<leaf> __rebind_l;
171 m_p_nd->~leaf();
403 /// after a leaf of the tree.
408 /// after a leaf of the tree.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/ |
| SdkSelectionPage.java | 296 String leaf = f.getName(); local
297 if (!SdkConstants.FD_SOURCES.equals(leaf) &&
298 !SdkConstants.FD_ASSETS.equals(leaf) &&
299 !SdkConstants.FD_RES.equals(leaf)) {
|
