Searched refs:phandle (Results 1 – 7 of 7) sorted by relevance
218 uint32_t phandle) { in ufdt_get_node_by_phandle() argument227 uint32_t mid_phandle = tree->phandle_table.data[mid].phandle; in ufdt_get_node_by_phandle()228 if (phandle < mid_phandle) in ufdt_get_node_by_phandle()233 if (e - s > 0 && tree->phandle_table.data[s].phandle == phandle) { in ufdt_get_node_by_phandle()255 data[*cur].phandle = ph; in set_phandle_table_entry()265 uint32_t ph_a = ((const struct ufdt_phandle_table_entry *)pa)->phandle; in phandle_table_entry_cmp()266 uint32_t ph_b = ((const struct ufdt_phandle_table_entry *)pb)->phandle; in phandle_table_entry_cmp()
73 return sorted_table.data[sorted_table.len - 1].phandle; in ufdt_get_max_phandle()207 int phandle) { in ufdt_do_one_fixup() argument211 val = cpu_to_fdt32(phandle); in ufdt_do_one_fixup()283 uint32_t phandle = ufdt_node_get_phandle(symbol_node); in ufdt_overlay_do_fixups() local287 if (ufdt_do_one_fixup(overlay_tree, fixups_paths, len, phandle) < 0) { in ufdt_overlay_do_fixups()
7 phandle = <0x04>;
24 int phandle);
70 uint32_t phandle; member
192 struct ufdt_node *ufdt_get_node_by_phandle(struct ufdt *tree, uint32_t phandle);
220 uint32_t phandle = ufdt_node_get_phandle(symbol_node); in create_path_phandle_map() local221 (*phandle_path_map)[phandle] = std::string(symbol_path); in create_path_phandle_map()