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

  /system/libufdt/include/
libufdt.h 24 * BEGIN of ufdt_node methods
28 * Allocates spaces for new ufdt_node who represents a fdt node at fdt_tag_ptr.
33 * @return: a pointer to the newly created ufdt_node or
36 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr,
42 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool);
54 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child);
66 struct ufdt_node *ufdt_node_get_property_by_name_len(
67 const struct ufdt_node *node, const char *name, int len);
68 struct ufdt_node *ufdt_node_get_property_by_name(const struct ufdt_node *node
    [all...]
ufdt_types.h 22 /* it has type : struct ufdt_node** */
53 struct ufdt_node { struct
55 struct ufdt_node *sibling;
59 struct ufdt_node parent;
64 struct ufdt_node parent;
65 struct ufdt_node *child;
66 struct ufdt_node **last_child_p;
71 struct ufdt_node *node;
84 struct ufdt_node *root;
ufdt_overlay_internal.h 38 struct ufdt_node *frag_node,
39 struct ufdt_node **target_node);
  /system/libufdt/
ufdt_node.c 21 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr,
32 return (struct ufdt_node *)res;
40 return (struct ufdt_node *)res;
44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) {
48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child;
50 struct ufdt_node *next = it->sibling;
59 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child) {
85 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node
    [all...]
ufdt_overlay.c 82 static void ufdt_node_try_increase_phandle(struct ufdt_node *node,
104 struct ufdt_node *target_node = sorted_table.data[i].node;
170 struct ufdt_node *target_node;
234 struct ufdt_node *overlay_fixups_node =
241 struct ufdt_node *main_symbols_node =
244 struct ufdt_node **it;
265 struct ufdt_node *fixups = *it;
275 struct ufdt_node *symbol_node;
315 static int ufdt_overlay_node(struct ufdt_node *target_node,
316 struct ufdt_node *overlay_node
    [all...]
ufdt_convert.c 111 static struct ufdt_node *ufdt_new_node(void *fdtp, int node_offset,
120 struct ufdt_node *res = ufdt_node_construct(fdtp, fdt_tag_ptr, pool);
124 static struct ufdt_node *fdt_to_ufdt_tree(void *fdtp, int cur_fdt_tag_offset,
131 struct ufdt_node *res, *child_node;
170 struct ufdt_node *ufdt_get_node_by_path_len(struct ufdt *tree, const char *path,
190 struct ufdt_node *aliases_node =
204 struct ufdt_node *target_node =
213 struct ufdt_node *ufdt_get_node_by_path(struct ufdt *tree, const char *path) {
217 struct ufdt_node *ufdt_get_node_by_phandle(struct ufdt *tree,
219 struct ufdt_node *res = NULL
    [all...]
  /system/libufdt/tests/libufdt_verify/
ufdt_test_overlay.cpp 31 static bool ufdt_node_compare(struct ufdt_node *node_a, struct ufdt_node *node_b,
38 static bool compare_child_nodes(struct ufdt_node *node_a, struct ufdt_node *node_b,
41 struct ufdt_node *it;
44 struct ufdt_node *cur_node = it;
45 struct ufdt_node *target_node = NULL;
73 static bool ufdt_compare_property(struct ufdt_node* node_final, struct ufdt_node* node_overlay,
103 struct ufdt_node * target_node_a = ufdt_get_node_by_phandle(tree_final
    [all...]

Completed in 563 milliseconds