| /kernel/linux/linux-5.10/tools/testing/radix-tree/ |
| H A D | tag_check.c | 8 #include <linux/radix-tree.h>
14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks() argument
19 item_check_absent(tree, index); in __simple_checks()
20 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
22 item_insert(tree, index); in __simple_checks()
23 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
24 item_tag_set(tree, index, tag); in __simple_checks()
25 ret = item_tag_get(tree, index, tag); in __simple_checks()
27 ret = tag_tagged_items(tree, first, ~0UL, 10, tag, !tag); in __simple_checks()
29 ret = item_tag_get(tree, inde in __simple_checks()
131 gang_check(struct radix_tree_root *tree, char *thrash_state, int tag) gang_check() argument
157 do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) do_thrash() argument
[all...] |
| H A D | main.c | 10 #include <linux/radix-tree.h>
18 RADIX_TREE(tree, GFP_KERNEL); in __gang_check()
23 item_insert(&tree, middle + idx); in __gang_check()
25 item_check_absent(&tree, middle - down - 1); in __gang_check()
27 item_check_present(&tree, middle + idx); in __gang_check()
28 item_check_absent(&tree, middle + up); in __gang_check()
31 item_gang_check_present(&tree, middle - down, up + down, in __gang_check()
33 item_full_scan(&tree, middle - down, down + up, chunk); in __gang_check()
35 item_kill_tree(&tree); in __gang_check()
81 RADIX_TREE(tree, GFP_KERNE in add_and_check()
126 check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag) check_copied_tags() argument
[all...] |
| /kernel/linux/linux-6.6/tools/testing/radix-tree/ |
| H A D | tag_check.c | 8 #include <linux/radix-tree.h>
14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks() argument
19 item_check_absent(tree, index); in __simple_checks()
20 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
22 item_insert(tree, index); in __simple_checks()
23 assert(item_tag_get(tree, index, tag) == 0); in __simple_checks()
24 item_tag_set(tree, index, tag); in __simple_checks()
25 ret = item_tag_get(tree, index, tag); in __simple_checks()
27 ret = tag_tagged_items(tree, first, ~0UL, 10, tag, !tag); in __simple_checks()
29 ret = item_tag_get(tree, inde in __simple_checks()
131 gang_check(struct radix_tree_root *tree, char *thrash_state, int tag) gang_check() argument
157 do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) do_thrash() argument
[all...] |
| H A D | main.c | 10 #include <linux/radix-tree.h>
18 RADIX_TREE(tree, GFP_KERNEL); in __gang_check()
23 item_insert(&tree, middle + idx); in __gang_check()
25 item_check_absent(&tree, middle - down - 1); in __gang_check()
27 item_check_present(&tree, middle + idx); in __gang_check()
28 item_check_absent(&tree, middle + up); in __gang_check()
31 item_gang_check_present(&tree, middle - down, up + down, in __gang_check()
33 item_full_scan(&tree, middle - down, down + up, chunk); in __gang_check()
35 item_kill_tree(&tree); in __gang_check()
81 RADIX_TREE(tree, GFP_KERNE in add_and_check()
126 check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag) check_copied_tags() argument
[all...] |
| /kernel/linux/linux-5.10/fs/hfs/ |
| H A D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local
27 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
28 if (!tree) in hfs_btree_open()
31 mutex_init(&tree->tree_lock); in hfs_btree_open()
32 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
34 tree->sb = sb; in hfs_btree_open()
35 tree->cnid = id; in hfs_btree_open()
36 tree->keycmp = keycmp; in hfs_btree_open()
38 tree in hfs_btree_open()
137 hfs_btree_close(struct hfs_btree *tree) hfs_btree_close() argument
160 hfs_btree_write(struct hfs_btree *tree) hfs_btree_write() argument
190 struct hfs_btree *tree = prev->tree; hfs_bmap_new_bmap() local
224 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) hfs_bmap_reserve() argument
247 hfs_bmap_alloc(struct hfs_btree *tree) hfs_bmap_alloc() argument
323 struct hfs_btree *tree; hfs_bmap_free() local
[all...] |
| H A D | brec.c | 16 static int hfs_btree_inc_height(struct hfs_btree *tree);
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
48 if (node->tree->attributes & HFS_TREE_BIGKEYS) { in hfs_brec_keylen()
50 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
56 if (retval > node->tree in hfs_brec_keylen()
67 struct hfs_btree *tree; hfs_brec_insert() local
179 struct hfs_btree *tree; hfs_brec_remove() local
233 struct hfs_btree *tree; hfs_bnode_split() local
354 struct hfs_btree *tree; hfs_brec_update_parent() local
458 hfs_btree_inc_height(struct hfs_btree *tree) hfs_btree_inc_height() argument
[all...] |
| H A D | bnode.c | 31 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
63 struct hfs_btree *tree; in hfs_bnode_read_key() local
66 tree = node->tree; in hfs_bnode_read_key()
68 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
71 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
161 off = node->tree->node_size - 2; in hfs_bnode_dump()
168 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
171 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
188 struct hfs_btree *tree; in hfs_bnode_unlink() local
233 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) hfs_bnode_findhash() argument
251 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) __hfs_bnode_create() argument
328 hfs_bnode_find(struct hfs_btree *tree, u32 num) hfs_bnode_find() argument
421 hfs_bnode_create(struct hfs_btree *tree, u32 num) hfs_bnode_create() argument
473 struct hfs_btree *tree = node->tree; hfs_bnode_put() local
[all...] |
| H A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() argument
19 if (!tree) in hfs_find_init()
21 fd->tree = tree; in hfs_find_init()
23 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
27 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
29 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
30 switch (tree->cnid) { in hfs_find_init()
32 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); in hfs_find_init()
35 mutex_lock_nested(&tree in hfs_find_init()
111 struct hfs_btree *tree; hfs_brec_find() local
178 struct hfs_btree *tree; hfs_brec_goto() local
[all...] |
| /kernel/linux/linux-6.6/fs/hfs/ |
| H A D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local
27 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
28 if (!tree) in hfs_btree_open()
31 mutex_init(&tree->tree_lock); in hfs_btree_open()
32 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
34 tree->sb = sb; in hfs_btree_open()
35 tree->cnid = id; in hfs_btree_open()
36 tree->keycmp = keycmp; in hfs_btree_open()
38 tree in hfs_btree_open()
139 hfs_btree_close(struct hfs_btree *tree) hfs_btree_close() argument
162 hfs_btree_write(struct hfs_btree *tree) hfs_btree_write() argument
193 struct hfs_btree *tree = prev->tree; hfs_bmap_new_bmap() local
227 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) hfs_bmap_reserve() argument
250 hfs_bmap_alloc(struct hfs_btree *tree) hfs_bmap_alloc() argument
326 struct hfs_btree *tree; hfs_bmap_free() local
[all...] |
| H A D | bnode.c | 30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
60 struct hfs_btree *tree; in hfs_bnode_read_key() local
63 tree = node->tree; in hfs_bnode_read_key()
65 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
68 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
154 off = node->tree->node_size - 2; in hfs_bnode_dump()
161 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
164 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
226 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) hfs_bnode_findhash() argument
244 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) __hfs_bnode_create() argument
317 hfs_bnode_find(struct hfs_btree *tree, u32 num) hfs_bnode_find() argument
411 hfs_bnode_create(struct hfs_btree *tree, u32 num) hfs_bnode_create() argument
461 struct hfs_btree *tree = node->tree; hfs_bnode_put() local
[all...] |
| H A D | brec.c | 16 static int hfs_btree_inc_height(struct hfs_btree *tree);
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
48 if (node->tree->attributes & HFS_TREE_BIGKEYS) { in hfs_brec_keylen()
50 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
56 if (retval > node->tree in hfs_brec_keylen()
67 struct hfs_btree *tree; hfs_brec_insert() local
179 struct hfs_btree *tree; hfs_brec_remove() local
233 struct hfs_btree *tree; hfs_bnode_split() local
354 struct hfs_btree *tree; hfs_brec_update_parent() local
458 hfs_btree_inc_height(struct hfs_btree *tree) hfs_btree_inc_height() argument
[all...] |
| H A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() argument
19 fd->tree = tree; in hfs_find_init()
21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
25 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
27 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
28 switch (tree->cnid) { in hfs_find_init()
30 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); in hfs_find_init()
33 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); in hfs_find_init()
36 mutex_lock_nested(&tree in hfs_find_init()
109 struct hfs_btree *tree; hfs_brec_find() local
176 struct hfs_btree *tree; hfs_brec_goto() local
[all...] |
| /kernel/linux/linux-5.10/fs/hfsplus/ |
| H A D | btree.c | 42 * Catalog B-tree Header
47 * Attributes B-tree Header
135 struct hfs_btree *tree; in hfs_btree_open() local
142 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
143 if (!tree) in hfs_btree_open()
146 mutex_init(&tree->tree_lock); in hfs_btree_open()
147 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
148 tree->sb = sb; in hfs_btree_open()
149 tree in hfs_btree_open()
258 hfs_btree_close(struct hfs_btree *tree) hfs_btree_close() argument
282 hfs_btree_write(struct hfs_btree *tree) hfs_btree_write() argument
314 struct hfs_btree *tree = prev->tree; hfs_bmap_new_bmap() local
346 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) hfs_bmap_reserve() argument
373 hfs_bmap_alloc(struct hfs_btree *tree) hfs_bmap_alloc() argument
450 struct hfs_btree *tree; hfs_bmap_free() local
[all...] |
| H A D | brec.c | 25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
45 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
48 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
54 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
65 struct hfs_btree *tree; in hfs_brec_insert() local
72 tree = fd->tree; in hfs_brec_insert()
181 struct hfs_btree *tree; hfs_brec_remove() local
237 struct hfs_btree *tree; hfs_bnode_split() local
358 struct hfs_btree *tree; hfs_brec_update_parent() local
462 hfs_btree_inc_height(struct hfs_btree *tree) hfs_btree_inc_height() argument
[all...] |
| H A D | bnode.c | 61 struct hfs_btree *tree; in hfs_bnode_read_key() local
64 tree = node->tree; in hfs_bnode_read_key()
66 tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_read_key()
67 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_read_key()
70 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
310 off = node->tree->node_size - 2; in hfs_bnode_dump()
317 if (node->tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_dump()
318 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_dump()
321 tmp = node->tree in hfs_bnode_dump()
337 struct hfs_btree *tree; hfs_bnode_unlink() local
383 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) hfs_bnode_findhash() argument
400 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) __hfs_bnode_create() argument
478 hfs_bnode_find(struct hfs_btree *tree, u32 num) hfs_bnode_find() argument
573 hfs_bnode_create(struct hfs_btree *tree, u32 num) hfs_bnode_create() argument
625 struct hfs_btree *tree = node->tree; hfs_bnode_put() local
657 hfs_bnode_need_zeroout(struct hfs_btree *tree) hfs_bnode_need_zeroout() argument
[all...] |
| /kernel/linux/linux-6.6/fs/hfsplus/ |
| H A D | btree.c | 42 * Catalog B-tree Header
47 * Attributes B-tree Header
135 struct hfs_btree *tree; in hfs_btree_open() local
142 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
143 if (!tree) in hfs_btree_open()
146 mutex_init(&tree->tree_lock); in hfs_btree_open()
147 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
148 tree->sb = sb; in hfs_btree_open()
149 tree in hfs_btree_open()
259 hfs_btree_close(struct hfs_btree *tree) hfs_btree_close() argument
283 hfs_btree_write(struct hfs_btree *tree) hfs_btree_write() argument
315 struct hfs_btree *tree = prev->tree; hfs_bmap_new_bmap() local
347 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) hfs_bmap_reserve() argument
374 hfs_bmap_alloc(struct hfs_btree *tree) hfs_bmap_alloc() argument
451 struct hfs_btree *tree; hfs_bmap_free() local
[all...] |
| H A D | brec.c | 25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
45 node->tree->node_size - (rec + 1) * 2); in hfs_brec_keylen()
48 if (recoff > node->tree->node_size - 2) { in hfs_brec_keylen()
54 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
65 struct hfs_btree *tree; in hfs_brec_insert() local
72 tree = fd->tree; in hfs_brec_insert()
181 struct hfs_btree *tree; hfs_brec_remove() local
237 struct hfs_btree *tree; hfs_bnode_split() local
358 struct hfs_btree *tree; hfs_brec_update_parent() local
462 hfs_btree_inc_height(struct hfs_btree *tree) hfs_btree_inc_height() argument
[all...] |
| H A D | bnode.c | 59 struct hfs_btree *tree; in hfs_bnode_read_key() local
62 tree = node->tree; in hfs_bnode_read_key()
64 tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_read_key()
65 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_read_key()
68 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
303 off = node->tree->node_size - 2; in hfs_bnode_dump()
310 if (node->tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_dump()
311 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_dump()
314 tmp = node->tree in hfs_bnode_dump()
330 struct hfs_btree *tree; hfs_bnode_unlink() local
376 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) hfs_bnode_findhash() argument
393 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) __hfs_bnode_create() argument
467 hfs_bnode_find(struct hfs_btree *tree, u32 num) hfs_bnode_find() argument
562 hfs_bnode_create(struct hfs_btree *tree, u32 num) hfs_bnode_create() argument
612 struct hfs_btree *tree = node->tree; hfs_bnode_put() local
644 hfs_bnode_need_zeroout(struct hfs_btree *tree) hfs_bnode_need_zeroout() argument
[all...] |
| /kernel/linux/linux-5.10/kernel/ |
| H A D | audit_tree.c | 61 * the same tree.
68 * tree.chunks anchors chunk.owners[].list hash_lock
69 * tree.rules anchors rule.rlist audit_filter_mutex
70 * chunk.trees anchors tree.same_root hash_lock
74 * tree is refcounted; one reference for "some rules on rules_list refer to
95 struct audit_tree *tree; in alloc_tree() local
97 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); in alloc_tree()
98 if (tree) { in alloc_tree()
99 refcount_set(&tree->count, 1); in alloc_tree()
100 tree in alloc_tree()
111 get_tree(struct audit_tree *tree) get_tree() argument
116 put_tree(struct audit_tree *tree) put_tree() argument
123 audit_tree_path(struct audit_tree *tree) audit_tree_path() argument
261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) audit_tree_match() argument
397 create_chunk(struct inode *inode, struct audit_tree *tree) create_chunk() argument
458 tag_chunk(struct inode *inode, struct audit_tree *tree) tag_chunk() argument
542 kill_rules(struct audit_context *context, struct audit_tree *tree) kill_rules() argument
609 trim_marked(struct audit_tree *tree) trim_marked() argument
635 kill_rules(audit_context(), tree); trim_marked() local
649 struct audit_tree *tree; audit_remove_tree_rule() local
684 struct audit_tree *tree; audit_trim_trees() local
740 audit_put_tree(struct audit_tree *tree) audit_put_tree() argument
802 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
897 struct audit_tree *tree; audit_tag_tree() local
936 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /kernel/linux/linux-6.6/kernel/ |
| H A D | audit_tree.c | 61 * the same tree.
68 * tree.chunks anchors chunk.owners[].list hash_lock
69 * tree.rules anchors rule.rlist audit_filter_mutex
70 * chunk.trees anchors tree.same_root hash_lock
74 * tree is refcounted; one reference for "some rules on rules_list refer to
95 struct audit_tree *tree; in alloc_tree() local
97 tree = kmalloc(struct_size(tree, pathname, strlen(s) + 1), GFP_KERNEL); in alloc_tree()
98 if (tree) { in alloc_tree()
99 refcount_set(&tree in alloc_tree()
111 get_tree(struct audit_tree *tree) get_tree() argument
116 put_tree(struct audit_tree *tree) put_tree() argument
123 audit_tree_path(struct audit_tree *tree) audit_tree_path() argument
261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) audit_tree_match() argument
397 create_chunk(struct inode *inode, struct audit_tree *tree) create_chunk() argument
458 tag_chunk(struct inode *inode, struct audit_tree *tree) tag_chunk() argument
542 kill_rules(struct audit_context *context, struct audit_tree *tree) kill_rules() argument
609 trim_marked(struct audit_tree *tree) trim_marked() argument
635 kill_rules(audit_context(), tree); trim_marked() local
649 struct audit_tree *tree; audit_remove_tree_rule() local
684 struct audit_tree *tree; audit_trim_trees() local
740 audit_put_tree(struct audit_tree *tree) audit_put_tree() argument
802 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
897 struct audit_tree *tree; audit_tag_tree() local
934 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | extent-io-tree.c | 7 #include "extent-io-tree.h"
46 pr_err("BTRFS: state leak: start %llu end %llu state %u in tree %d refs %d\n", in btrfs_extent_state_leak_debug_check()
55 #define btrfs_debug_check_extent_io_range(tree, start, end) \
56 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
58 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range()
61 struct btrfs_inode *inode = tree->inode; in __btrfs_debug_check_extent_io_range()
84 * the tree lock and get the inode lock when setting delalloc. These two things
97 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init()
99 tree->fs_info = fs_info; in extent_io_tree_init()
100 tree in extent_io_tree_init()
57 __btrfs_debug_check_extent_io_range(const char *caller, struct extent_io_tree *tree, u64 start, u64 end) __btrfs_debug_check_extent_io_range() argument
96 extent_io_tree_init(struct btrfs_fs_info *fs_info, struct extent_io_tree *tree, unsigned int owner) extent_io_tree_init() argument
108 extent_io_tree_release(struct extent_io_tree *tree) extent_io_tree_release() argument
233 tree_search_for_insert(struct extent_io_tree *tree, u64 offset, struct rb_node ***node_ret, struct rb_node **parent_ret) tree_search_for_insert() argument
279 tree_search_prev_next(struct extent_io_tree *tree, u64 offset, struct extent_state **prev_ret, struct extent_state **next_ret) tree_search_prev_next() argument
319 tree_search(struct extent_io_tree *tree, u64 offset) tree_search() argument
324 extent_io_tree_panic(struct extent_io_tree *tree, int err) extent_io_tree_panic() argument
339 merge_state(struct extent_io_tree *tree, struct extent_state *state) merge_state() argument
368 set_state_bits(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) set_state_bits() argument
393 insert_state(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) insert_state() argument
432 insert_state_fast(struct extent_io_tree *tree, struct extent_state *state, struct rb_node **node, struct rb_node *parent, unsigned bits, struct extent_changeset *changeset) insert_state_fast() argument
457 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) split_state() argument
502 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, u32 bits, int wake, struct extent_changeset *changeset) clear_state_bit() argument
557 __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state, struct extent_changeset *changeset) __clear_extent_bit() argument
729 wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) wait_extent_bit() argument
811 find_first_extent_bit_state(struct extent_io_tree *tree, u64 start, u32 bits) find_first_extent_bit_state() argument
837 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits, struct extent_state **cached_state) find_first_extent_bit() argument
889 find_contiguous_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) find_contiguous_extent_bit() argument
917 btrfs_find_delalloc_range(struct extent_io_tree *tree, u64 *start, u64 *end, u64 max_bytes, struct extent_state **cached_state) btrfs_find_delalloc_range() argument
980 __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, u64 *failed_start, struct extent_state **failed_state, struct extent_state **cached_state, struct extent_changeset *changeset) __set_extent_bit() argument
1205 set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) set_extent_bit() argument
1230 convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, u32 clear_bits, struct extent_state **cached_state) convert_extent_bit() argument
1439 find_first_clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) find_first_clear_extent_bit() argument
1557 count_range_bits(struct extent_io_tree *tree, u64 *start, u64 search_end, u64 max_bytes, u32 bits, int contig, struct extent_state **cached_state) count_range_bits() argument
1647 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, int filled, struct extent_state *cached) test_range_bit() argument
1694 set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) set_record_extent_bits() argument
1708 clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) clear_record_extent_bits() argument
1720 try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) try_lock_extent() argument
1741 lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) lock_extent() argument
[all...] |
| H A D | extent-io-tree.h | 64 * Redefined bits above which are used only in the device allocation tree,
91 /* Inode associated with this tree, or NULL. */
94 /* Who owns this io tree, should be one of IO_TREE_* */
116 struct extent_io_tree *tree, unsigned int owner);
117 void extent_io_tree_release(struct extent_io_tree *tree);
119 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
122 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
128 u64 count_range_bits(struct extent_io_tree *tree,
134 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
136 int clear_record_extent_bits(struct extent_io_tree *tree, u6
142 clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached) clear_extent_bit() argument
149 unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) unlock_extent() argument
155 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits) clear_extent_bits() argument
166 clear_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) clear_extent_uptodate() argument
173 clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) clear_extent_dirty() argument
[all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | extent-io-tree.h | 30 * Redefined bits above which are used only in the device allocation tree,
62 /* Who owns this io tree, should be one of IO_TREE_* */
89 struct extent_io_tree *tree, unsigned int owner,
91 void extent_io_tree_release(struct extent_io_tree *tree);
93 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
96 static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) in lock_extent() argument
98 return lock_extent_bits(tree, start, end, NULL); in lock_extent()
101 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end);
106 u64 count_range_bits(struct extent_io_tree *tree,
111 int test_range_bit(struct extent_io_tree *tree, u6
124 unlock_extent(struct extent_io_tree *tree, u64 start, u64 end) unlock_extent() argument
129 unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) unlock_extent_cached() argument
136 unlock_extent_cached_atomic(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) unlock_extent_cached_atomic() argument
143 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, unsigned bits) clear_extent_bits() argument
162 set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, unsigned bits) set_extent_bits() argument
168 clear_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) clear_extent_uptodate() argument
175 set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) set_extent_dirty() argument
182 clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) clear_extent_dirty() argument
194 set_extent_delalloc(struct extent_io_tree *tree, u64 start, u64 end, unsigned int extra_bits, struct extent_state **cached_state) set_extent_delalloc() argument
203 set_extent_defrag(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) set_extent_defrag() argument
211 set_extent_new(struct extent_io_tree *tree, u64 start, u64 end) set_extent_new() argument
218 set_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state, gfp_t mask) set_extent_uptodate() argument
[all...] |
| /kernel/linux/linux-5.10/fs/unicode/ |
| H A D | mkutf8data.c | 111 * A compact binary tree, used to decode UTF-8 characters.
114 * bytes for an offset into the tree. The first byte contains the
189 struct tree;
190 static utf8leaf_t *utf8nlookup(struct tree *, unsigned char *,
192 static utf8leaf_t *utf8lookup(struct tree *, unsigned char *, const char *);
345 struct tree { struct
350 struct tree *next;
355 int *(*leaf_index)(struct tree *, void *);
378 * Example lookup function for a tree.
380 static void *lookup(struct tree *tre argument
417 tree_walk(struct tree *tree) tree_walk() argument
533 insert(struct tree *tree, char *key, int keylen, void *leaf) insert() argument
654 prune(struct tree *tree) prune() argument
815 mark_nodes(struct tree *tree) mark_nodes() argument
942 index_nodes(struct tree *tree, int index) index_nodes() argument
1048 size_nodes(struct tree *tree) size_nodes() argument
1185 emit(struct tree *tree, unsigned char *data) emit() argument
1493 nfdi_index(struct tree *tree, void *l) nfdi_index() argument
1500 nfdicf_index(struct tree *tree, void *l) nfdicf_index() argument
1745 verify(struct tree *tree) verify() argument
2706 utf8nlookup(struct tree *tree, unsigned char *hangul, const char *s, size_t len) utf8nlookup() argument
2781 utf8lookup(struct tree *tree, unsigned char *hangul, const char *s) utf8lookup() argument
2803 utf8agemax(struct tree *tree, const char *s) utf8agemax() argument
2830 utf8agemin(struct tree *tree, const char *s) utf8agemin() argument
2856 utf8nagemax(struct tree *tree, const char *s, size_t len) utf8nagemax() argument
2883 utf8nagemin(struct tree *tree, const char *s, size_t len) utf8nagemin() argument
2912 utf8len(struct tree *tree, const char *s) utf8len() argument
2939 utf8nlen(struct tree *tree, const char *s, size_t len) utf8nlen() argument
2967 struct tree *tree; global() member
2990 utf8ncursor(struct utf8cursor *u8c, struct tree *tree, const char *s, size_t len) utf8ncursor() argument
3025 utf8cursor(struct utf8cursor *u8c, struct tree *tree, const char *s) utf8cursor() argument
3174 normalize_line(struct tree *tree) normalize_line() argument
[all...] |
| /kernel/linux/linux-6.6/fs/unicode/ |
| H A D | mkutf8data.c | 111 * A compact binary tree, used to decode UTF-8 characters.
114 * bytes for an offset into the tree. The first byte contains the
189 struct tree;
190 static utf8leaf_t *utf8nlookup(struct tree *, unsigned char *,
192 static utf8leaf_t *utf8lookup(struct tree *, unsigned char *, const char *);
345 struct tree { struct
350 struct tree *next;
355 int *(*leaf_index)(struct tree *, void *);
378 * Example lookup function for a tree.
380 static void *lookup(struct tree *tre argument
417 tree_walk(struct tree *tree) tree_walk() argument
533 insert(struct tree *tree, char *key, int keylen, void *leaf) insert() argument
654 prune(struct tree *tree) prune() argument
815 mark_nodes(struct tree *tree) mark_nodes() argument
942 index_nodes(struct tree *tree, int index) index_nodes() argument
1048 size_nodes(struct tree *tree) size_nodes() argument
1185 emit(struct tree *tree, unsigned char *data) emit() argument
1493 nfdi_index(struct tree *tree, void *l) nfdi_index() argument
1500 nfdicf_index(struct tree *tree, void *l) nfdicf_index() argument
1745 verify(struct tree *tree) verify() argument
2706 utf8nlookup(struct tree *tree, unsigned char *hangul, const char *s, size_t len) utf8nlookup() argument
2781 utf8lookup(struct tree *tree, unsigned char *hangul, const char *s) utf8lookup() argument
2803 utf8agemax(struct tree *tree, const char *s) utf8agemax() argument
2830 utf8agemin(struct tree *tree, const char *s) utf8agemin() argument
2856 utf8nagemax(struct tree *tree, const char *s, size_t len) utf8nagemax() argument
2883 utf8nagemin(struct tree *tree, const char *s, size_t len) utf8nagemin() argument
2912 utf8len(struct tree *tree, const char *s) utf8len() argument
2939 utf8nlen(struct tree *tree, const char *s, size_t len) utf8nlen() argument
2967 struct tree *tree; global() member
2990 utf8ncursor(struct utf8cursor *u8c, struct tree *tree, const char *s, size_t len) utf8ncursor() argument
3025 utf8cursor(struct utf8cursor *u8c, struct tree *tree, const char *s) utf8cursor() argument
3174 normalize_line(struct tree *tree) normalize_line() argument
[all...] |