HomeSort by: relevance | last modified time | path
    Searched refs:tree (Results 1 - 25 of 81) sorted by relevancy

1 2 3 4

  /src/usr.sbin/ndbootd/
Makefile 14 COPTS.ndbootd.c+= -fno-tree-ter -fno-tree-lrs
  /src/share/man/man3/
Makefile 15 tgmath.3 timeradd.3 timeval.3 tm.3 tree.3 typeof.3 types.3 \
264 MLINKS+=tree.3 SPLAY_PROTOTYPE.3 tree.3 SPLAY_GENERATE.3 \
265 tree.3 SPLAY_ENTRY.3 tree.3 SPLAY_HEAD.3 \
266 tree.3 SPLAY_INITIALIZER.3 tree.3 SPLAY_ROOT.3 \
267 tree.3 SPLAY_EMPTY.3 tree.3 SPLAY_NEXT.3 \
268 tree.3 SPLAY_MIN.3 tree.3 SPLAY_MAX.3 tree.3 SPLAY_FIND.3
    [all...]
  /src/share/examples/refuse/icfs/
icfs.c 58 static virtdir_t tree; /* virtual directory tree */ variable
88 root = virtdir_rootdir(&tree);
110 if ((ep = virtdir_find_tgt(&tree, path, strlen(path))) == NULL) {
113 (void) snprintf(name, sizeof(name), "%s/%s", virtdir_rootdir(&tree), ep->name);
131 if ((ep = virtdir_find_tgt(&tree, path, strlen(path))) == NULL) {
134 (void) snprintf(name, sizeof(name), "%s/%s", virtdir_rootdir(&tree), ep->name);
135 if ((dirp = openvirtdir(&tree, ep->name)) == NULL) {
167 if ((ep = virtdir_find_tgt(&tree, path, strlen(path))) == NULL) {
170 (void) snprintf(name, sizeof(name), "%s/%s", virtdir_rootdir(&tree), ep->name)
    [all...]
  /src/usr.bin/ctags/
Makefile 6 SRCS= C.c ctags.c fortran.c lisp.c print.c tree.c yacc.c
  /src/common/dist/zlib/
trees.c 15 * Each code tree is stored in a compressed form which is itself
89 /* The static literal tree. Since the bit lengths are imposed, there is no
91 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
96 /* The static distance tree. (Actually a trivial tree since all codes use
120 const ct_data *static_tree; /* static tree or NULL */
123 int elems; /* max number of elements in the tree */
197 * Generate the codes for a given tree and bit counts (which need not be
200 * the given tree and the field len is set for all tree elements
541 ct_data *tree = desc->dyn_tree; local
628 ct_data *tree = desc->dyn_tree; local
    [all...]
  /src/usr.bin/menuc/
avl.c 34 /* avl.c: Routines for manipulation an avl tree.
40 * / * The balanced binary tree fields. * /
42 * short balance; / * For the balanced tree. * /
43 * struct id_rec *left, *right; / * Tree pointers. * /
64 /* find_id returns a pointer to node in TREE that has the correct
65 ID. If there is no node in TREE with ID, NULL is returned. */
68 find_id (id_rec *tree, char *id)
72 /* Check for an empty tree. */
73 if (tree == NULL)
76 /* Recursively search the tree. *
    [all...]
  /src/lib/libwrap/
libwrap2netbsd 29 # libwrap2netbsd: convert a libwrap tcp_wrappers source tree into a
30 # netbsd libwrap source tree, ready for importing.
43 echo copying tree from $r into $d
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/dcn10/
amdgpu_dcn10_mpc.c 126 struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id)
128 struct mpcc *tmp_mpcc = tree->opp_list;
173 * Insert DPP into MPC tree based on specified blending position.
178 * [in/out] tree - MPC tree structure that plane will be added to.
181 * stereo mix must disable for the very bottom layer of the tree config.
190 struct mpc_tree *tree,
205 /* check insert_above_mpcc exist in tree->opp_list */
206 struct mpcc *temp_mpcc = tree->opp_list;
229 REG_SET(MPCC_OPP_ID[mpcc_id], 0, MPCC_OPP_ID, tree->opp_id)
    [all...]
dcn10_mpc.h 139 struct mpc_tree *tree,
148 struct mpc_tree *tree,
182 struct mpc_tree *tree);
189 struct mpc_tree *tree,
  /src/tests/usr.bin/xlint/lint1/
c23.c 55 node *tree; local
56 tree = &(static node){
65 return tree->left;
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/inc/hw/
mpc.h 102 * This struct is used as a node in an MPC tree.
113 * MPC tree represents all MPCC connections for a pipe.
116 int opp_id; /* The OPP instance that owns this MPC tree */
117 struct mpcc *opp_list; /* The top MPCC layer of the MPC tree that outputs to OPP endpoint */
148 * Insert DPP into MPC tree based on specified blending position.
153 * [in/out] tree - MPC tree structure that plane will be added to.
156 * stereo mix must disable for the very bottom layer of the tree config.
165 struct mpc_tree *tree,
173 * Remove a specified MPCC from the MPC tree
    [all...]
  /src/usr.bin/pmap/
main.h 34 extern int tree;
  /src/lib/libc/
libcincludes.mk 4 # inside libc's include tree.
  /src/sys/external/bsd/drm2/i2c/
drm_encoder_slave.c 49 rb_tree_t tree; /* struct drm_i2c_encoder_driver */ member in struct:__anon6007
83 rb_tree_init(&drm_i2c_encoder_drivers.tree, &drm_i2c_encoder_rb_ops);
90 KASSERT(RB_TREE_MIN(&drm_i2c_encoder_drivers.tree) == NULL);
92 rb_tree_destroy(&drm_i2c_encoder_drivers.tree);
105 collision = rb_tree_insert_node(&drm_i2c_encoder_drivers.tree, driver);
121 rb_tree_remove_node(&drm_i2c_encoder_drivers.tree, driver);
144 driver = rb_tree_find_node(&drm_i2c_encoder_drivers.tree, info->type);
  /src/usr.bin/gzip/
unpack.c 38 * 06 - Level for the huffman tree (<=24)
41 * tree levels, each level would consume 1 byte (See [1]).
52 * have at most 256 symbols in the huffman tree. pack(1) rejects empty
65 * Represent the huffman tree in a similar way that pack(1) would
73 int treelevels; /* Levels for the huffman tree */
82 char **tree; /* Decoding huffman tree (pointers to member in struct:__anon8250
83 first symbol of each tree level */
125 free(unpackd->tree);
163 * Read file header and construct the tree. Also, prepare the buffered I/
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_active_types.h 44 struct rb_root tree; member in struct:i915_active
i915_active.c 191 rb_move(&root, &ref->tree);
192 rb_tree_init(&ref->tree.rbr_tree, &active_rb_ops);
194 root = ref->tree;
195 ref->tree = RB_ROOT;
301 node = rb_tree_find_node(&ref->tree.rbr_tree, &idx);
308 p = &ref->tree.rb_node;
333 collision = rb_tree_insert_node(&ref->tree.rbr_tree, node);
337 rb_insert_color(&node->node, &ref->tree);
372 rb_tree_init(&ref->tree.rbr_tree, &active_rb_ops);
374 ref->tree = RB_ROOT
    [all...]
  /src/usr.bin/find/
find.c 193 FTS *tree; /* pointer to top of FTS hierarchy */ variable
210 if (!(tree = fts_open(paths, ftsoptions, issort ? ftscompare : NULL)))
215 for (rval = 0; cval && (g_entry = fts_read(tree)) != NULL;) {
263 (void)fts_close(tree);
277 * traverse the plan tree and execute func() on all plans. This
  /src/etc/etc.sparc64/
Makefile.inc 19 # Install miniroot images and auxiliary scripts to the release tree
  /src/sbin/fsdb/
Makefile 39 COPTS.pass1.c+= -fno-tree-fre -fno-tree-lrs
  /src/sys/external/bsd/drm2/include/linux/
rbtree.h 115 struct rb_tree *tree = &root->rbr_tree; local
116 void *node = (char *)rbnode - tree->rbt_ops->rbto_node_offset;
118 rb_tree_remove_node(tree, node);
149 * that just frees all the nodes without removing them from the tree.
222 * pointing at the root of the tree.
  /src/libexec/makewhatis/
makewhatis.c 504 addmanpage(manpage **tree, ino_t inode, char *name, size_t sdoff, size_t sdlen)
508 while ((mp = *tree) != NULL) {
511 tree = inode < mp->mp_inode ? &mp->mp_left : &mp->mp_right;
521 *tree = mp;
525 addwhatis(whatis **tree, char *data, char *prefix)
542 while ((wi = *tree) != NULL) {
546 tree = result < 0 ? &wi->wi_left : &wi->wi_right;
558 *tree = wi;
1159 dumpwhatis(FILE *out, whatis *tree)
1161 while (tree != NULL)
    [all...]
  /src/sbin/dump_lfs/
Makefile 27 COPTS.lfs_inode.c+= -fno-tree-ter
  /src/share/misc/
Makefile 5 birthtoken bsd-family-tree \
  /src/sys/external/bsd/drm2/dist/drm/i915/gem/
i915_gem_context_types.h 17 #include <linux/radix-tree.h>

Completed in 333 milliseconds

1 2 3 4