| /scripts/dtc/ |
| D | checks.c | 49 typedef void (*tree_check_fn)(struct check *c, struct node *dt);
50 typedef void (*node_check_fn)(struct check *c, struct node *dt, struct node *node);
51 typedef void (*prop_check_fn)(struct check *c, struct node *dt,
52 struct node *node, struct property *prop);
114 static void check_nodes_props(struct check *c, struct node *dt, struct node *node) in check_nodes_props() argument
116 struct node *child; in check_nodes_props()
119 TRACE(c, "%s", node->fullpath); in check_nodes_props()
121 c->node_fn(c, dt, node); in check_nodes_props()
124 for_each_property(node, prop) { in check_nodes_props()
125 TRACE(c, "%s\t'%s'", node->fullpath, prop->name); in check_nodes_props()
[all …]
|
| D | livetree.c | 77 struct node *build_node(struct property *proplist, struct node *children) in build_node()
79 struct node *new = xmalloc(sizeof(*new)); in build_node()
80 struct node *child; in build_node()
94 struct node *name_node(struct node *node, char *name) in name_node() argument
96 assert(node->name == NULL); in name_node()
98 node->name = name; in name_node()
100 return node; in name_node()
103 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
106 struct node *new_child, *old_child; in merge_nodes()
170 struct node *chain_node(struct node *first, struct node *list) in chain_node()
[all …]
|
| D | dtc.h | 142 struct node { struct
145 struct node *children; argument
147 struct node *parent; argument
148 struct node *next_sibling; argument
174 struct node *build_node(struct property *proplist, struct node *children); argument
175 struct node *name_node(struct node *node, char *name);
176 struct node *chain_node(struct node *first, struct node *list);
177 struct node *merge_nodes(struct node *old_node, struct node *new_node);
179 void add_property(struct node *node, struct property *prop);
180 void add_child(struct node *parent, struct node *child);
[all …]
|
| D | dtc-parser.y | 51 struct node *node; member
52 struct node *nodelist;
78 %type <node> devicetree
79 %type <node> nodedef
80 %type <node> subnode
134 struct node *target = get_node_by_ref($1, $2);
|
| D | fstree.c | 26 static struct node *read_fstree(const char *dirname) in read_fstree()
31 struct node *tree; in read_fstree()
68 struct node *newchild; in read_fstree()
84 struct node *tree; in dt_from_fs()
|
| D | flattree.c | 258 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree()
263 struct node *child; in flatten_tree()
740 static struct node *unflatten_tree(struct inbuf *dtbuf, in unflatten_tree()
744 struct node *node; in unflatten_tree() local
748 node = build_node(NULL, NULL); in unflatten_tree()
753 node->name = nodename_from_path(parent_flatname, flatname); in unflatten_tree()
755 node->name = flatname; in unflatten_tree()
759 struct node *child; in unflatten_tree()
764 if (node->children) in unflatten_tree()
768 add_property(node, prop); in unflatten_tree()
[all …]
|
| D | dtc-parser.tab.h_shipped | 72 struct node *node;
73 struct node *nodelist;
|
| D | dtc-parser.tab.c_shipped | 144 struct node *node;
145 struct node *nodelist;
1407 the_boot_info = build_boot_info((yyvsp[(3) - (4)].re), (yyvsp[(4) - (4)].node),
1408 guess_boot_cpuid((yyvsp[(4) - (4)].node)));
1451 (yyval.node) = name_node((yyvsp[(2) - (2)].node), "");
1458 (yyval.node) = merge_nodes((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));
1465 struct node *target = get_node_by_ref((yyvsp[(1) - (3)].node), (yyvsp[(2) - (3)].labelref));
1468 merge_nodes(target, (yyvsp[(3) - (3)].node));
1471 (yyval.node) = (yyvsp[(1) - (3)].node);
1478 (yyval.node) = build_node((yyvsp[(2) - (5)].proplist), (yyvsp[(3) - (5)].nodelist));
[all …]
|
| D | dtc.c | 35 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths()
37 struct node *child; in fill_fullpaths()
|
| D | treesource.c | 234 static void write_tree_source_node(FILE *f, struct node *tree, int level) in write_tree_source_node()
237 struct node *child; in write_tree_source_node()
|
| /scripts/genksyms/ |
| D | genksyms.c | 336 void free_node(struct string_list *node) in free_node() argument
338 free(node->string); in free_node()
339 free(node); in free_node()
380 struct string_list *copy_node(struct string_list *node) in copy_node() argument
385 newnode->string = xstrdup(node->string); in copy_node()
386 newnode->tag = node->tag; in copy_node()
424 struct string_list node = { in read_node() local
431 if (node.string == buffer) in read_node()
435 if (node.string == buffer) in read_node()
440 if (node.string >= buffer + sizeof(buffer) - 1) { in read_node()
[all …]
|
| D | parse.y | 41 struct string_list *node = *p; in remove_node() local
42 *p = node->next; in remove_node()
43 free_node(node); in remove_node()
|
| D | parse.tab.c_shipped | 85 struct string_list *node = *p;
86 *p = node->next;
87 free_node(node);
|
| /scripts/kconfig/lxdialog/ |
| D | util.c | 563 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
572 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
575 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
577 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
583 item_cur->node.tag = tag; in item_set_tag()
587 item_cur->node.data = ptr; in item_set_data()
592 item_cur->node.selected = val; in item_set_selected()
605 return item_cur->node.data; in item_data()
610 return item_cur->node.tag; in item_tag()
646 return item_cur->node.str; in item_str()
[all …]
|
| D | dialog.h | 174 struct dialog_item node; member
|
| /scripts/kconfig/ |
| D | gconf.c | 76 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1186 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) in set_node() argument
1199 gtk_tree_store_set(tree, node, in set_node()
1225 GtkTreeIter *node = parents[indent]; in place_node() local
1227 gtk_tree_store_append(tree, node, parent); in place_node()
1228 set_node(node, menu, row); in place_node()
|