Home
last modified time | relevance | path

Searched refs:btree (Results 1 – 25 of 56) sorted by relevance

123

/openbmc/linux/fs/hpfs/
H A Danode.c30 btree = &anode->btree; in hpfs_bplus_lookup()
74 btree = &fnode->btree; in hpfs_add_sector_to_btree()
77 btree = &anode->btree; in hpfs_add_sector_to_btree()
94 btree = &anode->btree; in hpfs_add_sector_to_btree()
154 btree = &anode->btree; in hpfs_add_sector_to_btree()
171 btree = &anode->btree; in hpfs_add_sector_to_btree()
174 btree = &fnode->btree; in hpfs_add_sector_to_btree()
232 btree = &anode->btree; in hpfs_add_sector_to_btree()
238 btree = &fnode->btree; in hpfs_add_sector_to_btree()
410 btree = &fnode->btree; in hpfs_truncate_btree()
[all …]
H A Dmap.c180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
181 (bp_internal(&fnode->btree) ? 12 : 8)) { in hpfs_map_fnode()
187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
236 (bp_internal(&anode->btree) ? 60 : 40)) { in hpfs_map_anode()
240 if (le16_to_cpu(anode->btree.first_free) != in hpfs_map_anode()
241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()
H A Dalloc.c466 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
467 f->btree.first_free = cpu_to_le16(8); in hpfs_alloc_fnode()
483 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
484 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
485 a->btree.first_free = cpu_to_le16(8); in hpfs_alloc_anode()
/openbmc/linux/fs/nilfs2/
H A Dbtree.c456 btree->b_inode->i_ino, in nilfs_btree_bad_node()
1230 if (!nilfs_bmap_dirty(btree)) in nilfs_btree_commit_insert()
1231 nilfs_bmap_set_dirty(btree); in nilfs_btree_commit_insert()
1580 if (!nilfs_bmap_dirty(btree)) in nilfs_btree_commit_delete()
1581 nilfs_bmap_set_dirty(btree); in nilfs_btree_commit_delete()
1602 dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; in nilfs_btree_delete()
1811 btree->b_ops->bop_clear(btree); in nilfs_btree_commit_convert_and_insert()
1817 dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL; in nilfs_btree_commit_convert_and_insert()
1818 __nilfs_btree_init(btree); in nilfs_btree_commit_convert_and_insert()
2096 btree->b_inode->i_ino, in nilfs_btree_propagate()
[all …]
H A DMakefile4 btnode.o bmap.o btree.o direct.o dat.o recovery.o \
/openbmc/linux/drivers/md/bcache/
H A Dbtree.h117 struct btree { struct
127 struct btree *parent; argument
152 static inline bool btree_node_ ## flag(struct btree *b) \ argument
180 static inline struct bset *btree_bset_first(struct btree *b) in btree_bset_first()
185 static inline struct bset *btree_bset_last(struct btree *b) in btree_bset_last()
256 static inline void rw_unlock(bool w, struct btree *b) in rw_unlock()
263 void bch_btree_node_read_done(struct btree *b);
267 void bch_btree_set_root(struct btree *b);
270 struct btree *parent);
273 struct btree *parent);
[all …]
H A Dbtree.c298 struct btree *b = container_of(cl, struct btree, io); in btree_node_write_unlock()
305 struct btree *b = container_of(cl, struct btree, io); in __btree_node_write_done()
320 struct btree *b = container_of(cl, struct btree, io); in btree_node_write_done()
329 struct btree *b = container_of(cl, struct btree, io); in btree_node_write_endio()
590 struct btree *b = kzalloc(sizeof(struct btree), gfp); in mca_bucket_alloc()
750 struct btree *b; in bch_btree_cache_free()
852 struct btree *b; in mca_find()
884 struct btree *b; in mca_cannibalize()
922 struct btree *b; in mca_alloc()
1007 struct btree *b; in bch_btree_node_get()
[all …]
H A Dextents.c128 struct btree *b = container_of(keys, struct btree, keys); in bch_bkey_dump()
168 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_invalid()
173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
207 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_bad()
232 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_insert_fixup()
328 struct cache_set *c = container_of(b, struct btree, keys)->c; in bch_extent_insert_fixup()
502 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_invalid()
507 static bool bch_extent_bad_expensive(struct btree *b, const struct bkey *k, in bch_extent_bad_expensive()
539 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_bad()
585 struct btree *b = container_of(bk, struct btree, keys); in bch_extent_merge()
H A Ddebug.h11 void bch_btree_verify(struct btree *b);
20 static inline void bch_btree_verify(struct btree *b) {} in bch_btree_verify()
H A DMakefile5 bcache-y := alloc.o bset.o btree.o closure.o debug.o extents.o\
/openbmc/linux/fs/xfs/libxfs/
H A Dxfs_da_btree.c690 btree = icnodehdr.btree; in xfs_da3_root_split()
749 btree = nodehdr.btree; in xfs_da3_root_split()
1031 btree = nodehdr.btree; in xfs_da3_node_add()
1432 btree = nodehdr.btree; in xfs_da3_fixhashpath()
1471 btree = nodehdr.btree; in xfs_da3_node_remove()
1475 memmove(&btree[index], &btree[index + 1], tmp); in xfs_da3_node_remove()
1656 btree = nodehdr.btree; in xfs_da3_node_lookup_int()
2071 btree = nodehdr.btree; in xfs_da3_path_shift()
2349 btree = deadhdr.btree; in xfs_da3_swap_lastblock()
2411 btree = par_hdr.btree; in xfs_da3_swap_lastblock()
[all …]
/openbmc/linux/drivers/md/persistent-data/
H A DMakefile11 dm-btree.o \
12 dm-btree-remove.o \
13 dm-btree-spine.o
/openbmc/linux/Documentation/admin-guide/device-mapper/
H A Dpersistent-data.rst14 - Another btree-based caching target posted to dm-devel
72 dm-btree.[hc]
73 dm-btree-remove.c
74 dm-btree-spine.c
75 dm-btree-internal.h
77 Currently there is only one data structure, a hierarchical btree.
81 The btree is 'hierarchical' in that you can define it to be composed
83 thin-provisioning target uses a btree with two levels of nesting.
/openbmc/linux/include/trace/events/
H A Dbcache.h64 TP_PROTO(struct btree *b),
258 TP_PROTO(struct btree *b),
263 TP_PROTO(struct btree *b),
283 TP_PROTO(struct btree *b),
293 TP_PROTO(struct btree *b),
333 TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status),
366 TP_PROTO(struct btree *b, unsigned keys),
383 TP_PROTO(struct btree *b, unsigned keys),
388 TP_PROTO(struct btree *b, unsigned keys),
393 TP_PROTO(struct btree *b),
/openbmc/linux/rust/alloc/collections/
H A Dmod.rs10 mod btree; module
21 pub use super::btree::map::*;
29 pub use super::btree::set::*;
/openbmc/linux/fs/xfs/
H A Dxfs_attr_list.c208 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
251 btree = nodehdr.btree; in xfs_attr_node_list_lookup()
252 for (i = 0; i < nodehdr.count; btree++, i++) { in xfs_attr_node_list_lookup()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
254 cursor->blkno = be32_to_cpu(btree->before); in xfs_attr_node_list_lookup()
256 btree); in xfs_attr_node_list_lookup()
/openbmc/openbmc/meta-openembedded/meta-filesystems/recipes-filesystems/logfsprogs/logfsprogs/
H A D0001-btree-Avoid-conflicts-with-libc-namespace-about-setk.patch4 Subject: [PATCH] btree: Avoid conflicts with libc namespace about setkey()
14 btree.c | 32 ++++++++++++++++----------------
17 diff --git a/btree.c b/btree.c
19 --- a/btree.c
20 +++ b/btree.c
H A D0001-Add-LDFLAGS-to-linker-cmdline.patch38 mklogfs: mkfs.o lib.o btree.o segment.o readwrite.o
47 $(OBJ): kerncompat.h logfs.h logfs_abi.h btree.h
/openbmc/linux/fs/befs/
H A DChangeLog27 * Did the string comparison really right this time (btree.c) [WD]
30 a pointer value. (btree.c) [WD]
39 before. (btree.c) [Sergey S. Kostyliov <rathamahata@php4.ru>]
56 (btree.c) [WD]
105 * Removed notion of btree handle from btree.c. It was unnecessary, as the
128 (btree.c) [WD]
133 seekleaf() in btree.c [WD]
148 (datastream.c, btree.c super.c inode.c) [WD]
259 * Added btree searching function.
263 * Additional comments in btree.c
[all …]
H A DMakefile8 befs-objs := datastream.o btree.o super.o inode.o debug.o io.o linuxvfs.o
/openbmc/linux/Documentation/filesystems/
H A Dxfs-online-fsck-design.rst1229 of btree?
1314 `refcount btree
1316 `inode btree
1318 `rmap btree
2225 `in-memory btree
2289 btree type.
2910 btree repair:
3802 a. Create a btree cursor for the in-memory btree.
3813 a. Create a btree cursor for the in-memory btree.
3826 shadow btree, like all other btree rebuilding functions.
[all …]
/openbmc/linux/fs/xfs/scrub/
H A Ddabtree.c92 return hdr.btree + blk->index; in xchk_da_btree_node_entry()
319 struct xfs_da_node_entry *btree; in xchk_da_btree_block() local
422 btree = nodehdr.btree; in xchk_da_btree_block()
424 blk->hashval = be32_to_cpu(btree[*pmaxrecs - 1].hashval); in xchk_da_btree_block()
/openbmc/linux/fs/hfs/
H A DMakefile8 hfs-objs := bitmap.o bfind.o bnode.o brec.o btree.o \
/openbmc/linux/Documentation/admin-guide/
H A Dbcache.rst18 in erase block sized buckets, and it uses a hybrid btree/log to track cached
517 Average data per key in the btree.
526 Amount of memory currently used by the btree cache
560 Percentage of the root btree node in use. If this gets too high the node
568 Depth of the btree (A single node btree has depth 0).
579 duration: garbage collection, btree read, btree node sorts and btree splits.
585 Total nodes in the btree.
588 Average fraction of btree in use.
594 Longest chain in the btree node cache's hash table
613 Sum of all btree writes, in (kilo/mega/giga) bytes
[all …]
/openbmc/linux/fs/hfsplus/
H A DMakefile8 hfsplus-objs := super.o options.o inode.o ioctl.o extents.o catalog.o dir.o btree.o \

123