Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 186) sorted by relevance

12345678

/illumos-gate/usr/src/uts/common/fs/smbsrv/
H A Dsmb_tree.c200 static void smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *);
308 smb_tree_disconnect(smb_tree_t *tree, boolean_t do_exec) in smb_tree_disconnect() argument
313 ASSERT(tree->t_magic == SMB_TREE_MAGIC); in smb_tree_disconnect()
315 mutex_enter(&tree->t_mutex); in smb_tree_disconnect()
316 ASSERT(tree->t_refcnt); in smb_tree_disconnect()
318 if (!smb_tree_is_connected_locked(tree)) { in smb_tree_disconnect()
319 mutex_exit(&tree->t_mutex); in smb_tree_disconnect()
326 tree->t_state = SMB_TREE_STATE_DISCONNECTING; in smb_tree_disconnect()
327 mutex_exit(&tree->t_mutex); in smb_tree_disconnect()
332 smb_ofile_close_all(tree, 0); in smb_tree_disconnect()
[all …]
H A Dsmb2_qinfo_fs.c99 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_volume() local
105 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_volume()
108 snode = tree->t_snode; in smb2_qfs_volume()
111 LabelLength = smb_wcequiv_strlen(tree->t_volume); in smb2_qfs_volume()
118 &tree->t_create_time, /* (T) */ in smb2_qfs_volume()
123 tree->t_volume); /* (U) */ in smb2_qfs_volume()
137 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_size() local
140 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_size()
166 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_fullsize() local
169 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_fullsize()
[all …]
H A Dsmb_session.c907 smb_tree_t *tree, in smb_session_cancel_requests() argument
918 (tree == NULL || sr->tid_tree == tree)) in smb_session_cancel_requests()
991 smb_tree_t *tree; in smb_session_lookup_tree() local
996 tree = smb_llist_head(&session->s_tree_list); in smb_session_lookup_tree()
998 while (tree) { in smb_session_lookup_tree()
999 ASSERT3U(tree->t_magic, ==, SMB_TREE_MAGIC); in smb_session_lookup_tree()
1000 ASSERT(tree->t_session == session); in smb_session_lookup_tree()
1002 if (tree->t_tid == tid) { in smb_session_lookup_tree()
1003 if (smb_tree_hold(tree)) { in smb_session_lookup_tree()
1005 return (tree); in smb_session_lookup_tree()
[all …]
H A Dsmb_fsinfo.c164 smb_tree_t *tree; in smb_com_trans2_query_fs_information() local
171 tree = sr->tid_tree; in smb_com_trans2_query_fs_information()
173 if (!STYPE_ISDSK(tree->t_res_type)) { in smb_com_trans2_query_fs_information()
182 snode = tree->t_snode; in smb_com_trans2_query_fs_information()
212 length = smb_wcequiv_strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
217 rc = smb_msgbuf_encode(&mb, "U", tree->t_volume); in smb_com_trans2_query_fs_information()
225 length = strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
227 fsid.val[0], length, tree->t_volume); in smb_com_trans2_query_fs_information()
238 length = smb_wcequiv_strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
241 length = strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
[all …]
H A Dsmb_tree_connect.c308 smb_tree_t *tree; in smb_com_tree_connect_andx() local
314 tree = smb_session_lookup_tree(sr->session, sr->smb_tid); in smb_com_tree_connect_andx()
315 if (tree != NULL) { in smb_com_tree_connect_andx()
316 smb_tree_disconnect(tree, B_TRUE); in smb_com_tree_connect_andx()
317 smb_session_cancel_requests(sr->session, tree, sr); in smb_com_tree_connect_andx()
318 smb_tree_release(tree); in smb_com_tree_connect_andx()
327 tree = sr->tid_tree; in smb_com_tree_connect_andx()
329 switch (tree->t_res_type & STYPE_MASK) { in smb_com_tree_connect_andx()
349 tree->t_typename); in smb_com_tree_connect_andx()
359 tree->t_typename); in smb_com_tree_connect_andx()
[all …]
H A Dsmb_ofile.c340 smb_tree_t *tree = sr->tid_tree; /* optional */ in smb_ofile_alloc() local
397 if (tree != NULL) { in smb_ofile_alloc()
398 smb_tree_hold_internal(tree); in smb_ofile_alloc()
399 of->f_tree = tree; in smb_ofile_alloc()
419 smb_tree_t *tree = sr->tid_tree; in smb_ofile_open() local
448 smb_lavl_enter(&tree->t_ofile_list, RW_WRITER); in smb_ofile_open()
449 smb_lavl_insert(&tree->t_ofile_list, of); in smb_ofile_open()
450 smb_lavl_exit(&tree->t_ofile_list); in smb_ofile_open()
451 atomic_inc_32(&tree->t_open_files); in smb_ofile_open()
687 smb_tree_t *tree, in smb_ofile_close_all() argument
[all …]
H A Dsmb2_tree_connect.c30 smb_tree_t *tree = NULL; in smb2_tree_connect() local
110 tree = sr->tid_tree; in smb2_tree_connect()
115 switch (tree->t_res_type & STYPE_MASK) { in smb2_tree_connect()
132 if (tree->t_encrypt != SMB_CONFIG_DISABLED) in smb2_tree_connect()
138 if ((tree->t_flags & SMB_TREE_DFSROOT) != 0) in smb2_tree_connect()
140 if ((tree->t_flags & SMB_TREE_CA) != 0) in smb2_tree_connect()
153 tree->t_access); /* l */ in smb2_tree_connect()
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dbtree.c87 zfs_btree_poison_node(zfs_btree_t *tree, zfs_btree_hdr_t *hdr) in zfs_btree_poison_node() argument
90 size_t size = tree->bt_elem_size; in zfs_btree_poison_node()
112 zfs_btree_poison_node_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr, in zfs_btree_poison_node_at() argument
116 size_t size = tree->bt_elem_size; in zfs_btree_poison_node_at()
128 ASSERT3U(idx, <=, tree->bt_leaf_cap); in zfs_btree_poison_node_at()
129 ASSERT3U(idx + count, <=, tree->bt_leaf_cap); in zfs_btree_poison_node_at()
138 zfs_btree_verify_poison_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr, in zfs_btree_verify_poison_at() argument
142 size_t size = tree->bt_elem_size; in zfs_btree_verify_poison_at()
151 ASSERT3U(idx, <, tree->bt_leaf_cap); in zfs_btree_verify_poison_at()
153 if (idx >= tree->bt_leaf_cap - hdr->bth_first) in zfs_btree_verify_poison_at()
[all …]
H A Dzfs_rlock.c143 avl_tree_t *tree = &rl->rl_tree; in rangelock_enter_writer() local
169 if (avl_numnodes(tree) == 0) { in rangelock_enter_writer()
170 avl_add(tree, new); in rangelock_enter_writer()
177 lr = avl_find(tree, new, &where); in rangelock_enter_writer()
181 lr = (locked_range_t *)avl_nearest(tree, where, AVL_AFTER); in rangelock_enter_writer()
186 lr = (locked_range_t *)avl_nearest(tree, where, AVL_BEFORE); in rangelock_enter_writer()
191 avl_insert(tree, new, where); in rangelock_enter_writer()
212 rangelock_proxify(avl_tree_t *tree, locked_range_t *lr) in rangelock_proxify() argument
222 avl_remove(tree, lr); in rangelock_proxify()
234 avl_add(tree, proxy); in rangelock_proxify()
[all …]
/illumos-gate/usr/src/lib/libprtdiag/common/
H A Ddisplay_sun4u.c58 display(Sys_tree *tree, in display() argument
72 exit_code = error_check(tree, kstats); in display()
99 display_memorysize(tree, kstats, &memory_total); in display()
105 display_cpu_devices(tree); in display()
108 display_memoryconf(tree); in display()
111 (void) display_io_devices(tree); in display()
118 display_hp_fail_fault(tree, kstats); in display()
121 root, tree, kstats); in display()
129 error_check(Sys_tree *tree, struct system_kstat_data *kstats) in error_check() argument
132 tree = tree; in error_check()
[all …]
/illumos-gate/usr/src/common/avl/
H A Davl.c121 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk() argument
123 size_t off = tree->avl_offset; in avl_walk()
168 avl_first(avl_tree_t *tree) in avl_first() argument
172 size_t off = tree->avl_offset; in avl_first()
174 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
187 avl_last(avl_tree_t *tree) in avl_last() argument
191 size_t off = tree->avl_offset; in avl_last()
193 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
211 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) in avl_nearest() argument
216 size_t off = tree->avl_offset; in avl_nearest()
[all …]
/illumos-gate/usr/src/uts/common/sys/
H A Davl.h158 extern void avl_create(avl_tree_t *tree,
170 extern void *avl_find(avl_tree_t *tree, const void *node, avl_index_t *where);
178 extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
191 extern void avl_insert_here(avl_tree_t *tree, void *new_data, void *here,
200 extern void *avl_first(avl_tree_t *tree);
201 extern void *avl_last(avl_tree_t *tree);
211 #define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER) argument
212 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) argument
237 extern void *avl_nearest(avl_tree_t *tree, avl_index_t where, int direction);
247 extern void avl_add(avl_tree_t *tree, void *node);
[all …]
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree_rb.c140 static int memRbtreeClearTable(Rbtree* tree, int n);
328 static void check_redblack_tree(BtRbTree * tree, char ** msg) in check_redblack_tree() argument
337 pNode = tree->pHead; in check_redblack_tree()
364 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
384 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
644 static int memRbtreeCreateTable(Rbtree* tree, int* n) in memRbtreeCreateTable() argument
646 assert( tree->eTransState != TRANS_NONE ); in memRbtreeCreateTable()
648 *n = tree->next_idx++; in memRbtreeCreateTable()
649 btreeCreateTable(tree, *n); in memRbtreeCreateTable()
654 if( tree->eTransState != TRANS_ROLLBACK ){ in memRbtreeCreateTable()
[all …]
/illumos-gate/usr/src/tools/smatch/src/
H A Dexpression.c136 static struct token *parse_type(struct token *token, struct expression **tree) in parse_type() argument
139 *tree = alloc_expression(token->pos, EXPR_TYPE); in parse_type()
145 (*tree)->symbol = sym; in parse_type()
150 struct expression **tree) in builtin_types_compatible_p_expr() argument
171 *tree = expr; in builtin_types_compatible_p_expr()
176 struct expression **tree) in builtin_offsetof_expr() argument
202 *tree = expr; in builtin_offsetof_expr()
373 struct token *primary_expression(struct token *token, struct expression **tree) in primary_expression() argument
475 *tree = expr; in primary_expression()
498 static struct token *postfix_expression(struct token *token, struct expression **tree, struct expre… in postfix_expression() argument
[all …]
/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c140 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, int max_code));
145 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
167 send_bits(s, tree[c].Code, tree[c].Len); }
430 #define pqremove(s, tree, top) \ argument
434 pqdownheap(s, tree, SMALLEST); \
441 #define smaller(tree, n, m, depth) \ argument
[all …]
/illumos-gate/usr/src/uts/common/idmap/
H A Didmap_cache.c104 struct avl_tree tree; member
195 avl_create(&sid2pid_hb->tree, kidmap_compare_sid, in kidmap_cache_create()
212 avl_create(&uid2sid_hb->tree, kidmap_compare_pid, in kidmap_cache_create()
226 avl_create(&gid2sid_hb->tree, kidmap_compare_pid, in kidmap_cache_create()
247 while ((sid2pid = avl_destroy_nodes(&sid2pid_hb->tree, in kidmap_cache_delete()
251 avl_destroy(&sid2pid_hb->tree); in kidmap_cache_delete()
260 while ((uid2sid = avl_destroy_nodes(&uid2sid_hb->tree, in kidmap_cache_delete()
264 avl_destroy(&uid2sid_hb->tree); in kidmap_cache_delete()
273 while ((gid2sid = avl_destroy_nodes(&gid2sid_hb->tree, in kidmap_cache_delete()
277 avl_destroy(&gid2sid_hb->tree); in kidmap_cache_delete()
[all …]
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dtree.c86 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 **, void (*)(), int *);
89 static void bal_L(tree **, int *);
90 static void bal_R(tree **, int *);
93 tree_init(tree **ppr_tree) { in tree_init()
100 tree_srch(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t), tree_t p_user) { in tree_srch()
127 tree_add(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t), in tree_add()
139 tree_delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t), in tree_delete()
150 tree_trav(tree **ppr_tree, int (*pfi_uar)(tree_t)) { in tree_trav()
[all …]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c124 __m_decode_free(tree) in __m_decode_free() argument
125 t_decode **tree; in __m_decode_free()
127 if (*tree != (t_decode *) 0) {
128 __m_decode_free(&(*tree)->sibling);
129 __m_decode_free(&(*tree)->child);
130 free(*tree);
131 *tree = (t_decode *) 0;
139 __m_decode_init(tree) in __m_decode_init() argument
140 t_decode **tree; in __m_decode_init()
145 *tree = (t_decode *) 0;
[all …]
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Davl.c85 avl_tree_t *tree; in avl_walk_init_range() local
101 tree = &aw->aw_tree; in avl_walk_init_range()
102 if (mdb_vread(tree, sizeof (avl_tree_t), wsp->walk_addr) == -1) { in avl_walk_init_range()
106 if (tree->avl_size < tree->avl_offset + sizeof (avl_node_t)) { in avl_walk_init_range()
108 wsp->walk_addr, tree->avl_size, tree->avl_offset); in avl_walk_init_range()
116 aw->aw_buff = mdb_zalloc(tree->avl_size, UM_SLEEP); in avl_walk_init_range()
117 aw->aw_end = (end == 0 ? 0 : end + tree->avl_offset); in avl_walk_init_range()
127 addr = (uintptr_t)tree->avl_root; in avl_walk_init_range()
132 addr = avl_leftmostchild(addr, aw->aw_buff, tree->avl_offset, in avl_walk_init_range()
133 tree->avl_size, aw->aw_elem_name); in avl_walk_init_range()
[all …]
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dtree.h47 tree; typedef
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 **, int (*)()));
55 void tree_mung __P((tree **, void (*)()));
/illumos-gate/usr/src/lib/libidmap/common/
H A Didmap_cache.c136 avl_tree_t tree; member
148 avl_tree_t tree; member
160 avl_tree_t tree; member
293 avl_create(&idmap_cache.sid2uid_gid.tree, in idmap_cache_create()
305 avl_create(&idmap_cache.uid2sid_winname.tree, in idmap_cache_create()
318 avl_create(&idmap_cache.gid2sid_winname.tree, in idmap_cache_create()
331 avl_create(&idmap_cache.winname2uid_gid.tree, in idmap_cache_create()
358 &idmap_cache.sid2uid_gid.tree, &cookie)) != NULL) { in idmap_cache_purge()
362 avl_destroy(&idmap_cache.sid2uid_gid.tree); in idmap_cache_purge()
363 avl_create(&idmap_cache.sid2uid_gid.tree, in idmap_cache_purge()
[all …]
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c127 __m_decode_free(t_decode **tree) in __m_decode_free() argument
129 if (*tree != NULL) { in __m_decode_free()
130 __m_decode_free(&(*tree)->sibling); in __m_decode_free()
131 __m_decode_free(&(*tree)->child); in __m_decode_free()
132 free(*tree); in __m_decode_free()
133 *tree = NULL; in __m_decode_free()
141 __m_decode_init(t_decode **tree) in __m_decode_init() argument
146 *tree = NULL; in __m_decode_init()
149 len = decode_add(tree, cur_term->_str[**p], (*p)[1]); in __m_decode_init()
/illumos-gate/usr/src/contrib/ast/src/lib/libast/cdt/
H A Ddttree.c43 Dttree_t *tree = (Dttree_t*)dt->data; in dttreeprint() local
45 if(!here && !(here = tree->root) ) in dttreeprint()
96 Dttree_t *tree = (Dttree_t*)dt->data; local
98 if(!(root = tree->root) )
109 tree->root = root;
124 Dttree_t *tree = (Dttree_t*)dt->data; local
126 root = tree->root;
127 tree->root = NIL(Dtlink_t*);
128 tree->data.size = 0;
153 Dttree_t *tree = (Dttree_t*)dt->data; local
[all …]
/illumos-gate/usr/src/lib/libprtdiag_psr/sparc/desktop/common/
H A Ddesktop.c90 int error_check(Sys_tree *tree, struct system_kstat_data *kstats);
91 int disp_fail_parts(Sys_tree *tree);
92 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);
93 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,
106 error_check(Sys_tree *tree, struct system_kstat_data *kstats) in error_check() argument
118 if (disp_fail_parts(tree)) { in error_check()
137 disp_fail_parts(Sys_tree *tree) in disp_fail_parts() argument
141 Board_node *bnode = tree->bd_list; in disp_fail_parts()
244 display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats) in display_hp_fail_fault() argument
251 (void) disp_fail_parts(tree); in display_hp_fail_fault()
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/path/
H A Dpathexists.c43 struct Tree_s* tree; member
62 static Tree_t tree; in pathexists() local
64 t = &tree; in pathexists()
75 for (t = p->tree; t && (*cmp)(s, t->name); t = t->next); in pathexists()
84 t->next = p->tree; in pathexists()
85 p->tree = t; in pathexists()
110 p->next = t->tree; in pathexists()
111 t->tree = p; in pathexists()

12345678