| /openbmc/linux/tools/testing/radix-tree/ |
| H A 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 …]
|
| 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 …]
|
| /openbmc/linux/fs/hfs/ |
| H A 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 …]
|
| 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->max_key_len + 1) { in hfs_brec_keylen()
[all …]
|
| H A D | bnode.c | 30 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
60 struct hfs_btree *tree; in hfs_bnode_read_key() local
63 tree = node->tree; in hfs_bnode_read_key()
65 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
68 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
154 off = node->tree->node_size - 2; in hfs_bnode_dump()
161 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
164 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
185 tree = node->tree; in hfs_bnode_unlink()
[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 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 …]
|
| /openbmc/u-boot/test/py/tests/ |
| H A D | test_bind.py | 31 tree = u_boot_console.run_command('dm tree')
32 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
33 assert in_tree(tree, 'bind-test-child1', 'phy', 'phy_sandbox', 1, False)
34 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, True)
39 tree = u_boot_console.run_command('dm tree')
40 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
41 assert 'bind-test-child1' not in tree
42 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, True)
47 tree = u_boot_console.run_command('dm tree')
48 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
[all …]
|
| /openbmc/linux/fs/hfsplus/ |
| H A 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 …]
|
| 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()
74 if (!tree->root) in hfs_brec_insert()
[all …]
|
| H A D | bnode.c | 59 struct hfs_btree *tree; in hfs_bnode_read_key() local
62 tree = node->tree; in hfs_bnode_read_key()
64 tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_read_key()
65 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_read_key()
68 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
303 off = node->tree->node_size - 2; in hfs_bnode_dump()
310 if (node->tree->attributes & HFS_TREE_VARIDXKEYS || in hfs_bnode_dump()
311 node->tree->cnid == HFSPLUS_ATTR_CNID) in hfs_bnode_dump()
314 tmp = node->tree->max_key_len + 2; in hfs_bnode_dump()
330 struct hfs_btree *tree; in hfs_bnode_unlink() 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 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->tree_lock); in hfs_find_exit()
40 fd->tree = NULL; in hfs_find_exit()
[all …]
|
| /openbmc/qemu/tests/unit/ |
| H A D | test-qtree.c | 94 QTree *tree; in test_tree_search() local
99 tree = q_tree_new_with_data(my_compare_with_data, GINT_TO_POINTER(123)); in test_tree_search()
102 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_search()
105 q_tree_foreach(tree, my_traverse, NULL); in test_tree_search()
107 g_assert(q_tree_nnodes(tree) == strlen(chars)); in test_tree_search()
108 g_assert(q_tree_height(tree) == 6); in test_tree_search()
111 q_tree_foreach(tree, check_order, &p); in test_tree_search()
114 removed = q_tree_remove(tree, &chars[i + 10]); in test_tree_search()
119 removed = q_tree_remove(tree, &c); in test_tree_search()
122 q_tree_foreach(tree, my_traverse, NULL); in test_tree_search()
[all …]
|
| /openbmc/qemu/util/ |
| H A D | qtree.c | 99 static QTreeNode *q_tree_insert_internal(QTree *tree,
103 static gboolean q_tree_remove_internal(QTree *tree,
107 static QTreeNode *q_tree_find_node(QTree *tree,
199 QTree *tree; in q_tree_new_full() local
203 tree = g_new(QTree, 1); in q_tree_new_full()
204 tree->root = NULL; in q_tree_new_full()
205 tree->key_compare = key_compare_func; in q_tree_new_full()
206 tree->key_destroy_func = key_destroy_func; in q_tree_new_full()
207 tree->value_destroy_func = value_destroy_func; in q_tree_new_full()
208 tree->key_compare_data = key_compare_data; in q_tree_new_full()
[all …]
|
| H A D | iova-tree.c | 16 GTree *tree; member
79 iova_tree->tree = g_tree_new_full(iova_tree_compare, NULL, g_free, NULL); in iova_tree_new()
84 const DMAMap *iova_tree_find(const IOVATree *tree, const DMAMap *map) in iova_tree_find() argument
86 return g_tree_lookup(tree->tree, map); in iova_tree_find()
108 const DMAMap *iova_tree_find_iova(const IOVATree *tree, const DMAMap *map) in iova_tree_find_iova() argument
114 g_tree_foreach(tree->tree, iova_tree_find_address_iterator, &args); in iova_tree_find_iova()
124 int iova_tree_insert(IOVATree *tree, const DMAMap *map) in iova_tree_insert() argument
133 if (iova_tree_find(tree, map)) { in iova_tree_insert()
139 iova_tree_insert_internal(tree->tree, new); in iova_tree_insert()
144 void iova_tree_remove(IOVATree *tree, DMAMap map) in iova_tree_remove() argument
[all …]
|
| /openbmc/qemu/include/qemu/ |
| H A D | qtree.h | 65 QTree *q_tree_ref(QTree *tree);
66 void q_tree_unref(QTree *tree);
67 void q_tree_destroy(QTree *tree);
68 void q_tree_insert(QTree *tree,
71 void q_tree_replace(QTree *tree,
74 gboolean q_tree_remove(QTree *tree,
76 gboolean q_tree_steal(QTree *tree,
78 gpointer q_tree_lookup(QTree *tree,
80 gboolean q_tree_lookup_extended(QTree *tree,
84 void q_tree_foreach(QTree *tree,
[all …]
|
| /openbmc/linux/kernel/ |
| H A D | audit_tree.c | 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->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 …]
|
| /openbmc/linux/fs/btrfs/ |
| H A D | extent-io-tree.c | 55 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
56 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
58 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range() argument
61 struct btrfs_inode *inode = tree->inode; in __btrfs_debug_check_extent_io_range()
97 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init() argument
99 tree->fs_info = fs_info; in extent_io_tree_init()
100 tree->state = RB_ROOT; in extent_io_tree_init()
101 spin_lock_init(&tree->lock); in extent_io_tree_init()
102 tree->inode = NULL; in extent_io_tree_init()
103 tree->owner = owner; in extent_io_tree_init()
[all …]
|
| H A D | extent-io-tree.h | 116 struct extent_io_tree *tree, unsigned int owner);
117 void extent_io_tree_release(struct extent_io_tree *tree);
119 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
122 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
128 u64 count_range_bits(struct extent_io_tree *tree,
134 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
136 int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
138 int __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
142 static inline int clear_extent_bit(struct extent_io_tree *tree, u64 start, in clear_extent_bit() argument
146 return __clear_extent_bit(tree, start, end, bits, cached, NULL); in clear_extent_bit()
[all …]
|
| H A D | ordered-data.c | 127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
130 struct rb_root *root = &tree->tree; in tree_search()
135 if (tree->last) { in tree_search()
136 entry = rb_entry(tree->last, struct btrfs_ordered_extent, in tree_search()
139 return tree->last; in tree_search()
145 tree->last = ret; in tree_search()
212 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in insert_ordered_extent() local
225 spin_lock_irq(&tree->lock); in insert_ordered_extent()
226 node = tree_insert(&tree->tree, entry->file_offset, &entry->rb_node); in insert_ordered_extent()
231 spin_unlock_irq(&tree->lock); in insert_ordered_extent()
[all …]
|
| /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() argument
48 return g_tree_insert_node(tree.t, key, range); in page_range_tree_insert_new()
51 void hvb_page_range_tree_insert(PageRangeTree tree, in hvb_page_range_tree_insert() argument
65 node = g_tree_upper_bound(tree.t, &start); in hvb_page_range_tree_insert()
69 node = g_tree_node_last(tree.t); in hvb_page_range_tree_insert()
88 node = page_range_tree_insert_new(tree, start, count); in hvb_page_range_tree_insert()
132 g_tree_remove(tree.t, &start); in hvb_page_range_tree_insert()
136 bool hvb_page_range_tree_pop(PageRangeTree tree, PageRange *out, in hvb_page_range_tree_pop() argument
142 node = g_tree_node_last(tree.t); in hvb_page_range_tree_pop()
160 g_tree_remove(tree.t, &out->start); in hvb_page_range_tree_pop()
[all …]
|
| /openbmc/linux/fs/unicode/ |
| H A 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 …]
|
| /openbmc/qemu/tests/bench/ |
| H A D | qtree-bench.c | 86 void *tree; in init_empty_tree_and_keys() local
89 tree = g_tree_new(compare_func); in init_empty_tree_and_keys()
92 tree = q_tree_new(compare_func); in init_empty_tree_and_keys()
98 *ret_tree = tree; in init_empty_tree_and_keys()
107 static inline void remove_all(void *tree, enum impl_type impl) in remove_all() argument
111 g_tree_destroy(tree); in remove_all()
114 q_tree_destroy(tree); in remove_all()
125 void *tree; in run_benchmark() local
128 init_empty_tree_and_keys(impl, &tree, &keys, n_elems); in run_benchmark()
133 g_tree_insert(tree, &keys[i], &keys[i]); in run_benchmark()
[all …]
|
| /openbmc/qemu/hw/virtio/ |
| H A D | vhost-iova-tree.c | 40 VhostIOVATree *tree = g_new(VhostIOVATree, 1); in vhost_iova_tree_new() local
43 tree->iova_first = MAX(iova_first, iova_min_addr); in vhost_iova_tree_new()
44 tree->iova_last = iova_last; in vhost_iova_tree_new()
46 tree->iova_taddr_map = iova_tree_new(); in vhost_iova_tree_new()
47 return tree; in vhost_iova_tree_new()
67 const DMAMap *vhost_iova_tree_find_iova(const VhostIOVATree *tree, in vhost_iova_tree_find_iova() argument
70 return iova_tree_find_iova(tree->iova_taddr_map, map); in vhost_iova_tree_find_iova()
86 int vhost_iova_tree_map_alloc(VhostIOVATree *tree, DMAMap *map) in vhost_iova_tree_map_alloc() argument
89 hwaddr iova_first = tree->iova_first ?: qemu_real_host_page_size(); in vhost_iova_tree_map_alloc()
97 return iova_tree_alloc_map(tree->iova_taddr_map, map, iova_first, in vhost_iova_tree_map_alloc()
[all …]
|
| /openbmc/linux/sound/hda/ |
| H A 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 …]
|
| /openbmc/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 …]
|