| /netvirt/usr/src/cmd/mdb/common/modules/genunix/ |
| avl.c | 34 void *aw_buff; /* buffer to hold the tree's data structure */
61 * initialize a forward walk thru an avl tree.
67 avl_tree_t *tree; local
78 tree = &aw->aw_tree;
79 if (mdb_vread(tree, sizeof (avl_tree_t), wsp->walk_addr) == -1) {
83 if (tree->avl_size < tree->avl_offset + sizeof (avl_node_t)) {
85 wsp->walk_addr, tree->avl_size, tree->avl_offset);
90 * allocate a buffer to hold the mdb copy of tree's struct
[all...] |
| /netvirt/usr/src/cmd/perl/5.6.1/distrib/ext/B/B/ |
| Concise.pm | 51 print tree($cv->ROOT, 0)
81 } elsif ($o eq "-tree") {
82 $order = "tree";
119 } elsif ($order eq "tree") {
122 print tree(main_root, 0) }
440 sub tree { subroutine
451 push @lines, tree($kid, $level+1);
485 B::Concise - Walk Perl syntax tree, printing concise info about ops
494 tree in one of several space-efficient text formats suitable for debugging
496 the order they appear in the OP tree, in the order they will execute, o
[all...] |
| /netvirt/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/Perldoc/ |
| ToTk.pm | 16 sub tree { shift->_perldoc_elem('tree' , @_) } subroutine
44 my($tk_opt, $tree);
45 $tree = $self->{'tree' };
75 (($Tk::Pod::VERSION >= 4) ? ('-tree' => $tree) : ())
|
| /netvirt/usr/src/lib/libast/common/path/ |
| pathexists.c | 43 struct Tree_s* tree; member in struct:Tree_s
62 static Tree_t tree; local
64 t = &tree;
75 for (t = p->tree; t && (*cmp)(s, t->name); t = t->next);
84 t->next = p->tree;
85 p->tree = t;
110 p->next = t->tree;
111 t->tree = p;
|
| /netvirt/usr/src/lib/libresolv2/include/isc/ |
| tree.h | 6 /* tree.h - declare structures used by tree library
9 * vix 27jun86 [broken out of tree.c]
11 * $Id: tree.h,v 8.3 2002/12/03 05:26:48 marka Exp $
14 #pragma ident "@(#)tree.h 1.4 03/10/21 SMI"
55 tree; typedef in typeref:struct:tree_s
58 void tree_init __P((tree **));
59 tree_t tree_srch __P((tree **, int (*)(), tree_t));
60 tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)()));
61 int tree_delete __P((tree **, int (*)(), tree_t, void (*)()))
[all...] |
| /netvirt/usr/src/uts/common/fs/smbsrv/ |
| smb_odir.c | 54 * | TREE |<----->| TREE |......| TREE |
94 * - The odir is queued in the list of odirs of its tree.
100 * - The odir is queued in the list of odirs of its tree.
108 * - The odir is queued in the list of odirs of its tree.
115 * added to the list of odirs of a tree.
132 * - The list of odirs of the tree it belongs to.
137 * and there's a lock embedded in the list of odirs of a tree. To
139 * To insert the odir into the list of odirs of the tree and to remov
393 smb_tree_t *tree; local
[all...] |
| smb_tree.c | 54 * | TREE |<----->| TREE |......| TREE |
70 * Tree State Machine
94 * - The tree is queued in the list of trees of its user.
95 * - References will be given out if the tree is looked up.
96 * - Files under that tree can be accessed.
101 * - The tree is queued in the list of trees of its user.
102 * - References will not be given out if the tree is looked up.
103 * - The files and directories open under the tree are being closed
189 smb_tree_t *tree; local
333 smb_tree_t *tree; local
357 smb_tree_t *tree; local
421 smb_tree_t *tree; local
660 smb_tree_t *tree; local
[all...] |
| smb_user.c | 54 * | TREE |<----->| TREE |......| TREE |
388 * set here may be overridden by the tree credentials. In domain mode,
389 * the user and tree credentials should be the same. In share mode, the
390 * tree credentials (defined in the share definition) should override
535 smb_tree_t *tree; local
542 tree = smb_tree_lookup_by_name(user, sharename, NULL);
543 while (tree) {
544 ASSERT(tree->t_magic == SMB_TREE_MAGIC)
564 smb_tree_t *tree; local
[all...] |
| smb_ofile.c | 54 * | TREE |<----->| TREE |......| TREE |
94 * - The ofile is queued in the list of ofiles of its tree.
100 * - The ofile is queued in the list of ofiles of its tree.
108 * - The ofile is queued in the list of ofiles of its tree.
115 * added to the list of ofiles of a tree.
132 * - The list of ofiles of the tree it belongs to.
137 * and there's a lock embedded in the list of ofiles of a tree. To
139 * To insert the ofile into the list of ofiles of the tree and to remov
632 smb_tree_t *tree; local
[all...] |
| smb_common_tree.c | 29 * Common code for tree connections.
181 smb_tree_t *tree; local
215 tree = smb_tree_connect(sr->uid_user, access,
218 if (tree == NULL)
221 sr->smb_tid = tree->t_tid;
222 sr->tid_tree = tree;
282 * will be released upon tree deallocation.
310 tree = smb_tree_connect(sr->uid_user, access,
313 if (tree == NULL) {
318 sr->smb_tid = tree->t_tid
[all...] |
| /netvirt/usr/src/uts/common/idmap/ |
| kidmap_priv.h | 45 avl_tree_t tree; member in struct:idmap_avl_cache
|
| /netvirt/usr/src/cmd/krb5/kadmin/gui/visualrt/sunsoft/jws/visual/rt/type/ |
| AMConverter.java | 50 * be used to save a tree to a file.
202 * attribute management tree given. Appends the string to the given
205 * @param obj attribute management tree reference
207 * @return string that describes the tree
221 AttributeManager tree = (AttributeManager) obj; local
227 if ((tree instanceof WindowShadow) && ((WindowShadow)tree).isPanel()) {
228 AttributeManager child = ((WindowShadow)tree).getPanel();
236 buf.append(shortenShadowPath(tree.getClass().getName()));
239 ListParser.quote(tree.getName(), buf, false)
[all...] |
| /netvirt/usr/src/cmd/perl/5.8.4/distrib/ext/B/B/ |
| Concise.pm | 124 print $walkHandle tree($cv->ROOT, 0);
135 } elsif ($order eq "tree") {
137 print $walkHandle tree(main_root, 0);
187 } elsif ($o eq "-tree") {
188 $order = "tree";
712 sub tree { subroutine
723 push @lines, tree($kid, $level+1);
795 B::Concise - Walk Perl syntax tree, printing concise info about ops
806 tree in one of several space-efficient text formats suitable for debugging
808 the order they appear in the OP tree, in the order they will execute, o
[all...] |
| /netvirt/usr/src/uts/common/fs/zfs/ |
| zfs_rlock.c | 40 * AVL tree
42 * An AVL tree is used to maintain the state of the existing ranges
44 * The starting range offset is used for searching and sorting the tree.
49 * locks. On entry to zfs_lock_range() a rl_t is allocated; the tree
50 * searched that finds no overlap, and *this* rl_t is placed in the tree.
105 avl_tree_t *tree = &zp->z_range_avl; local
148 if (avl_numnodes(tree) == 0) {
150 avl_add(tree, new);
157 rl = avl_find(tree, new, &where);
161 rl = (rl_t *)avl_nearest(tree, where, AVL_AFTER)
357 avl_tree_t *tree = &zp->z_range_avl; local
462 avl_tree_t *tree = &zp->z_range_avl; local
[all...] |
| spa_errlog.c | 131 avl_tree_t *tree; local
148 tree = &spa->spa_errlist_scrub;
150 tree = &spa->spa_errlist_last;
153 if (avl_find(tree, &search, &where) != NULL) {
160 avl_insert(tree, new, where);
294 * tree to add new errors. spa_errlog_sync() is responsible for actually
|
| vdev_queue.c | 179 avl_tree_t *tree; local
190 tree = fio->io_vdev_tree;
193 while ((dio = AVL_PREV(tree, fio)) != NULL && IS_ADJACENT(dio, fio) &&
200 while ((dio = AVL_NEXT(tree, lio)) != NULL && IS_ADJACENT(lio, dio) &&
225 ASSERT(dio->io_vdev_tree == tree);
246 ASSERT(fio->io_vdev_tree == tree);
|
| /netvirt/usr/src/cmd/acct/ |
| acctdusg.c | 60 static avl_tree_t *tree = NULL; variable
224 switch (add_tnode(&tree, statb.st_dev, statb.st_ino)) {
|
| /netvirt/usr/src/cmd/chgrp/ |
| chgrp.c | 74 static avl_tree_t *tree; /* search tree to store inode data */ variable
222 tree = NULL;
256 * tree so we don't get into an
259 if (add_tnode(&tree,
277 * the search tree.
307 * Add this node to the search tree so we don't
310 if (add_tnode(&tree, stbuf.st_dev,
320 * to add the node to the tree.
324 * being added to the search tree
[all...] |
| /netvirt/usr/src/cmd/chown/ |
| chown.c | 68 static avl_tree_t *tree; variable
244 tree = NULL;
279 * tree so we don't get into an
282 if (add_tnode(&tree,
293 * the search tree.
316 * Add this node to the search tree so we don't
319 if (add_tnode(&tree, stbuf.st_dev,
325 * to add the node to the tree.
329 * being added to the search tree.
349 * directory to the search tree so we do not get into endless loops
[all...] |
| /netvirt/usr/src/common/openssl/crypto/x509v3/ |
| pcy_tree.c | 65 /* Initialize policy tree. Return values:
68 * 1 Tree initialized OK.
69 * 2 Policy tree is empty.
70 * 5 Tree OK and requireExplicitPolicy true.
71 * 6 Tree empty and requireExplicitPolicy true.
77 X509_POLICY_TREE *tree; local
149 /* If we get this far initialize the tree */
151 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE));
153 if (!tree)
156 tree->flags = 0
598 X509_POLICY_TREE *tree = NULL; local
[all...] |
| /netvirt/usr/src/cmd/agents/snmp/parser/ |
| parse.h | 50 struct tree *tp;
104 * A tree in the format of the tree structure of the MIB.
106 struct tree { struct
107 struct tree *child_list; /* list of children of this node */
108 struct tree *next_peer; /* Next node in list of peers */
109 struct tree *parent;
123 struct tree *next;
132 /* non-aggregate types for tree end nodes */
154 struct tree *read_mib()
[all...] |
| /netvirt/usr/src/cmd/picl/plugins/sun4u/lw2plus/fcal_leds/ |
| fcal_leds_thread.c | 106 * In the case of disk ready, locate platform tree node for the disk
195 * cannot be found in the platform tree, we have probably
355 * located in the device tree. A check is applied that any node found has
410 di_node_t tree = di_init("/", DINFOCPYALL); local
411 if (tree == DI_NODE_NIL) {
416 r = walk_disks(tree, dtls);
417 if (tree != DI_NODE_NIL)
418 di_fini(tree);
|
| /netvirt/usr/src/cmd/unpack/ |
| unpack.c | 76 static char *tree[25]; variable
104 * set tree[i] to point to leaves for level i
140 tree[i] = eof;
204 p = &tree[lev][j];
487 static int Tree[1024];
510 t = Tree;
553 tp += Tree[tp + (word < 0)];
556 if (Tree[tp] == 0) {
557 putch(Tree[tp+1]);
|
| /netvirt/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ |
| ldap_principal.c | 152 unsigned int filterlen=0, tree=0, ntree=1, i=0; local
195 for (tree=0; tree < ntree; ++tree) {
197 LDAP_SEARCH(subtree[tree], ldap_context->lrparams->search_scope, filter, principal_attributes);
225 } /* end of for (tree= ... */
|
| /netvirt/usr/src/lib/libshare/common/ |
| libshare_impl.h | 166 xmlNodePtr tree; member in struct:sa_handle_impl
|
