| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| IntervalMap.cpp | 22 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(path[l].offset + 1)
[all...] |
| /src/external/bsd/openldap/dist/tests/data/ |
| slapd-emptydn.conf | 52 access to dn.subtree="dc=example,dc=com"
57 access to dn.subtree="cn=Monitor"
72 access to dn.subtree=""
|
| slapd-repl-consumer-remote.conf | 66 access to dn.subtree="dc=example,dc=com" attrs=hasSubordinates
70 access to dn.subtree="dc=example,dc=com"
|
| slapd-asyncmeta.conf | 52 subtree-exclude "ou=Excluded,ou=Meta,o=Example,c=US"
65 subtree-include "dn.subtree:o=Example,c=US"
|
| slapd-meta.conf | 50 subtree-exclude "ou=Excluded,ou=Meta,o=Example,c=US"
63 subtree-include "dn.subtree:o=Example,c=US"
|
| slapd-aci.conf | 50 access to dn.subtree="dc=example,dc=com"
|
| slapd-limits.conf | 56 limits dn.subtree="ou=Admin,dc=example,dc=com" size.soft=3
|
| slapd-acl.conf | 50 #access to attrs=objectclass dn.subtree="dc=example,dc=com"
55 #access to filter="(objectclass=person)" attrs=userpassword dn.subtree="dc=example,dc=com"
101 by dn.subtree="dc=example,dc=com" +rs continue
105 #access to attrs=member,uniquemember dn.subtree="dc=example,dc=com"
112 #access to attrs=member,uniquemember filter="(mail=*com)" dn.subtree="dc=example,dc=com"
116 #access to filter="(|(objectclass=groupofnames)(objectClass=groupofuniquenames))" dn.subtree="dc=example,dc=com"
130 #access to filter="(name=X*Y*Z)" dn.subtree="dc=example,dc=com"
134 access to dn.subtree="ou=Add & Delete,dc=example,dc=com"
|
| /src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| rbtree.cc | 58 /* Turn RIGHT's left subtree into NODE's right subtree. */
85 /* Turn LEFT's right subtree into NODE's left subtree. */
221 rbt_dump (struct rbt_strings *t, struct rbt_string_node *subtree)
223 if (subtree != t->rbt_nil)
225 rbt_dump (t, subtree->left);
226 fprintf (stderr, "%s\n", subtree->str);
227 rbt_dump (t, subtree->right);
233 rbt_inorder_callback (struct rbt_strings *t, struct rbt_string_node *subtree,
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| rbtree.cc | 58 /* Turn RIGHT's left subtree into NODE's right subtree. */
85 /* Turn LEFT's right subtree into NODE's left subtree. */
221 rbt_dump (struct rbt_strings *t, struct rbt_string_node *subtree)
223 if (subtree != t->rbt_nil)
225 rbt_dump (t, subtree->left);
226 fprintf (stderr, "%s\n", subtree->str);
227 rbt_dump (t, subtree->right);
233 rbt_inorder_callback (struct rbt_strings *t, struct rbt_string_node *subtree,
[all...] |
| /src/crypto/dist/ipsec-tools/src/racoon/ |
| isakmp_xauth.h | 168 int subtree; member in struct:xauth_ldap_config
|
| isakmp_xauth.c | 790 xauth_ldap_config.subtree = 0;
1007 if (xauth_ldap_config.subtree)
1233 if (xauth_ldap_config.subtree)
|
| cfparse.y | 865 xauth_ldap_config.subtree = $2;
|
| /src/external/bsd/openldap/dist/servers/slapd/ |
| slapcommon.c | 88 " [-l ldiffile] [-a filter] [-s subtree] [-H url]\n";
110 " [-l errorfile] [-a filter] [-s subtree] [-H url]\n";
291 char *subtree = NULL; local
471 ch_free( subtree );
472 subtree = ludp->lud_dn;
562 /* dump subtree */
563 ch_free( subtree );
564 subtree = ch_strdup( optarg );
778 if( subtree ) {
780 ber_str2bv( subtree, 0, 0, &val )
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| IntervalMap.h | 522 /// subtree - Access the i'th subtree reference in a branch node.
525 NodeRef &subtree(unsigned i) const { function in class:llvm::IntervalMapImpl::NodeRef
691 // The key array in a branch node holds the rightmost stop key of each subtree.
695 // It is unusual for a branch node to only have one subtree, but it can happen
708 const NodeRef &subtree(unsigned i) const { return this->first[i]; }
711 NodeRef &subtree(unsigned i) { return this->first[i]; }
713 /// findFrom - Find the first subtree after i that may contain x.
718 /// This is the first subtree that can possibly contain x.
727 /// safeFind - Find a subtree that is known to exist. This is the same a
[all...] |
| /src/external/bsd/openldap/dist/tests/data/regressions/its8521/ |
| its8521 | 205 olcAccess: {0}to dn.subtree="dc=example,dc=com" by self write
|
| /src/external/bsd/openldap/dist/tests/scripts/ |
| defines.sh | 457 SUBTREERENAMEOUT=$DATADIR/subtree-rename.out
|
| /src/external/gpl2/dtc/dist/Documentation/ |
| dtc-paper.tex | 142 node (or whole subtree). It should be possible to do this without
|
