| /system/libufdt/ |
| D | ufdt_node_pool.c | 66 void ufdt_node_pool_construct(struct ufdt_node_pool *pool) { in ufdt_node_pool_construct() argument
67 pool->first_block = NULL; in ufdt_node_pool_construct()
68 pool->last_block_ptr = &pool->first_block; in ufdt_node_pool_construct()
71 void ufdt_node_pool_destruct(struct ufdt_node_pool *pool) { in ufdt_node_pool_destruct() argument
73 struct ufdt_node_pool_block_header *block = pool->first_block; in ufdt_node_pool_destruct()
86 pool->first_block = NULL; in ufdt_node_pool_destruct()
87 pool->last_block_ptr = NULL; in ufdt_node_pool_destruct()
144 struct ufdt_node_pool *pool, struct ufdt_node_pool_block_header *block) { in _ufdt_node_pool_preppend_block() argument
145 struct ufdt_node_pool_block_header *origin_first_block = pool->first_block; in _ufdt_node_pool_preppend_block()
148 pool->first_block = block; in _ufdt_node_pool_preppend_block()
[all …]
|
| D | ufdt_overlay.c | 317 struct ufdt_node_pool *pool) { in ufdt_overlay_node() argument
318 return ufdt_node_merge_into(target_node, overlay_node, pool); in ufdt_overlay_node()
362 struct ufdt_node_pool *pool) { in ufdt_apply_fragment() argument
378 int err = ufdt_overlay_node(target_node, overlay_node, pool); in ufdt_apply_fragment()
394 struct ufdt_node_pool *pool) { in ufdt_overlay_apply_fragments() argument
402 err = ufdt_apply_fragment(main_tree, *it, pool); in ufdt_overlay_apply_fragments()
565 struct ufdt_node_pool *pool) { in ufdt_overlay_apply() argument
586 if (ufdt_overlay_apply_fragments(main_tree, overlay_tree, pool) < 0) { in ufdt_overlay_apply()
654 struct ufdt_node_pool pool; in ufdt_apply_overlay() local
655 ufdt_node_pool_construct(&pool); in ufdt_apply_overlay()
[all …]
|
| D | ufdt_node.c | 22 struct ufdt_node_pool *pool) { in ufdt_node_construct() argument
23 void *buf = ufdt_node_pool_alloc(pool); in ufdt_node_construct()
44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { in ufdt_node_destruct() argument
51 ufdt_node_destruct(it, pool); in ufdt_node_destruct()
56 ufdt_node_pool_free(pool, node); in ufdt_node_destruct()
206 struct ufdt_node_pool *pool) { in merge_children() argument
224 err = ufdt_node_merge_into(target_node, cur_node, pool); in merge_children()
225 ufdt_node_pool_free(pool, cur_node); in merge_children()
242 struct ufdt_node_pool *pool) { in ufdt_node_merge_into() argument
249 err = merge_children(node_a, node_b, pool); in ufdt_node_merge_into()
|
| D | ufdt_convert.c | 22 struct ufdt *ufdt_construct(void *fdtp, struct ufdt_node_pool *pool) { in ufdt_construct() argument
23 (void)(pool); /* unused parameter */ in ufdt_construct()
53 void ufdt_destruct(struct ufdt *tree, struct ufdt_node_pool *pool) { in ufdt_destruct() argument
56 ufdt_node_destruct(tree->root, pool); in ufdt_destruct()
112 struct ufdt_node_pool *pool) { in ufdt_new_node() argument
120 struct ufdt_node *res = ufdt_node_construct(fdtp, fdt_tag_ptr, pool); in ufdt_new_node()
126 struct ufdt_node_pool *pool) { in fdt_to_ufdt_tree() argument
144 res = ufdt_new_node(fdtp, cur_fdt_tag_offset, pool); in fdt_to_ufdt_tree()
148 res = ufdt_new_node(fdtp, cur_fdt_tag_offset, pool); in fdt_to_ufdt_tree()
154 next_fdt_tag_offset, tag, pool); in fdt_to_ufdt_tree()
[all …]
|
| /system/libufdt/include/ |
| 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);
|
| 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/tests/libufdt_verify/ |
| D | ufdt_test_overlay.cpp | 233 struct ufdt_node_pool* pool) { in combine_overlay_node() argument
238 combine_overlay_node(path_node_map, path + "/" + ufdt_node_name(*it), *it, pool); in combine_overlay_node()
243 ufdt_node_merge_into((*path_node_map)[path], node, pool); in combine_overlay_node()
315 struct ufdt_node_pool* pool in ufdt_overlay_combine_common_nodes() argument
333 combine_overlay_node(&path_node_map, path, overlay_node, pool); in ufdt_overlay_combine_common_nodes()
361 struct ufdt* final_tree, struct ufdt_node_pool* pool) { in ufdt_combine_all_overlays() argument
364 if (!overlay_trees || !overlay_count || !final_tree || !pool) { in ufdt_combine_all_overlays()
390 ufdt_overlay_combine_common_nodes(overlay_trees, overlay_count, final_tree, pool); in ufdt_combine_all_overlays()
420 struct ufdt_node_pool pool; in ufdt_verify_dtbo() local
440 ufdt_node_pool_construct(&pool); in ufdt_verify_dtbo()
[all …]
|
| /system/tools/aidl/tests/lazy_test/ |
| D | README | 36 to be a dynamic service). The server then joins the thread pool.
|
| /system/core/rootdir/ |
| D | init.rc | 122 # Mix device-specific information into the entropy pool
576 # Avoid predictable entropy pool. Carry over entropy from previous boot.
|
| /system/extras/ioblame/ |
| D | ioblame-gmail-run.example | 765 pool-3-thread-1 Reads: 4 KB
1265 PID: pool-3-thread-1
|
| /system/core/libprocinfo/testdata/ |
| D | maps | 571 …00 ---p 00000000 00:05 10270991 [anon:dalvik-Jit thread pool worker thread 0]
572 …00 ---p 00001000 00:05 10270991 [anon:dalvik-Jit thread pool worker thread 0]
573 …00 rw-p 00002000 00:05 10270991 [anon:dalvik-Jit thread pool worker thread 0]
|
| /system/memory/libmeminfo/testdata1/ |
| D | smaps | 23342 …51c000 ---p 00000000 00:00 0 [anon:dalvik-Jit thread pool worker thread 0]
23343 Name: [anon:dalvik-Jit thread pool worker thread 0]
23363 …51d000 ---p 00000000 00:00 0 [anon:dalvik-Jit thread pool worker thread 0]
23364 Name: [anon:dalvik-Jit thread pool worker thread 0]
23384 …61c000 rw-p 00000000 00:00 0 [anon:dalvik-Jit thread pool worker thread 0]
23385 Name: [anon:dalvik-Jit thread pool worker thread 0]
|