| /linux/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 | 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 …]
|
| /linux/fs/hfs/ |
| H A D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local
31 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
32 if (!tree) in hfs_btree_open()
35 mutex_init(&tree->tree_lock); in hfs_btree_open()
36 spin_lock_init(&tree->hash_lock); in hfs_btree_open()
38 tree->sb = sb; in hfs_btree_open()
39 tree->cnid = id; in hfs_btree_open()
40 tree->keycmp = keycmp; in hfs_btree_open()
42 tree in hfs_btree_open()
174 hfs_btree_close(struct hfs_btree * tree) hfs_btree_close() argument
197 hfs_btree_write(struct hfs_btree * tree) hfs_btree_write() argument
228 struct hfs_btree *tree = prev->tree; hfs_bmap_new_bmap() local
262 hfs_bmap_reserve(struct hfs_btree * tree,int rsvd_nodes) hfs_bmap_reserve() argument
285 hfs_bmap_alloc(struct hfs_btree * tree) hfs_bmap_alloc() argument
361 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 | 21 bool is_valid = off < node->tree->node_size; in is_bnode_offset_valid()
28 node->tree->node_size, off); in is_bnode_offset_valid()
42 node_size = node->tree->node_size; in check_and_correct_requested_length()
52 node->tree->node_size, off, len, new_len); in check_and_correct_requested_length()
75 node->tree->node_size, off, len); in hfs_bnode_read()
86 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
116 struct hfs_btree *tree; in hfs_bnode_read_key() local
119 tree = node->tree; in hfs_bnode_read_key()
121 tree in hfs_bnode_read_key()
279 struct hfs_btree *tree; hfs_bnode_unlink() local
324 hfs_bnode_findhash(struct hfs_btree * tree,u32 cnid) hfs_bnode_findhash() argument
342 __hfs_bnode_create(struct hfs_btree * tree,u32 cnid) __hfs_bnode_create() argument
415 hfs_bnode_find(struct hfs_btree * tree,u32 num) hfs_bnode_find() argument
509 hfs_bnode_create(struct hfs_btree * tree,u32 num) hfs_bnode_create() argument
559 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 || !fd) in hfs_find_init()
22 fd->tree = tree; in hfs_find_init()
24 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
28 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
30 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
31 switch (tree->cnid) { in hfs_find_init()
33 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); in hfs_find_init()
36 mutex_lock_nested(&tree in hfs_find_init()
112 struct hfs_btree *tree; hfs_brec_find() local
179 struct hfs_btree *tree; hfs_brec_goto() local
[all...] |
| /linux/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 | 24 bool is_valid = off < node->tree->node_size; in is_bnode_offset_valid()
31 node->tree->node_size, off); in is_bnode_offset_valid()
45 node_size = node->tree->node_size; in check_and_correct_requested_length()
55 node->tree->node_size, off, len, new_len); in check_and_correct_requested_length()
77 node->tree->node_size, off, len); in hfs_bnode_read()
115 struct hfs_btree *tree; in hfs_bnode_read_key() local
118 tree = node->tree; in hfs_bnode_read_key()
120 tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_read_key()
121 node->tree in hfs_bnode_read_key()
428 struct hfs_btree *tree; hfs_bnode_unlink() local
474 hfs_bnode_findhash(struct hfs_btree * tree,u32 cnid) hfs_bnode_findhash() argument
491 __hfs_bnode_create(struct hfs_btree * tree,u32 cnid) __hfs_bnode_create() argument
565 hfs_bnode_find(struct hfs_btree * tree,u32 num) hfs_bnode_find() argument
660 hfs_bnode_create(struct hfs_btree * tree,u32 num) hfs_bnode_create() argument
710 struct hfs_btree *tree = node->tree; hfs_bnode_put() local
742 hfs_bnode_need_zeroout(struct hfs_btree * tree) hfs_bnode_need_zeroout() 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 mutex_lock_nested(&tree->tree_lock, in hfs_find_init()
29 hfsplus_btree_lock_class(tree)); in hfs_find_init()
38 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
39 mutex_unlock(&fd->tree in hfs_find_exit()
155 struct hfs_btree *tree; hfs_brec_find() local
222 struct hfs_btree *tree; hfs_brec_goto() local
[all...] |
| /linux/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
649 struct audit_tree *tree; audit_remove_tree_rule() local
678 struct audit_tree *tree; audit_trim_trees() local
738 audit_put_tree(struct audit_tree * tree) audit_put_tree() argument
743 tag_mounts(struct path * paths,struct audit_tree * tree) tag_mounts() argument
805 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
902 struct audit_tree *tree; audit_tag_tree() local
939 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /linux/fs/btrfs/ |
| H A D | extent-io-tree.c | 8 #include "extent-io-tree.h"
47 "state leak: start %llu end %llu state %u in tree %d refs %d", in btrfs_extent_state_leak_debug_check()
57 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
58 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
60 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range() argument
63 const struct btrfs_inode *inode = tree->inode; in __btrfs_debug_check_extent_io_range()
66 if (tree->owner != IO_TREE_INODE_IO) in __btrfs_debug_check_extent_io_range()
84 const struct btrfs_inode *btrfs_extent_io_tree_to_inode(const struct extent_io_tree *tree) in btrfs_extent_io_tree_to_inode() argument
86 if (tree->owner == IO_TREE_INODE_IO) in btrfs_extent_io_tree_to_inode()
87 return tree in btrfs_extent_io_tree_to_inode()
92 btrfs_extent_io_tree_to_fs_info(const struct extent_io_tree * tree) btrfs_extent_io_tree_to_fs_info() argument
100 btrfs_extent_io_tree_init(struct btrfs_fs_info * fs_info,struct extent_io_tree * tree,unsigned int owner) btrfs_extent_io_tree_init() argument
115 btrfs_extent_io_tree_release(struct extent_io_tree * tree) btrfs_extent_io_tree_release() argument
237 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
287 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
327 tree_search(struct extent_io_tree * tree,u64 offset) tree_search() argument
332 extent_io_tree_panic(const struct extent_io_tree * tree,const struct extent_state * state,const char * opname,int err) extent_io_tree_panic() argument
342 merge_prev_state(struct extent_io_tree * tree,struct extent_state * state) merge_prev_state() argument
357 merge_next_state(struct extent_io_tree * tree,struct extent_state * state) merge_next_state() argument
381 merge_state(struct extent_io_tree * tree,struct extent_state * state) merge_state() argument
390 set_state_bits(struct extent_io_tree * tree,struct extent_state * state,u32 bits,struct extent_changeset * changeset) set_state_bits() argument
420 insert_state(struct extent_io_tree * tree,struct extent_state * state,u32 bits,struct extent_changeset * changeset) insert_state() argument
478 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
503 split_state(struct extent_io_tree * tree,struct extent_state * orig,struct extent_state * prealloc,u64 split) split_state() argument
560 clear_state_bit(struct extent_io_tree * tree,struct extent_state * state,u32 bits,int wake,u64 end,struct extent_changeset * changeset) clear_state_bit() argument
612 btrfs_clear_extent_bit_changeset(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state,struct extent_changeset * changeset) btrfs_clear_extent_bit_changeset() argument
776 wait_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) wait_extent_bit() argument
863 find_first_extent_bit_state(struct extent_io_tree * tree,u64 start,u32 bits) find_first_extent_bit_state() argument
889 btrfs_find_first_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits,struct extent_state ** cached_state) btrfs_find_first_extent_bit() argument
953 btrfs_find_contiguous_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits) btrfs_find_contiguous_extent_bit() argument
983 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
1046 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
1294 btrfs_set_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) btrfs_set_extent_bit() argument
1318 btrfs_convert_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,u32 clear_bits,struct extent_state ** cached_state) btrfs_convert_extent_bit() argument
1547 btrfs_find_first_clear_extent_bit(struct extent_io_tree * tree,u64 start,u64 * start_ret,u64 * end_ret,u32 bits) btrfs_find_first_clear_extent_bit() argument
1665 btrfs_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) btrfs_count_range_bits() argument
1753 btrfs_test_range_bit_exists(struct extent_io_tree * tree,u64 start,u64 end,u32 bit) btrfs_test_range_bit_exists() argument
1779 btrfs_get_range_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 * bits,struct extent_state ** cached_state) btrfs_get_range_bits() argument
1816 btrfs_test_range_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bit,struct extent_state * cached) btrfs_test_range_bit() argument
1858 btrfs_set_record_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_changeset * changeset) btrfs_set_record_extent_bits() argument
1871 btrfs_clear_record_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_changeset * changeset) btrfs_clear_record_extent_bits() argument
1883 btrfs_try_lock_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached) btrfs_try_lock_extent_bits() argument
1903 btrfs_lock_extent_bits(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached_state) btrfs_lock_extent_bits() argument
1929 btrfs_next_extent_state(struct extent_io_tree * tree,struct extent_state * state) btrfs_next_extent_state() argument
[all...] |
| H A D | extent-io-tree.h | 79 * Redefined bits above which are used only in the device allocation tree,
106 * The fs_info is needed for trace points, a tree attached to an inode
117 /* Who owns this io tree, should be one of IO_TREE_* */
138 const struct btrfs_inode *btrfs_extent_io_tree_to_inode(const struct extent_io_tree *tree);
139 const struct btrfs_fs_info *btrfs_extent_io_tree_to_fs_info(const struct extent_io_tree *tree);
142 struct extent_io_tree *tree, unsigned int owner);
143 void btrfs_extent_io_tree_release(struct extent_io_tree *tree);
144 int btrfs_lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits,
146 bool btrfs_try_lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
149 static inline int btrfs_lock_extent(struct extent_io_tree *tree, u6 argument
155 btrfs_try_lock_extent(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_try_lock_extent() argument
181 btrfs_clear_extent_bit(struct extent_io_tree * tree,u64 start,u64 end,u32 bits,struct extent_state ** cached) btrfs_clear_extent_bit() argument
188 btrfs_unlock_extent(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_unlock_extent() argument
200 btrfs_clear_extent_dirty(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_clear_extent_dirty() argument
222 btrfs_lock_dio_extent(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_lock_dio_extent() argument
228 btrfs_try_lock_dio_extent(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_try_lock_dio_extent() argument
234 btrfs_unlock_dio_extent(struct extent_io_tree * tree,u64 start,u64 end,struct extent_state ** cached) btrfs_unlock_dio_extent() 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/drivers/gpu/drm/xe/ |
| H A D | xe_range_fence.c | 24 struct xe_range_fence_tree *tree = rfence->tree; in xe_range_fence_signal_notify() local
26 llist_add(&rfence->link, &tree->list); in xe_range_fence_signal_notify()
29 static bool __xe_range_fence_tree_cleanup(struct xe_range_fence_tree *tree) in __xe_range_fence_tree_cleanup() argument
31 struct llist_node *node = llist_del_all(&tree->list); in __xe_range_fence_tree_cleanup()
35 xe_range_fence_tree_remove(rfence, &tree->root); in __xe_range_fence_tree_cleanup()
45 * @tree: range fence tree to insert intoi
54 int xe_range_fence_insert(struct xe_range_fence_tree *tree, in xe_range_fence_insert() argument
61 __xe_range_fence_tree_cleanup(tree); in xe_range_fence_insert()
89 xe_range_fence_tree_remove_all(struct xe_range_fence_tree * tree) xe_range_fence_tree_remove_all() argument
110 xe_range_fence_tree_init(struct xe_range_fence_tree * tree) xe_range_fence_tree_init() argument
119 xe_range_fence_tree_fini(struct xe_range_fence_tree * tree) xe_range_fence_tree_fini() argument
134 xe_range_fence_tree_first(struct xe_range_fence_tree * tree,u64 start,u64 last) xe_range_fence_tree_first() argument
[all...] |
| /linux/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; argument
355 int *(*leaf_index)(struct tree *, void *); argument
378 * Example lookup function for a tree. argument
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...] |
| /linux/sound/hda/core/ |
| H A D | 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; 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; widget_tree_create() local
427 struct hdac_widget_tree *tree; hda_widget_sysfs_reinit() local
[all...] |
| /linux/lib/zlib_deflate/ |
| H A 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 …]
|
| /linux/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) 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()
167 tree fld, lst = TYPE_FIELDS(type); in handle_latent_entropy_attribute()
171 tree fieldtyp in handle_latent_entropy_attribute()
[all...] |
| H A D | randomize_layout_plugin.c | 54 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_randomize_layout_attr()
56 tree type; in handle_randomize_layout_attr()
100 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_randomize_considered_attr()
110 static tree handle_randomize_performed_att
[all...] |
| /linux/include/linux/ |
| H A D | rbtree.h | 43 /* Find logical next and previous nodes in a tree */
97 * rb_erase() may rebalance the tree, causing us to miss some nodes.
157 * rb_add_cached() - insert @node into the leftmost cached tree @tree
159 * @tree: leftmost cached tree to insert @node into
165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() argument
168 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
183 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
189 * rb_add() - insert @node into @tree
195 rb_add(struct rb_node * node,struct rb_root * tree,bool (* less)(struct rb_node *,const struct rb_node *)) rb_add() argument
223 rb_find_add_cached(struct rb_node * node,struct rb_root_cached * tree,int (* cmp)(const struct rb_node * new,const struct rb_node * exist)) rb_find_add_cached() argument
260 rb_find_add(struct rb_node * node,struct rb_root * tree,int (* cmp)(struct rb_node *,const struct rb_node *)) rb_find_add() argument
296 rb_find_add_rcu(struct rb_node * node,struct rb_root * tree,int (* cmp)(struct rb_node *,const struct rb_node *)) rb_find_add_rcu() argument
329 rb_find(const void * key,const struct rb_root * tree,int (* cmp)(const void * key,const struct rb_node *)) rb_find() argument
360 rb_find_rcu(const void * key,const struct rb_root * tree,int (* cmp)(const void * key,const struct rb_node *)) rb_find_rcu() argument
388 rb_find_first(const void * key,const struct rb_root * tree,int (* cmp)(const void * key,const struct rb_node *)) rb_find_first() argument
434 rb_for_each(node,key,tree,cmp) global() argument
[all...] |
| /linux/net/sched/ |
| H A 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()
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
306 tcf_em_tree_validate(struct tcf_proto * tp,struct nlattr * nla,struct tcf_ematch_tree * tree) tcf_em_tree_validate() argument
400 tcf_em_tree_destroy(struct tcf_ematch_tree * tree) tcf_em_tree_destroy() argument
437 tcf_em_tree_dump(struct sk_buff * skb,struct tcf_ematch_tree * tree,int tlv) tcf_em_tree_dump() argument
500 __tcf_em_tree_match(struct sk_buff * skb,struct tcf_ematch_tree * tree,struct tcf_pkt_info * info) __tcf_em_tree_match() argument
[all...] |
| /linux/lib/ |
| H A D | test_maple_tree.c | 3 * test_maple_tree.c: Test the maple tree API
7 * Any tests that only require the interface of the tree.
557 MT_BUG_ON(mas.tree, entry == NULL); in check_find()
1021 /* Create tree of 1-100 */ in check_ranges()
1029 /* Create tree of 1-200 */ in check_ranges()
1042 /* Create tree of 1-400 */ in check_ranges()
1070 /* Overwrite multiple levels at the end of the tree (slot 7) */ in check_ranges()
1134 * 8. Overwrite the whole tree in check_ranges()
1135 * 9. Try to overwrite the zero entry of an alloc tree. in check_ranges()
1287 /* Cause a 3 child split all the way up the tree in check_ranges()
[all...] |
| /linux/Documentation/core-api/ |
| H A D | maple_tree.rst | 14 non-overlapping ranges, including ranges of size 1. The tree was designed to
17 entry in a cache-efficient manner. The tree can also be put into an RCU-safe
24 use the normal API. An :ref:`maple-tree-advanced-api` exists for more complex
34 :ref:`maple-tree-advanced-api`, but are blocked by the normal API.
40 :ref:`maple-tree-advanced-api`. This is useful for users who must guarantee a
45 .. _maple-tree-normal-api:
50 Start by initialising a maple tree, either with DEFINE_MTREE() for statically
52 freshly-initialised maple tree contains a ``NULL`` pointer for the range ``0``
54 allocation tree and the regular tree
[all...] |
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 52 /* Find logical next and previous nodes in a tree */
95 * rb_erase() may rebalance the tree, causing us to miss some nodes.
172 * rb_add_cached() - insert @node into the leftmost cached tree @tree
174 * @tree: leftmost cached tree to insert @node into
178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() argument
181 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
196 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
200 * rb_add() - insert @node into @tree
206 rb_add(struct rb_node * node,struct rb_root * tree,bool (* less)(struct rb_node *,const struct rb_node *)) rb_add() argument
234 rb_find_add(struct rb_node * node,struct rb_root * tree,int (* cmp)(struct rb_node *,const struct rb_node *)) rb_find_add() argument
267 rb_find(const void * key,const struct rb_root * tree,int (* cmp)(const void * key,const struct rb_node *)) rb_find() argument
295 rb_find_first(const void * key,const struct rb_root * tree,int (* cmp)(const void * key,const struct rb_node *)) rb_find_first() argument
341 rb_for_each(node,key,tree,cmp) global() argument
[all...] |