| /kernel/linux/linux-5.10/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, 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 …]
|
| /kernel/linux/linux-5.10/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 | 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
192 tree = node->tree; 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 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->tree_lock, EXTENTS_BTREE_MUTEX); in hfs_find_init()
38 mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX); in hfs_find_init()
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/kernel/ |
| D | audit_tree.c | 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->goner = 0; in alloc_tree()
101 INIT_LIST_HEAD(&tree->chunks); in alloc_tree()
102 INIT_LIST_HEAD(&tree->rules); in alloc_tree()
103 INIT_LIST_HEAD(&tree->list); in alloc_tree()
104 INIT_LIST_HEAD(&tree->same_root); in alloc_tree()
105 tree->root = NULL; in alloc_tree()
[all …]
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| D | extent-io-tree.h | 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, u64 start, u64 end,
114 int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
116 int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
[all …]
|
| D | ordered-data.c | 134 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
137 struct rb_root *root = &tree->tree; in tree_search()
142 if (tree->last) { in tree_search()
143 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
146 return tree->last; in tree_search()
152 tree->last = ret; in tree_search()
169 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in __btrfs_add_ordered_extent() local
222 spin_lock_irq(&tree->lock); in __btrfs_add_ordered_extent()
223 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
229 spin_unlock_irq(&tree->lock); in __btrfs_add_ordered_extent()
[all …]
|
| D | extent_io.c | 103 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
104 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
106 struct extent_io_tree *tree, u64 start, u64 end) in __btrfs_debug_check_extent_io_range() argument
108 struct inode *inode = tree->private_data; in __btrfs_debug_check_extent_io_range()
167 struct extent_io_tree *tree = bio->bi_private; in submit_one_bio() local
171 if (is_data_inode(tree->private_data)) in submit_one_bio()
172 ret = btrfs_submit_data_bio(tree->private_data, bio, mirror_num, in submit_one_bio()
175 ret = btrfs_submit_metadata_bio(tree->private_data, bio, in submit_one_bio()
279 struct extent_io_tree *tree, unsigned int owner, in extent_io_tree_init() argument
282 tree->fs_info = fs_info; in extent_io_tree_init()
[all …]
|
| /kernel/linux/linux-5.10/fs/unicode/ |
| D | mkutf8data.c | 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; argument
355 int *(*leaf_index)(struct tree *, void *); argument
380 static void *lookup(struct tree *tree, const char *key) in lookup() argument
385 node = tree->root; in lookup()
417 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()
[all …]
|
| /kernel/linux/linux-5.10/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()
365 struct hdac_widget_tree *tree; in widget_tree_create() local
369 tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); in widget_tree_create()
[all …]
|
| /kernel/linux/linux-5.10/scripts/dtc/ |
| D | fstree.c | 16 struct node *tree; in read_fstree() local
22 tree = build_node(NULL, NULL, NULL); in read_fstree()
50 add_property(tree, prop); in read_fstree()
58 add_child(tree, newchild); in read_fstree()
65 return tree; in read_fstree()
70 struct node *tree; in dt_from_fs() local
72 tree = read_fstree(dirname); in dt_from_fs()
73 tree = name_node(tree, ""); in dt_from_fs()
75 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
|
| /kernel/linux/linux-5.10/lib/zlib_deflate/ |
| D | deftree.c | 133 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
135 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
137 static void scan_tree (deflate_state *s, ct_data *tree, int max_code);
138 static void send_tree (deflate_state *s, ct_data *tree, int max_code);
150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
154 # define send_code(s, c, tree) \ argument
156 send_bits(s, tree[c].Code, tree[c].Len); }
296 #define pqremove(s, tree, top) \ argument
300 pqdownheap(s, tree, SMALLEST); \
307 #define smaller(tree, n, m, depth) \ argument
[all …]
|
| /kernel/linux/linux-5.10/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)
|
| /kernel/linux/linux-5.10/scripts/gcc-plugins/ |
| D | latent_entropy_plugin.c | 82 static GTY(()) tree latent_entropy_decl;
116 static tree tree_get_random_const(tree type) in tree_get_random_const()
128 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
129 tree args __unused, in handle_latent_entropy_attribute()
133 tree type; in handle_latent_entropy_attribute()
171 tree fld, lst = TYPE_FIELDS(type); in handle_latent_entropy_attribute()
175 tree fieldtype; in handle_latent_entropy_attribute()
197 tree random_const, fld_t = TREE_TYPE(fld); in handle_latent_entropy_attribute()
214 tree elt_type, array_size, elt_size; in handle_latent_entropy_attribute()
241 tree cst = size_int(i); in handle_latent_entropy_attribute()
[all …]
|
| D | structleak_plugin.c | 53 static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_user_attribute()
78 static tree get_field_type(tree field) in get_field_type()
83 static bool is_userspace_type(tree type) in is_userspace_type()
85 tree field; in is_userspace_type()
88 tree fieldtype = get_field_type(field); in is_userspace_type()
103 tree type = (tree)event_data; in finish_type()
120 static void initialize(tree var) in initialize()
124 tree initializer; in initialize()
126 tree type; in initialize()
134 tree rhs1; in initialize()
[all …]
|
| D | randomize_layout_plugin.c | 76 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr()
78 tree type; in handle_randomize_layout_attr()
119 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_… in handle_randomize_considered_attr()
129 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_a… in handle_randomize_performed_attr()
169 tree tree_start;
174 static void partition_struct(tree *fields, unsigned long length, struct partition_group *size_group… in partition_struct()
210 static void performance_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in performance_shuffle()
228 tree tmp; in performance_shuffle()
242 static void full_shuffle(tree *newtree, unsigned long length, ranctx *prng_state) in full_shuffle()
247 tree tmp; in full_shuffle()
[all …]
|
| /kernel/linux/linux-5.10/net/sched/ |
| D | ematch.c | 162 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match() argument
165 return &tree->matches[index]; in tcf_em_get_match()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
314 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
331 memcpy(&tree->hdr, tree_hdr, sizeof(*tree_hdr)); in tcf_em_tree_validate()
337 tree->matches = kzalloc(matches_len, GFP_KERNEL); in tcf_em_tree_validate()
338 if (tree->matches == NULL) in tcf_em_tree_validate()
362 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
386 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
400 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy() argument
[all …]
|
| /kernel/linux/linux-5.10/mm/ |
| D | zswap.c | 362 static void zswap_entry_put(struct zswap_tree *tree, in zswap_entry_put() argument
369 zswap_rb_erase(&tree->rbroot, entry); in zswap_entry_put()
875 struct zswap_tree *tree; in zswap_writeback_entry() local
896 tree = zswap_trees[swp_type(swpentry)]; in zswap_writeback_entry()
900 spin_lock(&tree->lock); in zswap_writeback_entry()
901 entry = zswap_entry_find_get(&tree->rbroot, offset); in zswap_writeback_entry()
904 spin_unlock(&tree->lock); in zswap_writeback_entry()
909 spin_unlock(&tree->lock); in zswap_writeback_entry()
955 spin_lock(&tree->lock); in zswap_writeback_entry()
957 zswap_entry_put(tree, entry); in zswap_writeback_entry()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/ |
| D | of_unittest.rst | 13 is attached to the live tree dynamically, independent of the machine's
23 from the unflattened device tree data structure. This interface is used by
62 Un-flattened device tree structure:
64 Un-flattened device tree consists of connected device_node(s) in form of a tree
67 // following struct members are used to construct the tree
76 Figure 1, describes a generic structure of machine's un-flattened device tree
78 ``*parent``, that is used to traverse the tree in the reverse direction. So, at
105 Figure 1: Generic structure of un-flattened device tree
109 machine's device tree (if present). So, when selftest_data_add() is called,
110 at first it reads the flattened device tree data linked into the kernel image
[all …]
|