Searched refs:node (Results 1 - 25 of 2179) sorted by relevance

1234567891011>>

/netbsd-current/tests/usr.bin/xlint/lint1/
H A Dgcc_init_compound_literal.c32 struct node { struct
34 struct node *left;
35 struct node *right;
43 static const struct node guess = {
45 &(struct node){
47 &(struct node){
52 &(struct node){
/netbsd-current/external/gpl2/mkhybrid/dist/libhfs_iso/
H A Dnode.h20 void n_init(node *, btree *, int, int);
22 int n_new(node *);
23 void n_free(node *);
25 void n_compact(node *);
26 int n_search(node *, unsigned char *);
29 int n_split(node *, unsigned char *, int *);
31 void n_insertx(node *, unsigned char *, int);
32 int n_insert(node *, unsigned char *, int *);
34 int n_merge(node *, node *, unsigne
[all...]
H A Dbtree.h20 int bt_getnode(node *);
21 int bt_putnode(node *);
28 int bt_insertx(node *, unsigned char *, int *);
31 int bt_deletex(node *, unsigned char *, unsigned char *, int *);
34 int bt_search(btree *, unsigned char *, node *);
/netbsd-current/bin/sh/
H A Dshow.h37 union node;
38 void showtree(union node *);
42 void trargstr(union node *);
/netbsd-current/usr.sbin/autofs/
H A Dcommon.h52 struct node { struct
53 TAILQ_ENTRY(node) n_next;
54 TAILQ_HEAD(nodehead, node) n_children;
55 struct node *n_parent;
83 struct node *node_new_root(void);
84 struct node *node_new(struct node *, char *, char *, char *, const char *,
86 struct node *node_new_map(struct node *, char *, char *, char *,
88 struct node *node_fin
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/cp/
H A Dptree.c29 cxx_print_decl (FILE *file, tree node, int indent) argument
31 if (TREE_CODE (node) == FIELD_DECL)
33 if (DECL_MUTABLE_P (node))
41 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
42 || !DECL_LANG_SPECIFIC (node))
44 if (TREE_CODE (node) == FUNCTION_DECL)
49 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags));
51 else if (TREE_CODE (node) == TEMPLATE_DECL)
53 print_node (file, "parms", DECL_TEMPLATE_PARMS (node), indent + 4);
56 decl_as_string (node, TFF_TEMPLATE_HEADE
73 cxx_print_type(FILE *file, tree node, int indent) argument
172 cxx_print_identifier(FILE *file, tree node, int indent) argument
183 cxx_print_lambda_node(FILE *file, tree node, int indent) argument
209 cxx_print_xnode(FILE *file, tree node, int indent) argument
280 debug_tree(cp_expr node) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dipa-visibility.c93 non_local_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) argument
95 return !(node->only_called_directly_or_aliased_p ()
98 && !node->thunk.thunk_p
99 && node->definition
100 && !DECL_EXTERNAL (node->decl)
101 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (node->decl))
102 && !node->externally_visible
103 && !node->used_from_other_partition
104 && !node->in_other_partition
105 && node
125 comdat_can_be_unshared_p_1(symtab_node *node) argument
168 comdat_can_be_unshared_p(symtab_node *node) argument
190 cgraph_externally_visible_p(struct cgraph_node *node, bool whole_program) argument
343 can_replace_by_local_alias(symtab_node *node) argument
366 can_replace_by_local_alias_in_vtable(symtab_node *node) argument
396 update_visibility_by_resolution_info(symtab_node * node) argument
467 optimize_weakref(symtab_node *node) argument
541 localize_node(bool whole_program, symtab_node *node) argument
619 struct cgraph_node *node; local
[all...]
H A Dprint-tree.c59 print_real_cst (FILE *file, const_tree node, bool brief) argument
61 if (TREE_OVERFLOW (node))
64 REAL_VALUE_TYPE d = TREE_REAL_CST (node);
120 /* Print a node in brief fashion, with just the code, address and name. */
123 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) argument
127 if (node == 0)
130 tclass = TREE_CODE_CLASS (TREE_CODE (node));
132 /* Always print the slot this node is in, and its code, address and
136 fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node)));
137 dump_addr (file, " ", node);
222 print_node(FILE *file, const char *prefix, tree node, int indent, bool brief_for_visited) argument
1120 debug_tree(tree node) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dipa-visibility.cc93 non_local_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) argument
95 return !(node->only_called_directly_or_aliased_p ()
98 && !node->thunk
99 && node->definition
100 && !DECL_EXTERNAL (node->decl)
101 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (node->decl))
102 && !node->externally_visible
103 && !node->used_from_other_partition
104 && !node->in_other_partition
105 && node
125 comdat_can_be_unshared_p_1(symtab_node *node) argument
168 comdat_can_be_unshared_p(symtab_node *node) argument
190 cgraph_externally_visible_p(struct cgraph_node *node, bool whole_program) argument
343 can_replace_by_local_alias(symtab_node *node) argument
366 can_replace_by_local_alias_in_vtable(symtab_node *node) argument
396 update_visibility_by_resolution_info(symtab_node * node) argument
467 optimize_weakref(symtab_node *node) argument
541 localize_node(bool whole_program, symtab_node *node) argument
619 struct cgraph_node *node; local
[all...]
H A Dprint-tree.cc59 print_real_cst (FILE *file, const_tree node, bool brief) argument
61 if (TREE_OVERFLOW (node))
64 REAL_VALUE_TYPE d = TREE_REAL_CST (node);
120 /* Print a node in brief fashion, with just the code, address and name. */
123 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) argument
127 if (node == 0)
130 tclass = TREE_CODE_CLASS (TREE_CODE (node));
132 /* Always print the slot this node is in, and its code, address and
136 fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node)));
137 dump_addr (file, " ", node);
222 print_node(FILE *file, const char *prefix, tree node, int indent, bool brief_for_visited) argument
1129 debug_tree(tree node) argument
[all...]
/netbsd-current/usr.sbin/makefs/cd9660/
H A Dcd9660_archimedes.c74 * Add "ARCHIMEDES" metadata to a node if that seems appropriate.
80 archimedes_convert_node(cd9660node *node) argument
87 if (node->su_tail_data != NULL)
91 len = strlen(node->node->name);
94 if (len >= 4 && node->node->name[len-4] == ',')
96 type = strtoul(node->node->name + len - 3, NULL, 16);
97 if (type == -1 && node
119 archimedes_convert_tree(cd9660node *node) argument
[all...]
/netbsd-current/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes_test.cpp45 /// Typed leaf node that specializes the validate() method.
61 /// Set node that specializes the validate() method.
85 config::bool_node node; local
86 node.set(true);
87 config::detail::base_node* raw_copy = node.deep_copy();
91 ATF_REQUIRE(node.value());
100 config::bool_node node; local
101 ATF_REQUIRE(!node.is_set());
102 node.set(false);
103 ATF_REQUIRE( node
110 config::bool_node node; local
123 config::bool_node node; local
137 config::bool_node node; local
150 config::bool_node node; local
161 config::bool_node node; local
172 config::bool_node node; local
181 config::bool_node node; local
192 config::int_node node; local
207 config::int_node node; local
217 config::int_node node; local
230 config::int_node node; local
244 config::int_node node; local
260 config::int_node node; local
271 config::int_node node; local
282 config::int_node node; local
291 config::int_node node; local
302 config::string_node node; local
317 config::string_node node; local
327 config::string_node node; local
340 config::string_node node; local
354 config::string_node node; local
370 config::bool_node node; local
381 config::string_node node; local
392 config::string_node node; local
404 config::strings_set_node node; local
425 config::strings_set_node node; local
438 config::strings_set_node node; local
451 config::strings_set_node node; local
474 config::strings_set_node node; local
485 validation_node node; local
495 validation_node node; local
505 set_validation_node node; local
520 set_validation_node node; local
[all...]
/netbsd-current/sys/dev/raidframe/
H A Drf_pq.h40 void rf_RegularONPFunc(RF_DagNode_t * node);
41 void rf_SimpleONPFunc(RF_DagNode_t * node);
42 void rf_RecoveryPFunc(RF_DagNode_t * node);
43 void rf_RegularPFunc(RF_DagNode_t * node);
55 void rf_RegularONQFunc(RF_DagNode_t * node);
56 void rf_SimpleONQFunc(RF_DagNode_t * node);
58 void rf_RegularPQFunc(RF_DagNode_t * node);
59 void rf_RegularQFunc(RF_DagNode_t * node);
60 void rf_Degraded_100_PQFunc(RF_DagNode_t * node);
61 void rf_RecoveryQFunc(RF_DagNode_t * node);
[all...]
H A Drf_dagfuncs.h31 * dagfuncs.h -- header file for DAG node execution routines
39 void rf_TerminateFunc(RF_DagNode_t * node);
40 void rf_TerminateUndoFunc(RF_DagNode_t * node);
41 void rf_DiskReadMirrorIdleFunc(RF_DagNode_t * node);
42 void rf_DiskReadMirrorPartitionFunc(RF_DagNode_t * node);
43 void rf_DiskReadMirrorUndoFunc(RF_DagNode_t * node);
44 void rf_ParityLogUpdateFunc(RF_DagNode_t * node);
45 void rf_ParityLogOverwriteFunc(RF_DagNode_t * node);
46 void rf_ParityLogUpdateUndoFunc(RF_DagNode_t * node);
47 void rf_ParityLogOverwriteUndoFunc(RF_DagNode_t * node);
[all...]
/netbsd-current/external/gpl2/texinfo/dist/makeinfo/tests/
H A Dnode-whitespace2 # Test whitespace collapse in node names.
7 ../makeinfo $srcdir/node-whitespace.txi
8 test -s node-whitespace.info
11 rm -f node-whitespace.info
H A Dnode-expand2 # Test command expansion in node names.
7 ../makeinfo --commands-in-node-names $srcdir/node-expand.txi
8 test -s node-expand.info
11 rm -f node-expand.info
/netbsd-current/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
H A Dgl_anylinked_list2.h25 The list and node fields that are therefore accessed from the signal handler
27 list->root, node->next, node->value.
94 gl_list_node_t node = local
98 node->value = *contents;
100 node->h.hashcode =
102 ? list->base.hashcode_fn (node->value)
103 : (size_t)(uintptr_t) node->value);
105 /* Add node to the hash table. */
106 add_to_bucket (list, node);
127 gl_linked_node_value(gl_list_t list, gl_list_node_t node) argument
133 gl_linked_next_node(gl_list_t list, gl_list_node_t node) argument
139 gl_linked_previous_node(gl_list_t list, gl_list_node_t node) argument
148 gl_list_node_t node; local
174 gl_list_node_t node; local
239 gl_list_node_t node; local
280 gl_list_node_t node; local
347 gl_list_node_t node = list->root.next; local
390 gl_list_node_t node; local
471 gl_list_node_t node = list->root.next; local
500 gl_list_node_t node = local
531 gl_list_node_t node = local
560 gl_linked_add_before(gl_list_t list, gl_list_node_t node, const void *elt) argument
591 gl_linked_add_after(gl_list_t list, gl_list_node_t node, const void *elt) argument
647 gl_list_node_t node; local
659 gl_list_node_t node; local
680 gl_linked_remove_node(gl_list_t list, gl_list_node_t node) argument
714 gl_list_node_t node; local
727 gl_list_node_t node; local
751 gl_list_node_t node = gl_linked_search_from_to (list, 0, list->count, elt); local
762 gl_list_node_t node; local
816 gl_list_node_t node; local
830 gl_list_node_t node; local
846 gl_list_node_t node; local
873 gl_list_node_t node = (gl_list_node_t) iterator->p; local
895 gl_list_node_t node; local
926 gl_list_node_t node; local
961 gl_list_node_t node; local
996 gl_list_node_t node; local
1032 gl_list_node_t node; local
1044 gl_list_node_t node; local
[all...]
/netbsd-current/external/mit/isl/dist/
H A Disl_ast_node_set_field_templ.c13 /* Replace the field FIELD of "node" by "field",
14 * where the field may or may not have already been set in "node".
16 * then "node" is required to have a single reference.
20 __isl_take isl_ast_node *node, __isl_take FIELD_TYPE *field)
22 if (FN(isl_ast_node_check,NODE_TYPE)(node) < 0 || !field)
24 if (node->FIELD == field) {
26 return node;
29 node = isl_ast_node_cow(node);
30 if (!node)
19 FIELD_NAME( __isl_take isl_ast_node *node, __isl_take FIELD_TYPE *field) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/contrib/
H A Dmake-obstacks-texi.pl27 $data =~ s/.*\@node Obstacks\n/\@node Obstacks\n/s;
28 $data =~ s/\n\@node [^\n]+\n\@subsection.*/\n/s;
35 my @nodes = grep /^\@node /, (split /\n/, $data);
37 foreach my $node (@nodes) {
38 $node =~ s/\@node //;
39 $node =~ s/,.*//;
40 $node =~ s/ / *\n?/g;
41 chomp ($node);
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/contrib/
H A Dmake-obstacks-texi.pl27 $data =~ s/.*\@node Obstacks\n/\@node Obstacks\n/s;
28 $data =~ s/\n\@node [^\n]+\n\@subsection.*/\n/s;
35 my @nodes = grep /^\@node /, (split /\n/, $data);
37 foreach my $node (@nodes) {
38 $node =~ s/\@node //;
39 $node =~ s/,.*//;
40 $node =~ s/ / *\n?/g;
41 chomp ($node);
[all...]
/netbsd-current/external/gpl2/groff/dist/src/roff/troff/
H A Dnode.h1 /* $NetBSD: node.h,v 1.1.1.1 2016/01/13 18:41:48 christos Exp $ */
52 struct node { struct
53 node *next;
54 node *last;
59 node();
60 node(node *);
61 node(node *, statem *, int);
62 node *add_cha
118 inline node::node() function in class:node
123 inline node::node(node *n) function in class:node
128 inline node::node(node *n, statem *s, int divlevel) function in class:node
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libobjc/
H A Dhash.c80 node_ptr node; local
85 /* Step through the nodes one by one and remove every node WITHOUT
90 if ((node = cache->node_table[i]))
94 while ((next_node = node->next))
96 objc_hash_remove (cache,node->key);
97 node = next_node;
99 objc_hash_remove (cache,node->key);
113 node_ptr node = (node_ptr) objc_calloc (1, sizeof (struct cache_node)); local
115 assert (node);
117 /* Initialize the new node
173 node_ptr node = cache->node_table[indx]; local
211 objc_hash_next(cache_ptr cache, node_ptr node) argument
257 node_ptr node = cache->node_table[(*cache->hash_func) (cache, key)]; local
281 node_ptr node = cache->node_table[(*cache->hash_func) (cache, key)]; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/libobjc/
H A Dhash.c80 node_ptr node; local
85 /* Step through the nodes one by one and remove every node WITHOUT
90 if ((node = cache->node_table[i]))
94 while ((next_node = node->next))
96 objc_hash_remove (cache,node->key);
97 node = next_node;
99 objc_hash_remove (cache,node->key);
113 node_ptr node = (node_ptr) objc_calloc (1, sizeof (struct cache_node)); local
115 assert (node);
117 /* Initialize the new node
173 node_ptr node = cache->node_table[indx]; local
211 objc_hash_next(cache_ptr cache, node_ptr node) argument
257 node_ptr node = cache->node_table[(*cache->hash_func) (cache, key)]; local
281 node_ptr node = cache->node_table[(*cache->hash_func) (cache, key)]; local
[all...]
/netbsd-current/sys/external/bsd/drm2/dist/drm/i915/gt/
H A Dintel_engine_pool.h20 intel_engine_pool_mark_active(struct intel_engine_pool_node *node, argument
23 return i915_active_add_request(&node->active, rq);
27 intel_engine_pool_put(struct intel_engine_pool_node *node) argument
29 i915_active_release(&node->active);
/netbsd-current/external/gpl2/dtc/dist/
H A Dchecks.c31 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
64 struct node *node,
78 else if (node && node->srcpos)
79 pos = node->srcpos;
94 if (node) {
96 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name);
98 xasprintf_append(&str, "%s: ", node
63 check_msg(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const char *fmt, ...) argument
136 check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) argument
193 check_always_fail(struct check *c, struct dt_info *dti, struct node *node) argument
200 check_is_string(struct check *c, struct dt_info *dti, struct node *node) argument
218 check_is_string_list(struct check *c, struct dt_info *dti, struct node *node) argument
247 check_is_cell(struct check *c, struct dt_info *dti, struct node *node) argument
269 check_duplicate_node_names(struct check *c, struct dt_info *dti, struct node *node) argument
283 check_duplicate_property_names(struct check *c, struct dt_info *dti, struct node *node) argument
305 check_node_name_chars(struct check *c, struct dt_info *dti, struct node *node) argument
316 check_node_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) argument
327 check_node_name_format(struct check *c, struct dt_info *dti, struct node *node) argument
335 check_unit_address_vs_reg(struct check *c, struct dt_info *dti, struct node *node) argument
362 check_property_name_chars(struct check *c, struct dt_info *dti, struct node *node) argument
377 check_property_name_chars_strict(struct check *c, struct dt_info *dti, struct node *node) argument
416 check_duplicate_label(struct check *c, struct dt_info *dti, const char *label, struct node *node, struct property *prop, struct marker *mark) argument
443 check_duplicate_label_node(struct check *c, struct dt_info *dti, struct node *node) argument
464 check_phandle_prop(struct check *c, struct dt_info *dti, struct node *node, const char *propname) argument
511 check_explicit_phandles(struct check *c, struct dt_info *dti, struct node *node) argument
547 check_name_properties(struct check *c, struct dt_info *dti, struct node *node) argument
581 fixup_phandle_references(struct check *c, struct dt_info *dti, struct node *node) argument
616 fixup_path_references(struct check *c, struct dt_info *dti, struct node *node) argument
647 fixup_omit_unused_nodes(struct check *c, struct dt_info *dti, struct node *node) argument
671 check_names_is_string_list(struct check *c, struct dt_info *dti, struct node *node) argument
687 check_alias_paths(struct check *c, struct dt_info *dti, struct node *node) argument
712 fixup_addr_size_cells(struct check *c, struct dt_info *dti, struct node *node) argument
736 check_reg_format(struct check *c, struct dt_info *dti, struct node *node) argument
765 check_ranges_format(struct check *c, struct dt_info *dti, struct node *node) argument
810 check_pci_bridge(struct check *c, struct dt_info *dti, struct node *node) argument
851 check_pci_device_bus_num(struct check *c, struct dt_info *dti, struct node *node) argument
881 check_pci_device_reg(struct check *c, struct dt_info *dti, struct node *node) argument
930 node_is_compatible(struct node *node, const char *compat) argument
947 check_simple_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) argument
955 check_simple_bus_reg(struct check *c, struct dt_info *dti, struct node *node) argument
998 check_i2c_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) argument
1024 check_i2c_bus_reg(struct check *c, struct dt_info *dti, struct node *node) argument
1065 check_spi_bus_bridge(struct check *c, struct dt_info *dti, struct node *node) argument
1106 check_spi_bus_reg(struct check *c, struct dt_info *dti, struct node *node) argument
1137 check_unit_address_format(struct check *c, struct dt_info *dti, struct node *node) argument
1162 check_avoid_default_addr_size(struct check *c, struct dt_info *dti, struct node *node) argument
1185 check_avoid_unnecessary_addr_size(struct check *c, struct dt_info *dti, struct node *node) argument
1209 node_is_disabled(struct node *node) argument
1223 check_unique_unit_address_common(struct check *c, struct dt_info *dti, struct node *node, bool disable_check) argument
1260 check_unique_unit_address(struct check *c, struct dt_info *dti, struct node *node) argument
1267 check_unique_unit_address_if_enabled(struct check *c, struct dt_info *dti, struct node *node) argument
1275 check_obsolete_chosen_interrupt_controller(struct check *c, struct dt_info *dti, struct node *node) argument
1299 check_chosen_node_is_root(struct check *c, struct dt_info *dti, struct node *node) argument
1310 check_chosen_node_bootargs(struct check *c, struct dt_info *dti, struct node *node) argument
1327 check_chosen_node_stdout_path(struct check *c, struct dt_info *dti, struct node *node) argument
1354 check_property_phandle_args(struct check *c, struct dt_info *dti, struct node *node, struct property *prop, const struct provider *provider) argument
1431 check_provider_cells_property(struct check *c, struct dt_info *dti, struct node *node) argument
1487 check_gpios_property(struct check *c, struct dt_info *dti, struct node *node) argument
1512 check_deprecated_gpio_property(struct check *c, struct dt_info *dti, struct node *node) argument
1535 node_is_interrupt_provider(struct node *node) argument
1549 check_interrupts_property(struct check *c, struct dt_info *dti, struct node *node) argument
1627 check_graph_nodes(struct check *c, struct dt_info *dti, struct node *node) argument
1650 check_graph_child_address(struct check *c, struct dt_info *dti, struct node *node) argument
1675 check_graph_reg(struct check *c, struct dt_info *dti, struct node *node) argument
1706 check_graph_port(struct check *c, struct dt_info *dti, struct node *node) argument
1723 struct node *node; local
1742 check_graph_endpoint(struct check *c, struct dt_info *dti, struct node *node) argument
[all...]

Completed in 374 milliseconds

1234567891011>>