Home
last modified time | relevance | path

Searched refs:subtree (Results 1 – 25 of 114) sorted by relevance

12345

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DIntervalMap.cpp22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); in replaceRoot()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
44 NR = NR.subtree(NR.size() - 1); in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft()
70 NR = NR.subtree(NR.size() - 1); in moveLeft()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
94 NR = NR.subtree(0); in getRightSibling()
110 NodeRef NR = subtree(l); in moveRight()
114 NR = NR.subtree(0); in moveRight()
/netbsd-src/external/gpl3/gcc/dist/gcc/config/rs6000/
H A Drbtree.cc221 rbt_dump (struct rbt_strings *t, struct rbt_string_node *subtree) in rbt_dump() argument
223 if (subtree != t->rbt_nil) in rbt_dump()
225 rbt_dump (t, subtree->left); in rbt_dump()
226 fprintf (stderr, "%s\n", subtree->str); in rbt_dump()
227 rbt_dump (t, subtree->right); in rbt_dump()
233 rbt_inorder_callback (struct rbt_strings *t, struct rbt_string_node *subtree, in rbt_inorder_callback() argument
236 if (subtree != t->rbt_nil) in rbt_inorder_callback()
238 rbt_inorder_callback (t, subtree->left, fn); in rbt_inorder_callback()
239 (*fn) (subtree->str); in rbt_inorder_callback()
240 rbt_inorder_callback (t, subtree->right, fn); in rbt_inorder_callback()
/netbsd-src/external/bsd/openldap/dist/doc/rfc/
H A Drfc3672.txt31 information associated with a subtree or subtree refinement. This
41 a subtree (or subtree refinement) associated with its
64 subentries SHALL NOT be considered in one-level and subtree scope
88 for the specification of a subset of entries in a subtree of the
89 Directory Information Tree (DIT). A subtree begins at some base
92 subtree specification is always used within a context or scope which
93 implicitly determines the bounds of the subtree. For example, the
94 scope of a subtree specification for a subschema administrative area
96 entries for subschema administration. Where a subtree specification
98 subtree the collection is termed a subtree refinement.
[all …]
H A Drfc2293.txt37 of the entry. This is achieved by use of a directory subtree.
95 A table is represented as a single level subtree. The root of the
96 subtree is an entry of object class Table. This is named with a
180 subtree approach defined in Section 2 will be preferable. No
248 A subtree is similar to a table, except that the keys are constructed
250 subtree in the DIT. The subtree effectively starts a private "root",
258 The subtree object class defines the root for a subtree in an
259 analogous means to the table. Information within the subtree will
262 subtree OBJECT-CLASS ::= {
266 ID oc-subtree}
[all …]
H A Drfc5020.txt73 be used in search filters. For instance, searching the subtree
80 would return entries in the subtree <ou=A,dc=example,dc=com> and
81 entries in subtree <ou=B,dc=example,dc=com>, but would not return any
82 other entries in the subtree <dc=example,dc=com>.
/netbsd-src/external/bsd/openldap/dist/doc/guide/admin/
H A Dreferrals.sdf8 entire subtree of data is sufficient. But often it is desirable
25 a subtree.
35 delegated subtree. Generally, the referral object will also
41 and wished to delegate the subtree {{EX:ou=subtree,dc=example,dc=net}}
45 > dn: dc=subtree,dc=example,dc=net
48 > dc: subtree
49 > ref: ldap://b.example.net/dc=subtree,dc=example,dc=net
63 entry at the root of a delegated subtree. The knowledge information
67 to the entry {{EX:dc=subtree,dc=example,dc=net}} in server B indicating
70 > dn: dc=subtree,dc=example,dc=net
[all …]
H A Daccess-control.sdf44 > <scope-style> ::= base | one | subtree | children
91 The scope can be either {{EX:base}}, {{EX:one}}, {{EX:subtree}},
94 provided DN, {{EX:subtree}} matches all entries in the subtree whose
110 . {{EX:dn.subtree="ou=people,o=suffix"}} match 2, 3, 4, and 5; and
305 Read access is granted to entries under the {{EX:dc=com}} subtree,
306 except for those entries under the {{EX:dc=example,dc=com}} subtree,
327 > access to dn.subtree="dc=example,dc=com" attrs=homePhone
331 > access to dn.subtree="dc=example,dc=com"
337 subtree. To all attributes except {{EX:homePhone}}, an entry can
382 > <scope-style> ::= base | one | subtree | children
[all …]
H A Dbackends.sdf177 maximum search performance. It is fully hierarchical and supports subtree
240 To inspect all monitor information, issue a subtree search with base {{cn=Monitor}},
266 > access to dn.subtree="cn=Monitor"
279 > # base <cn=Monitor> with scope subtree
288 > description: This subtree contains monitoring/managing objects.
340 > # base <cn=Nothing> with scope subtree
383 > # base <cn=passwd> with scope subtree
450 stored in some RDBMS as an LDAP subtree without any programming (some SQL and
H A Dmonitoringslapd.sdf20 subtree. Each object contains information about a particular aspect
114 requests in the {{cn=Monitor}} subtree. Each object contains
148 > description: This subtree contains monitoring/managing objects.
172 > description: This subtree contains monitoring/managing objects.
179 search of {{EX:cn=Monitor}} with subtree scope and {{EX:(objectClass=*)}}
185 in the {{cn=Monitor}} subtree. The following section describes
/netbsd-src/external/bsd/openldap/dist/tests/data/
H A Dslapd-emptydn.conf54 access to dn.subtree="dc=example,dc=com"
59 access to dn.subtree="cn=Monitor"
76 access to dn.subtree=""
H A Dslapd-repl-consumer-remote.conf68 access to dn.subtree="dc=example,dc=com" attrs=hasSubordinates
72 access to dn.subtree="dc=example,dc=com"
H A Dslapd-meta.conf50 subtree-exclude "ou=Excluded,ou=Meta,o=Example,c=US"
63 subtree-include "dn.subtree:o=Example,c=US"
H A Dslapd-asyncmeta.conf52 subtree-exclude "ou=Excluded,ou=Meta,o=Example,c=US"
65 subtree-include "dn.subtree:o=Example,c=US"
H A Dslapd-acl.conf103 by dn.subtree="dc=example,dc=com" +rs continue
136 access to dn.subtree="ou=Add & Delete,dc=example,dc=com"
H A Dtest-idassert1.ldif26 authzFrom: dn.subtree:ou=People,dc=example,dc=it
61 authzTo: dn.subtree:ou=People,dc=example,dc=it
H A Dslapd-aci.conf52 access to dn.subtree="dc=example,dc=com"
H A Dslapd-limits.conf58 limits dn.subtree="ou=Admin,dc=example,dc=com" size.soft=3
/netbsd-src/external/bsd/openldap/dist/servers/slapd/
H A Dslapcommon.c292 char *subtree = NULL; in slap_tool_init() local
458 ch_free( subtree ); in slap_tool_init()
459 subtree = ludp->lud_dn; in slap_tool_init()
545 ch_free( subtree ); in slap_tool_init()
546 subtree = optarg; in slap_tool_init()
772 if( subtree ) { in slap_tool_init()
774 ber_str2bv( subtree, 0, 0, &val ); in slap_tool_init()
777 fprintf( stderr, "Invalid subtree DN '%s'\n", subtree ); in slap_tool_init()
784 free( subtree ); in slap_tool_init()
785 subtree = NULL; in slap_tool_init()
/netbsd-src/external/bsd/openldap/dist/doc/drafts/
H A Ddraft-ietf-ldapext-acl-model-xx.txt231 arbitrary part (subtree) of the DIT.
250 in either the same subtree or separate subtrees. If two
264 mechanisms are run in the same subtree, it is desirable that
275 subtree: supportedAccessControlSchemes and
352 end of the subtree held by that server or until another
353 ldapACISubEntry is encountered in that subtree held by that
378 in this subtree
434 inheritance and both the entry and subtree scope are used,
438 another might contain 'subtree'. This implies that some
474 scope = "entry" / "subtree"
[all …]
H A Ddraft-legg-ldap-admin-xx.txt113 An administrative area is a subtree of the DIT considered from the
114 perspective of administration. The root entry of the subtree is an
132 The root entry of an autonomous administrative area's subtree is
172 The root entry of a specific administrative area's subtree is called
207 The root entry of an inner administrative area's subtree is called an
233 possible for entries to be included in more than one subtree or
234 subtree refinement associated with an inner area defined for that
H A Ddraft-legg-ldap-acm-admin-xx.txt198 Prescriptive ACI applies to all the entries within a subtree or
199 subtree refinement of an administrative area (either an ACSA or an
206 subentries are within the subtree or subtree refinement.
231 The subtree or subtree refinement for an access control subentry is
237 Since a subtreeSpecification may define a subtree refinement, DACDs
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DIntervalMap.h525 NodeRef &subtree(unsigned i) const { in subtree() function
708 const NodeRef &subtree(unsigned i) const { return this->first[i]; } in subtree() function
711 NodeRef &subtree(unsigned i) { return this->first[i]; } in subtree() function
746 return subtree(safeFind(0, x)); in safeLookup()
758 subtree(i) = Node; in insert()
787 : node(&Node.subtree(0)), size(Node.size()), offset(Offset) {} in Entry()
789 NodeRef &subtree(unsigned i) const { in subtree() function
826 NodeRef &subtree(unsigned Level) const { in subtree() function
827 return path[Level].subtree(path[Level].offset); in subtree()
833 path[Level] = Entry(subtree(Level - 1), offset(Level)); in reset()
[all …]
/netbsd-src/external/bsd/openldap/dist/servers/slapd/back-ndb/
H A DTODO6 subtree rename
/netbsd-src/games/larn/
H A DCOPYRIGHT3 This entire subtree is copyright by Noah Morgan.
/netbsd-src/crypto/external/bsd/openssh/dist/
H A Dxmss_fast.h16 unsigned long long subtree; member

12345