/external/smack/src/org/jivesoftware/smackx/pubsub/ |
H A D | NodeType.java | 23 leaf,
enum constant in enum:NodeType
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | rtree.h | 83 * node is a leaf, so it contains values rather than node \ 90 uint8_t *leaf = (uint8_t *)node; \ 91 ret = leaf[subkey]; \ 158 /* node is a leaf, so it contains values rather than node pointers. */ 162 uint8_t *leaf = (uint8_t *)node; local 163 leaf[subkey] = val;
|
/external/libnl/src/ |
H A D | 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);
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
H A D | RunnerController.java | 203 boolean selected, boolean expanded, boolean leaf, int row, 202 getTreeCellRendererComponent(JTree tree, Object value, boolean selected, boolean expanded, boolean leaf, int row, boolean hasFocus) argument
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | pagemap.h | 121 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 170 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 171 if (leaf == NULL) return false; 172 memset(leaf, 0, sizeof(*leaf)); 173 root_[i1] = leaf; 176 // Advance key past whatever is covered by this leaf node 190 Leaf* leaf = root_[i1]; local 191 if (leaf != NULL) { 192 // Scan forward in leaf 284 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 307 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local [all...] |
/external/libnl/lib/route/ |
H A D | class_obj.c | 89 nl_dump(p, "noop (no 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/chromium_org/content/renderer/ |
H A D | v8_value_converter_impl_unittest.cc | 688 v8::Local<v8::Object> leaf = deep_object; local 691 leaf->Set(v8::String::NewFromUtf8(isolate_, kKey), new_object); 692 leaf = new_object; 709 // The leaf node shouldn't have any properties.
|
/external/chromium_org/net/cert/ |
H A D | ct_objects_extractor_openssl.cc | 186 bool GetPrecertLogEntry(X509Certificate::OSCertHandle leaf, argument 191 ScopedX509 leaf_x509(OSCertHandleToOpenSSL(leaf)); 250 bool GetX509LogEntry(X509Certificate::OSCertHandle leaf, LogEntry* result) { argument 251 DCHECK(leaf); 254 if (!X509Certificate::GetDEREncoded(leaf, &encoded))
|
H A D | ct_objects_extractor_nss.cc | 441 bool GetPrecertLogEntry(X509Certificate::OSCertHandle leaf, argument 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) { argument 504 DCHECK(leaf); 507 if (!X509Certificate::GetDEREncoded(leaf, &encoded))
|
H A D | x509_certificate.cc | 734 OSCertHandle leaf, 737 chain.push_back(leaf); 733 CalculateChainFingerprint256( OSCertHandle leaf, const OSCertHandles& intermediates) argument
|
H A D | cert_verify_proc_unittest.cc | 437 ImportCertFromFile(certs_dir, "cross-signed-leaf.pem"); 566 scoped_refptr<X509Certificate> leaf = local 572 int error = Verify(leaf.get(), 601 scoped_refptr<X509Certificate> leaf = local 607 int error = Verify(leaf.get(), 1230 scoped_refptr<X509Certificate> leaf = local 1236 int error = Verify(leaf.get(), 1253 error = Verify(leaf.get(),
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | pagemap.h | 324 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 373 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 374 if (leaf == NULL) return false; 375 memset(leaf, 0, sizeof(*leaf)); 376 root_[i1] = leaf; 379 // Advance key past whatever is covered by this leaf node 393 Leaf* leaf = root_[i1]; local 394 if (leaf != NULL) { 395 // Scan forward in leaf 487 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 510 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]); local [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | 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/conscrypt/src/platform/java/org/conscrypt/ |
H A D | 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) { argument 453 this.leaf = leaf; 473 // We only want to validate the EKU on the leaf certificate. 474 if (c != leaf) { 479 ekuOids = leaf.getExtendedKeyUsage();
|
H A D | TrustedCertificateStore.java | 417 * Attempt to build a certificate chain from the supplied {@code leaf} 420 * This means that a list with only the {@code leaf} certificate is returned 426 public List<X509Certificate> getCertificateChain(X509Certificate leaf) argument 430 OpenSSLX509Certificate cert = convertToOpenSSLIfNeeded(leaf);
|
/external/valgrind/main/gdbserver_tests/ |
H A D | t.c | 97 static void leaf(void) {} function 101 leaf(); // ensures not leaf, as ppc unwind implies VEX iropt precise exns
|
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | xml-utils.c | 210 static char * add_path(const char *prev, const char *leaf) argument 218 len = os_strlen(prev) + 1 + os_strlen(leaf) + 1; 221 os_snprintf(new_uri, len, "%s/%s", prev, leaf);
|
/external/wpa_supplicant_8/src/utils/ |
H A D | xml-utils.c | 210 static char * add_path(const char *prev, const char *leaf) argument 218 len = os_strlen(prev) + 1 + os_strlen(leaf) + 1; 221 os_snprintf(new_uri, len, "%s/%s", prev, leaf);
|
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | xml-utils.c | 210 static char * add_path(const char *prev, const char *leaf) argument 218 len = os_strlen(prev) + 1 + os_strlen(leaf) + 1; 221 os_snprintf(new_uri, len, "%s/%s", prev, leaf);
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | InlineBox.cpp | 245 InlineBox* leaf = 0; local 246 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine()) 247 leaf = box->isLeaf() ? box : toInlineFlowBox(box)->firstLeafChild(); 248 if (!leaf && parent()) 249 leaf = parent()->nextLeafChild(); 250 return leaf; 255 InlineBox* leaf = 0; local 256 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine()) 257 leaf = box->isLeaf() ? box : toInlineFlowBox(box)->lastLeafChild(); 258 if (!leaf 265 InlineBox* leaf = nextLeafChild(); local 273 InlineBox* leaf = prevLeafChild(); local [all...] |
H A D | InlineFlowBox.cpp | 1136 InlineBox* leaf = 0; local 1137 for (InlineBox* child = firstChild(); child && !leaf; child = child->nextOnLine()) 1138 leaf = child->isLeaf() ? child : toInlineFlowBox(child)->firstLeafChild(); 1139 return leaf; 1144 InlineBox* leaf = 0; local 1145 for (InlineBox* child = lastChild(); child && !leaf; child = child->prevOnLine()) 1146 leaf = child->isLeaf() ? child : toInlineFlowBox(child)->lastLeafChild(); 1147 return leaf; 1297 InlineBox* leaf = firstLeafChild(); local 1304 // First find highest and lowest levels, and initialize leafBoxesInLogicalOrder with the leaf boxe [all...] |
H A D | RootInlineBox.cpp | 480 static bool isEditableLeaf(InlineBox* leaf) argument 482 return leaf && leaf->renderer().node() && leaf->renderer().node()->hasEditableStyle(); 517 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChildIgnoringLineBreak()) { 518 if (!leaf->renderer().isListMarker() && (!onlyEditableLeaves || isEditableLeaf(leaf))) { [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | tree.rb | 213 [leaf] a node that does not have any children 250 def leaf? 444 alias leaf? empty?
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | btreeInt.h | 65 ** 23 1 Min leaf payload fraction 100 ** The min leaf payload fraction is like the min embedded payload fraction 101 ** except that it applies to leaf nodes in a LEAFDATA tree. The maximum 128 ** 0 1 Flags. 1: intkey, 2: zerodata, 4: leafdata, 8: leaf 135 ** The flags define the format of this btree page. The leaf flag means that 191 ** 4 Page number of the left child. Omitted if leaf flag is set. 205 ** Freelist pages come in two subtypes: trunk pages and leaf pages. The 207 ** page points to multiple leaf pages. The content of a leaf page is 212 ** 4 Number of leaf pointer 276 u8 leaf; /* True if leaf flag is set */ member in struct:MemPage [all...] |
/external/tcpdump/ |
H A D | print-slow.c | 172 u_int8_t leaf[2]; member in struct:slow_oam_variablerequest_t 177 u_int8_t leaf[2]; member in struct:slow_oam_variableresponse_t
|