| /Linux-v4.19/tools/testing/radix-tree/ |
| D | tag_check.c | 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, NULL, first, ~0UL, 10, tag, !tag); in __simple_checks()
29 ret = item_tag_get(tree, index, !tag); in __simple_checks()
31 ret = item_delete(tree, index); in __simple_checks()
[all …]
|
| D | main.c | 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_KERNEL); in add_and_check()
83 item_insert(&tree, 44); in add_and_check()
[all …]
|
| D | multiorder.c | 28 RADIX_TREE(tree, GFP_KERNEL); in __multiorder_tag_test()
37 err = item_insert_order(&tree, index, order); in __multiorder_tag_test()
46 err = __radix_tree_insert(&tree, i, order, in __multiorder_tag_test()
52 assert(!radix_tree_tag_get(&tree, i, 0)); in __multiorder_tag_test()
53 assert(!radix_tree_tag_get(&tree, i, 1)); in __multiorder_tag_test()
56 assert(radix_tree_tag_set(&tree, index, 0)); in __multiorder_tag_test()
59 assert(radix_tree_tag_get(&tree, i, 0)); in __multiorder_tag_test()
60 assert(!radix_tree_tag_get(&tree, i, 1)); in __multiorder_tag_test()
63 assert(tag_tagged_items(&tree, NULL, 0, ~0UL, 10, 0, 1) == 1); in __multiorder_tag_test()
64 assert(radix_tree_tag_clear(&tree, index, 0)); in __multiorder_tag_test()
[all …]
|
| /Linux-v4.19/fs/hfs/ |
| 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->inode = iget_locked(sb, id); in hfs_btree_open()
39 if (!tree->inode) in hfs_btree_open()
[all …]
|
| 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->max_key_len + 1) { in hfs_brec_keylen()
[all …]
|
| D | bnode.c | 48 struct hfs_btree *tree; in hfs_bnode_read_key() local
51 tree = node->tree; in hfs_bnode_read_key()
53 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
56 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
146 off = node->tree->node_size - 2; in hfs_bnode_dump()
153 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
156 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
173 struct hfs_btree *tree; in hfs_bnode_unlink() local
177 tree = node->tree; in hfs_bnode_unlink()
179 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
[all …]
|
| 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 mutex_lock(&tree->tree_lock); in hfs_find_init()
37 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
38 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
39 fd->tree = NULL; in hfs_find_exit()
63 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in __hfs_brec_find()
[all …]
|
| /Linux-v4.19/fs/hfsplus/ |
| D | btree.c | 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->cnid = id; in hfs_btree_open()
153 tree->inode = inode; in hfs_btree_open()
155 if (!HFSPLUS_I(tree->inode)->first_blocks) { in hfs_btree_open()
160 mapping = tree->inode->i_mapping; in hfs_btree_open()
[all …]
|
| 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()
74 if (!tree->root) in hfs_brec_insert()
[all …]
|
| 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->max_key_len + 2; in hfs_bnode_dump()
337 struct hfs_btree *tree; in hfs_bnode_unlink() local
[all …]
|
| 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->tree_lock, ATTR_BTREE_MUTEX); in hfs_find_init()
49 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
[all …]
|
| /Linux-v4.19/kernel/ |
| D | audit_tree.c | 78 struct audit_tree *tree; in alloc_tree() local
80 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); in alloc_tree()
81 if (tree) { in alloc_tree()
82 refcount_set(&tree->count, 1); in alloc_tree()
83 tree->goner = 0; in alloc_tree()
84 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
85 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
86 INIT_LIST_HEAD(&tree->list); in alloc_tree()
87 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
88 tree->root = NULL; in alloc_tree()
[all …]
|
| /Linux-v4.19/sound/hda/ |
| D | hdac_sysfs.c | 322 struct hdac_widget_tree *tree = codec->widgets; in widget_tree_free() local
325 if (!tree) in widget_tree_free()
327 free_widget_node(tree->afg, &widget_afg_group); in widget_tree_free()
328 if (tree->nodes) { in widget_tree_free()
329 for (p = tree->nodes; *p; p++) in widget_tree_free()
331 kfree(tree->nodes); in widget_tree_free()
333 kobject_put(tree->root); in widget_tree_free()
334 kfree(tree); in widget_tree_free()
363 struct hdac_widget_tree *tree; in widget_tree_create() local
367 tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); in widget_tree_create()
[all …]
|
| /Linux-v4.19/scripts/dtc/ |
| D | fstree.c | 31 struct node *tree; in read_fstree() local
37 tree = build_node(NULL, NULL); in read_fstree()
64 add_property(tree, prop); in read_fstree()
72 add_child(tree, newchild); in read_fstree()
79 return tree; in read_fstree()
84 struct node *tree; in dt_from_fs() local
86 tree = read_fstree(dirname); in dt_from_fs()
87 tree = name_node(tree, ""); in dt_from_fs()
89 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
|
| /Linux-v4.19/fs/btrfs/ |
| D | extent_io.c | 87 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
88 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
90 struct extent_io_tree *tree, u64 start, u64 end) in __btrfs_debug_check_extent_io_range() argument
92 if (tree->ops && tree->ops->check_extent_io_range) in __btrfs_debug_check_extent_io_range()
93 tree->ops->check_extent_io_range(tree->private_data, caller, in __btrfs_debug_check_extent_io_range()
113 struct extent_io_tree *tree; member
194 void extent_io_tree_init(struct extent_io_tree *tree, in extent_io_tree_init() argument
197 tree->state = RB_ROOT; in extent_io_tree_init()
198 tree->ops = NULL; in extent_io_tree_init()
199 tree->dirty_bytes = 0; in extent_io_tree_init()
[all …]
|
| D | extent_io.h | 264 void extent_io_tree_init(struct extent_io_tree *tree, void *private_data);
267 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
270 static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) in lock_extent() argument
272 return lock_extent_bits(tree, start, end, NULL); in lock_extent()
275 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end);
276 int extent_read_full_page(struct extent_io_tree *tree, struct page *page,
281 u64 count_range_bits(struct extent_io_tree *tree,
286 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
289 int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
291 int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
[all …]
|
| D | ordered-data.c | 138 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
141 struct rb_root *root = &tree->tree; in tree_search()
146 if (tree->last) { in tree_search()
147 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
150 return tree->last; in tree_search()
156 tree->last = ret; in tree_search()
177 struct btrfs_ordered_inode_tree *tree; in __btrfs_add_ordered_extent() local
181 tree = &BTRFS_I(inode)->ordered_tree; in __btrfs_add_ordered_extent()
212 spin_lock_irq(&tree->lock); in __btrfs_add_ordered_extent()
213 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
[all …]
|
| D | extent_map.c | 35 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init() argument
37 tree->map = RB_ROOT; in extent_map_tree_init()
38 INIT_LIST_HEAD(&tree->modified_extents); in extent_map_tree_init()
39 rwlock_init(&tree->lock); in extent_map_tree_init()
226 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map() argument
245 rb_erase(&merge->rb_node, &tree->map); in try_merge_map()
257 rb_erase(&merge->rb_node, &tree->map); in try_merge_map()
276 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache() argument
283 write_lock(&tree->lock); in unpin_extent_cache()
284 em = lookup_extent_mapping(tree, start, len); in unpin_extent_cache()
[all …]
|
| /Linux-v4.19/scripts/tracing/ |
| D | draw_functrace.py | 59 tree = self
60 while tree != CallTree.ROOT and tree._func != func:
61 tree = tree._parent
62 if tree == CallTree.ROOT:
65 return tree
114 tree = CallTree.ROOT
123 tree = tree.getParent(caller)
124 tree = tree.calls(callee, calltime)
|
| /Linux-v4.19/scripts/gcc-plugins/ |
| D | latent_entropy_plugin.c | 82 static GTY(()) tree latent_entropy_decl;
110 static tree tree_get_random_const(tree type) in tree_get_random_const()
122 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
123 tree args __unused, in handle_latent_entropy_attribute()
127 tree type; in handle_latent_entropy_attribute()
165 tree fld, lst = TYPE_FIELDS(type); in handle_latent_entropy_attribute()
169 tree fieldtype; in handle_latent_entropy_attribute()
191 tree random_const, fld_t = TREE_TYPE(fld); in handle_latent_entropy_attribute()
208 tree elt_type, array_size, elt_size; in handle_latent_entropy_attribute()
235 tree cst = size_int(i); in handle_latent_entropy_attribute()
[all …]
|
| D | structleak_plugin.c | 48 static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_user_attribute()
73 static tree get_field_type(tree field) in get_field_type()
78 static bool is_userspace_type(tree type) in is_userspace_type()
80 tree field; in is_userspace_type()
83 tree fieldtype = get_field_type(field); in is_userspace_type()
98 tree type = (tree)event_data; in finish_type()
115 static void initialize(tree var) in initialize()
119 tree initializer; in initialize()
128 tree rhs1; in initialize()
168 tree var; in structleak_execute()
[all …]
|
| /Linux-v4.19/net/sched/ |
| D | ematch.c | 166 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match() argument
169 return &tree->matches[index]; in tcf_em_get_match()
305 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
313 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
329 memcpy(&tree->hdr, tree_hdr, sizeof(*tree_hdr)); in tcf_em_tree_validate()
335 tree->matches = kzalloc(matches_len, GFP_KERNEL); in tcf_em_tree_validate()
336 if (tree->matches == NULL) in tcf_em_tree_validate()
360 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
384 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
399 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy() argument
[all …]
|
| /Linux-v4.19/lib/zlib_deflate/ |
| D | deftree.c | 138 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
140 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
142 static void scan_tree (deflate_state *s, ct_data *tree, int max_code);
143 static void send_tree (deflate_state *s, ct_data *tree, int max_code);
156 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
160 # define send_code(s, c, tree) \ argument
162 send_bits(s, tree[c].Code, tree[c].Len); }
350 #define pqremove(s, tree, top) \ argument
354 pqdownheap(s, tree, SMALLEST); \
361 #define smaller(tree, n, m, depth) \ argument
[all …]
|
| /Linux-v4.19/mm/ |
| D | zswap.c | 354 static void zswap_entry_put(struct zswap_tree *tree, in zswap_entry_put() argument
361 zswap_rb_erase(&tree->rbroot, entry); in zswap_entry_put()
853 struct zswap_tree *tree; in zswap_writeback_entry() local
869 tree = zswap_trees[swp_type(swpentry)]; in zswap_writeback_entry()
873 spin_lock(&tree->lock); in zswap_writeback_entry()
874 entry = zswap_entry_find_get(&tree->rbroot, offset); in zswap_writeback_entry()
877 spin_unlock(&tree->lock); in zswap_writeback_entry()
880 spin_unlock(&tree->lock); in zswap_writeback_entry()
922 spin_lock(&tree->lock); in zswap_writeback_entry()
924 zswap_entry_put(tree, entry); in zswap_writeback_entry()
[all …]
|
| /Linux-v4.19/scripts/ |
| D | tags.sh | 23 tree=
25 tree=${srctree}/
29 ignore="$ignore ( -path ${tree}tools ) -prune -o"
35 ALLSOURCE_ARCHS=$(find ${tree}arch/ -mindepth 1 -maxdepth 1 -type d -printf '%f ')
44 find ${tree}arch/$1 $ignore $subarchprune $prune -name "$2" \
51 include=$(find ${tree}arch/$1/ $subarchprune \
62 find ${tree}include $ignore -name config -prune -o -name "$1" \
70 find ${tree}* $ignore \
71 \( -path ${tree}include -o -path ${tree}arch -o -name '.tmp_*' \) -prune -o \
100 j="${j#$tree}"
[all …]
|
