Home
last modified time | relevance | path

Searched refs:overlay_count (Results 1 – 3 of 3) sorted by relevance

/system/libufdt/tests/libufdt_verify/
Dufdt_test_overlay.cpp313 size_t overlay_count, in ufdt_overlay_combine_common_nodes() argument
323 for (size_t i = 0; i < overlay_count; i++) { in ufdt_overlay_combine_common_nodes()
344 int ufdt_resolve_duplicate_phandles(ufdt** overlay_tree, size_t overlay_count) { in ufdt_resolve_duplicate_phandles() argument
346 for (size_t i = 0; i < overlay_count; i++) { in ufdt_resolve_duplicate_phandles()
360 int ufdt_combine_all_overlays(struct ufdt** overlay_trees, size_t overlay_count, in ufdt_combine_all_overlays() argument
364 if (!overlay_trees || !overlay_count || !final_tree || !pool) { in ufdt_combine_all_overlays()
372 if (ufdt_resolve_duplicate_phandles(overlay_trees, overlay_count) < 0) { in ufdt_combine_all_overlays()
379 for (size_t i = 0; i < overlay_count; i++) { in ufdt_combine_all_overlays()
390 ufdt_overlay_combine_common_nodes(overlay_trees, overlay_count, final_tree, pool); in ufdt_combine_all_overlays()
399 for (size_t i = 1; i < overlay_count; i++) { in ufdt_combine_all_overlays()
[all …]
/system/libufdt/tests/src/
Dufdt_verify_overlay_app.cpp48 char** overlay_filenames, size_t overlay_count) { in verify_overlay_files() argument
50 void** overlay_buf_array = new void*[overlay_count]; in verify_overlay_files()
61 for (size_t i = 0; i < overlay_count; i++) { in verify_overlay_files()
76 result = ufdt_verify_dtbo(blob, final_size, overlay_buf_array, overlay_count); in verify_overlay_files()
84 for (size_t i = 0; i < overlay_count; i++) { in verify_overlay_files()
/system/libufdt/tests/libufdt_verify/include/
Dufdt_test_overlay.h36 void **overlay_array, size_t overlay_count);