Searched refs:tree (Results 1 - 25 of 143) sorted by relevance

123456

/illumos-gate/usr/src/cmd/ipf/examples/
H A Dpool.conf5 table role = ipf type = tree number = 0
/illumos-gate/usr/src/uts/common/sys/
H A Davl.h48 * AVL tree implementation uses 3 pointers. The following chart gives the
51 * Operation Link List AVL tree
74 * 1. Create the list/tree with: avl_create()
89 * 2d. Remove individual nodes from the list/tree with avl_remove().
97 * 4. Use avl_destroy() to destroy the AVL tree itself.
112 * Type used for the root of the AVL tree.
117 * The data nodes in the AVL tree must have a field of this type.
122 * An opaque type used to locate a position in the tree where a node
150 * Initialize an AVL tree. Arguments are:
152 * tree
[all...]
/illumos-gate/usr/src/lib/libprtdiag/common/
H A Ddisplay_sun4u.c57 display(Sys_tree *tree, argument
72 exit_code = error_check(tree, kstats);
99 display_memorysize(tree, kstats, &grps, &memory_total);
105 display_cpu_devices(tree);
108 display_memoryconf(tree, &grps);
111 (void) display_io_devices(tree);
118 display_hp_fail_fault(tree, kstats);
121 root, tree, kstats);
129 error_check(Sys_tree *tree, struct system_kstat_data *kstats) argument
132 tree
142 disp_fail_parts(Sys_tree *tree) argument
155 display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats) argument
167 display_diaginfo(int flag, Prom_node *root, Sys_tree *tree, struct system_kstat_data *kstats) argument
183 resolve_board_types(Sys_tree *tree) argument
[all...]
/illumos-gate/usr/src/uts/common/fs/smbsrv/
H A Dsmb_tree.c94 * - 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.
104 * - The resources associated with the tree remain.
109 * - The tree is queued in the list of trees of its user.
110 * - References will not be given out if the tree is looked up.
111 * - The tree ha
306 smb_tree_disconnect(smb_tree_t *tree, boolean_t do_exec) argument
346 smb_tree_hold( smb_tree_t *tree) argument
372 smb_tree_hold_internal( smb_tree_t *tree) argument
389 smb_tree_release( smb_tree_t *tree) argument
425 smb_tree_close_pid( smb_tree_t *tree, uint32_t pid) argument
440 smb_tree_has_feature(smb_tree_t *tree, uint32_t flags) argument
455 smb_tree_enum(smb_tree_t *tree, smb_svcenum_t *svcenum) argument
487 smb_tree_fclose(smb_tree_t *tree, uint32_t uniqid) argument
669 smb_tree_t *tree; local
799 smb_tree_t *tree; local
868 smb_tree_t *tree; local
907 smb_tree_t *tree; local
996 smb_tree_t *tree = (smb_tree_t *)arg; local
1043 smb_tree_is_connected_locked(smb_tree_t *tree) argument
1099 smb_tree_getattr(const smb_kshare_t *si, smb_node_t *node, smb_tree_t *tree) argument
1133 smb_tree_get_volname(vfs_t *vfsp, smb_tree_t *tree) argument
1165 smb_tree_get_flags(const smb_kshare_t *si, vfs_t *vfsp, smb_tree_t *tree) argument
1323 smb_tree_t *tree = sr->tid_tree; local
1356 smb_tree_is_connected(smb_tree_t *tree) argument
1374 smb_tree_close_odirs(smb_tree_t *tree, uint32_t pid) argument
1405 smb_tree_set_execinfo(smb_tree_t *tree, smb_shr_execinfo_t *exec, int exec_type) argument
1422 smb_tree_enum_private(smb_tree_t *tree, smb_svcenum_t *svcenum) argument
1454 smb_tree_netinfo_encode(smb_tree_t *tree, uint8_t *buf, size_t buflen, uint32_t *nbytes) argument
1468 smb_tree_netinfo_username(smb_tree_t *tree, char **namestr, uint32_t *namelen) argument
1493 smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *info) argument
[all...]
H A Dsmb2_tree_connect.c28 smb_tree_t *tree = NULL; local
92 tree = sr->tid_tree;
97 switch (tree->t_res_type & STYPE_MASK) {
113 if (tree->t_encrypt != SMB_CONFIG_DISABLED)
119 if ((tree->t_flags & SMB_TREE_DFSROOT) != 0)
121 if ((tree->t_flags & SMB_TREE_CA) != 0)
134 tree->t_access); /* l */
H A Dsmb2_qinfo_fs.c99 smb_tree_t *tree = sr->tid_tree; local
104 if (!STYPE_ISDSK(tree->t_res_type))
107 snode = tree->t_snode;
110 LabelLength = smb_wcequiv_strlen(tree->t_volume);
122 tree->t_volume); /* (U) */
134 smb_tree_t *tree = sr->tid_tree; local
137 if (!STYPE_ISDSK(tree->t_res_type))
161 smb_tree_t *tree = sr->tid_tree; local
164 if (!STYPE_ISDSK(tree->t_res_type))
188 smb_tree_t *tree local
212 smb_tree_t *tree = sr->tid_tree; local
266 smb_tree_t *tree = sr->tid_tree; local
365 smb_tree_t *tree = sr->tid_tree; local
[all...]
H A Dsmb_tree_connect.c57 * SmbTreeConnect: Map a share to a tree and obtain a tree-id (TID).
136 * SmbTreeConnectX: Map a share to a tree and obtain a tree-id (TID).
158 * sent a successful SMB_COM_SESSION_SETUP_ANDX request when the tree
164 * 0x0001 DISCONECT_TID The tree specified by TID in the SMB header
223 * STRING NativeFileSystem[]; Native file system for this tree
308 smb_tree_t *tree; local
314 tree = smb_session_lookup_tree(sr->session, sr->smb_tid);
315 if (tree !
[all...]
H A Dsmb_fsinfo.c164 smb_tree_t *tree; local
171 tree = sr->tid_tree;
173 if (!STYPE_ISDSK(tree->t_res_type)) {
182 snode = tree->t_snode;
212 length = smb_wcequiv_strlen(tree->t_volume);
217 rc = smb_msgbuf_encode(&mb, "U", tree->t_volume);
225 length = strlen(tree->t_volume);
227 fsid.val[0], length, tree->t_volume);
238 length = smb_wcequiv_strlen(tree->t_volume);
241 length = strlen(tree
447 smb_tree_t *tree; local
[all...]
H A Dsmb_session.c900 * Cancel requests. If a non-null tree is specified, only requests specific
901 * to that tree will be cancelled. If a non-null sr is specified, that sr
907 smb_tree_t *tree,
918 (tree == NULL || sr->tid_tree == tree))
984 * Find a tree by tree-id.
991 smb_tree_t *tree; local
996 tree = smb_llist_head(&session->s_tree_list);
998 while (tree) {
905 smb_session_cancel_requests( smb_session_t *session, smb_tree_t *tree, smb_request_t *exclude_sr) argument
1029 smb_tree_t *tree; local
1048 smb_tree_t *tree = arg; local
1064 smb_tree_t *tree; local
1100 smb_tree_t *tree; local
1124 smb_tree_t *tree = arg; local
1145 smb_tree_t *tree; local
[all...]
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dtree.h0 /* tree.h - declare structures used by tree library
4 * vix 27jun86 [broken out of tree.c]
6 * $Id: tree.h,v 1.3 2005/04/27 04:56:18 sra Exp $
47 tree; typedef in typeref:struct:tree_s
50 void tree_init __P((tree **));
51 tree_t tree_srch __P((tree **, int (*)(), tree_t));
52 tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)()));
53 int tree_delete __P((tree **, int (*)(), tree_t, void (*)()));
54 int tree_trav __P((tree **, in
[all...]
/illumos-gate/usr/src/common/avl/
H A Davl.c32 * AVL - generic AVL tree implementation for kernel use
36 * Here is a very brief overview. An AVL tree is a binary search tree that is
41 * This relaxation from a perfectly balanced binary tree allows doing
42 * insertion and deletion relatively efficiently. Searching the tree is
45 * The key to insertion and deletion is a set of tree manipulations called
63 * there is no recursion stack present to move "up" in the tree,
85 * allows using half as much code (and hence cache footprint) for tree
89 * adjacent to where a new value would be inserted in the tree. The value
110 * Code that deals with binary tree dat
136 avl_walk(avl_tree_t *tree, void *oldnode, int left) argument
183 avl_first(avl_tree_t *tree) argument
202 avl_last(avl_tree_t *tree) argument
226 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) argument
255 avl_find(avl_tree_t *tree, const void *value, avl_index_t *where) argument
303 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument
482 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where) argument
572 avl_insert_here( avl_tree_t *tree, void *new_data, void *here, int direction) argument
632 avl_add(avl_tree_t *tree, void *new_node) argument
678 avl_remove(avl_tree_t *tree, void *data) argument
903 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *), size_t size, size_t offset) argument
926 avl_destroy(avl_tree_t *tree) argument
938 avl_numnodes(avl_tree_t *tree) argument
945 avl_is_empty(avl_tree_t *tree) argument
973 avl_destroy_nodes(avl_tree_t *tree, void **cookie) argument
[all...]
/illumos-gate/usr/src/lib/libshell/common/scripts/
H A Dcpvprint.sh59 # print tree
99 # tree variable
100 compound tree
111 \'tree\', \'alttree\',
136 read -C tree || fatal_error $"Read error."
142 read -u${fd} -C tree || fatal_error $"Read error."
153 'default' | 'tree')
154 print -v tree
157 print -C tree
160 # print variable tree (sam
[all...]
H A Dsvcproptree1.sh54 nameref tree=$1
76 [[ "${ typeset +p "tree[${servicename}].properties" ; }" == "" ]] && compound -A tree[${servicename}].properties
78 nameref node=tree[${servicename}].properties[${propname}]
112 [+NAME?svcproptree1 - SMF tree demo]
116 variable tree representation and outputs it in the format
117 specified by viewmode (either "list", "namelist", "tree" or "compacttree")..]
135 if [[ "${viewmode}" != ~(Elr)(list|namelist|tree|compacttree) ]] ; then
158 tree)
H A Dfiletree1.sh54 nameref tree=$1
62 typeset -C -A tree.files
63 typeset -C -A tree.dirs
71 typeset -C tree.dirs["${basename}"]
72 nameref node=tree.dirs["${basename}"]
77 typeset -C tree.files["${basename}"]
78 nameref node=tree.files["${basename}"]
137 (( ${#tree.files[@]} == 0 )) && unset tree.files
138 (( ${#tree
[all...]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c48 * 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...]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c53 * 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) argument
131 if (*tree != NULL) {
132 __m_decode_free(&(*tree)->sibling);
133 __m_decode_free(&(*tree)->child);
134 free(*tree);
135 *tree
143 __m_decode_init(t_decode **tree) argument
[all...]
/illumos-gate/usr/src/lib/libast/common/path/
H A Dpathexists.c43 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;
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dtree.c2 * tree - balanced binary tree library
9 * vix 02feb86 [added tree balancing from wirth "a+ds=p" p. 220-221]
37 /*#define DEBUG "tree"*/
47 #include <isc/tree.h>
86 static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)());
87 static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *);
88 static void del(tree **, int *, tree **, voi
[all...]
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree_rb.c119 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) argument
340 pNode = tree
647 memRbtreeCreateTable(Rbtree* tree, int* n) argument
671 memRbtreeDropTable(Rbtree* tree, int n) argument
717 memRbtreeCursor( Rbtree* tree, int iTable, int wrFlag, RbtCursor **ppCur ) argument
1029 memRbtreeClearTable(Rbtree* tree, int n) argument
1228 memRbtreeGetMeta(Rbtree* tree, int* aMeta) argument
1234 memRbtreeUpdateMeta(Rbtree* tree, int* aMeta) argument
1245 memRbtreeIntegrityCheck(Rbtree* tree, int* aRoot, int nRoot) argument
1258 memRbtreeSetCacheSize(Rbtree* tree, int sz) argument
1267 memRbtreeBeginTrans(Rbtree* tree) argument
1290 memRbtreeCommit(Rbtree* tree) argument
1304 memRbtreeClose(Rbtree* tree) argument
1364 memRbtreeRollback(Rbtree* tree) argument
1376 memRbtreeBeginCkpt(Rbtree* tree) argument
1387 memRbtreeCommitCkpt(Rbtree* tree) argument
1401 memRbtreeRollbackCkpt(Rbtree* tree) argument
1413 memRbtreePageDump(Rbtree* tree, int pgno, int rec) argument
1426 memRbtreePager(Rbtree* tree) argument
[all...]
/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
87 /* The static literal tree. Since the bit lengths are imposed, there is no
89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
94 /* The static distance tree. (Actually a trivial tree since all codes use
118 const ct_data *static_tree; /* static tree or NULL */
121 int elems; /* max number of elements in the tree */
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, in
490 ct_data *tree = desc->dyn_tree; local
619 ct_data *tree = desc->dyn_tree; local
[all...]
/illumos-gate/usr/src/tools/smatch/src/
H A Dexpression.c130 static struct token *parse_type(struct token *token, struct expression **tree) argument
133 *tree = alloc_expression(token->pos, EXPR_TYPE);
139 (*tree)->symbol = sym;
144 struct expression **tree)
165 *tree = expr;
170 struct expression **tree)
196 *tree = expr;
367 struct token *primary_expression(struct token *token, struct expression **tree) argument
469 *tree = expr;
492 static struct token *postfix_expression(struct token *token, struct expression **tree, struc argument
143 builtin_types_compatible_p_expr(struct token *token, struct expression **tree) argument
169 builtin_offsetof_expr(struct token *token, struct expression **tree) argument
570 type_info_expression(struct token *token, struct expression **tree, int type) argument
609 unary_expression(struct token *token, struct expression **tree) argument
698 cast_expression(struct token *token, struct expression **tree) argument
773 multiplicative_expression(struct token *token, struct expression **tree) argument
781 additive_expression(struct token *token, struct expression **tree) argument
789 shift_expression(struct token *token, struct expression **tree) argument
797 relational_expression(struct token *token, struct expression **tree) argument
806 equality_expression(struct token *token, struct expression **tree) argument
814 bitwise_and_expression(struct token *token, struct expression **tree) argument
822 bitwise_xor_expression(struct token *token, struct expression **tree) argument
830 bitwise_or_expression(struct token *token, struct expression **tree) argument
838 logical_and_expression(struct token *token, struct expression **tree) argument
846 logical_or_expression(struct token *token, struct expression **tree) argument
854 conditional_expression(struct token *token, struct expression **tree) argument
869 assignment_expression(struct token *token, struct expression **tree) argument
893 comma_expression(struct token *token, struct expression **tree) argument
901 parse_expression(struct token *token, struct expression **tree) argument
[all...]
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dzfs_rlock.c41 * AVL tree
43 * An AVL tree is used to maintain the state of the existing ranges
45 * The starting range offset is used for searching and sorting the tree.
50 * entry to rangelock_enter(), a locked_range_t is allocated; the tree
52 * tree.
143 avl_tree_t *tree = &rl->rl_tree; local
169 if (avl_numnodes(tree) == 0) {
170 avl_add(tree, new);
177 lr = avl_find(tree, new, &where);
181 lr = (locked_range_t *)avl_nearest(tree, wher
212 rangelock_proxify(avl_tree_t *tree, locked_range_t *lr) argument
244 rangelock_split(avl_tree_t *tree, locked_range_t *lr, uint64_t off) argument
273 rangelock_new_proxy(avl_tree_t *tree, uint64_t off, uint64_t len) argument
288 rangelock_add_reader(avl_tree_t *tree, locked_range_t *new, locked_range_t *prev, avl_index_t where) argument
380 avl_tree_t *tree = &rl->rl_tree; local
489 avl_tree_t *tree = &rl->rl_tree; local
[all...]
/illumos-gate/usr/src/uts/common/idmap/
H A Didmap_cache.c105 struct avl_tree tree; member in struct:sid_prefix_store
182 avl_create(&cache->sid2pid.tree, (avl_comp_fn)kidmap_compare_sid,
192 avl_create(&cache->uid2sid.tree, (avl_comp_fn)kidmap_compare_pid,
199 avl_create(&cache->gid2sid.tree, (avl_comp_fn)kidmap_compare_pid,
216 while ((sid2pid = avl_destroy_nodes(&cache->sid2pid.tree, &cookie))
220 avl_destroy(&cache->sid2pid.tree);
225 while ((pid2sid = avl_destroy_nodes(&cache->uid2sid.tree, &cookie))
229 avl_destroy(&cache->uid2sid.tree);
234 while ((pid2sid = avl_destroy_nodes(&cache->gid2sid.tree, &cookie))
238 avl_destroy(&cache->gid2sid.tree);
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Davl.c34 void *aw_buff; /* buffer to hold tree element */
66 * initialize a forward walk thru an avl tree.
69 * objects in the tree; either or both may be NULL (defaulting to first and
73 * "avl_tree_t" and "tree element" for use in error messages.
85 avl_tree_t *tree; local
91 element_name = "tree element";
101 tree = &aw->aw_tree;
102 if (mdb_vread(tree, sizeof (avl_tree_t), wsp->walk_addr) == -1) {
106 if (tree->avl_size < tree
[all...]
/illumos-gate/usr/src/lib/libprtdiag_psr/sparc/desktop/common/
H A Ddesktop.c91 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) argument
123 if (disp_fail_parts(tree)) {
134 display_memoryconf(Sys_tree *tree, struct grp_info *grps) argument
137 tree
151 disp_fail_parts(Sys_tree *tree) argument
258 display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats) argument
269 display_diaginfo(int flag, Prom_node *root, Sys_tree *tree, struct system_kstat_data *kstats) argument
322 read_platform_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat, struct bd_kstat_data *bdp, struct envctrl_kstat_data *ep) argument
340 dt_disp_asic_revs(Sys_tree *tree) argument
[all...]

Completed in 130 milliseconds

123456