Home
last modified time | relevance | path

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

123456789

/titanic_51/usr/src/uts/common/fs/smbsrv/
H A Dsmb_tree.c93 * - The tree is queued in the list of trees of its user.
94 * - References will be given out if the tree is looked up.
95 * - Files under that tree can be accessed.
100 * - The tree is queued in the list of trees of its user.
101 * - References will not be given out if the tree is looked up.
102 * - The files and directories open under the tree are being closed.
103 * - The resources associated with the tree remain.
108 * - The tree is queued in the list of trees of its user.
109 * - References will not be given out if the tree is looked up.
110 * - The tree ha
279 smb_tree_disconnect(smb_tree_t * tree,boolean_t do_exec) smb_tree_disconnect() argument
326 smb_tree_hold(smb_tree_t * tree) smb_tree_hold() argument
352 smb_tree_hold_internal(smb_tree_t * tree) smb_tree_hold_internal() argument
369 smb_tree_release(smb_tree_t * tree) smb_tree_release() argument
388 smb_tree_post_ofile(smb_tree_t * tree,smb_ofile_t * of) smb_tree_post_ofile() argument
400 smb_tree_post_odir(smb_tree_t * tree,smb_odir_t * od) smb_tree_post_odir() argument
416 smb_tree_close_pid(smb_tree_t * tree,uint32_t pid) smb_tree_close_pid() argument
430 smb_tree_has_feature(smb_tree_t * tree,uint32_t flags) smb_tree_has_feature() argument
445 smb_tree_enum(smb_tree_t * tree,smb_svcenum_t * svcenum) smb_tree_enum() argument
479 smb_tree_fclose(smb_tree_t * tree,uint32_t uniqid) smb_tree_fclose() argument
655 smb_tree_t *tree; smb_tree_connect_disk() local
773 smb_tree_t *tree; smb_tree_connect_printq() local
842 smb_tree_t *tree; smb_tree_connect_ipc() local
881 smb_tree_t *tree; smb_tree_alloc() local
970 smb_tree_t *tree = (smb_tree_t *)arg; smb_tree_dealloc() local
1008 smb_tree_is_connected_locked(smb_tree_t * tree) smb_tree_is_connected_locked() argument
1032 smb_tree_is_disconnected(smb_tree_t * tree) smb_tree_is_disconnected() argument
1085 smb_tree_getattr(const smb_kshare_t * si,smb_node_t * node,smb_tree_t * tree) smb_tree_getattr() argument
1105 smb_tree_get_volname(vfs_t * vfsp,smb_tree_t * tree) smb_tree_get_volname() argument
1137 smb_tree_get_flags(const smb_kshare_t * si,vfs_t * vfsp,smb_tree_t * tree) smb_tree_get_flags() argument
1278 smb_tree_t *tree = sr->tid_tree; smb_tree_lookup_odir() local
1311 smb_tree_is_connected(smb_tree_t * tree) smb_tree_is_connected() argument
1331 smb_tree_get_ofile(smb_tree_t * tree,smb_ofile_t * of) smb_tree_get_ofile() argument
1369 smb_tree_get_odir(smb_tree_t * tree,smb_odir_t * od) smb_tree_get_odir() argument
1406 smb_tree_close_odirs(smb_tree_t * tree,uint16_t pid) smb_tree_close_odirs() argument
1428 smb_tree_set_execinfo(smb_tree_t * tree,smb_shr_execinfo_t * exec,int exec_type) smb_tree_set_execinfo() argument
1445 smb_tree_enum_private(smb_tree_t * tree,smb_svcenum_t * svcenum) smb_tree_enum_private() argument
1477 smb_tree_netinfo_encode(smb_tree_t * tree,uint8_t * buf,size_t buflen,uint32_t * nbytes) smb_tree_netinfo_encode() argument
1491 smb_tree_netinfo_username(smb_tree_t * tree,char ** namestr,uint32_t * namelen) smb_tree_netinfo_username() argument
1516 smb_tree_netinfo_init(smb_tree_t * tree,smb_netconnectinfo_t * info) smb_tree_netinfo_init() argument
[all...]
H A Dsmb_session.c865 * Cancel requests. If a non-null tree is specified, only requests specific
866 * to that tree will be cancelled. If a non-null sr is specified, that sr
872 smb_tree_t *tree, in smb_session_cancel_requests() argument
883 (tree == NULL || sr->tid_tree == tree)) in smb_session_cancel_requests()
943 * Find a tree by tree-id.
951 smb_tree_t *tree; in smb_session_lookup_tree() local
956 tree = smb_llist_head(&session->s_tree_list); in smb_session_lookup_tree()
958 while (tree) { in smb_session_lookup_tree()
989 smb_session_lookup_share(smb_session_t * session,const char * sharename,smb_tree_t * tree) smb_session_lookup_share() argument
1030 smb_session_lookup_volume(smb_session_t * session,const char * name,smb_tree_t * tree) smb_session_lookup_volume() argument
1071 smb_tree_t *tree; smb_session_close_pid() local
1090 smb_tree_t *tree = (smb_tree_t *)t; smb_session_tree_dtor() local
1106 smb_tree_t *tree; smb_session_disconnect_owned_trees() local
1140 smb_tree_t *tree; smb_session_disconnect_trees() local
1162 smb_tree_t *tree; smb_session_disconnect_share() local
1180 smb_session_post_tree(smb_session_t * session,smb_tree_t * tree) smb_session_post_tree() argument
1204 smb_session_get_tree(smb_session_t * session,smb_tree_t * tree) smb_session_get_tree() argument
[all...]
H A Dsmb2_qinfo_fs.c89 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_volume() local
94 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_volume()
97 snode = tree->t_snode; in smb2_qfs_volume()
100 LabelLength = smb_wcequiv_strlen(tree->t_volume); in smb2_qfs_volume()
112 tree->t_volume); /* (U) */ in smb2_qfs_volume()
124 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_size() local
127 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_size()
151 smb_tree_t *tree = sr->tid_tree; in smb2_qfs_fullsize() local
154 if (!STYPE_ISDSK(tree->t_res_type)) in smb2_qfs_fullsize()
178 smb_tree_t *tree in smb2_qfs_device() local
202 smb_tree_t *tree = sr->tid_tree; smb2_qfs_attr() local
256 smb_tree_t *tree = sr->tid_tree; smb2_qfs_control() local
[all...]
H A Dsmb_ofile.c92 * - The ofile is queued in the list of ofiles of its tree.
98 * - The ofile is queued in the list of ofiles of its tree.
106 * - The ofile is queued in the list of ofiles of its tree.
113 * added to the list of ofiles of a tree.
130 * - The list of ofiles of the tree it belongs to.
135 * and there's a lock embedded in the list of ofiles of a tree. To
137 * To insert the ofile into the list of ofiles of the tree and to remove
159 * 2) The ofile is queued in the list of ofiles of its tree. The fact of
185 smb_tree_t *tree = sr->tid_tree; in smb_ofile_open() local
193 if (smb_idpool_alloc(&tree in smb_ofile_open()
452 smb_ofile_close_all(smb_tree_t * tree) smb_ofile_close_all() argument
476 smb_ofile_close_all_by_pid(smb_tree_t * tree,uint16_t pid) smb_ofile_close_all_by_pid() argument
634 smb_tree_t *tree = sr->tid_tree; smb_ofile_lookup_by_fid() local
683 smb_ofile_lookup_by_uniqid(smb_tree_t * tree,uint32_t uniqid) smb_ofile_lookup_by_uniqid() argument
888 smb_tree_t *tree; smb_ofile_close_and_next() local
934 smb_tree_t *tree; smb_ofile_delete() local
1220 smb_tree_t *tree; smb_ofile_netinfo_init() local
[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 in smb_com_trans2_query_fs_information()
447 smb_tree_t *tree; smb_com_trans2_set_fs_information() local
[all...]
/titanic_51/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 in error_check()
142 disp_fail_parts(Sys_tree * tree) disp_fail_parts() argument
155 display_hp_fail_fault(Sys_tree * tree,struct system_kstat_data * kstats) display_hp_fail_fault() argument
167 display_diaginfo(int flag,Prom_node * root,Sys_tree * tree,struct system_kstat_data * kstats) display_diaginfo() argument
183 resolve_board_types(Sys_tree * tree) resolve_board_types() argument
[all...]
/titanic_51/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) avl_walk() argument
183 avl_first(avl_tree_t * tree) avl_first() argument
202 avl_last(avl_tree_t * tree) avl_last() argument
226 avl_nearest(avl_tree_t * tree,avl_index_t where,int direction) avl_nearest() argument
255 avl_find(avl_tree_t * tree,const void * value,avl_index_t * where) avl_find() argument
303 avl_rotation(avl_tree_t * tree,avl_node_t * node,int balance) avl_rotation() argument
482 avl_insert(avl_tree_t * tree,void * new_data,avl_index_t where) avl_insert() argument
573 avl_insert_here(avl_tree_t * tree,void * new_data,void * here,int direction) avl_insert_here() argument
632 avl_add(avl_tree_t * tree,void * new_node) avl_add() argument
678 avl_remove(avl_tree_t * tree,void * data) avl_remove() argument
823 AVL_REINSERT(tree,obj) global() argument
903 avl_create(avl_tree_t * tree,int (* compar)(const void *,const void *),size_t size,size_t offset) avl_create() argument
926 avl_destroy(avl_tree_t * tree) avl_destroy() argument
938 avl_numnodes(avl_tree_t * tree) avl_numnodes() argument
945 avl_is_empty(avl_tree_t * tree) avl_is_empty() argument
973 avl_destroy_nodes(avl_tree_t * tree,void ** cookie) avl_destroy_nodes() argument
[all...]
/titanic_51/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.
105 * Type used for the root of the AVL tree.
110 * The data nodes in the AVL tree must have a field of this type.
115 * An opaque type used to locate a position in the tree where a node
143 * Initialize an AVL tree. Arguments are:
145 * tree
204 AVL_NEXT(tree,node) global() argument
205 AVL_PREV(tree,node) global() argument
[all...]
/titanic_51/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, struc argument
153 display_diaginfo(int flag,Prom_node * root,Sys_tree * tree,struct system_kstat_data * kstats) display_diaginfo() argument
[all...]
/titanic_51/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) in check_redblack_tree() argument
340 pNode = tree in check_redblack_tree()
647 memRbtreeCreateTable(Rbtree * tree,int * n) memRbtreeCreateTable() argument
671 memRbtreeDropTable(Rbtree * tree,int n) memRbtreeDropTable() argument
718 memRbtreeCursor(Rbtree * tree,int iTable,int wrFlag,RbtCursor ** ppCur) memRbtreeCursor() argument
1029 memRbtreeClearTable(Rbtree * tree,int n) memRbtreeClearTable() argument
1228 memRbtreeGetMeta(Rbtree * tree,int * aMeta) memRbtreeGetMeta() argument
1234 memRbtreeUpdateMeta(Rbtree * tree,int * aMeta) memRbtreeUpdateMeta() argument
1245 memRbtreeIntegrityCheck(Rbtree * tree,int * aRoot,int nRoot) memRbtreeIntegrityCheck() argument
1258 memRbtreeSetCacheSize(Rbtree * tree,int sz) memRbtreeSetCacheSize() argument
1267 memRbtreeBeginTrans(Rbtree * tree) memRbtreeBeginTrans() argument
1290 memRbtreeCommit(Rbtree * tree) memRbtreeCommit() argument
1304 memRbtreeClose(Rbtree * tree) memRbtreeClose() argument
1364 memRbtreeRollback(Rbtree * tree) memRbtreeRollback() argument
1376 memRbtreeBeginCkpt(Rbtree * tree) memRbtreeBeginCkpt() argument
1387 memRbtreeCommitCkpt(Rbtree * tree) memRbtreeCommitCkpt() argument
1401 memRbtreeRollbackCkpt(Rbtree * tree) memRbtreeRollbackCkpt() argument
1413 memRbtreePageDump(Rbtree * tree,int pgno,int rec) memRbtreePageDump() argument
1426 memRbtreePager(Rbtree * tree) memRbtreePager() argument
[all...]
/titanic_51/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 * locks. On entry to zfs_lock_range() a rl_t is allocated; the tree
51 * searched that finds no overlap, and *this* rl_t is placed in the tree.
106 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, wher in zfs_range_lock_writer()
191 zfs_range_proxify(avl_tree_t * tree,rl_t * rl) zfs_range_proxify() argument
223 zfs_range_split(avl_tree_t * tree,rl_t * rl,uint64_t off) zfs_range_split() argument
254 zfs_range_new_proxy(avl_tree_t * tree,uint64_t off,uint64_t len) zfs_range_new_proxy() argument
271 zfs_range_add_reader(avl_tree_t * tree,rl_t * new,rl_t * prev,avl_index_t where) zfs_range_add_reader() argument
358 avl_tree_t *tree = &zp->z_range_avl; zfs_range_lock_reader() local
465 avl_tree_t *tree = &zp->z_range_avl; zfs_range_unlock_reader() local
[all...]
/titanic_51/usr/src/lib/libresolv2/common/isc/
H A Dtree.c2 static const char rcsid[] = "$Id: tree.c,v 1.4 2005/04/27 04:56:39 sra Exp $";
6 * tree - balanced binary tree library
13 * vix 02feb86 [added tree balancing from wirth "a+ds=p" p. 220-221]
41 /*#define DEBUG "tree"*/
51 #include <isc/tree.h>
90 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 **, in
[all...]
/titanic_51/usr/src/boot/lib/libz/
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
163 send_code(s,c,tree) global() argument
167 send_code(s,c,tree) global() argument
432 pqremove(s,tree,top) global() argument
443 smaller(tree,n,m,depth) global() argument
453 pqdownheap(s,tree,k) pqdownheap() argument
492 ct_data *tree = desc->dyn_tree; global() local
575 gen_codes(tree,max_code,bl_count) gen_codes() argument
621 ct_data *tree = desc->dyn_tree; global() local
705 scan_tree(s,tree,max_code) scan_tree() argument
750 send_tree(s,tree,max_code) send_tree() argument
[all...]
/titanic_51/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
161 send_code(s,c,tree) global() argument
165 send_code(s,c,tree) global() argument
430 pqremove(s,tree,top) global() argument
441 smaller(tree,n,m,depth) global() argument
451 pqdownheap(s,tree,k) pqdownheap() argument
490 ct_data *tree = desc->dyn_tree; global() local
572 gen_codes(tree,max_code,bl_count) gen_codes() argument
619 ct_data *tree = desc->dyn_tree; global() local
703 scan_tree(s,tree,max_code) scan_tree() argument
748 send_tree(s,tree,max_code) send_tree() argument
[all...]
/titanic_51/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_51/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) 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);
141 __m_decode_init(tree) __m_decode_init() argument
[all...]
/titanic_51/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 in display_memoryconf()
151 disp_fail_parts(Sys_tree * tree) disp_fail_parts() argument
258 display_hp_fail_fault(Sys_tree * tree,struct system_kstat_data * kstats) display_hp_fail_fault() argument
269 display_diaginfo(int flag,Prom_node * root,Sys_tree * tree,struct system_kstat_data * kstats) display_diaginfo() argument
322 read_platform_kstats(Sys_tree * tree,struct system_kstat_data * sys_kstat,struct bd_kstat_data * bdp,struct envctrl_kstat_data * ep) read_platform_kstats() argument
340 dt_disp_asic_revs(Sys_tree * tree) dt_disp_asic_revs() argument
[all...]
/titanic_51/usr/src/lib/libresolv2/include/isc/
H A Dtree.h1 /* 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
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...]
/titanic_51/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
/titanic_51/usr/src/cmd/ast/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}"]
137 (( ${#tree.files[@]} == 0 )) && unset tree.files
138 (( ${#tree
[all...]
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...]
/titanic_51/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; in avl_walk_init_range() local
91 element_name = "tree element"; in avl_walk_init_range()
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 in avl_walk_init_range()
[all...]
/titanic_51/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. */ in decode_add()
83 /* Find node to insert function key sequence into the tree. */ in decode_add()
107 /* Insert string into the tree; node->child == null. */ in decode_add()
129 __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 in __m_decode_free()
143 __m_decode_init(t_decode ** tree) __m_decode_init() argument
[all...]
/titanic_51/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...]

123456789