Home
last modified time | relevance | path

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

/system/libufdt/include/
Dufdt_types.h29 if (tag_of(node) == FDT_BEGIN_NODE) \
34 for_each_child(it, node) if (tag_of(*it) == FDT_PROP)
37 for_each_child(it, node) if (tag_of(*it) == FDT_BEGIN_NODE)
46 ((tag_of(node) == FDT_BEGIN_NODE) \
92 static uint32_t tag_of(const struct ufdt_node *node) { in tag_of() function
/system/libufdt/
Dufdt_node.c61 if (tag_of(node) == FDT_BEGIN_NODE) { in ufdt_node_destruct()
73 if (tag_of(parent) != FDT_BEGIN_NODE) return -1; in ufdt_node_add_child()
76 uint32_t child_tag = tag_of(child); in ufdt_node_add_child()
129 if (!node || tag_of(node) != FDT_PROP) { in ufdt_node_get_fdt_prop_data()
161 if (!node || tag_of(node) != FDT_BEGIN_NODE) { in ufdt_node_get_phandle()
219 tag = tag_of(node); in ufdt_node_print()
239 if (tag_of(node) == FDT_BEGIN_NODE) { in ufdt_node_print()
253 if (tag_of(node) == FDT_BEGIN_NODE) { in ufdt_node_map()
Dufdt_convert.c243 if (tag_of(cur_node) == FDT_BEGIN_NODE) { in merge_children()
269 if (tag_of(node_a) == FDT_PROP) { in merge_ufdt_into()
287 if (tag_of(node) != FDT_BEGIN_NODE) return 0; in count_phandle_node()
298 if (node == NULL || tag_of(node) != FDT_BEGIN_NODE) return; in set_phandle_table_entry()
403 uint32_t tag = tag_of(node); in _ufdt_output_node_to_fdt()