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

1234567891011>>

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/conversion/
H A Dop3.C3 struct node { int* operator int*(); }; // { dg-error "return type specified" } struct
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/
H A Dinitlist78.C4 struct node { struct
5 node &parent;
9 node n;
/haiku-buildtools/gcc/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...]
/haiku-buildtools/gcc/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.c4 (*bla)(int *node);
11 int *node; local
14 if (call_result = after_node_func(node))
17 T(node);
21 T(node);
H A Dpr61964.c5 struct node { struct node *next, *prev; } node; variable in typeref:struct:node
6 struct head { struct node *first; } heads[5];
13 node.prev = (void *)head;
14 head->first = &node;
16 struct node *n = head->first;
25 return n->next == &node;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr62004.c4 struct node struct
6 struct node *next;
7 struct node *prev;
10 struct node node; variable in typeref:struct:node
14 struct node *first;
26 struct node *p;
28 node.next = (void*)0;
30 node.prev = (void *)head;
32 head->first = &node;
[all...]
H A Dpr62167-run.c4 struct node struct
6 struct node *next;
7 struct node *prev;
10 struct node node; variable in typeref:struct:node
14 struct node *first;
26 struct node *p;
28 node.next = (void*)0;
30 node.prev = (void *)head;
32 head->first = &node;
[all...]
H A Dpr62167.c4 struct node struct
6 struct node *next;
7 struct node *prev;
10 struct node node; variable in typeref:struct:node
14 struct node *first;
26 struct node *p;
28 node.next = (void*)0;
30 node.prev = (void *)head;
32 head->first = &node;
[all...]
H A Dpr62030.c6 struct node struct
8 struct node *next;
9 struct node *prev;
12 struct node node; variable in typeref:struct:node
16 struct node *first;
28 node.prev = (void *)head;
29 head->first = &node;
31 struct node *n = head->first;
33 struct node *nex
[all...]
H A Dpr57287-2.c7 struct node struct
9 struct node *next;
13 struct node *list;
14 struct node *head (void);
20 struct node *n;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20000412-5.c3 int node; member in struct:__anon1630
7 if (lastglob[0].node != 0 || lastglob[0].type != 1)
H A D20000801-2.c10 struct foo *test(struct foo *node) argument
12 while (node) {
15 node = node->next;
17 return node;
H A D20030224-2.c8 struct node { struct
14 struct node node, *node_p = &node; variable in typeref:struct:node
18 struct node marker = {
/haiku-buildtools/legacy/gcc/gcc/
H A Dprint-tree.c38 tree node; member in struct:bucket
44 /* Print the node NODE on standard error, for debugging.
49 debug_tree (node)
50 tree node;
56 print_node (stderr, "", node, 0);
62 /* Print a node in brief fashion, with just the code, address and name. */
65 print_node_brief (file, prefix, node, indent)
68 tree node;
73 if (node == 0)
76 class = TREE_CODE_CLASS (TREE_CODE (node));
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dlinked_list_1.f905 ! tried to comparethe types of the components of type(node), even
6 ! though the only component is of type(node).
15 type node type in program:error
17 type(node), pointer :: next
19 type(node), pointer :: list
24 type node
26 type(node), pointer :: next
28 type(node), pointer :: ptr
H A Dpr67460.f9011 TYPE(btree_node), POINTER :: node component in type:btree_node_p
14 RECURSIVE SUBROUTINE btree_verify_node (tree, node, level, nids, lastv,&
16 TYPE(btree_node), INTENT(IN) :: node local in subroutine:btree_verify_node
18 IF (ASSOCIATED (node%subtrees(branch)%node)) THEN
19 IF (node%subtrees(branch)%node%parent%id .NE. node%id) THEN
/haiku-buildtools/legacy/gcc/gcc/cp/
H A Dptree.c29 print_lang_decl (file, node, indent)
31 tree node;
34 if (!DECL_LANG_SPECIFIC (node))
38 if (DECL_MUTABLE_P (node))
43 if (TREE_CODE (node) == FIELD_DECL)
46 if (DECL_MAIN_VARIANT (node))
49 fprintf (file, HOST_PTR_PRINTF, DECL_MAIN_VARIANT (node));
51 if (DECL_PENDING_INLINE_INFO (node))
54 fprintf (file, HOST_PTR_PRINTF, DECL_PENDING_INLINE_INFO (node));
56 if (DECL_TEMPLATE_INFO (node))
[all...]
/haiku-buildtools/gcc/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;
/haiku-buildtools/gcc/gcc/cp/
H A Dptree.c40 cxx_print_decl (FILE *file, tree node, int indent) argument
42 if (TREE_CODE (node) == FIELD_DECL)
44 if (DECL_MUTABLE_P (node))
52 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
53 || !DECL_LANG_SPECIFIC (node))
55 if (TREE_CODE (node) == FUNCTION_DECL)
60 fprintf (file, " full-name \"%s\"", decl_as_string (node, flags));
62 else if (TREE_CODE (node) == TEMPLATE_DECL)
66 decl_as_string (node, TFF_TEMPLATE_HEADER));
70 if (DECL_EXTERNAL (node)
83 cxx_print_type(FILE *file, tree node, int indent) argument
190 cxx_print_identifier(FILE *file, tree node, int indent) argument
207 cxx_print_lambda_node(FILE *file, tree node, int indent) argument
235 cxx_print_xnode(FILE *file, tree node, int indent) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/mips/
H A Dpr62030-octeon.c6 struct node struct
8 struct node *next;
9 struct node *prev;
12 struct node node; variable in typeref:struct:node
16 struct node *first;
28 node.prev = (void *)head;
29 head->first = &node;
31 struct node *n = head->first;
33 struct node *nex
[all...]
/haiku-buildtools/gcc/gcc/
H A Dprint-tree.c65 tree node; member in struct:bucket
81 /* Print a node in brief fashion, with just the code, address and name. */
84 print_node_brief (FILE *file, const char *prefix, const_tree node, int indent) argument
88 if (node == 0)
91 tclass = TREE_CODE_CLASS (TREE_CODE (node));
93 /* Always print the slot this node is in, and its code, address and
97 fprintf (file, "%s <%s", prefix, get_tree_code_name (TREE_CODE (node)));
98 dump_addr (file, " ", node);
102 if (DECL_NAME (node))
103 fprintf (file, " %s", IDENTIFIER_POINTER (DECL_NAME (node)));
200 print_node(FILE *file, const char *prefix, tree node, int indent) argument
954 debug_tree(tree node) argument
[all...]
/haiku-buildtools/gcc/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...]
/haiku-buildtools/legacy/gcc/libobjc/
H A Dhash.c82 node_ptr node; local
87 /* Step through the nodes one by one and remove every node WITHOUT
90 if ((node = cache->node_table[i])) {
93 while ((next_node = node->next)) {
94 hash_remove (cache,node->key);
95 node = next_node;
98 hash_remove (cache,node->key);
112 node_ptr node = (node_ptr) objc_calloc (1, sizeof (struct cache_node)); local
115 assert (node);
117 /* Initialize the new node
176 node_ptr node = cache->node_table[indx]; local
209 hash_next(cache_ptr cache, node_ptr node) argument
251 node_ptr node = cache->node_table[(*cache->hash_func)(cache, key)]; local
272 node_ptr node = cache->node_table[(*cache->hash_func)(cache, key)]; local
[all...]
/haiku-buildtools/gcc/libcilkrts/runtime/
H A Dsignal_node.h47 * that one node need share a cache line with a user worker.
72 * @param node The node to be deallocated.
74 COMMON_SYSDEP void signal_node_destroy(signal_node_t *node);
77 * Test whether the node thinks the worker should go to sleep
79 * @param node The node to be tested.
85 unsigned int signal_node_should_wait(signal_node_t *node);
90 * @param node The node t
[all...]

Completed in 89 milliseconds

1234567891011>>