| /openbmc/qemu/include/qemu/ |
| H A D | qtree.h | 119 static inline QTree *q_tree_ref(QTree *tree) in q_tree_ref()
124 static inline void q_tree_unref(QTree *tree) in q_tree_unref()
129 static inline void q_tree_destroy(QTree *tree) in q_tree_destroy()
134 static inline void q_tree_insert(QTree *tree, in q_tree_insert()
141 static inline void q_tree_replace(QTree *tree, in q_tree_replace()
148 static inline gboolean q_tree_remove(QTree *tree, in q_tree_remove()
154 static inline gboolean q_tree_steal(QTree *tree, in q_tree_steal()
160 static inline gpointer q_tree_lookup(QTree *tree, in q_tree_lookup()
166 static inline gboolean q_tree_lookup_extended(QTree *tree, in q_tree_lookup_extended()
174 static inline void q_tree_foreach(QTree *tree, in q_tree_foreach()
[all …]
|
| /openbmc/qemu/util/ |
| H A D | qtree.c | 199 QTree *tree; in q_tree_new_full() local
227 q_tree_node_first(QTree *tree) in q_tree_node_first()
314 q_tree_remove_all(QTree *tree) in q_tree_remove_all()
365 q_tree_ref(QTree *tree) in q_tree_ref()
388 q_tree_unref(QTree *tree) in q_tree_unref()
410 q_tree_destroy(QTree *tree) in q_tree_destroy()
443 q_tree_insert_node(QTree *tree, in q_tree_insert_node()
472 q_tree_insert(QTree *tree, in q_tree_insert()
500 q_tree_replace_node(QTree *tree, in q_tree_replace_node()
527 q_tree_replace(QTree *tree, in q_tree_replace()
[all …]
|
| H A D | iova-tree.c | 16 GTree *tree; member
84 const DMAMap *iova_tree_find(const IOVATree *tree, const DMAMap *map) in iova_tree_find()
108 const DMAMap *iova_tree_find_iova(const IOVATree *tree, const DMAMap *map) in iova_tree_find_iova()
124 int iova_tree_insert(IOVATree *tree, const DMAMap *map) in iova_tree_insert()
144 void iova_tree_remove(IOVATree *tree, DMAMap map) in iova_tree_remove()
213 int iova_tree_alloc_map(IOVATree *tree, DMAMap *map, hwaddr iova_begin, in iova_tree_alloc_map()
255 void iova_tree_destroy(IOVATree *tree) in iova_tree_destroy()
|
| /openbmc/linux/fs/btrfs/ |
| H A D | extent-io-tree.c | 55 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
58 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range()
97 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init()
108 void extent_io_tree_release(struct extent_io_tree *tree) in extent_io_tree_release()
233 static inline struct extent_state *tree_search_for_insert(struct extent_io_tree *tree, in tree_search_for_insert()
279 static struct extent_state *tree_search_prev_next(struct extent_io_tree *tree, in tree_search_prev_next()
319 static inline struct extent_state *tree_search(struct extent_io_tree *tree, u64 offset) in tree_search()
324 static void extent_io_tree_panic(struct extent_io_tree *tree, int err) in extent_io_tree_panic()
339 static void merge_state(struct extent_io_tree *tree, struct extent_state *state) in merge_state()
368 static void set_state_bits(struct extent_io_tree *tree, in set_state_bits()
[all …]
|
| H A D | extent_map.c | 35 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init()
231 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map()
295 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache()
334 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) in clear_em_logging()
343 static inline void setup_extent_mapping(struct extent_map_tree *tree, in setup_extent_mapping()
403 int add_extent_mapping(struct extent_map_tree *tree, in add_extent_mapping()
424 __lookup_extent_mapping(struct extent_map_tree *tree, in __lookup_extent_mapping()
461 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping()
479 struct extent_map *search_extent_mapping(struct extent_map_tree *tree, in search_extent_mapping()
494 void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) in remove_extent_mapping()
[all …]
|
| H A D | ordered-data.c | 127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search()
212 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in insert_ordered_extent() local
291 struct btrfs_ordered_inode_tree *tree; in btrfs_add_ordered_sum() local
408 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_mark_ordered_io_finished() local
501 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_dec_test_ordered_pending() local
582 struct btrfs_ordered_inode_tree *tree; in btrfs_remove_ordered_extent() local
881 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_extent() local
910 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_range() local
953 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_get_ordered_extents_for_logging() local
982 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_first_ordered_extent() local
[all …]
|
| H A D | extent-io-tree.h | 142 static inline int clear_extent_bit(struct extent_io_tree *tree, u64 start, in clear_extent_bit()
149 static inline int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, in unlock_extent()
155 static inline int clear_extent_bits(struct extent_io_tree *tree, u64 start, in clear_extent_bits()
166 static inline int clear_extent_uptodate(struct extent_io_tree *tree, u64 start, in clear_extent_uptodate()
173 static inline int clear_extent_dirty(struct extent_io_tree *tree, u64 start, in clear_extent_dirty()
|
| /openbmc/qemu/hw/hyperv/ |
| H A D | hv-balloon-page_range_tree.c | 37 static GTreeNode *page_range_tree_insert_new(PageRangeTree tree, in page_range_tree_insert_new()
51 void hvb_page_range_tree_insert(PageRangeTree tree, in hvb_page_range_tree_insert()
136 bool hvb_page_range_tree_pop(PageRangeTree tree, PageRange *out, in hvb_page_range_tree_pop()
166 bool hvb_page_range_tree_intree_any(PageRangeTree tree, in hvb_page_range_tree_intree_any()
214 void hvb_page_range_tree_init(PageRangeTree *tree) in hvb_page_range_tree_init()
220 void hvb_page_range_tree_destroy(PageRangeTree *tree) in hvb_page_range_tree_destroy()
|
| /openbmc/linux/fs/hfs/ |
| H A D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local
139 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
162 void hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
193 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
227 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
250 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
326 struct hfs_btree *tree; in hfs_bmap_free() local
|
| H A D | bnode.c | 60 struct hfs_btree *tree; in hfs_bnode_read_key() local
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
226 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
244 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
317 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
411 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
461 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
|
| H 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()
|
| /openbmc/linux/fs/hfsplus/ |
| H A D | btree.c | 135 struct hfs_btree *tree; in hfs_btree_open() local
259 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
283 int hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
315 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
347 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
374 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
451 struct hfs_btree *tree; in hfs_bmap_free() local
|
| H A D | bnode.c | 59 struct hfs_btree *tree; in hfs_bnode_read_key() local
330 struct hfs_btree *tree; in hfs_bnode_unlink() local
376 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
393 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
467 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
562 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
612 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
644 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
|
| H 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()
|
| /openbmc/linux/fs/unicode/ |
| H 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
380 static void *lookup(struct tree *tree, const char *key) in lookup()
417 static void tree_walk(struct tree *tree) in tree_walk()
533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert()
654 static void prune(struct tree *tree) in prune()
815 static void mark_nodes(struct tree *tree) in mark_nodes()
942 static int index_nodes(struct tree *tree, int index) in index_nodes()
[all …]
|
| /openbmc/linux/kernel/ |
| H 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()
261 bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) in audit_tree_match()
397 static int create_chunk(struct inode *inode, struct audit_tree *tree) in create_chunk()
458 static int tag_chunk(struct inode *inode, struct audit_tree *tree) in tag_chunk()
542 static void kill_rules(struct audit_context *context, struct audit_tree *tree) in kill_rules()
609 static void trim_marked(struct audit_tree *tree) in trim_marked()
649 struct audit_tree *tree; in audit_remove_tree_rule() local
[all …]
|
| /openbmc/linux/lib/zlib_deflate/ |
| H 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()
|
| /openbmc/linux/include/linux/ |
| H 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
|
| /openbmc/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()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate()
400 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy()
437 int tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) in tcf_em_tree_dump()
500 int __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, in __tcf_em_tree_match()
|
| /openbmc/qemu/hw/virtio/ |
| H A D | vhost-iova-tree.c | 40 VhostIOVATree *tree = g_new(VhostIOVATree, 1); in vhost_iova_tree_new() local
67 const DMAMap *vhost_iova_tree_find_iova(const VhostIOVATree *tree, in vhost_iova_tree_find_iova()
86 int vhost_iova_tree_map_alloc(VhostIOVATree *tree, DMAMap *map) in vhost_iova_tree_map_alloc()
|
| /openbmc/u-boot/lib/zlib/ |
| H A D | trees.c | 168 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
172 # define send_code(s, c, tree) \ argument
438 #define pqremove(s, tree, top) \ argument
449 #define smaller(tree, n, m, depth) \ argument
459 local void pqdownheap(s, tree, k) in pqdownheap() argument
498 ct_data *tree = desc->dyn_tree; local
581 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
627 ct_data *tree = desc->dyn_tree; local
711 local void scan_tree (s, tree, max_code) in scan_tree() argument
756 local void send_tree (s, tree, max_code) in send_tree() argument
|
| /openbmc/linux/fs/ext4/ |
| H A D | extents_status.c | 172 void ext4_es_init_tree(struct ext4_es_tree *tree) in ext4_es_init_tree()
181 struct ext4_es_tree *tree; in ext4_es_print_tree() local
262 struct ext4_es_tree *tree = NULL; in __es_find_extent_range() local
571 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_left() local
595 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_right() local
790 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in __es_insert_extent() local
986 struct ext4_es_tree *tree; in ext4_es_lookup_extent() local
1245 struct ext4_pending_tree *tree = &EXT4_I(inode)->i_pending_tree; in get_rsvd() local
1372 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in __es_remove_extent() local
1772 struct ext4_es_tree *tree = &ei->i_es_tree; in es_do_reclaim_extents() local
[all …]
|
| /openbmc/linux/tools/include/linux/ |
| H 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
|
| /openbmc/linux/kernel/module/ |
| H A D | tree_lookup.c | 64 static noinline void __mod_tree_insert(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_insert()
69 static void __mod_tree_remove(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_remove()
103 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find()
|
| /openbmc/qemu/tests/unit/ |
| H A D | test-qtree.c | 94 QTree *tree; in test_tree_search() local
200 QTree *tree; in test_tree_remove() local
252 QTree *tree; in test_tree_destroy() local
275 QTree *tree; in test_tree_insert() local
|