| /scripts/dtc/ |
| D | livetree.c | 100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
[all …]
|
| D | checks.c | 43 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
100 static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) in check_nodes_props() argument
102 struct node *child; in check_nodes_props()
104 TRACE(c, "%s", node->fullpath); in check_nodes_props()
106 c->fn(c, dti, node); in check_nodes_props()
108 for_each_child(node, child) in check_nodes_props()
114 struct node *dt = dti->dt; in run_check()
158 struct node *node) in check_always_fail() argument
165 struct node *node) in check_is_string() argument
170 prop = get_property(node, propname); in check_is_string()
[all …]
|
| D | dtc.h | 149 struct node { struct
153 struct node *children; argument
155 struct node *parent; argument
156 struct node *next_sibling; argument
196 struct node *build_node(struct property *proplist, struct node *children);
197 struct node *build_node_delete(void);
198 struct node *name_node(struct node *node, char *name);
199 struct node *chain_node(struct node *first, struct node *list);
200 struct node *merge_nodes(struct node *old_node, struct node *new_node);
202 void add_property(struct node *node, struct property *prop);
[all …]
|
| D | fdtput.c | 137 int node; in store_key_value() local
140 node = fdt_path_offset(blob, node_name); in store_key_value()
141 if (node < 0) { in store_key_value()
142 report_error(node_name, -1, node); in store_key_value()
146 err = fdt_setprop(blob, node, property, buf, len); in store_key_value()
168 int node, offset = 0; in create_paths() local
174 for (sep = path; *sep; path = sep + 1, offset = node) { in create_paths()
180 node = fdt_subnode_offset_namelen(blob, offset, path, in create_paths()
182 if (node == -FDT_ERR_NOTFOUND) { in create_paths()
183 node = fdt_add_subnode_namelen(blob, offset, path, in create_paths()
[all …]
|
| D | fdtget.c | 122 static int list_properties(const void *blob, int node) in list_properties() argument
128 prop = fdt_first_property_offset(blob, node); in list_properties()
150 static int list_subnodes(const void *blob, int node) in list_subnodes() argument
159 tag = fdt_next_tag(blob, node, &nextoffset); in list_subnodes()
162 pathp = fdt_get_name(blob, node, NULL); in list_subnodes()
191 node = nextoffset; in list_subnodes()
207 int node, const char *property) in show_data_for_item() argument
214 err = list_properties(blob, node); in show_data_for_item()
218 err = list_subnodes(blob, node); in show_data_for_item()
223 value = fdt_getprop(blob, node, property, &len); in show_data_for_item()
[all …]
|
| D | srcpos.c | 101 struct search_path *node; in fopen_any_on_path() local
111 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
112 fullname = try_open(node->dirname, fname, fp); in fopen_any_on_path()
185 struct search_path *node; in srcfile_add_search_path() local
188 node = xmalloc(sizeof(*node)); in srcfile_add_search_path()
189 node->next = NULL; in srcfile_add_search_path()
190 node->dirname = xstrdup(dirname); in srcfile_add_search_path()
194 *search_path_tail = node; in srcfile_add_search_path()
196 search_path_head = node; in srcfile_add_search_path()
197 search_path_tail = &node->next; in srcfile_add_search_path()
|
| D | dt_to_config | 332 my $node = $pn_arg_ref->{node};
445 my $node = $pn_arg_ref->{node};
457 print "$node";
734 my $node = shift;
742 return if (!$node or !$compatible);
746 return if ($node eq "/");
749 $pn_arg{node} = $node;
866 my $node = "";
888 &handle_compatible($full_node, $node, $compatible,
897 $node = $line;
[all …]
|
| 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 | dtc-parser.y | 52 struct node *node; member
53 struct node *nodelist;
86 %type <node> devicetree
87 %type <node> nodedef
88 %type <node> subnode
172 struct node *target = get_node_by_ref($1, $3);
183 struct node *target = get_node_by_ref($1, $2);
193 struct node *target = get_node_by_ref($1, $3);
|
| D | flattree.c | 258 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree()
263 struct node *child; in flatten_tree()
752 static struct node *unflatten_tree(struct inbuf *dtbuf, in unflatten_tree()
756 struct node *node; in unflatten_tree() local
760 node = build_node(NULL, NULL); in unflatten_tree()
765 node->name = nodename_from_path(parent_flatname, flatname); in unflatten_tree()
767 node->name = flatname; in unflatten_tree()
771 struct node *child; in unflatten_tree()
776 if (node->children) in unflatten_tree()
780 add_property(node, prop); in unflatten_tree()
[all …]
|
| D | dtc-parser.tab.h_shipped | 92 struct node *node;
93 struct node *nodelist;
|
| D | dtc-parser.tab.c_shipped | 163 struct node *node;
164 struct node *nodelist;
1474 parser_output = build_dt_info((yyvsp[-2].flags), (yyvsp[-1].re), (yyvsp[0].node),
1475 guess_boot_cpuid((yyvsp[0].node)));
1542 (yyval.node) = name_node((yyvsp[0].node), "");
1550 (yyval.node) = merge_nodes((yyvsp[-2].node), (yyvsp[0].node));
1558 struct node *target = get_node_by_ref((yyvsp[-3].node), (yyvsp[-1].labelref));
1562 merge_nodes(target, (yyvsp[0].node));
1565 (yyval.node) = (yyvsp[-3].node);
1573 struct node *target = get_node_by_ref((yyvsp[-2].node), (yyvsp[-1].labelref));
[all …]
|
| D | dtc.c | 44 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths()
46 struct node *child; in fill_fullpaths()
|
| D | treesource.c | 236 static void write_tree_source_node(FILE *f, struct node *tree, int level) in write_tree_source_node()
239 struct node *child; in write_tree_source_node()
|
| D | dtc-lexer.lex.c_shipped | 1051 DPRINT("Keyword: /delete-node/\n");
|
| /scripts/genksyms/ |
| D | genksyms.c | 335 void free_node(struct string_list *node) in free_node() argument
337 free(node->string); in free_node()
338 free(node); in free_node()
379 struct string_list *copy_node(struct string_list *node) in copy_node() argument
384 newnode->string = xstrdup(node->string); in copy_node()
385 newnode->tag = node->tag; in copy_node()
423 struct string_list node = { in read_node() local
430 if (node.string == buffer) in read_node()
436 if (node.string == buffer) in read_node()
441 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 | 83 struct string_list *node = *p;
84 *p = node->next;
85 free_node(node);
|
| /scripts/kconfig/lxdialog/ |
| D | util.c | 619 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
628 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
631 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
633 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
639 item_cur->node.tag = tag; in item_set_tag()
643 item_cur->node.data = ptr; in item_set_data()
648 item_cur->node.selected = val; in item_set_selected()
661 return item_cur->node.data; in item_data()
666 return item_cur->node.tag; in item_tag()
702 return item_cur->node.str; in item_str()
[all …]
|
| D | dialog.h | 181 struct dialog_item node; member
|
| /scripts/dtc/libfdt/ |
| D | libfdt.h | 205 #define fdt_for_each_subnode(node, fdt, parent) \ argument
206 for (node = fdt_first_subnode(fdt, parent); \
207 node >= 0; \
208 node = fdt_next_subnode(fdt, node))
509 #define fdt_for_each_property_offset(property, fdt, node) \ argument
510 for (property = fdt_first_property_offset(fdt, node); \
|
| /scripts/coccinelle/iterators/ |
| D | device_node_continue.cocci | 1 /// Device node iterators put the previous value of the index variable, so an
|
| /scripts/kconfig/ |
| D | gconf.c | 76 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1162 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) in set_node() argument
1175 gtk_tree_store_set(tree, node, in set_node()
1201 GtkTreeIter *node = parents[indent]; in place_node() local
1203 gtk_tree_store_append(tree, node, parent); in place_node()
1204 set_node(node, menu, row); in place_node()
|
| /scripts/ |
| D | analyze_suspend.py | 111 self.hostname = platform.node()
540 node = DeviceNode(name, depth)
544 node.children.append(cnode)
545 return node
546 def printTopology(self, node): argument
548 if node.name:
553 if node.name in list:
554 s = list[node.name]['start']
555 e = list[node.name]['end']
556 if list[node.name]['drv']:
[all …]
|