| /system/libufdt/include/ |
| H A D | ufdt_node_pool.h | 30 void ufdt_node_pool_construct(struct ufdt_node_pool *pool);
31 void ufdt_node_pool_destruct(struct ufdt_node_pool *pool);
33 void *ufdt_node_pool_alloc(struct ufdt_node_pool *pool);
34 void ufdt_node_pool_free(struct ufdt_node_pool *pool, void *node);
|
| H A D | libufdt.h | 37 struct ufdt_node_pool *pool);
42 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool);
156 struct ufdt *ufdt_construct(void *fdtp, struct ufdt_node_pool *pool);
162 void ufdt_destruct(struct ufdt *tree, struct ufdt_node_pool *pool);
270 struct ufdt_node_pool *pool);
289 struct ufdt_node_pool *pool);
|
| /system/libufdt/ |
| H A D | ufdt_node_pool.c | 40 * pool block block
66 void ufdt_node_pool_construct(struct ufdt_node_pool *pool) { argument
67 pool->first_block = NULL;
68 pool->last_block_ptr = &pool->first_block;
71 void ufdt_node_pool_destruct(struct ufdt_node_pool *pool) { argument
73 struct ufdt_node_pool_block_header *block = pool->first_block;
86 pool->first_block = NULL;
87 pool->last_block_ptr = NULL;
144 struct ufdt_node_pool *pool, struc
143 _ufdt_node_pool_preppend_block( struct ufdt_node_pool *pool, struct ufdt_node_pool_block_header *block) argument
154 _ufdt_node_pool_append_block( struct ufdt_node_pool *pool, struct ufdt_node_pool_block_header *block) argument
162 _ufdt_node_pool_remove_block( struct ufdt_node_pool *pool, struct ufdt_node_pool_block_header **block_ptr) argument
176 ufdt_node_pool_alloc(struct ufdt_node_pool *pool) argument
200 _ufdt_node_pool_search_block( struct ufdt_node_pool *pool, void *node) argument
218 ufdt_node_pool_free(struct ufdt_node_pool *pool, void *node) argument
[all...] |
| H A D | ufdt_overlay.c | 317 struct ufdt_node_pool *pool) {
318 return ufdt_node_merge_into(target_node, overlay_node, pool);
362 struct ufdt_node_pool *pool) {
378 int err = ufdt_overlay_node(target_node, overlay_node, pool);
394 struct ufdt_node_pool *pool) {
402 err = ufdt_apply_fragment(main_tree, *it, pool);
565 struct ufdt_node_pool *pool) {
586 if (ufdt_overlay_apply_fragments(main_tree, overlay_tree, pool) < 0) {
654 struct ufdt_node_pool pool; local
655 ufdt_node_pool_construct(&pool);
315 ufdt_overlay_node(struct ufdt_node *target_node, struct ufdt_node *overlay_node, struct ufdt_node_pool *pool) argument
360 ufdt_apply_fragment(struct ufdt *tree, struct ufdt_node *frag_node, struct ufdt_node_pool *pool) argument
392 ufdt_overlay_apply_fragments(struct ufdt *main_tree, struct ufdt *overlay_tree, struct ufdt_node_pool *pool) argument
563 ufdt_overlay_apply(struct ufdt *main_tree, struct ufdt *overlay_tree, size_t overlay_length, struct ufdt_node_pool *pool) argument
[all...] |
| H A D | ufdt_node.c | 22 struct ufdt_node_pool *pool) {
23 void *buf = ufdt_node_pool_alloc(pool);
44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { argument
51 ufdt_node_destruct(it, pool);
56 ufdt_node_pool_free(pool, node);
206 struct ufdt_node_pool *pool) {
224 err = ufdt_node_merge_into(target_node, cur_node, pool);
225 ufdt_node_pool_free(pool, cur_node);
242 struct ufdt_node_pool *pool) {
249 err = merge_children(node_a, node_b, pool);
21 ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr, struct ufdt_node_pool *pool) argument
205 merge_children(struct ufdt_node *node_a, struct ufdt_node *node_b, struct ufdt_node_pool *pool) argument
241 ufdt_node_merge_into(struct ufdt_node *node_a, struct ufdt_node *node_b, struct ufdt_node_pool *pool) argument
[all...] |
| H A D | ufdt_convert.c | 22 struct ufdt *ufdt_construct(void *fdtp, struct ufdt_node_pool *pool) { argument
23 (void)(pool); /* unused parameter */
53 void ufdt_destruct(struct ufdt *tree, struct ufdt_node_pool *pool) { argument
56 ufdt_node_destruct(tree->root, pool);
112 struct ufdt_node_pool *pool) {
120 struct ufdt_node *res = ufdt_node_construct(fdtp, fdt_tag_ptr, pool);
126 struct ufdt_node_pool *pool) {
144 res = ufdt_new_node(fdtp, cur_fdt_tag_offset, pool);
148 res = ufdt_new_node(fdtp, cur_fdt_tag_offset, pool);
154 next_fdt_tag_offset, tag, pool);
111 ufdt_new_node(void *fdtp, int node_offset, struct ufdt_node_pool *pool) argument
124 fdt_to_ufdt_tree(void *fdtp, int cur_fdt_tag_offset, int *next_fdt_tag_offset, int cur_tag, struct ufdt_node_pool *pool) argument
286 ufdt_from_fdt(void *fdtp, size_t fdt_size, struct ufdt_node_pool *pool) argument
[all...] |
| /system/libufdt/tests/libufdt_verify/ |
| H A D | ufdt_test_overlay.cpp | 233 struct ufdt_node_pool* pool) {
238 combine_overlay_node(path_node_map, path + "/" + ufdt_node_name(*it), *it, pool);
243 ufdt_node_merge_into((*path_node_map)[path], node, pool);
315 struct ufdt_node_pool* pool
333 combine_overlay_node(&path_node_map, path, overlay_node, pool);
361 struct ufdt* final_tree, struct ufdt_node_pool* pool) {
364 if (!overlay_trees || !overlay_count || !final_tree || !pool) {
390 ufdt_overlay_combine_common_nodes(overlay_trees, overlay_count, final_tree, pool);
420 struct ufdt_node_pool pool; local
434 ufdt_node_pool_construct(&pool);
229 combine_overlay_node(std::unordered_map<std::string, struct ufdt_node*>* path_node_map, std::string path, struct ufdt_node* node, struct ufdt_node_pool* pool) argument
360 ufdt_combine_all_overlays(struct ufdt** overlay_trees, size_t overlay_count, struct ufdt* final_tree, struct ufdt_node_pool* pool) argument
[all...] |
| /system/extras/perfprofd/scripts/ |
| H A D | perf_proto_stack.py | 469 pool = ThreadPool(args.parallel)
471 result = pool.map(run_cmd, map_args)
472 pool.close()
473 pool.join()
|