Home
last modified time | relevance | path

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

12

/scripts/gdb/linux/
A Drbtree.py14 if node:
32 if node == 0:
36 node = node['rb_left']
38 return node
52 node = node['rb_right']
54 return node
63 return node['__rb_parent_color'] == node.address
76 node = node['rb_right']
78 node = node['rb_left']
99 node = node['rb_left']
[all …]
A Dradixtree.py20 def is_internal_node(node): argument
24 def entry_to_node(node): argument
26 node_type = node.type
30 def node_maxindex(node): argument
40 node = root['xa_head']
41 if node == 0:
47 return node
49 node = entry_to_node(node)
64 node = slot.cast(node.type.pointer()).dereference()
65 if node == 0:
[all …]
A Dmapletree.py44 self.node = None
86 self.node = None
107 self.node = None
109 def mte_safe_root(node): argument
130 def ma_dead_node(node): argument
135 parent = node['parent']
155 node = mte_to_node(enode)
170 def ma_pivots(node, t): argument
181 def ma_slots(node, tp): argument
190 return node['slot']
[all …]
A Dlists.py35 node = head['next'].dereference()
36 while node.address != head.address:
37 yield node.address
38 node = node['next'].dereference()
42 for node in list_for_each(head):
43 yield utils.container_of(node, gdbtype, member)
53 node = head['first'].dereference()
54 while node.address:
55 yield node.address
56 node = node['next'].dereference()
[all …]
/scripts/dtc/
A Dchecks.c62 struct node *node, in check_msg() argument
201 struct node *node) in check_always_fail() argument
208 struct node *node) in check_is_string() argument
226 struct node *node) in check_is_string_list() argument
255 struct node *node) in check_is_cell() argument
291 struct node *node) in check_duplicate_property_names() argument
314 struct node *node) in check_node_name_chars() argument
325 struct node *node) in check_node_name_chars_strict() argument
336 struct node *node) in check_node_name_format() argument
786 struct node *node) in check_ranges_format() argument
[all …]
A Dlivetree.c119 struct node *name_node(struct node *node, const char *name) in name_node() argument
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
135 struct node *reference_node(struct node *node) in reference_node() argument
231 struct node *node; in add_orphan_node() local
322 node = node->next_sibling; in delete_node_by_name()
541 struct node *child, *node; in get_node_by_label() local
821 struct node *node; in build_and_name_child_node() local
859 struct node *an, struct node *node, in generate_label_tree_internal() argument
949 struct node *node) in generate_fixups_tree_internal() argument
993 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
A Ddtc.h272 struct node *name_node(struct node *node, const char *name);
273 struct node *omit_node_if_unused(struct node *node);
274 struct node *reference_node(struct node *node);
275 struct node *chain_node(struct node *first, struct node *list);
276 struct node *merge_nodes(struct node *old_node, struct node *new_node);
284 void delete_node(struct node *node);
285 void append_to_property(struct node *node,
289 const char *get_unitname(struct node *node);
294 struct node **node);
297 struct node *get_subnode(struct node *node, const char *nodename);
[all …]
A Dfdtput.c123 int node; in store_key_value() local
127 if (node < 0) { in store_key_value()
128 report_error(node_name, -1, node); in store_key_value()
154 int node, offset = 0; in create_paths() local
168 if (node == -FDT_ERR_NOTFOUND) { in create_paths()
172 if (node < 0) { in create_paths()
194 int node = 0; in create_node() local
206 if (node < 0) { in create_node()
212 node = fdt_add_subnode(blob, node, p + 1); in create_node()
213 if (node < 0) { in create_node()
[all …]
A Dfdtget.c114 prop = fdt_first_property_offset(blob, node); in list_properties()
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()
241 int i, node; in do_fdtget() local
248 node = fdt_path_offset(blob, arg[i]); in do_fdtget()
249 if (node < 0) { in do_fdtget()
[all …]
A Dsrcpos.c132 struct search_path *node; in fopen_any_on_path() local
142 for (node = search_path_head; !*fp && node; node = node->next) in fopen_any_on_path()
143 fullname = try_open(node->dirname, fname, fp); in fopen_any_on_path()
219 struct search_path *node; in srcfile_add_search_path() local
222 node = xmalloc(sizeof(*node)); in srcfile_add_search_path()
223 node->next = NULL; in srcfile_add_search_path()
224 node->dirname = xstrdup(dirname); in srcfile_add_search_path()
228 *search_path_tail = node; in srcfile_add_search_path()
230 search_path_head = node; in srcfile_add_search_path()
231 search_path_tail = &node->next; in srcfile_add_search_path()
A 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 = "";
896 $node = $line;
898 $node =~ s/.*: //;
[all …]
A 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()
A Ddtc-parser.y47 struct node *node; member
48 struct node *nodelist;
84 %type <node> devicetree
85 %type <node> nodedef
86 %type <node> subnode
187 struct node *target = get_node_by_ref($1, $3);
211 struct node *target = get_node_by_ref($1, $2);
222 struct node *target = get_node_by_ref($1, $2);
241 struct node *target = get_node_by_ref($1, $3);
253 struct node *target = get_node_by_ref($1, $3);
A Dflattree.c241 struct node *child; in flatten_tree()
731 static struct node *unflatten_tree(struct inbuf *dtbuf, in unflatten_tree()
735 struct node *node; in unflatten_tree() local
739 node = build_node(NULL, NULL, NULL); in unflatten_tree()
747 node->name = xstrdup(flatname); in unflatten_tree()
751 struct node *child; in unflatten_tree()
756 if (node->children) in unflatten_tree()
760 add_property(node, prop); in unflatten_tree()
765 add_child(node, child); in unflatten_tree()
789 return node; in unflatten_tree()
[all …]
/scripts/gcc-plugins/
A Dgcc-common.h95 #define DECL_NAME_POINTER(node) IDENTIFIER_POINTER(DECL_NAME(node)) argument
96 #define DECL_NAME_LENGTH(node) IDENTIFIER_LENGTH(DECL_NAME(node)) argument
97 #define TYPE_NAME_POINTER(node) IDENTIFIER_POINTER(TYPE_NAME(node)) argument
98 #define TYPE_NAME_LENGTH(node) IDENTIFIER_LENGTH(TYPE_NAME(node)) argument
166 #define NODE_SYMBOL(node) (node) argument
167 #define NODE_DECL(node) (node)->decl argument
168 #define cgraph_node_name(node) (node)->name() argument
169 #define NODE_IMPLICIT_ALIAS(node) (node)->cpp_implicit_alias argument
189 #define debug_cgraph_node(node) (node)->debug() argument
196 #define dump_varpool_node(file, node) (node)->dump(file) argument
[all …]
A Dstackleak_plugin.c58 cgraph_node_ptr node; in add_stack_tracking_gcall() local
71 node = cgraph_get_create_node(track_function_decl); in add_stack_tracking_gcall()
72 gcc_assert(node); in add_stack_tracking_gcall()
91 varpool_node_ptr node; in get_current_stack_pointer_decl() local
93 FOR_EACH_VARIABLE(node) { in get_current_stack_pointer_decl()
94 tree var = NODE_DECL(node); in get_current_stack_pointer_decl()
438 if (TREE_STRING_LENGTH(node) < length) in string_equal()
440 if (TREE_STRING_LENGTH(node) > length + 1) in string_equal()
442 if (TREE_STRING_LENGTH(node) == length + 1 && in string_equal()
443 TREE_STRING_POINTER(node)[length] != '\0') in string_equal()
[all …]
A Dlatent_entropy_plugin.c136 switch (TREE_CODE(*node)) { in handle_latent_entropy_attribute()
144 if (DECL_INITIAL(*node)) { in handle_latent_entropy_attribute()
147 *node, name); in handle_latent_entropy_attribute()
151 if (!TREE_STATIC(*node)) { in handle_latent_entropy_attribute()
154 *node, name); in handle_latent_entropy_attribute()
158 type = TREE_TYPE(*node); in handle_latent_entropy_attribute()
163 *node, name); in handle_latent_entropy_attribute()
179 *node, name, fld); in handle_latent_entropy_attribute()
218 *node, name); in handle_latent_entropy_attribute()
479 varpool_node_ptr node; in create_latent_entropy_decl() local
[all …]
A Drandomize_layout_plugin.c22 #define ORIG_TYPE_NAME(node) \ argument
64 if (TREE_CODE(*node) == PARM_DECL) { in handle_randomize_layout_attr()
69 if (TREE_CODE(*node) == VAR_DECL) { in handle_randomize_layout_attr()
74 if (TYPE_P(*node)) { in handle_randomize_layout_attr()
75 type = *node; in handle_randomize_layout_attr()
81 type = TREE_TYPE(*node); in handle_randomize_layout_attr()
395 gcc_assert(TREE_CODE(node) == RECORD_TYPE || TREE_CODE(node) == UNION_TYPE); in is_pure_ops_struct()
401 if (node == fieldtype) in is_pure_ops_struct()
614 struct varpool_node *node; in check_global_variables() local
617 FOR_EACH_VARIABLE(node) { in check_global_variables()
[all …]
/scripts/coccinelle/api/
A Dkvmalloc.cocci87 expression E, E1, size, node;
161 - E = vmalloc_node(size, node);
167 - E = vmalloc_node(size, node);
172 - E = vmalloc_node(size, node);
177 - E = vmalloc_node(size, node);
182 - x = vmalloc_node(size, node);
187 - x = vmalloc_node(size, node);
204 - E = vzalloc_node(size, node);
209 - E = vzalloc_node(size, node);
214 - x = vzalloc_node(size, node);
[all …]
/scripts/include/
A Dhashtable.h41 #define hash_add(table, node, key) \ argument
42 hlist_add_head(node, hash_head(table, key))
48 static inline void hash_del(struct hlist_node *node) in hash_del() argument
50 hlist_del_init(node); in hash_del()
/scripts/genksyms/
A Dgenksyms.c329 free(node->string); in free_node()
330 free(node); in free_node()
377 newnode->tag = node->tag; in copy_node()
415 struct string_list node = { in read_node() local
437 *node.string++ = c; in read_node()
439 if (node.string == buffer) in read_node()
441 *node.string = 0; in read_node()
442 node.string = buffer; in read_node()
449 node.tag = n; in read_node()
450 node.string += 2; in read_node()
[all …]
/scripts/kconfig/
A Dpreprocess.c43 struct list_head node; member
54 list_add_tail(&e->node, &env_list); in env_add()
59 list_del(&e->node); in env_del()
74 list_for_each_entry(e, &env_list, node) { in env_expand()
96 list_for_each_entry_safe(e, tmp, &env_list, node) { in env_write_dep()
240 struct list_head node; member
247 list_for_each_entry(v, &variable_list, node) { in variable_lookup()
307 list_add_tail(&v->node, &variable_list); in variable_add()
330 list_del(&v->node); in variable_del()
340 list_for_each_entry_safe(v, tmp, &variable_list, node) in variable_all_del()
A Dutil.c20 struct hlist_node node; member
31 hash_for_each_possible(file_hashtable, file, node, hash) in file_lookup()
41 hash_add(file_hashtable, &file->node, hash); in file_lookup()
/scripts/kconfig/lxdialog/
A Dutil.c578 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
587 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
590 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
592 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
598 item_cur->node.tag = tag; in item_set_tag()
602 item_cur->node.data = ptr; in item_set_data()
607 item_cur->node.selected = val; in item_set_selected()
620 return item_cur->node.data; in item_data()
625 return item_cur->node.tag; in item_tag()
661 return item_cur->node.str; in item_str()
[all …]
/scripts/dtc/libfdt/
A Dfdt_overlay.c101 static int overlay_phandle_add_offset(void *fdt, int node, in overlay_phandle_add_offset() argument
107 valp = fdt_getprop_w(fdt, node, name, &len); in overlay_phandle_add_offset()
137 static int overlay_adjust_node_phandles(void *fdto, int node, in overlay_adjust_node_phandles() argument
143 ret = overlay_phandle_add_offset(fdto, node, "phandle", delta); in overlay_adjust_node_phandles()
147 ret = overlay_phandle_add_offset(fdto, node, "linux,phandle", delta); in overlay_adjust_node_phandles()
151 fdt_for_each_subnode(child, fdto, node) { in overlay_adjust_node_phandles()
517 php = fdt_getprop(fdto, node, "phandle", &len); in overlay_adjust_local_conflicting_phandle()
524 php = fdt_getprop(fdto, node, "linux,phandle", &len); in overlay_adjust_local_conflicting_phandle()
770 void *fdto, int node) in overlay_apply_node() argument
775 fdt_for_each_property_offset(property, fdto, node) { in overlay_apply_node()
[all …]

Completed in 911 milliseconds

12