/illumos-gate/usr/src/cmd/ipf/examples/ |
H A D | pool.conf | 5 table role = ipf type = tree number = 0
|
/illumos-gate/usr/src/uts/common/sys/ |
H A D | avl.h | 48 * 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 [all...] |
/illumos-gate/usr/src/lib/libprtdiag/common/ |
H A D | display_sun4u.c | 57 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 D | smb_tree.c | 93 * - 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) argument 325 smb_tree_hold( smb_tree_t *tree) argument 351 smb_tree_hold_internal( smb_tree_t *tree) argument 368 smb_tree_release( smb_tree_t *tree) argument 388 smb_tree_post_ofile(smb_tree_t *tree, smb_ofile_t *of) argument 400 smb_tree_post_odir(smb_tree_t *tree, smb_odir_t *od) argument 415 smb_tree_close_pid( smb_tree_t *tree, uint32_t pid) argument 430 smb_tree_has_feature(smb_tree_t *tree, uint32_t flags) argument 445 smb_tree_enum(smb_tree_t *tree, smb_svcenum_t *svcenum) argument 479 smb_tree_fclose(smb_tree_t *tree, uint32_t uniqid) argument 655 smb_tree_t *tree; local 773 smb_tree_t *tree; local 842 smb_tree_t *tree; local 881 smb_tree_t *tree; local 970 smb_tree_t *tree = (smb_tree_t *)arg; local 1008 smb_tree_is_connected_locked(smb_tree_t *tree) argument 1032 smb_tree_is_disconnected(smb_tree_t *tree) argument 1085 smb_tree_getattr(const smb_kshare_t *si, smb_node_t *node, smb_tree_t *tree) argument 1105 smb_tree_get_volname(vfs_t *vfsp, smb_tree_t *tree) argument 1137 smb_tree_get_flags(const smb_kshare_t *si, vfs_t *vfsp, smb_tree_t *tree) argument 1278 smb_tree_t *tree = sr->tid_tree; local 1311 smb_tree_is_connected(smb_tree_t *tree) argument 1331 smb_tree_get_ofile(smb_tree_t *tree, smb_ofile_t *of) argument 1369 smb_tree_get_odir(smb_tree_t *tree, smb_odir_t *od) argument 1406 smb_tree_close_odirs(smb_tree_t *tree, uint16_t pid) argument 1428 smb_tree_set_execinfo(smb_tree_t *tree, smb_shr_execinfo_t *exec, int exec_type) argument 1445 smb_tree_enum_private(smb_tree_t *tree, smb_svcenum_t *svcenum) argument 1477 smb_tree_netinfo_encode(smb_tree_t *tree, uint8_t *buf, size_t buflen, uint32_t *nbytes) argument 1491 smb_tree_netinfo_username(smb_tree_t *tree, char **namestr, uint32_t *namelen) argument 1516 smb_tree_netinfo_init(smb_tree_t *tree, smb_netconnectinfo_t *info) argument [all...] |
H A D | smb2_qinfo_fs.c | 89 smb_tree_t *tree = sr->tid_tree; local 94 if (!STYPE_ISDSK(tree->t_res_type)) 97 snode = tree->t_snode; 100 LabelLength = smb_wcequiv_strlen(tree->t_volume); 112 tree->t_volume); /* (U) */ 124 smb_tree_t *tree = sr->tid_tree; local 127 if (!STYPE_ISDSK(tree->t_res_type)) 151 smb_tree_t *tree = sr->tid_tree; local 154 if (!STYPE_ISDSK(tree->t_res_type)) 178 smb_tree_t *tree local 202 smb_tree_t *tree = sr->tid_tree; local 256 smb_tree_t *tree = sr->tid_tree; local [all...] |
H A D | smb_session.c | 865 * 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, 883 (tree == NULL || sr->tid_tree == tree)) 943 * Find a tree by tree-id. 951 smb_tree_t *tree; local 956 tree = smb_llist_head(&session->s_tree_list); 958 while (tree) { 870 smb_session_cancel_requests( smb_session_t *session, smb_tree_t *tree, smb_request_t *exclude_sr) argument 986 smb_session_lookup_share( smb_session_t *session, const char *sharename, smb_tree_t *tree) argument 1027 smb_session_lookup_volume( smb_session_t *session, const char *name, smb_tree_t *tree) argument 1071 smb_tree_t *tree; local 1090 smb_tree_t *tree = (smb_tree_t *)t; local 1106 smb_tree_t *tree; local 1140 smb_tree_t *tree; local 1162 smb_tree_t *tree; local 1180 smb_session_post_tree(smb_session_t *session, smb_tree_t *tree) argument 1202 smb_session_get_tree( smb_session_t *session, smb_tree_t *tree) argument [all...] |
H A D | smb2_tree_connect.c | 26 smb_tree_t *tree = NULL; local 74 tree = sr->tid_tree; 79 switch (tree->t_res_type & STYPE_MASK) { 108 tree->t_access); /* l */
|
H A D | smb_fsinfo.c | 164 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...] |
/illumos-gate/usr/src/lib/libresolv2/include/isc/ |
H A D | tree.h | 0 /* 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 D | avl.c | 32 * 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 D | cpvprint.sh | 59 # 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 D | svcproptree1.sh | 54 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 D | filetree1.sh | 54 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 D | 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...] |
/illumos-gate/usr/src/lib/libprtdiag_psr/sparc/starfire/common/ |
H A D | 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) argument 81 tree = tree; 88 display_memoryconf(Sys_tree *tree, struct grp_info *grps) argument 113 bnode = tree->bd_list; 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) argument [all...] |
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/ |
H A D | 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) 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 D | 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;
|
/illumos-gate/usr/src/lib/libresolv2/common/isc/ |
H A D | tree.c | 2 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...] |
/illumos-gate/usr/src/lib/libsqlite/src/ |
H A D | 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) 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/uts/common/zmod/ |
H A D | 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, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | trees.c | 13 * 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 492 ct_data *tree = desc->dyn_tree; local 621 ct_data *tree = desc->dyn_tree; local [all...] |
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | zfs_rlock.c | 41 * 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; local 149 if (avl_numnodes(tree) == 0) { 151 avl_add(tree, new); 158 rl = avl_find(tree, new, &where); 162 rl = (rl_t *)avl_nearest(tree, wher 191 zfs_range_proxify(avl_tree_t *tree, rl_t *rl) argument 223 zfs_range_split(avl_tree_t *tree, rl_t *rl, uint64_t off) argument 254 zfs_range_new_proxy(avl_tree_t *tree, uint64_t off, uint64_t len) argument 271 zfs_range_add_reader(avl_tree_t *tree, rl_t *new, rl_t *prev, avl_index_t where) argument 358 avl_tree_t *tree = &zp->z_range_avl; local 465 avl_tree_t *tree = &zp->z_range_avl; local [all...] |
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
H A D | avl.c | 34 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/uts/common/idmap/ |
H A D | idmap_cache.c | 105 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/lib/libprtdiag_psr/sparc/desktop/common/ |
H A D | 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) 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...] |