| /netvirt/usr/src/uts/common/fs/smbsrv/ |
| 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_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_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...] |
| /netvirt/usr/src/cmd/ipf/examples/ |
| pool.conf | 5 table role = ipf type = tree number = 0
|
| /netvirt/usr/src/uts/common/sys/ |
| avl.h | 51 * AVL tree implementation uses 3 pointers. The following chart gives the
54 * Operation Link List AVL tree
77 * 1. Create the list/tree with: avl_create()
92 * 2d. Remove individual nodes from the list/tree with avl_remove().
100 * 4. Use avl_destroy() to destroy the AVL tree itself.
108 * Type used for the root of the AVL tree.
113 * The data nodes in the AVL tree must have a field of this type.
118 * An opaque type used to locate a position in the tree where a node
147 * Initialize an AVL tree. Arguments are:
149 * tree - the tree to be initialize
[all...] |
| /netvirt/usr/src/common/openssl/crypto/x509v3/ |
| pcy_lib.c | 70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree)
72 if (!tree)
74 return tree->nlevel;
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i)
80 if (!tree || (i < 0) || (i >= tree->nlevel))
82 return tree->levels + i;
86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree)
88 if (!tree)
90 return tree->auth_policies
[all...] |
| 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...] |
| pcy_node.c | 103 X509_POLICY_TREE *tree)
132 if (tree)
134 if (!tree->extra_data)
135 tree->extra_data = sk_X509_POLICY_DATA_new_null();
136 if (!tree->extra_data)
138 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
|
| /netvirt/usr/src/lib/libprtdiag/common/ |
| display_sun4u.c | 61 display(Sys_tree *tree,
76 exit_code = error_check(tree, kstats);
105 display_memorysize(tree, kstats, &grps, &memory_total);
111 display_cpu_devices(tree);
114 display_memoryconf(tree, &grps);
117 (void) display_io_devices(tree);
124 display_hp_fail_fault(tree, kstats);
127 root, tree, kstats);
135 error_check(Sys_tree *tree, struct system_kstat_data *kstats)
138 tree = tree
[all...] |
| /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/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/common/avl/ |
| avl.c | 30 * AVL - generic AVL tree implementation for kernel use
34 * Here is a very brief overview. An AVL tree is a binary search tree that is
39 * This relaxation from a perfectly balanced binary tree allows doing
40 * insertion and deletion relatively efficiently. Searching the tree is
43 * The key to insertion and deletion is a set of tree maniuplations called
61 * there is no recursion stack present to move "up" in the tree,
83 * allows using half as much code (and hence cache footprint) for tree
87 * adjacent to where a new value would be inserted in the tree. The value
102 * Code that deals with binary tree data structures will randomly us
[all...] |
| /netvirt/usr/src/lib/libxcurses/src/libc/xcurses/ |
| keypad.c | 48 * Add a function key string to the decode tree.
70 /* First node of tree. */
81 /* Find node to insert function key sequence into the tree. */
106 /* Insert string into the tree; node->child == null. */
126 __m_decode_free(tree)
127 t_decode **tree;
129 if (*tree != (t_decode *) 0) {
130 __m_decode_free(&(*tree)->sibling);
131 __m_decode_free(&(*tree)->child);
132 free(*tree);
[all...] |
| /netvirt/usr/src/lib/libprtdiag_psr/sparc/starfire/common/ |
| starfire.c | 63 int error_check(Sys_tree *tree, struct system_kstat_data *kstats);
64 void display_memoryconf(Sys_tree *tree, struct grp_info *grps);
65 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);
66 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,
78 error_check(Sys_tree *tree, struct system_kstat_data *kstats)
81 tree = tree;
88 display_memoryconf(Sys_tree *tree, struct grp_info *grps)
113 bnode = tree->bd_list;
144 display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats
[all...] |
| /netvirt/usr/src/lib/libxcurses2/src/libc/xcurses/ |
| keypad.c | 53 * Add a function key string to the decode tree.
72 /* First node of tree. */
83 /* Find node to insert function key sequence into the tree. */
107 /* Insert string into the tree; node->child == null. */
129 __m_decode_free(t_decode **tree)
131 if (*tree != NULL) {
132 __m_decode_free(&(*tree)->sibling);
133 __m_decode_free(&(*tree)->child);
134 free(*tree);
135 *tree = NULL
[all...] |
| /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/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/common/isc/ |
| tree.c | 7 static const char rcsid[] = "$Id: tree.c,v 8.10 2001/11/01 05:33:46 marka Exp $";
11 * tree - balanced binary tree library
18 * vix 02feb86 [added tree balancing from wirth "a+ds=p" p. 220-221]
46 #pragma ident "@(#)tree.c 1.4 03/01/14 SMI"
48 /*#define DEBUG "tree"*/
58 #include <isc/tree.h>
97 static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)());
98 static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *)
[all...] |
| /netvirt/usr/src/lib/libsqlite/src/ |
| btree_rb.c | 119 RbtCursor *pCursors; /* All cursors pointing to this tree */
120 BtRbNode *pHead; /* Head of the tree, or NULL */
129 BtRbNode *pParent; /* Nodes parent node, NULL for the tree head */
143 static int memRbtreeClearTable(Rbtree* tree, int n);
196 * Perform the LEFT-rotate transformation on node X of tree pTree. This
228 * Perform the RIGHT-rotate transformation on node X of tree pTree. This
280 * a problem with a red-black binary tree.
324 * Check the following properties of the red-black tree:
331 static void check_redblack_tree(BtRbTree * tree, char ** msg)
340 pNode = tree->pHead
[all...] |
| /netvirt/usr/src/uts/common/zmod/ |
| trees.c | 14 * Each code tree is stored in a compressed form which is itself
91 /* The static literal tree. Since the bit lengths are imposed, there is no
93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
98 /* The static distance tree. (Actually a trivial tree since all codes use
122 const ct_data *static_tree; /* static tree or NULL */
125 int elems; /* max number of elements in the tree */
144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code))
494 ct_data *tree = desc->dyn_tree; local
623 ct_data *tree = desc->dyn_tree; local
[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...] |
| /netvirt/usr/src/uts/common/idmap/ |
| idmap_cache.c | 79 struct avl_tree tree; member in struct:sid_prefix_store
152 avl_create(&cache->uidbysid.tree, (avl_comp_fn)kidmap_compare_sid,
157 avl_create(&cache->gidbysid.tree, (avl_comp_fn)kidmap_compare_sid,
162 avl_create(&cache->pidbysid.tree, (avl_comp_fn)kidmap_compare_sid,
167 avl_create(&cache->sidbyuid.tree, (avl_comp_fn)kidmap_compare_pid,
172 avl_create(&cache->sidbygid.tree, (avl_comp_fn)kidmap_compare_pid,
186 while ((entry = avl_destroy_nodes(&cache->uidbysid.tree, &cookie))
190 avl_destroy(&cache->uidbysid.tree);
194 while ((entry = avl_destroy_nodes(&cache->gidbysid.tree, &cookie))
198 avl_destroy(&cache->gidbysid.tree);
[all...] |
| /netvirt/usr/src/lib/libprtdiag_psr/sparc/desktop/common/ |
| desktop.c | 91 int error_check(Sys_tree *tree, struct system_kstat_data *kstats);
92 void display_memoryconf(Sys_tree *tree, struct grp_info *grps);
93 int disp_fail_parts(Sys_tree *tree);
94 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);
95 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,
98 void read_platform_kstats(Sys_tree *tree,
111 error_check(Sys_tree *tree, struct system_kstat_data *kstats)
123 if (disp_fail_parts(tree)) {
134 display_memoryconf(Sys_tree *tree, struct grp_info *grps)
137 tree = tree
[all...] |
| /netvirt/usr/src/lib/libprtdiag/inc/ |
| libprtdiag.h | 78 int error_check(Sys_tree *tree, struct system_kstat_data *kstats);
79 int disp_fail_parts(Sys_tree *tree);
80 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);
81 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,
107 void display_io_devices(Sys_tree *tree);
133 void read_platform_kstats(Sys_tree *tree,
141 void display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats,
143 void display_memoryconf(Sys_tree *tree, struct grp_info *grps);
|
| /netvirt/usr/src/tools/scripts/ |
| flg.flp.sh | 146 tree=$reltree
147 while [ "${srcfile##$tree}" = "$srcfile" ]; do
149 tree=`dirname $tree`
151 echo ${dots}${srcfile##$tree/}
221 TREE=$SUBTREE
222 while [ $TREE != $CODEMGR_WS ]; do
223 [ -f $TREE/req.flg ] && exec_file $TREE/req.flg
224 TREE=`dirname $TREE
[all...] |
