Home
last modified time | relevance | path

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

12345678

/titanic_41/usr/src/uts/common/fs/smbsrv/
H A Dsmb_tree.c193 static void smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *);
199 smb_tree_t *tree; in smb_tree_connect() local
207 tree = smb_tree_connect_core(sr); in smb_tree_connect()
209 return (tree); in smb_tree_connect()
228 smb_tree_t *tree = NULL; in smb_tree_connect_core() local
258 tree = smb_tree_connect_disk(sr, name); in smb_tree_connect_core()
261 tree = smb_tree_connect_ipc(sr, name); in smb_tree_connect_core()
264 tree = smb_tree_connect_printq(sr, name); in smb_tree_connect_core()
273 return (tree); in smb_tree_connect_core()
280 smb_tree_disconnect(smb_tree_t *tree, boolean_t do_exec) in smb_tree_disconnect() argument
[all …]
H A Dsmb_session.c776 smb_tree_t *tree, in smb_session_cancel_requests() argument
787 (tree == NULL || sr->tid_tree == tree)) in smb_session_cancel_requests()
938 smb_tree_t *tree; in smb_session_lookup_tree() local
943 tree = smb_llist_head(&session->s_tree_list); in smb_session_lookup_tree()
945 while (tree) { in smb_session_lookup_tree()
946 ASSERT3U(tree->t_magic, ==, SMB_TREE_MAGIC); in smb_session_lookup_tree()
947 ASSERT(tree->t_session == session); in smb_session_lookup_tree()
949 if (tree->t_tid == tid) { in smb_session_lookup_tree()
950 if (smb_tree_hold(tree)) { in smb_session_lookup_tree()
952 return (tree); in smb_session_lookup_tree()
[all …]
H A Dsmb_ofile.c185 smb_tree_t *tree = sr->tid_tree; in smb_ofile_open() local
193 if (smb_idpool_alloc(&tree->t_fid_pool, &fid)) { in smb_ofile_open()
216 of->f_server = tree->t_server; in smb_ofile_open()
217 of->f_session = tree->t_session; in smb_ofile_open()
224 of->f_tree = tree; in smb_ofile_open()
270 if (tree->t_flags & SMB_TREE_READONLY) in smb_ofile_open()
287 smb_llist_enter(&tree->t_ofile_list, RW_WRITER); in smb_ofile_open()
288 smb_llist_insert_tail(&tree->t_ofile_list, of); in smb_ofile_open()
289 smb_llist_exit(&tree->t_ofile_list); in smb_ofile_open()
290 atomic_inc_32(&tree->t_open_files); in smb_ofile_open()
[all …]
H A Dsmb_fsinfo.c195 smb_tree_t *tree; in smb_com_trans2_query_fs_information() local
202 tree = sr->tid_tree; in smb_com_trans2_query_fs_information()
204 if (!STYPE_ISDSK(tree->t_res_type)) { in smb_com_trans2_query_fs_information()
213 snode = tree->t_snode; in smb_com_trans2_query_fs_information()
243 length = smb_wcequiv_strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
248 rc = smb_msgbuf_encode(&mb, "U", tree->t_volume); in smb_com_trans2_query_fs_information()
256 length = strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
258 fsid.val[0], length, tree->t_volume); in smb_com_trans2_query_fs_information()
269 length = smb_wcequiv_strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
272 length = strlen(tree->t_volume); in smb_com_trans2_query_fs_information()
[all …]
H A Dsmb_tree_connect.c91 smb_tree_t *tree; in smb_com_tree_connect() local
94 if ((tree = smb_tree_connect(sr)) == NULL) in smb_com_tree_connect()
97 sr->smb_tid = tree->t_tid; in smb_com_tree_connect()
98 sr->tid_tree = tree; in smb_com_tree_connect()
283 smb_tree_t *tree; in smb_com_tree_connect_andx() local
287 if ((tree = smb_tree_connect(sr)) == NULL) in smb_com_tree_connect_andx()
290 sr->smb_tid = tree->t_tid; in smb_com_tree_connect_andx()
291 sr->tid_tree = tree; in smb_com_tree_connect_andx()
293 switch (tree->t_res_type & STYPE_MASK) { in smb_com_tree_connect_andx()
/titanic_41/usr/src/lib/libprtdiag/common/
H A Ddisplay_sun4u.c57 display(Sys_tree *tree, in display() argument
72 exit_code = error_check(tree, kstats); in display()
99 display_memorysize(tree, kstats, &grps, &memory_total); in display()
105 display_cpu_devices(tree); in display()
108 display_memoryconf(tree, &grps); 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 …]
/titanic_41/usr/src/common/avl/
H A Davl.c135 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk() argument
137 size_t off = tree->avl_offset; in avl_walk()
182 avl_first(avl_tree_t *tree) in avl_first() argument
186 size_t off = tree->avl_offset; in avl_first()
188 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
201 avl_last(avl_tree_t *tree) in avl_last() argument
205 size_t off = tree->avl_offset; in avl_last()
207 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
225 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) in avl_nearest() argument
230 size_t off = tree->avl_offset; in avl_nearest()
[all …]
/titanic_41/usr/src/uts/common/sys/
H A Davl.h151 extern void avl_create(avl_tree_t *tree,
163 extern void *avl_find(avl_tree_t *tree, const void *node, avl_index_t *where);
171 extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
184 extern void avl_insert_here(avl_tree_t *tree, void *new_data, void *here,
193 extern void *avl_first(avl_tree_t *tree);
194 extern void *avl_last(avl_tree_t *tree);
204 #define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER) argument
205 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) argument
230 extern void *avl_nearest(avl_tree_t *tree, avl_index_t where, int direction);
240 extern void avl_add(avl_tree_t *tree, void *node);
[all …]
/titanic_41/usr/src/lib/libprtdiag_psr/sparc/starfire/common/
H A Dstarfire.c63 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) in error_check() argument
81 tree = tree; in error_check()
88 display_memoryconf(Sys_tree *tree, struct grp_info *grps) in display_memoryconf() argument
113 bnode = tree->bd_list; in display_memoryconf()
144 display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats) in display_hp_fail_fault() argument
147 tree = tree; in display_hp_fail_fault()
[all …]
/titanic_41/usr/src/lib/libsqlite/src/
H A Dbtree_rb.c143 static int memRbtreeClearTable(Rbtree* tree, int n);
331 static void check_redblack_tree(BtRbTree * tree, char ** msg) in check_redblack_tree() argument
340 pNode = tree->pHead; in check_redblack_tree()
367 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
387 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()
647 static int memRbtreeCreateTable(Rbtree* tree, int* n) in memRbtreeCreateTable() argument
649 assert( tree->eTransState != TRANS_NONE ); in memRbtreeCreateTable()
651 *n = tree->next_idx++; in memRbtreeCreateTable()
652 btreeCreateTable(tree, *n); in memRbtreeCreateTable()
657 if( tree->eTransState != TRANS_ROLLBACK ){ in memRbtreeCreateTable()
[all …]
/titanic_41/usr/src/uts/common/fs/zfs/
H A Dzfs_rlock.c106 avl_tree_t *tree = &zp->z_range_avl; in zfs_range_lock_writer() local
149 if (avl_numnodes(tree) == 0) { in zfs_range_lock_writer()
151 avl_add(tree, new); in zfs_range_lock_writer()
158 rl = avl_find(tree, new, &where); in zfs_range_lock_writer()
162 rl = (rl_t *)avl_nearest(tree, where, AVL_AFTER); in zfs_range_lock_writer()
166 rl = (rl_t *)avl_nearest(tree, where, AVL_BEFORE); in zfs_range_lock_writer()
171 avl_insert(tree, new, where); in zfs_range_lock_writer()
191 zfs_range_proxify(avl_tree_t *tree, rl_t *rl) in zfs_range_proxify() argument
201 avl_remove(tree, rl); in zfs_range_proxify()
213 avl_add(tree, proxy); in zfs_range_proxify()
[all …]
/titanic_41/usr/src/uts/common/zmod/
H A Dtrees.c144 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));
149 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
167 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
171 # define send_code(s, c, tree) \ argument
173 send_bits(s, tree[c].Code, tree[c].Len); }
434 #define pqremove(s, tree, top) \ argument
438 pqdownheap(s, tree, SMALLEST); \
445 #define smaller(tree, n, m, depth) \ argument
[all …]
/titanic_41/usr/src/lib/libresolv2/common/isc/
H A Dtree.c90 static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)());
91 static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *);
92 static void del(tree **, int *, tree **, void (*)(), int *);
93 static void bal_L(tree **, int *);
94 static void bal_R(tree **, int *);
97 tree_init(tree **ppr_tree) { in tree_init()
104 tree_srch(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t), tree_t p_user) { in tree_srch()
131 tree_add(tree **ppr_tree, int (*pfi_compare)(tree_t, tree_t), in tree_add()
143 tree_delete(tree **ppr_p, int (*pfi_compare)(tree_t, tree_t), in tree_delete()
154 tree_trav(tree **ppr_tree, int (*pfi_uar)(tree_t)) { in tree_trav()
[all …]
/titanic_41/usr/src/uts/common/idmap/
H A Didmap_cache.c105 struct avl_tree tree; member
182 avl_create(&cache->sid2pid.tree, (avl_comp_fn)kidmap_compare_sid, in kidmap_cache_create()
192 avl_create(&cache->uid2sid.tree, (avl_comp_fn)kidmap_compare_pid, in kidmap_cache_create()
199 avl_create(&cache->gid2sid.tree, (avl_comp_fn)kidmap_compare_pid, in kidmap_cache_create()
216 while ((sid2pid = avl_destroy_nodes(&cache->sid2pid.tree, &cookie)) in kidmap_cache_delete()
220 avl_destroy(&cache->sid2pid.tree); in kidmap_cache_delete()
225 while ((pid2sid = avl_destroy_nodes(&cache->uid2sid.tree, &cookie)) in kidmap_cache_delete()
229 avl_destroy(&cache->uid2sid.tree); in kidmap_cache_delete()
234 while ((pid2sid = avl_destroy_nodes(&cache->gid2sid.tree, &cookie)) in kidmap_cache_delete()
238 avl_destroy(&cache->gid2sid.tree); in kidmap_cache_delete()
[all …]
/titanic_41/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dkeypad.c126 __m_decode_free(tree) in __m_decode_free() argument
127 t_decode **tree; in __m_decode_free()
129 if (*tree != (t_decode *) 0) {
130 __m_decode_free(&(*tree)->sibling);
131 __m_decode_free(&(*tree)->child);
132 free(*tree);
133 *tree = (t_decode *) 0;
141 __m_decode_init(tree) in __m_decode_init() argument
142 t_decode **tree; in __m_decode_init()
147 *tree = (t_decode *) 0;
[all …]
/titanic_41/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) in error_check() argument
123 if (disp_fail_parts(tree)) { in error_check()
134 display_memoryconf(Sys_tree *tree, struct grp_info *grps) in display_memoryconf() argument
137 tree = tree; in display_memoryconf()
[all …]
/titanic_41/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 (*)()));
/titanic_41/usr/src/lib/libshell/common/scripts/
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}"]
146 nameref tree=$1
149 do_directory tree "${basedir}"
197 if [[ "${viewmode}" != ~(Elr)(list|namelist|tree|compacttree) ]] ; then
[all …]
H A Dcpvprint.sh100 compound tree
136 read -C tree || fatal_error $"Read error."
142 read -u${fd} -C tree || fatal_error $"Read error."
154 print -v tree
157 print -C tree
161 prettyprint_compoundvar tree
H A Dsvcproptree1.sh54 nameref tree=$1
76 …[[ "${ typeset +p "tree[${servicename}].properties" ; }" == "" ]] && compound -A tree[${servicenam…
78 nameref node=tree[${servicename}].properties[${propname}]
135 if [[ "${viewmode}" != ~(Elr)(list|namelist|tree|compacttree) ]] ; then
158 tree)
/titanic_41/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 == NULL ? NULL : 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 …]
/titanic_41/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dkeypad.c129 __m_decode_free(t_decode **tree) in __m_decode_free() argument
131 if (*tree != NULL) { in __m_decode_free()
132 __m_decode_free(&(*tree)->sibling); in __m_decode_free()
133 __m_decode_free(&(*tree)->child); in __m_decode_free()
134 free(*tree); in __m_decode_free()
135 *tree = NULL; in __m_decode_free()
143 __m_decode_init(t_decode **tree) in __m_decode_init() argument
148 *tree = NULL; in __m_decode_init()
151 len = decode_add(tree, cur_term->_str[**p], (*p)[1]); in __m_decode_init()
/titanic_41/usr/src/lib/libidmap/common/
H A Didmap_cache.c132 avl_tree_t tree; member
144 avl_tree_t tree; member
156 avl_tree_t tree; member
289 avl_create(&idmap_cache.sid2uid_gid.tree, in idmap_cache_create()
301 avl_create(&idmap_cache.uid2sid_winname.tree, in idmap_cache_create()
314 avl_create(&idmap_cache.gid2sid_winname.tree, in idmap_cache_create()
327 avl_create(&idmap_cache.winname2uid_gid.tree, in idmap_cache_create()
354 &idmap_cache.sid2uid_gid.tree, &cookie)) != NULL) { in idmap_cache_purge()
358 avl_destroy(&idmap_cache.sid2uid_gid.tree); in idmap_cache_purge()
359 avl_create(&idmap_cache.sid2uid_gid.tree, in idmap_cache_purge()
[all …]
/titanic_41/usr/src/lib/libast/common/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()
/titanic_41/usr/src/lib/libprtdiag_psr/sparc/tazmo/common/
H A Dtazmo.c71 int error_check(Sys_tree *tree, struct system_kstat_data *kstats);
72 void display_memoryconf(Sys_tree *tree, struct grp_info *grps);
73 int disp_fail_parts(Sys_tree *tree);
74 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats);
75 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree,
81 void read_platform_kstats(Sys_tree *tree,
96 error_check(Sys_tree *tree, struct system_kstat_data *kstats) in error_check() argument
107 if (disp_fail_parts(tree) || disp_envctrl_status(tree, kstats)) { in error_check()
137 display_memoryconf(Sys_tree *tree, struct grp_info *grps) in display_memoryconf() argument
162 bnode = tree->bd_list; in display_memoryconf()
[all …]

12345678