Home
last modified time | relevance | path

Searched refs:node (Results 1 – 17 of 17) sorted by relevance

/scripts/dtc/
A Dlivetree.c128 struct node *name_node(struct node *node, char *name) in name_node() argument
137 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
144 struct node *reference_node(struct node *node) in reference_node() argument
236 struct node *node; in add_orphan_node() local
325 node = node->next_sibling; in delete_node_by_name()
542 struct node *child, *node; in get_node_by_label() local
814 struct node *node; in build_and_name_child_node() local
852 struct node *an, struct node *node, in generate_label_tree_internal() argument
935 struct node *node) in generate_fixups_tree_internal() argument
979 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
A Dchecks.c76 struct node *node, in check_msg() argument
172 struct node *node) in check_always_fail() argument
179 struct node *node) in check_is_string() argument
197 struct node *node) in check_is_string_list() argument
226 struct node *node) in check_is_cell() argument
284 struct node *node) in check_node_name_chars() argument
295 struct node *node) in check_node_name_chars_strict() argument
306 struct node *node) in check_node_name_format() argument
526 struct node *node) in check_name_properties() argument
737 struct node *node) in check_ranges_format() argument
[all …]
A Ddtc.h204 struct node *name_node(struct node *node, char *name);
205 struct node *omit_node_if_unused(struct node *node);
206 struct node *reference_node(struct node *node);
207 struct node *chain_node(struct node *first, struct node *list);
208 struct node *merge_nodes(struct node *old_node, struct node *new_node);
216 void delete_node(struct node *node);
217 void append_to_property(struct node *node,
220 const char *get_unitname(struct node *node);
225 struct node **node);
228 struct node *get_subnode(struct node *node, const char *nodename);
[all …]
A Dsrcpos.c99 struct search_path *node; in fopen_any_on_path() local
109 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
110 fullname = try_open(node->dirname, fname, fp); in fopen_any_on_path()
183 struct search_path *node; in srcfile_add_search_path() local
186 node = xmalloc(sizeof(*node)); in srcfile_add_search_path()
187 node->next = NULL; in srcfile_add_search_path()
188 node->dirname = xstrdup(dirname); in srcfile_add_search_path()
192 *search_path_tail = node; in srcfile_add_search_path()
194 search_path_head = node; in srcfile_add_search_path()
195 search_path_tail = &node->next; in srcfile_add_search_path()
A Dfstree.c26 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()
A Ddtc-parser.y58 struct node *node; member
59 struct node *nodelist;
93 %type <node> devicetree
94 %type <node> nodedef
95 %type <node> subnode
191 struct node *target = get_node_by_ref($1, $3);
215 struct node *target = get_node_by_ref($1, $2);
226 struct node *target = get_node_by_ref($1, $3);
238 struct node *target = get_node_by_ref($1, $3);
A Dflattree.c255 struct node *child; in flatten_tree()
747 struct node *node; in unflatten_tree() local
751 node = build_node(NULL, NULL); in unflatten_tree()
758 node->name = flatname; in unflatten_tree()
762 struct node *child; in unflatten_tree()
767 if (node->children) in unflatten_tree()
771 add_property(node, prop); in unflatten_tree()
776 add_child(node, child); in unflatten_tree()
800 if (node->name != flatname) { in unflatten_tree()
804 return node; in unflatten_tree()
[all …]
A DREADME24 >>> node = fdt.path_offset('/subnode@1')
25 >>> print(node)
27 >>> prop_offset = fdt.first_property_offset(node)
A Ddtc.c44 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths()
46 struct node *child; in fill_fullpaths()
A Dtreesource.c236 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()
/scripts/dtc/pylibfdt/
A Dlibfdt.i_shipped313 The node offset of the found node, if any
325 path: Path to the required node, e.g. '/node@3/subnode@1'
337 """Get the name of a node
405 """Get a property from a node
427 """Get the phandle of a node
433 phandle of node, or 0 if the node has no phandle or another error
555 """Set the name of a node
679 """Delete a node
748 with sw.add_node('node'):
854 """Begin a new node
[all …]
/scripts/dtc/libfdt/
A Dfdt_overlay.c116 static int overlay_phandle_add_offset(void *fdt, int node, in overlay_phandle_add_offset() argument
123 val = fdt_getprop(fdt, node, name, &len); in overlay_phandle_add_offset()
138 return fdt_setprop_inplace_u32(fdt, node, name, adj_val); in overlay_phandle_add_offset()
156 static int overlay_adjust_node_phandles(void *fdto, int node, in overlay_adjust_node_phandles() argument
162 ret = overlay_phandle_add_offset(fdto, node, "phandle", delta); in overlay_adjust_node_phandles()
166 ret = overlay_phandle_add_offset(fdto, node, "linux,phandle", delta); in overlay_adjust_node_phandles()
170 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
558 void *fdto, int node) in overlay_apply_node() argument
563 fdt_for_each_property_offset(property, fdto, node) { in overlay_apply_node()
581 fdt_for_each_subnode(subnode, fdto, node) { in overlay_apply_node()
[all …]
A Dlibfdt.h195 #define fdt_for_each_subnode(node, fdt, parent) \ argument
196 for (node = fdt_first_subnode(fdt, parent); \
197 node >= 0; \
198 node = fdt_next_subnode(fdt, node))
575 #define fdt_for_each_property_offset(property, fdt, node) \ argument
576 for (property = fdt_first_property_offset(fdt, node); \
2038 int fdt_overlay_apply_node(void *fdt, int target, void *fdto, int node);
/scripts/kconfig/
A Dpreprocess.c38 struct list_head node; member
49 list_add_tail(&e->node, &env_list); in env_add()
54 list_del(&e->node); in env_del()
69 list_for_each_entry(e, &env_list, node) { in env_expand()
91 list_for_each_entry_safe(e, tmp, &env_list, node) { in env_write_dep()
233 struct list_head node; member
240 list_for_each_entry(v, &variable_list, node) { in variable_lookup()
300 list_add_tail(&v->node, &variable_list); in variable_add()
323 list_del(&v->node); in variable_del()
333 list_for_each_entry_safe(v, tmp, &variable_list, node) in variable_all_del()
A Dgconf.c76 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1129 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) in set_node() argument
1142 gtk_tree_store_set(tree, node, in set_node()
1167 GtkTreeIter *node = parents[indent]; in place_node() local
1169 gtk_tree_store_append(tree, node, parent); in place_node()
1170 set_node(node, menu, row); in place_node()
/scripts/kconfig/lxdialog/
A Dutil.c606 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
615 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
618 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
620 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
626 item_cur->node.tag = tag; in item_set_tag()
630 item_cur->node.data = ptr; in item_set_data()
635 item_cur->node.selected = val; in item_set_selected()
648 return item_cur->node.data; in item_data()
653 return item_cur->node.tag; in item_tag()
689 return item_cur->node.str; in item_str()
[all …]
A Ddialog.h162 struct dialog_item node; member

Completed in 53 milliseconds