]>
Commit | Line | Data |
---|---|---|
e5e809f4 | 1 | /* Process declarations and variables for C compiler. |
c12f5242 | 2 | Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc. |
e5e809f4 | 3 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
8d08fdba MS |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
8d08fdba MS |
21 | |
22 | ||
23 | /* Process declarations and symbol lookup for C front end. | |
24 | Also constructs types; the standard scalar types at initialization, | |
25 | and structure, union, array and enum types when they are declared. */ | |
26 | ||
27 | /* ??? not all decl nodes are given the most useful possible | |
28 | line numbers. For example, the CONST_DECLs for enum values. */ | |
29 | ||
8d08fdba | 30 | #include "config.h" |
8d052bc7 | 31 | #include "system.h" |
8d08fdba MS |
32 | #include "tree.h" |
33 | #include "rtl.h" | |
34 | #include "flags.h" | |
35 | #include "cp-tree.h" | |
36 | #include "decl.h" | |
37 | #include "lex.h" | |
8d08fdba MS |
38 | #include <signal.h> |
39 | #include "obstack.h" | |
72b7eeff | 40 | #include "defaults.h" |
49c249e1 JM |
41 | #include "output.h" |
42 | #include "except.h" | |
54f92bfb | 43 | #include "toplev.h" |
7ddedda4 | 44 | #include "../hash.h" |
091f9839 | 45 | #include "defaults.h" |
4519c0a8 | 46 | #include "ggc.h" |
8d08fdba MS |
47 | |
48 | #define obstack_chunk_alloc xmalloc | |
49 | #define obstack_chunk_free free | |
50 | ||
51 | extern struct obstack permanent_obstack; | |
ae0a6181 | 52 | extern struct obstack* saveable_obstack; |
8d08fdba MS |
53 | |
54 | extern int current_class_depth; | |
55 | ||
e1cd6e56 MS |
56 | extern tree static_ctors, static_dtors; |
57 | ||
30394414 JM |
58 | extern tree global_namespace; |
59 | ||
e5dc5fb2 | 60 | extern int (*valid_lang_attribute) PROTO ((tree, tree, tree, tree)); |
62c154ed | 61 | |
47e19316 | 62 | /* Use garbage collection. */ |
fc6af6e3 | 63 | |
47e19316 | 64 | int ggc_p = 1; |
fc6af6e3 | 65 | |
8d08fdba MS |
66 | /* Obstack used for remembering local class declarations (like |
67 | enums and static (const) members. */ | |
68 | #include "stack.h" | |
5566b478 | 69 | struct obstack decl_obstack; |
8d08fdba MS |
70 | static struct stack_level *decl_stack; |
71 | ||
8d08fdba MS |
72 | #ifndef WCHAR_UNSIGNED |
73 | #define WCHAR_UNSIGNED 0 | |
74 | #endif | |
75 | ||
81b3411c BS |
76 | #ifndef CHAR_TYPE_SIZE |
77 | #define CHAR_TYPE_SIZE BITS_PER_UNIT | |
8d08fdba MS |
78 | #endif |
79 | ||
255512c1 | 80 | #ifndef BOOL_TYPE_SIZE |
e1cd6e56 | 81 | #ifdef SLOW_BYTE_ACCESS |
d2e5ee5c | 82 | #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE)) |
e1cd6e56 | 83 | #else |
d2e5ee5c | 84 | #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE |
e1cd6e56 | 85 | #endif |
255512c1 JM |
86 | #endif |
87 | ||
8d08fdba MS |
88 | /* We let tm.h override the types used here, to handle trivial differences |
89 | such as the choice of unsigned int or long unsigned int for size_t. | |
90 | When machines start needing nontrivial differences in the size type, | |
91 | it would be best to do something here to figure out automatically | |
92 | from other information what type to use. */ | |
93 | ||
94 | #ifndef SIZE_TYPE | |
95 | #define SIZE_TYPE "long unsigned int" | |
96 | #endif | |
97 | ||
98 | #ifndef PTRDIFF_TYPE | |
99 | #define PTRDIFF_TYPE "long int" | |
100 | #endif | |
101 | ||
102 | #ifndef WCHAR_TYPE | |
103 | #define WCHAR_TYPE "int" | |
104 | #endif | |
105 | ||
8d08fdba | 106 | static tree grokparms PROTO((tree, int)); |
d8e178a0 | 107 | static const char *redeclaration_error_message PROTO((tree, tree)); |
8d08fdba | 108 | |
49c249e1 JM |
109 | static struct stack_level *push_decl_level PROTO((struct stack_level *, |
110 | struct obstack *)); | |
111 | static void push_binding_level PROTO((struct binding_level *, int, | |
112 | int)); | |
113 | static void pop_binding_level PROTO((void)); | |
114 | static void suspend_binding_level PROTO((void)); | |
115 | static void resume_binding_level PROTO((struct binding_level *)); | |
116 | static struct binding_level *make_binding_level PROTO((void)); | |
49c249e1 | 117 | static void declare_namespace_level PROTO((void)); |
1ddb2906 | 118 | static void signal_catch PROTO((int)) ATTRIBUTE_NORETURN; |
49c249e1 | 119 | static void storedecls PROTO((tree)); |
49c249e1 JM |
120 | static void require_complete_types_for_parms PROTO((tree)); |
121 | static void push_overloaded_decl_1 PROTO((tree)); | |
122 | static int ambi_op_p PROTO((tree)); | |
123 | static int unary_op_p PROTO((tree)); | |
124 | static tree store_bindings PROTO((tree, tree)); | |
125 | static tree lookup_tag_reverse PROTO((tree, tree)); | |
126 | static tree obscure_complex_init PROTO((tree, tree)); | |
127 | static tree maybe_build_cleanup_1 PROTO((tree, tree)); | |
3e3f722c | 128 | static tree lookup_name_real PROTO((tree, int, int, int)); |
49c249e1 | 129 | static void warn_extern_redeclared_static PROTO((tree, tree)); |
a703fb38 | 130 | static void grok_reference_init PROTO((tree, tree, tree)); |
386b8a85 | 131 | static tree grokfndecl PROTO((tree, tree, tree, tree, int, |
2c73f9f5 | 132 | enum overload_flags, tree, |
7a8f9fa9 | 133 | tree, int, int, int, int, int, int, tree)); |
2c73f9f5 | 134 | static tree grokvardecl PROTO((tree, tree, RID_BIT_TYPE *, int, int, tree)); |
49c249e1 JM |
135 | static tree lookup_tag PROTO((enum tree_code, tree, |
136 | struct binding_level *, int)); | |
137 | static void set_identifier_type_value_with_scope | |
138 | PROTO((tree, tree, struct binding_level *)); | |
d8e178a0 KG |
139 | static void record_builtin_type PROTO((enum rid, const char *, tree)); |
140 | static void record_unknown_type PROTO((tree, const char *)); | |
141 | static int member_function_or_else PROTO((tree, tree, const char *)); | |
142 | static void bad_specifiers PROTO((tree, const char *, int, int, int, int, | |
49c249e1 | 143 | int)); |
8df4696d | 144 | static void lang_print_error_function PROTO((const char *)); |
39c01e4c | 145 | static tree maybe_process_template_type_declaration PROTO((tree, int, struct binding_level*)); |
91063b51 | 146 | static void check_for_uninitialized_const_var PROTO((tree)); |
7ddedda4 MM |
147 | static unsigned long typename_hash PROTO((hash_table_key)); |
148 | static boolean typename_compare PROTO((hash_table_key, hash_table_key)); | |
f181d4ae | 149 | static void push_binding PROTO((tree, tree, struct binding_level*)); |
8f032717 | 150 | static int add_binding PROTO((tree, tree)); |
d8f8dca1 | 151 | static void pop_binding PROTO((tree, tree)); |
297e73d8 | 152 | static tree local_variable_p PROTO((tree)); |
d8e178a0 KG |
153 | static tree find_binding PROTO((tree, tree)); |
154 | static tree select_decl PROTO((tree, int)); | |
d8e178a0 KG |
155 | static int lookup_flags PROTO((int, int)); |
156 | static tree qualify_lookup PROTO((tree, int)); | |
157 | static tree record_builtin_java_type PROTO((const char *, int)); | |
158 | static const char *tag_name PROTO((enum tag_types code)); | |
8f032717 MM |
159 | static void find_class_binding_level PROTO((void)); |
160 | static struct binding_level *innermost_nonclass_level PROTO((void)); | |
235f734d | 161 | static void warn_about_implicit_typename_lookup PROTO((tree, tree)); |
0aafb128 MM |
162 | static int walk_namespaces_r PROTO((tree, walk_namespaces_fn, void *)); |
163 | static int walk_globals_r PROTO((tree, void *)); | |
cfe507be | 164 | static void add_decl_to_level PROTO((tree, struct binding_level *)); |
acef433b MM |
165 | static tree make_label_decl PROTO((tree, int)); |
166 | static void pop_label PROTO((tree)); | |
167 | static void pop_labels PROTO((tree)); | |
27778b73 | 168 | static void maybe_deduce_size_from_array_init PROTO((tree, tree)); |
c82dbd95 | 169 | static tree layout_var_decl PROTO((tree, tree)); |
27778b73 | 170 | static void maybe_commonize_var PROTO((tree)); |
c82dbd95 | 171 | static tree check_initializer PROTO((tree, tree)); |
27778b73 | 172 | static void make_rtl_for_nonlocal_decl PROTO((tree, tree, const char *)); |
99dccabc MM |
173 | static void push_cp_function_context PROTO((struct function *)); |
174 | static void pop_cp_function_context PROTO((struct function *)); | |
4519c0a8 MM |
175 | static void mark_binding_level PROTO((void *)); |
176 | static void mark_cp_function_context PROTO((struct function *)); | |
47e19316 | 177 | static void mark_saved_scope PROTO((void *)); |
a8f73d4b | 178 | static void check_function_type PROTO((tree)); |
f0105ed3 | 179 | static void destroy_local_static PROTO((tree)); |
24bef158 | 180 | static void destroy_local_var PROTO((tree)); |
8d08fdba | 181 | |
69ac77ce JL |
182 | #if defined (DEBUG_CP_BINDING_LEVELS) |
183 | static void indent PROTO((void)); | |
184 | #endif | |
185 | ||
8d08fdba MS |
186 | /* Erroneous argument lists can use this *IFF* they do not modify it. */ |
187 | tree error_mark_list; | |
188 | ||
7f4edbcb BS |
189 | /* The following symbols are subsumed in the cp_global_trees array, and |
190 | listed here individually for documentation purposes. | |
8d08fdba | 191 | |
7f4edbcb BS |
192 | C++ extensions |
193 | tree wchar_decl_node; | |
194 | tree void_zero_node; | |
37c46b43 | 195 | |
7f4edbcb BS |
196 | tree vtable_entry_type; |
197 | tree delta_type_node; | |
198 | #if 0 | |
199 | Old rtti stuff. | |
200 | tree __baselist_desc_type_node; | |
201 | tree __i_desc_type_node, __m_desc_type_node; | |
202 | tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type; | |
946dc1c8 | 203 | #endif |
7f4edbcb BS |
204 | tree __t_desc_type_node; |
205 | #if 0 | |
206 | tree __tp_desc_type_node; | |
207 | #endif | |
208 | tree __access_mode_type_node; | |
209 | tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node; | |
210 | tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node; | |
211 | tree __ptmf_desc_type_node, __ptmd_desc_type_node; | |
212 | #if 0 | |
213 | Not needed yet? May be needed one day? | |
214 | tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type; | |
215 | tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type; | |
216 | tree __ptmf_desc_array_type, __ptmd_desc_array_type; | |
946dc1c8 | 217 | #endif |
8d08fdba | 218 | |
7f4edbcb BS |
219 | tree class_star_type_node; |
220 | tree class_type_node, record_type_node, union_type_node, enum_type_node; | |
221 | tree unknown_type_node; | |
8d08fdba | 222 | |
7f4edbcb | 223 | Array type `vtable_entry_type[]' |
8d08fdba | 224 | |
7f4edbcb BS |
225 | tree vtbl_type_node; |
226 | tree vtbl_ptr_type_node; | |
8d08fdba | 227 | |
7f4edbcb | 228 | Nnamespace std |
8d08fdba | 229 | |
7f4edbcb | 230 | tree std_node; |
8d08fdba | 231 | |
7f4edbcb BS |
232 | A FUNCTION_DECL which can call `abort'. Not necessarily the |
233 | one that the user will declare, but sufficient to be called | |
234 | by routines that want to abort the program. | |
8d08fdba | 235 | |
7f4edbcb | 236 | tree abort_fndecl; |
8d08fdba | 237 | |
7f4edbcb | 238 | The FUNCTION_DECL for the default `::operator delete'. |
2986ae00 | 239 | |
7f4edbcb | 240 | tree global_delete_fndecl; |
8d08fdba | 241 | |
7f4edbcb BS |
242 | Used by RTTI |
243 | tree type_info_type_node, tinfo_fn_id, tinfo_fn_type; | |
8d08fdba | 244 | |
7f4edbcb | 245 | */ |
8d08fdba | 246 | |
7f4edbcb | 247 | tree cp_global_trees[CPTI_MAX]; |
8d08fdba | 248 | |
2c73f9f5 | 249 | /* Indicates that there is a type value in some namespace, although |
7f4edbcb | 250 | that is not necessarily in scope at the moment. */ |
2c73f9f5 ML |
251 | |
252 | static tree global_type_node; | |
253 | ||
7f4edbcb | 254 | /* Namespace std. */ |
0dde4175 | 255 | int in_std; |
6633d636 | 256 | |
3e3f722c ML |
257 | /* Expect only namespace names now. */ |
258 | static int only_namespace_names; | |
259 | ||
72b7eeff MS |
260 | /* In a destructor, the last insn emitted after the start of the |
261 | function and the parms. */ | |
262 | ||
4519c0a8 | 263 | #define last_dtor_insn cp_function_chain->x_last_dtor_insn |
72b7eeff | 264 | |
b87692e5 | 265 | /* In a constructor, the last insn emitted after the start of the |
9664b89e JM |
266 | function and the parms, the exception specification and any |
267 | function-try-block. The constructor initializers are emitted after | |
268 | this insn. */ | |
b87692e5 | 269 | |
4519c0a8 | 270 | #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn |
8d08fdba | 271 | |
8d08fdba MS |
272 | /* If original DECL_RESULT of current function was a register, |
273 | but due to being an addressable named return value, would up | |
274 | on the stack, this variable holds the named return value's | |
275 | original location. */ | |
8d08fdba | 276 | |
4519c0a8 | 277 | #define original_result_rtx cp_function_chain->x_result_rtx |
8d08fdba | 278 | |
e349ee73 MS |
279 | struct named_label_list |
280 | { | |
281 | struct binding_level *binding_level; | |
282 | tree names_in_scope; | |
283 | tree label_decl; | |
9c0758dd | 284 | const char *filename_o_goto; |
e349ee73 MS |
285 | int lineno_o_goto; |
286 | struct named_label_list *next; | |
287 | }; | |
288 | ||
ed5511d9 MM |
289 | /* Used only for jumps to as-yet undefined labels, since jumps to |
290 | defined labels can have their validity checked by stmt.c. */ | |
8d08fdba | 291 | |
ed5511d9 | 292 | #define named_label_uses cp_function_chain->x_named_label_uses |
8d08fdba MS |
293 | |
294 | /* A list of objects which have constructors or destructors | |
295 | which reside in the global scope. The decl is stored in | |
296 | the TREE_VALUE slot and the initializer is stored | |
297 | in the TREE_PURPOSE slot. */ | |
298 | tree static_aggregates; | |
299 | ||
8d08fdba MS |
300 | /* -- end of C++ */ |
301 | ||
81b3411c | 302 | /* A node for the integer constants 2, and 3. */ |
d11ad92e | 303 | |
81b3411c | 304 | tree integer_two_node, integer_three_node; |
8d08fdba | 305 | |
8d08fdba MS |
306 | /* While defining an enum type, this is 1 plus the last enumerator |
307 | constant value. */ | |
308 | ||
309 | static tree enum_next_value; | |
310 | ||
7177d104 MS |
311 | /* Nonzero means that there was overflow computing enum_next_value. */ |
312 | ||
313 | static int enum_overflow; | |
314 | ||
8d08fdba MS |
315 | /* Parsing a function declarator leaves here a chain of structure |
316 | and enum types declared in the parmlist. */ | |
317 | ||
318 | static tree last_function_parm_tags; | |
319 | ||
8d08fdba | 320 | /* Similar, for last_function_parm_tags. */ |
9cd64686 | 321 | tree last_function_parms; |
8d08fdba MS |
322 | static tree current_function_parm_tags; |
323 | ||
324 | /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function | |
325 | that have names. Here so we can clear out their names' definitions | |
acef433b MM |
326 | at the end of the function. The TREE_VALUE is a LABEL_DECL; the |
327 | TREE_PURPOSE is the previous binding of the label. */ | |
8d08fdba | 328 | |
4519c0a8 | 329 | #define named_labels cp_function_chain->x_named_labels |
8d08fdba | 330 | |
8d08fdba MS |
331 | /* The FUNCTION_DECL for the function currently being compiled, |
332 | or 0 if between functions. */ | |
333 | tree current_function_decl; | |
334 | ||
8d08fdba MS |
335 | /* Set to 0 at beginning of a function definition, and whenever |
336 | a label (case or named) is defined. Set to value of expression | |
337 | returned from function when that value can be transformed into | |
338 | a named return value. */ | |
339 | ||
340 | tree current_function_return_value; | |
341 | ||
8d08fdba MS |
342 | /* Nonzero means give `double' the same size as `float'. */ |
343 | ||
344 | extern int flag_short_double; | |
345 | ||
346 | /* Nonzero means don't recognize any builtin functions. */ | |
347 | ||
348 | extern int flag_no_builtin; | |
349 | ||
00595019 MS |
350 | /* Nonzero means don't recognize the non-ANSI builtin functions. |
351 | -ansi sets this. */ | |
352 | ||
353 | extern int flag_no_nonansi_builtin; | |
354 | ||
e1cd6e56 MS |
355 | /* Nonzero means enable obscure ANSI features and disable GNU extensions |
356 | that might cause ANSI-compliant code to be miscompiled. */ | |
8d08fdba MS |
357 | |
358 | extern int flag_ansi; | |
359 | ||
360 | /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes) | |
e92cc029 | 361 | objects. */ |
8d08fdba MS |
362 | extern int flag_huge_objects; |
363 | ||
364 | /* Nonzero if we want to conserve space in the .o files. We do this | |
365 | by putting uninitialized data and runtime initialized data into | |
ddd5a7c1 | 366 | .common instead of .data at the expense of not flagging multiple |
8d08fdba MS |
367 | definitions. */ |
368 | extern int flag_conserve_space; | |
8d08fdba | 369 | \f |
51c184be | 370 | /* C and C++ flags are in decl2.c. */ |
8d08fdba MS |
371 | |
372 | /* Set to 0 at beginning of a constructor, set to 1 | |
373 | if that function does an allocation before referencing its | |
374 | instance variable. */ | |
8012c983 MM |
375 | #define current_function_assigns_this cp_function_chain->assigns_this |
376 | #define current_function_just_assigned_this \ | |
377 | cp_function_chain->just_assigned_this | |
8d08fdba | 378 | |
51c184be | 379 | /* Flag used when debugging spew.c */ |
8d08fdba MS |
380 | |
381 | extern int spew_debug; | |
382 | ||
e92cc029 MS |
383 | /* A expression of value 0 with the same precision as a sizetype |
384 | node, but signed. */ | |
385 | tree signed_size_zero_node; | |
386 | ||
0c8feefe MM |
387 | /* The name of the anonymous namespace, throughout this translation |
388 | unit. */ | |
389 | tree anonymous_namespace_name; | |
390 | ||
8d08fdba MS |
391 | \f |
392 | /* Allocate a level of searching. */ | |
e92cc029 | 393 | |
824b9a4c | 394 | static |
8d08fdba MS |
395 | struct stack_level * |
396 | push_decl_level (stack, obstack) | |
397 | struct stack_level *stack; | |
398 | struct obstack *obstack; | |
399 | { | |
400 | struct stack_level tem; | |
401 | tem.prev = stack; | |
402 | ||
403 | return push_stack_level (obstack, (char *)&tem, sizeof (tem)); | |
404 | } | |
405 | \f | |
406 | /* For each binding contour we allocate a binding_level structure | |
e92cc029 MS |
407 | which records the names defined in that contour. |
408 | Contours include: | |
409 | 0) the global one | |
410 | 1) one for each function definition, | |
411 | where internal declarations of the parameters appear. | |
412 | 2) one for each compound statement, | |
413 | to record its declarations. | |
414 | ||
415 | The current meaning of a name can be found by searching the levels | |
416 | from the current one out to the global one. | |
417 | ||
418 | Off to the side, may be the class_binding_level. This exists only | |
419 | to catch class-local declarations. It is otherwise nonexistent. | |
420 | ||
421 | Also there may be binding levels that catch cleanups that must be | |
d8f8dca1 MM |
422 | run when exceptions occur. Thus, to see whether a name is bound in |
423 | the current scope, it is not enough to look in the | |
424 | CURRENT_BINDING_LEVEL. You should use lookup_name_current_level | |
425 | instead. */ | |
8d08fdba MS |
426 | |
427 | /* Note that the information in the `names' component of the global contour | |
428 | is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */ | |
429 | ||
430 | struct binding_level | |
431 | { | |
432 | /* A chain of _DECL nodes for all variables, constants, functions, | |
e92cc029 | 433 | and typedef types. These are in the reverse of the order |
f181d4ae MM |
434 | supplied. There may be OVERLOADs on this list, too, but they |
435 | are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */ | |
8d08fdba MS |
436 | tree names; |
437 | ||
e92cc029 MS |
438 | /* A list of structure, union and enum definitions, for looking up |
439 | tag names. | |
440 | It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name, | |
441 | or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE, | |
442 | or ENUMERAL_TYPE node. | |
443 | ||
444 | C++: the TREE_VALUE nodes can be simple types for | |
445 | component_bindings. */ | |
8d08fdba MS |
446 | tree tags; |
447 | ||
2c73f9f5 ML |
448 | /* A list of USING_DECL nodes. */ |
449 | tree usings; | |
450 | ||
ea9635c7 ML |
451 | /* A list of used namespaces. PURPOSE is the namespace, |
452 | VALUE the common ancestor with this binding_level's namespace. */ | |
453 | tree using_directives; | |
454 | ||
f181d4ae MM |
455 | /* If this binding level is the binding level for a class, then |
456 | class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node | |
457 | is the name of an entity bound in the class; the TREE_VALUE is | |
458 | the IDENTIFIER_CLASS_VALUE before we entered the class. Thus, | |
459 | when leaving class scope, we can restore the | |
d8f8dca1 MM |
460 | IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is |
461 | the DECL bound by this name in the class. */ | |
8d08fdba MS |
462 | tree class_shadowed; |
463 | ||
f181d4ae MM |
464 | /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and |
465 | is used for all binding levels. */ | |
8d08fdba MS |
466 | tree type_shadowed; |
467 | ||
acef433b MM |
468 | /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local |
469 | label in this scope. The TREE_PURPOSE is the previous value of | |
470 | the IDENTIFIER_LABEL VALUE. */ | |
471 | tree shadowed_labels; | |
472 | ||
8d08fdba MS |
473 | /* For each level (except not the global one), |
474 | a chain of BLOCK nodes for all the levels | |
475 | that were entered and exited one level down. */ | |
476 | tree blocks; | |
477 | ||
478 | /* The BLOCK node for this level, if one has been preallocated. | |
479 | If 0, the BLOCK is allocated (if needed) when the level is popped. */ | |
480 | tree this_block; | |
481 | ||
482 | /* The binding level which this one is contained in (inherits from). */ | |
483 | struct binding_level *level_chain; | |
484 | ||
f30432d7 | 485 | /* List of decls in `names' that have incomplete |
8d08fdba | 486 | structure or union types. */ |
f30432d7 | 487 | tree incomplete; |
8d08fdba | 488 | |
8d6e462b | 489 | /* List of VAR_DECLS saved from a previous for statement. |
abc95ed3 | 490 | These would be dead in ANSI-conforming code, but might |
f181d4ae MM |
491 | be referenced in ARM-era code. These are stored in a |
492 | TREE_LIST; the TREE_VALUE is the actual declaration. */ | |
8d6e462b PB |
493 | tree dead_vars_from_for; |
494 | ||
8d08fdba MS |
495 | /* 1 for the level that holds the parameters of a function. |
496 | 2 for the level that holds a class declaration. | |
497 | 3 for levels that hold parameter declarations. */ | |
498 | unsigned parm_flag : 4; | |
499 | ||
500 | /* 1 means make a BLOCK for this level regardless of all else. | |
501 | 2 for temporary binding contours created by the compiler. */ | |
502 | unsigned keep : 3; | |
503 | ||
504 | /* Nonzero if this level "doesn't exist" for tags. */ | |
505 | unsigned tag_transparent : 1; | |
506 | ||
507 | /* Nonzero if this level can safely have additional | |
508 | cleanup-needing variables added to it. */ | |
509 | unsigned more_cleanups_ok : 1; | |
510 | unsigned have_cleanups : 1; | |
511 | ||
5566b478 MS |
512 | /* Nonzero if this level is for storing the decls for template |
513 | parameters and generic decls; these decls will be discarded and | |
514 | replaced with a TEMPLATE_DECL. */ | |
8d08fdba MS |
515 | unsigned pseudo_global : 1; |
516 | ||
a9aedbc2 MS |
517 | /* This is set for a namespace binding level. */ |
518 | unsigned namespace_p : 1; | |
519 | ||
2ee887f2 | 520 | /* True if this level is that of a for-statement where we need to |
d22c8596 | 521 | worry about ambiguous (ARM or ANSI) scope rules. */ |
8d6e462b PB |
522 | unsigned is_for_scope : 1; |
523 | ||
227cf171 JM |
524 | /* True if this level corresponds to an EH region, as for a try block. */ |
525 | unsigned eh_region : 1; | |
526 | ||
527 | /* One bit left for this word. */ | |
8d08fdba MS |
528 | |
529 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
530 | /* Binding depth at which this level began. */ | |
531 | unsigned binding_depth; | |
532 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
533 | }; | |
534 | ||
535 | #define NULL_BINDING_LEVEL ((struct binding_level *) NULL) | |
536 | ||
8f032717 | 537 | /* The binding level currently in effect. */ |
8d08fdba | 538 | |
a8f73d4b MM |
539 | #define current_binding_level \ |
540 | (current_function \ | |
541 | ? cp_function_chain->bindings \ | |
542 | : scope_chain->bindings) | |
8d08fdba MS |
543 | |
544 | /* The binding level of the current class, if any. */ | |
545 | ||
9cd64686 | 546 | #define class_binding_level scope_chain->class_bindings |
8d08fdba | 547 | |
8d08fdba MS |
548 | /* A chain of binding_level structures awaiting reuse. */ |
549 | ||
550 | static struct binding_level *free_binding_level; | |
551 | ||
552 | /* The outermost binding level, for names of file scope. | |
553 | This is created when the compiler is started and exists | |
554 | through the entire run. */ | |
555 | ||
556 | static struct binding_level *global_binding_level; | |
557 | ||
8d08fdba MS |
558 | /* Nonzero means unconditionally make a BLOCK for the next level pushed. */ |
559 | ||
560 | static int keep_next_level_flag; | |
561 | ||
562 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
563 | static int binding_depth = 0; | |
564 | static int is_class_level = 0; | |
565 | ||
566 | static void | |
567 | indent () | |
568 | { | |
569 | register unsigned i; | |
570 | ||
571 | for (i = 0; i < binding_depth*2; i++) | |
572 | putc (' ', stderr); | |
573 | } | |
574 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
575 | ||
576 | static tree pushdecl_with_scope PROTO((tree, struct binding_level *)); | |
577 | ||
578 | static void | |
579 | push_binding_level (newlevel, tag_transparent, keep) | |
580 | struct binding_level *newlevel; | |
581 | int tag_transparent, keep; | |
582 | { | |
583 | /* Add this level to the front of the chain (stack) of levels that | |
584 | are active. */ | |
acef433b | 585 | bzero ((char*) newlevel, sizeof (struct binding_level)); |
8f032717 | 586 | newlevel->level_chain = current_binding_level; |
8d08fdba MS |
587 | current_binding_level = newlevel; |
588 | newlevel->tag_transparent = tag_transparent; | |
589 | newlevel->more_cleanups_ok = 1; | |
227cf171 JM |
590 | |
591 | /* We are called before expand_start_bindings, but after | |
592 | expand_eh_region_start for a try block; so we check this now, | |
593 | before the EH block is covered up. */ | |
594 | newlevel->eh_region = is_eh_region (); | |
595 | ||
8d08fdba MS |
596 | newlevel->keep = keep; |
597 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
598 | newlevel->binding_depth = binding_depth; | |
599 | indent (); | |
600 | fprintf (stderr, "push %s level 0x%08x line %d\n", | |
601 | (is_class_level) ? "class" : "block", newlevel, lineno); | |
602 | is_class_level = 0; | |
603 | binding_depth++; | |
604 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
605 | } | |
606 | ||
8f032717 MM |
607 | /* Find the innermost enclosing class scope, and reset |
608 | CLASS_BINDING_LEVEL appropriately. */ | |
609 | ||
610 | static void | |
611 | find_class_binding_level () | |
612 | { | |
613 | struct binding_level *level = current_binding_level; | |
614 | ||
615 | while (level && level->parm_flag != 2) | |
616 | level = level->level_chain; | |
617 | if (level && level->parm_flag == 2) | |
618 | class_binding_level = level; | |
619 | else | |
620 | class_binding_level = 0; | |
621 | } | |
622 | ||
8d08fdba MS |
623 | static void |
624 | pop_binding_level () | |
625 | { | |
8d08fdba MS |
626 | if (global_binding_level) |
627 | { | |
2c73f9f5 | 628 | /* Cannot pop a level, if there are none left to pop. */ |
8d08fdba MS |
629 | if (current_binding_level == global_binding_level) |
630 | my_friendly_abort (123); | |
631 | } | |
632 | /* Pop the current level, and free the structure for reuse. */ | |
633 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
634 | binding_depth--; | |
635 | indent (); | |
636 | fprintf (stderr, "pop %s level 0x%08x line %d\n", | |
637 | (is_class_level) ? "class" : "block", | |
638 | current_binding_level, lineno); | |
639 | if (is_class_level != (current_binding_level == class_binding_level)) | |
9e9ff709 MS |
640 | { |
641 | indent (); | |
642 | fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n"); | |
643 | } | |
8d08fdba MS |
644 | is_class_level = 0; |
645 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
646 | { | |
647 | register struct binding_level *level = current_binding_level; | |
648 | current_binding_level = current_binding_level->level_chain; | |
649 | level->level_chain = free_binding_level; | |
650 | #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
651 | if (level->binding_depth != binding_depth) | |
652 | abort (); | |
653 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
8f032717 MM |
654 | free_binding_level = level; |
655 | find_class_binding_level (); | |
8d08fdba MS |
656 | } |
657 | } | |
a9aedbc2 MS |
658 | |
659 | static void | |
660 | suspend_binding_level () | |
661 | { | |
662 | if (class_binding_level) | |
663 | current_binding_level = class_binding_level; | |
664 | ||
665 | if (global_binding_level) | |
666 | { | |
2c73f9f5 | 667 | /* Cannot suspend a level, if there are none left to suspend. */ |
a9aedbc2 MS |
668 | if (current_binding_level == global_binding_level) |
669 | my_friendly_abort (123); | |
670 | } | |
671 | /* Suspend the current level. */ | |
672 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
673 | binding_depth--; | |
674 | indent (); | |
675 | fprintf (stderr, "suspend %s level 0x%08x line %d\n", | |
676 | (is_class_level) ? "class" : "block", | |
677 | current_binding_level, lineno); | |
678 | if (is_class_level != (current_binding_level == class_binding_level)) | |
9e9ff709 MS |
679 | { |
680 | indent (); | |
681 | fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n"); | |
682 | } | |
a9aedbc2 MS |
683 | is_class_level = 0; |
684 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
8f032717 MM |
685 | current_binding_level = current_binding_level->level_chain; |
686 | find_class_binding_level (); | |
a9aedbc2 MS |
687 | } |
688 | ||
824b9a4c | 689 | static void |
a9aedbc2 MS |
690 | resume_binding_level (b) |
691 | struct binding_level *b; | |
692 | { | |
2c73f9f5 ML |
693 | /* Resuming binding levels is meant only for namespaces, |
694 | and those cannot nest into classes. */ | |
695 | my_friendly_assert(!class_binding_level, 386); | |
696 | /* Also, resuming a non-directly nested namespace is a no-no. */ | |
697 | my_friendly_assert(b->level_chain == current_binding_level, 386); | |
a9aedbc2 MS |
698 | current_binding_level = b; |
699 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
700 | b->binding_depth = binding_depth; | |
701 | indent (); | |
702 | fprintf (stderr, "resume %s level 0x%08x line %d\n", | |
703 | (is_class_level) ? "class" : "block", b, lineno); | |
704 | is_class_level = 0; | |
705 | binding_depth++; | |
706 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
707 | } | |
8d08fdba | 708 | \f |
cffa8729 MS |
709 | /* Create a new `struct binding_level'. */ |
710 | ||
711 | static | |
712 | struct binding_level * | |
713 | make_binding_level () | |
714 | { | |
715 | /* NOSTRICT */ | |
716 | return (struct binding_level *) xmalloc (sizeof (struct binding_level)); | |
717 | } | |
718 | ||
8d08fdba MS |
719 | /* Nonzero if we are currently in the global binding level. */ |
720 | ||
721 | int | |
722 | global_bindings_p () | |
723 | { | |
724 | return current_binding_level == global_binding_level; | |
725 | } | |
726 | ||
8f032717 MM |
727 | /* Return the innermost binding level that is not for a class scope. */ |
728 | ||
729 | static struct binding_level * | |
730 | innermost_nonclass_level () | |
731 | { | |
732 | struct binding_level *b; | |
733 | ||
734 | b = current_binding_level; | |
735 | while (b->parm_flag == 2) | |
736 | b = b->level_chain; | |
737 | ||
738 | return b; | |
739 | } | |
740 | ||
a9aedbc2 MS |
741 | /* Nonzero if we are currently in a toplevel binding level. This |
742 | means either the global binding level or a namespace in a toplevel | |
8f032717 MM |
743 | binding level. Since there are no non-toplevel namespace levels, |
744 | this really means any namespace or pseudo-global level. We also | |
745 | include a class whose context is toplevel. */ | |
a9aedbc2 MS |
746 | |
747 | int | |
748 | toplevel_bindings_p () | |
749 | { | |
8f032717 MM |
750 | struct binding_level *b = innermost_nonclass_level (); |
751 | ||
752 | return b->namespace_p || b->pseudo_global; | |
a9aedbc2 MS |
753 | } |
754 | ||
8f032717 MM |
755 | /* Nonzero if this is a namespace scope, or if we are defining a class |
756 | which is itself at namespace scope, or whose enclosing class is | |
757 | such a class, etc. */ | |
a9aedbc2 | 758 | |
7bdbfa05 | 759 | int |
a9aedbc2 MS |
760 | namespace_bindings_p () |
761 | { | |
8f032717 MM |
762 | struct binding_level *b = innermost_nonclass_level (); |
763 | ||
764 | return b->namespace_p; | |
a9aedbc2 MS |
765 | } |
766 | ||
f1dedc31 MM |
767 | /* If KEEP is non-zero, make a BLOCK node for the next binding level, |
768 | unconditionally. Otherwise, use the normal logic to decide whether | |
769 | or not to create a BLOCK. */ | |
770 | ||
8d08fdba | 771 | void |
f1dedc31 MM |
772 | keep_next_level (keep) |
773 | int keep; | |
8d08fdba | 774 | { |
f1dedc31 | 775 | keep_next_level_flag = keep; |
8d08fdba MS |
776 | } |
777 | ||
778 | /* Nonzero if the current level needs to have a BLOCK made. */ | |
779 | ||
780 | int | |
781 | kept_level_p () | |
782 | { | |
783 | return (current_binding_level->blocks != NULL_TREE | |
784 | || current_binding_level->keep | |
785 | || current_binding_level->names != NULL_TREE | |
786 | || (current_binding_level->tags != NULL_TREE | |
787 | && !current_binding_level->tag_transparent)); | |
788 | } | |
789 | ||
790 | /* Identify this binding level as a level of parameters. */ | |
791 | ||
792 | void | |
793 | declare_parm_level () | |
794 | { | |
795 | current_binding_level->parm_flag = 1; | |
796 | } | |
797 | ||
8d08fdba MS |
798 | void |
799 | declare_pseudo_global_level () | |
800 | { | |
801 | current_binding_level->pseudo_global = 1; | |
802 | } | |
803 | ||
824b9a4c | 804 | static void |
a9aedbc2 MS |
805 | declare_namespace_level () |
806 | { | |
807 | current_binding_level->namespace_p = 1; | |
808 | } | |
809 | ||
8d08fdba MS |
810 | int |
811 | pseudo_global_level_p () | |
812 | { | |
9188c363 | 813 | return current_binding_level->pseudo_global; |
8d08fdba MS |
814 | } |
815 | ||
816 | void | |
817 | set_class_shadows (shadows) | |
818 | tree shadows; | |
819 | { | |
820 | class_binding_level->class_shadowed = shadows; | |
821 | } | |
822 | ||
823 | /* Enter a new binding level. | |
824 | If TAG_TRANSPARENT is nonzero, do so only for the name space of variables, | |
825 | not for that of tags. */ | |
826 | ||
827 | void | |
828 | pushlevel (tag_transparent) | |
829 | int tag_transparent; | |
830 | { | |
831 | register struct binding_level *newlevel = NULL_BINDING_LEVEL; | |
832 | ||
8d08fdba MS |
833 | /* Reuse or create a struct for this binding level. */ |
834 | ||
835 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
836 | if (0) | |
837 | #else /* !defined(DEBUG_CP_BINDING_LEVELS) */ | |
838 | if (free_binding_level) | |
839 | #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */ | |
840 | { | |
841 | newlevel = free_binding_level; | |
842 | free_binding_level = free_binding_level->level_chain; | |
843 | } | |
844 | else | |
acef433b | 845 | newlevel = make_binding_level (); |
cffa8729 | 846 | |
8d08fdba MS |
847 | push_binding_level (newlevel, tag_transparent, keep_next_level_flag); |
848 | GNU_xref_start_scope ((HOST_WIDE_INT) newlevel); | |
849 | keep_next_level_flag = 0; | |
850 | } | |
851 | ||
5566b478 | 852 | void |
8d6e462b PB |
853 | note_level_for_for () |
854 | { | |
855 | current_binding_level->is_for_scope = 1; | |
856 | } | |
857 | ||
8d08fdba MS |
858 | void |
859 | pushlevel_temporary (tag_transparent) | |
860 | int tag_transparent; | |
861 | { | |
862 | pushlevel (tag_transparent); | |
863 | current_binding_level->keep = 2; | |
864 | clear_last_expr (); | |
865 | ||
866 | /* Note we don't call push_momentary() here. Otherwise, it would cause | |
867 | cleanups to be allocated on the momentary obstack, and they will be | |
868 | overwritten by the next statement. */ | |
869 | ||
870 | expand_start_bindings (0); | |
871 | } | |
872 | ||
f181d4ae MM |
873 | /* For a binding between a name and an entity at a block scope, |
874 | this is the `struct binding_level' for the block. */ | |
875 | #define BINDING_LEVEL(NODE) \ | |
c7a932b1 | 876 | (((struct tree_binding*)NODE)->scope.level) |
f181d4ae | 877 | |
f181d4ae MM |
878 | /* Make DECL the innermost binding for ID. The LEVEL is the binding |
879 | level at which this declaration is being bound. */ | |
880 | ||
881 | static void | |
882 | push_binding (id, decl, level) | |
883 | tree id; | |
884 | tree decl; | |
885 | struct binding_level* level; | |
886 | { | |
887 | tree binding; | |
888 | ||
87e3dbc9 | 889 | binding = make_node (CPLUS_BINDING); |
f181d4ae MM |
890 | |
891 | /* Now, fill in the binding information. */ | |
892 | BINDING_VALUE (binding) = decl; | |
d8f8dca1 | 893 | BINDING_TYPE (binding) = NULL_TREE; |
f181d4ae | 894 | BINDING_LEVEL (binding) = level; |
8f032717 | 895 | INHERITED_VALUE_BINDING_P (binding) = 0; |
f181d4ae | 896 | LOCAL_BINDING_P (binding) = (level != class_binding_level); |
87e3dbc9 | 897 | BINDING_HAS_LEVEL_P (binding) = 1; |
f181d4ae | 898 | |
c45df9c1 | 899 | /* And put it on the front of the list of bindings for ID. */ |
f181d4ae MM |
900 | TREE_CHAIN (binding) = IDENTIFIER_BINDING (id); |
901 | IDENTIFIER_BINDING (id) = binding; | |
902 | } | |
903 | ||
d8f8dca1 MM |
904 | /* ID is already bound in the current scope. But, DECL is an |
905 | additional binding for ID in the same scope. This is the `struct | |
906 | stat' hack whereby a non-typedef class-name or enum-name can be | |
907 | bound at the same level as some other kind of entity. It's the | |
908 | responsibility of the caller to check that inserting this name is | |
8f032717 MM |
909 | legal here. Returns nonzero if the new binding was successful. */ |
910 | static int | |
d8f8dca1 MM |
911 | add_binding (id, decl) |
912 | tree id; | |
913 | tree decl; | |
914 | { | |
915 | tree binding = IDENTIFIER_BINDING (id); | |
8f032717 | 916 | int ok = 1; |
d8f8dca1 MM |
917 | |
918 | if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl)) | |
919 | /* The new name is the type name. */ | |
920 | BINDING_TYPE (binding) = decl; | |
8f032717 MM |
921 | else if (!BINDING_VALUE (binding)) |
922 | /* This situation arises when push_class_level_binding moves an | |
923 | inherited type-binding out of the way to make room for a new | |
924 | value binding. */ | |
925 | BINDING_VALUE (binding) = decl; | |
926 | else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL | |
927 | && DECL_ARTIFICIAL (BINDING_VALUE (binding))) | |
928 | { | |
929 | /* The old binding was a type name. It was placed in | |
930 | BINDING_VALUE because it was thought, at the point it was | |
931 | declared, to be the only entity with such a name. Move the | |
932 | type name into the type slot; it is now hidden by the new | |
933 | binding. */ | |
d8f8dca1 MM |
934 | BINDING_TYPE (binding) = BINDING_VALUE (binding); |
935 | BINDING_VALUE (binding) = decl; | |
8f032717 | 936 | INHERITED_VALUE_BINDING_P (binding) = 0; |
d8f8dca1 | 937 | } |
263505af MM |
938 | else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL |
939 | && TREE_CODE (decl) == TYPE_DECL | |
940 | && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding)) | |
941 | && same_type_p (TREE_TYPE (decl), | |
942 | TREE_TYPE (BINDING_VALUE (binding)))) | |
943 | /* We have two typedef-names, both naming the same type to have | |
944 | the same name. This is OK because of: | |
945 | ||
946 | [dcl.typedef] | |
947 | ||
948 | In a given scope, a typedef specifier can be used to redefine | |
949 | the name of any type declared in that scope to refer to the | |
950 | type to which it already refers. */ | |
951 | ok = 0; | |
8f032717 MM |
952 | else |
953 | { | |
954 | cp_error ("declaration of `%#D'", decl); | |
955 | cp_error_at ("conflicts with previous declaration `%#D'", | |
956 | BINDING_VALUE (binding)); | |
957 | ok = 0; | |
958 | } | |
959 | ||
960 | return ok; | |
d8f8dca1 MM |
961 | } |
962 | ||
cfe507be MM |
963 | /* Add DECL to the list of things declared in B. */ |
964 | ||
965 | static void | |
966 | add_decl_to_level (decl, b) | |
967 | tree decl; | |
968 | struct binding_level *b; | |
969 | { | |
cfe507be MM |
970 | /* We build up the list in reverse order, and reverse it later if |
971 | necessary. */ | |
972 | TREE_CHAIN (decl) = b->names; | |
973 | b->names = decl; | |
974 | } | |
975 | ||
976 | /* Bind DECL to ID in the current_binding_level, assumed to be a local | |
977 | binding level. If PUSH_USING is set in FLAGS, we know that DECL | |
978 | doesn't really belong to this binding level, that it got here | |
979 | through a using-declaration. */ | |
f181d4ae MM |
980 | |
981 | void | |
0034cf72 | 982 | push_local_binding (id, decl, flags) |
f181d4ae MM |
983 | tree id; |
984 | tree decl; | |
0034cf72 | 985 | int flags; |
f181d4ae | 986 | { |
8f032717 MM |
987 | struct binding_level *b; |
988 | ||
989 | /* Skip over any local classes. This makes sense if we call | |
990 | push_local_binding with a friend decl of a local class. */ | |
991 | b = current_binding_level; | |
992 | while (b->parm_flag == 2) | |
993 | b = b->level_chain; | |
f181d4ae | 994 | |
d8f8dca1 | 995 | if (lookup_name_current_level (id)) |
8f032717 MM |
996 | { |
997 | /* Supplement the existing binding. */ | |
998 | if (!add_binding (id, decl)) | |
999 | /* It didn't work. Something else must be bound at this | |
1000 | level. Do not add DECL to the list of things to pop | |
1001 | later. */ | |
1002 | return; | |
1003 | } | |
d8f8dca1 MM |
1004 | else |
1005 | /* Create a new binding. */ | |
8f032717 | 1006 | push_binding (id, decl, b); |
f181d4ae | 1007 | |
0034cf72 | 1008 | if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING)) |
a06d48ef JM |
1009 | /* We must put the OVERLOAD into a TREE_LIST since the |
1010 | TREE_CHAIN of an OVERLOAD is already used. Similarly for | |
1011 | decls that got here through a using-declaration. */ | |
1012 | decl = build_tree_list (NULL_TREE, decl); | |
1013 | ||
f181d4ae MM |
1014 | /* And put DECL on the list of things declared by the current |
1015 | binding level. */ | |
cfe507be | 1016 | add_decl_to_level (decl, b); |
f181d4ae MM |
1017 | } |
1018 | ||
8f032717 MM |
1019 | /* Bind DECL to ID in the class_binding_level. Returns nonzero if the |
1020 | binding was successful. */ | |
f181d4ae | 1021 | |
8f032717 | 1022 | int |
f181d4ae MM |
1023 | push_class_binding (id, decl) |
1024 | tree id; | |
1025 | tree decl; | |
1026 | { | |
8f032717 MM |
1027 | int result = 1; |
1028 | tree binding = IDENTIFIER_BINDING (id); | |
1029 | tree context; | |
1030 | ||
1031 | /* Note that we declared this value so that we can issue an error if | |
1032 | this an illegal redeclaration of a name already used for some | |
1033 | other purpose. */ | |
1034 | note_name_declared_in_class (id, decl); | |
1035 | ||
1036 | if (binding && BINDING_LEVEL (binding) == class_binding_level) | |
d8f8dca1 | 1037 | /* Supplement the existing binding. */ |
8f032717 | 1038 | result = add_binding (id, decl); |
d8f8dca1 MM |
1039 | else |
1040 | /* Create a new binding. */ | |
1041 | push_binding (id, decl, class_binding_level); | |
1042 | ||
1043 | /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the | |
1044 | class-level declaration. Note that we do not use DECL here | |
1045 | because of the possibility of the `struct stat' hack; if DECL is | |
1046 | a class-name or enum-name we might prefer a field-name, or some | |
1047 | such. */ | |
1048 | IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id)); | |
8f032717 MM |
1049 | |
1050 | /* If this is a binding from a base class, mark it as such. */ | |
1051 | binding = IDENTIFIER_BINDING (id); | |
1052 | if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST) | |
1053 | { | |
280f9385 MM |
1054 | /* Any implicit typename must be from a base-class. The |
1055 | context for an implicit typename declaration is always | |
1056 | the derived class in which the lookup was done, so the checks | |
1057 | based on the context of DECL below will not trigger. */ | |
83233dca | 1058 | if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl)) |
280f9385 | 1059 | INHERITED_VALUE_BINDING_P (binding) = 1; |
8f032717 MM |
1060 | else |
1061 | { | |
280f9385 MM |
1062 | if (TREE_CODE (decl) == OVERLOAD) |
1063 | context = DECL_REAL_CONTEXT (OVL_CURRENT (decl)); | |
1064 | else | |
1065 | { | |
1066 | my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', | |
1067 | 0); | |
1068 | context = DECL_REAL_CONTEXT (decl); | |
1069 | } | |
8f032717 | 1070 | |
280f9385 MM |
1071 | if (is_properly_derived_from (current_class_type, context)) |
1072 | INHERITED_VALUE_BINDING_P (binding) = 1; | |
1073 | else | |
1074 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
1075 | } | |
8f032717 MM |
1076 | } |
1077 | else if (BINDING_VALUE (binding) == decl) | |
1078 | /* We only encounter a TREE_LIST when push_class_decls detects an | |
1079 | ambiguity. Such an ambiguity can be overridden by a definition | |
1080 | in this class. */ | |
1081 | INHERITED_VALUE_BINDING_P (binding) = 1; | |
1082 | ||
1083 | return result; | |
f181d4ae MM |
1084 | } |
1085 | ||
d8f8dca1 MM |
1086 | /* Remove the binding for DECL which should be the innermost binding |
1087 | for ID. */ | |
f181d4ae MM |
1088 | |
1089 | static void | |
d8f8dca1 | 1090 | pop_binding (id, decl) |
f181d4ae | 1091 | tree id; |
d8f8dca1 | 1092 | tree decl; |
f181d4ae MM |
1093 | { |
1094 | tree binding; | |
d8f8dca1 | 1095 | |
f181d4ae MM |
1096 | if (id == NULL_TREE) |
1097 | /* It's easiest to write the loops that call this function without | |
1098 | checking whether or not the entities involved have names. We | |
1099 | get here for such an entity. */ | |
1100 | return; | |
1101 | ||
d8f8dca1 | 1102 | /* Get the innermost binding for ID. */ |
f181d4ae | 1103 | binding = IDENTIFIER_BINDING (id); |
f181d4ae | 1104 | |
d8f8dca1 MM |
1105 | /* The name should be bound. */ |
1106 | my_friendly_assert (binding != NULL_TREE, 0); | |
1107 | ||
1108 | /* The DECL will be either the ordinary binding or the type | |
1109 | binding for this identifier. Remove that binding. */ | |
1110 | if (BINDING_VALUE (binding) == decl) | |
1111 | BINDING_VALUE (binding) = NULL_TREE; | |
1112 | else if (BINDING_TYPE (binding) == decl) | |
1113 | BINDING_TYPE (binding) = NULL_TREE; | |
1114 | else | |
1115 | my_friendly_abort (0); | |
1116 | ||
1117 | if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding)) | |
87e3dbc9 MM |
1118 | /* We're completely done with the innermost binding for this |
1119 | identifier. Unhook it from the list of bindings. */ | |
1120 | IDENTIFIER_BINDING (id) = TREE_CHAIN (binding); | |
f181d4ae MM |
1121 | } |
1122 | ||
acef433b MM |
1123 | /* When a label goes out of scope, check to see if that label was used |
1124 | in a valid manner, and issue any appropriate warnings or errors. */ | |
1125 | ||
1126 | static void | |
1127 | pop_label (link) | |
1128 | tree link; | |
1129 | { | |
1130 | tree label = TREE_VALUE (link); | |
1131 | ||
1132 | if (DECL_INITIAL (label) == NULL_TREE) | |
1133 | { | |
1134 | cp_error_at ("label `%D' used but not defined", label); | |
1135 | /* Avoid crashing later. */ | |
1136 | define_label (input_filename, 1, DECL_NAME (label)); | |
1137 | } | |
1138 | else if (warn_unused && !TREE_USED (label)) | |
1139 | cp_warning_at ("label `%D' defined but not used", label); | |
1140 | ||
1141 | SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), TREE_PURPOSE (link)); | |
1142 | } | |
1143 | ||
1144 | /* At the end of a function, all labels declared within the fucntion | |
1145 | go out of scope. BLOCK is the top-level block for the | |
1146 | function. */ | |
1147 | ||
1148 | static void | |
1149 | pop_labels (block) | |
1150 | tree block; | |
1151 | { | |
1152 | tree link; | |
1153 | ||
1154 | /* Clear out the definitions of all label names, since their scopes | |
1155 | end here. */ | |
1156 | for (link = named_labels; link; link = TREE_CHAIN (link)) | |
1157 | { | |
1158 | pop_label (link); | |
1159 | /* Put the labels into the "variables" of the top-level block, | |
1160 | so debugger can see them. */ | |
1161 | TREE_CHAIN (TREE_VALUE (link)) = BLOCK_VARS (block); | |
1162 | BLOCK_VARS (block) = TREE_VALUE (link); | |
1163 | } | |
1164 | ||
1165 | named_labels = NULL_TREE; | |
1166 | } | |
1167 | ||
8d08fdba MS |
1168 | /* Exit a binding level. |
1169 | Pop the level off, and restore the state of the identifier-decl mappings | |
1170 | that were in effect when this level was entered. | |
1171 | ||
1172 | If KEEP == 1, this level had explicit declarations, so | |
1173 | and create a "block" (a BLOCK node) for the level | |
1174 | to record its declarations and subblocks for symbol table output. | |
1175 | ||
8d08fdba MS |
1176 | If FUNCTIONBODY is nonzero, this level is the body of a function, |
1177 | so create a block as if KEEP were set and also clear out all | |
1178 | label names. | |
1179 | ||
1180 | If REVERSE is nonzero, reverse the order of decls before putting | |
1181 | them into the BLOCK. */ | |
1182 | ||
1183 | tree | |
1184 | poplevel (keep, reverse, functionbody) | |
1185 | int keep; | |
1186 | int reverse; | |
1187 | int functionbody; | |
1188 | { | |
1189 | register tree link; | |
1190 | /* The chain of decls was accumulated in reverse order. | |
1191 | Put it into forward order, just for cleanliness. */ | |
1192 | tree decls; | |
1193 | int tmp = functionbody; | |
8d08fdba MS |
1194 | int real_functionbody = current_binding_level->keep == 2 |
1195 | ? ((functionbody = 0), tmp) : functionbody; | |
1196 | tree tags = functionbody >= 0 ? current_binding_level->tags : 0; | |
1197 | tree subblocks = functionbody >= 0 ? current_binding_level->blocks : 0; | |
1198 | tree block = NULL_TREE; | |
1199 | tree decl; | |
1200 | int block_previously_created; | |
f181d4ae MM |
1201 | int leaving_for_scope; |
1202 | ||
273a708f MM |
1203 | my_friendly_assert (current_binding_level->parm_flag != 2, |
1204 | 19990916); | |
b74a0560 MM |
1205 | |
1206 | my_friendly_assert (!current_binding_level->class_shadowed, | |
1207 | 19990414); | |
8d08fdba | 1208 | |
536333d4 MM |
1209 | /* We used to use KEEP == 2 to indicate that the new block should go |
1210 | at the beginning of the list of blocks at this binding level, | |
1211 | rather than the end. This hack is no longer used. */ | |
1212 | my_friendly_assert (keep == 0 || keep == 1, 0); | |
1213 | ||
8d08fdba MS |
1214 | GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level, |
1215 | (HOST_WIDE_INT) current_binding_level->level_chain, | |
1216 | current_binding_level->parm_flag, | |
5566b478 | 1217 | current_binding_level->keep); |
8d08fdba MS |
1218 | |
1219 | if (current_binding_level->keep == 1) | |
1220 | keep = 1; | |
1221 | ||
8d08fdba MS |
1222 | /* Get the decls in the order they were written. |
1223 | Usually current_binding_level->names is in reverse order. | |
1224 | But parameter decls were previously put in forward order. */ | |
1225 | ||
1226 | if (reverse) | |
1227 | current_binding_level->names | |
1228 | = decls = nreverse (current_binding_level->names); | |
1229 | else | |
1230 | decls = current_binding_level->names; | |
1231 | ||
1232 | /* Output any nested inline functions within this block | |
1233 | if they weren't already output. */ | |
1234 | ||
1235 | for (decl = decls; decl; decl = TREE_CHAIN (decl)) | |
1236 | if (TREE_CODE (decl) == FUNCTION_DECL | |
1237 | && ! TREE_ASM_WRITTEN (decl) | |
1238 | && DECL_INITIAL (decl) != NULL_TREE | |
6060a796 MS |
1239 | && TREE_ADDRESSABLE (decl) |
1240 | && decl_function_context (decl) == current_function_decl) | |
8d08fdba MS |
1241 | { |
1242 | /* If this decl was copied from a file-scope decl | |
1243 | on account of a block-scope extern decl, | |
1244 | propagate TREE_ADDRESSABLE to the file-scope decl. */ | |
1245 | if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE) | |
1246 | TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1; | |
1247 | else | |
1248 | { | |
1249 | push_function_context (); | |
1250 | output_inline_function (decl); | |
1251 | pop_function_context (); | |
1252 | } | |
1253 | } | |
1254 | ||
1255 | /* If there were any declarations or structure tags in that level, | |
1256 | or if this level is a function body, | |
1257 | create a BLOCK to record them for the life of this function. */ | |
1258 | ||
1259 | block = NULL_TREE; | |
1260 | block_previously_created = (current_binding_level->this_block != NULL_TREE); | |
1261 | if (block_previously_created) | |
1262 | block = current_binding_level->this_block; | |
1263 | else if (keep == 1 || functionbody) | |
1264 | block = make_node (BLOCK); | |
1265 | if (block != NULL_TREE) | |
1266 | { | |
72b7eeff MS |
1267 | if (block_previously_created) |
1268 | { | |
1269 | if (decls || tags || subblocks) | |
1270 | { | |
be99da77 | 1271 | if (BLOCK_VARS (block) || BLOCK_TYPE_TAGS (block)) |
f181d4ae MM |
1272 | warning ("internal compiler error: debugging info corrupted"); |
1273 | ||
72b7eeff MS |
1274 | BLOCK_VARS (block) = decls; |
1275 | BLOCK_TYPE_TAGS (block) = tags; | |
be99da77 MS |
1276 | |
1277 | /* We can have previous subblocks and new subblocks when | |
1278 | doing fixup_gotos with complex cleanups. We chain the new | |
1279 | subblocks onto the end of any pre-existing subblocks. */ | |
1280 | BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block), | |
1281 | subblocks); | |
72b7eeff | 1282 | } |
be99da77 MS |
1283 | /* If we created the block earlier on, and we are just |
1284 | diddling it now, then it already should have a proper | |
1285 | BLOCK_END_NOTE value associated with it. */ | |
72b7eeff MS |
1286 | } |
1287 | else | |
1288 | { | |
1289 | BLOCK_VARS (block) = decls; | |
1290 | BLOCK_TYPE_TAGS (block) = tags; | |
1291 | BLOCK_SUBBLOCKS (block) = subblocks; | |
f181d4ae MM |
1292 | /* Otherwise, for a new block, install a new BLOCK_END_NOTE |
1293 | value. */ | |
72b7eeff MS |
1294 | remember_end_note (block); |
1295 | } | |
8d08fdba MS |
1296 | } |
1297 | ||
1298 | /* In each subblock, record that this is its superior. */ | |
1299 | ||
1300 | if (keep >= 0) | |
1301 | for (link = subblocks; link; link = TREE_CHAIN (link)) | |
1302 | BLOCK_SUPERCONTEXT (link) = block; | |
1303 | ||
f181d4ae MM |
1304 | /* We still support the old for-scope rules, whereby the variables |
1305 | in a for-init statement were in scope after the for-statement | |
1306 | ended. We only use the new rules in flag_new_for_scope is | |
1307 | nonzero. */ | |
1308 | leaving_for_scope | |
1309 | = current_binding_level->is_for_scope && flag_new_for_scope == 1; | |
1310 | ||
1311 | /* Remove declarations for all the DECLs in this level. */ | |
1312 | for (link = decls; link; link = TREE_CHAIN (link)) | |
1313 | { | |
1314 | if (leaving_for_scope && TREE_CODE (link) == VAR_DECL) | |
1315 | { | |
1316 | tree outer_binding | |
1317 | = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link))); | |
1318 | tree ns_binding; | |
1319 | ||
1320 | if (!outer_binding) | |
1321 | ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link)); | |
c7dda1e3 MM |
1322 | else |
1323 | ns_binding = NULL_TREE; | |
1324 | ||
f181d4ae MM |
1325 | if (outer_binding |
1326 | && (BINDING_LEVEL (outer_binding) | |
1327 | == current_binding_level->level_chain)) | |
1328 | /* We have something like: | |
1329 | ||
1330 | int i; | |
1331 | for (int i; ;); | |
1332 | ||
1333 | and we are leaving the `for' scope. There's no reason to | |
1334 | keep the binding of the inner `i' in this case. */ | |
d8f8dca1 | 1335 | pop_binding (DECL_NAME (link), link); |
f181d4ae MM |
1336 | else if ((outer_binding |
1337 | && (TREE_CODE (BINDING_VALUE (outer_binding)) | |
1338 | == TYPE_DECL)) | |
1339 | || (ns_binding | |
1340 | && TREE_CODE (ns_binding) == TYPE_DECL)) | |
1341 | /* Here, we have something like: | |
1342 | ||
1343 | typedef int I; | |
1344 | ||
1345 | void f () { | |
1346 | for (int I; ;); | |
1347 | } | |
1348 | ||
1349 | We must pop the for-scope binding so we know what's a | |
1350 | type and what isn't. */ | |
d8f8dca1 | 1351 | pop_binding (DECL_NAME (link), link); |
e76a2646 | 1352 | else |
e76a2646 | 1353 | { |
f181d4ae MM |
1354 | /* Mark this VAR_DECL as dead so that we can tell we left it |
1355 | there only for backward compatibility. */ | |
1356 | DECL_DEAD_FOR_LOCAL (link) = 1; | |
1357 | ||
1358 | /* Keep track of what should of have happenned when we | |
1359 | popped the binding. */ | |
1360 | if (outer_binding && BINDING_VALUE (outer_binding)) | |
1361 | DECL_SHADOWED_FOR_VAR (link) | |
1362 | = BINDING_VALUE (outer_binding); | |
1363 | ||
1364 | /* Add it to the list of dead variables in the next | |
1365 | outermost binding to that we can remove these when we | |
1366 | leave that binding. */ | |
1367 | current_binding_level->level_chain->dead_vars_from_for | |
1368 | = tree_cons (NULL_TREE, link, | |
1369 | current_binding_level->level_chain-> | |
1370 | dead_vars_from_for); | |
1371 | ||
1372 | /* Although we don't pop the CPLUS_BINDING, we do clear | |
1373 | its BINDING_LEVEL since the level is going away now. */ | |
1374 | BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link))) | |
1375 | = 0; | |
e76a2646 | 1376 | } |
2ee887f2 | 1377 | } |
f181d4ae | 1378 | else |
8d6e462b | 1379 | { |
f181d4ae | 1380 | /* Remove the binding. */ |
0034cf72 JM |
1381 | decl = link; |
1382 | if (TREE_CODE (decl) == TREE_LIST) | |
1383 | decl = TREE_VALUE (decl); | |
1384 | if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd') | |
1385 | pop_binding (DECL_NAME (decl), decl); | |
1386 | else if (TREE_CODE (decl) == OVERLOAD) | |
1387 | pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl); | |
d8f8dca1 | 1388 | else |
f181d4ae | 1389 | my_friendly_abort (0); |
8d08fdba | 1390 | } |
f181d4ae | 1391 | } |
8d08fdba | 1392 | |
f181d4ae MM |
1393 | /* Remove declarations for any `for' variables from inner scopes |
1394 | that we kept around. */ | |
1395 | for (link = current_binding_level->dead_vars_from_for; | |
1396 | link; link = TREE_CHAIN (link)) | |
d8f8dca1 | 1397 | pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link)); |
2ee887f2 | 1398 | |
f181d4ae MM |
1399 | /* Restore the IDENTIFIER_TYPE_VALUEs. */ |
1400 | for (link = current_binding_level->type_shadowed; | |
1401 | link; link = TREE_CHAIN (link)) | |
1402 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link)); | |
acef433b MM |
1403 | |
1404 | /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */ | |
1405 | for (link = current_binding_level->shadowed_labels; | |
1406 | link; | |
1407 | link = TREE_CHAIN (link)) | |
1408 | pop_label (link); | |
1409 | ||
f181d4ae MM |
1410 | /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs |
1411 | list if a `using' declaration put them there. The debugging | |
1412 | back-ends won't understand OVERLOAD, so we remove them here. | |
1413 | Because the BLOCK_VARS are (temporarily) shared with | |
1414 | CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have | |
1415 | popped all the bindings. */ | |
1416 | if (block) | |
1417 | { | |
1418 | tree* d; | |
8d6e462b | 1419 | |
a06d48ef JM |
1420 | for (d = &BLOCK_VARS (block); *d; ) |
1421 | { | |
1422 | if (TREE_CODE (*d) == TREE_LIST) | |
1423 | *d = TREE_CHAIN (*d); | |
1424 | else | |
1425 | d = &TREE_CHAIN (*d); | |
1426 | } | |
8d6e462b | 1427 | } |
8d08fdba MS |
1428 | |
1429 | /* If the level being exited is the top level of a function, | |
1430 | check over all the labels. */ | |
8d08fdba MS |
1431 | if (functionbody) |
1432 | { | |
acef433b MM |
1433 | /* Since this is the top level block of a function, the vars are |
1434 | the function's parameters. Don't leave them in the BLOCK | |
1435 | because they are found in the FUNCTION_DECL instead. */ | |
8d08fdba | 1436 | BLOCK_VARS (block) = 0; |
acef433b | 1437 | pop_labels (block); |
8d08fdba MS |
1438 | } |
1439 | ||
1440 | /* Any uses of undefined labels now operate under constraints | |
1441 | of next binding contour. */ | |
a8f73d4b MM |
1442 | if (current_function) |
1443 | { | |
1444 | struct binding_level *level_chain; | |
1445 | level_chain = current_binding_level->level_chain; | |
1446 | if (level_chain) | |
1447 | { | |
1448 | struct named_label_list *labels; | |
1449 | for (labels = named_label_uses; labels; labels = labels->next) | |
1450 | if (labels->binding_level == current_binding_level) | |
1451 | { | |
1452 | labels->binding_level = level_chain; | |
1453 | labels->names_in_scope = level_chain->names; | |
1454 | } | |
1455 | } | |
1456 | } | |
8d08fdba MS |
1457 | |
1458 | tmp = current_binding_level->keep; | |
1459 | ||
1460 | pop_binding_level (); | |
1461 | if (functionbody) | |
1462 | DECL_INITIAL (current_function_decl) = block; | |
1463 | else if (block) | |
1464 | { | |
1465 | if (!block_previously_created) | |
1466 | current_binding_level->blocks | |
1467 | = chainon (current_binding_level->blocks, block); | |
1468 | } | |
1469 | /* If we did not make a block for the level just exited, | |
1470 | any blocks made for inner levels | |
1471 | (since they cannot be recorded as subblocks in that level) | |
1472 | must be carried forward so they will later become subblocks | |
1473 | of something else. */ | |
1474 | else if (subblocks) | |
536333d4 MM |
1475 | current_binding_level->blocks |
1476 | = chainon (current_binding_level->blocks, subblocks); | |
8d08fdba MS |
1477 | |
1478 | /* Take care of compiler's internal binding structures. */ | |
a4443a08 | 1479 | if (tmp == 2) |
8d08fdba | 1480 | { |
8d08fdba MS |
1481 | expand_end_bindings (getdecls (), keep, 1); |
1482 | /* Each and every BLOCK node created here in `poplevel' is important | |
1483 | (e.g. for proper debugging information) so if we created one | |
1484 | earlier, mark it as "used". */ | |
1485 | if (block) | |
1486 | TREE_USED (block) = 1; | |
1487 | block = poplevel (keep, reverse, real_functionbody); | |
1488 | } | |
1489 | ||
1490 | /* Each and every BLOCK node created here in `poplevel' is important | |
1491 | (e.g. for proper debugging information) so if we created one | |
1492 | earlier, mark it as "used". */ | |
1493 | if (block) | |
1494 | TREE_USED (block) = 1; | |
1495 | return block; | |
1496 | } | |
1497 | ||
1498 | /* Delete the node BLOCK from the current binding level. | |
1499 | This is used for the block inside a stmt expr ({...}) | |
1500 | so that the block can be reinserted where appropriate. */ | |
1501 | ||
1502 | void | |
1503 | delete_block (block) | |
1504 | tree block; | |
1505 | { | |
1506 | tree t; | |
1507 | if (current_binding_level->blocks == block) | |
1508 | current_binding_level->blocks = TREE_CHAIN (block); | |
1509 | for (t = current_binding_level->blocks; t;) | |
1510 | { | |
1511 | if (TREE_CHAIN (t) == block) | |
1512 | TREE_CHAIN (t) = TREE_CHAIN (block); | |
1513 | else | |
1514 | t = TREE_CHAIN (t); | |
1515 | } | |
1516 | TREE_CHAIN (block) = NULL_TREE; | |
1517 | /* Clear TREE_USED which is always set by poplevel. | |
1518 | The flag is set again if insert_block is called. */ | |
1519 | TREE_USED (block) = 0; | |
1520 | } | |
1521 | ||
1522 | /* Insert BLOCK at the end of the list of subblocks of the | |
1523 | current binding level. This is used when a BIND_EXPR is expanded, | |
1524 | to handle the BLOCK node inside the BIND_EXPR. */ | |
1525 | ||
1526 | void | |
1527 | insert_block (block) | |
1528 | tree block; | |
1529 | { | |
1530 | TREE_USED (block) = 1; | |
1531 | current_binding_level->blocks | |
1532 | = chainon (current_binding_level->blocks, block); | |
1533 | } | |
1534 | ||
8d08fdba MS |
1535 | /* Set the BLOCK node for the innermost scope |
1536 | (the one we are currently in). */ | |
1537 | ||
1538 | void | |
1539 | set_block (block) | |
1540 | register tree block; | |
1541 | { | |
1542 | current_binding_level->this_block = block; | |
1543 | } | |
1544 | ||
1545 | /* Do a pushlevel for class declarations. */ | |
e92cc029 | 1546 | |
8d08fdba MS |
1547 | void |
1548 | pushlevel_class () | |
1549 | { | |
1550 | register struct binding_level *newlevel; | |
1551 | ||
1552 | /* Reuse or create a struct for this binding level. */ | |
1553 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
1554 | if (0) | |
1555 | #else /* !defined(DEBUG_CP_BINDING_LEVELS) */ | |
1556 | if (free_binding_level) | |
1557 | #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */ | |
1558 | { | |
1559 | newlevel = free_binding_level; | |
1560 | free_binding_level = free_binding_level->level_chain; | |
1561 | } | |
1562 | else | |
f181d4ae | 1563 | newlevel = make_binding_level (); |
8d08fdba MS |
1564 | |
1565 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
1566 | is_class_level = 1; | |
1567 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
1568 | ||
1569 | push_binding_level (newlevel, 0, 0); | |
1570 | ||
1571 | decl_stack = push_decl_level (decl_stack, &decl_obstack); | |
1572 | class_binding_level = current_binding_level; | |
1573 | class_binding_level->parm_flag = 2; | |
8d08fdba MS |
1574 | } |
1575 | ||
b74a0560 | 1576 | /* ...and a poplevel for class declarations. */ |
e92cc029 | 1577 | |
273a708f | 1578 | void |
b74a0560 | 1579 | poplevel_class () |
8d08fdba MS |
1580 | { |
1581 | register struct binding_level *level = class_binding_level; | |
8d08fdba MS |
1582 | tree shadowed; |
1583 | ||
1584 | my_friendly_assert (level != 0, 354); | |
1585 | ||
1586 | decl_stack = pop_stack_level (decl_stack); | |
8d08fdba | 1587 | /* If we're leaving a toplevel class, don't bother to do the setting |
ddd5a7c1 | 1588 | of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot |
8d08fdba | 1589 | shouldn't even be used when current_class_type isn't set, and second, |
ddd5a7c1 | 1590 | if we don't touch it here, we're able to use the cache effect if the |
8d08fdba | 1591 | next time we're entering a class scope, it is the same class. */ |
b74a0560 | 1592 | if (current_class_depth != 1) |
8f032717 MM |
1593 | { |
1594 | struct binding_level* b; | |
1595 | ||
1596 | /* Clear out our IDENTIFIER_CLASS_VALUEs. */ | |
1597 | for (shadowed = level->class_shadowed; | |
1598 | shadowed; | |
1599 | shadowed = TREE_CHAIN (shadowed)) | |
1600 | IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE; | |
1601 | ||
1602 | /* Find the next enclosing class, and recreate | |
1603 | IDENTIFIER_CLASS_VALUEs appropriate for that class. */ | |
1604 | b = level->level_chain; | |
1605 | while (b && b->parm_flag != 2) | |
1606 | b = b->level_chain; | |
1607 | ||
1608 | if (b) | |
1609 | for (shadowed = b->class_shadowed; | |
1610 | shadowed; | |
1611 | shadowed = TREE_CHAIN (shadowed)) | |
1612 | { | |
1613 | tree t; | |
1614 | ||
1615 | t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed)); | |
1616 | while (t && BINDING_LEVEL (t) != b) | |
1617 | t = TREE_CHAIN (t); | |
1618 | ||
1619 | if (t) | |
1620 | IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) | |
1621 | = BINDING_VALUE (t); | |
1622 | } | |
1623 | } | |
8d08fdba MS |
1624 | else |
1625 | /* Remember to save what IDENTIFIER's were bound in this scope so we | |
1626 | can recover from cache misses. */ | |
e76a2646 MS |
1627 | { |
1628 | previous_class_type = current_class_type; | |
1629 | previous_class_values = class_binding_level->class_shadowed; | |
1630 | } | |
8d08fdba MS |
1631 | for (shadowed = level->type_shadowed; |
1632 | shadowed; | |
1633 | shadowed = TREE_CHAIN (shadowed)) | |
2c73f9f5 | 1634 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed)); |
8d08fdba | 1635 | |
f181d4ae MM |
1636 | /* Remove the bindings for all of the class-level declarations. */ |
1637 | for (shadowed = level->class_shadowed; | |
1638 | shadowed; | |
1639 | shadowed = TREE_CHAIN (shadowed)) | |
d8f8dca1 | 1640 | pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed)); |
f181d4ae | 1641 | |
8d08fdba MS |
1642 | GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level, |
1643 | (HOST_WIDE_INT) class_binding_level->level_chain, | |
1644 | class_binding_level->parm_flag, | |
5566b478 | 1645 | class_binding_level->keep); |
8d08fdba | 1646 | |
38e01259 | 1647 | /* Now, pop out of the binding level which we created up in the |
8d08fdba MS |
1648 | `pushlevel_class' routine. */ |
1649 | #if defined(DEBUG_CP_BINDING_LEVELS) | |
1650 | is_class_level = 1; | |
1651 | #endif /* defined(DEBUG_CP_BINDING_LEVELS) */ | |
1652 | ||
1653 | pop_binding_level (); | |
8d08fdba | 1654 | } |
8f032717 MM |
1655 | |
1656 | /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE | |
1657 | for any names in enclosing classes. */ | |
1658 | ||
1659 | void | |
1660 | clear_identifier_class_values () | |
1661 | { | |
1662 | tree t; | |
1663 | ||
1664 | if (!class_binding_level) | |
1665 | return; | |
1666 | ||
1667 | for (t = class_binding_level->class_shadowed; | |
1668 | t; | |
1669 | t = TREE_CHAIN (t)) | |
1670 | IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE; | |
1671 | } | |
1672 | ||
0aafb128 MM |
1673 | /* Returns non-zero if T is a virtual function table. */ |
1674 | ||
1675 | int | |
1676 | vtable_decl_p (t, data) | |
1677 | tree t; | |
1678 | void *data ATTRIBUTE_UNUSED; | |
1679 | { | |
1680 | return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t)); | |
1681 | } | |
1682 | ||
1683 | /* Returns non-zero if T is a TYPE_DECL for a type with virtual | |
1684 | functions. */ | |
1685 | ||
1686 | int | |
1687 | vtype_decl_p (t, data) | |
1688 | tree t; | |
1689 | void *data ATTRIBUTE_UNUSED; | |
1690 | { | |
1691 | return (TREE_CODE (t) == TYPE_DECL | |
1692 | && TREE_TYPE (t) != error_mark_node | |
1693 | && TYPE_LANG_SPECIFIC (TREE_TYPE (t)) | |
1694 | && CLASSTYPE_VSIZE (TREE_TYPE (t))); | |
1695 | } | |
1696 | ||
f71f87f9 MM |
1697 | /* Return the declarations that are members of the namespace NS. */ |
1698 | ||
1699 | tree | |
1700 | cp_namespace_decls (ns) | |
1701 | tree ns; | |
1702 | { | |
1703 | return NAMESPACE_LEVEL (ns)->names; | |
1704 | } | |
1705 | ||
0aafb128 MM |
1706 | /* Walk all the namespaces contained NAMESPACE, including NAMESPACE |
1707 | itself, calling F for each. The DATA is passed to F as well. */ | |
1708 | ||
1709 | static int | |
1710 | walk_namespaces_r (namespace, f, data) | |
1711 | tree namespace; | |
1712 | walk_namespaces_fn f; | |
1713 | void *data; | |
1714 | { | |
1715 | tree current; | |
1716 | int result = 0; | |
1717 | ||
1718 | result |= (*f) (namespace, data); | |
1719 | ||
f71f87f9 | 1720 | for (current = cp_namespace_decls (namespace); |
0aafb128 MM |
1721 | current; |
1722 | current = TREE_CHAIN (current)) | |
1723 | { | |
1724 | if (TREE_CODE (current) != NAMESPACE_DECL | |
1725 | || DECL_NAMESPACE_ALIAS (current)) | |
1726 | continue; | |
1727 | if (!DECL_LANG_SPECIFIC (current)) | |
1728 | { | |
1729 | /* Hmm. std. */ | |
1730 | my_friendly_assert (current == std_node, 393); | |
1731 | continue; | |
1732 | } | |
1733 | ||
1734 | /* We found a namespace. */ | |
1735 | result |= walk_namespaces_r (current, f, data); | |
1736 | } | |
1737 | ||
1738 | return result; | |
1739 | } | |
1740 | ||
1741 | /* Walk all the namespaces, calling F for each. The DATA is passed to | |
1742 | F as well. */ | |
1743 | ||
1744 | int | |
1745 | walk_namespaces (f, data) | |
1746 | walk_namespaces_fn f; | |
1747 | void *data; | |
1748 | { | |
1749 | return walk_namespaces_r (global_namespace, f, data); | |
1750 | } | |
1751 | ||
1752 | struct walk_globals_data { | |
1753 | walk_globals_pred p; | |
1754 | walk_globals_fn f; | |
1755 | void *data; | |
1756 | }; | |
1757 | ||
1758 | /* Walk the global declarations in NAMESPACE. Whenever one is found | |
1759 | for which P returns non-zero, call F with its address. If any call | |
1760 | to F returns a non-zero value, return a non-zero value. */ | |
1761 | ||
1762 | static int | |
1763 | walk_globals_r (namespace, data) | |
1764 | tree namespace; | |
1765 | void *data; | |
1766 | { | |
1767 | struct walk_globals_data* wgd = (struct walk_globals_data *) data; | |
1768 | walk_globals_pred p = wgd->p; | |
1769 | walk_globals_fn f = wgd->f; | |
1770 | void *d = wgd->data; | |
1771 | tree *t; | |
1772 | int result = 0; | |
1773 | ||
1774 | t = &NAMESPACE_LEVEL (namespace)->names; | |
1775 | ||
1776 | while (*t) | |
1777 | { | |
1778 | tree glbl = *t; | |
1779 | ||
1780 | if ((*p) (glbl, d)) | |
1781 | result |= (*f) (t, d); | |
1782 | ||
1783 | /* If F changed *T, then *T still points at the next item to | |
1784 | examine. */ | |
1785 | if (*t == glbl) | |
1786 | t = &TREE_CHAIN (*t); | |
1787 | } | |
1788 | ||
1789 | return result; | |
1790 | } | |
1791 | ||
1792 | /* Walk the global declarations. Whenever one is found for which P | |
1793 | returns non-zero, call F with its address. If any call to F | |
1794 | returns a non-zero value, return a non-zero value. */ | |
1795 | ||
1796 | int | |
1797 | walk_globals (p, f, data) | |
1798 | walk_globals_pred p; | |
1799 | walk_globals_fn f; | |
1800 | void *data; | |
1801 | { | |
1802 | struct walk_globals_data wgd; | |
1803 | wgd.p = p; | |
1804 | wgd.f = f; | |
1805 | wgd.data = data; | |
1806 | ||
1807 | return walk_namespaces (walk_globals_r, &wgd); | |
1808 | } | |
1809 | ||
1810 | /* Call wrapup_globals_declarations for the globals in NAMESPACE. If | |
1811 | DATA is non-NULL, this is the last time we will call | |
1812 | wrapup_global_declarations for this NAMESPACE. */ | |
1813 | ||
1814 | int | |
1815 | wrapup_globals_for_namespace (namespace, data) | |
1816 | tree namespace; | |
1817 | void *data; | |
1818 | { | |
f71f87f9 | 1819 | tree globals = cp_namespace_decls (namespace); |
0aafb128 MM |
1820 | int len = list_length (globals); |
1821 | tree *vec = (tree *) alloca (sizeof (tree) * len); | |
1822 | int i; | |
0352cfc8 | 1823 | int result; |
0aafb128 MM |
1824 | tree decl; |
1825 | int last_time = (data != 0); | |
1826 | ||
1827 | if (last_time && namespace == global_namespace) | |
1828 | /* Let compile_file handle the global namespace. */ | |
1829 | return 0; | |
1830 | ||
1831 | /* Process the decls in reverse order--earliest first. | |
1832 | Put them into VEC from back to front, then take out from front. */ | |
1833 | ||
1834 | for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl)) | |
1835 | vec[len - i - 1] = decl; | |
1836 | ||
0352cfc8 MM |
1837 | if (last_time) |
1838 | { | |
1839 | check_global_declarations (vec, len); | |
1840 | return 0; | |
1841 | } | |
1842 | ||
1843 | /* Temporarily mark vtables as external. That prevents | |
1844 | wrapup_global_declarations from writing them out; we must process | |
1845 | them ourselves in finish_vtable_vardecl. */ | |
1846 | for (i = 0; i < len; ++i) | |
91f2aa22 | 1847 | if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i])) |
0352cfc8 MM |
1848 | { |
1849 | DECL_NOT_REALLY_EXTERN (vec[i]) = 1; | |
1850 | DECL_EXTERNAL (vec[i]) = 1; | |
1851 | } | |
0aafb128 | 1852 | |
0352cfc8 MM |
1853 | /* Write out any globals that need to be output. */ |
1854 | result = wrapup_global_declarations (vec, len); | |
1855 | ||
1856 | /* Undo the hack to DECL_EXTERNAL above. */ | |
1857 | for (i = 0; i < len; ++i) | |
1858 | if (vtable_decl_p (vec[i], /*data=*/0) | |
1859 | && DECL_NOT_REALLY_EXTERN (vec[i])) | |
1860 | { | |
1861 | DECL_NOT_REALLY_EXTERN (vec[i]) = 0; | |
1862 | DECL_EXTERNAL (vec[i]) = 0; | |
1863 | } | |
1864 | ||
1865 | return result; | |
0aafb128 MM |
1866 | } |
1867 | ||
4519c0a8 | 1868 | \f |
fc6af6e3 RH |
1869 | /* Mark ARG (which is really a struct binding_level **) for GC. */ |
1870 | ||
4519c0a8 MM |
1871 | static void |
1872 | mark_binding_level (arg) | |
1873 | void *arg; | |
1874 | { | |
1875 | struct binding_level *lvl = *(struct binding_level **)arg; | |
1876 | ||
1877 | while (lvl) | |
1878 | { | |
1879 | ggc_mark_tree (lvl->names); | |
1880 | ggc_mark_tree (lvl->tags); | |
1881 | ggc_mark_tree (lvl->usings); | |
1882 | ggc_mark_tree (lvl->using_directives); | |
1883 | ggc_mark_tree (lvl->class_shadowed); | |
1884 | ggc_mark_tree (lvl->type_shadowed); | |
1885 | ggc_mark_tree (lvl->shadowed_labels); | |
1886 | ggc_mark_tree (lvl->blocks); | |
1887 | ggc_mark_tree (lvl->this_block); | |
1888 | ggc_mark_tree (lvl->incomplete); | |
1889 | ggc_mark_tree (lvl->dead_vars_from_for); | |
1890 | ||
1891 | lvl = lvl->level_chain; | |
1892 | } | |
1893 | } | |
8d08fdba MS |
1894 | \f |
1895 | /* For debugging. */ | |
5566b478 MS |
1896 | static int no_print_functions = 0; |
1897 | static int no_print_builtins = 0; | |
8d08fdba MS |
1898 | |
1899 | void | |
1900 | print_binding_level (lvl) | |
1901 | struct binding_level *lvl; | |
1902 | { | |
1903 | tree t; | |
1904 | int i = 0, len; | |
1905 | fprintf (stderr, " blocks="); | |
1906 | fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks); | |
1907 | fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d", | |
f30432d7 | 1908 | list_length (lvl->incomplete), lvl->parm_flag, lvl->keep); |
8d08fdba MS |
1909 | if (lvl->tag_transparent) |
1910 | fprintf (stderr, " tag-transparent"); | |
1911 | if (lvl->more_cleanups_ok) | |
1912 | fprintf (stderr, " more-cleanups-ok"); | |
1913 | if (lvl->have_cleanups) | |
1914 | fprintf (stderr, " have-cleanups"); | |
8d08fdba MS |
1915 | fprintf (stderr, "\n"); |
1916 | if (lvl->names) | |
1917 | { | |
1918 | fprintf (stderr, " names:\t"); | |
1919 | /* We can probably fit 3 names to a line? */ | |
1920 | for (t = lvl->names; t; t = TREE_CHAIN (t)) | |
1921 | { | |
fc378698 | 1922 | if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL)) |
8d08fdba MS |
1923 | continue; |
1924 | if (no_print_builtins | |
fc378698 MS |
1925 | && (TREE_CODE (t) == TYPE_DECL) |
1926 | && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>"))) | |
8d08fdba MS |
1927 | continue; |
1928 | ||
1929 | /* Function decls tend to have longer names. */ | |
1930 | if (TREE_CODE (t) == FUNCTION_DECL) | |
1931 | len = 3; | |
1932 | else | |
1933 | len = 2; | |
1934 | i += len; | |
1935 | if (i > 6) | |
1936 | { | |
1937 | fprintf (stderr, "\n\t"); | |
1938 | i = len; | |
1939 | } | |
1940 | print_node_brief (stderr, "", t, 0); | |
bd6dd845 | 1941 | if (t == error_mark_node) |
8d08fdba MS |
1942 | break; |
1943 | } | |
1944 | if (i) | |
1945 | fprintf (stderr, "\n"); | |
1946 | } | |
1947 | if (lvl->tags) | |
1948 | { | |
1949 | fprintf (stderr, " tags:\t"); | |
1950 | i = 0; | |
1951 | for (t = lvl->tags; t; t = TREE_CHAIN (t)) | |
1952 | { | |
1953 | if (TREE_PURPOSE (t) == NULL_TREE) | |
1954 | len = 3; | |
1955 | else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t))) | |
1956 | len = 2; | |
1957 | else | |
1958 | len = 4; | |
1959 | i += len; | |
1960 | if (i > 5) | |
1961 | { | |
1962 | fprintf (stderr, "\n\t"); | |
1963 | i = len; | |
1964 | } | |
1965 | if (TREE_PURPOSE (t) == NULL_TREE) | |
1966 | { | |
1967 | print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0); | |
1968 | fprintf (stderr, ">"); | |
1969 | } | |
1970 | else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t))) | |
1971 | print_node_brief (stderr, "", TREE_VALUE (t), 0); | |
1972 | else | |
1973 | { | |
1974 | print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0); | |
1975 | print_node_brief (stderr, "", TREE_VALUE (t), 0); | |
1976 | fprintf (stderr, ">"); | |
1977 | } | |
1978 | } | |
1979 | if (i) | |
1980 | fprintf (stderr, "\n"); | |
1981 | } | |
8d08fdba MS |
1982 | if (lvl->class_shadowed) |
1983 | { | |
1984 | fprintf (stderr, " class-shadowed:"); | |
1985 | for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t)) | |
1986 | { | |
1987 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t))); | |
1988 | } | |
1989 | fprintf (stderr, "\n"); | |
1990 | } | |
1991 | if (lvl->type_shadowed) | |
1992 | { | |
1993 | fprintf (stderr, " type-shadowed:"); | |
1994 | for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t)) | |
1995 | { | |
8d08fdba | 1996 | fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t))); |
8d08fdba MS |
1997 | } |
1998 | fprintf (stderr, "\n"); | |
1999 | } | |
2000 | } | |
2001 | ||
2002 | void | |
2003 | print_other_binding_stack (stack) | |
2004 | struct binding_level *stack; | |
2005 | { | |
2006 | struct binding_level *level; | |
2007 | for (level = stack; level != global_binding_level; level = level->level_chain) | |
2008 | { | |
2009 | fprintf (stderr, "binding level "); | |
2010 | fprintf (stderr, HOST_PTR_PRINTF, level); | |
2011 | fprintf (stderr, "\n"); | |
2012 | print_binding_level (level); | |
2013 | } | |
2014 | } | |
2015 | ||
2016 | void | |
2017 | print_binding_stack () | |
2018 | { | |
2019 | struct binding_level *b; | |
2020 | fprintf (stderr, "current_binding_level="); | |
2021 | fprintf (stderr, HOST_PTR_PRINTF, current_binding_level); | |
2022 | fprintf (stderr, "\nclass_binding_level="); | |
2023 | fprintf (stderr, HOST_PTR_PRINTF, class_binding_level); | |
2024 | fprintf (stderr, "\nglobal_binding_level="); | |
2025 | fprintf (stderr, HOST_PTR_PRINTF, global_binding_level); | |
2026 | fprintf (stderr, "\n"); | |
2027 | if (class_binding_level) | |
2028 | { | |
2029 | for (b = class_binding_level; b; b = b->level_chain) | |
2030 | if (b == current_binding_level) | |
2031 | break; | |
2032 | if (b) | |
2033 | b = class_binding_level; | |
2034 | else | |
2035 | b = current_binding_level; | |
2036 | } | |
2037 | else | |
2038 | b = current_binding_level; | |
2039 | print_other_binding_stack (b); | |
2040 | fprintf (stderr, "global:\n"); | |
2041 | print_binding_level (global_binding_level); | |
2042 | } | |
a9aedbc2 | 2043 | |
2c73f9f5 ML |
2044 | /* Namespace binding access routines: The namespace_bindings field of |
2045 | the identifier is polymorphic, with three possible values: | |
2046 | NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node | |
2047 | indicating the BINDING_VALUE of global_namespace. */ | |
30394414 | 2048 | |
2c73f9f5 ML |
2049 | /* Check whether the a binding for the name to scope is known. |
2050 | Assumes that the bindings of the name are already a list | |
2051 | of bindings. Returns the binding found, or NULL_TREE. */ | |
2052 | ||
2053 | static tree | |
2054 | find_binding (name, scope) | |
30394414 JM |
2055 | tree name; |
2056 | tree scope; | |
2057 | { | |
2c73f9f5 | 2058 | tree iter, prev = NULL_TREE; |
3e3f722c ML |
2059 | |
2060 | scope = ORIGINAL_NAMESPACE (scope); | |
2061 | ||
30394414 JM |
2062 | for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter; |
2063 | iter = TREE_CHAIN (iter)) | |
2064 | { | |
2065 | my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374); | |
2066 | if (BINDING_SCOPE (iter) == scope) | |
2c73f9f5 | 2067 | { |
cfe507be | 2068 | /* Move binding found to the front of the list, so |
2c73f9f5 ML |
2069 | subsequent lookups will find it faster. */ |
2070 | if (prev) | |
2071 | { | |
2072 | TREE_CHAIN (prev) = TREE_CHAIN (iter); | |
2073 | TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2074 | IDENTIFIER_NAMESPACE_BINDINGS (name) = iter; | |
2075 | } | |
2076 | return iter; | |
2077 | } | |
2078 | prev = iter; | |
30394414 | 2079 | } |
2c73f9f5 ML |
2080 | return NULL_TREE; |
2081 | } | |
2082 | ||
2083 | /* Always returns a binding for name in scope. If the | |
2084 | namespace_bindings is not a list, convert it to one first. | |
2085 | If no binding is found, make a new one. */ | |
2086 | ||
2087 | tree | |
2088 | binding_for_name (name, scope) | |
2089 | tree name; | |
2090 | tree scope; | |
2091 | { | |
2092 | tree b = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2093 | tree result; | |
3e3f722c ML |
2094 | |
2095 | scope = ORIGINAL_NAMESPACE (scope); | |
2096 | ||
2c73f9f5 ML |
2097 | if (b && TREE_CODE (b) != CPLUS_BINDING) |
2098 | { | |
2099 | /* Get rid of optimization for global scope. */ | |
2100 | IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE; | |
2101 | BINDING_VALUE (binding_for_name (name, global_namespace)) = b; | |
2102 | b = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2103 | } | |
2104 | if (b && (result = find_binding (name, scope))) | |
2105 | return result; | |
2106 | /* Not found, make a new permanent one. */ | |
30394414 | 2107 | push_obstacks (&permanent_obstack, &permanent_obstack); |
2c73f9f5 ML |
2108 | result = make_node (CPLUS_BINDING); |
2109 | TREE_CHAIN (result) = b; | |
2110 | IDENTIFIER_NAMESPACE_BINDINGS (name) = result; | |
2111 | BINDING_SCOPE (result) = scope; | |
2112 | BINDING_TYPE (result) = NULL_TREE; | |
2113 | BINDING_VALUE (result) = NULL_TREE; | |
30394414 | 2114 | pop_obstacks (); |
2c73f9f5 ML |
2115 | return result; |
2116 | } | |
2117 | ||
2118 | /* Return the binding value for name in scope, considering that | |
2119 | namespace_binding may or may not be a list of CPLUS_BINDINGS. */ | |
2120 | ||
2121 | tree | |
2122 | namespace_binding (name, scope) | |
2123 | tree name; | |
2124 | tree scope; | |
2125 | { | |
2126 | tree b = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2127 | if (b == NULL_TREE) | |
2128 | return NULL_TREE; | |
cb0dbb9a JM |
2129 | if (scope == NULL_TREE) |
2130 | scope = global_namespace; | |
2c73f9f5 ML |
2131 | if (TREE_CODE (b) != CPLUS_BINDING) |
2132 | return (scope == global_namespace) ? b : NULL_TREE; | |
2133 | name = find_binding (name,scope); | |
2134 | if (name == NULL_TREE) | |
2135 | return name; | |
2136 | return BINDING_VALUE (name); | |
2137 | } | |
2138 | ||
2139 | /* Set the binding value for name in scope. If modifying the binding | |
2140 | of global_namespace is attempted, try to optimize it. */ | |
2141 | ||
2142 | void | |
2143 | set_namespace_binding (name, scope, val) | |
2144 | tree name; | |
2145 | tree scope; | |
2146 | tree val; | |
2147 | { | |
2148 | tree b; | |
cb0dbb9a JM |
2149 | |
2150 | if (scope == NULL_TREE) | |
2151 | scope = global_namespace; | |
2152 | ||
2c73f9f5 ML |
2153 | if (scope == global_namespace) |
2154 | { | |
2155 | b = IDENTIFIER_NAMESPACE_BINDINGS (name); | |
2156 | if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING) | |
2157 | { | |
2158 | IDENTIFIER_NAMESPACE_BINDINGS (name) = val; | |
2159 | return; | |
2160 | } | |
2161 | } | |
2162 | b = binding_for_name (name, scope); | |
2163 | BINDING_VALUE (b) = val; | |
30394414 JM |
2164 | } |
2165 | ||
dff6b454 RK |
2166 | /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we |
2167 | select a name that is unique to this compilation unit. */ | |
e92cc029 | 2168 | |
a9aedbc2 MS |
2169 | void |
2170 | push_namespace (name) | |
2171 | tree name; | |
2172 | { | |
b370501f | 2173 | tree d = NULL_TREE; |
30394414 JM |
2174 | int need_new = 1; |
2175 | int implicit_use = 0; | |
2c73f9f5 | 2176 | int global = 0; |
30394414 JM |
2177 | if (!global_namespace) |
2178 | { | |
2c73f9f5 | 2179 | /* This must be ::. */ |
30394414 | 2180 | my_friendly_assert (name == get_identifier ("::"), 377); |
2c73f9f5 | 2181 | global = 1; |
30394414 JM |
2182 | } |
2183 | else if (!name) | |
2184 | { | |
3ab52652 ML |
2185 | /* The name of anonymous namespace is unique for the translation |
2186 | unit. */ | |
0c8feefe MM |
2187 | if (!anonymous_namespace_name) |
2188 | anonymous_namespace_name = get_file_function_name ('N'); | |
2189 | name = anonymous_namespace_name; | |
3ab52652 ML |
2190 | d = IDENTIFIER_NAMESPACE_VALUE (name); |
2191 | if (d) | |
2192 | /* Reopening anonymous namespace. */ | |
2193 | need_new = 0; | |
30394414 | 2194 | implicit_use = 1; |
2c73f9f5 ML |
2195 | } |
2196 | else if (current_namespace == global_namespace | |
2197 | && name == DECL_NAME (std_node)) | |
2198 | { | |
2199 | in_std++; | |
2200 | return; | |
2201 | } | |
30394414 JM |
2202 | else |
2203 | { | |
2c73f9f5 | 2204 | /* Check whether this is an extended namespace definition. */ |
30394414 JM |
2205 | d = IDENTIFIER_NAMESPACE_VALUE (name); |
2206 | if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL) | |
3e3f722c ML |
2207 | { |
2208 | need_new = 0; | |
2209 | if (DECL_NAMESPACE_ALIAS (d)) | |
2210 | { | |
8251199e | 2211 | cp_error ("namespace alias `%D' not allowed here, assuming `%D'", |
3e3f722c ML |
2212 | d, DECL_NAMESPACE_ALIAS (d)); |
2213 | d = DECL_NAMESPACE_ALIAS (d); | |
2214 | } | |
2215 | } | |
30394414 | 2216 | } |
6633d636 | 2217 | |
30394414 JM |
2218 | if (need_new) |
2219 | { | |
2c73f9f5 | 2220 | /* Make a new namespace, binding the name to it. */ |
6b57ac29 | 2221 | d = build_lang_decl (NAMESPACE_DECL, name, void_type_node); |
2c73f9f5 ML |
2222 | /* The global namespace is not pushed, and the global binding |
2223 | level is set elsewhere. */ | |
2224 | if (!global) | |
2225 | { | |
2226 | d = pushdecl (d); | |
2227 | pushlevel (0); | |
2228 | declare_namespace_level (); | |
2229 | NAMESPACE_LEVEL (d) = current_binding_level; | |
2230 | } | |
30394414 | 2231 | } |
2c73f9f5 ML |
2232 | else |
2233 | resume_binding_level (NAMESPACE_LEVEL (d)); | |
2234 | ||
30394414 JM |
2235 | if (implicit_use) |
2236 | do_using_directive (d); | |
2c73f9f5 | 2237 | /* Enter the name space. */ |
30394414 | 2238 | current_namespace = d; |
a9aedbc2 MS |
2239 | } |
2240 | ||
2241 | /* Pop from the scope of the current namespace. */ | |
e92cc029 | 2242 | |
a9aedbc2 MS |
2243 | void |
2244 | pop_namespace () | |
2245 | { | |
2c73f9f5 ML |
2246 | if (current_namespace == global_namespace) |
2247 | { | |
2248 | my_friendly_assert (in_std>0, 980421); | |
2249 | in_std--; | |
2250 | return; | |
2251 | } | |
cb0dbb9a | 2252 | current_namespace = CP_DECL_CONTEXT (current_namespace); |
2c73f9f5 ML |
2253 | /* The binding level is not popped, as it might be re-opened later. */ |
2254 | suspend_binding_level (); | |
2255 | } | |
a9aedbc2 | 2256 | |
61fc8c9e MM |
2257 | /* Push into the scope of the namespace NS, even if it is deeply |
2258 | nested within another namespace. */ | |
2259 | ||
2260 | void | |
2261 | push_nested_namespace (ns) | |
2262 | tree ns; | |
2263 | { | |
2264 | if (ns == global_namespace) | |
2265 | push_to_top_level (); | |
2266 | else | |
2267 | { | |
2268 | push_nested_namespace (CP_DECL_CONTEXT (ns)); | |
2269 | push_namespace (DECL_NAME (ns)); | |
2270 | } | |
2271 | } | |
2272 | ||
2273 | /* Pop back from the scope of the namespace NS, which was previously | |
2274 | entered with push_nested_namespace. */ | |
2275 | ||
2276 | void | |
2277 | pop_nested_namespace (ns) | |
2278 | tree ns; | |
2279 | { | |
2280 | while (ns != global_namespace) | |
2281 | { | |
2282 | pop_namespace (); | |
2283 | ns = CP_DECL_CONTEXT (ns); | |
2284 | } | |
2285 | ||
2286 | pop_from_top_level (); | |
2287 | } | |
2288 | ||
8d08fdba MS |
2289 | \f |
2290 | /* Subroutines for reverting temporarily to top-level for instantiation | |
2291 | of templates and such. We actually need to clear out the class- and | |
2292 | local-value slots of all identifiers, so that only the global values | |
2293 | are at all visible. Simply setting current_binding_level to the global | |
2294 | scope isn't enough, because more binding levels may be pushed. */ | |
9cd64686 | 2295 | struct saved_scope *scope_chain; |
8d08fdba | 2296 | |
9cd64686 | 2297 | /* Mark ARG (which is really a struct saved_scope **) for GC. */ |
fc6af6e3 RH |
2298 | |
2299 | static void | |
2300 | mark_saved_scope (arg) | |
2301 | void *arg; | |
2302 | { | |
2303 | struct saved_scope *t = *(struct saved_scope **)arg; | |
2304 | while (t) | |
2305 | { | |
fc6af6e3 RH |
2306 | mark_binding_level (&t->class_bindings); |
2307 | ggc_mark_tree (t->old_bindings); | |
2308 | ggc_mark_tree (t->old_namespace); | |
2309 | ggc_mark_tree (t->class_name); | |
2310 | ggc_mark_tree (t->class_type); | |
2311 | ggc_mark_tree (t->access_specifier); | |
a8f73d4b | 2312 | ggc_mark_tree (t->function_decl); |
fc6af6e3 | 2313 | if (t->lang_base) |
9cd64686 | 2314 | ggc_mark_tree_varray (t->lang_base); |
fc6af6e3 | 2315 | ggc_mark_tree (t->lang_name); |
9cd64686 | 2316 | ggc_mark_tree (t->x_function_parms); |
fc6af6e3 | 2317 | ggc_mark_tree (t->template_parms); |
9cd64686 MM |
2318 | ggc_mark_tree (t->x_previous_class_type); |
2319 | ggc_mark_tree (t->x_previous_class_values); | |
a8f73d4b | 2320 | mark_binding_level (&t->bindings); |
fc6af6e3 RH |
2321 | t = t->prev; |
2322 | } | |
2323 | } | |
2324 | ||
e92cc029 | 2325 | static tree |
45537677 MS |
2326 | store_bindings (names, old_bindings) |
2327 | tree names, old_bindings; | |
2328 | { | |
2329 | tree t; | |
2330 | for (t = names; t; t = TREE_CHAIN (t)) | |
2331 | { | |
2332 | tree binding, t1, id; | |
2333 | ||
2334 | if (TREE_CODE (t) == TREE_LIST) | |
2335 | id = TREE_PURPOSE (t); | |
2336 | else | |
2337 | id = DECL_NAME (t); | |
2338 | ||
f181d4ae MM |
2339 | if (!id |
2340 | /* Note that we may have an IDENTIFIER_CLASS_VALUE even when | |
2341 | we have no IDENTIFIER_BINDING if we have left the class | |
2342 | scope, but cached the class-level declarations. */ | |
2343 | || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id))) | |
45537677 MS |
2344 | continue; |
2345 | ||
2346 | for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1)) | |
2347 | if (TREE_VEC_ELT (t1, 0) == id) | |
2348 | goto skip_it; | |
78957a2a | 2349 | |
87e3dbc9 | 2350 | binding = make_tree_vec (4); |
78957a2a | 2351 | |
45537677 MS |
2352 | if (id) |
2353 | { | |
2354 | my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135); | |
2355 | TREE_VEC_ELT (binding, 0) = id; | |
2c73f9f5 | 2356 | TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id); |
f181d4ae | 2357 | TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id); |
45537677 | 2358 | TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id); |
f181d4ae | 2359 | IDENTIFIER_BINDING (id) = NULL_TREE; |
45537677 MS |
2360 | IDENTIFIER_CLASS_VALUE (id) = NULL_TREE; |
2361 | } | |
2362 | TREE_CHAIN (binding) = old_bindings; | |
2363 | old_bindings = binding; | |
2364 | skip_it: | |
2365 | ; | |
2366 | } | |
2367 | return old_bindings; | |
2368 | } | |
2369 | ||
8d08fdba | 2370 | void |
5566b478 MS |
2371 | maybe_push_to_top_level (pseudo) |
2372 | int pseudo; | |
8d08fdba | 2373 | { |
a8f73d4b | 2374 | struct saved_scope *s; |
9cd64686 | 2375 | struct binding_level *b; |
a8f73d4b MM |
2376 | tree old_bindings; |
2377 | int need_pop; | |
2378 | ||
2379 | s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope)); | |
8d08fdba | 2380 | |
9cd64686 MM |
2381 | b = scope_chain ? current_binding_level : 0; |
2382 | ||
a8f73d4b MM |
2383 | /* If we're in the middle of some function, save our state. */ |
2384 | if (current_function) | |
2385 | { | |
2386 | need_pop = 1; | |
2387 | push_function_context_to (NULL_TREE); | |
2388 | } | |
2389 | else | |
2390 | need_pop = 0; | |
e349ee73 | 2391 | |
a8f73d4b | 2392 | old_bindings = NULL_TREE; |
9cd64686 | 2393 | if (scope_chain && previous_class_type) |
a50f0918 MS |
2394 | old_bindings = store_bindings (previous_class_values, old_bindings); |
2395 | ||
8d08fdba MS |
2396 | /* Have to include global_binding_level, because class-level decls |
2397 | aren't listed anywhere useful. */ | |
2398 | for (; b; b = b->level_chain) | |
2399 | { | |
2400 | tree t; | |
2401 | ||
2c73f9f5 ML |
2402 | /* Template IDs are inserted into the global level. If they were |
2403 | inserted into namespace level, finish_file wouldn't find them | |
2404 | when doing pending instantiations. Therefore, don't stop at | |
2405 | namespace level, but continue until :: . */ | |
5566b478 MS |
2406 | if (b == global_binding_level || (pseudo && b->pseudo_global)) |
2407 | break; | |
8d08fdba | 2408 | |
45537677 | 2409 | old_bindings = store_bindings (b->names, old_bindings); |
cffa8729 | 2410 | /* We also need to check class_shadowed to save class-level type |
45537677 MS |
2411 | bindings, since pushclass doesn't fill in b->names. */ |
2412 | if (b->parm_flag == 2) | |
cffa8729 | 2413 | old_bindings = store_bindings (b->class_shadowed, old_bindings); |
8d08fdba | 2414 | |
8d08fdba MS |
2415 | /* Unwind type-value slots back to top level. */ |
2416 | for (t = b->type_shadowed; t; t = TREE_CHAIN (t)) | |
2417 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t)); | |
2418 | } | |
fc0e7bf5 MM |
2419 | s->prev = scope_chain; |
2420 | s->old_bindings = old_bindings; | |
a8f73d4b MM |
2421 | s->bindings = b; |
2422 | s->need_pop_function_context = need_pop; | |
2423 | s->function_decl = current_function_decl; | |
fc0e7bf5 MM |
2424 | |
2425 | scope_chain = s; | |
8d08fdba | 2426 | current_function_decl = NULL_TREE; |
9cd64686 MM |
2427 | VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base"); |
2428 | current_lang_stack = &VARRAY_TREE (current_lang_base, 0); | |
51c184be MS |
2429 | current_lang_name = lang_name_cplusplus; |
2430 | strict_prototype = strict_prototypes_lang_cplusplus; | |
2c73f9f5 | 2431 | current_namespace = global_namespace; |
8d08fdba | 2432 | |
5566b478 MS |
2433 | push_obstacks (&permanent_obstack, &permanent_obstack); |
2434 | } | |
2435 | ||
2436 | void | |
2437 | push_to_top_level () | |
2438 | { | |
2439 | maybe_push_to_top_level (0); | |
8d08fdba MS |
2440 | } |
2441 | ||
2442 | void | |
2443 | pop_from_top_level () | |
2444 | { | |
9cd64686 | 2445 | struct saved_scope *s = scope_chain; |
8d08fdba MS |
2446 | tree t; |
2447 | ||
e76a2646 | 2448 | /* Clear out class-level bindings cache. */ |
8d08fdba | 2449 | if (previous_class_type) |
8f032717 | 2450 | invalidate_class_lookup_cache (); |
8d08fdba | 2451 | |
5566b478 MS |
2452 | pop_obstacks (); |
2453 | ||
9cd64686 MM |
2454 | VARRAY_FREE (current_lang_base); |
2455 | ||
2456 | scope_chain = s->prev; | |
87e3dbc9 | 2457 | for (t = s->old_bindings; t; t = TREE_CHAIN (t)) |
8d08fdba MS |
2458 | { |
2459 | tree id = TREE_VEC_ELT (t, 0); | |
2460 | if (id) | |
2461 | { | |
2c73f9f5 | 2462 | SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1)); |
f181d4ae | 2463 | IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2); |
8d08fdba | 2464 | IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3); |
9cd64686 | 2465 | } |
8d08fdba | 2466 | } |
9cd64686 | 2467 | |
51c184be MS |
2468 | if (current_lang_name == lang_name_cplusplus) |
2469 | strict_prototype = strict_prototypes_lang_cplusplus; | |
2470 | else if (current_lang_name == lang_name_c) | |
2471 | strict_prototype = strict_prototypes_lang_c; | |
51c184be | 2472 | |
a8f73d4b MM |
2473 | /* If we were in the middle of compiling a function, restore our |
2474 | state. */ | |
2475 | if (s->need_pop_function_context) | |
2476 | pop_function_context_from (NULL_TREE); | |
2477 | current_function_decl = s->function_decl; | |
e349ee73 | 2478 | |
a8f73d4b | 2479 | free (s); |
8d08fdba MS |
2480 | } |
2481 | \f | |
2482 | /* Push a definition of struct, union or enum tag "name". | |
2483 | into binding_level "b". "type" should be the type node, | |
2484 | We assume that the tag "name" is not already defined. | |
2485 | ||
2486 | Note that the definition may really be just a forward reference. | |
2487 | In that case, the TYPE_SIZE will be a NULL_TREE. | |
2488 | ||
e92cc029 | 2489 | C++ gratuitously puts all these tags in the name space. */ |
8d08fdba MS |
2490 | |
2491 | /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID, | |
2492 | record the shadowed value for this binding contour. TYPE is | |
2493 | the type that ID maps to. */ | |
2494 | ||
2495 | static void | |
2496 | set_identifier_type_value_with_scope (id, type, b) | |
2497 | tree id; | |
2498 | tree type; | |
2499 | struct binding_level *b; | |
2500 | { | |
2c73f9f5 | 2501 | if (!b->namespace_p) |
8d08fdba | 2502 | { |
2c73f9f5 ML |
2503 | /* Shadow the marker, not the real thing, so that the marker |
2504 | gets restored later. */ | |
2505 | tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id); | |
8d08fdba MS |
2506 | b->type_shadowed |
2507 | = tree_cons (id, old_type_value, b->type_shadowed); | |
2508 | } | |
2c73f9f5 ML |
2509 | else |
2510 | { | |
2511 | tree binding = binding_for_name (id, current_namespace); | |
2512 | BINDING_TYPE (binding) = type; | |
2513 | /* Store marker instead of real type. */ | |
2514 | type = global_type_node; | |
2515 | } | |
8d08fdba MS |
2516 | SET_IDENTIFIER_TYPE_VALUE (id, type); |
2517 | } | |
2518 | ||
8f032717 | 2519 | /* As set_identifier_type_value_with_scope, but using current_binding_level. */ |
8d08fdba MS |
2520 | |
2521 | void | |
2522 | set_identifier_type_value (id, type) | |
2523 | tree id; | |
2524 | tree type; | |
2525 | { | |
8f032717 | 2526 | set_identifier_type_value_with_scope (id, type, current_binding_level); |
8d08fdba MS |
2527 | } |
2528 | ||
2c73f9f5 ML |
2529 | /* Return the type associated with id. */ |
2530 | ||
2531 | tree | |
2532 | identifier_type_value (id) | |
2533 | tree id; | |
2534 | { | |
2535 | /* There is no type with that name, anywhere. */ | |
2536 | if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE) | |
2537 | return NULL_TREE; | |
2538 | /* This is not the type marker, but the real thing. */ | |
2539 | if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node) | |
2540 | return REAL_IDENTIFIER_TYPE_VALUE (id); | |
2541 | /* Have to search for it. It must be on the global level, now. | |
2542 | Ask lookup_name not to return non-types. */ | |
3e3f722c | 2543 | id = lookup_name_real (id, 2, 1, 0); |
2c73f9f5 ML |
2544 | if (id) |
2545 | return TREE_TYPE (id); | |
2546 | return NULL_TREE; | |
2547 | } | |
2548 | ||
a9aedbc2 MS |
2549 | /* Pop off extraneous binding levels left over due to syntax errors. |
2550 | ||
2551 | We don't pop past namespaces, as they might be valid. */ | |
e92cc029 | 2552 | |
8926095f MS |
2553 | void |
2554 | pop_everything () | |
2555 | { | |
2556 | #ifdef DEBUG_CP_BINDING_LEVELS | |
2557 | fprintf (stderr, "XXX entering pop_everything ()\n"); | |
2558 | #endif | |
8f032717 | 2559 | while (!toplevel_bindings_p ()) |
8926095f | 2560 | { |
8f032717 | 2561 | if (current_binding_level->parm_flag == 2) |
b74a0560 | 2562 | pop_nested_class (); |
8926095f MS |
2563 | else |
2564 | poplevel (0, 0, 0); | |
2565 | } | |
2566 | #ifdef DEBUG_CP_BINDING_LEVELS | |
2567 | fprintf (stderr, "XXX leaving pop_everything ()\n"); | |
2568 | #endif | |
2569 | } | |
2570 | ||
39c01e4c MM |
2571 | /* The type TYPE is being declared. If it is a class template, or a |
2572 | specialization of a class template, do any processing required and | |
2573 | perform error-checking. If IS_FRIEND is non-zero, this TYPE is | |
2574 | being declared a friend. B is the binding level at which this TYPE | |
2575 | should be bound. | |
2576 | ||
2577 | Returns the TYPE_DECL for TYPE, which may have been altered by this | |
2578 | processing. */ | |
2579 | ||
2580 | static tree | |
2581 | maybe_process_template_type_declaration (type, globalize, b) | |
2582 | tree type; | |
2583 | int globalize; | |
2584 | struct binding_level* b; | |
2585 | { | |
2586 | tree decl = TYPE_NAME (type); | |
2587 | ||
2588 | if (processing_template_parmlist) | |
2589 | /* You can't declare a new template type in a template parameter | |
2590 | list. But, you can declare a non-template type: | |
2591 | ||
2592 | template <class A*> struct S; | |
2593 | ||
2594 | is a forward-declaration of `A'. */ | |
2595 | ; | |
2596 | else | |
2597 | { | |
2598 | maybe_check_template_type (type); | |
2599 | ||
ed44da02 MM |
2600 | my_friendly_assert (IS_AGGR_TYPE (type) |
2601 | || TREE_CODE (type) == ENUMERAL_TYPE, 0); | |
2602 | ||
2603 | ||
3ebc5c52 | 2604 | if (processing_template_decl) |
39c01e4c MM |
2605 | { |
2606 | /* This may change after the call to | |
2607 | push_template_decl_real, but we want the original value. */ | |
2608 | tree name = DECL_NAME (decl); | |
2609 | ||
2610 | decl = push_template_decl_real (decl, globalize); | |
2611 | /* If the current binding level is the binding level for the | |
2612 | template parameters (see the comment in | |
2613 | begin_template_parm_list) and the enclosing level is a class | |
2614 | scope, and we're not looking at a friend, push the | |
2615 | declaration of the member class into the class scope. In the | |
2616 | friend case, push_template_decl will already have put the | |
2617 | friend into global scope, if appropriate. */ | |
ed44da02 MM |
2618 | if (TREE_CODE (type) != ENUMERAL_TYPE |
2619 | && !globalize && b->pseudo_global | |
39c01e4c MM |
2620 | && b->level_chain->parm_flag == 2) |
2621 | { | |
61a127b3 | 2622 | finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type)); |
39c01e4c MM |
2623 | /* Put this tag on the list of tags for the class, since |
2624 | that won't happen below because B is not the class | |
2625 | binding level, but is instead the pseudo-global level. */ | |
2626 | b->level_chain->tags = | |
e1b3e07d | 2627 | tree_cons (name, type, b->level_chain->tags); |
39c01e4c MM |
2628 | if (TYPE_SIZE (current_class_type) == NULL_TREE) |
2629 | CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags; | |
2630 | } | |
2631 | } | |
2632 | } | |
2633 | ||
2634 | return decl; | |
2635 | } | |
2636 | ||
9188c363 MM |
2637 | /* In C++, you don't have to write `struct S' to refer to `S'; you |
2638 | can just use `S'. We accomplish this by creating a TYPE_DECL as | |
2639 | if the user had written `typedef struct S S'. Create and return | |
2640 | the TYPE_DECL for TYPE. */ | |
2641 | ||
2642 | tree | |
2643 | create_implicit_typedef (name, type) | |
2644 | tree name; | |
2645 | tree type; | |
2646 | { | |
2647 | tree decl; | |
2648 | ||
2649 | decl = build_decl (TYPE_DECL, name, type); | |
2650 | SET_DECL_ARTIFICIAL (decl); | |
2651 | /* There are other implicit type declarations, like the one *within* | |
2652 | a class that allows you to write `S::S'. We must distinguish | |
2653 | amongst these. */ | |
2654 | SET_DECL_IMPLICIT_TYPEDEF_P (decl); | |
2655 | TYPE_NAME (type) = decl; | |
2656 | ||
2657 | return decl; | |
2658 | } | |
2659 | ||
8d08fdba | 2660 | /* Push a tag name NAME for struct/class/union/enum type TYPE. |
6757edfe | 2661 | Normally put it into the inner-most non-tag-transparent scope, |
8d08fdba | 2662 | but if GLOBALIZE is true, put it in the inner-most non-class scope. |
e92cc029 | 2663 | The latter is needed for implicit declarations. */ |
8d08fdba MS |
2664 | |
2665 | void | |
2666 | pushtag (name, type, globalize) | |
2667 | tree name, type; | |
2668 | int globalize; | |
2669 | { | |
2670 | register struct binding_level *b; | |
8d08fdba | 2671 | |
8f032717 | 2672 | b = current_binding_level; |
8d08fdba MS |
2673 | while (b->tag_transparent |
2674 | || (globalize && b->parm_flag == 2)) | |
2675 | b = b->level_chain; | |
2676 | ||
e1b3e07d | 2677 | b->tags = tree_cons (name, type, b->tags); |
8d08fdba MS |
2678 | |
2679 | if (name) | |
2680 | { | |
8d08fdba | 2681 | /* Do C++ gratuitous typedefing. */ |
db5ae43f | 2682 | if (IDENTIFIER_TYPE_VALUE (name) != type) |
8d08fdba | 2683 | { |
93cdc044 | 2684 | register tree d = NULL_TREE; |
848cf1e0 | 2685 | int in_class = 0; |
9188c363 | 2686 | tree context = TYPE_CONTEXT (type); |
280f9385 | 2687 | |
280f9385 MM |
2688 | if (! context) |
2689 | { | |
2690 | tree cs = current_scope (); | |
2691 | ||
2692 | if (! globalize) | |
2693 | context = cs; | |
2694 | else if (cs != NULL_TREE | |
2695 | && TREE_CODE_CLASS (TREE_CODE (cs)) == 't') | |
2696 | /* When declaring a friend class of a local class, we want | |
2697 | to inject the newly named class into the scope | |
2698 | containing the local class, not the namespace scope. */ | |
2699 | context = hack_decl_function_context (get_type_decl (cs)); | |
2700 | } | |
280f9385 MM |
2701 | if (!context) |
2702 | context = current_namespace; | |
8d08fdba | 2703 | |
93cdc044 JM |
2704 | if ((b->pseudo_global && b->level_chain->parm_flag == 2) |
2705 | || b->parm_flag == 2) | |
2706 | in_class = 1; | |
93cdc044 | 2707 | |
848cf1e0 MM |
2708 | if (current_lang_name == lang_name_java) |
2709 | TYPE_FOR_JAVA (type) = 1; | |
93cdc044 | 2710 | |
9188c363 | 2711 | d = create_implicit_typedef (name, type); |
cb0dbb9a | 2712 | DECL_CONTEXT (d) = FROB_CONTEXT (context); |
9188c363 MM |
2713 | if (! in_class) |
2714 | set_identifier_type_value_with_scope (name, type, b); | |
e1cd6e56 | 2715 | |
39c01e4c MM |
2716 | d = maybe_process_template_type_declaration (type, |
2717 | globalize, b); | |
93cdc044 JM |
2718 | |
2719 | if (b->parm_flag == 2) | |
61a127b3 | 2720 | { |
848cf1e0 | 2721 | if (!PROCESSING_REAL_TEMPLATE_DECL_P ()) |
61a127b3 MM |
2722 | /* Put this TYPE_DECL on the TYPE_FIELDS list for the |
2723 | class. But if it's a member template class, we | |
2724 | want the TEMPLATE_DECL, not the TYPE_DECL, so this | |
2725 | is done later. */ | |
2726 | finish_member_declaration (d); | |
8f032717 MM |
2727 | else |
2728 | pushdecl_class_level (d); | |
61a127b3 | 2729 | } |
93cdc044 JM |
2730 | else |
2731 | d = pushdecl_with_scope (d, b); | |
2732 | ||
848cf1e0 MM |
2733 | if (ANON_AGGRNAME_P (name)) |
2734 | DECL_IGNORED_P (d) = 1; | |
2735 | ||
2736 | TYPE_CONTEXT (type) = DECL_CONTEXT (d); | |
2737 | DECL_ASSEMBLER_NAME (d) = DECL_NAME (d); | |
2738 | if (!uses_template_parms (type)) | |
2739 | DECL_ASSEMBLER_NAME (d) | |
2740 | = get_identifier (build_overload_name (type, 1, 1)); | |
8d08fdba MS |
2741 | } |
2742 | if (b->parm_flag == 2) | |
2743 | { | |
8d08fdba MS |
2744 | if (TYPE_SIZE (current_class_type) == NULL_TREE) |
2745 | CLASSTYPE_TAGS (current_class_type) = b->tags; | |
2746 | } | |
2747 | } | |
2748 | ||
2749 | if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL) | |
2750 | /* Use the canonical TYPE_DECL for this node. */ | |
2751 | TYPE_STUB_DECL (type) = TYPE_NAME (type); | |
2752 | else | |
2753 | { | |
2754 | /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE | |
2755 | will be the tagged type we just added to the current | |
2756 | binding level. This fake NULL-named TYPE_DECL node helps | |
2757 | dwarfout.c to know when it needs to output a | |
2758 | representation of a tagged type, and it also gives us a | |
2759 | convenient place to record the "scope start" address for | |
2760 | the tagged type. */ | |
2761 | ||
8d08fdba | 2762 | tree d = build_decl (TYPE_DECL, NULL_TREE, type); |
8d08fdba MS |
2763 | TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b); |
2764 | } | |
2765 | } | |
2766 | ||
2767 | /* Counter used to create anonymous type names. */ | |
e92cc029 | 2768 | |
8d08fdba MS |
2769 | static int anon_cnt = 0; |
2770 | ||
2771 | /* Return an IDENTIFIER which can be used as a name for | |
2772 | anonymous structs and unions. */ | |
e92cc029 | 2773 | |
8d08fdba MS |
2774 | tree |
2775 | make_anon_name () | |
2776 | { | |
2777 | char buf[32]; | |
2778 | ||
2779 | sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++); | |
2780 | return get_identifier (buf); | |
2781 | } | |
2782 | ||
2783 | /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames. | |
2784 | This keeps dbxout from getting confused. */ | |
e92cc029 | 2785 | |
8d08fdba MS |
2786 | void |
2787 | clear_anon_tags () | |
2788 | { | |
2789 | register struct binding_level *b; | |
2790 | register tree tags; | |
2791 | static int last_cnt = 0; | |
2792 | ||
2793 | /* Fast out if no new anon names were declared. */ | |
2794 | if (last_cnt == anon_cnt) | |
2795 | return; | |
2796 | ||
2797 | b = current_binding_level; | |
2798 | while (b->tag_transparent) | |
2799 | b = b->level_chain; | |
2800 | tags = b->tags; | |
2801 | while (tags) | |
2802 | { | |
2803 | /* A NULL purpose means we have already processed all tags | |
2804 | from here to the end of the list. */ | |
2805 | if (TREE_PURPOSE (tags) == NULL_TREE) | |
2806 | break; | |
2807 | if (ANON_AGGRNAME_P (TREE_PURPOSE (tags))) | |
2808 | TREE_PURPOSE (tags) = NULL_TREE; | |
2809 | tags = TREE_CHAIN (tags); | |
2810 | } | |
2811 | last_cnt = anon_cnt; | |
2812 | } | |
2813 | \f | |
2814 | /* Subroutine of duplicate_decls: return truthvalue of whether | |
2815 | or not types of these decls match. | |
2816 | ||
2817 | For C++, we must compare the parameter list so that `int' can match | |
2818 | `int&' in a parameter position, but `int&' is not confused with | |
2819 | `const int&'. */ | |
e92cc029 | 2820 | |
6060a796 | 2821 | int |
8d08fdba MS |
2822 | decls_match (newdecl, olddecl) |
2823 | tree newdecl, olddecl; | |
2824 | { | |
2825 | int types_match; | |
2826 | ||
347d73d7 ML |
2827 | if (newdecl == olddecl) |
2828 | return 1; | |
2829 | ||
6b4b3deb MM |
2830 | if (TREE_CODE (newdecl) != TREE_CODE (olddecl)) |
2831 | /* If the two DECLs are not even the same kind of thing, we're not | |
2832 | interested in their types. */ | |
2833 | return 0; | |
2834 | ||
2835 | if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
8d08fdba MS |
2836 | { |
2837 | tree f1 = TREE_TYPE (newdecl); | |
2838 | tree f2 = TREE_TYPE (olddecl); | |
2839 | tree p1 = TYPE_ARG_TYPES (f1); | |
2840 | tree p2 = TYPE_ARG_TYPES (f2); | |
2841 | ||
c5a6fc45 JM |
2842 | if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl) |
2843 | && ! (DECL_LANGUAGE (newdecl) == lang_c | |
2844 | && DECL_LANGUAGE (olddecl) == lang_c)) | |
2845 | return 0; | |
2846 | ||
8d08fdba MS |
2847 | /* When we parse a static member function definition, |
2848 | we put together a FUNCTION_DECL which thinks its type | |
2849 | is METHOD_TYPE. Change that to FUNCTION_TYPE, and | |
2850 | proceed. */ | |
2851 | if (TREE_CODE (f1) == METHOD_TYPE && DECL_STATIC_FUNCTION_P (olddecl)) | |
700f8a87 | 2852 | revert_static_member_fn (&newdecl, &f1, &p1); |
8d08fdba MS |
2853 | else if (TREE_CODE (f2) == METHOD_TYPE |
2854 | && DECL_STATIC_FUNCTION_P (newdecl)) | |
700f8a87 | 2855 | revert_static_member_fn (&olddecl, &f2, &p2); |
8d08fdba MS |
2856 | |
2857 | /* Here we must take care of the case where new default | |
2858 | parameters are specified. Also, warn if an old | |
2859 | declaration becomes ambiguous because default | |
2860 | parameters may cause the two to be ambiguous. */ | |
2861 | if (TREE_CODE (f1) != TREE_CODE (f2)) | |
2862 | { | |
2863 | if (TREE_CODE (f1) == OFFSET_TYPE) | |
8251199e | 2864 | cp_compiler_error ("`%D' redeclared as member function", newdecl); |
8d08fdba | 2865 | else |
8251199e | 2866 | cp_compiler_error ("`%D' redeclared as non-member function", newdecl); |
8d08fdba MS |
2867 | return 0; |
2868 | } | |
2869 | ||
3bfdc719 | 2870 | if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2))) |
8926095f | 2871 | { |
a28e3c7f | 2872 | if (! strict_prototypes_lang_c && DECL_LANGUAGE (olddecl) == lang_c |
8926095f | 2873 | && p2 == NULL_TREE) |
a28e3c7f MS |
2874 | { |
2875 | types_match = self_promoting_args_p (p1); | |
2876 | if (p1 == void_list_node) | |
2877 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
2878 | } | |
2879 | else if (!strict_prototypes_lang_c && DECL_LANGUAGE (olddecl)==lang_c | |
2880 | && DECL_LANGUAGE (newdecl) == lang_c && p1 == NULL_TREE) | |
2881 | { | |
2882 | types_match = self_promoting_args_p (p2); | |
2883 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl); | |
2884 | } | |
8926095f | 2885 | else |
91063b51 | 2886 | types_match = compparms (p1, p2); |
8926095f | 2887 | } |
8d08fdba MS |
2888 | else |
2889 | types_match = 0; | |
2890 | } | |
6b4b3deb | 2891 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
51c184be | 2892 | { |
f84b4be9 JM |
2893 | if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
2894 | DECL_TEMPLATE_PARMS (olddecl))) | |
2895 | return 0; | |
2896 | ||
2897 | if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
2898 | types_match = 1; | |
2899 | else | |
2900 | types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl), | |
2901 | DECL_TEMPLATE_RESULT (newdecl)); | |
51c184be | 2902 | } |
8d08fdba MS |
2903 | else |
2904 | { | |
2905 | if (TREE_TYPE (newdecl) == error_mark_node) | |
2906 | types_match = TREE_TYPE (olddecl) == error_mark_node; | |
2907 | else if (TREE_TYPE (olddecl) == NULL_TREE) | |
2908 | types_match = TREE_TYPE (newdecl) == NULL_TREE; | |
a0a33927 MS |
2909 | else if (TREE_TYPE (newdecl) == NULL_TREE) |
2910 | types_match = 0; | |
8d08fdba | 2911 | else |
01240200 | 2912 | types_match = comptypes (TREE_TYPE (newdecl), |
3bfdc719 MM |
2913 | TREE_TYPE (olddecl), |
2914 | COMPARE_REDECLARATION); | |
8d08fdba MS |
2915 | } |
2916 | ||
2917 | return types_match; | |
2918 | } | |
2919 | ||
2920 | /* If NEWDECL is `static' and an `extern' was seen previously, | |
24f30ed4 | 2921 | warn about it. OLDDECL is the previous declaration. |
8d08fdba MS |
2922 | |
2923 | Note that this does not apply to the C++ case of declaring | |
2924 | a variable `extern const' and then later `const'. | |
2925 | ||
8d08fdba MS |
2926 | Don't complain about built-in functions, since they are beyond |
2927 | the user's control. */ | |
2928 | ||
2929 | static void | |
2930 | warn_extern_redeclared_static (newdecl, olddecl) | |
2931 | tree newdecl, olddecl; | |
2932 | { | |
d8e178a0 | 2933 | static const char *explicit_extern_static_warning |
8251199e | 2934 | = "`%D' was declared `extern' and later `static'"; |
d8e178a0 | 2935 | static const char *implicit_extern_static_warning |
8251199e JM |
2936 | = "`%D' was declared implicitly `extern' and later `static'"; |
2937 | ||
24f30ed4 MM |
2938 | tree name; |
2939 | ||
d22c8596 | 2940 | if (TREE_CODE (newdecl) == TYPE_DECL) |
8d08fdba MS |
2941 | return; |
2942 | ||
24f30ed4 MM |
2943 | /* If the old declaration was `static', or the new one isn't, then |
2944 | then everything is OK. */ | |
2945 | if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl)) | |
2946 | return; | |
2947 | ||
2948 | /* It's OK to declare a builtin function as `static'. */ | |
2949 | if (TREE_CODE (olddecl) == FUNCTION_DECL | |
2950 | && DECL_ARTIFICIAL (olddecl)) | |
2951 | return; | |
2952 | ||
8d08fdba | 2953 | name = DECL_ASSEMBLER_NAME (newdecl); |
24f30ed4 MM |
2954 | cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name) |
2955 | ? implicit_extern_static_warning | |
2956 | : explicit_extern_static_warning, newdecl); | |
2957 | cp_pedwarn_at ("previous declaration of `%D'", olddecl); | |
8d08fdba MS |
2958 | } |
2959 | ||
2960 | /* Handle when a new declaration NEWDECL has the same name as an old | |
2961 | one OLDDECL in the same binding contour. Prints an error message | |
2962 | if appropriate. | |
2963 | ||
2964 | If safely possible, alter OLDDECL to look like NEWDECL, and return 1. | |
2965 | Otherwise, return 0. */ | |
2966 | ||
51c184be | 2967 | int |
8d08fdba | 2968 | duplicate_decls (newdecl, olddecl) |
824b9a4c | 2969 | tree newdecl, olddecl; |
8d08fdba | 2970 | { |
8d08fdba MS |
2971 | unsigned olddecl_uid = DECL_UID (olddecl); |
2972 | int olddecl_friend = 0, types_match = 0; | |
0b60dfe3 | 2973 | int new_defines_function = 0; |
5566b478 MS |
2974 | |
2975 | if (newdecl == olddecl) | |
2976 | return 1; | |
8d08fdba | 2977 | |
8926095f | 2978 | types_match = decls_match (newdecl, olddecl); |
8d08fdba | 2979 | |
8d08fdba MS |
2980 | /* If either the type of the new decl or the type of the old decl is an |
2981 | error_mark_node, then that implies that we have already issued an | |
2982 | error (earlier) for some bogus type specification, and in that case, | |
2983 | it is rather pointless to harass the user with yet more error message | |
0b60dfe3 | 2984 | about the same declaration, so just pretend the types match here. */ |
bd6dd845 MS |
2985 | if (TREE_TYPE (newdecl) == error_mark_node |
2986 | || TREE_TYPE (olddecl) == error_mark_node) | |
8d08fdba | 2987 | types_match = 1; |
0b60dfe3 BK |
2988 | |
2989 | /* Check for redeclaration and other discrepancies. */ | |
d22c8596 | 2990 | if (TREE_CODE (olddecl) == FUNCTION_DECL |
9f33663b JM |
2991 | && DECL_ARTIFICIAL (olddecl)) |
2992 | { | |
2993 | if (TREE_CODE (newdecl) != FUNCTION_DECL) | |
2994 | { | |
2995 | /* If you declare a built-in or predefined function name as static, | |
2996 | the old definition is overridden, but optionally warn this was a | |
2997 | bad choice of name. */ | |
2998 | if (! TREE_PUBLIC (newdecl)) | |
2999 | { | |
3000 | if (warn_shadow) | |
3001 | cp_warning ("shadowing %s function `%#D'", | |
3002 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", | |
3003 | olddecl); | |
3004 | /* Discard the old built-in function. */ | |
3005 | return 0; | |
3006 | } | |
3007 | /* If the built-in is not ansi, then programs can override | |
3008 | it even globally without an error. */ | |
3009 | else if (! DECL_BUILT_IN (olddecl)) | |
3010 | cp_warning ("library function `%#D' redeclared as non-function `%#D'", | |
3011 | olddecl, newdecl); | |
3012 | else | |
3013 | { | |
3014 | cp_error ("declaration of `%#D'", newdecl); | |
3015 | cp_error ("conflicts with built-in declaration `%#D'", | |
a4443a08 | 3016 | olddecl); |
9f33663b | 3017 | } |
a4443a08 MS |
3018 | return 0; |
3019 | } | |
9f33663b | 3020 | else if (!types_match) |
8d08fdba | 3021 | { |
9f33663b JM |
3022 | if ((DECL_LANGUAGE (newdecl) == lang_c |
3023 | && DECL_LANGUAGE (olddecl) == lang_c) | |
3024 | || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), | |
3025 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) | |
a4443a08 | 3026 | { |
9f33663b JM |
3027 | /* A near match; override the builtin. */ |
3028 | ||
3029 | if (TREE_PUBLIC (newdecl)) | |
a4443a08 | 3030 | { |
9f33663b JM |
3031 | cp_warning ("new declaration `%#D'", newdecl); |
3032 | cp_warning ("ambiguates built-in declaration `%#D'", | |
3033 | olddecl); | |
a4443a08 | 3034 | } |
9f33663b JM |
3035 | else if (warn_shadow) |
3036 | cp_warning ("shadowing %s function `%#D'", | |
3037 | DECL_BUILT_IN (olddecl) ? "built-in" : "library", | |
3038 | olddecl); | |
a4443a08 | 3039 | } |
9f33663b JM |
3040 | else |
3041 | /* Discard the old built-in function. */ | |
3042 | return 0; | |
8d08fdba | 3043 | } |
24f30ed4 MM |
3044 | |
3045 | if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl)) | |
3046 | { | |
3047 | /* If a builtin function is redeclared as `static', merge | |
3048 | the declarations, but make the original one static. */ | |
3049 | DECL_THIS_STATIC (olddecl) = 1; | |
3050 | TREE_PUBLIC (olddecl) = 0; | |
3051 | } | |
39211cd5 MS |
3052 | } |
3053 | else if (TREE_CODE (olddecl) != TREE_CODE (newdecl)) | |
3054 | { | |
9ed182dc JM |
3055 | if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl) |
3056 | && TREE_CODE (newdecl) != TYPE_DECL | |
3057 | && ! (TREE_CODE (newdecl) == TEMPLATE_DECL | |
3058 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)) | |
3059 | || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl) | |
3060 | && TREE_CODE (olddecl) != TYPE_DECL | |
3061 | && ! (TREE_CODE (olddecl) == TEMPLATE_DECL | |
3062 | && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) | |
3063 | == TYPE_DECL)))) | |
3064 | { | |
3065 | /* We do nothing special here, because C++ does such nasty | |
3066 | things with TYPE_DECLs. Instead, just let the TYPE_DECL | |
3067 | get shadowed, and know that if we need to find a TYPE_DECL | |
3068 | for a given name, we can look in the IDENTIFIER_TYPE_VALUE | |
3069 | slot of the identifier. */ | |
3070 | return 0; | |
3071 | } | |
3072 | ||
39211cd5 | 3073 | if ((TREE_CODE (newdecl) == FUNCTION_DECL |
5566b478 | 3074 | && DECL_FUNCTION_TEMPLATE_P (olddecl)) |
39211cd5 | 3075 | || (TREE_CODE (olddecl) == FUNCTION_DECL |
5566b478 | 3076 | && DECL_FUNCTION_TEMPLATE_P (newdecl))) |
39211cd5 | 3077 | return 0; |
9ed182dc | 3078 | |
8251199e | 3079 | cp_error ("`%#D' redeclared as different kind of symbol", newdecl); |
39211cd5 MS |
3080 | if (TREE_CODE (olddecl) == TREE_LIST) |
3081 | olddecl = TREE_VALUE (olddecl); | |
8251199e | 3082 | cp_error_at ("previous declaration of `%#D'", olddecl); |
39211cd5 MS |
3083 | |
3084 | /* New decl is completely inconsistent with the old one => | |
3085 | tell caller to replace the old one. */ | |
3086 | ||
3087 | return 0; | |
8d08fdba | 3088 | } |
8d08fdba MS |
3089 | else if (!types_match) |
3090 | { | |
7bdbfa05 MM |
3091 | if (DECL_REAL_CONTEXT (newdecl) != DECL_REAL_CONTEXT (olddecl)) |
3092 | /* These are certainly not duplicate declarations; they're | |
3093 | from different scopes. */ | |
3094 | return 0; | |
3095 | ||
8926095f | 3096 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
f0e01782 MS |
3097 | { |
3098 | /* The name of a class template may not be declared to refer to | |
3099 | any other template, class, function, object, namespace, value, | |
e92cc029 | 3100 | or type in the same scope. */ |
5566b478 MS |
3101 | if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL |
3102 | || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL) | |
f0e01782 | 3103 | { |
8251199e JM |
3104 | cp_error ("declaration of template `%#D'", newdecl); |
3105 | cp_error_at ("conflicts with previous declaration `%#D'", | |
f0e01782 MS |
3106 | olddecl); |
3107 | } | |
ec255269 MS |
3108 | else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL |
3109 | && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL | |
3110 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))), | |
91063b51 | 3111 | TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)))) |
75650646 MM |
3112 | && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl), |
3113 | DECL_TEMPLATE_PARMS (olddecl))) | |
ec255269 | 3114 | { |
8251199e JM |
3115 | cp_error ("new declaration `%#D'", newdecl); |
3116 | cp_error_at ("ambiguates old declaration `%#D'", olddecl); | |
ec255269 | 3117 | } |
f0e01782 MS |
3118 | return 0; |
3119 | } | |
8926095f MS |
3120 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
3121 | { | |
3122 | if (DECL_LANGUAGE (newdecl) == lang_c | |
3123 | && DECL_LANGUAGE (olddecl) == lang_c) | |
3124 | { | |
8251199e | 3125 | cp_error ("declaration of C function `%#D' conflicts with", |
8926095f | 3126 | newdecl); |
8251199e | 3127 | cp_error_at ("previous declaration `%#D' here", olddecl); |
8926095f | 3128 | } |
00595019 | 3129 | else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)), |
91063b51 | 3130 | TYPE_ARG_TYPES (TREE_TYPE (olddecl)))) |
700f8a87 | 3131 | { |
8251199e JM |
3132 | cp_error ("new declaration `%#D'", newdecl); |
3133 | cp_error_at ("ambiguates old declaration `%#D'", olddecl); | |
700f8a87 MS |
3134 | } |
3135 | else | |
3136 | return 0; | |
8926095f | 3137 | } |
8d08fdba MS |
3138 | |
3139 | /* Already complained about this, so don't do so again. */ | |
a4443a08 | 3140 | else if (current_class_type == NULL_TREE |
8d08fdba MS |
3141 | || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type) |
3142 | { | |
8251199e JM |
3143 | cp_error ("conflicting types for `%#D'", newdecl); |
3144 | cp_error_at ("previous declaration as `%#D'", olddecl); | |
8d08fdba MS |
3145 | } |
3146 | } | |
75650646 MM |
3147 | else if (TREE_CODE (newdecl) == FUNCTION_DECL |
3148 | && ((DECL_TEMPLATE_SPECIALIZATION (olddecl) | |
3149 | && (!DECL_TEMPLATE_INFO (newdecl) | |
3150 | || (DECL_TI_TEMPLATE (newdecl) | |
3151 | != DECL_TI_TEMPLATE (olddecl)))) | |
3152 | || (DECL_TEMPLATE_SPECIALIZATION (newdecl) | |
3153 | && (!DECL_TEMPLATE_INFO (olddecl) | |
3154 | || (DECL_TI_TEMPLATE (olddecl) | |
3155 | != DECL_TI_TEMPLATE (newdecl)))))) | |
386b8a85 JM |
3156 | /* It's OK to have a template specialization and a non-template |
3157 | with the same type, or to have specializations of two | |
75650646 MM |
3158 | different templates with the same type. Note that if one is a |
3159 | specialization, and the other is an instantiation of the same | |
3160 | template, that we do not exit at this point. That situation | |
3161 | can occur if we instantiate a template class, and then | |
3162 | specialize one of its methods. This situation is legal, but | |
3163 | the declarations must be merged in the usual way. */ | |
3164 | return 0; | |
3165 | else if (TREE_CODE (newdecl) == FUNCTION_DECL | |
3166 | && ((DECL_TEMPLATE_INSTANTIATION (olddecl) | |
3167 | && !DECL_USE_TEMPLATE (newdecl)) | |
3168 | || (DECL_TEMPLATE_INSTANTIATION (newdecl) | |
3169 | && !DECL_USE_TEMPLATE (olddecl)))) | |
3170 | /* One of the declarations is a template instantiation, and the | |
3171 | other is not a template at all. That's OK. */ | |
386b8a85 | 3172 | return 0; |
85c6cbaf ML |
3173 | else if (TREE_CODE (newdecl) == NAMESPACE_DECL |
3174 | && DECL_NAMESPACE_ALIAS (newdecl) | |
3175 | && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl)) | |
3176 | /* Redeclaration of namespace alias, ignore it. */ | |
3177 | return 1; | |
8d08fdba MS |
3178 | else |
3179 | { | |
d8e178a0 | 3180 | const char *errmsg = redeclaration_error_message (newdecl, olddecl); |
8251199e | 3181 | if (errmsg) |
8d08fdba | 3182 | { |
8251199e | 3183 | cp_error (errmsg, newdecl); |
8d08fdba MS |
3184 | if (DECL_NAME (olddecl) != NULL_TREE) |
3185 | cp_error_at ((DECL_INITIAL (olddecl) | |
2c73f9f5 | 3186 | && namespace_bindings_p ()) |
8251199e JM |
3187 | ? "`%#D' previously defined here" |
3188 | : "`%#D' previously declared here", olddecl); | |
8d08fdba MS |
3189 | } |
3190 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
3191 | && DECL_INITIAL (olddecl) != NULL_TREE | |
3192 | && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE | |
3193 | && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE) | |
3194 | { | |
3195 | /* Prototype decl follows defn w/o prototype. */ | |
8251199e JM |
3196 | cp_warning_at ("prototype for `%#D'", newdecl); |
3197 | cp_warning_at ("follows non-prototype definition here", olddecl); | |
8d08fdba MS |
3198 | } |
3199 | else if (TREE_CODE (olddecl) == FUNCTION_DECL | |
3200 | && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl)) | |
8926095f MS |
3201 | { |
3202 | /* extern "C" int foo (); | |
3203 | int foo () { bar (); } | |
3204 | is OK. */ | |
9cd64686 MM |
3205 | if (current_lang_stack |
3206 | == &VARRAY_TREE (current_lang_base, 0)) | |
a28e3c7f | 3207 | DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl); |
8926095f MS |
3208 | else |
3209 | { | |
8251199e | 3210 | cp_error_at ("previous declaration of `%#D' with %L linkage", |
8926095f | 3211 | olddecl, DECL_LANGUAGE (olddecl)); |
8251199e | 3212 | cp_error ("conflicts with new declaration with %L linkage", |
8926095f MS |
3213 | DECL_LANGUAGE (newdecl)); |
3214 | } | |
3215 | } | |
e1cd6e56 | 3216 | |
a6f02587 | 3217 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl)) |
c32381b1 JM |
3218 | ; |
3219 | else if (TREE_CODE (olddecl) == FUNCTION_DECL) | |
e1cd6e56 MS |
3220 | { |
3221 | tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl)); | |
3222 | tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)); | |
3223 | int i = 1; | |
3224 | ||
3225 | if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE) | |
3226 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2); | |
3227 | ||
3228 | for (; t1 && t1 != void_list_node; | |
3229 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++) | |
3230 | if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2)) | |
3231 | { | |
2507f3b5 RK |
3232 | if (1 == simple_cst_equal (TREE_PURPOSE (t1), |
3233 | TREE_PURPOSE (t2))) | |
e1cd6e56 MS |
3234 | { |
3235 | if (pedantic) | |
3236 | { | |
8251199e | 3237 | cp_pedwarn ("default argument given for parameter %d of `%#D'", |
e1cd6e56 | 3238 | i, newdecl); |
8251199e | 3239 | cp_pedwarn_at ("after previous specification in `%#D'", |
e1cd6e56 MS |
3240 | olddecl); |
3241 | } | |
3242 | } | |
3243 | else | |
3244 | { | |
8251199e | 3245 | cp_error ("default argument given for parameter %d of `%#D'", |
e1cd6e56 | 3246 | i, newdecl); |
8251199e | 3247 | cp_error_at ("after previous specification in `%#D'", |
e1cd6e56 MS |
3248 | olddecl); |
3249 | } | |
3250 | } | |
a5894242 | 3251 | |
7fcdf4c2 MS |
3252 | if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl) |
3253 | && TREE_ADDRESSABLE (olddecl) && warn_inline) | |
dff6b454 | 3254 | { |
8251199e | 3255 | cp_warning ("`%#D' was used before it was declared inline", |
7fcdf4c2 | 3256 | newdecl); |
8251199e | 3257 | cp_warning_at ("previous non-inline declaration here", |
7fcdf4c2 | 3258 | olddecl); |
dff6b454 | 3259 | } |
e1cd6e56 | 3260 | } |
8d08fdba MS |
3261 | } |
3262 | ||
3263 | /* If new decl is `static' and an `extern' was seen previously, | |
3264 | warn about it. */ | |
3265 | warn_extern_redeclared_static (newdecl, olddecl); | |
3266 | ||
e92cc029 | 3267 | /* We have committed to returning 1 at this point. */ |
8d08fdba MS |
3268 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
3269 | { | |
3270 | /* Now that functions must hold information normally held | |
3271 | by field decls, there is extra work to do so that | |
3272 | declaration information does not get destroyed during | |
3273 | definition. */ | |
3274 | if (DECL_VINDEX (olddecl)) | |
3275 | DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl); | |
3276 | if (DECL_CONTEXT (olddecl)) | |
3277 | DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl); | |
3278 | if (DECL_CLASS_CONTEXT (olddecl)) | |
3279 | DECL_CLASS_CONTEXT (newdecl) = DECL_CLASS_CONTEXT (olddecl); | |
8d08fdba MS |
3280 | if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0) |
3281 | DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl); | |
e1cd6e56 MS |
3282 | DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl); |
3283 | DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl); | |
7215f9a0 | 3284 | DECL_ABSTRACT_VIRTUAL_P (newdecl) |= DECL_ABSTRACT_VIRTUAL_P (olddecl); |
864b83b9 | 3285 | DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl); |
4a67c9e9 | 3286 | DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl); |
0b60dfe3 BK |
3287 | new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE; |
3288 | ||
3289 | /* Optionally warn about more than one declaration for the same | |
3290 | name, but don't warn about a function declaration followed by a | |
3291 | definition. */ | |
3292 | if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl) | |
3293 | && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE) | |
3294 | /* Don't warn about extern decl followed by definition. */ | |
3295 | && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl)) | |
3296 | /* Don't warn about friends, let add_friend take care of it. */ | |
3297 | && ! DECL_FRIEND_P (newdecl)) | |
3298 | { | |
8251199e JM |
3299 | cp_warning ("redundant redeclaration of `%D' in same scope", newdecl); |
3300 | cp_warning_at ("previous declaration of `%D'", olddecl); | |
0b60dfe3 | 3301 | } |
8d08fdba MS |
3302 | } |
3303 | ||
3304 | /* Deal with C++: must preserve virtual function table size. */ | |
3305 | if (TREE_CODE (olddecl) == TYPE_DECL) | |
3306 | { | |
3307 | register tree newtype = TREE_TYPE (newdecl); | |
3308 | register tree oldtype = TREE_TYPE (olddecl); | |
3309 | ||
3310 | if (newtype != error_mark_node && oldtype != error_mark_node | |
3311 | && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype)) | |
3312 | { | |
3313 | CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype); | |
3314 | CLASSTYPE_FRIEND_CLASSES (newtype) | |
3315 | = CLASSTYPE_FRIEND_CLASSES (oldtype); | |
3316 | } | |
8d08fdba MS |
3317 | } |
3318 | ||
8d08fdba MS |
3319 | /* Copy all the DECL_... slots specified in the new decl |
3320 | except for any that we copy here from the old type. */ | |
0b60dfe3 BK |
3321 | DECL_MACHINE_ATTRIBUTES (newdecl) |
3322 | = merge_machine_decl_attributes (olddecl, newdecl); | |
8d08fdba | 3323 | |
5566b478 MS |
3324 | if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
3325 | { | |
4d85e00e MM |
3326 | if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl), |
3327 | DECL_TEMPLATE_RESULT (olddecl))) | |
8251199e | 3328 | cp_error ("invalid redeclaration of %D", newdecl); |
4d85e00e | 3329 | TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)); |
4d85e00e MM |
3330 | DECL_TEMPLATE_SPECIALIZATIONS (olddecl) |
3331 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl), | |
3332 | DECL_TEMPLATE_SPECIALIZATIONS (newdecl)); | |
0b60dfe3 | 3333 | |
5566b478 MS |
3334 | return 1; |
3335 | } | |
0b60dfe3 | 3336 | |
8d08fdba MS |
3337 | if (types_match) |
3338 | { | |
3339 | /* Automatically handles default parameters. */ | |
3340 | tree oldtype = TREE_TYPE (olddecl); | |
e1cd6e56 | 3341 | tree newtype; |
8d08fdba | 3342 | |
e1cd6e56 MS |
3343 | /* Make sure we put the new type in the same obstack as the old one. */ |
3344 | if (oldtype) | |
39211cd5 MS |
3345 | push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype)); |
3346 | else | |
9188c363 | 3347 | push_permanent_obstack (); |
39211cd5 | 3348 | |
e1cd6e56 MS |
3349 | /* Merge the data types specified in the two decls. */ |
3350 | newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl)); | |
3351 | ||
8d08fdba MS |
3352 | if (TREE_CODE (newdecl) == VAR_DECL) |
3353 | DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl); | |
3354 | /* Do this after calling `common_type' so that default | |
3355 | parameters don't confuse us. */ | |
3356 | else if (TREE_CODE (newdecl) == FUNCTION_DECL | |
3357 | && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)) | |
3358 | != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)))) | |
3359 | { | |
f30432d7 | 3360 | TREE_TYPE (newdecl) = build_exception_variant (newtype, |
8d08fdba | 3361 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))); |
f30432d7 | 3362 | TREE_TYPE (olddecl) = build_exception_variant (newtype, |
8d08fdba MS |
3363 | TYPE_RAISES_EXCEPTIONS (oldtype)); |
3364 | ||
9a224b4a JM |
3365 | if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl)) |
3366 | && DECL_SOURCE_LINE (olddecl) != 0 | |
da20811c | 3367 | && flag_exceptions |
4cc1d462 NS |
3368 | && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)), |
3369 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1)) | |
8d08fdba | 3370 | { |
4cc1d462 | 3371 | cp_error ("declaration of `%F' throws different exceptions", |
a28e3c7f | 3372 | newdecl); |
4cc1d462 | 3373 | cp_error_at ("to previous declaration `%F'", olddecl); |
8d08fdba MS |
3374 | } |
3375 | } | |
3376 | TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype; | |
3377 | ||
3378 | /* Lay the type out, unless already done. */ | |
407f03b8 | 3379 | if (! same_type_p (newtype, oldtype) |
5566b478 | 3380 | && TREE_TYPE (newdecl) != error_mark_node |
5156628f | 3381 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe MS |
3382 | layout_type (TREE_TYPE (newdecl)); |
3383 | ||
5566b478 MS |
3384 | if ((TREE_CODE (newdecl) == VAR_DECL |
3385 | || TREE_CODE (newdecl) == PARM_DECL | |
3386 | || TREE_CODE (newdecl) == RESULT_DECL | |
3387 | || TREE_CODE (newdecl) == FIELD_DECL | |
3388 | || TREE_CODE (newdecl) == TYPE_DECL) | |
5156628f | 3389 | && !(processing_template_decl && uses_template_parms (newdecl))) |
b7484fbe | 3390 | layout_decl (newdecl, 0); |
8d08fdba MS |
3391 | |
3392 | /* Merge the type qualifiers. */ | |
3393 | if (TREE_READONLY (newdecl)) | |
3394 | TREE_READONLY (olddecl) = 1; | |
3395 | if (TREE_THIS_VOLATILE (newdecl)) | |
3396 | TREE_THIS_VOLATILE (olddecl) = 1; | |
3397 | ||
3398 | /* Merge the initialization information. */ | |
8926095f MS |
3399 | if (DECL_INITIAL (newdecl) == NULL_TREE |
3400 | && DECL_INITIAL (olddecl) != NULL_TREE) | |
3401 | { | |
3402 | DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); | |
3403 | DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl); | |
3404 | DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl); | |
b0d06515 MM |
3405 | if (CAN_HAVE_FULL_LANG_DECL_P (newdecl) |
3406 | && DECL_LANG_SPECIFIC (newdecl) | |
4d85e00e MM |
3407 | && DECL_LANG_SPECIFIC (olddecl)) |
3408 | DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl); | |
8926095f | 3409 | } |
39211cd5 MS |
3410 | |
3411 | /* Merge the section attribute. | |
3412 | We want to issue an error if the sections conflict but that must be | |
3413 | done later in decl_attributes since we are called before attributes | |
3414 | are assigned. */ | |
3415 | if (DECL_SECTION_NAME (newdecl) == NULL_TREE) | |
3416 | DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl); | |
3417 | ||
5d73aa63 MM |
3418 | /* Keep the old rtl since we can safely use it. */ |
3419 | DECL_RTL (newdecl) = DECL_RTL (olddecl); | |
39211cd5 MS |
3420 | |
3421 | pop_obstacks (); | |
8d08fdba MS |
3422 | } |
3423 | /* If cannot merge, then use the new type and qualifiers, | |
3424 | and don't preserve the old rtl. */ | |
3425 | else | |
3426 | { | |
3427 | /* Clean out any memory we had of the old declaration. */ | |
3428 | tree oldstatic = value_member (olddecl, static_aggregates); | |
3429 | if (oldstatic) | |
3430 | TREE_VALUE (oldstatic) = error_mark_node; | |
3431 | ||
3432 | TREE_TYPE (olddecl) = TREE_TYPE (newdecl); | |
3433 | TREE_READONLY (olddecl) = TREE_READONLY (newdecl); | |
3434 | TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl); | |
3435 | TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl); | |
3436 | } | |
3437 | ||
3438 | /* Merge the storage class information. */ | |
a9aedbc2 | 3439 | DECL_WEAK (newdecl) |= DECL_WEAK (olddecl); |
e92cc029 | 3440 | DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl); |
a9aedbc2 MS |
3441 | TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl); |
3442 | TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl); | |
3443 | if (! DECL_EXTERNAL (olddecl)) | |
3444 | DECL_EXTERNAL (newdecl) = 0; | |
0b60dfe3 BK |
3445 | |
3446 | if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl)) | |
8d08fdba | 3447 | { |
a9aedbc2 MS |
3448 | DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl); |
3449 | DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl); | |
77be6f82 | 3450 | DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl); |
2b0a63a3 MM |
3451 | DECL_TEMPLATE_INSTANTIATED (newdecl) |
3452 | |= DECL_TEMPLATE_INSTANTIATED (olddecl); | |
0b60dfe3 BK |
3453 | /* Don't really know how much of the language-specific |
3454 | values we should copy from old to new. */ | |
3455 | DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl); | |
3456 | DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl); | |
3457 | DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl); | |
fbf1c34b | 3458 | DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl); |
0b60dfe3 | 3459 | olddecl_friend = DECL_FRIEND_P (olddecl); |
6a629cac MM |
3460 | |
3461 | /* Only functions have DECL_BEFRIENDING_CLASSES. */ | |
3462 | if (TREE_CODE (newdecl) == FUNCTION_DECL | |
3463 | || DECL_FUNCTION_TEMPLATE_P (newdecl)) | |
3464 | DECL_BEFRIENDING_CLASSES (newdecl) | |
3465 | = chainon (DECL_BEFRIENDING_CLASSES (newdecl), | |
3466 | DECL_BEFRIENDING_CLASSES (olddecl)); | |
8d08fdba MS |
3467 | } |
3468 | ||
8d08fdba MS |
3469 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
3470 | { | |
75650646 MM |
3471 | if (DECL_TEMPLATE_INSTANTIATION (olddecl) |
3472 | && !DECL_TEMPLATE_INSTANTIATION (newdecl)) | |
3473 | { | |
3474 | /* If newdecl is not a specialization, then it is not a | |
3475 | template-related function at all. And that means that we | |
3476 | shoud have exited above, returning 0. */ | |
3477 | my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl), | |
3478 | 0); | |
3479 | ||
3480 | if (TREE_USED (olddecl)) | |
3481 | /* From [temp.expl.spec]: | |
3482 | ||
3483 | If a template, a member template or the member of a class | |
3484 | template is explicitly specialized then that | |
3485 | specialization shall be declared before the first use of | |
3486 | that specialization that would cause an implicit | |
3487 | instantiation to take place, in every translation unit in | |
3488 | which such a use occurs. */ | |
8251199e | 3489 | cp_error ("explicit specialization of %D after first use", |
75650646 MM |
3490 | olddecl); |
3491 | ||
3492 | SET_DECL_TEMPLATE_SPECIALIZATION (olddecl); | |
3493 | } | |
faae18ab MS |
3494 | DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl); |
3495 | ||
3496 | /* If either decl says `inline', this fn is inline, unless its | |
3497 | definition was passed already. */ | |
3498 | if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE) | |
3499 | DECL_INLINE (olddecl) = 1; | |
3500 | DECL_INLINE (newdecl) = DECL_INLINE (olddecl); | |
3501 | ||
700f8a87 MS |
3502 | if (! types_match) |
3503 | { | |
3504 | DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl); | |
3505 | DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl); | |
5566b478 MS |
3506 | DECL_RTL (olddecl) = DECL_RTL (newdecl); |
3507 | } | |
3508 | if (! types_match || new_defines_function) | |
3509 | { | |
6f1b4c42 JM |
3510 | /* These need to be copied so that the names are available. |
3511 | Note that if the types do match, we'll preserve inline | |
3512 | info and other bits, but if not, we won't. */ | |
700f8a87 MS |
3513 | DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl); |
3514 | DECL_RESULT (olddecl) = DECL_RESULT (newdecl); | |
700f8a87 | 3515 | } |
8d08fdba MS |
3516 | if (new_defines_function) |
3517 | /* If defining a function declared with other language | |
3518 | linkage, use the previously declared language linkage. */ | |
3519 | DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl); | |
6f1b4c42 | 3520 | else if (types_match) |
8d08fdba MS |
3521 | { |
3522 | /* If redeclaring a builtin function, and not a definition, | |
3523 | it stays built in. */ | |
3524 | if (DECL_BUILT_IN (olddecl)) | |
3525 | { | |
3526 | DECL_BUILT_IN (newdecl) = 1; | |
39211cd5 | 3527 | DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl); |
8d08fdba MS |
3528 | /* If we're keeping the built-in definition, keep the rtl, |
3529 | regardless of declaration matches. */ | |
3530 | DECL_RTL (newdecl) = DECL_RTL (olddecl); | |
3531 | } | |
3532 | else | |
3533 | DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl); | |
3534 | ||
3535 | DECL_RESULT (newdecl) = DECL_RESULT (olddecl); | |
8926095f | 3536 | if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl))) |
8d08fdba MS |
3537 | /* Previously saved insns go together with |
3538 | the function's previous definition. */ | |
3539 | DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl); | |
3540 | /* Don't clear out the arguments if we're redefining a function. */ | |
3541 | if (DECL_ARGUMENTS (olddecl)) | |
3542 | DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl); | |
3543 | } | |
6060a796 MS |
3544 | if (DECL_LANG_SPECIFIC (olddecl)) |
3545 | DECL_MAIN_VARIANT (newdecl) = DECL_MAIN_VARIANT (olddecl); | |
8d08fdba MS |
3546 | } |
3547 | ||
a9aedbc2 MS |
3548 | if (TREE_CODE (newdecl) == NAMESPACE_DECL) |
3549 | { | |
3550 | NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl); | |
3551 | } | |
3552 | ||
8d08fdba MS |
3553 | /* Now preserve various other info from the definition. */ |
3554 | TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl); | |
3555 | TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl); | |
3556 | DECL_COMMON (newdecl) = DECL_COMMON (olddecl); | |
f376e137 | 3557 | DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl); |
8d08fdba | 3558 | |
8d08fdba MS |
3559 | if (TREE_CODE (newdecl) == FUNCTION_DECL) |
3560 | { | |
3561 | int function_size; | |
8d08fdba MS |
3562 | |
3563 | function_size = sizeof (struct tree_decl); | |
3564 | ||
3565 | bcopy ((char *) newdecl + sizeof (struct tree_common), | |
3566 | (char *) olddecl + sizeof (struct tree_common), | |
3567 | function_size - sizeof (struct tree_common)); | |
3568 | ||
75650646 MM |
3569 | if (DECL_TEMPLATE_INSTANTIATION (newdecl)) |
3570 | { | |
3571 | /* If newdecl is a template instantiation, it is possible that | |
3572 | the following sequence of events has occurred: | |
3573 | ||
3574 | o A friend function was declared in a class template. The | |
3575 | class template was instantiated. | |
3576 | ||
3577 | o The instantiation of the friend declaration was | |
3578 | recorded on the instantiation list, and is newdecl. | |
3579 | ||
3580 | o Later, however, instantiate_class_template called pushdecl | |
3581 | on the newdecl to perform name injection. But, pushdecl in | |
3582 | turn called duplicate_decls when it discovered that another | |
3583 | declaration of a global function with the same name already | |
3584 | existed. | |
3585 | ||
3586 | o Here, in duplicate_decls, we decided to clobber newdecl. | |
3587 | ||
3588 | If we're going to do that, we'd better make sure that | |
3589 | olddecl, and not newdecl, is on the list of | |
3590 | instantiations so that if we try to do the instantiation | |
3591 | again we won't get the clobbered declaration. */ | |
3592 | ||
3593 | tree tmpl = DECL_TI_TEMPLATE (newdecl); | |
3594 | tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
3595 | ||
3596 | for (; decls; decls = TREE_CHAIN (decls)) | |
3597 | if (TREE_VALUE (decls) == newdecl) | |
3598 | TREE_VALUE (decls) = olddecl; | |
3599 | } | |
8d08fdba MS |
3600 | } |
3601 | else | |
3602 | { | |
3603 | bcopy ((char *) newdecl + sizeof (struct tree_common), | |
3604 | (char *) olddecl + sizeof (struct tree_common), | |
3605 | sizeof (struct tree_decl) - sizeof (struct tree_common) | |
3606 | + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *)); | |
3607 | } | |
3608 | ||
3609 | DECL_UID (olddecl) = olddecl_uid; | |
3610 | if (olddecl_friend) | |
3611 | DECL_FRIEND_P (olddecl) = 1; | |
3612 | ||
d9525bec BK |
3613 | /* NEWDECL contains the merged attribute lists. |
3614 | Update OLDDECL to be the same. */ | |
3615 | DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl); | |
3616 | ||
8d08fdba MS |
3617 | return 1; |
3618 | } | |
3619 | ||
3620 | /* Record a decl-node X as belonging to the current lexical scope. | |
3621 | Check for errors (such as an incompatible declaration for the same | |
3622 | name already seen in the same scope). | |
3623 | ||
3624 | Returns either X or an old decl for the same name. | |
3625 | If an old decl is returned, it may have been smashed | |
3626 | to agree with what X says. */ | |
3627 | ||
3628 | tree | |
3629 | pushdecl (x) | |
3630 | tree x; | |
3631 | { | |
3632 | register tree t; | |
8d08fdba | 3633 | register tree name = DECL_ASSEMBLER_NAME (x); |
f181d4ae | 3634 | int need_new_binding = 1; |
8d08fdba | 3635 | |
50714e79 MM |
3636 | if (DECL_TEMPLATE_PARM_P (x)) |
3637 | /* Template parameters have no context; they are not X::T even | |
3638 | when declared within a class or namespace. */ | |
3639 | ; | |
3640 | else | |
3641 | { | |
3642 | if (current_function_decl && x != current_function_decl | |
3643 | /* A local declaration for a function doesn't constitute | |
3644 | nesting. */ | |
3645 | && (TREE_CODE (x) != FUNCTION_DECL || DECL_INITIAL (x)) | |
3646 | /* Don't change DECL_CONTEXT of virtual methods. */ | |
3647 | && (TREE_CODE (x) != FUNCTION_DECL || !DECL_VIRTUAL_P (x)) | |
3648 | && !DECL_CONTEXT (x)) | |
3649 | DECL_CONTEXT (x) = current_function_decl; | |
3650 | if (!DECL_CONTEXT (x)) | |
3651 | DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace); | |
3652 | } | |
8d08fdba | 3653 | |
8d08fdba | 3654 | /* Type are looked up using the DECL_NAME, as that is what the rest of the |
e92cc029 | 3655 | compiler wants to use. */ |
a9aedbc2 | 3656 | if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL |
0c20d3d6 | 3657 | || TREE_CODE (x) == NAMESPACE_DECL) |
8d08fdba | 3658 | name = DECL_NAME (x); |
8d08fdba MS |
3659 | |
3660 | if (name) | |
3661 | { | |
5566b478 MS |
3662 | #if 0 |
3663 | /* Not needed...see below. */ | |
8d08fdba MS |
3664 | char *file; |
3665 | int line; | |
5566b478 | 3666 | #endif |
386b8a85 JM |
3667 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) |
3668 | name = TREE_OPERAND (name, 0); | |
3669 | ||
2c73f9f5 | 3670 | /* Namespace-scoped variables are not found in the current level. */ |
6eb3bb27 | 3671 | if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x)) |
2c73f9f5 ML |
3672 | t = namespace_binding (name, DECL_CONTEXT (x)); |
3673 | else | |
3674 | t = lookup_name_current_level (name); | |
8d08fdba MS |
3675 | if (t == error_mark_node) |
3676 | { | |
3677 | /* error_mark_node is 0 for a while during initialization! */ | |
3678 | t = NULL_TREE; | |
8251199e | 3679 | cp_error_at ("`%#D' used prior to declaration", x); |
8d08fdba MS |
3680 | } |
3681 | ||
51c184be | 3682 | else if (t != NULL_TREE) |
8d08fdba | 3683 | { |
5566b478 MS |
3684 | #if 0 |
3685 | /* This is turned off until I have time to do it right (bpk). */ | |
e92cc029 | 3686 | /* With the code below that uses it... */ |
8d6e462b PB |
3687 | file = DECL_SOURCE_FILE (t); |
3688 | line = DECL_SOURCE_LINE (t); | |
5566b478 | 3689 | #endif |
2ee887f2 | 3690 | if (TREE_CODE (t) == PARM_DECL) |
8d08fdba MS |
3691 | { |
3692 | if (DECL_CONTEXT (t) == NULL_TREE) | |
3693 | fatal ("parse errors have confused me too much"); | |
be99da77 | 3694 | |
e92cc029 | 3695 | /* Check for duplicate params. */ |
be99da77 MS |
3696 | if (duplicate_decls (x, t)) |
3697 | return t; | |
8d08fdba | 3698 | } |
8d6e462b | 3699 | else if (((TREE_CODE (x) == FUNCTION_DECL && DECL_LANGUAGE (x) == lang_c) |
5566b478 MS |
3700 | || DECL_FUNCTION_TEMPLATE_P (x)) |
3701 | && is_overloaded_fn (t)) | |
2c73f9f5 | 3702 | /* Don't do anything just yet. */; |
e1cd6e56 MS |
3703 | else if (t == wchar_decl_node) |
3704 | { | |
3705 | if (pedantic && ! DECL_IN_SYSTEM_HEADER (x)) | |
8251199e | 3706 | cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x)); |
e1cd6e56 MS |
3707 | |
3708 | /* Throw away the redeclaration. */ | |
3709 | return t; | |
3710 | } | |
8926095f | 3711 | else if (TREE_CODE (t) != TREE_CODE (x)) |
8d08fdba | 3712 | { |
9ed182dc | 3713 | if (duplicate_decls (x, t)) |
51c184be | 3714 | return t; |
8d08fdba MS |
3715 | } |
3716 | else if (duplicate_decls (x, t)) | |
51c184be | 3717 | { |
8d08fdba | 3718 | #if 0 |
8926095f | 3719 | /* This is turned off until I have time to do it right (bpk). */ |
8d08fdba | 3720 | |
8926095f MS |
3721 | /* Also warn if they did a prototype with `static' on it, but |
3722 | then later left the `static' off. */ | |
3723 | if (! TREE_PUBLIC (name) && TREE_PUBLIC (x)) | |
8d08fdba | 3724 | { |
8926095f MS |
3725 | if (DECL_LANG_SPECIFIC (t) && DECL_FRIEND_P (t)) |
3726 | return t; | |
8d08fdba | 3727 | |
8926095f MS |
3728 | if (extra_warnings) |
3729 | { | |
8251199e | 3730 | cp_warning ("`static' missing from declaration of `%D'", |
a28e3c7f | 3731 | t); |
8926095f MS |
3732 | warning_with_file_and_line (file, line, |
3733 | "previous declaration of `%s'", | |
3734 | decl_as_string (t, 0)); | |
3735 | } | |
8d08fdba | 3736 | |
8926095f MS |
3737 | /* Now fix things so it'll do what they expect. */ |
3738 | if (current_function_decl) | |
3739 | TREE_PUBLIC (current_function_decl) = 0; | |
3740 | } | |
51c184be MS |
3741 | /* Due to interference in memory reclamation (X may be |
3742 | obstack-deallocated at this point), we must guard against | |
8926095f MS |
3743 | one really special case. [jason: This should be handled |
3744 | by start_function] */ | |
51c184be MS |
3745 | if (current_function_decl == x) |
3746 | current_function_decl = t; | |
8926095f | 3747 | #endif |
7177d104 MS |
3748 | if (TREE_CODE (t) == TYPE_DECL) |
3749 | SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t)); | |
f30432d7 MS |
3750 | else if (TREE_CODE (t) == FUNCTION_DECL) |
3751 | check_default_args (t); | |
7177d104 | 3752 | |
51c184be MS |
3753 | return t; |
3754 | } | |
35680744 MM |
3755 | else if (DECL_MAIN_P (x)) |
3756 | { | |
3757 | /* A redeclaration of main, but not a duplicate of the | |
3758 | previous one. | |
3759 | ||
3760 | [basic.start.main] | |
3761 | ||
3762 | This function shall not be overloaded. */ | |
8251199e JM |
3763 | cp_error_at ("invalid redeclaration of `%D'", t); |
3764 | cp_error ("as `%D'", x); | |
35680744 MM |
3765 | /* We don't try to push this declaration since that |
3766 | causes a crash. */ | |
3767 | return x; | |
3768 | } | |
8d08fdba | 3769 | } |
8926095f | 3770 | |
f3400fe2 JM |
3771 | check_template_shadow (x); |
3772 | ||
fcfcdfc8 JM |
3773 | /* If this is a function conjured up by the backend, massage it |
3774 | so it looks friendly. */ | |
3775 | if (TREE_CODE (x) == FUNCTION_DECL | |
3776 | && ! DECL_LANG_SPECIFIC (x)) | |
3777 | { | |
3778 | retrofit_lang_decl (x); | |
3779 | DECL_LANGUAGE (x) = lang_c; | |
3780 | } | |
3781 | ||
8926095f MS |
3782 | if (TREE_CODE (x) == FUNCTION_DECL && ! DECL_FUNCTION_MEMBER_P (x)) |
3783 | { | |
7bdbfa05 | 3784 | t = push_overloaded_decl (x, PUSH_LOCAL); |
8926095f MS |
3785 | if (t != x || DECL_LANGUAGE (x) == lang_c) |
3786 | return t; | |
f181d4ae MM |
3787 | if (!namespace_bindings_p ()) |
3788 | /* We do not need to create a binding for this name; | |
3789 | push_overloaded_decl will have already done so if | |
3790 | necessary. */ | |
3791 | need_new_binding = 0; | |
8926095f | 3792 | } |
6eb3bb27 | 3793 | else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x)) |
cfe507be MM |
3794 | { |
3795 | t = push_overloaded_decl (x, PUSH_GLOBAL); | |
3796 | if (t == x) | |
3797 | add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t))); | |
3798 | return t; | |
3799 | } | |
8d08fdba | 3800 | |
a1774733 BK |
3801 | /* If declaring a type as a typedef, copy the type (unless we're |
3802 | at line 0), and install this TYPE_DECL as the new type's typedef | |
3803 | name. See the extensive comment in ../c-decl.c (pushdecl). */ | |
8d08fdba MS |
3804 | if (TREE_CODE (x) == TYPE_DECL) |
3805 | { | |
3806 | tree type = TREE_TYPE (x); | |
a1774733 BK |
3807 | if (DECL_SOURCE_LINE (x) == 0) |
3808 | { | |
3809 | if (TYPE_NAME (type) == 0) | |
3810 | TYPE_NAME (type) = x; | |
3811 | } | |
1c80fb65 MM |
3812 | else if (type != error_mark_node && TYPE_NAME (type) != x |
3813 | /* We don't want to copy the type when all we're | |
3814 | doing is making a TYPE_DECL for the purposes of | |
3815 | inlining. */ | |
3816 | && (!TYPE_NAME (type) | |
3817 | || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x))) | |
a1774733 | 3818 | { |
ae0a6181 MM |
3819 | push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type)); |
3820 | ||
a1774733 BK |
3821 | DECL_ORIGINAL_TYPE (x) = type; |
3822 | type = build_type_copy (type); | |
3823 | TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x)); | |
3824 | TYPE_NAME (type) = x; | |
3825 | TREE_TYPE (x) = type; | |
ae0a6181 MM |
3826 | |
3827 | pop_obstacks (); | |
a1774733 | 3828 | } |
8d08fdba | 3829 | |
8d08fdba MS |
3830 | if (type != error_mark_node |
3831 | && TYPE_NAME (type) | |
3832 | && TYPE_IDENTIFIER (type)) | |
f181d4ae MM |
3833 | set_identifier_type_value_with_scope (DECL_NAME (x), type, |
3834 | current_binding_level); | |
3835 | ||
8d08fdba MS |
3836 | } |
3837 | ||
3838 | /* Multiple external decls of the same identifier ought to match. | |
3839 | ||
3840 | We get warnings about inline functions where they are defined. | |
39211cd5 MS |
3841 | We get warnings about other functions from push_overloaded_decl. |
3842 | ||
8d08fdba | 3843 | Avoid duplicate warnings where they are used. */ |
39211cd5 | 3844 | if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL) |
8d08fdba MS |
3845 | { |
3846 | tree decl; | |
3847 | ||
31928556 JM |
3848 | if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE |
3849 | && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name)) | |
3850 | || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name)))) | |
3851 | decl = IDENTIFIER_NAMESPACE_VALUE (name); | |
8d08fdba MS |
3852 | else |
3853 | decl = NULL_TREE; | |
3854 | ||
39211cd5 | 3855 | if (decl |
8d08fdba MS |
3856 | /* If different sort of thing, we already gave an error. */ |
3857 | && TREE_CODE (decl) == TREE_CODE (x) | |
3bfdc719 | 3858 | && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl))) |
8d08fdba | 3859 | { |
8251199e JM |
3860 | cp_pedwarn ("type mismatch with previous external decl", x); |
3861 | cp_pedwarn_at ("previous external decl of `%#D'", decl); | |
8d08fdba MS |
3862 | } |
3863 | } | |
3864 | ||
8d08fdba MS |
3865 | /* This name is new in its binding level. |
3866 | Install the new declaration and return it. */ | |
2c73f9f5 | 3867 | if (namespace_bindings_p ()) |
8d08fdba MS |
3868 | { |
3869 | /* Install a global value. */ | |
3870 | ||
8d08fdba MS |
3871 | /* If the first global decl has external linkage, |
3872 | warn if we later see static one. */ | |
31928556 | 3873 | if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x)) |
8d08fdba MS |
3874 | TREE_PUBLIC (name) = 1; |
3875 | ||
d8f8dca1 MM |
3876 | if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x) |
3877 | && t != NULL_TREE)) | |
30394414 JM |
3878 | { |
3879 | if (TREE_CODE (x) == FUNCTION_DECL) | |
31928556 JM |
3880 | my_friendly_assert |
3881 | ((IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE) | |
3882 | || (IDENTIFIER_GLOBAL_VALUE (name) == x), 378); | |
3883 | SET_IDENTIFIER_NAMESPACE_VALUE (name, x); | |
30394414 | 3884 | } |
8d08fdba MS |
3885 | |
3886 | /* Don't forget if the function was used via an implicit decl. */ | |
3887 | if (IDENTIFIER_IMPLICIT_DECL (name) | |
3888 | && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name))) | |
3889 | TREE_USED (x) = 1; | |
3890 | ||
3891 | /* Don't forget if its address was taken in that way. */ | |
3892 | if (IDENTIFIER_IMPLICIT_DECL (name) | |
3893 | && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name))) | |
3894 | TREE_ADDRESSABLE (x) = 1; | |
3895 | ||
3896 | /* Warn about mismatches against previous implicit decl. */ | |
3897 | if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE | |
3898 | /* If this real decl matches the implicit, don't complain. */ | |
3899 | && ! (TREE_CODE (x) == FUNCTION_DECL | |
3900 | && TREE_TYPE (TREE_TYPE (x)) == integer_type_node)) | |
8251199e JM |
3901 | cp_warning |
3902 | ("`%D' was previously implicitly declared to return `int'", x); | |
8d08fdba MS |
3903 | |
3904 | /* If new decl is `static' and an `extern' was seen previously, | |
3905 | warn about it. */ | |
a0a33927 MS |
3906 | if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t)) |
3907 | warn_extern_redeclared_static (x, t); | |
8d08fdba MS |
3908 | } |
3909 | else | |
3910 | { | |
3911 | /* Here to install a non-global value. */ | |
f181d4ae | 3912 | tree oldlocal = IDENTIFIER_VALUE (name); |
31928556 | 3913 | tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name); |
8d08fdba | 3914 | |
f181d4ae MM |
3915 | if (need_new_binding) |
3916 | { | |
0034cf72 | 3917 | push_local_binding (name, x, 0); |
f181d4ae MM |
3918 | /* Because push_local_binding will hook X on to the |
3919 | current_binding_level's name list, we don't want to | |
3920 | do that again below. */ | |
3921 | need_new_binding = 0; | |
3922 | } | |
8d08fdba MS |
3923 | |
3924 | /* If this is a TYPE_DECL, push it into the type value slot. */ | |
3925 | if (TREE_CODE (x) == TYPE_DECL) | |
f181d4ae MM |
3926 | set_identifier_type_value_with_scope (name, TREE_TYPE (x), |
3927 | current_binding_level); | |
8d08fdba | 3928 | |
a9aedbc2 MS |
3929 | /* Clear out any TYPE_DECL shadowed by a namespace so that |
3930 | we won't think this is a type. The C struct hack doesn't | |
3931 | go through namespaces. */ | |
3932 | if (TREE_CODE (x) == NAMESPACE_DECL) | |
f181d4ae MM |
3933 | set_identifier_type_value_with_scope (name, NULL_TREE, |
3934 | current_binding_level); | |
a9aedbc2 | 3935 | |
8d08fdba MS |
3936 | /* If this is an extern function declaration, see if we |
3937 | have a global definition or declaration for the function. */ | |
3938 | if (oldlocal == NULL_TREE | |
faae18ab | 3939 | && DECL_EXTERNAL (x) |
31928556 | 3940 | && oldglobal != NULL_TREE |
8d08fdba | 3941 | && TREE_CODE (x) == FUNCTION_DECL |
31928556 | 3942 | && TREE_CODE (oldglobal) == FUNCTION_DECL) |
8d08fdba MS |
3943 | { |
3944 | /* We have one. Their types must agree. */ | |
31928556 | 3945 | if (decls_match (x, oldglobal)) |
6060a796 MS |
3946 | /* OK */; |
3947 | else | |
8d08fdba | 3948 | { |
8251199e JM |
3949 | cp_warning ("extern declaration of `%#D' doesn't match", x); |
3950 | cp_warning_at ("global declaration `%#D'", oldglobal); | |
8d08fdba | 3951 | } |
8d08fdba MS |
3952 | } |
3953 | /* If we have a local external declaration, | |
3954 | and no file-scope declaration has yet been seen, | |
3955 | then if we later have a file-scope decl it must not be static. */ | |
3956 | if (oldlocal == NULL_TREE | |
31928556 | 3957 | && oldglobal == NULL_TREE |
8d08fdba MS |
3958 | && DECL_EXTERNAL (x) |
3959 | && TREE_PUBLIC (x)) | |
f181d4ae | 3960 | TREE_PUBLIC (name) = 1; |
8d08fdba MS |
3961 | |
3962 | if (DECL_FROM_INLINE (x)) | |
3963 | /* Inline decls shadow nothing. */; | |
3964 | ||
3965 | /* Warn if shadowing an argument at the top level of the body. */ | |
3966 | else if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x) | |
9d29e7af JM |
3967 | && TREE_CODE (oldlocal) == PARM_DECL |
3968 | /* Don't complain if it's from an enclosing function. */ | |
3969 | && DECL_CONTEXT (oldlocal) == current_function_decl | |
3970 | && TREE_CODE (x) != PARM_DECL) | |
8d08fdba MS |
3971 | { |
3972 | /* Go to where the parms should be and see if we | |
3973 | find them there. */ | |
3974 | struct binding_level *b = current_binding_level->level_chain; | |
3975 | ||
3976 | if (cleanup_label) | |
3977 | b = b->level_chain; | |
3978 | ||
3979 | /* ARM $8.3 */ | |
3980 | if (b->parm_flag == 1) | |
8251199e | 3981 | cp_error ("declaration of `%#D' shadows a parameter", name); |
8d08fdba | 3982 | } |
f181d4ae MM |
3983 | else if (warn_shadow && oldlocal != NULL_TREE |
3984 | && current_binding_level->is_for_scope | |
8d6e462b PB |
3985 | && !DECL_DEAD_FOR_LOCAL (oldlocal)) |
3986 | { | |
8251199e | 3987 | warning ("variable `%s' shadows local", |
8d6e462b | 3988 | IDENTIFIER_POINTER (name)); |
8251199e | 3989 | cp_warning_at (" this is the shadowed declaration", oldlocal); |
8d6e462b | 3990 | } |
8d08fdba MS |
3991 | /* Maybe warn if shadowing something else. */ |
3992 | else if (warn_shadow && !DECL_EXTERNAL (x) | |
3993 | /* No shadow warnings for internally generated vars. */ | |
700f8a87 | 3994 | && ! DECL_ARTIFICIAL (x) |
8d08fdba MS |
3995 | /* No shadow warnings for vars made for inlining. */ |
3996 | && ! DECL_FROM_INLINE (x)) | |
3997 | { | |
d8e178a0 | 3998 | const char *warnstring = NULL; |
8d08fdba MS |
3999 | |
4000 | if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL) | |
4001 | warnstring = "declaration of `%s' shadows a parameter"; | |
4002 | else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE | |
4ac14744 | 4003 | && current_class_ptr |
8d08fdba MS |
4004 | && !TREE_STATIC (name)) |
4005 | warnstring = "declaration of `%s' shadows a member of `this'"; | |
4006 | else if (oldlocal != NULL_TREE) | |
4007 | warnstring = "declaration of `%s' shadows previous local"; | |
31928556 | 4008 | else if (oldglobal != NULL_TREE) |
30394414 | 4009 | /* XXX shadow warnings in outer-more namespaces */ |
8d08fdba MS |
4010 | warnstring = "declaration of `%s' shadows global declaration"; |
4011 | ||
4012 | if (warnstring) | |
4013 | warning (warnstring, IDENTIFIER_POINTER (name)); | |
4014 | } | |
e1cd6e56 | 4015 | } |
8d08fdba | 4016 | |
e1cd6e56 | 4017 | if (TREE_CODE (x) == FUNCTION_DECL) |
f30432d7 | 4018 | check_default_args (x); |
8145f082 MS |
4019 | |
4020 | /* Keep count of variables in this level with incomplete type. */ | |
8145f082 | 4021 | if (TREE_CODE (x) == VAR_DECL |
28cbf42c | 4022 | && TREE_TYPE (x) != error_mark_node |
f30432d7 MS |
4023 | && ((TYPE_SIZE (TREE_TYPE (x)) == NULL_TREE |
4024 | && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE)) | |
4025 | /* RTTI TD entries are created while defining the type_info. */ | |
4026 | || (TYPE_LANG_SPECIFIC (TREE_TYPE (x)) | |
4027 | && TYPE_BEING_DEFINED (TREE_TYPE (x))))) | |
f181d4ae MM |
4028 | current_binding_level->incomplete |
4029 | = tree_cons (NULL_TREE, x, current_binding_level->incomplete); | |
8d08fdba MS |
4030 | } |
4031 | ||
f181d4ae | 4032 | if (need_new_binding) |
cfe507be | 4033 | add_decl_to_level (x, current_binding_level); |
8d08fdba MS |
4034 | |
4035 | return x; | |
4036 | } | |
4037 | ||
5566b478 MS |
4038 | /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the |
4039 | caller to set DECL_CONTEXT properly. */ | |
8d08fdba MS |
4040 | |
4041 | static tree | |
4042 | pushdecl_with_scope (x, level) | |
4043 | tree x; | |
4044 | struct binding_level *level; | |
4045 | { | |
8d019cef | 4046 | register struct binding_level *b; |
5566b478 | 4047 | tree function_decl = current_function_decl; |
8d08fdba | 4048 | |
5566b478 | 4049 | current_function_decl = NULL_TREE; |
8d019cef JM |
4050 | if (level->parm_flag == 2) |
4051 | { | |
4052 | b = class_binding_level; | |
4053 | class_binding_level = level; | |
4054 | pushdecl_class_level (x); | |
4055 | class_binding_level = b; | |
4056 | } | |
4057 | else | |
4058 | { | |
4059 | b = current_binding_level; | |
4060 | current_binding_level = level; | |
4061 | x = pushdecl (x); | |
4062 | current_binding_level = b; | |
4063 | } | |
5566b478 | 4064 | current_function_decl = function_decl; |
8d08fdba MS |
4065 | return x; |
4066 | } | |
4067 | ||
2c73f9f5 | 4068 | /* Like pushdecl, only it places X in the current namespace, |
8d08fdba | 4069 | if appropriate. */ |
e92cc029 | 4070 | |
8d08fdba | 4071 | tree |
2c73f9f5 | 4072 | pushdecl_namespace_level (x) |
8d08fdba MS |
4073 | tree x; |
4074 | { | |
8f032717 | 4075 | register struct binding_level *b = current_binding_level; |
2c73f9f5 ML |
4076 | register tree t; |
4077 | ||
4078 | t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace)); | |
8d08fdba MS |
4079 | |
4080 | /* Now, the type_shadowed stack may screw us. Munge it so it does | |
4081 | what we want. */ | |
4082 | if (TREE_CODE (x) == TYPE_DECL) | |
4083 | { | |
4084 | tree name = DECL_NAME (x); | |
4085 | tree newval; | |
4086 | tree *ptr = (tree *)0; | |
4087 | for (; b != global_binding_level; b = b->level_chain) | |
4088 | { | |
4089 | tree shadowed = b->type_shadowed; | |
4090 | for (; shadowed; shadowed = TREE_CHAIN (shadowed)) | |
4091 | if (TREE_PURPOSE (shadowed) == name) | |
4092 | { | |
4093 | ptr = &TREE_VALUE (shadowed); | |
4094 | /* Can't break out of the loop here because sometimes | |
4095 | a binding level will have duplicate bindings for | |
4096 | PT names. It's gross, but I haven't time to fix it. */ | |
4097 | } | |
4098 | } | |
4099 | newval = TREE_TYPE (x); | |
4100 | if (ptr == (tree *)0) | |
4101 | { | |
4102 | /* @@ This shouldn't be needed. My test case "zstring.cc" trips | |
4103 | up here if this is changed to an assertion. --KR */ | |
4104 | SET_IDENTIFIER_TYPE_VALUE (name, newval); | |
4105 | } | |
4106 | else | |
4107 | { | |
8d08fdba MS |
4108 | *ptr = newval; |
4109 | } | |
4110 | } | |
4111 | return t; | |
4112 | } | |
4113 | ||
2c73f9f5 ML |
4114 | /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL, |
4115 | if appropriate. */ | |
4116 | ||
4117 | tree | |
4118 | pushdecl_top_level (x) | |
4119 | tree x; | |
4120 | { | |
4121 | tree cur_namespace = current_namespace; | |
4122 | current_namespace = global_namespace; | |
4123 | x = pushdecl_namespace_level (x); | |
4124 | current_namespace = cur_namespace; | |
4125 | return x; | |
4126 | } | |
4127 | ||
8d08fdba | 4128 | /* Make the declaration of X appear in CLASS scope. */ |
e92cc029 | 4129 | |
61a127b3 | 4130 | void |
8d08fdba MS |
4131 | pushdecl_class_level (x) |
4132 | tree x; | |
4133 | { | |
4134 | /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class | |
4135 | scope looks for the pre-mangled name. */ | |
8f032717 MM |
4136 | register tree name; |
4137 | ||
4138 | if (TREE_CODE (x) == OVERLOAD) | |
4139 | x = OVL_CURRENT (x); | |
4140 | name = DECL_NAME (x); | |
8d08fdba MS |
4141 | |
4142 | if (name) | |
4143 | { | |
4144 | push_class_level_binding (name, x); | |
4145 | if (TREE_CODE (x) == TYPE_DECL) | |
f181d4ae | 4146 | set_identifier_type_value (name, TREE_TYPE (x)); |
8d08fdba | 4147 | } |
6bdb8141 | 4148 | else if (ANON_AGGR_TYPE_P (TREE_TYPE (x))) |
8f032717 MM |
4149 | { |
4150 | tree f; | |
4151 | ||
4152 | for (f = TYPE_FIELDS (TREE_TYPE (x)); | |
4153 | f; | |
4154 | f = TREE_CHAIN (f)) | |
4155 | pushdecl_class_level (f); | |
4156 | } | |
8d08fdba MS |
4157 | } |
4158 | ||
9188c363 MM |
4159 | /* Enter DECL into the symbol table, if that's appropriate. Returns |
4160 | DECL, or a modified version thereof. */ | |
4161 | ||
4162 | tree | |
4163 | maybe_push_decl (decl) | |
4164 | tree decl; | |
4165 | { | |
4166 | tree type = TREE_TYPE (decl); | |
4167 | ||
4168 | /* Add this decl to the current binding level, but not if it comes | |
4169 | from another scope, e.g. a static member variable. TEM may equal | |
4170 | DECL or it may be a previous decl of the same name. */ | |
4171 | if ((TREE_CODE (decl) != PARM_DECL | |
4172 | && DECL_CONTEXT (decl) != NULL_TREE | |
4173 | /* Definitions of namespace members outside their namespace are | |
4174 | possible. */ | |
4175 | && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
4176 | || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ()) | |
4177 | || TREE_CODE (type) == UNKNOWN_TYPE | |
558475f0 | 4178 | /* The declaration of a template specialization does not affect |
9188c363 MM |
4179 | the functions available for overload resolution, so we do not |
4180 | call pushdecl. */ | |
4181 | || (TREE_CODE (decl) == FUNCTION_DECL | |
4182 | && DECL_TEMPLATE_SPECIALIZATION (decl))) | |
4183 | return decl; | |
4184 | else | |
4185 | return pushdecl (decl); | |
4186 | } | |
4187 | ||
bd6dd845 | 4188 | #if 0 |
7177d104 MS |
4189 | /* This function is used to push the mangled decls for nested types into |
4190 | the appropriate scope. Previously pushdecl_top_level was used, but that | |
4191 | is incorrect for members of local classes. */ | |
e92cc029 | 4192 | |
5566b478 | 4193 | void |
7177d104 MS |
4194 | pushdecl_nonclass_level (x) |
4195 | tree x; | |
4196 | { | |
4197 | struct binding_level *b = current_binding_level; | |
4198 | ||
7177d104 | 4199 | my_friendly_assert (b->parm_flag != 2, 180); |
7177d104 | 4200 | |
5566b478 | 4201 | #if 0 |
7177d104 MS |
4202 | /* Get out of template binding levels */ |
4203 | while (b->pseudo_global) | |
4204 | b = b->level_chain; | |
5566b478 | 4205 | #endif |
7177d104 MS |
4206 | |
4207 | pushdecl_with_scope (x, b); | |
4208 | } | |
bd6dd845 | 4209 | #endif |
7177d104 | 4210 | |
8d08fdba MS |
4211 | /* Make the declaration(s) of X appear in CLASS scope |
4212 | under the name NAME. */ | |
e92cc029 | 4213 | |
8d08fdba MS |
4214 | void |
4215 | push_class_level_binding (name, x) | |
4216 | tree name; | |
4217 | tree x; | |
4218 | { | |
8f032717 | 4219 | tree binding; |
98c1c668 JM |
4220 | /* The class_binding_level will be NULL if x is a template |
4221 | parameter name in a member template. */ | |
4222 | if (!class_binding_level) | |
4223 | return; | |
4224 | ||
908c4e83 MM |
4225 | /* Make sure that this new member does not have the same name |
4226 | as a template parameter. */ | |
4227 | if (TYPE_BEING_DEFINED (current_class_type)) | |
4228 | check_template_shadow (x); | |
4229 | ||
f181d4ae MM |
4230 | /* If this declaration shadows a declaration from an enclosing |
4231 | class, then we will need to restore IDENTIFIER_CLASS_VALUE when | |
4232 | we leave this class. Record the shadowed declaration here. */ | |
8f032717 MM |
4233 | binding = IDENTIFIER_BINDING (name); |
4234 | if (binding | |
4235 | && ((TREE_CODE (x) == OVERLOAD | |
4236 | && BINDING_VALUE (binding) | |
4237 | && is_overloaded_fn (BINDING_VALUE (binding))) | |
4238 | || INHERITED_VALUE_BINDING_P (binding))) | |
4239 | { | |
4240 | tree shadow; | |
4241 | tree old_decl; | |
4242 | ||
4243 | /* If the old binding was from a base class, and was for a tag | |
4244 | name, slide it over to make room for the new binding. The | |
4245 | old binding is still visible if explicitly qualified with a | |
4246 | class-key. */ | |
4247 | if (INHERITED_VALUE_BINDING_P (binding) | |
4248 | && BINDING_VALUE (binding) | |
4249 | && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL | |
4250 | && DECL_ARTIFICIAL (BINDING_VALUE (binding)) | |
4251 | && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x))) | |
4252 | { | |
4253 | old_decl = BINDING_TYPE (binding); | |
4254 | BINDING_TYPE (binding) = BINDING_VALUE (binding); | |
4255 | BINDING_VALUE (binding) = NULL_TREE; | |
4256 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
4257 | } | |
4258 | else | |
4259 | old_decl = BINDING_VALUE (binding); | |
4260 | ||
4261 | /* There was already a binding for X containing fewer | |
4262 | functions than are named in X. Find the previous | |
4263 | declaration of X on the class-shadowed list, and update it. */ | |
4264 | for (shadow = class_binding_level->class_shadowed; | |
4265 | shadow; | |
4266 | shadow = TREE_CHAIN (shadow)) | |
4267 | if (TREE_PURPOSE (shadow) == name | |
4268 | && TREE_TYPE (shadow) == old_decl) | |
4269 | { | |
4270 | BINDING_VALUE (binding) = x; | |
4271 | INHERITED_VALUE_BINDING_P (binding) = 0; | |
4272 | TREE_TYPE (shadow) = x; | |
4273 | return; | |
4274 | } | |
4275 | } | |
f181d4ae | 4276 | |
8f032717 MM |
4277 | /* If we didn't replace an existing binding, put the binding on the |
4278 | stack of bindings for the identifier, and update | |
4279 | IDENTIFIER_CLASS_VALUE. */ | |
4280 | if (push_class_binding (name, x)) | |
4281 | { | |
3f1892e1 | 4282 | push_cache_obstack (); |
8f032717 MM |
4283 | class_binding_level->class_shadowed |
4284 | = tree_cons (name, IDENTIFIER_CLASS_VALUE (name), | |
4285 | class_binding_level->class_shadowed); | |
4286 | pop_obstacks (); | |
4287 | /* Record the value we are binding NAME to so that we can know | |
4288 | what to pop later. */ | |
4289 | TREE_TYPE (class_binding_level->class_shadowed) = x; | |
4290 | } | |
8d08fdba MS |
4291 | } |
4292 | ||
2c73f9f5 ML |
4293 | /* Insert another USING_DECL into the current binding level, |
4294 | returning this declaration. If this is a redeclaration, | |
4295 | do nothing and return NULL_TREE. */ | |
e92cc029 | 4296 | |
2c73f9f5 ML |
4297 | tree |
4298 | push_using_decl (scope, name) | |
4299 | tree scope; | |
4300 | tree name; | |
8d08fdba | 4301 | { |
2c73f9f5 ML |
4302 | tree decl; |
4303 | ||
2c73f9f5 ML |
4304 | my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383); |
4305 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384); | |
4306 | for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl)) | |
4307 | if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name) | |
4308 | break; | |
4309 | if (decl) | |
4310 | return NULL_TREE; | |
4ce3d537 | 4311 | decl = build_lang_decl (USING_DECL, name, void_type_node); |
2c73f9f5 ML |
4312 | DECL_INITIAL (decl) = scope; |
4313 | TREE_CHAIN (decl) = current_binding_level->usings; | |
4314 | current_binding_level->usings = decl; | |
4315 | return decl; | |
8d08fdba MS |
4316 | } |
4317 | ||
ea9635c7 ML |
4318 | /* Add namespace to using_directives. Return NULL_TREE if nothing was |
4319 | changed (i.e. there was already a directive), or the fresh | |
4320 | TREE_LIST otherwise. */ | |
4321 | ||
4322 | tree | |
9ed182dc | 4323 | push_using_directive (used) |
ea9635c7 | 4324 | tree used; |
ea9635c7 ML |
4325 | { |
4326 | tree ud = current_binding_level->using_directives; | |
9ed182dc | 4327 | tree iter, ancestor; |
ea9635c7 ML |
4328 | |
4329 | /* Check if we already have this. */ | |
4330 | if (purpose_member (used, ud) != NULL_TREE) | |
4331 | return NULL_TREE; | |
00dc6358 JM |
4332 | |
4333 | /* Recursively add all namespaces used. */ | |
4334 | for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter)) | |
9ed182dc | 4335 | push_using_directive (TREE_PURPOSE (iter)); |
00dc6358 | 4336 | |
9ed182dc | 4337 | ancestor = namespace_ancestor (current_decl_namespace (), used); |
00dc6358 | 4338 | ud = current_binding_level->using_directives; |
e1b3e07d | 4339 | ud = tree_cons (used, ancestor, ud); |
ea9635c7 ML |
4340 | current_binding_level->using_directives = ud; |
4341 | return ud; | |
4342 | } | |
4343 | ||
f181d4ae MM |
4344 | /* DECL is a FUNCTION_DECL for a non-member function, which may have |
4345 | other definitions already in place. We get around this by making | |
4346 | the value of the identifier point to a list of all the things that | |
4347 | want to be referenced by that name. It is then up to the users of | |
4348 | that name to decide what to do with that list. | |
8d08fdba MS |
4349 | |
4350 | DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT | |
4351 | slot. It is dealt with the same way. | |
4352 | ||
7bdbfa05 MM |
4353 | FLAGS is a bitwise-or of the following values: |
4354 | PUSH_LOCAL: Bind DECL in the current scope, rather than at | |
4355 | namespace scope. | |
4356 | PUSH_USING: DECL is being pushed as the result of a using | |
4357 | declaration. | |
4358 | ||
8d08fdba MS |
4359 | The value returned may be a previous declaration if we guessed wrong |
4360 | about what language DECL should belong to (C or C++). Otherwise, | |
4361 | it's always DECL (and never something that's not a _DECL). */ | |
e92cc029 | 4362 | |
7bdbfa05 MM |
4363 | tree |
4364 | push_overloaded_decl (decl, flags) | |
8d08fdba | 4365 | tree decl; |
7bdbfa05 | 4366 | int flags; |
8d08fdba | 4367 | { |
f181d4ae | 4368 | tree name = DECL_NAME (decl); |
700f8a87 | 4369 | tree old; |
f181d4ae | 4370 | tree new_binding; |
7bdbfa05 | 4371 | int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL)); |
700f8a87 MS |
4372 | |
4373 | if (doing_global) | |
9f33663b | 4374 | old = namespace_binding (name, DECL_CONTEXT (decl)); |
700f8a87 | 4375 | else |
f181d4ae | 4376 | old = lookup_name_current_level (name); |
8d08fdba | 4377 | |
700f8a87 | 4378 | if (old) |
8d08fdba | 4379 | { |
e1cd6e56 | 4380 | if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old)) |
8926095f | 4381 | { |
700f8a87 | 4382 | tree t = TREE_TYPE (old); |
cdf5b885 MS |
4383 | if (IS_AGGR_TYPE (t) && warn_shadow |
4384 | && (! DECL_IN_SYSTEM_HEADER (decl) | |
4385 | || ! DECL_IN_SYSTEM_HEADER (old))) | |
8251199e | 4386 | cp_warning ("`%#D' hides constructor for `%#T'", decl, t); |
5b605f68 | 4387 | old = NULL_TREE; |
8926095f | 4388 | } |
700f8a87 | 4389 | else if (is_overloaded_fn (old)) |
8d08fdba | 4390 | { |
8d08fdba MS |
4391 | tree tmp; |
4392 | ||
2c73f9f5 | 4393 | for (tmp = old; tmp; tmp = OVL_NEXT (tmp)) |
7bdbfa05 MM |
4394 | { |
4395 | tree fn = OVL_CURRENT (tmp); | |
4396 | ||
4397 | if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp) | |
4398 | && !(flags & PUSH_USING) | |
4399 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
4400 | TYPE_ARG_TYPES (TREE_TYPE (decl)))) | |
4401 | cp_error ("`%#D' conflicts with previous using declaration `%#D'", | |
4402 | decl, fn); | |
4403 | ||
4404 | if (duplicate_decls (decl, fn)) | |
4405 | return fn; | |
4406 | } | |
8d08fdba | 4407 | } |
e1cd6e56 MS |
4408 | else |
4409 | { | |
8251199e JM |
4410 | cp_error_at ("previous non-function declaration `%#D'", old); |
4411 | cp_error ("conflicts with function declaration `%#D'", decl); | |
a9aedbc2 | 4412 | return decl; |
e1cd6e56 | 4413 | } |
8d08fdba | 4414 | } |
7177d104 | 4415 | |
700f8a87 | 4416 | if (old || TREE_CODE (decl) == TEMPLATE_DECL) |
8d08fdba | 4417 | { |
2c73f9f5 | 4418 | if (old && TREE_CODE (old) != OVERLOAD) |
f181d4ae MM |
4419 | new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE)); |
4420 | else | |
4421 | new_binding = ovl_cons (decl, old); | |
347d73d7 ML |
4422 | if (flags & PUSH_USING) |
4423 | OVL_USED (new_binding) = 1; | |
8d08fdba MS |
4424 | } |
4425 | else | |
f181d4ae MM |
4426 | /* NAME is not ambiguous. */ |
4427 | new_binding = decl; | |
700f8a87 MS |
4428 | |
4429 | if (doing_global) | |
f181d4ae | 4430 | set_namespace_binding (name, current_namespace, new_binding); |
700f8a87 | 4431 | else |
f181d4ae MM |
4432 | { |
4433 | /* We only create an OVERLOAD if there was a previous binding at | |
0580c9aa ML |
4434 | this level, or if decl is a template. In the former case, we |
4435 | need to remove the old binding and replace it with the new | |
4436 | binding. We must also run through the NAMES on the binding | |
4437 | level where the name was bound to update the chain. */ | |
4438 | ||
4439 | if (TREE_CODE (new_binding) == OVERLOAD && old) | |
f181d4ae MM |
4440 | { |
4441 | tree *d; | |
4442 | ||
4443 | for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names; | |
4444 | *d; | |
4445 | d = &TREE_CHAIN (*d)) | |
4446 | if (*d == old | |
4447 | || (TREE_CODE (*d) == TREE_LIST | |
4448 | && TREE_VALUE (*d) == old)) | |
4449 | { | |
d8f8dca1 MM |
4450 | if (TREE_CODE (*d) == TREE_LIST) |
4451 | /* Just replace the old binding with the new. */ | |
4452 | TREE_VALUE (*d) = new_binding; | |
4453 | else | |
4454 | /* Build a TREE_LIST to wrap the OVERLOAD. */ | |
ed5511d9 MM |
4455 | *d = tree_cons (NULL_TREE, new_binding, |
4456 | TREE_CHAIN (*d)); | |
d8f8dca1 MM |
4457 | |
4458 | /* And update the CPLUS_BINDING node. */ | |
4459 | BINDING_VALUE (IDENTIFIER_BINDING (name)) | |
4460 | = new_binding; | |
4461 | return decl; | |
f181d4ae MM |
4462 | } |
4463 | ||
d8f8dca1 MM |
4464 | /* We should always find a previous binding in this case. */ |
4465 | my_friendly_abort (0); | |
f181d4ae MM |
4466 | } |
4467 | ||
4468 | /* Install the new binding. */ | |
0034cf72 | 4469 | push_local_binding (name, new_binding, flags); |
f181d4ae | 4470 | } |
700f8a87 | 4471 | |
8d08fdba MS |
4472 | return decl; |
4473 | } | |
4474 | \f | |
4475 | /* Generate an implicit declaration for identifier FUNCTIONID | |
4476 | as a function of type int (). Print a warning if appropriate. */ | |
4477 | ||
4478 | tree | |
4479 | implicitly_declare (functionid) | |
4480 | tree functionid; | |
4481 | { | |
4482 | register tree decl; | |
4483 | int temp = allocation_temporary_p (); | |
4484 | ||
4485 | push_obstacks_nochange (); | |
4486 | ||
4487 | /* Save the decl permanently so we can warn if definition follows. | |
4488 | In ANSI C, warn_implicit is usually false, so the saves little space. | |
4489 | But in C++, it's usually true, hence the extra code. */ | |
d22c8596 | 4490 | if (temp && (! warn_implicit || toplevel_bindings_p ())) |
8d08fdba MS |
4491 | end_temporary_allocation (); |
4492 | ||
4493 | /* We used to reuse an old implicit decl here, | |
4494 | but this loses with inline functions because it can clobber | |
4495 | the saved decl chains. */ | |
4496 | decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type); | |
4497 | ||
4498 | DECL_EXTERNAL (decl) = 1; | |
4499 | TREE_PUBLIC (decl) = 1; | |
4500 | ||
4501 | /* ANSI standard says implicit declarations are in the innermost block. | |
d22c8596 | 4502 | So we record the decl in the standard fashion. */ |
8d08fdba MS |
4503 | pushdecl (decl); |
4504 | rest_of_decl_compilation (decl, NULL_PTR, 0, 0); | |
4505 | ||
4506 | if (warn_implicit | |
4507 | /* Only one warning per identifier. */ | |
4508 | && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE) | |
4509 | { | |
8251199e | 4510 | cp_pedwarn ("implicit declaration of function `%#D'", decl); |
8d08fdba MS |
4511 | } |
4512 | ||
4513 | SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl); | |
4514 | ||
4515 | pop_obstacks (); | |
4516 | ||
4517 | return decl; | |
4518 | } | |
4519 | ||
8251199e | 4520 | /* Return zero if the declaration NEWDECL is valid |
8d08fdba MS |
4521 | when the declaration OLDDECL (assumed to be for the same name) |
4522 | has already been seen. | |
4523 | Otherwise return an error message format string with a %s | |
4524 | where the identifier should go. */ | |
4525 | ||
d8e178a0 | 4526 | static const char * |
8d08fdba MS |
4527 | redeclaration_error_message (newdecl, olddecl) |
4528 | tree newdecl, olddecl; | |
4529 | { | |
4530 | if (TREE_CODE (newdecl) == TYPE_DECL) | |
4531 | { | |
4532 | /* Because C++ can put things into name space for free, | |
4533 | constructs like "typedef struct foo { ... } foo" | |
4534 | would look like an erroneous redeclaration. */ | |
3bfdc719 | 4535 | if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl))) |
8251199e | 4536 | return 0; |
8d08fdba | 4537 | else |
8251199e | 4538 | return "redefinition of `%#D'"; |
8d08fdba MS |
4539 | } |
4540 | else if (TREE_CODE (newdecl) == FUNCTION_DECL) | |
4541 | { | |
4542 | /* If this is a pure function, its olddecl will actually be | |
4543 | the original initialization to `0' (which we force to call | |
4544 | abort()). Don't complain about redefinition in this case. */ | |
4545 | if (DECL_LANG_SPECIFIC (olddecl) && DECL_ABSTRACT_VIRTUAL_P (olddecl)) | |
8251199e | 4546 | return 0; |
8d08fdba | 4547 | |
2c73f9f5 ML |
4548 | /* If both functions come from different namespaces, this is not |
4549 | a redeclaration - this is a conflict with a used function. */ | |
6eb3bb27 | 4550 | if (DECL_NAMESPACE_SCOPE_P (olddecl) |
2c73f9f5 | 4551 | && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl)) |
8251199e | 4552 | return "`%D' conflicts with used function"; |
2c73f9f5 | 4553 | |
db5ae43f MS |
4554 | /* We'll complain about linkage mismatches in |
4555 | warn_extern_redeclared_static. */ | |
4556 | ||
2c73f9f5 | 4557 | /* Defining the same name twice is no good. */ |
8d08fdba | 4558 | if (DECL_INITIAL (olddecl) != NULL_TREE |
faae18ab | 4559 | && DECL_INITIAL (newdecl) != NULL_TREE) |
8d08fdba MS |
4560 | { |
4561 | if (DECL_NAME (olddecl) == NULL_TREE) | |
8251199e | 4562 | return "`%#D' not declared in class"; |
8d08fdba | 4563 | else |
8251199e | 4564 | return "redefinition of `%#D'"; |
8d08fdba | 4565 | } |
8251199e | 4566 | return 0; |
8d08fdba | 4567 | } |
51c184be MS |
4568 | else if (TREE_CODE (newdecl) == TEMPLATE_DECL) |
4569 | { | |
ec255269 MS |
4570 | if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL |
4571 | && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) | |
4572 | && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl))) | |
4573 | || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL | |
4574 | && TYPE_SIZE (TREE_TYPE (newdecl)) | |
4575 | && TYPE_SIZE (TREE_TYPE (olddecl)))) | |
8251199e JM |
4576 | return "redefinition of `%#D'"; |
4577 | return 0; | |
51c184be | 4578 | } |
5566b478 | 4579 | else if (toplevel_bindings_p ()) |
8d08fdba MS |
4580 | { |
4581 | /* Objects declared at top level: */ | |
4582 | /* If at least one is a reference, it's ok. */ | |
4583 | if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl)) | |
8251199e | 4584 | return 0; |
8926095f | 4585 | /* Reject two definitions. */ |
8251199e | 4586 | return "redefinition of `%#D'"; |
8d08fdba MS |
4587 | } |
4588 | else | |
4589 | { | |
4590 | /* Objects declared with block scope: */ | |
4591 | /* Reject two definitions, and reject a definition | |
4592 | together with an external reference. */ | |
4593 | if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl))) | |
8251199e JM |
4594 | return "redeclaration of `%#D'"; |
4595 | return 0; | |
8d08fdba MS |
4596 | } |
4597 | } | |
4598 | \f | |
acef433b | 4599 | /* Create a new label, named ID. */ |
8d08fdba | 4600 | |
acef433b MM |
4601 | static tree |
4602 | make_label_decl (id, local_p) | |
8d08fdba | 4603 | tree id; |
acef433b | 4604 | int local_p; |
8d08fdba | 4605 | { |
acef433b | 4606 | tree decl; |
8d08fdba | 4607 | |
acef433b MM |
4608 | if (building_stmt_tree ()) |
4609 | push_permanent_obstack (); | |
4610 | decl = build_decl (LABEL_DECL, id, void_type_node); | |
4611 | if (building_stmt_tree ()) | |
4612 | pop_obstacks (); | |
4613 | else | |
4614 | /* Make sure every label has an rtx. */ | |
4615 | label_rtx (decl); | |
4616 | ||
4617 | DECL_CONTEXT (decl) = current_function_decl; | |
4618 | DECL_MODE (decl) = VOIDmode; | |
4619 | C_DECLARED_LABEL_FLAG (decl) = local_p; | |
8d08fdba | 4620 | |
acef433b MM |
4621 | /* Say where one reference is to the label, for the sake of the |
4622 | error if it is not defined. */ | |
4623 | DECL_SOURCE_LINE (decl) = lineno; | |
4624 | DECL_SOURCE_FILE (decl) = input_filename; | |
4625 | ||
4626 | /* Record the fact that this identifier is bound to this label. */ | |
4627 | SET_IDENTIFIER_LABEL_VALUE (id, decl); | |
4628 | ||
4629 | /* Record this label on the list of used labels so that we can check | |
4630 | at the end of the function to see whether or not the label was | |
4631 | actually defined. */ | |
4632 | if ((named_label_uses == NULL || named_label_uses->label_decl != decl) | |
e349ee73 MS |
4633 | && (named_label_uses == NULL |
4634 | || named_label_uses->names_in_scope != current_binding_level->names | |
4635 | || named_label_uses->label_decl != decl)) | |
4636 | { | |
4637 | struct named_label_list *new_ent; | |
4638 | new_ent | |
4639 | = (struct named_label_list*)oballoc (sizeof (struct named_label_list)); | |
4640 | new_ent->label_decl = decl; | |
4641 | new_ent->names_in_scope = current_binding_level->names; | |
4642 | new_ent->binding_level = current_binding_level; | |
4643 | new_ent->lineno_o_goto = lineno; | |
4644 | new_ent->filename_o_goto = input_filename; | |
4645 | new_ent->next = named_label_uses; | |
4646 | named_label_uses = new_ent; | |
8d08fdba MS |
4647 | } |
4648 | ||
acef433b MM |
4649 | return decl; |
4650 | } | |
8d08fdba | 4651 | |
acef433b MM |
4652 | /* Look for a label named ID in the current function. If one cannot |
4653 | be found, create one. (We keep track of used, but undefined, | |
4654 | labels, and complain about them at the end of a function.) */ | |
8d08fdba | 4655 | |
acef433b MM |
4656 | tree |
4657 | lookup_label (id) | |
4658 | tree id; | |
4659 | { | |
4660 | tree decl; | |
8d08fdba | 4661 | |
acef433b MM |
4662 | /* You can't use labels at global scope. */ |
4663 | if (current_function_decl == NULL_TREE) | |
4664 | { | |
4665 | error ("label `%s' referenced outside of any function", | |
4666 | IDENTIFIER_POINTER (id)); | |
4667 | return NULL_TREE; | |
4668 | } | |
4669 | ||
4670 | /* See if we've already got this label. */ | |
4671 | decl = IDENTIFIER_LABEL_VALUE (id); | |
4672 | if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl) | |
4673 | return decl; | |
8d08fdba | 4674 | |
acef433b MM |
4675 | /* Record this label on the list of labels used in this function. |
4676 | We do this before calling make_label_decl so that we get the | |
4677 | IDENTIFIER_LABEL_VALUE before the new label is declared. */ | |
4678 | named_labels = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, | |
4679 | named_labels); | |
4680 | /* We need a new label. */ | |
4681 | decl = make_label_decl (id, /*local_p=*/0); | |
4682 | /* Now fill in the information we didn't have before. */ | |
4683 | TREE_VALUE (named_labels) = decl; | |
8d08fdba MS |
4684 | |
4685 | return decl; | |
4686 | } | |
4687 | ||
acef433b | 4688 | /* Declare a local label named ID. */ |
8d08fdba MS |
4689 | |
4690 | tree | |
acef433b MM |
4691 | declare_local_label (id) |
4692 | tree id; | |
8d08fdba | 4693 | { |
acef433b | 4694 | tree decl; |
8d08fdba | 4695 | |
acef433b MM |
4696 | /* Add a new entry to the SHADOWED_LABELS list so that when we leave |
4697 | this scope we can restore the old value of | |
4698 | IDENTIFIER_TYPE_VALUE. */ | |
4699 | current_binding_level->shadowed_labels | |
4700 | = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE, | |
4701 | current_binding_level->shadowed_labels); | |
4702 | /* Look for the label. */ | |
4703 | decl = make_label_decl (id, /*local_p=*/1); | |
4704 | /* Now fill in the information we didn't have before. */ | |
4705 | TREE_VALUE (current_binding_level->shadowed_labels) = decl; | |
4706 | ||
4707 | return decl; | |
8d08fdba MS |
4708 | } |
4709 | ||
4710 | /* Define a label, specifying the location in the source file. | |
4711 | Return the LABEL_DECL node for the label, if the definition is valid. | |
4712 | Otherwise return 0. */ | |
4713 | ||
4714 | tree | |
4715 | define_label (filename, line, name) | |
4716 | char *filename; | |
4717 | int line; | |
4718 | tree name; | |
4719 | { | |
f01b0acb | 4720 | tree decl = lookup_label (name); |
8d08fdba MS |
4721 | |
4722 | /* After labels, make any new cleanups go into their | |
4723 | own new (temporary) binding contour. */ | |
4724 | current_binding_level->more_cleanups_ok = 0; | |
4725 | ||
e1cd6e56 | 4726 | if (name == get_identifier ("wchar_t")) |
8251199e | 4727 | cp_pedwarn ("label named wchar_t"); |
e1cd6e56 | 4728 | |
8d08fdba MS |
4729 | if (DECL_INITIAL (decl) != NULL_TREE) |
4730 | { | |
8251199e | 4731 | cp_error ("duplicate label `%D'", decl); |
8d08fdba MS |
4732 | return 0; |
4733 | } | |
4734 | else | |
4735 | { | |
e349ee73 | 4736 | struct named_label_list *uses, *prev; |
28cbf42c | 4737 | int identified = 0; |
227cf171 | 4738 | int saw_eh = 0; |
8d08fdba MS |
4739 | |
4740 | /* Mark label as having been defined. */ | |
4741 | DECL_INITIAL (decl) = error_mark_node; | |
4742 | /* Say where in the source. */ | |
4743 | DECL_SOURCE_FILE (decl) = filename; | |
4744 | DECL_SOURCE_LINE (decl) = line; | |
4745 | ||
e349ee73 MS |
4746 | prev = NULL; |
4747 | uses = named_label_uses; | |
4748 | while (uses != NULL) | |
4749 | if (uses->label_decl == decl) | |
8d08fdba MS |
4750 | { |
4751 | struct binding_level *b = current_binding_level; | |
4752 | while (b) | |
4753 | { | |
4754 | tree new_decls = b->names; | |
e349ee73 MS |
4755 | tree old_decls = (b == uses->binding_level) |
4756 | ? uses->names_in_scope : NULL_TREE; | |
8d08fdba MS |
4757 | while (new_decls != old_decls) |
4758 | { | |
4759 | if (TREE_CODE (new_decls) == VAR_DECL | |
4760 | /* Don't complain about crossing initialization | |
4761 | of internal entities. They can't be accessed, | |
4762 | and they should be cleaned up | |
4763 | by the time we get to the label. */ | |
700f8a87 | 4764 | && ! DECL_ARTIFICIAL (new_decls) |
5524676d JM |
4765 | && !(DECL_INITIAL (new_decls) == NULL_TREE |
4766 | && pod_type_p (TREE_TYPE (new_decls)))) | |
8d08fdba | 4767 | { |
b607c87f JM |
4768 | /* This is really only important if we're crossing |
4769 | an initialization. The POD stuff is just | |
4770 | pedantry; why should it matter if the class | |
4771 | contains a field of pointer to member type? */ | |
4772 | int problem = (DECL_INITIAL (new_decls) | |
4773 | || (TYPE_NEEDS_CONSTRUCTING | |
4774 | (TREE_TYPE (new_decls)))); | |
4775 | ||
4776 | if (! identified) | |
e349ee73 | 4777 | { |
b607c87f JM |
4778 | if (problem) |
4779 | { | |
4780 | cp_error ("jump to label `%D'", decl); | |
4781 | error_with_file_and_line | |
4782 | (uses->filename_o_goto, | |
4783 | uses->lineno_o_goto, " from here"); | |
4784 | } | |
4785 | else | |
4786 | { | |
4787 | cp_pedwarn ("jump to label `%D'", decl); | |
4788 | pedwarn_with_file_and_line | |
4789 | (uses->filename_o_goto, | |
4790 | uses->lineno_o_goto, " from here"); | |
4791 | } | |
e349ee73 | 4792 | identified = 1; |
227cf171 | 4793 | } |
b607c87f JM |
4794 | |
4795 | if (problem) | |
5524676d JM |
4796 | cp_error_at (" crosses initialization of `%#D'", |
4797 | new_decls); | |
4798 | else | |
b607c87f | 4799 | cp_pedwarn_at (" enters scope of non-POD `%#D'", |
5524676d | 4800 | new_decls); |
8d08fdba MS |
4801 | } |
4802 | new_decls = TREE_CHAIN (new_decls); | |
4803 | } | |
e349ee73 | 4804 | if (b == uses->binding_level) |
8d08fdba | 4805 | break; |
227cf171 JM |
4806 | if (b->eh_region && ! saw_eh) |
4807 | { | |
4808 | if (! identified) | |
4809 | { | |
4810 | cp_error ("jump to label `%D'", decl); | |
4811 | error_with_file_and_line | |
4812 | (uses->filename_o_goto, | |
4813 | uses->lineno_o_goto, " from here"); | |
4814 | identified = 1; | |
4815 | } | |
4816 | error (" enters exception handling block"); | |
4817 | saw_eh = 1; | |
4818 | } | |
8d08fdba MS |
4819 | b = b->level_chain; |
4820 | } | |
4821 | ||
e349ee73 MS |
4822 | if (prev != NULL) |
4823 | prev->next = uses->next; | |
8d08fdba | 4824 | else |
e349ee73 MS |
4825 | named_label_uses = uses->next; |
4826 | ||
4827 | uses = uses->next; | |
4828 | } | |
4829 | else | |
4830 | { | |
4831 | prev = uses; | |
4832 | uses = uses->next; | |
8d08fdba MS |
4833 | } |
4834 | current_function_return_value = NULL_TREE; | |
4835 | return decl; | |
4836 | } | |
4837 | } | |
4838 | ||
a5894242 MS |
4839 | struct cp_switch |
4840 | { | |
4841 | struct binding_level *level; | |
4842 | struct cp_switch *next; | |
4843 | }; | |
4844 | ||
4845 | static struct cp_switch *switch_stack; | |
4846 | ||
4847 | void | |
4848 | push_switch () | |
4849 | { | |
4850 | struct cp_switch *p | |
4851 | = (struct cp_switch *) oballoc (sizeof (struct cp_switch)); | |
4852 | p->level = current_binding_level; | |
4853 | p->next = switch_stack; | |
4854 | switch_stack = p; | |
4855 | } | |
4856 | ||
4857 | void | |
4858 | pop_switch () | |
4859 | { | |
4860 | switch_stack = switch_stack->next; | |
4861 | } | |
4862 | ||
8d08fdba MS |
4863 | /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */ |
4864 | /* XXX Note decl is never actually used. (bpk) */ | |
e92cc029 | 4865 | |
8d08fdba | 4866 | void |
b370501f | 4867 | define_case_label () |
8d08fdba MS |
4868 | { |
4869 | tree cleanup = last_cleanup_this_contour (); | |
a5894242 MS |
4870 | struct binding_level *b = current_binding_level; |
4871 | int identified = 0; | |
4872 | ||
8d08fdba MS |
4873 | if (cleanup) |
4874 | { | |
4875 | static int explained = 0; | |
8251199e JM |
4876 | cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup)); |
4877 | warning ("where case label appears here"); | |
8d08fdba MS |
4878 | if (!explained) |
4879 | { | |
8251199e JM |
4880 | warning ("(enclose actions of previous case statements requiring"); |
4881 | warning ("destructors in their own binding contours.)"); | |
8d08fdba MS |
4882 | explained = 1; |
4883 | } | |
4884 | } | |
4885 | ||
a5894242 MS |
4886 | for (; b && b != switch_stack->level; b = b->level_chain) |
4887 | { | |
4888 | tree new_decls = b->names; | |
4889 | for (; new_decls; new_decls = TREE_CHAIN (new_decls)) | |
4890 | { | |
4891 | if (TREE_CODE (new_decls) == VAR_DECL | |
4892 | /* Don't complain about crossing initialization | |
4893 | of internal entities. They can't be accessed, | |
4894 | and they should be cleaned up | |
4895 | by the time we get to the label. */ | |
4896 | && ! DECL_ARTIFICIAL (new_decls) | |
4897 | && ((DECL_INITIAL (new_decls) != NULL_TREE | |
4898 | && DECL_INITIAL (new_decls) != error_mark_node) | |
4899 | || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls)))) | |
4900 | { | |
4901 | if (! identified) | |
8251199e | 4902 | error ("jump to case label"); |
a5894242 | 4903 | identified = 1; |
8251199e | 4904 | cp_error_at (" crosses initialization of `%#D'", |
a5894242 MS |
4905 | new_decls); |
4906 | } | |
4907 | } | |
4908 | } | |
4909 | ||
8d08fdba MS |
4910 | /* After labels, make any new cleanups go into their |
4911 | own new (temporary) binding contour. */ | |
4912 | ||
4913 | current_binding_level->more_cleanups_ok = 0; | |
4914 | current_function_return_value = NULL_TREE; | |
4915 | } | |
4916 | \f | |
4917 | /* Return the list of declarations of the current level. | |
4918 | Note that this list is in reverse order unless/until | |
4919 | you nreverse it; and when you do nreverse it, you must | |
4920 | store the result back using `storedecls' or you will lose. */ | |
4921 | ||
4922 | tree | |
4923 | getdecls () | |
4924 | { | |
4925 | return current_binding_level->names; | |
4926 | } | |
4927 | ||
4928 | /* Return the list of type-tags (for structs, etc) of the current level. */ | |
4929 | ||
4930 | tree | |
4931 | gettags () | |
4932 | { | |
4933 | return current_binding_level->tags; | |
4934 | } | |
4935 | ||
4936 | /* Store the list of declarations of the current level. | |
4937 | This is done for the parameter declarations of a function being defined, | |
4938 | after they are modified in the light of any missing parameters. */ | |
4939 | ||
4940 | static void | |
4941 | storedecls (decls) | |
4942 | tree decls; | |
4943 | { | |
4944 | current_binding_level->names = decls; | |
4945 | } | |
4946 | ||
4947 | /* Similarly, store the list of tags of the current level. */ | |
4948 | ||
280f9385 | 4949 | void |
8d08fdba MS |
4950 | storetags (tags) |
4951 | tree tags; | |
4952 | { | |
4953 | current_binding_level->tags = tags; | |
4954 | } | |
4955 | \f | |
4956 | /* Given NAME, an IDENTIFIER_NODE, | |
4957 | return the structure (or union or enum) definition for that name. | |
4958 | Searches binding levels from BINDING_LEVEL up to the global level. | |
4959 | If THISLEVEL_ONLY is nonzero, searches only the specified context | |
4960 | (but skips any tag-transparent contexts to find one that is | |
4961 | meaningful for tags). | |
4962 | FORM says which kind of type the caller wants; | |
4963 | it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE. | |
4964 | If the wrong kind of type is found, and it's not a template, an error is | |
4965 | reported. */ | |
4966 | ||
4967 | static tree | |
4968 | lookup_tag (form, name, binding_level, thislevel_only) | |
4969 | enum tree_code form; | |
8d08fdba | 4970 | tree name; |
cffa8729 | 4971 | struct binding_level *binding_level; |
8d08fdba MS |
4972 | int thislevel_only; |
4973 | { | |
4974 | register struct binding_level *level; | |
36a117a5 MM |
4975 | /* Non-zero if, we should look past a pseudo-global level, even if |
4976 | THISLEVEL_ONLY. */ | |
4977 | int allow_pseudo_global = 1; | |
8d08fdba MS |
4978 | |
4979 | for (level = binding_level; level; level = level->level_chain) | |
4980 | { | |
4981 | register tree tail; | |
4982 | if (ANON_AGGRNAME_P (name)) | |
4983 | for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) | |
4984 | { | |
4985 | /* There's no need for error checking here, because | |
4986 | anon names are unique throughout the compilation. */ | |
4987 | if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name) | |
4988 | return TREE_VALUE (tail); | |
4989 | } | |
2c73f9f5 ML |
4990 | else if (level->namespace_p) |
4991 | /* Do namespace lookup. */ | |
6c011b01 | 4992 | for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail)) |
2c73f9f5 | 4993 | { |
36a117a5 MM |
4994 | tree old = binding_for_name (name, tail); |
4995 | ||
4996 | /* If we just skipped past a pseudo global level, even | |
4997 | though THISLEVEL_ONLY, and we find a template class | |
4998 | declaration, then we use the _TYPE node for the | |
4999 | template. See the example below. */ | |
5000 | if (thislevel_only && !allow_pseudo_global | |
5001 | && old && BINDING_VALUE (old) | |
5002 | && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old))) | |
5003 | old = TREE_TYPE (BINDING_VALUE (old)); | |
5004 | else | |
5005 | old = BINDING_TYPE (old); | |
5006 | ||
2c73f9f5 ML |
5007 | /* If it has an original type, it is a typedef, and we |
5008 | should not return it. */ | |
5009 | if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old))) | |
5010 | old = NULL_TREE; | |
5011 | if (old && TREE_CODE (old) != form | |
5012 | && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL)) | |
5013 | { | |
8251199e | 5014 | cp_error ("`%#D' redeclared as %C", old, form); |
2c73f9f5 ML |
5015 | return NULL_TREE; |
5016 | } | |
5017 | if (old) | |
5018 | return old; | |
5019 | if (thislevel_only || tail == global_namespace) | |
5020 | return NULL_TREE; | |
5021 | } | |
8d08fdba MS |
5022 | else |
5023 | for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) | |
5024 | { | |
a80e4195 | 5025 | if (TREE_PURPOSE (tail) == name) |
8d08fdba MS |
5026 | { |
5027 | enum tree_code code = TREE_CODE (TREE_VALUE (tail)); | |
5028 | /* Should tighten this up; it'll probably permit | |
5029 | UNION_TYPE and a struct template, for example. */ | |
5030 | if (code != form | |
5566b478 | 5031 | && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL)) |
8d08fdba MS |
5032 | { |
5033 | /* Definition isn't the kind we were looking for. */ | |
8251199e | 5034 | cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail), |
8d08fdba | 5035 | form); |
72b7eeff | 5036 | return NULL_TREE; |
8d08fdba MS |
5037 | } |
5038 | return TREE_VALUE (tail); | |
5039 | } | |
5040 | } | |
5041 | if (thislevel_only && ! level->tag_transparent) | |
5566b478 | 5042 | { |
36a117a5 | 5043 | if (level->pseudo_global && allow_pseudo_global) |
5566b478 | 5044 | { |
36a117a5 MM |
5045 | /* We must deal with cases like this: |
5046 | ||
5047 | template <class T> struct S; | |
5048 | template <class T> struct S {}; | |
5049 | ||
5050 | When looking up `S', for the second declaration, we | |
5051 | would like to find the first declaration. But, we | |
5052 | are in the pseudo-global level created for the | |
5053 | template parameters, rather than the (surrounding) | |
5054 | namespace level. Thus, we keep going one more level, | |
5055 | even though THISLEVEL_ONLY is non-zero. */ | |
5056 | allow_pseudo_global = 0; | |
5057 | continue; | |
5566b478 | 5058 | } |
36a117a5 MM |
5059 | else |
5060 | return NULL_TREE; | |
5566b478 | 5061 | } |
8d08fdba MS |
5062 | } |
5063 | return NULL_TREE; | |
5064 | } | |
5065 | ||
bd6dd845 | 5066 | #if 0 |
8d08fdba MS |
5067 | void |
5068 | set_current_level_tags_transparency (tags_transparent) | |
5069 | int tags_transparent; | |
5070 | { | |
5071 | current_binding_level->tag_transparent = tags_transparent; | |
5072 | } | |
bd6dd845 | 5073 | #endif |
8d08fdba MS |
5074 | |
5075 | /* Given a type, find the tag that was defined for it and return the tag name. | |
5076 | Otherwise return 0. However, the value can never be 0 | |
5077 | in the cases in which this is used. | |
5078 | ||
5079 | C++: If NAME is non-zero, this is the new name to install. This is | |
5080 | done when replacing anonymous tags with real tag names. */ | |
5081 | ||
5082 | static tree | |
5083 | lookup_tag_reverse (type, name) | |
5084 | tree type; | |
5085 | tree name; | |
5086 | { | |
5087 | register struct binding_level *level; | |
5088 | ||
5089 | for (level = current_binding_level; level; level = level->level_chain) | |
5090 | { | |
5091 | register tree tail; | |
5092 | for (tail = level->tags; tail; tail = TREE_CHAIN (tail)) | |
5093 | { | |
5094 | if (TREE_VALUE (tail) == type) | |
5095 | { | |
5096 | if (name) | |
5097 | TREE_PURPOSE (tail) = name; | |
5098 | return TREE_PURPOSE (tail); | |
5099 | } | |
5100 | } | |
5101 | } | |
5102 | return NULL_TREE; | |
5103 | } | |
8d08fdba | 5104 | \f |
a9aedbc2 | 5105 | /* Look up NAME in the NAMESPACE. */ |
e92cc029 | 5106 | |
a9aedbc2 MS |
5107 | tree |
5108 | lookup_namespace_name (namespace, name) | |
5109 | tree namespace, name; | |
5110 | { | |
30394414 | 5111 | tree val; |
f30c84c9 | 5112 | tree template_id = NULL_TREE; |
2c73f9f5 | 5113 | |
30394414 | 5114 | my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370); |
1231fb96 | 5115 | |
1231fb96 | 5116 | if (TREE_CODE (name) == NAMESPACE_DECL) |
d8f8dca1 | 5117 | /* This happens for A::B<int> when B is a namespace. */ |
1231fb96 | 5118 | return name; |
d8f8dca1 MM |
5119 | else if (TREE_CODE (name) == TEMPLATE_DECL) |
5120 | { | |
5121 | /* This happens for A::B where B is a template, and there are no | |
5122 | template arguments. */ | |
5123 | cp_error ("invalid use of `%D'", name); | |
5124 | return error_mark_node; | |
5125 | } | |
1231fb96 | 5126 | |
b262d64c JM |
5127 | namespace = ORIGINAL_NAMESPACE (namespace); |
5128 | ||
f30c84c9 MM |
5129 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) |
5130 | { | |
5131 | template_id = name; | |
5132 | name = TREE_OPERAND (name, 0); | |
5133 | if (TREE_CODE (name) == OVERLOAD) | |
5134 | name = DECL_NAME (OVL_CURRENT (name)); | |
5135 | else if (TREE_CODE_CLASS (TREE_CODE (name)) == 'd') | |
5136 | name = DECL_NAME (name); | |
5137 | } | |
5138 | ||
30394414 JM |
5139 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373); |
5140 | ||
87e3dbc9 | 5141 | val = make_node (CPLUS_BINDING); |
52c11ef6 | 5142 | if (!qualified_lookup_using_namespace (name, namespace, val, 0)) |
2c73f9f5 ML |
5143 | return error_mark_node; |
5144 | ||
5145 | if (BINDING_VALUE (val)) | |
1c35f5b6 JM |
5146 | { |
5147 | val = BINDING_VALUE (val); | |
5148 | ||
f30c84c9 MM |
5149 | if (template_id) |
5150 | { | |
5151 | if (DECL_CLASS_TEMPLATE_P (val)) | |
5152 | val = lookup_template_class (val, | |
5153 | TREE_OPERAND (template_id, 1), | |
5154 | /*in_decl=*/NULL_TREE, | |
5155 | /*context=*/NULL_TREE, | |
5156 | /*entering_scope=*/0); | |
5157 | else if (DECL_FUNCTION_TEMPLATE_P (val) | |
5158 | || TREE_CODE (val) == OVERLOAD) | |
5159 | val = lookup_template_function (val, | |
5160 | TREE_OPERAND (template_id, 1)); | |
5161 | else | |
5162 | { | |
5163 | cp_error ("`%D::%D' is not a template", | |
5164 | namespace, name); | |
5165 | return error_mark_node; | |
5166 | } | |
5167 | } | |
5168 | ||
1c35f5b6 JM |
5169 | /* If we have a single function from a using decl, pull it out. */ |
5170 | if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val)) | |
5171 | val = OVL_FUNCTION (val); | |
5172 | return val; | |
5173 | } | |
5174 | ||
8251199e | 5175 | cp_error ("`%D' undeclared in namespace `%D'", name, namespace); |
30394414 | 5176 | return error_mark_node; |
a9aedbc2 MS |
5177 | } |
5178 | ||
7ddedda4 MM |
5179 | /* Hash a TYPENAME_TYPE. K is really of type `tree'. */ |
5180 | ||
5181 | static unsigned long | |
5182 | typename_hash (k) | |
5183 | hash_table_key k; | |
5184 | { | |
5185 | unsigned long hash; | |
5186 | tree t; | |
5187 | ||
5188 | t = (tree) k; | |
5189 | hash = (((unsigned long) TYPE_CONTEXT (t)) | |
5190 | ^ ((unsigned long) DECL_NAME (TYPE_NAME (t)))); | |
5191 | ||
5192 | return hash; | |
5193 | } | |
5194 | ||
5195 | /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */ | |
5196 | ||
5197 | static boolean | |
5198 | typename_compare (k1, k2) | |
5199 | hash_table_key k1; | |
5200 | hash_table_key k2; | |
5201 | { | |
5202 | tree t1; | |
5203 | tree t2; | |
5204 | tree d1; | |
5205 | tree d2; | |
5206 | ||
5207 | t1 = (tree) k1; | |
5208 | t2 = (tree) k2; | |
5209 | d1 = TYPE_NAME (t1); | |
5210 | d2 = TYPE_NAME (t2); | |
5211 | ||
5212 | return (DECL_NAME (d1) == DECL_NAME (d2) | |
5213 | && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)) | |
5214 | && ((TREE_TYPE (t1) != NULL_TREE) | |
5215 | == (TREE_TYPE (t2) != NULL_TREE)) | |
5216 | && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)) | |
5217 | && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2)); | |
5218 | } | |
5219 | ||
45869a6c MM |
5220 | /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is |
5221 | the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE | |
5222 | is non-NULL, this type is being created by the implicit typename | |
5223 | extension, and BASE_TYPE is a type named `t' in some base class of | |
5224 | `T' which depends on template parameters. | |
5225 | ||
5226 | Returns the new TYPENAME_TYPE. */ | |
5227 | ||
5228 | tree | |
5229 | build_typename_type (context, name, fullname, base_type) | |
5230 | tree context; | |
5231 | tree name; | |
5232 | tree fullname; | |
5233 | tree base_type; | |
5234 | { | |
5235 | tree t; | |
5236 | tree d; | |
7ddedda4 | 5237 | struct hash_entry* e; |
45869a6c | 5238 | |
7ddedda4 MM |
5239 | static struct hash_table ht; |
5240 | ||
5241 | push_obstacks (&permanent_obstack, &permanent_obstack); | |
5242 | ||
9cd64686 MM |
5243 | if (!ht.table) |
5244 | { | |
5245 | static struct hash_table *h = &ht; | |
5246 | if (!hash_table_init (&ht, &hash_newfunc, &typename_hash, | |
5247 | &typename_compare)) | |
5248 | fatal ("virtual memory exhausted"); | |
5249 | ggc_add_tree_hash_table_root (&h, 1); | |
5250 | } | |
45869a6c MM |
5251 | |
5252 | /* Build the TYPENAME_TYPE. */ | |
5253 | t = make_lang_type (TYPENAME_TYPE); | |
5254 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
5255 | TYPENAME_TYPE_FULLNAME (t) = fullname; | |
5256 | TREE_TYPE (t) = base_type; | |
45869a6c MM |
5257 | |
5258 | /* Build the corresponding TYPE_DECL. */ | |
5259 | d = build_decl (TYPE_DECL, name, t); | |
5260 | TYPE_NAME (TREE_TYPE (d)) = d; | |
5261 | TYPE_STUB_DECL (TREE_TYPE (d)) = d; | |
5262 | DECL_CONTEXT (d) = FROB_CONTEXT (context); | |
2642b9bf | 5263 | DECL_ARTIFICIAL (d) = 1; |
45869a6c | 5264 | |
7ddedda4 MM |
5265 | /* See if we already have this type. */ |
5266 | e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0); | |
5267 | if (e) | |
87e3dbc9 | 5268 | t = (tree) e->key; |
7ddedda4 MM |
5269 | else |
5270 | /* Insert the type into the table. */ | |
5271 | hash_lookup (&ht, t, /*create=*/true, /*copy=*/0); | |
5272 | ||
5273 | pop_obstacks (); | |
45869a6c MM |
5274 | |
5275 | return t; | |
5276 | } | |
5277 | ||
5566b478 MS |
5278 | tree |
5279 | make_typename_type (context, name) | |
5280 | tree context, name; | |
5281 | { | |
b2b7d40a | 5282 | tree fullname; |
a80e4195 | 5283 | |
653cc74a | 5284 | if (TREE_CODE_CLASS (TREE_CODE (name)) == 't') |
78638e24 MM |
5285 | { |
5286 | if (!(TYPE_LANG_SPECIFIC (name) | |
5287 | && (CLASSTYPE_IS_TEMPLATE (name) | |
5288 | || CLASSTYPE_USE_TEMPLATE (name)))) | |
5289 | name = TYPE_IDENTIFIER (name); | |
5290 | else | |
5291 | /* Create a TEMPLATE_ID_EXPR for the type. */ | |
5292 | name = build_nt (TEMPLATE_ID_EXPR, | |
5293 | CLASSTYPE_TI_TEMPLATE (name), | |
5294 | CLASSTYPE_TI_ARGS (name)); | |
5295 | } | |
653cc74a | 5296 | else if (TREE_CODE (name) == TYPE_DECL) |
a80e4195 | 5297 | name = DECL_NAME (name); |
b2b7d40a JM |
5298 | |
5299 | fullname = name; | |
5300 | ||
5301 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
11686454 JM |
5302 | { |
5303 | name = TREE_OPERAND (name, 0); | |
5304 | if (TREE_CODE (name) == TEMPLATE_DECL) | |
5305 | name = TREE_OPERAND (fullname, 0) = DECL_NAME (name); | |
5306 | } | |
b2b7d40a | 5307 | if (TREE_CODE (name) != IDENTIFIER_NODE) |
a80e4195 | 5308 | my_friendly_abort (2000); |
5566b478 | 5309 | |
04ddee1b BK |
5310 | if (TREE_CODE (context) == NAMESPACE_DECL) |
5311 | { | |
5312 | /* We can get here from typename_sub0 in the explicit_template_type | |
5313 | expansion. Just fail. */ | |
5314 | cp_error ("no class template named `%#T' in `%#T'", | |
5315 | name, context); | |
5316 | return error_mark_node; | |
5317 | } | |
5318 | ||
85b71cf2 | 5319 | if (! uses_template_parms (context) |
b77ead33 | 5320 | || currently_open_class (context)) |
5566b478 | 5321 | { |
b2b7d40a JM |
5322 | if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR) |
5323 | { | |
ad810b22 | 5324 | tree tmpl = NULL_TREE; |
b2b7d40a | 5325 | if (IS_AGGR_TYPE (context)) |
ad810b22 MM |
5326 | tmpl = lookup_field (context, name, 0, 0); |
5327 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
b2b7d40a | 5328 | { |
8251199e | 5329 | cp_error ("no class template named `%#T' in `%#T'", |
b2b7d40a JM |
5330 | name, context); |
5331 | return error_mark_node; | |
5332 | } | |
ffb690bd | 5333 | |
ad810b22 MM |
5334 | return lookup_template_class (tmpl, |
5335 | TREE_OPERAND (fullname, 1), | |
5336 | NULL_TREE, context, | |
5337 | /*entering_scope=*/0); | |
b2b7d40a JM |
5338 | } |
5339 | else | |
5566b478 | 5340 | { |
b4f70b3d NS |
5341 | tree t; |
5342 | ||
5343 | if (!IS_AGGR_TYPE (context)) | |
b2b7d40a | 5344 | { |
8251199e | 5345 | cp_error ("no type named `%#T' in `%#T'", name, context); |
b2b7d40a JM |
5346 | return error_mark_node; |
5347 | } | |
1107c4b3 | 5348 | |
b4f70b3d | 5349 | t = lookup_field (context, name, 0, 1); |
7d4bdeed MM |
5350 | if (t) |
5351 | return TREE_TYPE (t); | |
5566b478 | 5352 | } |
5566b478 | 5353 | } |
11249cf0 MM |
5354 | |
5355 | /* If the CONTEXT is not a template type, then either the field is | |
5356 | there now or its never going to be. */ | |
b4f70b3d | 5357 | if (!uses_template_parms (context)) |
11249cf0 MM |
5358 | { |
5359 | cp_error ("no type named `%#T' in `%#T'", name, context); | |
5360 | return error_mark_node; | |
5361 | } | |
5362 | ||
45869a6c MM |
5363 | |
5364 | return build_typename_type (context, name, fullname, NULL_TREE); | |
5566b478 MS |
5365 | } |
5366 | ||
2c73f9f5 ML |
5367 | /* Select the right _DECL from multiple choices. */ |
5368 | ||
5369 | static tree | |
52c11ef6 | 5370 | select_decl (binding, flags) |
2c73f9f5 | 5371 | tree binding; |
52c11ef6 | 5372 | int flags; |
2c73f9f5 ML |
5373 | { |
5374 | tree val; | |
5375 | val = BINDING_VALUE (binding); | |
52c11ef6 | 5376 | if (LOOKUP_NAMESPACES_ONLY (flags)) |
3e3f722c ML |
5377 | { |
5378 | /* We are not interested in types. */ | |
5379 | if (val && TREE_CODE (val) == NAMESPACE_DECL) | |
5380 | return val; | |
5381 | return NULL_TREE; | |
5382 | } | |
5383 | ||
2c73f9f5 ML |
5384 | /* If we could have a type and |
5385 | we have nothing or we need a type and have none. */ | |
5386 | if (BINDING_TYPE (binding) | |
52c11ef6 JM |
5387 | && (!val || ((flags & LOOKUP_PREFER_TYPES) |
5388 | && TREE_CODE (val) != TYPE_DECL))) | |
2c73f9f5 ML |
5389 | val = TYPE_STUB_DECL (BINDING_TYPE (binding)); |
5390 | /* Don't return non-types if we really prefer types. */ | |
52c11ef6 | 5391 | else if (val && LOOKUP_TYPES_ONLY (flags) && TREE_CODE (val) != TYPE_DECL |
c592d5d2 ML |
5392 | && (TREE_CODE (val) != TEMPLATE_DECL |
5393 | || !DECL_CLASS_TEMPLATE_P (val))) | |
2c73f9f5 | 5394 | val = NULL_TREE; |
1c35f5b6 | 5395 | |
2c73f9f5 ML |
5396 | return val; |
5397 | } | |
5398 | ||
2c169bab JM |
5399 | /* Unscoped lookup of a global: iterate over current namespaces, |
5400 | considering using-directives. If SPACESP is non-NULL, store a list | |
5401 | of the namespaces we've considered in it. */ | |
ea9635c7 | 5402 | |
2c169bab JM |
5403 | tree |
5404 | unqualified_namespace_lookup (name, flags, spacesp) | |
ea9635c7 | 5405 | tree name; |
52c11ef6 | 5406 | int flags; |
2c169bab | 5407 | tree *spacesp; |
ea9635c7 | 5408 | { |
87e3dbc9 | 5409 | tree b = make_node (CPLUS_BINDING); |
ea9635c7 ML |
5410 | tree initial = current_decl_namespace(); |
5411 | tree scope = initial; | |
5412 | tree siter; | |
5413 | struct binding_level *level; | |
5414 | tree val = NULL_TREE; | |
5415 | ||
2c169bab JM |
5416 | if (spacesp) |
5417 | *spacesp = NULL_TREE; | |
5418 | ||
5419 | for (; !val; scope = CP_DECL_CONTEXT (scope)) | |
ea9635c7 | 5420 | { |
2c169bab | 5421 | if (spacesp) |
e1b3e07d | 5422 | *spacesp = tree_cons (scope, NULL_TREE, *spacesp); |
ea9635c7 ML |
5423 | val = binding_for_name (name, scope); |
5424 | ||
5425 | /* Initialize binding for this context. */ | |
5426 | BINDING_VALUE (b) = BINDING_VALUE (val); | |
5427 | BINDING_TYPE (b) = BINDING_TYPE (val); | |
5428 | ||
5429 | /* Add all _DECLs seen through local using-directives. */ | |
5430 | for (level = current_binding_level; | |
5431 | !level->namespace_p; | |
5432 | level = level->level_chain) | |
52c11ef6 | 5433 | if (!lookup_using_namespace (name, b, level->using_directives, |
2c169bab | 5434 | scope, flags, spacesp)) |
ea9635c7 | 5435 | /* Give up because of error. */ |
5b163de4 | 5436 | return error_mark_node; |
ea9635c7 ML |
5437 | |
5438 | /* Add all _DECLs seen through global using-directives. */ | |
5439 | /* XXX local and global using lists should work equally. */ | |
5440 | siter = initial; | |
5441 | while (1) | |
5442 | { | |
5443 | if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter), | |
2c169bab | 5444 | scope, flags, spacesp)) |
ea9635c7 | 5445 | /* Give up because of error. */ |
5b163de4 | 5446 | return error_mark_node; |
ea9635c7 ML |
5447 | if (siter == scope) break; |
5448 | siter = CP_DECL_CONTEXT (siter); | |
5449 | } | |
5450 | ||
52c11ef6 | 5451 | val = select_decl (b, flags); |
ea9635c7 ML |
5452 | if (scope == global_namespace) |
5453 | break; | |
ea9635c7 ML |
5454 | } |
5455 | return val; | |
5456 | } | |
5457 | ||
52c11ef6 JM |
5458 | /* Combine prefer_type and namespaces_only into flags. */ |
5459 | ||
5460 | static int | |
5461 | lookup_flags (prefer_type, namespaces_only) | |
5462 | int prefer_type, namespaces_only; | |
5463 | { | |
5464 | if (namespaces_only) | |
5465 | return LOOKUP_PREFER_NAMESPACES; | |
5466 | if (prefer_type > 1) | |
5467 | return LOOKUP_PREFER_TYPES; | |
5468 | if (prefer_type > 0) | |
5469 | return LOOKUP_PREFER_BOTH; | |
5470 | return 0; | |
5471 | } | |
5472 | ||
5473 | /* Given a lookup that returned VAL, use FLAGS to decide if we want to | |
5474 | ignore it or not. Subroutine of lookup_name_real. */ | |
5475 | ||
5476 | static tree | |
5477 | qualify_lookup (val, flags) | |
5478 | tree val; | |
5479 | int flags; | |
5480 | { | |
5481 | if (val == NULL_TREE) | |
5482 | return val; | |
6b945830 JM |
5483 | if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL) |
5484 | return val; | |
5485 | if ((flags & LOOKUP_PREFER_TYPES) | |
5486 | && (TREE_CODE (val) == TYPE_DECL | |
5487 | || ((flags & LOOKUP_TEMPLATES_EXPECTED) | |
5488 | && DECL_CLASS_TEMPLATE_P (val)))) | |
5489 | return val; | |
5490 | if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES)) | |
52c11ef6 JM |
5491 | return NULL_TREE; |
5492 | return val; | |
5493 | } | |
5494 | ||
235f734d MM |
5495 | /* Any other BINDING overrides an implicit TYPENAME. Warn about |
5496 | that. */ | |
5497 | ||
5498 | static void | |
5499 | warn_about_implicit_typename_lookup (typename, binding) | |
5500 | tree typename; | |
5501 | tree binding; | |
5502 | { | |
5503 | tree subtype = TREE_TYPE (TREE_TYPE (typename)); | |
5504 | tree name = DECL_NAME (typename); | |
5505 | ||
5506 | if (! (TREE_CODE (binding) == TEMPLATE_DECL | |
5507 | && CLASSTYPE_TEMPLATE_INFO (subtype) | |
5508 | && CLASSTYPE_TI_TEMPLATE (subtype) == binding) | |
5509 | && ! (TREE_CODE (binding) == TYPE_DECL | |
5510 | && same_type_p (TREE_TYPE (binding), subtype))) | |
5511 | { | |
5512 | cp_warning ("lookup of `%D' finds `%#D'", | |
5513 | name, binding); | |
5514 | cp_warning (" instead of `%D' from dependent base class", | |
5515 | typename); | |
5516 | cp_warning (" (use `typename %T::%D' if that's what you meant)", | |
5517 | constructor_name (current_class_type), name); | |
5518 | } | |
5519 | } | |
5520 | ||
8d08fdba MS |
5521 | /* Look up NAME in the current binding level and its superiors in the |
5522 | namespace of variables, functions and typedefs. Return a ..._DECL | |
5523 | node of some kind representing its definition if there is only one | |
5524 | such declaration, or return a TREE_LIST with all the overloaded | |
5525 | definitions if there are many, or return 0 if it is undefined. | |
5526 | ||
2c73f9f5 ML |
5527 | If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces. |
5528 | If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces). | |
a28e3c7f | 5529 | If PREFER_TYPE is -2, we're being called from yylex(). (UGLY) |
f84b4be9 JM |
5530 | Otherwise we prefer non-TYPE_DECLs. |
5531 | ||
5532 | If NONCLASS is non-zero, we don't look for the NAME in class scope, | |
5533 | using IDENTIFIER_CLASS_VALUE. */ | |
8d08fdba | 5534 | |
824b9a4c | 5535 | static tree |
3e3f722c | 5536 | lookup_name_real (name, prefer_type, nonclass, namespaces_only) |
8d08fdba | 5537 | tree name; |
3e3f722c | 5538 | int prefer_type, nonclass, namespaces_only; |
8d08fdba | 5539 | { |
235f734d MM |
5540 | tree t; |
5541 | tree val = NULL_TREE; | |
a28e3c7f | 5542 | int yylex = 0; |
e1cd6e56 | 5543 | tree from_obj = NULL_TREE; |
52c11ef6 | 5544 | int flags; |
235f734d | 5545 | int val_is_implicit_typename = 0; |
8d08fdba | 5546 | |
3e3f722c ML |
5547 | /* Hack: copy flag set by parser, if set. */ |
5548 | if (only_namespace_names) | |
5549 | namespaces_only = 1; | |
52c11ef6 | 5550 | |
a28e3c7f MS |
5551 | if (prefer_type == -2) |
5552 | { | |
5553 | extern int looking_for_typename; | |
fc378698 | 5554 | tree type = NULL_TREE; |
a28e3c7f MS |
5555 | |
5556 | yylex = 1; | |
5557 | prefer_type = looking_for_typename; | |
e1cd6e56 | 5558 | |
52c11ef6 | 5559 | flags = lookup_flags (prefer_type, namespaces_only); |
52c11ef6 JM |
5560 | /* If the next thing is '<', class templates are types. */ |
5561 | if (looking_for_template) | |
5562 | flags |= LOOKUP_TEMPLATES_EXPECTED; | |
5563 | ||
653cc74a JM |
5564 | /* std:: becomes :: for now. */ |
5565 | if (got_scope == std_node) | |
5566 | got_scope = void_type_node; | |
5567 | ||
e1cd6e56 MS |
5568 | if (got_scope) |
5569 | type = got_scope; | |
dff6b454 | 5570 | else if (got_object != error_mark_node) |
e1cd6e56 | 5571 | type = got_object; |
a28e3c7f | 5572 | |
e1cd6e56 | 5573 | if (type) |
a28e3c7f | 5574 | { |
e1cd6e56 | 5575 | if (type == error_mark_node) |
f376e137 | 5576 | return error_mark_node; |
a80e4195 MS |
5577 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) |
5578 | type = TREE_TYPE (type); | |
5566b478 | 5579 | |
2b9dc906 JM |
5580 | if (TYPE_P (type)) |
5581 | type = complete_type (type); | |
5566b478 | 5582 | |
a1774733 | 5583 | if (TREE_CODE (type) == VOID_TYPE) |
2c73f9f5 ML |
5584 | type = global_namespace; |
5585 | if (TREE_CODE (type) == NAMESPACE_DECL) | |
a9aedbc2 | 5586 | { |
87e3dbc9 | 5587 | val = make_node (CPLUS_BINDING); |
6ad07332 | 5588 | flags |= LOOKUP_COMPLAIN; |
52c11ef6 | 5589 | if (!qualified_lookup_using_namespace (name, type, val, flags)) |
2c73f9f5 | 5590 | return NULL_TREE; |
52c11ef6 | 5591 | val = select_decl (val, flags); |
a9aedbc2 | 5592 | } |
5566b478 | 5593 | else if (! IS_AGGR_TYPE (type) |
5156628f | 5594 | || TREE_CODE (type) == TEMPLATE_TYPE_PARM |
73b0fce8 | 5595 | || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
5156628f | 5596 | || TREE_CODE (type) == TYPENAME_TYPE) |
e92cc029 | 5597 | /* Someone else will give an error about this if needed. */ |
a28e3c7f | 5598 | val = NULL_TREE; |
e1cd6e56 | 5599 | else if (type == current_class_type) |
a28e3c7f | 5600 | val = IDENTIFIER_CLASS_VALUE (name); |
a28e3c7f | 5601 | else |
d23a1bb1 | 5602 | val = lookup_member (type, name, 0, prefer_type); |
a28e3c7f | 5603 | } |
e1cd6e56 MS |
5604 | else |
5605 | val = NULL_TREE; | |
5606 | ||
594740f3 | 5607 | if (got_scope) |
e1cd6e56 | 5608 | goto done; |
594740f3 | 5609 | else if (got_object && val) |
e1cd6e56 | 5610 | from_obj = val; |
a28e3c7f | 5611 | } |
52c11ef6 | 5612 | else |
5b163de4 JM |
5613 | { |
5614 | flags = lookup_flags (prefer_type, namespaces_only); | |
5615 | /* If we're not parsing, we need to complain. */ | |
5616 | flags |= LOOKUP_COMPLAIN; | |
5617 | } | |
e76a2646 | 5618 | |
d8f8dca1 | 5619 | /* First, look in non-namespace scopes. */ |
6f1b4c42 JM |
5620 | |
5621 | if (current_class_type == NULL_TREE) | |
5622 | nonclass = 1; | |
5623 | ||
235f734d | 5624 | for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t)) |
d8f8dca1 | 5625 | { |
235f734d MM |
5626 | tree binding; |
5627 | ||
5628 | if (!LOCAL_BINDING_P (t) && nonclass) | |
d8f8dca1 MM |
5629 | /* We're not looking for class-scoped bindings, so keep going. */ |
5630 | continue; | |
5631 | ||
5632 | /* If this is the kind of thing we're looking for, we're done. */ | |
235f734d MM |
5633 | if (qualify_lookup (BINDING_VALUE (t), flags)) |
5634 | binding = BINDING_VALUE (t); | |
d8f8dca1 | 5635 | else if ((flags & LOOKUP_PREFER_TYPES) |
235f734d MM |
5636 | && qualify_lookup (BINDING_TYPE (t), flags)) |
5637 | binding = BINDING_TYPE (t); | |
5638 | else | |
5639 | binding = NULL_TREE; | |
5640 | ||
5641 | if (binding | |
83233dca | 5642 | && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding))) |
d8f8dca1 | 5643 | { |
235f734d MM |
5644 | if (val_is_implicit_typename && !yylex) |
5645 | warn_about_implicit_typename_lookup (val, binding); | |
5646 | val = binding; | |
5647 | val_is_implicit_typename | |
83233dca | 5648 | = IMPLICIT_TYPENAME_TYPE_DECL_P (val); |
235f734d MM |
5649 | if (!val_is_implicit_typename) |
5650 | break; | |
d8f8dca1 MM |
5651 | } |
5652 | } | |
f181d4ae | 5653 | |
235f734d MM |
5654 | /* Now lookup in namespace scopes. */ |
5655 | if (!val || val_is_implicit_typename) | |
e76a2646 | 5656 | { |
2c169bab | 5657 | t = unqualified_namespace_lookup (name, flags, 0); |
235f734d | 5658 | if (t) |
c1def683 | 5659 | { |
235f734d MM |
5660 | if (val_is_implicit_typename && !yylex) |
5661 | warn_about_implicit_typename_lookup (val, t); | |
5662 | val = t; | |
c1def683 JM |
5663 | } |
5664 | } | |
5665 | ||
a28e3c7f | 5666 | done: |
8d08fdba MS |
5667 | if (val) |
5668 | { | |
c91a56d2 | 5669 | /* This should only warn about types used in qualified-ids. */ |
e1cd6e56 | 5670 | if (from_obj && from_obj != val) |
5566b478 | 5671 | { |
c91a56d2 MS |
5672 | if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL |
5673 | && TREE_CODE (val) == TYPE_DECL | |
5674 | && TREE_TYPE (from_obj) != TREE_TYPE (val)) | |
5675 | { | |
8251199e | 5676 | cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')", |
c91a56d2 | 5677 | name, got_object, TREE_TYPE (from_obj)); |
8251199e | 5678 | cp_pedwarn (" does not match lookup in the current scope (`%#T')", |
c91a56d2 MS |
5679 | TREE_TYPE (val)); |
5680 | } | |
594740f3 | 5681 | |
b8b1a3c1 JM |
5682 | /* We don't change val to from_obj if got_object depends on |
5683 | template parms because that breaks implicit typename for | |
5684 | destructor calls. */ | |
5685 | if (! uses_template_parms (got_object)) | |
53fdbb3b | 5686 | val = from_obj; |
5566b478 | 5687 | } |
e1cd6e56 | 5688 | |
0c64a9ca JM |
5689 | /* If we have a single function from a using decl, pull it out. */ |
5690 | if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val)) | |
5691 | val = OVL_FUNCTION (val); | |
8d08fdba | 5692 | } |
e1cd6e56 MS |
5693 | else if (from_obj) |
5694 | val = from_obj; | |
8d08fdba MS |
5695 | |
5696 | return val; | |
5697 | } | |
5698 | ||
700f8a87 MS |
5699 | tree |
5700 | lookup_name_nonclass (name) | |
5701 | tree name; | |
5702 | { | |
3e3f722c | 5703 | return lookup_name_real (name, 0, 1, 0); |
700f8a87 MS |
5704 | } |
5705 | ||
2c73f9f5 ML |
5706 | tree |
5707 | lookup_function_nonclass (name, args) | |
5708 | tree name; | |
5709 | tree args; | |
5710 | { | |
5711 | return lookup_arg_dependent (name, lookup_name_nonclass (name), args); | |
5712 | } | |
5713 | ||
3e3f722c ML |
5714 | tree |
5715 | lookup_name_namespace_only (name) | |
5716 | tree name; | |
5717 | { | |
5718 | /* type-or-namespace, nonclass, namespace_only */ | |
5719 | return lookup_name_real (name, 1, 1, 1); | |
5720 | } | |
5721 | ||
700f8a87 MS |
5722 | tree |
5723 | lookup_name (name, prefer_type) | |
5724 | tree name; | |
5725 | int prefer_type; | |
5726 | { | |
3e3f722c | 5727 | return lookup_name_real (name, prefer_type, 0, 0); |
700f8a87 MS |
5728 | } |
5729 | ||
a7d2d407 MM |
5730 | /* Similar to `lookup_name' but look only in the innermost non-class |
5731 | binding level. */ | |
8d08fdba MS |
5732 | |
5733 | tree | |
5734 | lookup_name_current_level (name) | |
5735 | tree name; | |
5736 | { | |
a7d2d407 MM |
5737 | struct binding_level *b; |
5738 | tree t = NULL_TREE; | |
8d08fdba | 5739 | |
a7d2d407 MM |
5740 | b = current_binding_level; |
5741 | while (b->parm_flag == 2) | |
5742 | b = b->level_chain; | |
5743 | ||
5744 | if (b->namespace_p) | |
8d08fdba | 5745 | { |
30394414 | 5746 | t = IDENTIFIER_NAMESPACE_VALUE (name); |
8d08fdba MS |
5747 | |
5748 | /* extern "C" function() */ | |
5749 | if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST) | |
5750 | t = TREE_VALUE (t); | |
5751 | } | |
f181d4ae MM |
5752 | else if (IDENTIFIER_BINDING (name) |
5753 | && LOCAL_BINDING_P (IDENTIFIER_BINDING (name))) | |
8d08fdba | 5754 | { |
a4443a08 MS |
5755 | while (1) |
5756 | { | |
f181d4ae MM |
5757 | if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b) |
5758 | return IDENTIFIER_VALUE (name); | |
5759 | ||
9ed182dc JM |
5760 | if (b->keep == 2) |
5761 | b = b->level_chain; | |
5762 | else | |
5763 | break; | |
5764 | } | |
5765 | } | |
5766 | ||
5767 | return t; | |
5768 | } | |
5769 | ||
5770 | /* Like lookup_name_current_level, but for types. */ | |
5771 | ||
5772 | tree | |
5773 | lookup_type_current_level (name) | |
5774 | tree name; | |
5775 | { | |
5776 | register tree t = NULL_TREE; | |
5777 | ||
5778 | my_friendly_assert (! current_binding_level->namespace_p, 980716); | |
5779 | ||
5780 | if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE | |
5781 | && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node) | |
5782 | { | |
5783 | struct binding_level *b = current_binding_level; | |
5784 | while (1) | |
5785 | { | |
5786 | if (purpose_member (name, b->type_shadowed)) | |
5787 | return REAL_IDENTIFIER_TYPE_VALUE (name); | |
a4443a08 MS |
5788 | if (b->keep == 2) |
5789 | b = b->level_chain; | |
5790 | else | |
5791 | break; | |
5792 | } | |
8d08fdba MS |
5793 | } |
5794 | ||
5795 | return t; | |
5796 | } | |
3e3f722c ML |
5797 | |
5798 | void | |
5799 | begin_only_namespace_names () | |
5800 | { | |
5801 | only_namespace_names = 1; | |
5802 | } | |
5803 | ||
5804 | void | |
5805 | end_only_namespace_names () | |
5806 | { | |
5807 | only_namespace_names = 0; | |
5808 | } | |
8d08fdba MS |
5809 | \f |
5810 | /* Arrange for the user to get a source line number, even when the | |
5811 | compiler is going down in flames, so that she at least has a | |
5812 | chance of working around problems in the compiler. We used to | |
5813 | call error(), but that let the segmentation fault continue | |
5814 | through; now, it's much more passive by asking them to send the | |
5815 | maintainers mail about the problem. */ | |
5816 | ||
5817 | static void | |
5818 | signal_catch (sig) | |
7dee3f36 | 5819 | int sig ATTRIBUTE_UNUSED; |
8d08fdba MS |
5820 | { |
5821 | signal (SIGSEGV, SIG_DFL); | |
5822 | #ifdef SIGIOT | |
5823 | signal (SIGIOT, SIG_DFL); | |
5824 | #endif | |
5825 | #ifdef SIGILL | |
5826 | signal (SIGILL, SIG_DFL); | |
5827 | #endif | |
5828 | #ifdef SIGABRT | |
5829 | signal (SIGABRT, SIG_DFL); | |
5830 | #endif | |
5831 | #ifdef SIGBUS | |
5832 | signal (SIGBUS, SIG_DFL); | |
5833 | #endif | |
5834 | my_friendly_abort (0); | |
5835 | } | |
5836 | ||
8d08fdba MS |
5837 | /* Push the declarations of builtin types into the namespace. |
5838 | RID_INDEX, if < RID_MAX is the index of the builtin type | |
5839 | in the array RID_POINTERS. NAME is the name used when looking | |
5840 | up the builtin type. TYPE is the _TYPE node for the builtin type. */ | |
5841 | ||
5842 | static void | |
5843 | record_builtin_type (rid_index, name, type) | |
5844 | enum rid rid_index; | |
d8e178a0 | 5845 | const char *name; |
8d08fdba MS |
5846 | tree type; |
5847 | { | |
5848 | tree rname = NULL_TREE, tname = NULL_TREE; | |
a703fb38 | 5849 | tree tdecl = NULL_TREE; |
8d08fdba MS |
5850 | |
5851 | if ((int) rid_index < (int) RID_MAX) | |
5852 | rname = ridpointers[(int) rid_index]; | |
5853 | if (name) | |
5854 | tname = get_identifier (name); | |
5855 | ||
5856 | TYPE_BUILT_IN (type) = 1; | |
5857 | ||
5858 | if (tname) | |
5859 | { | |
8d08fdba | 5860 | tdecl = pushdecl (build_decl (TYPE_DECL, tname, type)); |
8d08fdba MS |
5861 | set_identifier_type_value (tname, NULL_TREE); |
5862 | if ((int) rid_index < (int) RID_MAX) | |
2c73f9f5 ML |
5863 | /* Built-in types live in the global namespace. */ |
5864 | SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl); | |
8d08fdba MS |
5865 | } |
5866 | if (rname != NULL_TREE) | |
5867 | { | |
5868 | if (tname != NULL_TREE) | |
5869 | { | |
5870 | set_identifier_type_value (rname, NULL_TREE); | |
2c73f9f5 | 5871 | SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl); |
8d08fdba MS |
5872 | } |
5873 | else | |
5874 | { | |
8d08fdba | 5875 | tdecl = pushdecl (build_decl (TYPE_DECL, rname, type)); |
8d08fdba MS |
5876 | set_identifier_type_value (rname, NULL_TREE); |
5877 | } | |
5878 | } | |
8d08fdba MS |
5879 | } |
5880 | ||
eff71ab0 PB |
5881 | /* Record one of the standard Java types. |
5882 | * Declare it as having the given NAME. | |
5883 | * If SIZE > 0, it is the size of one of the integral types; | |
5884 | * otherwise it is the negative of the size of one of the other types. */ | |
5885 | ||
5886 | static tree | |
5887 | record_builtin_java_type (name, size) | |
d8e178a0 | 5888 | const char *name; |
eff71ab0 PB |
5889 | int size; |
5890 | { | |
5891 | tree type, decl; | |
5892 | if (size > 0) | |
5893 | type = make_signed_type (size); | |
5894 | else if (size > -32) | |
5895 | { /* "__java_char" or ""__java_boolean". */ | |
5896 | type = make_unsigned_type (-size); | |
5897 | /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/ | |
5898 | } | |
5899 | else | |
5900 | { /* "__java_float" or ""__java_double". */ | |
5901 | type = make_node (REAL_TYPE); | |
5902 | TYPE_PRECISION (type) = - size; | |
5903 | layout_type (type); | |
5904 | } | |
5905 | record_builtin_type (RID_MAX, name, type); | |
5906 | decl = TYPE_NAME (type); | |
e229f2cd PB |
5907 | |
5908 | /* Suppress generate debug symbol entries for these types, | |
5909 | since for normal C++ they are just clutter. | |
5910 | However, push_lang_context undoes this if extern "Java" is seen. */ | |
eff71ab0 | 5911 | DECL_IGNORED_P (decl) = 1; |
e229f2cd | 5912 | |
eff71ab0 PB |
5913 | TYPE_FOR_JAVA (type) = 1; |
5914 | return type; | |
5915 | } | |
5916 | ||
036407f7 ML |
5917 | /* Push a type into the namespace so that the back-ends ignore it. */ |
5918 | ||
5919 | static void | |
5920 | record_unknown_type (type, name) | |
5921 | tree type; | |
d8e178a0 | 5922 | const char *name; |
036407f7 ML |
5923 | { |
5924 | tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type)); | |
5925 | /* Make sure the "unknown type" typedecl gets ignored for debug info. */ | |
5926 | DECL_IGNORED_P (decl) = 1; | |
5927 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; | |
5928 | TYPE_SIZE (type) = TYPE_SIZE (void_type_node); | |
5929 | TYPE_ALIGN (type) = 1; | |
5930 | TYPE_MODE (type) = TYPE_MODE (void_type_node); | |
5931 | } | |
5932 | ||
8d08fdba MS |
5933 | /* Push overloaded decl, in global scope, with one argument so it |
5934 | can be used as a callback from define_function. */ | |
e92cc029 | 5935 | |
8d08fdba MS |
5936 | static void |
5937 | push_overloaded_decl_1 (x) | |
5938 | tree x; | |
5939 | { | |
7bdbfa05 | 5940 | push_overloaded_decl (x, PUSH_GLOBAL); |
8d08fdba MS |
5941 | } |
5942 | ||
8ccc31eb MS |
5943 | #ifdef __GNUC__ |
5944 | __inline | |
5945 | #endif | |
6b5fbb55 | 5946 | tree |
c2a37c55 | 5947 | auto_function (name, type) |
8ccc31eb | 5948 | tree name, type; |
8ccc31eb MS |
5949 | { |
5950 | return define_function | |
c2a37c55 | 5951 | (IDENTIFIER_POINTER (name), type, push_overloaded_decl_1, |
8ccc31eb MS |
5952 | IDENTIFIER_POINTER (build_decl_overload (name, TYPE_ARG_TYPES (type), |
5953 | 0))); | |
5954 | } | |
5955 | ||
8d08fdba MS |
5956 | /* Create the predefined scalar types of C, |
5957 | and some nodes representing standard constants (0, 1, (void *)0). | |
5958 | Initialize the global binding level. | |
5959 | Make definitions for built-in primitive functions. */ | |
5960 | ||
5961 | void | |
5962 | init_decl_processing () | |
5963 | { | |
8d08fdba | 5964 | tree fields[20]; |
8d08fdba | 5965 | int wchar_type_size; |
8d08fdba MS |
5966 | tree array_domain_type; |
5967 | ||
5968 | /* Have to make these distinct before we try using them. */ | |
5969 | lang_name_cplusplus = get_identifier ("C++"); | |
5970 | lang_name_c = get_identifier ("C"); | |
a1774733 | 5971 | lang_name_java = get_identifier ("Java"); |
8d08fdba | 5972 | |
99dccabc MM |
5973 | /* Let the back-end now how to save and restore language-specific |
5974 | per-function globals. */ | |
a8f73d4b MM |
5975 | init_lang_status = &push_cp_function_context; |
5976 | free_lang_status = &pop_cp_function_context; | |
b4b8bee7 | 5977 | mark_lang_status = &mark_cp_function_context; |
99dccabc | 5978 | |
fc6af6e3 RH |
5979 | cp_parse_init (); |
5980 | init_decl2 (); | |
9cd64686 | 5981 | init_pt (); |
fc6af6e3 | 5982 | |
9cd64686 MM |
5983 | /* Create the global variables. */ |
5984 | push_to_top_level (); | |
8012c983 | 5985 | |
2c73f9f5 | 5986 | /* Enter the global namespace. */ |
30394414 | 5987 | my_friendly_assert (global_namespace == NULL_TREE, 375); |
30394414 JM |
5988 | push_namespace (get_identifier ("::")); |
5989 | global_namespace = current_namespace; | |
5990 | current_lang_name = NULL_TREE; | |
5991 | ||
e1cd6e56 | 5992 | if (flag_strict_prototype == 2) |
830fcda8 | 5993 | flag_strict_prototype = pedantic; |
2642b9bf JM |
5994 | if (! flag_permissive && ! pedantic) |
5995 | flag_pedantic_errors = 1; | |
830fcda8 JM |
5996 | |
5997 | strict_prototypes_lang_c = flag_strict_prototype; | |
8926095f | 5998 | |
8d08fdba MS |
5999 | /* Initially, C. */ |
6000 | current_lang_name = lang_name_c; | |
6001 | ||
6002 | current_function_decl = NULL_TREE; | |
8d08fdba MS |
6003 | current_binding_level = NULL_BINDING_LEVEL; |
6004 | free_binding_level = NULL_BINDING_LEVEL; | |
6005 | ||
6006 | /* Because most segmentation signals can be traced back into user | |
6007 | code, catch them and at least give the user a chance of working | |
e92cc029 | 6008 | around compiler bugs. */ |
8d08fdba MS |
6009 | signal (SIGSEGV, signal_catch); |
6010 | ||
6011 | /* We will also catch aborts in the back-end through signal_catch and | |
6012 | give the user a chance to see where the error might be, and to defeat | |
6013 | aborts in the back-end when there have been errors previously in their | |
e92cc029 | 6014 | code. */ |
8d08fdba MS |
6015 | #ifdef SIGIOT |
6016 | signal (SIGIOT, signal_catch); | |
6017 | #endif | |
6018 | #ifdef SIGILL | |
6019 | signal (SIGILL, signal_catch); | |
6020 | #endif | |
6021 | #ifdef SIGABRT | |
6022 | signal (SIGABRT, signal_catch); | |
6023 | #endif | |
6024 | #ifdef SIGBUS | |
6025 | signal (SIGBUS, signal_catch); | |
6026 | #endif | |
6027 | ||
6028 | gcc_obstack_init (&decl_obstack); | |
8d08fdba | 6029 | |
81b3411c BS |
6030 | build_common_tree_nodes (flag_signed_char); |
6031 | ||
8d08fdba MS |
6032 | error_mark_list = build_tree_list (error_mark_node, error_mark_node); |
6033 | TREE_TYPE (error_mark_list) = error_mark_node; | |
6034 | ||
a28e3c7f MS |
6035 | /* Make the binding_level structure for global names. */ |
6036 | pushlevel (0); | |
8d08fdba | 6037 | global_binding_level = current_binding_level; |
2c73f9f5 ML |
6038 | /* The global level is the namespace level of ::. */ |
6039 | NAMESPACE_LEVEL (global_namespace) = global_binding_level; | |
6040 | declare_namespace_level (); | |
8d08fdba MS |
6041 | |
6042 | this_identifier = get_identifier (THIS_NAME); | |
6043 | in_charge_identifier = get_identifier (IN_CHARGE_NAME); | |
fc378698 MS |
6044 | ctor_identifier = get_identifier (CTOR_NAME); |
6045 | dtor_identifier = get_identifier (DTOR_NAME); | |
8d08fdba MS |
6046 | pfn_identifier = get_identifier (VTABLE_PFN_NAME); |
6047 | index_identifier = get_identifier (VTABLE_INDEX_NAME); | |
6048 | delta_identifier = get_identifier (VTABLE_DELTA_NAME); | |
6049 | delta2_identifier = get_identifier (VTABLE_DELTA2_NAME); | |
6050 | pfn_or_delta2_identifier = get_identifier ("__pfn_or_delta2"); | |
6051 | ||
6052 | /* Define `int' and `char' first so that dbx will output them first. */ | |
8d08fdba | 6053 | record_builtin_type (RID_INT, NULL_PTR, integer_type_node); |
8d08fdba MS |
6054 | record_builtin_type (RID_CHAR, "char", char_type_node); |
6055 | ||
45075bf3 NS |
6056 | /* `signed' is the same as `int' */ |
6057 | record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node); | |
8d08fdba | 6058 | record_builtin_type (RID_LONG, "long int", long_integer_type_node); |
8d08fdba | 6059 | record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node); |
8d08fdba MS |
6060 | record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node); |
6061 | record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node); | |
8d08fdba | 6062 | record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node); |
8d08fdba MS |
6063 | record_builtin_type (RID_MAX, "long long unsigned int", |
6064 | long_long_unsigned_type_node); | |
6065 | record_builtin_type (RID_MAX, "long long unsigned", | |
6066 | long_long_unsigned_type_node); | |
5156628f | 6067 | record_builtin_type (RID_SHORT, "short int", short_integer_type_node); |
5156628f MS |
6068 | record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node); |
6069 | record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node); | |
6070 | ||
8d08fdba MS |
6071 | ptrdiff_type_node |
6072 | = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE))); | |
6073 | ||
8d08fdba | 6074 | /* Define both `signed char' and `unsigned char'. */ |
8d08fdba | 6075 | record_builtin_type (RID_MAX, "signed char", signed_char_type_node); |
8d08fdba MS |
6076 | record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node); |
6077 | ||
81b3411c BS |
6078 | /* `unsigned long' is the standard type for sizeof. |
6079 | Note that stddef.h uses `unsigned long', | |
6080 | and this must agree, even if long and int are the same size. */ | |
6081 | set_sizetype | |
6082 | (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE)))); | |
6083 | ||
835f9b4d GRK |
6084 | /* Create the widest literal types. */ |
6085 | widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2); | |
6086 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
6087 | widest_integer_literal_type_node)); | |
6088 | ||
6089 | widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2); | |
6090 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, | |
6091 | widest_unsigned_literal_type_node)); | |
6092 | ||
8d08fdba | 6093 | /* These are types that type_for_size and type_for_mode use. */ |
8d08fdba | 6094 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node)); |
8d08fdba | 6095 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node)); |
8d08fdba | 6096 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node)); |
8d08fdba | 6097 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node)); |
946dc1c8 | 6098 | #if HOST_BITS_PER_WIDE_INT >= 64 |
5ebcdddb | 6099 | pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node)); |
946dc1c8 | 6100 | #endif |
8d08fdba | 6101 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node)); |
8d08fdba | 6102 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node)); |
8d08fdba | 6103 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node)); |
8d08fdba | 6104 | pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node)); |
946dc1c8 | 6105 | #if HOST_BITS_PER_WIDE_INT >= 64 |
5ebcdddb | 6106 | pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node)); |
946dc1c8 | 6107 | #endif |
8d08fdba | 6108 | |
81b3411c | 6109 | build_common_tree_nodes_2 (flag_short_double); |
37c46b43 | 6110 | |
eff71ab0 PB |
6111 | java_byte_type_node = record_builtin_java_type ("__java_byte", 8); |
6112 | java_short_type_node = record_builtin_java_type ("__java_short", 16); | |
6113 | java_int_type_node = record_builtin_java_type ("__java_int", 32); | |
6114 | java_long_type_node = record_builtin_java_type ("__java_long", 64); | |
6115 | java_float_type_node = record_builtin_java_type ("__java_float", -32); | |
6116 | java_double_type_node = record_builtin_java_type ("__java_double", -64); | |
6117 | java_char_type_node = record_builtin_java_type ("__java_char", -16); | |
6118 | java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1); | |
6119 | ||
8d08fdba MS |
6120 | integer_two_node = build_int_2 (2, 0); |
6121 | TREE_TYPE (integer_two_node) = integer_type_node; | |
6122 | integer_three_node = build_int_2 (3, 0); | |
6123 | TREE_TYPE (integer_three_node) = integer_type_node; | |
8d08fdba | 6124 | |
255512c1 JM |
6125 | boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE); |
6126 | TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE); | |
c1ea6a0b BK |
6127 | TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0); |
6128 | TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node; | |
6129 | TYPE_PRECISION (boolean_type_node) = 1; | |
255512c1 JM |
6130 | record_builtin_type (RID_BOOL, "bool", boolean_type_node); |
6131 | boolean_false_node = build_int_2 (0, 0); | |
6132 | TREE_TYPE (boolean_false_node) = boolean_type_node; | |
6133 | boolean_true_node = build_int_2 (1, 0); | |
6134 | TREE_TYPE (boolean_true_node) = boolean_type_node; | |
2986ae00 | 6135 | |
81b3411c BS |
6136 | signed_size_zero_node = build_int_2 (0, 0); record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node); |
6137 | record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node); | |
6138 | record_builtin_type (RID_MAX, "long double", long_double_type_node); | |
6139 | ||
6140 | pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"), | |
6141 | complex_integer_type_node)); | |
6142 | pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"), | |
6143 | complex_float_type_node)); | |
6144 | pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"), | |
6145 | complex_double_type_node)); | |
6146 | pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"), | |
6147 | complex_long_double_type_node)); | |
8d08fdba | 6148 | |
e92cc029 MS |
6149 | TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype)); |
6150 | ||
8d08fdba | 6151 | record_builtin_type (RID_VOID, NULL_PTR, void_type_node); |
8d08fdba MS |
6152 | void_list_node = build_tree_list (NULL_TREE, void_type_node); |
6153 | TREE_PARMLIST (void_list_node) = 1; | |
6154 | ||
8d08fdba MS |
6155 | /* Used for expressions that do nothing, but are not errors. */ |
6156 | void_zero_node = build_int_2 (0, 0); | |
6157 | TREE_TYPE (void_zero_node) = void_type_node; | |
6158 | ||
6159 | string_type_node = build_pointer_type (char_type_node); | |
beb53fb8 | 6160 | const_string_type_node |
91063b51 MM |
6161 | = build_pointer_type (build_qualified_type (char_type_node, |
6162 | TYPE_QUAL_CONST)); | |
4cc1d462 | 6163 | empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE); |
6b5fbb55 | 6164 | #if 0 |
8d08fdba | 6165 | record_builtin_type (RID_MAX, NULL_PTR, string_type_node); |
6b5fbb55 | 6166 | #endif |
8d08fdba MS |
6167 | |
6168 | /* Make a type to be the domain of a few array types | |
6169 | whose domains don't really matter. | |
6170 | 200 is small enough that it always fits in size_t | |
6171 | and large enough that it can hold most function names for the | |
6172 | initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */ | |
6173 | array_domain_type = build_index_type (build_int_2 (200, 0)); | |
6174 | ||
2c73f9f5 | 6175 | /* Make a type for arrays of characters. |
8d08fdba MS |
6176 | With luck nothing will ever really depend on the length of this |
6177 | array type. */ | |
6178 | char_array_type_node | |
6179 | = build_array_type (char_type_node, array_domain_type); | |
6180 | /* Likewise for arrays of ints. */ | |
6181 | int_array_type_node | |
6182 | = build_array_type (integer_type_node, array_domain_type); | |
6183 | ||
6184 | /* This is just some anonymous class type. Nobody should ever | |
6185 | need to look inside this envelope. */ | |
6186 | class_star_type_node = build_pointer_type (make_lang_type (RECORD_TYPE)); | |
6187 | ||
7f4edbcb BS |
6188 | if (flag_huge_objects) |
6189 | delta_type_node = long_integer_type_node; | |
6190 | else | |
6191 | delta_type_node = short_integer_type_node; | |
6192 | ||
8d08fdba MS |
6193 | default_function_type |
6194 | = build_function_type (integer_type_node, NULL_TREE); | |
8d08fdba MS |
6195 | |
6196 | ptr_type_node = build_pointer_type (void_type_node); | |
beb53fb8 | 6197 | const_ptr_type_node |
91063b51 | 6198 | = build_pointer_type (build_qualified_type (void_type_node, |
7f4edbcb BS |
6199 | TYPE_QUAL_CONST)); |
6200 | c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin); | |
6201 | ||
824b9a4c | 6202 | void_ftype_ptr |
4cc1d462 | 6203 | = build_exception_variant (void_ftype_ptr, empty_except_spec); |
8d08fdba | 6204 | |
8d08fdba MS |
6205 | /* C++ extensions */ |
6206 | ||
6207 | unknown_type_node = make_node (UNKNOWN_TYPE); | |
036407f7 ML |
6208 | record_unknown_type (unknown_type_node, "unknown type"); |
6209 | ||
8d08fdba MS |
6210 | /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */ |
6211 | TREE_TYPE (unknown_type_node) = unknown_type_node; | |
a6967cc0 | 6212 | |
03d0f4af | 6213 | TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0); |
a6967cc0 JM |
6214 | |
6215 | /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same | |
6216 | result. */ | |
8d08fdba MS |
6217 | TYPE_POINTER_TO (unknown_type_node) = unknown_type_node; |
6218 | TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node; | |
6219 | ||
e92cc029 | 6220 | /* This is special for C++ so functions can be overloaded. */ |
8d08fdba MS |
6221 | wchar_type_node |
6222 | = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE))); | |
6223 | wchar_type_size = TYPE_PRECISION (wchar_type_node); | |
6224 | signed_wchar_type_node = make_signed_type (wchar_type_size); | |
6225 | unsigned_wchar_type_node = make_unsigned_type (wchar_type_size); | |
6226 | wchar_type_node | |
6227 | = TREE_UNSIGNED (wchar_type_node) | |
6228 | ? unsigned_wchar_type_node | |
6229 | : signed_wchar_type_node; | |
6230 | record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node); | |
6231 | ||
f376e137 MS |
6232 | /* Artificial declaration of wchar_t -- can be bashed */ |
6233 | wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"), | |
6234 | wchar_type_node); | |
6235 | pushdecl (wchar_decl_node); | |
6236 | ||
8d08fdba MS |
6237 | /* This is for wide string constants. */ |
6238 | wchar_array_type_node | |
6239 | = build_array_type (wchar_type_node, array_domain_type); | |
6240 | ||
8926095f | 6241 | if (flag_vtable_thunks) |
700f8a87 MS |
6242 | { |
6243 | /* Make sure we get a unique function type, so we can give | |
6244 | its pointer type a name. (This wins for gdb.) */ | |
6245 | tree vfunc_type = make_node (FUNCTION_TYPE); | |
6246 | TREE_TYPE (vfunc_type) = integer_type_node; | |
6247 | TYPE_ARG_TYPES (vfunc_type) = NULL_TREE; | |
6248 | layout_type (vfunc_type); | |
6249 | ||
6250 | vtable_entry_type = build_pointer_type (vfunc_type); | |
6251 | } | |
8926095f | 6252 | else |
700f8a87 MS |
6253 | { |
6254 | vtable_entry_type = make_lang_type (RECORD_TYPE); | |
4ce3d537 MM |
6255 | fields[0] = build_lang_decl (FIELD_DECL, delta_identifier, |
6256 | delta_type_node); | |
6257 | fields[1] = build_lang_decl (FIELD_DECL, index_identifier, | |
6258 | delta_type_node); | |
6259 | fields[2] = build_lang_decl (FIELD_DECL, pfn_identifier, | |
6260 | ptr_type_node); | |
700f8a87 MS |
6261 | finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2, |
6262 | double_type_node); | |
6263 | ||
6264 | /* Make this part of an invisible union. */ | |
6265 | fields[3] = copy_node (fields[2]); | |
6266 | TREE_TYPE (fields[3]) = delta_type_node; | |
6267 | DECL_NAME (fields[3]) = delta2_identifier; | |
6268 | DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node); | |
6269 | DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node); | |
6270 | TREE_UNSIGNED (fields[3]) = 0; | |
6271 | TREE_CHAIN (fields[2]) = fields[3]; | |
91063b51 MM |
6272 | vtable_entry_type = build_qualified_type (vtable_entry_type, |
6273 | TYPE_QUAL_CONST); | |
700f8a87 MS |
6274 | } |
6275 | record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type); | |
8d08fdba | 6276 | |
8d08fdba | 6277 | vtbl_type_node |
52bf7d5d | 6278 | = build_cplus_array_type (vtable_entry_type, NULL_TREE); |
8d08fdba | 6279 | layout_type (vtbl_type_node); |
91063b51 | 6280 | vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST); |
8d08fdba | 6281 | record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node); |
849da744 MM |
6282 | vtbl_ptr_type_node = build_pointer_type (vtable_entry_type); |
6283 | layout_type (vtbl_ptr_type_node); | |
6284 | record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node); | |
8d08fdba | 6285 | |
2c73f9f5 ML |
6286 | std_node = build_decl (NAMESPACE_DECL, |
6287 | get_identifier (flag_honor_std ? "fake std":"std"), | |
6633d636 MS |
6288 | void_type_node); |
6289 | pushdecl (std_node); | |
6290 | ||
2c73f9f5 | 6291 | global_type_node = make_node (LANG_TYPE); |
036407f7 | 6292 | record_unknown_type (global_type_node, "global type"); |
2c73f9f5 | 6293 | |
db5ae43f MS |
6294 | /* Now, C++. */ |
6295 | current_lang_name = lang_name_cplusplus; | |
8d08fdba | 6296 | |
ced78d8b | 6297 | { |
2c73f9f5 ML |
6298 | tree bad_alloc_type_node, newtype, deltype; |
6299 | if (flag_honor_std) | |
6300 | push_namespace (get_identifier ("std")); | |
6301 | bad_alloc_type_node = xref_tag | |
ca107ded | 6302 | (class_type_node, get_identifier ("bad_alloc"), 1); |
2c73f9f5 ML |
6303 | if (flag_honor_std) |
6304 | pop_namespace (); | |
6305 | newtype = build_exception_variant | |
4cc1d462 NS |
6306 | (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1)); |
6307 | deltype = build_exception_variant (void_ftype_ptr, empty_except_spec); | |
c2a37c55 BS |
6308 | auto_function (ansi_opname[(int) NEW_EXPR], newtype); |
6309 | auto_function (ansi_opname[(int) VEC_NEW_EXPR], newtype); | |
6310 | global_delete_fndecl = auto_function (ansi_opname[(int) DELETE_EXPR], | |
6311 | deltype); | |
6312 | auto_function (ansi_opname[(int) VEC_DELETE_EXPR], deltype); | |
ced78d8b | 6313 | } |
8d08fdba MS |
6314 | |
6315 | abort_fndecl | |
c2a37c55 | 6316 | = define_function ("__pure_virtual", void_ftype, 0, 0); |
8d08fdba | 6317 | |
8d08fdba MS |
6318 | /* Perform other language dependent initializations. */ |
6319 | init_class_processing (); | |
6320 | init_init_processing (); | |
6321 | init_search_processing (); | |
1737fe20 BK |
6322 | if (flag_rtti) |
6323 | init_rtti_processing (); | |
8d08fdba | 6324 | |
6467930b | 6325 | if (flag_exceptions) |
8d2733ca | 6326 | init_exception_processing (); |
8d08fdba MS |
6327 | if (flag_no_inline) |
6328 | { | |
6329 | flag_inline_functions = 0; | |
8d08fdba | 6330 | } |
9e9ff709 | 6331 | |
7fcdf4c2 | 6332 | if (! supports_one_only ()) |
72b7eeff | 6333 | flag_weak = 0; |
8d08fdba MS |
6334 | |
6335 | /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */ | |
6336 | declare_function_name (); | |
6337 | ||
6338 | /* Prepare to check format strings against argument lists. */ | |
6339 | init_function_format_info (); | |
e9a25f70 JL |
6340 | |
6341 | /* Show we use EH for cleanups. */ | |
6342 | using_eh_for_cleanups (); | |
62c154ed JM |
6343 | |
6344 | print_error_function = lang_print_error_function; | |
501ba25a | 6345 | lang_get_alias_set = &c_get_alias_set; |
e5dc5fb2 | 6346 | valid_lang_attribute = cp_valid_lang_attribute; |
d9cf7c82 JM |
6347 | |
6348 | /* Maintain consistency. Perhaps we should just complain if they | |
6349 | say -fwritable-strings? */ | |
6350 | if (flag_writable_strings) | |
6351 | flag_const_strings = 0; | |
fc6af6e3 RH |
6352 | |
6353 | /* Add GC roots for all of our global variables. */ | |
6354 | ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree)); | |
6355 | ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree)); | |
fc6af6e3 RH |
6356 | ggc_add_tree_root (&integer_three_node, 1); |
6357 | ggc_add_tree_root (&integer_two_node, 1); | |
fc6af6e3 | 6358 | ggc_add_tree_root (&signed_size_zero_node, 1); |
fc6af6e3 RH |
6359 | ggc_add_tree_root (&size_one_node, 1); |
6360 | ggc_add_tree_root (&size_zero_node, 1); | |
fc6af6e3 RH |
6361 | ggc_add_root (&global_binding_level, 1, sizeof global_binding_level, |
6362 | mark_binding_level); | |
9cd64686 | 6363 | ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope); |
fc6af6e3 RH |
6364 | ggc_add_tree_root (&static_ctors, 1); |
6365 | ggc_add_tree_root (&static_dtors, 1); | |
9cd64686 | 6366 | ggc_add_tree_root (&lastiddecl, 1); |
fc6af6e3 RH |
6367 | |
6368 | ggc_add_tree_root (&enum_next_value, 1); | |
fc6af6e3 RH |
6369 | ggc_add_tree_root (&last_function_parm_tags, 1); |
6370 | ggc_add_tree_root (¤t_function_return_value, 1); | |
6371 | ggc_add_tree_root (¤t_function_parms, 1); | |
6372 | ggc_add_tree_root (¤t_function_parm_tags, 1); | |
9cd64686 | 6373 | ggc_add_tree_root (&last_function_parms, 1); |
fc6af6e3 | 6374 | ggc_add_tree_root (&error_mark_list, 1); |
9cd64686 | 6375 | |
fc6af6e3 | 6376 | ggc_add_tree_root (&global_namespace, 1); |
fc6af6e3 RH |
6377 | ggc_add_tree_root (&global_type_node, 1); |
6378 | ggc_add_tree_root (&anonymous_namespace_name, 1); | |
9cd64686 MM |
6379 | |
6380 | ggc_add_tree_root (&got_object, 1); | |
6381 | ggc_add_tree_root (&got_scope, 1); | |
6382 | ||
6383 | ggc_add_tree_root (¤t_lang_name, 1); | |
6384 | ggc_add_tree_root (&static_aggregates, 1); | |
62c154ed JM |
6385 | } |
6386 | ||
6387 | /* Function to print any language-specific context for an error message. */ | |
6388 | ||
6389 | static void | |
6390 | lang_print_error_function (file) | |
8df4696d | 6391 | const char *file; |
62c154ed JM |
6392 | { |
6393 | default_print_error_function (file); | |
6394 | maybe_print_template_context (); | |
8d08fdba MS |
6395 | } |
6396 | ||
6397 | /* Make a definition for a builtin function named NAME and whose data type | |
6398 | is TYPE. TYPE should be a function type with argument types. | |
8d08fdba MS |
6399 | |
6400 | If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME, | |
6401 | the name to be called if we can't opencode the function. */ | |
6402 | ||
6403 | tree | |
c2a37c55 | 6404 | define_function (name, type, pfn, library_name) |
d8e178a0 | 6405 | const char *name; |
8d08fdba | 6406 | tree type; |
49c249e1 | 6407 | void (*pfn) PROTO((tree)); |
d8e178a0 | 6408 | const char *library_name; |
8d08fdba MS |
6409 | { |
6410 | tree decl = build_lang_decl (FUNCTION_DECL, get_identifier (name), type); | |
6411 | DECL_EXTERNAL (decl) = 1; | |
6412 | TREE_PUBLIC (decl) = 1; | |
863adfc0 | 6413 | DECL_ARTIFICIAL (decl) = 1; |
8d08fdba | 6414 | |
2c73f9f5 | 6415 | my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392); |
cb0dbb9a | 6416 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 6417 | |
8d08fdba MS |
6418 | /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME, |
6419 | we cannot change DECL_ASSEMBLER_NAME until we have installed this | |
6420 | function in the namespace. */ | |
6421 | if (pfn) (*pfn) (decl); | |
6422 | if (library_name) | |
6423 | DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name); | |
6424 | make_function_rtl (decl); | |
8d08fdba MS |
6425 | return decl; |
6426 | } | |
7f4edbcb | 6427 | |
c2a37c55 BS |
6428 | |
6429 | /* Wrapper around define_function, for the benefit of | |
6430 | c_common_nodes_and_builtins. | |
6431 | FUNCTION_CODE tells later passes how to compile calls to this function. | |
6432 | See tree.h for its possible values. */ | |
6433 | ||
7f4edbcb BS |
6434 | tree |
6435 | builtin_function (name, type, code, libname) | |
6436 | const char *name; | |
6437 | tree type; | |
6438 | enum built_in_function code; | |
6439 | const char *libname; | |
6440 | { | |
c2a37c55 BS |
6441 | tree decl = define_function (name, type, (void (*) PROTO((tree)))pushdecl, |
6442 | libname); | |
6443 | if (code != NOT_BUILT_IN) | |
6444 | { | |
6445 | DECL_BUILT_IN (decl) = 1; | |
6446 | DECL_FUNCTION_CODE (decl) = code; | |
6447 | } | |
6448 | return decl; | |
7f4edbcb | 6449 | } |
8d08fdba | 6450 | \f |
61a127b3 MM |
6451 | /* When we call finish_struct for an anonymous union, we create |
6452 | default copy constructors and such. But, an anonymous union | |
6453 | shouldn't have such things; this function undoes the damage to the | |
6454 | anonymous union type T. | |
6455 | ||
6456 | (The reason that we create the synthesized methods is that we don't | |
6457 | distinguish `union { int i; }' from `typedef union { int i; } U'. | |
6458 | The first is an anonymous union; the second is just an ordinary | |
6459 | union type.) */ | |
6460 | ||
6461 | void | |
6bdb8141 | 6462 | fixup_anonymous_aggr (t) |
61a127b3 MM |
6463 | tree t; |
6464 | { | |
6465 | tree *q; | |
6466 | ||
6467 | /* Wipe out memory of synthesized methods */ | |
6468 | TYPE_HAS_CONSTRUCTOR (t) = 0; | |
6469 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0; | |
6470 | TYPE_HAS_INIT_REF (t) = 0; | |
6471 | TYPE_HAS_CONST_INIT_REF (t) = 0; | |
6472 | TYPE_HAS_ASSIGN_REF (t) = 0; | |
61a127b3 MM |
6473 | TYPE_HAS_CONST_ASSIGN_REF (t) = 0; |
6474 | ||
6475 | /* Splice the implicitly generated functions out of the TYPE_METHODS | |
6476 | list. */ | |
6477 | q = &TYPE_METHODS (t); | |
6478 | while (*q) | |
6479 | { | |
6480 | if (DECL_ARTIFICIAL (*q)) | |
6481 | *q = TREE_CHAIN (*q); | |
6482 | else | |
6483 | q = &TREE_CHAIN (*q); | |
6484 | } | |
6485 | ||
6486 | /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have | |
6487 | function members. */ | |
6488 | if (TYPE_METHODS (t)) | |
6489 | error ("an anonymous union cannot have function members"); | |
6490 | } | |
6491 | ||
72a93143 JM |
6492 | /* Make sure that a declaration with no declarator is well-formed, i.e. |
6493 | just defines a tagged type or anonymous union. | |
8d08fdba | 6494 | |
72a93143 | 6495 | Returns the type defined, if any. */ |
8d08fdba | 6496 | |
72a93143 JM |
6497 | tree |
6498 | check_tag_decl (declspecs) | |
8d08fdba MS |
6499 | tree declspecs; |
6500 | { | |
72a93143 | 6501 | int found_type = 0; |
2986ae00 | 6502 | tree ob_modifier = NULL_TREE; |
8d08fdba | 6503 | register tree link; |
8d08fdba MS |
6504 | register tree t = NULL_TREE; |
6505 | ||
6506 | for (link = declspecs; link; link = TREE_CHAIN (link)) | |
6507 | { | |
6508 | register tree value = TREE_VALUE (link); | |
6509 | ||
72a93143 | 6510 | if (TYPE_P (value)) |
8d08fdba | 6511 | { |
72a93143 | 6512 | ++found_type; |
5566b478 | 6513 | |
72a93143 JM |
6514 | if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE) |
6515 | { | |
6516 | my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261); | |
6517 | t = value; | |
6518 | } | |
8d08fdba | 6519 | } |
83f660b7 JM |
6520 | else if (value == ridpointers[(int) RID_FRIEND]) |
6521 | { | |
83f660b7 JM |
6522 | if (current_class_type == NULL_TREE |
6523 | || current_scope () != current_class_type) | |
6524 | ob_modifier = value; | |
6525 | } | |
8d08fdba | 6526 | else if (value == ridpointers[(int) RID_STATIC] |
2986ae00 MS |
6527 | || value == ridpointers[(int) RID_EXTERN] |
6528 | || value == ridpointers[(int) RID_AUTO] | |
28cbf42c MS |
6529 | || value == ridpointers[(int) RID_REGISTER] |
6530 | || value == ridpointers[(int) RID_INLINE] | |
6531 | || value == ridpointers[(int) RID_VIRTUAL] | |
72a93143 JM |
6532 | || value == ridpointers[(int) RID_CONST] |
6533 | || value == ridpointers[(int) RID_VOLATILE] | |
28cbf42c | 6534 | || value == ridpointers[(int) RID_EXPLICIT]) |
2986ae00 | 6535 | ob_modifier = value; |
8d08fdba MS |
6536 | } |
6537 | ||
72a93143 JM |
6538 | if (found_type > 1) |
6539 | error ("multiple types in one declaration"); | |
7e2067ca JM |
6540 | |
6541 | /* Inside a class, we might be in a friend or access declaration. | |
6542 | Until we have a good way of detecting the latter, don't warn. */ | |
6543 | if (t == NULL_TREE && ! current_class_type) | |
6544 | pedwarn ("declaration does not declare anything"); | |
0dd3962d JM |
6545 | |
6546 | /* Check for an anonymous union. We're careful | |
6547 | accessing TYPE_IDENTIFIER because some built-in types, like | |
6548 | pointer-to-member types, do not have TYPE_NAME. */ | |
6bdb8141 | 6549 | else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t)) |
0dd3962d JM |
6550 | && TYPE_NAME (t) |
6551 | && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) | |
6552 | { | |
6553 | /* Anonymous unions are objects, so they can have specifiers. */; | |
6bdb8141 JM |
6554 | SET_ANON_AGGR_TYPE_P (t); |
6555 | ||
6556 | if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header) | |
6557 | pedwarn ("ISO C++ prohibits anonymous structs"); | |
0dd3962d JM |
6558 | } |
6559 | ||
83f660b7 | 6560 | else if (ob_modifier) |
8d08fdba | 6561 | { |
83f660b7 JM |
6562 | if (ob_modifier == ridpointers[(int) RID_INLINE] |
6563 | || ob_modifier == ridpointers[(int) RID_VIRTUAL]) | |
6564 | cp_error ("`%D' can only be specified for functions", ob_modifier); | |
6565 | else if (ob_modifier == ridpointers[(int) RID_FRIEND]) | |
6566 | cp_error ("`%D' can only be specified inside a class", ob_modifier); | |
6567 | else if (ob_modifier == ridpointers[(int) RID_EXPLICIT]) | |
6568 | cp_error ("`%D' can only be specified for constructors", | |
6569 | ob_modifier); | |
6570 | else | |
6571 | cp_error ("`%D' can only be specified for objects and functions", | |
6572 | ob_modifier); | |
72a93143 | 6573 | } |
8d08fdba | 6574 | |
72a93143 JM |
6575 | return t; |
6576 | } | |
6577 | ||
6578 | /* Called when a declaration is seen that contains no names to declare. | |
6579 | If its type is a reference to a structure, union or enum inherited | |
6580 | from a containing scope, shadow that tag name for the current scope | |
6581 | with a forward reference. | |
6582 | If its type defines a new named structure or union | |
6583 | or defines an enum, it is valid but we need not do anything here. | |
6584 | Otherwise, it is an error. | |
6585 | ||
6586 | C++: may have to grok the declspecs to learn about static, | |
6587 | complain for anonymous unions. */ | |
6588 | ||
6589 | void | |
6590 | shadow_tag (declspecs) | |
6591 | tree declspecs; | |
6592 | { | |
6593 | tree t = check_tag_decl (declspecs); | |
6594 | ||
6595 | if (t) | |
6596 | maybe_process_partial_specialization (t); | |
6597 | ||
6598 | /* This is where the variables in an anonymous union are | |
6599 | declared. An anonymous union declaration looks like: | |
6600 | union { ... } ; | |
6601 | because there is no declarator after the union, the parser | |
6602 | sends that declaration here. */ | |
6bdb8141 | 6603 | if (t && ANON_AGGR_TYPE_P (t)) |
72a93143 | 6604 | { |
6bdb8141 | 6605 | fixup_anonymous_aggr (t); |
72a93143 JM |
6606 | |
6607 | if (TYPE_FIELDS (t)) | |
6608 | { | |
6609 | tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0, | |
6610 | NULL_TREE); | |
6611 | finish_anon_union (decl); | |
6612 | } | |
8d08fdba MS |
6613 | } |
6614 | } | |
6615 | \f | |
6616 | /* Decode a "typename", such as "int **", returning a ..._TYPE node. */ | |
6617 | ||
6618 | tree | |
6619 | groktypename (typename) | |
6620 | tree typename; | |
6621 | { | |
6622 | if (TREE_CODE (typename) != TREE_LIST) | |
6623 | return typename; | |
6624 | return grokdeclarator (TREE_VALUE (typename), | |
6625 | TREE_PURPOSE (typename), | |
c11b6f21 | 6626 | TYPENAME, 0, NULL_TREE); |
8d08fdba MS |
6627 | } |
6628 | ||
6629 | /* Decode a declarator in an ordinary declaration or data definition. | |
6630 | This is called as soon as the type information and variable name | |
6631 | have been parsed, before parsing the initializer if any. | |
6632 | Here we create the ..._DECL node, fill in its type, | |
6633 | and put it on the list of decls for the current context. | |
6634 | The ..._DECL node is returned as the value. | |
6635 | ||
6636 | Exception: for arrays where the length is not specified, | |
82580166 | 6637 | the type is left null, to be filled in by `cp_finish_decl'. |
8d08fdba MS |
6638 | |
6639 | Function definitions do not come here; they go to start_function | |
6640 | instead. However, external and forward declarations of functions | |
6641 | do go through here. Structure field declarations are done by | |
6642 | grokfield and not through here. */ | |
6643 | ||
6644 | /* Set this to zero to debug not using the temporary obstack | |
6645 | to parse initializers. */ | |
6646 | int debug_temp_inits = 1; | |
6647 | ||
6648 | tree | |
a1774733 | 6649 | start_decl (declarator, declspecs, initialized, attributes, prefix_attributes) |
8d08fdba MS |
6650 | tree declarator, declspecs; |
6651 | int initialized; | |
a1774733 | 6652 | tree attributes, prefix_attributes; |
8d08fdba MS |
6653 | { |
6654 | register tree decl; | |
6655 | register tree type, tem; | |
6656 | tree context; | |
6657 | extern int have_extern_spec; | |
6658 | extern int used_extern_spec; | |
b17e2870 | 6659 | tree attrlist; |
8d08fdba | 6660 | |
5566b478 MS |
6661 | #if 0 |
6662 | /* See code below that used this. */ | |
8d08fdba | 6663 | int init_written = initialized; |
5566b478 | 6664 | #endif |
8d08fdba | 6665 | |
e92cc029 | 6666 | /* This should only be done once on the top most decl. */ |
8d08fdba MS |
6667 | if (have_extern_spec && !used_extern_spec) |
6668 | { | |
a28e3c7f MS |
6669 | declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), |
6670 | declspecs); | |
8d08fdba MS |
6671 | used_extern_spec = 1; |
6672 | } | |
6673 | ||
b17e2870 JM |
6674 | if (attributes || prefix_attributes) |
6675 | attrlist = build_scratch_list (attributes, prefix_attributes); | |
6676 | else | |
6677 | attrlist = NULL_TREE; | |
6678 | ||
c11b6f21 | 6679 | decl = grokdeclarator (declarator, declspecs, NORMAL, initialized, |
b17e2870 JM |
6680 | attrlist); |
6681 | ||
a1774733 | 6682 | if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE) |
8d08fdba MS |
6683 | return NULL_TREE; |
6684 | ||
6685 | type = TREE_TYPE (decl); | |
6686 | ||
44689c12 ML |
6687 | if (type == error_mark_node) |
6688 | return NULL_TREE; | |
6689 | ||
8d08fdba MS |
6690 | context |
6691 | = (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl)) | |
6692 | ? DECL_CLASS_CONTEXT (decl) | |
6693 | : DECL_CONTEXT (decl); | |
6694 | ||
9a68c51f JM |
6695 | if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL |
6696 | && context != current_namespace && TREE_CODE (decl) == VAR_DECL) | |
6697 | { | |
6698 | /* When parsing the initializer, lookup should use the object's | |
6699 | namespace. */ | |
6700 | push_decl_namespace (context); | |
6701 | } | |
6702 | ||
2c73f9f5 ML |
6703 | /* We are only interested in class contexts, later. */ |
6704 | if (context && TREE_CODE (context) == NAMESPACE_DECL) | |
6705 | context = NULL_TREE; | |
6706 | ||
8d08fdba MS |
6707 | if (initialized) |
6708 | /* Is it valid for this decl to have an initializer at all? | |
6709 | If not, set INITIALIZED to zero, which will indirectly | |
82580166 | 6710 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ |
8d08fdba MS |
6711 | switch (TREE_CODE (decl)) |
6712 | { | |
6713 | case TYPE_DECL: | |
6714 | /* typedef foo = bar means give foo the same type as bar. | |
82580166 | 6715 | We haven't parsed bar yet, so `cp_finish_decl' will fix that up. |
8d08fdba MS |
6716 | Any other case of an initialization in a TYPE_DECL is an error. */ |
6717 | if (pedantic || list_length (declspecs) > 1) | |
6718 | { | |
8251199e | 6719 | cp_error ("typedef `%D' is initialized", decl); |
8d08fdba MS |
6720 | initialized = 0; |
6721 | } | |
6722 | break; | |
6723 | ||
6724 | case FUNCTION_DECL: | |
8251199e | 6725 | cp_error ("function `%#D' is initialized like a variable", decl); |
8d08fdba MS |
6726 | initialized = 0; |
6727 | break; | |
6728 | ||
6729 | default: | |
3e41d13b | 6730 | break; |
8d08fdba MS |
6731 | } |
6732 | ||
8d08fdba MS |
6733 | if (initialized) |
6734 | { | |
a9aedbc2 | 6735 | if (! toplevel_bindings_p () |
8d08fdba | 6736 | && DECL_EXTERNAL (decl)) |
8251199e | 6737 | cp_warning ("declaration of `%#D' has `extern' and is initialized", |
8d08fdba MS |
6738 | decl); |
6739 | DECL_EXTERNAL (decl) = 0; | |
5566b478 | 6740 | if (toplevel_bindings_p ()) |
8d08fdba MS |
6741 | TREE_STATIC (decl) = 1; |
6742 | ||
6743 | /* Tell `pushdecl' this is an initialized decl | |
6744 | even though we don't yet have the initializer expression. | |
82580166 | 6745 | Also tell `cp_finish_decl' it may store the real initializer. */ |
8d08fdba MS |
6746 | DECL_INITIAL (decl) = error_mark_node; |
6747 | } | |
6748 | ||
fa20888b MK |
6749 | #ifdef SET_DEFAULT_DECL_ATTRIBUTES |
6750 | SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes); | |
6751 | #endif | |
6752 | ||
6753 | /* Set attributes here so if duplicate decl, will have proper attributes. */ | |
6754 | cplus_decl_attributes (decl, attributes, prefix_attributes); | |
6755 | ||
5566b478 | 6756 | if (context && TYPE_SIZE (complete_type (context)) != NULL_TREE) |
5b605f68 | 6757 | { |
6b400b21 | 6758 | push_nested_class (context, 2); |
e97e5263 | 6759 | |
5b605f68 MS |
6760 | if (TREE_CODE (decl) == VAR_DECL) |
6761 | { | |
6762 | tree field = lookup_field (context, DECL_NAME (decl), 0, 0); | |
6763 | if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL) | |
8251199e | 6764 | cp_error ("`%#D' is not a static member of `%#T'", decl, context); |
e349ee73 MS |
6765 | else |
6766 | { | |
6767 | if (DECL_CONTEXT (field) != context) | |
f2d773a2 | 6768 | { |
8251199e | 6769 | cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'", |
f2d773a2 JM |
6770 | DECL_CONTEXT (field), DECL_NAME (decl), |
6771 | context, DECL_NAME (decl)); | |
6772 | DECL_CONTEXT (decl) = DECL_CONTEXT (field); | |
6773 | } | |
75650646 MM |
6774 | /* Static data member are tricky; an in-class initialization |
6775 | still doesn't provide a definition, so the in-class | |
6776 | declaration will have DECL_EXTERNAL set, but will have an | |
6777 | initialization. Thus, duplicate_decls won't warn | |
6778 | about this situation, and so we check here. */ | |
6779 | if (DECL_INITIAL (decl) && DECL_INITIAL (field)) | |
8251199e | 6780 | cp_error ("duplicate initialization of %D", decl); |
e349ee73 MS |
6781 | if (duplicate_decls (decl, field)) |
6782 | decl = field; | |
6783 | } | |
5b605f68 | 6784 | } |
f30432d7 MS |
6785 | else |
6786 | { | |
5566b478 | 6787 | tree field = check_classfn (context, decl); |
f30432d7 MS |
6788 | if (field && duplicate_decls (decl, field)) |
6789 | decl = field; | |
6790 | } | |
6791 | ||
6792 | /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */ | |
dff3e828 BK |
6793 | DECL_IN_AGGR_P (decl) = 0; |
6794 | if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl)) | |
6795 | || CLASSTYPE_USE_TEMPLATE (context)) | |
84e6233f JM |
6796 | { |
6797 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
6798 | /* [temp.expl.spec] An explicit specialization of a static data | |
6799 | member of a template is a definition if the declaration | |
6800 | includes an initializer; otherwise, it is a declaration. | |
6801 | ||
6802 | We check for processing_specialization so this only applies | |
6803 | to the new specialization syntax. */ | |
6804 | if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization) | |
6805 | DECL_EXTERNAL (decl) = 1; | |
6806 | } | |
f30432d7 | 6807 | |
b7698cf0 | 6808 | if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl)) |
8251199e | 6809 | cp_pedwarn ("declaration of `%#D' outside of class is not definition", |
f30432d7 | 6810 | decl); |
5b605f68 MS |
6811 | } |
6812 | ||
9188c363 MM |
6813 | /* Enter this declaration into the symbol table. */ |
6814 | tem = maybe_push_decl (decl); | |
2ee887f2 | 6815 | |
5156628f | 6816 | if (processing_template_decl) |
5566b478 | 6817 | { |
9188c363 MM |
6818 | if (at_function_scope_p ()) |
6819 | push_permanent_obstack (); | |
9188c363 | 6820 | tem = push_template_decl (tem); |
9188c363 | 6821 | if (at_function_scope_p ()) |
24bef158 | 6822 | pop_obstacks (); |
5566b478 MS |
6823 | } |
6824 | ||
6825 | ||
2ee887f2 | 6826 | #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS) |
a3203465 | 6827 | /* Tell the back-end to use or not use .common as appropriate. If we say |
a50f0918 MS |
6828 | -fconserve-space, we want this to save .data space, at the expense of |
6829 | wrong semantics. If we say -fno-conserve-space, we want this to | |
6830 | produce errors about redefs; to do this we force variables into the | |
6831 | data segment. */ | |
a3203465 | 6832 | DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem); |
2ee887f2 | 6833 | #endif |
3a846e6e | 6834 | |
5156628f | 6835 | if (! processing_template_decl) |
5566b478 | 6836 | start_decl_1 (tem); |
8d08fdba | 6837 | |
5566b478 MS |
6838 | /* Corresponding pop_obstacks is done in `cp_finish_decl'. */ |
6839 | push_obstacks_nochange (); | |
8d08fdba | 6840 | |
8d08fdba MS |
6841 | return tem; |
6842 | } | |
6843 | ||
5566b478 MS |
6844 | void |
6845 | start_decl_1 (decl) | |
6846 | tree decl; | |
8d08fdba | 6847 | { |
5566b478 MS |
6848 | tree type = TREE_TYPE (decl); |
6849 | int initialized = (DECL_INITIAL (decl) != NULL_TREE); | |
8d08fdba | 6850 | |
44689c12 ML |
6851 | if (type == error_mark_node) |
6852 | return; | |
6853 | ||
5566b478 MS |
6854 | /* If this type of object needs a cleanup, and control may |
6855 | jump past it, make a new binding level so that it is cleaned | |
6856 | up only when it is initialized first. */ | |
6857 | if (TYPE_NEEDS_DESTRUCTOR (type) | |
6858 | && current_binding_level->more_cleanups_ok == 0) | |
6859 | pushlevel_temporary (1); | |
6860 | ||
6861 | if (initialized) | |
6862 | /* Is it valid for this decl to have an initializer at all? | |
6863 | If not, set INITIALIZED to zero, which will indirectly | |
6864 | tell `cp_finish_decl' to ignore the initializer once it is parsed. */ | |
8d08fdba | 6865 | { |
5566b478 MS |
6866 | /* Don't allow initializations for incomplete types except for |
6867 | arrays which might be completed by the initialization. */ | |
44689c12 | 6868 | if (TYPE_SIZE (complete_type (type)) != NULL_TREE) |
5566b478 MS |
6869 | ; /* A complete type is ok. */ |
6870 | else if (TREE_CODE (type) != ARRAY_TYPE) | |
8d08fdba | 6871 | { |
8251199e | 6872 | cp_error ("variable `%#D' has initializer but incomplete type", |
5566b478 MS |
6873 | decl); |
6874 | initialized = 0; | |
25eb19ff | 6875 | type = TREE_TYPE (decl) = error_mark_node; |
5566b478 MS |
6876 | } |
6877 | else if (TYPE_SIZE (complete_type (TREE_TYPE (type))) == NULL_TREE) | |
6878 | { | |
6879 | if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)) | |
8251199e | 6880 | cp_error ("elements of array `%#D' have incomplete type", decl); |
5566b478 MS |
6881 | /* else we already gave an error in start_decl. */ |
6882 | initialized = 0; | |
8d08fdba | 6883 | } |
8d08fdba MS |
6884 | } |
6885 | ||
5566b478 MS |
6886 | if (!initialized |
6887 | && TREE_CODE (decl) != TYPE_DECL | |
6888 | && TREE_CODE (decl) != TEMPLATE_DECL | |
6889 | && IS_AGGR_TYPE (type) && ! DECL_EXTERNAL (decl)) | |
8d08fdba | 6890 | { |
5156628f | 6891 | if ((! processing_template_decl || ! uses_template_parms (type)) |
7fcdf4c2 | 6892 | && TYPE_SIZE (complete_type (type)) == NULL_TREE) |
5566b478 | 6893 | { |
8251199e | 6894 | cp_error ("aggregate `%#D' has incomplete type and cannot be initialized", |
5566b478 MS |
6895 | decl); |
6896 | /* Change the type so that assemble_variable will give | |
6897 | DECL an rtl we can live with: (mem (const_int 0)). */ | |
25eb19ff | 6898 | type = TREE_TYPE (decl) = error_mark_node; |
5566b478 MS |
6899 | } |
6900 | else | |
6901 | { | |
6902 | /* If any base type in the hierarchy of TYPE needs a constructor, | |
6903 | then we set initialized to 1. This way any nodes which are | |
6904 | created for the purposes of initializing this aggregate | |
6905 | will live as long as it does. This is necessary for global | |
6906 | aggregates which do not have their initializers processed until | |
6907 | the end of the file. */ | |
6908 | initialized = TYPE_NEEDS_CONSTRUCTING (type); | |
6909 | } | |
6910 | } | |
6911 | ||
5566b478 MS |
6912 | if (! initialized) |
6913 | DECL_INITIAL (decl) = NULL_TREE; | |
6914 | } | |
6915 | ||
6916 | /* Handle initialization of references. | |
38e01259 | 6917 | These three arguments are from `cp_finish_decl', and have the |
e92cc029 MS |
6918 | same meaning here that they do there. |
6919 | ||
6920 | Quotes on semantics can be found in ARM 8.4.3. */ | |
6921 | ||
5566b478 | 6922 | static void |
a703fb38 | 6923 | grok_reference_init (decl, type, init) |
5566b478 | 6924 | tree decl, type, init; |
5566b478 MS |
6925 | { |
6926 | tree tmp; | |
6927 | ||
6928 | if (init == NULL_TREE) | |
6929 | { | |
6930 | if ((DECL_LANG_SPECIFIC (decl) == 0 | |
6931 | || DECL_IN_AGGR_P (decl) == 0) | |
6932 | && ! DECL_THIS_EXTERN (decl)) | |
ed5511d9 | 6933 | cp_error ("`%D' declared as reference but not initialized", decl); |
5566b478 MS |
6934 | return; |
6935 | } | |
6936 | ||
6937 | if (init == error_mark_node) | |
6938 | return; | |
6939 | ||
ed5511d9 | 6940 | if (TREE_CODE (init) == CONSTRUCTOR) |
5566b478 | 6941 | { |
8251199e | 6942 | cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl); |
8d08fdba MS |
6943 | return; |
6944 | } | |
6945 | ||
6946 | if (TREE_CODE (init) == TREE_LIST) | |
6947 | init = build_compound_expr (init); | |
8d08fdba | 6948 | |
8ccc31eb MS |
6949 | if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE) |
6950 | init = convert_from_reference (init); | |
6951 | ||
8d08fdba MS |
6952 | if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE |
6953 | && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE) | |
6954 | { | |
a3203465 | 6955 | /* Note: default conversion is only called in very special cases. */ |
8d08fdba MS |
6956 | init = default_conversion (init); |
6957 | } | |
24bef158 MM |
6958 | |
6959 | /* Convert INIT to the reference type TYPE. This may involve the | |
6960 | creation of a temporary, whose lifetime must be the same as that | |
6961 | of the reference. If so, a DECL_STMT for the temporary will be | |
6962 | added just after the DECL_STMT for DECL. That's why we don't set | |
6963 | DECL_INITIAL for local references (instead assigning to them | |
6964 | explicitly); we need to allow the temporary to be initialized | |
6965 | first. */ | |
a3203465 | 6966 | tmp = convert_to_reference |
9a3b49ac MS |
6967 | (type, init, CONV_IMPLICIT, |
6968 | LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND, decl); | |
8d08fdba | 6969 | |
a3203465 | 6970 | if (tmp == error_mark_node) |
ed5511d9 | 6971 | return; |
a3203465 | 6972 | else if (tmp != NULL_TREE) |
8d08fdba | 6973 | { |
a3203465 | 6974 | init = tmp; |
24bef158 MM |
6975 | tmp = save_expr (tmp); |
6976 | if (building_stmt_tree ()) | |
6977 | { | |
6978 | /* Initialize the declaration. */ | |
6979 | tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp); | |
6980 | /* Setting TREE_SIDE_EFFECTS prevents expand_expr from | |
6981 | omitting this expression entirely. */ | |
6982 | TREE_SIDE_EFFECTS (tmp) = 1; | |
6983 | finish_expr_stmt (tmp); | |
6984 | } | |
6985 | else | |
6986 | DECL_INITIAL (decl) = tmp; | |
8d08fdba | 6987 | } |
a3203465 | 6988 | else |
8d08fdba | 6989 | { |
8251199e | 6990 | cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init)); |
ed5511d9 | 6991 | return; |
8d08fdba | 6992 | } |
8d08fdba | 6993 | |
8d08fdba MS |
6994 | if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl))) |
6995 | { | |
6996 | expand_static_init (decl, DECL_INITIAL (decl)); | |
6997 | DECL_INITIAL (decl) = NULL_TREE; | |
6998 | } | |
6999 | return; | |
8d08fdba MS |
7000 | } |
7001 | ||
6060a796 MS |
7002 | /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from |
7003 | mucking with forces it does not comprehend (i.e. initialization with a | |
7004 | constructor). If we are at global scope and won't go into COMMON, fill | |
7005 | it in with a dummy CONSTRUCTOR to force the variable into .data; | |
7006 | otherwise we can use error_mark_node. */ | |
7007 | ||
28cbf42c MS |
7008 | static tree |
7009 | obscure_complex_init (decl, init) | |
7010 | tree decl, init; | |
6060a796 | 7011 | { |
28cbf42c MS |
7012 | if (! flag_no_inline && TREE_STATIC (decl)) |
7013 | { | |
7014 | if (extract_init (decl, init)) | |
7015 | return NULL_TREE; | |
7016 | } | |
7017 | ||
2ee887f2 | 7018 | #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS) |
a9aedbc2 | 7019 | if (toplevel_bindings_p () && ! DECL_COMMON (decl)) |
6060a796 MS |
7020 | DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE, |
7021 | NULL_TREE); | |
7022 | else | |
2ee887f2 | 7023 | #endif |
6060a796 | 7024 | DECL_INITIAL (decl) = error_mark_node; |
28cbf42c MS |
7025 | |
7026 | return init; | |
6060a796 MS |
7027 | } |
7028 | ||
27778b73 MM |
7029 | /* When parsing `int a[] = {1, 2};' we don't know the size of the |
7030 | array until we finish parsing the initializer. If that's the | |
7031 | situation we're in, update DECL accordingly. */ | |
7032 | ||
7033 | static void | |
7034 | maybe_deduce_size_from_array_init (decl, init) | |
7035 | tree decl; | |
7036 | tree init; | |
7037 | { | |
7038 | tree type = TREE_TYPE (decl); | |
7039 | ||
7040 | if (TREE_CODE (type) == ARRAY_TYPE | |
7041 | && TYPE_DOMAIN (type) == NULL_TREE | |
7042 | && TREE_CODE (decl) != TYPE_DECL) | |
7043 | { | |
7044 | int do_default | |
7045 | = (TREE_STATIC (decl) | |
7046 | /* Even if pedantic, an external linkage array | |
7047 | may have incomplete type at first. */ | |
7048 | ? pedantic && ! DECL_EXTERNAL (decl) | |
7049 | : !DECL_EXTERNAL (decl)); | |
7050 | tree initializer = init ? init : DECL_INITIAL (decl); | |
7051 | int failure = complete_array_type (type, initializer, do_default); | |
7052 | ||
7053 | if (failure == 1) | |
7054 | cp_error ("initializer fails to determine size of `%D'", decl); | |
7055 | ||
7056 | if (failure == 2) | |
7057 | { | |
7058 | if (do_default) | |
7059 | cp_error ("array size missing in `%D'", decl); | |
7060 | /* If a `static' var's size isn't known, make it extern as | |
7061 | well as static, so it does not get allocated. If it's not | |
7062 | `static', then don't mark it extern; finish_incomplete_decl | |
7063 | will give it a default size and it will get allocated. */ | |
7064 | else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl)) | |
7065 | DECL_EXTERNAL (decl) = 1; | |
7066 | } | |
7067 | ||
7068 | if (pedantic && TYPE_DOMAIN (type) != NULL_TREE | |
7069 | && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)), | |
7070 | integer_zero_node)) | |
7071 | cp_error ("zero-size array `%D'", decl); | |
7072 | ||
7073 | layout_decl (decl, 0); | |
7074 | } | |
7075 | } | |
7076 | ||
7077 | /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue | |
c82dbd95 MM |
7078 | any appropriate error messages regarding the layout. INIT is a |
7079 | the initializer for DECL; returns a modified version. */ | |
27778b73 | 7080 | |
c82dbd95 MM |
7081 | static tree |
7082 | layout_var_decl (decl, init) | |
27778b73 | 7083 | tree decl; |
c82dbd95 | 7084 | tree init; |
27778b73 MM |
7085 | { |
7086 | tree ttype = target_type (TREE_TYPE (decl)); | |
7087 | ||
c82dbd95 MM |
7088 | /* If we haven't already layed out this declaration, and we know its |
7089 | type, do so now. Note that we must not call complete type for an | |
7090 | external object because it's type might involve templates that we | |
7091 | are not supposed to isntantiate yet. */ | |
7092 | if (!DECL_EXTERNAL (decl) | |
7093 | && DECL_SIZE (decl) == NULL_TREE | |
27778b73 MM |
7094 | && TYPE_SIZE (complete_type (TREE_TYPE (decl))) != NULL_TREE) |
7095 | layout_decl (decl, 0); | |
7096 | ||
c82dbd95 | 7097 | if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE) |
27778b73 MM |
7098 | { |
7099 | /* An automatic variable with an incomplete type: that is an error. | |
7100 | Don't talk about array types here, since we took care of that | |
7101 | message in grokdeclarator. */ | |
7102 | cp_error ("storage size of `%D' isn't known", decl); | |
7103 | TREE_TYPE (decl) = error_mark_node; | |
7104 | } | |
7105 | else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype)) | |
7106 | /* Let debugger know it should output info for this type. */ | |
7107 | note_debug_info_needed (ttype); | |
7108 | ||
7109 | if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl)) | |
7110 | note_debug_info_needed (DECL_CONTEXT (decl)); | |
7111 | ||
7112 | if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl)) | |
7113 | && DECL_SIZE (decl) != NULL_TREE | |
7114 | && ! TREE_CONSTANT (DECL_SIZE (decl))) | |
7115 | { | |
7116 | if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST) | |
7117 | constant_expression_warning (DECL_SIZE (decl)); | |
7118 | else | |
7119 | cp_error ("storage size of `%D' isn't constant", decl); | |
7120 | } | |
c82dbd95 MM |
7121 | |
7122 | return init; | |
27778b73 MM |
7123 | } |
7124 | ||
27778b73 MM |
7125 | /* If a local static variable is declared in an inline function, or if |
7126 | we have a weak definition, we must endeavor to create only one | |
7127 | instance of the variable at link-time. */ | |
7128 | ||
7129 | static void | |
7130 | maybe_commonize_var (decl) | |
7131 | tree decl; | |
7132 | { | |
7133 | /* Static data in a function with comdat linkage also has comdat | |
7134 | linkage. */ | |
7135 | if (TREE_STATIC (decl) | |
7136 | /* Don't mess with __FUNCTION__. */ | |
7137 | && ! TREE_ASM_WRITTEN (decl) | |
7138 | && current_function_decl | |
7139 | && DECL_CONTEXT (decl) == current_function_decl | |
7140 | && (DECL_THIS_INLINE (current_function_decl) | |
7141 | || DECL_TEMPLATE_INSTANTIATION (current_function_decl)) | |
7142 | && TREE_PUBLIC (current_function_decl)) | |
7143 | { | |
7144 | /* Rather than try to get this right with inlining, we suppress | |
7145 | inlining of such functions. */ | |
7146 | current_function_cannot_inline | |
7147 | = "function with static variable cannot be inline"; | |
7148 | ||
7149 | /* If flag_weak, we don't need to mess with this, as we can just | |
7150 | make the function weak, and let it refer to its unique local | |
7151 | copy. This works because we don't allow the function to be | |
7152 | inlined. */ | |
7153 | if (! flag_weak) | |
7154 | { | |
7155 | if (DECL_INTERFACE_KNOWN (current_function_decl)) | |
7156 | { | |
7157 | TREE_PUBLIC (decl) = 1; | |
7158 | DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl); | |
7159 | } | |
7160 | else if (DECL_INITIAL (decl) == NULL_TREE | |
7161 | || DECL_INITIAL (decl) == error_mark_node) | |
7162 | { | |
7163 | TREE_PUBLIC (decl) = 1; | |
7164 | DECL_COMMON (decl) = 1; | |
7165 | } | |
7166 | /* else we lose. We can only do this if we can use common, | |
7167 | which we can't if it has been initialized. */ | |
7168 | ||
7169 | if (TREE_PUBLIC (decl)) | |
7170 | DECL_ASSEMBLER_NAME (decl) | |
7171 | = build_static_name (current_function_decl, DECL_NAME (decl)); | |
7172 | else if (! DECL_ARTIFICIAL (decl)) | |
7173 | { | |
7174 | cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl); | |
7175 | cp_warning_at (" you can work around this by removing the initializer", decl); | |
7176 | } | |
7177 | } | |
7178 | } | |
7179 | else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl)) | |
7180 | /* Set it up again; we might have set DECL_INITIAL since the last | |
7181 | time. */ | |
7182 | comdat_linkage (decl); | |
7183 | } | |
7184 | ||
91063b51 MM |
7185 | /* Issue an error message if DECL is an uninitialized const variable. */ |
7186 | ||
7187 | static void | |
7188 | check_for_uninitialized_const_var (decl) | |
7189 | tree decl; | |
7190 | { | |
7191 | tree type = TREE_TYPE (decl); | |
7192 | ||
7193 | /* ``Unless explicitly declared extern, a const object does not have | |
7194 | external linkage and must be initialized. ($8.4; $12.1)'' ARM | |
7195 | 7.1.6 */ | |
7196 | if (TREE_CODE (decl) == VAR_DECL | |
7197 | && TREE_CODE (type) != REFERENCE_TYPE | |
7198 | && CP_TYPE_CONST_P (type) | |
7199 | && !TYPE_NEEDS_CONSTRUCTING (type) | |
7200 | && !DECL_INITIAL (decl)) | |
7201 | cp_error ("uninitialized const `%D'", decl); | |
7202 | } | |
7203 | ||
c82dbd95 MM |
7204 | /* Verify INIT (the initializer for DECL), and record the |
7205 | initialization in DECL_INITIAL, if appropriate. Returns a new | |
7206 | value for INIT. */ | |
27778b73 | 7207 | |
c82dbd95 MM |
7208 | static tree |
7209 | check_initializer (decl, init) | |
27778b73 | 7210 | tree decl; |
c82dbd95 | 7211 | tree init; |
27778b73 | 7212 | { |
27778b73 MM |
7213 | tree type; |
7214 | ||
7215 | if (TREE_CODE (decl) == FIELD_DECL) | |
c82dbd95 | 7216 | return init; |
27778b73 | 7217 | |
fc0e7bf5 MM |
7218 | type = TREE_TYPE (decl); |
7219 | ||
27778b73 MM |
7220 | /* If `start_decl' didn't like having an initialization, ignore it now. */ |
7221 | if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE) | |
7222 | init = NULL_TREE; | |
27778b73 | 7223 | |
c82dbd95 | 7224 | /* Check the initializer. */ |
27778b73 MM |
7225 | if (init) |
7226 | { | |
c82dbd95 MM |
7227 | /* Things that are going to be initialized need to have complete |
7228 | type. */ | |
7229 | TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl)); | |
7230 | ||
7231 | if (type == error_mark_node) | |
7232 | /* We will have already complained. */ | |
7233 | init = NULL_TREE; | |
7234 | else if (TYPE_SIZE (type) && !TREE_CONSTANT (TYPE_SIZE (type))) | |
27778b73 MM |
7235 | { |
7236 | cp_error ("variable-sized object `%D' may not be initialized", decl); | |
7237 | init = NULL_TREE; | |
7238 | } | |
c82dbd95 MM |
7239 | else if (TREE_CODE (type) == ARRAY_TYPE |
7240 | && !TYPE_SIZE (TREE_TYPE (type))) | |
27778b73 MM |
7241 | { |
7242 | cp_error ("elements of array `%#D' have incomplete type", decl); | |
7243 | init = NULL_TREE; | |
7244 | } | |
c82dbd95 MM |
7245 | else if (!TYPE_SIZE (type)) |
7246 | { | |
7247 | cp_error ("`%D' has incomplete type", decl); | |
7248 | TREE_TYPE (decl) = error_mark_node; | |
7249 | init = NULL_TREE; | |
7250 | } | |
27778b73 MM |
7251 | } |
7252 | ||
7253 | if (TREE_CODE (decl) == CONST_DECL) | |
7254 | { | |
7255 | my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148); | |
7256 | ||
7257 | DECL_INITIAL (decl) = init; | |
7258 | ||
7259 | /* This will keep us from needing to worry about our obstacks. */ | |
7260 | my_friendly_assert (init != NULL_TREE, 149); | |
7261 | init = NULL_TREE; | |
7262 | } | |
c82dbd95 MM |
7263 | else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE) |
7264 | { | |
7265 | if (TREE_STATIC (decl)) | |
7266 | make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ()); | |
7267 | grok_reference_init (decl, type, init); | |
7268 | init = NULL_TREE; | |
7269 | } | |
27778b73 MM |
7270 | else if (init) |
7271 | { | |
7272 | if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type)) | |
7273 | { | |
7274 | if (TREE_CODE (type) == ARRAY_TYPE) | |
7275 | init = digest_init (type, init, (tree *) 0); | |
7276 | else if (TREE_CODE (init) == CONSTRUCTOR | |
7277 | && TREE_HAS_CONSTRUCTOR (init)) | |
7278 | { | |
7279 | if (TYPE_NON_AGGREGATE_CLASS (type)) | |
7280 | { | |
7281 | cp_error ("`%D' must be initialized by constructor, not by `{...}'", | |
7282 | decl); | |
7283 | init = error_mark_node; | |
7284 | } | |
7285 | else | |
7286 | goto dont_use_constructor; | |
7287 | } | |
7288 | } | |
7289 | else | |
7290 | { | |
7291 | dont_use_constructor: | |
7292 | if (TREE_CODE (init) != TREE_VEC) | |
7293 | init = store_init_value (decl, init); | |
7294 | } | |
7295 | ||
7296 | if (init) | |
7297 | /* We must hide the initializer so that expand_decl | |
7298 | won't try to do something it does not understand. */ | |
7299 | init = obscure_complex_init (decl, init); | |
7300 | } | |
7301 | else if (DECL_EXTERNAL (decl)) | |
7302 | ; | |
7303 | else if (TREE_CODE_CLASS (TREE_CODE (type)) == 't' | |
7304 | && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type))) | |
7305 | { | |
7306 | tree core_type = strip_array_types (type); | |
7307 | ||
7308 | if (! TYPE_NEEDS_CONSTRUCTING (core_type)) | |
7309 | { | |
7310 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type)) | |
7311 | cp_error ("structure `%D' with uninitialized const members", decl); | |
7312 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type)) | |
7313 | cp_error ("structure `%D' with uninitialized reference members", | |
7314 | decl); | |
7315 | } | |
7316 | ||
7317 | check_for_uninitialized_const_var (decl); | |
7318 | ||
7319 | if (TYPE_SIZE (type) != NULL_TREE | |
7320 | && TYPE_NEEDS_CONSTRUCTING (type)) | |
7321 | init = obscure_complex_init (decl, NULL_TREE); | |
7322 | ||
7323 | } | |
7324 | else | |
7325 | check_for_uninitialized_const_var (decl); | |
7326 | ||
c82dbd95 | 7327 | return init; |
27778b73 MM |
7328 | } |
7329 | ||
7330 | /* If DECL is not a local variable, give it RTL. */ | |
7331 | ||
7332 | static void | |
7333 | make_rtl_for_nonlocal_decl (decl, init, asmspec) | |
7334 | tree decl; | |
7335 | tree init; | |
7336 | const char *asmspec; | |
7337 | { | |
27778b73 MM |
7338 | int toplev; |
7339 | tree type; | |
7340 | ||
7341 | type = TREE_TYPE (decl); | |
7342 | toplev = toplevel_bindings_p (); | |
b7b8bcd2 MM |
7343 | push_obstacks_nochange (); |
7344 | if (TREE_STATIC (decl) | |
7345 | && TYPE_NEEDS_DESTRUCTOR (type) | |
7346 | && allocation_temporary_p ()) | |
7347 | end_temporary_allocation (); | |
27778b73 MM |
7348 | |
7349 | if (TREE_CODE (decl) == VAR_DECL && DECL_VIRTUAL_P (decl)) | |
7350 | make_decl_rtl (decl, NULL_PTR, toplev); | |
7351 | else if (TREE_CODE (decl) == VAR_DECL | |
7352 | && TREE_READONLY (decl) | |
7353 | && DECL_INITIAL (decl) != NULL_TREE | |
7354 | && DECL_INITIAL (decl) != error_mark_node | |
7355 | && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))) | |
7356 | { | |
7357 | DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl)); | |
7358 | ||
7359 | if (asmspec) | |
7360 | DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec); | |
7361 | ||
7362 | if (! toplev | |
7363 | && TREE_STATIC (decl) | |
7364 | && ! TREE_SIDE_EFFECTS (decl) | |
7365 | && ! TREE_PUBLIC (decl) | |
7366 | && ! DECL_EXTERNAL (decl) | |
7367 | && ! TYPE_NEEDS_DESTRUCTOR (type) | |
7368 | && DECL_MODE (decl) != BLKmode) | |
7369 | { | |
7370 | /* If this variable is really a constant, then fill its DECL_RTL | |
7371 | slot with something which won't take up storage. | |
7372 | If something later should take its address, we can always give | |
7373 | it legitimate RTL at that time. */ | |
7374 | DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl)); | |
7375 | store_expr (DECL_INITIAL (decl), DECL_RTL (decl), 0); | |
7376 | TREE_ASM_WRITTEN (decl) = 1; | |
7377 | } | |
7378 | else if (toplev && ! TREE_PUBLIC (decl)) | |
7379 | { | |
7380 | /* If this is a static const, change its apparent linkage | |
7381 | if it belongs to a #pragma interface. */ | |
7382 | if (!interface_unknown) | |
7383 | { | |
7384 | TREE_PUBLIC (decl) = 1; | |
7385 | DECL_EXTERNAL (decl) = interface_only; | |
7386 | } | |
7387 | make_decl_rtl (decl, asmspec, toplev); | |
7388 | } | |
7389 | else | |
7390 | rest_of_decl_compilation (decl, asmspec, toplev, at_eof); | |
7391 | } | |
7392 | else if (TREE_CODE (decl) == VAR_DECL | |
7393 | && DECL_LANG_SPECIFIC (decl) | |
7394 | && DECL_IN_AGGR_P (decl)) | |
7395 | { | |
7396 | my_friendly_assert (TREE_STATIC (decl), 19990828); | |
7397 | ||
7398 | if (init == NULL_TREE | |
7399 | #ifdef DEFAULT_STATIC_DEFS | |
7400 | /* If this code is dead, then users must | |
7401 | explicitly declare static member variables | |
7402 | outside the class def'n as well. */ | |
7403 | && TYPE_NEEDS_CONSTRUCTING (type) | |
7404 | #endif | |
7405 | ) | |
7406 | { | |
7407 | DECL_EXTERNAL (decl) = 1; | |
7408 | make_decl_rtl (decl, asmspec, 1); | |
7409 | } | |
7410 | else | |
7411 | rest_of_decl_compilation (decl, asmspec, toplev, at_eof); | |
7412 | } | |
7413 | else | |
7414 | rest_of_decl_compilation (decl, asmspec, toplev, at_eof); | |
7415 | ||
b7b8bcd2 | 7416 | pop_obstacks (); |
27778b73 MM |
7417 | } |
7418 | ||
7419 | /* The old ARM scoping rules injected variables declared in the | |
7420 | initialization statement of a for-statement into the surrounding | |
7421 | scope. We support this usage, in order to be backward-compatible. | |
7422 | DECL is a just-declared VAR_DECL; if necessary inject its | |
7423 | declaration into the surrounding scope. */ | |
7424 | ||
b7b8bcd2 | 7425 | void |
27778b73 MM |
7426 | maybe_inject_for_scope_var (decl) |
7427 | tree decl; | |
7428 | { | |
7429 | if (current_binding_level->is_for_scope) | |
7430 | { | |
7431 | struct binding_level *outer | |
7432 | = current_binding_level->level_chain; | |
7433 | ||
7434 | /* Check to see if the same name is already bound at the outer | |
7435 | level, either because it was directly declared, or because a | |
7436 | dead for-decl got preserved. In either case, the code would | |
7437 | not have been valid under the ARM scope rules, so clear | |
7438 | is_for_scope for the current_binding_level. | |
7439 | ||
7440 | Otherwise, we need to preserve the temp slot for decl to last | |
7441 | into the outer binding level. */ | |
7442 | ||
7443 | tree outer_binding | |
7444 | = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl))); | |
7445 | ||
7446 | if (outer_binding && BINDING_LEVEL (outer_binding) == outer | |
7447 | && (TREE_CODE (BINDING_VALUE (outer_binding)) | |
7448 | == VAR_DECL) | |
7449 | && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding))) | |
7450 | { | |
7451 | BINDING_VALUE (outer_binding) | |
7452 | = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding)); | |
7453 | current_binding_level->is_for_scope = 0; | |
7454 | } | |
7455 | else if (DECL_IN_MEMORY_P (decl)) | |
7456 | preserve_temp_slots (DECL_RTL (decl)); | |
7457 | } | |
7458 | } | |
7459 | ||
ed5511d9 | 7460 | /* Generate code to initialize DECL (a local variable). */ |
27778b73 | 7461 | |
b7b8bcd2 MM |
7462 | void |
7463 | initialize_local_var (decl, init, flags) | |
27778b73 MM |
7464 | tree decl; |
7465 | tree init; | |
27778b73 MM |
7466 | int flags; |
7467 | { | |
7468 | tree type; | |
7469 | ||
c82dbd95 | 7470 | type = complete_type (TREE_TYPE (decl)); |
b7b8bcd2 | 7471 | |
b7b8bcd2 MM |
7472 | if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl)) |
7473 | { | |
7474 | /* If we used it already as memory, it must stay in memory. */ | |
7475 | DECL_INITIAL (decl) = NULL_TREE; | |
7476 | TREE_ADDRESSABLE (decl) = TREE_USED (decl); | |
7477 | } | |
7478 | ||
27778b73 MM |
7479 | if (DECL_SIZE (decl) && type != error_mark_node) |
7480 | { | |
7481 | int already_used; | |
7482 | ||
7483 | /* Compute and store the initial value. */ | |
27778b73 MM |
7484 | already_used = TREE_USED (decl) || TREE_USED (type); |
7485 | ||
7486 | if (init || TYPE_NEEDS_CONSTRUCTING (type)) | |
7487 | { | |
24bef158 MM |
7488 | int saved_stmts_are_full_exprs_p; |
7489 | ||
27778b73 MM |
7490 | emit_line_note (DECL_SOURCE_FILE (decl), |
7491 | DECL_SOURCE_LINE (decl)); | |
24bef158 MM |
7492 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p; |
7493 | stmts_are_full_exprs_p = 1; | |
27778b73 | 7494 | finish_expr_stmt (build_aggr_init (decl, init, flags)); |
24bef158 | 7495 | stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p; |
27778b73 MM |
7496 | } |
7497 | ||
7498 | /* Set this to 0 so we can tell whether an aggregate which was | |
7499 | initialized was ever used. Don't do this if it has a | |
7500 | destructor, so we don't complain about the 'resource | |
b7b8bcd2 MM |
7501 | allocation is initialization' idiom. Now set |
7502 | attribute((unused)) on types so decls of that type will be | |
7503 | marked used. (see TREE_USED, above.) */ | |
27778b73 MM |
7504 | if (TYPE_NEEDS_CONSTRUCTING (type) |
7505 | && ! already_used | |
24bef158 | 7506 | && !TYPE_NEEDS_DESTRUCTOR (type) |
27778b73 MM |
7507 | && DECL_NAME (decl)) |
7508 | TREE_USED (decl) = 0; | |
b7b8bcd2 | 7509 | else if (already_used) |
27778b73 MM |
7510 | TREE_USED (decl) = 1; |
7511 | } | |
24bef158 | 7512 | } |
27778b73 | 7513 | |
24bef158 MM |
7514 | /* Generate code to destroy DECL (a local variable). */ |
7515 | ||
7516 | void | |
7517 | destroy_local_var (decl) | |
7518 | tree decl; | |
7519 | { | |
9d85d30c MM |
7520 | tree type = TREE_TYPE (decl); |
7521 | tree cleanup; | |
7522 | ||
7523 | /* Only variables get cleaned up. */ | |
7524 | if (TREE_CODE (decl) != VAR_DECL) | |
7525 | return; | |
7526 | ||
7527 | /* And only things with destructors need cleaning up. */ | |
7528 | if (!TYPE_NEEDS_DESTRUCTOR (type)) | |
7529 | return; | |
7530 | ||
7531 | if (TREE_CODE (decl) == VAR_DECL && | |
7532 | (DECL_EXTERNAL (decl) || TREE_STATIC (decl))) | |
7533 | /* We don't clean up things that aren't defined in this | |
7534 | translation unit, or that need a static cleanup. The latter | |
7535 | are handled by finish_file. */ | |
7536 | return; | |
7537 | ||
7538 | /* Compute the cleanup. */ | |
7539 | cleanup = maybe_build_cleanup (decl); | |
27778b73 | 7540 | |
b7b8bcd2 | 7541 | /* Record the cleanup required for this declaration. */ |
24bef158 MM |
7542 | if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node |
7543 | && cleanup) | |
7544 | finish_decl_cleanup (decl, cleanup); | |
7545 | } | |
7546 | ||
7547 | /* Let the back-end know about DECL. */ | |
7548 | ||
7549 | void | |
7550 | emit_local_var (decl) | |
7551 | tree decl; | |
7552 | { | |
7553 | /* Create RTL for this variable. */ | |
7554 | if (DECL_RTL (decl)) | |
7555 | /* Only a RESULT_DECL should have non-NULL RTL when | |
7556 | arriving here. All other local variables are | |
7557 | assigned RTL in this function. */ | |
7558 | my_friendly_assert (TREE_CODE (decl) == RESULT_DECL, | |
7559 | 19990828); | |
7560 | else | |
7561 | expand_decl (decl); | |
7562 | ||
7563 | /* Actually do the initialization. */ | |
7564 | expand_start_target_temps (); | |
7565 | expand_decl_init (decl); | |
7566 | expand_end_target_temps (); | |
27778b73 MM |
7567 | } |
7568 | ||
8d08fdba MS |
7569 | /* Finish processing of a declaration; |
7570 | install its line number and initial value. | |
7571 | If the length of an array type is not known before, | |
7572 | it must be determined now, from the initial value, or it is an error. | |
7573 | ||
7574 | Call `pop_obstacks' iff NEED_POP is nonzero. | |
7575 | ||
82580166 | 7576 | For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers |
8d08fdba MS |
7577 | for aggregates that have constructors alive on the permanent obstack, |
7578 | so that the global initializing functions can be written at the end. | |
7579 | ||
7580 | INIT0 holds the value of an initializer that should be allowed to escape | |
7581 | the normal rules. | |
7582 | ||
6060a796 MS |
7583 | FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0 |
7584 | if the (init) syntax was used. | |
7585 | ||
8d08fdba | 7586 | For functions that take default parameters, DECL points to its |
82580166 | 7587 | "maximal" instantiation. `cp_finish_decl' must then also declared its |
8d08fdba MS |
7588 | subsequently lower and lower forms of instantiation, checking for |
7589 | ambiguity as it goes. This can be sped up later. */ | |
7590 | ||
7591 | void | |
82580166 | 7592 | cp_finish_decl (decl, init, asmspec_tree, need_pop, flags) |
8d08fdba MS |
7593 | tree decl, init; |
7594 | tree asmspec_tree; | |
7595 | int need_pop; | |
6060a796 | 7596 | int flags; |
8d08fdba MS |
7597 | { |
7598 | register tree type; | |
27778b73 | 7599 | tree ttype = NULL_TREE; |
8d08fdba | 7600 | int temporary = allocation_temporary_p (); |
9c0758dd | 7601 | const char *asmspec = NULL; |
8d08fdba MS |
7602 | int was_readonly = 0; |
7603 | ||
7604 | /* If this is 0, then we did not change obstacks. */ | |
7605 | if (! decl) | |
7606 | { | |
7607 | if (init) | |
8251199e | 7608 | error ("assignment (not initialization) in declaration"); |
8d08fdba MS |
7609 | return; |
7610 | } | |
7611 | ||
a4443a08 | 7612 | /* If a name was specified, get the string. */ |
8d08fdba | 7613 | if (asmspec_tree) |
8d08fdba | 7614 | asmspec = TREE_STRING_POINTER (asmspec_tree); |
8d08fdba | 7615 | |
2c73f9f5 ML |
7616 | if (init && TREE_CODE (init) == NAMESPACE_DECL) |
7617 | { | |
8251199e | 7618 | cp_error ("Cannot initialize `%D' to namespace `%D'", |
2c73f9f5 ML |
7619 | decl, init); |
7620 | init = NULL_TREE; | |
7621 | } | |
7622 | ||
6ba89f8e MM |
7623 | if (current_class_type |
7624 | && DECL_REAL_CONTEXT (decl) == current_class_type | |
7625 | && TYPE_BEING_DEFINED (current_class_type) | |
7626 | && (DECL_INITIAL (decl) || init)) | |
7627 | DECL_DEFINED_IN_CLASS_P (decl) = 1; | |
7628 | ||
9a68c51f JM |
7629 | if (TREE_CODE (decl) == VAR_DECL |
7630 | && DECL_CONTEXT (decl) | |
7631 | && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL | |
7632 | && DECL_CONTEXT (decl) != current_namespace | |
7633 | && init) | |
7634 | { | |
7635 | /* Leave the namespace of the object. */ | |
7636 | pop_decl_namespace (); | |
7637 | } | |
7638 | ||
c82dbd95 | 7639 | type = TREE_TYPE (decl); |
8d08fdba | 7640 | |
f376e137 | 7641 | if (type == error_mark_node) |
eac293a1 | 7642 | { |
a9aedbc2 | 7643 | if (toplevel_bindings_p () && temporary) |
eac293a1 MS |
7644 | end_temporary_allocation (); |
7645 | ||
7646 | return; | |
7647 | } | |
f376e137 | 7648 | |
24bef158 MM |
7649 | /* Add this declaration to the statement-tree. */ |
7650 | if (building_stmt_tree () | |
7651 | && TREE_CODE (current_scope ()) == FUNCTION_DECL) | |
7652 | add_decl_stmt (decl); | |
7653 | ||
a7a7710d NS |
7654 | if (TYPE_HAS_MUTABLE_P (type)) |
7655 | TREE_READONLY (decl) = 0; | |
24bef158 | 7656 | |
5156628f | 7657 | if (processing_template_decl) |
5566b478 MS |
7658 | { |
7659 | if (init && DECL_INITIAL (decl)) | |
2a1e9fdd | 7660 | DECL_INITIAL (decl) = init; |
5566b478 MS |
7661 | goto finish_end0; |
7662 | } | |
3e41d13b | 7663 | |
27778b73 MM |
7664 | /* Parameters are handled by store_parm_decls, not cp_finish_decl. */ |
7665 | my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828); | |
7666 | ||
8d08fdba MS |
7667 | /* Take care of TYPE_DECLs up front. */ |
7668 | if (TREE_CODE (decl) == TYPE_DECL) | |
7669 | { | |
7670 | if (init && DECL_INITIAL (decl)) | |
7671 | { | |
7672 | /* typedef foo = bar; store the type of bar as the type of foo. */ | |
7673 | TREE_TYPE (decl) = type = TREE_TYPE (init); | |
7674 | DECL_INITIAL (decl) = init = NULL_TREE; | |
7675 | } | |
a0a33927 MS |
7676 | if (type != error_mark_node |
7677 | && IS_AGGR_TYPE (type) && DECL_NAME (decl)) | |
8d08fdba MS |
7678 | { |
7679 | if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type) | |
8251199e | 7680 | cp_warning ("shadowing previous type declaration of `%#D'", decl); |
8d08fdba MS |
7681 | set_identifier_type_value (DECL_NAME (decl), type); |
7682 | CLASSTYPE_GOT_SEMICOLON (type) = 1; | |
7683 | } | |
7684 | GNU_xref_decl (current_function_decl, decl); | |
cffa8729 MS |
7685 | |
7686 | /* If we have installed this as the canonical typedef for this | |
7687 | type, and that type has not been defined yet, delay emitting | |
956d6950 | 7688 | the debug information for it, as we will emit it later. */ |
d2e5ee5c | 7689 | if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl |
cffa8729 MS |
7690 | && TYPE_SIZE (TREE_TYPE (decl)) == NULL_TREE) |
7691 | TYPE_DECL_SUPPRESS_DEBUG (decl) = 1; | |
7692 | ||
8d08fdba | 7693 | rest_of_decl_compilation (decl, NULL_PTR, |
5566b478 | 7694 | DECL_CONTEXT (decl) == NULL_TREE, at_eof); |
8d08fdba MS |
7695 | goto finish_end; |
7696 | } | |
3e41d13b | 7697 | |
8d08fdba | 7698 | if (TREE_CODE (decl) != FUNCTION_DECL) |
3e41d13b | 7699 | ttype = target_type (type); |
8d08fdba MS |
7700 | |
7701 | if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl) | |
7702 | && TYPE_NEEDS_CONSTRUCTING (type)) | |
7703 | { | |
8d08fdba MS |
7704 | /* Currently, GNU C++ puts constants in text space, making them |
7705 | impossible to initialize. In the future, one would hope for | |
7706 | an operating system which understood the difference between | |
7707 | initialization and the running of a program. */ | |
7708 | was_readonly = 1; | |
7709 | TREE_READONLY (decl) = 0; | |
7710 | } | |
7711 | ||
27778b73 | 7712 | if (TREE_CODE (decl) == FIELD_DECL && asmspec) |
8d08fdba | 7713 | { |
27778b73 MM |
7714 | /* This must override the asm specifier which was placed by |
7715 | grokclassfn. Lay this out fresh. */ | |
7716 | DECL_RTL (TREE_TYPE (decl)) = NULL_RTX; | |
7717 | DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec); | |
7718 | make_decl_rtl (decl, asmspec, 0); | |
8d08fdba MS |
7719 | } |
7720 | ||
c82dbd95 MM |
7721 | /* Deduce size of array from initialization, if not already known. */ |
7722 | maybe_deduce_size_from_array_init (decl, init); | |
7723 | init = check_initializer (decl, init); | |
3e41d13b | 7724 | |
8d08fdba MS |
7725 | GNU_xref_decl (current_function_decl, decl); |
7726 | ||
8d08fdba MS |
7727 | /* For top-level declaration, the initial value was read in |
7728 | the temporary obstack. MAXINDEX, rtl, etc. to be made below | |
7729 | must go in the permanent obstack; but don't discard the | |
7730 | temporary data yet. */ | |
7731 | ||
a9aedbc2 | 7732 | if (toplevel_bindings_p () && temporary) |
8d08fdba MS |
7733 | end_temporary_allocation (); |
7734 | ||
8d08fdba | 7735 | if (TREE_CODE (decl) == VAR_DECL) |
c82dbd95 | 7736 | init = layout_var_decl (decl, init); |
8d08fdba MS |
7737 | |
7738 | /* Output the assembler code and/or RTL code for variables and functions, | |
7739 | unless the type is an undefined structure or union. | |
7740 | If not, it will get done when the type is completed. */ | |
8d08fdba MS |
7741 | if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL |
7742 | || TREE_CODE (decl) == RESULT_DECL) | |
7743 | { | |
7744 | /* ??? FIXME: What about nested classes? */ | |
9188c363 | 7745 | int toplev = toplevel_bindings_p (); |
42976354 | 7746 | |
27778b73 MM |
7747 | if (TREE_CODE (decl) == VAR_DECL) |
7748 | maybe_commonize_var (decl); | |
8d08fdba | 7749 | |
27778b73 | 7750 | make_rtl_for_nonlocal_decl (decl, init, asmspec); |
8d08fdba | 7751 | |
27778b73 MM |
7752 | if (TREE_CODE (type) == FUNCTION_TYPE |
7753 | || TREE_CODE (type) == METHOD_TYPE) | |
7754 | abstract_virtuals_error (decl, | |
7755 | strip_array_types (TREE_TYPE (type))); | |
7756 | else | |
7757 | abstract_virtuals_error (decl, strip_array_types (type)); | |
8d08fdba | 7758 | |
8d08fdba | 7759 | if (TREE_CODE (decl) == FUNCTION_DECL) |
faae18ab | 7760 | ; |
67d743fe MS |
7761 | else if (DECL_EXTERNAL (decl) |
7762 | && ! (DECL_LANG_SPECIFIC (decl) | |
7763 | && DECL_NOT_REALLY_EXTERN (decl))) | |
5566b478 MS |
7764 | { |
7765 | if (init) | |
7766 | DECL_INITIAL (decl) = init; | |
7767 | } | |
8d08fdba MS |
7768 | else if (TREE_STATIC (decl) && type != error_mark_node) |
7769 | { | |
7770 | /* Cleanups for static variables are handled by `finish_file'. */ | |
f30432d7 MS |
7771 | if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE |
7772 | || TYPE_NEEDS_DESTRUCTOR (type)) | |
8d08fdba | 7773 | expand_static_init (decl, init); |
8d08fdba MS |
7774 | } |
7775 | else if (! toplev) | |
7776 | { | |
b7b8bcd2 | 7777 | /* This is a local declaration. */ |
27778b73 | 7778 | maybe_inject_for_scope_var (decl); |
b7b8bcd2 MM |
7779 | /* Initialize the local variable. But, if we're building a |
7780 | statement-tree, we'll do the initialization when we | |
7781 | expand the tree. */ | |
24bef158 MM |
7782 | if (processing_template_decl) |
7783 | { | |
7784 | if (init || DECL_INITIAL (decl) == error_mark_node) | |
7785 | DECL_INITIAL (decl) = init; | |
7786 | } | |
7787 | else | |
7788 | { | |
7789 | if (!building_stmt_tree ()) | |
7790 | emit_local_var (decl); | |
7791 | initialize_local_var (decl, init, flags); | |
7792 | /* Clean up the variable. */ | |
7793 | destroy_local_var (decl); | |
7794 | } | |
8d08fdba MS |
7795 | } |
7796 | finish_end0: | |
7797 | ||
7798 | /* Undo call to `pushclass' that was done in `start_decl' | |
7799 | due to initialization of qualified member variable. | |
7800 | I.e., Foo::x = 10; */ | |
7801 | { | |
f30432d7 | 7802 | tree context = DECL_REAL_CONTEXT (decl); |
8d08fdba MS |
7803 | if (context |
7804 | && TREE_CODE_CLASS (TREE_CODE (context)) == 't' | |
7805 | && (TREE_CODE (decl) == VAR_DECL | |
7806 | /* We also have a pushclass done that we need to undo here | |
7807 | if we're at top level and declare a method. */ | |
5566b478 MS |
7808 | || TREE_CODE (decl) == FUNCTION_DECL) |
7809 | /* If size hasn't been set, we're still defining it, | |
7810 | and therefore inside the class body; don't pop | |
7811 | the binding level.. */ | |
7812 | && TYPE_SIZE (context) != NULL_TREE | |
7813 | && context == current_class_type) | |
6b400b21 | 7814 | pop_nested_class (); |
8d08fdba MS |
7815 | } |
7816 | } | |
7817 | ||
7818 | finish_end: | |
7819 | ||
39211cd5 MS |
7820 | /* If requested, warn about definitions of large data objects. */ |
7821 | ||
7822 | if (warn_larger_than | |
5156628f | 7823 | && ! processing_template_decl |
39211cd5 MS |
7824 | && (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL) |
7825 | && !DECL_EXTERNAL (decl)) | |
7826 | { | |
7827 | register tree decl_size = DECL_SIZE (decl); | |
7828 | ||
7829 | if (decl_size && TREE_CODE (decl_size) == INTEGER_CST) | |
7830 | { | |
7831 | unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT; | |
7832 | ||
7833 | if (units > larger_than_size) | |
7834 | warning_with_decl (decl, "size of `%s' is %u bytes", units); | |
7835 | } | |
7836 | } | |
7837 | ||
8d08fdba | 7838 | if (need_pop) |
27778b73 MM |
7839 | /* Resume permanent allocation, if not within a function. The |
7840 | corresponding push_obstacks_nochange is in start_decl, | |
7841 | start_method, groktypename, and in grokfield. */ | |
7842 | pop_obstacks (); | |
8d08fdba MS |
7843 | |
7844 | if (was_readonly) | |
7845 | TREE_READONLY (decl) = 1; | |
8d08fdba MS |
7846 | } |
7847 | ||
82580166 | 7848 | /* This is here for a midend callback from c-common.c */ |
e92cc029 | 7849 | |
82580166 MS |
7850 | void |
7851 | finish_decl (decl, init, asmspec_tree) | |
7852 | tree decl, init; | |
7853 | tree asmspec_tree; | |
7854 | { | |
7855 | cp_finish_decl (decl, init, asmspec_tree, 1, 0); | |
7856 | } | |
7857 | ||
f0105ed3 MM |
7858 | /* Generate code to handle the destruction of the function-scoped |
7859 | static variable DECL. */ | |
7860 | ||
7861 | static void | |
7862 | destroy_local_static (decl) | |
7863 | tree decl; | |
7864 | { | |
7865 | tree cleanup, fcall; | |
7866 | tree compound_stmt; | |
7867 | int saved_flag_access_control; | |
7868 | ||
7869 | if (atexit_node == 0) | |
7870 | { | |
7871 | tree atexit_fndecl, PFV, pfvlist; | |
7872 | /* Remember this information until end of file. */ | |
7873 | push_obstacks (&permanent_obstack, &permanent_obstack); | |
7874 | PFV = build_pointer_type (build_function_type | |
7875 | (void_type_node, void_list_node)); | |
7876 | ||
7877 | pfvlist = tree_cons (NULL_TREE, PFV, void_list_node); | |
7878 | ||
7879 | push_lang_context (lang_name_c); | |
7880 | /* Note that we do not call pushdecl for this function; | |
7881 | there's no reason that this declaration should be | |
7882 | accessible to anyone. */ | |
7883 | atexit_fndecl | |
7884 | = define_function ("atexit", | |
7885 | build_function_type (void_type_node, | |
7886 | pfvlist), | |
c2a37c55 | 7887 | /*pfn=*/0, NULL_PTR); |
f0105ed3 MM |
7888 | mark_used (atexit_fndecl); |
7889 | atexit_node = default_conversion (atexit_fndecl); | |
7890 | pop_lang_context (); | |
7891 | pop_obstacks (); | |
7892 | } | |
7893 | ||
7894 | /* Call build_cleanup before we enter the anonymous function so that | |
7895 | any access checks will be done relative to the current scope, | |
7896 | rather than the scope of the anonymous function. */ | |
7897 | build_cleanup (decl); | |
7898 | ||
7899 | /* Now start the function. */ | |
7900 | cleanup = start_anon_func (); | |
7901 | ||
7902 | /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer | |
7903 | to the original function, rather than the anonymous one. That | |
7904 | will make the back-end think that nested functions are in use, | |
7905 | which causes confusion. */ | |
7906 | saved_flag_access_control = flag_access_control; | |
7907 | flag_access_control = 0; | |
7908 | fcall = build_cleanup (decl); | |
7909 | flag_access_control = saved_flag_access_control; | |
7910 | ||
7911 | /* Create the body of the anonymous function. */ | |
7912 | compound_stmt = begin_compound_stmt (/*has_no_scope=*/0); | |
7913 | finish_expr_stmt (fcall); | |
7914 | finish_compound_stmt (/*has_no_scope=*/0, compound_stmt); | |
7915 | end_anon_func (); | |
7916 | ||
7917 | /* Call atexit with the cleanup function. */ | |
7918 | mark_addressable (cleanup); | |
7919 | cleanup = build_unary_op (ADDR_EXPR, cleanup, 0); | |
7920 | fcall = build_function_call (atexit_node, | |
7921 | tree_cons (NULL_TREE, | |
7922 | cleanup, | |
7923 | NULL_TREE)); | |
7924 | finish_expr_stmt (fcall); | |
7925 | } | |
7926 | ||
8d08fdba MS |
7927 | void |
7928 | expand_static_init (decl, init) | |
7929 | tree decl; | |
7930 | tree init; | |
7931 | { | |
7932 | tree oldstatic = value_member (decl, static_aggregates); | |
a4443a08 | 7933 | |
8d08fdba MS |
7934 | if (oldstatic) |
7935 | { | |
7936 | if (TREE_PURPOSE (oldstatic) && init != NULL_TREE) | |
8251199e | 7937 | cp_error ("multiple initializations given for `%D'", decl); |
8d08fdba | 7938 | } |
0aafb128 | 7939 | else if (! toplevel_bindings_p ()) |
8d08fdba MS |
7940 | { |
7941 | /* Emit code to perform this initialization but once. */ | |
7942 | tree temp; | |
b7b8bcd2 | 7943 | tree if_stmt; |
f0105ed3 | 7944 | tree then_clause; |
f1dedc31 MM |
7945 | tree assignment; |
7946 | tree temp_init; | |
8d08fdba | 7947 | |
e92cc029 | 7948 | /* Remember this information until end of file. */ |
8d08fdba MS |
7949 | push_obstacks (&permanent_obstack, &permanent_obstack); |
7950 | ||
2036a15c MM |
7951 | /* Emit code to perform this initialization but once. This code |
7952 | looks like: | |
7953 | ||
7954 | static int temp = 0; | |
7955 | if (!temp) { | |
7956 | // Do initialization. | |
7957 | temp = 1; | |
7958 | // Register variable for destruction at end of program. | |
7959 | } | |
7960 | ||
7961 | Note that the `temp' variable is only set to 1 *after* the | |
7962 | initialization is complete. This ensures that an exception, | |
7963 | thrown during the construction, will cause the variable to | |
7964 | reinitialized when we pass through this code again, as per: | |
7965 | ||
7966 | [stmt.dcl] | |
7967 | ||
7968 | If the initialization exits by throwing an exception, the | |
7969 | initialization is not complete, so it will be tried again | |
7970 | the next time control enters the declaration. | |
7971 | ||
7972 | In theory, this process should be thread-safe, too; multiple | |
7973 | threads should not be able to initialize the variable more | |
7974 | than once. We don't yet attempt to ensure thread-safety. */ | |
8d08fdba MS |
7975 | temp = get_temp_name (integer_type_node, 1); |
7976 | rest_of_decl_compilation (temp, NULL_PTR, 0, 0); | |
2036a15c MM |
7977 | |
7978 | /* Begin the conditional initialization. */ | |
b7b8bcd2 MM |
7979 | if_stmt = begin_if_stmt (); |
7980 | finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp, | |
7981 | integer_zero_node), | |
7982 | if_stmt); | |
f0105ed3 | 7983 | then_clause = begin_compound_stmt (/*has_no_scope=*/0); |
72b7eeff | 7984 | |
2036a15c | 7985 | /* Do the initialization itself. */ |
28cbf42c | 7986 | if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)) |
f30432d7 | 7987 | || (init && TREE_CODE (init) == TREE_LIST)) |
f1dedc31 | 7988 | assignment = build_aggr_init (decl, init, 0); |
f30432d7 | 7989 | else if (init) |
951525d2 MM |
7990 | /* The initialization we're doing here is just a bitwise |
7991 | copy. */ | |
7992 | assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init); | |
f1dedc31 MM |
7993 | else |
7994 | assignment = NULL_TREE; | |
7995 | ||
7996 | /* Once the assignment is complete, set TEMP to 1. Since the | |
7997 | construction of the static object is complete at this point, | |
7998 | we want to make sure TEMP is set to 1 even if a temporary | |
7999 | constructed during the initialization throws an exception | |
8000 | when it is destroyed. So, we combine the initialization and | |
8001 | the assignment to TEMP into a single expression, ensuring | |
8002 | that when we call finish_expr_stmt the cleanups will not be | |
8003 | run until after TEMP is set to 1. */ | |
8004 | temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node); | |
8005 | if (assignment) | |
8006 | { | |
8007 | assignment = tree_cons (NULL_TREE, assignment, | |
8008 | build_tree_list (NULL_TREE, | |
8009 | temp_init)); | |
8010 | assignment = build_compound_expr (assignment); | |
8011 | } | |
8012 | else | |
8013 | assignment = temp_init; | |
8014 | finish_expr_stmt (assignment); | |
72b7eeff | 8015 | |
2036a15c MM |
8016 | /* Use atexit to register a function for destroying this static |
8017 | variable. */ | |
72b7eeff | 8018 | if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl))) |
f0105ed3 | 8019 | destroy_local_static (decl); |
72b7eeff | 8020 | |
f0105ed3 | 8021 | finish_compound_stmt (/*has_no_scope=*/0, then_clause); |
b7b8bcd2 MM |
8022 | finish_then_clause (if_stmt); |
8023 | finish_if_stmt (); | |
8024 | ||
e92cc029 | 8025 | /* Resume old (possibly temporary) allocation. */ |
8d08fdba MS |
8026 | pop_obstacks (); |
8027 | } | |
8028 | else | |
8029 | { | |
0aafb128 MM |
8030 | /* This code takes into account memory allocation policy of |
8031 | `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not | |
8032 | hold for this object, then we must make permanent the storage | |
8033 | currently in the temporary obstack. */ | |
8034 | if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))) | |
8d08fdba | 8035 | preserve_initializer (); |
e1b3e07d | 8036 | static_aggregates = tree_cons (init, decl, static_aggregates); |
8d08fdba MS |
8037 | } |
8038 | } | |
3c5c0849 MM |
8039 | |
8040 | /* Finish the declaration of a catch-parameter. */ | |
8041 | ||
8042 | void | |
8043 | start_handler_parms (declspecs, declarator) | |
8044 | tree declspecs; | |
8045 | tree declarator; | |
8046 | { | |
8047 | tree decl; | |
8048 | if (declspecs) | |
8049 | { | |
8050 | decl = grokdeclarator (declarator, declspecs, CATCHPARM, | |
8051 | 1, NULL_TREE); | |
8052 | if (decl == NULL_TREE) | |
8053 | error ("invalid catch parameter"); | |
8054 | } | |
8055 | else | |
8056 | decl = NULL_TREE; | |
8057 | expand_start_catch_block (decl); | |
8058 | } | |
8059 | ||
8d08fdba MS |
8060 | \f |
8061 | /* Make TYPE a complete type based on INITIAL_VALUE. | |
8062 | Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered, | |
6ab5c740 | 8063 | 2 if there was no information (in which case assume 0 if DO_DEFAULT). */ |
8d08fdba MS |
8064 | |
8065 | int | |
8066 | complete_array_type (type, initial_value, do_default) | |
8067 | tree type, initial_value; | |
8068 | int do_default; | |
8069 | { | |
8070 | register tree maxindex = NULL_TREE; | |
8071 | int value = 0; | |
6ab5c740 NS |
8072 | |
8073 | /* Allocate on the same obstack as TYPE. */ | |
8074 | push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type)); | |
8075 | ||
8d08fdba MS |
8076 | if (initial_value) |
8077 | { | |
8078 | /* Note MAXINDEX is really the maximum index, | |
8079 | one less than the size. */ | |
8080 | if (TREE_CODE (initial_value) == STRING_CST) | |
e1cd6e56 MS |
8081 | { |
8082 | int eltsize | |
8083 | = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value))); | |
8084 | maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value) | |
8085 | / eltsize) - 1, 0); | |
8086 | } | |
8d08fdba MS |
8087 | else if (TREE_CODE (initial_value) == CONSTRUCTOR) |
8088 | { | |
e1cd6e56 MS |
8089 | tree elts = CONSTRUCTOR_ELTS (initial_value); |
8090 | maxindex = size_binop (MINUS_EXPR, integer_zero_node, size_one_node); | |
8091 | for (; elts; elts = TREE_CHAIN (elts)) | |
8092 | { | |
8093 | if (TREE_PURPOSE (elts)) | |
8094 | maxindex = TREE_PURPOSE (elts); | |
8095 | else | |
8096 | maxindex = size_binop (PLUS_EXPR, maxindex, size_one_node); | |
8097 | } | |
8098 | maxindex = copy_node (maxindex); | |
8d08fdba MS |
8099 | } |
8100 | else | |
8101 | { | |
8102 | /* Make an error message unless that happened already. */ | |
8103 | if (initial_value != error_mark_node) | |
8104 | value = 1; | |
0db982be ML |
8105 | else |
8106 | initial_value = NULL_TREE; | |
8d08fdba MS |
8107 | |
8108 | /* Prevent further error messages. */ | |
8109 | maxindex = build_int_2 (0, 0); | |
8110 | } | |
8111 | } | |
8112 | ||
8113 | if (!maxindex) | |
8114 | { | |
8115 | if (do_default) | |
8116 | maxindex = build_int_2 (0, 0); | |
8117 | value = 2; | |
8118 | } | |
8119 | ||
8120 | if (maxindex) | |
8121 | { | |
51c184be | 8122 | tree itype; |
6ab5c740 NS |
8123 | tree domain; |
8124 | ||
8125 | domain = build_index_type (maxindex); | |
8126 | TYPE_DOMAIN (type) = domain; | |
51c184be | 8127 | |
dff6b454 | 8128 | if (! TREE_TYPE (maxindex)) |
6ab5c740 | 8129 | TREE_TYPE (maxindex) = domain; |
51c184be MS |
8130 | if (initial_value) |
8131 | itype = TREE_TYPE (initial_value); | |
8132 | else | |
8133 | itype = NULL; | |
8134 | if (itype && !TYPE_DOMAIN (itype)) | |
6ab5c740 | 8135 | TYPE_DOMAIN (itype) = domain; |
dff6b454 RK |
8136 | /* The type of the main variant should never be used for arrays |
8137 | of different sizes. It should only ever be completed with the | |
8138 | size of the array. */ | |
8139 | if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type))) | |
6ab5c740 | 8140 | TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain; |
8d08fdba MS |
8141 | } |
8142 | ||
6ab5c740 NS |
8143 | pop_obstacks(); |
8144 | ||
8d08fdba MS |
8145 | /* Lay out the type now that we can get the real answer. */ |
8146 | ||
8147 | layout_type (type); | |
8148 | ||
8149 | return value; | |
8150 | } | |
8151 | \f | |
8152 | /* Return zero if something is declared to be a member of type | |
8153 | CTYPE when in the context of CUR_TYPE. STRING is the error | |
8154 | message to print in that case. Otherwise, quietly return 1. */ | |
e92cc029 | 8155 | |
8d08fdba MS |
8156 | static int |
8157 | member_function_or_else (ctype, cur_type, string) | |
8158 | tree ctype, cur_type; | |
d8e178a0 | 8159 | const char *string; |
8d08fdba MS |
8160 | { |
8161 | if (ctype && ctype != cur_type) | |
8162 | { | |
8163 | error (string, TYPE_NAME_STRING (ctype)); | |
8164 | return 0; | |
8165 | } | |
8166 | return 1; | |
8167 | } | |
8168 | \f | |
8169 | /* Subroutine of `grokdeclarator'. */ | |
8170 | ||
8171 | /* Generate errors possibly applicable for a given set of specifiers. | |
8172 | This is for ARM $7.1.2. */ | |
e92cc029 | 8173 | |
8d08fdba MS |
8174 | static void |
8175 | bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises) | |
8176 | tree object; | |
d8e178a0 | 8177 | const char *type; |
8d08fdba MS |
8178 | int virtualp, quals, friendp, raises, inlinep; |
8179 | { | |
8180 | if (virtualp) | |
8251199e | 8181 | cp_error ("`%D' declared as a `virtual' %s", object, type); |
8d08fdba | 8182 | if (inlinep) |
8251199e | 8183 | cp_error ("`%D' declared as an `inline' %s", object, type); |
8d08fdba | 8184 | if (quals) |
8251199e | 8185 | cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration", |
a28e3c7f | 8186 | object, type); |
8d08fdba | 8187 | if (friendp) |
f8e55f34 | 8188 | cp_error_at ("`%D' declared as a friend", object); |
f3e4d63c | 8189 | if (raises) |
f8e55f34 | 8190 | cp_error_at ("`%D' declared with an exception specification", object); |
8d08fdba MS |
8191 | } |
8192 | ||
8193 | /* CTYPE is class type, or null if non-class. | |
8194 | TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE | |
8195 | or METHOD_TYPE. | |
8196 | DECLARATOR is the function's name. | |
8197 | VIRTUALP is truthvalue of whether the function is virtual or not. | |
8198 | FLAGS are to be passed through to `grokclassfn'. | |
8199 | QUALS are qualifiers indicating whether the function is `const' | |
8200 | or `volatile'. | |
8201 | RAISES is a list of exceptions that this function can raise. | |
8202 | CHECK is 1 if we must find this method in CTYPE, 0 if we should | |
3ddfb0e6 MM |
8203 | not look, and -1 if we should not call `grokclassfn' at all. |
8204 | ||
20496fa2 | 8205 | Returns `NULL_TREE' if something goes wrong, after issuing |
3ddfb0e6 | 8206 | applicable error messages. */ |
e92cc029 | 8207 | |
8d08fdba | 8208 | static tree |
386b8a85 | 8209 | grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals, |
7a8f9fa9 | 8210 | raises, check, friendp, publicp, inlinep, funcdef_flag, |
2c73f9f5 | 8211 | template_count, in_namespace) |
8d08fdba MS |
8212 | tree ctype, type; |
8213 | tree declarator; | |
386b8a85 | 8214 | tree orig_declarator; |
8d08fdba MS |
8215 | int virtualp; |
8216 | enum overload_flags flags; | |
7a8f9fa9 | 8217 | tree quals, raises; |
386b8a85 | 8218 | int check, friendp, publicp, inlinep, funcdef_flag, template_count; |
2c73f9f5 | 8219 | tree in_namespace; |
8d08fdba MS |
8220 | { |
8221 | tree cname, decl; | |
8222 | int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE; | |
856216bb | 8223 | int has_default_arg = 0; |
42976354 | 8224 | tree t; |
8d08fdba MS |
8225 | |
8226 | if (ctype) | |
8227 | cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL | |
8228 | ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype); | |
8229 | else | |
8230 | cname = NULL_TREE; | |
8231 | ||
8232 | if (raises) | |
8233 | { | |
f30432d7 | 8234 | type = build_exception_variant (type, raises); |
8d08fdba | 8235 | } |
c11b6f21 | 8236 | |
8d08fdba | 8237 | decl = build_lang_decl (FUNCTION_DECL, declarator, type); |
2c73f9f5 | 8238 | /* Propagate volatile out from type to decl. */ |
8d08fdba | 8239 | if (TYPE_VOLATILE (type)) |
893de33c | 8240 | TREE_THIS_VOLATILE (decl) = 1; |
8d08fdba | 8241 | |
79c4d4b7 | 8242 | /* If this decl has namespace scope, set that up. */ |
2c73f9f5 | 8243 | if (in_namespace) |
b262d64c | 8244 | set_decl_namespace (decl, in_namespace, friendp); |
79c4d4b7 JM |
8245 | else if (publicp && ! ctype) |
8246 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); | |
2c73f9f5 | 8247 | |
0f8766b8 JM |
8248 | /* `main' and builtins have implicit 'C' linkage. */ |
8249 | if ((MAIN_NAME_P (declarator) | |
8250 | || (IDENTIFIER_LENGTH (declarator) > 10 | |
8251 | && IDENTIFIER_POINTER (declarator)[0] == '_' | |
8252 | && IDENTIFIER_POINTER (declarator)[1] == '_' | |
8253 | && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0)) | |
8254 | && current_lang_name == lang_name_cplusplus | |
94706a5c | 8255 | && ctype == NULL_TREE |
79c4d4b7 JM |
8256 | /* NULL_TREE means global namespace. */ |
8257 | && DECL_CONTEXT (decl) == NULL_TREE) | |
0f8766b8 JM |
8258 | DECL_LANGUAGE (decl) = lang_c; |
8259 | ||
8d08fdba MS |
8260 | /* Should probably propagate const out from type to decl I bet (mrs). */ |
8261 | if (staticp) | |
8262 | { | |
8263 | DECL_STATIC_FUNCTION_P (decl) = 1; | |
8264 | DECL_CONTEXT (decl) = ctype; | |
8d08fdba MS |
8265 | } |
8266 | ||
e76a2646 MS |
8267 | if (ctype) |
8268 | DECL_CLASS_CONTEXT (decl) = ctype; | |
8269 | ||
0f8766b8 | 8270 | if (ctype == NULL_TREE && DECL_MAIN_P (decl)) |
faae18ab | 8271 | { |
848b92e1 JM |
8272 | if (processing_template_decl) |
8273 | error ("cannot declare `main' to be a template"); | |
faae18ab | 8274 | if (inlinep) |
8251199e | 8275 | error ("cannot declare `main' to be inline"); |
faae18ab | 8276 | else if (! publicp) |
8251199e | 8277 | error ("cannot declare `main' to be static"); |
faae18ab MS |
8278 | inlinep = 0; |
8279 | publicp = 1; | |
8280 | } | |
50a6dbd7 | 8281 | |
59e76fc6 JM |
8282 | /* Members of anonymous types and local classes have no linkage; make |
8283 | them internal. */ | |
8284 | if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype)) | |
8285 | || hack_decl_function_context (TYPE_MAIN_DECL (ctype)))) | |
50a6dbd7 JM |
8286 | publicp = 0; |
8287 | ||
8288 | if (publicp) | |
8289 | { | |
8290 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
8291 | or enumeration declared in a local scope) shall not be used to | |
8292 | declare an entity with linkage. | |
8293 | ||
8294 | Only check this for public decls for now. */ | |
8295 | t = no_linkage_check (TREE_TYPE (decl)); | |
8296 | if (t) | |
8297 | { | |
7f7c930e JM |
8298 | if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) |
8299 | { | |
8300 | if (DECL_LANGUAGE (decl) == lang_c) | |
8301 | /* Allow this; it's pretty common in C. */; | |
8302 | else | |
8303 | cp_pedwarn ("non-local function `%#D' uses anonymous type", | |
8304 | decl); | |
8305 | } | |
50a6dbd7 | 8306 | else |
8251199e | 8307 | cp_pedwarn ("non-local function `%#D' uses local type `%T'", |
cce2be43 | 8308 | decl, t); |
50a6dbd7 JM |
8309 | } |
8310 | } | |
8311 | ||
893de33c | 8312 | TREE_PUBLIC (decl) = publicp; |
faae18ab | 8313 | if (! publicp) |
893de33c JM |
8314 | { |
8315 | DECL_INTERFACE_KNOWN (decl) = 1; | |
8316 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
8317 | } | |
faae18ab MS |
8318 | |
8319 | if (inlinep) | |
8320 | DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1; | |
8d08fdba MS |
8321 | |
8322 | DECL_EXTERNAL (decl) = 1; | |
8323 | if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE) | |
8324 | { | |
8251199e | 8325 | cp_error ("%smember function `%D' cannot have `%T' method qualifier", |
8d08fdba MS |
8326 | (ctype ? "static " : "non-"), decl, TREE_VALUE (quals)); |
8327 | quals = NULL_TREE; | |
8328 | } | |
8329 | ||
8330 | if (IDENTIFIER_OPNAME_P (DECL_NAME (decl))) | |
8331 | grok_op_properties (decl, virtualp, check < 0); | |
8332 | ||
e76a2646 | 8333 | if (ctype && hack_decl_function_context (decl)) |
893de33c | 8334 | DECL_NO_STATIC_CHAIN (decl) = 1; |
e76a2646 | 8335 | |
42976354 BK |
8336 | for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t)) |
8337 | if (TREE_PURPOSE (t) | |
8338 | && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) | |
8339 | { | |
856216bb | 8340 | has_default_arg = 1; |
42976354 BK |
8341 | break; |
8342 | } | |
8343 | ||
f9d94ea4 JM |
8344 | if (friendp |
8345 | && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR) | |
8346 | { | |
8347 | if (funcdef_flag) | |
8251199e JM |
8348 | cp_error |
8349 | ("defining explicit specialization `%D' in friend declaration", | |
f9d94ea4 JM |
8350 | orig_declarator); |
8351 | else | |
8352 | { | |
7e2421f7 MM |
8353 | if (PROCESSING_REAL_TEMPLATE_DECL_P ()) |
8354 | { | |
8355 | /* Something like `template <class T> friend void f<T>()'. */ | |
8251199e | 8356 | cp_error ("template-id `%D' in declaration of primary template", |
7e2421f7 | 8357 | orig_declarator); |
20496fa2 | 8358 | return NULL_TREE; |
7e2421f7 MM |
8359 | } |
8360 | ||
856216bb | 8361 | |
f9d94ea4 JM |
8362 | /* A friend declaration of the form friend void f<>(). Record |
8363 | the information in the TEMPLATE_ID_EXPR. */ | |
8364 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
8365 | DECL_TEMPLATE_INFO (decl) | |
e1b3e07d MM |
8366 | = tree_cons (TREE_OPERAND (orig_declarator, 0), |
8367 | TREE_OPERAND (orig_declarator, 1), | |
8368 | NULL_TREE); | |
856216bb MM |
8369 | |
8370 | if (has_default_arg) | |
8371 | { | |
8372 | cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'", | |
8373 | decl); | |
8374 | return NULL_TREE; | |
8375 | } | |
8376 | ||
8377 | if (inlinep) | |
8378 | { | |
8379 | cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'", | |
8380 | decl); | |
8381 | return NULL_TREE; | |
8382 | } | |
f9d94ea4 | 8383 | } |
f84b4be9 | 8384 | } |
386b8a85 | 8385 | |
856216bb MM |
8386 | if (has_default_arg) |
8387 | add_defarg_fn (decl); | |
8388 | ||
0f8766b8 JM |
8389 | /* Plain overloading: will not be grok'd by grokclassfn. */ |
8390 | if (! ctype && ! processing_template_decl | |
8391 | && DECL_LANGUAGE (decl) != lang_c | |
8392 | && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1)) | |
8393 | set_mangled_name_for_decl (decl); | |
8394 | ||
1eb0072d JM |
8395 | if (funcdef_flag) |
8396 | /* Make the init_value nonzero so pushdecl knows this is not | |
8397 | tentative. error_mark_node is replaced later with the BLOCK. */ | |
8398 | DECL_INITIAL (decl) = error_mark_node; | |
8399 | ||
75650646 | 8400 | /* Caller will do the rest of this. */ |
8d08fdba MS |
8401 | if (check < 0) |
8402 | return decl; | |
8403 | ||
5566b478 | 8404 | if (check && funcdef_flag) |
d2e5ee5c | 8405 | DECL_INITIAL (decl) = error_mark_node; |
5566b478 | 8406 | |
8d08fdba MS |
8407 | if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator) |
8408 | { | |
8409 | tree tmp; | |
8410 | /* Just handle constructors here. We could do this | |
8411 | inside the following if stmt, but I think | |
8412 | that the code is more legible by breaking this | |
8413 | case out. See comments below for what each of | |
8414 | the following calls is supposed to do. */ | |
8415 | DECL_CONSTRUCTOR_P (decl) = 1; | |
8416 | ||
b370501f | 8417 | grokclassfn (ctype, decl, flags, quals); |
386b8a85 | 8418 | |
e1467ff2 MM |
8419 | decl = check_explicit_specialization (orig_declarator, decl, |
8420 | template_count, | |
f84b4be9 JM |
8421 | 2 * (funcdef_flag != 0) + |
8422 | 4 * (friendp != 0)); | |
6c30752f | 8423 | if (decl == error_mark_node) |
20496fa2 | 8424 | return NULL_TREE; |
75650646 | 8425 | |
b370501f | 8426 | if ((! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) |
eff71ab0 | 8427 | && check) |
5566b478 MS |
8428 | { |
8429 | tmp = check_classfn (ctype, decl); | |
98c1c668 JM |
8430 | |
8431 | if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL) | |
8432 | tmp = DECL_TEMPLATE_RESULT(tmp); | |
8433 | ||
e349ee73 | 8434 | if (tmp && DECL_ARTIFICIAL (tmp)) |
8251199e | 8435 | cp_error ("definition of implicitly-declared `%D'", tmp); |
5566b478 MS |
8436 | if (tmp && duplicate_decls (decl, tmp)) |
8437 | return tmp; | |
8438 | } | |
a0a33927 | 8439 | if (! grok_ctor_properties (ctype, decl)) |
20496fa2 | 8440 | return NULL_TREE; |
8d08fdba MS |
8441 | } |
8442 | else | |
8443 | { | |
8444 | tree tmp; | |
8445 | ||
8446 | /* Function gets the ugly name, field gets the nice one. | |
8447 | This call may change the type of the function (because | |
8448 | of default parameters)! */ | |
8449 | if (ctype != NULL_TREE) | |
b370501f | 8450 | grokclassfn (ctype, decl, flags, quals); |
8d08fdba | 8451 | |
e1467ff2 MM |
8452 | decl = check_explicit_specialization (orig_declarator, decl, |
8453 | template_count, | |
f84b4be9 JM |
8454 | 2 * (funcdef_flag != 0) + |
8455 | 4 * (friendp != 0)); | |
6c30752f | 8456 | if (decl == error_mark_node) |
20496fa2 | 8457 | return NULL_TREE; |
6c30752f | 8458 | |
eff71ab0 | 8459 | if (ctype != NULL_TREE |
b370501f | 8460 | && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl)) |
eff71ab0 | 8461 | && check) |
5566b478 MS |
8462 | { |
8463 | tmp = check_classfn (ctype, decl); | |
98c1c668 JM |
8464 | |
8465 | if (tmp && TREE_CODE (tmp) == TEMPLATE_DECL) | |
75650646 | 8466 | tmp = DECL_TEMPLATE_RESULT (tmp); |
98c1c668 | 8467 | |
5566b478 MS |
8468 | if (tmp && DECL_STATIC_FUNCTION_P (tmp) |
8469 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
8470 | { | |
8471 | /* Remove the `this' parm added by grokclassfn. | |
8472 | XXX Isn't this done in start_function, too? */ | |
8473 | revert_static_member_fn (&decl, NULL, NULL); | |
8474 | last_function_parms = TREE_CHAIN (last_function_parms); | |
8475 | } | |
e349ee73 | 8476 | if (tmp && DECL_ARTIFICIAL (tmp)) |
8251199e | 8477 | cp_error ("definition of implicitly-declared `%D'", tmp); |
7834ab39 MS |
8478 | if (tmp) |
8479 | { | |
03017874 MM |
8480 | /* Attempt to merge the declarations. This can fail, in |
8481 | the case of some illegal specialization declarations. */ | |
7834ab39 | 8482 | if (!duplicate_decls (decl, tmp)) |
03017874 MM |
8483 | cp_error ("no `%#D' member function declared in class `%T'", |
8484 | decl, ctype); | |
7834ab39 MS |
8485 | return tmp; |
8486 | } | |
5566b478 | 8487 | } |
8d08fdba MS |
8488 | |
8489 | if (ctype == NULL_TREE || check) | |
8490 | return decl; | |
8491 | ||
8d08fdba MS |
8492 | if (virtualp) |
8493 | { | |
2ee887f2 | 8494 | DECL_VIRTUAL_P (decl) = 1; |
8d08fdba MS |
8495 | if (DECL_VINDEX (decl) == NULL_TREE) |
8496 | DECL_VINDEX (decl) = error_mark_node; | |
8497 | IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1; | |
8d08fdba MS |
8498 | } |
8499 | } | |
8500 | return decl; | |
8501 | } | |
8502 | ||
8503 | static tree | |
2c73f9f5 | 8504 | grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace) |
8d08fdba MS |
8505 | tree type; |
8506 | tree declarator; | |
d2e5ee5c | 8507 | RID_BIT_TYPE *specbits_in; |
8d08fdba | 8508 | int initialized; |
a9aedbc2 | 8509 | int constp; |
2c73f9f5 | 8510 | tree in_namespace; |
8d08fdba MS |
8511 | { |
8512 | tree decl; | |
f7da6097 MS |
8513 | RID_BIT_TYPE specbits; |
8514 | ||
8515 | specbits = *specbits_in; | |
8d08fdba MS |
8516 | |
8517 | if (TREE_CODE (type) == OFFSET_TYPE) | |
8518 | { | |
8519 | /* If you declare a static member so that it | |
8520 | can be initialized, the code will reach here. */ | |
5b605f68 MS |
8521 | tree basetype = TYPE_OFFSET_BASETYPE (type); |
8522 | type = TREE_TYPE (type); | |
4ce3d537 | 8523 | decl = build_lang_decl (VAR_DECL, declarator, type); |
5b605f68 MS |
8524 | DECL_CONTEXT (decl) = basetype; |
8525 | DECL_CLASS_CONTEXT (decl) = basetype; | |
f376e137 | 8526 | DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype, declarator); |
8d08fdba MS |
8527 | } |
8528 | else | |
30394414 | 8529 | { |
79c4d4b7 JM |
8530 | tree context; |
8531 | ||
8532 | if (in_namespace) | |
8533 | context = in_namespace; | |
8534 | else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits)) | |
8535 | context = current_namespace; | |
820fcad8 JM |
8536 | else |
8537 | context = NULL_TREE; | |
79c4d4b7 | 8538 | |
9188c363 MM |
8539 | if (processing_template_decl) |
8540 | { | |
8541 | /* If we're in a template, we need DECL_LANG_SPECIFIC so that | |
8542 | we can call push_template_decl. */ | |
8543 | push_permanent_obstack (); | |
c82dbd95 | 8544 | decl = build_lang_decl (VAR_DECL, declarator, type); |
9188c363 MM |
8545 | pop_obstacks (); |
8546 | } | |
8547 | else | |
c82dbd95 | 8548 | decl = build_decl (VAR_DECL, declarator, type); |
79c4d4b7 JM |
8549 | |
8550 | if (context) | |
b262d64c | 8551 | set_decl_namespace (decl, context, 0); |
79c4d4b7 JM |
8552 | |
8553 | context = DECL_CONTEXT (decl); | |
8554 | if (declarator && context && current_lang_name != lang_name_c) | |
8555 | DECL_ASSEMBLER_NAME (decl) = build_static_name (context, declarator); | |
30394414 | 8556 | } |
6060a796 | 8557 | |
2c73f9f5 | 8558 | if (in_namespace) |
b262d64c | 8559 | set_decl_namespace (decl, in_namespace, 0); |
2c73f9f5 | 8560 | |
8d08fdba MS |
8561 | if (RIDBIT_SETP (RID_EXTERN, specbits)) |
8562 | { | |
8563 | DECL_THIS_EXTERN (decl) = 1; | |
8564 | DECL_EXTERNAL (decl) = !initialized; | |
8565 | } | |
8566 | ||
8567 | /* In class context, static means one per class, | |
8568 | public access, and static storage. */ | |
2b9dc906 | 8569 | if (DECL_CLASS_SCOPE_P (decl)) |
8d08fdba MS |
8570 | { |
8571 | TREE_PUBLIC (decl) = 1; | |
8572 | TREE_STATIC (decl) = 1; | |
5b605f68 | 8573 | DECL_EXTERNAL (decl) = 0; |
8d08fdba MS |
8574 | } |
8575 | /* At top level, either `static' or no s.c. makes a definition | |
8576 | (perhaps tentative), and absence of `static' makes it public. */ | |
a9aedbc2 | 8577 | else if (toplevel_bindings_p ()) |
8d08fdba | 8578 | { |
a9aedbc2 | 8579 | TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits) |
9fffd093 | 8580 | && (DECL_THIS_EXTERN (decl) || ! constp)); |
8d08fdba MS |
8581 | TREE_STATIC (decl) = ! DECL_EXTERNAL (decl); |
8582 | } | |
8583 | /* Not at top level, only `static' makes a static definition. */ | |
8584 | else | |
8585 | { | |
8586 | TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits); | |
8587 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl); | |
8588 | } | |
50a6dbd7 JM |
8589 | |
8590 | if (TREE_PUBLIC (decl)) | |
8591 | { | |
8592 | /* [basic.link]: A name with no linkage (notably, the name of a class | |
8593 | or enumeration declared in a local scope) shall not be used to | |
8594 | declare an entity with linkage. | |
8595 | ||
8596 | Only check this for public decls for now. */ | |
8597 | tree t = no_linkage_check (TREE_TYPE (decl)); | |
8598 | if (t) | |
8599 | { | |
8600 | if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t))) | |
8601 | /* Ignore for now; `enum { foo } e' is pretty common. */; | |
8602 | else | |
8251199e | 8603 | cp_pedwarn ("non-local variable `%#D' uses local type `%T'", |
50a6dbd7 JM |
8604 | decl, t); |
8605 | } | |
8606 | } | |
8607 | ||
8d08fdba MS |
8608 | return decl; |
8609 | } | |
8610 | ||
d8f8dca1 MM |
8611 | /* Create and return a canonical pointer to member function type, for |
8612 | TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */ | |
8d08fdba MS |
8613 | |
8614 | tree | |
8615 | build_ptrmemfunc_type (type) | |
8616 | tree type; | |
8617 | { | |
8618 | tree fields[4]; | |
8619 | tree t; | |
8620 | tree u; | |
46cbda4a | 8621 | tree unqualified_variant = NULL_TREE; |
8d08fdba MS |
8622 | |
8623 | /* If a canonical type already exists for this type, use it. We use | |
8624 | this method instead of type_hash_canon, because it only does a | |
8625 | simple equality check on the list of field members. */ | |
8626 | ||
8627 | if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type))) | |
8628 | return t; | |
8629 | ||
46cbda4a MM |
8630 | /* Make sure that we always have the unqualified pointer-to-member |
8631 | type first. */ | |
8632 | if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED) | |
8633 | unqualified_variant | |
8634 | = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type)); | |
8635 | ||
8d08fdba MS |
8636 | push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type)); |
8637 | ||
8638 | u = make_lang_type (UNION_TYPE); | |
7ddedda4 | 8639 | SET_IS_AGGR_TYPE (u, 0); |
4ce3d537 MM |
8640 | fields[0] = build_lang_decl (FIELD_DECL, pfn_identifier, type); |
8641 | fields[1] = build_lang_decl (FIELD_DECL, delta2_identifier, | |
8642 | delta_type_node); | |
8d08fdba MS |
8643 | finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node); |
8644 | TYPE_NAME (u) = NULL_TREE; | |
8645 | ||
8646 | t = make_lang_type (RECORD_TYPE); | |
8647 | ||
2c73f9f5 | 8648 | /* Let the front-end know this is a pointer to member function... */ |
db5ae43f | 8649 | TYPE_PTRMEMFUNC_FLAG (t) = 1; |
2c73f9f5 | 8650 | /* ... and not really an aggregate. */ |
7ddedda4 | 8651 | SET_IS_AGGR_TYPE (t, 0); |
8d08fdba | 8652 | |
4ce3d537 MM |
8653 | fields[0] = build_lang_decl (FIELD_DECL, delta_identifier, |
8654 | delta_type_node); | |
8655 | fields[1] = build_lang_decl (FIELD_DECL, index_identifier, | |
8656 | delta_type_node); | |
8657 | fields[2] = build_lang_decl (FIELD_DECL, pfn_or_delta2_identifier, u); | |
8d08fdba MS |
8658 | finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node); |
8659 | ||
8660 | pop_obstacks (); | |
8661 | ||
8662 | /* Zap out the name so that the back-end will give us the debugging | |
8663 | information for this anonymous RECORD_TYPE. */ | |
8664 | TYPE_NAME (t) = NULL_TREE; | |
8665 | ||
46cbda4a MM |
8666 | /* If this is not the unqualified form of this pointer-to-member |
8667 | type, set the TYPE_MAIN_VARIANT for this type to be the | |
8668 | unqualified type. Since they are actually RECORD_TYPEs that are | |
8669 | not variants of each other, we must do this manually. */ | |
8670 | if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED) | |
8671 | { | |
8672 | t = build_qualified_type (t, CP_TYPE_QUALS (type)); | |
8673 | TYPE_MAIN_VARIANT (t) = unqualified_variant; | |
8674 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant); | |
8675 | TYPE_NEXT_VARIANT (unqualified_variant) = t; | |
8676 | } | |
8677 | ||
8678 | /* Cache this pointer-to-member type so that we can find it again | |
8679 | later. */ | |
8d08fdba MS |
8680 | TYPE_SET_PTRMEMFUNC_TYPE (type, t); |
8681 | ||
e92cc029 | 8682 | /* Seems to be wanted. */ |
8d08fdba | 8683 | CLASSTYPE_GOT_SEMICOLON (t) = 1; |
46cbda4a | 8684 | |
8d08fdba MS |
8685 | return t; |
8686 | } | |
8687 | ||
b17e2870 JM |
8688 | /* DECL is a VAR_DECL defined in-class, whose TYPE is also given. |
8689 | Check to see that the definition is valid. Issue appropriate error | |
8690 | messages. Return 1 if the definition is particularly bad, or 0 | |
8691 | otherwise. */ | |
8692 | ||
8693 | int | |
8694 | check_static_variable_definition (decl, type) | |
8695 | tree decl; | |
8696 | tree type; | |
8697 | { | |
8698 | /* Motion 10 at San Diego: If a static const integral data member is | |
8699 | initialized with an integral constant expression, the initializer | |
8700 | may appear either in the declaration (within the class), or in | |
8701 | the definition, but not both. If it appears in the class, the | |
8702 | member is a member constant. The file-scope definition is always | |
8703 | required. */ | |
8704 | if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE) | |
8705 | { | |
8706 | cp_error ("in-class initialization of static data member of non-integral type `%T'", | |
8707 | type); | |
8708 | /* If we just return the declaration, crashes will sometimes | |
8709 | occur. We therefore return void_type_node, as if this was a | |
8710 | friend declaration, to cause callers to completely ignore | |
8711 | this declaration. */ | |
8712 | return 1; | |
8713 | } | |
8714 | else if (!CP_TYPE_CONST_P (type)) | |
8715 | cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'", | |
8716 | decl); | |
8717 | else if (pedantic && !INTEGRAL_TYPE_P (type)) | |
8718 | cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type); | |
8719 | ||
8720 | return 0; | |
8721 | } | |
8722 | ||
8d08fdba MS |
8723 | /* Given declspecs and a declarator, |
8724 | determine the name and type of the object declared | |
8725 | and construct a ..._DECL node for it. | |
8726 | (In one case we can return a ..._TYPE node instead. | |
8727 | For invalid input we sometimes return 0.) | |
8728 | ||
8729 | DECLSPECS is a chain of tree_list nodes whose value fields | |
8730 | are the storage classes and type specifiers. | |
8731 | ||
8732 | DECL_CONTEXT says which syntactic context this declaration is in: | |
8733 | NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL. | |
8734 | FUNCDEF for a function definition. Like NORMAL but a few different | |
8735 | error messages in each case. Return value may be zero meaning | |
8736 | this definition is too screwy to try to parse. | |
8737 | MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to | |
8738 | handle member functions (which have FIELD context). | |
8739 | Return value may be zero meaning this definition is too screwy to | |
8740 | try to parse. | |
8741 | PARM for a parameter declaration (either within a function prototype | |
8742 | or before a function body). Make a PARM_DECL, or return void_type_node. | |
db5ae43f | 8743 | CATCHPARM for a parameter declaration before a catch clause. |
8d08fdba MS |
8744 | TYPENAME if for a typename (in a cast or sizeof). |
8745 | Don't make a DECL node; just return the ..._TYPE node. | |
8746 | FIELD for a struct or union field; make a FIELD_DECL. | |
8747 | BITFIELD for a field with specified width. | |
8748 | INITIALIZED is 1 if the decl has an initializer. | |
8749 | ||
b17e2870 JM |
8750 | ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and |
8751 | normal attributes in TREE_PURPOSE, or NULL_TREE. | |
8752 | ||
8d08fdba MS |
8753 | In the TYPENAME case, DECLARATOR is really an absolute declarator. |
8754 | It may also be so in the PARM case, for a prototype where the | |
8755 | argument type is specified but not the name. | |
8756 | ||
8757 | This function is where the complicated C meanings of `static' | |
8758 | and `extern' are interpreted. | |
8759 | ||
8760 | For C++, if there is any monkey business to do, the function which | |
8761 | calls this one must do it, i.e., prepending instance variables, | |
8762 | renaming overloaded function names, etc. | |
8763 | ||
8764 | Note that for this C++, it is an error to define a method within a class | |
8765 | which does not belong to that class. | |
8766 | ||
8767 | Except in the case where SCOPE_REFs are implicitly known (such as | |
8768 | methods within a class being redundantly qualified), | |
8769 | declarations which involve SCOPE_REFs are returned as SCOPE_REFs | |
8770 | (class_name::decl_name). The caller must also deal with this. | |
8771 | ||
8772 | If a constructor or destructor is seen, and the context is FIELD, | |
8773 | then the type gains the attribute TREE_HAS_x. If such a declaration | |
8774 | is erroneous, NULL_TREE is returned. | |
8775 | ||
8776 | QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member | |
8777 | function, these are the qualifiers to give to the `this' pointer. | |
8778 | ||
8779 | May return void_type_node if the declarator turned out to be a friend. | |
8780 | See grokfield for details. */ | |
8781 | ||
8782 | enum return_types { return_normal, return_ctor, return_dtor, return_conversion }; | |
8783 | ||
8784 | tree | |
c11b6f21 | 8785 | grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist) |
8d08fdba MS |
8786 | tree declspecs; |
8787 | tree declarator; | |
8788 | enum decl_context decl_context; | |
8789 | int initialized; | |
c11b6f21 | 8790 | tree attrlist; |
8d08fdba MS |
8791 | { |
8792 | RID_BIT_TYPE specbits; | |
8793 | int nclasses = 0; | |
8794 | tree spec; | |
8795 | tree type = NULL_TREE; | |
8796 | int longlong = 0; | |
8797 | int constp; | |
91063b51 | 8798 | int restrictp; |
8d08fdba | 8799 | int volatilep; |
91063b51 | 8800 | int type_quals; |
db5ae43f | 8801 | int virtualp, explicitp, friendp, inlinep, staticp; |
8d08fdba MS |
8802 | int explicit_int = 0; |
8803 | int explicit_char = 0; | |
37c46b43 | 8804 | int defaulted_int = 0; |
8d08fdba | 8805 | tree typedef_decl = NULL_TREE; |
9c0758dd | 8806 | const char *name; |
8d08fdba MS |
8807 | tree typedef_type = NULL_TREE; |
8808 | int funcdef_flag = 0; | |
8809 | enum tree_code innermost_code = ERROR_MARK; | |
8810 | int bitfield = 0; | |
6125f3be DE |
8811 | #if 0 |
8812 | /* See the code below that used this. */ | |
f6abb50a | 8813 | tree decl_machine_attr = NULL_TREE; |
6125f3be | 8814 | #endif |
8d08fdba MS |
8815 | /* Set this to error_mark_node for FIELD_DECLs we could not handle properly. |
8816 | All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */ | |
8817 | tree init = NULL_TREE; | |
8818 | ||
8819 | /* Keep track of what sort of function is being processed | |
8820 | so that we can warn about default return values, or explicit | |
8821 | return values which do not match prescribed defaults. */ | |
8822 | enum return_types return_type = return_normal; | |
8823 | ||
8824 | tree dname = NULL_TREE; | |
8825 | tree ctype = current_class_type; | |
8826 | tree ctor_return_type = NULL_TREE; | |
8827 | enum overload_flags flags = NO_SPECIAL; | |
8d08fdba | 8828 | tree quals = NULL_TREE; |
c11b6f21 | 8829 | tree raises = NULL_TREE; |
386b8a85 | 8830 | int template_count = 0; |
2c73f9f5 | 8831 | tree in_namespace = NULL_TREE; |
1eab9b56 JM |
8832 | tree inner_attrs; |
8833 | int ignore_attrs; | |
8d08fdba MS |
8834 | |
8835 | RIDBIT_RESET_ALL (specbits); | |
8836 | if (decl_context == FUNCDEF) | |
8837 | funcdef_flag = 1, decl_context = NORMAL; | |
8838 | else if (decl_context == MEMFUNCDEF) | |
8839 | funcdef_flag = -1, decl_context = FIELD; | |
8840 | else if (decl_context == BITFIELD) | |
8841 | bitfield = 1, decl_context = FIELD; | |
8842 | ||
8d08fdba MS |
8843 | /* Look inside a declarator for the name being declared |
8844 | and get it as a string, for an error message. */ | |
8845 | { | |
be99da77 MS |
8846 | tree *next = &declarator; |
8847 | register tree decl; | |
8d08fdba MS |
8848 | name = NULL; |
8849 | ||
be99da77 MS |
8850 | while (next && *next) |
8851 | { | |
8852 | decl = *next; | |
8853 | switch (TREE_CODE (decl)) | |
8d08fdba | 8854 | { |
52fbc847 JM |
8855 | case TREE_LIST: |
8856 | /* For attributes. */ | |
8857 | next = &TREE_VALUE (decl); | |
8858 | break; | |
8859 | ||
be99da77 MS |
8860 | case COND_EXPR: |
8861 | ctype = NULL_TREE; | |
8862 | next = &TREE_OPERAND (decl, 0); | |
8863 | break; | |
8d08fdba | 8864 | |
2c73f9f5 | 8865 | case BIT_NOT_EXPR: /* For C++ destructors! */ |
8d08fdba | 8866 | { |
be99da77 MS |
8867 | tree name = TREE_OPERAND (decl, 0); |
8868 | tree rename = NULL_TREE; | |
8869 | ||
8870 | my_friendly_assert (flags == NO_SPECIAL, 152); | |
8871 | flags = DTOR_FLAG; | |
8872 | return_type = return_dtor; | |
5566b478 MS |
8873 | if (TREE_CODE (name) == TYPE_DECL) |
8874 | TREE_OPERAND (decl, 0) = name = constructor_name (name); | |
be99da77 MS |
8875 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153); |
8876 | if (ctype == NULL_TREE) | |
8877 | { | |
8878 | if (current_class_type == NULL_TREE) | |
8879 | { | |
8251199e | 8880 | error ("destructors must be member functions"); |
be99da77 MS |
8881 | flags = NO_SPECIAL; |
8882 | } | |
8883 | else | |
8884 | { | |
8885 | tree t = constructor_name (current_class_name); | |
8886 | if (t != name) | |
8887 | rename = t; | |
8888 | } | |
8889 | } | |
8d08fdba | 8890 | else |
be99da77 MS |
8891 | { |
8892 | tree t = constructor_name (ctype); | |
8893 | if (t != name) | |
8894 | rename = t; | |
8895 | } | |
51c184be | 8896 | |
be99da77 | 8897 | if (rename) |
39211cd5 | 8898 | { |
8251199e | 8899 | cp_error ("destructor `%T' must match class name `%T'", |
5566b478 | 8900 | name, rename); |
be99da77 | 8901 | TREE_OPERAND (decl, 0) = rename; |
39211cd5 | 8902 | } |
be99da77 | 8903 | next = &name; |
51c184be | 8904 | } |
be99da77 | 8905 | break; |
8d08fdba | 8906 | |
be99da77 | 8907 | case ADDR_EXPR: /* C++ reference declaration */ |
2c73f9f5 | 8908 | /* Fall through. */ |
be99da77 MS |
8909 | case ARRAY_REF: |
8910 | case INDIRECT_REF: | |
8911 | ctype = NULL_TREE; | |
8912 | innermost_code = TREE_CODE (decl); | |
8913 | next = &TREE_OPERAND (decl, 0); | |
8914 | break; | |
8d08fdba | 8915 | |
be99da77 | 8916 | case CALL_EXPR: |
43f887f9 | 8917 | if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl))) |
8d08fdba | 8918 | { |
b17e2870 JM |
8919 | /* This is actually a variable declaration using |
8920 | constructor syntax. We need to call start_decl and | |
8921 | cp_finish_decl so we can get the variable | |
8922 | initialized... */ | |
8923 | ||
8924 | tree attributes, prefix_attributes; | |
be99da77 MS |
8925 | |
8926 | *next = TREE_OPERAND (decl, 0); | |
43f887f9 | 8927 | init = CALL_DECLARATOR_PARMS (decl); |
be99da77 | 8928 | |
b17e2870 JM |
8929 | if (attrlist) |
8930 | { | |
8931 | attributes = TREE_PURPOSE (attrlist); | |
8932 | prefix_attributes = TREE_VALUE (attrlist); | |
8933 | } | |
8934 | else | |
8935 | { | |
8936 | attributes = NULL_TREE; | |
8937 | prefix_attributes = NULL_TREE; | |
8938 | } | |
8939 | ||
8940 | decl = start_decl (declarator, declspecs, 1, | |
8941 | attributes, prefix_attributes); | |
1eb0072d JM |
8942 | if (decl) |
8943 | { | |
8944 | /* Look for __unused__ attribute */ | |
8945 | if (TREE_USED (TREE_TYPE (decl))) | |
8946 | TREE_USED (decl) = 1; | |
8947 | finish_decl (decl, init, NULL_TREE); | |
8948 | } | |
8949 | else | |
8950 | cp_error ("invalid declarator"); | |
be99da77 | 8951 | return 0; |
8d08fdba | 8952 | } |
be99da77 MS |
8953 | innermost_code = TREE_CODE (decl); |
8954 | if (decl_context == FIELD && ctype == NULL_TREE) | |
8955 | ctype = current_class_type; | |
45537677 | 8956 | if (ctype |
c11b6f21 | 8957 | && TREE_OPERAND (decl, 0) |
45537677 MS |
8958 | && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL |
8959 | && ((DECL_NAME (TREE_OPERAND (decl, 0)) | |
8960 | == constructor_name_full (ctype)) | |
8961 | || (DECL_NAME (TREE_OPERAND (decl, 0)) | |
8962 | == constructor_name (ctype))))) | |
be99da77 MS |
8963 | TREE_OPERAND (decl, 0) = constructor_name (ctype); |
8964 | next = &TREE_OPERAND (decl, 0); | |
8965 | decl = *next; | |
8966 | if (ctype != NULL_TREE | |
8967 | && decl != NULL_TREE && flags != DTOR_FLAG | |
8968 | && decl == constructor_name (ctype)) | |
8d08fdba | 8969 | { |
be99da77 MS |
8970 | return_type = return_ctor; |
8971 | ctor_return_type = ctype; | |
8d08fdba | 8972 | } |
be99da77 MS |
8973 | ctype = NULL_TREE; |
8974 | break; | |
386b8a85 JM |
8975 | |
8976 | case TEMPLATE_ID_EXPR: | |
8977 | { | |
8978 | tree fns = TREE_OPERAND (decl, 0); | |
8979 | ||
8980 | if (TREE_CODE (fns) == LOOKUP_EXPR) | |
8981 | fns = TREE_OPERAND (fns, 0); | |
8982 | ||
8f032717 MM |
8983 | dname = fns; |
8984 | if (TREE_CODE (dname) == COMPONENT_REF) | |
8985 | dname = TREE_OPERAND (dname, 1); | |
8986 | if (TREE_CODE (dname) != IDENTIFIER_NODE) | |
8987 | { | |
8988 | my_friendly_assert (is_overloaded_fn (dname), | |
8989 | 19990331); | |
8990 | dname = DECL_NAME (get_first_fn (dname)); | |
8991 | } | |
386b8a85 | 8992 | } |
2c73f9f5 | 8993 | /* Fall through. */ |
be99da77 MS |
8994 | |
8995 | case IDENTIFIER_NODE: | |
386b8a85 JM |
8996 | if (TREE_CODE (decl) == IDENTIFIER_NODE) |
8997 | dname = decl; | |
8998 | ||
be99da77 MS |
8999 | next = 0; |
9000 | ||
9001 | if (is_rid (dname)) | |
8d08fdba | 9002 | { |
8251199e | 9003 | cp_error ("declarator-id missing; using reserved word `%D'", |
be99da77 MS |
9004 | dname); |
9005 | name = IDENTIFIER_POINTER (dname); | |
8d08fdba | 9006 | } |
be99da77 | 9007 | if (! IDENTIFIER_OPNAME_P (dname) |
956d6950 | 9008 | /* GNU/Linux headers use '__op'. Arrgh. */ |
a703fb38 | 9009 | || (IDENTIFIER_TYPENAME_P (dname) && ! TREE_TYPE (dname))) |
be99da77 | 9010 | name = IDENTIFIER_POINTER (dname); |
8d08fdba MS |
9011 | else |
9012 | { | |
be99da77 | 9013 | if (IDENTIFIER_TYPENAME_P (dname)) |
8d08fdba | 9014 | { |
be99da77 MS |
9015 | my_friendly_assert (flags == NO_SPECIAL, 154); |
9016 | flags = TYPENAME_FLAG; | |
9017 | ctor_return_type = TREE_TYPE (dname); | |
9018 | return_type = return_conversion; | |
8d08fdba | 9019 | } |
be99da77 | 9020 | name = operator_name_string (dname); |
8d08fdba | 9021 | } |
be99da77 | 9022 | break; |
8d08fdba | 9023 | |
be99da77 MS |
9024 | /* C++ extension */ |
9025 | case SCOPE_REF: | |
9026 | { | |
9027 | /* Perform error checking, and decide on a ctype. */ | |
9028 | tree cname = TREE_OPERAND (decl, 0); | |
9029 | if (cname == NULL_TREE) | |
9030 | ctype = NULL_TREE; | |
2c73f9f5 ML |
9031 | else if (TREE_CODE (cname) == NAMESPACE_DECL) |
9032 | { | |
9033 | ctype = NULL_TREE; | |
9034 | in_namespace = TREE_OPERAND (decl, 0); | |
9035 | TREE_OPERAND (decl, 0) = NULL_TREE; | |
9036 | } | |
be99da77 MS |
9037 | else if (! is_aggr_type (cname, 1)) |
9038 | TREE_OPERAND (decl, 0) = NULL_TREE; | |
9039 | /* Must test TREE_OPERAND (decl, 1), in case user gives | |
9040 | us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */ | |
9041 | else if (TREE_OPERAND (decl, 1) | |
9042 | && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF) | |
9043 | ctype = cname; | |
73b0fce8 KL |
9044 | else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM |
9045 | || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM) | |
5566b478 | 9046 | { |
8251199e | 9047 | cp_error ("`%T::%D' is not a valid declarator", cname, |
5566b478 | 9048 | TREE_OPERAND (decl, 1)); |
8251199e | 9049 | cp_error (" perhaps you want `typename %T::%D' to make it a type", |
5566b478 MS |
9050 | cname, TREE_OPERAND (decl, 1)); |
9051 | return void_type_node; | |
9052 | } | |
be99da77 MS |
9053 | else if (ctype == NULL_TREE) |
9054 | ctype = cname; | |
9055 | else if (TREE_COMPLEXITY (decl) == current_class_depth) | |
9056 | TREE_OPERAND (decl, 0) = ctype; | |
9057 | else | |
9058 | { | |
9059 | if (! UNIQUELY_DERIVED_FROM_P (cname, ctype)) | |
9060 | { | |
8251199e | 9061 | cp_error ("type `%T' is not derived from type `%T'", |
be99da77 MS |
9062 | cname, ctype); |
9063 | TREE_OPERAND (decl, 0) = NULL_TREE; | |
9064 | } | |
9065 | else | |
9066 | ctype = cname; | |
9067 | } | |
9068 | ||
c91a56d2 MS |
9069 | if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL |
9070 | && ((DECL_NAME (TREE_OPERAND (decl, 1)) | |
9071 | == constructor_name_full (ctype)) | |
9072 | || (DECL_NAME (TREE_OPERAND (decl, 1)) | |
9073 | == constructor_name (ctype)))) | |
be99da77 MS |
9074 | TREE_OPERAND (decl, 1) = constructor_name (ctype); |
9075 | next = &TREE_OPERAND (decl, 1); | |
9076 | decl = *next; | |
9077 | if (ctype) | |
9078 | { | |
9079 | if (TREE_CODE (decl) == IDENTIFIER_NODE | |
9080 | && constructor_name (ctype) == decl) | |
9081 | { | |
9082 | return_type = return_ctor; | |
9083 | ctor_return_type = ctype; | |
9084 | } | |
9085 | else if (TREE_CODE (decl) == BIT_NOT_EXPR | |
9086 | && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE | |
9087 | && (constructor_name (ctype) == TREE_OPERAND (decl, 0) | |
9088 | || constructor_name_full (ctype) == TREE_OPERAND (decl, 0))) | |
9089 | { | |
9090 | return_type = return_dtor; | |
9091 | ctor_return_type = ctype; | |
9092 | flags = DTOR_FLAG; | |
9093 | TREE_OPERAND (decl, 0) = constructor_name (ctype); | |
9094 | next = &TREE_OPERAND (decl, 0); | |
9095 | } | |
9096 | } | |
9097 | } | |
9098 | break; | |
9099 | ||
9100 | case ERROR_MARK: | |
9101 | next = 0; | |
9102 | break; | |
9103 | ||
45537677 MS |
9104 | case TYPE_DECL: |
9105 | /* Parse error puts this typespec where | |
9106 | a declarator should go. */ | |
8251199e | 9107 | cp_error ("`%T' specified as declarator-id", DECL_NAME (decl)); |
45537677 | 9108 | if (TREE_TYPE (decl) == current_class_type) |
8251199e | 9109 | cp_error (" perhaps you want `%T' for a constructor", |
45537677 MS |
9110 | current_class_name); |
9111 | dname = DECL_NAME (decl); | |
9112 | name = IDENTIFIER_POINTER (dname); | |
9113 | ||
e92cc029 | 9114 | /* Avoid giving two errors for this. */ |
45537677 MS |
9115 | IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE; |
9116 | ||
9117 | declspecs = temp_tree_cons (NULL_TREE, integer_type_node, | |
9118 | declspecs); | |
9119 | *next = dname; | |
9120 | next = 0; | |
9121 | break; | |
9122 | ||
be99da77 | 9123 | default: |
8251199e | 9124 | cp_compiler_error ("`%D' as declarator", decl); |
be99da77 | 9125 | return 0; /* We used to do a 155 abort here. */ |
8d08fdba | 9126 | } |
be99da77 | 9127 | } |
8d08fdba MS |
9128 | if (name == NULL) |
9129 | name = "type name"; | |
9130 | } | |
9131 | ||
9132 | /* A function definition's declarator must have the form of | |
9133 | a function declarator. */ | |
9134 | ||
9135 | if (funcdef_flag && innermost_code != CALL_EXPR) | |
9136 | return 0; | |
9137 | ||
e1cd6e56 MS |
9138 | if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG) |
9139 | && innermost_code != CALL_EXPR | |
9140 | && ! (ctype && declspecs == NULL_TREE)) | |
9141 | { | |
8251199e | 9142 | cp_error ("declaration of `%D' as non-function", dname); |
e1cd6e56 MS |
9143 | return void_type_node; |
9144 | } | |
9145 | ||
8d08fdba MS |
9146 | /* Anything declared one level down from the top level |
9147 | must be one of the parameters of a function | |
9148 | (because the body is at least two levels down). */ | |
9149 | ||
9150 | /* This heuristic cannot be applied to C++ nodes! Fixed, however, | |
9151 | by not allowing C++ class definitions to specify their parameters | |
9152 | with xdecls (must be spec.d in the parmlist). | |
9153 | ||
9154 | Since we now wait to push a class scope until we are sure that | |
9155 | we are in a legitimate method context, we must set oldcname | |
a9aedbc2 MS |
9156 | explicitly (since current_class_name is not yet alive). |
9157 | ||
9158 | We also want to avoid calling this a PARM if it is in a namespace. */ | |
8d08fdba | 9159 | |
9188c363 | 9160 | if (decl_context == NORMAL && !toplevel_bindings_p ()) |
a9aedbc2 MS |
9161 | { |
9162 | struct binding_level *b = current_binding_level; | |
9163 | current_binding_level = b->level_chain; | |
9164 | if (current_binding_level != 0 && toplevel_bindings_p ()) | |
9165 | decl_context = PARM; | |
9166 | current_binding_level = b; | |
9167 | } | |
8d08fdba MS |
9168 | |
9169 | /* Look through the decl specs and record which ones appear. | |
9170 | Some typespecs are defined as built-in typenames. | |
9171 | Others, the ones that are modifiers of other types, | |
9172 | are represented by bits in SPECBITS: set the bits for | |
9173 | the modifiers that appear. Storage class keywords are also in SPECBITS. | |
9174 | ||
9175 | If there is a typedef name or a type, store the type in TYPE. | |
9176 | This includes builtin typedefs such as `int'. | |
9177 | ||
9178 | Set EXPLICIT_INT if the type is `int' or `char' and did not | |
9179 | come from a user typedef. | |
9180 | ||
9181 | Set LONGLONG if `long' is mentioned twice. | |
9182 | ||
9183 | For C++, constructors and destructors have their own fast treatment. */ | |
9184 | ||
9185 | for (spec = declspecs; spec; spec = TREE_CHAIN (spec)) | |
9186 | { | |
9187 | register int i; | |
9188 | register tree id; | |
9189 | ||
9190 | /* Certain parse errors slip through. For example, | |
9191 | `int class;' is not caught by the parser. Try | |
9192 | weakly to recover here. */ | |
9193 | if (TREE_CODE (spec) != TREE_LIST) | |
9194 | return 0; | |
9195 | ||
9196 | id = TREE_VALUE (spec); | |
9197 | ||
9198 | if (TREE_CODE (id) == IDENTIFIER_NODE) | |
9199 | { | |
a3203465 MS |
9200 | if (id == ridpointers[(int) RID_INT] |
9201 | || id == ridpointers[(int) RID_CHAR] | |
9202 | || id == ridpointers[(int) RID_BOOL] | |
9203 | || id == ridpointers[(int) RID_WCHAR]) | |
8d08fdba MS |
9204 | { |
9205 | if (type) | |
8ccc31eb MS |
9206 | { |
9207 | if (id == ridpointers[(int) RID_BOOL]) | |
8251199e | 9208 | error ("`bool' is now a keyword"); |
8ccc31eb | 9209 | else |
8251199e | 9210 | cp_error ("extraneous `%T' ignored", id); |
8ccc31eb | 9211 | } |
8d08fdba MS |
9212 | else |
9213 | { | |
a3203465 MS |
9214 | if (id == ridpointers[(int) RID_INT]) |
9215 | explicit_int = 1; | |
9216 | else if (id == ridpointers[(int) RID_CHAR]) | |
9217 | explicit_char = 1; | |
8d08fdba MS |
9218 | type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id)); |
9219 | } | |
9220 | goto found; | |
9221 | } | |
e92cc029 | 9222 | /* C++ aggregate types. */ |
8d08fdba MS |
9223 | if (IDENTIFIER_HAS_TYPE_VALUE (id)) |
9224 | { | |
9225 | if (type) | |
8251199e | 9226 | cp_error ("multiple declarations `%T' and `%T'", type, id); |
8d08fdba MS |
9227 | else |
9228 | type = IDENTIFIER_TYPE_VALUE (id); | |
9229 | goto found; | |
9230 | } | |
9231 | ||
f376e137 | 9232 | for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++) |
8d08fdba MS |
9233 | { |
9234 | if (ridpointers[i] == id) | |
9235 | { | |
9236 | if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits)) | |
9237 | { | |
795add94 | 9238 | if (pedantic && ! in_system_header && warn_long_long) |
8251199e | 9239 | pedwarn ("ANSI C++ does not support `long long'"); |
9a3b49ac | 9240 | if (longlong) |
8251199e | 9241 | error ("`long long long' is too long for GCC"); |
8d08fdba MS |
9242 | else |
9243 | longlong = 1; | |
9244 | } | |
9245 | else if (RIDBIT_SETP (i, specbits)) | |
8251199e | 9246 | pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id)); |
8d08fdba MS |
9247 | RIDBIT_SET (i, specbits); |
9248 | goto found; | |
9249 | } | |
9250 | } | |
9251 | } | |
e92cc029 | 9252 | /* C++ aggregate types. */ |
73b0fce8 | 9253 | else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL) |
45537677 MS |
9254 | { |
9255 | if (type) | |
8251199e | 9256 | cp_error ("multiple declarations `%T' and `%T'", type, |
45537677 MS |
9257 | TREE_TYPE (id)); |
9258 | else | |
5566b478 MS |
9259 | { |
9260 | type = TREE_TYPE (id); | |
9261 | TREE_VALUE (spec) = type; | |
9262 | } | |
45537677 MS |
9263 | goto found; |
9264 | } | |
8d08fdba | 9265 | if (type) |
8251199e | 9266 | error ("two or more data types in declaration of `%s'", name); |
8d08fdba MS |
9267 | else if (TREE_CODE (id) == IDENTIFIER_NODE) |
9268 | { | |
9269 | register tree t = lookup_name (id, 1); | |
9270 | if (!t || TREE_CODE (t) != TYPE_DECL) | |
8251199e | 9271 | error ("`%s' fails to be a typedef or built in type", |
8d08fdba MS |
9272 | IDENTIFIER_POINTER (id)); |
9273 | else | |
9274 | { | |
9275 | type = TREE_TYPE (t); | |
6125f3be DE |
9276 | #if 0 |
9277 | /* See the code below that used this. */ | |
f6abb50a | 9278 | decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id); |
6125f3be | 9279 | #endif |
8d08fdba MS |
9280 | typedef_decl = t; |
9281 | } | |
9282 | } | |
bd6dd845 | 9283 | else if (id != error_mark_node) |
8d08fdba MS |
9284 | /* Can't change CLASS nodes into RECORD nodes here! */ |
9285 | type = id; | |
9286 | ||
9287 | found: ; | |
9288 | } | |
9289 | ||
9290 | typedef_type = type; | |
9291 | ||
37c46b43 | 9292 | /* No type at all: default to `int', and set DEFAULTED_INT |
6eabb241 | 9293 | because it was not a user-defined typedef. */ |
8d08fdba | 9294 | |
a3203465 MS |
9295 | if (type == NULL_TREE |
9296 | && (RIDBIT_SETP (RID_SIGNED, specbits) | |
9297 | || RIDBIT_SETP (RID_UNSIGNED, specbits) | |
9298 | || RIDBIT_SETP (RID_LONG, specbits) | |
9299 | || RIDBIT_SETP (RID_SHORT, specbits))) | |
9300 | { | |
9301 | /* These imply 'int'. */ | |
9302 | type = integer_type_node; | |
37c46b43 | 9303 | defaulted_int = 1; |
a3203465 MS |
9304 | } |
9305 | ||
8d08fdba MS |
9306 | if (type == NULL_TREE) |
9307 | { | |
9308 | explicit_int = -1; | |
9309 | if (return_type == return_dtor) | |
9310 | type = void_type_node; | |
9311 | else if (return_type == return_ctor) | |
f30432d7 | 9312 | type = build_pointer_type (ctor_return_type); |
51c184be MS |
9313 | else if (return_type == return_conversion) |
9314 | type = ctor_return_type; | |
8d08fdba MS |
9315 | else |
9316 | { | |
41eff652 JM |
9317 | /* We handle `main' specially here, because 'main () { }' is so |
9318 | common. With no options, it is allowed. With -Wreturn-type, | |
9319 | it is a warning. It is only an error with -pedantic-errors. */ | |
9320 | int is_main = (funcdef_flag | |
9321 | && MAIN_NAME_P (dname) | |
9322 | && ctype == NULL_TREE | |
9323 | && in_namespace == NULL_TREE | |
9324 | && current_namespace == global_namespace); | |
9325 | ||
d2c192ad | 9326 | if (in_system_header || flag_ms_extensions) |
1f901793 JM |
9327 | /* Allow it, sigh. */; |
9328 | else if (pedantic || ! is_main) | |
ff0cf464 JM |
9329 | cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type", |
9330 | dname); | |
41eff652 JM |
9331 | else if (warn_return_type) |
9332 | cp_warning ("ANSI C++ forbids declaration `%D' with no type", | |
9333 | dname); | |
9334 | ||
8d08fdba MS |
9335 | type = integer_type_node; |
9336 | } | |
9337 | } | |
9338 | else if (return_type == return_dtor) | |
9339 | { | |
8251199e | 9340 | error ("return type specification for destructor invalid"); |
8d08fdba MS |
9341 | type = void_type_node; |
9342 | } | |
9343 | else if (return_type == return_ctor) | |
9344 | { | |
8251199e | 9345 | error ("return type specification for constructor invalid"); |
f30432d7 | 9346 | type = build_pointer_type (ctor_return_type); |
8d08fdba | 9347 | } |
51c184be MS |
9348 | else if (return_type == return_conversion) |
9349 | { | |
3bfdc719 | 9350 | if (!same_type_p (type, ctor_return_type)) |
8251199e | 9351 | cp_error ("operator `%T' declared to return `%T'", |
51c184be MS |
9352 | ctor_return_type, type); |
9353 | else | |
8251199e | 9354 | cp_pedwarn ("return type specified for `operator %T'", |
51c184be MS |
9355 | ctor_return_type); |
9356 | ||
9357 | type = ctor_return_type; | |
9358 | } | |
8d08fdba MS |
9359 | |
9360 | ctype = NULL_TREE; | |
9361 | ||
9362 | /* Now process the modifiers that were specified | |
9363 | and check for invalid combinations. */ | |
9364 | ||
9365 | /* Long double is a special combination. */ | |
9366 | ||
9367 | if (RIDBIT_SETP (RID_LONG, specbits) | |
9368 | && TYPE_MAIN_VARIANT (type) == double_type_node) | |
9369 | { | |
9370 | RIDBIT_RESET (RID_LONG, specbits); | |
91063b51 MM |
9371 | type = build_qualified_type (long_double_type_node, |
9372 | CP_TYPE_QUALS (type)); | |
8d08fdba MS |
9373 | } |
9374 | ||
9375 | /* Check all other uses of type modifiers. */ | |
9376 | ||
9377 | if (RIDBIT_SETP (RID_UNSIGNED, specbits) | |
9378 | || RIDBIT_SETP (RID_SIGNED, specbits) | |
9379 | || RIDBIT_SETP (RID_LONG, specbits) | |
9380 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
9381 | { | |
9382 | int ok = 0; | |
9383 | ||
9384 | if (TREE_CODE (type) == REAL_TYPE) | |
8251199e | 9385 | error ("short, signed or unsigned invalid for `%s'", name); |
b7484fbe | 9386 | else if (TREE_CODE (type) != INTEGER_TYPE) |
8251199e | 9387 | error ("long, short, signed or unsigned invalid for `%s'", name); |
8d08fdba MS |
9388 | else if (RIDBIT_SETP (RID_LONG, specbits) |
9389 | && RIDBIT_SETP (RID_SHORT, specbits)) | |
8251199e | 9390 | error ("long and short specified together for `%s'", name); |
8d08fdba MS |
9391 | else if ((RIDBIT_SETP (RID_LONG, specbits) |
9392 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
9393 | && explicit_char) | |
8251199e | 9394 | error ("long or short specified with char for `%s'", name); |
8d08fdba MS |
9395 | else if ((RIDBIT_SETP (RID_LONG, specbits) |
9396 | || RIDBIT_SETP (RID_SHORT, specbits)) | |
9397 | && TREE_CODE (type) == REAL_TYPE) | |
8251199e | 9398 | error ("long or short specified with floating type for `%s'", name); |
8d08fdba MS |
9399 | else if (RIDBIT_SETP (RID_SIGNED, specbits) |
9400 | && RIDBIT_SETP (RID_UNSIGNED, specbits)) | |
8251199e | 9401 | error ("signed and unsigned given together for `%s'", name); |
8d08fdba MS |
9402 | else |
9403 | { | |
9404 | ok = 1; | |
37c46b43 | 9405 | if (!explicit_int && !defaulted_int && !explicit_char && pedantic) |
8d08fdba | 9406 | { |
8251199e | 9407 | pedwarn ("long, short, signed or unsigned used invalidly for `%s'", |
8d08fdba MS |
9408 | name); |
9409 | if (flag_pedantic_errors) | |
9410 | ok = 0; | |
9411 | } | |
9412 | } | |
9413 | ||
9414 | /* Discard the type modifiers if they are invalid. */ | |
9415 | if (! ok) | |
9416 | { | |
9417 | RIDBIT_RESET (RID_UNSIGNED, specbits); | |
9418 | RIDBIT_RESET (RID_SIGNED, specbits); | |
9419 | RIDBIT_RESET (RID_LONG, specbits); | |
9420 | RIDBIT_RESET (RID_SHORT, specbits); | |
9421 | longlong = 0; | |
9422 | } | |
9423 | } | |
9424 | ||
37c46b43 MS |
9425 | if (RIDBIT_SETP (RID_COMPLEX, specbits) |
9426 | && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE) | |
9427 | { | |
8251199e | 9428 | error ("complex invalid for `%s'", name); |
37c46b43 MS |
9429 | RIDBIT_RESET (RID_COMPLEX, specbits); |
9430 | } | |
9431 | ||
8d08fdba MS |
9432 | /* Decide whether an integer type is signed or not. |
9433 | Optionally treat bitfields as signed by default. */ | |
9434 | if (RIDBIT_SETP (RID_UNSIGNED, specbits) | |
b89c5a7b MM |
9435 | /* [class.bit] |
9436 | ||
9437 | It is implementation-defined whether a plain (neither | |
9438 | explicitly signed or unsigned) char, short, int, or long | |
9439 | bit-field is signed or unsigned. | |
9440 | ||
9441 | Naturally, we extend this to long long as well. Note that | |
9442 | this does not include wchar_t. */ | |
9443 | || (bitfield && !flag_signed_bitfields | |
9444 | && RIDBIT_NOTSETP (RID_SIGNED, specbits) | |
9445 | /* A typedef for plain `int' without `signed' can be | |
9446 | controlled just like plain `int', but a typedef for | |
9447 | `signed int' cannot be so controlled. */ | |
9448 | && !(typedef_decl | |
29bbeb1c | 9449 | && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)) |
b89c5a7b MM |
9450 | && (TREE_CODE (type) == INTEGER_TYPE |
9451 | || TREE_CODE (type) == CHAR_TYPE) | |
29bbeb1c | 9452 | && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node))) |
8d08fdba MS |
9453 | { |
9454 | if (longlong) | |
9455 | type = long_long_unsigned_type_node; | |
9456 | else if (RIDBIT_SETP (RID_LONG, specbits)) | |
9457 | type = long_unsigned_type_node; | |
9458 | else if (RIDBIT_SETP (RID_SHORT, specbits)) | |
9459 | type = short_unsigned_type_node; | |
9460 | else if (type == char_type_node) | |
9461 | type = unsigned_char_type_node; | |
9462 | else if (typedef_decl) | |
9463 | type = unsigned_type (type); | |
9464 | else | |
9465 | type = unsigned_type_node; | |
9466 | } | |
9467 | else if (RIDBIT_SETP (RID_SIGNED, specbits) | |
9468 | && type == char_type_node) | |
9469 | type = signed_char_type_node; | |
9470 | else if (longlong) | |
9471 | type = long_long_integer_type_node; | |
9472 | else if (RIDBIT_SETP (RID_LONG, specbits)) | |
9473 | type = long_integer_type_node; | |
9474 | else if (RIDBIT_SETP (RID_SHORT, specbits)) | |
9475 | type = short_integer_type_node; | |
9476 | ||
37c46b43 MS |
9477 | if (RIDBIT_SETP (RID_COMPLEX, specbits)) |
9478 | { | |
9479 | /* If we just have "complex", it is equivalent to | |
9480 | "complex double", but if any modifiers at all are specified it is | |
9481 | the complex form of TYPE. E.g, "complex short" is | |
9482 | "complex short int". */ | |
9483 | ||
9484 | if (defaulted_int && ! longlong | |
9485 | && ! (RIDBIT_SETP (RID_LONG, specbits) | |
9486 | || RIDBIT_SETP (RID_SHORT, specbits) | |
9487 | || RIDBIT_SETP (RID_SIGNED, specbits) | |
9488 | || RIDBIT_SETP (RID_UNSIGNED, specbits))) | |
9489 | type = complex_double_type_node; | |
9490 | else if (type == integer_type_node) | |
9491 | type = complex_integer_type_node; | |
9492 | else if (type == float_type_node) | |
9493 | type = complex_float_type_node; | |
9494 | else if (type == double_type_node) | |
9495 | type = complex_double_type_node; | |
9496 | else if (type == long_double_type_node) | |
9497 | type = complex_long_double_type_node; | |
9498 | else | |
9499 | type = build_complex_type (type); | |
9500 | } | |
9501 | ||
3ac3d9ea MM |
9502 | if (return_type == return_conversion |
9503 | && (RIDBIT_SETP (RID_CONST, specbits) | |
91063b51 MM |
9504 | || RIDBIT_SETP (RID_VOLATILE, specbits) |
9505 | || RIDBIT_SETP (RID_RESTRICT, specbits))) | |
9506 | cp_error ("qualifiers are not allowed on declaration of `operator %T'", | |
3ac3d9ea MM |
9507 | ctor_return_type); |
9508 | ||
8d08fdba MS |
9509 | /* Set CONSTP if this declaration is `const', whether by |
9510 | explicit specification or via a typedef. | |
9511 | Likewise for VOLATILEP. */ | |
9512 | ||
91063b51 MM |
9513 | constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type); |
9514 | restrictp = | |
9515 | !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type); | |
9516 | volatilep = | |
9517 | !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type); | |
9518 | type_quals = ((constp ? TYPE_QUAL_CONST : 0) | |
9519 | | (restrictp ? TYPE_QUAL_RESTRICT : 0) | |
9520 | | (volatilep ? TYPE_QUAL_VOLATILE : 0)); | |
9521 | type = cp_build_qualified_type (type, type_quals); | |
8d08fdba MS |
9522 | staticp = 0; |
9523 | inlinep = !! RIDBIT_SETP (RID_INLINE, specbits); | |
8d08fdba | 9524 | virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits); |
db5ae43f MS |
9525 | RIDBIT_RESET (RID_VIRTUAL, specbits); |
9526 | explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0; | |
9527 | RIDBIT_RESET (RID_EXPLICIT, specbits); | |
8d08fdba | 9528 | |
8d08fdba MS |
9529 | if (RIDBIT_SETP (RID_STATIC, specbits)) |
9530 | staticp = 1 + (decl_context == FIELD); | |
9531 | ||
9532 | if (virtualp && staticp == 2) | |
9533 | { | |
8251199e | 9534 | cp_error ("member `%D' cannot be declared both virtual and static", |
8d08fdba MS |
9535 | dname); |
9536 | staticp = 0; | |
9537 | } | |
9538 | friendp = RIDBIT_SETP (RID_FRIEND, specbits); | |
8d08fdba MS |
9539 | RIDBIT_RESET (RID_FRIEND, specbits); |
9540 | ||
7e83af84 BK |
9541 | /* $7.1.2, Function specifiers */ |
9542 | if (friendp && explicitp) | |
9543 | error ("only declarations of constructors can be `explicit'"); | |
9544 | ||
8d08fdba MS |
9545 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) |
9546 | { | |
9547 | if (decl_context == PARM) | |
9548 | { | |
8251199e | 9549 | error ("non-member `%s' cannot be declared `mutable'", name); |
8d08fdba MS |
9550 | RIDBIT_RESET (RID_MUTABLE, specbits); |
9551 | } | |
9552 | else if (friendp || decl_context == TYPENAME) | |
9553 | { | |
8251199e | 9554 | error ("non-object member `%s' cannot be declared `mutable'", name); |
8d08fdba MS |
9555 | RIDBIT_RESET (RID_MUTABLE, specbits); |
9556 | } | |
8d08fdba MS |
9557 | } |
9558 | ||
9559 | /* Warn if two storage classes are given. Default to `auto'. */ | |
9560 | ||
9561 | if (RIDBIT_ANY_SET (specbits)) | |
9562 | { | |
9563 | if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++; | |
9564 | if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++; | |
9565 | if (decl_context == PARM && nclasses > 0) | |
8251199e | 9566 | error ("storage class specifiers invalid in parameter declarations"); |
8d08fdba MS |
9567 | if (RIDBIT_SETP (RID_TYPEDEF, specbits)) |
9568 | { | |
9569 | if (decl_context == PARM) | |
8251199e | 9570 | error ("typedef declaration invalid in parameter declaration"); |
8d08fdba MS |
9571 | nclasses++; |
9572 | } | |
9573 | if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++; | |
9574 | if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++; | |
9575 | } | |
9576 | ||
9577 | /* Give error if `virtual' is used outside of class declaration. */ | |
b7484fbe MS |
9578 | if (virtualp |
9579 | && (current_class_name == NULL_TREE || decl_context != FIELD)) | |
8d08fdba | 9580 | { |
8251199e | 9581 | error ("virtual outside class declaration"); |
8d08fdba MS |
9582 | virtualp = 0; |
9583 | } | |
9584 | if (current_class_name == NULL_TREE && RIDBIT_SETP (RID_MUTABLE, specbits)) | |
9585 | { | |
8251199e | 9586 | error ("only members can be declared mutable"); |
8d08fdba MS |
9587 | RIDBIT_RESET (RID_MUTABLE, specbits); |
9588 | } | |
9589 | ||
9590 | /* Static anonymous unions are dealt with here. */ | |
9591 | if (staticp && decl_context == TYPENAME | |
9592 | && TREE_CODE (declspecs) == TREE_LIST | |
6bdb8141 | 9593 | && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs))) |
8d08fdba MS |
9594 | decl_context = FIELD; |
9595 | ||
8d08fdba MS |
9596 | /* Warn about storage classes that are invalid for certain |
9597 | kinds of declarations (parameters, typenames, etc.). */ | |
9598 | ||
9599 | if (nclasses > 1) | |
8251199e | 9600 | error ("multiple storage classes in declaration of `%s'", name); |
8d08fdba MS |
9601 | else if (decl_context != NORMAL && nclasses > 0) |
9602 | { | |
db5ae43f | 9603 | if ((decl_context == PARM || decl_context == CATCHPARM) |
8d08fdba MS |
9604 | && (RIDBIT_SETP (RID_REGISTER, specbits) |
9605 | || RIDBIT_SETP (RID_AUTO, specbits))) | |
9606 | ; | |
fc378698 MS |
9607 | else if (RIDBIT_SETP (RID_TYPEDEF, specbits)) |
9608 | ; | |
8d08fdba | 9609 | else if (decl_context == FIELD |
8d08fdba MS |
9610 | /* C++ allows static class elements */ |
9611 | && RIDBIT_SETP (RID_STATIC, specbits)) | |
9612 | /* C++ also allows inlines and signed and unsigned elements, | |
9613 | but in those cases we don't come in here. */ | |
9614 | ; | |
9615 | else | |
9616 | { | |
9617 | if (decl_context == FIELD) | |
9618 | { | |
b7484fbe MS |
9619 | tree tmp = NULL_TREE; |
9620 | register int op = 0; | |
9621 | ||
9622 | if (declarator) | |
9623 | { | |
9e9ff709 MS |
9624 | /* Avoid trying to get an operand off an identifier node. */ |
9625 | if (TREE_CODE (declarator) == IDENTIFIER_NODE) | |
9626 | tmp = declarator; | |
9627 | else | |
9628 | tmp = TREE_OPERAND (declarator, 0); | |
b7484fbe MS |
9629 | op = IDENTIFIER_OPNAME_P (tmp); |
9630 | } | |
8251199e | 9631 | error ("storage class specified for %s `%s'", |
6eabb241 | 9632 | op ? "member operator" : "field", |
8d08fdba MS |
9633 | op ? operator_name_string (tmp) : name); |
9634 | } | |
9635 | else | |
db5ae43f | 9636 | error (((decl_context == PARM || decl_context == CATCHPARM) |
8d08fdba MS |
9637 | ? "storage class specified for parameter `%s'" |
9638 | : "storage class specified for typename"), name); | |
9639 | RIDBIT_RESET (RID_REGISTER, specbits); | |
9640 | RIDBIT_RESET (RID_AUTO, specbits); | |
9641 | RIDBIT_RESET (RID_EXTERN, specbits); | |
8d08fdba MS |
9642 | } |
9643 | } | |
9644 | else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag) | |
9645 | { | |
a9aedbc2 | 9646 | if (toplevel_bindings_p ()) |
8d08fdba | 9647 | { |
59be0cdd | 9648 | /* It's common practice (and completely valid) to have a const |
8d08fdba | 9649 | be initialized and declared extern. */ |
950ad3c3 | 9650 | if (!(type_quals & TYPE_QUAL_CONST)) |
8251199e | 9651 | warning ("`%s' initialized and declared `extern'", name); |
8d08fdba MS |
9652 | } |
9653 | else | |
8251199e | 9654 | error ("`%s' has both `extern' and initializer", name); |
8d08fdba MS |
9655 | } |
9656 | else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag | |
a9aedbc2 | 9657 | && ! toplevel_bindings_p ()) |
8251199e | 9658 | error ("nested function `%s' declared `extern'", name); |
a9aedbc2 | 9659 | else if (toplevel_bindings_p ()) |
8d08fdba MS |
9660 | { |
9661 | if (RIDBIT_SETP (RID_AUTO, specbits)) | |
8251199e | 9662 | error ("top-level declaration of `%s' specifies `auto'", name); |
8d08fdba MS |
9663 | } |
9664 | ||
909e536a | 9665 | if (nclasses > 0 && friendp) |
8251199e | 9666 | error ("storage class specifiers invalid in friend function declarations"); |
909e536a | 9667 | |
8d08fdba MS |
9668 | /* Now figure out the structure of the declarator proper. |
9669 | Descend through it, creating more complex types, until we reach | |
9670 | the declared identifier (or NULL_TREE, in an absolute declarator). */ | |
9671 | ||
1eab9b56 JM |
9672 | inner_attrs = NULL_TREE; |
9673 | ignore_attrs = 0; | |
9674 | ||
386b8a85 JM |
9675 | while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE |
9676 | && TREE_CODE (declarator) != TEMPLATE_ID_EXPR) | |
8d08fdba MS |
9677 | { |
9678 | /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]), | |
9679 | an INDIRECT_REF (for *...), | |
9680 | a CALL_EXPR (for ...(...)), | |
9681 | an identifier (for the name being declared) | |
9682 | or a null pointer (for the place in an absolute declarator | |
9683 | where the name was omitted). | |
9684 | For the last two cases, we have just exited the loop. | |
9685 | ||
9686 | For C++ it could also be | |
9687 | a SCOPE_REF (for class :: ...). In this case, we have converted | |
9688 | sensible names to types, and those are the values we use to | |
9689 | qualify the member name. | |
9690 | an ADDR_EXPR (for &...), | |
9691 | a BIT_NOT_EXPR (for destructors) | |
8d08fdba MS |
9692 | |
9693 | At this point, TYPE is the type of elements of an array, | |
9694 | or for a function to return, or for a pointer to point to. | |
9695 | After this sequence of ifs, TYPE is the type of the | |
9696 | array or function or pointer, and DECLARATOR has had its | |
9697 | outermost layer removed. */ | |
9698 | ||
bd6dd845 | 9699 | if (type == error_mark_node) |
8d08fdba MS |
9700 | { |
9701 | if (TREE_CODE (declarator) == SCOPE_REF) | |
9702 | declarator = TREE_OPERAND (declarator, 1); | |
9703 | else | |
9704 | declarator = TREE_OPERAND (declarator, 0); | |
9705 | continue; | |
9706 | } | |
9707 | if (quals != NULL_TREE | |
9708 | && (declarator == NULL_TREE | |
9709 | || TREE_CODE (declarator) != SCOPE_REF)) | |
9710 | { | |
9711 | if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE) | |
9712 | ctype = TYPE_METHOD_BASETYPE (type); | |
9713 | if (ctype != NULL_TREE) | |
9714 | { | |
8d08fdba | 9715 | tree dummy = build_decl (TYPE_DECL, NULL_TREE, type); |
8d08fdba MS |
9716 | ctype = grok_method_quals (ctype, dummy, quals); |
9717 | type = TREE_TYPE (dummy); | |
9718 | quals = NULL_TREE; | |
9719 | } | |
9720 | } | |
1eab9b56 JM |
9721 | |
9722 | /* See the comment for the TREE_LIST case, below. */ | |
9723 | if (ignore_attrs) | |
9724 | ignore_attrs = 0; | |
9725 | else if (inner_attrs) | |
9726 | { | |
9727 | decl_attributes (type, inner_attrs, NULL_TREE); | |
9728 | inner_attrs = NULL_TREE; | |
9729 | } | |
9730 | ||
8d08fdba MS |
9731 | switch (TREE_CODE (declarator)) |
9732 | { | |
52fbc847 JM |
9733 | case TREE_LIST: |
9734 | { | |
9735 | /* We encode a declarator with embedded attributes using | |
1eab9b56 JM |
9736 | a TREE_LIST. The attributes apply to the declarator |
9737 | directly inside them, so we have to skip an iteration | |
9738 | before applying them to the type. If the declarator just | |
9739 | inside is the declarator-id, we apply the attrs to the | |
9740 | decl itself. */ | |
9741 | inner_attrs = TREE_PURPOSE (declarator); | |
9742 | ignore_attrs = 1; | |
52fbc847 | 9743 | declarator = TREE_VALUE (declarator); |
52fbc847 JM |
9744 | } |
9745 | break; | |
9746 | ||
8d08fdba MS |
9747 | case ARRAY_REF: |
9748 | { | |
9749 | register tree itype = NULL_TREE; | |
9750 | register tree size = TREE_OPERAND (declarator, 1); | |
b7484fbe MS |
9751 | /* The index is a signed object `sizetype' bits wide. */ |
9752 | tree index_type = signed_type (sizetype); | |
8d08fdba MS |
9753 | |
9754 | declarator = TREE_OPERAND (declarator, 0); | |
9755 | ||
9756 | /* Check for some types that there cannot be arrays of. */ | |
9757 | ||
a1774733 | 9758 | if (TREE_CODE (type) == VOID_TYPE) |
8d08fdba | 9759 | { |
8251199e | 9760 | cp_error ("declaration of `%D' as array of voids", dname); |
8d08fdba MS |
9761 | type = error_mark_node; |
9762 | } | |
9763 | ||
9764 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
9765 | { | |
8251199e | 9766 | cp_error ("declaration of `%D' as array of functions", dname); |
8d08fdba MS |
9767 | type = error_mark_node; |
9768 | } | |
9769 | ||
9770 | /* ARM $8.4.3: Since you can't have a pointer to a reference, | |
9771 | you can't have arrays of references. If we allowed them, | |
59be0cdd | 9772 | then we'd be saying x[i] is valid for an array x, but |
8d08fdba MS |
9773 | then you'd have to ask: what does `*(x + i)' mean? */ |
9774 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
9775 | { | |
9776 | if (decl_context == TYPENAME) | |
8251199e | 9777 | cp_error ("cannot make arrays of references"); |
8d08fdba | 9778 | else |
8251199e | 9779 | cp_error ("declaration of `%D' as array of references", |
8d08fdba MS |
9780 | dname); |
9781 | type = error_mark_node; | |
9782 | } | |
9783 | ||
9784 | if (TREE_CODE (type) == OFFSET_TYPE) | |
9785 | { | |
8251199e | 9786 | cp_error ("declaration of `%D' as array of data members", |
8d08fdba MS |
9787 | dname); |
9788 | type = error_mark_node; | |
9789 | } | |
9790 | ||
9791 | if (TREE_CODE (type) == METHOD_TYPE) | |
9792 | { | |
8251199e | 9793 | cp_error ("declaration of `%D' as array of function members", |
8d08fdba MS |
9794 | dname); |
9795 | type = error_mark_node; | |
9796 | } | |
9797 | ||
9798 | if (size == error_mark_node) | |
9799 | type = error_mark_node; | |
3bfdc719 MM |
9800 | else if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)) |
9801 | { | |
9802 | /* [dcl.array] | |
9803 | ||
9804 | the constant expressions that specify the bounds of | |
9805 | the arrays can be omitted only for the first member | |
9806 | of the sequence. */ | |
9807 | cp_error ("declaration of `%D' as multidimensional array", | |
9808 | dname); | |
9809 | cp_error ("must have bounds for all dimensions except the first"); | |
9810 | type = error_mark_node; | |
9811 | } | |
8d08fdba MS |
9812 | |
9813 | if (type == error_mark_node) | |
9814 | continue; | |
9815 | ||
f2e2cbd4 | 9816 | /* VC++ spells a zero-sized array with []. */ |
e8ea7036 MM |
9817 | if (size == NULL_TREE && decl_context == FIELD && ! staticp |
9818 | && ! RIDBIT_SETP (RID_TYPEDEF, specbits)) | |
f2e2cbd4 JM |
9819 | size = integer_zero_node; |
9820 | ||
8d08fdba MS |
9821 | if (size) |
9822 | { | |
9823 | /* Must suspend_momentary here because the index | |
9824 | type may need to live until the end of the function. | |
9825 | For example, it is used in the declaration of a | |
9826 | variable which requires destructing at the end of | |
9827 | the function; then build_vec_delete will need this | |
9828 | value. */ | |
9829 | int yes = suspend_momentary (); | |
2c73f9f5 | 9830 | /* Might be a cast. */ |
8d08fdba MS |
9831 | if (TREE_CODE (size) == NOP_EXPR |
9832 | && TREE_TYPE (size) == TREE_TYPE (TREE_OPERAND (size, 0))) | |
9833 | size = TREE_OPERAND (size, 0); | |
9f33663b JM |
9834 | if (TREE_READONLY_DECL_P (size)) |
9835 | size = decl_constant_value (size); | |
8d08fdba | 9836 | |
5db698f6 MM |
9837 | /* If this involves a template parameter, it will be a |
9838 | constant at instantiation time, but we don't know | |
9839 | what the value is yet. Even if no template | |
9840 | parameters are involved, we may an expression that | |
9841 | is not a constant; we don't even simplify `1 + 2' | |
9842 | when processing a template. */ | |
9843 | if (processing_template_decl) | |
5566b478 | 9844 | { |
e97e5263 JM |
9845 | /* Resolve a qualified reference to an enumerator or |
9846 | static const data member of ours. */ | |
9847 | if (TREE_CODE (size) == SCOPE_REF | |
9848 | && TREE_OPERAND (size, 0) == current_class_type) | |
9849 | { | |
9850 | tree t = lookup_field (current_class_type, | |
9851 | TREE_OPERAND (size, 1), 0, 0); | |
9852 | if (t) | |
9853 | size = t; | |
9854 | } | |
9855 | ||
f05f680a AO |
9856 | itype = build_index_type (build_min |
9857 | (MINUS_EXPR, sizetype, size, integer_one_node)); | |
5566b478 MS |
9858 | goto dont_grok_size; |
9859 | } | |
8d08fdba MS |
9860 | |
9861 | if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE | |
161c12b0 JM |
9862 | && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE |
9863 | && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE) | |
8d08fdba | 9864 | { |
8251199e | 9865 | cp_error ("size of array `%D' has non-integer type", |
8d08fdba MS |
9866 | dname); |
9867 | size = integer_one_node; | |
9868 | } | |
e1cd6e56 | 9869 | if (pedantic && integer_zerop (size)) |
8251199e | 9870 | cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname); |
8d08fdba MS |
9871 | if (TREE_CONSTANT (size)) |
9872 | { | |
dff6b454 RK |
9873 | int old_flag_pedantic_errors = flag_pedantic_errors; |
9874 | int old_pedantic = pedantic; | |
9875 | pedantic = flag_pedantic_errors = 1; | |
9876 | /* Always give overflow errors on array subscripts. */ | |
8d08fdba | 9877 | constant_expression_warning (size); |
dff6b454 RK |
9878 | pedantic = old_pedantic; |
9879 | flag_pedantic_errors = old_flag_pedantic_errors; | |
8d08fdba MS |
9880 | if (INT_CST_LT (size, integer_zero_node)) |
9881 | { | |
8251199e | 9882 | cp_error ("size of array `%D' is negative", dname); |
8d08fdba MS |
9883 | size = integer_one_node; |
9884 | } | |
8d08fdba MS |
9885 | } |
9886 | else | |
9887 | { | |
e1cd6e56 | 9888 | if (pedantic) |
a0a33927 MS |
9889 | { |
9890 | if (dname) | |
8251199e | 9891 | cp_pedwarn ("ANSI C++ forbids variable-size array `%D'", |
a0a33927 MS |
9892 | dname); |
9893 | else | |
8251199e | 9894 | cp_pedwarn ("ANSI C++ forbids variable-size array"); |
a0a33927 | 9895 | } |
8d08fdba | 9896 | } |
b7484fbe | 9897 | |
beb53fb8 JM |
9898 | itype |
9899 | = fold (build_binary_op (MINUS_EXPR, | |
37c46b43 MS |
9900 | cp_convert (index_type, size), |
9901 | cp_convert (index_type, | |
337c90cc | 9902 | integer_one_node))); |
b7484fbe MS |
9903 | if (! TREE_CONSTANT (itype)) |
9904 | itype = variable_size (itype); | |
594740f3 MS |
9905 | else if (TREE_OVERFLOW (itype)) |
9906 | { | |
8251199e | 9907 | error ("overflow in array dimension"); |
594740f3 MS |
9908 | TREE_OVERFLOW (itype) = 0; |
9909 | } | |
fc378698 | 9910 | |
5868eb4e | 9911 | itype = build_index_type (itype); |
fc378698 | 9912 | |
5566b478 | 9913 | dont_grok_size: |
8d08fdba MS |
9914 | resume_momentary (yes); |
9915 | } | |
9916 | ||
8d08fdba | 9917 | type = build_cplus_array_type (type, itype); |
8d08fdba MS |
9918 | ctype = NULL_TREE; |
9919 | } | |
9920 | break; | |
9921 | ||
9922 | case CALL_EXPR: | |
9923 | { | |
9924 | tree arg_types; | |
f376e137 | 9925 | int funcdecl_p; |
43f887f9 | 9926 | tree inner_parms = CALL_DECLARATOR_PARMS (declarator); |
f376e137 | 9927 | tree inner_decl = TREE_OPERAND (declarator, 0); |
8d08fdba MS |
9928 | |
9929 | /* Declaring a function type. | |
9930 | Make sure we have a valid type for the function to return. */ | |
8d08fdba | 9931 | |
91063b51 | 9932 | /* We now know that the TYPE_QUALS don't apply to the |
14ae7e7d | 9933 | decl, but to its return type. */ |
91063b51 | 9934 | type_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
9935 | |
9936 | /* Warn about some types functions can't return. */ | |
9937 | ||
9938 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
9939 | { | |
8251199e | 9940 | error ("`%s' declared as function returning a function", name); |
8d08fdba MS |
9941 | type = integer_type_node; |
9942 | } | |
9943 | if (TREE_CODE (type) == ARRAY_TYPE) | |
9944 | { | |
8251199e | 9945 | error ("`%s' declared as function returning an array", name); |
8d08fdba MS |
9946 | type = integer_type_node; |
9947 | } | |
9948 | ||
f376e137 MS |
9949 | if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF) |
9950 | inner_decl = TREE_OPERAND (inner_decl, 1); | |
9951 | ||
386b8a85 JM |
9952 | if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR) |
9953 | inner_decl = dname; | |
9954 | ||
b7484fbe | 9955 | /* Pick up type qualifiers which should be applied to `this'. */ |
43f887f9 | 9956 | quals = CALL_DECLARATOR_QUALS (declarator); |
b7484fbe | 9957 | |
c11b6f21 | 9958 | /* Pick up the exception specifications. */ |
43f887f9 | 9959 | raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator); |
c11b6f21 | 9960 | |
f376e137 MS |
9961 | /* Say it's a definition only for the CALL_EXPR |
9962 | closest to the identifier. */ | |
beb53fb8 | 9963 | funcdecl_p |
386b8a85 JM |
9964 | = inner_decl |
9965 | && (TREE_CODE (inner_decl) == IDENTIFIER_NODE | |
9966 | || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR | |
9967 | || TREE_CODE (inner_decl) == BIT_NOT_EXPR); | |
9968 | ||
8d08fdba MS |
9969 | if (ctype == NULL_TREE |
9970 | && decl_context == FIELD | |
f376e137 | 9971 | && funcdecl_p |
8d08fdba MS |
9972 | && (friendp == 0 || dname == current_class_name)) |
9973 | ctype = current_class_type; | |
9974 | ||
51c184be | 9975 | if (ctype && return_type == return_conversion) |
8d08fdba MS |
9976 | TYPE_HAS_CONVERSION (ctype) = 1; |
9977 | if (ctype && constructor_name (ctype) == dname) | |
9978 | { | |
9979 | /* We are within a class's scope. If our declarator name | |
9980 | is the same as the class name, and we are defining | |
9981 | a function, then it is a constructor/destructor, and | |
9982 | therefore returns a void type. */ | |
9983 | ||
9984 | if (flags == DTOR_FLAG) | |
9985 | { | |
9986 | /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may | |
9987 | not be declared const or volatile. A destructor | |
9988 | may not be static. */ | |
9989 | if (staticp == 2) | |
8251199e | 9990 | error ("destructor cannot be static member function"); |
b7484fbe | 9991 | if (quals) |
8d08fdba | 9992 | { |
4f70a846 MM |
9993 | cp_error ("destructors may not be `%s'", |
9994 | IDENTIFIER_POINTER (TREE_VALUE (quals))); | |
9995 | quals = NULL_TREE; | |
8d08fdba MS |
9996 | } |
9997 | if (decl_context == FIELD) | |
9998 | { | |
9999 | if (! member_function_or_else (ctype, current_class_type, | |
10000 | "destructor for alien class `%s' cannot be a member")) | |
10001 | return void_type_node; | |
10002 | } | |
10003 | } | |
2c73f9f5 | 10004 | else /* It's a constructor. */ |
8d08fdba | 10005 | { |
db5ae43f MS |
10006 | if (explicitp == 1) |
10007 | explicitp = 2; | |
8d08fdba MS |
10008 | /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may |
10009 | not be declared const or volatile. A constructor may | |
10010 | not be virtual. A constructor may not be static. */ | |
10011 | if (staticp == 2) | |
8251199e | 10012 | error ("constructor cannot be static member function"); |
8d08fdba MS |
10013 | if (virtualp) |
10014 | { | |
8251199e | 10015 | pedwarn ("constructors cannot be declared virtual"); |
8d08fdba MS |
10016 | virtualp = 0; |
10017 | } | |
b7484fbe | 10018 | if (quals) |
8d08fdba | 10019 | { |
4f70a846 MM |
10020 | cp_error ("constructors may not be `%s'", |
10021 | IDENTIFIER_POINTER (TREE_VALUE (quals))); | |
10022 | quals = NULL_TREE; | |
8d08fdba | 10023 | } |
8d08fdba | 10024 | { |
51c184be | 10025 | RID_BIT_TYPE tmp_bits; |
fc378698 | 10026 | bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE)); |
51c184be MS |
10027 | RIDBIT_RESET (RID_INLINE, tmp_bits); |
10028 | RIDBIT_RESET (RID_STATIC, tmp_bits); | |
10029 | if (RIDBIT_ANY_SET (tmp_bits)) | |
8251199e | 10030 | error ("return value type specifier for constructor ignored"); |
8d08fdba | 10031 | } |
f30432d7 | 10032 | type = build_pointer_type (ctype); |
6eabb241 | 10033 | if (decl_context == FIELD) |
8d08fdba MS |
10034 | { |
10035 | if (! member_function_or_else (ctype, current_class_type, | |
10036 | "constructor for alien class `%s' cannot be member")) | |
10037 | return void_type_node; | |
10038 | TYPE_HAS_CONSTRUCTOR (ctype) = 1; | |
10039 | if (return_type != return_ctor) | |
10040 | return NULL_TREE; | |
10041 | } | |
10042 | } | |
10043 | if (decl_context == FIELD) | |
10044 | staticp = 0; | |
10045 | } | |
b7484fbe | 10046 | else if (friendp) |
8d08fdba | 10047 | { |
b7484fbe | 10048 | if (initialized) |
8251199e | 10049 | error ("can't initialize friend function `%s'", name); |
b7484fbe MS |
10050 | if (virtualp) |
10051 | { | |
10052 | /* Cannot be both friend and virtual. */ | |
8251199e | 10053 | error ("virtual functions cannot be friends"); |
b7484fbe MS |
10054 | RIDBIT_RESET (RID_FRIEND, specbits); |
10055 | friendp = 0; | |
10056 | } | |
28cbf42c | 10057 | if (decl_context == NORMAL) |
8251199e | 10058 | error ("friend declaration not in class definition"); |
28cbf42c | 10059 | if (current_function_decl && funcdef_flag) |
8251199e | 10060 | cp_error ("can't define friend function `%s' in a local class definition", |
28cbf42c | 10061 | name); |
8d08fdba MS |
10062 | } |
10063 | ||
8d08fdba MS |
10064 | /* Construct the function type and go to the next |
10065 | inner layer of declarator. */ | |
10066 | ||
f376e137 | 10067 | declarator = TREE_OPERAND (declarator, 0); |
8d08fdba | 10068 | |
f376e137 MS |
10069 | /* FIXME: This is where default args should be fully |
10070 | processed. */ | |
8d08fdba | 10071 | |
f376e137 | 10072 | arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0); |
8d08fdba | 10073 | |
4f70a846 | 10074 | if (declarator && flags == DTOR_FLAG) |
8d08fdba | 10075 | { |
4f70a846 MM |
10076 | /* A destructor declared in the body of a class will |
10077 | be represented as a BIT_NOT_EXPR. But, we just | |
10078 | want the underlying IDENTIFIER. */ | |
8d08fdba | 10079 | if (TREE_CODE (declarator) == BIT_NOT_EXPR) |
4f70a846 MM |
10080 | declarator = TREE_OPERAND (declarator, 0); |
10081 | ||
10082 | if (strict_prototype == 0 && arg_types == NULL_TREE) | |
10083 | arg_types = void_list_node; | |
10084 | else if (arg_types == NULL_TREE | |
10085 | || arg_types != void_list_node) | |
8d08fdba | 10086 | { |
4f70a846 MM |
10087 | cp_error ("destructors may not have parameters"); |
10088 | arg_types = void_list_node; | |
10089 | last_function_parms = NULL_TREE; | |
8d08fdba MS |
10090 | } |
10091 | } | |
10092 | ||
d22c8596 | 10093 | /* ANSI says that `const int foo ();' |
8d08fdba | 10094 | does not make the function foo const. */ |
d22c8596 | 10095 | type = build_function_type (type, arg_types); |
42976354 BK |
10096 | |
10097 | { | |
10098 | tree t; | |
10099 | for (t = arg_types; t; t = TREE_CHAIN (t)) | |
10100 | if (TREE_PURPOSE (t) | |
10101 | && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG) | |
10102 | { | |
10103 | add_defarg_fn (type); | |
10104 | break; | |
10105 | } | |
10106 | } | |
8d08fdba MS |
10107 | } |
10108 | break; | |
10109 | ||
10110 | case ADDR_EXPR: | |
10111 | case INDIRECT_REF: | |
10112 | /* Filter out pointers-to-references and references-to-references. | |
10113 | We can get these if a TYPE_DECL is used. */ | |
10114 | ||
10115 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
10116 | { | |
8251199e | 10117 | error ("cannot declare %s to references", |
8d08fdba MS |
10118 | TREE_CODE (declarator) == ADDR_EXPR |
10119 | ? "references" : "pointers"); | |
10120 | declarator = TREE_OPERAND (declarator, 0); | |
10121 | continue; | |
10122 | } | |
10123 | ||
a5894242 MS |
10124 | if (TREE_CODE (type) == OFFSET_TYPE |
10125 | && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE | |
10126 | || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE)) | |
10127 | { | |
8251199e | 10128 | cp_error ("cannot declare pointer to `%#T' member", |
a5894242 MS |
10129 | TREE_TYPE (type)); |
10130 | type = TREE_TYPE (type); | |
10131 | } | |
10132 | ||
61a127b3 MM |
10133 | /* Merge any constancy or volatility into the target type |
10134 | for the pointer. */ | |
10135 | ||
91063b51 MM |
10136 | /* We now know that the TYPE_QUALS don't apply to the decl, |
10137 | but to the target of the pointer. */ | |
10138 | type_quals = TYPE_UNQUALIFIED; | |
8d08fdba | 10139 | |
6eabb241 | 10140 | if (TREE_CODE (declarator) == ADDR_EXPR) |
8d08fdba | 10141 | { |
69851283 MM |
10142 | if (TREE_CODE (type) == VOID_TYPE) |
10143 | error ("invalid type: `void &'"); | |
8d08fdba | 10144 | else |
69851283 | 10145 | type = build_reference_type (type); |
8d08fdba MS |
10146 | } |
10147 | else if (TREE_CODE (type) == METHOD_TYPE) | |
d8f8dca1 | 10148 | type = build_ptrmemfunc_type (build_pointer_type (type)); |
8d08fdba MS |
10149 | else |
10150 | type = build_pointer_type (type); | |
10151 | ||
10152 | /* Process a list of type modifier keywords (such as | |
10153 | const or volatile) that were given inside the `*' or `&'. */ | |
10154 | ||
10155 | if (TREE_TYPE (declarator)) | |
10156 | { | |
10157 | register tree typemodlist; | |
10158 | int erred = 0; | |
91063b51 MM |
10159 | |
10160 | constp = 0; | |
10161 | volatilep = 0; | |
10162 | restrictp = 0; | |
8d08fdba MS |
10163 | for (typemodlist = TREE_TYPE (declarator); typemodlist; |
10164 | typemodlist = TREE_CHAIN (typemodlist)) | |
10165 | { | |
91063b51 MM |
10166 | tree qualifier = TREE_VALUE (typemodlist); |
10167 | ||
10168 | if (qualifier == ridpointers[(int) RID_CONST]) | |
8d08fdba | 10169 | constp++; |
91063b51 | 10170 | else if (qualifier == ridpointers[(int) RID_VOLATILE]) |
8d08fdba | 10171 | volatilep++; |
91063b51 MM |
10172 | else if (qualifier == ridpointers[(int) RID_RESTRICT]) |
10173 | restrictp++; | |
8d08fdba MS |
10174 | else if (!erred) |
10175 | { | |
10176 | erred = 1; | |
91063b51 | 10177 | error ("invalid type modifier within pointer declarator"); |
8d08fdba MS |
10178 | } |
10179 | } | |
10180 | if (constp > 1) | |
8251199e | 10181 | pedwarn ("duplicate `const'"); |
8d08fdba | 10182 | if (volatilep > 1) |
8251199e | 10183 | pedwarn ("duplicate `volatile'"); |
91063b51 MM |
10184 | if (restrictp > 1) |
10185 | pedwarn ("duplicate `restrict'"); | |
10186 | ||
10187 | type_quals = ((constp ? TYPE_QUAL_CONST : 0) | |
10188 | | (restrictp ? TYPE_QUAL_RESTRICT : 0) | |
10189 | | (volatilep ? TYPE_QUAL_VOLATILE : 0)); | |
a0a33927 MS |
10190 | if (TREE_CODE (declarator) == ADDR_EXPR |
10191 | && (constp || volatilep)) | |
10192 | { | |
10193 | if (constp) | |
8251199e | 10194 | pedwarn ("discarding `const' applied to a reference"); |
a0a33927 | 10195 | if (volatilep) |
8251199e | 10196 | pedwarn ("discarding `volatile' applied to a reference"); |
91063b51 | 10197 | type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE); |
a0a33927 | 10198 | } |
91063b51 | 10199 | type = cp_build_qualified_type (type, type_quals); |
8d08fdba MS |
10200 | } |
10201 | declarator = TREE_OPERAND (declarator, 0); | |
10202 | ctype = NULL_TREE; | |
10203 | break; | |
10204 | ||
10205 | case SCOPE_REF: | |
10206 | { | |
10207 | /* We have converted type names to NULL_TREE if the | |
10208 | name was bogus, or to a _TYPE node, if not. | |
10209 | ||
10210 | The variable CTYPE holds the type we will ultimately | |
10211 | resolve to. The code here just needs to build | |
10212 | up appropriate member types. */ | |
10213 | tree sname = TREE_OPERAND (declarator, 1); | |
386b8a85 JM |
10214 | tree t; |
10215 | ||
8d08fdba MS |
10216 | /* Destructors can have their visibilities changed as well. */ |
10217 | if (TREE_CODE (sname) == BIT_NOT_EXPR) | |
10218 | sname = TREE_OPERAND (sname, 0); | |
10219 | ||
10220 | if (TREE_COMPLEXITY (declarator) == 0) | |
10221 | /* This needs to be here, in case we are called | |
10222 | multiple times. */ ; | |
9a68c51f JM |
10223 | else if (TREE_COMPLEXITY (declarator) == -1) |
10224 | /* Namespace member. */ | |
10225 | pop_decl_namespace (); | |
8d08fdba | 10226 | else if (friendp && (TREE_COMPLEXITY (declarator) < 2)) |
2c73f9f5 | 10227 | /* Don't fall out into global scope. Hides real bug? --eichin */ ; |
5566b478 MS |
10228 | else if (! IS_AGGR_TYPE_CODE |
10229 | (TREE_CODE (TREE_OPERAND (declarator, 0)))) | |
10230 | ; | |
8d08fdba MS |
10231 | else if (TREE_COMPLEXITY (declarator) == current_class_depth) |
10232 | { | |
9a3b49ac MS |
10233 | /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq |
10234 | that refer to ctype. They couldn't be resolved earlier | |
10235 | because we hadn't pushed into the class yet. | |
10236 | Example: resolve 'B<T>::type' in | |
10237 | 'B<typename B<T>::type> B<T>::f () { }'. */ | |
10238 | if (current_template_parms | |
10239 | && uses_template_parms (type) | |
10240 | && uses_template_parms (current_class_type)) | |
10241 | { | |
10242 | tree args = current_template_args (); | |
4393e105 | 10243 | type = tsubst (type, args, /*complain=*/1, NULL_TREE); |
9a3b49ac MS |
10244 | } |
10245 | ||
a28e3c7f MS |
10246 | /* This pop_nested_class corresponds to the |
10247 | push_nested_class used to push into class scope for | |
10248 | parsing the argument list of a function decl, in | |
10249 | qualified_id. */ | |
b74a0560 | 10250 | pop_nested_class (); |
8d08fdba MS |
10251 | TREE_COMPLEXITY (declarator) = current_class_depth; |
10252 | } | |
10253 | else | |
10254 | my_friendly_abort (16); | |
10255 | ||
10256 | if (TREE_OPERAND (declarator, 0) == NULL_TREE) | |
10257 | { | |
10258 | /* We had a reference to a global decl, or | |
10259 | perhaps we were given a non-aggregate typedef, | |
10260 | in which case we cleared this out, and should just | |
10261 | keep going as though it wasn't there. */ | |
10262 | declarator = sname; | |
10263 | continue; | |
10264 | } | |
10265 | ctype = TREE_OPERAND (declarator, 0); | |
10266 | ||
386b8a85 | 10267 | t = ctype; |
7ddedda4 | 10268 | while (t != NULL_TREE && CLASS_TYPE_P (t)) |
386b8a85 | 10269 | { |
75650646 MM |
10270 | if (CLASSTYPE_TEMPLATE_INFO (t) && |
10271 | !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) | |
386b8a85 JM |
10272 | template_count += 1; |
10273 | t = TYPE_MAIN_DECL (t); | |
10274 | if (DECL_LANG_SPECIFIC (t)) | |
10275 | t = DECL_CLASS_CONTEXT (t); | |
10276 | else | |
10277 | t = NULL_TREE; | |
10278 | } | |
10279 | ||
8d08fdba MS |
10280 | if (sname == NULL_TREE) |
10281 | goto done_scoping; | |
10282 | ||
10283 | if (TREE_CODE (sname) == IDENTIFIER_NODE) | |
10284 | { | |
10285 | /* This is the `standard' use of the scoping operator: | |
10286 | basetype :: member . */ | |
10287 | ||
db5ae43f | 10288 | if (ctype == current_class_type) |
28cbf42c MS |
10289 | { |
10290 | /* class A { | |
10291 | void A::f (); | |
10292 | }; | |
10293 | ||
10294 | Is this ill-formed? */ | |
10295 | ||
10296 | if (pedantic) | |
8251199e | 10297 | cp_pedwarn ("extra qualification `%T::' on member `%s' ignored", |
28cbf42c MS |
10298 | ctype, name); |
10299 | } | |
db5ae43f | 10300 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
8d08fdba MS |
10301 | { |
10302 | if (current_class_type == NULL_TREE | |
8d08fdba | 10303 | || friendp) |
14ae7e7d JM |
10304 | type = build_cplus_method_type (ctype, TREE_TYPE (type), |
10305 | TYPE_ARG_TYPES (type)); | |
8d08fdba MS |
10306 | else |
10307 | { | |
8251199e | 10308 | cp_error ("cannot declare member function `%T::%s' within `%T'", |
a3203465 | 10309 | ctype, name, current_class_type); |
8d08fdba MS |
10310 | return void_type_node; |
10311 | } | |
10312 | } | |
5566b478 MS |
10313 | else if (RIDBIT_SETP (RID_TYPEDEF, specbits) |
10314 | || TYPE_SIZE (complete_type (ctype)) != NULL_TREE) | |
8d08fdba | 10315 | { |
2c73f9f5 | 10316 | /* Have to move this code elsewhere in this function. |
db5ae43f MS |
10317 | this code is used for i.e., typedef int A::M; M *pm; |
10318 | ||
10319 | It is? How? jason 10/2/94 */ | |
8d08fdba | 10320 | |
8d08fdba MS |
10321 | if (current_class_type) |
10322 | { | |
8251199e | 10323 | cp_error ("cannot declare member `%T::%s' within `%T'", |
db5ae43f MS |
10324 | ctype, name, current_class_type); |
10325 | return void_type_node; | |
8d08fdba MS |
10326 | } |
10327 | type = build_offset_type (ctype, type); | |
10328 | } | |
10329 | else if (uses_template_parms (ctype)) | |
10330 | { | |
8d08fdba | 10331 | if (TREE_CODE (type) == FUNCTION_TYPE) |
beb53fb8 | 10332 | type |
14ae7e7d | 10333 | = build_cplus_method_type (ctype, TREE_TYPE (type), |
beb53fb8 | 10334 | TYPE_ARG_TYPES (type)); |
8d08fdba MS |
10335 | } |
10336 | else | |
10337 | { | |
8251199e | 10338 | cp_error ("structure `%T' not yet defined", ctype); |
8d08fdba MS |
10339 | return error_mark_node; |
10340 | } | |
10341 | ||
10342 | declarator = sname; | |
10343 | } | |
8d08fdba MS |
10344 | else if (TREE_CODE (sname) == SCOPE_REF) |
10345 | my_friendly_abort (17); | |
10346 | else | |
10347 | { | |
10348 | done_scoping: | |
10349 | declarator = TREE_OPERAND (declarator, 1); | |
10350 | if (declarator && TREE_CODE (declarator) == CALL_EXPR) | |
10351 | /* In this case, we will deal with it later. */ | |
10352 | ; | |
10353 | else | |
10354 | { | |
10355 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
14ae7e7d JM |
10356 | type = build_cplus_method_type (ctype, TREE_TYPE (type), |
10357 | TYPE_ARG_TYPES (type)); | |
8d08fdba MS |
10358 | else |
10359 | type = build_offset_type (ctype, type); | |
10360 | } | |
10361 | } | |
10362 | } | |
10363 | break; | |
10364 | ||
10365 | case BIT_NOT_EXPR: | |
10366 | declarator = TREE_OPERAND (declarator, 0); | |
10367 | break; | |
10368 | ||
8d08fdba MS |
10369 | case RECORD_TYPE: |
10370 | case UNION_TYPE: | |
10371 | case ENUMERAL_TYPE: | |
10372 | declarator = NULL_TREE; | |
10373 | break; | |
10374 | ||
10375 | case ERROR_MARK: | |
10376 | declarator = NULL_TREE; | |
10377 | break; | |
10378 | ||
10379 | default: | |
10380 | my_friendly_abort (158); | |
10381 | } | |
10382 | } | |
10383 | ||
1eab9b56 JM |
10384 | /* See the comment for the TREE_LIST case, above. */ |
10385 | if (inner_attrs) | |
10386 | { | |
10387 | if (! ignore_attrs) | |
10388 | decl_attributes (type, inner_attrs, NULL_TREE); | |
10389 | else if (attrlist) | |
10390 | TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist)); | |
10391 | else | |
10392 | attrlist = build_decl_list (NULL_TREE, inner_attrs); | |
10393 | } | |
10394 | ||
419c6212 JM |
10395 | /* Now TYPE has the actual type. */ |
10396 | ||
db5ae43f MS |
10397 | if (explicitp == 1) |
10398 | { | |
8251199e | 10399 | error ("only constructors can be declared `explicit'"); |
db5ae43f MS |
10400 | explicitp = 0; |
10401 | } | |
10402 | ||
f30432d7 MS |
10403 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) |
10404 | { | |
91063b51 | 10405 | if (type_quals & TYPE_QUAL_CONST) |
f30432d7 | 10406 | { |
8251199e | 10407 | error ("const `%s' cannot be declared `mutable'", name); |
f30432d7 MS |
10408 | RIDBIT_RESET (RID_MUTABLE, specbits); |
10409 | } | |
10410 | else if (staticp) | |
10411 | { | |
8251199e | 10412 | error ("static `%s' cannot be declared `mutable'", name); |
f30432d7 MS |
10413 | RIDBIT_RESET (RID_MUTABLE, specbits); |
10414 | } | |
10415 | } | |
10416 | ||
efe38fab JM |
10417 | if (declarator == NULL_TREE |
10418 | || TREE_CODE (declarator) == IDENTIFIER_NODE | |
10419 | || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR | |
10420 | && (TREE_CODE (type) == FUNCTION_TYPE | |
10421 | || TREE_CODE (type) == METHOD_TYPE))) | |
10422 | /* OK */; | |
10423 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
10424 | { | |
10425 | cp_error ("template-id `%D' used as a declarator", declarator); | |
10426 | declarator = dname; | |
10427 | } | |
10428 | else | |
419c6212 | 10429 | /* Unexpected declarator format. */ |
efe38fab JM |
10430 | my_friendly_abort (990210); |
10431 | ||
419c6212 JM |
10432 | /* If this is declaring a typedef name, return a TYPE_DECL. */ |
10433 | ||
fc378698 | 10434 | if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME) |
8d08fdba MS |
10435 | { |
10436 | tree decl; | |
10437 | ||
10438 | /* Note that the grammar rejects storage classes | |
10439 | in typenames, fields or parameters. */ | |
eff71ab0 PB |
10440 | if (current_lang_name == lang_name_java) |
10441 | TYPE_FOR_JAVA (type) = 1; | |
8d08fdba | 10442 | |
d2e5ee5c MS |
10443 | if (decl_context == FIELD) |
10444 | { | |
094fe153 | 10445 | if (declarator == constructor_name (current_class_type)) |
8251199e | 10446 | cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class", |
d2e5ee5c MS |
10447 | declarator); |
10448 | decl = build_lang_decl (TYPE_DECL, declarator, type); | |
d2e5ee5c MS |
10449 | } |
10450 | else | |
7fb4a8f7 JM |
10451 | { |
10452 | /* Make sure this typedef lives as long as its type, | |
10453 | since it might be used as a template parameter. */ | |
1aed5355 MM |
10454 | if (type != error_mark_node) |
10455 | push_obstacks (TYPE_OBSTACK (type), TYPE_OBSTACK (type)); | |
9188c363 | 10456 | if (processing_template_decl) |
b0d06515 | 10457 | decl = build_lang_decl (TYPE_DECL, declarator, type); |
9188c363 MM |
10458 | else |
10459 | decl = build_decl (TYPE_DECL, declarator, type); | |
1aed5355 MM |
10460 | if (type != error_mark_node) |
10461 | pop_obstacks (); | |
7fb4a8f7 | 10462 | } |
d2e5ee5c | 10463 | |
9188c363 MM |
10464 | /* If the user declares "typedef struct {...} foo" then the |
10465 | struct will have an anonymous name. Fill that name in now. | |
10466 | Nothing can refer to it, so nothing needs know about the name | |
10467 | change. */ | |
8d08fdba MS |
10468 | if (type != error_mark_node |
10469 | && TYPE_NAME (type) | |
10470 | && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL | |
b537d120 MM |
10471 | && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type)) |
10472 | && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED) | |
8d08fdba | 10473 | { |
dcd08efc JM |
10474 | tree oldname = TYPE_NAME (type); |
10475 | tree t; | |
10476 | ||
2c73f9f5 | 10477 | /* Replace the anonymous name with the real name everywhere. */ |
8d08fdba | 10478 | lookup_tag_reverse (type, declarator); |
dcd08efc JM |
10479 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
10480 | if (TYPE_NAME (t) == oldname) | |
10481 | TYPE_NAME (t) = decl; | |
8d08fdba MS |
10482 | |
10483 | if (TYPE_LANG_SPECIFIC (type)) | |
10484 | TYPE_WAS_ANONYMOUS (type) = 1; | |
10485 | ||
33964bf4 MM |
10486 | /* If this is a typedef within a template class, the nested |
10487 | type is a (non-primary) template. The name for the | |
10488 | template needs updating as well. */ | |
10489 | if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type)) | |
10490 | DECL_NAME (CLASSTYPE_TI_TEMPLATE (type)) | |
10491 | = TYPE_IDENTIFIER (type); | |
10492 | ||
2c73f9f5 ML |
10493 | /* XXX Temporarily set the scope. |
10494 | When returning, start_decl expects it as NULL_TREE, | |
10495 | and will then then set it using pushdecl. */ | |
10496 | my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404); | |
10497 | if (current_class_type) | |
10498 | DECL_CONTEXT (decl) = current_class_type; | |
10499 | else | |
cb0dbb9a | 10500 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 10501 | |
d2e5ee5c MS |
10502 | DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl); |
10503 | DECL_ASSEMBLER_NAME (decl) | |
10504 | = get_identifier (build_overload_name (type, 1, 1)); | |
2c73f9f5 | 10505 | DECL_CONTEXT (decl) = NULL_TREE; |
50a6dbd7 JM |
10506 | |
10507 | /* FIXME remangle member functions; member functions of a | |
10508 | type with external linkage have external linkage. */ | |
fc378698 | 10509 | } |
fc378698 | 10510 | |
8d08fdba MS |
10511 | if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE) |
10512 | { | |
8251199e | 10513 | cp_error_at ("typedef name may not be class-qualified", decl); |
a3203465 | 10514 | return NULL_TREE; |
8d08fdba MS |
10515 | } |
10516 | else if (quals) | |
10517 | { | |
10518 | if (ctype == NULL_TREE) | |
10519 | { | |
10520 | if (TREE_CODE (type) != METHOD_TYPE) | |
8251199e | 10521 | cp_error_at ("invalid type qualifier for non-method type", decl); |
8d08fdba MS |
10522 | else |
10523 | ctype = TYPE_METHOD_BASETYPE (type); | |
10524 | } | |
10525 | if (ctype != NULL_TREE) | |
10526 | grok_method_quals (ctype, decl, quals); | |
10527 | } | |
10528 | ||
10529 | if (RIDBIT_SETP (RID_SIGNED, specbits) | |
10530 | || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))) | |
10531 | C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1; | |
10532 | ||
10533 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) | |
61a127b3 | 10534 | error ("non-object member `%s' cannot be declared mutable", name); |
8d08fdba | 10535 | |
c91a56d2 MS |
10536 | bad_specifiers (decl, "type", virtualp, quals != NULL_TREE, |
10537 | inlinep, friendp, raises != NULL_TREE); | |
10538 | ||
10539 | if (initialized) | |
8251199e | 10540 | error ("typedef declaration includes an initializer"); |
c91a56d2 | 10541 | |
8d08fdba MS |
10542 | return decl; |
10543 | } | |
10544 | ||
10545 | /* Detect the case of an array type of unspecified size | |
10546 | which came, as such, direct from a typedef name. | |
10547 | We must copy the type, so that each identifier gets | |
10548 | a distinct type, so that each identifier's size can be | |
10549 | controlled separately by its own initializer. */ | |
10550 | ||
10551 | if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE | |
10552 | && TYPE_DOMAIN (type) == NULL_TREE) | |
10553 | { | |
10554 | type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type)); | |
10555 | } | |
10556 | ||
10557 | /* If this is a type name (such as, in a cast or sizeof), | |
10558 | compute the type and return it now. */ | |
10559 | ||
10560 | if (decl_context == TYPENAME) | |
10561 | { | |
10562 | /* Note that the grammar rejects storage classes | |
10563 | in typenames, fields or parameters. */ | |
91063b51 | 10564 | if (type_quals != TYPE_UNQUALIFIED) |
6eabb241 | 10565 | type_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
10566 | |
10567 | /* Special case: "friend class foo" looks like a TYPENAME context. */ | |
10568 | if (friendp) | |
10569 | { | |
91063b51 | 10570 | if (type_quals != TYPE_UNQUALIFIED) |
b7484fbe | 10571 | { |
91063b51 MM |
10572 | cp_error ("type qualifiers specified for friend class declaration"); |
10573 | type_quals = TYPE_UNQUALIFIED; | |
b7484fbe MS |
10574 | } |
10575 | if (inlinep) | |
10576 | { | |
8251199e | 10577 | cp_error ("`inline' specified for friend class declaration"); |
b7484fbe MS |
10578 | inlinep = 0; |
10579 | } | |
10580 | ||
10581 | /* Only try to do this stuff if we didn't already give up. */ | |
10582 | if (type != integer_type_node) | |
10583 | { | |
10584 | /* A friendly class? */ | |
10585 | if (current_class_type) | |
10586 | make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type)); | |
10587 | else | |
8251199e | 10588 | error ("trying to make class `%s' a friend of global scope", |
b7484fbe MS |
10589 | TYPE_NAME_STRING (type)); |
10590 | type = void_type_node; | |
10591 | } | |
8d08fdba MS |
10592 | } |
10593 | else if (quals) | |
10594 | { | |
8d08fdba | 10595 | tree dummy = build_decl (TYPE_DECL, declarator, type); |
8d08fdba MS |
10596 | if (ctype == NULL_TREE) |
10597 | { | |
10598 | my_friendly_assert (TREE_CODE (type) == METHOD_TYPE, 159); | |
10599 | ctype = TYPE_METHOD_BASETYPE (type); | |
10600 | } | |
10601 | grok_method_quals (ctype, dummy, quals); | |
10602 | type = TREE_TYPE (dummy); | |
10603 | } | |
10604 | ||
10605 | return type; | |
10606 | } | |
10607 | else if (declarator == NULL_TREE && decl_context != PARM | |
db5ae43f | 10608 | && decl_context != CATCHPARM |
8d08fdba MS |
10609 | && TREE_CODE (type) != UNION_TYPE |
10610 | && ! bitfield) | |
10611 | { | |
8251199e | 10612 | cp_error ("abstract declarator `%T' used as declaration", type); |
8d08fdba MS |
10613 | declarator = make_anon_name (); |
10614 | } | |
10615 | ||
10616 | /* `void' at top level (not within pointer) | |
10617 | is allowed only in typedefs or type names. | |
10618 | We don't complain about parms either, but that is because | |
10619 | a better error message can be made later. */ | |
10620 | ||
a1774733 | 10621 | if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM) |
8d08fdba | 10622 | { |
b7484fbe | 10623 | if (! declarator) |
8251199e | 10624 | error ("unnamed variable or field declared void"); |
b7484fbe | 10625 | else if (TREE_CODE (declarator) == IDENTIFIER_NODE) |
8d08fdba MS |
10626 | { |
10627 | if (IDENTIFIER_OPNAME_P (declarator)) | |
8d08fdba | 10628 | my_friendly_abort (356); |
8d08fdba | 10629 | else |
8251199e | 10630 | error ("variable or field `%s' declared void", name); |
8d08fdba MS |
10631 | } |
10632 | else | |
8251199e | 10633 | error ("variable or field declared void"); |
8d08fdba MS |
10634 | type = integer_type_node; |
10635 | } | |
10636 | ||
10637 | /* Now create the decl, which may be a VAR_DECL, a PARM_DECL | |
10638 | or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */ | |
10639 | ||
14ae7e7d JM |
10640 | if (decl_context == PARM || decl_context == CATCHPARM) |
10641 | { | |
10642 | if (ctype || in_namespace) | |
10643 | error ("cannot use `::' in parameter declaration"); | |
10644 | ||
10645 | /* A parameter declared as an array of T is really a pointer to T. | |
10646 | One declared as a function is really a pointer to a function. | |
10647 | One declared as a member is really a pointer to member. */ | |
10648 | ||
10649 | if (TREE_CODE (type) == ARRAY_TYPE) | |
10650 | { | |
10651 | /* Transfer const-ness of array into that of type pointed to. */ | |
10652 | type = build_pointer_type (TREE_TYPE (type)); | |
91063b51 | 10653 | type_quals = TYPE_UNQUALIFIED; |
14ae7e7d JM |
10654 | } |
10655 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
10656 | type = build_pointer_type (type); | |
10657 | else if (TREE_CODE (type) == OFFSET_TYPE) | |
10658 | type = build_pointer_type (type); | |
10659 | else if (TREE_CODE (type) == VOID_TYPE && declarator) | |
10660 | { | |
10661 | error ("declaration of `%s' as void", name); | |
10662 | return NULL_TREE; | |
10663 | } | |
10664 | } | |
10665 | ||
8d08fdba MS |
10666 | { |
10667 | register tree decl; | |
10668 | ||
10669 | if (decl_context == PARM) | |
10670 | { | |
ff350acd | 10671 | decl = build_decl (PARM_DECL, declarator, type); |
8d08fdba MS |
10672 | |
10673 | bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE, | |
10674 | inlinep, friendp, raises != NULL_TREE); | |
8d08fdba MS |
10675 | |
10676 | /* Compute the type actually passed in the parmlist, | |
10677 | for the case where there is no prototype. | |
10678 | (For example, shorts and chars are passed as ints.) | |
10679 | When there is a prototype, this is overridden later. */ | |
10680 | ||
39211cd5 | 10681 | DECL_ARG_TYPE (decl) = type_promotes_to (type); |
8d08fdba MS |
10682 | } |
10683 | else if (decl_context == FIELD) | |
10684 | { | |
10685 | if (type == error_mark_node) | |
10686 | { | |
10687 | /* Happens when declaring arrays of sizes which | |
10688 | are error_mark_node, for example. */ | |
10689 | decl = NULL_TREE; | |
10690 | } | |
997a088c | 10691 | else if (in_namespace && !friendp) |
05008fb9 MM |
10692 | { |
10693 | /* Something like struct S { int N::j; }; */ | |
8251199e | 10694 | cp_error ("invalid use of `::'"); |
05008fb9 MM |
10695 | decl = NULL_TREE; |
10696 | } | |
8d08fdba MS |
10697 | else if (TREE_CODE (type) == FUNCTION_TYPE) |
10698 | { | |
10699 | int publicp = 0; | |
e1467ff2 | 10700 | tree function_context; |
8d08fdba | 10701 | |
72b7eeff MS |
10702 | /* We catch the others as conflicts with the builtin |
10703 | typedefs. */ | |
10704 | if (friendp && declarator == ridpointers[(int) RID_SIGNED]) | |
10705 | { | |
8251199e | 10706 | cp_error ("function `%D' cannot be declared friend", |
72b7eeff MS |
10707 | declarator); |
10708 | friendp = 0; | |
10709 | } | |
10710 | ||
8d08fdba MS |
10711 | if (friendp == 0) |
10712 | { | |
10713 | if (ctype == NULL_TREE) | |
10714 | ctype = current_class_type; | |
10715 | ||
10716 | if (ctype == NULL_TREE) | |
10717 | { | |
8251199e | 10718 | cp_error ("can't make `%D' into a method -- not in a class", |
8d08fdba MS |
10719 | declarator); |
10720 | return void_type_node; | |
10721 | } | |
10722 | ||
10723 | /* ``A union may [ ... ] not [ have ] virtual functions.'' | |
10724 | ARM 9.5 */ | |
10725 | if (virtualp && TREE_CODE (ctype) == UNION_TYPE) | |
10726 | { | |
8251199e | 10727 | cp_error ("function `%D' declared virtual inside a union", |
8d08fdba MS |
10728 | declarator); |
10729 | return void_type_node; | |
10730 | } | |
10731 | ||
10732 | if (declarator == ansi_opname[(int) NEW_EXPR] | |
a28e3c7f MS |
10733 | || declarator == ansi_opname[(int) VEC_NEW_EXPR] |
10734 | || declarator == ansi_opname[(int) DELETE_EXPR] | |
10735 | || declarator == ansi_opname[(int) VEC_DELETE_EXPR]) | |
8d08fdba MS |
10736 | { |
10737 | if (virtualp) | |
10738 | { | |
8251199e | 10739 | cp_error ("`%D' cannot be declared virtual, since it is always static", |
8d08fdba MS |
10740 | declarator); |
10741 | virtualp = 0; | |
10742 | } | |
10743 | } | |
10744 | else if (staticp < 2) | |
14ae7e7d JM |
10745 | type = build_cplus_method_type (ctype, TREE_TYPE (type), |
10746 | TYPE_ARG_TYPES (type)); | |
8d08fdba MS |
10747 | } |
10748 | ||
10749 | /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */ | |
e1467ff2 MM |
10750 | function_context = (ctype != NULL_TREE) ? |
10751 | hack_decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE; | |
10752 | publicp = (! friendp || ! staticp) | |
10753 | && function_context == NULL_TREE; | |
386b8a85 JM |
10754 | decl = grokfndecl (ctype, type, |
10755 | TREE_CODE (declarator) != TEMPLATE_ID_EXPR | |
10756 | ? declarator : dname, | |
10757 | declarator, | |
7a8f9fa9 | 10758 | virtualp, flags, quals, raises, |
386b8a85 | 10759 | friendp ? -1 : 0, friendp, publicp, inlinep, |
2c73f9f5 | 10760 | funcdef_flag, template_count, in_namespace); |
20496fa2 | 10761 | if (decl == NULL_TREE) |
3ddfb0e6 | 10762 | return decl; |
6125f3be DE |
10763 | #if 0 |
10764 | /* This clobbers the attrs stored in `decl' from `attrlist'. */ | |
10765 | /* The decl and setting of decl_machine_attr is also turned off. */ | |
71851aaa | 10766 | decl = build_decl_attribute_variant (decl, decl_machine_attr); |
6125f3be | 10767 | #endif |
f0e01782 | 10768 | |
cc804e51 MM |
10769 | /* [class.conv.ctor] |
10770 | ||
10771 | A constructor declared without the function-specifier | |
10772 | explicit that can be called with a single parameter | |
10773 | specifies a conversion from the type of its first | |
10774 | parameter to the type of its class. Such a constructor | |
10775 | is called a converting constructor. */ | |
db5ae43f MS |
10776 | if (explicitp == 2) |
10777 | DECL_NONCONVERTING_P (decl) = 1; | |
cc804e51 MM |
10778 | else if (DECL_CONSTRUCTOR_P (decl)) |
10779 | { | |
10780 | /* The constructor can be called with exactly one | |
10781 | parameter if there is at least one parameter, and | |
10782 | any subsequent parameters have default arguments. | |
10783 | We don't look at the first parameter, which is | |
10784 | really just the `this' parameter for the new | |
10785 | object. */ | |
10786 | tree arg_types = | |
10787 | TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))); | |
10788 | ||
10789 | /* Skip the `in_chrg' argument too, if present. */ | |
10790 | if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl))) | |
10791 | arg_types = TREE_CHAIN (arg_types); | |
10792 | ||
10793 | if (arg_types == void_list_node | |
10794 | || (arg_types | |
10795 | && TREE_CHAIN (arg_types) | |
10796 | && TREE_CHAIN (arg_types) != void_list_node | |
10797 | && !TREE_PURPOSE (TREE_CHAIN (arg_types)))) | |
10798 | DECL_NONCONVERTING_P (decl) = 1; | |
10799 | } | |
8d08fdba MS |
10800 | } |
10801 | else if (TREE_CODE (type) == METHOD_TYPE) | |
10802 | { | |
faae18ab MS |
10803 | /* We only get here for friend declarations of |
10804 | members of other classes. */ | |
8d08fdba MS |
10805 | /* All method decls are public, so tell grokfndecl to set |
10806 | TREE_PUBLIC, also. */ | |
386b8a85 | 10807 | decl = grokfndecl (ctype, type, declarator, declarator, |
7a8f9fa9 | 10808 | virtualp, flags, quals, raises, |
386b8a85 | 10809 | friendp ? -1 : 0, friendp, 1, 0, funcdef_flag, |
2c73f9f5 | 10810 | template_count, in_namespace); |
f0e01782 MS |
10811 | if (decl == NULL_TREE) |
10812 | return NULL_TREE; | |
8d08fdba | 10813 | } |
5566b478 MS |
10814 | else if (!staticp && ! processing_template_decl |
10815 | && TYPE_SIZE (complete_type (type)) == NULL_TREE | |
8d08fdba MS |
10816 | && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0)) |
10817 | { | |
b7484fbe | 10818 | if (declarator) |
8251199e | 10819 | cp_error ("field `%D' has incomplete type", declarator); |
b7484fbe | 10820 | else |
8251199e | 10821 | cp_error ("name `%T' has incomplete type", type); |
8d08fdba MS |
10822 | |
10823 | /* If we're instantiating a template, tell them which | |
10824 | instantiation made the field's type be incomplete. */ | |
10825 | if (current_class_type | |
10826 | && TYPE_NAME (current_class_type) | |
d2e5ee5c | 10827 | && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type)) |
8d08fdba MS |
10828 | && declspecs && TREE_VALUE (declspecs) |
10829 | && TREE_TYPE (TREE_VALUE (declspecs)) == type) | |
8251199e | 10830 | cp_error (" in instantiation of template `%T'", |
db5ae43f MS |
10831 | current_class_type); |
10832 | ||
8d08fdba MS |
10833 | type = error_mark_node; |
10834 | decl = NULL_TREE; | |
10835 | } | |
10836 | else | |
10837 | { | |
10838 | if (friendp) | |
10839 | { | |
8251199e | 10840 | error ("`%s' is neither function nor method; cannot be declared friend", |
8d08fdba MS |
10841 | IDENTIFIER_POINTER (declarator)); |
10842 | friendp = 0; | |
10843 | } | |
10844 | decl = NULL_TREE; | |
10845 | } | |
10846 | ||
10847 | if (friendp) | |
10848 | { | |
10849 | /* Friends are treated specially. */ | |
10850 | if (ctype == current_class_type) | |
8251199e | 10851 | warning ("member functions are implicitly friends of their class"); |
8d08fdba MS |
10852 | else |
10853 | { | |
10854 | tree t = NULL_TREE; | |
10855 | if (decl && DECL_NAME (decl)) | |
36a117a5 MM |
10856 | { |
10857 | if (template_class_depth (current_class_type) == 0) | |
6c30752f MM |
10858 | { |
10859 | decl | |
10860 | = check_explicit_specialization | |
10861 | (declarator, decl, | |
10862 | template_count, 2 * (funcdef_flag != 0) + 4); | |
10863 | if (decl == error_mark_node) | |
10864 | return error_mark_node; | |
10865 | } | |
10866 | ||
36a117a5 | 10867 | t = do_friend (ctype, declarator, decl, |
7a8f9fa9 | 10868 | last_function_parms, attrlist, flags, quals, |
36a117a5 MM |
10869 | funcdef_flag); |
10870 | } | |
8d08fdba MS |
10871 | if (t && funcdef_flag) |
10872 | return t; | |
10873 | ||
10874 | return void_type_node; | |
10875 | } | |
10876 | } | |
10877 | ||
10878 | /* Structure field. It may not be a function, except for C++ */ | |
10879 | ||
10880 | if (decl == NULL_TREE) | |
10881 | { | |
8d08fdba MS |
10882 | if (initialized) |
10883 | { | |
3ac3d9ea MM |
10884 | if (!staticp) |
10885 | { | |
10886 | /* An attempt is being made to initialize a non-static | |
10887 | member. But, from [class.mem]: | |
10888 | ||
10889 | 4 A member-declarator can contain a | |
10890 | constant-initializer only if it declares a static | |
10891 | member (_class.static_) of integral or enumeration | |
10892 | type, see _class.static.data_. | |
10893 | ||
10894 | This used to be relatively common practice, but | |
10895 | the rest of the compiler does not correctly | |
10896 | handle the initialization unless the member is | |
10897 | static so we make it static below. */ | |
950ad3c3 | 10898 | cp_pedwarn ("ANSI C++ forbids initialization of member `%D'", |
3ac3d9ea | 10899 | declarator); |
8251199e | 10900 | cp_pedwarn ("making `%D' static", declarator); |
3ac3d9ea MM |
10901 | staticp = 1; |
10902 | } | |
10903 | ||
6ba89f8e MM |
10904 | if (uses_template_parms (type)) |
10905 | /* We'll check at instantiation time. */ | |
10906 | ; | |
10907 | else if (check_static_variable_definition (declarator, | |
10908 | type)) | |
10909 | /* If we just return the declaration, crashes | |
10910 | will sometimes occur. We therefore return | |
72a93143 JM |
10911 | void_type_node, as if this was a friend |
10912 | declaration, to cause callers to completely | |
10913 | ignore this declaration. */ | |
6ba89f8e | 10914 | return void_type_node; |
8d08fdba MS |
10915 | } |
10916 | ||
8ebeee52 | 10917 | /* 9.2p13 [class.mem] */ |
4d7614e9 JM |
10918 | if (declarator == constructor_name (current_class_type) |
10919 | /* Divergence from the standard: In extern "C", we | |
10920 | allow non-static data members here, because C does | |
10921 | and /usr/include/netinet/in.h uses that. */ | |
1f901793 | 10922 | && (staticp || ! in_system_header)) |
8ebeee52 JM |
10923 | cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class", |
10924 | declarator); | |
10925 | ||
3ac3d9ea | 10926 | if (staticp) |
8d08fdba | 10927 | { |
f18a14bc MM |
10928 | /* C++ allows static class members. All other work |
10929 | for this is done by grokfield. */ | |
4ce3d537 | 10930 | decl = build_lang_decl (VAR_DECL, declarator, type); |
5b605f68 MS |
10931 | TREE_STATIC (decl) = 1; |
10932 | /* In class context, 'static' means public access. */ | |
3ac3d9ea | 10933 | TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1; |
8d08fdba MS |
10934 | } |
10935 | else | |
10936 | { | |
4ce3d537 | 10937 | decl = build_lang_decl (FIELD_DECL, declarator, type); |
8d08fdba MS |
10938 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) |
10939 | { | |
10940 | DECL_MUTABLE_P (decl) = 1; | |
10941 | RIDBIT_RESET (RID_MUTABLE, specbits); | |
10942 | } | |
10943 | } | |
10944 | ||
10945 | bad_specifiers (decl, "field", virtualp, quals != NULL_TREE, | |
10946 | inlinep, friendp, raises != NULL_TREE); | |
10947 | } | |
10948 | } | |
10949 | else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE) | |
10950 | { | |
386b8a85 | 10951 | tree original_name; |
8d08fdba MS |
10952 | int publicp = 0; |
10953 | ||
10954 | if (! declarator) | |
10955 | return NULL_TREE; | |
10956 | ||
386b8a85 JM |
10957 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
10958 | original_name = dname; | |
10959 | else | |
10960 | original_name = declarator; | |
10961 | ||
8926095f | 10962 | if (RIDBIT_SETP (RID_AUTO, specbits)) |
8251199e | 10963 | error ("storage class `auto' invalid for function `%s'", name); |
8926095f | 10964 | else if (RIDBIT_SETP (RID_REGISTER, specbits)) |
8251199e | 10965 | error ("storage class `register' invalid for function `%s'", name); |
8d08fdba MS |
10966 | |
10967 | /* Function declaration not at top level. | |
10968 | Storage classes other than `extern' are not allowed | |
10969 | and `extern' makes no difference. */ | |
a9aedbc2 | 10970 | if (! toplevel_bindings_p () |
8926095f MS |
10971 | && (RIDBIT_SETP (RID_STATIC, specbits) |
10972 | || RIDBIT_SETP (RID_INLINE, specbits)) | |
8d08fdba | 10973 | && pedantic) |
8926095f MS |
10974 | { |
10975 | if (RIDBIT_SETP (RID_STATIC, specbits)) | |
8251199e | 10976 | pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name); |
8926095f | 10977 | else |
8251199e | 10978 | pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name); |
8926095f MS |
10979 | } |
10980 | ||
8d08fdba MS |
10981 | if (ctype == NULL_TREE) |
10982 | { | |
10983 | if (virtualp) | |
10984 | { | |
8251199e | 10985 | error ("virtual non-class function `%s'", name); |
8d08fdba MS |
10986 | virtualp = 0; |
10987 | } | |
8d08fdba MS |
10988 | } |
10989 | else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2) | |
14ae7e7d JM |
10990 | type = build_cplus_method_type (ctype, TREE_TYPE (type), |
10991 | TYPE_ARG_TYPES (type)); | |
8d08fdba | 10992 | |
eb66be0e | 10993 | /* Record presence of `static'. */ |
faae18ab | 10994 | publicp = (ctype != NULL_TREE |
a9aedbc2 | 10995 | || RIDBIT_SETP (RID_EXTERN, specbits) |
eb66be0e | 10996 | || !RIDBIT_SETP (RID_STATIC, specbits)); |
8d08fdba | 10997 | |
386b8a85 | 10998 | decl = grokfndecl (ctype, type, original_name, declarator, |
7a8f9fa9 | 10999 | virtualp, flags, quals, raises, |
75650646 | 11000 | 1, friendp, |
386b8a85 | 11001 | publicp, inlinep, funcdef_flag, |
2c73f9f5 | 11002 | template_count, in_namespace); |
f0e01782 MS |
11003 | if (decl == NULL_TREE) |
11004 | return NULL_TREE; | |
8d08fdba | 11005 | |
8d08fdba MS |
11006 | if (staticp == 1) |
11007 | { | |
11008 | int illegal_static = 0; | |
11009 | ||
11010 | /* Don't allow a static member function in a class, and forbid | |
11011 | declaring main to be static. */ | |
11012 | if (TREE_CODE (type) == METHOD_TYPE) | |
11013 | { | |
8251199e | 11014 | cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl); |
8d08fdba MS |
11015 | illegal_static = 1; |
11016 | } | |
8d08fdba MS |
11017 | else if (current_function_decl) |
11018 | { | |
11019 | /* FIXME need arm citation */ | |
8251199e | 11020 | error ("cannot declare static function inside another function"); |
8d08fdba MS |
11021 | illegal_static = 1; |
11022 | } | |
11023 | ||
11024 | if (illegal_static) | |
11025 | { | |
11026 | staticp = 0; | |
11027 | RIDBIT_RESET (RID_STATIC, specbits); | |
11028 | } | |
11029 | } | |
8d08fdba MS |
11030 | } |
11031 | else | |
11032 | { | |
11033 | /* It's a variable. */ | |
11034 | ||
11035 | /* An uninitialized decl with `extern' is a reference. */ | |
2c73f9f5 | 11036 | decl = grokvardecl (type, declarator, &specbits, |
950ad3c3 MM |
11037 | initialized, |
11038 | (type_quals & TYPE_QUAL_CONST) != 0, | |
11039 | in_namespace); | |
8d08fdba MS |
11040 | bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE, |
11041 | inlinep, friendp, raises != NULL_TREE); | |
11042 | ||
11043 | if (ctype) | |
11044 | { | |
f0e01782 | 11045 | DECL_CONTEXT (decl) = ctype; |
8d08fdba MS |
11046 | if (staticp == 1) |
11047 | { | |
8251199e | 11048 | cp_pedwarn ("static member `%D' re-declared as static", decl); |
8d08fdba MS |
11049 | staticp = 0; |
11050 | RIDBIT_RESET (RID_STATIC, specbits); | |
11051 | } | |
b7484fbe MS |
11052 | if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl)) |
11053 | { | |
8251199e | 11054 | cp_error ("static member `%D' declared `register'", decl); |
b7484fbe MS |
11055 | RIDBIT_RESET (RID_REGISTER, specbits); |
11056 | } | |
f30432d7 | 11057 | if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic) |
8d08fdba | 11058 | { |
8251199e | 11059 | cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage", |
f30432d7 | 11060 | decl); |
8d08fdba MS |
11061 | RIDBIT_RESET (RID_EXTERN, specbits); |
11062 | } | |
11063 | } | |
11064 | } | |
11065 | ||
11066 | if (RIDBIT_SETP (RID_MUTABLE, specbits)) | |
11067 | { | |
8251199e | 11068 | error ("`%s' cannot be declared mutable", name); |
8d08fdba MS |
11069 | } |
11070 | ||
11071 | /* Record `register' declaration for warnings on & | |
11072 | and in case doing stupid register allocation. */ | |
11073 | ||
11074 | if (RIDBIT_SETP (RID_REGISTER, specbits)) | |
11075 | DECL_REGISTER (decl) = 1; | |
11076 | ||
8926095f MS |
11077 | if (RIDBIT_SETP (RID_EXTERN, specbits)) |
11078 | DECL_THIS_EXTERN (decl) = 1; | |
11079 | ||
faae18ab MS |
11080 | if (RIDBIT_SETP (RID_STATIC, specbits)) |
11081 | DECL_THIS_STATIC (decl) = 1; | |
11082 | ||
adecb3f4 MM |
11083 | /* Record constancy and volatility. There's no need to do this |
11084 | when processing a template; we'll do this for the instantiated | |
11085 | declaration based on the type of DECL. */ | |
11086 | if (!processing_template_decl) | |
11087 | c_apply_type_quals_to_decl (type_quals, decl); | |
8d08fdba MS |
11088 | |
11089 | return decl; | |
11090 | } | |
11091 | } | |
11092 | \f | |
11093 | /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist. | |
11094 | An empty exprlist is a parmlist. An exprlist which | |
11095 | contains only identifiers at the global level | |
11096 | is a parmlist. Otherwise, it is an exprlist. */ | |
e92cc029 | 11097 | |
8d08fdba MS |
11098 | int |
11099 | parmlist_is_exprlist (exprs) | |
11100 | tree exprs; | |
11101 | { | |
11102 | if (exprs == NULL_TREE || TREE_PARMLIST (exprs)) | |
11103 | return 0; | |
11104 | ||
a9aedbc2 | 11105 | if (toplevel_bindings_p ()) |
8d08fdba MS |
11106 | { |
11107 | /* At the global level, if these are all identifiers, | |
11108 | then it is a parmlist. */ | |
11109 | while (exprs) | |
11110 | { | |
11111 | if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE) | |
11112 | return 1; | |
11113 | exprs = TREE_CHAIN (exprs); | |
11114 | } | |
11115 | return 0; | |
11116 | } | |
11117 | return 1; | |
11118 | } | |
11119 | ||
f181d4ae MM |
11120 | /* Subroutine of start_function. Ensure that each of the parameter |
11121 | types (as listed in PARMS) is complete, as is required for a | |
11122 | function definition. */ | |
e92cc029 | 11123 | |
8d08fdba MS |
11124 | static void |
11125 | require_complete_types_for_parms (parms) | |
11126 | tree parms; | |
11127 | { | |
11128 | while (parms) | |
11129 | { | |
11130 | tree type = TREE_TYPE (parms); | |
5566b478 | 11131 | if (TYPE_SIZE (complete_type (type)) == NULL_TREE) |
8d08fdba MS |
11132 | { |
11133 | if (DECL_NAME (parms)) | |
8251199e | 11134 | error ("parameter `%s' has incomplete type", |
8d08fdba MS |
11135 | IDENTIFIER_POINTER (DECL_NAME (parms))); |
11136 | else | |
8251199e | 11137 | error ("parameter has incomplete type"); |
8d08fdba MS |
11138 | TREE_TYPE (parms) = error_mark_node; |
11139 | } | |
42f989ff JM |
11140 | else |
11141 | layout_decl (parms, 0); | |
f181d4ae | 11142 | |
8d08fdba MS |
11143 | parms = TREE_CHAIN (parms); |
11144 | } | |
11145 | } | |
11146 | ||
297e73d8 MM |
11147 | /* Returns DECL if DECL is a local variable (or parameter). Returns |
11148 | NULL_TREE otherwise. */ | |
11149 | ||
11150 | static tree | |
11151 | local_variable_p (t) | |
11152 | tree t; | |
11153 | { | |
11154 | if ((TREE_CODE (t) == VAR_DECL | |
11155 | /* A VAR_DECL with a context that is a _TYPE is a static data | |
11156 | member. */ | |
11157 | && !TYPE_P (CP_DECL_CONTEXT (t)) | |
11158 | /* Any other non-local variable must be at namespace scope. */ | |
11159 | && TREE_CODE (CP_DECL_CONTEXT (t)) != NAMESPACE_DECL) | |
11160 | || (TREE_CODE (t) == PARM_DECL)) | |
11161 | return t; | |
11162 | ||
11163 | return NULL_TREE; | |
11164 | } | |
11165 | ||
11166 | /* Check that ARG, which is a default-argument expression for a | |
11167 | parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if | |
11168 | something goes wrong. DECL may also be a _TYPE node, rather than a | |
11169 | DECL, if there is no DECL available. */ | |
11170 | ||
11171 | tree | |
11172 | check_default_argument (decl, arg) | |
11173 | tree decl; | |
11174 | tree arg; | |
11175 | { | |
11176 | tree var; | |
11177 | tree decl_type; | |
11178 | ||
11179 | if (TREE_CODE (arg) == DEFAULT_ARG) | |
11180 | /* We get a DEFAULT_ARG when looking at an in-class declaration | |
11181 | with a default argument. Ignore the argument for now; we'll | |
11182 | deal with it after the class is complete. */ | |
11183 | return arg; | |
11184 | ||
11185 | if (processing_template_decl || uses_template_parms (arg)) | |
11186 | /* We don't do anything checking until instantiation-time. Note | |
11187 | that there may be uninstantiated arguments even for an | |
11188 | instantiated function, since default arguments are not | |
11189 | instantiated until they are needed. */ | |
11190 | return arg; | |
11191 | ||
11192 | if (TYPE_P (decl)) | |
11193 | { | |
11194 | decl_type = decl; | |
11195 | decl = NULL_TREE; | |
11196 | } | |
11197 | else | |
11198 | decl_type = TREE_TYPE (decl); | |
11199 | ||
11200 | if (arg == error_mark_node | |
11201 | || decl == error_mark_node | |
11202 | || TREE_TYPE (arg) == error_mark_node | |
11203 | || decl_type == error_mark_node) | |
11204 | /* Something already went wrong. There's no need to check | |
11205 | further. */ | |
11206 | return error_mark_node; | |
11207 | ||
11208 | /* [dcl.fct.default] | |
11209 | ||
11210 | A default argument expression is implicitly converted to the | |
11211 | parameter type. */ | |
11212 | if (!TREE_TYPE (arg) | |
11213 | || !can_convert_arg (decl_type, TREE_TYPE (arg), arg)) | |
11214 | { | |
11215 | if (decl) | |
11216 | cp_error ("default argument for `%#D' has type `%T'", | |
11217 | decl, TREE_TYPE (arg)); | |
11218 | else | |
8614a1d6 | 11219 | cp_error ("default argument for parameter of type `%T' has type `%T'", |
297e73d8 MM |
11220 | decl_type, TREE_TYPE (arg)); |
11221 | ||
11222 | return error_mark_node; | |
11223 | } | |
11224 | ||
11225 | /* [dcl.fct.default] | |
11226 | ||
11227 | Local variables shall not be used in default argument | |
11228 | expressions. | |
11229 | ||
11230 | The keyword `this' shall not be used in a default argument of a | |
11231 | member function. */ | |
11232 | var = search_tree (arg, local_variable_p); | |
11233 | if (var) | |
11234 | { | |
11235 | cp_error ("default argument `%E' uses local variable `%D'", | |
11236 | arg, var); | |
11237 | return error_mark_node; | |
11238 | } | |
11239 | ||
11240 | /* All is well. */ | |
11241 | return arg; | |
11242 | } | |
11243 | ||
8d08fdba MS |
11244 | /* Decode the list of parameter types for a function type. |
11245 | Given the list of things declared inside the parens, | |
11246 | return a list of types. | |
11247 | ||
11248 | The list we receive can have three kinds of elements: | |
11249 | an IDENTIFIER_NODE for names given without types, | |
11250 | a TREE_LIST node for arguments given as typespecs or names with typespecs, | |
11251 | or void_type_node, to mark the end of an argument list | |
11252 | when additional arguments are not permitted (... was not used). | |
11253 | ||
11254 | FUNCDEF_FLAG is nonzero for a function definition, 0 for | |
11255 | a mere declaration. A nonempty identifier-list gets an error message | |
11256 | when FUNCDEF_FLAG is zero. | |
11257 | If FUNCDEF_FLAG is 1, then parameter types must be complete. | |
11258 | If FUNCDEF_FLAG is -1, then parameter types may be incomplete. | |
11259 | ||
11260 | If all elements of the input list contain types, | |
11261 | we return a list of the types. | |
11262 | If all elements contain no type (except perhaps a void_type_node | |
11263 | at the end), we return a null list. | |
11264 | If some have types and some do not, it is an error, and we | |
11265 | return a null list. | |
11266 | ||
11267 | Also set last_function_parms to either | |
11268 | a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs. | |
11269 | A list of names is converted to a chain of PARM_DECLs | |
11270 | by store_parm_decls so that ultimately it is always a chain of decls. | |
11271 | ||
11272 | Note that in C++, parameters can take default values. These default | |
11273 | values are in the TREE_PURPOSE field of the TREE_LIST. It is | |
11274 | an error to specify default values which are followed by parameters | |
11275 | that have no default values, or an ELLIPSES. For simplicities sake, | |
11276 | only parameters which are specified with their types can take on | |
11277 | default values. */ | |
11278 | ||
11279 | static tree | |
11280 | grokparms (first_parm, funcdef_flag) | |
11281 | tree first_parm; | |
11282 | int funcdef_flag; | |
11283 | { | |
11284 | tree result = NULL_TREE; | |
11285 | tree decls = NULL_TREE; | |
11286 | ||
11287 | if (first_parm != NULL_TREE | |
11288 | && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE) | |
11289 | { | |
11290 | if (! funcdef_flag) | |
8251199e | 11291 | pedwarn ("parameter names (without types) in function declaration"); |
8d08fdba MS |
11292 | last_function_parms = first_parm; |
11293 | return NULL_TREE; | |
11294 | } | |
11295 | else if (first_parm != NULL_TREE | |
11296 | && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST | |
a1774733 | 11297 | && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE) |
8d08fdba MS |
11298 | my_friendly_abort (145); |
11299 | else | |
11300 | { | |
11301 | /* Types were specified. This is a list of declarators | |
11302 | each represented as a TREE_LIST node. */ | |
11303 | register tree parm, chain; | |
5566b478 | 11304 | int any_init = 0, any_error = 0; |
8d08fdba MS |
11305 | |
11306 | if (first_parm != NULL_TREE) | |
11307 | { | |
11308 | tree last_result = NULL_TREE; | |
11309 | tree last_decl = NULL_TREE; | |
11310 | ||
11311 | for (parm = first_parm; parm != NULL_TREE; parm = chain) | |
11312 | { | |
a703fb38 | 11313 | tree type = NULL_TREE, list_node = parm; |
8d08fdba MS |
11314 | register tree decl = TREE_VALUE (parm); |
11315 | tree init = TREE_PURPOSE (parm); | |
11316 | ||
11317 | chain = TREE_CHAIN (parm); | |
11318 | /* @@ weak defense against parse errors. */ | |
a1774733 BK |
11319 | if (TREE_CODE (decl) != VOID_TYPE |
11320 | && TREE_CODE (decl) != TREE_LIST) | |
8d08fdba MS |
11321 | { |
11322 | /* Give various messages as the need arises. */ | |
11323 | if (TREE_CODE (decl) == STRING_CST) | |
8251199e | 11324 | cp_error ("invalid string constant `%E'", decl); |
8d08fdba | 11325 | else if (TREE_CODE (decl) == INTEGER_CST) |
8251199e | 11326 | error ("invalid integer constant in parameter list, did you forget to give parameter name?"); |
8d08fdba MS |
11327 | continue; |
11328 | } | |
11329 | ||
a1774733 | 11330 | if (TREE_CODE (decl) != VOID_TYPE) |
8d08fdba | 11331 | { |
8d08fdba MS |
11332 | decl = grokdeclarator (TREE_VALUE (decl), |
11333 | TREE_PURPOSE (decl), | |
f30432d7 | 11334 | PARM, init != NULL_TREE, |
c11b6f21 | 11335 | NULL_TREE); |
3bfdc719 | 11336 | if (! decl || TREE_TYPE (decl) == error_mark_node) |
8d08fdba | 11337 | continue; |
01240200 MM |
11338 | |
11339 | /* Top-level qualifiers on the parameters are | |
11340 | ignored for function types. */ | |
11341 | type = TYPE_MAIN_VARIANT (TREE_TYPE (decl)); | |
11342 | ||
a1774733 | 11343 | if (TREE_CODE (type) == VOID_TYPE) |
8d08fdba MS |
11344 | decl = void_type_node; |
11345 | else if (TREE_CODE (type) == METHOD_TYPE) | |
11346 | { | |
11347 | if (DECL_NAME (decl)) | |
fc378698 | 11348 | /* Cannot use the decl here because |
8d08fdba | 11349 | we don't have DECL_CONTEXT set up yet. */ |
8251199e | 11350 | cp_error ("parameter `%D' invalidly declared method type", |
fc378698 | 11351 | DECL_NAME (decl)); |
8d08fdba | 11352 | else |
8251199e | 11353 | error ("parameter invalidly declared method type"); |
8d08fdba MS |
11354 | type = build_pointer_type (type); |
11355 | TREE_TYPE (decl) = type; | |
11356 | } | |
11357 | else if (TREE_CODE (type) == OFFSET_TYPE) | |
11358 | { | |
11359 | if (DECL_NAME (decl)) | |
8251199e | 11360 | cp_error ("parameter `%D' invalidly declared offset type", |
fc378698 | 11361 | DECL_NAME (decl)); |
8d08fdba | 11362 | else |
8251199e | 11363 | error ("parameter invalidly declared offset type"); |
8d08fdba MS |
11364 | type = build_pointer_type (type); |
11365 | TREE_TYPE (decl) = type; | |
11366 | } | |
a7a64a77 MM |
11367 | else if (abstract_virtuals_error (decl, type)) |
11368 | any_error = 1; /* Seems like a good idea. */ | |
482b883f JM |
11369 | else if (POINTER_TYPE_P (type)) |
11370 | { | |
11371 | tree t = type; | |
11372 | while (POINTER_TYPE_P (t) | |
11373 | || (TREE_CODE (t) == ARRAY_TYPE | |
11374 | && TYPE_DOMAIN (t) != NULL_TREE)) | |
11375 | t = TREE_TYPE (t); | |
11376 | if (TREE_CODE (t) == ARRAY_TYPE) | |
57af8358 MM |
11377 | cp_error ("parameter type `%T' includes %s to array of unknown bound", |
11378 | type, | |
11379 | TYPE_PTR_P (type) ? "pointer" : "reference"); | |
482b883f | 11380 | } |
8d08fdba MS |
11381 | } |
11382 | ||
a1774733 | 11383 | if (TREE_CODE (decl) == VOID_TYPE) |
8d08fdba MS |
11384 | { |
11385 | if (result == NULL_TREE) | |
11386 | { | |
11387 | result = void_list_node; | |
11388 | last_result = result; | |
11389 | } | |
11390 | else | |
11391 | { | |
11392 | TREE_CHAIN (last_result) = void_list_node; | |
11393 | last_result = void_list_node; | |
11394 | } | |
8d08fdba MS |
11395 | if (chain |
11396 | && (chain != void_list_node || TREE_CHAIN (chain))) | |
8251199e | 11397 | error ("`void' in parameter list must be entire list"); |
8d08fdba MS |
11398 | break; |
11399 | } | |
11400 | ||
11401 | /* Since there is a prototype, args are passed in their own types. */ | |
11402 | DECL_ARG_TYPE (decl) = TREE_TYPE (decl); | |
fa56377d JJ |
11403 | if (PROMOTE_PROTOTYPES |
11404 | && (TREE_CODE (type) == INTEGER_TYPE | |
11405 | || TREE_CODE (type) == ENUMERAL_TYPE) | |
8d08fdba MS |
11406 | && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) |
11407 | DECL_ARG_TYPE (decl) = integer_type_node; | |
297e73d8 | 11408 | if (!any_error && init) |
8d08fdba | 11409 | { |
297e73d8 MM |
11410 | any_init++; |
11411 | init = check_default_argument (decl, init); | |
8d08fdba MS |
11412 | } |
11413 | else | |
11414 | init = NULL_TREE; | |
11415 | ||
11416 | if (decls == NULL_TREE) | |
11417 | { | |
11418 | decls = decl; | |
11419 | last_decl = decls; | |
11420 | } | |
11421 | else | |
11422 | { | |
11423 | TREE_CHAIN (last_decl) = decl; | |
11424 | last_decl = decl; | |
11425 | } | |
5868eb4e | 11426 | list_node = tree_cons (init, type, NULL_TREE); |
8d08fdba MS |
11427 | if (result == NULL_TREE) |
11428 | { | |
11429 | result = list_node; | |
11430 | last_result = result; | |
11431 | } | |
11432 | else | |
11433 | { | |
11434 | TREE_CHAIN (last_result) = list_node; | |
11435 | last_result = list_node; | |
11436 | } | |
11437 | } | |
11438 | if (last_result) | |
11439 | TREE_CHAIN (last_result) = NULL_TREE; | |
11440 | /* If there are no parameters, and the function does not end | |
11441 | with `...', then last_decl will be NULL_TREE. */ | |
11442 | if (last_decl != NULL_TREE) | |
11443 | TREE_CHAIN (last_decl) = NULL_TREE; | |
11444 | } | |
11445 | } | |
11446 | ||
11447 | last_function_parms = decls; | |
11448 | ||
8d08fdba MS |
11449 | return result; |
11450 | } | |
42976354 BK |
11451 | |
11452 | /* Called from the parser to update an element of TYPE_ARG_TYPES for some | |
11453 | FUNCTION_TYPE with the newly parsed version of its default argument, which | |
11454 | was previously digested as text. See snarf_defarg et al in lex.c. */ | |
11455 | ||
11456 | void | |
11457 | replace_defarg (arg, init) | |
11458 | tree arg, init; | |
11459 | { | |
aa5f3bad | 11460 | if (! processing_template_decl |
42976354 | 11461 | && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init)) |
8251199e | 11462 | cp_pedwarn ("invalid type `%T' for default argument to `%T'", |
42976354 BK |
11463 | TREE_TYPE (init), TREE_VALUE (arg)); |
11464 | TREE_PURPOSE (arg) = init; | |
11465 | } | |
8d08fdba | 11466 | \f |
c11b6f21 MS |
11467 | int |
11468 | copy_args_p (d) | |
11469 | tree d; | |
11470 | { | |
11471 | tree t = FUNCTION_ARG_CHAIN (d); | |
67437d5b JM |
11472 | if (DECL_CONSTRUCTOR_P (d) |
11473 | && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d))) | |
11474 | t = TREE_CHAIN (t); | |
c11b6f21 MS |
11475 | if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE |
11476 | && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t))) | |
11477 | == DECL_CLASS_CONTEXT (d)) | |
11478 | && (TREE_CHAIN (t) == NULL_TREE | |
11479 | || TREE_CHAIN (t) == void_list_node | |
11480 | || TREE_PURPOSE (TREE_CHAIN (t)))) | |
11481 | return 1; | |
11482 | return 0; | |
11483 | } | |
11484 | ||
8d08fdba MS |
11485 | /* These memoizing functions keep track of special properties which |
11486 | a class may have. `grok_ctor_properties' notices whether a class | |
11487 | has a constructor of the form X(X&), and also complains | |
11488 | if the class has a constructor of the form X(X). | |
11489 | `grok_op_properties' takes notice of the various forms of | |
11490 | operator= which are defined, as well as what sorts of type conversion | |
11491 | may apply. Both functions take a FUNCTION_DECL as an argument. */ | |
e92cc029 | 11492 | |
a0a33927 | 11493 | int |
8d08fdba MS |
11494 | grok_ctor_properties (ctype, decl) |
11495 | tree ctype, decl; | |
11496 | { | |
11497 | tree parmtypes = FUNCTION_ARG_CHAIN (decl); | |
11498 | tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node; | |
11499 | ||
11500 | /* When a type has virtual baseclasses, a magical first int argument is | |
11501 | added to any ctor so we can tell if the class has been initialized | |
11502 | yet. This could screw things up in this function, so we deliberately | |
11503 | ignore the leading int if we're in that situation. */ | |
711734a9 | 11504 | if (TYPE_USES_VIRTUAL_BASECLASSES (ctype)) |
8d08fdba | 11505 | { |
711734a9 JM |
11506 | my_friendly_assert (parmtypes |
11507 | && TREE_VALUE (parmtypes) == integer_type_node, | |
11508 | 980529); | |
8d08fdba MS |
11509 | parmtypes = TREE_CHAIN (parmtypes); |
11510 | parmtype = TREE_VALUE (parmtypes); | |
11511 | } | |
11512 | ||
f181d4ae MM |
11513 | /* [class.copy] |
11514 | ||
11515 | A non-template constructor for class X is a copy constructor if | |
11516 | its first parameter is of type X&, const X&, volatile X& or const | |
11517 | volatile X&, and either there are no other parameters or else all | |
11518 | other parameters have default arguments. */ | |
8d08fdba | 11519 | if (TREE_CODE (parmtype) == REFERENCE_TYPE |
0b41abe6 JM |
11520 | && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype |
11521 | && (TREE_CHAIN (parmtypes) == NULL_TREE | |
8d08fdba | 11522 | || TREE_CHAIN (parmtypes) == void_list_node |
f181d4ae MM |
11523 | || TREE_PURPOSE (TREE_CHAIN (parmtypes))) |
11524 | && !(DECL_TEMPLATE_INSTANTIATION (decl) | |
11525 | && is_member_template (DECL_TI_TEMPLATE (decl)))) | |
0b41abe6 JM |
11526 | { |
11527 | TYPE_HAS_INIT_REF (ctype) = 1; | |
91063b51 | 11528 | if (CP_TYPE_CONST_P (TREE_TYPE (parmtype))) |
0b41abe6 | 11529 | TYPE_HAS_CONST_INIT_REF (ctype) = 1; |
8d08fdba | 11530 | } |
f181d4ae MM |
11531 | /* [class.copy] |
11532 | ||
11533 | A declaration of a constructor for a class X is ill-formed if its | |
11534 | first parameter is of type (optionally cv-qualified) X and either | |
11535 | there are no other parameters or else all other parameters have | |
11536 | default arguments. | |
11537 | ||
11538 | We *don't* complain about member template instantiations that | |
11539 | have this form, though; they can occur as we try to decide what | |
11540 | constructor to use during overload resolution. Since overload | |
11541 | resolution will never prefer such a constructor to the | |
11542 | non-template copy constructor (which is either explicitly or | |
11543 | implicitly defined), there's no need to worry about their | |
11544 | existence. Theoretically, they should never even be | |
11545 | instantiated, but that's hard to forestall. */ | |
0b41abe6 | 11546 | else if (TYPE_MAIN_VARIANT (parmtype) == ctype |
59e76fc6 JM |
11547 | && (TREE_CHAIN (parmtypes) == NULL_TREE |
11548 | || TREE_CHAIN (parmtypes) == void_list_node | |
f181d4ae MM |
11549 | || TREE_PURPOSE (TREE_CHAIN (parmtypes))) |
11550 | && !(DECL_TEMPLATE_INSTANTIATION (decl) | |
11551 | && is_member_template (DECL_TI_TEMPLATE (decl)))) | |
8d08fdba | 11552 | { |
8251199e | 11553 | cp_error ("invalid constructor; you probably meant `%T (const %T&)'", |
0b41abe6 JM |
11554 | ctype, ctype); |
11555 | SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype); | |
11556 | return 0; | |
8d08fdba MS |
11557 | } |
11558 | else if (TREE_CODE (parmtype) == VOID_TYPE | |
11559 | || TREE_PURPOSE (parmtypes) != NULL_TREE) | |
11560 | TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1; | |
a0a33927 MS |
11561 | |
11562 | return 1; | |
8d08fdba MS |
11563 | } |
11564 | ||
11565 | /* An operator with this name can be either unary or binary. */ | |
e92cc029 | 11566 | |
a28e3c7f MS |
11567 | static int |
11568 | ambi_op_p (name) | |
8d08fdba MS |
11569 | tree name; |
11570 | { | |
11571 | return (name == ansi_opname [(int) INDIRECT_REF] | |
11572 | || name == ansi_opname [(int) ADDR_EXPR] | |
11573 | || name == ansi_opname [(int) NEGATE_EXPR] | |
11574 | || name == ansi_opname[(int) POSTINCREMENT_EXPR] | |
11575 | || name == ansi_opname[(int) POSTDECREMENT_EXPR] | |
11576 | || name == ansi_opname [(int) CONVERT_EXPR]); | |
11577 | } | |
11578 | ||
11579 | /* An operator with this name can only be unary. */ | |
e92cc029 | 11580 | |
a28e3c7f MS |
11581 | static int |
11582 | unary_op_p (name) | |
8d08fdba MS |
11583 | tree name; |
11584 | { | |
11585 | return (name == ansi_opname [(int) TRUTH_NOT_EXPR] | |
11586 | || name == ansi_opname [(int) BIT_NOT_EXPR] | |
11587 | || name == ansi_opname [(int) COMPONENT_REF] | |
4c571114 | 11588 | || IDENTIFIER_TYPENAME_P (name)); |
8d08fdba MS |
11589 | } |
11590 | ||
11591 | /* Do a little sanity-checking on how they declared their operator. */ | |
e92cc029 | 11592 | |
5566b478 | 11593 | void |
8d08fdba MS |
11594 | grok_op_properties (decl, virtualp, friendp) |
11595 | tree decl; | |
11596 | int virtualp, friendp; | |
11597 | { | |
11598 | tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
11599 | int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE); | |
11600 | tree name = DECL_NAME (decl); | |
8d08fdba | 11601 | |
a28e3c7f MS |
11602 | if (current_class_type == NULL_TREE) |
11603 | friendp = 1; | |
8d08fdba | 11604 | |
a28e3c7f MS |
11605 | if (! friendp) |
11606 | { | |
f181d4ae MM |
11607 | /* [class.copy] |
11608 | ||
11609 | A user-declared copy assignment operator X::operator= is a | |
11610 | non-static non-template member function of class X with | |
11611 | exactly one parameter of type X, X&, const X&, volatile X& or | |
11612 | const volatile X&. */ | |
11613 | if (name == ansi_opname[(int) MODIFY_EXPR] | |
11614 | && !(DECL_TEMPLATE_INSTANTIATION (decl) | |
11615 | && is_member_template (DECL_TI_TEMPLATE (decl)))) | |
6a629cac | 11616 | ; |
a28e3c7f MS |
11617 | else if (name == ansi_opname[(int) CALL_EXPR]) |
11618 | TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1; | |
11619 | else if (name == ansi_opname[(int) ARRAY_REF]) | |
11620 | TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1; | |
11621 | else if (name == ansi_opname[(int) COMPONENT_REF] | |
11622 | || name == ansi_opname[(int) MEMBER_REF]) | |
11623 | TYPE_OVERLOADS_ARROW (current_class_type) = 1; | |
11624 | else if (name == ansi_opname[(int) NEW_EXPR]) | |
11625 | TYPE_GETS_NEW (current_class_type) |= 1; | |
11626 | else if (name == ansi_opname[(int) DELETE_EXPR]) | |
11627 | TYPE_GETS_DELETE (current_class_type) |= 1; | |
11628 | else if (name == ansi_opname[(int) VEC_NEW_EXPR]) | |
11629 | TYPE_GETS_NEW (current_class_type) |= 2; | |
11630 | else if (name == ansi_opname[(int) VEC_DELETE_EXPR]) | |
11631 | TYPE_GETS_DELETE (current_class_type) |= 2; | |
11632 | } | |
11633 | ||
11634 | if (name == ansi_opname[(int) NEW_EXPR] | |
11635 | || name == ansi_opname[(int) VEC_NEW_EXPR]) | |
8d08fdba | 11636 | { |
8d08fdba MS |
11637 | /* When the compiler encounters the definition of A::operator new, it |
11638 | doesn't look at the class declaration to find out if it's static. */ | |
a28e3c7f | 11639 | if (methodp) |
700f8a87 | 11640 | revert_static_member_fn (&decl, NULL, NULL); |
8d08fdba MS |
11641 | |
11642 | /* Take care of function decl if we had syntax errors. */ | |
11643 | if (argtypes == NULL_TREE) | |
beb53fb8 JM |
11644 | TREE_TYPE (decl) |
11645 | = build_function_type (ptr_type_node, | |
11646 | hash_tree_chain (integer_type_node, | |
11647 | void_list_node)); | |
8d08fdba | 11648 | else |
a28e3c7f | 11649 | TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl)); |
8d08fdba | 11650 | } |
a28e3c7f MS |
11651 | else if (name == ansi_opname[(int) DELETE_EXPR] |
11652 | || name == ansi_opname[(int) VEC_DELETE_EXPR]) | |
8d08fdba | 11653 | { |
a28e3c7f | 11654 | if (methodp) |
700f8a87 | 11655 | revert_static_member_fn (&decl, NULL, NULL); |
8d08fdba MS |
11656 | |
11657 | if (argtypes == NULL_TREE) | |
beb53fb8 JM |
11658 | TREE_TYPE (decl) |
11659 | = build_function_type (void_type_node, | |
11660 | hash_tree_chain (ptr_type_node, | |
11661 | void_list_node)); | |
8d08fdba | 11662 | else |
a28e3c7f MS |
11663 | { |
11664 | TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl)); | |
11665 | ||
11666 | if (! friendp && name == ansi_opname[(int) VEC_DELETE_EXPR] | |
11667 | && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))) | |
11668 | != void_list_node)) | |
11669 | TYPE_VEC_DELETE_TAKES_SIZE (current_class_type) = 1; | |
11670 | } | |
8d08fdba | 11671 | } |
8d08fdba MS |
11672 | else |
11673 | { | |
11674 | /* An operator function must either be a non-static member function | |
11675 | or have at least one parameter of a class, a reference to a class, | |
11676 | an enumeration, or a reference to an enumeration. 13.4.0.6 */ | |
700f8a87 | 11677 | if (! methodp || DECL_STATIC_FUNCTION_P (decl)) |
8d08fdba | 11678 | { |
4c571114 | 11679 | if (IDENTIFIER_TYPENAME_P (name) |
8d08fdba MS |
11680 | || name == ansi_opname[(int) CALL_EXPR] |
11681 | || name == ansi_opname[(int) MODIFY_EXPR] | |
11682 | || name == ansi_opname[(int) COMPONENT_REF] | |
11683 | || name == ansi_opname[(int) ARRAY_REF]) | |
8251199e | 11684 | cp_error ("`%D' must be a nonstatic member function", decl); |
8d08fdba MS |
11685 | else |
11686 | { | |
11687 | tree p = argtypes; | |
11688 | ||
700f8a87 | 11689 | if (DECL_STATIC_FUNCTION_P (decl)) |
8251199e | 11690 | cp_error ("`%D' must be either a non-static member function or a non-member function", decl); |
700f8a87 | 11691 | |
8d08fdba | 11692 | if (p) |
a1774733 | 11693 | for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p)) |
8d08fdba MS |
11694 | { |
11695 | tree arg = TREE_VALUE (p); | |
11696 | if (TREE_CODE (arg) == REFERENCE_TYPE) | |
11697 | arg = TREE_TYPE (arg); | |
11698 | ||
11699 | /* This lets bad template code slip through. */ | |
11700 | if (IS_AGGR_TYPE (arg) | |
11701 | || TREE_CODE (arg) == ENUMERAL_TYPE | |
73b0fce8 KL |
11702 | || TREE_CODE (arg) == TEMPLATE_TYPE_PARM |
11703 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
8d08fdba MS |
11704 | goto foundaggr; |
11705 | } | |
8251199e JM |
11706 | cp_error |
11707 | ("`%D' must have an argument of class or enumerated type", | |
8d08fdba MS |
11708 | decl); |
11709 | foundaggr: | |
11710 | ; | |
11711 | } | |
11712 | } | |
11713 | ||
277294d7 | 11714 | if (name == ansi_opname[(int) CALL_EXPR]) |
2c73f9f5 | 11715 | return; /* No restrictions on args. */ |
8d08fdba | 11716 | |
9a3b49ac | 11717 | if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl)) |
a0a33927 MS |
11718 | { |
11719 | tree t = TREE_TYPE (name); | |
11720 | if (TREE_CODE (t) == VOID_TYPE) | |
8251199e | 11721 | pedwarn ("void is not a valid type conversion operator"); |
a0a33927 MS |
11722 | else if (! friendp) |
11723 | { | |
11724 | int ref = (TREE_CODE (t) == REFERENCE_TYPE); | |
d8e178a0 | 11725 | const char *what = 0; |
a0a33927 MS |
11726 | if (ref) |
11727 | t = TYPE_MAIN_VARIANT (TREE_TYPE (t)); | |
11728 | ||
11729 | if (t == current_class_type) | |
11730 | what = "the same type"; | |
9a3b49ac | 11731 | /* Don't force t to be complete here. */ |
a0a33927 | 11732 | else if (IS_AGGR_TYPE (t) |
9a3b49ac | 11733 | && TYPE_SIZE (t) |
a0a33927 MS |
11734 | && DERIVED_FROM_P (t, current_class_type)) |
11735 | what = "a base class"; | |
11736 | ||
11737 | if (what) | |
8251199e | 11738 | warning ("conversion to %s%s will never use a type conversion operator", |
a0a33927 MS |
11739 | ref ? "a reference to " : "", what); |
11740 | } | |
11741 | } | |
11742 | ||
8d08fdba MS |
11743 | if (name == ansi_opname[(int) MODIFY_EXPR]) |
11744 | { | |
11745 | tree parmtype; | |
11746 | ||
11747 | if (list_length (argtypes) != 3 && methodp) | |
11748 | { | |
8251199e | 11749 | cp_error ("`%D' must take exactly one argument", decl); |
8d08fdba MS |
11750 | return; |
11751 | } | |
11752 | parmtype = TREE_VALUE (TREE_CHAIN (argtypes)); | |
11753 | ||
f0e01782 | 11754 | if (copy_assignment_arg_p (parmtype, virtualp) |
a28e3c7f | 11755 | && ! friendp) |
8d08fdba MS |
11756 | { |
11757 | TYPE_HAS_ASSIGN_REF (current_class_type) = 1; | |
f0e01782 | 11758 | if (TREE_CODE (parmtype) != REFERENCE_TYPE |
91063b51 | 11759 | || CP_TYPE_CONST_P (TREE_TYPE (parmtype))) |
8d08fdba MS |
11760 | TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1; |
11761 | } | |
11762 | } | |
11763 | else if (name == ansi_opname[(int) COND_EXPR]) | |
11764 | { | |
11765 | /* 13.4.0.3 */ | |
a7a64a77 | 11766 | cp_error ("ANSI C++ prohibits overloading operator ?:"); |
8d08fdba MS |
11767 | } |
11768 | else if (ambi_op_p (name)) | |
11769 | { | |
11770 | if (list_length (argtypes) == 2) | |
11771 | /* prefix */; | |
11772 | else if (list_length (argtypes) == 3) | |
11773 | { | |
11774 | if ((name == ansi_opname[(int) POSTINCREMENT_EXPR] | |
11775 | || name == ansi_opname[(int) POSTDECREMENT_EXPR]) | |
5156628f | 11776 | && ! processing_template_decl |
007e5fea | 11777 | && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node)) |
8d08fdba MS |
11778 | { |
11779 | if (methodp) | |
8251199e | 11780 | cp_error ("postfix `%D' must take `int' as its argument", |
8d08fdba MS |
11781 | decl); |
11782 | else | |
8251199e JM |
11783 | cp_error |
11784 | ("postfix `%D' must take `int' as its second argument", | |
11785 | decl); | |
8d08fdba MS |
11786 | } |
11787 | } | |
11788 | else | |
11789 | { | |
11790 | if (methodp) | |
8251199e | 11791 | cp_error ("`%D' must take either zero or one argument", decl); |
8d08fdba | 11792 | else |
8251199e | 11793 | cp_error ("`%D' must take either one or two arguments", decl); |
8d08fdba | 11794 | } |
824b9a4c MS |
11795 | |
11796 | /* More Effective C++ rule 6. */ | |
eb448459 | 11797 | if (warn_ecpp |
824b9a4c MS |
11798 | && (name == ansi_opname[(int) POSTINCREMENT_EXPR] |
11799 | || name == ansi_opname[(int) POSTDECREMENT_EXPR])) | |
11800 | { | |
11801 | tree arg = TREE_VALUE (argtypes); | |
11802 | tree ret = TREE_TYPE (TREE_TYPE (decl)); | |
11803 | if (methodp || TREE_CODE (arg) == REFERENCE_TYPE) | |
11804 | arg = TREE_TYPE (arg); | |
11805 | arg = TYPE_MAIN_VARIANT (arg); | |
11806 | if (list_length (argtypes) == 2) | |
11807 | { | |
11808 | if (TREE_CODE (ret) != REFERENCE_TYPE | |
3bfdc719 MM |
11809 | || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)), |
11810 | arg)) | |
8251199e | 11811 | cp_warning ("prefix `%D' should return `%T'", decl, |
824b9a4c MS |
11812 | build_reference_type (arg)); |
11813 | } | |
11814 | else | |
11815 | { | |
3bfdc719 | 11816 | if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg)) |
8251199e | 11817 | cp_warning ("postfix `%D' should return `%T'", decl, arg); |
824b9a4c MS |
11818 | } |
11819 | } | |
8d08fdba MS |
11820 | } |
11821 | else if (unary_op_p (name)) | |
11822 | { | |
11823 | if (list_length (argtypes) != 2) | |
11824 | { | |
11825 | if (methodp) | |
8251199e | 11826 | cp_error ("`%D' must take `void'", decl); |
8d08fdba | 11827 | else |
8251199e | 11828 | cp_error ("`%D' must take exactly one argument", decl); |
8d08fdba MS |
11829 | } |
11830 | } | |
11831 | else /* if (binary_op_p (name)) */ | |
11832 | { | |
11833 | if (list_length (argtypes) != 3) | |
11834 | { | |
11835 | if (methodp) | |
8251199e | 11836 | cp_error ("`%D' must take exactly one argument", decl); |
8d08fdba | 11837 | else |
8251199e | 11838 | cp_error ("`%D' must take exactly two arguments", decl); |
8d08fdba | 11839 | } |
824b9a4c MS |
11840 | |
11841 | /* More Effective C++ rule 7. */ | |
eb448459 | 11842 | if (warn_ecpp |
824b9a4c MS |
11843 | && (name == ansi_opname [TRUTH_ANDIF_EXPR] |
11844 | || name == ansi_opname [TRUTH_ORIF_EXPR] | |
11845 | || name == ansi_opname [COMPOUND_EXPR])) | |
8251199e | 11846 | cp_warning ("user-defined `%D' always evaluates both arguments", |
824b9a4c MS |
11847 | decl); |
11848 | } | |
11849 | ||
11850 | /* Effective C++ rule 23. */ | |
eb448459 | 11851 | if (warn_ecpp |
824b9a4c MS |
11852 | && list_length (argtypes) == 3 |
11853 | && (name == ansi_opname [PLUS_EXPR] | |
11854 | || name == ansi_opname [MINUS_EXPR] | |
11855 | || name == ansi_opname [TRUNC_DIV_EXPR] | |
11856 | || name == ansi_opname [MULT_EXPR]) | |
11857 | && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE) | |
8251199e | 11858 | cp_warning ("`%D' should return by value", decl); |
8d08fdba MS |
11859 | |
11860 | /* 13.4.0.8 */ | |
11861 | if (argtypes) | |
11862 | for (; argtypes != void_list_node ; argtypes = TREE_CHAIN (argtypes)) | |
11863 | if (TREE_PURPOSE (argtypes)) | |
11864 | { | |
11865 | TREE_PURPOSE (argtypes) = NULL_TREE; | |
11866 | if (name == ansi_opname[(int) POSTINCREMENT_EXPR] | |
11867 | || name == ansi_opname[(int) POSTDECREMENT_EXPR]) | |
11868 | { | |
11869 | if (pedantic) | |
8251199e | 11870 | cp_pedwarn ("`%D' cannot have default arguments", decl); |
8d08fdba MS |
11871 | } |
11872 | else | |
8251199e | 11873 | cp_error ("`%D' cannot have default arguments", decl); |
8d08fdba MS |
11874 | } |
11875 | } | |
11876 | } | |
11877 | \f | |
d8e178a0 | 11878 | static const char * |
094fe153 JM |
11879 | tag_name (code) |
11880 | enum tag_types code; | |
11881 | { | |
11882 | switch (code) | |
11883 | { | |
11884 | case record_type: | |
11885 | return "struct"; | |
11886 | case class_type: | |
11887 | return "class"; | |
11888 | case union_type: | |
11889 | return "union "; | |
11890 | case enum_type: | |
11891 | return "enum"; | |
094fe153 JM |
11892 | default: |
11893 | my_friendly_abort (981122); | |
11894 | } | |
11895 | } | |
11896 | ||
8d08fdba MS |
11897 | /* Get the struct, enum or union (CODE says which) with tag NAME. |
11898 | Define the tag as a forward-reference if it is not defined. | |
11899 | ||
11900 | C++: If a class derivation is given, process it here, and report | |
11901 | an error if multiple derivation declarations are not identical. | |
11902 | ||
11903 | If this is a definition, come in through xref_tag and only look in | |
11904 | the current frame for the name (since C++ allows new names in any | |
11905 | scope.) */ | |
11906 | ||
8d08fdba | 11907 | tree |
ca107ded | 11908 | xref_tag (code_type_node, name, globalize) |
8d08fdba | 11909 | tree code_type_node; |
ca107ded | 11910 | tree name; |
8d08fdba MS |
11911 | int globalize; |
11912 | { | |
11913 | enum tag_types tag_code; | |
11914 | enum tree_code code; | |
11915 | int temp = 0; | |
8d08fdba | 11916 | register tree ref, t; |
8f032717 | 11917 | struct binding_level *b = current_binding_level; |
a80e4195 | 11918 | int got_type = 0; |
dc8263bc | 11919 | tree attributes = NULL_TREE; |
25aab5d0 | 11920 | tree context = NULL_TREE; |
dc8263bc JM |
11921 | |
11922 | /* If we are called from the parser, code_type_node will sometimes be a | |
11923 | TREE_LIST. This indicates that the user wrote | |
11924 | "class __attribute__ ((foo)) bar". Extract the attributes so we can | |
11925 | use them later. */ | |
11926 | if (TREE_CODE (code_type_node) == TREE_LIST) | |
11927 | { | |
11928 | attributes = TREE_PURPOSE (code_type_node); | |
11929 | code_type_node = TREE_VALUE (code_type_node); | |
11930 | } | |
8d08fdba MS |
11931 | |
11932 | tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node); | |
11933 | switch (tag_code) | |
11934 | { | |
11935 | case record_type: | |
11936 | case class_type: | |
8d08fdba | 11937 | code = RECORD_TYPE; |
8d08fdba MS |
11938 | break; |
11939 | case union_type: | |
11940 | code = UNION_TYPE; | |
8d08fdba MS |
11941 | break; |
11942 | case enum_type: | |
11943 | code = ENUMERAL_TYPE; | |
11944 | break; | |
11945 | default: | |
11946 | my_friendly_abort (18); | |
11947 | } | |
11948 | ||
11949 | /* If a cross reference is requested, look up the type | |
11950 | already defined for this tag and return it. */ | |
be99da77 MS |
11951 | if (TREE_CODE_CLASS (TREE_CODE (name)) == 't') |
11952 | { | |
11953 | t = name; | |
a80e4195 MS |
11954 | name = TYPE_IDENTIFIER (t); |
11955 | got_type = 1; | |
be99da77 MS |
11956 | } |
11957 | else | |
11958 | t = IDENTIFIER_TYPE_VALUE (name); | |
61a127b3 | 11959 | |
73b0fce8 KL |
11960 | if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM |
11961 | && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM) | |
a0a33927 MS |
11962 | t = NULL_TREE; |
11963 | ||
8ccc31eb | 11964 | if (! globalize) |
8d08fdba | 11965 | { |
f3400fe2 JM |
11966 | /* If we know we are defining this tag, only look it up in |
11967 | this scope and don't try to find it as a type. */ | |
11968 | ref = lookup_tag (code, name, b, 1); | |
8d08fdba MS |
11969 | } |
11970 | else | |
11971 | { | |
25aab5d0 | 11972 | if (t) |
36a117a5 | 11973 | { |
25aab5d0 MM |
11974 | /* [dcl.type.elab] If the identifier resolves to a |
11975 | typedef-name or a template type-parameter, the | |
11976 | elaborated-type-specifier is ill-formed. */ | |
11977 | if (t != TYPE_MAIN_VARIANT (t) | |
11978 | || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t))) | |
11979 | cp_pedwarn ("using typedef-name `%D' after `%s'", | |
11980 | TYPE_NAME (t), tag_name (tag_code)); | |
11981 | else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
11982 | cp_error ("using template type parameter `%T' after `%s'", | |
11983 | t, tag_name (tag_code)); | |
11984 | ||
11985 | ref = t; | |
11986 | } | |
11987 | else | |
11988 | ref = lookup_tag (code, name, b, 0); | |
36a117a5 | 11989 | |
25aab5d0 MM |
11990 | if (! ref) |
11991 | { | |
11992 | /* Try finding it as a type declaration. If that wins, | |
11993 | use it. */ | |
11994 | ref = lookup_name (name, 1); | |
11995 | ||
11996 | if (ref != NULL_TREE | |
11997 | && processing_template_decl | |
11998 | && DECL_CLASS_TEMPLATE_P (ref) | |
11999 | && template_class_depth (current_class_type) == 0) | |
12000 | /* Since GLOBALIZE is true, we're declaring a global | |
6757edfe | 12001 | template, so we want this type. */ |
25aab5d0 | 12002 | ref = DECL_RESULT (ref); |
6757edfe | 12003 | |
25aab5d0 MM |
12004 | if (ref && TREE_CODE (ref) == TYPE_DECL |
12005 | && TREE_CODE (TREE_TYPE (ref)) == code) | |
12006 | ref = TREE_TYPE (ref); | |
12007 | else | |
12008 | ref = NULL_TREE; | |
12009 | } | |
12010 | ||
12011 | if (ref && current_class_type | |
12012 | && template_class_depth (current_class_type) | |
12013 | && PROCESSING_REAL_TEMPLATE_DECL_P ()) | |
12014 | { | |
12015 | /* Since GLOBALIZE is non-zero, we are not looking at a | |
12016 | definition of this tag. Since, in addition, we are currently | |
12017 | processing a (member) template declaration of a template | |
12018 | class, we must be very careful; consider: | |
12019 | ||
12020 | template <class X> | |
12021 | struct S1 | |
12022 | ||
12023 | template <class U> | |
12024 | struct S2 | |
12025 | { template <class V> | |
12026 | friend struct S1; }; | |
12027 | ||
12028 | Here, the S2::S1 declaration should not be confused with the | |
12029 | outer declaration. In particular, the inner version should | |
12030 | have a template parameter of level 2, not level 1. This | |
12031 | would be particularly important if the member declaration | |
12032 | were instead: | |
12033 | ||
12034 | template <class V = U> friend struct S1; | |
12035 | ||
12036 | say, when we should tsubst into `U' when instantiating | |
12037 | S2. On the other hand, when presented with: | |
12038 | ||
12039 | template <class T> | |
12040 | struct S1 { | |
12041 | template <class U> | |
12042 | struct S2 {}; | |
12043 | template <class U> | |
12044 | friend struct S2; | |
12045 | }; | |
12046 | ||
12047 | we must find the inner binding eventually. We | |
12048 | accomplish this by making sure that the new type we | |
12049 | create to represent this declaration has the right | |
12050 | TYPE_CONTEXT. */ | |
12051 | context = TYPE_CONTEXT (ref); | |
12052 | ref = NULL_TREE; | |
8d08fdba MS |
12053 | } |
12054 | } | |
12055 | ||
12056 | push_obstacks_nochange (); | |
12057 | ||
12058 | if (! ref) | |
12059 | { | |
12060 | /* If no such tag is yet defined, create a forward-reference node | |
12061 | and record it as the "definition". | |
12062 | When a real declaration of this type is found, | |
12063 | the forward-reference will be altered into a real type. */ | |
12064 | ||
12065 | /* In C++, since these migrate into the global scope, we must | |
12066 | build them on the permanent obstack. */ | |
12067 | ||
12068 | temp = allocation_temporary_p (); | |
12069 | if (temp) | |
12070 | end_temporary_allocation (); | |
12071 | ||
12072 | if (code == ENUMERAL_TYPE) | |
12073 | { | |
8251199e | 12074 | cp_error ("use of enum `%#D' without previous declaration", name); |
fc378698 | 12075 | |
8d08fdba MS |
12076 | ref = make_node (ENUMERAL_TYPE); |
12077 | ||
12078 | /* Give the type a default layout like unsigned int | |
12079 | to avoid crashing if it does not get defined. */ | |
12080 | TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node); | |
12081 | TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node); | |
12082 | TREE_UNSIGNED (ref) = 1; | |
12083 | TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node); | |
12084 | TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node); | |
12085 | TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node); | |
12086 | ||
12087 | /* Enable us to recognize when a type is created in class context. | |
12088 | To do nested classes correctly, this should probably be cleared | |
12089 | out when we leave this classes scope. Currently this in only | |
12090 | done in `start_enum'. */ | |
12091 | ||
12092 | pushtag (name, ref, globalize); | |
8d08fdba | 12093 | } |
8d08fdba MS |
12094 | else |
12095 | { | |
8d08fdba | 12096 | struct binding_level *old_b = class_binding_level; |
8d08fdba MS |
12097 | |
12098 | ref = make_lang_type (code); | |
25aab5d0 | 12099 | TYPE_CONTEXT (ref) = context; |
8d08fdba | 12100 | |
8d08fdba MS |
12101 | #ifdef NONNESTED_CLASSES |
12102 | /* Class types don't nest the way enums do. */ | |
12103 | class_binding_level = (struct binding_level *)0; | |
12104 | #endif | |
12105 | pushtag (name, ref, globalize); | |
12106 | class_binding_level = old_b; | |
8d08fdba MS |
12107 | } |
12108 | } | |
12109 | else | |
12110 | { | |
8d08fdba | 12111 | /* If it no longer looks like a nested type, make sure it's |
30394414 JM |
12112 | in global scope. |
12113 | If it is not an IDENTIFIER, this is not a declaration */ | |
2c73f9f5 | 12114 | if (b->namespace_p && !class_binding_level |
30394414 JM |
12115 | && TREE_CODE (name) == IDENTIFIER_NODE) |
12116 | { | |
2c73f9f5 ML |
12117 | if (IDENTIFIER_NAMESPACE_VALUE (name) == NULL_TREE) |
12118 | SET_IDENTIFIER_NAMESPACE_VALUE (name, TYPE_NAME (ref)); | |
30394414 | 12119 | } |
7fe6899f MM |
12120 | |
12121 | if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref)) | |
6757edfe | 12122 | redeclare_class_template (ref, current_template_parms); |
8d08fdba MS |
12123 | } |
12124 | ||
8d08fdba MS |
12125 | /* Until the type is defined, tentatively accept whatever |
12126 | structure tag the user hands us. */ | |
12127 | if (TYPE_SIZE (ref) == NULL_TREE | |
12128 | && ref != current_class_type | |
12129 | /* Have to check this, in case we have contradictory tag info. */ | |
12130 | && IS_AGGR_TYPE_CODE (TREE_CODE (ref))) | |
12131 | { | |
12132 | if (tag_code == class_type) | |
12133 | CLASSTYPE_DECLARED_CLASS (ref) = 1; | |
6eabb241 | 12134 | else if (tag_code == record_type) |
8d08fdba MS |
12135 | CLASSTYPE_DECLARED_CLASS (ref) = 0; |
12136 | } | |
12137 | ||
12138 | pop_obstacks (); | |
12139 | ||
dc8263bc JM |
12140 | TREE_TYPE (ref) = attributes; |
12141 | ||
8d08fdba MS |
12142 | return ref; |
12143 | } | |
8ccc31eb | 12144 | |
fc378698 MS |
12145 | tree |
12146 | xref_tag_from_type (old, id, globalize) | |
12147 | tree old, id; | |
12148 | int globalize; | |
12149 | { | |
12150 | tree code_type_node; | |
12151 | ||
12152 | if (TREE_CODE (old) == RECORD_TYPE) | |
12153 | code_type_node = (CLASSTYPE_DECLARED_CLASS (old) | |
12154 | ? class_type_node : record_type_node); | |
12155 | else | |
12156 | code_type_node = union_type_node; | |
12157 | ||
12158 | if (id == NULL_TREE) | |
12159 | id = TYPE_IDENTIFIER (old); | |
12160 | ||
ca107ded | 12161 | return xref_tag (code_type_node, id, globalize); |
fc378698 MS |
12162 | } |
12163 | ||
3fd71a52 MM |
12164 | /* REF is a type (named NAME), for which we have just seen some |
12165 | baseclasses. BINFO is a list of those baseclasses; the | |
12166 | TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of | |
12167 | the base-class. CODE_TYPE_NODE indicates whether REF is a class, | |
12168 | struct, or union. */ | |
12169 | ||
8ccc31eb MS |
12170 | void |
12171 | xref_basetypes (code_type_node, name, ref, binfo) | |
12172 | tree code_type_node; | |
12173 | tree name, ref; | |
12174 | tree binfo; | |
12175 | { | |
12176 | /* In the declaration `A : X, Y, ... Z' we mark all the types | |
12177 | (A, X, Y, ..., Z) so we can check for duplicates. */ | |
12178 | tree binfos; | |
d6479fe7 MM |
12179 | tree base; |
12180 | ||
8ccc31eb MS |
12181 | int i, len; |
12182 | enum tag_types tag_code = (enum tag_types) TREE_INT_CST_LOW (code_type_node); | |
12183 | ||
12184 | if (tag_code == union_type) | |
12185 | { | |
8251199e | 12186 | cp_error ("derived union `%T' invalid", ref); |
8ccc31eb MS |
12187 | return; |
12188 | } | |
12189 | ||
12190 | len = list_length (binfo); | |
12191 | push_obstacks (TYPE_OBSTACK (ref), TYPE_OBSTACK (ref)); | |
12192 | ||
d6479fe7 MM |
12193 | /* First, make sure that any templates in base-classes are |
12194 | instantiated. This ensures that if we call ourselves recursively | |
12195 | we do not get confused about which classes are marked and which | |
12196 | are not. */ | |
12197 | for (base = binfo; base; base = TREE_CHAIN (base)) | |
12198 | complete_type (TREE_VALUE (base)); | |
12199 | ||
8ccc31eb MS |
12200 | SET_CLASSTYPE_MARKED (ref); |
12201 | BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len); | |
12202 | ||
12203 | for (i = 0; binfo; binfo = TREE_CHAIN (binfo)) | |
12204 | { | |
12205 | /* The base of a derived struct is public by default. */ | |
12206 | int via_public | |
be99da77 MS |
12207 | = (TREE_PURPOSE (binfo) == access_public_node |
12208 | || TREE_PURPOSE (binfo) == access_public_virtual_node | |
8ccc31eb | 12209 | || (tag_code != class_type |
be99da77 MS |
12210 | && (TREE_PURPOSE (binfo) == access_default_node |
12211 | || TREE_PURPOSE (binfo) == access_default_virtual_node))); | |
d8b55a76 JM |
12212 | int via_protected |
12213 | = (TREE_PURPOSE (binfo) == access_protected_node | |
12214 | || TREE_PURPOSE (binfo) == access_protected_virtual_node); | |
8ccc31eb | 12215 | int via_virtual |
be99da77 | 12216 | = (TREE_PURPOSE (binfo) == access_private_virtual_node |
d8b55a76 | 12217 | || TREE_PURPOSE (binfo) == access_protected_virtual_node |
be99da77 MS |
12218 | || TREE_PURPOSE (binfo) == access_public_virtual_node |
12219 | || TREE_PURPOSE (binfo) == access_default_virtual_node); | |
12220 | tree basetype = TREE_VALUE (binfo); | |
8ccc31eb MS |
12221 | tree base_binfo; |
12222 | ||
8ccc31eb MS |
12223 | if (basetype && TREE_CODE (basetype) == TYPE_DECL) |
12224 | basetype = TREE_TYPE (basetype); | |
5566b478 MS |
12225 | if (!basetype |
12226 | || (TREE_CODE (basetype) != RECORD_TYPE | |
a80e4195 | 12227 | && TREE_CODE (basetype) != TYPENAME_TYPE |
73b0fce8 KL |
12228 | && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM |
12229 | && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM)) | |
8ccc31eb | 12230 | { |
8251199e | 12231 | cp_error ("base type `%T' fails to be a struct or class type", |
8ccc31eb MS |
12232 | TREE_VALUE (binfo)); |
12233 | continue; | |
12234 | } | |
2b9dc906 | 12235 | |
11b5139c | 12236 | GNU_xref_hier (name, basetype, via_public, via_virtual, 0); |
2b9dc906 | 12237 | |
8adf5b5e JM |
12238 | /* This code replaces similar code in layout_basetypes. |
12239 | We put the complete_type first for implicit `typename'. */ | |
d6479fe7 | 12240 | if (TYPE_SIZE (basetype) == NULL_TREE |
2b9dc906 | 12241 | && ! (current_template_parms && uses_template_parms (basetype))) |
8ccc31eb | 12242 | { |
8251199e | 12243 | cp_error ("base class `%T' has incomplete type", basetype); |
8ccc31eb MS |
12244 | continue; |
12245 | } | |
8ccc31eb MS |
12246 | else |
12247 | { | |
12248 | if (CLASSTYPE_MARKED (basetype)) | |
12249 | { | |
12250 | if (basetype == ref) | |
8251199e | 12251 | cp_error ("recursive type `%T' undefined", basetype); |
8ccc31eb | 12252 | else |
8251199e | 12253 | cp_error ("duplicate base type `%T' invalid", basetype); |
8ccc31eb MS |
12254 | continue; |
12255 | } | |
12256 | ||
eff71ab0 | 12257 | if (TYPE_FOR_JAVA (basetype) |
9cd64686 MM |
12258 | && (current_lang_stack |
12259 | == &VARRAY_TREE (current_lang_base, 0))) | |
eff71ab0 PB |
12260 | TYPE_FOR_JAVA (ref) = 1; |
12261 | ||
8ccc31eb MS |
12262 | /* Note that the BINFO records which describe individual |
12263 | inheritances are *not* shared in the lattice! They | |
12264 | cannot be shared because a given baseclass may be | |
12265 | inherited with different `accessibility' by different | |
12266 | derived classes. (Each BINFO record describing an | |
12267 | individual inheritance contains flags which say what | |
12268 | the `accessibility' of that particular inheritance is.) */ | |
12269 | ||
7ddedda4 MM |
12270 | base_binfo |
12271 | = make_binfo (integer_zero_node, basetype, | |
12272 | CLASS_TYPE_P (basetype) | |
12273 | ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE, | |
12274 | CLASS_TYPE_P (basetype) | |
12275 | ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE); | |
8ccc31eb MS |
12276 | |
12277 | TREE_VEC_ELT (binfos, i) = base_binfo; | |
12278 | TREE_VIA_PUBLIC (base_binfo) = via_public; | |
12279 | TREE_VIA_PROTECTED (base_binfo) = via_protected; | |
12280 | TREE_VIA_VIRTUAL (base_binfo) = via_virtual; | |
12281 | BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref); | |
12282 | ||
dfbcd65a JM |
12283 | /* We need to unshare the binfos now so that lookups during class |
12284 | definition work. */ | |
12285 | unshare_base_binfos (base_binfo); | |
12286 | ||
8ccc31eb | 12287 | SET_CLASSTYPE_MARKED (basetype); |
9e9ff709 | 12288 | |
8ccc31eb MS |
12289 | /* We are free to modify these bits because they are meaningless |
12290 | at top level, and BASETYPE is a top-level type. */ | |
12291 | if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype)) | |
12292 | { | |
12293 | TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1; | |
12294 | TYPE_USES_COMPLEX_INHERITANCE (ref) = 1; | |
12295 | } | |
12296 | ||
7ddedda4 MM |
12297 | if (CLASS_TYPE_P (basetype)) |
12298 | { | |
12299 | TYPE_GETS_NEW (ref) |= TYPE_GETS_NEW (basetype); | |
12300 | TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype); | |
12301 | } | |
12302 | ||
8ccc31eb MS |
12303 | i += 1; |
12304 | } | |
12305 | } | |
12306 | if (i) | |
12307 | TREE_VEC_LENGTH (binfos) = i; | |
12308 | else | |
12309 | BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE; | |
12310 | ||
12311 | if (i > 1) | |
12312 | TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1; | |
12313 | else if (i == 1) | |
7ddedda4 MM |
12314 | { |
12315 | tree basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, 0)); | |
12316 | ||
12317 | if (CLASS_TYPE_P (basetype)) | |
12318 | TYPE_USES_MULTIPLE_INHERITANCE (ref) | |
12319 | = TYPE_USES_MULTIPLE_INHERITANCE (basetype); | |
12320 | } | |
12321 | ||
8ccc31eb MS |
12322 | if (TYPE_USES_MULTIPLE_INHERITANCE (ref)) |
12323 | TYPE_USES_COMPLEX_INHERITANCE (ref) = 1; | |
12324 | ||
12325 | /* Unmark all the types. */ | |
12326 | while (--i >= 0) | |
12327 | CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i))); | |
12328 | CLEAR_CLASSTYPE_MARKED (ref); | |
12329 | ||
70c532b5 MM |
12330 | /* Now that we know all the base-classes, set up the list of virtual |
12331 | bases. */ | |
12332 | CLASSTYPE_VBASECLASSES (ref) = get_vbase_types (ref); | |
12333 | ||
8ccc31eb MS |
12334 | pop_obstacks (); |
12335 | } | |
12336 | ||
8d08fdba | 12337 | \f |
8d08fdba MS |
12338 | /* Begin compiling the definition of an enumeration type. |
12339 | NAME is its name (or null if anonymous). | |
12340 | Returns the type object, as yet incomplete. | |
12341 | Also records info about it so that build_enumerator | |
12342 | may be used to declare the individual values as they are read. */ | |
12343 | ||
12344 | tree | |
12345 | start_enum (name) | |
12346 | tree name; | |
12347 | { | |
12348 | register tree enumtype = NULL_TREE; | |
8f032717 | 12349 | struct binding_level *b = current_binding_level; |
8d08fdba | 12350 | |
8c1e8edc | 12351 | /* We are wasting space here and putting these on the permanent_obstack so |
6e687e5e | 12352 | that typeid(local enum) will work correctly. */ |
cbf882af | 12353 | push_obstacks (&permanent_obstack, &permanent_obstack); |
b87692e5 | 12354 | |
8d08fdba MS |
12355 | /* If this is the real definition for a previous forward reference, |
12356 | fill in the contents in the same object that used to be the | |
12357 | forward reference. */ | |
12358 | ||
12359 | if (name != NULL_TREE) | |
12360 | enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1); | |
12361 | ||
12362 | if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE) | |
30ff8252 NS |
12363 | { |
12364 | cp_error ("multiple definition of `%#T'", enumtype); | |
12365 | cp_error_at ("previous definition here", enumtype); | |
12366 | } | |
8d08fdba MS |
12367 | else |
12368 | { | |
12369 | enumtype = make_node (ENUMERAL_TYPE); | |
12370 | pushtag (name, enumtype, 0); | |
12371 | } | |
12372 | ||
12373 | if (current_class_type) | |
12374 | TREE_ADDRESSABLE (b->tags) = 1; | |
c91a56d2 | 12375 | |
e92cc029 MS |
12376 | /* We don't copy this value because build_enumerator needs to do it. */ |
12377 | enum_next_value = integer_zero_node; | |
7177d104 | 12378 | enum_overflow = 0; |
8d08fdba MS |
12379 | |
12380 | GNU_xref_decl (current_function_decl, enumtype); | |
12381 | return enumtype; | |
12382 | } | |
12383 | ||
12384 | /* After processing and defining all the values of an enumeration type, | |
12385 | install their decls in the enumeration type and finish it off. | |
12386 | ENUMTYPE is the type object and VALUES a list of name-value pairs. | |
12387 | Returns ENUMTYPE. */ | |
12388 | ||
12389 | tree | |
dbfe2124 MM |
12390 | finish_enum (enumtype) |
12391 | tree enumtype; | |
8d08fdba | 12392 | { |
a703fb38 | 12393 | register tree minnode = NULL_TREE, maxnode = NULL_TREE; |
8d08fdba MS |
12394 | /* Calculate the maximum value of any enumerator in this type. */ |
12395 | ||
dbfe2124 | 12396 | tree values = TYPE_VALUES (enumtype); |
8d08fdba MS |
12397 | if (values) |
12398 | { | |
ed44da02 | 12399 | tree pair; |
5566b478 | 12400 | |
ed44da02 | 12401 | for (pair = values; pair; pair = TREE_CHAIN (pair)) |
8d08fdba | 12402 | { |
ed44da02 MM |
12403 | tree decl; |
12404 | tree value; | |
12405 | ||
12406 | /* The TREE_VALUE is a CONST_DECL for this enumeration | |
12407 | constant. */ | |
12408 | decl = TREE_VALUE (pair); | |
12409 | ||
ed44da02 MM |
12410 | /* The DECL_INITIAL will be NULL if we are processing a |
12411 | template declaration and this enumeration constant had no | |
12412 | explicit initializer. */ | |
12413 | value = DECL_INITIAL (decl); | |
079e1098 | 12414 | if (value && !processing_template_decl) |
5566b478 | 12415 | { |
079e1098 MM |
12416 | /* Set the TREE_TYPE for the VALUE as well. That's so |
12417 | that when we call decl_constant_value we get an | |
12418 | entity of the right type (but with the constant | |
12419 | value). Since we shouldn't ever call | |
12420 | decl_constant_value on a template type, there's no | |
12421 | reason to do that when processing_template_decl. | |
12422 | And, if the expression is something like a | |
12423 | TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will | |
12424 | wreak havoc on the intended type of the expression. | |
12425 | ||
12426 | Of course, there's also no point in trying to compute | |
12427 | minimum or maximum values if we're in a template. */ | |
5566b478 | 12428 | TREE_TYPE (value) = enumtype; |
ed44da02 | 12429 | |
079e1098 MM |
12430 | if (!minnode) |
12431 | minnode = maxnode = value; | |
12432 | else if (tree_int_cst_lt (maxnode, value)) | |
12433 | maxnode = value; | |
12434 | else if (tree_int_cst_lt (value, minnode)) | |
12435 | minnode = value; | |
5566b478 | 12436 | } |
ed44da02 | 12437 | |
72f2bd78 MM |
12438 | if (processing_template_decl) |
12439 | /* If this is just a template, leave the CONST_DECL | |
12440 | alone. That way tsubst_copy will find CONST_DECLs for | |
12441 | CONST_DECLs, and not INTEGER_CSTs. */ | |
12442 | ; | |
12443 | else | |
12444 | /* In the list we're building up, we want the enumeration | |
12445 | values, not the CONST_DECLs. */ | |
12446 | TREE_VALUE (pair) = value; | |
8d08fdba MS |
12447 | } |
12448 | } | |
f376e137 MS |
12449 | else |
12450 | maxnode = minnode = integer_zero_node; | |
8d08fdba | 12451 | |
de22184b | 12452 | TYPE_VALUES (enumtype) = nreverse (values); |
2986ae00 | 12453 | |
5156628f | 12454 | if (processing_template_decl) |
b87692e5 | 12455 | { |
9360ac70 MM |
12456 | tree scope = current_scope (); |
12457 | if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
cbf882af | 12458 | add_tree (build_min (TAG_DEFN, enumtype)); |
b87692e5 | 12459 | } |
cbf882af MM |
12460 | else |
12461 | { | |
12462 | int unsignedp = tree_int_cst_sgn (minnode) >= 0; | |
12463 | int lowprec = min_precision (minnode, unsignedp); | |
12464 | int highprec = min_precision (maxnode, unsignedp); | |
12465 | int precision = MAX (lowprec, highprec); | |
12466 | tree tem; | |
5566b478 | 12467 | |
cbf882af | 12468 | TYPE_SIZE (enumtype) = NULL_TREE; |
8d08fdba | 12469 | |
cbf882af | 12470 | /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */ |
8ccc31eb | 12471 | |
cbf882af MM |
12472 | TYPE_PRECISION (enumtype) = precision; |
12473 | if (unsignedp) | |
12474 | fixup_unsigned_type (enumtype); | |
12475 | else | |
12476 | fixup_signed_type (enumtype); | |
8ccc31eb | 12477 | |
cbf882af MM |
12478 | if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node))) |
12479 | /* Use the width of the narrowest normal C type which is wide | |
12480 | enough. */ | |
12481 | TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size | |
12482 | (precision, 1)); | |
12483 | else | |
12484 | TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node); | |
8d08fdba | 12485 | |
cbf882af MM |
12486 | TYPE_SIZE (enumtype) = 0; |
12487 | layout_type (enumtype); | |
f376e137 | 12488 | |
cbf882af MM |
12489 | /* Fix up all variant types of this enum type. */ |
12490 | for (tem = TYPE_MAIN_VARIANT (enumtype); tem; | |
12491 | tem = TYPE_NEXT_VARIANT (tem)) | |
12492 | { | |
12493 | TYPE_VALUES (tem) = TYPE_VALUES (enumtype); | |
12494 | TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype); | |
12495 | TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype); | |
12496 | TYPE_SIZE (tem) = TYPE_SIZE (enumtype); | |
12497 | TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype); | |
12498 | TYPE_MODE (tem) = TYPE_MODE (enumtype); | |
12499 | TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype); | |
12500 | TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype); | |
12501 | TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype); | |
12502 | } | |
8d08fdba | 12503 | |
cbf882af MM |
12504 | /* Finish debugging output for this type. */ |
12505 | rest_of_type_compilation (enumtype, namespace_bindings_p ()); | |
12506 | } | |
12507 | ||
12508 | /* In start_enum we pushed obstacks. Here, we must pop them. */ | |
12509 | pop_obstacks (); | |
8d08fdba MS |
12510 | |
12511 | return enumtype; | |
12512 | } | |
12513 | ||
079e1098 MM |
12514 | /* Build and install a CONST_DECL for an enumeration constant of the |
12515 | enumeration type TYPE whose NAME and VALUE (if any) are provided. | |
8d08fdba MS |
12516 | Assignment of sequential values by default is handled here. */ |
12517 | ||
12518 | tree | |
079e1098 MM |
12519 | build_enumerator (name, value, type) |
12520 | tree name; | |
12521 | tree value; | |
12522 | tree type; | |
8d08fdba MS |
12523 | { |
12524 | tree decl, result; | |
e8bd800e | 12525 | tree context; |
8d08fdba MS |
12526 | |
12527 | /* Remove no-op casts from the value. */ | |
12528 | if (value) | |
12529 | STRIP_TYPE_NOPS (value); | |
12530 | ||
5156628f | 12531 | if (! processing_template_decl) |
5566b478 MS |
12532 | { |
12533 | /* Validate and default VALUE. */ | |
12534 | if (value != NULL_TREE) | |
12535 | { | |
12536 | if (TREE_READONLY_DECL_P (value)) | |
e92cc029 | 12537 | value = decl_constant_value (value); |
5566b478 MS |
12538 | |
12539 | if (TREE_CODE (value) == INTEGER_CST) | |
12540 | { | |
12541 | value = default_conversion (value); | |
12542 | constant_expression_warning (value); | |
12543 | } | |
12544 | else | |
12545 | { | |
8251199e | 12546 | cp_error ("enumerator value for `%D' not integer constant", name); |
5566b478 MS |
12547 | value = NULL_TREE; |
12548 | } | |
12549 | } | |
12550 | ||
5566b478 | 12551 | /* Default based on previous value. */ |
5156628f | 12552 | if (value == NULL_TREE && ! processing_template_decl) |
5566b478 MS |
12553 | { |
12554 | value = enum_next_value; | |
12555 | if (enum_overflow) | |
8251199e | 12556 | cp_error ("overflow in enumeration values at `%D'", name); |
5566b478 MS |
12557 | } |
12558 | ||
12559 | /* Remove no-op casts from the value. */ | |
12560 | if (value) | |
12561 | STRIP_TYPE_NOPS (value); | |
013bc8af MS |
12562 | #if 0 |
12563 | /* To fix MAX_VAL enum consts. (bkoz) */ | |
e92cc029 | 12564 | TREE_TYPE (value) = integer_type_node; |
013bc8af | 12565 | #endif |
5566b478 | 12566 | } |
8d08fdba | 12567 | |
079e1098 MM |
12568 | /* We always have to copy here; not all INTEGER_CSTs are unshared. |
12569 | Even in other cases, we will later (in finish_enum) be setting the | |
12570 | type of VALUE. */ | |
ed44da02 MM |
12571 | if (value != NULL_TREE) |
12572 | value = copy_node (value); | |
12573 | ||
8d08fdba | 12574 | /* C++ associates enums with global, function, or class declarations. */ |
e8bd800e MM |
12575 | |
12576 | context = current_scope (); | |
12577 | if (context && context == current_class_type) | |
12578 | /* This enum declaration is local to the class. */ | |
4ce3d537 | 12579 | decl = build_lang_decl (CONST_DECL, name, type); |
e8bd800e MM |
12580 | else |
12581 | /* It's a global enum, or it's local to a function. (Note local to | |
12582 | a function could mean local to a class method. */ | |
079e1098 | 12583 | decl = build_decl (CONST_DECL, name, type); |
e8bd800e MM |
12584 | |
12585 | DECL_CONTEXT (decl) = FROB_CONTEXT (context); | |
12586 | DECL_INITIAL (decl) = value; | |
12587 | TREE_READONLY (decl) = 1; | |
12588 | ||
12589 | if (context && context == current_class_type) | |
8f032717 MM |
12590 | /* In something like `struct S { enum E { i = 7 }; };' we put `i' |
12591 | on the TYPE_FIELDS list for `S'. (That's so that you can say | |
12592 | things like `S::i' later.) */ | |
12593 | finish_member_declaration (decl); | |
e8bd800e MM |
12594 | else |
12595 | { | |
12596 | pushdecl (decl); | |
12597 | GNU_xref_decl (current_function_decl, decl); | |
12598 | } | |
8d08fdba | 12599 | |
5156628f | 12600 | if (! processing_template_decl) |
5566b478 MS |
12601 | { |
12602 | /* Set basis for default for next value. */ | |
12603 | enum_next_value = build_binary_op_nodefault (PLUS_EXPR, value, | |
12604 | integer_one_node, PLUS_EXPR); | |
12605 | enum_overflow = tree_int_cst_lt (enum_next_value, value); | |
5566b478 | 12606 | } |
8d08fdba | 12607 | |
e1b3e07d | 12608 | result = tree_cons (name, decl, NULL_TREE); |
8d08fdba MS |
12609 | return result; |
12610 | } | |
12611 | ||
8d08fdba | 12612 | \f |
5566b478 MS |
12613 | static int function_depth; |
12614 | ||
a8f73d4b MM |
12615 | /* We're defining DECL. Make sure that it's type is OK. */ |
12616 | ||
12617 | static void | |
12618 | check_function_type (decl) | |
12619 | tree decl; | |
12620 | { | |
12621 | tree fntype = TREE_TYPE (decl); | |
12622 | ||
12623 | /* In a function definition, arg types must be complete. */ | |
12624 | require_complete_types_for_parms (current_function_parms); | |
12625 | ||
12626 | if (TYPE_SIZE (complete_type (TREE_TYPE (fntype))) == NULL_TREE) | |
12627 | { | |
12628 | cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype)); | |
12629 | ||
12630 | /* Make it return void instead, but don't change the | |
12631 | type of the DECL_RESULT, in case we have a named return value. */ | |
12632 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
12633 | { | |
12634 | tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype))); | |
12635 | TREE_TYPE (decl) | |
12636 | = build_cplus_method_type (ctype, | |
12637 | void_type_node, | |
12638 | FUNCTION_ARG_CHAIN (decl)); | |
12639 | } | |
12640 | else | |
12641 | TREE_TYPE (decl) | |
12642 | = build_function_type (void_type_node, | |
12643 | TYPE_ARG_TYPES (TREE_TYPE (decl))); | |
12644 | TREE_TYPE (decl) | |
12645 | = build_exception_variant (fntype, | |
12646 | TYPE_RAISES_EXCEPTIONS (fntype)); | |
12647 | } | |
12648 | else | |
12649 | abstract_virtuals_error (decl, TREE_TYPE (fntype)); | |
12650 | } | |
12651 | ||
8d08fdba MS |
12652 | /* Create the FUNCTION_DECL for a function definition. |
12653 | DECLSPECS and DECLARATOR are the parts of the declaration; | |
12654 | they describe the function's name and the type it returns, | |
12655 | but twisted together in a fashion that parallels the syntax of C. | |
12656 | ||
a8f73d4b MM |
12657 | FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the |
12658 | DECLARATOR is really the DECL for the function we are about to | |
12659 | process and that DECLSPECS should be ignored), SF_INCLASS_INLINE | |
12660 | indicating that the function is an inline defined in-class, and | |
12661 | SF_EXPAND indicating that we should generate RTL for this | |
12662 | function. | |
f181d4ae | 12663 | |
8d08fdba MS |
12664 | This function creates a binding context for the function body |
12665 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
12666 | ||
12667 | Returns 1 on success. If the DECLARATOR is not suitable for a function | |
12668 | (it defines a datum instead), we return 0, which tells | |
12669 | yyparse to report a parse error. | |
12670 | ||
12671 | For C++, we must first check whether that datum makes any sense. | |
12672 | For example, "class A local_a(1,2);" means that variable local_a | |
12673 | is an aggregate of type A, which should have a constructor | |
87e3dbc9 | 12674 | applied to it with the argument list [1, 2]. */ |
8d08fdba MS |
12675 | |
12676 | int | |
a8f73d4b | 12677 | start_function (declspecs, declarator, attrs, flags) |
c11b6f21 | 12678 | tree declspecs, declarator, attrs; |
a8f73d4b | 12679 | int flags; |
8d08fdba | 12680 | { |
5566b478 | 12681 | tree decl1; |
8d08fdba MS |
12682 | tree ctype = NULL_TREE; |
12683 | tree fntype; | |
12684 | tree restype; | |
12685 | extern int have_extern_spec; | |
12686 | extern int used_extern_spec; | |
12687 | int doing_friend = 0; | |
a8f73d4b | 12688 | struct binding_level *bl; |
8d08fdba | 12689 | |
8d08fdba | 12690 | /* Sanity check. */ |
a1774733 | 12691 | my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160); |
8d08fdba MS |
12692 | my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161); |
12693 | ||
e92cc029 | 12694 | /* This should only be done once on the top most decl. */ |
8d08fdba MS |
12695 | if (have_extern_spec && !used_extern_spec) |
12696 | { | |
12697 | declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs); | |
12698 | used_extern_spec = 1; | |
12699 | } | |
12700 | ||
a8f73d4b | 12701 | if (flags & SF_PRE_PARSED) |
8d08fdba MS |
12702 | { |
12703 | decl1 = declarator; | |
12704 | ||
8d08fdba MS |
12705 | fntype = TREE_TYPE (decl1); |
12706 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
12707 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
12708 | ||
12709 | /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a | |
12710 | class is in the (lexical) scope of the class in which it is | |
12711 | defined. */ | |
12712 | if (!ctype && DECL_FRIEND_P (decl1)) | |
12713 | { | |
12714 | ctype = DECL_CLASS_CONTEXT (decl1); | |
12715 | ||
12716 | /* CTYPE could be null here if we're dealing with a template; | |
12717 | for example, `inline friend float foo()' inside a template | |
12718 | will have no CTYPE set. */ | |
12719 | if (ctype && TREE_CODE (ctype) != RECORD_TYPE) | |
12720 | ctype = NULL_TREE; | |
12721 | else | |
12722 | doing_friend = 1; | |
12723 | } | |
12724 | ||
5566b478 MS |
12725 | last_function_parms = DECL_ARGUMENTS (decl1); |
12726 | last_function_parm_tags = NULL_TREE; | |
8d08fdba MS |
12727 | } |
12728 | else | |
12729 | { | |
c11b6f21 | 12730 | decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE); |
8d08fdba MS |
12731 | /* If the declarator is not suitable for a function definition, |
12732 | cause a syntax error. */ | |
12733 | if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0; | |
12734 | ||
12735 | fntype = TREE_TYPE (decl1); | |
12736 | ||
12737 | restype = TREE_TYPE (fntype); | |
7ddedda4 | 12738 | if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype)) |
8d08fdba | 12739 | { |
8251199e | 12740 | cp_error ("semicolon missing after declaration of `%#T'", restype); |
e66d884e | 12741 | shadow_tag (build_expr_list (NULL_TREE, restype)); |
8d08fdba MS |
12742 | CLASSTYPE_GOT_SEMICOLON (restype) = 1; |
12743 | if (TREE_CODE (fntype) == FUNCTION_TYPE) | |
12744 | fntype = build_function_type (integer_type_node, | |
12745 | TYPE_ARG_TYPES (fntype)); | |
12746 | else | |
12747 | fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)), | |
12748 | integer_type_node, | |
12749 | TYPE_ARG_TYPES (fntype)); | |
12750 | TREE_TYPE (decl1) = fntype; | |
12751 | } | |
12752 | ||
12753 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
12754 | ctype = TYPE_METHOD_BASETYPE (fntype); | |
35680744 | 12755 | else if (DECL_MAIN_P (decl1)) |
8d08fdba MS |
12756 | { |
12757 | /* If this doesn't return integer_type, complain. */ | |
12758 | if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node) | |
12759 | { | |
a28e3c7f | 12760 | if (pedantic || warn_return_type) |
8251199e | 12761 | pedwarn ("return type for `main' changed to `int'"); |
8d08fdba MS |
12762 | TREE_TYPE (decl1) = fntype = default_function_type; |
12763 | } | |
8d08fdba MS |
12764 | } |
12765 | } | |
12766 | ||
12767 | /* Warn if function was previously implicitly declared | |
12768 | (but not if we warned then). */ | |
12769 | if (! warn_implicit | |
12770 | && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE) | |
8251199e | 12771 | cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1))); |
8d08fdba | 12772 | |
f181d4ae MM |
12773 | /* Set up current_class_type, and enter the scope of the class, if |
12774 | appropriate. */ | |
12775 | if (ctype) | |
12776 | push_nested_class (ctype, 1); | |
12777 | else if (DECL_STATIC_FUNCTION_P (decl1)) | |
12778 | push_nested_class (DECL_CONTEXT (decl1), 2); | |
12779 | ||
12780 | /* Now that we have entered the scope of the class, we must restore | |
12781 | the bindings for any template parameters surrounding DECL1, if it | |
12782 | is an inline member template. (Order is important; consider the | |
12783 | case where a template parameter has the same name as a field of | |
12784 | the class.) It is not until after this point that | |
12785 | PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */ | |
a8f73d4b | 12786 | if (flags & SF_INCLASS_INLINE) |
f181d4ae MM |
12787 | maybe_begin_member_template_processing (decl1); |
12788 | ||
9188c363 MM |
12789 | /* Effective C++ rule 15. See also c_expand_return. */ |
12790 | if (warn_ecpp | |
12791 | && DECL_NAME (decl1) == ansi_opname[(int) MODIFY_EXPR] | |
12792 | && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE) | |
12793 | cp_warning ("`operator=' should return a reference to `*this'"); | |
12794 | ||
12795 | /* Make the init_value nonzero so pushdecl knows this is not tentative. | |
12796 | error_mark_node is replaced below (in poplevel) with the BLOCK. */ | |
12797 | DECL_INITIAL (decl1) = error_mark_node; | |
12798 | ||
12799 | #ifdef SET_DEFAULT_DECL_ATTRIBUTES | |
12800 | SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs); | |
12801 | #endif | |
12802 | ||
12803 | /* This function exists in static storage. | |
12804 | (This does not mean `static' in the C sense!) */ | |
12805 | TREE_STATIC (decl1) = 1; | |
12806 | ||
12807 | /* We must call push_template_decl after current_class_type is set | |
12808 | up. (If we are processing inline definitions after exiting a | |
12809 | class scope, current_class_type will be NULL_TREE until set above | |
12810 | by push_nested_class.) */ | |
12811 | if (processing_template_decl) | |
12812 | decl1 = push_template_decl (decl1); | |
12813 | ||
f181d4ae | 12814 | /* We are now in the scope of the function being defined. */ |
8d08fdba | 12815 | current_function_decl = decl1; |
f181d4ae | 12816 | |
5566b478 MS |
12817 | /* Save the parm names or decls from this function's declarator |
12818 | where store_parm_decls will find them. */ | |
12819 | current_function_parms = last_function_parms; | |
12820 | current_function_parm_tags = last_function_parm_tags; | |
8d08fdba | 12821 | |
a8f73d4b MM |
12822 | /* Make sure the parameter and return types are reasonable. When |
12823 | you declare a function, these types can be incomplete, but they | |
12824 | must be complete when you define the function. */ | |
5156628f | 12825 | if (! processing_template_decl) |
a8f73d4b | 12826 | check_function_type (decl1); |
f181d4ae | 12827 | |
a8f73d4b MM |
12828 | /* Build the return declaration for the function. */ |
12829 | restype = TREE_TYPE (fntype); | |
12830 | if (!processing_template_decl) | |
12831 | { | |
12832 | if (!DECL_RESULT (decl1)) | |
5566b478 | 12833 | { |
5566b478 | 12834 | DECL_RESULT (decl1) |
a8f73d4b MM |
12835 | = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype)); |
12836 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype), | |
12837 | DECL_RESULT (decl1)); | |
5566b478 | 12838 | } |
5566b478 | 12839 | } |
a8f73d4b MM |
12840 | else |
12841 | /* Just use `void'. Nobody will ever look at this anyhow. */ | |
12842 | DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node); | |
12843 | ||
12844 | /* Initialize RTL machinery. We cannot do this until | |
12845 | CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this | |
12846 | even when processing a template; this is how we get | |
12847 | CURRENT_FUNCTION set up, and our per-function variables | |
12848 | initialized. */ | |
12849 | bl = current_binding_level; | |
12850 | init_function_start (decl1, input_filename, lineno); | |
12851 | current_binding_level = bl; | |
12852 | expanding_p = (flags & SF_EXPAND) != 0; | |
12853 | ||
12854 | /* Even though we're inside a function body, we still don't want to | |
12855 | call expand_expr to calculate the size of a variable-sized array. | |
12856 | We haven't necessarily assigned RTL to all variables yet, so it's | |
12857 | not safe to try to expand expressions involving them. */ | |
12858 | immediate_size_expand = 0; | |
12859 | get_pending_sizes (); | |
12860 | ||
12861 | /* Let the user know we're compiling this function. */ | |
24bef158 | 12862 | if (processing_template_decl || !building_stmt_tree ()) |
a8f73d4b | 12863 | announce_function (decl1); |
b7484fbe | 12864 | |
878cd289 MS |
12865 | /* Record the decl so that the function name is defined. |
12866 | If we already have a decl for this name, and it is a FUNCTION_DECL, | |
12867 | use the old decl. */ | |
a8f73d4b | 12868 | if (!processing_template_decl && !(flags & SF_PRE_PARSED)) |
878cd289 | 12869 | { |
75650646 | 12870 | /* A specialization is not used to guide overload resolution. */ |
959d8796 JM |
12871 | if ((flag_guiding_decls |
12872 | || !DECL_TEMPLATE_SPECIALIZATION (decl1)) | |
12873 | && ! DECL_FUNCTION_MEMBER_P (decl1)) | |
75650646 | 12874 | decl1 = pushdecl (decl1); |
2c73f9f5 | 12875 | else |
b7698cf0 JM |
12876 | { |
12877 | /* We need to set the DECL_CONTEXT. */ | |
12878 | if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1)) | |
12879 | DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1)); | |
12880 | /* And make sure we have enough default args. */ | |
12881 | check_default_args (decl1); | |
12882 | } | |
878cd289 MS |
12883 | DECL_MAIN_VARIANT (decl1) = decl1; |
12884 | fntype = TREE_TYPE (decl1); | |
12885 | } | |
5566b478 | 12886 | |
a8f73d4b | 12887 | /* Reset these in case the call to pushdecl changed them. */ |
5566b478 | 12888 | current_function_decl = decl1; |
a8f73d4b | 12889 | current_function->decl = decl1; |
878cd289 | 12890 | |
db5ae43f | 12891 | if (DECL_INTERFACE_KNOWN (decl1)) |
faae18ab | 12892 | { |
86052cc3 JM |
12893 | tree ctx = hack_decl_function_context (decl1); |
12894 | ||
faae18ab MS |
12895 | if (DECL_NOT_REALLY_EXTERN (decl1)) |
12896 | DECL_EXTERNAL (decl1) = 0; | |
86052cc3 JM |
12897 | |
12898 | if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx) | |
12899 | && TREE_PUBLIC (ctx)) | |
12900 | /* This is a function in a local class in an extern inline | |
12901 | function. */ | |
12902 | comdat_linkage (decl1); | |
faae18ab | 12903 | } |
8d08fdba MS |
12904 | /* If this function belongs to an interface, it is public. |
12905 | If it belongs to someone else's interface, it is also external. | |
1f901793 | 12906 | This only affects inlines and template instantiations. */ |
5566b478 MS |
12907 | else if (interface_unknown == 0 |
12908 | && (! DECL_TEMPLATE_INSTANTIATION (decl1) | |
d11ad92e | 12909 | || flag_alt_external_templates)) |
8d08fdba | 12910 | { |
5566b478 | 12911 | if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1) |
5156628f | 12912 | || processing_template_decl) |
1f901793 JM |
12913 | { |
12914 | DECL_EXTERNAL (decl1) | |
12915 | = (interface_only | |
9c73ec84 MS |
12916 | || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines |
12917 | && !DECL_VINDEX (decl1))); | |
1f901793 JM |
12918 | |
12919 | /* For WIN32 we also want to put these in linkonce sections. */ | |
12920 | maybe_make_one_only (decl1); | |
12921 | } | |
db5ae43f | 12922 | else |
893de33c | 12923 | DECL_EXTERNAL (decl1) = 0; |
e8abc66f | 12924 | DECL_NOT_REALLY_EXTERN (decl1) = 0; |
db5ae43f | 12925 | DECL_INTERFACE_KNOWN (decl1) = 1; |
8d08fdba | 12926 | } |
c16c47fb JM |
12927 | else if (interface_unknown && interface_only |
12928 | && (! DECL_TEMPLATE_INSTANTIATION (decl1) | |
12929 | || flag_alt_external_templates)) | |
12930 | { | |
12931 | /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma | |
12932 | interface, we will have interface_only set but not | |
12933 | interface_known. In that case, we don't want to use the normal | |
12934 | heuristics because someone will supply a #pragma implementation | |
12935 | elsewhere, and deducing it here would produce a conflict. */ | |
12936 | comdat_linkage (decl1); | |
12937 | DECL_EXTERNAL (decl1) = 0; | |
12938 | DECL_INTERFACE_KNOWN (decl1) = 1; | |
12939 | DECL_DEFER_OUTPUT (decl1) = 1; | |
12940 | } | |
8d08fdba | 12941 | else |
a0a33927 MS |
12942 | { |
12943 | /* This is a definition, not a reference. | |
b7484fbe MS |
12944 | So clear DECL_EXTERNAL. */ |
12945 | DECL_EXTERNAL (decl1) = 0; | |
faae18ab | 12946 | |
5566b478 MS |
12947 | if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)) |
12948 | && ! DECL_INTERFACE_KNOWN (decl1) | |
12949 | /* Don't try to defer nested functions for now. */ | |
e76a2646 | 12950 | && ! hack_decl_function_context (decl1)) |
878cd289 MS |
12951 | DECL_DEFER_OUTPUT (decl1) = 1; |
12952 | else | |
893de33c | 12953 | DECL_INTERFACE_KNOWN (decl1) = 1; |
db5ae43f | 12954 | } |
a9aedbc2 | 12955 | |
8d08fdba MS |
12956 | if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)) |
12957 | { | |
12958 | if (TREE_CODE (fntype) == METHOD_TYPE) | |
12959 | TREE_TYPE (decl1) = fntype | |
12960 | = build_function_type (TREE_TYPE (fntype), | |
12961 | TREE_CHAIN (TYPE_ARG_TYPES (fntype))); | |
5566b478 MS |
12962 | current_function_parms = TREE_CHAIN (current_function_parms); |
12963 | DECL_ARGUMENTS (decl1) = current_function_parms; | |
8d08fdba MS |
12964 | ctype = NULL_TREE; |
12965 | } | |
8d08fdba | 12966 | |
a8f73d4b MM |
12967 | my_friendly_assert (current_class_ptr == NULL_TREE, 19990908); |
12968 | my_friendly_assert (current_class_ref == NULL_TREE, 19990908); | |
8d08fdba MS |
12969 | if (ctype) |
12970 | { | |
8d08fdba | 12971 | /* If we're compiling a friend function, neither of the variables |
4ac14744 | 12972 | current_class_ptr nor current_class_type will have values. */ |
8d08fdba MS |
12973 | if (! doing_friend) |
12974 | { | |
12975 | /* We know that this was set up by `grokclassfn'. | |
12976 | We do not wait until `store_parm_decls', since evil | |
12977 | parse errors may never get us to that point. Here | |
12978 | we keep the consistency between `current_class_type' | |
4ac14744 | 12979 | and `current_class_ptr'. */ |
5566b478 | 12980 | tree t = current_function_parms; |
6eabb241 MM |
12981 | int i; |
12982 | ||
5f34005f RK |
12983 | my_friendly_assert (t != NULL_TREE |
12984 | && TREE_CODE (t) == PARM_DECL, 162); | |
6eabb241 MM |
12985 | my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE, |
12986 | 19990811); | |
12987 | ||
12988 | if (! hack_decl_function_context (decl1)) | |
12989 | temporary_allocation (); | |
12990 | i = suspend_momentary (); | |
12991 | ||
12992 | /* Normally, build_indirect_ref returns current_class_ref | |
12993 | whenever current_class_ptr is dereferenced. This time, | |
12994 | however, we want it to *create* current_class_ref, so we | |
12995 | temporarily clear current_class_ptr to fool it. */ | |
a8f73d4b MM |
12996 | cp_function_chain->x_current_class_ref |
12997 | = build_indirect_ref (t, NULL_PTR); | |
12998 | cp_function_chain->x_current_class_ptr = t; | |
6eabb241 MM |
12999 | |
13000 | resume_momentary (i); | |
13001 | if (! hack_decl_function_context (decl1)) | |
13002 | end_temporary_allocation (); | |
8d08fdba MS |
13003 | } |
13004 | } | |
8d08fdba | 13005 | |
db5ae43f MS |
13006 | pushlevel (0); |
13007 | current_binding_level->parm_flag = 1; | |
13008 | ||
f30432d7 MS |
13009 | if (attrs) |
13010 | cplus_decl_attributes (decl1, NULL_TREE, attrs); | |
3a846e6e | 13011 | |
558475f0 MM |
13012 | if (!building_stmt_tree ()) |
13013 | { | |
13014 | GNU_xref_function (decl1, current_function_parms); | |
13015 | make_function_rtl (decl1); | |
13016 | } | |
db5ae43f | 13017 | |
8d08fdba MS |
13018 | /* Promote the value to int before returning it. */ |
13019 | if (C_PROMOTING_INTEGER_TYPE_P (restype)) | |
5566b478 MS |
13020 | restype = type_promotes_to (restype); |
13021 | ||
13022 | /* If this fcn was already referenced via a block-scope `extern' decl | |
13023 | (or an implicit decl), propagate certain information about the usage. */ | |
13024 | if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1))) | |
13025 | TREE_ADDRESSABLE (decl1) = 1; | |
13026 | ||
8d08fdba | 13027 | if (DECL_RESULT (decl1) == NULL_TREE) |
f30432d7 MS |
13028 | { |
13029 | DECL_RESULT (decl1) | |
13030 | = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype)); | |
91063b51 MM |
13031 | TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype); |
13032 | TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype); | |
f30432d7 | 13033 | } |
8d08fdba | 13034 | |
948edfa7 JW |
13035 | /* Allocate further tree nodes temporarily during compilation |
13036 | of this function only. Tiemann moved up here from bottom of fn. */ | |
13037 | /* If this is a nested function, then we must continue to allocate RTL | |
13038 | on the permanent obstack in case we need to inline it later. */ | |
13039 | if (! hack_decl_function_context (decl1)) | |
5566b478 | 13040 | temporary_allocation (); |
f1dedc31 MM |
13041 | |
13042 | /* Make sure that we always have a momntary obstack while we're in a | |
13043 | function body. */ | |
13044 | push_momentary (); | |
5566b478 | 13045 | |
558475f0 MM |
13046 | if (building_stmt_tree ()) |
13047 | begin_stmt_tree (decl1); | |
5566b478 MS |
13048 | |
13049 | ++function_depth; | |
13050 | ||
f30432d7 MS |
13051 | if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1)) |
13052 | && DECL_LANGUAGE (decl1) == lang_cplusplus) | |
8d08fdba MS |
13053 | { |
13054 | dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
13055 | ctor_label = NULL_TREE; | |
13056 | } | |
13057 | else | |
13058 | { | |
13059 | dtor_label = NULL_TREE; | |
13060 | if (DECL_CONSTRUCTOR_P (decl1)) | |
13061 | ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
13062 | } | |
13063 | ||
8d08fdba MS |
13064 | return 1; |
13065 | } | |
13066 | \f | |
9664b89e JM |
13067 | /* Called after store_parm_decls for a function-try-block. We need to update |
13068 | last_parm_cleanup_insn so that the base initializers for a constructor | |
13069 | are run within this block, not before it. */ | |
6467930b MS |
13070 | |
13071 | void | |
13072 | expand_start_early_try_stmts () | |
13073 | { | |
6467930b | 13074 | expand_start_try_stmts (); |
9664b89e | 13075 | last_parm_cleanup_insn = get_last_insn (); |
f30432d7 MS |
13076 | } |
13077 | ||
8d08fdba MS |
13078 | /* Store the parameter declarations into the current function declaration. |
13079 | This is called after parsing the parameter declarations, before | |
13080 | digesting the body of the function. | |
13081 | ||
13082 | Also install to binding contour return value identifier, if any. */ | |
13083 | ||
13084 | void | |
13085 | store_parm_decls () | |
13086 | { | |
13087 | register tree fndecl = current_function_decl; | |
13088 | register tree parm; | |
13089 | int parms_have_cleanups = 0; | |
eb66be0e | 13090 | tree cleanups = NULL_TREE; |
8d08fdba MS |
13091 | |
13092 | /* This is either a chain of PARM_DECLs (when a prototype is used). */ | |
13093 | tree specparms = current_function_parms; | |
13094 | ||
13095 | /* This is a list of types declared among parms in a prototype. */ | |
13096 | tree parmtags = current_function_parm_tags; | |
13097 | ||
13098 | /* This is a chain of any other decls that came in among the parm | |
13099 | declarations. If a parm is declared with enum {foo, bar} x; | |
13100 | then CONST_DECLs for foo and bar are put here. */ | |
13101 | tree nonparms = NULL_TREE; | |
13102 | ||
a9aedbc2 | 13103 | if (toplevel_bindings_p ()) |
8d08fdba MS |
13104 | fatal ("parse errors have confused me too much"); |
13105 | ||
8d08fdba MS |
13106 | /* Create a binding level for the parms. */ |
13107 | expand_start_bindings (0); | |
13108 | ||
8d08fdba MS |
13109 | if (specparms != NULL_TREE) |
13110 | { | |
13111 | /* This case is when the function was defined with an ANSI prototype. | |
13112 | The parms already have decls, so we need not do anything here | |
13113 | except record them as in effect | |
13114 | and complain if any redundant old-style parm decls were written. */ | |
13115 | ||
13116 | register tree next; | |
13117 | ||
13118 | /* Must clear this because it might contain TYPE_DECLs declared | |
13119 | at class level. */ | |
13120 | storedecls (NULL_TREE); | |
5566b478 | 13121 | |
8d08fdba MS |
13122 | for (parm = nreverse (specparms); parm; parm = next) |
13123 | { | |
13124 | next = TREE_CHAIN (parm); | |
13125 | if (TREE_CODE (parm) == PARM_DECL) | |
13126 | { | |
5566b478 | 13127 | tree cleanup; |
8d08fdba MS |
13128 | if (DECL_NAME (parm) == NULL_TREE) |
13129 | { | |
8d08fdba | 13130 | pushdecl (parm); |
8d08fdba | 13131 | } |
a1774733 | 13132 | else if (TREE_CODE (TREE_TYPE (parm)) == VOID_TYPE) |
8251199e | 13133 | cp_error ("parameter `%D' declared void", parm); |
8d08fdba | 13134 | else |
ed5511d9 | 13135 | pushdecl (parm); |
558475f0 | 13136 | if (! building_stmt_tree () |
5566b478 | 13137 | && (cleanup = maybe_build_cleanup (parm), cleanup)) |
8d08fdba MS |
13138 | { |
13139 | expand_decl (parm); | |
8d08fdba | 13140 | parms_have_cleanups = 1; |
eb66be0e MS |
13141 | |
13142 | /* Keep track of the cleanups. */ | |
13143 | cleanups = tree_cons (parm, cleanup, cleanups); | |
8d08fdba MS |
13144 | } |
13145 | } | |
13146 | else | |
13147 | { | |
13148 | /* If we find an enum constant or a type tag, | |
13149 | put it aside for the moment. */ | |
13150 | TREE_CHAIN (parm) = NULL_TREE; | |
13151 | nonparms = chainon (nonparms, parm); | |
13152 | } | |
13153 | } | |
13154 | ||
13155 | /* Get the decls in their original chain order | |
13156 | and record in the function. This is all and only the | |
13157 | PARM_DECLs that were pushed into scope by the loop above. */ | |
13158 | DECL_ARGUMENTS (fndecl) = getdecls (); | |
13159 | ||
13160 | storetags (chainon (parmtags, gettags ())); | |
13161 | } | |
13162 | else | |
13163 | DECL_ARGUMENTS (fndecl) = NULL_TREE; | |
13164 | ||
13165 | /* Now store the final chain of decls for the arguments | |
13166 | as the decl-chain of the current lexical scope. | |
13167 | Put the enumerators in as well, at the front so that | |
13168 | DECL_ARGUMENTS is not modified. */ | |
13169 | ||
13170 | storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl))); | |
13171 | ||
13172 | /* Initialize the RTL code for the function. */ | |
49ad7cfa | 13173 | DECL_SAVED_INSNS (fndecl) = 0; |
558475f0 | 13174 | if (! building_stmt_tree ()) |
5566b478 | 13175 | expand_function_start (fndecl, parms_have_cleanups); |
8d08fdba | 13176 | |
eb448459 MS |
13177 | current_function_parms_stored = 1; |
13178 | ||
13179 | /* If this function is `main', emit a call to `__main' | |
13180 | to run global initializers, etc. */ | |
558475f0 | 13181 | if (DECL_MAIN_P (fndecl) && !building_stmt_tree ()) |
35680744 | 13182 | expand_main_function (); |
eb448459 | 13183 | |
eb66be0e MS |
13184 | /* Now that we have initialized the parms, we can start their |
13185 | cleanups. We cannot do this before, since expand_decl_cleanup | |
13186 | should not be called before the parm can be used. */ | |
558475f0 | 13187 | if (cleanups && !building_stmt_tree ()) |
eb66be0e | 13188 | { |
ed5511d9 MM |
13189 | for (cleanups = nreverse (cleanups); |
13190 | cleanups; | |
13191 | cleanups = TREE_CHAIN (cleanups)) | |
eb66be0e | 13192 | { |
ed5511d9 MM |
13193 | if (! expand_decl_cleanup (TREE_PURPOSE (cleanups), |
13194 | TREE_VALUE (cleanups))) | |
8251199e | 13195 | cp_error ("parser lost in parsing declaration of `%D'", |
eb66be0e MS |
13196 | TREE_PURPOSE (cleanups)); |
13197 | } | |
13198 | } | |
13199 | ||
8d08fdba MS |
13200 | /* Create a binding contour which can be used to catch |
13201 | cleanup-generated temporaries. Also, if the return value needs or | |
13202 | has initialization, deal with that now. */ | |
13203 | if (parms_have_cleanups) | |
13204 | { | |
13205 | pushlevel (0); | |
558475f0 MM |
13206 | if (!building_stmt_tree ()) |
13207 | expand_start_bindings (0); | |
8d08fdba MS |
13208 | } |
13209 | ||
558475f0 | 13210 | if (! building_stmt_tree () && flag_exceptions) |
f30432d7 | 13211 | { |
f30432d7 MS |
13212 | /* Do the starting of the exception specifications, if we have any. */ |
13213 | if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl))) | |
13214 | expand_start_eh_spec (); | |
f30432d7 | 13215 | } |
eb448459 | 13216 | |
5c825fc2 | 13217 | last_parm_cleanup_insn = get_last_insn (); |
72b7eeff | 13218 | last_dtor_insn = get_last_insn (); |
8d08fdba MS |
13219 | } |
13220 | ||
13221 | /* Bind a name and initialization to the return value of | |
13222 | the current function. */ | |
e92cc029 | 13223 | |
8d08fdba | 13224 | void |
558475f0 MM |
13225 | store_return_init (decl) |
13226 | tree decl; | |
8d08fdba | 13227 | { |
558475f0 MM |
13228 | /* If this named return value comes in a register, put it in a |
13229 | pseudo-register. */ | |
13230 | if (DECL_REGISTER (decl)) | |
8d08fdba | 13231 | { |
558475f0 MM |
13232 | original_result_rtx = DECL_RTL (decl); |
13233 | DECL_RTL (decl) = gen_reg_rtx (DECL_MODE (decl)); | |
8d08fdba MS |
13234 | } |
13235 | } | |
13236 | ||
8d08fdba MS |
13237 | \f |
13238 | /* Finish up a function declaration and compile that function | |
13239 | all the way to assembler language output. The free the storage | |
13240 | for the function definition. | |
13241 | ||
13242 | This is called after parsing the body of the function definition. | |
13243 | LINENO is the current line number. | |
13244 | ||
f181d4ae MM |
13245 | FLAGS is a bitwise or of the following values: |
13246 | 1 - CALL_POPLEVEL | |
13247 | An extra call to poplevel (and expand_end_bindings) must be | |
13248 | made to take care of the binding contour for the base | |
13249 | initializers. This is only relevant for constructors. | |
13250 | 2 - INCLASS_INLINE | |
13251 | We just finished processing the body of an in-class inline | |
13252 | function definition. (This processing will have taken place | |
87e3dbc9 | 13253 | after the class definition is complete.) */ |
8d08fdba | 13254 | |
4d6abc1c | 13255 | tree |
87e3dbc9 | 13256 | finish_function (lineno, flags) |
8d08fdba | 13257 | int lineno; |
f181d4ae | 13258 | int flags; |
8d08fdba MS |
13259 | { |
13260 | register tree fndecl = current_function_decl; | |
13261 | tree fntype, ctype = NULL_TREE; | |
49ad7cfa | 13262 | rtx fn_last_parm_insn, insns; |
8d08fdba MS |
13263 | /* Label to use if this function is supposed to return a value. */ |
13264 | tree no_return_label = NULL_TREE; | |
13265 | tree decls = NULL_TREE; | |
f181d4ae MM |
13266 | int call_poplevel = (flags & 1) != 0; |
13267 | int inclass_inline = (flags & 2) != 0; | |
558475f0 | 13268 | int expand_p; |
87e3dbc9 | 13269 | int nested; |
8d08fdba MS |
13270 | |
13271 | /* When we get some parse errors, we can end up without a | |
13272 | current_function_decl, so cope. */ | |
13273 | if (fndecl == NULL_TREE) | |
4d6abc1c | 13274 | return error_mark_node; |
8d08fdba | 13275 | |
87e3dbc9 | 13276 | nested = function_depth > 1; |
8d08fdba MS |
13277 | fntype = TREE_TYPE (fndecl); |
13278 | ||
13279 | /* TREE_READONLY (fndecl) = 1; | |
13280 | This caused &foo to be of type ptr-to-const-function | |
13281 | which then got a warning when stored in a ptr-to-function variable. */ | |
13282 | ||
13283 | /* This happens on strange parse errors. */ | |
13284 | if (! current_function_parms_stored) | |
13285 | { | |
13286 | call_poplevel = 0; | |
13287 | store_parm_decls (); | |
13288 | } | |
13289 | ||
558475f0 | 13290 | if (building_stmt_tree ()) |
8d08fdba | 13291 | { |
5566b478 MS |
13292 | if (DECL_CONSTRUCTOR_P (fndecl) && call_poplevel) |
13293 | { | |
13294 | decls = getdecls (); | |
13295 | expand_end_bindings (decls, decls != NULL_TREE, 0); | |
13296 | poplevel (decls != NULL_TREE, 0, 0); | |
13297 | } | |
87e3dbc9 MM |
13298 | |
13299 | /* Because we do not call expand_function_end, we won't call | |
13300 | expand_end_bindings to match the call to | |
13301 | expand_start_bindings we did in store_parm_decls. Therefore, | |
13302 | we explicitly call expand_end_bindings here. However, we | |
13303 | really shouldn't be calling expand_start_bindings at all when | |
13304 | building_stmt_tree; it's conceptually an RTL-generation | |
13305 | function, rather than a front-end function. */ | |
13306 | expand_end_bindings (0, 0, 0); | |
5566b478 MS |
13307 | } |
13308 | else | |
13309 | { | |
13310 | if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/) | |
8d08fdba | 13311 | { |
5566b478 MS |
13312 | tree ttype = target_type (fntype); |
13313 | tree parmdecl; | |
13314 | ||
8d08fdba MS |
13315 | if (IS_AGGR_TYPE (ttype)) |
13316 | /* Let debugger know it should output info for this type. */ | |
13317 | note_debug_info_needed (ttype); | |
5566b478 MS |
13318 | |
13319 | for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl)) | |
13320 | { | |
13321 | ttype = target_type (TREE_TYPE (parmdecl)); | |
13322 | if (IS_AGGR_TYPE (ttype)) | |
13323 | /* Let debugger know it should output info for this type. */ | |
13324 | note_debug_info_needed (ttype); | |
13325 | } | |
8d08fdba | 13326 | } |
8d08fdba | 13327 | |
5566b478 MS |
13328 | /* Clean house because we will need to reorder insns here. */ |
13329 | do_pending_stack_adjust (); | |
8d08fdba | 13330 | |
5566b478 | 13331 | if (dtor_label) |
8d08fdba | 13332 | { |
5566b478 MS |
13333 | tree binfo = TYPE_BINFO (current_class_type); |
13334 | tree cond = integer_one_node; | |
13335 | tree exprstmt; | |
13336 | tree in_charge_node = lookup_name (in_charge_identifier, 0); | |
13337 | tree virtual_size; | |
13338 | int ok_to_optimize_dtor = 0; | |
13339 | int empty_dtor = get_last_insn () == last_dtor_insn; | |
8d08fdba | 13340 | |
5566b478 MS |
13341 | if (current_function_assigns_this) |
13342 | cond = build (NE_EXPR, boolean_type_node, | |
4ac14744 | 13343 | current_class_ptr, integer_zero_node); |
5566b478 MS |
13344 | else |
13345 | { | |
13346 | int n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type); | |
13347 | ||
13348 | /* If this destructor is empty, then we don't need to check | |
13349 | whether `this' is NULL in some cases. */ | |
13350 | if ((flag_this_is_variable & 1) == 0) | |
13351 | ok_to_optimize_dtor = 1; | |
13352 | else if (empty_dtor) | |
13353 | ok_to_optimize_dtor | |
13354 | = (n_baseclasses == 0 | |
13355 | || (n_baseclasses == 1 | |
13356 | && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type, 0)))); | |
13357 | } | |
8d08fdba | 13358 | |
5566b478 MS |
13359 | /* These initializations might go inline. Protect |
13360 | the binding level of the parms. */ | |
13361 | pushlevel (0); | |
13362 | expand_start_bindings (0); | |
8d08fdba | 13363 | |
5566b478 MS |
13364 | if (current_function_assigns_this) |
13365 | { | |
13366 | current_function_assigns_this = 0; | |
13367 | current_function_just_assigned_this = 0; | |
13368 | } | |
8d08fdba | 13369 | |
5566b478 MS |
13370 | /* Generate the code to call destructor on base class. |
13371 | If this destructor belongs to a class with virtual | |
13372 | functions, then set the virtual function table | |
13373 | pointer to represent the type of our base class. */ | |
8d08fdba | 13374 | |
5566b478 | 13375 | /* This side-effect makes call to `build_delete' generate the |
2a2480e1 JM |
13376 | code we have to have at the end of this destructor. |
13377 | `build_delete' will set the flag again. */ | |
5566b478 | 13378 | TYPE_HAS_DESTRUCTOR (current_class_type) = 0; |
8d08fdba | 13379 | |
5566b478 MS |
13380 | /* These are two cases where we cannot delegate deletion. */ |
13381 | if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type) | |
13382 | || TYPE_GETS_REG_DELETE (current_class_type)) | |
4ac14744 | 13383 | exprstmt = build_delete (current_class_type, current_class_ref, integer_zero_node, |
e92cc029 | 13384 | LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0); |
5566b478 | 13385 | else |
4ac14744 | 13386 | exprstmt = build_delete (current_class_type, current_class_ref, in_charge_node, |
e92cc029 | 13387 | LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 0); |
5566b478 MS |
13388 | |
13389 | /* If we did not assign to this, then `this' is non-zero at | |
13390 | the end of a destructor. As a special optimization, don't | |
13391 | emit test if this is an empty destructor. If it does nothing, | |
13392 | it does nothing. If it calls a base destructor, the base | |
13393 | destructor will perform the test. */ | |
13394 | ||
13395 | if (exprstmt != error_mark_node | |
13396 | && (TREE_CODE (exprstmt) != NOP_EXPR | |
13397 | || TREE_OPERAND (exprstmt, 0) != integer_zero_node | |
13398 | || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))) | |
8d08fdba | 13399 | { |
5566b478 MS |
13400 | expand_label (dtor_label); |
13401 | if (cond != integer_one_node) | |
13402 | expand_start_cond (cond, 0); | |
13403 | if (exprstmt != void_zero_node) | |
13404 | /* Don't call `expand_expr_stmt' if we're not going to do | |
13405 | anything, since -Wall will give a diagnostic. */ | |
13406 | expand_expr_stmt (exprstmt); | |
13407 | ||
13408 | /* Run destructor on all virtual baseclasses. */ | |
13409 | if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)) | |
8d08fdba | 13410 | { |
5566b478 MS |
13411 | tree vbases = nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type))); |
13412 | expand_start_cond (build (BIT_AND_EXPR, integer_type_node, | |
13413 | in_charge_node, integer_two_node), 0); | |
13414 | while (vbases) | |
8d08fdba | 13415 | { |
5566b478 MS |
13416 | if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases))) |
13417 | { | |
bd6dd845 MS |
13418 | tree vb = get_vbase |
13419 | (BINFO_TYPE (vbases), | |
8ea2460f | 13420 | TYPE_BINFO (current_class_type)); |
e92cc029 | 13421 | expand_expr_stmt |
bd6dd845 MS |
13422 | (build_scoped_method_call |
13423 | (current_class_ref, vb, dtor_identifier, | |
e66d884e | 13424 | build_expr_list (NULL_TREE, integer_zero_node))); |
5566b478 MS |
13425 | } |
13426 | vbases = TREE_CHAIN (vbases); | |
8d08fdba | 13427 | } |
5566b478 | 13428 | expand_end_cond (); |
8d08fdba | 13429 | } |
5566b478 MS |
13430 | |
13431 | do_pending_stack_adjust (); | |
13432 | if (cond != integer_one_node) | |
13433 | expand_end_cond (); | |
8d08fdba MS |
13434 | } |
13435 | ||
5566b478 MS |
13436 | virtual_size = c_sizeof (current_class_type); |
13437 | ||
13438 | /* At the end, call delete if that's what's requested. */ | |
519ebd1e JM |
13439 | |
13440 | /* FDIS sez: At the point of definition of a virtual destructor | |
13441 | (including an implicit definition), non-placement operator | |
13442 | delete shall be looked up in the scope of the destructor's | |
13443 | class and if found shall be accessible and unambiguous. | |
13444 | ||
13445 | This is somewhat unclear, but I take it to mean that if the | |
13446 | class only defines placement deletes we don't do anything here. | |
13447 | So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain | |
13448 | for us if they ever try to delete one of these. */ | |
13449 | ||
13450 | if (TYPE_GETS_REG_DELETE (current_class_type) | |
13451 | || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)) | |
13452 | exprstmt = build_op_delete_call | |
13453 | (DELETE_EXPR, current_class_ptr, virtual_size, | |
13454 | LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE); | |
5566b478 MS |
13455 | else |
13456 | exprstmt = NULL_TREE; | |
8d08fdba | 13457 | |
5566b478 MS |
13458 | if (exprstmt) |
13459 | { | |
13460 | cond = build (BIT_AND_EXPR, integer_type_node, | |
13461 | in_charge_node, integer_one_node); | |
13462 | expand_start_cond (cond, 0); | |
13463 | expand_expr_stmt (exprstmt); | |
13464 | expand_end_cond (); | |
13465 | } | |
8d08fdba | 13466 | |
5566b478 | 13467 | /* End of destructor. */ |
fc378698 | 13468 | expand_end_bindings (NULL_TREE, getdecls () != NULL_TREE, 0); |
536333d4 | 13469 | poplevel (getdecls () != NULL_TREE, 0, 0); |
5566b478 MS |
13470 | |
13471 | /* Back to the top of destructor. */ | |
956d6950 | 13472 | /* Don't execute destructor code if `this' is NULL. */ |
5566b478 MS |
13473 | |
13474 | start_sequence (); | |
13475 | ||
13476 | /* If the dtor is empty, and we know there is not possible way we | |
13477 | could use any vtable entries, before they are possibly set by | |
13478 | a base class dtor, we don't have to setup the vtables, as we | |
13479 | know that any base class dtoring will set up any vtables it | |
13480 | needs. We avoid MI, because one base class dtor can do a | |
13481 | virtual dispatch to an overridden function that would need to | |
13482 | have a non-related vtable set up, we cannot avoid setting up | |
13483 | vtables in that case. We could change this to see if there is | |
13484 | just one vtable. */ | |
13485 | if (! empty_dtor || TYPE_USES_COMPLEX_INHERITANCE (current_class_type)) | |
13486 | { | |
13487 | /* Make all virtual function table pointers in non-virtual base | |
13488 | classes point to CURRENT_CLASS_TYPE's virtual function | |
13489 | tables. */ | |
4ac14744 | 13490 | expand_direct_vtbls_init (binfo, binfo, 1, 0, current_class_ptr); |
8d08fdba | 13491 | |
5566b478 | 13492 | if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)) |
4ac14744 | 13493 | expand_indirect_vtbls_init (binfo, current_class_ref, current_class_ptr); |
5566b478 MS |
13494 | } |
13495 | ||
13496 | if (! ok_to_optimize_dtor) | |
13497 | { | |
13498 | cond = build_binary_op (NE_EXPR, | |
337c90cc | 13499 | current_class_ptr, integer_zero_node); |
5566b478 MS |
13500 | expand_start_cond (cond, 0); |
13501 | } | |
8d08fdba | 13502 | |
5566b478 MS |
13503 | insns = get_insns (); |
13504 | end_sequence (); | |
f30432d7 | 13505 | |
49ad7cfa BS |
13506 | fn_last_parm_insn = get_first_nonparm_insn (); |
13507 | if (fn_last_parm_insn == NULL_RTX) | |
13508 | fn_last_parm_insn = get_last_insn (); | |
5566b478 | 13509 | else |
49ad7cfa | 13510 | fn_last_parm_insn = previous_insn (fn_last_parm_insn); |
8d08fdba | 13511 | |
49ad7cfa | 13512 | emit_insns_after (insns, fn_last_parm_insn); |
72b7eeff | 13513 | |
5566b478 MS |
13514 | if (! ok_to_optimize_dtor) |
13515 | expand_end_cond (); | |
72b7eeff | 13516 | } |
5566b478 | 13517 | else if (current_function_assigns_this) |
8d08fdba | 13518 | { |
5566b478 MS |
13519 | /* Does not need to call emit_base_init, because |
13520 | that is done (if needed) just after assignment to this | |
13521 | is seen. */ | |
13522 | ||
13523 | if (DECL_CONSTRUCTOR_P (current_function_decl)) | |
13524 | { | |
13525 | end_protect_partials (); | |
13526 | expand_label (ctor_label); | |
13527 | ctor_label = NULL_TREE; | |
13528 | ||
13529 | if (call_poplevel) | |
13530 | { | |
13531 | decls = getdecls (); | |
13532 | expand_end_bindings (decls, decls != NULL_TREE, 0); | |
13533 | poplevel (decls != NULL_TREE, 0, 0); | |
13534 | } | |
1c2c08a5 JM |
13535 | /* c_expand_return knows to return 'this' from a constructor. */ |
13536 | c_expand_return (NULL_TREE); | |
5566b478 | 13537 | } |
a1774733 | 13538 | else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl))) != VOID_TYPE |
5566b478 MS |
13539 | && return_label != NULL_RTX) |
13540 | no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
13541 | ||
13542 | current_function_assigns_this = 0; | |
13543 | current_function_just_assigned_this = 0; | |
13544 | base_init_expr = NULL_TREE; | |
8d08fdba | 13545 | } |
5566b478 MS |
13546 | else if (DECL_CONSTRUCTOR_P (fndecl)) |
13547 | { | |
a703fb38 | 13548 | tree cond = NULL_TREE, thenclause = NULL_TREE; |
5566b478 MS |
13549 | /* Allow constructor for a type to get a new instance of the object |
13550 | using `build_new'. */ | |
13551 | tree abstract_virtuals = CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type); | |
13552 | CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = NULL_TREE; | |
f30432d7 | 13553 | |
5566b478 MS |
13554 | if (flag_this_is_variable > 0) |
13555 | { | |
13556 | cond = build_binary_op (EQ_EXPR, | |
337c90cc | 13557 | current_class_ptr, integer_zero_node); |
4ac14744 | 13558 | thenclause = build_modify_expr (current_class_ptr, NOP_EXPR, |
5566b478 MS |
13559 | build_new (NULL_TREE, current_class_type, void_type_node, 0)); |
13560 | } | |
f30432d7 | 13561 | |
5566b478 | 13562 | CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type) = abstract_virtuals; |
f30432d7 | 13563 | |
5566b478 MS |
13564 | start_sequence (); |
13565 | ||
13566 | if (flag_this_is_variable > 0) | |
13567 | { | |
13568 | expand_start_cond (cond, 0); | |
13569 | expand_expr_stmt (thenclause); | |
13570 | expand_end_cond (); | |
13571 | } | |
13572 | ||
13573 | /* Emit insns from `emit_base_init' which sets up virtual | |
13574 | function table pointer(s). */ | |
13575 | if (base_init_expr) | |
13576 | { | |
13577 | expand_expr_stmt (base_init_expr); | |
13578 | base_init_expr = NULL_TREE; | |
13579 | } | |
13580 | ||
13581 | insns = get_insns (); | |
13582 | end_sequence (); | |
13583 | ||
b87692e5 | 13584 | /* This is where the body of the constructor begins. */ |
5566b478 | 13585 | |
b87692e5 | 13586 | emit_insns_after (insns, last_parm_cleanup_insn); |
8d08fdba | 13587 | |
b7484fbe | 13588 | end_protect_partials (); |
5566b478 MS |
13589 | |
13590 | /* This is where the body of the constructor ends. */ | |
8d08fdba MS |
13591 | expand_label (ctor_label); |
13592 | ctor_label = NULL_TREE; | |
13593 | ||
13594 | if (call_poplevel) | |
13595 | { | |
13596 | decls = getdecls (); | |
8d08fdba | 13597 | expand_end_bindings (decls, decls != NULL_TREE, 0); |
5566b478 | 13598 | poplevel (decls != NULL_TREE, 1, 0); |
8d08fdba | 13599 | } |
8d08fdba | 13600 | |
1c2c08a5 JM |
13601 | /* c_expand_return knows to return 'this' from a constructor. */ |
13602 | c_expand_return (NULL_TREE); | |
8d08fdba | 13603 | |
5566b478 MS |
13604 | current_function_assigns_this = 0; |
13605 | current_function_just_assigned_this = 0; | |
13606 | } | |
35680744 | 13607 | else if (DECL_MAIN_P (fndecl)) |
8d08fdba | 13608 | { |
5566b478 MS |
13609 | /* Make it so that `main' always returns 0 by default. */ |
13610 | #ifdef VMS | |
13611 | c_expand_return (integer_one_node); | |
13612 | #else | |
13613 | c_expand_return (integer_zero_node); | |
13614 | #endif | |
8d08fdba | 13615 | } |
5566b478 MS |
13616 | else if (return_label != NULL_RTX |
13617 | && current_function_return_value == NULL_TREE | |
13618 | && ! DECL_NAME (DECL_RESULT (current_function_decl))) | |
13619 | no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
8d08fdba | 13620 | |
eb448459 MS |
13621 | if (flag_exceptions) |
13622 | expand_exception_blocks (); | |
13623 | ||
5566b478 MS |
13624 | /* If this function is supposed to return a value, ensure that |
13625 | we do not fall into the cleanups by mistake. The end of our | |
13626 | function will look like this: | |
13627 | ||
13628 | user code (may have return stmt somewhere) | |
13629 | goto no_return_label | |
13630 | cleanup_label: | |
13631 | cleanups | |
13632 | goto return_label | |
13633 | no_return_label: | |
13634 | NOTE_INSN_FUNCTION_END | |
13635 | return_label: | |
13636 | things for return | |
13637 | ||
13638 | If the user omits a return stmt in the USER CODE section, we | |
13639 | will have a control path which reaches NOTE_INSN_FUNCTION_END. | |
13640 | Otherwise, we won't. */ | |
13641 | if (no_return_label) | |
8d08fdba | 13642 | { |
5566b478 MS |
13643 | DECL_CONTEXT (no_return_label) = fndecl; |
13644 | DECL_INITIAL (no_return_label) = error_mark_node; | |
13645 | DECL_SOURCE_FILE (no_return_label) = input_filename; | |
13646 | DECL_SOURCE_LINE (no_return_label) = lineno; | |
13647 | expand_goto (no_return_label); | |
8d08fdba MS |
13648 | } |
13649 | ||
5566b478 | 13650 | if (cleanup_label) |
a9aedbc2 | 13651 | { |
2c73f9f5 | 13652 | /* Remove the binding contour which is used |
5566b478 MS |
13653 | to catch cleanup-generated temporaries. */ |
13654 | expand_end_bindings (0, 0, 0); | |
13655 | poplevel (0, 0, 0); | |
8d08fdba | 13656 | |
eb448459 MS |
13657 | /* Emit label at beginning of cleanup code for parameters. */ |
13658 | emit_label (cleanup_label); | |
13659 | } | |
b7484fbe | 13660 | |
a8f73d4b MM |
13661 | /* Get return value into register if that's where it's supposed |
13662 | to be. */ | |
5566b478 MS |
13663 | if (original_result_rtx) |
13664 | fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx); | |
8d08fdba | 13665 | |
5566b478 MS |
13666 | /* Finish building code that will trigger warnings if users forget |
13667 | to make their functions return values. */ | |
13668 | if (no_return_label || cleanup_label) | |
13669 | emit_jump (return_label); | |
13670 | if (no_return_label) | |
8d08fdba | 13671 | { |
5566b478 MS |
13672 | /* We don't need to call `expand_*_return' here because we |
13673 | don't need any cleanups here--this path of code is only | |
13674 | for error checking purposes. */ | |
13675 | expand_label (no_return_label); | |
8d08fdba MS |
13676 | } |
13677 | ||
078a76c8 MM |
13678 | /* We hard-wired immediate_size_expand to zero in |
13679 | start_function. Expand_function_end will decrement this | |
13680 | variable. So, we set the variable to one here, so that after | |
13681 | the decrement it will remain zero. */ | |
4ca7ba86 | 13682 | immediate_size_expand = 1; |
078a76c8 | 13683 | |
5566b478 MS |
13684 | /* Generate rtl for function exit. */ |
13685 | expand_function_end (input_filename, lineno, 1); | |
8d08fdba | 13686 | } |
558475f0 MM |
13687 | |
13688 | /* We have to save this value here in case | |
13689 | maybe_end_member_template_processing decides to pop all the | |
13690 | template parameters. */ | |
13691 | expand_p = !building_stmt_tree (); | |
f181d4ae | 13692 | |
558475f0 MM |
13693 | /* If we're saving up tree structure, tie off the function now. */ |
13694 | if (!expand_p) | |
13695 | finish_stmt_tree (fndecl); | |
8d2733ca | 13696 | |
8d08fdba MS |
13697 | /* This must come after expand_function_end because cleanups might |
13698 | have declarations (from inline functions) that need to go into | |
13699 | this function's blocks. */ | |
13700 | if (current_binding_level->parm_flag != 1) | |
13701 | my_friendly_abort (122); | |
13702 | poplevel (1, 0, 1); | |
13703 | ||
a8f73d4b | 13704 | /* Remember that we were in class scope. */ |
db5ae43f | 13705 | if (current_class_name) |
a8f73d4b | 13706 | ctype = current_class_type; |
db5ae43f | 13707 | |
1caa11d3 MM |
13708 | /* Must mark the RESULT_DECL as being in this function. */ |
13709 | DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl; | |
13710 | ||
13711 | /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point | |
13712 | to the FUNCTION_DECL node itself. */ | |
13713 | BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; | |
13714 | ||
f1dedc31 MM |
13715 | /* Undo the call to push_momentary in start_function. */ |
13716 | pop_momentary (); | |
13717 | ||
558475f0 | 13718 | if (expand_p) |
5566b478 | 13719 | { |
a8f73d4b MM |
13720 | int returns_null; |
13721 | int returns_value; | |
75650646 MM |
13722 | int saved_flag_keep_inline_functions = |
13723 | flag_keep_inline_functions; | |
13724 | ||
5566b478 MS |
13725 | /* So we can tell if jump_optimize sets it to 1. */ |
13726 | can_reach_end = 0; | |
8d08fdba | 13727 | |
75650646 | 13728 | if (DECL_CONTEXT (fndecl) != NULL_TREE |
e1467ff2 | 13729 | && hack_decl_function_context (fndecl)) |
75650646 MM |
13730 | /* Trick rest_of_compilation into not deferring output of this |
13731 | function, even if it is inline, since the rtl_obstack for | |
13732 | this function is the function_obstack of the enclosing | |
13733 | function and will be deallocated when the enclosing | |
13734 | function is gone. See save_tree_status. */ | |
13735 | flag_keep_inline_functions = 1; | |
13736 | ||
a8f73d4b MM |
13737 | /* Before we call rest_of_compilation (which will pop the |
13738 | CURRENT_FUNCTION), we must save these values. */ | |
13739 | returns_null = current_function_returns_null; | |
13740 | returns_value = current_function_returns_value; | |
13741 | ||
87e3dbc9 MM |
13742 | /* If this is a nested function (like a template instantiation |
13743 | that we're compiling in the midst of compiling something | |
13744 | else), push a new GC context. That will keep local variables | |
13745 | on the stack from being collected while we're doing the | |
13746 | compilation of this function. */ | |
13747 | if (function_depth > 1) | |
13748 | ggc_push_context (); | |
13749 | ||
6633d636 MS |
13750 | /* Run the optimizers and output the assembler code for this |
13751 | function. */ | |
6633d636 MS |
13752 | if (DECL_ARTIFICIAL (fndecl)) |
13753 | { | |
13754 | /* Do we really *want* to inline this synthesized method? */ | |
13755 | ||
13756 | int save_fif = flag_inline_functions; | |
13757 | flag_inline_functions = 1; | |
13758 | ||
13759 | /* Turn off DECL_INLINE for the moment so function_cannot_inline_p | |
13760 | will check our size. */ | |
13761 | DECL_INLINE (fndecl) = 0; | |
13762 | ||
13763 | rest_of_compilation (fndecl); | |
13764 | flag_inline_functions = save_fif; | |
13765 | } | |
13766 | else | |
13767 | rest_of_compilation (fndecl); | |
8d08fdba | 13768 | |
87e3dbc9 MM |
13769 | /* Undo the call to ggc_push_context above. */ |
13770 | if (function_depth > 1) | |
13771 | ggc_pop_context (); | |
13772 | ||
75650646 MM |
13773 | flag_keep_inline_functions = saved_flag_keep_inline_functions; |
13774 | ||
5566b478 MS |
13775 | if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl)) |
13776 | { | |
13777 | /* Set DECL_EXTERNAL so that assemble_external will be called as | |
13778 | necessary. We'll clear it again in finish_file. */ | |
13779 | if (! DECL_EXTERNAL (fndecl)) | |
13780 | DECL_NOT_REALLY_EXTERN (fndecl) = 1; | |
13781 | DECL_EXTERNAL (fndecl) = 1; | |
13782 | mark_inline_for_output (fndecl); | |
13783 | } | |
8926095f | 13784 | |
d2e5ee5c MS |
13785 | if (ctype && TREE_ASM_WRITTEN (fndecl)) |
13786 | note_debug_info_needed (ctype); | |
13787 | ||
a8f73d4b | 13788 | returns_null |= can_reach_end; |
8d08fdba | 13789 | |
5566b478 MS |
13790 | /* Since we don't normally go through c_expand_return for constructors, |
13791 | this normally gets the wrong value. | |
13792 | Also, named return values have their return codes emitted after | |
13793 | NOTE_INSN_FUNCTION_END, confusing jump.c. */ | |
13794 | if (DECL_CONSTRUCTOR_P (fndecl) | |
13795 | || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE) | |
a8f73d4b | 13796 | returns_null = 0; |
8d08fdba | 13797 | |
a8f73d4b | 13798 | if (TREE_THIS_VOLATILE (fndecl) && returns_null) |
8251199e | 13799 | cp_warning ("`noreturn' function `%D' does return", fndecl); |
5566b478 | 13800 | else if ((warn_return_type || pedantic) |
a8f73d4b | 13801 | && returns_null |
a1774733 | 13802 | && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE) |
5566b478 MS |
13803 | { |
13804 | /* If this function returns non-void and control can drop through, | |
13805 | complain. */ | |
8251199e | 13806 | cp_warning ("control reaches end of non-void function `%D'", fndecl); |
5566b478 MS |
13807 | } |
13808 | /* With just -W, complain only if function returns both with | |
13809 | and without a value. */ | |
a8f73d4b | 13810 | else if (extra_warnings && returns_value && returns_null) |
8251199e | 13811 | warning ("this function may return with or without a value"); |
8d08fdba | 13812 | } |
a8f73d4b MM |
13813 | else |
13814 | { | |
13815 | /* Since we never call rest_of_compilation, we never clear | |
13816 | CURRENT_FUNCTION. Do so explicitly. */ | |
13817 | free_after_compilation (current_function); | |
13818 | current_function = NULL; | |
13819 | } | |
13820 | ||
13821 | /* If this is a in-class inline definition, we may have to pop the | |
13822 | bindings for the template parameters that we added in | |
13823 | maybe_begin_member_template_processing when start_function was | |
13824 | called. */ | |
13825 | if (inclass_inline) | |
13826 | maybe_end_member_template_processing (); | |
13827 | ||
13828 | /* Leave the scope of the class. */ | |
13829 | if (ctype) | |
13830 | pop_nested_class (); | |
5566b478 MS |
13831 | |
13832 | --function_depth; | |
8d08fdba MS |
13833 | |
13834 | /* Free all the tree nodes making up this function. */ | |
13835 | /* Switch back to allocating nodes permanently | |
13836 | until we start another function. */ | |
db5ae43f MS |
13837 | if (! nested) |
13838 | permanent_allocation (1); | |
8d08fdba | 13839 | |
49ad7cfa | 13840 | if (DECL_SAVED_INSNS (fndecl) == 0) |
8d08fdba | 13841 | { |
d2e5ee5c MS |
13842 | tree t; |
13843 | ||
8d08fdba MS |
13844 | /* Stop pointing to the local nodes about to be freed. */ |
13845 | /* But DECL_INITIAL must remain nonzero so we know this | |
13846 | was an actual function definition. */ | |
13847 | DECL_INITIAL (fndecl) = error_mark_node; | |
d2e5ee5c | 13848 | for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t)) |
de22184b | 13849 | DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX; |
8d08fdba MS |
13850 | } |
13851 | ||
e1cd6e56 | 13852 | if (DECL_STATIC_CONSTRUCTOR (fndecl)) |
e1b3e07d | 13853 | static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors); |
e1cd6e56 | 13854 | if (DECL_STATIC_DESTRUCTOR (fndecl)) |
e1b3e07d | 13855 | static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors); |
e1cd6e56 | 13856 | |
4d6abc1c | 13857 | /* Clean up. */ |
28cbf42c MS |
13858 | if (! nested) |
13859 | { | |
13860 | /* Let the error reporting routines know that we're outside a | |
13861 | function. For a nested function, this value is used in | |
13862 | pop_cp_function_context and then reset via pop_function_context. */ | |
13863 | current_function_decl = NULL_TREE; | |
13864 | } | |
4d6abc1c MM |
13865 | |
13866 | return fndecl; | |
8d08fdba MS |
13867 | } |
13868 | \f | |
13869 | /* Create the FUNCTION_DECL for a function definition. | |
8d08fdba MS |
13870 | DECLSPECS and DECLARATOR are the parts of the declaration; |
13871 | they describe the return type and the name of the function, | |
13872 | but twisted together in a fashion that parallels the syntax of C. | |
13873 | ||
13874 | This function creates a binding context for the function body | |
13875 | as well as setting up the FUNCTION_DECL in current_function_decl. | |
13876 | ||
13877 | Returns a FUNCTION_DECL on success. | |
13878 | ||
13879 | If the DECLARATOR is not suitable for a function (it defines a datum | |
13880 | instead), we return 0, which tells yyparse to report a parse error. | |
13881 | ||
13882 | May return void_type_node indicating that this method is actually | |
13883 | a friend. See grokfield for more details. | |
13884 | ||
13885 | Came here with a `.pushlevel' . | |
13886 | ||
13887 | DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING | |
13888 | CHANGES TO CODE IN `grokfield'. */ | |
e92cc029 | 13889 | |
8d08fdba | 13890 | tree |
acf82af2 JM |
13891 | start_method (declspecs, declarator, attrlist) |
13892 | tree declarator, declspecs, attrlist; | |
8d08fdba | 13893 | { |
c11b6f21 | 13894 | tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0, |
acf82af2 | 13895 | attrlist); |
8d08fdba MS |
13896 | |
13897 | /* Something too ugly to handle. */ | |
13898 | if (fndecl == NULL_TREE) | |
13899 | return NULL_TREE; | |
13900 | ||
13901 | /* Pass friends other than inline friend functions back. */ | |
a1774733 | 13902 | if (fndecl == void_type_node) |
8d08fdba MS |
13903 | return fndecl; |
13904 | ||
13905 | if (TREE_CODE (fndecl) != FUNCTION_DECL) | |
13906 | /* Not a function, tell parser to report parse error. */ | |
13907 | return NULL_TREE; | |
13908 | ||
8d08fdba MS |
13909 | if (DECL_IN_AGGR_P (fndecl)) |
13910 | { | |
13911 | if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type) | |
13912 | { | |
2c73f9f5 ML |
13913 | if (DECL_CONTEXT (fndecl) |
13914 | && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL) | |
8251199e JM |
13915 | cp_error ("`%D' is already defined in class %s", fndecl, |
13916 | TYPE_NAME_STRING (DECL_CONTEXT (fndecl))); | |
8d08fdba MS |
13917 | } |
13918 | return void_type_node; | |
13919 | } | |
13920 | ||
f3400fe2 JM |
13921 | check_template_shadow (fndecl); |
13922 | ||
faae18ab MS |
13923 | DECL_THIS_INLINE (fndecl) = 1; |
13924 | ||
8926095f | 13925 | if (flag_default_inline) |
8d08fdba MS |
13926 | DECL_INLINE (fndecl) = 1; |
13927 | ||
36a117a5 MM |
13928 | /* We process method specializations in finish_struct_1. */ |
13929 | if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
3ac3d9ea | 13930 | fndecl = push_template_decl (fndecl); |
a0a33927 | 13931 | |
8d08fdba MS |
13932 | /* We read in the parameters on the maybepermanent_obstack, |
13933 | but we won't be getting back to them until after we | |
13934 | may have clobbered them. So the call to preserve_data | |
13935 | will keep them safe. */ | |
13936 | preserve_data (); | |
13937 | ||
13938 | if (! DECL_FRIEND_P (fndecl)) | |
13939 | { | |
8d08fdba MS |
13940 | if (TREE_CHAIN (fndecl)) |
13941 | { | |
13942 | fndecl = copy_node (fndecl); | |
13943 | TREE_CHAIN (fndecl) = NULL_TREE; | |
13944 | } | |
13945 | ||
13946 | if (DECL_CONSTRUCTOR_P (fndecl)) | |
a0a33927 MS |
13947 | { |
13948 | if (! grok_ctor_properties (current_class_type, fndecl)) | |
13949 | return void_type_node; | |
13950 | } | |
8d08fdba MS |
13951 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl))) |
13952 | grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0); | |
13953 | } | |
13954 | ||
82580166 | 13955 | cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0, 0); |
8d08fdba MS |
13956 | |
13957 | /* Make a place for the parms */ | |
13958 | pushlevel (0); | |
13959 | current_binding_level->parm_flag = 1; | |
13960 | ||
13961 | DECL_IN_AGGR_P (fndecl) = 1; | |
13962 | return fndecl; | |
13963 | } | |
13964 | ||
13965 | /* Go through the motions of finishing a function definition. | |
13966 | We don't compile this method until after the whole class has | |
13967 | been processed. | |
13968 | ||
13969 | FINISH_METHOD must return something that looks as though it | |
13970 | came from GROKFIELD (since we are defining a method, after all). | |
13971 | ||
13972 | This is called after parsing the body of the function definition. | |
13973 | STMTS is the chain of statements that makes up the function body. | |
13974 | ||
13975 | DECL is the ..._DECL that `start_method' provided. */ | |
13976 | ||
13977 | tree | |
13978 | finish_method (decl) | |
13979 | tree decl; | |
13980 | { | |
13981 | register tree fndecl = decl; | |
13982 | tree old_initial; | |
8d08fdba MS |
13983 | |
13984 | register tree link; | |
13985 | ||
a1774733 | 13986 | if (decl == void_type_node) |
8d08fdba MS |
13987 | return decl; |
13988 | ||
13989 | old_initial = DECL_INITIAL (fndecl); | |
13990 | ||
13991 | /* Undo the level for the parms (from start_method). | |
13992 | This is like poplevel, but it causes nothing to be | |
13993 | saved. Saving information here confuses symbol-table | |
13994 | output routines. Besides, this information will | |
13995 | be correctly output when this method is actually | |
13996 | compiled. */ | |
13997 | ||
13998 | /* Clear out the meanings of the local variables of this level; | |
13999 | also record in each decl which block it belongs to. */ | |
14000 | ||
14001 | for (link = current_binding_level->names; link; link = TREE_CHAIN (link)) | |
14002 | { | |
14003 | if (DECL_NAME (link) != NULL_TREE) | |
d8f8dca1 | 14004 | pop_binding (DECL_NAME (link), link); |
8d08fdba MS |
14005 | my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163); |
14006 | DECL_CONTEXT (link) = NULL_TREE; | |
14007 | } | |
14008 | ||
8d08fdba MS |
14009 | GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level, |
14010 | (HOST_WIDE_INT) current_binding_level->level_chain, | |
14011 | current_binding_level->parm_flag, | |
5566b478 | 14012 | current_binding_level->keep); |
8d08fdba MS |
14013 | |
14014 | poplevel (0, 0, 0); | |
14015 | ||
14016 | DECL_INITIAL (fndecl) = old_initial; | |
14017 | ||
14018 | /* We used to check if the context of FNDECL was different from | |
14019 | current_class_type as another way to get inside here. This didn't work | |
14020 | for String.cc in libg++. */ | |
14021 | if (DECL_FRIEND_P (fndecl)) | |
14022 | { | |
14023 | CLASSTYPE_INLINE_FRIENDS (current_class_type) | |
14024 | = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type)); | |
14025 | decl = void_type_node; | |
14026 | } | |
14027 | ||
14028 | return decl; | |
14029 | } | |
14030 | \f | |
14031 | /* Called when a new struct TYPE is defined. | |
14032 | If this structure or union completes the type of any previous | |
14033 | variable declaration, lay it out and output its rtl. */ | |
14034 | ||
14035 | void | |
14036 | hack_incomplete_structures (type) | |
14037 | tree type; | |
14038 | { | |
f30432d7 | 14039 | tree *list; |
8d08fdba | 14040 | |
f30432d7 | 14041 | if (current_binding_level->incomplete == NULL_TREE) |
8d08fdba MS |
14042 | return; |
14043 | ||
14044 | if (!type) /* Don't do this for class templates. */ | |
14045 | return; | |
14046 | ||
f30432d7 MS |
14047 | for (list = ¤t_binding_level->incomplete; *list; ) |
14048 | { | |
14049 | tree decl = TREE_VALUE (*list); | |
a703fb38 | 14050 | if ((decl && TREE_TYPE (decl) == type) |
f30432d7 MS |
14051 | || (TREE_TYPE (decl) |
14052 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE | |
14053 | && TREE_TYPE (TREE_TYPE (decl)) == type)) | |
14054 | { | |
14055 | int toplevel = toplevel_bindings_p (); | |
14056 | if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE | |
14057 | && TREE_TYPE (TREE_TYPE (decl)) == type) | |
14058 | layout_type (TREE_TYPE (decl)); | |
14059 | layout_decl (decl, 0); | |
14060 | rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0); | |
14061 | if (! toplevel) | |
14062 | { | |
14063 | tree cleanup; | |
14064 | expand_decl (decl); | |
14065 | cleanup = maybe_build_cleanup (decl); | |
14066 | expand_decl_init (decl); | |
e349ee73 | 14067 | if (! expand_decl_cleanup (decl, cleanup)) |
8251199e | 14068 | cp_error ("parser lost in parsing declaration of `%D'", |
f30432d7 MS |
14069 | decl); |
14070 | } | |
14071 | *list = TREE_CHAIN (*list); | |
14072 | } | |
14073 | else | |
14074 | list = &TREE_CHAIN (*list); | |
14075 | } | |
8d08fdba MS |
14076 | } |
14077 | ||
8d08fdba | 14078 | /* If DECL is of a type which needs a cleanup, build that cleanup here. |
c73964b2 | 14079 | See build_delete for information about AUTO_DELETE. |
8d08fdba MS |
14080 | |
14081 | Don't build these on the momentary obstack; they must live | |
14082 | the life of the binding contour. */ | |
e92cc029 | 14083 | |
c73964b2 MS |
14084 | static tree |
14085 | maybe_build_cleanup_1 (decl, auto_delete) | |
14086 | tree decl, auto_delete; | |
8d08fdba MS |
14087 | { |
14088 | tree type = TREE_TYPE (decl); | |
44689c12 | 14089 | if (type != error_mark_node && TYPE_NEEDS_DESTRUCTOR (type)) |
8d08fdba MS |
14090 | { |
14091 | int temp = 0, flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR; | |
14092 | tree rval; | |
8d08fdba MS |
14093 | |
14094 | if (TREE_CODE (decl) != PARM_DECL) | |
14095 | temp = suspend_momentary (); | |
14096 | ||
14097 | if (TREE_CODE (type) == ARRAY_TYPE) | |
14098 | rval = decl; | |
14099 | else | |
14100 | { | |
14101 | mark_addressable (decl); | |
14102 | rval = build_unary_op (ADDR_EXPR, decl, 0); | |
14103 | } | |
14104 | ||
14105 | /* Optimize for space over speed here. */ | |
14106 | if (! TYPE_USES_VIRTUAL_BASECLASSES (type) | |
14107 | || flag_expensive_optimizations) | |
14108 | flags |= LOOKUP_NONVIRTUAL; | |
14109 | ||
c73964b2 | 14110 | rval = build_delete (TREE_TYPE (rval), rval, auto_delete, flags, 0); |
8d08fdba MS |
14111 | |
14112 | if (TYPE_USES_VIRTUAL_BASECLASSES (type) | |
14113 | && ! TYPE_HAS_DESTRUCTOR (type)) | |
e1b3e07d | 14114 | rval = build_compound_expr (tree_cons (NULL_TREE, rval, |
e66d884e | 14115 | build_expr_list (NULL_TREE, build_vbase_delete (type, decl)))); |
8d08fdba | 14116 | |
8d08fdba MS |
14117 | if (TREE_CODE (decl) != PARM_DECL) |
14118 | resume_momentary (temp); | |
14119 | ||
8d08fdba MS |
14120 | return rval; |
14121 | } | |
14122 | return 0; | |
14123 | } | |
c73964b2 | 14124 | |
9d85d30c MM |
14125 | /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */ |
14126 | ||
14127 | tree | |
14128 | build_target_expr (decl, value) | |
14129 | tree decl; | |
14130 | tree value; | |
14131 | { | |
9263e6d6 MM |
14132 | tree t; |
14133 | ||
14134 | t = build (TARGET_EXPR, TREE_TYPE (decl), decl, value, | |
14135 | maybe_build_cleanup (decl), NULL_TREE); | |
14136 | /* We always set TREE_SIDE_EFFECTS so that expand_expr does not | |
14137 | ignore the TARGET_EXPR. If there really turn out to be no | |
14138 | side-effects, then the optimizer should be able to get rid of | |
14139 | whatever code is generated anyhow. */ | |
14140 | TREE_SIDE_EFFECTS (t) = 1; | |
14141 | ||
14142 | return t; | |
9d85d30c MM |
14143 | } |
14144 | ||
c73964b2 MS |
14145 | /* If DECL is of a type which needs a cleanup, build that cleanup |
14146 | here. The cleanup does free the storage with a call to delete. */ | |
14147 | ||
14148 | tree | |
14149 | maybe_build_cleanup_and_delete (decl) | |
14150 | tree decl; | |
14151 | { | |
14152 | return maybe_build_cleanup_1 (decl, integer_three_node); | |
14153 | } | |
14154 | ||
14155 | /* If DECL is of a type which needs a cleanup, build that cleanup | |
14156 | here. The cleanup does not free the storage with a call a delete. */ | |
14157 | ||
14158 | tree | |
14159 | maybe_build_cleanup (decl) | |
14160 | tree decl; | |
14161 | { | |
14162 | return maybe_build_cleanup_1 (decl, integer_two_node); | |
14163 | } | |
8d08fdba MS |
14164 | \f |
14165 | /* Expand a C++ expression at the statement level. | |
14166 | This is needed to ferret out nodes which have UNKNOWN_TYPE. | |
14167 | The C++ type checker should get all of these out when | |
14168 | expressions are combined with other, type-providing, expressions, | |
14169 | leaving only orphan expressions, such as: | |
14170 | ||
e92cc029 | 14171 | &class::bar; / / takes its address, but does nothing with it. */ |
8d08fdba | 14172 | |
8d08fdba MS |
14173 | void |
14174 | cplus_expand_expr_stmt (exp) | |
14175 | tree exp; | |
14176 | { | |
02cac427 NS |
14177 | if (stmts_are_full_exprs_p) |
14178 | exp = convert_to_void (exp, "statement"); | |
66543169 | 14179 | |
63c68bb7 | 14180 | #if 0 |
66543169 NS |
14181 | /* We should do this eventually, but right now this causes regex.o from |
14182 | libg++ to miscompile, and tString to core dump. */ | |
14183 | exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp); | |
63c68bb7 | 14184 | #endif |
b3e401c2 | 14185 | |
66543169 NS |
14186 | /* If we don't do this, we end up down inside expand_expr |
14187 | trying to do TYPE_MODE on the ERROR_MARK, and really | |
14188 | go outside the bounds of the type. */ | |
14189 | if (exp != error_mark_node) | |
14190 | expand_expr_stmt (break_out_cleanups (exp)); | |
8d08fdba MS |
14191 | } |
14192 | ||
558475f0 | 14193 | /* When a stmt has been parsed, this function is called. */ |
8d08fdba MS |
14194 | |
14195 | void | |
14196 | finish_stmt () | |
14197 | { | |
558475f0 MM |
14198 | if (!current_function_assigns_this |
14199 | && current_function_just_assigned_this) | |
8d08fdba | 14200 | { |
24bef158 MM |
14201 | if (DECL_CONSTRUCTOR_P (current_function_decl) |
14202 | && !building_stmt_tree ()) | |
558475f0 MM |
14203 | { |
14204 | /* Constructors must wait until we are out of control | |
14205 | zones before calling base constructors. */ | |
14206 | if (in_control_zone_p ()) | |
14207 | return; | |
14208 | expand_expr_stmt (base_init_expr); | |
14209 | check_base_init (current_class_type); | |
14210 | } | |
14211 | current_function_assigns_this = 1; | |
8d08fdba | 14212 | } |
558475f0 MM |
14213 | |
14214 | /* Always assume this statement was not an expression statement. If | |
14215 | it actually was an expression statement, its our callers | |
14216 | responsibility to fix this up. */ | |
14217 | last_expr_type = NULL_TREE; | |
8d08fdba MS |
14218 | } |
14219 | ||
8d08fdba | 14220 | /* Change a static member function definition into a FUNCTION_TYPE, instead |
700f8a87 MS |
14221 | of the METHOD_TYPE that we create when it's originally parsed. |
14222 | ||
14223 | WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES | |
14224 | (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of | |
14225 | other decls. Either pass the addresses of local variables or NULL. */ | |
14226 | ||
8857f91e | 14227 | void |
700f8a87 MS |
14228 | revert_static_member_fn (decl, fn, argtypes) |
14229 | tree *decl, *fn, *argtypes; | |
8d08fdba | 14230 | { |
700f8a87 MS |
14231 | tree tmp; |
14232 | tree function = fn ? *fn : TREE_TYPE (*decl); | |
14233 | tree args = argtypes ? *argtypes : TYPE_ARG_TYPES (function); | |
8d08fdba | 14234 | |
91063b51 MM |
14235 | if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args))) |
14236 | != TYPE_UNQUALIFIED) | |
14237 | cp_error ("static member function `%#D' declared with type qualifiers", | |
14238 | *decl); | |
f30432d7 | 14239 | |
700f8a87 MS |
14240 | args = TREE_CHAIN (args); |
14241 | tmp = build_function_type (TREE_TYPE (function), args); | |
91063b51 | 14242 | tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function)); |
f30432d7 | 14243 | tmp = build_exception_variant (tmp, |
8d08fdba MS |
14244 | TYPE_RAISES_EXCEPTIONS (function)); |
14245 | TREE_TYPE (*decl) = tmp; | |
f30432d7 MS |
14246 | if (DECL_ARGUMENTS (*decl)) |
14247 | DECL_ARGUMENTS (*decl) = TREE_CHAIN (DECL_ARGUMENTS (*decl)); | |
8d08fdba | 14248 | DECL_STATIC_FUNCTION_P (*decl) = 1; |
700f8a87 MS |
14249 | if (fn) |
14250 | *fn = tmp; | |
14251 | if (argtypes) | |
14252 | *argtypes = args; | |
8d08fdba | 14253 | } |
a4443a08 | 14254 | |
a8f73d4b MM |
14255 | /* Initialize the variables used during compilation of a C++ |
14256 | function. */ | |
db5ae43f | 14257 | |
99dccabc MM |
14258 | static void |
14259 | push_cp_function_context (f) | |
14260 | struct function *f; | |
14261 | { | |
14262 | struct language_function *p | |
14263 | = ((struct language_function *) | |
be91309c | 14264 | xcalloc (1, sizeof (struct language_function))); |
99dccabc | 14265 | f->language = p; |
db5ae43f | 14266 | |
558475f0 MM |
14267 | /* For now, we always assume we're expanding all the way to RTL |
14268 | unless we're explicitly doing otherwise. */ | |
14269 | expanding_p = 1; | |
f1dedc31 MM |
14270 | |
14271 | /* Whenever we start a new function, we destroy temporaries in the | |
14272 | usual way. */ | |
14273 | stmts_are_full_exprs_p = 1; | |
db5ae43f MS |
14274 | } |
14275 | ||
a8f73d4b MM |
14276 | /* Free the language-specific parts of F, now that we've finished |
14277 | compiling the function. */ | |
db5ae43f | 14278 | |
99dccabc MM |
14279 | static void |
14280 | pop_cp_function_context (f) | |
14281 | struct function *f; | |
db5ae43f | 14282 | { |
99dccabc MM |
14283 | free (f->language); |
14284 | f->language = 0; | |
db5ae43f | 14285 | } |
ebfc180f | 14286 | |
4519c0a8 MM |
14287 | void |
14288 | mark_cp_function_context (f) | |
14289 | struct function *f; | |
14290 | { | |
14291 | struct language_function *p = f->language; | |
14292 | ||
87e3dbc9 MM |
14293 | if (!p) |
14294 | return; | |
14295 | ||
4519c0a8 MM |
14296 | ggc_mark_tree (p->x_named_labels); |
14297 | ggc_mark_tree (p->x_ctor_label); | |
14298 | ggc_mark_tree (p->x_dtor_label); | |
14299 | ggc_mark_tree (p->x_base_init_list); | |
14300 | ggc_mark_tree (p->x_member_init_list); | |
14301 | ggc_mark_tree (p->x_base_init_expr); | |
14302 | ggc_mark_tree (p->x_current_class_ptr); | |
14303 | ggc_mark_tree (p->x_current_class_ref); | |
14304 | ggc_mark_tree (p->x_last_tree); | |
14305 | ggc_mark_tree (p->x_last_expr_type); | |
14306 | ||
14307 | ggc_mark_rtx (p->x_last_dtor_insn); | |
14308 | ggc_mark_rtx (p->x_last_parm_cleanup_insn); | |
14309 | ggc_mark_rtx (p->x_result_rtx); | |
14310 | ||
a8f73d4b | 14311 | mark_binding_level (&p->bindings); |
4519c0a8 MM |
14312 | } |
14313 | ||
14314 | ||
5566b478 MS |
14315 | int |
14316 | in_function_p () | |
14317 | { | |
14318 | return function_depth != 0; | |
14319 | } | |
4519c0a8 MM |
14320 | |
14321 | ||
14322 | void | |
b4b8bee7 MM |
14323 | lang_mark_false_label_stack (l) |
14324 | struct label_node *l; | |
4519c0a8 MM |
14325 | { |
14326 | /* C++ doesn't use false_label_stack. It better be NULL. */ | |
87e3dbc9 | 14327 | my_friendly_assert (l == NULL, 19990904); |
4519c0a8 MM |
14328 | } |
14329 | ||
14330 | void | |
14331 | lang_mark_tree (t) | |
14332 | tree t; | |
14333 | { | |
14334 | enum tree_code code = TREE_CODE (t); | |
14335 | if (code == IDENTIFIER_NODE) | |
14336 | { | |
14337 | struct lang_identifier *li = (struct lang_identifier *) t; | |
14338 | struct lang_id2 *li2 = li->x; | |
14339 | ggc_mark_tree (li->namespace_bindings); | |
a8f73d4b | 14340 | ggc_mark_tree (li->bindings); |
4519c0a8 MM |
14341 | ggc_mark_tree (li->class_value); |
14342 | ggc_mark_tree (li->class_template_info); | |
14343 | ||
14344 | if (li2) | |
14345 | { | |
14346 | ggc_mark_tree (li2->label_value); | |
14347 | ggc_mark_tree (li2->implicit_decl); | |
14348 | ggc_mark_tree (li2->error_locus); | |
14349 | } | |
14350 | } | |
87e3dbc9 MM |
14351 | else if (code == CPLUS_BINDING) |
14352 | { | |
14353 | if (BINDING_HAS_LEVEL_P (t)) | |
14354 | mark_binding_level (&BINDING_LEVEL (t)); | |
14355 | else | |
14356 | ggc_mark_tree (BINDING_SCOPE (t)); | |
14357 | ggc_mark_tree (BINDING_VALUE (t)); | |
14358 | } | |
14359 | else if (code == OVERLOAD) | |
14360 | ggc_mark_tree (OVL_FUNCTION (t)); | |
14361 | else if (code == TEMPLATE_PARM_INDEX) | |
14362 | ggc_mark_tree (TEMPLATE_PARM_DECL (t)); | |
4519c0a8 MM |
14363 | else if (TREE_CODE_CLASS (code) == 'd') |
14364 | { | |
14365 | struct lang_decl *ld = DECL_LANG_SPECIFIC (t); | |
14366 | ||
14367 | if (ld) | |
14368 | { | |
d60f72ae | 14369 | ggc_mark (ld); |
4519c0a8 MM |
14370 | ggc_mark_tree (ld->decl_flags.access); |
14371 | ggc_mark_tree (ld->decl_flags.context); | |
14372 | if (TREE_CODE (t) != NAMESPACE_DECL) | |
14373 | ggc_mark_tree (ld->decl_flags.u.template_info); | |
14374 | if (CAN_HAVE_FULL_LANG_DECL_P (t)) | |
14375 | { | |
14376 | ggc_mark_tree (ld->main_decl_variant); | |
14377 | ggc_mark_tree (ld->befriending_classes); | |
14378 | ggc_mark_tree (ld->saved_tree); | |
14379 | if (TREE_CODE (t) == TYPE_DECL) | |
14380 | ggc_mark_tree (ld->u.sorted_fields); | |
14381 | } | |
14382 | } | |
14383 | } | |
14384 | else if (TREE_CODE_CLASS (code) == 't') | |
14385 | { | |
14386 | struct lang_type *lt = TYPE_LANG_SPECIFIC (t); | |
14387 | ||
87e3dbc9 MM |
14388 | if (lt && !(TREE_CODE (t) == POINTER_TYPE |
14389 | && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE)) | |
4519c0a8 | 14390 | { |
c27db0df | 14391 | ggc_mark (lt); |
4519c0a8 MM |
14392 | ggc_mark_tree (lt->vfields); |
14393 | ggc_mark_tree (lt->vbases); | |
14394 | ggc_mark_tree (lt->tags); | |
14395 | ggc_mark_tree (lt->search_slot); | |
14396 | ggc_mark_tree (lt->size); | |
14397 | ggc_mark_tree (lt->abstract_virtuals); | |
14398 | ggc_mark_tree (lt->friend_classes); | |
14399 | ggc_mark_tree (lt->rtti); | |
14400 | ggc_mark_tree (lt->methods); | |
14401 | ggc_mark_tree (lt->template_info); | |
87e3dbc9 | 14402 | ggc_mark_tree (lt->befriending_classes); |
4519c0a8 | 14403 | } |
87e3dbc9 MM |
14404 | else if (lt) |
14405 | /* In the case of pointer-to-member function types, the | |
14406 | TYPE_LANG_SPECIFIC is really just a tree. */ | |
14407 | ggc_mark_tree ((tree) lt); | |
4519c0a8 MM |
14408 | } |
14409 | } | |
14410 |