| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_active_types.h | 44 struct rb_root tree; member in struct:i915_active
|
| /src/sys/external/bsd/drm2/include/linux/ |
| rbtree.h | 115 struct rb_tree *tree = &root->rbr_tree; local in function:rb_erase
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/usr.bin/find/ |
| find.c | 193 FTS *tree; /* pointer to top of FTS hierarchy */ variable in typeref:typename:FTS *
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/tests/usr.bin/xlint/lint1/ |
| c23.c | 55 node *tree; local in function:storage_class_in_compound_literal
56 tree = &(static node){
65 return tree->left;
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/core/ |
| object.h | 18 struct list_head tree; member in struct:nvkm_object
|
| /src/sys/external/bsd/drm2/i2c/ |
| drm_encoder_slave.c | 49 rb_tree_t tree; /* struct drm_i2c_encoder_driver */ member in struct:__anon3999a8730108
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:__anon119e99d90108
83 first symbol of each tree level */
105 free(unpackd->tree);
143 * Read file header and construct the tree. Also, prepare the buffered I/
[all...] |
| /src/share/examples/refuse/icfs/ |
| icfs.c | 58 static virtdir_t tree; /* virtual directory tree */ variable in typeref:typename:virtdir_t
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/sys/dev/ic/ |
| athrate-amrr.c | 483 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local in function:ath_rate_sysctlattach
485 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
489 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
492 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/ |
| mmu.h | 10 struct rb_node tree; member in struct:nvkm_vma
|
| /src/usr.bin/pmap/ |
| main.c | 63 int tree; variable in typeref:typename:int
137 tree = 0;
210 tree = 1;
|
| /src/sys/external/bsd/drm2/dist/drm/i915/gem/ |
| i915_gem_object_types.h | 95 * @vma.lock: protect the list/tree of vmas
105 * themselves, use the @vma.tree (which has a defined order
111 * @vma.tree: Ordered tree of VMAs backed by this object
113 * All VMA created for this object are placed in the @vma.tree
118 struct rb_root tree; member in struct:drm_i915_gem_object::__anonbfddbbad0108
|
| /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 in function:gen_bitlen
628 ct_data *tree = desc->dyn_tree; local in function:build_tree
[all...] |
| /src/sys/dev/usb/ |
| ugen.c | 189 rb_tree_t tree; member in struct:__anon308015420108
231 for (i = 0, sc0 = RB_TREE_MIN(&ugenif.tree);
233 i++, sc0 = RB_TREE_NEXT(&ugenif.tree, sc0))
235 KASSERT(rb_tree_find_node(&ugenif.tree, &i) == NULL);
237 sc0 = rb_tree_insert_node(&ugenif.tree, sc);
239 KASSERT(rb_tree_find_node(&ugenif.tree, &i) == sc);
254 KASSERT(rb_tree_find_node(&ugenif.tree, &sc->sc_unit) == sc);
255 rb_tree_remove_node(&ugenif.tree, sc);
266 sc = rb_tree_find_node(&ugenif.tree, &unit);
2430 rb_tree_init(&ugenif.tree, &ugenif_tree_ops)
[all...] |
| /src/sys/arch/x86/x86/ |
| pmap.c | 476 * PV tree prototypes
482 /* Read-black tree */
1960 * to hang a tree of pv_entry records. Dynamically allocated
1962 * usual case is embedded), so cop out and use a single RB tree
2202 * pmap_treelookup_pv: search the PV tree for a dynamic entry
2208 const rb_tree_t *tree, const vaddr_t va)
2217 for (node = tree->rbt_root;;) {
2242 const rb_tree_t *tree; local in function:pmap_lookup_pv
2251 * If the page is tracked with an embedded entry then the tree
2267 * look at the lowest numbered node in the tree first. The tree i
2385 rb_tree_t *tree = (ptp != NULL ? local in function:pmap_remove_pv
3117 rb_tree_t *tree; local in function:pmap_zap_ptp
4571 rb_tree_t *tree = (ptp != NULL ? local in function:pmap_pp_remove
5001 rb_tree_t *tree; local in function:pmap_enter_ma
5373 rb_tree_t *tree; local in function:pmap_enter_gnt
6212 pd_entry_t *tree[3]; local in function:pmap_ept_free_ptp
6300 rb_tree_t *tree; local in function:pmap_ept_enter
[all...] |
| /src/sys/net/ |
| zlib.c | 342 ush dad; /* father node in Huffman tree */
355 ct_data *dyn_tree; /* the dynamic tree */
357 static_tree_desc *stat_desc; /* the corresponding static tree */
465 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
467 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
469 struct tree_desc_s l_desc; /* desc. for literal tree */
470 struct tree_desc_s d_desc; /* desc. for distance tree */
471 struct tree_desc_s bl_desc; /* desc. for bit length tree */
474 /* number of codes at each bit length for an optimal tree */
2588 ct_data *tree = desc->dyn_tree; local in function:gen_bitlen
2715 ct_data *tree = desc->dyn_tree; local in function:build_tree
5096 inflate_huft *tree; \/* pointer into tree *\/ member in struct:inflate_codes_state::__anon0201f1530e0a::__anon0201f1530f08
[all...] |
