/linux/fs/btrfs/ |
A D | extent-io-tree.h | 110 static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) in lock_extent() 142 static inline int unlock_extent_cached(struct extent_io_tree *tree, u64 start, in unlock_extent_cached() 149 static inline int unlock_extent_cached_atomic(struct extent_io_tree *tree, in unlock_extent_cached_atomic() 156 static inline int clear_extent_bits(struct extent_io_tree *tree, u64 start, in clear_extent_bits() 176 static inline int set_extent_bits(struct extent_io_tree *tree, u64 start, in set_extent_bits() 190 static inline int set_extent_dirty(struct extent_io_tree *tree, u64 start, in set_extent_dirty() 197 static inline int clear_extent_dirty(struct extent_io_tree *tree, u64 start, in clear_extent_dirty() 209 static inline int set_extent_delalloc(struct extent_io_tree *tree, u64 start, in set_extent_delalloc() 218 static inline int set_extent_defrag(struct extent_io_tree *tree, u64 start, in set_extent_defrag() 226 static inline int set_extent_new(struct extent_io_tree *tree, u64 start, in set_extent_new() [all …]
|
A D | extent_map.c | 36 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init() 235 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map() 296 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache() 335 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) in clear_em_logging() 342 static inline void setup_extent_mapping(struct extent_map_tree *tree, in setup_extent_mapping() 400 int add_extent_mapping(struct extent_map_tree *tree, in add_extent_mapping() 421 __lookup_extent_mapping(struct extent_map_tree *tree, in __lookup_extent_mapping() 460 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping() 477 struct extent_map *search_extent_mapping(struct extent_map_tree *tree, in search_extent_mapping() 491 void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) in remove_extent_mapping() [all …]
|
A D | ordered-data.c | 159 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in __btrfs_add_ordered_extent() local 293 struct btrfs_ordered_inode_tree *tree; in btrfs_add_ordered_sum() local 321 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_mark_ordered_io_finished() local 461 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_dec_test_ordered_pending() local 541 struct btrfs_ordered_inode_tree *tree; in btrfs_remove_ordered_extent() local 816 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_extent() local 843 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_range() local 884 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_get_ordered_extents_for_logging() local 912 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_first_ordered_extent() local 941 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_lookup_first_ordered_range() local [all …]
|
A D | extent_io.c | 111 struct extent_io_tree *tree, u64 start, u64 end) in __btrfs_debug_check_extent_io_range() 172 struct extent_io_tree *tree = bio->bi_private; in submit_one_bio() local 289 struct extent_io_tree *tree, unsigned int owner, in extent_io_tree_init() 302 void extent_io_tree_release(struct extent_io_tree *tree) in extent_io_tree_release() 472 tree_search_for_insert(struct extent_io_tree *tree, in tree_search_for_insert() 501 static void merge_state(struct extent_io_tree *tree, in merge_state() 556 static int insert_state(struct extent_io_tree *tree, in insert_state() 860 static void wait_on_state(struct extent_io_tree *tree, in wait_on_state() 2098 u64 count_range_bits(struct extent_io_tree *tree, in count_range_bits() 2901 struct extent_io_tree *tree; in endio_readpage_release_extent() local [all …]
|
/linux/fs/hfs/ |
A D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local 137 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close() 160 void hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write() 190 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local 224 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() 247 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc() 323 struct hfs_btree *tree; in hfs_bmap_free() local
|
A D | bnode.c | 63 struct hfs_btree *tree; in hfs_bnode_read_key() local 188 struct hfs_btree *tree; in hfs_bnode_unlink() local 233 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash() 251 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create() 327 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() 420 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create() 472 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
|
A D | brec.c | 67 struct hfs_btree *tree; in hfs_brec_insert() local 179 struct hfs_btree *tree; in hfs_brec_remove() local 233 struct hfs_btree *tree; in hfs_bnode_split() local 354 struct hfs_btree *tree; in hfs_brec_update_parent() local 458 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
|
A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() 109 struct hfs_btree *tree; in hfs_brec_find() local 176 struct hfs_btree *tree; in hfs_brec_goto() local
|
/linux/fs/hfsplus/ |
A D | btree.c | 135 struct hfs_btree *tree; in hfs_btree_open() local 258 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close() 282 int hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write() 314 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local 346 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve() 373 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc() 450 struct hfs_btree *tree; in hfs_bmap_free() local
|
A D | bnode.c | 61 struct hfs_btree *tree; in hfs_bnode_read_key() local 337 struct hfs_btree *tree; in hfs_bnode_unlink() local 383 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash() 400 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create() 478 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() 573 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create() 625 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local 657 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
|
A D | brec.c | 65 struct hfs_btree *tree; in hfs_brec_insert() local 181 struct hfs_btree *tree; in hfs_brec_remove() local 237 struct hfs_btree *tree; in hfs_bnode_split() local 358 struct hfs_btree *tree; in hfs_brec_update_parent() local 462 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
|
A D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() 166 struct hfs_btree *tree; in hfs_brec_find() local 233 struct hfs_btree *tree; in hfs_brec_goto() local
|
/linux/fs/unicode/ |
A D | mkutf8data.c | 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 417 static void tree_walk(struct tree *tree) in tree_walk() 654 static void prune(struct tree *tree) in prune() 815 static void mark_nodes(struct tree *tree) in mark_nodes() 1048 static int size_nodes(struct tree *tree) in size_nodes() 1745 static void verify(struct tree *tree) in verify() 2967 struct tree *tree; member [all …]
|
/linux/kernel/ |
A D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local 111 static inline void get_tree(struct audit_tree *tree) in get_tree() 116 static inline void put_tree(struct audit_tree *tree) in put_tree() 123 const char *audit_tree_path(struct audit_tree *tree) in audit_tree_path() 609 static void trim_marked(struct audit_tree *tree) in trim_marked() 649 struct audit_tree *tree; in audit_remove_tree_rule() local 684 struct audit_tree *tree; in audit_trim_trees() local 740 void audit_put_tree(struct audit_tree *tree) in audit_put_tree() 802 struct audit_tree *seed = rule->tree, *tree; in audit_add_tree_rule() local 897 struct audit_tree *tree; in audit_tag_tree() local [all …]
|
/linux/lib/zlib_deflate/ |
A D | deftree.c | 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 296 #define pqremove(s, tree, top) \ argument 307 #define smaller(tree, n, m, depth) \ argument 319 ct_data *tree, /* the tree to restore */ in pqdownheap() 358 ct_data *tree = desc->dyn_tree; in gen_bitlen() local 442 ct_data *tree, /* the tree to decorate */ in gen_codes() 489 ct_data *tree = desc->dyn_tree; in build_tree() local 574 ct_data *tree, /* the tree to be scanned */ in scan_tree() 620 ct_data *tree, /* the tree to be scanned */ in send_tree()
|
/linux/include/linux/ |
A D | rbtree.h | 165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() 195 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() 223 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() 256 rb_find(const void *key, const struct rb_root *tree, in rb_find() 284 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first() 330 #define rb_for_each(node, key, tree, cmp) \ argument
|
/linux/fs/ext4/ |
A D | extents_status.c | 171 void ext4_es_init_tree(struct ext4_es_tree *tree) in ext4_es_init_tree() 180 struct ext4_es_tree *tree; in ext4_es_print_tree() local 261 struct ext4_es_tree *tree = NULL; in __es_find_extent_range() local 540 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_left() local 564 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_right() local 920 struct ext4_es_tree *tree; in ext4_es_lookup_extent() local 1694 struct ext4_es_tree *tree = &ei->i_es_tree; in es_do_reclaim_extents() local 1768 struct ext4_es_tree *tree; in ext4_clear_inode_es() local 1790 struct ext4_pending_tree *tree; in ext4_print_pending_tree() local 1840 struct ext4_pending_tree *tree; in __get_pending() local [all …]
|
/linux/net/sched/ |
A D | ematch.c | 162 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match() 304 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() 398 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy() 435 int tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) in tcf_em_tree_dump() 498 int __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, in __tcf_em_tree_match()
|
/linux/tools/include/linux/ |
A D | rbtree.h | 178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() 206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() 234 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() 267 rb_find(const void *key, const struct rb_root *tree, in rb_find() 295 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first() 341 #define rb_for_each(node, key, tree, cmp) \ argument
|
/linux/scripts/dtc/ |
A D | fstree.c | 16 struct node *tree; in read_fstree() local 70 struct node *tree; in dt_from_fs() local
|
A D | livetree.c | 399 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info() 447 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label() 473 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label() 512 struct node *get_node_by_path(struct node *tree, const char *path) in get_node_by_path() 538 struct node *get_node_by_label(struct node *tree, const char *label) in get_node_by_label() 558 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle() 582 struct node *get_node_by_ref(struct node *tree, const char *ref) in get_node_by_ref() 623 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
|
/linux/tools/testing/radix-tree/ |
A D | tag_check.c | 14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks() 131 static void gang_check(struct radix_tree_root *tree, in gang_check() 157 static void do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) in do_thrash()
|
/linux/drivers/gpu/drm/amd/display/dc/dcn10/ |
A D | dcn10_mpc.c | 122 struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id) in mpc1_get_mpcc_for_dpp() 186 struct mpc_tree *tree, in mpc1_insert_plane() 277 struct mpc_tree *tree, in mpc1_remove_mpcc() 402 struct mpc_tree *tree) in mpc1_init_mpcc_list_from_hw()
|
/linux/tools/perf/util/ |
A D | srcline.c | 776 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() 806 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() 825 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() 867 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() 890 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) in inlines__tree_find() 909 void inlines__tree_delete(struct rb_root_cached *tree) in inlines__tree_delete()
|
/linux/mm/ |
A D | zswap.c | 372 static void zswap_entry_put(struct zswap_tree *tree, in zswap_entry_put() 931 struct zswap_tree *tree; in zswap_writeback_entry() local 1085 struct zswap_tree *tree = zswap_trees[type]; in zswap_frontswap_store() local 1250 struct zswap_tree *tree = zswap_trees[type]; in zswap_frontswap_load() local 1326 struct zswap_tree *tree = zswap_trees[type]; in zswap_frontswap_invalidate_page() local 1350 struct zswap_tree *tree = zswap_trees[type]; in zswap_frontswap_invalidate_area() local 1368 struct zswap_tree *tree; in zswap_frontswap_init() local
|