Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 70) sorted by relevance

123

/fs/hfs/
A Dbtree.c31 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
32 if (!tree) in hfs_btree_open()
38 tree->sb = sb; in hfs_btree_open()
39 tree->cnid = id; in hfs_btree_open()
158 return tree; in hfs_btree_open()
169 kfree(tree); in hfs_btree_open()
179 if (!tree) in hfs_btree_close()
194 kfree(tree); in hfs_btree_close()
228 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
279 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
[all …]
A Dbrec.c74 tree = fd->tree; in hfs_brec_insert()
76 if (!tree->root) in hfs_brec_insert()
78 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
108 tree->leaf_count++; in hfs_brec_insert()
183 tree = fd->tree; in hfs_brec_remove()
190 tree->leaf_count--; in hfs_brec_remove()
239 tree = fd->tree; in hfs_bnode_split()
360 tree = fd->tree; in hfs_brec_update_parent()
466 if (tree->root) { in hfs_btree_inc_height()
467 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
[all …]
A Dbnode.c116 struct hfs_btree *tree; in hfs_bnode_read_key() local
119 tree = node->tree; in hfs_bnode_read_key()
279 struct hfs_btree *tree; in hfs_bnode_unlink() local
283 tree = node->tree; in hfs_bnode_unlink()
311 tree->root = 0; in hfs_bnode_unlink()
312 tree->depth = 0; in hfs_bnode_unlink()
360 node->tree = tree; in __hfs_bnode_create()
367 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
373 tree->node_hash_cnt++; in __hfs_bnode_create()
411 node->tree->node_hash_cnt--; in hfs_bnode_unhash()
[all …]
A Dbfind.c19 if (!tree || !fd) in hfs_find_init()
22 fd->tree = tree; in hfs_find_init()
31 switch (tree->cnid) { in hfs_find_init()
53 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
54 fd->tree = NULL; in hfs_find_exit()
112 struct hfs_btree *tree; in hfs_brec_find() local
118 tree = fd->tree; in hfs_brec_find()
122 nidx = tree->root; in hfs_brec_find()
125 height = tree->depth; in hfs_brec_find()
179 struct hfs_btree *tree; in hfs_brec_goto() local
[all …]
A Dinode.c70 struct hfs_btree *tree; in hfs_release_folio() local
78 tree = HFS_SB(sb)->ext_tree; in hfs_release_folio()
81 tree = HFS_SB(sb)->cat_tree; in hfs_release_folio()
88 if (!tree) in hfs_release_folio()
91 if (tree->node_size >= PAGE_SIZE) { in hfs_release_folio()
93 spin_lock(&tree->hash_lock); in hfs_release_folio()
94 node = hfs_bnode_findhash(tree, nidx); in hfs_release_folio()
103 spin_unlock(&tree->hash_lock); in hfs_release_folio()
107 spin_lock(&tree->hash_lock); in hfs_release_folio()
109 node = hfs_bnode_findhash(tree, nidx++); in hfs_release_folio()
[all …]
/fs/hfsplus/
A Dbtree.c142 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
143 if (!tree) in hfs_btree_open()
148 tree->sb = sb; in hfs_btree_open()
149 tree->cnid = id; in hfs_btree_open()
245 return tree; in hfs_btree_open()
254 kfree(tree); in hfs_btree_open()
264 if (!tree) in hfs_btree_close()
280 kfree(tree); in hfs_btree_close()
315 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
368 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
[all …]
A Dbrec.c72 tree = fd->tree; in hfs_brec_insert()
74 if (!tree->root) in hfs_brec_insert()
76 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
106 tree->leaf_count++; in hfs_brec_insert()
185 tree = fd->tree; in hfs_brec_remove()
192 tree->leaf_count--; in hfs_brec_remove()
243 tree = fd->tree; in hfs_bnode_split()
364 tree = fd->tree; in hfs_brec_update_parent()
470 if (tree->root) { in hfs_btree_inc_height()
471 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
[all …]
A Dbnode.c115 struct hfs_btree *tree; in hfs_bnode_read_key() local
118 tree = node->tree; in hfs_bnode_read_key()
428 struct hfs_btree *tree; in hfs_bnode_unlink() local
432 tree = node->tree; in hfs_bnode_unlink()
461 tree->root = 0; in hfs_bnode_unlink()
462 tree->depth = 0; in hfs_bnode_unlink()
510 node->tree = tree; in __hfs_bnode_create()
517 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
523 tree->node_hash_cnt++; in __hfs_bnode_create()
561 node->tree->node_hash_cnt--; in hfs_bnode_unhash()
[all …]
A Dbfind.c19 fd->tree = tree; in hfs_find_init()
28 mutex_lock_nested(&tree->tree_lock, in hfs_find_init()
29 hfsplus_btree_lock_class(tree)); in hfs_find_init()
39 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
40 fd->tree = NULL; in hfs_find_exit()
155 struct hfs_btree *tree; in hfs_brec_find() local
161 tree = fd->tree; in hfs_brec_find()
165 nidx = tree->root; in hfs_brec_find()
168 height = tree->depth; in hfs_brec_find()
222 struct hfs_btree *tree; in hfs_brec_goto() local
[all …]
A Dhfsplus_fs.h105 struct hfs_btree *tree; member
293 struct hfs_btree *tree; member
391 void hfs_btree_close(struct hfs_btree *tree);
392 int hfs_btree_write(struct hfs_btree *tree);
393 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes);
394 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree);
412 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
414 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num);
417 bool hfs_bnode_need_zeroout(struct hfs_btree *tree);
560 hfsplus_btree_lock_class(struct hfs_btree *tree) in hfsplus_btree_lock_class() argument
[all …]
A Dinode.c66 struct hfs_btree *tree; in hfsplus_release_folio() local
74 tree = HFSPLUS_SB(sb)->ext_tree; in hfsplus_release_folio()
77 tree = HFSPLUS_SB(sb)->cat_tree; in hfsplus_release_folio()
80 tree = HFSPLUS_SB(sb)->attr_tree; in hfsplus_release_folio()
86 if (!tree) in hfsplus_release_folio()
88 if (tree->node_size >= PAGE_SIZE) { in hfsplus_release_folio()
90 (tree->node_size_shift - PAGE_SHIFT); in hfsplus_release_folio()
91 spin_lock(&tree->hash_lock); in hfsplus_release_folio()
101 spin_unlock(&tree->hash_lock); in hfsplus_release_folio()
106 spin_lock(&tree->hash_lock); in hfsplus_release_folio()
[all …]
A Dextents.c104 res = hfs_bmap_reserve(fd->tree, fd->tree->depth + 1); in __hfsplus_ext_write_extent()
426 mutex_unlock(&fd.tree->tree_lock); in hfsplus_free_fork()
430 mutex_lock_nested(&fd.tree->tree_lock, in hfsplus_free_fork()
431 hfsplus_btree_lock_class(fd.tree)); in hfsplus_free_fork()
588 mutex_unlock(&fd.tree->tree_lock); in hfsplus_file_truncate()
593 mutex_lock_nested(&fd.tree->tree_lock, in hfsplus_file_truncate()
594 hfsplus_btree_lock_class(fd.tree)); in hfsplus_file_truncate()
604 mutex_unlock(&fd.tree->tree_lock); in hfsplus_file_truncate()
608 mutex_lock_nested(&fd.tree->tree_lock, in hfsplus_file_truncate()
609 hfsplus_btree_lock_class(fd.tree)); in hfsplus_file_truncate()
/fs/btrfs/
A Dextent-io-tree.c87 return tree->inode; in btrfs_extent_io_tree_to_inode()
96 return tree->fs_info; in btrfs_extent_io_tree_to_fs_info()
102 tree->state = RB_ROOT; in btrfs_extent_io_tree_init()
104 tree->fs_info = fs_info; in btrfs_extent_io_tree_init()
105 tree->owner = owner; in btrfs_extent_io_tree_init()
121 spin_lock(&tree->lock); in btrfs_extent_io_tree_release()
122 root = tree->state; in btrfs_extent_io_tree_release()
123 tree->state = RB_ROOT; in btrfs_extent_io_tree_release()
142 spin_unlock(&tree->lock); in btrfs_extent_io_tree_release()
650 spin_lock(&tree->lock); in btrfs_clear_extent_bit_changeset()
[all …]
A Dextent-io-tree.h142 struct extent_io_tree *tree, unsigned int owner);
143 void btrfs_extent_io_tree_release(struct extent_io_tree *tree);
152 return btrfs_lock_extent_bits(tree, start, end, EXTENT_LOCKED, cached); in btrfs_lock_extent()
158 return btrfs_try_lock_extent_bits(tree, start, end, EXTENT_LOCKED, cached); in btrfs_try_lock_extent()
164 u64 btrfs_count_range_bits(struct extent_io_tree *tree,
191 return btrfs_clear_extent_bit_changeset(tree, start, end, EXTENT_LOCKED, in btrfs_unlock_extent()
197 int btrfs_set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
203 return btrfs_clear_extent_bit(tree, start, end, in btrfs_clear_extent_dirty()
212 bool btrfs_find_first_extent_bit(struct extent_io_tree *tree, u64 start,
219 bool btrfs_find_delalloc_range(struct extent_io_tree *tree, u64 *start,
[all …]
A DMakefile25 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
30 export.o tree-log.o free-space-cache.o zlib.o lzo.o zstd.o \
33 uuid-tree.o props.o free-space-tree.o tree-checker.o space-info.o \
35 subpage.o tree-mod-log.o extent-io-tree.o fs.o messages.o bio.o \
36 lru_cache.o raid-stripe-tree.o fiemap.o direct-io.o
46 tests/free-space-tree-tests.o tests/extent-map-tests.o \
47 tests/raid-stripe-tree-tests.o tests/delayed-refs-tests.o
A Dextent_map.c36 tree->root = RB_ROOT; in btrfs_extent_map_tree_init()
38 rwlock_init(&tree->lock); in btrfs_extent_map_tree_init()
419 write_lock(&tree->lock); in btrfs_unpin_extent_cache()
446 write_unlock(&tree->lock); in btrfs_unpin_extent_cache()
766 write_lock(&tree->lock); in drop_all_extent_maps_fast()
782 write_unlock(&tree->lock); in drop_all_extent_maps_fast()
1021 write_lock(&tree->lock); in btrfs_replace_extent_map_range()
1023 write_unlock(&tree->lock); in btrfs_replace_extent_map_range()
1208 tree = &inode->extent_tree; in find_first_inode_to_shrink()
1227 write_unlock(&tree->lock); in find_first_inode_to_shrink()
[all …]
A Dextent_map.h170 void btrfs_extent_map_tree_init(struct extent_map_tree *tree);
171 struct extent_map *btrfs_lookup_extent_mapping(struct extent_map_tree *tree,
183 struct extent_map *btrfs_search_extent_mapping(struct extent_map_tree *tree,
/fs/unicode/
A Dmkutf8data.c417 static void tree_walk(struct tree *tree) in tree_walk() argument
428 printf("%s_%x root %p\n", tree->type, tree->maxage, tree->root); in tree_walk()
431 tree->leaf_print(tree->root, indent); in tree_walk()
654 static void prune(struct tree *tree) in prune() argument
961 index += tree->leaf_size(tree->root); in index_nodes()
1048 static int size_nodes(struct tree *tree) in size_nodes() argument
1211 tree->leaf_emit(tree->root, data); in emit()
1212 size = tree->leaf_size(tree->root); in emit()
1745 static void verify(struct tree *tree) in verify() argument
2967 struct tree *tree; member
[all …]
/fs/ext4/
A Dextents_status.c205 tree->root = RB_ROOT; in ext4_es_init_tree()
206 tree->cache_es = NULL; in ext4_es_init_tree()
212 struct ext4_es_tree *tree; in ext4_es_print_tree() local
217 node = rb_first(&tree->root); in ext4_es_print_tree()
872 tree->cache_es = es; in __es_insert_extent()
1033 struct ext4_es_tree *tree; in ext4_es_lookup_extent() local
1058 node = tree->root.rb_node; in ext4_es_lookup_extent()
1437 tree->cache_es = NULL; in __es_remove_extent()
1890 struct ext4_es_tree *tree; in ext4_clear_inode_es() local
1895 tree->cache_es = NULL; in ext4_clear_inode_es()
[all …]
/fs/ocfs2/
A Duptodate.c157 unsigned int tree, to_purge, purged; in ocfs2_metadata_cache_purge() local
168 to_purge, tree); in ocfs2_metadata_cache_purge()
173 if (tree) in ocfs2_metadata_cache_purge()
183 if (tree && purged != to_purge) in ocfs2_metadata_cache_purge()
373 __ocfs2_insert_cache_tree(ci, tree[i]); in ocfs2_expand_cache()
374 tree[i] = NULL; in ocfs2_expand_cache()
410 if (!tree[i]) { in __ocfs2_set_buffer_uptodate()
429 ocfs2_expand_cache(ci, tree); in __ocfs2_set_buffer_uptodate()
441 if (tree[0]) { in __ocfs2_set_buffer_uptodate()
443 if (tree[i]) in __ocfs2_set_buffer_uptodate()
[all …]
A Drefcounttree.c208 return tree; in ocfs2_find_refcount_tree()
250 kfree(tree); in ocfs2_free_refcount_tree()
338 if (tree) in ocfs2_get_refcount_tree()
373 if (tree) in ocfs2_get_refcount_tree()
378 tree = new; in ocfs2_get_refcount_tree()
382 *ret_tree = tree; in ocfs2_get_refcount_tree()
470 ret = ocfs2_read_refcount_block(&tree->rf_ci, tree->rf_blkno, in ocfs2_lock_refcount_tree()
666 BUG_ON(tree && tree->rf_generation == new_tree->rf_generation); in ocfs2_create_refcount_tree()
667 if (tree) in ocfs2_create_refcount_tree()
672 if (tree) in ocfs2_create_refcount_tree()
[all …]
/fs/btrfs/tests/
A Dextent-io-tests.c91 static void dump_extent_io_tree(const struct extent_io_tree *tree) in dump_extent_io_tree() argument
96 node = rb_first(&tree->state); in dump_extent_io_tree()
561 struct extent_io_tree tree; in test_find_first_clear_extent_bit() local
567 btrfs_extent_io_tree_init(NULL, &tree, IO_TREE_SELFTEST); in test_find_first_clear_extent_bit()
581 btrfs_set_extent_bit(&tree, SZ_1M, SZ_4M - 1, in test_find_first_clear_extent_bit()
584 btrfs_find_first_clear_extent_bit(&tree, SZ_512K, &start, &end, in test_find_first_clear_extent_bit()
594 btrfs_set_extent_bit(&tree, SZ_32M, SZ_64M - 1, in test_find_first_clear_extent_bit()
600 btrfs_find_first_clear_extent_bit(&tree, 12 * SZ_1M, &start, &end, in test_find_first_clear_extent_bit()
613 btrfs_find_first_clear_extent_bit(&tree, SZ_2M, &start, &end, in test_find_first_clear_extent_bit()
627 btrfs_find_first_clear_extent_bit(&tree, SZ_64M + SZ_1M, &start, &end, in test_find_first_clear_extent_bit()
[all …]
/fs/smb/client/
A Ddfs.c339 char *tree, bool islink, in tree_connect_dfs_target() argument
372 scnprintf(tree, MAX_TREE_SIZE, "\\%s", share); in tree_connect_dfs_target()
373 rc = ops->tree_connect(xid, tcon->ses, tree, in tree_connect_dfs_target()
395 char *tree; in cifs_tree_connect() local
418 tree = kzalloc(MAX_TREE_SIZE, GFP_KERNEL); in cifs_tree_connect()
419 if (!tree) { in cifs_tree_connect()
426 scnprintf(tree, MAX_TREE_SIZE, "\\\\%s\\IPC$", server->hostname); in cifs_tree_connect()
428 rc = ops->tree_connect(xid, tcon->ses, tree, in cifs_tree_connect()
445 rc = tree_connect_dfs_target(xid, tcon, cifs_sb, tree, ref.server_type == DFS_TYPE_LINK, in cifs_tree_connect()
450 kfree(tree); in cifs_tree_connect()
/fs/fuse/
A Ddax.c67 struct rb_root_cached tree; member
222 interval_tree_insert(&dmap->itn, &fi->dax->tree); in fuse_setup_one_mapping()
322 node = interval_tree_iter_first(&fi->dax->tree, start_idx, in inode_reclaim_dmap_range()
329 interval_tree_remove(&dmap->itn, &fi->dax->tree); in inode_reclaim_dmap_range()
477 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx); in fuse_setup_new_dax_mapping()
514 node = interval_tree_iter_first(&fi->dax->tree, idx, idx); in fuse_upgrade_dax_mapping()
589 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx); in fuse_iomap_begin()
870 interval_tree_remove(&dmap->itn, &fi->dax->tree); in reclaim_one_dmap_locked()
894 for (node = interval_tree_iter_first(&fi->dax->tree, 0, -1); node; in inode_lookup_first_dmap()
949 node = interval_tree_iter_first(&fi->dax->tree, start_idx, start_idx); in inode_inline_reclaim_one_dmap()
[all …]
/fs/jfs/
A Djfs_dmap.c1086 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNext()
1214 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx); in dbAllocNear()
1818 if (dp->tree.budmin < 0) { in dbAllocCtl()
2031 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2037 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2086 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2107 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2143 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbAllocBits()
2148 leaf = dp->tree.stree + LEAFIND; in dbAllocBits()
2290 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbFreeBits()
[all …]

Completed in 87 milliseconds

123