Searched refs:subtree (Results 1 - 25 of 28) sorted by relevance

12

/external/dbus/dbus/
H A Ddbus-object-tree.c51 static DBusObjectSubtree* _dbus_object_subtree_ref (DBusObjectSubtree *subtree);
52 static void _dbus_object_subtree_unref (DBusObjectSubtree *subtree);
66 * Struct representing a single registered subtree handler, or node
67 * that's a parent of a registered subtree handler. If
158 * subtree nodes
163 find_subtree_recurse (DBusObjectSubtree *subtree, argument
180 subtree->name);
184 return subtree;
189 subtree->name, path[0]);
193 j = subtree
327 DBusObjectSubtree *subtree; local
398 DBusObjectSubtree *subtree; local
448 DBusObjectSubtree *subtree; local
525 free_subtree_recurse(DBusConnection *connection, DBusObjectSubtree *subtree) argument
576 DBusObjectSubtree *subtree; local
755 DBusObjectSubtree *subtree; local
919 DBusObjectSubtree *subtree; local
946 DBusObjectSubtree *subtree; local
968 DBusObjectSubtree *subtree; local
1003 _dbus_object_subtree_ref(DBusObjectSubtree *subtree) argument
1012 _dbus_object_subtree_unref(DBusObjectSubtree *subtree) argument
[all...]
/external/llvm/lib/Support/
H A DIntervalMap.cpp22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second));
39 // NR is the subtree containing our left sibling.
40 NodeRef NR = path[l].subtree(path[l].offset - 1);
44 NR = NR.subtree(NR.size() - 1);
63 // NR is the subtree containing our left sibling.
65 NodeRef NR = subtree(l);
67 // Get the rightmost node in the subtree.
70 NR = NR.subtree(NR.size() - 1);
89 // NR is the subtree containing our right sibling.
90 NodeRef NR = path[l].subtree(pat
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/
H A DNameConstraints.java76 private DERSequence createSequence(Vector subtree) argument
79 Enumeration e = subtree.elements();
/external/webkit/Source/WebKit/mac/WebView/
H A DWebPDFDocumentExtras.mm40 static void appendValuesInPDFNameSubtreeToVector(CGPDFDictionaryRef subtree, Vector<CGPDFObjectRef>& values)
43 if (CGPDFDictionaryGetArray(subtree, "Names", &names)) {
54 if (!CGPDFDictionaryGetArray(subtree, "Kids", &kids))
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DTreePatternParser.cs76 object subtree = ParseTree();
77 adaptor.AddChild(root, subtree);
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreePatternParser.cs88 object subtree = ParseTree();
89 adaptor.AddChild( root, subtree );
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
H A DPKIXNameConstraintValidator.java48 ASN1Sequence subtree)
50 if (subtree.size() < 1)
55 if (subtree.size() > dns.size())
60 for (int j = subtree.size() - 1; j >= 0; j--)
62 if (!subtree.getObjectAt(j).equals(dns.getObjectAt(j)))
99 ASN1Sequence subtree = (ASN1Sequence)it.next();
101 if (withinDNSubtree(dns, subtree))
108 "Subject distinguished name is not from a permitted subtree");
123 ASN1Sequence subtree = (ASN1Sequence)it.next();
125 if (withinDNSubtree(dns, subtree))
46 withinDNSubtree( ASN1Sequence dns, ASN1Sequence subtree) argument
1607 addExcludedSubtree(GeneralSubtree subtree) argument
[all...]
H A DRFC3280CertPathUtilities.java1161 // (b), (c) permitted and excluded subtree checking.
1697 GeneralSubtree subtree = GeneralSubtree.getInstance(e.nextElement());
1698 nameConstraintValidator.addExcludedSubtree(subtree);
/external/ipsec-tools/src/racoon/
H A Disakmp_xauth.h138 int subtree; member in struct:xauth_ldap_config
H A Disakmp_xauth.c732 xauth_ldap_config.subtree = 0;
904 if (xauth_ldap_config.subtree)
1121 if (xauth_ldap_config.subtree)
H A Dcftoken.l224 <S_LDAP>subtree { YYD; return(LDAP_SUBTREE); }
H A Dcfparse.y573 xauth_ldap_config.subtree = $2;
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreePatternParser.java75 Object subtree = parseTree();
76 adaptor.addChild(root, subtree);
/external/llvm/include/llvm/ADT/
H A DIntervalMap.h493 /// subtree - Access the i'th subtree reference in a branch node.
496 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
663 // The key array in a branch node holds the rightmost stop key of each subtree.
667 // It is unusual for a branch node to only have one subtree, but it can happen
680 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
683 NodeRef &subtree(unsigned i) { return this->first[i]; }
685 /// findFrom - Find the first subtree after i that may contain x.
690 /// This is the first subtree that can possibly contain x.
699 /// safeFind - Find a subtree tha
[all...]
/external/webkit/Source/WebCore/svg/
H A DSVGUseElement.cpp287 // Update whole subtree, scanning for shadow container elements, that correspond to <svg>/<symbol> tags
340 // Update whole subtree, scanning for shadow container elements, marking a cloned use subtree
782 void SVGUseElement::removeDisallowedElementsFromSubtree(Node* subtree) argument
784 ASSERT(!subtree->inDocument());
786 Node* node = subtree->firstChild();
789 Node* next = node->traverseNextSibling(subtree);
790 // The subtree is not in document so this won't generate events that could mutate the tree.
794 node = node->traverseNextNode(subtree);
809 // Though if there are disallowed elements in the subtree, w
[all...]
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dtreewizard.py196 subtree = self.parseTree()
197 self.adaptor.addChild(root, subtree)
524 on the various nodes and '.' (dot) as the node/subtree wildcard,
/external/chromium/chrome/common/extensions/
H A Dextension_message_bundle_unittest.cc38 DictionaryValue* subtree,
40 target->Set(name, static_cast<Value*>(subtree));
37 SetDictionary(const std::string& name, DictionaryValue* subtree, DictionaryValue* target) argument
/external/webkit/Source/WebCore/page/
H A DFrameView.cpp646 // call will not cause the subtree under it to repaint. Explicitly call the syncCompositingState on
856 bool subtree = m_layoutRoot; local
863 RenderObject* root = subtree ? m_layoutRoot : document->renderer();
903 m_doFullRepaint = !subtree && (m_firstLayout || toRenderView(root)->printing());
905 if (!subtree) {
954 if (subtree) {
968 if (subtree) {
978 if (!subtree && !toRenderView(root)->printing())
990 subtree ? 0 : &cachedOffset);
/external/chromium/net/tools/spdyshark/
H A Dpacket-spdy.c1482 proto_tree *subtree; local
1492 subtree = proto_item_add_subtree(ti, ett_message_spdy);
1499 proto_tree_add_text(subtree, tvb, offset, next_offset - offset,
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
H A Dwizard.rb221 subtree = parse_tree
222 @adaptor.add_child( root, subtree )
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas165 /// Given the root of the subtree created for this rule, post process
276 /// Get the token start index for this subtree; return -1 if no such index
281 /// Get the token stop index for this subtree; return -1 if no such index
794 /// an existing subtree.
851 /// Treat next element as a single node even if it's a subtree.
989 /// on the various nodes and '.' (dot) as the node/subtree wildcard,
1504 /// Tracks whether a node or subtree has been used in a stream
1507 /// Once a node or subtree has been used in a stream, it must be dup'd
1534 /// it's a tree node or subtree.
1598 /// subtree
[all...]
/external/apache-harmony/security/src/test/impl/java.injected/java/security/cert/
H A DX509CertSelectorTest.java1787 GeneralSubtree subtree =
1791 subtrees.addSubtree(subtree);
1939 GeneralSubtree subtree =
1943 subtrees.addSubtree(subtree);
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DBaseTreeAdaptor.as57 // ensure new subtree root has parent/child index set
/external/webkit/Source/JavaScriptCore/parser/
H A DJSParser.cpp1192 TreeSourceElements subtree = parseSourceElements<DontCheckForStrictMode>(context); local
1193 failIfFalse(subtree);
1196 return context.createBlockStatement(subtree, start, m_lastLine);
/external/iproute2/doc/
H A Dip-tunnels.tex465 transmitted via tunnel, you can build CBQ subtree,

Completed in 1231 milliseconds

12