| /scripts/dtc/ |
| A D | checks.c | 62 struct node *node, in check_msg()
208 struct node *node) in check_is_string()
226 struct node *node) in check_is_string_list()
255 struct node *node) in check_is_cell()
314 struct node *node) in check_node_name_chars()
325 struct node *node) in check_node_name_chars_strict()
336 struct node *node) in check_node_name_format()
570 struct node *node) in check_name_properties()
786 struct node *node) in check_ranges_format()
1600 struct node *node) in check_interrupt_map()
[all …]
|
| A D | livetree.c | 231 struct node *node; in add_orphan_node() local
315 struct node *node = parent->children; in delete_node_by_name() local
326 void delete_node(struct node *node) in delete_node()
449 struct node **node) in get_property_by_label()
541 struct node *child, *node; in get_node_by_label() local
561 struct node *child, *node; in get_node_by_phandle() local
802 static void sort_node(struct node *node) in sort_node()
821 struct node *node; in build_and_name_child_node() local
949 struct node *node) in generate_fixups_tree_internal()
993 struct node *lfn, struct node *node, in add_local_fixup_entry()
[all …]
|
| A D | dtc.h | 217 struct node { struct
221 struct node *children; argument
223 struct node *parent; argument
224 struct node *next_sibling; argument
226 char *fullpath;
227 int basenamelen;
229 cell_t phandle;
230 int addr_cells, size_cells;
232 struct label *labels;
234 struct srcpos *srcpos;
[all …]
|
| A D | fdtget.c | 108 static int list_properties(const void *blob, int node) in list_properties()
136 static int list_subnodes(const void *blob, int node) in list_subnodes()
193 int node, const char *property) in show_data_for_item()
241 int i, node; in do_fdtget() local
|
| A D | fdtput.c | 123 int node; in store_key_value() local
154 int node, offset = 0; in create_paths() local
194 int node = 0; in create_node() local
|
| A D | dtc-parser.y | 47 struct node *node; member
|
| A D | srcpos.c | 132 struct search_path *node; in fopen_any_on_path() local
219 struct search_path *node; in srcfile_add_search_path() local
|
| A D | flattree.c | 735 struct node *node; in unflatten_tree() local
|
| /scripts/gdb/linux/ |
| A D | rbtree.py | 13 def inorder(node): argument
57 def rb_parent(node): argument
62 def rb_empty_node(node): argument
66 def rb_next(node): argument
89 def rb_prev(node): argument
161 def invoke(self, node): argument
181 def invoke(self, node): argument
|
| A D | radixtree.py | 20 def is_internal_node(node): argument
24 def entry_to_node(node): argument
30 def node_maxindex(node): argument
|
| A D | mapletree.py | 109 def mte_safe_root(node): argument
130 def ma_dead_node(node): argument
170 def ma_pivots(node, t): argument
181 def ma_slots(node, tp): argument
|
| /scripts/gcc-plugins/ |
| A D | gcc-common.h | 95 #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
160 #define varpool_mark_needed_node(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
[all …]
|
| A D | stackleak_plugin.c | 58 cgraph_node_ptr node; in add_stack_tracking_gcall() local
91 varpool_node_ptr node; in get_current_stack_pointer_decl() local
436 static inline bool string_equal(tree node, const char *string, int length) in string_equal()
447 #define STRING_EQUAL(node, str) string_equal(node, str, strlen(str)) argument
|
| A D | randomize_layout_plugin.c | 22 #define ORIG_TYPE_NAME(node) \ argument
54 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr()
100 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_… in handle_randomize_considered_attr()
110 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_a… in handle_randomize_performed_attr()
391 static int is_pure_ops_struct(const_tree node) in is_pure_ops_struct()
614 struct varpool_node *node; in check_global_variables() local
|
| A D | latent_entropy_plugin.c | 128 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
479 varpool_node_ptr node; in create_latent_entropy_decl() local
|
| /scripts/include/ |
| A D | hashtable.h | 41 #define hash_add(table, node, key) \ argument
48 static inline void hash_del(struct hlist_node *node) in hash_del()
|
| /scripts/genksyms/ |
| A D | parse.y | 30 struct string_list *node = *p; in remove_node() local
|
| A D | genksyms.c | 327 void free_node(struct string_list *node) in free_node()
371 struct string_list *copy_node(struct string_list *node) in copy_node()
415 struct string_list node = { in read_node() local
|
| /scripts/kconfig/ |
| A D | util.c | 20 struct hlist_node node; member
|
| A D | preprocess.c | 43 struct list_head node; member
240 struct list_head node; member
|
| A D | expr.h | 48 struct hlist_node node; member
91 struct hlist_node node; member
|
| /scripts/dtc/libfdt/ |
| A D | fdt_overlay.c | 101 static int overlay_phandle_add_offset(void *fdt, int node, in overlay_phandle_add_offset()
137 static int overlay_adjust_node_phandles(void *fdto, int node, in overlay_adjust_node_phandles()
511 static int overlay_adjust_local_conflicting_phandle(void *fdto, int node, in overlay_adjust_local_conflicting_phandle()
770 void *fdto, int node) in overlay_apply_node()
|
| A D | libfdt.h | 239 #define fdt_for_each_subnode(node, fdt, parent) \ argument
653 #define fdt_for_each_property_offset(property, fdt, node) \ argument
|
| /scripts/kconfig/lxdialog/ |
| A D | dialog.h | 142 struct dialog_item node; member
|
| /scripts/mod/ |
| A D | modpost.h | 105 struct list_head node; member
|