Searched refs:phandle (Results 1 - 4 of 4) sorted by relevance
/system/libufdt/include/ |
H A D | ufdt_types.h | 67 uint32_t phandle; member in struct:phandle_table_entry
|
H A D | libufdt.h | 130 * Gets the phandle value of the node if it has. 132 * @return: phandle value of that node or 133 * 0 if *node is not FDT_NODE or there's no "phandle"/"linux,phandle" 183 * Gets the pointer to the ufdt_node in tree with phandle = phandle. 187 * NULL if no ufdt_node has phandle = phandle 191 struct ufdt_node *ufdt_get_node_by_phandle(struct ufdt *tree, uint32_t phandle);
|
/system/libufdt/ |
H A D | ufdt_overlay.c | 68 * Gets the max phandle of a given ufdt. 73 return sorted_table.data[sorted_table.len - 1].phandle; 79 * Tries to increase the phandle value of a node 80 * if the phandle exists. 85 char *prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "phandle", &len); 89 prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "linux,phandle", &len); 113 * In the overlay_tree, there are some references (phandle) 198 * @phandle is value for these locations. 201 int fixups_len, int phandle) { 205 val = cpu_to_fdt32(phandle); 200 ufdt_do_one_fixup(struct ufdt *tree, const char *fixups, int fixups_len, int phandle) argument 277 uint32_t phandle = ufdt_node_get_phandle(symbol_node); local [all...] |
H A D | ufdt_convert.c | 214 uint32_t phandle) { 223 uint32_t mid_phandle = tree->phandle_table.data[mid].phandle; 224 if (phandle < mid_phandle) 301 data[*cur].phandle = ph; 311 uint32_t ph_a = ((const struct phandle_table_entry *)pa)->phandle; 312 uint32_t ph_b = ((const struct phandle_table_entry *)pb)->phandle; 213 ufdt_get_node_by_phandle(struct ufdt *tree, uint32_t phandle) argument
|
Completed in 38 milliseconds