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

1234567891011>>

/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/conversion/
H A Dop3.C3 struct node { int* operator int*(); }; // { dg-error "return type specified" } struct
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/compile/
H A Dpr25514.c1 struct node { struct
2 struct node *next;
6 struct node *current_node, global_list;
11 struct node *node, *next; local
13 node = current_node;
14 next = node->next;
15 if (node != &global_list)
19 node = global_list.next;
20 global_list.value = node
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/compile/
H A Dpr25514.c1 struct node { struct
2 struct node *next;
6 struct node *current_node, global_list;
11 struct node *node, *next; local
13 node = current_node;
14 next = node->next;
15 if (node != &global_list)
19 node = global_list.next;
20 global_list.value = node
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/torture/
H A Dpr24626-3.c5 long F2(int *node) argument
9 if (call_result = fff(node))
12 T(node);
16 T(node);
H A Dpr24626-1.c4 (*bla)(int *node);
9 int *node; local
12 if (call_result = after_node_func(node))
15 T(node);
19 T(node);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/torture/
H A Dpr24626-3.c6 long F2(int *node) argument
10 if (call_result = fff(node))
13 T(node);
17 T(node);
H A Dpr24626-1.c5 (*bla)(int *node);
10 int *node; local
13 if (call_result = after_node_func(node))
16 T(node);
20 T(node);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/
H A Dipa.c33 struct cgraph_node *node, *node2; local
45 for (node = cgraph_nodes; node; node = node->next)
46 node->aux = NULL;
47 for (node = cgraph_nodes; node; node = node
100 struct cgraph_node *node; local
[all...]
H A Dprint-tree.c40 tree node; member in struct:bucket
46 /* Print the node NODE on standard error, for debugging.
51 debug_tree (tree node) argument
54 print_node (stderr, "", node, 0);
60 /* Print a node in brief fashion, with just the code, address and name. */
63 print_node_brief (FILE *file, const char *prefix, tree node, int indent) argument
67 if (node == 0)
70 class = TREE_CODE_CLASS (TREE_CODE (node));
72 /* Always print the slot this node is in, and its code, address and
77 prefix, tree_code_name[(int) TREE_CODE (node)], (cha
161 print_node(FILE *file, const char *prefix, tree node, int indent) argument
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/cp/
H A Dptree.c32 cxx_print_decl (FILE *file, tree node, int indent) argument
34 if (TREE_CODE (node) == FIELD_DECL)
36 if (DECL_MUTABLE_P (node))
44 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
45 || !DECL_LANG_SPECIFIC (node))
47 if (TREE_CODE (node) == FUNCTION_DECL)
52 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags));
54 else if (TREE_CODE (node) == TEMPLATE_DECL)
58 decl_as_string (node, TFF_TEMPLATE_HEADER));
62 if (DECL_EXTERNAL (node)
75 cxx_print_type(FILE *file, tree node, int indent) argument
173 cxx_print_identifier(FILE *file, tree node, int indent) argument
190 cxx_print_xnode(FILE *file, tree node, int indent) argument
[all...]
/netbsd-6-1-5-RELEASE/bin/sh/
H A Dredir.h42 union node;
43 void redirect(union node *, int);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/
H A D20000412-5.c3 int node; member in struct:__anon5439
7 if (lastglob[0].node != 0 || lastglob[0].type != 1)
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/execute/
H A D20000412-5.c3 int node; member in struct:__anon3708
7 if (lastglob[0].node != 0 || lastglob[0].type != 1)
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/cp/
H A Dptree.c32 cxx_print_decl (FILE *file, tree node, int indent) argument
34 if (TREE_CODE (node) == FIELD_DECL)
36 if (DECL_MUTABLE_P (node))
44 if (!DECL_LANG_SPECIFIC (node))
47 if (TREE_CODE (node) == FUNCTION_DECL
48 && DECL_PENDING_INLINE_INFO (node))
50 (void *) DECL_PENDING_INLINE_INFO (node));
51 if (TREE_CODE (node) == TYPE_DECL
52 && DECL_SORTED_FIELDS (node))
54 (void *) DECL_SORTED_FIELDS (node));
62 cxx_print_type(FILE *file, tree node, int indent) argument
150 cxx_print_identifier(FILE *file, tree node, int indent) argument
167 cxx_print_xnode(FILE *file, tree node, int indent) argument
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/i386/
H A D20080723-1.c27 struct hlist_node *node; local
29 for (node = head->first;
30 node && (prefetch (node->next), 1);
31 node = node->next)
33 if (node->i_ino == ino)
36 return node ? node : 0;
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/
H A Dipa.c37 struct cgraph_node *node, *node2; local
50 for (node = cgraph_nodes; node; node = node->next)
51 node->aux = NULL;
53 for (node = cgraph_nodes; node; node = node
104 update_inlined_to_pointer(struct cgraph_node *node, struct cgraph_node *inlined_to) argument
125 struct cgraph_node *node, *next; local
311 cgraph_externally_visible_p(struct cgraph_node *node, bool whole_program) argument
353 dissolve_same_comdat_group_list(struct cgraph_node *node) argument
379 struct cgraph_node *node; local
549 struct cgraph_node *node; local
638 cgraph_node_set_add(cgraph_node_set set, struct cgraph_node *node) argument
670 cgraph_node_set_remove(cgraph_node_set set, struct cgraph_node *node) argument
711 cgraph_node_set_find(cgraph_node_set set, struct cgraph_node *node) argument
743 struct cgraph_node *node = csi_node (iter); local
[all...]
H A Dprint-tree.c44 tree node; member in struct:bucket
50 /* Print the node NODE on standard error, for debugging.
55 debug_tree (tree node) argument
58 print_node (stderr, "", node, 0);
74 /* Print a node in brief fashion, with just the code, address and name. */
77 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) argument
81 if (node == 0)
84 tclass = TREE_CODE_CLASS (TREE_CODE (node));
86 /* Always print the slot this node is in, and its code, address and
90 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
202 print_node(FILE *file, const char *prefix, tree node, int indent) argument
[all...]
/netbsd-6-1-5-RELEASE/usr.sbin/makefs/cd9660/
H A Dcd9660_archimedes.c73 * Add "ARCHIMEDES" metadata to a node if that seems appropriate.
79 archimedes_convert_node(cd9660node *node) argument
86 if (node->su_tail_data != NULL)
90 len = strlen(node->node->name);
93 if (len >= 4 && node->node->name[len-4] == ',')
95 type = strtoul(node->node->name + len - 3, NULL, 16);
96 if (type == -1 && node
121 archimedes_convert_tree(cd9660node *node) argument
[all...]
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/
H A Drf_pq.h40 int rf_RegularONPFunc(RF_DagNode_t * node);
41 int rf_SimpleONPFunc(RF_DagNode_t * node);
42 int rf_RecoveryPFunc(RF_DagNode_t * node);
43 int rf_RegularPFunc(RF_DagNode_t * node);
55 int rf_RegularONQFunc(RF_DagNode_t * node);
56 int rf_SimpleONQFunc(RF_DagNode_t * node);
58 int rf_RegularPQFunc(RF_DagNode_t * node);
59 int rf_RegularQFunc(RF_DagNode_t * node);
60 void rf_Degraded_100_PQFunc(RF_DagNode_t * node);
61 int rf_RecoveryQFunc(RF_DagNode_t * node);
[all...]
H A Drf_dagfuncs.h31 * dagfuncs.h -- header file for DAG node execution routines
39 int rf_TerminateFunc(RF_DagNode_t * node);
40 int rf_TerminateUndoFunc(RF_DagNode_t * node);
41 int rf_DiskReadMirrorIdleFunc(RF_DagNode_t * node);
42 int rf_DiskReadMirrorPartitionFunc(RF_DagNode_t * node);
43 int rf_DiskReadMirrorUndoFunc(RF_DagNode_t * node);
44 int rf_ParityLogUpdateFunc(RF_DagNode_t * node);
45 int rf_ParityLogOverwriteFunc(RF_DagNode_t * node);
46 int rf_ParityLogUpdateUndoFunc(RF_DagNode_t * node);
47 int rf_ParityLogOverwriteUndoFunc(RF_DagNode_t * node);
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/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-6-1-5-RELEASE/tests/util/xlint/lint1/
H A Dd_c9x_recursive_init.c2 union node { union
8 union node n;
/netbsd-6-1-5-RELEASE/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
88 if ((node = cache->node_table[i])) {
91 while ((next_node = node->next)) {
92 objc_hash_remove (cache,node->key);
93 node = next_node;
96 objc_hash_remove (cache,node->key);
110 node_ptr node = (node_ptr) objc_calloc (1, sizeof (struct cache_node)); local
113 assert (node);
115 /* Initialize the new node
174 node_ptr node = cache->node_table[indx]; local
207 objc_hash_next(cache_ptr cache, node_ptr node) argument
249 node_ptr node = cache->node_table[(*cache->hash_func)(cache, key)]; local
270 node_ptr node = cache->node_table[(*cache->hash_func)(cache, key)]; local
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/roff/troff/
H A Dnode.h52 struct node { struct
53 node *next;
54 node *last;
59 node();
60 node(node *);
61 node(node *, statem *, int);
62 node *add_char(charinfo *, environment *, hunits *, int *, node **
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...]

Completed in 372 milliseconds

1234567891011>>