/osnet-11/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...] |
H A D | pdevinfo_sun4u.c | 63 * tree-walking functions which contain sun4u specifics were moved 84 Prom_node *root_node; /* root node of OBP device tree */ 93 /* set the the system tree fields */ 152 * Walk the PROM device tree and build the system tree and root tree. 162 walk(Sys_tree *tree, Prom_node *root, int id) argument 189 * board# property. But the PROM tree does not exactly follow 218 add_node(tree, pnode); 245 add_node(tree, pnod [all...] |
H A D | pdevinfo_sun4v.c | 62 * tree-walking functions which contain sun4v specifics were moved 84 Prom_node *root_node; /* root node of OBP device tree */ 101 /* set the the system tree fields */ 142 * sun4v_Walk the PROM device tree and build the system tree and root tree. 148 sun4v_walk(Sys_tree *tree, Prom_node *root, int id) argument 175 * board# property. But the PROM tree does not exactly follow 198 add_node(tree, pnode); 205 add_node(tree, pnod [all...] |
H A D | prom.c | 92 platform_disp_prom_version(Sys_tree *tree) argument 97 bnode = tree->bd_list;
|
H A D | libdevinfo_sun4u.c | 55 static Prom_node *walk_di_tree(Sys_tree *tree, Prom_node *root, 69 * walk libdevinfo's device tree instead of walking OBP's 70 * device tree. 73 walk_di_tree(Sys_tree *tree, Prom_node *root, di_node_t di_node) argument 138 add_node(tree, pnode); 160 add_node(tree, pnode); 172 pnode->child = walk_di_tree(tree, pnode, curnode); 177 return (walk_di_tree(tree, root, curnode)); 179 pnode->sibling = walk_di_tree(tree, root, curnode); 408 * libdevinfo for getting the device tree instea [all...] |
H A D | cpu.c | 113 display_cpu_devices(Sys_tree *tree) argument 135 bnode = tree->bd_list;
|
/osnet-11/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...] |
/osnet-11/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...] |
/osnet-11/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...] |
/osnet-11/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;
|
/osnet-11/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...] |
/osnet-11/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...] |
/osnet-11/usr/src/lib/libprtdiag/inc/ |
H A D | libprtdiag.h | 78 int error_check(Sys_tree *tree, struct system_kstat_data *kstats); 79 int disp_fail_parts(Sys_tree *tree); 80 void display_hp_fail_fault(Sys_tree *tree, struct system_kstat_data *kstats); 81 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree, 107 void display_io_devices(Sys_tree *tree); 133 void read_platform_kstats(Sys_tree *tree, 141 void display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats, 143 void display_memoryconf(Sys_tree *tree, struct grp_info *grps);
|
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/ |
H A D | walk_rtree.c | 57 krb5_principal **tree); 103 krb5_principal **tree, 144 retval = rtree_capath_tree(context, client, server, capvals, tree); 148 retval = rtree_hier_tree(context, client, server, tree, realm_sep); 209 * Build a tree given a set of profile values retrieved by 222 krb5_principal *tree, *pprinc; local 225 tree = pprinc = NULL; 234 tree = calloc(nprincs + 1, sizeof(krb5_principal)); 235 if (tree == NULL) { 240 tree[ 100 krb5_walk_realm_tree( krb5_context context, const krb5_data *client, const krb5_data *server, krb5_principal **tree, int realm_sep) argument 338 krb5_principal *tree, *pprinc; local [all...] |
/osnet-11/usr/src/lib/libidmap/common/ |
H A D | idmap_cache.c | 132 avl_tree_t tree; member in struct:sid2uid_gid_cache 144 avl_tree_t tree; member in struct:pid2sid_winname_cache 156 avl_tree_t tree; member in struct:winname2uid_gid_cache 289 avl_create(&idmap_cache.sid2uid_gid.tree, 301 avl_create(&idmap_cache.uid2sid_winname.tree, 314 avl_create(&idmap_cache.gid2sid_winname.tree, 327 avl_create(&idmap_cache.winname2uid_gid.tree, 354 &idmap_cache.sid2uid_gid.tree, &cookie)) != NULL) { 358 avl_destroy(&idmap_cache.sid2uid_gid.tree); 359 avl_create(&idmap_cache.sid2uid_gid.tree, [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/Perldoc/ |
H A D | ToTk.pm | 16 sub tree { shift->_perldoc_elem('tree' , @_) } subroutine 44 my($tk_opt, $tree); 45 $tree = $self->{'tree' }; 75 (($Tk::Pod::VERSION >= 4) ? ('-tree' => $tree) : ())
|
/osnet-11/usr/src/grub/grub2/grub-core/fs/ |
H A D | sfs.c | 155 struct grub_sfs_btree *tree; 164 tree = (struct grub_sfs_btree *) treeblock; 176 for (i = grub_be_to_cpu16 (tree->nodes) - 1; i >= 0; i--) 179 #define EXTNODE(tree, index) \ 180 ((struct grub_sfs_btree_node *) (((char *) &(tree)->node[0]) \ 181 + (index) * (tree)->nodesize)) 183 /* Follow the tree down to the leaf level. */ 184 if ((grub_be_to_cpu32 (EXTNODE(tree, i)->key) <= block) 185 && !tree->leaf) 187 next = grub_be_to_cpu32 (EXTNODE (tree, 153 struct grub_sfs_btree *tree; local [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/ |
H A D | regcomp.c | 818 /* Parse the regular expression, and build a structure tree. */ 824 /* Analyze the tree and create the nfa. */ 1150 /* Analyze the structure tree, and calculate "first", "next", "edest", 1214 implement parse tree visits. Instead, we use parent pointers and 1224 /* Descend down the tree, preferably to the left (or to the right 1339 bin_tree_t *op, *cls, *tree1, *tree; 1357 tree = create_tree (dfa, op, tree1, CONCAT); 1358 if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0)) 1366 return tree; 1392 /* Pass 2: compute NEXT on the tree 1332 bin_tree_t *op, *cls, *tree1, *tree; local 2112 bin_tree_t *tree, *eor, *root; local 2146 bin_tree_t *tree, *branch = NULL; local 2186 bin_tree_t *tree, *expr; local 2227 bin_tree_t *tree; local 2443 bin_tree_t *tree; local 2480 bin_tree_t *tree = NULL, *old_tree = NULL; local 3620 bin_tree_t *tree; local 3781 bin_tree_t *tree; local [all...] |
/osnet-11/usr/src/lib/libprtdiag_psr/sparc/opl/common/ |
H A D | opl.c | 88 void display_cpu_devices(Sys_tree *tree); 90 void display_memoryconf(Sys_tree *tree, struct grp_info *grps); 92 void display_io_devices(Sys_tree *tree); 93 void display_diaginfo(int flag, Prom_node *root, Sys_tree *tree, 101 static void opl_disp_hw_revisions(Sys_tree *tree, Prom_node *root); 163 display_io_devices(Sys_tree *tree) argument 180 bnode = tree->bd_list; 249 display_cpu_devices(Sys_tree *tree) argument 290 for (bnode = tree->bd_list; bnode != NULL; bnode = bnode->next) { 338 * The internal cpu tree buil 507 display_memoryconf(Sys_tree *tree, struct grp_info *grps) argument 664 display_diaginfo(int flag, Prom_node *root, Sys_tree *tree, struct system_kstat_data *kstats) argument 676 opl_disp_hw_revisions(Sys_tree *tree, Prom_node *root) argument [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/ |
H A D | InputObjects.pm | 67 An object corresponding to a tree of parsed POD text. Each "node" in 68 a parse-tree (or I<ptree>) is either a text-string or a reference to 69 a B<Pod::InteriorSequence> object. The nodes appear in the parse-tree 376 This method will get/set the corresponding parse-tree of the paragraph's text. 554 Prepends the given string or parse-tree or sequence object to the parse-tree 573 Appends the given string or parse-tree or sequence object to the parse-tree 668 This method will get/set the corresponding parse-tree of the interior 715 ## tree s [all...] |
/osnet-11/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
H A D | zlib.c | 190 ush dad; /* father node in Huffman tree */ 203 ct_data *dyn_tree; /* the dynamic tree */ 205 static_tree_desc *stat_desc; /* the corresponding static tree */ 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 317 struct tree_desc_s l_desc; /* desc. for literal tree */ 318 struct tree_desc_s d_desc; /* desc. for distance tree */ 319 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 322 /* number of codes at each bit length for an optimal tree */ 1852 ct_data *tree = desc->dyn_tree; local 1981 ct_data *tree = desc->dyn_tree; local 4103 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon17::__anon18 [all...] |
/osnet-11/usr/src/lib/libsmb/common/ |
H A D | smb_kmod.c | 233 smb_netconnectinfo_t *tree; local 256 tree = &item->nsi_un.nsi_tree; 257 free(tree->ci_username); 258 free(tree->ci_share); 291 smb_netconnectinfo_t *tree; local 324 tree = &items->nsi_un.nsi_tree; 325 rc = smb_netconnectinfo_decode(tree, data, len,
|
/osnet-11/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/ |
H A D | ldap_principal.c | 150 unsigned int tree=0, ntree=1, i=0; local 199 for (tree=0; tree < ntree; ++tree) { 201 LDAP_SEARCH(subtree[tree], ldap_context->lrparams->search_scope, filter, principal_attributes); 229 } /* end of for (tree= ... */
|
/osnet-11/usr/src/grub/grub2/util/ |
H A D | deviceiter.c | 1006 struct dm_tree *tree = NULL; 1013 /* Build DM tree for all devices. */ 1014 tree = dm_tree_create (); 1015 dmraid_check (tree, "dm_tree_create failed\n"); 1025 dmraid_check (dm_tree_add_dev (tree, MAJOR (names->dev), 1032 /* Walk the second-level children of the inverted tree; that is, devices 1036 root = dm_tree_find_node (tree, 0, 0); 1066 if (tree) 1067 dm_tree_free (tree); 1082 if (tree) [all...] |
H A D | getroot.c | 226 tree, in which case the end of the list needs to be pruned and this 904 grub_util_open_dm (const char *os_dev, struct dm_tree **tree, argument 911 *tree = NULL; 919 *tree = dm_tree_create (); 920 if (! *tree) 922 grub_puts_ (N_("Failed to create tree")); 930 if (! dm_tree_add_dev (*tree, maj, min)) 933 dm_tree_free (*tree); 934 *tree = NULL; 938 *node = dm_tree_find_node (*tree, ma 959 struct dm_tree *tree; local 1253 struct dm_tree *tree; local [all...] |