HomeSort by relevance Sort by last modified time
    Searched refs:overlay_tree (Results 1 - 3 of 3) sorted by null

  /system/libufdt/
ufdt_overlay.c 113 * In the overlay_tree, there are some references (phandle)
116 * in the overlay_tree.
232 int ufdt_overlay_do_fixups(struct ufdt *main_tree, struct ufdt *overlay_tree) {
235 ufdt_get_node_by_path(overlay_tree, "/__fixups__");
287 if (ufdt_do_one_fixup(overlay_tree, fixups_paths, len, phandle) < 0) {
299 * Here is to overlay all fragments in the overlay_tree to the main_tree.
393 struct ufdt *overlay_tree,
401 for_each_node(it, overlay_tree->root) {
413 * Since the overlay_tree will be "merged" into the main_tree, some
422 * node in the overlay_tree. To achieve this, we simply increase each phandl
657 struct ufdt *overlay_tree = ufdt_from_fdt(overlay_fdtp, overlay_size, &pool); local
    [all...]
  /system/libufdt/include/
ufdt_overlay_internal.h 25 int ufdt_overlay_do_fixups(struct ufdt *main_tree, struct ufdt *overlay_tree);
  /system/libufdt/tests/libufdt_verify/
ufdt_test_overlay.cpp 256 struct ufdt * overlay_tree) {
257 return ufdt_node_compare(target_node, overlay_node, target_tree, overlay_tree);
264 struct ufdt *overlay_tree,
280 bool result = ufdt_verify_overlay_node(target_node, overlay_node, tree, overlay_tree);
295 struct ufdt *overlay_tree) {
298 for_each_node(it, overlay_tree->root) {
299 err = static_cast<enum overlay_result>(ufdt_verify_fragment(final_tree, overlay_tree,
344 int ufdt_resolve_duplicate_phandles(ufdt** overlay_tree, size_t overlay_count) {
347 ufdt_try_increase_phandle(overlay_tree[i], phandle_offset);
348 if (ufdt_overlay_do_local_fixups(overlay_tree[i], phandle_offset) < 0)
    [all...]

Completed in 82 milliseconds