| /linux-master/fs/unicode/ |
| H A D | mkutf8data.c | 1357 struct tree *trees; variable in typeref:struct:tree
1621 /* Two trees per age: nfdi and nfdicf */
1623 trees = calloc(trees_count, sizeof(struct tree));
1625 /* Assign ages to the trees. */
1630 trees[--count].maxage = maxage;
1631 trees[--count].maxage = maxage;
1644 while (ages[j] < trees[i].maxage)
1646 trees[i].maxage = ages[j-1];
1649 /* Set up the forwarding between trees. */
1650 trees[trees_coun
[all...] |
| /linux-master/drivers/mtd/ |
| H A D | mtdswap.c | 114 struct mtdswap_tree trees[MTDSWAP_TREE_CNT]; member in struct:mtdswap_dev
160 #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
163 #define TREE_COUNT(d, name) (d->trees[MTDSWAP_ ## name].count)
196 oldidx = tp - &d->trees[0];
198 d->trees[oldidx].count--;
226 if (eb->root == &d->trees[idx].root)
230 root = &d->trees[idx].root;
233 d->trees[idx].count++;
766 if (d->trees[idx].root.rb_node != NULL)
808 root = &d->trees[
[all...] |
| /linux-master/drivers/md/ |
| H A D | dm-bufio.c | 396 * We spread entries across multiple trees to reduce contention
401 struct buffer_tree trees[]; member in struct:dm_buffer_cache
414 read_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);
416 down_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock);
422 read_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);
424 up_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock);
430 write_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);
432 down_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock);
438 write_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock);
440 up_write(&bc->trees[cache_inde
[all...] |
| /linux-master/kernel/ |
| H A D | audit_tree.c | 29 struct list_head trees; /* with root here */ member in struct:audit_chunk
70 * chunk.trees anchors tree.same_root hash_lock
198 INIT_LIST_HEAD(&chunk->trees);
270 /* tagging and untagging inodes with trees */
299 list_splice_init(&old->trees, &new->trees);
300 list_for_each_entry(owner, &new->trees, same_root)
366 list_del_init(&chunk->trees);
438 list_add(&tree->same_root, &chunk->trees);
510 list_add(&tree->same_root, &chunk->trees);
[all...] |
| H A D | auditsc.c | 216 * ->first_trees points to its beginning, ->trees - to the current end of data.
217 * ->tree_count is the number of free entries in array pointed to by ->trees.
234 struct audit_tree_refs *p = ctx->trees;
247 ctx->trees = p;
256 struct audit_tree_refs *p = ctx->trees;
258 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL);
259 if (!ctx->trees) {
260 ctx->trees = p;
264 p->next = ctx->trees;
266 ctx->first_trees = ctx->trees;
[all...] |
| H A D | audit.h | 149 struct audit_tree_refs *trees, *first_trees; member in struct:audit_context
|
| /linux-master/mm/ |
| H A D | zswap.c | 1710 struct zswap_tree *trees, *tree; local
1714 trees = kvcalloc(nr, sizeof(*tree), GFP_KERNEL);
1715 if (!trees) {
1721 tree = trees + i;
1727 zswap_trees[type] = trees;
1733 struct zswap_tree *trees = zswap_trees[type]; local
1736 if (!trees)
1741 WARN_ON_ONCE(!RB_EMPTY_ROOT(&trees[i].rbroot));
1743 kvfree(trees);
|
| /linux-master/drivers/net/ethernet/mellanox/mlxsw/ |
| H A D | spectrum_router.h | 38 struct mlxsw_sp_lpm_tree *trees; member in struct:mlxsw_sp_router::__anon740
|
| H A D | spectrum_router.c | 581 lpm_tree = &mlxsw_sp->router->lpm.trees[i];
681 lpm_tree = &mlxsw_sp->router->lpm.trees[i];
720 mlxsw_sp->router->lpm.trees = kcalloc(mlxsw_sp->router->lpm.tree_count,
723 if (!mlxsw_sp->router->lpm.trees)
727 lpm_tree = &mlxsw_sp->router->lpm.trees[i];
753 kfree(mlxsw_sp->router->lpm.trees);
767 kfree(mlxsw_sp->router->lpm.trees);
|
| /linux-master/fs/bcachefs/ |
| H A D | snapshot.c | 17 * Snapshot trees:
929 DARRAY(snapshot_id_list) trees;
934 darray_for_each(r->trees, i)
936 darray_exit(&r->trees);
969 darray_for_each(r->trees, i)
976 darray_push(&r->trees, r->cur_ids);
1014 darray_for_each(r.trees, t) {
1023 bch_err(c, "cannot reconstruct snapshot trees with multiple nodes");
|
| /linux-master/drivers/md/dm-vdo/ |
| H A D | block-map.c | 77 struct block_map_tree trees[]; member in struct:forest
1365 struct block_map_tree *tree = &forest->trees[root_index];
2382 struct block_map_tree *tree = &(forest->trees[root]);
2392 memcpy(tree->segments, old_forest->trees[root].segments,
2432 vdo_free(forest->trees[root].segments);
2439 * make_forest() - Make a collection of trees for a block_map, expanding the existing forest if
2700 .tree = &map->forest->trees[root],
3021 /* Allocate an expanded collection of trees, for a future growth. */
|