trees             114 drivers/mtd/mtdswap.c 	struct mtdswap_tree trees[MTDSWAP_TREE_CNT];
trees             160 drivers/mtd/mtdswap.c #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
trees             163 drivers/mtd/mtdswap.c #define TREE_COUNT(d, name) (d->trees[MTDSWAP_ ## name].count)
trees             196 drivers/mtd/mtdswap.c 		oldidx = tp - &d->trees[0];
trees             198 drivers/mtd/mtdswap.c 		d->trees[oldidx].count--;
trees             226 drivers/mtd/mtdswap.c 	if (eb->root == &d->trees[idx].root)
trees             230 drivers/mtd/mtdswap.c 	root = &d->trees[idx].root;
trees             233 drivers/mtd/mtdswap.c 	d->trees[idx].count++;
trees             767 drivers/mtd/mtdswap.c 		if (d->trees[idx].root.rb_node != NULL)
trees             809 drivers/mtd/mtdswap.c 		root = &d->trees[i].root;
trees             860 drivers/mtd/mtdswap.c 	rp = &d->trees[idx].root;
trees             865 drivers/mtd/mtdswap.c 	d->trees[idx].count--;
trees            1186 drivers/mtd/mtdswap.c 		struct rb_root *root = &d->trees[i].root;
trees            1189 drivers/mtd/mtdswap.c 			count[i] = d->trees[i].count;
trees            1294 drivers/mtd/mtdswap.c 		d->trees[i].root = RB_ROOT;
trees              61 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 		struct mlxsw_sp_lpm_tree *trees;
trees             501 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
trees             601 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
trees             639 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 	mlxsw_sp->router->lpm.trees = kcalloc(mlxsw_sp->router->lpm.tree_count,
trees             642 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 	if (!mlxsw_sp->router->lpm.trees)
trees             646 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 		lpm_tree = &mlxsw_sp->router->lpm.trees[i];
trees             672 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 	kfree(mlxsw_sp->router->lpm.trees);
trees             686 drivers/net/ethernet/mellanox/mlxsw/spectrum_router.c 	kfree(mlxsw_sp->router->lpm.trees);
trees            1357 fs/unicode/mkutf8data.c struct tree *trees;
trees            1623 fs/unicode/mkutf8data.c 	trees = calloc(trees_count, sizeof(struct tree));
trees            1630 fs/unicode/mkutf8data.c 		trees[--count].maxage = maxage;
trees            1631 fs/unicode/mkutf8data.c 		trees[--count].maxage = maxage;
trees            1644 fs/unicode/mkutf8data.c 		while (ages[j] < trees[i].maxage)
trees            1646 fs/unicode/mkutf8data.c 		trees[i].maxage = ages[j-1];
trees            1650 fs/unicode/mkutf8data.c 	trees[trees_count-2].next = &trees[trees_count-1];
trees            1651 fs/unicode/mkutf8data.c 	trees[trees_count-1].leaf_mark = nfdi_mark;
trees            1652 fs/unicode/mkutf8data.c 	trees[trees_count-2].leaf_mark = nfdicf_mark;
trees            1654 fs/unicode/mkutf8data.c 		trees[i].next = &trees[trees_count-2];
trees            1655 fs/unicode/mkutf8data.c 		trees[i].leaf_mark = correction_mark;
trees            1656 fs/unicode/mkutf8data.c 		trees[i+1].next = &trees[trees_count-1];
trees            1657 fs/unicode/mkutf8data.c 		trees[i+1].leaf_mark = correction_mark;
trees            1662 fs/unicode/mkutf8data.c 		trees[i].type = "nfdicf";
trees            1663 fs/unicode/mkutf8data.c 		trees[i].leaf_equal = nfdicf_equal;
trees            1664 fs/unicode/mkutf8data.c 		trees[i].leaf_print = nfdicf_print;
trees            1665 fs/unicode/mkutf8data.c 		trees[i].leaf_size = nfdicf_size;
trees            1666 fs/unicode/mkutf8data.c 		trees[i].leaf_index = nfdicf_index;
trees            1667 fs/unicode/mkutf8data.c 		trees[i].leaf_emit = nfdicf_emit;
trees            1669 fs/unicode/mkutf8data.c 		trees[i+1].type = "nfdi";
trees            1670 fs/unicode/mkutf8data.c 		trees[i+1].leaf_equal = nfdi_equal;
trees            1671 fs/unicode/mkutf8data.c 		trees[i+1].leaf_print = nfdi_print;
trees            1672 fs/unicode/mkutf8data.c 		trees[i+1].leaf_size = nfdi_size;
trees            1673 fs/unicode/mkutf8data.c 		trees[i+1].leaf_index = nfdi_index;
trees            1674 fs/unicode/mkutf8data.c 		trees[i+1].leaf_emit = nfdi_emit;
trees            1679 fs/unicode/mkutf8data.c 		trees[i].childnode = NODE;
trees            1693 fs/unicode/mkutf8data.c 				trees[i].type, trees[i].maxage);
trees            1700 fs/unicode/mkutf8data.c 			if (data->correction <= trees[i].maxage)
trees            1702 fs/unicode/mkutf8data.c 			insert(&trees[i], keyval, keylen, data);
trees            1714 fs/unicode/mkutf8data.c 		prune(&trees[i]);
trees            1716 fs/unicode/mkutf8data.c 		mark_nodes(&trees[i]);
trees            1720 fs/unicode/mkutf8data.c 			size = index_nodes(&trees[i], size);
trees            1723 fs/unicode/mkutf8data.c 			changed += size_nodes(&trees[i]);
trees            1729 fs/unicode/mkutf8data.c 		emit(&trees[i], utf8data);
trees            1734 fs/unicode/mkutf8data.c 				trees[i].type, trees[i].maxage, trees[i].index);
trees            1738 fs/unicode/mkutf8data.c 	nfdi = utf8data + trees[trees_count-1].index;
trees            1739 fs/unicode/mkutf8data.c 	nfdicf = utf8data + trees[trees_count-2].index;
trees            1741 fs/unicode/mkutf8data.c 	nfdi_tree = &trees[trees_count-1];
trees            1742 fs/unicode/mkutf8data.c 	nfdicf_tree = &trees[trees_count-2];
trees            1831 fs/unicode/mkutf8data.c 		verify(&trees[i]);
trees            3307 fs/unicode/mkutf8data.c 			ages[gen], trees[t].index,
trees            3309 fs/unicode/mkutf8data.c 		if (trees[t].maxage == ages[gen])
trees            3318 fs/unicode/mkutf8data.c 			ages[gen], trees[t].index,
trees            3320 fs/unicode/mkutf8data.c 		if (trees[t].maxage == ages[gen])
trees            3329 fs/unicode/mkutf8data.c 		if (i == trees[t].index) {
trees            3331 fs/unicode/mkutf8data.c 				trees[t].type, trees[t].maxage);
trees             140 kernel/audit.h 	struct audit_tree_refs *trees, *first_trees;
trees              29 kernel/audit_tree.c 	struct list_head trees;		/* with root here */
trees             200 kernel/audit_tree.c 	INIT_LIST_HEAD(&chunk->trees);
trees             301 kernel/audit_tree.c 	list_splice_init(&old->trees, &new->trees);
trees             302 kernel/audit_tree.c 	list_for_each_entry(owner, &new->trees, same_root)
trees             368 kernel/audit_tree.c 		list_del_init(&chunk->trees);
trees             440 kernel/audit_tree.c 		list_add(&tree->same_root, &chunk->trees);
trees             512 kernel/audit_tree.c 		list_add(&tree->same_root, &chunk->trees);
trees            1015 kernel/audit_tree.c 	while (!list_empty(&chunk->trees)) {
trees            1016 kernel/audit_tree.c 		owner = list_entry(chunk->trees.next,
trees             213 kernel/auditsc.c 	struct audit_tree_refs *p = ctx->trees;
trees             225 kernel/auditsc.c 		ctx->trees = p;
trees             234 kernel/auditsc.c 	struct audit_tree_refs *p = ctx->trees;
trees             235 kernel/auditsc.c 	ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL);
trees             236 kernel/auditsc.c 	if (!ctx->trees) {
trees             237 kernel/auditsc.c 		ctx->trees = p;
trees             241 kernel/auditsc.c 		p->next = ctx->trees;
trees             243 kernel/auditsc.c 		ctx->first_trees = ctx->trees;
trees             262 kernel/auditsc.c 	for (q = p; q != ctx->trees; q = q->next, n = 31) {
trees             272 kernel/auditsc.c 	ctx->trees = p;
trees             292 kernel/auditsc.c 	for (p = ctx->first_trees; p != ctx->trees; p = p->next) {
trees            1745 kernel/auditsc.c 	p = context->trees;
trees            1774 kernel/auditsc.c 	p = context->trees;