new_node
sym '=' sym { $$ = new_node(N_MODIFIER, 0, $1, $3, NULL); }|
DIRECTIVE { $$ = new_node(N_DIRECTIVE, 0, $1, NULL, NULL); };
name_prefix NAME { $$ = new_node(N_ENTRY, $1, NULL, $2, NULL); } |
name_prefix { $$ = new_node(N_ENTRY, $1, NULL, NULL, NULL); };
(l) = new_node(N_LIST, 0, NULL, NULL, NULL); \
sym ':' { $$ = new_node(N_LABEL, 0, $1, NULL, NULL); } |
sym '=' sym { $$ = new_node(N_MODIFIER, 0, $1, $3, NULL); } |
DIRECTIVE { $$ = new_node(N_DIRECTIVE, 0, $1, NULL, NULL); };
node_t *new_node(int, int, const void *, const void *, node_t *);
int node, new_node, len;
new_node = prom_firstchild(node);
if (new_node == 0)
node = new_node;
fdt_add_node(struct fdt_node *new_node)
if (node->n_order > new_node->n_order) {
TAILQ_INSERT_BEFORE(node, new_node, n_nodes);
TAILQ_INSERT_TAIL(&fdt_nodes, new_node, n_nodes);