Home
last modified time | relevance | path

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

12

/scripts/gdb/linux/
Drbtree.py15 node = node.address.cast(rb_root_type.get_type().pointer())
19 node = root['rb_node']
20 if node is 0:
23 while node['rb_left']:
24 node = node['rb_left']
26 return node
31 node = node.address.cast(rb_root_type.get_type().pointer())
35 node = root['rb_node']
36 if node is 0:
39 while node['rb_right']:
[all …]
Dlists.py30 node = head['next'].dereference()
31 while node.address != head.address:
32 yield node.address
33 node = node['next'].dereference()
37 for node in list_for_each(head):
38 yield utils.container_of(node, gdbtype, member)
48 node = head['first'].dereference()
49 while node.address:
50 yield node.address
51 node = node['next'].dereference()
[all …]
/scripts/dtc/
Dchecks.c29 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
62 struct node *node, in check_msg() argument
76 else if (node && node->srcpos) in check_msg()
77 pos = node->srcpos; in check_msg()
92 if (node) { in check_msg()
94 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
96 xasprintf_append(&str, "%s: ", node->fullpath); in check_msg()
106 pos = node->srcpos; in check_msg()
119 #define FAIL(c, dti, node, ...) \ argument
123 check_msg((c), dti, node, NULL, __VA_ARGS__); \
[all …]
Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = name; in name_node()
125 return node; in name_node()
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
[all …]
Ddtc.h150 struct node { struct
154 struct node *children; argument
156 struct node *parent; argument
157 struct node *next_sibling; argument
202 struct node *build_node(struct property *proplist, struct node *children,
204 struct node *build_node_delete(struct srcpos *srcpos);
205 struct node *name_node(struct node *node, char *name);
206 struct node *omit_node_if_unused(struct node *node);
207 struct node *reference_node(struct node *node);
208 struct node *chain_node(struct node *first, struct node *list);
[all …]
Dfdtput.c123 int node; in store_key_value() local
126 node = fdt_path_offset(blob, node_name); in store_key_value()
127 if (node < 0) { in store_key_value()
128 report_error(node_name, -1, node); in store_key_value()
132 err = fdt_setprop(blob, node, property, buf, len); in store_key_value()
154 int node, offset = 0; in create_paths() local
160 for (sep = path; *sep; path = sep + 1, offset = node) { in create_paths()
166 node = fdt_subnode_offset_namelen(blob, offset, path, in create_paths()
168 if (node == -FDT_ERR_NOTFOUND) { in create_paths()
169 node = fdt_add_subnode_namelen(blob, offset, path, in create_paths()
[all …]
Dfdtget.c108 static int list_properties(const void *blob, int node) in list_properties() argument
114 prop = fdt_first_property_offset(blob, node); in list_properties()
136 static int list_subnodes(const void *blob, int node) in list_subnodes() argument
145 tag = fdt_next_tag(blob, node, &nextoffset); in list_subnodes()
148 pathp = fdt_get_name(blob, node, NULL); in list_subnodes()
177 node = nextoffset; in list_subnodes()
193 int node, const char *property) in show_data_for_item() argument
200 err = list_properties(blob, node); in show_data_for_item()
204 err = list_subnodes(blob, node); in show_data_for_item()
209 value = fdt_getprop(blob, node, property, &len); in show_data_for_item()
[all …]
Dsrcpos.c130 struct search_path *node; in fopen_any_on_path() local
140 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
141 fullname = try_open(node->dirname, fname, fp); in fopen_any_on_path()
217 struct search_path *node; in srcfile_add_search_path() local
220 node = xmalloc(sizeof(*node)); in srcfile_add_search_path()
221 node->next = NULL; in srcfile_add_search_path()
222 node->dirname = xstrdup(dirname); in srcfile_add_search_path()
226 *search_path_tail = node; in srcfile_add_search_path()
228 search_path_head = node; in srcfile_add_search_path()
229 search_path_tail = &node->next; in srcfile_add_search_path()
Ddt_to_config331 my $node = $pn_arg_ref->{node};
444 my $node = $pn_arg_ref->{node};
456 print "$node";
733 my $node = shift;
741 return if (!$node or !$compatible);
745 return if ($node eq "/");
748 $pn_arg{node} = $node;
865 my $node = "";
887 &handle_compatible($full_node, $node, $compatible,
896 $node = $line;
[all …]
Dfstree.c11 static struct node *read_fstree(const char *dirname) in read_fstree()
16 struct node *tree; in read_fstree()
54 struct node *newchild; in read_fstree()
70 struct node *tree; in dt_from_fs()
Ddtc-parser.y37 struct node *node; member
38 struct node *nodelist;
74 %type <node> devicetree
75 %type <node> nodedef
76 %type <node> subnode
175 struct node *target = get_node_by_ref($1, $3);
194 struct node *target = get_node_by_ref($1, $2);
205 struct node *target = get_node_by_ref($1, $2);
224 struct node *target = get_node_by_ref($1, $3);
236 struct node *target = get_node_by_ref($1, $3);
Dflattree.c235 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree()
240 struct node *child; in flatten_tree()
730 static struct node *unflatten_tree(struct inbuf *dtbuf, in unflatten_tree()
734 struct node *node; in unflatten_tree() local
738 node = build_node(NULL, NULL, NULL); in unflatten_tree()
743 node->name = nodename_from_path(parent_flatname, flatname); in unflatten_tree()
745 node->name = flatname; in unflatten_tree()
749 struct node *child; in unflatten_tree()
754 if (node->children) in unflatten_tree()
758 add_property(node, prop); in unflatten_tree()
[all …]
Ddtc.c31 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths()
33 struct node *child; in fill_fullpaths()
Dyamltree.c176 static void yaml_tree(struct node *tree, yaml_emitter_t *emitter) in yaml_tree()
179 struct node *child; in yaml_tree()
/scripts/gcc-plugins/
Dgcc-common.h160 #define DECL_NAME_POINTER(node) IDENTIFIER_POINTER(DECL_NAME(node)) argument
161 #define DECL_NAME_LENGTH(node) IDENTIFIER_LENGTH(DECL_NAME(node)) argument
162 #define TYPE_NAME_POINTER(node) IDENTIFIER_POINTER(TYPE_NAME(node)) argument
163 #define TYPE_NAME_LENGTH(node) IDENTIFIER_LENGTH(TYPE_NAME(node)) argument
310 struct cgraph_node *node = cgraph_get_node(decl); in cgraph_get_create_node() local
312 return node ? node : cgraph_node(decl); in cgraph_get_create_node()
315 static inline bool cgraph_function_with_gimple_body_p(struct cgraph_node *node) in cgraph_function_with_gimple_body_p() argument
317 return node->analyzed && !node->thunk.thunk_p && !node->alias; in cgraph_function_with_gimple_body_p()
322 struct cgraph_node *node; in cgraph_first_function_with_gimple_body() local
324 for (node = cgraph_nodes; node; node = node->next) in cgraph_first_function_with_gimple_body()
[all …]
Dlatent_entropy_plugin.c122 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute() argument
134 switch (TREE_CODE(*node)) { in handle_latent_entropy_attribute()
142 if (DECL_INITIAL(*node)) { in handle_latent_entropy_attribute()
145 *node, name); in handle_latent_entropy_attribute()
149 if (!TREE_STATIC(*node)) { in handle_latent_entropy_attribute()
152 *node, name); in handle_latent_entropy_attribute()
156 type = TREE_TYPE(*node); in handle_latent_entropy_attribute()
161 *node, name); in handle_latent_entropy_attribute()
177 *node, name, fld); in handle_latent_entropy_attribute()
198 DECL_INITIAL(*node) = build_constructor(type, vals); in handle_latent_entropy_attribute()
[all …]
Drandomize_layout_plugin.c26 #define ORIG_TYPE_NAME(node) \ argument
27 …TYPE_NAME(TYPE_MAIN_VARIANT(node)) != NULL_TREE ? ((const unsigned char *)IDENTIFIER_POINTER(TYPE_…
76 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr() argument
81 if (TREE_CODE(*node) == FUNCTION_DECL) { in handle_randomize_layout_attr()
82 error("%qE attribute does not apply to functions (%qF)", name, *node); in handle_randomize_layout_attr()
86 if (TREE_CODE(*node) == PARM_DECL) { in handle_randomize_layout_attr()
87 error("%qE attribute does not apply to function parameters (%qD)", name, *node); in handle_randomize_layout_attr()
91 if (TREE_CODE(*node) == VAR_DECL) { in handle_randomize_layout_attr()
92 error("%qE attribute does not apply to variables (%qD)", name, *node); in handle_randomize_layout_attr()
96 if (TYPE_P(*node)) { in handle_randomize_layout_attr()
[all …]
Dstackleak_plugin.c53 cgraph_node_ptr node; in stackleak_add_track_stack() local
69 node = cgraph_get_create_node(track_function_decl); in stackleak_add_track_stack()
70 gcc_assert(node); in stackleak_add_track_stack()
72 cgraph_create_edge(cgraph_get_node(current_function_decl), node, in stackleak_add_track_stack()
Dstructleak_plugin.c53 static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_user_attribute() argument
58 if (TREE_CODE(*node) != FIELD_DECL) in handle_user_attribute()
/scripts/genksyms/
Dgenksyms.c323 void free_node(struct string_list *node) in free_node() argument
325 free(node->string); in free_node()
326 free(node); in free_node()
367 struct string_list *copy_node(struct string_list *node) in copy_node() argument
372 newnode->string = xstrdup(node->string); in copy_node()
373 newnode->tag = node->tag; in copy_node()
411 struct string_list node = { in read_node() local
418 if (node.string == buffer) in read_node()
424 if (node.string == buffer) in read_node()
429 if (node.string >= buffer + sizeof(buffer) - 1) { in read_node()
[all …]
Dparse.y29 struct string_list *node = *p; in remove_node() local
30 *p = node->next; in remove_node()
31 free_node(node); in remove_node()
/scripts/kconfig/
Dpreprocess.c41 struct list_head node; member
52 list_add_tail(&e->node, &env_list); in env_add()
57 list_del(&e->node); in env_del()
72 list_for_each_entry(e, &env_list, node) { in env_expand()
94 list_for_each_entry_safe(e, tmp, &env_list, node) { in env_write_dep()
236 struct list_head node; member
243 list_for_each_entry(v, &variable_list, node) { in variable_lookup()
303 list_add_tail(&v->node, &variable_list); in variable_add()
326 list_del(&v->node); in variable_del()
336 list_for_each_entry_safe(v, tmp, &variable_list, node) in variable_all_del()
/scripts/kconfig/lxdialog/
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 …]
/scripts/dtc/libfdt/
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()
557 void *fdto, int node) in overlay_apply_node() argument
562 fdt_for_each_property_offset(property, fdto, node) { in overlay_apply_node()
580 fdt_for_each_subnode(subnode, fdto, node) { in overlay_apply_node()
Dlibfdt.h226 #define fdt_for_each_subnode(node, fdt, parent) \ argument
227 for (node = fdt_first_subnode(fdt, parent); \
228 node >= 0; \
229 node = fdt_next_subnode(fdt, node))
605 #define fdt_for_each_property_offset(property, fdt, node) \ argument
606 for (property = fdt_first_property_offset(fdt, node); \

12