Searched defs:tree (Results 1 - 25 of 98) sorted by relevance

1234

/glassfish-3.1.2/admingui/common/src/main/java/org/glassfish/admingui/common/tree/
H A DFilterTreeEvent.java41 package org.glassfish.admingui.common.tree;
H A DJndiBrowserTreeAdaptor.java41 package org.glassfish.admingui.common.tree;
44 import com.sun.jsftemplating.component.factory.tree.TreeAdaptor;
45 import com.sun.jsftemplating.component.factory.tree.TreeAdaptorBase;
214 * that creates the <code>TreeNode</code> for the given tree node model
292 + ") for tree processing");
324 * This method returns the <code>id</code> for the given tree node model
383 * The tree node <code>UIComponent</code>.
385 * The (model) object representing the tree node.
H A DListTreeAdaptor.java41 package org.glassfish.admingui.common.tree;
44 import com.sun.jsftemplating.component.factory.tree.TreeAdaptor;
45 import com.sun.jsftemplating.component.factory.tree.TreeAdaptorBase;
191 * factory that creates the <code>TreeNode</code> for the given tree
289 * <p> This method returns the <code>id</code> for the given tree node
317 * @param comp The tree node <code>UIComponent</code>.
318 * @param nodeObject The (model) object representing the tree node.
435 * <code>TreeNode</code> for the given tree node model object.</p>
/glassfish-3.1.2/installer/src/cpp/share/launcher/zlib-1.1.4/
H A Dinfcodes.c40 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon7::__anon8
42 } code; /* if LEN or DIST, where in tree */
53 inflate_huft *ltree; /* literal/length/eob tree */
54 inflate_huft *dtree; /* distance tree */
119 c->sub.code.tree = c->ltree;
124 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
146 c->sub.code.tree = t + t->base;
165 c->sub.code.tree = c->dtree;
171 t = c->sub.code.tree
[all...]
H A Dtrees.c13 * 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
495 ct_data *tree = desc->dyn_tree; local
624 ct_data *tree = desc->dyn_tree; local
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dwalk_rtree.c105 * of realms (in a field called tree) that you need to get tickets in
122 krb5_walk_realm_tree(krb5_context context, const krb5_data *client, const krb5_data *server, krb5_principal **tree, int realm_branch_char) argument
220 /* construct path from client to server, down the tree */
238 /* construct path from client to server, up the tree */
398 /* only necessary if building down tree from ancestor or client */
418 *tree = rettree;
421 printf("krb5_walk_realm_tree ending; tree (length %d) is:\n",links);
423 if ((*tree)[i])
424 krb5int_dbgref_dump_principal("krb5_walk_realm_tree tree",(*tree)[
[all...]
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dtree.h0 /* 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/lib/libshell/common/sh/
H A Dexpand.c217 * scan tree and add each name that matches the given pattern
219 static int scantree(Dt_t *tree, const char *pattern, struct argnod **arghead) argument
225 np = (Namval_t*)dtfirst(tree);
226 for(;np && !nv_isnull(np);(np = (Namval_t*)dtnext(tree,np)))
/illumos-gate/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. */
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/libprtdiag/common/
H A Dcpu.c113 display_cpu_devices(Sys_tree *tree) argument
135 bnode = tree->bd_list;
H A Ddisplay_sun4u.c57 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 Dkstat.c58 * fhc, environ, sysctrl. Each board in the tree should have
63 read_platform_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat, argument
81 for (bnode = tree->bd_list; bnode != NULL; bnode = bnode->next) {
379 * fhc, environ, sysctrl. Each board in the tree should have
384 read_sun4u_kstats(Sys_tree *tree, struct system_kstat_data *sys_kstat) argument
427 read_platform_kstats(tree, sys_kstat, bdp, ep);
H A Dlibdevinfo_sun4u.c55 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 Dmemory.c88 display_memorysize(Sys_tree *tree, struct system_kstat_data *kstats, argument
113 display_memoryconf(Sys_tree *tree, struct grp_info *grps) argument
H A Dpdevinfo_sun4u.c63 * 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 Dpdevinfo_sun4v.c62 * 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 Dprom.c92 platform_disp_prom_version(Sys_tree *tree) argument
97 bnode = tree->bd_list;
/illumos-gate/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) 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...]
/illumos-gate/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) 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/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; 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/cmd/acct/
H A Dacctdusg.c60 static avl_tree_t *tree = NULL; variable
224 switch (add_tnode(&tree, statb.st_dev, statb.st_ino)) {
/illumos-gate/usr/src/cmd/chgrp/
H A Dchgrp.c78 static avl_tree_t *tree; /* search tree to store inode data */ variable
235 tree = NULL;
269 * tree so we don't get into an
272 if (add_tnode(&tree,
290 * the search tree.
320 * Add this node to the search tree so we don't
323 if (add_tnode(&tree, stbuf.st_dev,
333 * to add the node to the tree.
337 * being added to the search tree
[all...]
/illumos-gate/usr/src/cmd/chown/
H A Dchown.c72 static avl_tree_t *tree; variable
266 tree = NULL;
301 * tree so we don't get into an
304 if (add_tnode(&tree,
315 * the search tree.
338 * Add this node to the search tree so we don't
341 if (add_tnode(&tree, stbuf.st_dev,
347 * to add the node to the tree.
351 * being added to the search tree.
371 * directory to the search tree s
[all...]
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dspa_errlog.c98 avl_tree_t *tree; local
115 tree = &spa->spa_errlist_scrub;
117 tree = &spa->spa_errlist_last;
120 if (avl_find(tree, &search, &where) != NULL) {
127 avl_insert(tree, new, where);
263 * tree to add new errors. spa_errlog_sync() is responsible for actually
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; 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...]

Completed in 150 milliseconds

1234