Searched defs:overlay_count (Results 1 - 2 of 2) sorted by relevance
/system/libufdt/tests/src/ |
H A D | ufdt_verify_overlay_app.cpp | 48 char** overlay_filenames, size_t overlay_count) { 50 void** overlay_buf_array = new void*[overlay_count]; 61 for (size_t i = 0; i < overlay_count; i++) { 76 result = ufdt_verify_dtbo(blob, final_size, overlay_buf_array, overlay_count); 84 for (size_t i = 0; i < overlay_count; i++) { 47 verify_overlay_files(const char *final_filename, char** overlay_filenames, size_t overlay_count) argument
|
/system/libufdt/tests/libufdt_verify/ |
H A D | ufdt_test_overlay.cpp | 313 size_t overlay_count, 323 for (size_t i = 0; i < overlay_count; i++) { 344 int ufdt_resolve_duplicate_phandles(ufdt** overlay_tree, size_t overlay_count) { argument 346 for (size_t i = 0; i < overlay_count; i++) { 360 int ufdt_combine_all_overlays(struct ufdt** overlay_trees, size_t overlay_count, argument 364 if (!overlay_trees || !overlay_count || !final_tree || !pool) { 372 if (ufdt_resolve_duplicate_phandles(overlay_trees, overlay_count) < 0) { 379 for (size_t i = 0; i < overlay_count; i++) { 390 ufdt_overlay_combine_common_nodes(overlay_trees, overlay_count, final_tree, pool); 399 for (size_t i = 1; i < overlay_count; 312 ufdt_overlay_combine_common_nodes(struct ufdt** overlay_trees, size_t overlay_count, struct ufdt* final_tree, struct ufdt_node_pool* pool ) argument 416 ufdt_verify_dtbo(struct fdt_header* final_fdt_header, size_t final_fdt_size, void** overlay_arr, size_t overlay_count) argument [all...] |
Completed in 87 milliseconds