| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
| cond_dtor_entry_dealtor.hpp | 69 m_p_nd->~leaf();
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| InlineBox.cpp | 251 InlineBox* leaf = 0; local
252 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine())
253 leaf = box->isLeaf() ? box : toInlineFlowBox(box)->firstLeafChild();
254 if (!leaf && parent())
255 leaf = parent()->nextLeafChild();
256 return leaf;
261 InlineBox* leaf = 0; local
262 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine())
263 leaf = box->isLeaf() ? box : toInlineFlowBox(box)->lastLeafChild();
264 if (!leaf && parent()
271 InlineBox* leaf = nextLeafChild(); local
279 InlineBox* leaf = prevLeafChild(); local
[all...] |
| /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/chromium_org/third_party/tcmalloc/chromium/src/ |
| pagemap.h | 324 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
331 // Leaf node
332 struct Leaf {
336 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
374 if (leaf == NULL) return false;
375 memset(leaf, 0, sizeof(*leaf))
393 Leaf* leaf = root_[i1]; local
487 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
510 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/codeview/ |
| cv-type.c | 311 /* Leaf indices for type records that can be referenced from symbols */
350 /* Leaf indices for type records that can be referenced from other type
381 /* Leaf indices for fields of complex lists */
416 /* Leaf indices for numeric fields of symbols and type records */
436 /* Leaf padding bytes */
502 static void cv_type_append_leaf(cv_type *type, /*@keep@*/ cv_leaf *leaf);
508 cv_leaf *leaf = yasm_xmalloc(sizeof(cv_leaf)); local
509 leaf->type = CV5_LF_LABEL;
510 leaf->format = "h";
511 leaf->args[0].i = is_far ? 4 : 0
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| TCPageMap.h | 97 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
104 // Leaf node
105 struct Leaf {
109 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
140 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
141 if (leaf == NULL) return false;
142 memset(leaf, 0, sizeof(*leaf))
250 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/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| SVGRootInlineBox.cpp | 202 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) {
203 if (!leaf->isSVGInlineTextBox())
205 if (point.y() < leaf->y())
207 if (point.y() > leaf->y() + leaf->virtualLogicalHeight())
210 closestLeaf = leaf;
211 if (point.x() < leaf->left() + leaf->logicalWidth()
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| test_file_system.py | 14 leaf = result
16 leaf[k] = {}
17 leaf = leaf[k]
18 leaf.update(obj)
|
| /system/core/include/utils/ |
| String8.h | 203 * If leaf is a fully qualified path (i.e. starts with '/', it
206 String8& appendPath(const char* leaf);
207 String8& appendPath(const String8& leaf) { return appendPath(leaf.string()); }
212 String8 appendPathCopy(const char* leaf) const
213 { String8 p(*this); p.appendPath(leaf); return p; }
214 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/chromium_org/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.
|
| /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/chromium_org/chrome/browser/resources/sync_internals/ |
| sync_node_browser.css | 30 /* TODO(akalin): Find a better icon to use for leaf nodes. */
31 #sync-node-tree .leaf .tree-label {
|
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/model/ |
| jsonresults.py | 252 leaf = aggregated_json[test_name]
253 leaf[RESULTS_KEY] = cls._remove_items_over_max_number_of_builds(leaf[RESULTS_KEY], num_runs)
254 leaf[TIMES_KEY] = cls._remove_items_over_max_number_of_builds(leaf[TIMES_KEY], num_runs)
255 if cls._should_delete_leaf(leaf, run_time_pruning_threshold):
262 def _should_delete_leaf(cls, leaf, run_time_pruning_threshold):
263 if leaf.get(EXPECTED_KEY, PASS_STRING) != PASS_STRING:
266 if BUG_KEY in leaf:
270 for result in leaf[RESULTS_KEY]
[all...] |
| /art/runtime/arch/mips/ |
| jni_entrypoints_mips.S | 51 jr $t9 # leaf call to method's code
|
| /external/chromium_org/net/cert/ |
| ct_objects_extractor_nss.cc | 441 bool GetPrecertLogEntry(X509Certificate::OSCertHandle leaf,
444 DCHECK(leaf);
447 NSSCertWrapper leaf_cert(leaf);
466 // This can happen when the issuer and leaf certs share the same serial
503 bool GetX509LogEntry(X509Certificate::OSCertHandle leaf, LogEntry* result) {
504 DCHECK(leaf);
507 if (!X509Certificate::GetDEREncoded(leaf, &encoded))
|
| /libcore/crypto/src/main/java/org/conscrypt/ |
| 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
|
| /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
|
| /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
|
| /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...] |
