Home
last modified time | relevance | path

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

12

/scripts/gdb/linux/
Drbtree.py13 def inorder(node): argument
14 if node:
15 yield from inorder(node['rb_left'])
16 yield node
17 yield from inorder(node['rb_right'])
22 for node in rb_inorder_for_each(root):
23 yield utils.container_of(node, gdbtype, member)
27 node = root.address.cast(rb_root_type.get_type().pointer())
31 node = root['rb_node']
32 if node == 0:
[all …]
Dradixtree.py20 def is_internal_node(node): argument
22 …return ((node.cast(long_type) & constants.LX_RADIX_TREE_ENTRY_MASK) == constants.LX_RADIX_TREE_INT…
24 def entry_to_node(node): argument
26 node_type = node.type
27 indirect_ptr = node.cast(long_type) & ~constants.LX_RADIX_TREE_INTERNAL_NODE
30 def node_maxindex(node): argument
31 return (constants.LX_RADIX_TREE_MAP_SIZE << node['shift']) - 1
35 node = root.dereference()
40 node = root['xa_head']
41 if node == 0:
[all …]
Dmapletree.py44 self.node = None
79 self.node = mte_safe_root(root)
81 if mte_dead_node(self.node) is True:
86 self.node = None
107 self.node = None
109 def mte_safe_root(node): argument
110 if node.type != maple_enode_type.get_type().pointer():
112 … .format(mte_safe_root.__name__, maple_enode_type.get_type().pointer(), node.type))
114 indirect_ptr = node.cast(ulong_type) & ~0x2
130 def ma_dead_node(node): argument
[all …]
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/
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()
120 #define FAIL(c, dti, node, ...) \ argument
124 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, const char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = xstrdup(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.h217 struct node { struct
221 struct node *children; argument
223 struct node *parent; argument
224 struct node *next_sibling; argument
269 struct node *build_node(struct property *proplist, struct node *children,
271 struct node *build_node_delete(struct srcpos *srcpos);
272 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);
[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.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()
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.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);
Dflattree.c236 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree()
241 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()
744 node->name = xstrdup(nodename_from_path(parent_flatname, 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()
[all …]
/scripts/coccinelle/api/
Dkvmalloc.cocci87 expression E, E1, size, node;
159 - E = kmalloc_node(size, flags, node);
161 - E = vmalloc_node(size, node);
162 + E = kvmalloc_node(size, flags, node);
165 - E = kmalloc_node(size, \(GFP_KERNEL\|GFP_KERNEL|__GFP_NOWARN\), node);
167 - E = vmalloc_node(size, node);
168 + E = kvmalloc_node(size, GFP_KERNEL, node);
170 - E = kmalloc_node(size, flags | __GFP_NOWARN, node);
172 - E = vmalloc_node(size, node);
173 + E = kvmalloc_node(size, flags, node);
[all …]
/scripts/gcc-plugins/
Dgcc-common.h103 #define DECL_NAME_POINTER(node) IDENTIFIER_POINTER(DECL_NAME(node)) argument
104 #define DECL_NAME_LENGTH(node) IDENTIFIER_LENGTH(DECL_NAME(node)) argument
105 #define TYPE_NAME_POINTER(node) IDENTIFIER_POINTER(TYPE_NAME(node)) argument
106 #define TYPE_NAME_LENGTH(node) IDENTIFIER_LENGTH(TYPE_NAME(node)) argument
168 #define varpool_mark_needed_node(node) argument
174 #define NODE_SYMBOL(node) (node) argument
175 #define NODE_DECL(node) (node)->decl argument
176 #define cgraph_node_name(node) (node)->name() argument
177 #define NODE_IMPLICIT_ALIAS(node) (node)->cpp_implicit_alias argument
214 #define debug_cgraph_node(node) (node)->debug() argument
[all …]
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()
73 cgraph_create_edge(cgraph_get_node(current_function_decl), 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()
436 static inline bool string_equal(tree node, const char *string, int length) in string_equal() argument
438 if (TREE_STRING_LENGTH(node) < length) in string_equal()
440 if (TREE_STRING_LENGTH(node) > length + 1) in string_equal()
[all …]
Dlatent_entropy_plugin.c128 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute() argument
136 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()
196 DECL_INITIAL(*node) = build_constructor(type, vals); in handle_latent_entropy_attribute()
[all …]
Drandomize_layout_plugin.c22 #define ORIG_TYPE_NAME(node) \ argument
23 …TYPE_NAME(TYPE_MAIN_VARIANT(node)) != NULL_TREE ? ((const unsigned char *)IDENTIFIER_POINTER(TYPE_…
54 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr() argument
59 if (TREE_CODE(*node) == FUNCTION_DECL) { in handle_randomize_layout_attr()
60 error("%qE attribute does not apply to functions (%qF)", name, *node); in handle_randomize_layout_attr()
64 if (TREE_CODE(*node) == PARM_DECL) { in handle_randomize_layout_attr()
65 error("%qE attribute does not apply to function parameters (%qD)", name, *node); in handle_randomize_layout_attr()
69 if (TREE_CODE(*node) == VAR_DECL) { in handle_randomize_layout_attr()
70 error("%qE attribute does not apply to variables (%qD)", name, *node); in handle_randomize_layout_attr()
74 if (TYPE_P(*node)) { in handle_randomize_layout_attr()
[all …]
/scripts/include/
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/
Dgenksyms.c328 void free_node(struct string_list *node) in free_node() argument
330 free(node->string); in free_node()
331 free(node); in free_node()
372 struct string_list *copy_node(struct string_list *node) in copy_node() argument
377 newnode->string = xstrdup(node->string); in copy_node()
378 newnode->tag = node->tag; in copy_node()
416 struct string_list node = { in read_node() local
423 if (node.string == buffer) in read_node()
429 if (node.string == buffer) in read_node()
434 if (node.string >= buffer + sizeof(buffer) - 1) { in read_node()
[all …]
/scripts/kconfig/
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()
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/
Dutil.c579 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
588 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
591 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
593 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
599 item_cur->node.tag = tag; in item_set_tag()
603 item_cur->node.data = ptr; in item_set_data()
608 item_cur->node.selected = val; in item_set_selected()
621 return item_cur->node.data; in item_data()
626 return item_cur->node.tag; in item_tag()
662 return item_cur->node.str; in item_str()
[all …]
/scripts/dtc/libfdt/
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()
511 static int overlay_adjust_local_conflicting_phandle(void *fdto, int node, in overlay_adjust_local_conflicting_phandle() argument
517 php = fdt_getprop(fdto, node, "phandle", &len); in overlay_adjust_local_conflicting_phandle()
519 ret = fdt_setprop_inplace_u32(fdto, node, "phandle", fdt_phandle); in overlay_adjust_local_conflicting_phandle()
524 php = fdt_getprop(fdto, node, "linux,phandle", &len); in overlay_adjust_local_conflicting_phandle()
[all …]

12