tree 126 arch/parisc/mm/fault.c while (tree != vm_avl_empty) { tree 127 arch/parisc/mm/fault.c if (tree->vm_start > addr) { tree 128 arch/parisc/mm/fault.c tree = tree->vm_avl_left; tree 130 arch/parisc/mm/fault.c prev = tree; tree 135 arch/parisc/mm/fault.c tree = tree->vm_avl_right; tree 102 arch/s390/numa/mode_emu.c static int cores_free(struct toptree *tree) tree 107 arch/s390/numa/mode_emu.c toptree_for_each(core, tree, CORE) { tree 177 arch/s390/numa/mode_emu.c static void toptree_unify_tree(struct toptree *tree) tree 181 arch/s390/numa/mode_emu.c toptree_unify(tree); tree 183 arch/s390/numa/mode_emu.c toptree_get_child(tree, nid); tree 293 arch/s390/numa/mode_emu.c struct toptree *tree; tree 296 arch/s390/numa/mode_emu.c tree = toptree_alloc(TOPOLOGY, id); tree 297 arch/s390/numa/mode_emu.c if (!tree) tree 300 arch/s390/numa/mode_emu.c if (!toptree_get_child(tree, nid)) tree 303 arch/s390/numa/mode_emu.c return tree; tree 157 block/bfq-iosched.h struct rb_root *tree; tree 23 block/bfq-wf2q.c static struct bfq_entity *bfq_root_active_entity(struct rb_root *tree) tree 25 block/bfq-wf2q.c struct rb_node *node = tree->rb_node; tree 335 block/bfq-wf2q.c entity->tree = NULL; tree 393 block/bfq-wf2q.c entity->tree = root; tree 989 block/bfq-wf2q.c if (entity->tree == &st->idle) { tree 1090 block/bfq-wf2q.c if (entity->tree) tree 1119 block/bfq-wf2q.c if (sd->in_service_entity == entity || entity->tree == &st->active) tree 1203 block/bfq-wf2q.c if (entity->tree == &st->active) tree 1205 block/bfq-wf2q.c else if (!is_in_service && entity->tree == &st->idle) tree 391 drivers/firewire/core-topology.c struct fw_node *tree; tree 394 drivers/firewire/core-topology.c tree = node1->ports[port]; tree 395 drivers/firewire/core-topology.c node0->ports[port] = tree; tree 396 drivers/firewire/core-topology.c for (i = 0; i < tree->port_count; i++) { tree 397 drivers/firewire/core-topology.c if (tree->ports[i] == node1) { tree 398 drivers/firewire/core-topology.c tree->ports[i] = node0; tree 114 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id) tree 116 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpcc *tmp_mpcc = tree->opp_list; tree 178 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpc_tree *tree, tree 194 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpcc *temp_mpcc = tree->opp_list; tree 217 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c REG_SET(MPCC_OPP_ID[mpcc_id], 0, MPCC_OPP_ID, tree->opp_id); tree 220 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c if (tree->opp_list == insert_above_mpcc) { tree 222 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c tree->opp_list = new_mpcc; tree 223 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, mpcc_id); tree 226 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpcc *temp_mpcc = tree->opp_list; tree 266 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpc_tree *tree, tree 273 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c if (tree->opp_list == mpcc_to_remove) { tree 278 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c tree->opp_list = mpcc_to_remove->mpcc_bot; tree 279 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, tree->opp_list->mpcc_id); tree 282 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c tree->opp_list = NULL; tree 283 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, 0xf); tree 287 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpcc *temp_mpcc = tree->opp_list; tree 387 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c struct mpc_tree *tree) tree 398 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c REG_GET(MUX[tree->opp_id], MPC_OUT_MUX, &out_mux); tree 409 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c if ((opp_id == tree->opp_id) && (top_sel != 0xf)) { tree 415 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c tree->opp_list = mpcc; tree 420 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.c if ((opp_id == tree->opp_id) && (top_sel != 0xf)) { tree 137 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.h struct mpc_tree *tree, tree 146 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.h struct mpc_tree *tree, tree 180 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.h struct mpc_tree *tree); tree 187 drivers/gpu/drm/amd/display/dc/dcn10/dcn10_mpc.h struct mpc_tree *tree, tree 484 drivers/gpu/drm/amd/display/dc/dcn20/dcn20_mpc.c struct mpcc *mpc2_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id) tree 486 drivers/gpu/drm/amd/display/dc/dcn20/dcn20_mpc.c struct mpcc *tmp_mpcc = tree->opp_list; tree 171 drivers/gpu/drm/amd/display/dc/inc/hw/mpc.h struct mpc_tree *tree, tree 190 drivers/gpu/drm/amd/display/dc/inc/hw/mpc.h struct mpc_tree *tree, tree 222 drivers/gpu/drm/amd/display/dc/inc/hw/mpc.h struct mpc_tree *tree, tree 231 drivers/gpu/drm/amd/display/dc/inc/hw/mpc.h struct mpc_tree *tree); tree 170 drivers/gpu/drm/i915/gem/i915_gem_object.c GEM_BUG_ON(!RB_EMPTY_ROOT(&obj->vma.tree)); tree 94 drivers/gpu/drm/i915/gem/i915_gem_object_types.h struct rb_root tree; tree 135 drivers/gpu/drm/i915/i915_active.c root = ref->tree; tree 136 drivers/gpu/drm/i915/i915_active.c ref->tree = RB_ROOT; tree 208 drivers/gpu/drm/i915/i915_active.c p = &ref->tree.rb_node; tree 230 drivers/gpu/drm/i915/i915_active.c rb_insert_color(&node->node, &ref->tree); tree 252 drivers/gpu/drm/i915/i915_active.c ref->tree = RB_ROOT; tree 426 drivers/gpu/drm/i915/i915_active.c rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { tree 465 drivers/gpu/drm/i915/i915_active.c if (RB_EMPTY_ROOT(&ref->tree)) tree 474 drivers/gpu/drm/i915/i915_active.c rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { tree 489 drivers/gpu/drm/i915/i915_active.c GEM_BUG_ON(!RB_EMPTY_ROOT(&ref->tree)); tree 504 drivers/gpu/drm/i915/i915_active.c if (RB_EMPTY_ROOT(&ref->tree)) tree 523 drivers/gpu/drm/i915/i915_active.c p = ref->tree.rb_node; tree 577 drivers/gpu/drm/i915/i915_active.c rb_erase(p, &ref->tree); /* Hide from waits and sibling allocations */ tree 676 drivers/gpu/drm/i915/i915_active.c p = &ref->tree.rb_node; tree 689 drivers/gpu/drm/i915/i915_active.c rb_insert_color(&node->node, &ref->tree); tree 50 drivers/gpu/drm/i915/i915_active_types.h struct rb_root tree; tree 266 drivers/gpu/drm/i915/i915_debugfs.c struct rb_node *p = obj->vma.tree.rb_node; tree 180 drivers/gpu/drm/i915/i915_vma.c p = &obj->vma.tree.rb_node; tree 206 drivers/gpu/drm/i915/i915_vma.c rb_insert_color(&vma->obj_node, &obj->vma.tree); tree 239 drivers/gpu/drm/i915/i915_vma.c rb = obj->vma.tree.rb_node; tree 812 drivers/gpu/drm/i915/i915_vma.c rb_erase(&vma->obj_node, &vma->obj->vma.tree); tree 16 drivers/gpu/drm/nouveau/include/nvkm/core/object.h struct list_head tree; tree 8 drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h struct rb_node tree; tree 131 drivers/gpu/drm/nouveau/nvkm/core/ioctl.c list_add(&object->head, &parent->tree); tree 188 drivers/gpu/drm/nouveau/nvkm/core/object.c list_for_each_entry(child, &object->tree, head) { tree 215 drivers/gpu/drm/nouveau/nvkm/core/object.c list_for_each_entry_continue_reverse(child, &object->tree, head) { tree 237 drivers/gpu/drm/nouveau/nvkm/core/object.c list_for_each_entry(child, &object->tree, head) { tree 248 drivers/gpu/drm/nouveau/nvkm/core/object.c list_for_each_entry_continue_reverse(child, &object->tree, head) tree 266 drivers/gpu/drm/nouveau/nvkm/core/object.c list_for_each_entry_safe(child, ctemp, &object->tree, head) { tree 306 drivers/gpu/drm/nouveau/nvkm/core/object.c INIT_LIST_HEAD(&object->tree); tree 787 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_erase(&vma->tree, &vmm->free); tree 805 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *this = rb_entry(*ptr, typeof(*this), tree); tree 822 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_link_node(&vma->tree, parent, ptr); tree 823 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_insert_color(&vma->tree, &vmm->free); tree 829 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_erase(&vma->tree, &vmm->root); tree 847 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *this = rb_entry(*ptr, typeof(*this), tree); tree 858 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_link_node(&vma->tree, parent, ptr); tree 859 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c rb_insert_color(&vma->tree, &vmm->root); tree 867 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *vma = rb_entry(node, typeof(*vma), tree); tree 987 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *vma = rb_entry(node, typeof(*vma), tree); tree 1689 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *this = rb_entry(temp, typeof(*this), tree); tree 1705 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct nvkm_vma *this = rb_entry(node, typeof(*this), tree); tree 213 drivers/infiniband/sw/rxe/rxe_pool.c pool->tree = RB_ROOT; tree 285 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node **link = &pool->tree.rb_node; tree 305 drivers/infiniband/sw/rxe/rxe_pool.c rb_insert_color(&new->node, &pool->tree); tree 312 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node **link = &pool->tree.rb_node; tree 336 drivers/infiniband/sw/rxe/rxe_pool.c rb_insert_color(&new->node, &pool->tree); tree 360 drivers/infiniband/sw/rxe/rxe_pool.c rb_erase(&elem->node, &pool->tree); tree 384 drivers/infiniband/sw/rxe/rxe_pool.c rb_erase(&elem->node, &pool->tree); tree 488 drivers/infiniband/sw/rxe/rxe_pool.c node = pool->tree.rb_node; tree 520 drivers/infiniband/sw/rxe/rxe_pool.c node = pool->tree.rb_node; tree 106 drivers/infiniband/sw/rxe/rxe_pool.h struct rb_root tree; tree 301 drivers/md/bcache/bset.c kfree(t->tree); tree 303 drivers/md/bcache/bset.c free_pages((unsigned long) t->tree, tree 309 drivers/md/bcache/bset.c t->tree = NULL; tree 328 drivers/md/bcache/bset.c t->tree = bset_tree_bytes(b) < PAGE_SIZE tree 331 drivers/md/bcache/bset.c if (!t->tree) tree 547 drivers/md/bcache/bset.c return cacheline_to_bkey(t, to_inorder(j, t), t->tree[j].m); tree 595 drivers/md/bcache/bset.c struct bkey_float *f = &t->tree[j]; tree 644 drivers/md/bcache/bset.c t->tree = t[-1].tree + j; tree 661 drivers/md/bcache/bset.c if (t->tree != b->set->tree + btree_keys_cachelines(b)) { tree 704 drivers/md/bcache/bset.c b->set->tree + btree_keys_cachelines(b) - t->tree); tree 721 drivers/md/bcache/bset.c t->tree[j].m = bkey_to_cacheline_offset(t, cacheline++, k); tree 822 drivers/md/bcache/bset.c if (t->size == b->set->tree + btree_keys_cachelines(b) - t->tree) tree 973 drivers/md/bcache/bset.c prefetch(&t->tree[p]); tree 976 drivers/md/bcache/bset.c f = &t->tree[j]; tree 1001 drivers/md/bcache/bset.c f = &t->tree[inorder_next(j, t->size)]; tree 1009 drivers/md/bcache/bset.c f = &t->tree[inorder_prev(j, t->size)]; tree 1387 drivers/md/bcache/bset.c if (t->tree[j].exponent == 127) tree 173 drivers/md/bcache/bset.h struct bkey_float *tree; tree 1066 drivers/md/bcache/btree.c prefetch(b->keys.set[i].tree); tree 225 drivers/md/dm-dust.c static bool __dust_clear_badblocks(struct rb_root *tree, tree 230 drivers/md/dm-dust.c nnode = rb_first(tree); tree 239 drivers/md/dm-dust.c rb_erase(node, tree); tree 244 drivers/md/dm-dust.c BUG_ON(tree->rb_node != NULL); tree 116 drivers/md/dm-writecache.c struct rb_root tree; tree 541 drivers/md/dm-writecache.c struct rb_node *node = wc->tree.rb_node; tree 586 drivers/md/dm-writecache.c struct rb_node **node = &wc->tree.rb_node, *parent = NULL; tree 597 drivers/md/dm-writecache.c rb_insert_color(&ins->rb_node, &wc->tree); tree 604 drivers/md/dm-writecache.c rb_erase(&e->rb_node, &wc->tree); tree 687 drivers/md/dm-writecache.c memset(&wc->tree, -1, sizeof wc->tree); tree 922 drivers/md/dm-writecache.c wc->tree = RB_ROOT; tree 1643 drivers/md/dm-writecache.c e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node); tree 109 drivers/net/ethernet/mellanox/mlx4/cq.c cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree, tree 132 drivers/net/ethernet/mellanox/mlx4/cq.c cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1)); tree 364 drivers/net/ethernet/mellanox/mlx4/cq.c err = radix_tree_insert(&cq_table->tree, cq->cqn, cq); tree 425 drivers/net/ethernet/mellanox/mlx4/cq.c radix_tree_delete(&cq_table->tree, cq->cqn); tree 446 drivers/net/ethernet/mellanox/mlx4/cq.c radix_tree_delete(&cq_table->tree, cq->cqn); tree 468 drivers/net/ethernet/mellanox/mlx4/cq.c INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC); tree 682 drivers/net/ethernet/mellanox/mlx4/mlx4.h struct radix_tree_root tree; tree 703 drivers/net/ethernet/mellanox/mlx4/mlx4.h struct radix_tree_root tree; tree 49 drivers/net/ethernet/mellanox/mlx4/srq.c srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1)); tree 176 drivers/net/ethernet/mellanox/mlx4/srq.c err = radix_tree_insert(&srq_table->tree, srq->srqn, srq); tree 213 drivers/net/ethernet/mellanox/mlx4/srq.c radix_tree_delete(&srq_table->tree, srq->srqn); tree 232 drivers/net/ethernet/mellanox/mlx4/srq.c radix_tree_delete(&srq_table->tree, srq->srqn); tree 278 drivers/net/ethernet/mellanox/mlx4/srq.c INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC); tree 303 drivers/net/ethernet/mellanox/mlx4/srq.c srq = radix_tree_lookup(&srq_table->tree, tree 120 drivers/net/ethernet/mellanox/mlx5/core/eq.c cq = radix_tree_lookup(&table->tree, cqn); tree 260 drivers/net/ethernet/mellanox/mlx5/core/eq.c INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC); tree 389 drivers/net/ethernet/mellanox/mlx5/core/eq.c err = radix_tree_insert(&table->tree, cq->cqn, cq); tree 401 drivers/net/ethernet/mellanox/mlx5/core/eq.c tmp = radix_tree_delete(&table->tree, cq->cqn); tree 21 drivers/net/ethernet/mellanox/mlx5/core/lib/eq.h struct radix_tree_root tree; tree 54 drivers/net/ethernet/mellanox/mlx5/core/qp.c common = radix_tree_lookup(&table->tree, rsn); tree 205 drivers/net/ethernet/mellanox/mlx5/core/qp.c err = radix_tree_insert(&table->tree, tree 226 drivers/net/ethernet/mellanox/mlx5/core/qp.c radix_tree_delete(&table->tree, tree 530 drivers/net/ethernet/mellanox/mlx5/core/qp.c INIT_RADIX_TREE(&table->tree, GFP_ATOMIC); tree 84 drivers/of/of_private.h int of_resolve_phandles(struct device_node *tree); tree 733 drivers/of/overlay.c const void *fdt, struct device_node *tree) tree 744 drivers/of/overlay.c if (!of_node_check_flag(tree, OF_DYNAMIC)) tree 747 drivers/of/overlay.c if (!of_node_check_flag(tree, OF_DETACHED)) tree 750 drivers/of/overlay.c if (!of_node_is_root(tree)) tree 753 drivers/of/overlay.c ovcs->overlay_tree = tree; tree 767 drivers/of/overlay.c for_each_child_of_node(tree, node) { tree 775 drivers/of/overlay.c node = of_get_child_by_name(tree, "__symbols__"); tree 788 drivers/of/overlay.c for_each_child_of_node(tree, node) { tree 809 drivers/of/overlay.c node = of_get_child_by_name(tree, "__symbols__"); tree 915 drivers/of/overlay.c static int of_overlay_apply(const void *fdt, struct device_node *tree, tree 929 drivers/of/overlay.c kfree(tree); tree 937 drivers/of/overlay.c kfree(tree); tree 945 drivers/of/overlay.c ret = of_resolve_phandles(tree); tree 949 drivers/of/overlay.c ret = init_overlay_changeset(ovcs, fdt, tree); tree 1001 drivers/of/overlay.c kfree(tree); tree 1078 drivers/of/overlay.c static int find_node(struct device_node *tree, struct device_node *np) tree 1082 drivers/of/overlay.c if (tree == np) tree 1085 drivers/of/overlay.c for_each_child_of_node(tree, child) { tree 84 drivers/sh/intc/core.c radix_tree_insert(&d->tree, enum_id, intc_irq_xlate_get(irq)); tree 200 drivers/sh/intc/core.c INIT_RADIX_TREE(&d->tree, GFP_ATOMIC); tree 57 drivers/sh/intc/internals.h struct radix_tree_root tree; tree 68 drivers/sh/intc/virq.c tagged = radix_tree_tag_get(&d->tree, enum_id, tree 73 drivers/sh/intc/virq.c ptr = radix_tree_lookup(&d->tree, enum_id); tree 154 drivers/sh/intc/virq.c mapped = radix_tree_lookup(&d->tree, subgroup->parent_id); tree 179 drivers/sh/intc/virq.c err = radix_tree_insert(&d->tree, entry->enum_id, entry); tree 183 drivers/sh/intc/virq.c radix_tree_tag_set(&d->tree, entry->enum_id, tree 211 drivers/sh/intc/virq.c nr_found = radix_tree_gang_lookup_tag_slot(&d->tree, tree 253 drivers/sh/intc/virq.c radix_tree_tag_clear(&d->tree, entry->enum_id, tree 255 drivers/sh/intc/virq.c radix_tree_replace_slot(&d->tree, (void **)entries[i], tree 267 drivers/sh/intc/virq.c if (radix_tree_tagged(&d->tree, INTC_TAG_VIRQ_NEEDS_ALLOC)) tree 404 fs/btrfs/backref.c struct preftree *tree = &preftrees->indirect; tree 407 fs/btrfs/backref.c tree = &preftrees->indirect_missing_keys; tree 408 fs/btrfs/backref.c return add_prelim_ref(fs_info, tree, root_id, key, level, 0, tree 719 fs/btrfs/backref.c struct preftree *tree = &preftrees->indirect_missing_keys; tree 722 fs/btrfs/backref.c while ((node = rb_first_cached(&tree->root))) { tree 724 fs/btrfs/backref.c rb_erase_cached(node, &tree->root); tree 442 fs/btrfs/compression.c struct extent_io_tree *tree; tree 448 fs/btrfs/compression.c tree = &BTRFS_I(inode)->io_tree; tree 486 fs/btrfs/compression.c lock_extent(tree, last_offset, end); tree 496 fs/btrfs/compression.c unlock_extent(tree, last_offset, end); tree 524 fs/btrfs/compression.c unlock_extent(tree, last_offset, end); tree 2859 fs/btrfs/ctree.h void btrfs_set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end); tree 967 fs/btrfs/disk-io.c struct extent_io_tree *tree; tree 968 fs/btrfs/disk-io.c tree = &BTRFS_I(page->mapping->host)->io_tree; tree 969 fs/btrfs/disk-io.c return extent_read_full_page(tree, page, btree_get_extent, 0); tree 983 fs/btrfs/disk-io.c struct extent_io_tree *tree; tree 984 fs/btrfs/disk-io.c tree = &BTRFS_I(page->mapping->host)->io_tree; tree 985 fs/btrfs/disk-io.c extent_invalidatepage(tree, page, offset); tree 87 fs/btrfs/extent_io.c #define btrfs_debug_check_extent_io_range(tree, start, end) \ tree 88 fs/btrfs/extent_io.c __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end)) tree 90 fs/btrfs/extent_io.c struct extent_io_tree *tree, u64 start, u64 end) tree 92 fs/btrfs/extent_io.c struct inode *inode = tree->private_data; tree 120 fs/btrfs/extent_io.c struct extent_io_tree *tree; tree 152 fs/btrfs/extent_io.c struct extent_io_tree *tree = bio->bi_private; tree 156 fs/btrfs/extent_io.c if (tree->ops) tree 157 fs/btrfs/extent_io.c ret = tree->ops->submit_bio_hook(tree->private_data, bio, tree 251 fs/btrfs/extent_io.c struct extent_io_tree *tree, unsigned int owner, tree 254 fs/btrfs/extent_io.c tree->fs_info = fs_info; tree 255 fs/btrfs/extent_io.c tree->state = RB_ROOT; tree 256 fs/btrfs/extent_io.c tree->ops = NULL; tree 257 fs/btrfs/extent_io.c tree->dirty_bytes = 0; tree 258 fs/btrfs/extent_io.c spin_lock_init(&tree->lock); tree 259 fs/btrfs/extent_io.c tree->private_data = private_data; tree 260 fs/btrfs/extent_io.c tree->owner = owner; tree 263 fs/btrfs/extent_io.c void extent_io_tree_release(struct extent_io_tree *tree) tree 265 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 272 fs/btrfs/extent_io.c while (!RB_EMPTY_ROOT(&tree->state)) { tree 276 fs/btrfs/extent_io.c node = rb_first(&tree->state); tree 278 fs/btrfs/extent_io.c rb_erase(&state->rb_node, &tree->state); tree 287 fs/btrfs/extent_io.c cond_resched_lock(&tree->lock); tree 289 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 380 fs/btrfs/extent_io.c static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset, tree 386 fs/btrfs/extent_io.c struct rb_root *root = &tree->state; tree 433 fs/btrfs/extent_io.c tree_search_for_insert(struct extent_io_tree *tree, tree 441 fs/btrfs/extent_io.c ret = __etree_search(tree, offset, &next, NULL, p_ret, parent_ret); tree 447 fs/btrfs/extent_io.c static inline struct rb_node *tree_search(struct extent_io_tree *tree, tree 450 fs/btrfs/extent_io.c return tree_search_for_insert(tree, offset, NULL, NULL); tree 462 fs/btrfs/extent_io.c static void merge_state(struct extent_io_tree *tree, tree 476 fs/btrfs/extent_io.c if (tree->private_data && tree 477 fs/btrfs/extent_io.c is_data_inode(tree->private_data)) tree 478 fs/btrfs/extent_io.c btrfs_merge_delalloc_extent(tree->private_data, tree 481 fs/btrfs/extent_io.c rb_erase(&other->rb_node, &tree->state); tree 491 fs/btrfs/extent_io.c if (tree->private_data && tree 492 fs/btrfs/extent_io.c is_data_inode(tree->private_data)) tree 493 fs/btrfs/extent_io.c btrfs_merge_delalloc_extent(tree->private_data, tree 496 fs/btrfs/extent_io.c rb_erase(&other->rb_node, &tree->state); tree 503 fs/btrfs/extent_io.c static void set_state_bits(struct extent_io_tree *tree, tree 517 fs/btrfs/extent_io.c static int insert_state(struct extent_io_tree *tree, tree 526 fs/btrfs/extent_io.c btrfs_err(tree->fs_info, tree 533 fs/btrfs/extent_io.c set_state_bits(tree, state, bits, changeset); tree 535 fs/btrfs/extent_io.c node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent); tree 539 fs/btrfs/extent_io.c btrfs_err(tree->fs_info, tree 544 fs/btrfs/extent_io.c merge_state(tree, state); tree 562 fs/btrfs/extent_io.c static int split_state(struct extent_io_tree *tree, struct extent_state *orig, tree 567 fs/btrfs/extent_io.c if (tree->private_data && is_data_inode(tree->private_data)) tree 568 fs/btrfs/extent_io.c btrfs_split_delalloc_extent(tree->private_data, orig, split); tree 575 fs/btrfs/extent_io.c node = tree_insert(&tree->state, &orig->rb_node, prealloc->end, tree 600 fs/btrfs/extent_io.c static struct extent_state *clear_state_bit(struct extent_io_tree *tree, tree 611 fs/btrfs/extent_io.c WARN_ON(range > tree->dirty_bytes); tree 612 fs/btrfs/extent_io.c tree->dirty_bytes -= range; tree 615 fs/btrfs/extent_io.c if (tree->private_data && is_data_inode(tree->private_data)) tree 616 fs/btrfs/extent_io.c btrfs_clear_delalloc_extent(tree->private_data, state, bits); tree 626 fs/btrfs/extent_io.c rb_erase(&state->rb_node, &tree->state); tree 633 fs/btrfs/extent_io.c merge_state(tree, state); tree 648 fs/btrfs/extent_io.c static void extent_io_tree_panic(struct extent_io_tree *tree, int err) tree 650 fs/btrfs/extent_io.c struct inode *inode = tree->private_data; tree 668 fs/btrfs/extent_io.c int __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 681 fs/btrfs/extent_io.c btrfs_debug_check_extent_io_range(tree, start, end); tree 682 fs/btrfs/extent_io.c trace_btrfs_clear_extent_bit(tree, start, end - start + 1, bits); tree 704 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 727 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 762 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, start); tree 764 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 770 fs/btrfs/extent_io.c state = clear_state_bit(tree, state, &bits, wake, tree 785 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, end + 1); tree 787 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 792 fs/btrfs/extent_io.c clear_state_bit(tree, prealloc, &bits, wake, changeset); tree 798 fs/btrfs/extent_io.c state = clear_state_bit(tree, state, &bits, wake, changeset); tree 809 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 815 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 823 fs/btrfs/extent_io.c static void wait_on_state(struct extent_io_tree *tree, tree 825 fs/btrfs/extent_io.c __releases(tree->lock) tree 826 fs/btrfs/extent_io.c __acquires(tree->lock) tree 830 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 832 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 841 fs/btrfs/extent_io.c static void wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 847 fs/btrfs/extent_io.c btrfs_debug_check_extent_io_range(tree, start, end); tree 849 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 856 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 869 fs/btrfs/extent_io.c wait_on_state(tree, state); tree 878 fs/btrfs/extent_io.c if (!cond_resched_lock(&tree->lock)) { tree 884 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 887 fs/btrfs/extent_io.c static void set_state_bits(struct extent_io_tree *tree, tree 894 fs/btrfs/extent_io.c if (tree->private_data && is_data_inode(tree->private_data)) tree 895 fs/btrfs/extent_io.c btrfs_set_delalloc_extent(tree->private_data, state, bits); tree 899 fs/btrfs/extent_io.c tree->dirty_bytes += range; tree 937 fs/btrfs/extent_io.c __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 951 fs/btrfs/extent_io.c btrfs_debug_check_extent_io_range(tree, start, end); tree 952 fs/btrfs/extent_io.c trace_btrfs_set_extent_bit(tree, start, end - start + 1, bits); tree 966 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 979 fs/btrfs/extent_io.c node = tree_search_for_insert(tree, start, &p, &parent); tree 983 fs/btrfs/extent_io.c err = insert_state(tree, prealloc, start, end, tree 986 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1010 fs/btrfs/extent_io.c set_state_bits(tree, state, &bits, changeset); tree 1012 fs/btrfs/extent_io.c merge_state(tree, state); tree 1048 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, start); tree 1050 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1056 fs/btrfs/extent_io.c set_state_bits(tree, state, &bits, changeset); tree 1058 fs/btrfs/extent_io.c merge_state(tree, state); tree 1090 fs/btrfs/extent_io.c err = insert_state(tree, prealloc, start, this_end, tree 1093 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1115 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, end + 1); tree 1117 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1119 fs/btrfs/extent_io.c set_state_bits(tree, prealloc, &bits, changeset); tree 1121 fs/btrfs/extent_io.c merge_state(tree, prealloc); tree 1129 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1135 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1143 fs/btrfs/extent_io.c int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 1147 fs/btrfs/extent_io.c return __set_extent_bit(tree, start, end, bits, 0, failed_start, tree 1170 fs/btrfs/extent_io.c int convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 1184 fs/btrfs/extent_io.c btrfs_debug_check_extent_io_range(tree, start, end); tree 1185 fs/btrfs/extent_io.c trace_btrfs_convert_extent_bit(tree, start, end - start + 1, bits, tree 1202 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 1216 fs/btrfs/extent_io.c node = tree_search_for_insert(tree, start, &p, &parent); tree 1223 fs/btrfs/extent_io.c err = insert_state(tree, prealloc, start, end, tree 1226 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1243 fs/btrfs/extent_io.c set_state_bits(tree, state, &bits, NULL); tree 1245 fs/btrfs/extent_io.c state = clear_state_bit(tree, state, &clear_bits, 0, NULL); tree 1277 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, start); tree 1279 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1284 fs/btrfs/extent_io.c set_state_bits(tree, state, &bits, NULL); tree 1286 fs/btrfs/extent_io.c state = clear_state_bit(tree, state, &clear_bits, 0, tree 1321 fs/btrfs/extent_io.c err = insert_state(tree, prealloc, start, this_end, tree 1324 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1343 fs/btrfs/extent_io.c err = split_state(tree, state, prealloc, end + 1); tree 1345 fs/btrfs/extent_io.c extent_io_tree_panic(tree, err); tree 1347 fs/btrfs/extent_io.c set_state_bits(tree, prealloc, &bits, NULL); tree 1349 fs/btrfs/extent_io.c clear_state_bit(tree, prealloc, &clear_bits, 0, NULL); tree 1357 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1363 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1371 fs/btrfs/extent_io.c int set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 1382 fs/btrfs/extent_io.c return __set_extent_bit(tree, start, end, bits, 0, NULL, NULL, GFP_NOFS, tree 1386 fs/btrfs/extent_io.c int set_extent_bits_nowait(struct extent_io_tree *tree, u64 start, u64 end, tree 1389 fs/btrfs/extent_io.c return __set_extent_bit(tree, start, end, bits, 0, NULL, NULL, tree 1393 fs/btrfs/extent_io.c int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 1397 fs/btrfs/extent_io.c return __clear_extent_bit(tree, start, end, bits, wake, delete, tree 1401 fs/btrfs/extent_io.c int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 1410 fs/btrfs/extent_io.c return __clear_extent_bit(tree, start, end, bits, 0, 0, NULL, GFP_NOFS, tree 1418 fs/btrfs/extent_io.c int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 1425 fs/btrfs/extent_io.c err = __set_extent_bit(tree, start, end, EXTENT_LOCKED, tree 1429 fs/btrfs/extent_io.c wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED); tree 1438 fs/btrfs/extent_io.c int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end) tree 1443 fs/btrfs/extent_io.c err = __set_extent_bit(tree, start, end, EXTENT_LOCKED, EXTENT_LOCKED, tree 1447 fs/btrfs/extent_io.c clear_extent_bit(tree, start, failed_start - 1, tree 1490 fs/btrfs/extent_io.c find_first_extent_bit_state(struct extent_io_tree *tree, tree 1500 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 1524 fs/btrfs/extent_io.c int find_first_extent_bit(struct extent_io_tree *tree, u64 start, tree 1531 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 1547 fs/btrfs/extent_io.c state = find_first_extent_bit_state(tree, start, bits); tree 1556 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1575 fs/btrfs/extent_io.c void find_first_clear_extent_bit(struct extent_io_tree *tree, u64 start, tree 1581 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 1585 fs/btrfs/extent_io.c node = __etree_search(tree, start, &next, &prev, NULL, NULL); tree 1674 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1683 fs/btrfs/extent_io.c static noinline bool find_delalloc_range(struct extent_io_tree *tree, tree 1693 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 1699 fs/btrfs/extent_io.c node = tree_search(tree, cur_start); tree 1732 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 1790 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; tree 1803 fs/btrfs/extent_io.c found = find_delalloc_range(tree, &delalloc_start, &delalloc_end, tree 1847 fs/btrfs/extent_io.c lock_extent_bits(tree, delalloc_start, delalloc_end, &cached_state); tree 1850 fs/btrfs/extent_io.c ret = test_range_bit(tree, delalloc_start, delalloc_end, tree 1853 fs/btrfs/extent_io.c unlock_extent_cached(tree, delalloc_start, delalloc_end, tree 1962 fs/btrfs/extent_io.c u64 count_range_bits(struct extent_io_tree *tree, tree 1976 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 1978 fs/btrfs/extent_io.c total_bytes = tree->dirty_bytes; tree 1985 fs/btrfs/extent_io.c node = tree_search(tree, cur_start); tree 2013 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 2021 fs/btrfs/extent_io.c static noinline int set_state_failrec(struct extent_io_tree *tree, u64 start, tree 2028 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 2033 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 2045 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 2049 fs/btrfs/extent_io.c static noinline int get_state_failrec(struct extent_io_tree *tree, u64 start, tree 2056 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 2061 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 2073 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 2083 fs/btrfs/extent_io.c int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 2090 fs/btrfs/extent_io.c spin_lock(&tree->lock); tree 2095 fs/btrfs/extent_io.c node = tree_search(tree, start); tree 2129 fs/btrfs/extent_io.c spin_unlock(&tree->lock); tree 2137 fs/btrfs/extent_io.c static void check_page_uptodate(struct extent_io_tree *tree, struct page *page) tree 2141 fs/btrfs/extent_io.c if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1, NULL)) tree 2384 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; tree 2442 fs/btrfs/extent_io.c ret = set_extent_bits(tree, start, end, EXTENT_DAMAGED); tree 2573 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; tree 2589 fs/btrfs/extent_io.c free_io_failure(failure_tree, tree, failrec); tree 2607 fs/btrfs/extent_io.c status = tree->ops->submit_bio_hook(tree->private_data, bio, failrec->this_mirror, tree 2610 fs/btrfs/extent_io.c free_io_failure(failure_tree, tree, failrec); tree 2685 fs/btrfs/extent_io.c endio_readpage_release_extent(struct extent_io_tree *tree, u64 start, u64 len, tree 2691 fs/btrfs/extent_io.c if (uptodate && tree->track_uptodate) tree 2692 fs/btrfs/extent_io.c set_extent_uptodate(tree, start, end, &cached, GFP_ATOMIC); tree 2693 fs/btrfs/extent_io.c unlock_extent_cached_atomic(tree, start, end, &cached); tree 2712 fs/btrfs/extent_io.c struct extent_io_tree *tree, *failure_tree; tree 2735 fs/btrfs/extent_io.c tree = &BTRFS_I(inode)->io_tree; tree 2760 fs/btrfs/extent_io.c ret = tree->ops->readpage_end_io_hook(io_bio, offset, tree 2767 fs/btrfs/extent_io.c failure_tree, tree, start, tree 2825 fs/btrfs/extent_io.c endio_readpage_release_extent(tree, tree 2831 fs/btrfs/extent_io.c endio_readpage_release_extent(tree, start, tree 2839 fs/btrfs/extent_io.c endio_readpage_release_extent(tree, extent_start, tree 2847 fs/btrfs/extent_io.c endio_readpage_release_extent(tree, extent_start, extent_len, tree 2934 fs/btrfs/extent_io.c static int submit_extent_page(unsigned int opf, struct extent_io_tree *tree, tree 2963 fs/btrfs/extent_io.c ASSERT(tree->ops); tree 2987 fs/btrfs/extent_io.c bio->bi_private = tree; tree 3055 fs/btrfs/extent_io.c static int __do_readpage(struct extent_io_tree *tree, tree 3086 fs/btrfs/extent_io.c unlock_extent(tree, start, end); tree 3116 fs/btrfs/extent_io.c set_extent_uptodate(tree, cur, cur + iosize - 1, tree 3118 fs/btrfs/extent_io.c unlock_extent_cached(tree, cur, tree 3126 fs/btrfs/extent_io.c unlock_extent(tree, cur, end); tree 3209 fs/btrfs/extent_io.c set_extent_uptodate(tree, cur, cur + iosize - 1, tree 3211 fs/btrfs/extent_io.c unlock_extent_cached(tree, cur, tree 3218 fs/btrfs/extent_io.c if (test_range_bit(tree, cur, cur_end, tree 3220 fs/btrfs/extent_io.c check_page_uptodate(tree, page); tree 3221 fs/btrfs/extent_io.c unlock_extent(tree, cur, cur + iosize - 1); tree 3231 fs/btrfs/extent_io.c unlock_extent(tree, cur, cur + iosize - 1); tree 3237 fs/btrfs/extent_io.c ret = submit_extent_page(REQ_OP_READ | read_flags, tree, NULL, tree 3249 fs/btrfs/extent_io.c unlock_extent(tree, cur, cur + iosize - 1); tree 3264 fs/btrfs/extent_io.c static inline void contiguous_readpages(struct extent_io_tree *tree, tree 3275 fs/btrfs/extent_io.c btrfs_lock_and_flush_ordered_range(tree, inode, start, end, NULL); tree 3278 fs/btrfs/extent_io.c __do_readpage(tree, pages[index], btrfs_get_extent, em_cached, tree 3284 fs/btrfs/extent_io.c static int __extent_read_full_page(struct extent_io_tree *tree, tree 3296 fs/btrfs/extent_io.c btrfs_lock_and_flush_ordered_range(tree, inode, start, end, NULL); tree 3298 fs/btrfs/extent_io.c ret = __do_readpage(tree, page, get_extent, NULL, bio, mirror_num, tree 3303 fs/btrfs/extent_io.c int extent_read_full_page(struct extent_io_tree *tree, struct page *page, tree 3310 fs/btrfs/extent_io.c ret = __extent_read_full_page(tree, page, get_extent, &bio, mirror_num, tree 3418 fs/btrfs/extent_io.c struct extent_io_tree *tree = epd->tree; tree 3518 fs/btrfs/extent_io.c btrfs_set_range_writeback(tree, cur, cur + iosize - 1); tree 3525 fs/btrfs/extent_io.c ret = submit_extent_page(REQ_OP_WRITE | write_flags, tree, wbc, tree 3857 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(fs_info->btree_inode)->io_tree; tree 3890 fs/btrfs/extent_io.c ret = submit_extent_page(REQ_OP_WRITE | write_flags, tree, wbc, tree 3923 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(mapping->host)->io_tree; tree 3927 fs/btrfs/extent_io.c .tree = tree, tree 4249 fs/btrfs/extent_io.c .tree = &BTRFS_I(page->mapping->host)->io_tree, tree 4271 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; tree 4278 fs/btrfs/extent_io.c .tree = tree, tree 4317 fs/btrfs/extent_io.c .tree = &BTRFS_I(mapping->host)->io_tree, tree 4339 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(mapping->host)->io_tree; tree 4366 fs/btrfs/extent_io.c contiguous_readpages(tree, pagepool, nr, contig_start, tree 4385 fs/btrfs/extent_io.c int extent_invalidatepage(struct extent_io_tree *tree, tree 4397 fs/btrfs/extent_io.c lock_extent_bits(tree, start, end, &cached_state); tree 4399 fs/btrfs/extent_io.c clear_extent_bit(tree, start, end, EXTENT_LOCKED | EXTENT_DELALLOC | tree 4409 fs/btrfs/extent_io.c static int try_release_extent_state(struct extent_io_tree *tree, tree 4416 fs/btrfs/extent_io.c if (test_range_bit(tree, start, end, EXTENT_LOCKED, 0, NULL)) { tree 4423 fs/btrfs/extent_io.c ret = __clear_extent_bit(tree, start, end, tree 4449 fs/btrfs/extent_io.c struct extent_io_tree *tree = &btrfs_inode->io_tree; tree 4469 fs/btrfs/extent_io.c if (!test_range_bit(tree, em->start, tree 4485 fs/btrfs/extent_io.c return try_release_extent_state(tree, page, mask); tree 5459 fs/btrfs/extent_io.c struct extent_io_tree *tree = &BTRFS_I(eb->fs_info->btree_inode)->io_tree; tree 5507 fs/btrfs/extent_io.c err = __extent_read_full_page(tree, page, tree 263 fs/btrfs/extent_io.h struct extent_io_tree *tree, unsigned int owner, tree 265 fs/btrfs/extent_io.h void extent_io_tree_release(struct extent_io_tree *tree); tree 268 fs/btrfs/extent_io.h int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 271 fs/btrfs/extent_io.h static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) tree 273 fs/btrfs/extent_io.h return lock_extent_bits(tree, start, end, NULL); tree 276 fs/btrfs/extent_io.h int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end); tree 277 fs/btrfs/extent_io.h int extent_read_full_page(struct extent_io_tree *tree, struct page *page, tree 282 fs/btrfs/extent_io.h u64 count_range_bits(struct extent_io_tree *tree, tree 287 fs/btrfs/extent_io.h int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 290 fs/btrfs/extent_io.h int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 292 fs/btrfs/extent_io.h int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 295 fs/btrfs/extent_io.h int __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 300 fs/btrfs/extent_io.h static inline int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end) tree 302 fs/btrfs/extent_io.h return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, NULL); tree 305 fs/btrfs/extent_io.h static inline int unlock_extent_cached(struct extent_io_tree *tree, u64 start, tree 308 fs/btrfs/extent_io.h return __clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, cached, tree 312 fs/btrfs/extent_io.h static inline int unlock_extent_cached_atomic(struct extent_io_tree *tree, tree 315 fs/btrfs/extent_io.h return __clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, cached, tree 319 fs/btrfs/extent_io.h static inline int clear_extent_bits(struct extent_io_tree *tree, u64 start, tree 327 fs/btrfs/extent_io.h return clear_extent_bit(tree, start, end, bits, wake, 0, NULL); tree 330 fs/btrfs/extent_io.h int set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, tree 332 fs/btrfs/extent_io.h int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 335 fs/btrfs/extent_io.h int set_extent_bits_nowait(struct extent_io_tree *tree, u64 start, u64 end, tree 338 fs/btrfs/extent_io.h static inline int set_extent_bits(struct extent_io_tree *tree, u64 start, tree 341 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, bits, NULL, NULL, GFP_NOFS); tree 344 fs/btrfs/extent_io.h static inline int clear_extent_uptodate(struct extent_io_tree *tree, u64 start, tree 347 fs/btrfs/extent_io.h return __clear_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, 0, tree 351 fs/btrfs/extent_io.h static inline int set_extent_dirty(struct extent_io_tree *tree, u64 start, tree 354 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, EXTENT_DIRTY, NULL, tree 358 fs/btrfs/extent_io.h static inline int clear_extent_dirty(struct extent_io_tree *tree, u64 start, tree 361 fs/btrfs/extent_io.h return clear_extent_bit(tree, start, end, tree 366 fs/btrfs/extent_io.h int convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, tree 370 fs/btrfs/extent_io.h static inline int set_extent_delalloc(struct extent_io_tree *tree, u64 start, tree 374 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, tree 379 fs/btrfs/extent_io.h static inline int set_extent_defrag(struct extent_io_tree *tree, u64 start, tree 382 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, tree 387 fs/btrfs/extent_io.h static inline int set_extent_new(struct extent_io_tree *tree, u64 start, tree 390 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, EXTENT_NEW, NULL, NULL, tree 394 fs/btrfs/extent_io.h static inline int set_extent_uptodate(struct extent_io_tree *tree, u64 start, tree 397 fs/btrfs/extent_io.h return set_extent_bit(tree, start, end, EXTENT_UPTODATE, NULL, tree 401 fs/btrfs/extent_io.h int find_first_extent_bit(struct extent_io_tree *tree, u64 start, tree 404 fs/btrfs/extent_io.h void find_first_clear_extent_bit(struct extent_io_tree *tree, u64 start, tree 406 fs/btrfs/extent_io.h int extent_invalidatepage(struct extent_io_tree *tree, tree 36 fs/btrfs/extent_map.c void extent_map_tree_init(struct extent_map_tree *tree) tree 38 fs/btrfs/extent_map.c tree->map = RB_ROOT_CACHED; tree 39 fs/btrfs/extent_map.c INIT_LIST_HEAD(&tree->modified_extents); tree 40 fs/btrfs/extent_map.c rwlock_init(&tree->lock); tree 231 fs/btrfs/extent_map.c static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) tree 261 fs/btrfs/extent_map.c rb_erase_cached(&merge->rb_node, &tree->map); tree 273 fs/btrfs/extent_map.c rb_erase_cached(&merge->rb_node, &tree->map); tree 292 fs/btrfs/extent_map.c int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, tree 299 fs/btrfs/extent_map.c write_lock(&tree->lock); tree 300 fs/btrfs/extent_map.c em = lookup_extent_mapping(tree, start, len); tree 317 fs/btrfs/extent_map.c try_merge_map(tree, em); tree 326 fs/btrfs/extent_map.c write_unlock(&tree->lock); tree 331 fs/btrfs/extent_map.c void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) tree 335 fs/btrfs/extent_map.c try_merge_map(tree, em); tree 338 fs/btrfs/extent_map.c static inline void setup_extent_mapping(struct extent_map_tree *tree, tree 347 fs/btrfs/extent_map.c list_move(&em->list, &tree->modified_extents); tree 349 fs/btrfs/extent_map.c try_merge_map(tree, em); tree 393 fs/btrfs/extent_map.c int add_extent_mapping(struct extent_map_tree *tree, tree 398 fs/btrfs/extent_map.c lockdep_assert_held_write(&tree->lock); tree 400 fs/btrfs/extent_map.c ret = tree_insert(&tree->map, em); tree 404 fs/btrfs/extent_map.c setup_extent_mapping(tree, em, modified); tree 414 fs/btrfs/extent_map.c __lookup_extent_mapping(struct extent_map_tree *tree, tree 423 fs/btrfs/extent_map.c rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next); tree 453 fs/btrfs/extent_map.c struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, tree 456 fs/btrfs/extent_map.c return __lookup_extent_mapping(tree, start, len, 1); tree 470 fs/btrfs/extent_map.c struct extent_map *search_extent_mapping(struct extent_map_tree *tree, tree 473 fs/btrfs/extent_map.c return __lookup_extent_mapping(tree, start, len, 0); tree 484 fs/btrfs/extent_map.c void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) tree 487 fs/btrfs/extent_map.c rb_erase_cached(&em->rb_node, &tree->map); tree 495 fs/btrfs/extent_map.c void replace_extent_mapping(struct extent_map_tree *tree, tree 504 fs/btrfs/extent_map.c rb_replace_node_cached(&cur->rb_node, &new->rb_node, &tree->map); tree 507 fs/btrfs/extent_map.c setup_extent_mapping(tree, new, modified); tree 84 fs/btrfs/extent_map.h void extent_map_tree_init(struct extent_map_tree *tree); tree 85 fs/btrfs/extent_map.h struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, tree 87 fs/btrfs/extent_map.h int add_extent_mapping(struct extent_map_tree *tree, tree 89 fs/btrfs/extent_map.h void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em); tree 90 fs/btrfs/extent_map.h void replace_extent_mapping(struct extent_map_tree *tree, tree 99 fs/btrfs/extent_map.h int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, u64 gen); tree 100 fs/btrfs/extent_map.h void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em); tree 101 fs/btrfs/extent_map.h struct extent_map *search_extent_mapping(struct extent_map_tree *tree, tree 8857 fs/btrfs/inode.c struct extent_io_tree *tree; tree 8858 fs/btrfs/inode.c tree = &BTRFS_I(page->mapping->host)->io_tree; tree 8859 fs/btrfs/inode.c return extent_read_full_page(tree, page, btrfs_get_extent, 0); tree 8922 fs/btrfs/inode.c struct extent_io_tree *tree; tree 8940 fs/btrfs/inode.c tree = &BTRFS_I(inode)->io_tree; tree 8947 fs/btrfs/inode.c lock_extent_bits(tree, page_start, page_end, &cached_state); tree 8959 fs/btrfs/inode.c clear_extent_bit(tree, start, end, tree 8968 fs/btrfs/inode.c struct btrfs_ordered_inode_tree *tree; tree 8971 fs/btrfs/inode.c tree = &BTRFS_I(inode)->ordered_tree; tree 8973 fs/btrfs/inode.c spin_lock_irq(&tree->lock); tree 8978 fs/btrfs/inode.c spin_unlock_irq(&tree->lock); tree 8988 fs/btrfs/inode.c lock_extent_bits(tree, start, end, tree 9015 fs/btrfs/inode.c clear_extent_bit(tree, page_start, page_end, EXTENT_LOCKED | tree 10712 fs/btrfs/inode.c void btrfs_set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end) tree 10714 fs/btrfs/inode.c struct inode *inode = tree->private_data; tree 1249 fs/btrfs/ioctl.c struct extent_io_tree *tree; tree 1265 fs/btrfs/ioctl.c tree = &BTRFS_I(inode)->io_tree; tree 1279 fs/btrfs/ioctl.c lock_extent_bits(tree, page_start, page_end, tree 1283 fs/btrfs/ioctl.c unlock_extent_cached(tree, page_start, page_end, tree 141 fs/btrfs/ordered-data.c static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, tree 144 fs/btrfs/ordered-data.c struct rb_root *root = &tree->tree; tree 149 fs/btrfs/ordered-data.c if (tree->last) { tree 150 fs/btrfs/ordered-data.c entry = rb_entry(tree->last, struct btrfs_ordered_extent, tree 153 fs/btrfs/ordered-data.c return tree->last; tree 159 fs/btrfs/ordered-data.c tree->last = ret; tree 180 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 184 fs/btrfs/ordered-data.c tree = &BTRFS_I(inode)->ordered_tree; tree 218 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 219 fs/btrfs/ordered-data.c node = tree_insert(&tree->tree, file_offset, tree 223 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 282 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 284 fs/btrfs/ordered-data.c tree = &BTRFS_I(entry->inode)->ordered_tree; tree 285 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 287 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 307 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 316 fs/btrfs/ordered-data.c tree = &BTRFS_I(inode)->ordered_tree; tree 317 fs/btrfs/ordered-data.c spin_lock_irqsave(&tree->lock, flags); tree 318 fs/btrfs/ordered-data.c node = tree_search(tree, *file_offset); tree 360 fs/btrfs/ordered-data.c spin_unlock_irqrestore(&tree->lock, flags); tree 377 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 383 fs/btrfs/ordered-data.c tree = &BTRFS_I(inode)->ordered_tree; tree 384 fs/btrfs/ordered-data.c spin_lock_irqsave(&tree->lock, flags); tree 390 fs/btrfs/ordered-data.c node = tree_search(tree, file_offset); tree 424 fs/btrfs/ordered-data.c spin_unlock_irqrestore(&tree->lock, flags); tree 464 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 480 fs/btrfs/ordered-data.c tree = &btrfs_inode->ordered_tree; tree 481 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 483 fs/btrfs/ordered-data.c rb_erase(node, &tree->tree); tree 485 fs/btrfs/ordered-data.c if (tree->last == node) tree 486 fs/btrfs/ordered-data.c tree->last = NULL; tree 488 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 715 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 719 fs/btrfs/ordered-data.c tree = &BTRFS_I(inode)->ordered_tree; tree 720 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 721 fs/btrfs/ordered-data.c node = tree_search(tree, file_offset); tree 731 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 741 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 745 fs/btrfs/ordered-data.c tree = &inode->ordered_tree; tree 746 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 747 fs/btrfs/ordered-data.c node = tree_search(tree, file_offset); tree 749 fs/btrfs/ordered-data.c node = tree_search(tree, file_offset + len); tree 771 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 782 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree; tree 786 fs/btrfs/ordered-data.c tree = &BTRFS_I(inode)->ordered_tree; tree 787 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 788 fs/btrfs/ordered-data.c node = tree_search(tree, file_offset); tree 795 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 806 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; tree 816 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 868 fs/btrfs/ordered-data.c prev = tree_search(tree, offset); tree 923 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 938 fs/btrfs/ordered-data.c struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; tree 949 fs/btrfs/ordered-data.c spin_lock_irq(&tree->lock); tree 968 fs/btrfs/ordered-data.c spin_unlock_irq(&tree->lock); tree 987 fs/btrfs/ordered-data.c void btrfs_lock_and_flush_ordered_range(struct extent_io_tree *tree, tree 1000 fs/btrfs/ordered-data.c lock_extent_bits(tree, start, end, cachedp); tree 1013 fs/btrfs/ordered-data.c unlock_extent_cached(tree, start, end, cachedp); tree 12 fs/btrfs/ordered-data.h struct rb_root tree; tree 149 fs/btrfs/ordered-data.h t->tree = RB_ROOT; tree 191 fs/btrfs/ordered-data.h void btrfs_lock_and_flush_ordered_range(struct extent_io_tree *tree, tree 194 fs/btrfs/relocation.c static void mapping_tree_init(struct mapping_tree *tree) tree 196 fs/btrfs/relocation.c tree->rb_root = RB_ROOT; tree 197 fs/btrfs/relocation.c spin_lock_init(&tree->lock); tree 402 fs/btrfs/relocation.c static void drop_backref_node(struct backref_cache *tree, tree 411 fs/btrfs/relocation.c rb_erase(&node->rb_node, &tree->rb_root); tree 412 fs/btrfs/relocation.c free_backref_node(tree, node); tree 439 fs/btrfs/tests/extent-io-tests.c struct extent_io_tree tree; tree 445 fs/btrfs/tests/extent-io-tests.c extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST, NULL); tree 448 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, 0, &start, &end, CHUNK_TRIMMED); tree 459 fs/btrfs/tests/extent-io-tests.c set_extent_bits(&tree, SZ_1M, SZ_4M - 1, tree 462 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, SZ_512K, &start, &end, tree 472 fs/btrfs/tests/extent-io-tests.c set_extent_bits(&tree, SZ_32M, SZ_64M - 1, tree 478 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, 12 * SZ_1M, &start, &end, tree 491 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, SZ_2M, &start, &end, tree 504 fs/btrfs/tests/extent-io-tests.c set_extent_bits(&tree, SZ_64M, SZ_64M + SZ_8M - 1, CHUNK_ALLOCATED); tree 505 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, SZ_64M + SZ_1M, &start, &end, tree 514 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, SZ_64M - SZ_8M, &start, &end, tree 531 fs/btrfs/tests/extent-io-tests.c find_first_clear_extent_bit(&tree, -1, &start, &end, CHUNK_TRIMMED); tree 541 fs/btrfs/tests/extent-io-tests.c clear_extent_bits(&tree, 0, (u64)-1, CHUNK_TRIMMED | CHUNK_ALLOCATED); tree 4377 fs/btrfs/tree-log.c struct extent_map_tree *tree = &inode->extent_tree; tree 4384 fs/btrfs/tree-log.c write_lock(&tree->lock); tree 4387 fs/btrfs/tree-log.c list_for_each_entry_safe(em, n, &tree->modified_extents, list) { tree 4413 fs/btrfs/tree-log.c list_del_init(&tree->modified_extents); tree 4445 fs/btrfs/tree-log.c clear_em_logging(tree, em); tree 4450 fs/btrfs/tree-log.c write_unlock(&tree->lock); tree 4453 fs/btrfs/tree-log.c write_lock(&tree->lock); tree 4454 fs/btrfs/tree-log.c clear_em_logging(tree, em); tree 4458 fs/btrfs/tree-log.c write_unlock(&tree->lock); tree 5414 fs/btrfs/volumes.c void btrfs_mapping_tree_free(struct extent_map_tree *tree) tree 5419 fs/btrfs/volumes.c write_lock(&tree->lock); tree 5420 fs/btrfs/volumes.c em = lookup_extent_mapping(tree, 0, (u64)-1); tree 5422 fs/btrfs/volumes.c remove_extent_mapping(tree, em); tree 5423 fs/btrfs/volumes.c write_unlock(&tree->lock); tree 436 fs/btrfs/volumes.h void btrfs_mapping_tree_free(struct extent_map_tree *tree); tree 271 fs/cifs/cifsproto.h const char *tree, struct cifs_tcon *tcon, tree 131 fs/cifs/cifssmb.c char *tree; tree 137 fs/cifs/cifssmb.c tree = kzalloc(MAX_TREE_SIZE, GFP_KERNEL); tree 138 fs/cifs/cifssmb.c if (!tree) tree 142 fs/cifs/cifssmb.c scnprintf(tree, MAX_TREE_SIZE, "\\\\%s\\IPC$", tree 144 fs/cifs/cifssmb.c rc = CIFSTCon(0, tcon->ses, tree, tcon, nlsc); tree 175 fs/cifs/cifssmb.c scnprintf(tree, MAX_TREE_SIZE, "\\%s", tgt); tree 177 fs/cifs/cifssmb.c rc = CIFSTCon(0, tcon->ses, tree, tcon, nlsc); tree 193 fs/cifs/cifssmb.c kfree(tree); tree 4998 fs/cifs/connect.c const char *tree, struct cifs_tcon *tcon, tree 5081 fs/cifs/connect.c cifs_strtoUTF16((__le16 *) bcc_ptr, tree, tree 5087 fs/cifs/connect.c strcpy(bcc_ptr, tree); tree 5088 fs/cifs/connect.c bcc_ptr += strlen(tree) + 1; tree 5133 fs/cifs/connect.c strlcpy(tcon->treeName, tree, sizeof(tcon->treeName)); tree 165 fs/cifs/smb2pdu.c char *tree; tree 171 fs/cifs/smb2pdu.c tree = kzalloc(MAX_TREE_SIZE, GFP_KERNEL); tree 172 fs/cifs/smb2pdu.c if (!tree) tree 176 fs/cifs/smb2pdu.c scnprintf(tree, MAX_TREE_SIZE, "\\\\%s\\IPC$", tree 178 fs/cifs/smb2pdu.c rc = SMB2_tcon(0, tcon->ses, tree, tcon, nlsc); tree 209 fs/cifs/smb2pdu.c scnprintf(tree, MAX_TREE_SIZE, "\\%s", tgt); tree 211 fs/cifs/smb2pdu.c rc = SMB2_tcon(0, tcon->ses, tree, tcon, nlsc); tree 227 fs/cifs/smb2pdu.c kfree(tree); tree 1675 fs/cifs/smb2pdu.c SMB2_tcon(const unsigned int xid, struct cifs_ses *ses, const char *tree, tree 1693 fs/cifs/smb2pdu.c if (!server || !tree) tree 1700 fs/cifs/smb2pdu.c unc_path_len = cifs_strtoUTF16(unc_path, tree, strlen(tree), cp) + 1; tree 1753 fs/cifs/smb2pdu.c trace_smb3_tcon(xid, tcon->tid, ses->Suid, tree, rc); tree 1786 fs/cifs/smb2pdu.c strlcpy(tcon->treeName, tree, sizeof(tcon->treeName)); tree 1807 fs/cifs/smb2pdu.c cifs_tcon_dbg(VFS, "BAD_NETWORK_NAME: %s\n", tree); tree 133 fs/cifs/smb2proto.h const char *tree, struct cifs_tcon *tcon, tree 421 fs/dlm/debug_fs.c struct rb_root *tree; tree 450 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; tree 453 fs/dlm/debug_fs.c if (!RB_EMPTY_ROOT(tree)) { tree 454 fs/dlm/debug_fs.c for (node = rb_first(tree); node; node = rb_next(node)) { tree 482 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; tree 485 fs/dlm/debug_fs.c if (!RB_EMPTY_ROOT(tree)) { tree 486 fs/dlm/debug_fs.c node = rb_first(tree); tree 503 fs/dlm/debug_fs.c struct rb_root *tree; tree 547 fs/dlm/debug_fs.c tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; tree 550 fs/dlm/debug_fs.c if (!RB_EMPTY_ROOT(tree)) { tree 551 fs/dlm/debug_fs.c next = rb_first(tree); tree 445 fs/dlm/lock.c int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len, tree 448 fs/dlm/lock.c struct rb_node *node = tree->rb_node; tree 470 fs/dlm/lock.c static int rsb_insert(struct dlm_rsb *rsb, struct rb_root *tree) tree 472 fs/dlm/lock.c struct rb_node **newn = &tree->rb_node; tree 495 fs/dlm/lock.c rb_insert_color(&rsb->res_hashnode, tree); tree 33 fs/dlm/lock.h int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len, tree 171 fs/ext4/extents_status.c void ext4_es_init_tree(struct ext4_es_tree *tree) tree 173 fs/ext4/extents_status.c tree->root = RB_ROOT; tree 174 fs/ext4/extents_status.c tree->cache_es = NULL; tree 180 fs/ext4/extents_status.c struct ext4_es_tree *tree; tree 184 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_es_tree; tree 185 fs/ext4/extents_status.c node = rb_first(&tree->root); tree 261 fs/ext4/extents_status.c struct ext4_es_tree *tree = NULL; tree 268 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_es_tree; tree 272 fs/ext4/extents_status.c if (tree->cache_es) { tree 273 fs/ext4/extents_status.c es1 = tree->cache_es; tree 282 fs/ext4/extents_status.c es1 = __es_tree_search(&tree->root, lblk); tree 298 fs/ext4/extents_status.c tree->cache_es = es1; tree 531 fs/ext4/extents_status.c struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; tree 544 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); tree 555 fs/ext4/extents_status.c struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; tree 568 fs/ext4/extents_status.c rb_erase(node, &tree->root); tree 750 fs/ext4/extents_status.c struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; tree 751 fs/ext4/extents_status.c struct rb_node **p = &tree->root.rb_node; tree 793 fs/ext4/extents_status.c rb_insert_color(&es->rb_node, &tree->root); tree 796 fs/ext4/extents_status.c tree->cache_es = es; tree 905 fs/ext4/extents_status.c struct ext4_es_tree *tree; tree 914 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_es_tree; tree 919 fs/ext4/extents_status.c if (tree->cache_es) { tree 920 fs/ext4/extents_status.c es1 = tree->cache_es; tree 929 fs/ext4/extents_status.c node = tree->root.rb_node; tree 1163 fs/ext4/extents_status.c struct ext4_pending_tree *tree = &EXT4_I(inode)->i_pending_tree; tree 1255 fs/ext4/extents_status.c pr = __pr_tree_search(&tree->root, first_lclu); tree 1259 fs/ext4/extents_status.c rb_erase(&pr->rb_node, &tree->root); tree 1288 fs/ext4/extents_status.c struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; tree 1303 fs/ext4/extents_status.c es = __es_tree_search(&tree->root, lblk); tree 1310 fs/ext4/extents_status.c tree->cache_es = NULL; tree 1375 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); tree 1675 fs/ext4/extents_status.c struct ext4_es_tree *tree = &ei->i_es_tree; tree 1679 fs/ext4/extents_status.c es = __es_tree_search(&tree->root, ei->i_es_shrink_lblk); tree 1702 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); tree 1749 fs/ext4/extents_status.c struct ext4_es_tree *tree; tree 1753 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_es_tree; tree 1754 fs/ext4/extents_status.c tree->cache_es = NULL; tree 1755 fs/ext4/extents_status.c node = rb_first(&tree->root); tree 1760 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); tree 1771 fs/ext4/extents_status.c struct ext4_pending_tree *tree; tree 1776 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_pending_tree; tree 1777 fs/ext4/extents_status.c node = rb_first(&tree->root); tree 1804 fs/ext4/extents_status.c void ext4_init_pending_tree(struct ext4_pending_tree *tree) tree 1806 fs/ext4/extents_status.c tree->root = RB_ROOT; tree 1821 fs/ext4/extents_status.c struct ext4_pending_tree *tree; tree 1825 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_pending_tree; tree 1826 fs/ext4/extents_status.c node = (&tree->root)->rb_node; tree 1853 fs/ext4/extents_status.c struct ext4_pending_tree *tree = &EXT4_I(inode)->i_pending_tree; tree 1854 fs/ext4/extents_status.c struct rb_node **p = &tree->root.rb_node; tree 1884 fs/ext4/extents_status.c rb_insert_color(&pr->rb_node, &tree->root); tree 1903 fs/ext4/extents_status.c struct ext4_pending_tree *tree; tree 1907 fs/ext4/extents_status.c tree = &EXT4_I(inode)->i_pending_tree; tree 1908 fs/ext4/extents_status.c rb_erase(&pr->rb_node, &tree->root); tree 2023 fs/ext4/extents_status.c struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; tree 2034 fs/ext4/extents_status.c es = __es_tree_search(&tree->root, start); tree 128 fs/ext4/extents_status.h extern void ext4_es_init_tree(struct ext4_es_tree *tree); tree 243 fs/ext4/extents_status.h extern void ext4_init_pending_tree(struct ext4_pending_tree *tree); tree 15 fs/hfs/bfind.c int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) tree 19 fs/hfs/bfind.c fd->tree = tree; tree 21 fs/hfs/bfind.c ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); tree 25 fs/hfs/bfind.c fd->key = ptr + tree->max_key_len + 2; tree 27 fs/hfs/bfind.c tree->cnid, __builtin_return_address(0)); tree 28 fs/hfs/bfind.c mutex_lock(&tree->tree_lock); tree 37 fs/hfs/bfind.c fd->tree->cnid, __builtin_return_address(0)); tree 38 fs/hfs/bfind.c mutex_unlock(&fd->tree->tree_lock); tree 39 fs/hfs/bfind.c fd->tree = NULL; tree 63 fs/hfs/bfind.c cmpval = bnode->tree->keycmp(fd->key, fd->search_key); tree 97 fs/hfs/bfind.c struct hfs_btree *tree; tree 103 fs/hfs/bfind.c tree = fd->tree; tree 107 fs/hfs/bfind.c nidx = tree->root; tree 110 fs/hfs/bfind.c height = tree->depth; tree 114 fs/hfs/bfind.c bnode = hfs_bnode_find(tree, nidx); tree 164 fs/hfs/bfind.c struct hfs_btree *tree; tree 170 fs/hfs/bfind.c tree = bnode->tree; tree 183 fs/hfs/bfind.c bnode = hfs_bnode_find(tree, idx); tree 201 fs/hfs/bfind.c bnode = hfs_bnode_find(tree, idx); tree 48 fs/hfs/bnode.c struct hfs_btree *tree; tree 51 fs/hfs/bnode.c tree = node->tree; tree 53 fs/hfs/bnode.c tree->attributes & HFS_TREE_VARIDXKEYS) tree 56 fs/hfs/bnode.c key_len = tree->max_key_len + 1; tree 146 fs/hfs/bnode.c off = node->tree->node_size - 2; tree 153 fs/hfs/bnode.c if (node->tree->attributes & HFS_TREE_VARIDXKEYS) tree 156 fs/hfs/bnode.c tmp = node->tree->max_key_len + 1; tree 173 fs/hfs/bnode.c struct hfs_btree *tree; tree 177 fs/hfs/bnode.c tree = node->tree; tree 179 fs/hfs/bnode.c tmp = hfs_bnode_find(tree, node->prev); tree 187 fs/hfs/bnode.c tree->leaf_head = node->next; tree 190 fs/hfs/bnode.c tmp = hfs_bnode_find(tree, node->next); tree 198 fs/hfs/bnode.c tree->leaf_tail = node->prev; tree 205 fs/hfs/bnode.c tree->root = 0; tree 206 fs/hfs/bnode.c tree->depth = 0; tree 218 fs/hfs/bnode.c struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) tree 222 fs/hfs/bnode.c if (cnid >= tree->node_count) { tree 227 fs/hfs/bnode.c for (node = tree->node_hash[hfs_bnode_hash(cnid)]; tree 236 fs/hfs/bnode.c static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) tree 244 fs/hfs/bnode.c if (cnid >= tree->node_count) { tree 249 fs/hfs/bnode.c size = sizeof(struct hfs_bnode) + tree->pages_per_bnode * tree 254 fs/hfs/bnode.c node->tree = tree; tree 259 fs/hfs/bnode.c node->tree->cnid, node->this); tree 261 fs/hfs/bnode.c spin_lock(&tree->hash_lock); tree 262 fs/hfs/bnode.c node2 = hfs_bnode_findhash(tree, cnid); tree 265 fs/hfs/bnode.c node->next_hash = tree->node_hash[hash]; tree 266 fs/hfs/bnode.c tree->node_hash[hash] = node; tree 267 fs/hfs/bnode.c tree->node_hash_cnt++; tree 269 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 274 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 276 fs/hfs/bnode.c mapping = tree->inode->i_mapping; tree 277 fs/hfs/bnode.c off = (loff_t)cnid * tree->node_size; tree 280 fs/hfs/bnode.c for (i = 0; i < tree->pages_per_bnode; i++) { tree 302 fs/hfs/bnode.c node->tree->cnid, node->this, atomic_read(&node->refcnt)); tree 303 fs/hfs/bnode.c for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; tree 308 fs/hfs/bnode.c node->tree->node_hash_cnt--; tree 312 fs/hfs/bnode.c struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) tree 319 fs/hfs/bnode.c spin_lock(&tree->hash_lock); tree 320 fs/hfs/bnode.c node = hfs_bnode_findhash(tree, num); tree 323 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 329 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 330 fs/hfs/bnode.c node = __hfs_bnode_create(tree, num); tree 357 fs/hfs/bnode.c if (node->height <= 1 || node->height > tree->depth) tree 364 fs/hfs/bnode.c rec_off = tree->node_size - 2; tree 372 fs/hfs/bnode.c next_off > tree->node_size || tree 399 fs/hfs/bnode.c for (i = 0; i < node->tree->pages_per_bnode; i++) tree 405 fs/hfs/bnode.c struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) tree 411 fs/hfs/bnode.c spin_lock(&tree->hash_lock); tree 412 fs/hfs/bnode.c node = hfs_bnode_findhash(tree, num); tree 413 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 419 fs/hfs/bnode.c node = __hfs_bnode_create(tree, num); tree 429 fs/hfs/bnode.c min((int)PAGE_SIZE, (int)tree->node_size)); tree 432 fs/hfs/bnode.c for (i = 1; i < tree->pages_per_bnode; i++) { tree 448 fs/hfs/bnode.c node->tree->cnid, node->this, tree 457 fs/hfs/bnode.c struct hfs_btree *tree = node->tree; tree 461 fs/hfs/bnode.c node->tree->cnid, node->this, tree 464 fs/hfs/bnode.c if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock)) tree 466 fs/hfs/bnode.c for (i = 0; i < tree->pages_per_bnode; i++) { tree 474 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 479 fs/hfs/bnode.c spin_unlock(&tree->hash_lock); tree 16 fs/hfs/brec.c static int hfs_btree_inc_height(struct hfs_btree *tree); tree 24 fs/hfs/brec.c dataoff = node->tree->node_size - (rec + 2) * 2; tree 39 fs/hfs/brec.c !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { tree 40 fs/hfs/brec.c if (node->tree->attributes & HFS_TREE_BIGKEYS) tree 41 fs/hfs/brec.c retval = node->tree->max_key_len + 2; tree 43 fs/hfs/brec.c retval = node->tree->max_key_len + 1; tree 45 fs/hfs/brec.c recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); tree 48 fs/hfs/brec.c if (node->tree->attributes & HFS_TREE_BIGKEYS) { tree 50 fs/hfs/brec.c if (retval > node->tree->max_key_len + 2) { tree 56 fs/hfs/brec.c if (retval > node->tree->max_key_len + 1) { tree 67 fs/hfs/brec.c struct hfs_btree *tree; tree 74 fs/hfs/brec.c tree = fd->tree; tree 76 fs/hfs/brec.c if (!tree->root) tree 77 fs/hfs/brec.c hfs_btree_inc_height(tree); tree 78 fs/hfs/brec.c node = hfs_bnode_find(tree, tree->leaf_head); tree 94 fs/hfs/brec.c end_rec_off = tree->node_size - (node->num_recs + 1) * 2; tree 108 fs/hfs/brec.c tree->leaf_count++; tree 109 fs/hfs/brec.c mark_inode_dirty(tree->inode); tree 117 fs/hfs/brec.c idx_rec_off = tree->node_size - (rec + 1) * 2; tree 148 fs/hfs/brec.c hfs_btree_inc_height(tree); tree 149 fs/hfs/brec.c new_node->parent = tree->root; tree 151 fs/hfs/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); tree 165 fs/hfs/brec.c if (tree->attributes & HFS_TREE_VARIDXKEYS) tree 168 fs/hfs/brec.c fd->search_key->key_len = tree->max_key_len; tree 169 fs/hfs/brec.c key_len = tree->max_key_len + 1; tree 179 fs/hfs/brec.c struct hfs_btree *tree; tree 183 fs/hfs/brec.c tree = fd->tree; tree 186 fs/hfs/brec.c rec_off = tree->node_size - (fd->record + 2) * 2; tree 187 fs/hfs/brec.c end_off = tree->node_size - (node->num_recs + 1) * 2; tree 190 fs/hfs/brec.c tree->leaf_count--; tree 191 fs/hfs/brec.c mark_inode_dirty(tree->inode); tree 200 fs/hfs/brec.c parent = hfs_bnode_find(tree, node->parent); tree 233 fs/hfs/brec.c struct hfs_btree *tree; tree 239 fs/hfs/brec.c tree = fd->tree; tree 241 fs/hfs/brec.c new_node = hfs_bmap_alloc(tree); tree 254 fs/hfs/brec.c next_node = hfs_bnode_find(tree, node->next); tree 264 fs/hfs/brec.c size = tree->node_size / 2 - node->num_recs * 2 - 14; tree 265 fs/hfs/brec.c old_rec_off = tree->node_size - 4; tree 300 fs/hfs/brec.c new_rec_off = tree->node_size - 2; tree 339 fs/hfs/brec.c } else if (node->this == tree->leaf_tail) { tree 341 fs/hfs/brec.c tree->leaf_tail = new_node->this; tree 342 fs/hfs/brec.c mark_inode_dirty(tree->inode); tree 354 fs/hfs/brec.c struct hfs_btree *tree; tree 360 fs/hfs/brec.c tree = fd->tree; tree 367 fs/hfs/brec.c parent = hfs_bnode_find(tree, node->parent); tree 377 fs/hfs/brec.c if (tree->attributes & HFS_TREE_VARIDXKEYS) tree 380 fs/hfs/brec.c fd->keylength = newkeylen = tree->max_key_len + 1; tree 384 fs/hfs/brec.c rec_off = tree->node_size - (rec + 2) * 2; tree 385 fs/hfs/brec.c end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; tree 400 fs/hfs/brec.c rec_off = tree->node_size - (rec + 2) * 2; tree 401 fs/hfs/brec.c end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; tree 418 fs/hfs/brec.c if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) tree 429 fs/hfs/brec.c hfs_btree_inc_height(tree); tree 430 fs/hfs/brec.c new_node->parent = tree->root; tree 432 fs/hfs/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); tree 458 fs/hfs/brec.c static int hfs_btree_inc_height(struct hfs_btree *tree) tree 466 fs/hfs/brec.c if (tree->root) { tree 467 fs/hfs/brec.c node = hfs_bnode_find(tree, tree->root); tree 471 fs/hfs/brec.c new_node = hfs_bmap_alloc(tree); tree 477 fs/hfs/brec.c tree->root = new_node->this; tree 478 fs/hfs/brec.c if (!tree->depth) { tree 479 fs/hfs/brec.c tree->leaf_head = tree->leaf_tail = new_node->this; tree 489 fs/hfs/brec.c new_node->height = ++tree->depth; tree 499 fs/hfs/brec.c rec = tree->node_size - 2; tree 504 fs/hfs/brec.c node->parent = tree->root; tree 506 fs/hfs/brec.c tree->attributes & HFS_TREE_VARIDXKEYS) tree 509 fs/hfs/brec.c key_size = tree->max_key_len + 1; tree 512 fs/hfs/brec.c if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) { tree 513 fs/hfs/brec.c key_size = tree->max_key_len + 1; tree 514 fs/hfs/brec.c hfs_bnode_write_u8(new_node, 14, tree->max_key_len); tree 526 fs/hfs/brec.c mark_inode_dirty(tree->inode); tree 21 fs/hfs/btree.c struct hfs_btree *tree; tree 27 fs/hfs/btree.c tree = kzalloc(sizeof(*tree), GFP_KERNEL); tree 28 fs/hfs/btree.c if (!tree) tree 31 fs/hfs/btree.c mutex_init(&tree->tree_lock); tree 32 fs/hfs/btree.c spin_lock_init(&tree->hash_lock); tree 34 fs/hfs/btree.c tree->sb = sb; tree 35 fs/hfs/btree.c tree->cnid = id; tree 36 fs/hfs/btree.c tree->keycmp = keycmp; tree 38 fs/hfs/btree.c tree->inode = iget_locked(sb, id); tree 39 fs/hfs/btree.c if (!tree->inode) tree 41 fs/hfs/btree.c BUG_ON(!(tree->inode->i_state & I_NEW)); tree 44 fs/hfs/btree.c HFS_I(tree->inode)->flags = 0; tree 45 fs/hfs/btree.c mutex_init(&HFS_I(tree->inode)->extents_lock); tree 48 fs/hfs/btree.c hfs_inode_read_fork(tree->inode, mdb->drXTExtRec, mdb->drXTFlSize, tree 50 fs/hfs/btree.c if (HFS_I(tree->inode)->alloc_blocks > tree 51 fs/hfs/btree.c HFS_I(tree->inode)->first_blocks) { tree 53 fs/hfs/btree.c unlock_new_inode(tree->inode); tree 57 fs/hfs/btree.c tree->inode->i_mapping->a_ops = &hfs_btree_aops; tree 60 fs/hfs/btree.c hfs_inode_read_fork(tree->inode, mdb->drCTExtRec, mdb->drCTFlSize, tree 63 fs/hfs/btree.c if (!HFS_I(tree->inode)->first_blocks) { tree 65 fs/hfs/btree.c unlock_new_inode(tree->inode); tree 69 fs/hfs/btree.c tree->inode->i_mapping->a_ops = &hfs_btree_aops; tree 75 fs/hfs/btree.c unlock_new_inode(tree->inode); tree 77 fs/hfs/btree.c mapping = tree->inode->i_mapping; tree 84 fs/hfs/btree.c tree->root = be32_to_cpu(head->root); tree 85 fs/hfs/btree.c tree->leaf_count = be32_to_cpu(head->leaf_count); tree 86 fs/hfs/btree.c tree->leaf_head = be32_to_cpu(head->leaf_head); tree 87 fs/hfs/btree.c tree->leaf_tail = be32_to_cpu(head->leaf_tail); tree 88 fs/hfs/btree.c tree->node_count = be32_to_cpu(head->node_count); tree 89 fs/hfs/btree.c tree->free_nodes = be32_to_cpu(head->free_nodes); tree 90 fs/hfs/btree.c tree->attributes = be32_to_cpu(head->attributes); tree 91 fs/hfs/btree.c tree->node_size = be16_to_cpu(head->node_size); tree 92 fs/hfs/btree.c tree->max_key_len = be16_to_cpu(head->max_key_len); tree 93 fs/hfs/btree.c tree->depth = be16_to_cpu(head->depth); tree 95 fs/hfs/btree.c size = tree->node_size; tree 98 fs/hfs/btree.c if (!tree->node_count) tree 102 fs/hfs/btree.c if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) { tree 104 fs/hfs/btree.c tree->max_key_len); tree 109 fs/hfs/btree.c if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) { tree 111 fs/hfs/btree.c tree->max_key_len); tree 119 fs/hfs/btree.c tree->node_size_shift = ffs(size) - 1; tree 120 fs/hfs/btree.c tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT; tree 124 fs/hfs/btree.c return tree; tree 129 fs/hfs/btree.c tree->inode->i_mapping->a_ops = &hfs_aops; tree 130 fs/hfs/btree.c iput(tree->inode); tree 132 fs/hfs/btree.c kfree(tree); tree 137 fs/hfs/btree.c void hfs_btree_close(struct hfs_btree *tree) tree 142 fs/hfs/btree.c if (!tree) tree 146 fs/hfs/btree.c while ((node = tree->node_hash[i])) { tree 147 fs/hfs/btree.c tree->node_hash[i] = node->next_hash; tree 150 fs/hfs/btree.c node->tree->cnid, node->this, tree 153 fs/hfs/btree.c tree->node_hash_cnt--; tree 156 fs/hfs/btree.c iput(tree->inode); tree 157 fs/hfs/btree.c kfree(tree); tree 160 fs/hfs/btree.c void hfs_btree_write(struct hfs_btree *tree) tree 166 fs/hfs/btree.c node = hfs_bnode_find(tree, 0); tree 174 fs/hfs/btree.c head->root = cpu_to_be32(tree->root); tree 175 fs/hfs/btree.c head->leaf_count = cpu_to_be32(tree->leaf_count); tree 176 fs/hfs/btree.c head->leaf_head = cpu_to_be32(tree->leaf_head); tree 177 fs/hfs/btree.c head->leaf_tail = cpu_to_be32(tree->leaf_tail); tree 178 fs/hfs/btree.c head->node_count = cpu_to_be32(tree->node_count); tree 179 fs/hfs/btree.c head->free_nodes = cpu_to_be32(tree->free_nodes); tree 180 fs/hfs/btree.c head->attributes = cpu_to_be32(tree->attributes); tree 181 fs/hfs/btree.c head->depth = cpu_to_be16(tree->depth); tree 190 fs/hfs/btree.c struct hfs_btree *tree = prev->tree; tree 195 fs/hfs/btree.c node = hfs_bnode_create(tree, idx); tree 199 fs/hfs/btree.c if (!tree->free_nodes) tree 201 fs/hfs/btree.c tree->free_nodes--; tree 208 fs/hfs/btree.c hfs_bnode_clear(node, 0, tree->node_size); tree 217 fs/hfs/btree.c hfs_bnode_write_u16(node, tree->node_size - 2, 14); tree 218 fs/hfs/btree.c hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); tree 224 fs/hfs/btree.c int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) tree 226 fs/hfs/btree.c struct inode *inode = tree->inode; tree 230 fs/hfs/btree.c while (tree->free_nodes < rsvd_nodes) { tree 236 fs/hfs/btree.c HFS_SB(tree->sb)->alloc_blksz; tree 238 fs/hfs/btree.c tree->sb->s_blocksize_bits; tree 240 fs/hfs/btree.c count = inode->i_size >> tree->node_size_shift; tree 241 fs/hfs/btree.c tree->free_nodes += count - tree->node_count; tree 242 fs/hfs/btree.c tree->node_count = count; tree 247 fs/hfs/btree.c struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) tree 258 fs/hfs/btree.c res = hfs_bmap_reserve(tree, 1); tree 263 fs/hfs/btree.c node = hfs_bnode_find(tree, nidx); tree 285 fs/hfs/btree.c tree->free_nodes--; tree 286 fs/hfs/btree.c mark_inode_dirty(tree->inode); tree 288 fs/hfs/btree.c return hfs_bnode_create(tree, idx); tree 306 fs/hfs/btree.c next_node = hfs_bnode_find(tree, nidx); tree 323 fs/hfs/btree.c struct hfs_btree *tree; tree 330 fs/hfs/btree.c tree = node->tree; tree 332 fs/hfs/btree.c node = hfs_bnode_find(tree, 0); tree 349 fs/hfs/btree.c node = hfs_bnode_find(tree, i); tree 378 fs/hfs/btree.c tree->free_nodes++; tree 379 fs/hfs/btree.c mark_inode_dirty(tree->inode); tree 47 fs/hfs/btree.h struct hfs_btree *tree; tree 73 fs/hfs/btree.h struct hfs_btree *tree; tree 104 fs/hfs/catalog.c err = hfs_bmap_reserve(fd.tree, 2 * fd.tree->depth); tree 254 fs/hfs/catalog.c if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0) tree 310 fs/hfs/catalog.c err = hfs_bmap_reserve(src_fd.tree, 2 * src_fd.tree->depth); tree 121 fs/hfs/extent.c res = hfs_bmap_reserve(fd->tree, fd->tree->depth + 1); tree 76 fs/hfs/inode.c struct hfs_btree *tree; tree 83 fs/hfs/inode.c tree = HFS_SB(sb)->ext_tree; tree 86 fs/hfs/inode.c tree = HFS_SB(sb)->cat_tree; tree 93 fs/hfs/inode.c if (!tree) tree 96 fs/hfs/inode.c if (tree->node_size >= PAGE_SIZE) { tree 97 fs/hfs/inode.c nidx = page->index >> (tree->node_size_shift - PAGE_SHIFT); tree 98 fs/hfs/inode.c spin_lock(&tree->hash_lock); tree 99 fs/hfs/inode.c node = hfs_bnode_findhash(tree, nidx); tree 108 fs/hfs/inode.c spin_unlock(&tree->hash_lock); tree 110 fs/hfs/inode.c nidx = page->index << (PAGE_SHIFT - tree->node_size_shift); tree 111 fs/hfs/inode.c i = 1 << (PAGE_SHIFT - tree->node_size_shift); tree 112 fs/hfs/inode.c spin_lock(&tree->hash_lock); tree 114 fs/hfs/inode.c node = hfs_bnode_findhash(tree, nidx++); tree 123 fs/hfs/inode.c } while (--i && nidx < tree->node_count); tree 124 fs/hfs/inode.c spin_unlock(&tree->hash_lock); tree 221 fs/hfsplus/attributes.c err = hfs_bmap_reserve(fd.tree, fd.tree->depth + 1); tree 326 fs/hfsplus/attributes.c err = hfs_bmap_reserve(fd.tree, fd.tree->depth); tree 15 fs/hfsplus/bfind.c int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) tree 19 fs/hfsplus/bfind.c fd->tree = tree; tree 21 fs/hfsplus/bfind.c ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); tree 25 fs/hfsplus/bfind.c fd->key = ptr + tree->max_key_len + 2; tree 27 fs/hfsplus/bfind.c tree->cnid, __builtin_return_address(0)); tree 28 fs/hfsplus/bfind.c switch (tree->cnid) { tree 30 fs/hfsplus/bfind.c mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); tree 33 fs/hfsplus/bfind.c mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); tree 36 fs/hfsplus/bfind.c mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX); tree 49 fs/hfsplus/bfind.c fd->tree->cnid, __builtin_return_address(0)); tree 50 fs/hfsplus/bfind.c mutex_unlock(&fd->tree->tree_lock); tree 51 fs/hfsplus/bfind.c fd->tree = NULL; tree 63 fs/hfsplus/bfind.c if (bnode->tree->cnid == HFSPLUS_EXT_CNID) { tree 66 fs/hfsplus/bfind.c } else if (bnode->tree->cnid == HFSPLUS_CAT_CNID) { tree 69 fs/hfsplus/bfind.c } else if (bnode->tree->cnid == HFSPLUS_ATTR_CNID) { tree 100 fs/hfsplus/bfind.c cmpval = bnode->tree->keycmp(fd->key, fd->search_key); tree 166 fs/hfsplus/bfind.c struct hfs_btree *tree; tree 172 fs/hfsplus/bfind.c tree = fd->tree; tree 176 fs/hfsplus/bfind.c nidx = tree->root; tree 179 fs/hfsplus/bfind.c height = tree->depth; tree 183 fs/hfsplus/bfind.c bnode = hfs_bnode_find(tree, nidx); tree 233 fs/hfsplus/bfind.c struct hfs_btree *tree; tree 239 fs/hfsplus/bfind.c tree = bnode->tree; tree 252 fs/hfsplus/bfind.c bnode = hfs_bnode_find(tree, idx); tree 270 fs/hfsplus/bfind.c bnode = hfs_bnode_find(tree, idx); tree 61 fs/hfsplus/bnode.c struct hfs_btree *tree; tree 64 fs/hfsplus/bnode.c tree = node->tree; tree 66 fs/hfsplus/bnode.c tree->attributes & HFS_TREE_VARIDXKEYS || tree 67 fs/hfsplus/bnode.c node->tree->cnid == HFSPLUS_ATTR_CNID) tree 70 fs/hfsplus/bnode.c key_len = tree->max_key_len + 2; tree 310 fs/hfsplus/bnode.c off = node->tree->node_size - 2; tree 317 fs/hfsplus/bnode.c if (node->tree->attributes & HFS_TREE_VARIDXKEYS || tree 318 fs/hfsplus/bnode.c node->tree->cnid == HFSPLUS_ATTR_CNID) tree 321 fs/hfsplus/bnode.c tmp = node->tree->max_key_len + 2; tree 337 fs/hfsplus/bnode.c struct hfs_btree *tree; tree 341 fs/hfsplus/bnode.c tree = node->tree; tree 343 fs/hfsplus/bnode.c tmp = hfs_bnode_find(tree, node->prev); tree 352 fs/hfsplus/bnode.c tree->leaf_head = node->next; tree 355 fs/hfsplus/bnode.c tmp = hfs_bnode_find(tree, node->next); tree 364 fs/hfsplus/bnode.c tree->leaf_tail = node->prev; tree 370 fs/hfsplus/bnode.c tree->root = 0; tree 371 fs/hfsplus/bnode.c tree->depth = 0; tree 383 fs/hfsplus/bnode.c struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) tree 387 fs/hfsplus/bnode.c if (cnid >= tree->node_count) { tree 393 fs/hfsplus/bnode.c for (node = tree->node_hash[hfs_bnode_hash(cnid)]; tree 400 fs/hfsplus/bnode.c static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) tree 408 fs/hfsplus/bnode.c if (cnid >= tree->node_count) { tree 414 fs/hfsplus/bnode.c size = sizeof(struct hfs_bnode) + tree->pages_per_bnode * tree 419 fs/hfsplus/bnode.c node->tree = tree; tree 424 fs/hfsplus/bnode.c node->tree->cnid, node->this); tree 426 fs/hfsplus/bnode.c spin_lock(&tree->hash_lock); tree 427 fs/hfsplus/bnode.c node2 = hfs_bnode_findhash(tree, cnid); tree 430 fs/hfsplus/bnode.c node->next_hash = tree->node_hash[hash]; tree 431 fs/hfsplus/bnode.c tree->node_hash[hash] = node; tree 432 fs/hfsplus/bnode.c tree->node_hash_cnt++; tree 434 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 440 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 442 fs/hfsplus/bnode.c mapping = tree->inode->i_mapping; tree 443 fs/hfsplus/bnode.c off = (loff_t)cnid << tree->node_size_shift; tree 446 fs/hfsplus/bnode.c for (i = 0; i < tree->pages_per_bnode; block++, i++) { tree 468 fs/hfsplus/bnode.c node->tree->cnid, node->this, atomic_read(&node->refcnt)); tree 469 fs/hfsplus/bnode.c for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; tree 474 fs/hfsplus/bnode.c node->tree->node_hash_cnt--; tree 478 fs/hfsplus/bnode.c struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) tree 485 fs/hfsplus/bnode.c spin_lock(&tree->hash_lock); tree 486 fs/hfsplus/bnode.c node = hfs_bnode_findhash(tree, num); tree 489 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 496 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 497 fs/hfsplus/bnode.c node = __hfs_bnode_create(tree, num); tree 525 fs/hfsplus/bnode.c if (node->height <= 1 || node->height > tree->depth) tree 532 fs/hfsplus/bnode.c rec_off = tree->node_size - 2; tree 540 fs/hfsplus/bnode.c next_off > tree->node_size || tree 567 fs/hfsplus/bnode.c for (i = 0; i < node->tree->pages_per_bnode; i++) tree 573 fs/hfsplus/bnode.c struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) tree 579 fs/hfsplus/bnode.c spin_lock(&tree->hash_lock); tree 580 fs/hfsplus/bnode.c node = hfs_bnode_findhash(tree, num); tree 581 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 587 fs/hfsplus/bnode.c node = __hfs_bnode_create(tree, num); tree 597 fs/hfsplus/bnode.c min_t(int, PAGE_SIZE, tree->node_size)); tree 600 fs/hfsplus/bnode.c for (i = 1; i < tree->pages_per_bnode; i++) { tree 616 fs/hfsplus/bnode.c node->tree->cnid, node->this, tree 625 fs/hfsplus/bnode.c struct hfs_btree *tree = node->tree; tree 629 fs/hfsplus/bnode.c node->tree->cnid, node->this, tree 632 fs/hfsplus/bnode.c if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock)) tree 634 fs/hfsplus/bnode.c for (i = 0; i < tree->pages_per_bnode; i++) { tree 642 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 643 fs/hfsplus/bnode.c if (hfs_bnode_need_zeroout(tree)) tree 644 fs/hfsplus/bnode.c hfs_bnode_clear(node, 0, tree->node_size); tree 649 fs/hfsplus/bnode.c spin_unlock(&tree->hash_lock); tree 657 fs/hfsplus/bnode.c bool hfs_bnode_need_zeroout(struct hfs_btree *tree) tree 659 fs/hfsplus/bnode.c struct super_block *sb = tree->inode->i_sb; tree 663 fs/hfsplus/bnode.c return tree->cnid == HFSPLUS_CAT_CNID && tree 25 fs/hfsplus/brec.c dataoff = node->tree->node_size - (rec + 2) * 2; tree 40 fs/hfsplus/brec.c !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && tree 41 fs/hfsplus/brec.c (node->tree->cnid != HFSPLUS_ATTR_CNID)) { tree 42 fs/hfsplus/brec.c retval = node->tree->max_key_len + 2; tree 45 fs/hfsplus/brec.c node->tree->node_size - (rec + 1) * 2); tree 48 fs/hfsplus/brec.c if (recoff > node->tree->node_size - 2) { tree 54 fs/hfsplus/brec.c if (retval > node->tree->max_key_len + 2) { tree 65 fs/hfsplus/brec.c struct hfs_btree *tree; tree 72 fs/hfsplus/brec.c tree = fd->tree; tree 74 fs/hfsplus/brec.c if (!tree->root) tree 75 fs/hfsplus/brec.c hfs_btree_inc_height(tree); tree 76 fs/hfsplus/brec.c node = hfs_bnode_find(tree, tree->leaf_head); tree 92 fs/hfsplus/brec.c end_rec_off = tree->node_size - (node->num_recs + 1) * 2; tree 106 fs/hfsplus/brec.c tree->leaf_count++; tree 107 fs/hfsplus/brec.c mark_inode_dirty(tree->inode); tree 117 fs/hfsplus/brec.c idx_rec_off = tree->node_size - (rec + 1) * 2; tree 148 fs/hfsplus/brec.c hfs_btree_inc_height(tree); tree 149 fs/hfsplus/brec.c new_node->parent = tree->root; tree 151 fs/hfsplus/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); tree 165 fs/hfsplus/brec.c if ((tree->attributes & HFS_TREE_VARIDXKEYS) || tree 166 fs/hfsplus/brec.c (tree->cnid == HFSPLUS_ATTR_CNID)) tree 170 fs/hfsplus/brec.c cpu_to_be16(tree->max_key_len); tree 171 fs/hfsplus/brec.c key_len = tree->max_key_len + 2; tree 181 fs/hfsplus/brec.c struct hfs_btree *tree; tree 185 fs/hfsplus/brec.c tree = fd->tree; tree 188 fs/hfsplus/brec.c rec_off = tree->node_size - (fd->record + 2) * 2; tree 189 fs/hfsplus/brec.c end_off = tree->node_size - (node->num_recs + 1) * 2; tree 192 fs/hfsplus/brec.c tree->leaf_count--; tree 193 fs/hfsplus/brec.c mark_inode_dirty(tree->inode); tree 202 fs/hfsplus/brec.c parent = hfs_bnode_find(tree, node->parent); tree 237 fs/hfsplus/brec.c struct hfs_btree *tree; tree 243 fs/hfsplus/brec.c tree = fd->tree; tree 245 fs/hfsplus/brec.c new_node = hfs_bmap_alloc(tree); tree 258 fs/hfsplus/brec.c next_node = hfs_bnode_find(tree, node->next); tree 268 fs/hfsplus/brec.c size = tree->node_size / 2 - node->num_recs * 2 - 14; tree 269 fs/hfsplus/brec.c old_rec_off = tree->node_size - 4; tree 304 fs/hfsplus/brec.c new_rec_off = tree->node_size - 2; tree 343 fs/hfsplus/brec.c } else if (node->this == tree->leaf_tail) { tree 345 fs/hfsplus/brec.c tree->leaf_tail = new_node->this; tree 346 fs/hfsplus/brec.c mark_inode_dirty(tree->inode); tree 358 fs/hfsplus/brec.c struct hfs_btree *tree; tree 364 fs/hfsplus/brec.c tree = fd->tree; tree 371 fs/hfsplus/brec.c parent = hfs_bnode_find(tree, node->parent); tree 381 fs/hfsplus/brec.c if ((tree->attributes & HFS_TREE_VARIDXKEYS) || tree 382 fs/hfsplus/brec.c (tree->cnid == HFSPLUS_ATTR_CNID)) tree 385 fs/hfsplus/brec.c fd->keylength = newkeylen = tree->max_key_len + 2; tree 389 fs/hfsplus/brec.c rec_off = tree->node_size - (rec + 2) * 2; tree 390 fs/hfsplus/brec.c end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; tree 405 fs/hfsplus/brec.c rec_off = tree->node_size - (rec + 2) * 2; tree 406 fs/hfsplus/brec.c end_rec_off = tree->node_size - tree 433 fs/hfsplus/brec.c hfs_btree_inc_height(tree); tree 434 fs/hfsplus/brec.c new_node->parent = tree->root; tree 436 fs/hfsplus/brec.c fd->bnode = hfs_bnode_find(tree, new_node->parent); tree 462 fs/hfsplus/brec.c static int hfs_btree_inc_height(struct hfs_btree *tree) tree 470 fs/hfsplus/brec.c if (tree->root) { tree 471 fs/hfsplus/brec.c node = hfs_bnode_find(tree, tree->root); tree 475 fs/hfsplus/brec.c new_node = hfs_bmap_alloc(tree); tree 481 fs/hfsplus/brec.c tree->root = new_node->this; tree 482 fs/hfsplus/brec.c if (!tree->depth) { tree 483 fs/hfsplus/brec.c tree->leaf_head = tree->leaf_tail = new_node->this; tree 493 fs/hfsplus/brec.c new_node->height = ++tree->depth; tree 503 fs/hfsplus/brec.c rec = tree->node_size - 2; tree 508 fs/hfsplus/brec.c node->parent = tree->root; tree 510 fs/hfsplus/brec.c tree->attributes & HFS_TREE_VARIDXKEYS || tree 511 fs/hfsplus/brec.c tree->cnid == HFSPLUS_ATTR_CNID) tree 514 fs/hfsplus/brec.c key_size = tree->max_key_len + 2; tree 517 fs/hfsplus/brec.c if (!(tree->attributes & HFS_TREE_VARIDXKEYS) && tree 518 fs/hfsplus/brec.c (tree->cnid != HFSPLUS_ATTR_CNID)) { tree 519 fs/hfsplus/brec.c key_size = tree->max_key_len + 2; tree 520 fs/hfsplus/brec.c hfs_bnode_write_u16(new_node, 14, tree->max_key_len); tree 531 fs/hfsplus/brec.c mark_inode_dirty(tree->inode); tree 135 fs/hfsplus/btree.c struct hfs_btree *tree; tree 142 fs/hfsplus/btree.c tree = kzalloc(sizeof(*tree), GFP_KERNEL); tree 143 fs/hfsplus/btree.c if (!tree) tree 146 fs/hfsplus/btree.c mutex_init(&tree->tree_lock); tree 147 fs/hfsplus/btree.c spin_lock_init(&tree->hash_lock); tree 148 fs/hfsplus/btree.c tree->sb = sb; tree 149 fs/hfsplus/btree.c tree->cnid = id; tree 153 fs/hfsplus/btree.c tree->inode = inode; tree 155 fs/hfsplus/btree.c if (!HFSPLUS_I(tree->inode)->first_blocks) { tree 160 fs/hfsplus/btree.c mapping = tree->inode->i_mapping; tree 168 fs/hfsplus/btree.c tree->root = be32_to_cpu(head->root); tree 169 fs/hfsplus/btree.c tree->leaf_count = be32_to_cpu(head->leaf_count); tree 170 fs/hfsplus/btree.c tree->leaf_head = be32_to_cpu(head->leaf_head); tree 171 fs/hfsplus/btree.c tree->leaf_tail = be32_to_cpu(head->leaf_tail); tree 172 fs/hfsplus/btree.c tree->node_count = be32_to_cpu(head->node_count); tree 173 fs/hfsplus/btree.c tree->free_nodes = be32_to_cpu(head->free_nodes); tree 174 fs/hfsplus/btree.c tree->attributes = be32_to_cpu(head->attributes); tree 175 fs/hfsplus/btree.c tree->node_size = be16_to_cpu(head->node_size); tree 176 fs/hfsplus/btree.c tree->max_key_len = be16_to_cpu(head->max_key_len); tree 177 fs/hfsplus/btree.c tree->depth = be16_to_cpu(head->depth); tree 182 fs/hfsplus/btree.c if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) { tree 184 fs/hfsplus/btree.c tree->max_key_len); tree 187 fs/hfsplus/btree.c if (tree->attributes & HFS_TREE_VARIDXKEYS) { tree 192 fs/hfsplus/btree.c tree->keycmp = hfsplus_ext_cmp_key; tree 195 fs/hfsplus/btree.c if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) { tree 197 fs/hfsplus/btree.c tree->max_key_len); tree 200 fs/hfsplus/btree.c if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) { tree 207 fs/hfsplus/btree.c tree->keycmp = hfsplus_cat_bin_cmp_key; tree 209 fs/hfsplus/btree.c tree->keycmp = hfsplus_cat_case_cmp_key; tree 214 fs/hfsplus/btree.c if (tree->max_key_len != HFSPLUS_ATTR_KEYLEN - sizeof(u16)) { tree 216 fs/hfsplus/btree.c tree->max_key_len); tree 219 fs/hfsplus/btree.c tree->keycmp = hfsplus_attr_bin_cmp_key; tree 226 fs/hfsplus/btree.c if (!(tree->attributes & HFS_TREE_BIGKEYS)) { tree 231 fs/hfsplus/btree.c size = tree->node_size; tree 234 fs/hfsplus/btree.c if (!tree->node_count) tree 237 fs/hfsplus/btree.c tree->node_size_shift = ffs(size) - 1; tree 239 fs/hfsplus/btree.c tree->pages_per_bnode = tree 240 fs/hfsplus/btree.c (tree->node_size + PAGE_SIZE - 1) >> tree 245 fs/hfsplus/btree.c return tree; tree 250 fs/hfsplus/btree.c tree->inode->i_mapping->a_ops = &hfsplus_aops; tree 251 fs/hfsplus/btree.c iput(tree->inode); tree 253 fs/hfsplus/btree.c kfree(tree); tree 258 fs/hfsplus/btree.c void hfs_btree_close(struct hfs_btree *tree) tree 263 fs/hfsplus/btree.c if (!tree) tree 267 fs/hfsplus/btree.c while ((node = tree->node_hash[i])) { tree 268 fs/hfsplus/btree.c tree->node_hash[i] = node->next_hash; tree 272 fs/hfsplus/btree.c node->tree->cnid, node->this, tree 275 fs/hfsplus/btree.c tree->node_hash_cnt--; tree 278 fs/hfsplus/btree.c iput(tree->inode); tree 279 fs/hfsplus/btree.c kfree(tree); tree 282 fs/hfsplus/btree.c int hfs_btree_write(struct hfs_btree *tree) tree 288 fs/hfsplus/btree.c node = hfs_bnode_find(tree, 0); tree 297 fs/hfsplus/btree.c head->root = cpu_to_be32(tree->root); tree 298 fs/hfsplus/btree.c head->leaf_count = cpu_to_be32(tree->leaf_count); tree 299 fs/hfsplus/btree.c head->leaf_head = cpu_to_be32(tree->leaf_head); tree 300 fs/hfsplus/btree.c head->leaf_tail = cpu_to_be32(tree->leaf_tail); tree 301 fs/hfsplus/btree.c head->node_count = cpu_to_be32(tree->node_count); tree 302 fs/hfsplus/btree.c head->free_nodes = cpu_to_be32(tree->free_nodes); tree 303 fs/hfsplus/btree.c head->attributes = cpu_to_be32(tree->attributes); tree 304 fs/hfsplus/btree.c head->depth = cpu_to_be16(tree->depth); tree 314 fs/hfsplus/btree.c struct hfs_btree *tree = prev->tree; tree 319 fs/hfsplus/btree.c node = hfs_bnode_create(tree, idx); tree 323 fs/hfsplus/btree.c tree->free_nodes--; tree 330 fs/hfsplus/btree.c hfs_bnode_clear(node, 0, tree->node_size); tree 339 fs/hfsplus/btree.c hfs_bnode_write_u16(node, tree->node_size - 2, 14); tree 340 fs/hfsplus/btree.c hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); tree 346 fs/hfsplus/btree.c int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) tree 348 fs/hfsplus/btree.c struct inode *inode = tree->inode; tree 356 fs/hfsplus/btree.c while (tree->free_nodes < rsvd_nodes) { tree 357 fs/hfsplus/btree.c res = hfsplus_file_extend(inode, hfs_bnode_need_zeroout(tree)); tree 362 fs/hfsplus/btree.c HFSPLUS_SB(tree->sb)->alloc_blksz_shift; tree 364 fs/hfsplus/btree.c hip->alloc_blocks << HFSPLUS_SB(tree->sb)->fs_shift; tree 366 fs/hfsplus/btree.c count = inode->i_size >> tree->node_size_shift; tree 367 fs/hfsplus/btree.c tree->free_nodes += count - tree->node_count; tree 368 fs/hfsplus/btree.c tree->node_count = count; tree 373 fs/hfsplus/btree.c struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) tree 384 fs/hfsplus/btree.c res = hfs_bmap_reserve(tree, 1); tree 389 fs/hfsplus/btree.c node = hfs_bnode_find(tree, nidx); tree 411 fs/hfsplus/btree.c tree->free_nodes--; tree 412 fs/hfsplus/btree.c mark_inode_dirty(tree->inode); tree 414 fs/hfsplus/btree.c return hfs_bnode_create(tree, tree 433 fs/hfsplus/btree.c next_node = hfs_bnode_find(tree, nidx); tree 450 fs/hfsplus/btree.c struct hfs_btree *tree; tree 458 fs/hfsplus/btree.c tree = node->tree; tree 460 fs/hfsplus/btree.c node = hfs_bnode_find(tree, 0); tree 478 fs/hfsplus/btree.c node = hfs_bnode_find(tree, i); tree 509 fs/hfsplus/btree.c tree->free_nodes++; tree 510 fs/hfsplus/btree.c mark_inode_dirty(tree->inode); tree 272 fs/hfsplus/catalog.c err = hfs_bmap_reserve(fd.tree, 2 * fd.tree->depth); tree 348 fs/hfsplus/catalog.c err = hfs_bmap_reserve(fd.tree, 2 * (int)fd.tree->depth - 2); tree 399 fs/hfsplus/catalog.c if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0) tree 456 fs/hfsplus/catalog.c err = hfs_bmap_reserve(src_fd.tree, 4 * (int)src_fd.tree->depth - 1); tree 104 fs/hfsplus/extents.c res = hfs_bmap_reserve(fd->tree, fd->tree->depth + 1); tree 429 fs/hfsplus/extents.c mutex_unlock(&fd.tree->tree_lock); tree 433 fs/hfsplus/extents.c mutex_lock(&fd.tree->tree_lock); tree 590 fs/hfsplus/extents.c mutex_unlock(&fd.tree->tree_lock); tree 595 fs/hfsplus/extents.c mutex_lock(&fd.tree->tree_lock); tree 603 fs/hfsplus/extents.c mutex_unlock(&fd.tree->tree_lock); tree 615 fs/hfsplus/extents.c mutex_lock(&fd.tree->tree_lock); tree 104 fs/hfsplus/hfsplus_fs.h struct hfs_btree *tree; tree 288 fs/hfsplus/hfsplus_fs.h struct hfs_btree *tree; tree 397 fs/hfsplus/hfsplus_fs.h void hfs_btree_close(struct hfs_btree *tree); tree 398 fs/hfsplus/hfsplus_fs.h int hfs_btree_write(struct hfs_btree *tree); tree 399 fs/hfsplus/hfsplus_fs.h int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes); tree 400 fs/hfsplus/hfsplus_fs.h struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree); tree 416 fs/hfsplus/hfsplus_fs.h struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid); tree 418 fs/hfsplus/hfsplus_fs.h struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num); tree 420 fs/hfsplus/hfsplus_fs.h struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num); tree 423 fs/hfsplus/hfsplus_fs.h bool hfs_bnode_need_zeroout(struct hfs_btree *tree); tree 432 fs/hfsplus/hfsplus_fs.h int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd); tree 70 fs/hfsplus/inode.c struct hfs_btree *tree; tree 77 fs/hfsplus/inode.c tree = HFSPLUS_SB(sb)->ext_tree; tree 80 fs/hfsplus/inode.c tree = HFSPLUS_SB(sb)->cat_tree; tree 83 fs/hfsplus/inode.c tree = HFSPLUS_SB(sb)->attr_tree; tree 89 fs/hfsplus/inode.c if (!tree) tree 91 fs/hfsplus/inode.c if (tree->node_size >= PAGE_SIZE) { tree 93 fs/hfsplus/inode.c (tree->node_size_shift - PAGE_SHIFT); tree 94 fs/hfsplus/inode.c spin_lock(&tree->hash_lock); tree 95 fs/hfsplus/inode.c node = hfs_bnode_findhash(tree, nidx); tree 104 fs/hfsplus/inode.c spin_unlock(&tree->hash_lock); tree 107 fs/hfsplus/inode.c (PAGE_SHIFT - tree->node_size_shift); tree 108 fs/hfsplus/inode.c i = 1 << (PAGE_SHIFT - tree->node_size_shift); tree 109 fs/hfsplus/inode.c spin_lock(&tree->hash_lock); tree 111 fs/hfsplus/inode.c node = hfs_bnode_findhash(tree, nidx++); tree 120 fs/hfsplus/inode.c } while (--i && nidx < tree->node_count); tree 121 fs/hfsplus/inode.c spin_unlock(&tree->hash_lock); tree 105 fs/hfsplus/super.c struct hfs_btree *tree = NULL; tree 110 fs/hfsplus/super.c tree = sbi->ext_tree; tree 114 fs/hfsplus/super.c tree = sbi->cat_tree; tree 124 fs/hfsplus/super.c tree = sbi->attr_tree; tree 135 fs/hfsplus/super.c if (tree) { tree 136 fs/hfsplus/super.c int err = hfs_btree_write(tree); tree 724 fs/hfsplus/xattr.c if (key_len == 0 || key_len > fd.tree->max_key_len) { tree 1120 fs/jfs/jfs_dmap.c if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { tree 1127 fs/jfs/jfs_dmap.c leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); tree 1250 fs/jfs/jfs_dmap.c if (dp->tree.leafidx != cpu_to_le32(LEAFIND)) { tree 1255 fs/jfs/jfs_dmap.c leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); tree 1882 fs/jfs/jfs_dmap.c if (dp->tree.stree[ROOT] != L2BPERDMAP) { tree 1997 fs/jfs/jfs_dmap.c if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx)) tree 2009 fs/jfs/jfs_dmap.c if (dp->tree.stree[leafidx + LEAFIND] < BUDMIN) tree 2056 fs/jfs/jfs_dmap.c oldroot = dp->tree.stree[ROOT]; tree 2062 fs/jfs/jfs_dmap.c if (dp->tree.stree[ROOT] == oldroot) tree 2069 fs/jfs/jfs_dmap.c if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 1, 0))) tree 2111 fs/jfs/jfs_dmap.c oldroot = dp->tree.stree[ROOT]; tree 2117 fs/jfs/jfs_dmap.c if (rc || (dp->tree.stree[ROOT] == oldroot)) tree 2124 fs/jfs/jfs_dmap.c if ((rc = dbAdjCtl(bmp, blkno, dp->tree.stree[ROOT], 0, 0))) { tree 2132 fs/jfs/jfs_dmap.c if (dp->tree.stree[word] == NOFREE) tree 2133 fs/jfs/jfs_dmap.c dbBackSplit((dmtree_t *) & dp->tree, word); tree 2168 fs/jfs/jfs_dmap.c dmtree_t *tp = (dmtree_t *) & dp->tree; tree 2173 fs/jfs/jfs_dmap.c leaf = dp->tree.stree + LEAFIND; tree 2315 fs/jfs/jfs_dmap.c dmtree_t *tp = (dmtree_t *) & dp->tree; tree 3256 fs/jfs/jfs_dmap.c struct dmaptree *tp = (struct dmaptree *) & dp->tree; tree 3843 fs/jfs/jfs_dmap.c tp = &dp->tree; tree 151 fs/jfs/jfs_dmap.h struct dmaptree tree; /* 360: dmap tree */ tree 1818 fs/namespace.c struct mount *tree; tree 1821 fs/namespace.c tree = ERR_PTR(-EINVAL); tree 1823 fs/namespace.c tree = copy_tree(real_mount(path->mnt), path->dentry, tree 1826 fs/namespace.c if (IS_ERR(tree)) tree 1827 fs/namespace.c return ERR_CAST(tree); tree 1828 fs/namespace.c return &tree->mnt; tree 4110 fs/ocfs2/dlmglue.c struct ocfs2_refcount_tree *tree = tree 4113 fs/ocfs2/dlmglue.c return ocfs2_ci_checkpointed(&tree->rf_ci, lockres, new_level); tree 4119 fs/ocfs2/dlmglue.c struct ocfs2_refcount_tree *tree = tree 4122 fs/ocfs2/dlmglue.c ocfs2_metadata_cache_purge(&tree->rf_ci); tree 197 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree = NULL; tree 200 fs/ocfs2/refcounttree.c tree = rb_entry(n, struct ocfs2_refcount_tree, rf_node); tree 202 fs/ocfs2/refcounttree.c if (blkno < tree->rf_blkno) tree 204 fs/ocfs2/refcounttree.c else if (blkno > tree->rf_blkno) tree 207 fs/ocfs2/refcounttree.c return tree; tree 244 fs/ocfs2/refcounttree.c static void ocfs2_free_refcount_tree(struct ocfs2_refcount_tree *tree) tree 246 fs/ocfs2/refcounttree.c ocfs2_metadata_cache_exit(&tree->rf_ci); tree 247 fs/ocfs2/refcounttree.c ocfs2_simple_drop_lockres(OCFS2_SB(tree->rf_sb), &tree->rf_lockres); tree 248 fs/ocfs2/refcounttree.c ocfs2_lock_res_free(&tree->rf_lockres); tree 249 fs/ocfs2/refcounttree.c kfree(tree); tree 254 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree) tree 256 fs/ocfs2/refcounttree.c rb_erase(&tree->rf_node, &osb->osb_rf_lock_tree); tree 257 fs/ocfs2/refcounttree.c if (osb->osb_ref_tree_lru && osb->osb_ref_tree_lru == tree) tree 262 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree) tree 265 fs/ocfs2/refcounttree.c ocfs2_erase_refcount_tree_from_list_no_lock(osb, tree); tree 271 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree = tree 274 fs/ocfs2/refcounttree.c ocfs2_free_refcount_tree(tree); tree 278 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_get(struct ocfs2_refcount_tree *tree) tree 280 fs/ocfs2/refcounttree.c kref_get(&tree->rf_getcnt); tree 284 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_put(struct ocfs2_refcount_tree *tree) tree 286 fs/ocfs2/refcounttree.c kref_put(&tree->rf_getcnt, ocfs2_kref_remove_refcount_tree); tree 327 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree, *new = NULL; tree 334 fs/ocfs2/refcounttree.c tree = osb->osb_ref_tree_lru; tree 336 fs/ocfs2/refcounttree.c tree = ocfs2_find_refcount_tree(osb, rf_blkno); tree 337 fs/ocfs2/refcounttree.c if (tree) tree 371 fs/ocfs2/refcounttree.c tree = ocfs2_find_refcount_tree(osb, rf_blkno); tree 372 fs/ocfs2/refcounttree.c if (tree) tree 377 fs/ocfs2/refcounttree.c tree = new; tree 381 fs/ocfs2/refcounttree.c *ret_tree = tree; tree 383 fs/ocfs2/refcounttree.c osb->osb_ref_tree_lru = tree; tree 416 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree, int rw) tree 420 fs/ocfs2/refcounttree.c ret = ocfs2_refcount_lock(tree, rw); tree 427 fs/ocfs2/refcounttree.c down_write(&tree->rf_sem); tree 429 fs/ocfs2/refcounttree.c down_read(&tree->rf_sem); tree 449 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree = NULL; tree 454 fs/ocfs2/refcounttree.c ret = ocfs2_get_refcount_tree(osb, ref_blkno, &tree); tree 460 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_get(tree); tree 462 fs/ocfs2/refcounttree.c ret = __ocfs2_lock_refcount_tree(osb, tree, rw); tree 465 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_put(tree); tree 469 fs/ocfs2/refcounttree.c ret = ocfs2_read_refcount_block(&tree->rf_ci, tree->rf_blkno, tree 473 fs/ocfs2/refcounttree.c ocfs2_unlock_refcount_tree(osb, tree, rw); tree 487 fs/ocfs2/refcounttree.c if (tree->rf_generation != le32_to_cpu(rb->rf_generation)) { tree 488 fs/ocfs2/refcounttree.c if (!tree->rf_removed) { tree 489 fs/ocfs2/refcounttree.c ocfs2_erase_refcount_tree_from_list(osb, tree); tree 490 fs/ocfs2/refcounttree.c tree->rf_removed = 1; tree 494 fs/ocfs2/refcounttree.c ocfs2_unlock_refcount_tree(osb, tree, rw); tree 500 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_put(tree); tree 506 fs/ocfs2/refcounttree.c *ret_tree = tree; tree 517 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree, int rw) tree 520 fs/ocfs2/refcounttree.c up_write(&tree->rf_sem); tree 522 fs/ocfs2/refcounttree.c up_read(&tree->rf_sem); tree 524 fs/ocfs2/refcounttree.c ocfs2_refcount_unlock(tree, rw); tree 525 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_put(tree); tree 531 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree; tree 535 fs/ocfs2/refcounttree.c tree = rb_entry(node, struct ocfs2_refcount_tree, rf_node); tree 538 fs/ocfs2/refcounttree.c (unsigned long long) tree->rf_blkno); tree 540 fs/ocfs2/refcounttree.c rb_erase(&tree->rf_node, root); tree 541 fs/ocfs2/refcounttree.c ocfs2_free_refcount_tree(tree); tree 560 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *new_tree = NULL, *tree = NULL; tree 657 fs/ocfs2/refcounttree.c tree = ocfs2_find_refcount_tree(osb, first_blkno); tree 665 fs/ocfs2/refcounttree.c BUG_ON(tree && tree->rf_generation == new_tree->rf_generation); tree 666 fs/ocfs2/refcounttree.c if (tree) tree 667 fs/ocfs2/refcounttree.c ocfs2_erase_refcount_tree_from_list_no_lock(osb, tree); tree 671 fs/ocfs2/refcounttree.c if (tree) tree 672 fs/ocfs2/refcounttree.c ocfs2_refcount_tree_put(tree); tree 2295 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree; tree 2305 fs/ocfs2/refcounttree.c ret = ocfs2_get_refcount_tree(OCFS2_SB(inode->i_sb), ref_blkno, &tree); tree 2311 fs/ocfs2/refcounttree.c ret = ocfs2_read_refcount_block(&tree->rf_ci, tree->rf_blkno, tree 2318 fs/ocfs2/refcounttree.c ret = __ocfs2_decrease_refcount(handle, &tree->rf_ci, ref_root_bh, tree 2528 fs/ocfs2/refcounttree.c struct ocfs2_refcount_tree *tree; tree 2540 fs/ocfs2/refcounttree.c refcount_loc, &tree); tree 2546 fs/ocfs2/refcounttree.c ret = ocfs2_read_refcount_block(&tree->rf_ci, refcount_loc, tree 2554 fs/ocfs2/refcounttree.c &tree->rf_ci, tree 30 fs/ocfs2/refcounttree.h struct ocfs2_refcount_tree **tree, tree 33 fs/ocfs2/refcounttree.h struct ocfs2_refcount_tree *tree, tree 159 fs/ocfs2/uptodate.c unsigned int tree, to_purge, purged; tree 165 fs/ocfs2/uptodate.c tree = !(ci->ci_flags & OCFS2_CACHE_FL_INLINE); tree 170 fs/ocfs2/uptodate.c to_purge, tree); tree 175 fs/ocfs2/uptodate.c if (tree) tree 185 fs/ocfs2/uptodate.c if (tree && purged != to_purge) tree 352 fs/ocfs2/uptodate.c struct ocfs2_meta_cache_item **tree) tree 367 fs/ocfs2/uptodate.c tree[i]->c_block = ci->ci_cache.ci_array[i]; tree 375 fs/ocfs2/uptodate.c __ocfs2_insert_cache_tree(ci, tree[i]); tree 376 fs/ocfs2/uptodate.c tree[i] = NULL; tree 392 fs/ocfs2/uptodate.c struct ocfs2_meta_cache_item *tree[OCFS2_CACHE_INFO_MAX_ARRAY] = tree 410 fs/ocfs2/uptodate.c tree[i] = kmem_cache_alloc(ocfs2_uptodate_cachep, tree 412 fs/ocfs2/uptodate.c if (!tree[i]) { tree 431 fs/ocfs2/uptodate.c ocfs2_expand_cache(ci, tree); tree 443 fs/ocfs2/uptodate.c if (tree[0]) { tree 445 fs/ocfs2/uptodate.c if (tree[i]) tree 447 fs/ocfs2/uptodate.c tree[i]); tree 189 fs/unicode/mkutf8data.c struct tree; tree 190 fs/unicode/mkutf8data.c static utf8leaf_t *utf8nlookup(struct tree *, unsigned char *, tree 192 fs/unicode/mkutf8data.c static utf8leaf_t *utf8lookup(struct tree *, unsigned char *, const char *); tree 350 fs/unicode/mkutf8data.c struct tree *next; tree 355 fs/unicode/mkutf8data.c int *(*leaf_index)(struct tree *, void *); tree 380 fs/unicode/mkutf8data.c static void *lookup(struct tree *tree, const char *key) tree 385 fs/unicode/mkutf8data.c node = tree->root; tree 417 fs/unicode/mkutf8data.c static void tree_walk(struct tree *tree) tree 428 fs/unicode/mkutf8data.c printf("%s_%x root %p\n", tree->type, tree->maxage, tree->root); tree 429 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) { tree 430 fs/unicode/mkutf8data.c assert(tree->root); tree 431 fs/unicode/mkutf8data.c tree->leaf_print(tree->root, indent); tree 434 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 435 fs/unicode/mkutf8data.c node = tree->root; tree 454 fs/unicode/mkutf8data.c tree->leaf_print(node->left, tree 468 fs/unicode/mkutf8data.c tree->leaf_print(node->right, tree 533 fs/unicode/mkutf8data.c static int insert(struct tree *tree, char *key, int keylen, void *leaf) tree 543 fs/unicode/mkutf8data.c cursor = &tree->root; tree 574 fs/unicode/mkutf8data.c if (! tree->leaf_equal(node->left, node->right)) tree 582 fs/unicode/mkutf8data.c tree->root = leaf; tree 583 fs/unicode/mkutf8data.c tree->childnode = LEAF; tree 654 fs/unicode/mkutf8data.c static void prune(struct tree *tree) tree 668 fs/unicode/mkutf8data.c printf("Pruning %s_%x\n", tree->type, tree->maxage); tree 671 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) tree 673 fs/unicode/mkutf8data.c if (!tree->root) tree 677 fs/unicode/mkutf8data.c node = tree->root; tree 727 fs/unicode/mkutf8data.c if (! tree->leaf_equal(leftleaf, rightleaf)) tree 815 fs/unicode/mkutf8data.c static void mark_nodes(struct tree *tree) tree 826 fs/unicode/mkutf8data.c printf("Marking %s_%x\n", tree->type, tree->maxage); tree 827 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) tree 830 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 831 fs/unicode/mkutf8data.c node = tree->root; tree 839 fs/unicode/mkutf8data.c if (tree->leaf_mark(node->left)) { tree 857 fs/unicode/mkutf8data.c if (tree->leaf_mark(node->right)) { tree 878 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 879 fs/unicode/mkutf8data.c node = tree->root; tree 887 fs/unicode/mkutf8data.c if (tree->leaf_mark(node->left)) { tree 909 fs/unicode/mkutf8data.c if (tree->leaf_mark(node->right)) { tree 942 fs/unicode/mkutf8data.c static int index_nodes(struct tree *tree, int index) tree 954 fs/unicode/mkutf8data.c tree->index = index; tree 959 fs/unicode/mkutf8data.c printf("Indexing %s_%x: %d\n", tree->type, tree->maxage, index); tree 960 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) { tree 961 fs/unicode/mkutf8data.c index += tree->leaf_size(tree->root); tree 965 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 966 fs/unicode/mkutf8data.c node = tree->root; tree 982 fs/unicode/mkutf8data.c *tree->leaf_index(tree, node->left) = tree 984 fs/unicode/mkutf8data.c index += tree->leaf_size(node->left); tree 997 fs/unicode/mkutf8data.c *tree->leaf_index(tree, node->right) = index; tree 998 fs/unicode/mkutf8data.c index += tree->leaf_size(node->right); tree 1048 fs/unicode/mkutf8data.c static int size_nodes(struct tree *tree) tree 1050 fs/unicode/mkutf8data.c struct tree *next; tree 1070 fs/unicode/mkutf8data.c printf("Sizing %s_%x\n", tree->type, tree->maxage); tree 1071 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) tree 1074 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 1077 fs/unicode/mkutf8data.c node = tree->root; tree 1094 fs/unicode/mkutf8data.c next = tree->next; tree 1123 fs/unicode/mkutf8data.c offset = *tree->leaf_index(tree, node->right); tree 1185 fs/unicode/mkutf8data.c static void emit(struct tree *tree, unsigned char *data) tree 1204 fs/unicode/mkutf8data.c index = tree->index; tree 1208 fs/unicode/mkutf8data.c printf("Emitting %s_%x\n", tree->type, tree->maxage); tree 1209 fs/unicode/mkutf8data.c if (tree->childnode == LEAF) { tree 1210 fs/unicode/mkutf8data.c assert(tree->root); tree 1211 fs/unicode/mkutf8data.c tree->leaf_emit(tree->root, data); tree 1212 fs/unicode/mkutf8data.c size = tree->leaf_size(tree->root); tree 1218 fs/unicode/mkutf8data.c assert(tree->childnode == NODE); tree 1219 fs/unicode/mkutf8data.c node = tree->root; tree 1275 fs/unicode/mkutf8data.c data = tree->leaf_emit(node->left, tree 1277 fs/unicode/mkutf8data.c size = tree->leaf_size(node->left); tree 1292 fs/unicode/mkutf8data.c data = tree->leaf_emit(node->right, tree 1294 fs/unicode/mkutf8data.c size = tree->leaf_size(node->right); tree 1318 fs/unicode/mkutf8data.c printf(" %d total\n", index - tree->index); tree 1354 fs/unicode/mkutf8data.c struct tree *nfdi_tree; tree 1355 fs/unicode/mkutf8data.c struct tree *nfdicf_tree; tree 1357 fs/unicode/mkutf8data.c struct tree *trees; tree 1493 fs/unicode/mkutf8data.c static int *nfdi_index(struct tree *tree, void *l) tree 1497 fs/unicode/mkutf8data.c return &tree->leafindex[leaf->code]; tree 1500 fs/unicode/mkutf8data.c static int *nfdicf_index(struct tree *tree, void *l) tree 1504 fs/unicode/mkutf8data.c return &tree->leafindex[leaf->code]; tree 1623 fs/unicode/mkutf8data.c trees = calloc(trees_count, sizeof(struct tree)); tree 1745 fs/unicode/mkutf8data.c static void verify(struct tree *tree) tree 1756 fs/unicode/mkutf8data.c printf("Verifying %s_%x\n", tree->type, tree->maxage); tree 1757 fs/unicode/mkutf8data.c nocf = strcmp(tree->type, "nfdicf"); tree 1762 fs/unicode/mkutf8data.c if (data->correction <= tree->maxage) tree 1765 fs/unicode/mkutf8data.c leaf = utf8lookup(tree, hangul, key); tree 2594 fs/unicode/mkutf8data.c int utf8agemax(struct tree *, const char *); tree 2595 fs/unicode/mkutf8data.c int utf8nagemax(struct tree *, const char *, size_t); tree 2596 fs/unicode/mkutf8data.c int utf8agemin(struct tree *, const char *); tree 2597 fs/unicode/mkutf8data.c int utf8nagemin(struct tree *, const char *, size_t); tree 2598 fs/unicode/mkutf8data.c ssize_t utf8len(struct tree *, const char *); tree 2599 fs/unicode/mkutf8data.c ssize_t utf8nlen(struct tree *, const char *, size_t); tree 2601 fs/unicode/mkutf8data.c int utf8cursor(struct utf8cursor *, struct tree *, const char *); tree 2602 fs/unicode/mkutf8data.c int utf8ncursor(struct utf8cursor *, struct tree *, const char *, size_t); tree 2706 fs/unicode/mkutf8data.c static utf8leaf_t *utf8nlookup(struct tree *tree, unsigned char *hangul, tree 2715 fs/unicode/mkutf8data.c if (!tree) tree 2720 fs/unicode/mkutf8data.c trie = utf8data + tree->index; tree 2781 fs/unicode/mkutf8data.c static utf8leaf_t *utf8lookup(struct tree *tree, unsigned char *hangul, tree 2784 fs/unicode/mkutf8data.c return utf8nlookup(tree, hangul, s, (size_t)-1); tree 2803 fs/unicode/mkutf8data.c int utf8agemax(struct tree *tree, const char *s) tree 2810 fs/unicode/mkutf8data.c if (!tree) tree 2814 fs/unicode/mkutf8data.c leaf = utf8lookup(tree, hangul, s); tree 2818 fs/unicode/mkutf8data.c if (leaf_age <= tree->maxage && leaf_age > age) tree 2830 fs/unicode/mkutf8data.c int utf8agemin(struct tree *tree, const char *s) tree 2837 fs/unicode/mkutf8data.c if (!tree) tree 2839 fs/unicode/mkutf8data.c age = tree->maxage; tree 2841 fs/unicode/mkutf8data.c leaf = utf8lookup(tree, hangul, s); tree 2845 fs/unicode/mkutf8data.c if (leaf_age <= tree->maxage && leaf_age < age) tree 2856 fs/unicode/mkutf8data.c int utf8nagemax(struct tree *tree, const char *s, size_t len) tree 2863 fs/unicode/mkutf8data.c if (!tree) tree 2867 fs/unicode/mkutf8data.c leaf = utf8nlookup(tree, hangul, s, len); tree 2871 fs/unicode/mkutf8data.c if (leaf_age <= tree->maxage && leaf_age > age) tree 2883 fs/unicode/mkutf8data.c int utf8nagemin(struct tree *tree, const char *s, size_t len) tree 2890 fs/unicode/mkutf8data.c if (!tree) tree 2892 fs/unicode/mkutf8data.c age = tree->maxage; tree 2894 fs/unicode/mkutf8data.c leaf = utf8nlookup(tree, hangul, s, len); tree 2898 fs/unicode/mkutf8data.c if (leaf_age <= tree->maxage && leaf_age < age) tree 2912 fs/unicode/mkutf8data.c ssize_t utf8len(struct tree *tree, const char *s) tree 2918 fs/unicode/mkutf8data.c if (!tree) tree 2921 fs/unicode/mkutf8data.c leaf = utf8lookup(tree, hangul, s); tree 2924 fs/unicode/mkutf8data.c if (ages[LEAF_GEN(leaf)] > tree->maxage) tree 2939 fs/unicode/mkutf8data.c ssize_t utf8nlen(struct tree *tree, const char *s, size_t len) tree 2945 fs/unicode/mkutf8data.c if (!tree) tree 2948 fs/unicode/mkutf8data.c leaf = utf8nlookup(tree, hangul, s, len); tree 2951 fs/unicode/mkutf8data.c if (ages[LEAF_GEN(leaf)] > tree->maxage) tree 2967 fs/unicode/mkutf8data.c struct tree *tree; tree 2990 fs/unicode/mkutf8data.c int utf8ncursor(struct utf8cursor *u8c, struct tree *tree, const char *s, tree 2993 fs/unicode/mkutf8data.c if (!tree) tree 2997 fs/unicode/mkutf8data.c u8c->tree = tree; tree 3025 fs/unicode/mkutf8data.c int utf8cursor(struct utf8cursor *u8c, struct tree *tree, const char *s) tree 3027 fs/unicode/mkutf8data.c return utf8ncursor(u8c, tree, s, (unsigned int)-1); tree 3086 fs/unicode/mkutf8data.c leaf = utf8lookup(u8c->tree, u8c->hangul, u8c->s); tree 3088 fs/unicode/mkutf8data.c leaf = utf8nlookup(u8c->tree, u8c->hangul, tree 3097 fs/unicode/mkutf8data.c if (ages[LEAF_GEN(leaf)] > u8c->tree->maxage) { tree 3110 fs/unicode/mkutf8data.c leaf = utf8lookup(u8c->tree, u8c->hangul, u8c->s); tree 3174 fs/unicode/mkutf8data.c static int normalize_line(struct tree *tree) tree 3184 fs/unicode/mkutf8data.c if (utf8cursor(&u8c, tree, s)) tree 3199 fs/unicode/mkutf8data.c if (utf8cursor(&u8c, tree, s)) tree 659 fs/xfs/xfs_dquot.c struct radix_tree_root *tree, tree 666 fs/xfs/xfs_dquot.c dqp = radix_tree_lookup(tree, id); tree 700 fs/xfs/xfs_dquot.c struct radix_tree_root *tree, tree 707 fs/xfs/xfs_dquot.c error = radix_tree_insert(tree, id, dqp); tree 767 fs/xfs/xfs_dquot.c struct radix_tree_root *tree = xfs_dquot_tree(qi, type); tree 776 fs/xfs/xfs_dquot.c dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id); tree 786 fs/xfs/xfs_dquot.c error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp); tree 856 fs/xfs/xfs_dquot.c struct radix_tree_root *tree = xfs_dquot_tree(qi, type); tree 871 fs/xfs/xfs_dquot.c dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id); tree 910 fs/xfs/xfs_dquot.c error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp); tree 54 fs/xfs/xfs_qm.c struct radix_tree_root *tree = xfs_dquot_tree(qi, type); tree 71 fs/xfs/xfs_qm.c nr_found = radix_tree_gang_lookup(tree, (void **)batch, tree 50 include/linux/audit.h struct audit_tree *tree; /* associated watched tree */ tree 56 include/linux/generic-radix-tree.h .tree = { \ tree 71 include/linux/generic-radix-tree.h struct __genradix tree; \ tree 97 include/linux/generic-radix-tree.h #define genradix_free(_radix) __genradix_free(&(_radix)->tree) tree 132 include/linux/generic-radix-tree.h __genradix_ptr(&(_radix)->tree, \ tree 148 include/linux/generic-radix-tree.h __genradix_ptr_alloc(&(_radix)->tree, \ tree 180 include/linux/generic-radix-tree.h __genradix_iter_peek(_iter, &(_radix)->tree, \ tree 226 include/linux/generic-radix-tree.h __genradix_prealloc(&(_radix)->tree, \ tree 457 include/linux/mlx5/driver.h struct radix_tree_root tree; tree 558 include/linux/mlx5/qp.h return radix_tree_lookup(&dev->priv.qp_table.tree, qpn); tree 730 include/linux/perf_event.h struct rb_root tree; tree 46 include/linux/rbtree_latch.h struct rb_root tree[2]; tree 79 include/linux/rbtree_latch.h struct rb_root *root = <r->tree[idx]; tree 102 include/linux/rbtree_latch.h rb_erase(<n->node[idx], <r->tree[idx]); tree 109 include/linux/rbtree_latch.h struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); tree 33 include/linux/vmpressure.h extern void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree, tree 47 include/linux/vmpressure.h static inline void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree, tree 439 include/net/pkt_cls.h struct tcf_ematch_tree *tree, tree 442 include/net/pkt_cls.h if (tree->hdr.nmatches) tree 443 include/net/pkt_cls.h return __tcf_em_tree_match(skb, tree, info); tree 1892 include/trace/events/btrfs.h TP_PROTO(const struct extent_io_tree *tree, tree 1895 include/trace/events/btrfs.h TP_ARGS(tree, start, len, set_bits), tree 1906 include/trace/events/btrfs.h TP_fast_assign_btrfs(tree->fs_info, tree 1907 include/trace/events/btrfs.h __entry->owner = tree->owner; tree 1908 include/trace/events/btrfs.h if (tree->private_data) { tree 1909 include/trace/events/btrfs.h struct inode *inode = tree->private_data; tree 1931 include/trace/events/btrfs.h TP_PROTO(const struct extent_io_tree *tree, tree 1934 include/trace/events/btrfs.h TP_ARGS(tree, start, len, clear_bits), tree 1945 include/trace/events/btrfs.h TP_fast_assign_btrfs(tree->fs_info, tree 1946 include/trace/events/btrfs.h __entry->owner = tree->owner; tree 1947 include/trace/events/btrfs.h if (tree->private_data) { tree 1948 include/trace/events/btrfs.h struct inode *inode = tree->private_data; tree 1970 include/trace/events/btrfs.h TP_PROTO(const struct extent_io_tree *tree, tree 1973 include/trace/events/btrfs.h TP_ARGS(tree, start, len, set_bits, clear_bits), tree 1985 include/trace/events/btrfs.h TP_fast_assign_btrfs(tree->fs_info, tree 1986 include/trace/events/btrfs.h __entry->owner = tree->owner; tree 1987 include/trace/events/btrfs.h if (tree->private_data) { tree 1988 include/trace/events/btrfs.h struct inode *inode = tree->private_data; tree 279 kernel/audit.h struct audit_tree *tree); tree 285 kernel/audit.h extern const char *audit_tree_path(struct audit_tree *tree); tree 286 kernel/audit.h extern void audit_put_tree(struct audit_tree *tree); tree 315 kernel/audit.h #define audit_put_tree(tree) (void)0 tree 95 kernel/audit_tree.c struct audit_tree *tree; tree 97 kernel/audit_tree.c tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); tree 98 kernel/audit_tree.c if (tree) { tree 99 kernel/audit_tree.c refcount_set(&tree->count, 1); tree 100 kernel/audit_tree.c tree->goner = 0; tree 101 kernel/audit_tree.c INIT_LIST_HEAD(&tree->chunks); tree 102 kernel/audit_tree.c INIT_LIST_HEAD(&tree->rules); tree 103 kernel/audit_tree.c INIT_LIST_HEAD(&tree->list); tree 104 kernel/audit_tree.c INIT_LIST_HEAD(&tree->same_root); tree 105 kernel/audit_tree.c tree->root = NULL; tree 106 kernel/audit_tree.c strcpy(tree->pathname, s); tree 108 kernel/audit_tree.c return tree; tree 111 kernel/audit_tree.c static inline void get_tree(struct audit_tree *tree) tree 113 kernel/audit_tree.c refcount_inc(&tree->count); tree 116 kernel/audit_tree.c static inline void put_tree(struct audit_tree *tree) tree 118 kernel/audit_tree.c if (refcount_dec_and_test(&tree->count)) tree 119 kernel/audit_tree.c kfree_rcu(tree, head); tree 123 kernel/audit_tree.c const char *audit_tree_path(struct audit_tree *tree) tree 125 kernel/audit_tree.c return tree->pathname; tree 263 kernel/audit_tree.c bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) tree 267 kernel/audit_tree.c if (chunk->owners[n].owner == tree) tree 399 kernel/audit_tree.c static int create_chunk(struct inode *inode, struct audit_tree *tree) tree 424 kernel/audit_tree.c if (tree->goner) { tree 435 kernel/audit_tree.c chunk->owners[0].owner = tree; tree 436 kernel/audit_tree.c get_tree(tree); tree 437 kernel/audit_tree.c list_add(&chunk->owners[0].list, &tree->chunks); tree 438 kernel/audit_tree.c if (!tree->root) { tree 439 kernel/audit_tree.c tree->root = chunk; tree 440 kernel/audit_tree.c list_add(&tree->same_root, &chunk->trees); tree 460 kernel/audit_tree.c static int tag_chunk(struct inode *inode, struct audit_tree *tree) tree 470 kernel/audit_tree.c return create_chunk(inode, tree); tree 481 kernel/audit_tree.c if (old->owners[n].owner == tree) { tree 498 kernel/audit_tree.c if (tree->goner) { tree 507 kernel/audit_tree.c p->owner = tree; tree 508 kernel/audit_tree.c get_tree(tree); tree 509 kernel/audit_tree.c list_add(&p->list, &tree->chunks); tree 510 kernel/audit_tree.c if (!tree->root) { tree 511 kernel/audit_tree.c tree->root = chunk; tree 512 kernel/audit_tree.c list_add(&tree->same_root, &chunk->trees); tree 538 kernel/audit_tree.c audit_log_untrustedstring(ab, rule->tree->pathname); tree 544 kernel/audit_tree.c static void kill_rules(struct audit_context *context, struct audit_tree *tree) tree 549 kernel/audit_tree.c list_for_each_entry_safe(rule, next, &tree->rules, rlist) { tree 553 kernel/audit_tree.c if (rule->tree) { tree 558 kernel/audit_tree.c rule->tree = NULL; tree 611 kernel/audit_tree.c static void trim_marked(struct audit_tree *tree) tree 615 kernel/audit_tree.c if (tree->goner) { tree 620 kernel/audit_tree.c for (p = tree->chunks.next; p != &tree->chunks; p = q) { tree 625 kernel/audit_tree.c list_add(p, &tree->chunks); tree 630 kernel/audit_tree.c prune_tree_chunks(tree, true); tree 633 kernel/audit_tree.c if (!tree->root && !tree->goner) { tree 634 kernel/audit_tree.c tree->goner = 1; tree 637 kernel/audit_tree.c kill_rules(audit_context(), tree); tree 638 kernel/audit_tree.c list_del_init(&tree->list); tree 640 kernel/audit_tree.c prune_one(tree); tree 651 kernel/audit_tree.c struct audit_tree *tree; tree 652 kernel/audit_tree.c tree = rule->tree; tree 653 kernel/audit_tree.c if (tree) { tree 656 kernel/audit_tree.c if (list_empty(&tree->rules) && !tree->goner) { tree 657 kernel/audit_tree.c tree->root = NULL; tree 658 kernel/audit_tree.c list_del_init(&tree->same_root); tree 659 kernel/audit_tree.c tree->goner = 1; tree 660 kernel/audit_tree.c list_move(&tree->list, &prune_list); tree 661 kernel/audit_tree.c rule->tree = NULL; tree 666 kernel/audit_tree.c rule->tree = NULL; tree 686 kernel/audit_tree.c struct audit_tree *tree; tree 692 kernel/audit_tree.c tree = container_of(cursor.next, struct audit_tree, list); tree 693 kernel/audit_tree.c get_tree(tree); tree 695 kernel/audit_tree.c list_add(&cursor, &tree->list); tree 698 kernel/audit_tree.c err = kern_path(tree->pathname, 0, &path); tree 708 kernel/audit_tree.c list_for_each_entry(node, &tree->chunks, list) { tree 718 kernel/audit_tree.c trim_marked(tree); tree 721 kernel/audit_tree.c put_tree(tree); tree 734 kernel/audit_tree.c rule->inode_f || rule->watch || rule->tree) tree 736 kernel/audit_tree.c rule->tree = alloc_tree(pathname); tree 737 kernel/audit_tree.c if (!rule->tree) tree 742 kernel/audit_tree.c void audit_put_tree(struct audit_tree *tree) tree 744 kernel/audit_tree.c put_tree(tree); tree 804 kernel/audit_tree.c struct audit_tree *seed = rule->tree, *tree; tree 809 kernel/audit_tree.c rule->tree = NULL; tree 810 kernel/audit_tree.c list_for_each_entry(tree, &tree_list, list) { tree 811 kernel/audit_tree.c if (!strcmp(seed->pathname, tree->pathname)) { tree 813 kernel/audit_tree.c rule->tree = tree; tree 814 kernel/audit_tree.c list_add(&rule->rlist, &tree->rules); tree 818 kernel/audit_tree.c tree = seed; tree 819 kernel/audit_tree.c list_add(&tree->list, &tree_list); tree 820 kernel/audit_tree.c list_add(&rule->rlist, &tree->rules); tree 830 kernel/audit_tree.c err = kern_path(tree->pathname, 0, &path); tree 840 kernel/audit_tree.c get_tree(tree); tree 841 kernel/audit_tree.c err = iterate_mounts(tag_mount, tree, mnt); tree 847 kernel/audit_tree.c list_for_each_entry(node, &tree->chunks, list) tree 851 kernel/audit_tree.c trim_marked(tree); tree 857 kernel/audit_tree.c put_tree(tree); tree 860 kernel/audit_tree.c rule->tree = tree; tree 861 kernel/audit_tree.c put_tree(tree); tree 866 kernel/audit_tree.c list_del_init(&tree->list); tree 867 kernel/audit_tree.c list_del_init(&tree->rules); tree 868 kernel/audit_tree.c put_tree(tree); tree 899 kernel/audit_tree.c struct audit_tree *tree; tree 902 kernel/audit_tree.c tree = container_of(cursor.next, struct audit_tree, list); tree 903 kernel/audit_tree.c get_tree(tree); tree 905 kernel/audit_tree.c list_add(&cursor, &tree->list); tree 908 kernel/audit_tree.c err = kern_path(tree->pathname, 0, &path2); tree 915 kernel/audit_tree.c put_tree(tree); tree 920 kernel/audit_tree.c failed = iterate_mounts(tag_mount, tree, tagged); tree 922 kernel/audit_tree.c put_tree(tree); tree 929 kernel/audit_tree.c if (!tree->goner) { tree 930 kernel/audit_tree.c list_del(&tree->list); tree 931 kernel/audit_tree.c list_add(&tree->list, &tree_list); tree 934 kernel/audit_tree.c put_tree(tree); tree 938 kernel/audit_tree.c struct audit_tree *tree; tree 940 kernel/audit_tree.c tree = container_of(barrier.prev, struct audit_tree, list); tree 941 kernel/audit_tree.c get_tree(tree); tree 942 kernel/audit_tree.c list_del(&tree->list); tree 943 kernel/audit_tree.c list_add(&tree->list, &barrier); tree 949 kernel/audit_tree.c list_for_each_entry(node, &tree->chunks, list) tree 953 kernel/audit_tree.c trim_marked(tree); tree 956 kernel/audit_tree.c put_tree(tree); tree 188 kernel/audit_watch.c krule->inode_f || krule->watch || krule->tree) tree 155 kernel/auditfilter.c krule->inode_f || krule->watch || krule->tree || tree 606 kernel/auditfilter.c if (entry->rule.tree) tree 607 kernel/auditfilter.c audit_put_tree(entry->rule.tree); /* that's the temporary one */ tree 668 kernel/auditfilter.c audit_tree_path(krule->tree)); tree 732 kernel/auditfilter.c if (strcmp(audit_tree_path(a->tree), tree 733 kernel/auditfilter.c audit_tree_path(b->tree))) tree 842 kernel/auditfilter.c new->tree = old->tree; tree 934 kernel/auditfilter.c struct audit_tree *tree = entry->rule.tree; tree 955 kernel/auditfilter.c if (tree) tree 956 kernel/auditfilter.c audit_put_tree(tree); tree 969 kernel/auditfilter.c if (tree) tree 970 kernel/auditfilter.c audit_put_tree(tree); tree 974 kernel/auditfilter.c if (tree) { tree 1016 kernel/auditfilter.c struct audit_tree *tree = entry->rule.tree; tree 1041 kernel/auditfilter.c if (e->rule.tree) tree 1062 kernel/auditfilter.c if (tree) tree 1063 kernel/auditfilter.c audit_put_tree(tree); /* that's the temporary one */ tree 1415 kernel/auditfilter.c if (r->watch || r->tree) tree 285 kernel/auditsc.c static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree) tree 289 kernel/auditsc.c if (!tree) tree 294 kernel/auditsc.c if (audit_tree_match(p->c[n], tree)) tree 300 kernel/auditsc.c if (audit_tree_match(p->c[n], tree)) tree 614 kernel/auditsc.c result = match_tree_refs(ctx, rule->tree); tree 1520 kernel/events/core.c groups->tree = RB_ROOT; tree 1561 kernel/events/core.c node = &groups->tree.rb_node; tree 1575 kernel/events/core.c rb_insert_color(&event->group_node, &groups->tree); tree 1598 kernel/events/core.c RB_EMPTY_ROOT(&groups->tree)); tree 1600 kernel/events/core.c rb_erase(&event->group_node, &groups->tree); tree 1623 kernel/events/core.c struct rb_node *node = groups->tree.rb_node; tree 1660 kernel/events/core.c for (event = rb_entry_safe(rb_first(&((groups)->tree)), \ tree 3543 kernel/events/core.c if (!RB_EMPTY_ROOT(&ctx->pinned_groups.tree)) tree 3799 kernel/events/core.c event = rb_entry_safe(rb_first(&ctx->flexible_groups.tree), tree 138 lib/zlib_deflate/deftree.c static void pqdownheap (deflate_state *s, ct_data *tree, int k); tree 140 lib/zlib_deflate/deftree.c static void gen_codes (ct_data *tree, int max_code, ush *bl_count); tree 142 lib/zlib_deflate/deftree.c static void scan_tree (deflate_state *s, ct_data *tree, int max_code); tree 143 lib/zlib_deflate/deftree.c static void send_tree (deflate_state *s, ct_data *tree, int max_code); tree 156 lib/zlib_deflate/deftree.c # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) tree 160 lib/zlib_deflate/deftree.c # define send_code(s, c, tree) \ tree 162 lib/zlib_deflate/deftree.c send_bits(s, tree[c].Code, tree[c].Len); } tree 350 lib/zlib_deflate/deftree.c #define pqremove(s, tree, top) \ tree 354 lib/zlib_deflate/deftree.c pqdownheap(s, tree, SMALLEST); \ tree 361 lib/zlib_deflate/deftree.c #define smaller(tree, n, m, depth) \ tree 362 lib/zlib_deflate/deftree.c (tree[n].Freq < tree[m].Freq || \ tree 363 lib/zlib_deflate/deftree.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) tree 373 lib/zlib_deflate/deftree.c ct_data *tree, /* the tree to restore */ tree 382 lib/zlib_deflate/deftree.c smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { tree 386 lib/zlib_deflate/deftree.c if (smaller(tree, v, s->heap[j], s->depth)) break; tree 412 lib/zlib_deflate/deftree.c ct_data *tree = desc->dyn_tree; tree 430 lib/zlib_deflate/deftree.c tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ tree 434 lib/zlib_deflate/deftree.c bits = tree[tree[n].Dad].Len + 1; tree 436 lib/zlib_deflate/deftree.c tree[n].Len = (ush)bits; tree 444 lib/zlib_deflate/deftree.c f = tree[n].Freq; tree 476 lib/zlib_deflate/deftree.c if (tree[m].Len != (unsigned) bits) { tree 477 lib/zlib_deflate/deftree.c Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); tree 478 lib/zlib_deflate/deftree.c s->opt_len += ((long)bits - (long)tree[m].Len) tree 479 lib/zlib_deflate/deftree.c *(long)tree[m].Freq; tree 480 lib/zlib_deflate/deftree.c tree[m].Len = (ush)bits; tree 496 lib/zlib_deflate/deftree.c ct_data *tree, /* the tree to decorate */ tree 520 lib/zlib_deflate/deftree.c int len = tree[n].Len; tree 523 lib/zlib_deflate/deftree.c tree[n].Code = bitrev32((u32)(next_code[len]++)) >> (32 - len); tree 525 lib/zlib_deflate/deftree.c Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", tree 526 lib/zlib_deflate/deftree.c n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1)); tree 543 lib/zlib_deflate/deftree.c ct_data *tree = desc->dyn_tree; tree 557 lib/zlib_deflate/deftree.c if (tree[n].Freq != 0) { tree 561 lib/zlib_deflate/deftree.c tree[n].Len = 0; tree 572 lib/zlib_deflate/deftree.c tree[node].Freq = 1; tree 582 lib/zlib_deflate/deftree.c for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); tree 589 lib/zlib_deflate/deftree.c pqremove(s, tree, n); /* n = node of least frequency */ tree 596 lib/zlib_deflate/deftree.c tree[node].Freq = tree[n].Freq + tree[m].Freq; tree 598 lib/zlib_deflate/deftree.c tree[n].Dad = tree[m].Dad = (ush)node; tree 600 lib/zlib_deflate/deftree.c if (tree == s->bl_tree) { tree 602 lib/zlib_deflate/deftree.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); tree 607 lib/zlib_deflate/deftree.c pqdownheap(s, tree, SMALLEST); tree 619 lib/zlib_deflate/deftree.c gen_codes ((ct_data *)tree, max_code, s->bl_count); tree 628 lib/zlib_deflate/deftree.c ct_data *tree, /* the tree to be scanned */ tree 635 lib/zlib_deflate/deftree.c int nextlen = tree[0].Len; /* length of next code */ tree 641 lib/zlib_deflate/deftree.c tree[max_code+1].Len = (ush)0xffff; /* guard */ tree 644 lib/zlib_deflate/deftree.c curlen = nextlen; nextlen = tree[n+1].Len; tree 674 lib/zlib_deflate/deftree.c ct_data *tree, /* the tree to be scanned */ tree 681 lib/zlib_deflate/deftree.c int nextlen = tree[0].Len; /* length of next code */ tree 690 lib/zlib_deflate/deftree.c curlen = nextlen; nextlen = tree[n+1].Len; tree 152 lib/zstd/huf.h size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize); tree 420 lib/zstd/huf_compress.c size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize) tree 493 lib/zstd/huf_compress.c tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */ tree 495 lib/zstd/huf_compress.c tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */ tree 240 mm/vmpressure.c void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree, tree 270 mm/vmpressure.c if (tree) { tree 345 mm/zswap.c static void zswap_entry_put(struct zswap_tree *tree, tree 352 mm/zswap.c zswap_rb_erase(&tree->rbroot, entry); tree 844 mm/zswap.c struct zswap_tree *tree; tree 859 mm/zswap.c tree = zswap_trees[swp_type(swpentry)]; tree 863 mm/zswap.c spin_lock(&tree->lock); tree 864 mm/zswap.c entry = zswap_entry_find_get(&tree->rbroot, offset); tree 867 mm/zswap.c spin_unlock(&tree->lock); tree 871 mm/zswap.c spin_unlock(&tree->lock); tree 911 mm/zswap.c spin_lock(&tree->lock); tree 913 mm/zswap.c zswap_entry_put(tree, entry); tree 922 mm/zswap.c if (entry == zswap_rb_search(&tree->rbroot, offset)) tree 923 mm/zswap.c zswap_entry_put(tree, entry); tree 924 mm/zswap.c spin_unlock(&tree->lock); tree 936 mm/zswap.c spin_lock(&tree->lock); tree 937 mm/zswap.c zswap_entry_put(tree, entry); tree 938 mm/zswap.c spin_unlock(&tree->lock); tree 990 mm/zswap.c struct zswap_tree *tree = zswap_trees[type]; tree 1007 mm/zswap.c if (!zswap_enabled || !tree) { tree 1098 mm/zswap.c spin_lock(&tree->lock); tree 1100 mm/zswap.c ret = zswap_rb_insert(&tree->rbroot, entry, &dupentry); tree 1104 mm/zswap.c zswap_rb_erase(&tree->rbroot, dupentry); tree 1105 mm/zswap.c zswap_entry_put(tree, dupentry); tree 1108 mm/zswap.c spin_unlock(&tree->lock); tree 1132 mm/zswap.c struct zswap_tree *tree = zswap_trees[type]; tree 1140 mm/zswap.c spin_lock(&tree->lock); tree 1141 mm/zswap.c entry = zswap_entry_find_get(&tree->rbroot, offset); tree 1144 mm/zswap.c spin_unlock(&tree->lock); tree 1147 mm/zswap.c spin_unlock(&tree->lock); tree 1170 mm/zswap.c spin_lock(&tree->lock); tree 1171 mm/zswap.c zswap_entry_put(tree, entry); tree 1172 mm/zswap.c spin_unlock(&tree->lock); tree 1180 mm/zswap.c struct zswap_tree *tree = zswap_trees[type]; tree 1184 mm/zswap.c spin_lock(&tree->lock); tree 1185 mm/zswap.c entry = zswap_rb_search(&tree->rbroot, offset); tree 1188 mm/zswap.c spin_unlock(&tree->lock); tree 1193 mm/zswap.c zswap_rb_erase(&tree->rbroot, entry); tree 1196 mm/zswap.c zswap_entry_put(tree, entry); tree 1198 mm/zswap.c spin_unlock(&tree->lock); tree 1204 mm/zswap.c struct zswap_tree *tree = zswap_trees[type]; tree 1207 mm/zswap.c if (!tree) tree 1211 mm/zswap.c spin_lock(&tree->lock); tree 1212 mm/zswap.c rbtree_postorder_for_each_entry_safe(entry, n, &tree->rbroot, rbnode) tree 1214 mm/zswap.c tree->rbroot = RB_ROOT; tree 1215 mm/zswap.c spin_unlock(&tree->lock); tree 1216 mm/zswap.c kfree(tree); tree 1222 mm/zswap.c struct zswap_tree *tree; tree 1224 mm/zswap.c tree = kzalloc(sizeof(*tree), GFP_KERNEL); tree 1225 mm/zswap.c if (!tree) { tree 1230 mm/zswap.c tree->rbroot = RB_ROOT; tree 1231 mm/zswap.c spin_lock_init(&tree->lock); tree 1232 mm/zswap.c zswap_trees[type] = tree; tree 293 net/netfilter/nf_conncount.c static void schedule_gc_worker(struct nf_conncount_data *data, int tree) tree 295 net/netfilter/nf_conncount.c set_bit(tree, data->pending_trees); tree 450 net/netfilter/nf_conncount.c unsigned int tree, next_tree, gc_count = 0; tree 452 net/netfilter/nf_conncount.c tree = data->gc_tree % CONNCOUNT_SLOTS; tree 453 net/netfilter/nf_conncount.c root = &data->root[tree]; tree 467 net/netfilter/nf_conncount.c spin_lock_bh(&nf_conncount_locks[tree]); tree 489 net/netfilter/nf_conncount.c clear_bit(tree, data->pending_trees); tree 491 net/netfilter/nf_conncount.c next_tree = (tree + 1) % CONNCOUNT_SLOTS; tree 499 net/netfilter/nf_conncount.c spin_unlock_bh(&nf_conncount_locks[tree]); tree 162 net/sched/ematch.c static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, tree 165 net/sched/ematch.c return &tree->matches[index]; tree 304 net/sched/ematch.c struct tcf_ematch_tree *tree) tree 312 net/sched/ematch.c memset(tree, 0, sizeof(*tree)); tree 329 net/sched/ematch.c memcpy(&tree->hdr, tree_hdr, sizeof(*tree_hdr)); tree 335 net/sched/ematch.c tree->matches = kzalloc(matches_len, GFP_KERNEL); tree 336 net/sched/ematch.c if (tree->matches == NULL) tree 360 net/sched/ematch.c em = tcf_em_get_match(tree, idx); tree 384 net/sched/ematch.c tcf_em_tree_destroy(tree); tree 399 net/sched/ematch.c void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) tree 403 net/sched/ematch.c if (tree->matches == NULL) tree 406 net/sched/ematch.c for (i = 0; i < tree->hdr.nmatches; i++) { tree 407 net/sched/ematch.c struct tcf_ematch *em = tcf_em_get_match(tree, i); tree 418 net/sched/ematch.c tree->hdr.nmatches = 0; tree 419 net/sched/ematch.c kfree(tree->matches); tree 420 net/sched/ematch.c tree->matches = NULL; tree 436 net/sched/ematch.c int tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) tree 447 net/sched/ematch.c if (nla_put(skb, TCA_EMATCH_TREE_HDR, sizeof(tree->hdr), &tree->hdr)) tree 455 net/sched/ematch.c for (i = 0; i < tree->hdr.nmatches; i++) { tree 457 net/sched/ematch.c struct tcf_ematch *em = tcf_em_get_match(tree, i); tree 499 net/sched/ematch.c int __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, tree 507 net/sched/ematch.c while (match_idx < tree->hdr.nmatches) { tree 508 net/sched/ematch.c cur_match = tcf_em_get_match(tree, match_idx); tree 530 net/sched/ematch.c cur_match = tcf_em_get_match(tree, match_idx); tree 216 net/sctp/stream.c new->out.tree.root = NULL; tree 217 net/sctp/stream.c new->in.tree.root = NULL; tree 198 net/tipc/group.c struct rb_root *tree = &grp->members; tree 203 net/tipc/group.c rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { tree 213 net/tipc/group.c struct rb_root *tree = &grp->members; tree 219 net/tipc/group.c rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { tree 31 scripts/dtc/dtc.c static void fill_fullpaths(struct node *tree, const char *prefix) tree 36 scripts/dtc/dtc.c tree->fullpath = join_path(prefix, tree->name); tree 38 scripts/dtc/dtc.c unit = strchr(tree->name, '@'); tree 40 scripts/dtc/dtc.c tree->basenamelen = unit - tree->name; tree 42 scripts/dtc/dtc.c tree->basenamelen = strlen(tree->name); tree 44 scripts/dtc/dtc.c for_each_child(tree, child) tree 45 scripts/dtc/dtc.c fill_fullpaths(child, tree->fullpath); tree 226 scripts/dtc/dtc.h struct property *get_property_by_label(struct node *tree, const char *label, tree 228 scripts/dtc/dtc.h struct marker *get_marker_label(struct node *tree, const char *label, tree 231 scripts/dtc/dtc.h struct node *get_node_by_path(struct node *tree, const char *path); tree 232 scripts/dtc/dtc.h struct node *get_node_by_label(struct node *tree, const char *label); tree 233 scripts/dtc/dtc.h struct node *get_node_by_phandle(struct node *tree, cell_t phandle); tree 234 scripts/dtc/dtc.h struct node *get_node_by_ref(struct node *tree, const char *ref); tree 237 scripts/dtc/dtc.h uint32_t guess_boot_cpuid(struct node *tree); tree 270 scripts/dtc/dtc.h struct node *tree, uint32_t boot_cpuid_phys); tree 235 scripts/dtc/flattree.c static void flatten_tree(struct node *tree, struct emitter *emit, tree 243 scripts/dtc/flattree.c if (tree->deleted) tree 246 scripts/dtc/flattree.c emit->beginnode(etarget, tree->labels); tree 249 scripts/dtc/flattree.c emit->string(etarget, tree->fullpath, 0); tree 251 scripts/dtc/flattree.c emit->string(etarget, tree->name, 0); tree 255 scripts/dtc/flattree.c for_each_property(tree, prop) { tree 276 scripts/dtc/flattree.c emit->cell(etarget, tree->basenamelen+1); tree 279 scripts/dtc/flattree.c if ((vi->flags & FTF_VARALIGN) && ((tree->basenamelen+1) >= 8)) tree 282 scripts/dtc/flattree.c emit->string(etarget, tree->name, tree->basenamelen); tree 286 scripts/dtc/flattree.c for_each_child(tree, child) { tree 290 scripts/dtc/flattree.c emit->endnode(etarget, tree->labels); tree 809 scripts/dtc/flattree.c struct node *tree; tree 914 scripts/dtc/flattree.c tree = unflatten_tree(&dtbuf, &strbuf, "", flags); tree 924 scripts/dtc/flattree.c return build_dt_info(DTSF_V1, reservelist, tree, boot_cpuid_phys); tree 16 scripts/dtc/fstree.c struct node *tree; tree 22 scripts/dtc/fstree.c tree = build_node(NULL, NULL, NULL); tree 50 scripts/dtc/fstree.c add_property(tree, prop); tree 58 scripts/dtc/fstree.c add_child(tree, newchild); tree 65 scripts/dtc/fstree.c return tree; tree 70 scripts/dtc/fstree.c struct node *tree; tree 72 scripts/dtc/fstree.c tree = read_fstree(dirname); tree 73 scripts/dtc/fstree.c tree = name_node(tree, ""); tree 75 scripts/dtc/fstree.c return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); tree 399 scripts/dtc/livetree.c struct node *tree, uint32_t boot_cpuid_phys) tree 406 scripts/dtc/livetree.c dti->dt = tree; tree 447 scripts/dtc/livetree.c struct property *get_property_by_label(struct node *tree, const char *label, tree 453 scripts/dtc/livetree.c *node = tree; tree 455 scripts/dtc/livetree.c for_each_property(tree, prop) { tree 463 scripts/dtc/livetree.c for_each_child(tree, c) { tree 473 scripts/dtc/livetree.c struct marker *get_marker_label(struct node *tree, const char *label, tree 480 scripts/dtc/livetree.c *node = tree; tree 482 scripts/dtc/livetree.c for_each_property(tree, p) { tree 490 scripts/dtc/livetree.c for_each_child(tree, c) { tree 512 scripts/dtc/livetree.c struct node *get_node_by_path(struct node *tree, const char *path) tree 518 scripts/dtc/livetree.c if (tree->deleted) tree 520 scripts/dtc/livetree.c return tree; tree 528 scripts/dtc/livetree.c for_each_child(tree, child) { tree 539 scripts/dtc/livetree.c struct node *get_node_by_label(struct node *tree, const char *label) tree 546 scripts/dtc/livetree.c for_each_label(tree->labels, l) tree 548 scripts/dtc/livetree.c return tree; tree 550 scripts/dtc/livetree.c for_each_child(tree, child) { tree 559 scripts/dtc/livetree.c struct node *get_node_by_phandle(struct node *tree, cell_t phandle) tree 568 scripts/dtc/livetree.c if (tree->phandle == phandle) { tree 569 scripts/dtc/livetree.c if (tree->deleted) tree 571 scripts/dtc/livetree.c return tree; tree 574 scripts/dtc/livetree.c for_each_child(tree, child) { tree 583 scripts/dtc/livetree.c struct node *get_node_by_ref(struct node *tree, const char *ref) tree 586 scripts/dtc/livetree.c return tree; tree 588 scripts/dtc/livetree.c return get_node_by_path(tree, ref); tree 590 scripts/dtc/livetree.c return get_node_by_label(tree, ref); tree 624 scripts/dtc/livetree.c uint32_t guess_boot_cpuid(struct node *tree) tree 629 scripts/dtc/livetree.c cpus = get_node_by_path(tree, "/cpus"); tree 281 scripts/dtc/treesource.c static void write_tree_source_node(FILE *f, struct node *tree, int level) tree 289 scripts/dtc/treesource.c for_each_label(tree->labels, l) tree 291 scripts/dtc/treesource.c if (tree->name && (*tree->name)) tree 292 scripts/dtc/treesource.c fprintf(f, "%s {", tree->name); tree 297 scripts/dtc/treesource.c srcstr = srcpos_string_first(tree->srcpos, annotate); tree 305 scripts/dtc/treesource.c for_each_property(tree, prop) { tree 312 scripts/dtc/treesource.c for_each_child(tree, child) { tree 319 scripts/dtc/treesource.c srcstr = srcpos_string_last(tree->srcpos, annotate); tree 176 scripts/dtc/yamltree.c static void yaml_tree(struct node *tree, yaml_emitter_t *emitter) tree 182 scripts/dtc/yamltree.c if (tree->deleted) tree 189 scripts/dtc/yamltree.c for_each_property(tree, prop) tree 193 scripts/dtc/yamltree.c for_each_child(tree, child) { tree 170 scripts/gcc-plugins/gcc-common.h static inline tree build_const_char_string(int len, const char *str) tree 172 scripts/gcc-plugins/gcc-common.h tree cstr, elem, index, type; tree 195 scripts/gcc-plugins/gcc-common.h for (tree vars = (FUN)->local_decls, (I) = 0; \ tree 212 scripts/gcc-plugins/gcc-common.h tree fndecl; tree 222 scripts/gcc-plugins/gcc-common.h static inline bool is_simple_builtin(tree decl) tree 254 scripts/gcc-plugins/gcc-common.h static inline void add_local_decl(struct function *fun, tree d) tree 286 scripts/gcc-plugins/gcc-common.h tree op = gimple_asm_clobber_op(stmt, i); tree 295 scripts/gcc-plugins/gcc-common.h static inline tree builtin_decl_implicit(enum built_in_function fncode) tree 305 scripts/gcc-plugins/gcc-common.h static inline struct cgraph_node *cgraph_create_node(tree decl) tree 310 scripts/gcc-plugins/gcc-common.h static inline struct cgraph_node *cgraph_get_create_node(tree decl) tree 360 scripts/gcc-plugins/gcc-common.h static inline void varpool_add_new_variable(tree decl) tree 384 scripts/gcc-plugins/gcc-common.h tree lhs = gimple_get_lhs(gs); tree 579 scripts/gcc-plugins/gcc-common.h static inline void set_decl_section_name(tree node, const char *value) tree 747 scripts/gcc-plugins/gcc-common.h static inline void change_decl_assembler_name(tree decl, tree name) tree 752 scripts/gcc-plugins/gcc-common.h static inline void varpool_finalize_decl(tree decl) tree 757 scripts/gcc-plugins/gcc-common.h static inline void varpool_add_new_variable(tree decl) tree 847 scripts/gcc-plugins/gcc-common.h static inline gimple gimple_build_assign_with_ops(enum tree_code subcode, tree lhs, tree op1, tree op2 MEM_STAT_DECL) tree 82 scripts/gcc-plugins/latent_entropy_plugin.c static GTY(()) tree latent_entropy_decl; tree 110 scripts/gcc-plugins/latent_entropy_plugin.c static tree tree_get_random_const(tree type) tree 122 scripts/gcc-plugins/latent_entropy_plugin.c static tree handle_latent_entropy_attribute(tree *node, tree name, tree 123 scripts/gcc-plugins/latent_entropy_plugin.c tree args __unused, tree 127 scripts/gcc-plugins/latent_entropy_plugin.c tree type; tree 165 scripts/gcc-plugins/latent_entropy_plugin.c tree fld, lst = TYPE_FIELDS(type); tree 169 scripts/gcc-plugins/latent_entropy_plugin.c tree fieldtype; tree 191 scripts/gcc-plugins/latent_entropy_plugin.c tree random_const, fld_t = TREE_TYPE(fld); tree 208 scripts/gcc-plugins/latent_entropy_plugin.c tree elt_type, array_size, elt_size; tree 235 scripts/gcc-plugins/latent_entropy_plugin.c tree cst = size_int(i); tree 236 scripts/gcc-plugins/latent_entropy_plugin.c tree rand_cst = tree_get_random_const(elt_type); tree 271 scripts/gcc-plugins/latent_entropy_plugin.c tree list; tree 285 scripts/gcc-plugins/latent_entropy_plugin.c static tree create_var(tree type, const char *name) tree 287 scripts/gcc-plugins/latent_entropy_plugin.c tree var; tree 307 scripts/gcc-plugins/latent_entropy_plugin.c static enum tree_code get_op(tree *rhs) tree 340 scripts/gcc-plugins/latent_entropy_plugin.c static gimple create_assign(enum tree_code code, tree lhs, tree op1, tree 341 scripts/gcc-plugins/latent_entropy_plugin.c tree op2) tree 346 scripts/gcc-plugins/latent_entropy_plugin.c static void perturb_local_entropy(basic_block bb, tree local_entropy) tree 350 scripts/gcc-plugins/latent_entropy_plugin.c tree rhs; tree 361 scripts/gcc-plugins/latent_entropy_plugin.c tree local_entropy) tree 364 scripts/gcc-plugins/latent_entropy_plugin.c tree temp; tree 389 scripts/gcc-plugins/latent_entropy_plugin.c static bool handle_tail_calls(basic_block bb, tree local_entropy) tree 411 scripts/gcc-plugins/latent_entropy_plugin.c static void perturb_latent_entropy(tree local_entropy) tree 437 scripts/gcc-plugins/latent_entropy_plugin.c static void init_local_entropy(basic_block bb, tree local_entropy) tree 440 scripts/gcc-plugins/latent_entropy_plugin.c tree frame_addr, rand_const, tmp, fndecl, udi_frame_addr; tree 491 scripts/gcc-plugins/latent_entropy_plugin.c tree name, var = NODE_DECL(node); tree 510 scripts/gcc-plugins/latent_entropy_plugin.c tree local_entropy; tree 549 scripts/gcc-plugins/latent_entropy_plugin.c tree type, id; tree 76 scripts/gcc-plugins/randomize_layout_plugin.c static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs) tree 78 scripts/gcc-plugins/randomize_layout_plugin.c tree type; tree 119 scripts/gcc-plugins/randomize_layout_plugin.c static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs) tree 129 scripts/gcc-plugins/randomize_layout_plugin.c static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs) tree 169 scripts/gcc-plugins/randomize_layout_plugin.c tree tree_start; tree 174 scripts/gcc-plugins/randomize_layout_plugin.c static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_groups, unsigned long *num_groups) tree 210 scripts/gcc-plugins/randomize_layout_plugin.c static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) tree 228 scripts/gcc-plugins/randomize_layout_plugin.c tree tmp; tree 242 scripts/gcc-plugins/randomize_layout_plugin.c static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) tree 247 scripts/gcc-plugins/randomize_layout_plugin.c tree tmp; tree 256 scripts/gcc-plugins/randomize_layout_plugin.c static void shuffle(const_tree type, tree *newtree, unsigned long length) tree 273 scripts/gcc-plugins/randomize_layout_plugin.c debug_tree((tree)type); tree 320 scripts/gcc-plugins/randomize_layout_plugin.c static int relayout_struct(tree type) tree 324 scripts/gcc-plugins/randomize_layout_plugin.c tree field; tree 325 scripts/gcc-plugins/randomize_layout_plugin.c tree newtree[num_fields]; tree 327 scripts/gcc-plugins/randomize_layout_plugin.c tree list; tree 328 scripts/gcc-plugins/randomize_layout_plugin.c tree variant; tree 329 scripts/gcc-plugins/randomize_layout_plugin.c tree main_variant; tree 373 scripts/gcc-plugins/randomize_layout_plugin.c shuffle(type, (tree *)newtree, shuffle_length); tree 459 scripts/gcc-plugins/randomize_layout_plugin.c static void randomize_type(tree type) tree 461 scripts/gcc-plugins/randomize_layout_plugin.c tree variant; tree 483 scripts/gcc-plugins/randomize_layout_plugin.c static void update_decl_size(tree decl) tree 485 scripts/gcc-plugins/randomize_layout_plugin.c tree lastval, lastidx, field, init, type, flexsize; tree 530 scripts/gcc-plugins/randomize_layout_plugin.c tree decl = (tree)event_data; tree 531 scripts/gcc-plugins/randomize_layout_plugin.c tree type; tree 558 scripts/gcc-plugins/randomize_layout_plugin.c tree type = (tree)event_data; tree 618 scripts/gcc-plugins/randomize_layout_plugin.c static void check_bad_casts_in_constructor(tree var, tree init) tree 621 scripts/gcc-plugins/randomize_layout_plugin.c tree field, val; tree 622 scripts/gcc-plugins/randomize_layout_plugin.c tree field_type, val_type; tree 663 scripts/gcc-plugins/randomize_layout_plugin.c tree init; tree 666 scripts/gcc-plugins/randomize_layout_plugin.c tree var = NODE_DECL(node); tree 736 scripts/gcc-plugins/randomize_layout_plugin.c tree var; tree 740 scripts/gcc-plugins/randomize_layout_plugin.c tree init = DECL_INITIAL(var); tree 26 scripts/gcc-plugins/sancov_plugin.c tree sancov_fndecl; tree 67 scripts/gcc-plugins/sancov_plugin.c tree leaf_attr, nothrow_attr; tree 68 scripts/gcc-plugins/sancov_plugin.c tree BT_FN_VOID = build_function_type_list(void_type_node, NULL_TREE); tree 41 scripts/gcc-plugins/stackleak_plugin.c static GTY(()) tree track_function_decl; tree 267 scripts/gcc-plugins/stackleak_plugin.c tree section; tree 291 scripts/gcc-plugins/stackleak_plugin.c tree fntype; tree 53 scripts/gcc-plugins/structleak_plugin.c static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) tree 78 scripts/gcc-plugins/structleak_plugin.c static tree get_field_type(tree field) tree 83 scripts/gcc-plugins/structleak_plugin.c static bool is_userspace_type(tree type) tree 85 scripts/gcc-plugins/structleak_plugin.c tree field; tree 88 scripts/gcc-plugins/structleak_plugin.c tree fieldtype = get_field_type(field); tree 103 scripts/gcc-plugins/structleak_plugin.c tree type = (tree)event_data; tree 120 scripts/gcc-plugins/structleak_plugin.c static void initialize(tree var) tree 124 scripts/gcc-plugins/structleak_plugin.c tree initializer; tree 126 scripts/gcc-plugins/structleak_plugin.c tree type; tree 134 scripts/gcc-plugins/structleak_plugin.c tree rhs1; tree 178 scripts/gcc-plugins/structleak_plugin.c tree var; tree 191 scripts/gcc-plugins/structleak_plugin.c tree type = TREE_TYPE(var); tree 54 scripts/kconfig/gconf.c GtkTreeStore *tree1, *tree2, *tree; tree 195 scripts/kconfig/gconf.c tree = tree2 = gtk_tree_store_new(COL_NUMBER, tree 1174 scripts/kconfig/gconf.c gtk_tree_store_set(tree, node, tree 1202 scripts/kconfig/gconf.c gtk_tree_store_append(tree, node, parent); tree 1354 scripts/kconfig/gconf.c && !(child->flags & MENU_ROOT) && (tree == tree1)) tree 1358 scripts/kconfig/gconf.c && (tree == tree2)) tree 1379 scripts/kconfig/gconf.c && (tree == tree2)) tree 1419 scripts/kconfig/gconf.c tree = tree1; tree 1422 scripts/kconfig/gconf.c tree = tree2; tree 322 sound/hda/hdac_sysfs.c struct hdac_widget_tree *tree = codec->widgets; tree 325 sound/hda/hdac_sysfs.c if (!tree) tree 327 sound/hda/hdac_sysfs.c free_widget_node(tree->afg, &widget_afg_group); tree 328 sound/hda/hdac_sysfs.c if (tree->nodes) { tree 329 sound/hda/hdac_sysfs.c for (p = tree->nodes; *p; p++) tree 331 sound/hda/hdac_sysfs.c kfree(tree->nodes); tree 333 sound/hda/hdac_sysfs.c kobject_put(tree->root); tree 334 sound/hda/hdac_sysfs.c kfree(tree); tree 363 sound/hda/hdac_sysfs.c struct hdac_widget_tree *tree; tree 367 sound/hda/hdac_sysfs.c tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); tree 368 sound/hda/hdac_sysfs.c if (!tree) tree 371 sound/hda/hdac_sysfs.c tree->root = kobject_create_and_add("widgets", &codec->dev.kobj); tree 372 sound/hda/hdac_sysfs.c if (!tree->root) tree 375 sound/hda/hdac_sysfs.c tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), tree 377 sound/hda/hdac_sysfs.c if (!tree->nodes) tree 381 sound/hda/hdac_sysfs.c err = add_widget_node(tree->root, nid, &widget_node_group, tree 382 sound/hda/hdac_sysfs.c &tree->nodes[i]); tree 388 sound/hda/hdac_sysfs.c err = add_widget_node(tree->root, codec->afg, tree 389 sound/hda/hdac_sysfs.c &widget_afg_group, &tree->afg); tree 394 sound/hda/hdac_sysfs.c kobject_uevent(tree->root, KOBJ_CHANGE); tree 425 sound/hda/hdac_sysfs.c struct hdac_widget_tree *tree; tree 433 sound/hda/hdac_sysfs.c tree = kmemdup(codec->widgets, sizeof(*tree), GFP_KERNEL); tree 434 sound/hda/hdac_sysfs.c if (!tree) tree 437 sound/hda/hdac_sysfs.c tree->nodes = kcalloc(num_nodes + 1, sizeof(*tree->nodes), GFP_KERNEL); tree 438 sound/hda/hdac_sysfs.c if (!tree->nodes) { tree 439 sound/hda/hdac_sysfs.c kfree(tree); tree 453 sound/hda/hdac_sysfs.c add_widget_node(tree->root, nid, &widget_node_group, tree 454 sound/hda/hdac_sysfs.c &tree->nodes[i]); tree 456 sound/hda/hdac_sysfs.c tree->nodes[i] = tree 463 sound/hda/hdac_sysfs.c codec->widgets = tree; tree 465 sound/hda/hdac_sysfs.c kobject_uevent(tree->root, KOBJ_CHANGE); tree 304 tools/perf/ui/stdio/hist.c static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, tree 310 tools/perf/ui/stdio/hist.c struct rb_node *rb_node = rb_first(tree); tree 355 tools/perf/ui/stdio/hist.c static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, tree 361 tools/perf/ui/stdio/hist.c struct rb_node *rb_node = rb_first(tree); tree 614 tools/perf/util/srcline.c void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) tree 616 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; tree 641 tools/perf/util/srcline.c rb_insert_color_cached(&node->rb_node, tree, leftmost); tree 644 tools/perf/util/srcline.c char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) tree 646 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; tree 663 tools/perf/util/srcline.c void srcline__tree_delete(struct rb_root_cached *tree) tree 666 tools/perf/util/srcline.c struct rb_node *next = rb_first_cached(tree); tree 671 tools/perf/util/srcline.c rb_erase_cached(&pos->rb_node, tree); tree 705 tools/perf/util/srcline.c void inlines__tree_insert(struct rb_root_cached *tree, tree 708 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; tree 725 tools/perf/util/srcline.c rb_insert_color_cached(&inlines->rb_node, tree, leftmost); tree 728 tools/perf/util/srcline.c struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) tree 730 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; tree 747 tools/perf/util/srcline.c void inlines__tree_delete(struct rb_root_cached *tree) tree 750 tools/perf/util/srcline.c struct rb_node *next = rb_first_cached(tree); tree 755 tools/perf/util/srcline.c rb_erase_cached(&pos->rb_node, tree); tree 22 tools/perf/util/srcline.h void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline); tree 24 tools/perf/util/srcline.h char *srcline__tree_find(struct rb_root_cached *tree, u64 addr); tree 26 tools/perf/util/srcline.h void srcline__tree_delete(struct rb_root_cached *tree); tree 49 tools/perf/util/srcline.h void inlines__tree_insert(struct rb_root_cached *tree, tree 52 tools/perf/util/srcline.h struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr); tree 54 tools/perf/util/srcline.h void inlines__tree_delete(struct rb_root_cached *tree); tree 117 tools/testing/radix-tree/benchmark.c RADIX_TREE(tree, GFP_KERNEL); tree 120 tools/testing/radix-tree/benchmark.c benchmark_insert(&tree, size, step); tree 121 tools/testing/radix-tree/benchmark.c benchmark_tagging(&tree, size, step); tree 123 tools/testing/radix-tree/benchmark.c tagged = benchmark_iter(&tree, true); tree 124 tools/testing/radix-tree/benchmark.c normal = benchmark_iter(&tree, false); tree 131 tools/testing/radix-tree/benchmark.c benchmark_delete(&tree, size, step); tree 133 tools/testing/radix-tree/benchmark.c item_kill_tree(&tree); tree 18 tools/testing/radix-tree/main.c RADIX_TREE(tree, GFP_KERNEL); tree 23 tools/testing/radix-tree/main.c item_insert(&tree, middle + idx); tree 25 tools/testing/radix-tree/main.c item_check_absent(&tree, middle - down - 1); tree 27 tools/testing/radix-tree/main.c item_check_present(&tree, middle + idx); tree 28 tools/testing/radix-tree/main.c item_check_absent(&tree, middle + up); tree 31 tools/testing/radix-tree/main.c item_gang_check_present(&tree, middle - down, up + down, tree 33 tools/testing/radix-tree/main.c item_full_scan(&tree, middle - down, down + up, chunk); tree 35 tools/testing/radix-tree/main.c item_kill_tree(&tree); tree 81 tools/testing/radix-tree/main.c RADIX_TREE(tree, GFP_KERNEL); tree 83 tools/testing/radix-tree/main.c item_insert(&tree, 44); tree 84 tools/testing/radix-tree/main.c item_check_present(&tree, 44); tree 85 tools/testing/radix-tree/main.c item_check_absent(&tree, 43); tree 86 tools/testing/radix-tree/main.c item_kill_tree(&tree); tree 92 tools/testing/radix-tree/main.c RADIX_TREE(tree, GFP_KERNEL); tree 93 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 0); tree 95 tools/testing/radix-tree/main.c item_insert(&tree, 42); tree 96 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 42); tree 98 tools/testing/radix-tree/main.c item_insert(&tree, 1000000); tree 99 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 1000000); tree 101 tools/testing/radix-tree/main.c assert(item_delete(&tree, 1000000)); tree 102 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 42); tree 104 tools/testing/radix-tree/main.c assert(item_delete(&tree, 42)); tree 105 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 0); tree 108 tools/testing/radix-tree/main.c item_insert(&tree, i); tree 109 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, i); tree 114 tools/testing/radix-tree/main.c assert(item_delete(&tree, i)); tree 116 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, 0); tree 120 tools/testing/radix-tree/main.c tree_verify_min_height(&tree, i); tree 123 tools/testing/radix-tree/main.c item_kill_tree(&tree); tree 126 tools/testing/radix-tree/main.c void check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag) tree 134 tools/testing/radix-tree/main.c if (item_tag_get(tree, idx[i], totag)) { tree 136 tools/testing/radix-tree/main.c end, idx[i], item_tag_get(tree, idx[i], tree 138 tools/testing/radix-tree/main.c item_tag_get(tree, idx[i], totag)); tree 140 tools/testing/radix-tree/main.c assert(!item_tag_get(tree, idx[i], totag)); tree 143 tools/testing/radix-tree/main.c if (item_tag_get(tree, idx[i], fromtag) ^ tree 144 tools/testing/radix-tree/main.c item_tag_get(tree, idx[i], totag)) { tree 146 tools/testing/radix-tree/main.c idx[i], item_tag_get(tree, idx[i], fromtag), tree 147 tools/testing/radix-tree/main.c item_tag_get(tree, idx[i], totag)); tree 149 tools/testing/radix-tree/main.c assert(!(item_tag_get(tree, idx[i], fromtag) ^ tree 150 tools/testing/radix-tree/main.c item_tag_get(tree, idx[i], totag))); tree 158 tools/testing/radix-tree/main.c RADIX_TREE(tree, GFP_KERNEL); tree 175 tools/testing/radix-tree/main.c item_insert(&tree, start); tree 179 tools/testing/radix-tree/main.c item_tag_set(&tree, start, 0); tree 183 tools/testing/radix-tree/main.c item_insert(&tree, start-1); tree 185 tools/testing/radix-tree/main.c item_tag_set(&tree, start-1, 0); tree 188 tools/testing/radix-tree/main.c item_insert(&tree, end); tree 192 tools/testing/radix-tree/main.c item_tag_set(&tree, end, 0); tree 196 tools/testing/radix-tree/main.c item_insert(&tree, end+1); tree 198 tools/testing/radix-tree/main.c item_tag_set(&tree, end+1, 0); tree 204 tools/testing/radix-tree/main.c } while (item_lookup(&tree, idx[i])); tree 206 tools/testing/radix-tree/main.c item_insert(&tree, idx[i]); tree 208 tools/testing/radix-tree/main.c item_tag_set(&tree, idx[i], 0); tree 217 tools/testing/radix-tree/main.c tagged = tag_tagged_items(&tree, start, end, ITEMS, XA_MARK_0, XA_MARK_1); tree 221 tools/testing/radix-tree/main.c check_copied_tags(&tree, start, end, idx, ITEMS, 0, 1); tree 226 tools/testing/radix-tree/main.c tagged = tag_tagged_items(&tree, start, end, tmp, XA_MARK_0, XA_MARK_2); tree 231 tools/testing/radix-tree/main.c check_copied_tags(&tree, start, end, idx, ITEMS, 0, 2); tree 232 tools/testing/radix-tree/main.c verify_tag_consistency(&tree, 0); tree 233 tools/testing/radix-tree/main.c verify_tag_consistency(&tree, 1); tree 234 tools/testing/radix-tree/main.c verify_tag_consistency(&tree, 2); tree 236 tools/testing/radix-tree/main.c item_kill_tree(&tree); tree 168 tools/testing/radix-tree/multiorder.c struct radix_tree_root *tree = ptr; tree 172 tools/testing/radix-tree/multiorder.c item_insert_order(tree, 0, order); tree 173 tools/testing/radix-tree/multiorder.c item_delete_rcu(tree, 0); tree 14 tools/testing/radix-tree/tag_check.c __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) tree 19 tools/testing/radix-tree/tag_check.c item_check_absent(tree, index); tree 20 tools/testing/radix-tree/tag_check.c assert(item_tag_get(tree, index, tag) == 0); tree 22 tools/testing/radix-tree/tag_check.c item_insert(tree, index); tree 23 tools/testing/radix-tree/tag_check.c assert(item_tag_get(tree, index, tag) == 0); tree 24 tools/testing/radix-tree/tag_check.c item_tag_set(tree, index, tag); tree 25 tools/testing/radix-tree/tag_check.c ret = item_tag_get(tree, index, tag); tree 27 tools/testing/radix-tree/tag_check.c ret = tag_tagged_items(tree, first, ~0UL, 10, tag, !tag); tree 29 tools/testing/radix-tree/tag_check.c ret = item_tag_get(tree, index, !tag); tree 31 tools/testing/radix-tree/tag_check.c ret = item_delete(tree, index); tree 33 tools/testing/radix-tree/tag_check.c item_insert(tree, index); tree 34 tools/testing/radix-tree/tag_check.c ret = item_tag_get(tree, index, tag); tree 36 tools/testing/radix-tree/tag_check.c ret = item_delete(tree, index); tree 38 tools/testing/radix-tree/tag_check.c ret = item_delete(tree, index); tree 45 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 48 tools/testing/radix-tree/tag_check.c __simple_checks(&tree, index, 0); tree 49 tools/testing/radix-tree/tag_check.c __simple_checks(&tree, index, 1); tree 51 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 0); tree 52 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 1); tree 54 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 64 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 66 tools/testing/radix-tree/tag_check.c item_insert(&tree, 43); tree 67 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 43, 0) == 0); tree 68 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, 43, 0); tree 69 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 43, 0) == 1); tree 70 tools/testing/radix-tree/tag_check.c item_insert(&tree, 1000000); tree 71 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 43, 0) == 1); tree 73 tools/testing/radix-tree/tag_check.c item_insert(&tree, 0); tree 74 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, 0, 0); tree 75 tools/testing/radix-tree/tag_check.c item_delete(&tree, 1000000); tree 76 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 43, 0) != 0); tree 77 tools/testing/radix-tree/tag_check.c item_delete(&tree, 43); tree 78 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 43, 0) == 0); /* crash */ tree 79 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, 0, 0) == 1); tree 81 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 0); tree 83 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 93 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 96 tools/testing/radix-tree/tag_check.c item_insert(&tree, tmp); tree 97 tools/testing/radix-tree/tag_check.c item_insert(&tree, tmp+1); tree 98 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, tmp, 0); tree 99 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, tmp, 1); tree 100 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, tmp+1, 0); tree 101 tools/testing/radix-tree/tag_check.c item_delete(&tree, tmp+1); tree 102 tools/testing/radix-tree/tag_check.c item_tag_clear(&tree, tmp, 1); tree 104 tools/testing/radix-tree/tag_check.c assert(radix_tree_gang_lookup_tag(&tree, (void **)&item, 0, 1, 0) == 1); tree 105 tools/testing/radix-tree/tag_check.c assert(radix_tree_gang_lookup_tag(&tree, (void **)&item, 0, 1, 1) == 0); tree 107 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, tmp, 0) == 1); tree 108 tools/testing/radix-tree/tag_check.c assert(item_tag_get(&tree, tmp, 1) == 0); tree 110 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 0); tree 111 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 131 tools/testing/radix-tree/tag_check.c static void gang_check(struct radix_tree_root *tree, tree 139 tools/testing/radix-tree/tag_check.c while ((nr_found = radix_tree_gang_lookup_tag(tree, (void **)items, tree 157 tools/testing/radix-tree/tag_check.c static void do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) tree 183 tools/testing/radix-tree/tag_check.c item_check_absent(tree, index); tree 184 tools/testing/radix-tree/tag_check.c item_insert(tree, index); tree 195 tools/testing/radix-tree/tag_check.c item_check_present(tree, index); tree 196 tools/testing/radix-tree/tag_check.c if (item_tag_get(tree, index, tag)) { tree 202 tools/testing/radix-tree/tag_check.c item_delete(tree, index); tree 212 tools/testing/radix-tree/tag_check.c if (item_lookup(tree, index)) tree 213 tools/testing/radix-tree/tag_check.c assert(item_tag_get(tree, index, tag)); tree 216 tools/testing/radix-tree/tag_check.c item_tag_set(tree, index, tag); tree 217 tools/testing/radix-tree/tag_check.c item_tag_set(tree, index, tag); tree 228 tools/testing/radix-tree/tag_check.c item_check_present(tree, index); tree 229 tools/testing/radix-tree/tag_check.c assert(item_tag_get(tree, index, tag)); tree 230 tools/testing/radix-tree/tag_check.c item_tag_clear(tree, index, tag); tree 231 tools/testing/radix-tree/tag_check.c item_tag_clear(tree, index, tag); tree 243 tools/testing/radix-tree/tag_check.c item_check_absent(tree, index); tree 246 tools/testing/radix-tree/tag_check.c item_check_present(tree, index); tree 247 tools/testing/radix-tree/tag_check.c assert(!item_tag_get(tree, index, tag)); tree 251 tools/testing/radix-tree/tag_check.c item_check_present(tree, index); tree 252 tools/testing/radix-tree/tag_check.c assert(item_tag_get(tree, index, tag)); tree 259 tools/testing/radix-tree/tag_check.c gang_check(tree, thrash_state, tag); tree 274 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 280 tools/testing/radix-tree/tag_check.c do_thrash(&tree, thrash_state, 0); tree 282 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 0); tree 283 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 289 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 291 tools/testing/radix-tree/tag_check.c item_insert(&tree, 1000000); tree 292 tools/testing/radix-tree/tag_check.c item_delete(&tree, 1000000); tree 293 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 298 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 301 tools/testing/radix-tree/tag_check.c item_insert(&tree, 1000000); tree 303 tools/testing/radix-tree/tag_check.c item_delete(&tree, 1000000); tree 305 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree); tree 312 tools/testing/radix-tree/tag_check.c RADIX_TREE(tree, GFP_KERNEL); tree 316 tools/testing/radix-tree/tag_check.c item_insert(&tree, 0); tree 317 tools/testing/radix-tree/tag_check.c item_tag_set(&tree, 0, 0); tree 318 tools/testing/radix-tree/tag_check.c ret = radix_tree_gang_lookup_tag(&tree, (void **)items, 0, BATCH, 0); tree 320 tools/testing/radix-tree/tag_check.c ret = radix_tree_gang_lookup_tag(&tree, (void **)items, 1, BATCH, 0); tree 322 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 0); tree 323 tools/testing/radix-tree/tag_check.c verify_tag_consistency(&tree, 1); tree 324 tools/testing/radix-tree/tag_check.c ret = tag_tagged_items(&tree, first, 10, 10, XA_MARK_0, XA_MARK_1); tree 326 tools/testing/radix-tree/tag_check.c ret = radix_tree_gang_lookup_tag(&tree, (void **)items, 0, BATCH, 1); tree 328 tools/testing/radix-tree/tag_check.c item_tag_clear(&tree, 0, 0); tree 329 tools/testing/radix-tree/tag_check.c ret = radix_tree_gang_lookup_tag(&tree, (void **)items, 0, BATCH, 0); tree 331 tools/testing/radix-tree/tag_check.c item_kill_tree(&tree);