/linux-master/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) argument 19 item_check_absent(tree, index); 20 assert(item_tag_get(tree, index, tag) == 0); 22 item_insert(tree, index); 23 assert(item_tag_get(tree, index, tag) == 0); 24 item_tag_set(tree, index, tag); 25 ret = item_tag_get(tree, index, tag); 27 ret = tag_tagged_items(tree, first, ~0UL, 10, tag, !tag); 29 ret = item_tag_get(tree, inde 131 gang_check(struct radix_tree_root *tree, char *thrash_state, int tag) argument 157 do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) argument [all...] |
H A D | main.c | 10 #include <linux/radix-tree.h> 18 RADIX_TREE(tree, GFP_KERNEL); 23 item_insert(&tree, middle + idx); 25 item_check_absent(&tree, middle - down - 1); 27 item_check_present(&tree, middle + idx); 28 item_check_absent(&tree, middle + up); 31 item_gang_check_present(&tree, middle - down, up + down, 33 item_full_scan(&tree, middle - down, down + up, chunk); 35 item_kill_tree(&tree); 81 RADIX_TREE(tree, GFP_KERNE 126 check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fromtag, int totag) argument [all...] |
/linux-master/fs/hfs/ |
H A D | btree.c | 21 struct hfs_btree *tree; local 27 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 28 if (!tree) 31 mutex_init(&tree->tree_lock); 32 spin_lock_init(&tree->hash_lock); 34 tree->sb = sb; 35 tree->cnid = id; 36 tree->keycmp = keycmp; 38 tree 139 hfs_btree_close(struct hfs_btree *tree) argument 162 hfs_btree_write(struct hfs_btree *tree) argument 193 struct hfs_btree *tree = prev->tree; local 227 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) argument 250 hfs_bmap_alloc(struct hfs_btree *tree) argument 326 struct hfs_btree *tree; 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; 39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { 40 if (node->tree->attributes & HFS_TREE_BIGKEYS) 41 retval = node->tree->max_key_len + 2; 43 retval = node->tree->max_key_len + 1; 45 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); 48 if (node->tree->attributes & HFS_TREE_BIGKEYS) { 50 if (retval > node->tree->max_key_len + 2) { 56 if (retval > node->tree 67 struct hfs_btree *tree; local 179 struct hfs_btree *tree; local 233 struct hfs_btree *tree; local 354 struct hfs_btree *tree; local 458 hfs_btree_inc_height(struct hfs_btree *tree) argument [all...] |
H A D | bnode.c | 30 if (pagenum >= node->tree->pages_per_bnode) 60 struct hfs_btree *tree; local 63 tree = node->tree; 65 tree->attributes & HFS_TREE_VARIDXKEYS) 68 key_len = tree->max_key_len + 1; 154 off = node->tree->node_size - 2; 161 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) 164 tmp = node->tree->max_key_len + 1; 181 struct hfs_btree *tree; local 226 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument 244 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument 317 hfs_bnode_find(struct hfs_btree *tree, u32 num) argument 411 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument 461 struct hfs_btree *tree = node->tree; local [all...] |
H A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) argument 19 fd->tree = tree; 21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); 25 fd->key = ptr + tree->max_key_len + 2; 27 tree->cnid, __builtin_return_address(0)); 28 switch (tree->cnid) { 30 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); 33 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); 36 mutex_lock_nested(&tree 109 struct hfs_btree *tree; local 176 struct hfs_btree *tree; local [all...] |
/linux-master/fs/hfsplus/ |
H A D | btree.c | 42 * Catalog B-tree Header 47 * Attributes B-tree Header 135 struct hfs_btree *tree; local 142 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 143 if (!tree) 146 mutex_init(&tree->tree_lock); 147 spin_lock_init(&tree->hash_lock); 148 tree->sb = sb; 149 tree 259 hfs_btree_close(struct hfs_btree *tree) argument 283 hfs_btree_write(struct hfs_btree *tree) argument 315 struct hfs_btree *tree = prev->tree; local 347 hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) argument 374 hfs_bmap_alloc(struct hfs_btree *tree) argument 451 struct hfs_btree *tree; local [all...] |
H A D | brec.c | 25 dataoff = node->tree->node_size - (rec + 2) * 2; 40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && 41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { 42 retval = node->tree->max_key_len + 2; 45 node->tree->node_size - (rec + 1) * 2); 48 if (recoff > node->tree->node_size - 2) { 54 if (retval > node->tree->max_key_len + 2) { 65 struct hfs_btree *tree; local 72 tree = fd->tree; 181 struct hfs_btree *tree; local 237 struct hfs_btree *tree; local 358 struct hfs_btree *tree; local 462 hfs_btree_inc_height(struct hfs_btree *tree) argument [all...] |
H A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) argument 19 fd->tree = tree; 21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); 25 fd->key = ptr + tree->max_key_len + 2; 27 tree->cnid, __builtin_return_address(0)); 28 switch (tree->cnid) { 30 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); 33 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); 36 mutex_lock_nested(&tree 166 struct hfs_btree *tree; local 233 struct hfs_btree *tree; local [all...] |
H A D | bnode.c | 59 struct hfs_btree *tree; local 62 tree = node->tree; 64 tree->attributes & HFS_TREE_VARIDXKEYS || 65 node->tree->cnid == HFSPLUS_ATTR_CNID) 68 key_len = tree->max_key_len + 2; 303 off = node->tree->node_size - 2; 310 if (node->tree->attributes & HFS_TREE_VARIDXKEYS || 311 node->tree->cnid == HFSPLUS_ATTR_CNID) 314 tmp = node->tree 330 struct hfs_btree *tree; local 376 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument 393 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument 467 hfs_bnode_find(struct hfs_btree *tree, u32 num) argument 562 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument 612 struct hfs_btree *tree = node->tree; local 644 hfs_bnode_need_zeroout(struct hfs_btree *tree) argument [all...] |
/linux-master/drivers/gpu/drm/xe/ |
H A D | xe_range_fence.c | 24 struct xe_range_fence_tree *tree = rfence->tree; local 26 llist_add(&rfence->link, &tree->list); 29 static bool __xe_range_fence_tree_cleanup(struct xe_range_fence_tree *tree) argument 31 struct llist_node *node = llist_del_all(&tree->list); 35 xe_range_fence_tree_remove(rfence, &tree->root); 45 * @tree: range fence tree to insert intoi 54 int xe_range_fence_insert(struct xe_range_fence_tree *tree, argument 61 __xe_range_fence_tree_cleanup(tree); 89 xe_range_fence_tree_remove_all(struct xe_range_fence_tree *tree) argument 110 xe_range_fence_tree_init(struct xe_range_fence_tree *tree) argument 119 xe_range_fence_tree_fini(struct xe_range_fence_tree *tree) argument 134 xe_range_fence_tree_first(struct xe_range_fence_tree *tree, u64 start, u64 last) argument [all...] |
H A D | xe_range_fence.h | 24 /** @rb: RB tree node inserted into interval tree */ 26 /** @start: start address of range fence is interval tree */ 28 /** @last: last address (inclusive) of range fence is interval tree */ 30 /** @__subtree_last: interval tree internal usage */ 36 /** @tree: interval tree which range fence belongs to */ 37 struct xe_range_fence_tree *tree; member in struct:xe_range_fence 39 * @cb: callback when fence signals to remove range fence free from interval tree 48 /** struct xe_range_fence_tree - interval tree t [all...] |
/linux-master/scripts/dtc/ |
H A D | fstree.c | 16 struct node *tree; local 22 tree = build_node(NULL, NULL, NULL); 50 add_property(tree, prop); 58 add_child(tree, newchild); 65 return tree; 70 struct node *tree; local 72 tree = read_fstree(dirname); 73 tree = name_node(tree, ""); 75 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpui [all...] |
/linux-master/scripts/tracing/ |
H A D | draw_functrace.py | 9 The resulted trace is processed into a tree to produce a more human 10 view of the call stack by drawing textual but hierarchical tree of 28 """ This class provides a tree representation of the functions 46 into the tree at the appropriate place. 59 tree = self 60 while tree != CallTree.ROOT and tree._func != func: 61 tree = tree._parent 62 if tree [all...] |
/linux-master/fs/btrfs/ |
H A D | extent-io-tree.c | 7 #include "extent-io-tree.h" 45 pr_err("BTRFS: state leak: start %llu end %llu state %u in tree %d refs %d\n", 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, 64 if (tree->owner != IO_TREE_INODE_IO) 67 inode = extent_io_tree_to_inode_const(tree); 84 * The only tree allowed to set the inode is IO_TREE_INODE_IO. 86 static bool is_inode_io_tree(const struct extent_io_tree *tree) argument 88 return tree 57 __btrfs_debug_check_extent_io_range(const char *caller, struct extent_io_tree *tree, u64 start, u64 end) argument 92 extent_io_tree_to_inode(struct extent_io_tree *tree) argument 100 extent_io_tree_to_inode_const(const struct extent_io_tree *tree) argument 108 extent_io_tree_to_fs_info(const struct extent_io_tree *tree) argument 115 extent_io_tree_init(struct btrfs_fs_info *fs_info, struct extent_io_tree *tree, unsigned int owner) argument 131 extent_io_tree_release(struct extent_io_tree *tree) argument 257 tree_search_for_insert(struct extent_io_tree *tree, u64 offset, struct rb_node ***node_ret, struct rb_node **parent_ret) argument 303 tree_search_prev_next(struct extent_io_tree *tree, u64 offset, struct extent_state **prev_ret, struct extent_state **next_ret) argument 343 tree_search(struct extent_io_tree *tree, u64 offset) argument 348 extent_io_tree_panic(const struct extent_io_tree *tree, const struct extent_state *state, const char *opname, int err) argument 358 merge_prev_state(struct extent_io_tree *tree, struct extent_state *state) argument 374 merge_next_state(struct extent_io_tree *tree, struct extent_state *state) argument 399 merge_state(struct extent_io_tree *tree, struct extent_state *state) argument 408 set_state_bits(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) argument 438 insert_state(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) argument 498 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) argument 523 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) argument 569 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, u32 bits, int wake, struct extent_changeset *changeset) argument 625 __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state, struct extent_changeset *changeset) argument 784 wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) argument 872 find_first_extent_bit_state(struct extent_io_tree *tree, u64 start, u32 bits) argument 898 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits, struct extent_state **cached_state) argument 959 find_contiguous_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) argument 989 btrfs_find_delalloc_range(struct extent_io_tree *tree, u64 *start, u64 *end, u64 max_bytes, struct extent_state **cached_state) argument 1052 __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) argument 1282 set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) argument 1307 convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, u32 clear_bits, struct extent_state **cached_state) argument 1521 find_first_clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) argument 1639 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) argument 1727 test_range_bit_exists(struct extent_io_tree *tree, u64 start, u64 end, u32 bit) argument 1758 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bit, struct extent_state *cached) argument 1807 set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) argument 1821 clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) argument 1833 try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) argument 1854 lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) argument [all...] |
H A D | extent-io-tree.h | 71 * Redefined bits above which are used only in the device allocation tree, 98 * The fs_info is needed for trace points, a tree attached to an inode 109 /* Who owns this io tree, should be one of IO_TREE_* */ 130 struct btrfs_inode *extent_io_tree_to_inode(struct extent_io_tree *tree); 131 const struct btrfs_inode *extent_io_tree_to_inode_const(const struct extent_io_tree *tree); 132 const struct btrfs_fs_info *extent_io_tree_to_fs_info(const struct extent_io_tree *tree); 135 struct extent_io_tree *tree, unsigned int owner); 136 void extent_io_tree_release(struct extent_io_tree *tree); 138 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end, 141 int try_lock_extent(struct extent_io_tree *tree, u6 162 clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached) argument 169 unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) argument 175 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits) argument 186 clear_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) argument 193 clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) argument [all...] |
H A D | Makefile | 25 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 [all...] |
/linux-master/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; local 97 tree = kmalloc(struct_size(tree, pathname, strlen(s) + 1), GFP_KERNEL); 98 if (tree) { 99 refcount_set(&tree 111 get_tree(struct audit_tree *tree) argument 116 put_tree(struct audit_tree *tree) argument 123 audit_tree_path(struct audit_tree *tree) argument 261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) argument 397 create_chunk(struct inode *inode, struct audit_tree *tree) argument 458 tag_chunk(struct inode *inode, struct audit_tree *tree) argument 542 kill_rules(struct audit_context *context, struct audit_tree *tree) argument 609 trim_marked(struct audit_tree *tree) argument 635 kill_rules(audit_context(), tree); local 649 struct audit_tree *tree; local 684 struct audit_tree *tree; local 740 audit_put_tree(struct audit_tree *tree) argument 802 struct audit_tree *seed = rule->tree, *tree; local 897 struct audit_tree *tree; local 934 struct audit_tree *tree; local [all...] |
/linux-master/tools/perf/util/ |
H A D | srcline.h | 23 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline); 25 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr); 26 /* delete all srclines within the tree */ 27 void srcline__tree_delete(struct rb_root_cached *tree); 51 void inlines__tree_insert(struct rb_root_cached *tree, 54 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr); 55 /* delete all nodes within the tree of inline_node s */ 56 void inlines__tree_delete(struct rb_root_cached *tree);
|
/linux-master/net/sched/ |
H A D | ematch.c | 162 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, argument 165 return &tree->matches[index]; 290 * tcf_em_tree_validate - validate ematch config TLV and build ematch tree 293 * @nla: ematch tree configuration TLV 294 * @tree: destination ematch tree variable to store the resulting 295 * ematch tree. 298 * ematch tree in @tree. The resulting tree mus 305 tcf_em_tree_validate(struct tcf_proto *tp, struct nlattr *nla, struct tcf_ematch_tree *tree) argument 400 tcf_em_tree_destroy(struct tcf_ematch_tree *tree) argument 437 tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) argument 500 __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, struct tcf_pkt_info *info) argument [all...] |
/linux-master/sound/hda/ |
H A D | hdac_sysfs.c | 79 * Widget tree sysfs 81 * This is a tree showing the attributes of each widget. It appears like 322 struct hdac_widget_tree *tree = codec->widgets; local 325 if (!tree) 327 free_widget_node(tree->afg, &widget_afg_group); 328 if (tree->nodes) { 329 for (p = tree->nodes; *p; p++) 331 kfree(tree->nodes); 333 kobject_put(tree->root); 334 kfree(tree); 365 struct hdac_widget_tree *tree; local 427 struct hdac_widget_tree *tree; local [all...] |
/linux-master/scripts/gcc-plugins/ |
H A D | latent_entropy_plugin.c | 82 static GTY(()) tree latent_entropy_decl; 116 static tree tree_get_random_const(tree type) 128 static tree handle_latent_entropy_attribute(tree *node, tree name, 129 tree args __unused, 133 tree type; 167 tree fld, lst = TYPE_FIELDS(type); 171 tree fieldtyp [all...] |
H A D | structleak_plugin.c | 53 static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) 76 static tree get_field_type(tree field) 81 static bool is_userspace_type(tree type) 83 tree field; 86 tree fieldtype = get_field_type(field); 101 tree typ [all...] |
/linux-master/kernel/module/ |
H A D | tree_lookup.c | 3 * Modules tree lookup 14 * Use a latched RB-tree for __module_address(); this allows us to use 64 static noinline void __mod_tree_insert(struct mod_tree_node *node, struct mod_tree_root *tree) argument 66 latch_tree_insert(&node->node, &tree->root, &mod_tree_ops); 69 static void __mod_tree_remove(struct mod_tree_node *node, struct mod_tree_root *tree) argument 71 latch_tree_erase(&node->node, &tree->root, &mod_tree_ops); 103 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) argument 107 ltn = latch_tree_find((void *)addr, &tree->root, &mod_tree_ops);
|
/linux-master/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) argument 533 insert(struct tree *tree, char *key, int keylen, void *leaf) argument 654 prune(struct tree *tree) argument 815 mark_nodes(struct tree *tree) argument 942 index_nodes(struct tree *tree, int index) argument 1048 size_nodes(struct tree *tree) argument 1185 emit(struct tree *tree, unsigned char *data) argument 1493 nfdi_index(struct tree *tree, void *l) argument 1500 nfdicf_index(struct tree *tree, void *l) argument 1745 verify(struct tree *tree) argument 2706 utf8nlookup(struct tree *tree, unsigned char *hangul, const char *s, size_t len) argument 2781 utf8lookup(struct tree *tree, unsigned char *hangul, const char *s) argument 2803 utf8agemax(struct tree *tree, const char *s) argument 2830 utf8agemin(struct tree *tree, const char *s) argument 2856 utf8nagemax(struct tree *tree, const char *s, size_t len) argument 2883 utf8nagemin(struct tree *tree, const char *s, size_t len) argument 2912 utf8len(struct tree *tree, const char *s) argument 2939 utf8nlen(struct tree *tree, const char *s, size_t len) argument 2967 struct tree *tree; member in struct:utf8cursor 2990 utf8ncursor(struct utf8cursor *u8c, struct tree *tree, const char *s, size_t len) argument 3025 utf8cursor(struct utf8cursor *u8c, struct tree *tree, const char *s) argument 3174 normalize_line(struct tree *tree) argument [all...] |