]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Process declarations and variables for C compiler. |
d6a8bdff JL |
2 | Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
3 | 1999, 2000 Free Software Foundation, Inc. | |
8d08fdba MS |
4 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
5 | ||
6 | This file is part of GNU CC. | |
7 | ||
8 | GNU CC is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
13 | GNU CC is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
20 | the Free Software Foundation, 59 Temple Place - Suite 330, |
21 | Boston, MA 02111-1307, USA. */ | |
8d08fdba MS |
22 | |
23 | ||
24 | /* Process declarations and symbol lookup for C front end. | |
25 | Also constructs types; the standard scalar types at initialization, | |
26 | and structure, union, array and enum types when they are declared. */ | |
27 | ||
28 | /* ??? not all decl nodes are given the most useful possible | |
29 | line numbers. For example, the CONST_DECLs for enum values. */ | |
30 | ||
31 | #include "config.h" | |
8d052bc7 | 32 | #include "system.h" |
8d08fdba MS |
33 | #include "tree.h" |
34 | #include "rtl.h" | |
35 | #include "flags.h" | |
36 | #include "cp-tree.h" | |
37 | #include "decl.h" | |
38 | #include "lex.h" | |
e8abc66f | 39 | #include "output.h" |
49c249e1 | 40 | #include "except.h" |
9f617717 | 41 | #include "expr.h" |
eb773359 | 42 | #include "defaults.h" |
54f92bfb | 43 | #include "toplev.h" |
bcb80729 KG |
44 | #include "dwarf2out.h" |
45 | #include "dwarfout.h" | |
fc6af6e3 | 46 | #include "ggc.h" |
49c249e1 | 47 | |
297441fd DB |
48 | #if USE_CPPLIB |
49 | #include "cpplib.h" | |
50 | extern cpp_reader parse_in; | |
297441fd DB |
51 | #endif |
52 | ||
0aafb128 MM |
53 | /* This structure contains information about the initializations |
54 | and/or destructions required for a particular priority level. */ | |
55 | typedef struct priority_info_s { | |
0352cfc8 MM |
56 | /* Non-zero if there have been any initializations at this priority |
57 | throughout the translation unit. */ | |
58 | int initializations_p; | |
59 | /* Non-zero if there have been any destructions at this priority | |
60 | throughout the translation unit. */ | |
61 | int destructions_p; | |
0aafb128 MM |
62 | } *priority_info; |
63 | ||
158991b7 KG |
64 | static tree get_sentry PARAMS ((tree)); |
65 | static void mark_vtable_entries PARAMS ((tree)); | |
66 | static void grok_function_init PARAMS ((tree, tree)); | |
67 | static int finish_vtable_vardecl PARAMS ((tree *, void *)); | |
68 | static int prune_vtable_vardecl PARAMS ((tree *, void *)); | |
69 | static int is_namespace_ancestor PARAMS ((tree, tree)); | |
70 | static void add_using_namespace PARAMS ((tree, tree, int)); | |
71 | static tree ambiguous_decl PARAMS ((tree, tree, tree,int)); | |
72 | static tree build_anon_union_vars PARAMS ((tree, tree*, int, int)); | |
73 | static int acceptable_java_type PARAMS ((tree)); | |
74 | static void output_vtable_inherit PARAMS ((tree)); | |
75 | static tree start_objects PARAMS ((int, int)); | |
76 | static void finish_objects PARAMS ((int, int, tree)); | |
77 | static tree merge_functions PARAMS ((tree, tree)); | |
78 | static tree decl_namespace PARAMS ((tree)); | |
79 | static tree validate_nonmember_using_decl PARAMS ((tree, tree *, tree *)); | |
80 | static void do_nonmember_using_decl PARAMS ((tree, tree, tree, tree, | |
d8e178a0 | 81 | tree *, tree *)); |
158991b7 KG |
82 | static tree start_static_storage_duration_function PARAMS ((void)); |
83 | static void finish_static_storage_duration_function PARAMS ((tree)); | |
84 | static priority_info get_priority_info PARAMS ((int)); | |
85 | static void do_static_initialization PARAMS ((tree, tree)); | |
86 | static void do_static_destruction PARAMS ((tree)); | |
87 | static tree start_static_initialization_or_destruction PARAMS ((tree, int)); | |
88 | static void finish_static_initialization_or_destruction PARAMS ((tree)); | |
89 | static void generate_ctor_or_dtor_function PARAMS ((int, int)); | |
0aafb128 | 90 | static int generate_ctor_and_dtor_functions_for_priority |
158991b7 KG |
91 | PARAMS ((splay_tree_node, void *)); |
92 | static tree prune_vars_needing_no_initialization PARAMS ((tree)); | |
93 | static void write_out_vars PARAMS ((tree)); | |
27d26ee7 | 94 | static void import_export_class PARAMS ((tree)); |
313bc2c2 | 95 | |
cffa8729 | 96 | extern int current_class_depth; |
8d08fdba MS |
97 | |
98 | /* A list of virtual function tables we must make sure to write out. */ | |
99 | tree pending_vtables; | |
100 | ||
101 | /* A list of static class variables. This is needed, because a | |
102 | static class variable can be declared inside the class without | |
103 | an initializer, and then initialized, staticly, outside the class. */ | |
0aafb128 | 104 | static varray_type pending_statics; |
2c0f17dc MM |
105 | #define pending_statics_used \ |
106 | (pending_statics ? pending_statics->elements_used : 0) | |
8d08fdba | 107 | |
8926095f | 108 | /* A list of functions which were declared inline, but which we |
e92cc029 | 109 | may need to emit outline anyway. */ |
0aafb128 | 110 | static varray_type saved_inlines; |
2c0f17dc MM |
111 | #define saved_inlines_used \ |
112 | (saved_inlines ? saved_inlines->elements_used : 0) | |
8d08fdba | 113 | |
8d08fdba MS |
114 | /* Same, but not reset. Local temp variables and global temp variables |
115 | can have the same name. */ | |
116 | static int global_temp_name_counter; | |
117 | ||
51c184be | 118 | /* Flag used when debugging spew.c */ |
8d08fdba MS |
119 | |
120 | extern int spew_debug; | |
e1cd6e56 | 121 | |
5566b478 MS |
122 | /* Nonzero if we're done parsing and into end-of-file activities. */ |
123 | ||
124 | int at_eof; | |
125 | ||
e1cd6e56 MS |
126 | /* Functions called along with real static constructors and destructors. */ |
127 | ||
128 | tree static_ctors, static_dtors; | |
30394414 | 129 | |
9cd64686 | 130 | /* The :: namespace. */ |
30394414 | 131 | |
30394414 JM |
132 | tree global_namespace; |
133 | ||
2c73f9f5 ML |
134 | /* The stack for namespaces of current declarations. */ |
135 | ||
136 | static tree decl_namespace_list; | |
137 | ||
8d08fdba MS |
138 | \f |
139 | /* C (and C++) language-specific option variables. */ | |
140 | ||
141 | /* Nonzero means allow type mismatches in conditional expressions; | |
142 | just make their values `void'. */ | |
143 | ||
144 | int flag_cond_mismatch; | |
145 | ||
146 | /* Nonzero means give `double' the same size as `float'. */ | |
147 | ||
148 | int flag_short_double; | |
149 | ||
150 | /* Nonzero means don't recognize the keyword `asm'. */ | |
151 | ||
152 | int flag_no_asm; | |
153 | ||
e1cd6e56 MS |
154 | /* Nonzero means don't recognize any extension keywords. */ |
155 | ||
156 | int flag_no_gnu_keywords; | |
157 | ||
8d08fdba MS |
158 | /* Nonzero means don't recognize the non-ANSI builtin functions. */ |
159 | ||
160 | int flag_no_builtin; | |
161 | ||
00595019 MS |
162 | /* Nonzero means don't recognize the non-ANSI builtin functions. |
163 | -ansi sets this. */ | |
164 | ||
165 | int flag_no_nonansi_builtin; | |
166 | ||
d22c8596 MS |
167 | /* Nonzero means do some things the same way PCC does. Only provided so |
168 | the compiler will link. */ | |
8d08fdba MS |
169 | |
170 | int flag_traditional; | |
171 | ||
172 | /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */ | |
173 | ||
174 | int flag_signed_bitfields = 1; | |
175 | ||
cab1f180 ML |
176 | /* Nonzero means enable obscure standard features and disable GNU |
177 | extensions that might cause standard-compliant code to be | |
178 | miscompiled. */ | |
8d08fdba | 179 | |
e1cd6e56 | 180 | int flag_ansi; |
8d08fdba | 181 | |
8d08fdba MS |
182 | /* Nonzero means do emit exported implementations of functions even if |
183 | they can be inlined. */ | |
184 | ||
185 | int flag_implement_inlines = 1; | |
186 | ||
187 | /* Nonzero means do emit exported implementations of templates, instead of | |
e92cc029 | 188 | multiple static copies in each file that needs a definition. */ |
8d08fdba | 189 | |
e1cd6e56 | 190 | int flag_external_templates; |
8d08fdba MS |
191 | |
192 | /* Nonzero means that the decision to emit or not emit the implementation of a | |
193 | template depends on where the template is instantiated, rather than where | |
194 | it is defined. */ | |
195 | ||
e1cd6e56 | 196 | int flag_alt_external_templates; |
8d08fdba | 197 | |
a0a33927 MS |
198 | /* Nonzero means that implicit instantiations will be emitted if needed. */ |
199 | ||
200 | int flag_implicit_templates = 1; | |
201 | ||
5eea678f JM |
202 | /* Nonzero means that implicit instantiations of inline templates will be |
203 | emitted if needed, even if instantiations of non-inline templates | |
204 | aren't. */ | |
205 | ||
206 | int flag_implicit_inline_templates = 1; | |
207 | ||
8d08fdba MS |
208 | /* Nonzero means warn about implicit declarations. */ |
209 | ||
210 | int warn_implicit = 1; | |
211 | ||
795add94 VM |
212 | /* Nonzero means warn about usage of long long when `-pedantic'. */ |
213 | ||
214 | int warn_long_long = 1; | |
215 | ||
8d08fdba MS |
216 | /* Nonzero means warn when all ctors or dtors are private, and the class |
217 | has no friends. */ | |
218 | ||
219 | int warn_ctor_dtor_privacy = 1; | |
220 | ||
a80e4195 | 221 | /* True if we want to implement vtables using "thunks". |
6467930b | 222 | The default is off. */ |
8926095f | 223 | |
da20811c JM |
224 | #ifndef DEFAULT_VTABLE_THUNKS |
225 | #define DEFAULT_VTABLE_THUNKS 0 | |
c73964b2 | 226 | #endif |
da20811c | 227 | int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS; |
51c184be | 228 | |
2aaf816d JM |
229 | /* Nonzero means generate separate instantiation control files and juggle |
230 | them at link time. */ | |
faae18ab MS |
231 | |
232 | int flag_use_repository; | |
233 | ||
dc8263bc JM |
234 | /* Nonzero if we want to issue diagnostics that the standard says are not |
235 | required. */ | |
236 | ||
237 | int flag_optional_diags = 1; | |
238 | ||
d9cf7c82 JM |
239 | /* Nonzero means give string constants the type `const char *', as mandated |
240 | by the standard. */ | |
241 | ||
242 | int flag_const_strings = 1; | |
243 | ||
f71f87f9 MM |
244 | /* If non-NULL, dump the tree structure for the entire translation |
245 | unit to this file. */ | |
246 | ||
247 | char *flag_dump_translation_unit = 0; | |
248 | ||
d9cf7c82 JM |
249 | /* Nonzero means warn about deprecated conversion from string constant to |
250 | `char *'. */ | |
8d08fdba MS |
251 | |
252 | int warn_write_strings; | |
253 | ||
254 | /* Nonzero means warn about pointer casts that can drop a type qualifier | |
255 | from the pointer target type. */ | |
256 | ||
257 | int warn_cast_qual; | |
258 | ||
8d08fdba MS |
259 | /* Nonzero means warn about sizeof(function) or addition/subtraction |
260 | of function pointers. */ | |
261 | ||
be99da77 | 262 | int warn_pointer_arith = 1; |
8d08fdba | 263 | |
8d08fdba MS |
264 | /* Nonzero means warn for any function def without prototype decl. */ |
265 | ||
266 | int warn_missing_prototypes; | |
267 | ||
268 | /* Nonzero means warn about multiple (redundant) decls for the same single | |
269 | variable or function. */ | |
270 | ||
271 | int warn_redundant_decls; | |
272 | ||
273 | /* Warn if initializer is not completely bracketed. */ | |
274 | ||
275 | int warn_missing_braces; | |
276 | ||
2ee887f2 MS |
277 | /* Warn about comparison of signed and unsigned values. */ |
278 | ||
279 | int warn_sign_compare; | |
280 | ||
1bdba2c0 DZ |
281 | /* Warn about testing equality of floating point numbers. */ |
282 | ||
283 | int warn_float_equal = 0; | |
284 | ||
e92cc029 | 285 | /* Warn about *printf or *scanf format/argument anomalies. */ |
8d08fdba MS |
286 | |
287 | int warn_format; | |
288 | ||
289 | /* Warn about a subscript that has type char. */ | |
290 | ||
291 | int warn_char_subscripts; | |
292 | ||
293 | /* Warn if a type conversion is done that might have confusing results. */ | |
294 | ||
295 | int warn_conversion; | |
296 | ||
297 | /* Warn if adding () is suggested. */ | |
298 | ||
e1cd6e56 | 299 | int warn_parentheses; |
8d08fdba MS |
300 | |
301 | /* Non-zero means warn in function declared in derived class has the | |
302 | same name as a virtual in the base class, but fails to match the | |
303 | type signature of any virtual function in the base class. */ | |
304 | int warn_overloaded_virtual; | |
305 | ||
306 | /* Non-zero means warn when declaring a class that has a non virtual | |
e92cc029 | 307 | destructor, when it really ought to have a virtual one. */ |
9a0e77ba | 308 | int warn_nonvdtor; |
8d08fdba MS |
309 | |
310 | /* Non-zero means warn when a function is declared extern and later inline. */ | |
311 | int warn_extern_inline; | |
312 | ||
f376e137 MS |
313 | /* Non-zero means warn when the compiler will reorder code. */ |
314 | int warn_reorder; | |
315 | ||
ddd5a7c1 | 316 | /* Non-zero means warn when synthesis behavior differs from Cfront's. */ |
f376e137 MS |
317 | int warn_synth; |
318 | ||
9a3b49ac MS |
319 | /* Non-zero means warn when we convert a pointer to member function |
320 | into a pointer to (void or function). */ | |
321 | int warn_pmf2ptr = 1; | |
322 | ||
eb448459 MS |
323 | /* Nonzero means warn about violation of some Effective C++ style rules. */ |
324 | ||
da20811c JM |
325 | int warn_ecpp; |
326 | ||
327 | /* Nonzero means warn where overload resolution chooses a promotion from | |
328 | unsigned to signed over a conversion to an unsigned of the same size. */ | |
329 | ||
330 | int warn_sign_promo; | |
eb448459 | 331 | |
0c4b14c4 JM |
332 | /* Nonzero means warn when an old-style cast is used. */ |
333 | ||
334 | int warn_old_style_cast; | |
335 | ||
f9fc59e8 NC |
336 | /* Warn about #pragma directives that are not recognised. */ |
337 | ||
dc8263bc JM |
338 | int warn_unknown_pragmas; /* Tri state variable. */ |
339 | ||
340 | /* Nonzero means warn about use of multicharacter literals. */ | |
341 | ||
342 | int warn_multichar = 1; | |
f9fc59e8 | 343 | |
7f84cec9 BK |
344 | /* Nonzero means warn when non-templatized friend functions are |
345 | declared within a template */ | |
346 | ||
347 | int warn_nontemplate_friend = 1; | |
348 | ||
2de45c06 ML |
349 | /* Nonzero means complain about deprecated features. */ |
350 | ||
351 | int warn_deprecated = 1; | |
352 | ||
4f6140be | 353 | /* Nonzero means `$' can be in an identifier. */ |
8d08fdba MS |
354 | |
355 | #ifndef DOLLARS_IN_IDENTIFIERS | |
356 | #define DOLLARS_IN_IDENTIFIERS 1 | |
357 | #endif | |
358 | int dollars_in_ident = DOLLARS_IN_IDENTIFIERS; | |
359 | ||
a3203465 | 360 | /* Nonzero for -fno-strict-prototype switch: do not consider empty |
8d08fdba MS |
361 | argument prototype to mean function takes no arguments. */ |
362 | ||
e1cd6e56 | 363 | int flag_strict_prototype = 2; |
8d08fdba MS |
364 | int strict_prototype = 1; |
365 | int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1; | |
366 | ||
367 | /* Nonzero means that labels can be used as first-class objects */ | |
368 | ||
369 | int flag_labels_ok; | |
370 | ||
d2c192ad JM |
371 | /* Nonzero means allow Microsoft extensions without a pedwarn. */ |
372 | ||
373 | int flag_ms_extensions; | |
374 | ||
8d08fdba MS |
375 | /* Non-zero means to collect statistics which might be expensive |
376 | and to print them when we are done. */ | |
377 | int flag_detailed_statistics; | |
378 | ||
379 | /* C++ specific flags. */ | |
8d08fdba MS |
380 | /* Zero means that `this' is a *const. This gives nice behavior in the |
381 | 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior. | |
382 | -2 means we're constructing an object and it has fixed type. */ | |
383 | ||
384 | int flag_this_is_variable; | |
385 | ||
56ae6d77 | 386 | /* Nonzero means we should attempt to elide constructors when possible. */ |
8d08fdba | 387 | |
56ae6d77 | 388 | int flag_elide_constructors = 1; |
8d08fdba | 389 | |
8d08fdba MS |
390 | /* Nonzero means that member functions defined in class scope are |
391 | inline by default. */ | |
392 | ||
393 | int flag_default_inline = 1; | |
394 | ||
db5ae43f | 395 | /* Controls whether compiler generates 'type descriptor' that give |
8d08fdba | 396 | run-time type information. */ |
6b5fbb55 | 397 | int flag_rtti = 1; |
8d08fdba MS |
398 | |
399 | /* Nonzero if we wish to output cross-referencing information | |
400 | for the GNU class browser. */ | |
401 | extern int flag_gnu_xref; | |
402 | ||
8d08fdba | 403 | /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes) |
e92cc029 | 404 | objects. */ |
e1cd6e56 | 405 | |
8d08fdba MS |
406 | int flag_huge_objects; |
407 | ||
408 | /* Nonzero if we want to conserve space in the .o files. We do this | |
409 | by putting uninitialized data and runtime initialized data into | |
ddd5a7c1 | 410 | .common instead of .data at the expense of not flagging multiple |
8d08fdba | 411 | definitions. */ |
e1cd6e56 | 412 | |
8d08fdba MS |
413 | int flag_conserve_space; |
414 | ||
eae89e04 | 415 | /* Nonzero if we want to obey access control semantics. */ |
e1cd6e56 | 416 | |
eae89e04 JM |
417 | int flag_access_control = 1; |
418 | ||
e1cd6e56 MS |
419 | /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */ |
420 | ||
421 | int flag_operator_names; | |
422 | ||
d18c083e MS |
423 | /* Nonzero if we want to check the return value of new and avoid calling |
424 | constructors if it is a null pointer. */ | |
425 | ||
426 | int flag_check_new; | |
427 | ||
cab1f180 | 428 | /* Nonzero if we want the new ISO rules for pushing a new scope for `for' |
57c0c9ca PB |
429 | initialization variables. |
430 | 0: Old rules, set by -fno-for-scope. | |
cab1f180 ML |
431 | 2: New ISO rules, set by -ffor-scope. |
432 | 1: Try to implement new ISO rules, but with backup compatibility | |
57c0c9ca | 433 | (and warnings). This is the default, for now. */ |
863adfc0 MS |
434 | |
435 | int flag_new_for_scope = 1; | |
436 | ||
72b7eeff MS |
437 | /* Nonzero if we want to emit defined symbols with common-like linkage as |
438 | weak symbols where possible, in order to conform to C++ semantics. | |
439 | Otherwise, emit them as local symbols. */ | |
440 | ||
441 | int flag_weak = 1; | |
442 | ||
a59ca936 JM |
443 | /* Nonzero to enable experimental ABI changes. */ |
444 | ||
445 | int flag_new_abi; | |
732dcb6f | 446 | |
db4283a0 MM |
447 | /* Nonzero to use __cxa_atexit, rather than atexit, to register |
448 | destructors for local statics and global objects. */ | |
449 | ||
450 | int flag_use_cxa_atexit; | |
451 | ||
2c73f9f5 ML |
452 | /* Nonzero to not ignore namespace std. */ |
453 | ||
454 | int flag_honor_std; | |
455 | ||
46e8c075 MM |
456 | /* Nonzero if we should expand functions calls inline at the tree |
457 | level, rather than at the RTL level. */ | |
458 | ||
459 | int flag_inline_trees = 0; | |
460 | ||
cab1f180 | 461 | /* Maximum template instantiation depth. Must be at least 17 for ISO |
e9f32eb5 MS |
462 | compliance. */ |
463 | ||
464 | int max_tinst_depth = 17; | |
465 | ||
386b8a85 JM |
466 | /* The name-mangling scheme to use. Must be 1 or greater to support |
467 | template functions with identical types, but different template | |
468 | arguments. */ | |
1d9ffce9 | 469 | int name_mangling_version = 2; |
386b8a85 JM |
470 | |
471 | /* Nonzero means that guiding declarations are allowed. */ | |
472 | int flag_guiding_decls; | |
473 | ||
5096c664 JM |
474 | /* Nonzero if wchar_t should be `unsigned short' instead of whatever it |
475 | would normally be, for use with WINE. */ | |
476 | int flag_short_wchar; | |
477 | ||
1d9ffce9 AM |
478 | /* Nonzero if squashed mangling is to be performed. |
479 | This uses the B and K codes to reference previously seen class types | |
480 | and class qualifiers. */ | |
481 | int flag_do_squangling; | |
482 | ||
a1dd0d36 JM |
483 | /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */ |
484 | ||
485 | int flag_vtable_gc; | |
1d9ffce9 | 486 | |
2642b9bf JM |
487 | /* Nonzero means make the default pedwarns warnings instead of errors. |
488 | The value of this flag is ignored if -pedantic is specified. */ | |
489 | ||
490 | int flag_permissive; | |
491 | ||
1b12a13e MM |
492 | /* If this variable is defined to a non-NULL value, it will be called |
493 | after the file has been completely parsed. */ | |
494 | ||
158991b7 | 495 | void (*back_end_hook) PARAMS ((tree)); |
1b12a13e | 496 | |
8d08fdba MS |
497 | /* Table of language-dependent -f options. |
498 | STRING is the option name. VARIABLE is the address of the variable. | |
499 | ON_VALUE is the value to store in VARIABLE | |
500 | if `-fSTRING' is seen as an option. | |
501 | (If `-fno-STRING' is seen as an option, the opposite value is stored.) */ | |
502 | ||
d8e178a0 KG |
503 | static struct { const char *string; int *variable; int on_value;} |
504 | lang_f_options[] = | |
8d08fdba | 505 | { |
e5b0708a | 506 | /* C/C++ options. */ |
8d08fdba MS |
507 | {"signed-char", &flag_signed_char, 1}, |
508 | {"unsigned-char", &flag_signed_char, 0}, | |
509 | {"signed-bitfields", &flag_signed_bitfields, 1}, | |
510 | {"unsigned-bitfields", &flag_signed_bitfields, 0}, | |
511 | {"short-enums", &flag_short_enums, 1}, | |
512 | {"short-double", &flag_short_double, 1}, | |
5096c664 | 513 | {"short-wchar", &flag_short_wchar, 1}, |
8d08fdba MS |
514 | {"cond-mismatch", &flag_cond_mismatch, 1}, |
515 | {"asm", &flag_no_asm, 0}, | |
516 | {"builtin", &flag_no_builtin, 0}, | |
e5b0708a JM |
517 | |
518 | /* C++-only options. */ | |
519 | {"access-control", &flag_access_control, 1}, | |
520 | {"check-new", &flag_check_new, 1}, | |
521 | {"conserve-space", &flag_conserve_space, 1}, | |
d9cf7c82 | 522 | {"const-strings", &flag_const_strings, 1}, |
e5b0708a JM |
523 | {"default-inline", &flag_default_inline, 1}, |
524 | {"dollars-in-identifiers", &dollars_in_ident, 1}, | |
8d08fdba | 525 | {"elide-constructors", &flag_elide_constructors, 1}, |
e5b0708a JM |
526 | {"external-templates", &flag_external_templates, 1}, |
527 | {"for-scope", &flag_new_for_scope, 2}, | |
528 | {"gnu-keywords", &flag_no_gnu_keywords, 0}, | |
da20811c | 529 | {"handle-exceptions", &flag_exceptions, 1}, |
2c73f9f5 | 530 | {"honor-std", &flag_honor_std, 1}, |
e5b0708a | 531 | {"huge-objects", &flag_huge_objects, 1}, |
8d08fdba | 532 | {"implement-inlines", &flag_implement_inlines, 1}, |
5eea678f | 533 | {"implicit-inline-templates", &flag_implicit_inline_templates, 1}, |
e5b0708a | 534 | {"implicit-templates", &flag_implicit_templates, 1}, |
e5b0708a | 535 | {"labels-ok", &flag_labels_ok, 1}, |
d2c192ad | 536 | {"ms-extensions", &flag_ms_extensions, 1}, |
e1cd6e56 | 537 | {"nonansi-builtins", &flag_no_nonansi_builtin, 0}, |
d18c083e | 538 | {"operator-names", &flag_operator_names, 1}, |
dc8263bc | 539 | {"optional-diags", &flag_optional_diags, 1}, |
2642b9bf | 540 | {"permissive", &flag_permissive, 1}, |
863adfc0 | 541 | {"repo", &flag_use_repository, 1}, |
e5b0708a JM |
542 | {"rtti", &flag_rtti, 1}, |
543 | {"squangle", &flag_do_squangling, 1}, | |
544 | {"stats", &flag_detailed_statistics, 1}, | |
545 | {"strict-prototype", &flag_strict_prototype, 1}, | |
db4283a0 | 546 | {"use-cxa-atexit", &flag_use_cxa_atexit, 1}, |
e5b0708a JM |
547 | {"vtable-gc", &flag_vtable_gc, 1}, |
548 | {"vtable-thunks", &flag_vtable_thunks, 1}, | |
549 | {"weak", &flag_weak, 1}, | |
550 | {"xref", &flag_gnu_xref, 1} | |
8d08fdba MS |
551 | }; |
552 | ||
553 | /* Decode the string P as a language-specific option. | |
297441fd | 554 | Return the number of strings consumed for a valid option. |
03d32d1a NC |
555 | Otherwise return 0. Should not complain if it does not |
556 | recognise the option. */ | |
8d08fdba MS |
557 | |
558 | int | |
297441fd | 559 | lang_decode_option (argc, argv) |
b370501f KG |
560 | int argc |
561 | #if !USE_CPPLIB | |
562 | ATTRIBUTE_UNUSED | |
563 | #endif | |
564 | ; | |
297441fd DB |
565 | char **argv; |
566 | ||
8d08fdba | 567 | { |
297441fd DB |
568 | int strings_processed; |
569 | char *p = argv[0]; | |
570 | #if USE_CPPLIB | |
297441fd DB |
571 | strings_processed = cpp_handle_option (&parse_in, argc, argv); |
572 | #else | |
573 | strings_processed = 0; | |
574 | #endif /* ! USE_CPPLIB */ | |
575 | ||
8d08fdba | 576 | if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional")) |
8cd4c175 | 577 | /* ignore */; |
8d08fdba MS |
578 | else if (p[0] == '-' && p[1] == 'f') |
579 | { | |
580 | /* Some kind of -f option. | |
581 | P's value is the option sans `-f'. | |
582 | Search for it in the table of options. */ | |
85066503 | 583 | size_t j; |
8d08fdba MS |
584 | |
585 | p += 2; | |
586 | /* Try special -f options. */ | |
587 | ||
da20811c JM |
588 | if (!strcmp (p, "handle-exceptions") |
589 | || !strcmp (p, "no-handle-exceptions")) | |
8251199e | 590 | warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)"); |
84663f74 JM |
591 | else if (!strcmp (p, "all-virtual") |
592 | || !strcmp (p, "enum-int-equiv") | |
593 | || !strcmp (p, "no-nonnull-objects") | |
b0a1da19 | 594 | || !strcmp (p, "this-is-variable")) |
69ca7658 | 595 | warning ("-f%s is no longer supported", p); |
8d08fdba MS |
596 | else if (! strcmp (p, "alt-external-templates")) |
597 | { | |
598 | flag_external_templates = 1; | |
599 | flag_alt_external_templates = 1; | |
2de45c06 | 600 | cp_deprecated ("-falt-external-templates"); |
8d08fdba MS |
601 | } |
602 | else if (! strcmp (p, "no-alt-external-templates")) | |
69ca7658 | 603 | flag_alt_external_templates = 0; |
79ff2c6c MS |
604 | else if (!strcmp (p, "repo")) |
605 | { | |
606 | flag_use_repository = 1; | |
607 | flag_implicit_templates = 0; | |
00595019 | 608 | } |
386b8a85 JM |
609 | else if (!strcmp (p, "guiding-decls")) |
610 | { | |
611 | flag_guiding_decls = 1; | |
612 | name_mangling_version = 0; | |
386b8a85 JM |
613 | } |
614 | else if (!strcmp (p, "no-guiding-decls")) | |
69ca7658 | 615 | flag_guiding_decls = 0; |
2de45c06 ML |
616 | else if (!strcmp (p, "external-templates")) |
617 | { | |
618 | flag_external_templates = 1; | |
2de45c06 ML |
619 | cp_deprecated ("-fexternal-templates"); |
620 | } | |
a59ca936 JM |
621 | else if (!strcmp (p, "new-abi")) |
622 | { | |
623 | flag_new_abi = 1; | |
624 | flag_do_squangling = 1; | |
9577319f | 625 | flag_vtable_thunks = 1; |
a59ca936 JM |
626 | } |
627 | else if (!strcmp (p, "no-new-abi")) | |
628 | { | |
629 | flag_new_abi = 0; | |
630 | flag_do_squangling = 0; | |
631 | } | |
e9f32eb5 | 632 | else if (!strncmp (p, "template-depth-", 15)) |
69ca7658 MM |
633 | max_tinst_depth |
634 | = read_integral_parameter (p + 15, p - 2, max_tinst_depth); | |
386b8a85 | 635 | else if (!strncmp (p, "name-mangling-version-", 22)) |
69ca7658 MM |
636 | name_mangling_version |
637 | = read_integral_parameter (p + 22, p - 2, name_mangling_version); | |
eff3ac46 | 638 | else if (!strncmp (p, "message-length=", 15)) |
277576ee MM |
639 | set_message_length |
640 | (read_integral_parameter (p + 15, p - 2, | |
641 | /* default line-wrap length */ 72)); | |
f71f87f9 MM |
642 | else if (!strncmp (p, "dump-translation-unit-", 22)) |
643 | { | |
644 | if (p[22] == '\0') | |
645 | error ("no file specified with -fdump-translation-unit"); | |
646 | else | |
647 | flag_dump_translation_unit = p + 22; | |
648 | } | |
69ca7658 | 649 | else |
8d08fdba | 650 | { |
69ca7658 MM |
651 | int found = 0; |
652 | ||
653 | for (j = 0; | |
654 | !found && j < (sizeof (lang_f_options) | |
655 | / sizeof (lang_f_options[0])); | |
656 | j++) | |
8d08fdba | 657 | { |
69ca7658 MM |
658 | if (!strcmp (p, lang_f_options[j].string)) |
659 | { | |
660 | *lang_f_options[j].variable = lang_f_options[j].on_value; | |
661 | /* A goto here would be cleaner, | |
662 | but breaks the vax pcc. */ | |
663 | found = 1; | |
664 | } | |
665 | if (p[0] == 'n' && p[1] == 'o' && p[2] == '-' | |
666 | && ! strcmp (p+3, lang_f_options[j].string)) | |
667 | { | |
668 | *lang_f_options[j].variable = ! lang_f_options[j].on_value; | |
669 | found = 1; | |
670 | } | |
8d08fdba | 671 | } |
69ca7658 MM |
672 | |
673 | return found; | |
8d08fdba | 674 | } |
8d08fdba MS |
675 | } |
676 | else if (p[0] == '-' && p[1] == 'W') | |
677 | { | |
678 | int setting = 1; | |
679 | ||
680 | /* The -W options control the warning behavior of the compiler. */ | |
681 | p += 2; | |
682 | ||
683 | if (p[0] == 'n' && p[1] == 'o' && p[2] == '-') | |
684 | setting = 0, p += 3; | |
685 | ||
686 | if (!strcmp (p, "implicit")) | |
687 | warn_implicit = setting; | |
795add94 VM |
688 | else if (!strcmp (p, "long-long")) |
689 | warn_long_long = setting; | |
8d08fdba MS |
690 | else if (!strcmp (p, "return-type")) |
691 | warn_return_type = setting; | |
692 | else if (!strcmp (p, "ctor-dtor-privacy")) | |
693 | warn_ctor_dtor_privacy = setting; | |
694 | else if (!strcmp (p, "write-strings")) | |
695 | warn_write_strings = setting; | |
696 | else if (!strcmp (p, "cast-qual")) | |
697 | warn_cast_qual = setting; | |
8d08fdba MS |
698 | else if (!strcmp (p, "char-subscripts")) |
699 | warn_char_subscripts = setting; | |
700 | else if (!strcmp (p, "pointer-arith")) | |
701 | warn_pointer_arith = setting; | |
8d08fdba MS |
702 | else if (!strcmp (p, "missing-prototypes")) |
703 | warn_missing_prototypes = setting; | |
704 | else if (!strcmp (p, "redundant-decls")) | |
705 | warn_redundant_decls = setting; | |
706 | else if (!strcmp (p, "missing-braces")) | |
707 | warn_missing_braces = setting; | |
2ee887f2 MS |
708 | else if (!strcmp (p, "sign-compare")) |
709 | warn_sign_compare = setting; | |
1bdba2c0 DZ |
710 | else if (!strcmp (p, "float-equal")) |
711 | warn_float_equal = setting; | |
8d08fdba MS |
712 | else if (!strcmp (p, "format")) |
713 | warn_format = setting; | |
714 | else if (!strcmp (p, "conversion")) | |
715 | warn_conversion = setting; | |
716 | else if (!strcmp (p, "parentheses")) | |
717 | warn_parentheses = setting; | |
21474714 MS |
718 | else if (!strcmp (p, "non-virtual-dtor")) |
719 | warn_nonvdtor = setting; | |
8d08fdba MS |
720 | else if (!strcmp (p, "extern-inline")) |
721 | warn_extern_inline = setting; | |
f376e137 MS |
722 | else if (!strcmp (p, "reorder")) |
723 | warn_reorder = setting; | |
724 | else if (!strcmp (p, "synth")) | |
725 | warn_synth = setting; | |
9a3b49ac MS |
726 | else if (!strcmp (p, "pmf-conversions")) |
727 | warn_pmf2ptr = setting; | |
eb448459 MS |
728 | else if (!strcmp (p, "effc++")) |
729 | warn_ecpp = setting; | |
da20811c JM |
730 | else if (!strcmp (p, "sign-promo")) |
731 | warn_sign_promo = setting; | |
0c4b14c4 JM |
732 | else if (!strcmp (p, "old-style-cast")) |
733 | warn_old_style_cast = setting; | |
dc8263bc JM |
734 | else if (!strcmp (p, "overloaded-virtual")) |
735 | warn_overloaded_virtual = setting; | |
736 | else if (!strcmp (p, "multichar")) | |
737 | warn_multichar = setting; | |
f9fc59e8 NC |
738 | else if (!strcmp (p, "unknown-pragmas")) |
739 | /* Set to greater than 1, so that even unknown pragmas in | |
740 | system headers will be warned about. */ | |
741 | warn_unknown_pragmas = setting * 2; | |
7f84cec9 BK |
742 | else if (!strcmp (p, "non-template-friend")) |
743 | warn_nontemplate_friend = setting; | |
2de45c06 ML |
744 | else if (!strcmp (p, "deprecated")) |
745 | warn_deprecated = setting; | |
8d08fdba MS |
746 | else if (!strcmp (p, "comment")) |
747 | ; /* cpp handles this one. */ | |
748 | else if (!strcmp (p, "comments")) | |
749 | ; /* cpp handles this one. */ | |
750 | else if (!strcmp (p, "trigraphs")) | |
751 | ; /* cpp handles this one. */ | |
752 | else if (!strcmp (p, "import")) | |
753 | ; /* cpp handles this one. */ | |
754 | else if (!strcmp (p, "all")) | |
755 | { | |
8d08fdba MS |
756 | warn_return_type = setting; |
757 | warn_unused = setting; | |
758 | warn_implicit = setting; | |
8d08fdba MS |
759 | warn_switch = setting; |
760 | warn_format = setting; | |
e1cd6e56 | 761 | warn_parentheses = setting; |
8d08fdba | 762 | warn_missing_braces = setting; |
2ee887f2 | 763 | warn_sign_compare = setting; |
dc8263bc | 764 | warn_multichar = setting; |
8d08fdba MS |
765 | /* We save the value of warn_uninitialized, since if they put |
766 | -Wuninitialized on the command line, we need to generate a | |
767 | warning about not using it without also specifying -O. */ | |
768 | if (warn_uninitialized != 1) | |
769 | warn_uninitialized = (setting ? 2 : 0); | |
f9fc59e8 NC |
770 | /* Only warn about unknown pragmas that are not in system |
771 | headers. */ | |
7f84cec9 | 772 | warn_unknown_pragmas = 1; |
9af3a23b JM |
773 | |
774 | /* C++-specific warnings. */ | |
775 | warn_ctor_dtor_privacy = setting; | |
776 | warn_nonvdtor = setting; | |
777 | warn_reorder = setting; | |
7f84cec9 | 778 | warn_nontemplate_friend = setting; |
8d08fdba | 779 | } |
297441fd | 780 | else return strings_processed; |
8d08fdba MS |
781 | } |
782 | else if (!strcmp (p, "-ansi")) | |
4f6140be | 783 | flag_no_nonansi_builtin = 1, flag_ansi = 1, |
e1cd6e56 | 784 | flag_no_gnu_keywords = 1, flag_operator_names = 1; |
8d08fdba MS |
785 | #ifdef SPEW_DEBUG |
786 | /* Undocumented, only ever used when you're invoking cc1plus by hand, since | |
787 | it's probably safe to assume no sane person would ever want to use this | |
788 | under normal circumstances. */ | |
789 | else if (!strcmp (p, "-spew-debug")) | |
790 | spew_debug = 1; | |
791 | #endif | |
792 | else | |
297441fd | 793 | return strings_processed; |
8d08fdba MS |
794 | |
795 | return 1; | |
796 | } | |
797 | \f | |
798 | /* Incorporate `const' and `volatile' qualifiers for member functions. | |
799 | FUNCTION is a TYPE_DECL or a FUNCTION_DECL. | |
535233a8 NS |
800 | QUALS is a list of qualifiers. Returns any explicit |
801 | top-level qualifiers of the method's this pointer, anything other than | |
802 | TYPE_UNQUALIFIED will be an extension. */ | |
e92cc029 | 803 | |
535233a8 | 804 | int |
8d08fdba MS |
805 | grok_method_quals (ctype, function, quals) |
806 | tree ctype, function, quals; | |
807 | { | |
808 | tree fntype = TREE_TYPE (function); | |
809 | tree raises = TYPE_RAISES_EXCEPTIONS (fntype); | |
91063b51 MM |
810 | int type_quals = TYPE_UNQUALIFIED; |
811 | int dup_quals = TYPE_UNQUALIFIED; | |
535233a8 | 812 | int this_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
813 | |
814 | do | |
815 | { | |
91063b51 MM |
816 | int tq = cp_type_qual_from_rid (TREE_VALUE (quals)); |
817 | ||
535233a8 | 818 | if ((type_quals | this_quals) & tq) |
91063b51 | 819 | dup_quals |= tq; |
535233a8 NS |
820 | else if (tq & TYPE_QUAL_RESTRICT) |
821 | this_quals |= tq; | |
8d08fdba | 822 | else |
91063b51 | 823 | type_quals |= tq; |
8d08fdba | 824 | quals = TREE_CHAIN (quals); |
91063b51 | 825 | } |
8d08fdba | 826 | while (quals); |
91063b51 MM |
827 | |
828 | if (dup_quals != TYPE_UNQUALIFIED) | |
829 | cp_error ("duplicate type qualifiers in %s declaration", | |
830 | TREE_CODE (function) == FUNCTION_DECL | |
831 | ? "member function" : "type"); | |
832 | ||
833 | ctype = cp_build_qualified_type (ctype, type_quals); | |
8d08fdba MS |
834 | fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype), |
835 | (TREE_CODE (fntype) == METHOD_TYPE | |
836 | ? TREE_CHAIN (TYPE_ARG_TYPES (fntype)) | |
837 | : TYPE_ARG_TYPES (fntype))); | |
838 | if (raises) | |
f30432d7 | 839 | fntype = build_exception_variant (fntype, raises); |
8d08fdba MS |
840 | |
841 | TREE_TYPE (function) = fntype; | |
535233a8 | 842 | return this_quals; |
8d08fdba MS |
843 | } |
844 | ||
8d08fdba MS |
845 | /* Warn when -fexternal-templates is used and #pragma |
846 | interface/implementation is not used all the times it should be, | |
847 | inform the user. */ | |
e92cc029 | 848 | |
8d08fdba | 849 | void |
8ccc31eb MS |
850 | warn_if_unknown_interface (decl) |
851 | tree decl; | |
8d08fdba MS |
852 | { |
853 | static int already_warned = 0; | |
8ccc31eb MS |
854 | if (already_warned++) |
855 | return; | |
856 | ||
857 | if (flag_alt_external_templates) | |
858 | { | |
859 | struct tinst_level *til = tinst_for_decl (); | |
860 | int sl = lineno; | |
861 | char *sf = input_filename; | |
862 | ||
f30432d7 MS |
863 | if (til) |
864 | { | |
865 | lineno = til->line; | |
866 | input_filename = til->file; | |
867 | } | |
8251199e | 868 | cp_warning ("template `%#D' instantiated in file without #pragma interface", |
8ccc31eb MS |
869 | decl); |
870 | lineno = sl; | |
871 | input_filename = sf; | |
872 | } | |
873 | else | |
8251199e | 874 | cp_warning_at ("template `%#D' defined in file without #pragma interface", |
8ccc31eb | 875 | decl); |
8d08fdba MS |
876 | } |
877 | ||
878 | /* A subroutine of the parser, to handle a component list. */ | |
e92cc029 | 879 | |
61a127b3 MM |
880 | void |
881 | grok_x_components (specs) | |
882 | tree specs; | |
8d08fdba | 883 | { |
61a127b3 MM |
884 | struct pending_inline **p; |
885 | tree t; | |
8d08fdba | 886 | |
72a93143 JM |
887 | specs = strip_attrs (specs); |
888 | ||
889 | check_tag_decl (specs); | |
890 | t = groktypename (build_decl_list (specs, NULL_TREE)); | |
36a117a5 | 891 | |
61a127b3 MM |
892 | /* The only case where we need to do anything additional here is an |
893 | anonymous union field, e.g.: `struct S { union { int i; }; };'. */ | |
6bdb8141 | 894 | if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t)) |
61a127b3 | 895 | return; |
8d08fdba | 896 | |
6bdb8141 | 897 | fixup_anonymous_aggr (t); |
4ce3d537 | 898 | finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t)); |
61a127b3 MM |
899 | |
900 | /* Ignore any inline function definitions in the anonymous union | |
901 | since an anonymous union may not have function members. */ | |
902 | p = &pending_inlines; | |
903 | for (; *p; *p = (*p)->next) | |
904 | if (DECL_CONTEXT ((*p)->fndecl) != t) | |
905 | break; | |
8d08fdba MS |
906 | } |
907 | ||
711734a9 JM |
908 | /* Constructors for types with virtual baseclasses need an "in-charge" flag |
909 | saying whether this constructor is responsible for initialization of | |
910 | virtual baseclasses or not. All destructors also need this "in-charge" | |
911 | flag, which additionally determines whether or not the destructor should | |
912 | free the memory for the object. | |
913 | ||
914 | This function adds the "in-charge" flag to member function FN if | |
915 | appropriate. It is called from grokclassfn and tsubst. | |
916 | FN must be either a constructor or destructor. */ | |
917 | ||
918 | void | |
919 | maybe_retrofit_in_chrg (fn) | |
920 | tree fn; | |
921 | { | |
922 | tree basetype, arg_types, parms, parm, fntype; | |
923 | ||
924 | if (DECL_CONSTRUCTOR_P (fn) | |
4f1c5b7d | 925 | && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)) |
711734a9 JM |
926 | && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn)) |
927 | /* OK */; | |
928 | else if (! DECL_CONSTRUCTOR_P (fn) | |
929 | && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE) | |
930 | /* OK */; | |
931 | else | |
932 | return; | |
933 | ||
934 | if (DECL_CONSTRUCTOR_P (fn)) | |
935 | DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1; | |
936 | ||
937 | /* First add it to DECL_ARGUMENTS... */ | |
938 | parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node); | |
939 | /* Mark the artificial `__in_chrg' parameter as "artificial". */ | |
940 | SET_DECL_ARTIFICIAL (parm); | |
941 | DECL_ARG_TYPE (parm) = integer_type_node; | |
942 | TREE_READONLY (parm) = 1; | |
943 | parms = DECL_ARGUMENTS (fn); | |
944 | TREE_CHAIN (parm) = TREE_CHAIN (parms); | |
945 | TREE_CHAIN (parms) = parm; | |
946 | ||
947 | /* ...and then to TYPE_ARG_TYPES. */ | |
948 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
949 | basetype = TREE_TYPE (TREE_VALUE (arg_types)); | |
950 | arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types)); | |
951 | fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)), | |
952 | arg_types); | |
953 | if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))) | |
954 | fntype = build_exception_variant (fntype, | |
955 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))); | |
956 | TREE_TYPE (fn) = fntype; | |
957 | } | |
958 | ||
8d08fdba MS |
959 | /* Classes overload their constituent function names automatically. |
960 | When a function name is declared in a record structure, | |
961 | its name is changed to it overloaded name. Since names for | |
962 | constructors and destructors can conflict, we place a leading | |
963 | '$' for destructors. | |
964 | ||
965 | CNAME is the name of the class we are grokking for. | |
966 | ||
967 | FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'. | |
968 | ||
969 | FLAGS contains bits saying what's special about today's | |
970 | arguments. 1 == DESTRUCTOR. 2 == OPERATOR. | |
971 | ||
972 | If FUNCTION is a destructor, then we must add the `auto-delete' field | |
973 | as a second parameter. There is some hair associated with the fact | |
974 | that we must "declare" this variable in the manner consistent with the | |
975 | way the rest of the arguments were declared. | |
976 | ||
977 | QUALS are the qualifiers for the this pointer. */ | |
978 | ||
979 | void | |
b370501f KG |
980 | grokclassfn (ctype, function, flags, quals) |
981 | tree ctype, function; | |
8d08fdba MS |
982 | enum overload_flags flags; |
983 | tree quals; | |
984 | { | |
985 | tree fn_name = DECL_NAME (function); | |
535233a8 | 986 | int this_quals = TYPE_UNQUALIFIED; |
8d08fdba MS |
987 | |
988 | if (fn_name == NULL_TREE) | |
989 | { | |
8251199e | 990 | error ("name missing for member function"); |
8d08fdba MS |
991 | fn_name = get_identifier ("<anonymous>"); |
992 | DECL_NAME (function) = fn_name; | |
993 | } | |
994 | ||
995 | if (quals) | |
535233a8 | 996 | this_quals = grok_method_quals (ctype, function, quals); |
8d08fdba | 997 | |
8d08fdba MS |
998 | if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE) |
999 | { | |
1000 | /* Must add the class instance variable up front. */ | |
1001 | /* Right now we just make this a pointer. But later | |
1002 | we may wish to make it special. */ | |
535233a8 | 1003 | tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function))); |
2986ae00 | 1004 | |
535233a8 NS |
1005 | tree parm = build_decl (PARM_DECL, this_identifier, |
1006 | cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST)); | |
8d08fdba | 1007 | /* Mark the artificial `this' parameter as "artificial". */ |
700f8a87 | 1008 | SET_DECL_ARTIFICIAL (parm); |
8d08fdba MS |
1009 | DECL_ARG_TYPE (parm) = type; |
1010 | /* We can make this a register, so long as we don't | |
1011 | accidentally complain if someone tries to take its address. */ | |
1012 | DECL_REGISTER (parm) = 1; | |
8d08fdba MS |
1013 | TREE_CHAIN (parm) = last_function_parms; |
1014 | last_function_parms = parm; | |
1015 | } | |
1016 | ||
711734a9 | 1017 | DECL_ARGUMENTS (function) = last_function_parms; |
711734a9 | 1018 | DECL_CONTEXT (function) = ctype; |
711734a9 JM |
1019 | |
1020 | if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function)) | |
535233a8 | 1021 | maybe_retrofit_in_chrg (function); |
711734a9 | 1022 | |
8d08fdba MS |
1023 | if (flags == DTOR_FLAG) |
1024 | { | |
711734a9 | 1025 | DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype); |
8d08fdba MS |
1026 | TYPE_HAS_DESTRUCTOR (ctype) = 1; |
1027 | } | |
1028 | else | |
36a117a5 | 1029 | set_mangled_name_for_decl (function); |
8d08fdba MS |
1030 | } |
1031 | ||
1032 | /* Work on the expr used by alignof (this is only called by the parser). */ | |
e92cc029 | 1033 | |
8d08fdba MS |
1034 | tree |
1035 | grok_alignof (expr) | |
1036 | tree expr; | |
1037 | { | |
1038 | tree best, t; | |
1039 | int bestalign; | |
1040 | ||
abff8e06 JM |
1041 | if (processing_template_decl) |
1042 | return build_min (ALIGNOF_EXPR, sizetype, expr); | |
1043 | ||
8d08fdba | 1044 | if (TREE_CODE (expr) == COMPONENT_REF |
162bc98d | 1045 | && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1))) |
8251199e | 1046 | error ("`__alignof__' applied to a bit-field"); |
8d08fdba MS |
1047 | |
1048 | if (TREE_CODE (expr) == INDIRECT_REF) | |
1049 | { | |
1050 | best = t = TREE_OPERAND (expr, 0); | |
1051 | bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
1052 | ||
1053 | while (TREE_CODE (t) == NOP_EXPR | |
1054 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE) | |
1055 | { | |
1056 | int thisalign; | |
1057 | t = TREE_OPERAND (t, 0); | |
1058 | thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t))); | |
1059 | if (thisalign > bestalign) | |
1060 | best = t, bestalign = thisalign; | |
1061 | } | |
1062 | return c_alignof (TREE_TYPE (TREE_TYPE (best))); | |
1063 | } | |
1064 | else | |
ce7695e0 | 1065 | return c_alignof (TREE_TYPE (expr)); |
8d08fdba MS |
1066 | } |
1067 | ||
1068 | /* Create an ARRAY_REF, checking for the user doing things backwards | |
1069 | along the way. */ | |
e92cc029 | 1070 | |
8d08fdba MS |
1071 | tree |
1072 | grok_array_decl (array_expr, index_exp) | |
1073 | tree array_expr, index_exp; | |
1074 | { | |
1075 | tree type = TREE_TYPE (array_expr); | |
b7484fbe | 1076 | tree p1, p2, i1, i2; |
8d08fdba MS |
1077 | |
1078 | if (type == error_mark_node || index_exp == error_mark_node) | |
1079 | return error_mark_node; | |
5156628f | 1080 | if (processing_template_decl) |
5566b478 MS |
1081 | return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE, |
1082 | array_expr, index_exp); | |
1083 | ||
8d08fdba MS |
1084 | if (type == NULL_TREE) |
1085 | { | |
1086 | /* Something has gone very wrong. Assume we are mistakenly reducing | |
1087 | an expression instead of a declaration. */ | |
8251199e | 1088 | error ("parser may be lost: is there a '{' missing somewhere?"); |
8d08fdba MS |
1089 | return NULL_TREE; |
1090 | } | |
1091 | ||
1092 | if (TREE_CODE (type) == OFFSET_TYPE | |
1093 | || TREE_CODE (type) == REFERENCE_TYPE) | |
1094 | type = TREE_TYPE (type); | |
1095 | ||
1096 | /* If they have an `operator[]', use that. */ | |
3c215895 | 1097 | if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp))) |
8d08fdba | 1098 | return build_opfncall (ARRAY_REF, LOOKUP_NORMAL, |
00595019 | 1099 | array_expr, index_exp, NULL_TREE); |
8d08fdba | 1100 | |
03d0f4af MM |
1101 | /* Otherwise, create an ARRAY_REF for a pointer or array type. It |
1102 | is a little-known fact that, if `a' is an array and `i' is an | |
1103 | int, you can write `i[a]', which means the same thing as `a[i]'. */ | |
8d08fdba | 1104 | |
b7484fbe MS |
1105 | if (TREE_CODE (type) == ARRAY_TYPE) |
1106 | p1 = array_expr; | |
1107 | else | |
1108 | p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0); | |
8d08fdba | 1109 | |
b7484fbe MS |
1110 | if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE) |
1111 | p2 = index_exp; | |
1112 | else | |
1113 | p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0); | |
8d08fdba | 1114 | |
b7484fbe MS |
1115 | i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0); |
1116 | i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0); | |
8d08fdba | 1117 | |
b7484fbe | 1118 | if ((p1 && i2) && (i1 && p2)) |
8251199e | 1119 | error ("ambiguous conversion for array subscript"); |
8d08fdba | 1120 | |
b7484fbe MS |
1121 | if (p1 && i2) |
1122 | array_expr = p1, index_exp = i2; | |
1123 | else if (i1 && p2) | |
1124 | array_expr = p2, index_exp = i1; | |
1125 | else | |
1126 | { | |
8251199e | 1127 | cp_error ("invalid types `%T[%T]' for array subscript", |
b7484fbe MS |
1128 | type, TREE_TYPE (index_exp)); |
1129 | return error_mark_node; | |
1130 | } | |
1131 | ||
1132 | if (array_expr == error_mark_node || index_exp == error_mark_node) | |
8251199e | 1133 | error ("ambiguous conversion for array subscript"); |
b7484fbe MS |
1134 | |
1135 | return build_array_ref (array_expr, index_exp); | |
8d08fdba MS |
1136 | } |
1137 | ||
1138 | /* Given the cast expression EXP, checking out its validity. Either return | |
1139 | an error_mark_node if there was an unavoidable error, return a cast to | |
1140 | void for trying to delete a pointer w/ the value 0, or return the | |
1141 | call to delete. If DOING_VEC is 1, we handle things differently | |
1142 | for doing an array delete. If DOING_VEC is 2, they gave us the | |
1143 | array size as an argument to delete. | |
1144 | Implements ARM $5.3.4. This is called from the parser. */ | |
e92cc029 | 1145 | |
8d08fdba MS |
1146 | tree |
1147 | delete_sanity (exp, size, doing_vec, use_global_delete) | |
1148 | tree exp, size; | |
1149 | int doing_vec, use_global_delete; | |
1150 | { | |
02020185 | 1151 | tree t, type; |
8d08fdba MS |
1152 | /* For a regular vector delete (aka, no size argument) we will pass |
1153 | this down as a NULL_TREE into build_vec_delete. */ | |
1154 | tree maxindex = NULL_TREE; | |
5566b478 | 1155 | |
909e536a MS |
1156 | if (exp == error_mark_node) |
1157 | return exp; | |
1158 | ||
5156628f | 1159 | if (processing_template_decl) |
5566b478 MS |
1160 | { |
1161 | t = build_min (DELETE_EXPR, void_type_node, exp, size); | |
1162 | DELETE_EXPR_USE_GLOBAL (t) = use_global_delete; | |
1163 | DELETE_EXPR_USE_VEC (t) = doing_vec; | |
1164 | return t; | |
1165 | } | |
1166 | ||
02020185 JM |
1167 | if (TREE_CODE (exp) == OFFSET_REF) |
1168 | exp = resolve_offset_ref (exp); | |
1169 | exp = convert_from_reference (exp); | |
1170 | t = stabilize_reference (exp); | |
1171 | t = build_expr_type_conversion (WANT_POINTER, t, 1); | |
8d08fdba | 1172 | |
02020185 | 1173 | if (t == NULL_TREE || t == error_mark_node) |
8d08fdba | 1174 | { |
8251199e | 1175 | cp_error ("type `%#T' argument given to `delete', expected pointer", |
02020185 JM |
1176 | TREE_TYPE (exp)); |
1177 | return error_mark_node; | |
8d08fdba MS |
1178 | } |
1179 | ||
02020185 | 1180 | if (doing_vec == 2) |
8d08fdba | 1181 | { |
337c90cc | 1182 | maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node); |
8251199e | 1183 | pedwarn ("anachronistic use of array size in vector delete"); |
8d08fdba MS |
1184 | } |
1185 | ||
02020185 JM |
1186 | type = TREE_TYPE (t); |
1187 | ||
1188 | /* As of Valley Forge, you can delete a pointer to const. */ | |
1189 | ||
1190 | /* You can't delete functions. */ | |
1191 | if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
8926095f | 1192 | { |
cb9a3ff8 | 1193 | error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'"); |
02020185 | 1194 | return error_mark_node; |
8926095f | 1195 | } |
02020185 | 1196 | |
7f477e81 NS |
1197 | /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */ |
1198 | if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE) | |
1199 | cp_warning ("`%T' is not a pointer-to-object type", type); | |
1200 | ||
02020185 JM |
1201 | /* An array can't have been allocated by new, so complain. */ |
1202 | if (TREE_CODE (t) == ADDR_EXPR | |
1203 | && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL | |
1204 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE) | |
8251199e | 1205 | cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0)); |
02020185 JM |
1206 | |
1207 | /* Deleting a pointer with the value zero is valid and has no effect. */ | |
1208 | if (integer_zerop (t)) | |
1209 | return build1 (NOP_EXPR, void_type_node, t); | |
8d08fdba MS |
1210 | |
1211 | if (doing_vec) | |
c7edeea3 | 1212 | return build_vec_delete (t, maxindex, integer_one_node, use_global_delete); |
8d08fdba | 1213 | else |
863adfc0 MS |
1214 | { |
1215 | if (IS_AGGR_TYPE (TREE_TYPE (type)) | |
1216 | && TYPE_GETS_REG_DELETE (TREE_TYPE (type))) | |
1217 | { | |
1218 | /* Only do access checking here; we'll be calling op delete | |
1219 | from the destructor. */ | |
519ebd1e JM |
1220 | tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node, |
1221 | LOOKUP_NORMAL, NULL_TREE); | |
863adfc0 MS |
1222 | if (tmp == error_mark_node) |
1223 | return error_mark_node; | |
1224 | } | |
1225 | ||
1226 | return build_delete (type, t, integer_three_node, | |
bd6dd845 | 1227 | LOOKUP_NORMAL, use_global_delete); |
863adfc0 | 1228 | } |
8d08fdba MS |
1229 | } |
1230 | ||
98c1c668 JM |
1231 | /* Report an error if the indicated template declaration is not the |
1232 | sort of thing that should be a member template. */ | |
1233 | ||
1234 | void | |
1235 | check_member_template (tmpl) | |
1236 | tree tmpl; | |
1237 | { | |
1238 | tree decl; | |
1239 | ||
1240 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
1241 | decl = DECL_TEMPLATE_RESULT (tmpl); | |
1242 | ||
1701f21e MM |
1243 | if (TREE_CODE (decl) == FUNCTION_DECL |
1244 | || (TREE_CODE (decl) == TYPE_DECL | |
1245 | && IS_AGGR_TYPE (TREE_TYPE (decl)))) | |
98c1c668 JM |
1246 | { |
1247 | if (current_function_decl) | |
1248 | /* 14.5.2.2 [temp.mem] | |
1249 | ||
1250 | A local class shall not have member templates. */ | |
cb9a3ff8 | 1251 | cp_error ("invalid declaration of member template `%#D' in local class", |
98c1c668 JM |
1252 | decl); |
1253 | ||
1701f21e | 1254 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl)) |
98c1c668 JM |
1255 | { |
1256 | /* 14.5.2.3 [temp.mem] | |
1257 | ||
1258 | A member function template shall not be virtual. */ | |
8251199e JM |
1259 | cp_error |
1260 | ("invalid use of `virtual' in template declaration of `%#D'", | |
98c1c668 JM |
1261 | decl); |
1262 | DECL_VIRTUAL_P (decl) = 0; | |
1263 | } | |
1264 | ||
1265 | /* The debug-information generating code doesn't know what to do | |
1266 | with member templates. */ | |
1267 | DECL_IGNORED_P (tmpl) = 1; | |
1268 | } | |
98c1c668 | 1269 | else |
8251199e | 1270 | cp_error ("template declaration of `%#D'", decl); |
98c1c668 JM |
1271 | } |
1272 | ||
eff71ab0 PB |
1273 | /* Return true iff TYPE is a valid Java parameter or return type. */ |
1274 | ||
d8e178a0 | 1275 | static int |
eff71ab0 PB |
1276 | acceptable_java_type (type) |
1277 | tree type; | |
1278 | { | |
1279 | if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type)) | |
1280 | return 1; | |
1281 | if (TREE_CODE (type) == POINTER_TYPE) | |
1282 | { | |
1283 | type = TREE_TYPE (type); | |
1284 | if (TREE_CODE (type) == RECORD_TYPE) | |
1285 | { | |
824f42ab PB |
1286 | tree args; int i; |
1287 | if (! TYPE_FOR_JAVA (type)) | |
1288 | return 0; | |
1289 | if (! CLASSTYPE_TEMPLATE_INFO (type)) | |
1290 | return 1; | |
1291 | args = CLASSTYPE_TI_ARGS (type); | |
1292 | i = TREE_VEC_LENGTH (args); | |
1293 | while (--i >= 0) | |
1294 | { | |
1295 | type = TREE_VEC_ELT (args, i); | |
1296 | if (TREE_CODE (type) == POINTER_TYPE) | |
1297 | type = TREE_TYPE (type); | |
1298 | if (! TYPE_FOR_JAVA (type)) | |
1299 | return 0; | |
1300 | } | |
1301 | return 1; | |
eff71ab0 PB |
1302 | } |
1303 | } | |
1304 | return 0; | |
1305 | } | |
1306 | ||
1307 | /* For a METHOD in a Java class CTYPE, return 1 if | |
1308 | the parameter and return types are valid Java types. | |
1309 | Otherwise, print appropriate error messages, and return 0. */ | |
1310 | ||
1311 | int | |
b370501f KG |
1312 | check_java_method (method) |
1313 | tree method; | |
eff71ab0 PB |
1314 | { |
1315 | int jerr = 0; | |
1316 | tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method)); | |
1317 | tree ret_type = TREE_TYPE (TREE_TYPE (method)); | |
1318 | if (! acceptable_java_type (ret_type)) | |
1319 | { | |
8251199e | 1320 | cp_error ("Java method '%D' has non-Java return type `%T'", |
eff71ab0 PB |
1321 | method, ret_type); |
1322 | jerr++; | |
1323 | } | |
1324 | for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types)) | |
1325 | { | |
1326 | tree type = TREE_VALUE (arg_types); | |
1327 | if (! acceptable_java_type (type)) | |
1328 | { | |
8251199e | 1329 | cp_error ("Java method '%D' has non-Java parameter type `%T'", |
eff71ab0 PB |
1330 | method, type); |
1331 | jerr++; | |
1332 | } | |
1333 | } | |
1334 | return jerr ? 0 : 1; | |
1335 | } | |
1336 | ||
8d08fdba MS |
1337 | /* Sanity check: report error if this function FUNCTION is not |
1338 | really a member of the class (CTYPE) it is supposed to belong to. | |
1339 | CNAME is the same here as it is for grokclassfn above. */ | |
1340 | ||
f30432d7 | 1341 | tree |
5566b478 MS |
1342 | check_classfn (ctype, function) |
1343 | tree ctype, function; | |
8d08fdba MS |
1344 | { |
1345 | tree fn_name = DECL_NAME (function); | |
2c73f9f5 | 1346 | tree fndecl, fndecls; |
5566b478 | 1347 | tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype)); |
8d08fdba MS |
1348 | tree *methods = 0; |
1349 | tree *end = 0; | |
03017874 MM |
1350 | |
1351 | if (DECL_USE_TEMPLATE (function) | |
1352 | && is_member_template (DECL_TI_TEMPLATE (function))) | |
1353 | /* Since this is a specialization of a member template, | |
1354 | we're not going to find the declaration in the class. | |
1355 | For example, in: | |
1356 | ||
1357 | struct S { template <typename T> void f(T); }; | |
1358 | template <> void S::f(int); | |
1359 | ||
1360 | we're not going to find `S::f(int)', but there's no | |
1361 | reason we should, either. We let our callers know we didn't | |
1362 | find the method, but we don't complain. */ | |
1363 | return NULL_TREE; | |
1364 | ||
8d08fdba MS |
1365 | if (method_vec != 0) |
1366 | { | |
1367 | methods = &TREE_VEC_ELT (method_vec, 0); | |
1368 | end = TREE_VEC_END (method_vec); | |
1369 | ||
1370 | /* First suss out ctors and dtors. */ | |
2c73f9f5 | 1371 | if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods)) |
fc378698 MS |
1372 | && DECL_CONSTRUCTOR_P (function)) |
1373 | goto got_it; | |
2c73f9f5 | 1374 | if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods)) |
fc378698 | 1375 | && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))) |
8d08fdba MS |
1376 | goto got_it; |
1377 | ||
61a127b3 | 1378 | while (++methods != end && *methods) |
8d08fdba | 1379 | { |
98c1c668 | 1380 | fndecl = *methods; |
2c73f9f5 | 1381 | if (fn_name == DECL_NAME (OVL_CURRENT (*methods))) |
8d08fdba MS |
1382 | { |
1383 | got_it: | |
2c73f9f5 ML |
1384 | for (fndecls = *methods; fndecls != NULL_TREE; |
1385 | fndecls = OVL_NEXT (fndecls)) | |
8d08fdba | 1386 | { |
2c73f9f5 | 1387 | fndecl = OVL_CURRENT (fndecls); |
6b4b3deb MM |
1388 | /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or |
1389 | for a for member function of a template class, is | |
f84b4be9 | 1390 | not mangled, so the check below does not work |
6b4b3deb MM |
1391 | correctly in that case. Since mangled destructor |
1392 | names do not include the type of the arguments, | |
1393 | we can't use this short-cut for them, either. | |
1394 | (It's not legal to declare arguments for a | |
1395 | destructor, but some people try.) */ | |
1396 | if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)) | |
1397 | && (DECL_ASSEMBLER_NAME (function) | |
1398 | != DECL_NAME (function)) | |
1399 | && (DECL_ASSEMBLER_NAME (fndecl) | |
1400 | != DECL_NAME (fndecl)) | |
f84b4be9 JM |
1401 | && (DECL_ASSEMBLER_NAME (function) |
1402 | == DECL_ASSEMBLER_NAME (fndecl))) | |
f30432d7 | 1403 | return fndecl; |
f84b4be9 JM |
1404 | |
1405 | /* We cannot simply call decls_match because this | |
1406 | doesn't work for static member functions that are | |
1407 | pretending to be methods, and because the name | |
1408 | may have been changed by asm("new_name"). */ | |
8145f082 MS |
1409 | if (DECL_NAME (function) == DECL_NAME (fndecl)) |
1410 | { | |
1411 | tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
1412 | tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
1413 | ||
1414 | /* Get rid of the this parameter on functions that become | |
e92cc029 | 1415 | static. */ |
8145f082 MS |
1416 | if (DECL_STATIC_FUNCTION_P (fndecl) |
1417 | && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE) | |
1418 | p1 = TREE_CHAIN (p1); | |
1419 | ||
3bfdc719 MM |
1420 | if (same_type_p (TREE_TYPE (TREE_TYPE (function)), |
1421 | TREE_TYPE (TREE_TYPE (fndecl))) | |
91063b51 | 1422 | && compparms (p1, p2) |
386b8a85 JM |
1423 | && (DECL_TEMPLATE_SPECIALIZATION (function) |
1424 | == DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
1425 | && (!DECL_TEMPLATE_SPECIALIZATION (function) | |
1426 | || (DECL_TI_TEMPLATE (function) | |
1427 | == DECL_TI_TEMPLATE (fndecl)))) | |
5566b478 | 1428 | return fndecl; |
8145f082 | 1429 | } |
8d08fdba MS |
1430 | } |
1431 | break; /* loser */ | |
1432 | } | |
1433 | } | |
1434 | } | |
1435 | ||
61a127b3 | 1436 | if (methods != end && *methods) |
f30432d7 MS |
1437 | { |
1438 | tree fndecl = *methods; | |
8251199e | 1439 | cp_error ("prototype for `%#D' does not match any in class `%T'", |
f30432d7 | 1440 | function, ctype); |
8251199e | 1441 | cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is", |
2c73f9f5 ML |
1442 | OVL_CURRENT (fndecl)); |
1443 | while (fndecl = OVL_NEXT (fndecl), fndecl) | |
8251199e | 1444 | cp_error_at (" %#D", OVL_CURRENT(fndecl)); |
f30432d7 | 1445 | } |
8d08fdba MS |
1446 | else |
1447 | { | |
1448 | methods = 0; | |
ddaed37e JM |
1449 | if (TYPE_SIZE (ctype) == 0) |
1450 | incomplete_type_error (function, ctype); | |
1451 | else | |
1452 | cp_error ("no `%#D' member function declared in class `%T'", | |
1453 | function, ctype); | |
8d08fdba MS |
1454 | } |
1455 | ||
fc378698 | 1456 | /* If we did not find the method in the class, add it to avoid |
6b4b3deb MM |
1457 | spurious errors (unless the CTYPE is not yet defined, in which |
1458 | case we'll only confuse ourselves when the function is declared | |
1459 | properly within the class. */ | |
1460 | if (TYPE_SIZE (ctype)) | |
1461 | add_method (ctype, methods, function); | |
f30432d7 | 1462 | return NULL_TREE; |
8d08fdba MS |
1463 | } |
1464 | ||
fa8d6e85 MM |
1465 | /* We have just processed the DECL, which is a static data member. |
1466 | Its initializer, if present, is INIT. The ASMSPEC_TREE, if | |
1467 | present, is the assembly-language name for the data member. | |
cd9f6678 | 1468 | FLAGS is as for cp_finish_decl. */ |
fa8d6e85 MM |
1469 | |
1470 | void | |
cd9f6678 | 1471 | finish_static_data_member_decl (decl, init, asmspec_tree, flags) |
fa8d6e85 MM |
1472 | tree decl; |
1473 | tree init; | |
1474 | tree asmspec_tree; | |
fa8d6e85 MM |
1475 | int flags; |
1476 | { | |
9c0758dd | 1477 | const char *asmspec = 0; |
fa8d6e85 MM |
1478 | |
1479 | if (asmspec_tree) | |
1480 | asmspec = TREE_STRING_POINTER (asmspec_tree); | |
1481 | ||
1482 | my_friendly_assert (TREE_PUBLIC (decl), 0); | |
1483 | ||
1484 | /* We cannot call pushdecl here, because that would fill in the | |
1485 | decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do | |
1486 | the right thing, namely, to put this decl out straight away. */ | |
1487 | /* current_class_type can be NULL_TREE in case of error. */ | |
1488 | if (!asmspec && current_class_type) | |
1489 | { | |
1490 | DECL_INITIAL (decl) = error_mark_node; | |
1491 | DECL_ASSEMBLER_NAME (decl) | |
1492 | = build_static_name (current_class_type, DECL_NAME (decl)); | |
1493 | } | |
1494 | if (! processing_template_decl) | |
0aafb128 MM |
1495 | { |
1496 | if (!pending_statics) | |
1497 | VARRAY_TREE_INIT (pending_statics, 32, "pending_statics"); | |
2c0f17dc | 1498 | VARRAY_PUSH_TREE (pending_statics, decl); |
0aafb128 MM |
1499 | } |
1500 | ||
fa8d6e85 MM |
1501 | /* Static consts need not be initialized in the class definition. */ |
1502 | if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))) | |
1503 | { | |
1504 | static int explanation = 0; | |
1505 | ||
1506 | error ("initializer invalid for static member with constructor"); | |
1507 | if (explanation++ == 0) | |
1508 | error ("(you really want to initialize it separately)"); | |
1509 | init = 0; | |
1510 | } | |
1511 | /* Force the compiler to know when an uninitialized static const | |
1512 | member is being used. */ | |
1513 | if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0) | |
1514 | TREE_USED (decl) = 1; | |
1515 | DECL_INITIAL (decl) = init; | |
1516 | DECL_IN_AGGR_P (decl) = 1; | |
1517 | DECL_CONTEXT (decl) = current_class_type; | |
fa8d6e85 | 1518 | |
cd9f6678 | 1519 | cp_finish_decl (decl, init, asmspec_tree, flags); |
fa8d6e85 MM |
1520 | } |
1521 | ||
8d08fdba MS |
1522 | /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted) |
1523 | of a structure component, returning a FIELD_DECL node. | |
1524 | QUALS is a list of type qualifiers for this decl (such as for declaring | |
1525 | const member functions). | |
1526 | ||
1527 | This is done during the parsing of the struct declaration. | |
1528 | The FIELD_DECL nodes are chained together and the lot of them | |
1529 | are ultimately passed to `build_struct' to make the RECORD_TYPE node. | |
1530 | ||
1531 | C++: | |
1532 | ||
1533 | If class A defines that certain functions in class B are friends, then | |
1534 | the way I have set things up, it is B who is interested in permission | |
1535 | granted by A. However, it is in A's context that these declarations | |
1536 | are parsed. By returning a void_type_node, class A does not attempt | |
1537 | to incorporate the declarations of the friends within its structure. | |
1538 | ||
1539 | DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING | |
1540 | CHANGES TO CODE IN `start_method'. */ | |
1541 | ||
1542 | tree | |
c11b6f21 MS |
1543 | grokfield (declarator, declspecs, init, asmspec_tree, attrlist) |
1544 | tree declarator, declspecs, init, asmspec_tree, attrlist; | |
8d08fdba MS |
1545 | { |
1546 | register tree value; | |
9c0758dd | 1547 | const char *asmspec = 0; |
6060a796 | 1548 | int flags = LOOKUP_ONLYCONVERTING; |
8d08fdba MS |
1549 | |
1550 | /* Convert () initializers to = initializers. */ | |
1551 | if (init == NULL_TREE && declarator != NULL_TREE | |
1552 | && TREE_CODE (declarator) == CALL_EXPR | |
1553 | && TREE_OPERAND (declarator, 0) | |
1554 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE | |
1555 | || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF) | |
43f887f9 | 1556 | && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator))) |
8d08fdba MS |
1557 | { |
1558 | init = TREE_OPERAND (declarator, 1); | |
1559 | declarator = TREE_OPERAND (declarator, 0); | |
6060a796 | 1560 | flags = 0; |
8d08fdba MS |
1561 | } |
1562 | ||
cffa8729 | 1563 | if (declspecs == NULL_TREE |
7fcdf4c2 MS |
1564 | && TREE_CODE (declarator) == SCOPE_REF |
1565 | && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE) | |
cffa8729 MS |
1566 | { |
1567 | /* Access declaration */ | |
5566b478 MS |
1568 | if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0)))) |
1569 | ; | |
1570 | else if (TREE_COMPLEXITY (declarator) == current_class_depth) | |
b74a0560 | 1571 | pop_nested_class (); |
cffa8729 MS |
1572 | return do_class_using_decl (declarator); |
1573 | } | |
1574 | ||
8d08fdba MS |
1575 | if (init |
1576 | && TREE_CODE (init) == TREE_LIST | |
1577 | && TREE_VALUE (init) == error_mark_node | |
1578 | && TREE_CHAIN (init) == NULL_TREE) | |
cffa8729 | 1579 | init = NULL_TREE; |
8d08fdba | 1580 | |
419c6212 | 1581 | value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist); |
6c30752f | 1582 | if (! value || value == error_mark_node) |
3ddfb0e6 MM |
1583 | /* friend or constructor went bad. */ |
1584 | return value; | |
8d08fdba MS |
1585 | |
1586 | /* Pass friendly classes back. */ | |
1587 | if (TREE_CODE (value) == VOID_TYPE) | |
1588 | return void_type_node; | |
1589 | ||
1590 | if (DECL_NAME (value) != NULL_TREE | |
1591 | && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_' | |
1592 | && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr")) | |
8251199e | 1593 | cp_error ("member `%D' conflicts with virtual function table field name", |
3c215895 | 1594 | value); |
8d08fdba MS |
1595 | |
1596 | /* Stash away type declarations. */ | |
1597 | if (TREE_CODE (value) == TYPE_DECL) | |
1598 | { | |
1599 | DECL_NONLOCAL (value) = 1; | |
700f8a87 | 1600 | DECL_CONTEXT (value) = current_class_type; |
8145f082 | 1601 | |
61cd1234 MM |
1602 | /* Now that we've updated the context, we need to remangle the |
1603 | name for this TYPE_DECL. */ | |
1604 | DECL_ASSEMBLER_NAME (value) = DECL_NAME (value); | |
35fce3ce MM |
1605 | if (!uses_template_parms (value)) |
1606 | DECL_ASSEMBLER_NAME (value) = | |
1607 | get_identifier (build_overload_name (TREE_TYPE (value), 1, 1)); | |
61cd1234 | 1608 | |
9188c363 MM |
1609 | if (processing_template_decl) |
1610 | value = push_template_decl (value); | |
1611 | ||
8d08fdba MS |
1612 | return value; |
1613 | } | |
1614 | ||
8d08fdba MS |
1615 | if (DECL_IN_AGGR_P (value)) |
1616 | { | |
6b4b3deb MM |
1617 | cp_error ("`%D' is already defined in `%T'", value, |
1618 | DECL_CONTEXT (value)); | |
8d08fdba MS |
1619 | return void_type_node; |
1620 | } | |
1621 | ||
8d08fdba MS |
1622 | if (asmspec_tree) |
1623 | asmspec = TREE_STRING_POINTER (asmspec_tree); | |
1624 | ||
1625 | if (init) | |
1626 | { | |
6eabb241 | 1627 | if (TREE_CODE (value) == FUNCTION_DECL) |
8d08fdba MS |
1628 | { |
1629 | grok_function_init (value, init); | |
1630 | init = NULL_TREE; | |
1631 | } | |
5b605f68 | 1632 | else if (pedantic && TREE_CODE (value) != VAR_DECL) |
a0a33927 MS |
1633 | /* Already complained in grokdeclarator. */ |
1634 | init = NULL_TREE; | |
8d08fdba MS |
1635 | else |
1636 | { | |
a0a33927 MS |
1637 | /* We allow initializers to become parameters to base |
1638 | initializers. */ | |
8d08fdba MS |
1639 | if (TREE_CODE (init) == TREE_LIST) |
1640 | { | |
1641 | if (TREE_CHAIN (init) == NULL_TREE) | |
1642 | init = TREE_VALUE (init); | |
1643 | else | |
1644 | init = digest_init (TREE_TYPE (value), init, (tree *)0); | |
1645 | } | |
1646 | ||
1647 | if (TREE_CODE (init) == CONST_DECL) | |
1648 | init = DECL_INITIAL (init); | |
1649 | else if (TREE_READONLY_DECL_P (init)) | |
1650 | init = decl_constant_value (init); | |
1651 | else if (TREE_CODE (init) == CONSTRUCTOR) | |
1652 | init = digest_init (TREE_TYPE (value), init, (tree *)0); | |
8d08fdba MS |
1653 | if (init == error_mark_node) |
1654 | /* We must make this look different than `error_mark_node' | |
1655 | because `decl_const_value' would mis-interpret it | |
1656 | as only meaning that this VAR_DECL is defined. */ | |
1657 | init = build1 (NOP_EXPR, TREE_TYPE (value), init); | |
5156628f | 1658 | else if (processing_template_decl) |
5566b478 | 1659 | ; |
8d08fdba MS |
1660 | else if (! TREE_CONSTANT (init)) |
1661 | { | |
1662 | /* We can allow references to things that are effectively | |
1663 | static, since references are initialized with the address. */ | |
1664 | if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE | |
1665 | || (TREE_STATIC (init) == 0 | |
1666 | && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd' | |
1667 | || DECL_EXTERNAL (init) == 0))) | |
1668 | { | |
8251199e | 1669 | error ("field initializer is not constant"); |
8d08fdba MS |
1670 | init = error_mark_node; |
1671 | } | |
1672 | } | |
1673 | } | |
1674 | } | |
1675 | ||
5156628f | 1676 | if (processing_template_decl && ! current_function_decl |
5566b478 | 1677 | && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL)) |
3ac3d9ea | 1678 | value = push_template_decl (value); |
5566b478 | 1679 | |
45537677 MS |
1680 | if (attrlist) |
1681 | cplus_decl_attributes (value, TREE_PURPOSE (attrlist), | |
1682 | TREE_VALUE (attrlist)); | |
1683 | ||
8d08fdba MS |
1684 | if (TREE_CODE (value) == VAR_DECL) |
1685 | { | |
fa8d6e85 | 1686 | finish_static_data_member_decl (value, init, asmspec_tree, |
cd9f6678 | 1687 | flags); |
8d08fdba MS |
1688 | return value; |
1689 | } | |
1690 | if (TREE_CODE (value) == FIELD_DECL) | |
1691 | { | |
1692 | if (asmspec) | |
6060a796 MS |
1693 | { |
1694 | /* This must override the asm specifier which was placed | |
1695 | by grokclassfn. Lay this out fresh. */ | |
1696 | DECL_RTL (value) = NULL_RTX; | |
1697 | DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec); | |
1698 | } | |
8d08fdba MS |
1699 | if (DECL_INITIAL (value) == error_mark_node) |
1700 | init = error_mark_node; | |
cd9f6678 | 1701 | cp_finish_decl (value, init, asmspec_tree, flags); |
8d08fdba MS |
1702 | DECL_INITIAL (value) = init; |
1703 | DECL_IN_AGGR_P (value) = 1; | |
1704 | return value; | |
1705 | } | |
1706 | if (TREE_CODE (value) == FUNCTION_DECL) | |
1707 | { | |
6060a796 MS |
1708 | if (asmspec) |
1709 | { | |
1710 | /* This must override the asm specifier which was placed | |
1711 | by grokclassfn. Lay this out fresh. */ | |
1712 | DECL_RTL (value) = NULL_RTX; | |
1713 | DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec); | |
1714 | } | |
cd9f6678 | 1715 | cp_finish_decl (value, init, asmspec_tree, flags); |
8d08fdba MS |
1716 | |
1717 | /* Pass friends back this way. */ | |
1718 | if (DECL_FRIEND_P (value)) | |
1719 | return void_type_node; | |
1720 | ||
1721 | DECL_IN_AGGR_P (value) = 1; | |
1722 | return value; | |
1723 | } | |
1724 | my_friendly_abort (21); | |
1725 | /* NOTREACHED */ | |
1726 | return NULL_TREE; | |
1727 | } | |
1728 | ||
1729 | /* Like `grokfield', but for bitfields. | |
1730 | WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */ | |
1731 | ||
1732 | tree | |
1733 | grokbitfield (declarator, declspecs, width) | |
1734 | tree declarator, declspecs, width; | |
1735 | { | |
f30432d7 | 1736 | register tree value = grokdeclarator (declarator, declspecs, BITFIELD, |
c11b6f21 | 1737 | 0, NULL_TREE); |
8d08fdba MS |
1738 | |
1739 | if (! value) return NULL_TREE; /* friends went bad. */ | |
1740 | ||
1741 | /* Pass friendly classes back. */ | |
1742 | if (TREE_CODE (value) == VOID_TYPE) | |
1743 | return void_type_node; | |
1744 | ||
1745 | if (TREE_CODE (value) == TYPE_DECL) | |
1746 | { | |
8251199e | 1747 | cp_error ("cannot declare `%D' to be a bitfield type", value); |
8d08fdba MS |
1748 | return NULL_TREE; |
1749 | } | |
1750 | ||
ae58fa02 MM |
1751 | /* Usually, finish_struct_1 catches bitifields with invalid types. |
1752 | But, in the case of bitfields with function type, we confuse | |
1753 | ourselves into thinking they are member functions, so we must | |
1754 | check here. */ | |
1755 | if (TREE_CODE (value) == FUNCTION_DECL) | |
1756 | { | |
8251199e | 1757 | cp_error ("cannot declare bitfield `%D' with funcion type", |
ae58fa02 MM |
1758 | DECL_NAME (value)); |
1759 | return NULL_TREE; | |
1760 | } | |
1761 | ||
8d08fdba MS |
1762 | if (DECL_IN_AGGR_P (value)) |
1763 | { | |
8251199e | 1764 | cp_error ("`%D' is already defined in the class %T", value, |
8d08fdba MS |
1765 | DECL_CONTEXT (value)); |
1766 | return void_type_node; | |
1767 | } | |
1768 | ||
1769 | GNU_xref_member (current_class_name, value); | |
1770 | ||
1771 | if (TREE_STATIC (value)) | |
1772 | { | |
8251199e | 1773 | cp_error ("static member `%D' cannot be a bitfield", value); |
8d08fdba MS |
1774 | return NULL_TREE; |
1775 | } | |
cd9f6678 | 1776 | cp_finish_decl (value, NULL_TREE, NULL_TREE, 0); |
8d08fdba MS |
1777 | |
1778 | if (width != error_mark_node) | |
1779 | { | |
5566b478 MS |
1780 | constant_expression_warning (width); |
1781 | DECL_INITIAL (value) = width; | |
162bc98d | 1782 | SET_DECL_C_BIT_FIELD (value); |
8d08fdba MS |
1783 | } |
1784 | ||
1785 | DECL_IN_AGGR_P (value) = 1; | |
1786 | return value; | |
1787 | } | |
1788 | ||
8d08fdba | 1789 | tree |
51c184be MS |
1790 | grokoptypename (declspecs, declarator) |
1791 | tree declspecs, declarator; | |
8d08fdba | 1792 | { |
c11b6f21 | 1793 | tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE); |
51c184be | 1794 | return build_typename_overload (t); |
8d08fdba MS |
1795 | } |
1796 | ||
1797 | /* When a function is declared with an initializer, | |
1798 | do the right thing. Currently, there are two possibilities: | |
1799 | ||
1800 | class B | |
1801 | { | |
1802 | public: | |
1803 | // initialization possibility #1. | |
1804 | virtual void f () = 0; | |
1805 | int g (); | |
1806 | }; | |
1807 | ||
1808 | class D1 : B | |
1809 | { | |
1810 | public: | |
1811 | int d1; | |
1812 | // error, no f (); | |
1813 | }; | |
1814 | ||
1815 | class D2 : B | |
1816 | { | |
1817 | public: | |
1818 | int d2; | |
1819 | void f (); | |
1820 | }; | |
1821 | ||
1822 | class D3 : B | |
1823 | { | |
1824 | public: | |
1825 | int d3; | |
1826 | // initialization possibility #2 | |
1827 | void f () = B::f; | |
1828 | }; | |
1829 | ||
1830 | */ | |
1831 | ||
f0e01782 MS |
1832 | int |
1833 | copy_assignment_arg_p (parmtype, virtualp) | |
1834 | tree parmtype; | |
b370501f | 1835 | int virtualp ATTRIBUTE_UNUSED; |
f0e01782 | 1836 | { |
691c003d MS |
1837 | if (current_class_type == NULL_TREE) |
1838 | return 0; | |
1839 | ||
f0e01782 MS |
1840 | if (TREE_CODE (parmtype) == REFERENCE_TYPE) |
1841 | parmtype = TREE_TYPE (parmtype); | |
1842 | ||
1843 | if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type) | |
824b9a4c MS |
1844 | #if 0 |
1845 | /* Non-standard hack to support old Booch components. */ | |
1846 | || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type)) | |
1847 | #endif | |
1848 | ) | |
f0e01782 MS |
1849 | return 1; |
1850 | ||
1851 | return 0; | |
1852 | } | |
1853 | ||
8d08fdba MS |
1854 | static void |
1855 | grok_function_init (decl, init) | |
1856 | tree decl; | |
1857 | tree init; | |
1858 | { | |
1859 | /* An initializer for a function tells how this function should | |
1860 | be inherited. */ | |
1861 | tree type = TREE_TYPE (decl); | |
8d08fdba MS |
1862 | |
1863 | if (TREE_CODE (type) == FUNCTION_TYPE) | |
8251199e | 1864 | cp_error ("initializer specified for non-member function `%D'", decl); |
cffa8729 MS |
1865 | #if 0 |
1866 | /* We'll check for this in finish_struct_1. */ | |
8d08fdba | 1867 | else if (DECL_VINDEX (decl) == NULL_TREE) |
cb9a3ff8 | 1868 | cp_error ("initializer specified for non-virtual member function `%D'", decl); |
cffa8729 | 1869 | #endif |
8d08fdba MS |
1870 | else if (integer_zerop (init)) |
1871 | { | |
8926095f | 1872 | #if 0 |
8d08fdba MS |
1873 | /* Mark this function as being "defined". */ |
1874 | DECL_INITIAL (decl) = error_mark_node; | |
e92cc029 | 1875 | /* pure virtual destructors must be defined. */ |
8926095f MS |
1876 | /* pure virtual needs to be defined (as abort) only when put in |
1877 | vtbl. For wellformed call, it should be itself. pr4737 */ | |
8d08fdba MS |
1878 | if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl))) |
1879 | { | |
1880 | /* Give this node rtl from `abort'. */ | |
1881 | DECL_RTL (decl) = DECL_RTL (abort_fndecl); | |
1882 | } | |
8926095f | 1883 | #endif |
fee7654e | 1884 | DECL_PURE_VIRTUAL_P (decl) = 1; |
f0e01782 MS |
1885 | if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR]) |
1886 | { | |
1887 | tree parmtype | |
1888 | = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))); | |
1889 | ||
1890 | if (copy_assignment_arg_p (parmtype, 1)) | |
1891 | TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1; | |
1892 | } | |
8d08fdba | 1893 | } |
8d08fdba | 1894 | else |
8251199e | 1895 | cp_error ("invalid initializer for virtual method `%D'", decl); |
8d08fdba MS |
1896 | } |
1897 | \f | |
28cbf42c MS |
1898 | void |
1899 | cplus_decl_attributes (decl, attributes, prefix_attributes) | |
f6abb50a | 1900 | tree decl, attributes, prefix_attributes; |
8d08fdba | 1901 | { |
e8abc66f MS |
1902 | if (decl == NULL_TREE || decl == void_type_node) |
1903 | return; | |
1904 | ||
1905 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
1906 | decl = DECL_TEMPLATE_RESULT (decl); | |
1907 | ||
1908 | decl_attributes (decl, attributes, prefix_attributes); | |
863adfc0 MS |
1909 | |
1910 | if (TREE_CODE (decl) == TYPE_DECL) | |
1911 | SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl)); | |
8d08fdba MS |
1912 | } |
1913 | \f | |
1914 | /* CONSTRUCTOR_NAME: | |
1915 | Return the name for the constructor (or destructor) for the | |
1916 | specified class. Argument can be RECORD_TYPE, TYPE_DECL, or | |
1917 | IDENTIFIER_NODE. When given a template, this routine doesn't | |
1918 | lose the specialization. */ | |
e92cc029 | 1919 | |
8d08fdba MS |
1920 | tree |
1921 | constructor_name_full (thing) | |
1922 | tree thing; | |
1923 | { | |
73b0fce8 | 1924 | if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM |
97e7cbe4 JM |
1925 | || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM |
1926 | || TREE_CODE (thing) == TYPENAME_TYPE) | |
be99da77 MS |
1927 | thing = TYPE_NAME (thing); |
1928 | else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing))) | |
8d08fdba MS |
1929 | { |
1930 | if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing)) | |
42c7b807 | 1931 | thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0))); |
8d08fdba MS |
1932 | else |
1933 | thing = TYPE_NAME (thing); | |
1934 | } | |
1935 | if (TREE_CODE (thing) == TYPE_DECL | |
1936 | || (TREE_CODE (thing) == TEMPLATE_DECL | |
5566b478 | 1937 | && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL)) |
8d08fdba MS |
1938 | thing = DECL_NAME (thing); |
1939 | my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197); | |
1940 | return thing; | |
1941 | } | |
1942 | ||
1943 | /* CONSTRUCTOR_NAME: | |
1944 | Return the name for the constructor (or destructor) for the | |
1945 | specified class. Argument can be RECORD_TYPE, TYPE_DECL, or | |
1946 | IDENTIFIER_NODE. When given a template, return the plain | |
1947 | unspecialized name. */ | |
e92cc029 | 1948 | |
8d08fdba MS |
1949 | tree |
1950 | constructor_name (thing) | |
1951 | tree thing; | |
1952 | { | |
1953 | tree t; | |
1954 | thing = constructor_name_full (thing); | |
1955 | t = IDENTIFIER_TEMPLATE (thing); | |
1956 | if (!t) | |
1957 | return thing; | |
5566b478 | 1958 | return t; |
8d08fdba MS |
1959 | } |
1960 | \f | |
8d08fdba | 1961 | /* Record the existence of an addressable inline function. */ |
e92cc029 | 1962 | |
8d08fdba MS |
1963 | void |
1964 | mark_inline_for_output (decl) | |
1965 | tree decl; | |
1966 | { | |
6060a796 | 1967 | decl = DECL_MAIN_VARIANT (decl); |
8926095f MS |
1968 | if (DECL_SAVED_INLINE (decl)) |
1969 | return; | |
1970 | DECL_SAVED_INLINE (decl) = 1; | |
0aafb128 MM |
1971 | if (!saved_inlines) |
1972 | VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines"); | |
2c0f17dc MM |
1973 | |
1974 | VARRAY_PUSH_TREE (saved_inlines, decl); | |
8d08fdba MS |
1975 | } |
1976 | ||
8d08fdba MS |
1977 | /* Hand off a unique name which can be used for variable we don't really |
1978 | want to know about anyway, for example, the anonymous variables which | |
1979 | are needed to make references work. Declare this thing so we can use it. | |
1980 | The variable created will be of type TYPE. | |
1981 | ||
1982 | STATICP is nonzero if this variable should be static. */ | |
1983 | ||
1984 | tree | |
1985 | get_temp_name (type, staticp) | |
1986 | tree type; | |
1987 | int staticp; | |
1988 | { | |
1989 | char buf[sizeof (AUTO_TEMP_FORMAT) + 20]; | |
1990 | tree decl; | |
a9aedbc2 | 1991 | int toplev = toplevel_bindings_p (); |
8d08fdba | 1992 | |
8d08fdba MS |
1993 | if (toplev || staticp) |
1994 | { | |
8d08fdba MS |
1995 | sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++); |
1996 | decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type)); | |
1997 | } | |
1998 | else | |
1999 | { | |
2000 | sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++); | |
2001 | decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type)); | |
2002 | } | |
2003 | TREE_USED (decl) = 1; | |
2004 | TREE_STATIC (decl) = staticp; | |
fc378698 | 2005 | DECL_ARTIFICIAL (decl) = 1; |
8d08fdba MS |
2006 | |
2007 | /* If this is a local variable, then lay out its rtl now. | |
2008 | Otherwise, callers of this function are responsible for dealing | |
2009 | with this variable's rtl. */ | |
2010 | if (! toplev) | |
2011 | { | |
2012 | expand_decl (decl); | |
b7b8bcd2 MM |
2013 | my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE, |
2014 | 19990826); | |
8d08fdba | 2015 | } |
8d08fdba MS |
2016 | |
2017 | return decl; | |
2018 | } | |
2019 | ||
cb96daa2 MM |
2020 | /* Hunts through the global anonymous union ANON_DECL, building |
2021 | appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and | |
2022 | returns a VAR_DECL whose size is the same as the size of the | |
2023 | ANON_DECL, if one is available. */ | |
ce1b9eb9 | 2024 | |
e9659ab0 | 2025 | static tree |
cb96daa2 | 2026 | build_anon_union_vars (anon_decl, elems, static_p, external_p) |
ce1b9eb9 | 2027 | tree anon_decl; |
cb96daa2 MM |
2028 | tree* elems; |
2029 | int static_p; | |
2030 | int external_p; | |
ce1b9eb9 | 2031 | { |
cb96daa2 | 2032 | tree type = TREE_TYPE (anon_decl); |
ce1b9eb9 | 2033 | tree main_decl = NULL_TREE; |
cb96daa2 | 2034 | tree field; |
ce1b9eb9 | 2035 | |
6bdb8141 JM |
2036 | /* Rather than write the code to handle the non-union case, |
2037 | just give an error. */ | |
2038 | if (TREE_CODE (type) != UNION_TYPE) | |
2039 | error ("anonymous struct not inside named type"); | |
2040 | ||
cb96daa2 | 2041 | for (field = TYPE_FIELDS (type); |
ce1b9eb9 MM |
2042 | field != NULL_TREE; |
2043 | field = TREE_CHAIN (field)) | |
2044 | { | |
cb96daa2 | 2045 | tree decl; |
8ebeee52 JM |
2046 | |
2047 | if (DECL_ARTIFICIAL (field)) | |
ce1b9eb9 | 2048 | continue; |
8ebeee52 JM |
2049 | if (TREE_CODE (field) != FIELD_DECL) |
2050 | { | |
2051 | cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members", | |
2052 | field); | |
2053 | continue; | |
2054 | } | |
ce1b9eb9 | 2055 | |
cb96daa2 | 2056 | if (TREE_PRIVATE (field)) |
8251199e | 2057 | cp_pedwarn_at ("private member `%#D' in anonymous union", field); |
cb96daa2 | 2058 | else if (TREE_PROTECTED (field)) |
8251199e | 2059 | cp_pedwarn_at ("protected member `%#D' in anonymous union", field); |
cb96daa2 MM |
2060 | |
2061 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 2062 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
67ffc812 MM |
2063 | { |
2064 | decl = build_anon_union_vars (field, elems, static_p, external_p); | |
2065 | if (!decl) | |
2066 | continue; | |
2067 | } | |
18141e4c JM |
2068 | else if (DECL_NAME (field) == NULL_TREE) |
2069 | continue; | |
cb96daa2 MM |
2070 | else |
2071 | { | |
2072 | decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field)); | |
2073 | /* tell `pushdecl' that this is not tentative. */ | |
2074 | DECL_INITIAL (decl) = error_mark_node; | |
2075 | TREE_PUBLIC (decl) = 0; | |
2076 | TREE_STATIC (decl) = static_p; | |
2077 | DECL_EXTERNAL (decl) = external_p; | |
2078 | decl = pushdecl (decl); | |
2079 | DECL_INITIAL (decl) = NULL_TREE; | |
2080 | } | |
2081 | ||
ce1b9eb9 MM |
2082 | /* Only write out one anon union element--choose the one that |
2083 | can hold them all. */ | |
2084 | if (main_decl == NULL_TREE | |
cb96daa2 MM |
2085 | && simple_cst_equal (DECL_SIZE (decl), |
2086 | DECL_SIZE (anon_decl)) == 1) | |
2087 | main_decl = decl; | |
2088 | else | |
ce1b9eb9 MM |
2089 | /* ??? This causes there to be no debug info written out |
2090 | about this decl. */ | |
cb96daa2 MM |
2091 | TREE_ASM_WRITTEN (decl) = 1; |
2092 | ||
2093 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 2094 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
cb96daa2 MM |
2095 | /* The remainder of the processing was already done in the |
2096 | recursive call. */ | |
2097 | continue; | |
ce1b9eb9 | 2098 | |
cb96daa2 MM |
2099 | /* If there's a cleanup to do, it belongs in the |
2100 | TREE_PURPOSE of the following TREE_LIST. */ | |
e1b3e07d | 2101 | *elems = tree_cons (NULL_TREE, decl, *elems); |
cb96daa2 MM |
2102 | TREE_TYPE (*elems) = type; |
2103 | } | |
2104 | ||
ce1b9eb9 MM |
2105 | return main_decl; |
2106 | } | |
2107 | ||
8d08fdba MS |
2108 | /* Finish off the processing of a UNION_TYPE structure. |
2109 | If there are static members, then all members are | |
2110 | static, and must be laid out together. If the | |
2111 | union is an anonymous union, we arrange for that | |
2112 | as well. PUBLIC_P is nonzero if this union is | |
2113 | not declared static. */ | |
e92cc029 | 2114 | |
8d08fdba MS |
2115 | void |
2116 | finish_anon_union (anon_union_decl) | |
2117 | tree anon_union_decl; | |
2118 | { | |
2119 | tree type = TREE_TYPE (anon_union_decl); | |
cb96daa2 | 2120 | tree main_decl; |
8d08fdba MS |
2121 | int public_p = TREE_PUBLIC (anon_union_decl); |
2122 | int static_p = TREE_STATIC (anon_union_decl); | |
2123 | int external_p = DECL_EXTERNAL (anon_union_decl); | |
2124 | ||
cb96daa2 | 2125 | if (TYPE_FIELDS (type) == NULL_TREE) |
8d08fdba MS |
2126 | return; |
2127 | ||
2128 | if (public_p) | |
2129 | { | |
8251199e | 2130 | error ("global anonymous unions must be declared static"); |
8d08fdba MS |
2131 | return; |
2132 | } | |
2133 | ||
0fa5e05c MM |
2134 | main_decl = build_anon_union_vars (anon_union_decl, |
2135 | &DECL_ANON_UNION_ELEMS (anon_union_decl), | |
cb96daa2 | 2136 | static_p, external_p); |
ce1b9eb9 | 2137 | |
18141e4c JM |
2138 | if (main_decl == NULL_TREE) |
2139 | { | |
2140 | warning ("anonymous union with no members"); | |
2141 | return; | |
2142 | } | |
2143 | ||
8d08fdba MS |
2144 | if (static_p) |
2145 | { | |
18141e4c JM |
2146 | make_decl_rtl (main_decl, 0, toplevel_bindings_p ()); |
2147 | DECL_RTL (anon_union_decl) = DECL_RTL (main_decl); | |
0fa5e05c MM |
2148 | expand_anon_union_decl (anon_union_decl, |
2149 | NULL_TREE, | |
2150 | DECL_ANON_UNION_ELEMS (anon_union_decl)); | |
8d08fdba | 2151 | } |
0fa5e05c MM |
2152 | else |
2153 | add_decl_stmt (anon_union_decl); | |
8d08fdba MS |
2154 | } |
2155 | ||
8d08fdba MS |
2156 | /* Finish processing a builtin type TYPE. It's name is NAME, |
2157 | its fields are in the array FIELDS. LEN is the number of elements | |
2158 | in FIELDS minus one, or put another way, it is the maximum subscript | |
2159 | used in FIELDS. | |
2160 | ||
2161 | It is given the same alignment as ALIGN_TYPE. */ | |
e92cc029 | 2162 | |
8d08fdba MS |
2163 | void |
2164 | finish_builtin_type (type, name, fields, len, align_type) | |
2165 | tree type; | |
d8e178a0 | 2166 | const char *name; |
8d08fdba MS |
2167 | tree fields[]; |
2168 | int len; | |
2169 | tree align_type; | |
2170 | { | |
2171 | register int i; | |
2172 | ||
2173 | TYPE_FIELDS (type) = fields[0]; | |
2174 | for (i = 0; i < len; i++) | |
2175 | { | |
2176 | layout_type (TREE_TYPE (fields[i])); | |
2177 | DECL_FIELD_CONTEXT (fields[i]) = type; | |
2178 | TREE_CHAIN (fields[i]) = fields[i+1]; | |
2179 | } | |
2180 | DECL_FIELD_CONTEXT (fields[i]) = type; | |
8d08fdba MS |
2181 | TYPE_ALIGN (type) = TYPE_ALIGN (align_type); |
2182 | layout_type (type); | |
2183 | #if 0 /* not yet, should get fixed properly later */ | |
2184 | TYPE_NAME (type) = make_type_decl (get_identifier (name), type); | |
2185 | #else | |
2186 | TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type); | |
2187 | #endif | |
d2e5ee5c | 2188 | TYPE_STUB_DECL (type) = TYPE_NAME (type); |
8d08fdba MS |
2189 | layout_decl (TYPE_NAME (type), 0); |
2190 | } | |
2191 | \f | |
2192 | /* Auxiliary functions to make type signatures for | |
2193 | `operator new' and `operator delete' correspond to | |
2194 | what compiler will be expecting. */ | |
2195 | ||
8d08fdba MS |
2196 | tree |
2197 | coerce_new_type (type) | |
2198 | tree type; | |
2199 | { | |
2200 | int e1 = 0, e2 = 0; | |
2201 | ||
2202 | if (TREE_CODE (type) == METHOD_TYPE) | |
2203 | type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type))); | |
ee996e9e | 2204 | if (! same_type_p (TREE_TYPE (type), ptr_type_node)) |
8251199e | 2205 | e1 = 1, error ("`operator new' must return type `void *'"); |
8d08fdba MS |
2206 | |
2207 | /* Technically the type must be `size_t', but we may not know | |
2208 | what that is. */ | |
2209 | if (TYPE_ARG_TYPES (type) == NULL_TREE) | |
8251199e | 2210 | e1 = 1, error ("`operator new' takes type `size_t' parameter"); |
ee996e9e | 2211 | else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype)) |
8251199e | 2212 | e2 = 1, error ("`operator new' takes type `size_t' as first parameter"); |
8d08fdba MS |
2213 | if (e2) |
2214 | type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type)))); | |
2215 | else if (e1) | |
2216 | type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type)); | |
2217 | return type; | |
2218 | } | |
2219 | ||
2220 | tree | |
2221 | coerce_delete_type (type) | |
2222 | tree type; | |
2223 | { | |
a703fb38 KG |
2224 | int e1 = 0, e2 = 0; |
2225 | #if 0 | |
2226 | e3 = 0; | |
2227 | #endif | |
8d08fdba MS |
2228 | tree arg_types = TYPE_ARG_TYPES (type); |
2229 | ||
2230 | if (TREE_CODE (type) == METHOD_TYPE) | |
2231 | { | |
2232 | type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types)); | |
2233 | arg_types = TREE_CHAIN (arg_types); | |
2234 | } | |
824b9a4c | 2235 | |
8d08fdba | 2236 | if (TREE_TYPE (type) != void_type_node) |
8251199e | 2237 | e1 = 1, error ("`operator delete' must return type `void'"); |
824b9a4c | 2238 | |
8d08fdba | 2239 | if (arg_types == NULL_TREE |
ee996e9e | 2240 | || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node)) |
8251199e | 2241 | e2 = 1, error ("`operator delete' takes type `void *' as first parameter"); |
8d08fdba | 2242 | |
da4768fe | 2243 | #if 0 |
8d08fdba MS |
2244 | if (arg_types |
2245 | && TREE_CHAIN (arg_types) | |
2246 | && TREE_CHAIN (arg_types) != void_list_node) | |
2247 | { | |
2248 | /* Again, technically this argument must be `size_t', but again | |
2249 | we may not know what that is. */ | |
2250 | tree t2 = TREE_VALUE (TREE_CHAIN (arg_types)); | |
ee996e9e | 2251 | if (! same_type_p (t2, sizetype)) |
8251199e | 2252 | e3 = 1, error ("second argument to `operator delete' must be of type `size_t'"); |
8d08fdba MS |
2253 | else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node) |
2254 | { | |
2255 | e3 = 1; | |
2256 | if (TREE_CHAIN (TREE_CHAIN (arg_types))) | |
8251199e | 2257 | error ("too many arguments in declaration of `operator delete'"); |
8d08fdba | 2258 | else |
8251199e | 2259 | error ("`...' invalid in specification of `operator delete'"); |
8d08fdba MS |
2260 | } |
2261 | } | |
824b9a4c | 2262 | |
8d08fdba | 2263 | if (e3) |
824b9a4c MS |
2264 | arg_types = tree_cons (NULL_TREE, ptr_type_node, |
2265 | build_tree_list (NULL_TREE, sizetype)); | |
8d08fdba MS |
2266 | else if (e3 |= e2) |
2267 | { | |
2268 | if (arg_types == NULL_TREE) | |
a28e3c7f | 2269 | arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node); |
8d08fdba MS |
2270 | else |
2271 | arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types)); | |
2272 | } | |
2273 | else e3 |= e1; | |
da4768fe | 2274 | #endif |
8d08fdba | 2275 | |
da4768fe JM |
2276 | if (e2) |
2277 | arg_types = tree_cons (NULL_TREE, ptr_type_node, | |
2278 | arg_types ? TREE_CHAIN (arg_types): NULL_TREE); | |
2279 | if (e2 || e1) | |
8d08fdba MS |
2280 | type = build_function_type (void_type_node, arg_types); |
2281 | ||
2282 | return type; | |
2283 | } | |
2284 | \f | |
2285 | static void | |
8926095f | 2286 | mark_vtable_entries (decl) |
8d08fdba MS |
2287 | tree decl; |
2288 | { | |
f30432d7 MS |
2289 | tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl)); |
2290 | ||
8d08fdba MS |
2291 | for (; entries; entries = TREE_CHAIN (entries)) |
2292 | { | |
aff08c18 JM |
2293 | tree fnaddr; |
2294 | tree fn; | |
2295 | ||
db39aa0b AO |
2296 | fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries) |
2297 | : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries))); | |
2298 | ||
bbd15aac MM |
2299 | if (TREE_CODE (fnaddr) != ADDR_EXPR) |
2300 | /* This entry is an offset: a virtual base class offset, a | |
2301 | virtual call offset, and RTTI offset, etc. */ | |
aff08c18 JM |
2302 | continue; |
2303 | ||
aff08c18 | 2304 | fn = TREE_OPERAND (fnaddr, 0); |
8926095f | 2305 | TREE_ADDRESSABLE (fn) = 1; |
a80e4195 MS |
2306 | if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn)) |
2307 | { | |
2308 | DECL_EXTERNAL (fn) = 0; | |
2309 | emit_thunk (fn); | |
2310 | } | |
5566b478 | 2311 | mark_used (fn); |
7177d104 MS |
2312 | } |
2313 | } | |
2314 | ||
d11ad92e MS |
2315 | /* Set DECL up to have the closest approximation of "initialized common" |
2316 | linkage available. */ | |
2317 | ||
2318 | void | |
2319 | comdat_linkage (decl) | |
2320 | tree decl; | |
2321 | { | |
d11ad92e | 2322 | if (flag_weak) |
7fcdf4c2 | 2323 | make_decl_one_only (decl); |
2f435bed JM |
2324 | else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl)) |
2325 | /* We can just emit functions and vtables statically; it doesn't really | |
2326 | matter if we have multiple copies. */ | |
7fcdf4c2 | 2327 | TREE_PUBLIC (decl) = 0; |
ea735e02 JM |
2328 | else |
2329 | { | |
2f435bed JM |
2330 | /* Static data member template instantiations, however, cannot |
2331 | have multiple copies. */ | |
ea735e02 JM |
2332 | if (DECL_INITIAL (decl) == 0 |
2333 | || DECL_INITIAL (decl) == error_mark_node) | |
2334 | DECL_COMMON (decl) = 1; | |
2335 | else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))) | |
2336 | { | |
2337 | DECL_COMMON (decl) = 1; | |
2338 | DECL_INITIAL (decl) = error_mark_node; | |
2339 | } | |
2340 | else | |
2341 | { | |
2342 | /* We can't do anything useful; leave vars for explicit | |
2343 | instantiation. */ | |
2344 | DECL_EXTERNAL (decl) = 1; | |
2345 | DECL_NOT_REALLY_EXTERN (decl) = 0; | |
2346 | } | |
2347 | } | |
ab23f787 JM |
2348 | |
2349 | if (DECL_LANG_SPECIFIC (decl)) | |
2350 | DECL_COMDAT (decl) = 1; | |
d11ad92e MS |
2351 | } |
2352 | ||
b385c841 JM |
2353 | /* For win32 we also want to put explicit instantiations in |
2354 | linkonce sections, so that they will be merged with implicit | |
2355 | instantiations; otherwise we get duplicate symbol errors. */ | |
2356 | ||
2357 | void | |
2358 | maybe_make_one_only (decl) | |
2359 | tree decl; | |
2360 | { | |
b78121f6 JM |
2361 | /* We used to say that this was not necessary on targets that support weak |
2362 | symbols, because the implicit instantiations will defer to the explicit | |
2363 | one. However, that's not actually the case in SVR4; a strong definition | |
2364 | after a weak one is an error. Also, not making explicit | |
2365 | instantiations one_only means that we can end up with two copies of | |
2366 | some template instantiations. */ | |
2367 | if (! supports_one_only ()) | |
b385c841 JM |
2368 | return; |
2369 | ||
2370 | /* We can't set DECL_COMDAT on functions, or finish_file will think | |
ea735e02 JM |
2371 | we can get away with not emitting them if they aren't used. We need |
2372 | to for variables so that cp_finish_decl will update their linkage, | |
2373 | because their DECL_INITIAL may not have been set properly yet. */ | |
b385c841 | 2374 | |
ea735e02 JM |
2375 | make_decl_one_only (decl); |
2376 | ||
2377 | if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl)) | |
2378 | DECL_COMDAT (decl) = 1; | |
b385c841 JM |
2379 | } |
2380 | ||
d18c083e | 2381 | /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL, |
7177d104 MS |
2382 | based on TYPE and other static flags. |
2383 | ||
2384 | Note that anything public is tagged TREE_PUBLIC, whether | |
2385 | it's public in this file or in another one. */ | |
2386 | ||
5b605f68 | 2387 | void |
e3417fcd MS |
2388 | import_export_vtable (decl, type, final) |
2389 | tree decl, type; | |
2390 | int final; | |
7177d104 | 2391 | { |
e3417fcd MS |
2392 | if (DECL_INTERFACE_KNOWN (decl)) |
2393 | return; | |
2394 | ||
56ae6d77 | 2395 | if (TYPE_FOR_JAVA (type)) |
7177d104 MS |
2396 | { |
2397 | TREE_PUBLIC (decl) = 1; | |
56ae6d77 | 2398 | DECL_EXTERNAL (decl) = 1; |
e3417fcd MS |
2399 | DECL_INTERFACE_KNOWN (decl) = 1; |
2400 | } | |
2401 | else if (CLASSTYPE_INTERFACE_KNOWN (type)) | |
2402 | { | |
2403 | TREE_PUBLIC (decl) = 1; | |
2404 | DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type); | |
2405 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2406 | } | |
2407 | else | |
2408 | { | |
b7484fbe MS |
2409 | /* We can only wait to decide if we have real non-inline virtual |
2410 | functions in our class, or if we come from a template. */ | |
e3417fcd MS |
2411 | |
2412 | int found = CLASSTYPE_TEMPLATE_INSTANTIATION (type); | |
2413 | ||
2414 | if (! found && ! final) | |
2415 | { | |
e3417fcd | 2416 | tree method; |
72b7eeff MS |
2417 | for (method = TYPE_METHODS (type); method != NULL_TREE; |
2418 | method = TREE_CHAIN (method)) | |
faae18ab MS |
2419 | if (DECL_VINDEX (method) != NULL_TREE |
2420 | && ! DECL_THIS_INLINE (method) | |
fee7654e | 2421 | && ! DECL_PURE_VIRTUAL_P (method)) |
e3417fcd MS |
2422 | { |
2423 | found = 1; | |
2424 | break; | |
2425 | } | |
2426 | } | |
2427 | ||
2428 | if (final || ! found) | |
2429 | { | |
d11ad92e | 2430 | comdat_linkage (decl); |
e3417fcd | 2431 | DECL_EXTERNAL (decl) = 0; |
e3417fcd MS |
2432 | } |
2433 | else | |
2434 | { | |
2435 | TREE_PUBLIC (decl) = 1; | |
2436 | DECL_EXTERNAL (decl) = 1; | |
e3417fcd | 2437 | } |
8d08fdba MS |
2438 | } |
2439 | } | |
2440 | ||
7e776093 JM |
2441 | /* Determine whether or not we want to specifically import or export CTYPE, |
2442 | using various heuristics. */ | |
67f7c391 | 2443 | |
27d26ee7 | 2444 | static void |
67f7c391 JM |
2445 | import_export_class (ctype) |
2446 | tree ctype; | |
8d08fdba | 2447 | { |
7e776093 JM |
2448 | /* -1 for imported, 1 for exported. */ |
2449 | int import_export = 0; | |
2450 | ||
27d26ee7 MM |
2451 | /* It only makes sense to call this function at EOF. The reason is |
2452 | that this function looks at whether or not the first non-inline | |
2453 | non-abstract virtual member function has been defined in this | |
2454 | translation unit. But, we can't possibly know that until we've | |
2455 | seen the entire translation unit. */ | |
2456 | my_friendly_assert (at_eof, 20000226); | |
2457 | ||
7e776093 JM |
2458 | if (CLASSTYPE_INTERFACE_KNOWN (ctype)) |
2459 | return; | |
2460 | ||
e9659ab0 JM |
2461 | /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface, |
2462 | we will have CLASSTYPE_INTERFACE_ONLY set but not | |
2463 | CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this | |
2464 | heuristic because someone will supply a #pragma implementation | |
2465 | elsewhere, and deducing it here would produce a conflict. */ | |
2466 | if (CLASSTYPE_INTERFACE_ONLY (ctype)) | |
2467 | return; | |
2468 | ||
7e776093 JM |
2469 | #ifdef VALID_MACHINE_TYPE_ATTRIBUTE |
2470 | /* FIXME this should really use some sort of target-independent macro. */ | |
2471 | if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype))) | |
7c913d33 | 2472 | import_export = -1; |
7e776093 | 2473 | else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype))) |
7c913d33 | 2474 | import_export = 1; |
7e776093 JM |
2475 | #endif |
2476 | ||
2477 | /* If we got -fno-implicit-templates, we import template classes that | |
2478 | weren't explicitly instantiated. */ | |
2479 | if (import_export == 0 | |
2480 | && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype) | |
2481 | && ! flag_implicit_templates) | |
2482 | import_export = -1; | |
7177d104 | 2483 | |
7e776093 JM |
2484 | /* Base our import/export status on that of the first non-inline, |
2485 | non-abstract virtual function, if any. */ | |
2486 | if (import_export == 0 | |
4c6b7393 | 2487 | && TYPE_POLYMORPHIC_P (ctype) |
b7484fbe | 2488 | && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) |
51c184be MS |
2489 | { |
2490 | tree method; | |
72b7eeff MS |
2491 | for (method = TYPE_METHODS (ctype); method != NULL_TREE; |
2492 | method = TREE_CHAIN (method)) | |
51c184be | 2493 | { |
28cbf42c | 2494 | if (DECL_VINDEX (method) != NULL_TREE |
faae18ab | 2495 | && !DECL_THIS_INLINE (method) |
fee7654e | 2496 | && !DECL_PURE_VIRTUAL_P (method)) |
51c184be | 2497 | { |
7e776093 | 2498 | import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1); |
51c184be MS |
2499 | break; |
2500 | } | |
2501 | } | |
2502 | } | |
ad236eab JM |
2503 | |
2504 | #ifdef MULTIPLE_SYMBOL_SPACES | |
2505 | if (import_export == -1) | |
2506 | import_export = 0; | |
c11b6f21 | 2507 | #endif |
7e776093 JM |
2508 | |
2509 | if (import_export) | |
2510 | { | |
2511 | SET_CLASSTYPE_INTERFACE_KNOWN (ctype); | |
2512 | CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0); | |
2513 | CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0); | |
2514 | } | |
67f7c391 JM |
2515 | } |
2516 | ||
a1dd0d36 | 2517 | /* We need to describe to the assembler the relationship between |
59fa060f | 2518 | a vtable and the vtable of the parent class. */ |
a1dd0d36 JM |
2519 | |
2520 | static void | |
2521 | output_vtable_inherit (vars) | |
2522 | tree vars; | |
2523 | { | |
2524 | tree parent; | |
2525 | rtx op[2]; | |
2526 | ||
2527 | op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */ | |
2528 | ||
2529 | parent = binfo_for_vtable (vars); | |
2530 | ||
2531 | if (parent == TYPE_BINFO (DECL_CONTEXT (vars))) | |
2532 | op[1] = const0_rtx; | |
2533 | else if (parent) | |
2534 | { | |
2535 | parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent)); | |
2536 | op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */ | |
2537 | } | |
2538 | else | |
2539 | my_friendly_abort (980826); | |
2540 | ||
59fa060f | 2541 | output_asm_insn (".vtable_inherit %c0, %c1", op); |
a1dd0d36 JM |
2542 | } |
2543 | ||
fc378698 | 2544 | static int |
0aafb128 MM |
2545 | finish_vtable_vardecl (t, data) |
2546 | tree *t; | |
2547 | void *data ATTRIBUTE_UNUSED; | |
d18c083e | 2548 | { |
0aafb128 | 2549 | tree vars = *t; |
2455f26f JM |
2550 | tree ctype = DECL_CONTEXT (vars); |
2551 | import_export_class (ctype); | |
2552 | import_export_vtable (vars, ctype, 1); | |
2553 | ||
56ae6d77 | 2554 | if (! DECL_EXTERNAL (vars) |
7c913d33 | 2555 | && (DECL_NEEDED_P (vars) |
4f1c5b7d | 2556 | || (decl_function_context (vars) && TREE_USED (vars))) |
fc378698 | 2557 | && ! TREE_ASM_WRITTEN (vars)) |
d18c083e | 2558 | { |
1aa4ccd4 NS |
2559 | if (TREE_TYPE (vars) == void_type_node) |
2560 | /* It is a dummy vtable made by get_vtable_decl. Ignore it. */ | |
2561 | return 0; | |
2562 | ||
8d08fdba | 2563 | /* Write it out. */ |
8926095f | 2564 | mark_vtable_entries (vars); |
8d08fdba | 2565 | if (TREE_TYPE (DECL_INITIAL (vars)) == 0) |
b7484fbe | 2566 | store_init_value (vars, DECL_INITIAL (vars)); |
8d08fdba | 2567 | |
faf5394a | 2568 | if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG) |
8d08fdba MS |
2569 | { |
2570 | /* Mark the VAR_DECL node representing the vtable itself as a | |
2571 | "gratuitous" one, thereby forcing dwarfout.c to ignore it. | |
2572 | It is rather important that such things be ignored because | |
2573 | any effort to actually generate DWARF for them will run | |
2574 | into trouble when/if we encounter code like: | |
2575 | ||
2576 | #pragma interface | |
2577 | struct S { virtual void member (); }; | |
2578 | ||
2579 | because the artificial declaration of the vtable itself (as | |
2580 | manufactured by the g++ front end) will say that the vtable | |
2581 | is a static member of `S' but only *after* the debug output | |
2582 | for the definition of `S' has already been output. This causes | |
2583 | grief because the DWARF entry for the definition of the vtable | |
2584 | will try to refer back to an earlier *declaration* of the | |
2585 | vtable as a static member of `S' and there won't be one. | |
2586 | We might be able to arrange to have the "vtable static member" | |
2587 | attached to the member list for `S' before the debug info for | |
2588 | `S' get written (which would solve the problem) but that would | |
2589 | require more intrusive changes to the g++ front end. */ | |
2590 | ||
2591 | DECL_IGNORED_P (vars) = 1; | |
2592 | } | |
8d08fdba | 2593 | |
e2213efb JM |
2594 | /* Always make vtables weak. */ |
2595 | if (flag_weak) | |
2596 | comdat_linkage (vars); | |
2597 | ||
311862c8 | 2598 | rest_of_decl_compilation (vars, NULL_PTR, 1, 1); |
a1dd0d36 JM |
2599 | |
2600 | if (flag_vtable_gc) | |
2601 | output_vtable_inherit (vars); | |
2602 | ||
84df082b MM |
2603 | /* Because we're only doing syntax-checking, we'll never end up |
2604 | actually marking the variable as written. */ | |
2605 | if (flag_syntax_only) | |
2606 | TREE_ASM_WRITTEN (vars) = 1; | |
2607 | ||
ae673f14 JM |
2608 | /* Since we're writing out the vtable here, also write the debug |
2609 | info. */ | |
2610 | if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (ctype))) | |
2611 | { | |
2612 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (ctype)) = 0; | |
2613 | rest_of_type_compilation (ctype, toplevel_bindings_p ()); | |
2614 | } | |
2615 | ||
fc378698 | 2616 | return 1; |
8d08fdba | 2617 | } |
84df082b | 2618 | else if (!DECL_NEEDED_P (vars)) |
b7484fbe | 2619 | /* We don't know what to do with this one yet. */ |
fc378698 | 2620 | return 0; |
b7484fbe | 2621 | |
fc378698 | 2622 | return 0; |
b7484fbe MS |
2623 | } |
2624 | ||
fc378698 | 2625 | static int |
0aafb128 MM |
2626 | prune_vtable_vardecl (t, data) |
2627 | tree *t; | |
2628 | void *data ATTRIBUTE_UNUSED; | |
b7484fbe | 2629 | { |
0aafb128 | 2630 | *t = TREE_CHAIN (*t); |
fc378698 | 2631 | return 1; |
8d08fdba MS |
2632 | } |
2633 | ||
00595019 | 2634 | /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an |
5566b478 | 2635 | inline function or template instantiation at end-of-file. */ |
00595019 MS |
2636 | |
2637 | void | |
5566b478 | 2638 | import_export_decl (decl) |
00595019 MS |
2639 | tree decl; |
2640 | { | |
db5ae43f | 2641 | if (DECL_INTERFACE_KNOWN (decl)) |
00595019 MS |
2642 | return; |
2643 | ||
61289ca3 MM |
2644 | if (DECL_TEMPLATE_INSTANTIATION (decl) |
2645 | || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)) | |
00595019 | 2646 | { |
5566b478 | 2647 | DECL_NOT_REALLY_EXTERN (decl) = 1; |
61289ca3 MM |
2648 | if ((DECL_IMPLICIT_INSTANTIATION (decl) |
2649 | || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)) | |
5eea678f JM |
2650 | && (flag_implicit_templates |
2651 | || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl)))) | |
a9aedbc2 | 2652 | { |
75650646 MM |
2653 | if (!TREE_PUBLIC (decl)) |
2654 | /* Templates are allowed to have internal linkage. See | |
2655 | [basic.link]. */ | |
2656 | ; | |
d11ad92e | 2657 | else |
ea735e02 | 2658 | comdat_linkage (decl); |
a9aedbc2 | 2659 | } |
db5ae43f | 2660 | else |
faae18ab | 2661 | DECL_NOT_REALLY_EXTERN (decl) = 0; |
00595019 MS |
2662 | } |
2663 | else if (DECL_FUNCTION_MEMBER_P (decl)) | |
2664 | { | |
4f1c5b7d | 2665 | tree ctype = DECL_CONTEXT (decl); |
8452b1d3 | 2666 | import_export_class (ctype); |
047f64a3 | 2667 | if (CLASSTYPE_INTERFACE_KNOWN (ctype) |
2aaf816d JM |
2668 | && (flag_new_abi |
2669 | ? (! DECL_THIS_INLINE (decl)) | |
2670 | : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl)))) | |
00595019 | 2671 | { |
faae18ab MS |
2672 | DECL_NOT_REALLY_EXTERN (decl) |
2673 | = ! (CLASSTYPE_INTERFACE_ONLY (ctype) | |
9c73ec84 MS |
2674 | || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines |
2675 | && !DECL_VINDEX (decl))); | |
1a408d07 JM |
2676 | |
2677 | /* Always make artificials weak. */ | |
2678 | if (DECL_ARTIFICIAL (decl) && flag_weak) | |
2679 | comdat_linkage (decl); | |
1f901793 JM |
2680 | else |
2681 | maybe_make_one_only (decl); | |
00595019 | 2682 | } |
db5ae43f | 2683 | else |
d11ad92e | 2684 | comdat_linkage (decl); |
00595019 | 2685 | } |
0aafb128 | 2686 | else if (DECL_TINFO_FN_P (decl)) |
6b5fbb55 MS |
2687 | { |
2688 | tree ctype = TREE_TYPE (DECL_NAME (decl)); | |
8452b1d3 JM |
2689 | |
2690 | if (IS_AGGR_TYPE (ctype)) | |
2691 | import_export_class (ctype); | |
2692 | ||
d11ad92e | 2693 | if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype) |
4c6b7393 | 2694 | && TYPE_POLYMORPHIC_P (ctype) |
db48b831 JM |
2695 | /* If -fno-rtti, we're not necessarily emitting this stuff with |
2696 | the class, so go ahead and emit it now. This can happen | |
2697 | when a class is used in exception handling. */ | |
2698 | && flag_rtti | |
af9c2d8a MM |
2699 | /* If the type is a cv-qualified variant of a type, then we |
2700 | must emit the tinfo function in this translation unit | |
2701 | since it will not be emitted when the vtable for the type | |
2702 | is output (which is when the unqualified version is | |
2703 | generated). */ | |
1b5f5f76 | 2704 | && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype))) |
7e776093 | 2705 | { |
6b5fbb55 | 2706 | DECL_NOT_REALLY_EXTERN (decl) |
7e776093 | 2707 | = ! (CLASSTYPE_INTERFACE_ONLY (ctype) |
9c73ec84 MS |
2708 | || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines |
2709 | && !DECL_VINDEX (decl))); | |
eb773359 | 2710 | |
1a408d07 JM |
2711 | /* Always make artificials weak. */ |
2712 | if (flag_weak) | |
2713 | comdat_linkage (decl); | |
6b5fbb55 | 2714 | } |
1b5f5f76 MM |
2715 | else if (TYPE_BUILT_IN (ctype) |
2716 | && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype))) | |
6b5fbb55 | 2717 | DECL_NOT_REALLY_EXTERN (decl) = 0; |
6b5fbb55 | 2718 | else |
d11ad92e | 2719 | comdat_linkage (decl); |
6b5fbb55 | 2720 | } |
db5ae43f | 2721 | else |
d11ad92e | 2722 | comdat_linkage (decl); |
e8abc66f MS |
2723 | |
2724 | DECL_INTERFACE_KNOWN (decl) = 1; | |
00595019 | 2725 | } |
db5ae43f | 2726 | |
72b7eeff MS |
2727 | tree |
2728 | build_cleanup (decl) | |
2729 | tree decl; | |
2730 | { | |
2731 | tree temp; | |
2732 | tree type = TREE_TYPE (decl); | |
2733 | ||
2734 | if (TREE_CODE (type) == ARRAY_TYPE) | |
2735 | temp = decl; | |
2736 | else | |
2737 | { | |
2738 | mark_addressable (decl); | |
2739 | temp = build1 (ADDR_EXPR, build_pointer_type (type), decl); | |
2740 | } | |
2741 | temp = build_delete (TREE_TYPE (temp), temp, | |
2742 | integer_two_node, | |
2743 | LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0); | |
2744 | return temp; | |
2745 | } | |
2746 | ||
8d08fdba MS |
2747 | extern int parse_time, varconst_time; |
2748 | ||
824b9a4c | 2749 | static tree |
67d743fe MS |
2750 | get_sentry (base) |
2751 | tree base; | |
2752 | { | |
2753 | tree sname = get_id_2 ("__sn", base); | |
2c73f9f5 | 2754 | /* For struct X foo __attribute__((weak)), there is a counter |
30394414 JM |
2755 | __snfoo. Since base is already an assembler name, sname should |
2756 | be globally unique */ | |
67d743fe MS |
2757 | tree sentry = IDENTIFIER_GLOBAL_VALUE (sname); |
2758 | if (! sentry) | |
2759 | { | |
67d743fe MS |
2760 | sentry = build_decl (VAR_DECL, sname, integer_type_node); |
2761 | TREE_PUBLIC (sentry) = 1; | |
2762 | DECL_ARTIFICIAL (sentry) = 1; | |
2763 | TREE_STATIC (sentry) = 1; | |
2764 | TREE_USED (sentry) = 1; | |
2765 | DECL_COMMON (sentry) = 1; | |
2766 | pushdecl_top_level (sentry); | |
cd9f6678 | 2767 | cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0); |
67d743fe MS |
2768 | } |
2769 | return sentry; | |
2770 | } | |
2771 | ||
961ec1a5 JM |
2772 | /* Start the process of running a particular set of global constructors |
2773 | or destructors. Subroutine of do_[cd]tors. */ | |
2774 | ||
914653a2 | 2775 | static tree |
2ce3c6c6 JM |
2776 | start_objects (method_type, initp) |
2777 | int method_type, initp; | |
961ec1a5 JM |
2778 | { |
2779 | tree fnname; | |
914653a2 | 2780 | tree body; |
2ce3c6c6 | 2781 | char type[10]; |
961ec1a5 JM |
2782 | |
2783 | /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */ | |
2784 | ||
000ab922 | 2785 | if (initp != DEFAULT_INIT_PRIORITY) |
2ce3c6c6 | 2786 | { |
066d147c MH |
2787 | char joiner; |
2788 | ||
2789 | #ifdef JOINER | |
2790 | joiner = JOINER; | |
2791 | #else | |
2792 | joiner = '_'; | |
2793 | #endif | |
2ce3c6c6 | 2794 | |
066d147c | 2795 | sprintf (type, "%c%c%.5u", method_type, joiner, initp); |
2ce3c6c6 JM |
2796 | } |
2797 | else | |
2798 | sprintf (type, "%c", method_type); | |
2799 | ||
2800 | fnname = get_file_function_name_long (type); | |
961ec1a5 JM |
2801 | |
2802 | start_function (void_list_node, | |
2803 | make_call_declarator (fnname, void_list_node, NULL_TREE, | |
2804 | NULL_TREE), | |
914653a2 | 2805 | NULL_TREE, SF_DEFAULT); |
961ec1a5 | 2806 | |
b4bb92e5 | 2807 | #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR) |
14686fcd JL |
2808 | /* It can be a static function as long as collect2 does not have |
2809 | to scan the object file to find its ctor/dtor routine. */ | |
b4bb92e5 L |
2810 | TREE_PUBLIC (current_function_decl) = 0; |
2811 | #endif | |
2812 | ||
5fdaba89 MM |
2813 | /* Mark this declaration as used to avoid spurious warnings. */ |
2814 | TREE_USED (current_function_decl) = 1; | |
2815 | ||
2b76013c MM |
2816 | /* Mark this function as a global constructor or destructor. */ |
2817 | if (method_type == 'I') | |
2818 | DECL_GLOBAL_CTOR_P (current_function_decl) = 1; | |
2819 | else | |
2820 | DECL_GLOBAL_DTOR_P (current_function_decl) = 1; | |
2821 | GLOBAL_INIT_PRIORITY (current_function_decl) = initp; | |
2822 | ||
914653a2 | 2823 | body = begin_compound_stmt (/*has_no_scope=*/0); |
b3f738da MM |
2824 | |
2825 | /* We cannot allow these functions to be elided, even if they do not | |
2826 | have external linkage. And, there's no point in deferring | |
2827 | copmilation of thes functions; they're all going to have to be | |
2828 | out anyhow. */ | |
2829 | current_function_cannot_inline | |
2830 | = "static constructors and destructors cannot be inlined"; | |
914653a2 MM |
2831 | |
2832 | return body; | |
961ec1a5 JM |
2833 | } |
2834 | ||
2835 | /* Finish the process of running a particular set of global constructors | |
2836 | or destructors. Subroutine of do_[cd]tors. */ | |
2837 | ||
2838 | static void | |
914653a2 | 2839 | finish_objects (method_type, initp, body) |
2ce3c6c6 | 2840 | int method_type, initp; |
914653a2 | 2841 | tree body; |
961ec1a5 | 2842 | { |
914653a2 MM |
2843 | char *fnname; |
2844 | tree fn; | |
961ec1a5 JM |
2845 | |
2846 | /* Finish up. */ | |
914653a2 MM |
2847 | finish_compound_stmt(/*has_no_scope=*/0, body); |
2848 | fn = finish_function (lineno, 0); | |
2849 | expand_body (fn); | |
961ec1a5 | 2850 | |
84df082b MM |
2851 | /* When only doing semantic analysis, and no RTL generation, we |
2852 | can't call functions that directly emit assembly code; there is | |
2853 | no assembly file in which to put the code. */ | |
2854 | if (flag_syntax_only) | |
2855 | return; | |
2856 | ||
914653a2 | 2857 | fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0); |
000ab922 | 2858 | if (initp == DEFAULT_INIT_PRIORITY) |
2ce3c6c6 JM |
2859 | { |
2860 | if (method_type == 'I') | |
2861 | assemble_constructor (fnname); | |
2862 | else | |
2863 | assemble_destructor (fnname); | |
2864 | } | |
7a8f9fa9 | 2865 | #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR) |
2ce3c6c6 JM |
2866 | /* If we're using init priority we can't use assemble_*tor, but on ELF |
2867 | targets we can stick the references into named sections for GNU ld | |
2868 | to collect. */ | |
000ab922 | 2869 | else |
2ce3c6c6 JM |
2870 | { |
2871 | char buf[15]; | |
2ce3c6c6 JM |
2872 | sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd', |
2873 | /* invert the numbering so the linker puts us in the proper | |
2874 | order; constructors are run from right to left, and the | |
2875 | linker sorts in increasing order. */ | |
2876 | MAX_INIT_PRIORITY - initp); | |
2877 | named_section (NULL_TREE, buf, 0); | |
2878 | assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname), | |
2879 | POINTER_SIZE / BITS_PER_UNIT, 1); | |
2880 | } | |
2881 | #endif | |
961ec1a5 JM |
2882 | } |
2883 | ||
0aafb128 MM |
2884 | /* The names of the parameters to the function created to handle |
2885 | initializations and destructions for objects with static storage | |
2886 | duration. */ | |
2887 | #define INITIALIZE_P_IDENTIFIER "__initialize_p" | |
2888 | #define PRIORITY_IDENTIFIER "__priority" | |
2889 | ||
2890 | /* The name of the function we create to handle initializations and | |
2891 | destructions for objects with static storage duration. */ | |
2892 | #define SSDF_IDENTIFIER "__static_initialization_and_destruction" | |
2893 | ||
2894 | /* The declaration for the __INITIALIZE_P argument. */ | |
2895 | static tree initialize_p_decl; | |
2896 | ||
2897 | /* The declaration for the __PRIORITY argument. */ | |
2898 | static tree priority_decl; | |
2899 | ||
2900 | /* The declaration for the static storage duration function. */ | |
2901 | static tree ssdf_decl; | |
2902 | ||
0352cfc8 MM |
2903 | /* All the static storage duration functions created in this |
2904 | translation unit. */ | |
2905 | static varray_type ssdf_decls; | |
0352cfc8 | 2906 | |
0aafb128 MM |
2907 | /* A map from priority levels to information about that priority |
2908 | level. There may be many such levels, so efficient lookup is | |
2909 | important. */ | |
2910 | static splay_tree priority_info_map; | |
2911 | ||
2912 | /* Begins the generation of the function that will handle all | |
2913 | initialization and destruction of objects with static storage | |
2914 | duration. The function generated takes two parameters of type | |
2915 | `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is | |
2916 | non-zero, it performs initializations. Otherwise, it performs | |
2917 | destructions. It only performs those initializations or | |
2918 | destructions with the indicated __PRIORITY. The generated function | |
2919 | returns no value. | |
2920 | ||
2921 | It is assumed that this function will only be called once per | |
2922 | translation unit. */ | |
961ec1a5 | 2923 | |
313bc2c2 | 2924 | static tree |
0aafb128 | 2925 | start_static_storage_duration_function () |
961ec1a5 | 2926 | { |
0352cfc8 MM |
2927 | static unsigned ssdf_number; |
2928 | ||
0aafb128 MM |
2929 | tree parm_types; |
2930 | tree type; | |
313bc2c2 | 2931 | tree body; |
0352cfc8 MM |
2932 | char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32]; |
2933 | ||
2934 | /* Create the identifier for this function. It will be of the form | |
2935 | SSDF_IDENTIFIER_<number>. */ | |
2936 | sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++); | |
2937 | if (ssdf_number == 0) | |
2938 | { | |
2939 | /* Overflow occurred. That means there are at least 4 billion | |
2940 | initialization functions. */ | |
2941 | sorry ("too many initialization functions required"); | |
2942 | my_friendly_abort (19990430); | |
2943 | } | |
0aafb128 MM |
2944 | |
2945 | /* Create the parameters. */ | |
2946 | parm_types = void_list_node; | |
e1b3e07d MM |
2947 | parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types); |
2948 | parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types); | |
0aafb128 MM |
2949 | type = build_function_type (void_type_node, parm_types); |
2950 | ||
2951 | /* Create the FUNCTION_DECL itself. */ | |
2952 | ssdf_decl = build_lang_decl (FUNCTION_DECL, | |
0352cfc8 | 2953 | get_identifier (id), |
0aafb128 MM |
2954 | type); |
2955 | TREE_PUBLIC (ssdf_decl) = 0; | |
2956 | DECL_ARTIFICIAL (ssdf_decl) = 1; | |
0352cfc8 MM |
2957 | |
2958 | /* Put this function in the list of functions to be called from the | |
2959 | static constructors and destructors. */ | |
2960 | if (!ssdf_decls) | |
2961 | { | |
2962 | VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls"); | |
2963 | ||
2964 | /* Take this opportunity to initialize the map from priority | |
2965 | numbers to information about that priority level. */ | |
2966 | priority_info_map = splay_tree_new (splay_tree_compare_ints, | |
2967 | /*delete_key_fn=*/0, | |
2968 | /*delete_value_fn=*/ | |
2969 | (splay_tree_delete_value_fn) &free); | |
2970 | ||
2971 | /* We always need to generate functions for the | |
2972 | DEFAULT_INIT_PRIORITY so enter it now. That way when we walk | |
2973 | priorities later, we'll be sure to find the | |
2974 | DEFAULT_INIT_PRIORITY. */ | |
2975 | get_priority_info (DEFAULT_INIT_PRIORITY); | |
2976 | } | |
2977 | ||
2c0f17dc | 2978 | VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl); |
0aafb128 MM |
2979 | |
2980 | /* Create the argument list. */ | |
2981 | initialize_p_decl = build_decl (PARM_DECL, | |
2982 | get_identifier (INITIALIZE_P_IDENTIFIER), | |
2983 | integer_type_node); | |
2984 | DECL_CONTEXT (initialize_p_decl) = ssdf_decl; | |
2985 | DECL_ARG_TYPE (initialize_p_decl) = integer_type_node; | |
2986 | TREE_USED (initialize_p_decl) = 1; | |
2987 | priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER), | |
2988 | integer_type_node); | |
2989 | DECL_CONTEXT (priority_decl) = ssdf_decl; | |
2990 | DECL_ARG_TYPE (priority_decl) = integer_type_node; | |
2991 | TREE_USED (priority_decl) = 1; | |
2992 | ||
2993 | TREE_CHAIN (initialize_p_decl) = priority_decl; | |
2994 | DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl; | |
2995 | ||
13ef1ec5 MM |
2996 | /* Put the function in the global scope. */ |
2997 | pushdecl (ssdf_decl); | |
2998 | ||
0aafb128 MM |
2999 | /* Start the function itself. This is equivalent to declarating the |
3000 | function as: | |
3001 | ||
c472cdfd | 3002 | static void __ssdf (int __initialize_p, init __priority_p); |
0aafb128 MM |
3003 | |
3004 | It is static because we only need to call this function from the | |
3005 | various constructor and destructor functions for this module. */ | |
3006 | start_function (/*specs=*/NULL_TREE, | |
3007 | ssdf_decl, | |
3008 | /*attrs=*/NULL_TREE, | |
313bc2c2 | 3009 | SF_PRE_PARSED); |
0aafb128 MM |
3010 | |
3011 | /* Set up the scope of the outermost block in the function. */ | |
313bc2c2 | 3012 | body = begin_compound_stmt (/*has_no_scope=*/0); |
2ce3c6c6 | 3013 | |
0352cfc8 MM |
3014 | /* This function must not be deferred because we are depending on |
3015 | its compilation to tell us what is TREE_SYMBOL_REFERENCED. */ | |
3016 | current_function_cannot_inline | |
3017 | = "static storage duration functions cannot be inlined"; | |
961ec1a5 | 3018 | |
313bc2c2 | 3019 | return body; |
961ec1a5 JM |
3020 | } |
3021 | ||
0aafb128 MM |
3022 | /* Finish the generation of the function which performs initialization |
3023 | and destruction of objects with static storage duration. After | |
3024 | this point, no more such objects can be created. */ | |
961ec1a5 JM |
3025 | |
3026 | static void | |
313bc2c2 MM |
3027 | finish_static_storage_duration_function (body) |
3028 | tree body; | |
961ec1a5 | 3029 | { |
0aafb128 | 3030 | /* Close out the function. */ |
313bc2c2 MM |
3031 | finish_compound_stmt (/*has_no_scope=*/0, body); |
3032 | expand_body (finish_function (lineno, 0)); | |
0aafb128 | 3033 | } |
961ec1a5 | 3034 | |
0aafb128 MM |
3035 | /* Return the information about the indicated PRIORITY level. If no |
3036 | code to handle this level has yet been generated, generate the | |
3037 | appropriate prologue. */ | |
961ec1a5 | 3038 | |
0aafb128 MM |
3039 | static priority_info |
3040 | get_priority_info (priority) | |
3041 | int priority; | |
3042 | { | |
3043 | priority_info pi; | |
3044 | splay_tree_node n; | |
3045 | ||
3046 | n = splay_tree_lookup (priority_info_map, | |
3047 | (splay_tree_key) priority); | |
3048 | if (!n) | |
3049 | { | |
3050 | /* Create a new priority information structure, and insert it | |
3051 | into the map. */ | |
3052 | pi = (priority_info) xmalloc (sizeof (struct priority_info_s)); | |
0352cfc8 MM |
3053 | pi->initializations_p = 0; |
3054 | pi->destructions_p = 0; | |
0aafb128 MM |
3055 | splay_tree_insert (priority_info_map, |
3056 | (splay_tree_key) priority, | |
3057 | (splay_tree_value) pi); | |
3058 | } | |
3059 | else | |
3060 | pi = (priority_info) n->value; | |
961ec1a5 | 3061 | |
0aafb128 MM |
3062 | return pi; |
3063 | } | |
961ec1a5 | 3064 | |
313bc2c2 MM |
3065 | /* Set up to handle the initialization or destruction of DECL. If |
3066 | INITP is non-zero, we are initializing the variable. Otherwise, we | |
3067 | are destroying it. */ | |
3068 | ||
3069 | static tree | |
3070 | start_static_initialization_or_destruction (decl, initp) | |
3071 | tree decl; | |
3072 | int initp; | |
3073 | { | |
3074 | tree sentry_if_stmt = NULL_TREE; | |
3075 | int priority; | |
3076 | tree cond; | |
3077 | tree init_cond; | |
3078 | priority_info pi; | |
3079 | ||
3080 | /* Figure out the priority for this declaration. */ | |
3081 | priority = DECL_INIT_PRIORITY (decl); | |
3082 | if (!priority) | |
3083 | priority = DEFAULT_INIT_PRIORITY; | |
3084 | ||
3085 | /* Remember that we had an initialization or finalization at this | |
3086 | priority. */ | |
3087 | pi = get_priority_info (priority); | |
3088 | if (initp) | |
3089 | pi->initializations_p = 1; | |
3090 | else | |
3091 | pi->destructions_p = 1; | |
3092 | ||
3093 | /* Trick the compiler into thinking we are at the file and line | |
3094 | where DECL was declared so that error-messages make sense, and so | |
3095 | that the debugger will show somewhat sensible file and line | |
3096 | information. */ | |
3097 | input_filename = DECL_SOURCE_FILE (decl); | |
3098 | lineno = DECL_SOURCE_LINE (decl); | |
3099 | ||
3100 | /* Because of: | |
3101 | ||
3102 | [class.access.spec] | |
3103 | ||
3104 | Access control for implicit calls to the constructors, | |
3105 | the conversion functions, or the destructor called to | |
3106 | create and destroy a static data member is performed as | |
3107 | if these calls appeared in the scope of the member's | |
3108 | class. | |
3109 | ||
3110 | we pretend we are in a static member function of the class of | |
3111 | which the DECL is a member. */ | |
3112 | if (member_p (decl)) | |
3113 | { | |
4f1c5b7d | 3114 | DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl); |
313bc2c2 MM |
3115 | DECL_STATIC_FUNCTION_P (current_function_decl) = 1; |
3116 | } | |
3117 | ||
3118 | /* Conditionalize this initialization on being in the right priority | |
3119 | and being initializing/finalizing appropriately. */ | |
3120 | sentry_if_stmt = begin_if_stmt (); | |
3121 | cond = build_binary_op (EQ_EXPR, | |
3122 | priority_decl, | |
3123 | build_int_2 (priority, 0)); | |
3124 | init_cond = initp ? integer_one_node : integer_zero_node; | |
3125 | init_cond = build_binary_op (EQ_EXPR, | |
3126 | initialize_p_decl, | |
3127 | init_cond); | |
3128 | cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond); | |
3129 | ||
3130 | /* We need a sentry if this is an object with external linkage that | |
3131 | might be initialized in more than one place. */ | |
3132 | if (TREE_PUBLIC (decl) && (DECL_COMMON (decl) | |
3133 | || DECL_ONE_ONLY (decl) | |
3134 | || DECL_WEAK (decl))) | |
3135 | { | |
3136 | tree sentry; | |
3137 | tree sentry_cond; | |
3138 | ||
3139 | sentry = get_sentry (DECL_ASSEMBLER_NAME (decl)); | |
3140 | ||
3141 | /* We do initializations only if the SENTRY is zero, i.e., if we | |
3142 | are the first to initialize the variable. We do destructions | |
3143 | only if the SENTRY is one, i.e., if we are the last to | |
3144 | destroy the variable. */ | |
3145 | if (initp) | |
3146 | sentry_cond = build_binary_op (EQ_EXPR, | |
3147 | build_unary_op (PREINCREMENT_EXPR, | |
3148 | sentry, | |
3149 | /*noconvert=*/1), | |
3150 | integer_one_node); | |
3151 | else | |
3152 | sentry_cond = build_binary_op (EQ_EXPR, | |
3153 | build_unary_op (PREDECREMENT_EXPR, | |
3154 | sentry, | |
3155 | /*noconvert=*/1), | |
3156 | integer_zero_node); | |
3157 | ||
3158 | cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond); | |
3159 | } | |
3160 | ||
3161 | finish_if_stmt_cond (cond, sentry_if_stmt); | |
3162 | ||
3163 | return sentry_if_stmt; | |
3164 | } | |
3165 | ||
3166 | /* We've just finished generating code to do an initialization or | |
3167 | finalization. SENTRY_IF_STMT is the if-statement we used to guard | |
3168 | the initialization. */ | |
3169 | ||
3170 | static void | |
3171 | finish_static_initialization_or_destruction (sentry_if_stmt) | |
3172 | tree sentry_if_stmt; | |
3173 | { | |
3174 | finish_then_clause (sentry_if_stmt); | |
3175 | finish_if_stmt (); | |
3176 | ||
3177 | /* Now that we're done with DECL we don't need to pretend to be a | |
3178 | member of its class any longer. */ | |
4f1c5b7d | 3179 | DECL_CONTEXT (current_function_decl) = NULL_TREE; |
313bc2c2 MM |
3180 | DECL_STATIC_FUNCTION_P (current_function_decl) = 0; |
3181 | } | |
3182 | ||
0aafb128 MM |
3183 | /* Generate code to do the static initialization of DECL. The |
3184 | initialization is INIT. If DECL may be initialized more than once | |
3185 | in different object files, SENTRY is the guard variable to | |
3186 | check. PRIORITY is the priority for the initialization. */ | |
961ec1a5 | 3187 | |
0aafb128 | 3188 | static void |
313bc2c2 | 3189 | do_static_initialization (decl, init) |
0aafb128 MM |
3190 | tree decl; |
3191 | tree init; | |
0aafb128 | 3192 | { |
313bc2c2 MM |
3193 | tree expr; |
3194 | tree sentry_if_stmt; | |
961ec1a5 | 3195 | |
313bc2c2 MM |
3196 | /* Set up for the initialization. */ |
3197 | sentry_if_stmt | |
3198 | = start_static_initialization_or_destruction (decl, | |
3199 | /*initp=*/1); | |
0aafb128 | 3200 | |
313bc2c2 | 3201 | /* Do the initialization itself. */ |
0aafb128 MM |
3202 | if (IS_AGGR_TYPE (TREE_TYPE (decl)) |
3203 | || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
313bc2c2 | 3204 | expr = build_aggr_init (decl, init, 0); |
0aafb128 | 3205 | else if (TREE_CODE (init) == TREE_VEC) |
313bc2c2 MM |
3206 | expr = build_vec_init (decl, TREE_VEC_ELT (init, 0), |
3207 | TREE_VEC_ELT (init, 1), | |
3208 | TREE_VEC_ELT (init, 2), 0); | |
0aafb128 | 3209 | else |
313bc2c2 MM |
3210 | { |
3211 | expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init); | |
3212 | TREE_SIDE_EFFECTS (expr) = 1; | |
3213 | } | |
3214 | finish_expr_stmt (expr); | |
961ec1a5 | 3215 | |
bf419747 MM |
3216 | /* If we're using __cxa_atexit, register a a function that calls the |
3217 | destructor for the object. */ | |
3218 | if (flag_use_cxa_atexit) | |
3219 | register_dtor_fn (decl); | |
3220 | ||
313bc2c2 MM |
3221 | /* Finsh up. */ |
3222 | finish_static_initialization_or_destruction (sentry_if_stmt); | |
0aafb128 | 3223 | } |
961ec1a5 | 3224 | |
0aafb128 MM |
3225 | /* Generate code to do the static destruction of DECL. If DECL may be |
3226 | initialized more than once in different object files, SENTRY is the | |
3227 | guard variable to check. PRIORITY is the priority for the | |
3228 | destruction. */ | |
3229 | ||
3230 | static void | |
313bc2c2 | 3231 | do_static_destruction (decl) |
0aafb128 | 3232 | tree decl; |
0aafb128 | 3233 | { |
313bc2c2 | 3234 | tree sentry_if_stmt; |
961ec1a5 | 3235 | |
bf419747 MM |
3236 | /* If we're using __cxa_atexit, then destructors are registered |
3237 | immediately after objects are initialized. */ | |
3238 | my_friendly_assert (!flag_use_cxa_atexit, 20000121); | |
3239 | ||
0aafb128 MM |
3240 | /* If we don't need a destructor, there's nothing to do. */ |
3241 | if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl))) | |
3242 | return; | |
bf419747 | 3243 | |
f1dedc31 | 3244 | /* Actually do the destruction. */ |
313bc2c2 MM |
3245 | sentry_if_stmt = start_static_initialization_or_destruction (decl, |
3246 | /*initp=*/0); | |
3247 | finish_expr_stmt (build_cleanup (decl)); | |
3248 | finish_static_initialization_or_destruction (sentry_if_stmt); | |
961ec1a5 JM |
3249 | } |
3250 | ||
313bc2c2 MM |
3251 | /* VARS is a list of variables with static storage duration which may |
3252 | need initialization and/or finalization. Remove those variables | |
3253 | that don't really need to be initialized or finalized, and return | |
3254 | the resulting list. The order in which the variables appear in | |
3255 | VARS is in reverse order of the order in which they should actually | |
3256 | be initialized. The list we return is in the unreversed order; | |
3257 | i.e., the first variable should be initialized first. */ | |
8d08fdba | 3258 | |
313bc2c2 MM |
3259 | static tree |
3260 | prune_vars_needing_no_initialization (vars) | |
3261 | tree vars; | |
8d08fdba | 3262 | { |
313bc2c2 MM |
3263 | tree var; |
3264 | tree result; | |
8d08fdba | 3265 | |
313bc2c2 MM |
3266 | for (var = vars, result = NULL_TREE; |
3267 | var; | |
3268 | var = TREE_CHAIN (var)) | |
3269 | { | |
3270 | tree decl = TREE_VALUE (var); | |
3271 | tree init = TREE_PURPOSE (var); | |
8d2733ca | 3272 | |
313bc2c2 MM |
3273 | /* Deal gracefully with error. */ |
3274 | if (decl == error_mark_node) | |
3275 | continue; | |
5566b478 | 3276 | |
313bc2c2 MM |
3277 | /* The only things that can be initialized are variables. */ |
3278 | my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420); | |
8d08fdba | 3279 | |
313bc2c2 MM |
3280 | /* If this object is not defined, we don't need to do anything |
3281 | here. */ | |
3282 | if (DECL_EXTERNAL (decl)) | |
3283 | continue; | |
8d08fdba | 3284 | |
313bc2c2 MM |
3285 | /* Also, if the initializer already contains errors, we can bail |
3286 | out now. */ | |
3287 | if (init && TREE_CODE (init) == TREE_LIST | |
3288 | && value_member (error_mark_node, init)) | |
3289 | continue; | |
d18c083e | 3290 | |
313bc2c2 MM |
3291 | /* This variable is going to need initialization and/or |
3292 | finalization, so we add it to the list. */ | |
3293 | result = tree_cons (init, decl, result); | |
3294 | } | |
1139b3d8 | 3295 | |
313bc2c2 MM |
3296 | return result; |
3297 | } | |
1139b3d8 | 3298 | |
313bc2c2 MM |
3299 | /* Make sure we have told the back end about all the variables in |
3300 | VARS. */ | |
0aafb128 | 3301 | |
313bc2c2 MM |
3302 | static void |
3303 | write_out_vars (vars) | |
3304 | tree vars; | |
3305 | { | |
3306 | tree v; | |
0aafb128 | 3307 | |
313bc2c2 MM |
3308 | for (v = vars; v; v = TREE_CHAIN (v)) |
3309 | if (! TREE_ASM_WRITTEN (TREE_VALUE (v))) | |
3310 | rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1); | |
0aafb128 | 3311 | } |
909e536a | 3312 | |
0aafb128 MM |
3313 | /* Generate a static constructor (if CONSTRUCTOR_P) or destructor |
3314 | (otherwise) that will initialize all gobal objects with static | |
3315 | storage duration having the indicated PRIORITY. */ | |
73aad9b9 | 3316 | |
0aafb128 MM |
3317 | static void |
3318 | generate_ctor_or_dtor_function (constructor_p, priority) | |
3319 | int constructor_p; | |
3320 | int priority; | |
3321 | { | |
3322 | char function_key; | |
3323 | tree arguments; | |
914653a2 | 3324 | tree body; |
0352cfc8 | 3325 | size_t i; |
73aad9b9 | 3326 | |
0aafb128 MM |
3327 | /* We use `I' to indicate initialization and `D' to indicate |
3328 | destruction. */ | |
3329 | if (constructor_p) | |
3330 | function_key = 'I'; | |
3331 | else | |
3332 | function_key = 'D'; | |
73aad9b9 | 3333 | |
0aafb128 | 3334 | /* Begin the function. */ |
914653a2 | 3335 | body = start_objects (function_key, priority); |
2c73f9f5 | 3336 | |
0aafb128 MM |
3337 | /* Call the static storage duration function with appropriate |
3338 | arguments. */ | |
2c0f17dc | 3339 | for (i = 0; i < ssdf_decls->elements_used; ++i) |
0352cfc8 MM |
3340 | { |
3341 | arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0), | |
3342 | NULL_TREE); | |
3343 | arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0), | |
3344 | arguments); | |
914653a2 | 3345 | finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i), |
0352cfc8 MM |
3346 | arguments)); |
3347 | } | |
909e536a | 3348 | |
0aafb128 MM |
3349 | /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in |
3350 | calls to any functions marked with attributes indicating that | |
3351 | they should be called at initialization- or destruction-time. */ | |
3352 | if (priority == DEFAULT_INIT_PRIORITY) | |
3353 | { | |
3354 | tree fns; | |
3355 | ||
3356 | for (fns = constructor_p ? static_ctors : static_dtors; | |
3357 | fns; | |
3358 | fns = TREE_CHAIN (fns)) | |
914653a2 | 3359 | finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE)); |
0aafb128 | 3360 | } |
28cbf42c | 3361 | |
0aafb128 | 3362 | /* Close out the function. */ |
914653a2 | 3363 | finish_objects (function_key, priority, body); |
0aafb128 | 3364 | } |
44a8d0b3 | 3365 | |
0aafb128 | 3366 | /* Generate constructor and destructor functions for the priority |
0352cfc8 | 3367 | indicated by N. */ |
44a8d0b3 | 3368 | |
0aafb128 MM |
3369 | static int |
3370 | generate_ctor_and_dtor_functions_for_priority (n, data) | |
3371 | splay_tree_node n; | |
0352cfc8 | 3372 | void *data ATTRIBUTE_UNUSED; |
0aafb128 MM |
3373 | { |
3374 | int priority = (int) n->key; | |
3375 | priority_info pi = (priority_info) n->value; | |
0aafb128 MM |
3376 | |
3377 | /* Generate the functions themselves, but only if they are really | |
3378 | needed. */ | |
0352cfc8 | 3379 | if (pi->initializations_p |
0aafb128 MM |
3380 | || (priority == DEFAULT_INIT_PRIORITY && static_ctors)) |
3381 | generate_ctor_or_dtor_function (/*constructor_p=*/1, | |
3382 | priority); | |
0352cfc8 | 3383 | if (pi->destructions_p |
0aafb128 MM |
3384 | || (priority == DEFAULT_INIT_PRIORITY && static_dtors)) |
3385 | generate_ctor_or_dtor_function (/*constructor_p=*/0, | |
3386 | priority); | |
3387 | ||
3388 | /* Keep iterating. */ | |
3389 | return 0; | |
3390 | } | |
2ce3c6c6 | 3391 | |
0aafb128 MM |
3392 | /* This routine is called from the last rule in yyparse (). |
3393 | Its job is to create all the code needed to initialize and | |
3394 | destroy the global aggregates. We do the destruction | |
3395 | first, since that way we only need to reverse the decls once. */ | |
44a8d0b3 | 3396 | |
0aafb128 MM |
3397 | void |
3398 | finish_file () | |
3399 | { | |
3400 | extern int lineno; | |
3401 | int start_time, this_time; | |
0aafb128 MM |
3402 | tree vars; |
3403 | int reconsider; | |
3404 | size_t i; | |
8d08fdba | 3405 | |
0aafb128 | 3406 | at_eof = 1; |
faae18ab | 3407 | |
0aafb128 MM |
3408 | /* Bad parse errors. Just forget about it. */ |
3409 | if (! global_bindings_p () || current_class_type || decl_namespace_list) | |
3410 | return; | |
8d08fdba | 3411 | |
0aafb128 | 3412 | start_time = get_run_time (); |
ea735e02 | 3413 | |
0aafb128 MM |
3414 | /* Otherwise, GDB can get confused, because in only knows |
3415 | about source for LINENO-1 lines. */ | |
3416 | lineno -= 1; | |
5566b478 | 3417 | |
0aafb128 MM |
3418 | interface_unknown = 1; |
3419 | interface_only = 0; | |
ea735e02 | 3420 | |
0aafb128 MM |
3421 | /* We now have to write out all the stuff we put off writing out. |
3422 | These include: | |
d2e5ee5c | 3423 | |
0aafb128 MM |
3424 | o Template specializations that we have not yet instantiated, |
3425 | but which are needed. | |
3426 | o Initialization and destruction for non-local objects with | |
3427 | static storage duration. (Local objects with static storage | |
3428 | duration are initialized when their scope is first entered, | |
3429 | and are cleaned up via atexit.) | |
3430 | o Virtual function tables. | |
ea735e02 | 3431 | |
0aafb128 MM |
3432 | All of these may cause others to be needed. For example, |
3433 | instantiating one function may cause another to be needed, and | |
3434 | generating the intiailzer for an object may cause templates to be | |
3435 | instantiated, etc., etc. */ | |
8d08fdba MS |
3436 | |
3437 | this_time = get_run_time (); | |
3438 | parse_time -= this_time - start_time; | |
3439 | varconst_time += this_time - start_time; | |
8d08fdba MS |
3440 | start_time = get_run_time (); |
3441 | ||
7267d692 NS |
3442 | if (new_abi_rtti_p ()) |
3443 | emit_support_tinfos (); | |
3444 | ||
0aafb128 MM |
3445 | do |
3446 | { | |
3447 | reconsider = 0; | |
3448 | ||
1a6580ec MM |
3449 | /* If there are templates that we've put off instantiating, do |
3450 | them now. */ | |
0aafb128 MM |
3451 | instantiate_pending_templates (); |
3452 | ||
6eabb241 MM |
3453 | /* Write out virtual tables as required. Note that writing out |
3454 | the virtual table for a template class may cause the | |
3455 | instantiation of members of that class. */ | |
0aafb128 MM |
3456 | if (walk_globals (vtable_decl_p, |
3457 | finish_vtable_vardecl, | |
3458 | /*data=*/0)) | |
3459 | reconsider = 1; | |
3460 | ||
7267d692 NS |
3461 | /* Write out needed type info variables. Writing out one variable |
3462 | might cause others to be needed. */ | |
3463 | if (new_abi_rtti_p () | |
3464 | && walk_globals (tinfo_decl_p, emit_tinfo_decl, /*data=*/0)) | |
3465 | reconsider = 1; | |
3466 | ||
0aafb128 | 3467 | /* The list of objects with static storage duration is built up |
313bc2c2 MM |
3468 | in reverse order. We clear STATIC_AGGREGATES so that any new |
3469 | aggregates added during the initialization of these will be | |
3470 | initialized in the correct order when we next come around the | |
3471 | loop. */ | |
3472 | vars = prune_vars_needing_no_initialization (static_aggregates); | |
0aafb128 | 3473 | static_aggregates = NULL_TREE; |
c472cdfd | 3474 | |
313bc2c2 MM |
3475 | if (vars) |
3476 | { | |
3477 | tree v; | |
3478 | ||
3479 | /* We need to start a new initialization function each time | |
3480 | through the loop. That's because we need to know which | |
3481 | vtables have been referenced, and TREE_SYMBOL_REFERENCED | |
3482 | isn't computed until a function is finished, and written | |
3483 | out. That's a deficiency in the back-end. When this is | |
3484 | fixed, these initialization functions could all become | |
3485 | inline, with resulting performance improvements. */ | |
3486 | tree ssdf_body = start_static_storage_duration_function (); | |
3487 | ||
3488 | /* Make sure the back end knows about all the variables. */ | |
3489 | write_out_vars (vars); | |
3490 | ||
3491 | /* First generate code to do all the initializations. */ | |
3492 | for (v = vars; v; v = TREE_CHAIN (v)) | |
3493 | do_static_initialization (TREE_VALUE (v), | |
3494 | TREE_PURPOSE (v)); | |
3495 | ||
3496 | /* Then, generate code to do all the destructions. Do these | |
3497 | in reverse order so that the most recently constructed | |
bf419747 MM |
3498 | variable is the first destroyed. If we're using |
3499 | __cxa_atexit, then we don't need to do this; functions | |
3500 | we're registered at initialization time to destroy the | |
3501 | local statics. */ | |
3502 | if (!flag_use_cxa_atexit) | |
3503 | { | |
3504 | vars = nreverse (vars); | |
3505 | for (v = vars; v; v = TREE_CHAIN (v)) | |
3506 | do_static_destruction (TREE_VALUE (v)); | |
3507 | } | |
3508 | else | |
3509 | vars = NULL_TREE; | |
313bc2c2 MM |
3510 | |
3511 | /* Finish up the static storage duration function for this | |
3512 | round. */ | |
3513 | finish_static_storage_duration_function (ssdf_body); | |
3514 | ||
3515 | /* All those initializations and finalizations might cause | |
3516 | us to need more inline functions, more template | |
3517 | instantiations, etc. */ | |
0aafb128 | 3518 | reconsider = 1; |
0aafb128 | 3519 | } |
0aafb128 MM |
3520 | |
3521 | /* Go through the various inline functions, and see if any need | |
3522 | synthesizing. */ | |
3523 | for (i = 0; i < saved_inlines_used; ++i) | |
3524 | { | |
3525 | tree decl = VARRAY_TREE (saved_inlines, i); | |
3526 | import_export_decl (decl); | |
3527 | if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl) | |
3528 | && TREE_USED (decl) | |
3529 | && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl))) | |
3530 | { | |
3531 | /* Even though we're already at the top-level, we push | |
3532 | there again. That way, when we pop back a few lines | |
3533 | hence, all of our state is restored. Otherwise, | |
3534 | finish_function doesn't clean things up, and we end | |
3535 | up with CURRENT_FUNCTION_DECL set. */ | |
3536 | push_to_top_level (); | |
3537 | if (DECL_TINFO_FN_P (decl)) | |
3538 | synthesize_tinfo_fn (decl); | |
3539 | else | |
3540 | synthesize_method (decl); | |
3541 | pop_from_top_level (); | |
3542 | reconsider = 1; | |
3543 | } | |
3544 | } | |
0aafb128 | 3545 | |
0352cfc8 MM |
3546 | /* Mark all functions that might deal with exception-handling as |
3547 | referenced. */ | |
3548 | mark_all_runtime_matches (); | |
0aafb128 | 3549 | |
0352cfc8 MM |
3550 | /* We lie to the back-end, pretending that some functions are |
3551 | not defined when they really are. This keeps these functions | |
3552 | from being put out unncessarily. But, we must stop lying | |
3553 | when the functions are referenced, or if they are not comdat | |
3554 | since they need to be put out now. */ | |
4cb02ea1 MM |
3555 | for (i = 0; i < saved_inlines_used; ++i) |
3556 | { | |
3557 | tree decl = VARRAY_TREE (saved_inlines, i); | |
3558 | ||
3559 | if (DECL_NOT_REALLY_EXTERN (decl) | |
3560 | && DECL_INITIAL (decl) | |
7c913d33 | 3561 | && DECL_NEEDED_P (decl)) |
4cb02ea1 | 3562 | DECL_EXTERNAL (decl) = 0; |
21b0c6dc MM |
3563 | |
3564 | /* If we're going to need to write this function out, and | |
3565 | there's already a body for it, create RTL for it now. | |
3566 | (There might be no body if this is a method we haven't | |
3567 | gotten around to synthesizing yet.) */ | |
3568 | if (!DECL_EXTERNAL (decl) | |
7c913d33 | 3569 | && DECL_NEEDED_P (decl) |
21b0c6dc MM |
3570 | && DECL_SAVED_TREE (decl) |
3571 | && !DECL_SAVED_INSNS (decl) | |
3572 | && !TREE_ASM_WRITTEN (decl)) | |
3573 | { | |
3574 | int saved_not_really_extern; | |
3575 | ||
3576 | /* When we call finish_function in expand_body, it will | |
3577 | try to reset DECL_NOT_REALLY_EXTERN so we save and | |
3578 | restore it here. */ | |
1c1c0761 | 3579 | saved_not_really_extern = DECL_NOT_REALLY_EXTERN (decl); |
21b0c6dc MM |
3580 | /* Generate RTL for this function now that we know we |
3581 | need it. */ | |
3582 | expand_body (decl); | |
3583 | /* Undo the damage done by finish_function. */ | |
3584 | DECL_EXTERNAL (decl) = 0; | |
3585 | DECL_NOT_REALLY_EXTERN (decl) = saved_not_really_extern; | |
3586 | /* If we're compiling -fsyntax-only pretend that this | |
3587 | function has been written out so that we don't try to | |
3588 | expand it again. */ | |
3589 | if (flag_syntax_only) | |
3590 | TREE_ASM_WRITTEN (decl) = 1; | |
3591 | reconsider = 1; | |
3592 | } | |
4cb02ea1 MM |
3593 | } |
3594 | ||
3595 | if (saved_inlines_used | |
3596 | && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0), | |
3597 | saved_inlines_used)) | |
3598 | reconsider = 1; | |
4cb02ea1 MM |
3599 | if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0)) |
3600 | reconsider = 1; | |
0aafb128 MM |
3601 | |
3602 | /* Static data members are just like namespace-scope globals. */ | |
3603 | for (i = 0; i < pending_statics_used; ++i) | |
3604 | { | |
3605 | tree decl = VARRAY_TREE (pending_statics, i); | |
3606 | if (TREE_ASM_WRITTEN (decl)) | |
3607 | continue; | |
3608 | import_export_decl (decl); | |
3609 | if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl)) | |
3610 | DECL_EXTERNAL (decl) = 0; | |
3611 | } | |
4cb02ea1 MM |
3612 | if (pending_statics |
3613 | && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0), | |
3614 | pending_statics_used)) | |
3615 | reconsider = 1; | |
0352cfc8 | 3616 | } |
0aafb128 | 3617 | while (reconsider); |
28cbf42c | 3618 | |
0352cfc8 MM |
3619 | /* We give C linkage to static constructors and destructors. */ |
3620 | push_lang_context (lang_name_c); | |
3621 | ||
3622 | /* Generate initialization and destruction functions for all | |
3623 | priorities for which they are required. */ | |
3624 | if (priority_info_map) | |
3625 | splay_tree_foreach (priority_info_map, | |
3626 | generate_ctor_and_dtor_functions_for_priority, | |
3627 | /*data=*/0); | |
3628 | ||
3629 | /* We're done with the splay-tree now. */ | |
3630 | if (priority_info_map) | |
3631 | splay_tree_delete (priority_info_map); | |
3632 | ||
3633 | /* We're done with static constructors, so we can go back to "C++" | |
3634 | linkage now. */ | |
3635 | pop_lang_context (); | |
3636 | ||
3637 | /* Now delete from the chain of variables all virtual function tables. | |
3638 | We output them all ourselves, because each will be treated | |
84df082b MM |
3639 | specially. We don't do this if we're just doing semantic |
3640 | analysis, and not code-generation. */ | |
3641 | if (!flag_syntax_only) | |
3642 | walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0); | |
0352cfc8 | 3643 | |
0aafb128 | 3644 | /* Now, issue warnings about static, but not defined, functions, |
033ed340 | 3645 | etc., and emit debugging information. */ |
0aafb128 | 3646 | walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider); |
033ed340 JM |
3647 | if (pending_statics) |
3648 | check_global_declarations (&VARRAY_TREE (pending_statics, 0), | |
3649 | pending_statics_used); | |
b7484fbe | 3650 | |
faae18ab MS |
3651 | finish_repo (); |
3652 | ||
f71f87f9 | 3653 | /* The entire file is now complete. If requested, dump everything |
ed5511d9 | 3654 | to a file. */ |
f71f87f9 MM |
3655 | if (flag_dump_translation_unit) |
3656 | dump_node_to_file (global_namespace, flag_dump_translation_unit); | |
3657 | ||
1b12a13e MM |
3658 | /* If there's some tool that wants to examine the entire translation |
3659 | unit, let it do so now. */ | |
3660 | if (back_end_hook) | |
3661 | (*back_end_hook) (global_namespace); | |
3662 | ||
8d08fdba MS |
3663 | this_time = get_run_time (); |
3664 | parse_time -= this_time - start_time; | |
3665 | varconst_time += this_time - start_time; | |
3666 | ||
3667 | if (flag_detailed_statistics) | |
27bb8339 JM |
3668 | { |
3669 | dump_tree_statistics (); | |
3670 | dump_time_statistics (); | |
3671 | } | |
8d08fdba | 3672 | } |
51c184be MS |
3673 | |
3674 | /* This is something of the form 'A()()()()()+1' that has turned out to be an | |
3675 | expr. Since it was parsed like a type, we need to wade through and fix | |
3676 | that. Unfortunately, since operator() is left-associative, we can't use | |
3677 | tail recursion. In the above example, TYPE is `A', and DECL is | |
3678 | `()()()()()'. | |
3679 | ||
3680 | Maybe this shouldn't be recursive, but how often will it actually be | |
3681 | used? (jason) */ | |
e92cc029 | 3682 | |
51c184be MS |
3683 | tree |
3684 | reparse_absdcl_as_expr (type, decl) | |
3685 | tree type, decl; | |
3686 | { | |
3687 | /* do build_functional_cast (type, NULL_TREE) at bottom */ | |
3688 | if (TREE_OPERAND (decl, 0) == NULL_TREE) | |
3689 | return build_functional_cast (type, NULL_TREE); | |
3690 | ||
3691 | /* recurse */ | |
d8f8dca1 | 3692 | decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0)); |
51c184be | 3693 | |
4ac14744 | 3694 | decl = build_x_function_call (decl, NULL_TREE, current_class_ref); |
51c184be | 3695 | |
66543169 NS |
3696 | if (TREE_CODE (decl) == CALL_EXPR |
3697 | && (! TREE_TYPE (decl) | |
3698 | || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE)) | |
51c184be MS |
3699 | decl = require_complete_type (decl); |
3700 | ||
3701 | return decl; | |
3702 | } | |
3703 | ||
3704 | /* This is something of the form `int ((int)(int)(int)1)' that has turned | |
3705 | out to be an expr. Since it was parsed like a type, we need to wade | |
3706 | through and fix that. Since casts are right-associative, we are | |
3707 | reversing the order, so we don't have to recurse. | |
3708 | ||
3709 | In the above example, DECL is the `(int)(int)(int)', and EXPR is the | |
3710 | `1'. */ | |
e92cc029 | 3711 | |
51c184be MS |
3712 | tree |
3713 | reparse_absdcl_as_casts (decl, expr) | |
3714 | tree decl, expr; | |
3715 | { | |
3716 | tree type; | |
3717 | ||
4ac14744 MS |
3718 | if (TREE_CODE (expr) == CONSTRUCTOR |
3719 | && TREE_TYPE (expr) == 0) | |
51c184be | 3720 | { |
43f887f9 | 3721 | type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl))); |
51c184be MS |
3722 | decl = TREE_OPERAND (decl, 0); |
3723 | ||
51c184be MS |
3724 | expr = digest_init (type, expr, (tree *) 0); |
3725 | if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0) | |
3726 | { | |
3727 | int failure = complete_array_type (type, expr, 1); | |
3728 | if (failure) | |
3729 | my_friendly_abort (78); | |
3730 | } | |
3731 | } | |
3732 | ||
3733 | while (decl) | |
3734 | { | |
43f887f9 | 3735 | type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl))); |
51c184be | 3736 | decl = TREE_OPERAND (decl, 0); |
faf5394a | 3737 | expr = build_c_cast (type, expr); |
51c184be MS |
3738 | } |
3739 | ||
1d02ac83 JM |
3740 | if (warn_old_style_cast && ! in_system_header |
3741 | && current_lang_name != lang_name_c) | |
8251199e | 3742 | warning ("use of old-style cast"); |
0c4b14c4 | 3743 | |
51c184be MS |
3744 | return expr; |
3745 | } | |
3746 | ||
e92cc029 | 3747 | /* Given plain tree nodes for an expression, build up the full semantics. */ |
5566b478 MS |
3748 | |
3749 | tree | |
3750 | build_expr_from_tree (t) | |
3751 | tree t; | |
51c184be | 3752 | { |
5566b478 MS |
3753 | if (t == NULL_TREE || t == error_mark_node) |
3754 | return t; | |
3755 | ||
3756 | switch (TREE_CODE (t)) | |
51c184be MS |
3757 | { |
3758 | case IDENTIFIER_NODE: | |
a759e627 | 3759 | return do_identifier (t, 0, NULL_TREE); |
5566b478 MS |
3760 | |
3761 | case LOOKUP_EXPR: | |
3762 | if (LOOKUP_EXPR_GLOBAL (t)) | |
3763 | return do_scoped_id (TREE_OPERAND (t, 0), 0); | |
3764 | else | |
a759e627 | 3765 | return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE); |
5566b478 | 3766 | |
386b8a85 | 3767 | case TEMPLATE_ID_EXPR: |
00d3396f JM |
3768 | return (lookup_template_function |
3769 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3770 | build_expr_from_tree (TREE_OPERAND (t, 1)))); | |
386b8a85 | 3771 | |
51c184be MS |
3772 | case INDIRECT_REF: |
3773 | return build_x_indirect_ref | |
5566b478 MS |
3774 | (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *"); |
3775 | ||
3776 | case CAST_EXPR: | |
3777 | return build_functional_cast | |
3778 | (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3779 | ||
3780 | case REINTERPRET_CAST_EXPR: | |
3781 | return build_reinterpret_cast | |
3782 | (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3783 | ||
e92cc029 MS |
3784 | case CONST_CAST_EXPR: |
3785 | return build_const_cast | |
3786 | (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3787 | ||
3788 | case DYNAMIC_CAST_EXPR: | |
3789 | return build_dynamic_cast | |
3790 | (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3791 | ||
3792 | case STATIC_CAST_EXPR: | |
3793 | return build_static_cast | |
3794 | (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3795 | ||
5566b478 MS |
3796 | case PREDECREMENT_EXPR: |
3797 | case PREINCREMENT_EXPR: | |
3798 | case POSTDECREMENT_EXPR: | |
3799 | case POSTINCREMENT_EXPR: | |
3800 | case NEGATE_EXPR: | |
51c184be | 3801 | case BIT_NOT_EXPR: |
5566b478 MS |
3802 | case ABS_EXPR: |
3803 | case TRUTH_NOT_EXPR: | |
3804 | case ADDR_EXPR: | |
3805 | case CONVERT_EXPR: /* Unary + */ | |
f5733617 SS |
3806 | case REALPART_EXPR: |
3807 | case IMAGPART_EXPR: | |
fc378698 MS |
3808 | if (TREE_TYPE (t)) |
3809 | return t; | |
5566b478 MS |
3810 | return build_x_unary_op (TREE_CODE (t), |
3811 | build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3812 | ||
3813 | case PLUS_EXPR: | |
3814 | case MINUS_EXPR: | |
3815 | case MULT_EXPR: | |
3816 | case TRUNC_DIV_EXPR: | |
3817 | case CEIL_DIV_EXPR: | |
3818 | case FLOOR_DIV_EXPR: | |
3819 | case ROUND_DIV_EXPR: | |
3820 | case EXACT_DIV_EXPR: | |
3821 | case BIT_AND_EXPR: | |
3822 | case BIT_ANDTC_EXPR: | |
3823 | case BIT_IOR_EXPR: | |
3824 | case BIT_XOR_EXPR: | |
3825 | case TRUNC_MOD_EXPR: | |
3826 | case FLOOR_MOD_EXPR: | |
3827 | case TRUTH_ANDIF_EXPR: | |
3828 | case TRUTH_ORIF_EXPR: | |
3829 | case TRUTH_AND_EXPR: | |
3830 | case TRUTH_OR_EXPR: | |
3831 | case RSHIFT_EXPR: | |
3832 | case LSHIFT_EXPR: | |
3833 | case RROTATE_EXPR: | |
3834 | case LROTATE_EXPR: | |
3835 | case EQ_EXPR: | |
3836 | case NE_EXPR: | |
3837 | case MAX_EXPR: | |
3838 | case MIN_EXPR: | |
3839 | case LE_EXPR: | |
3840 | case GE_EXPR: | |
3841 | case LT_EXPR: | |
3842 | case GT_EXPR: | |
3843 | case MEMBER_REF: | |
3844 | return build_x_binary_op | |
3845 | (TREE_CODE (t), | |
3846 | build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3847 | build_expr_from_tree (TREE_OPERAND (t, 1))); | |
3848 | ||
3849 | case DOTSTAR_EXPR: | |
3850 | return build_m_component_ref | |
3851 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3852 | build_expr_from_tree (TREE_OPERAND (t, 1))); | |
3853 | ||
a28e3c7f | 3854 | case SCOPE_REF: |
5566b478 MS |
3855 | return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1)); |
3856 | ||
a28e3c7f | 3857 | case ARRAY_REF: |
5566b478 MS |
3858 | if (TREE_OPERAND (t, 0) == NULL_TREE) |
3859 | /* new-type-id */ | |
3860 | return build_parse_node (ARRAY_REF, NULL_TREE, | |
3861 | build_expr_from_tree (TREE_OPERAND (t, 1))); | |
3862 | return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3863 | build_expr_from_tree (TREE_OPERAND (t, 1))); | |
3864 | ||
3865 | case SIZEOF_EXPR: | |
abff8e06 | 3866 | case ALIGNOF_EXPR: |
5566b478 MS |
3867 | { |
3868 | tree r = build_expr_from_tree (TREE_OPERAND (t, 0)); | |
3869 | if (TREE_CODE_CLASS (TREE_CODE (r)) != 't') | |
3870 | r = TREE_TYPE (r); | |
abff8e06 | 3871 | return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r); |
5566b478 MS |
3872 | } |
3873 | ||
3874 | case MODOP_EXPR: | |
3875 | return build_x_modify_expr | |
3876 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3877 | TREE_CODE (TREE_OPERAND (t, 1)), | |
3878 | build_expr_from_tree (TREE_OPERAND (t, 2))); | |
3879 | ||
3880 | case ARROW_EXPR: | |
3881 | return build_x_arrow | |
3882 | (build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3883 | ||
3884 | case NEW_EXPR: | |
3885 | return build_new | |
3886 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3887 | build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3888 | build_expr_from_tree (TREE_OPERAND (t, 2)), | |
3889 | NEW_EXPR_USE_GLOBAL (t)); | |
3890 | ||
3891 | case DELETE_EXPR: | |
3892 | return delete_sanity | |
3893 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3894 | build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3895 | DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t)); | |
3896 | ||
3897 | case COMPOUND_EXPR: | |
3898 | if (TREE_OPERAND (t, 1) == NULL_TREE) | |
3899 | return build_x_compound_expr | |
3900 | (build_expr_from_tree (TREE_OPERAND (t, 0))); | |
3901 | else | |
3902 | my_friendly_abort (42); | |
3903 | ||
3904 | case METHOD_CALL_EXPR: | |
3905 | if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF) | |
3906 | { | |
3907 | tree ref = TREE_OPERAND (t, 0); | |
3908 | return build_scoped_method_call | |
3909 | (build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3910 | build_expr_from_tree (TREE_OPERAND (ref, 0)), | |
3911 | TREE_OPERAND (ref, 1), | |
3912 | build_expr_from_tree (TREE_OPERAND (t, 2))); | |
3913 | } | |
d8f8dca1 MM |
3914 | else |
3915 | { | |
3916 | tree fn = TREE_OPERAND (t, 0); | |
074917ba | 3917 | |
d8f8dca1 MM |
3918 | /* We can get a TEMPLATE_ID_EXPR here on code like: |
3919 | ||
3920 | x->f<2>(); | |
3921 | ||
3922 | so we must resolve that. However, we can also get things | |
3923 | like a BIT_NOT_EXPR here, when referring to a destructor, | |
3924 | and things like that are not correctly resolved by | |
3925 | build_expr_from_tree. So, just use build_expr_from_tree | |
3926 | when we really need it. */ | |
3927 | if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) | |
074917ba JM |
3928 | fn = lookup_template_function |
3929 | (TREE_OPERAND (fn, 0), | |
3930 | build_expr_from_tree (TREE_OPERAND (fn, 1))); | |
d8f8dca1 MM |
3931 | |
3932 | return build_method_call | |
3933 | (build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3934 | fn, | |
3935 | build_expr_from_tree (TREE_OPERAND (t, 2)), | |
3936 | NULL_TREE, LOOKUP_NORMAL); | |
3937 | } | |
5566b478 MS |
3938 | |
3939 | case CALL_EXPR: | |
3940 | if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF) | |
3941 | { | |
3942 | tree ref = TREE_OPERAND (t, 0); | |
3943 | return build_member_call | |
3944 | (build_expr_from_tree (TREE_OPERAND (ref, 0)), | |
3945 | TREE_OPERAND (ref, 1), | |
3946 | build_expr_from_tree (TREE_OPERAND (t, 1))); | |
3947 | } | |
3948 | else | |
3949 | { | |
3950 | tree name = TREE_OPERAND (t, 0); | |
a759e627 ML |
3951 | tree id; |
3952 | tree args = build_expr_from_tree (TREE_OPERAND (t, 1)); | |
3953 | if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR | |
3954 | && !LOOKUP_EXPR_GLOBAL (name) | |
3955 | && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE | |
3956 | && (!current_class_type | |
3957 | || !lookup_member (current_class_type, id, 0, 0))) | |
3958 | { | |
3959 | /* Do Koenig lookup if there are no class members. */ | |
3960 | name = do_identifier (id, 0, args); | |
3961 | } | |
3962 | else if (TREE_CODE (name) == TEMPLATE_ID_EXPR | |
00d3396f | 3963 | || ! really_overloaded_fn (name)) |
5566b478 | 3964 | name = build_expr_from_tree (name); |
a759e627 | 3965 | return build_x_function_call (name, args, current_class_ref); |
5566b478 MS |
3966 | } |
3967 | ||
3968 | case COND_EXPR: | |
3969 | return build_x_conditional_expr | |
3970 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3971 | build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3972 | build_expr_from_tree (TREE_OPERAND (t, 2))); | |
3973 | ||
40242ccf MM |
3974 | case PSEUDO_DTOR_EXPR: |
3975 | return (finish_pseudo_destructor_call_expr | |
3976 | (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
3977 | build_expr_from_tree (TREE_OPERAND (t, 1)), | |
3978 | build_expr_from_tree (TREE_OPERAND (t, 2)))); | |
3979 | ||
5566b478 MS |
3980 | case TREE_LIST: |
3981 | { | |
3982 | tree purpose, value, chain; | |
3983 | ||
3984 | if (t == void_list_node) | |
3985 | return t; | |
3986 | ||
3987 | purpose = TREE_PURPOSE (t); | |
3988 | if (purpose) | |
3989 | purpose = build_expr_from_tree (purpose); | |
3990 | value = TREE_VALUE (t); | |
3991 | if (value) | |
3992 | value = build_expr_from_tree (value); | |
3993 | chain = TREE_CHAIN (t); | |
3994 | if (chain && chain != void_type_node) | |
3995 | chain = build_expr_from_tree (chain); | |
e1b3e07d | 3996 | return tree_cons (purpose, value, chain); |
5566b478 MS |
3997 | } |
3998 | ||
3999 | case COMPONENT_REF: | |
74322f31 MM |
4000 | { |
4001 | tree object = build_expr_from_tree (TREE_OPERAND (t, 0)); | |
4002 | tree field = TREE_OPERAND (t, 1); | |
4003 | ||
4004 | /* We use a COMPONENT_REF to indicate things of the form `x.b' | |
4005 | and `x.A::b'. We must distinguish between those cases | |
4006 | here. */ | |
4007 | if (TREE_CODE (field) == SCOPE_REF) | |
4008 | return build_object_ref (object, | |
4009 | TREE_OPERAND (field, 0), | |
4010 | TREE_OPERAND (field, 1)); | |
4011 | else | |
4012 | return build_x_component_ref (object, field, | |
4013 | NULL_TREE, 1); | |
4014 | } | |
4015 | ||
fc378698 MS |
4016 | case THROW_EXPR: |
4017 | return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0))); | |
4018 | ||
5156628f MS |
4019 | case CONSTRUCTOR: |
4020 | { | |
2fcdec57 JM |
4021 | tree r; |
4022 | ||
4023 | /* digest_init will do the wrong thing if we let it. */ | |
4024 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))) | |
4025 | return t; | |
4026 | ||
4027 | r = build_nt (CONSTRUCTOR, NULL_TREE, | |
4028 | build_expr_from_tree (CONSTRUCTOR_ELTS (t))); | |
8452b1d3 | 4029 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
5156628f MS |
4030 | |
4031 | if (TREE_TYPE (t)) | |
4032 | return digest_init (TREE_TYPE (t), r, 0); | |
4033 | return r; | |
4034 | } | |
4035 | ||
4036 | case TYPEID_EXPR: | |
e9f32eb5 MS |
4037 | if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't') |
4038 | return get_typeid (TREE_OPERAND (t, 0)); | |
e5f614d7 | 4039 | return build_typeid (build_expr_from_tree (TREE_OPERAND (t, 0))); |
5156628f | 4040 | |
9a3b49ac MS |
4041 | case VAR_DECL: |
4042 | return convert_from_reference (t); | |
4043 | ||
371534a9 MM |
4044 | case VA_ARG_EXPR: |
4045 | return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)), | |
4046 | TREE_TYPE (t)); | |
4047 | ||
8926095f | 4048 | default: |
5566b478 | 4049 | return t; |
51c184be | 4050 | } |
51c184be MS |
4051 | } |
4052 | ||
4053 | /* This is something of the form `int (*a)++' that has turned out to be an | |
4054 | expr. It was only converted into parse nodes, so we need to go through | |
4055 | and build up the semantics. Most of the work is done by | |
5566b478 | 4056 | build_expr_from_tree, above. |
51c184be MS |
4057 | |
4058 | In the above example, TYPE is `int' and DECL is `*a'. */ | |
e92cc029 | 4059 | |
51c184be MS |
4060 | tree |
4061 | reparse_decl_as_expr (type, decl) | |
4062 | tree type, decl; | |
4063 | { | |
5566b478 | 4064 | decl = build_expr_from_tree (decl); |
e3417fcd | 4065 | if (type) |
051e6fd7 | 4066 | return build_functional_cast (type, build_tree_list (NULL_TREE, decl)); |
e3417fcd MS |
4067 | else |
4068 | return decl; | |
51c184be MS |
4069 | } |
4070 | ||
4071 | /* This is something of the form `int (*a)' that has turned out to be a | |
4072 | decl. It was only converted into parse nodes, so we need to do the | |
e92cc029 | 4073 | checking that make_{pointer,reference}_declarator do. */ |
51c184be MS |
4074 | |
4075 | tree | |
4076 | finish_decl_parsing (decl) | |
4077 | tree decl; | |
4078 | { | |
8926095f MS |
4079 | extern int current_class_depth; |
4080 | ||
51c184be MS |
4081 | switch (TREE_CODE (decl)) |
4082 | { | |
4083 | case IDENTIFIER_NODE: | |
4084 | return decl; | |
4085 | case INDIRECT_REF: | |
4086 | return make_pointer_declarator | |
4087 | (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0))); | |
4088 | case ADDR_EXPR: | |
4089 | return make_reference_declarator | |
4090 | (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0))); | |
4091 | case BIT_NOT_EXPR: | |
4092 | TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0)); | |
4093 | return decl; | |
8926095f | 4094 | case SCOPE_REF: |
a4443a08 | 4095 | push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3); |
8926095f MS |
4096 | TREE_COMPLEXITY (decl) = current_class_depth; |
4097 | return decl; | |
a28e3c7f MS |
4098 | case ARRAY_REF: |
4099 | TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0)); | |
4100 | return decl; | |
52fbc847 JM |
4101 | case TREE_LIST: |
4102 | /* For attribute handling. */ | |
4103 | TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl)); | |
4104 | return decl; | |
8926095f MS |
4105 | default: |
4106 | my_friendly_abort (5); | |
4107 | return NULL_TREE; | |
51c184be MS |
4108 | } |
4109 | } | |
2986ae00 MS |
4110 | |
4111 | tree | |
4112 | check_cp_case_value (value) | |
4113 | tree value; | |
4114 | { | |
4115 | if (value == NULL_TREE) | |
4116 | return value; | |
4117 | ||
5566b478 MS |
4118 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */ |
4119 | STRIP_TYPE_NOPS (value); | |
2986ae00 MS |
4120 | |
4121 | if (TREE_READONLY_DECL_P (value)) | |
4122 | { | |
4123 | value = decl_constant_value (value); | |
5566b478 | 4124 | STRIP_TYPE_NOPS (value); |
2986ae00 MS |
4125 | } |
4126 | value = fold (value); | |
4127 | ||
4128 | if (TREE_CODE (value) != INTEGER_CST | |
4129 | && value != error_mark_node) | |
4130 | { | |
8251199e | 4131 | cp_error ("case label `%E' does not reduce to an integer constant", |
2986ae00 MS |
4132 | value); |
4133 | value = error_mark_node; | |
4134 | } | |
4135 | else | |
4136 | /* Promote char or short to int. */ | |
4137 | value = default_conversion (value); | |
4138 | ||
4139 | constant_expression_warning (value); | |
4140 | ||
4141 | return value; | |
4142 | } | |
6060a796 | 4143 | |
2c73f9f5 ML |
4144 | /* Return 1 if root encloses child. */ |
4145 | ||
30394414 JM |
4146 | static int |
4147 | is_namespace_ancestor (root, child) | |
4148 | tree root, child; | |
4149 | { | |
4150 | if (root == child) | |
4151 | return 1; | |
4152 | if (root == global_namespace) | |
4153 | return 1; | |
4154 | if (child == global_namespace) | |
4155 | return 0; | |
cb0dbb9a | 4156 | return is_namespace_ancestor (root, CP_DECL_CONTEXT (child)); |
30394414 JM |
4157 | } |
4158 | ||
4159 | ||
2c73f9f5 ML |
4160 | /* Return the namespace that is the common ancestor |
4161 | of two given namespaces. */ | |
4162 | ||
9ed182dc | 4163 | tree |
30394414 JM |
4164 | namespace_ancestor (ns1, ns2) |
4165 | tree ns1, ns2; | |
4166 | { | |
4167 | if (is_namespace_ancestor (ns1, ns2)) | |
4168 | return ns1; | |
a41461c9 | 4169 | return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2); |
30394414 JM |
4170 | } |
4171 | ||
4172 | /* Insert used into the using list of user. Set indirect_flag if this | |
4173 | directive is not directly from the source. Also find the common | |
4174 | ancestor and let our users know about the new namespace */ | |
4175 | static void | |
4176 | add_using_namespace (user, used, indirect) | |
4177 | tree user; | |
4178 | tree used; | |
4179 | int indirect; | |
4180 | { | |
52c11ef6 | 4181 | tree t; |
2c73f9f5 | 4182 | /* Using oneself is a no-op. */ |
30394414 JM |
4183 | if (user == used) |
4184 | return; | |
4185 | my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380); | |
4186 | my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380); | |
2c73f9f5 | 4187 | /* Check if we already have this. */ |
52c11ef6 JM |
4188 | t = purpose_member (used, DECL_NAMESPACE_USING (user)); |
4189 | if (t != NULL_TREE) | |
4190 | { | |
4191 | if (!indirect) | |
4192 | /* Promote to direct usage. */ | |
4193 | TREE_INDIRECT_USING (t) = 0; | |
4194 | return; | |
4195 | } | |
30394414 | 4196 | |
2c73f9f5 | 4197 | /* Add used to the user's using list. */ |
30394414 | 4198 | DECL_NAMESPACE_USING (user) |
e1b3e07d MM |
4199 | = tree_cons (used, namespace_ancestor (user, used), |
4200 | DECL_NAMESPACE_USING (user)); | |
30394414 JM |
4201 | |
4202 | TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect; | |
4203 | ||
2c73f9f5 | 4204 | /* Add user to the used's users list. */ |
30394414 | 4205 | DECL_NAMESPACE_USERS (used) |
e1b3e07d | 4206 | = tree_cons (user, 0, DECL_NAMESPACE_USERS (used)); |
85c6cbaf ML |
4207 | |
4208 | /* Recursively add all namespaces used. */ | |
52c11ef6 | 4209 | for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t)) |
30394414 | 4210 | /* indirect usage */ |
52c11ef6 | 4211 | add_using_namespace (user, TREE_PURPOSE (t), 1); |
85c6cbaf ML |
4212 | |
4213 | /* Tell everyone using us about the new used namespaces. */ | |
52c11ef6 JM |
4214 | for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t)) |
4215 | add_using_namespace (TREE_PURPOSE (t), used, 1); | |
30394414 JM |
4216 | } |
4217 | ||
5eea678f JM |
4218 | /* Combines two sets of overloaded functions into an OVERLOAD chain, removing |
4219 | duplicates. The first list becomes the tail of the result. | |
4220 | ||
61a127b3 MM |
4221 | The algorithm is O(n^2). We could get this down to O(n log n) by |
4222 | doing a sort on the addresses of the functions, if that becomes | |
4223 | necessary. */ | |
2c73f9f5 ML |
4224 | |
4225 | static tree | |
4226 | merge_functions (s1, s2) | |
4227 | tree s1; | |
4228 | tree s2; | |
4229 | { | |
5eea678f JM |
4230 | for (; s2; s2 = OVL_NEXT (s2)) |
4231 | { | |
4232 | tree fn = OVL_CURRENT (s2); | |
4233 | if (! ovl_member (fn, s1)) | |
4234 | s1 = build_overload (fn, s1); | |
4235 | } | |
2c73f9f5 ML |
4236 | return s1; |
4237 | } | |
4238 | ||
30394414 JM |
4239 | /* This should return an error not all definitions define functions. |
4240 | It is not an error if we find two functions with exactly the | |
4241 | same signature, only if these are selected in overload resolution. | |
2c73f9f5 | 4242 | old is the current set of bindings, new the freshly-found binding. |
30394414 JM |
4243 | XXX Do we want to give *all* candidates in case of ambiguity? |
4244 | XXX In what way should I treat extern declarations? | |
4245 | XXX I don't want to repeat the entire duplicate_decls here */ | |
2c73f9f5 | 4246 | |
30394414 | 4247 | static tree |
52c11ef6 | 4248 | ambiguous_decl (name, old, new, flags) |
2c73f9f5 ML |
4249 | tree name; |
4250 | tree old; | |
4251 | tree new; | |
52c11ef6 | 4252 | int flags; |
30394414 | 4253 | { |
52c11ef6 | 4254 | tree val, type; |
2c73f9f5 ML |
4255 | my_friendly_assert (old != NULL_TREE, 393); |
4256 | /* Copy the value. */ | |
52c11ef6 JM |
4257 | val = BINDING_VALUE (new); |
4258 | if (val) | |
4259 | switch (TREE_CODE (val)) | |
4260 | { | |
4261 | case TEMPLATE_DECL: | |
4262 | /* If we expect types or namespaces, and not templates, | |
4263 | or this is not a template class. */ | |
4264 | if (LOOKUP_QUALIFIERS_ONLY (flags) | |
c592d5d2 | 4265 | && !DECL_CLASS_TEMPLATE_P (val)) |
52c11ef6 JM |
4266 | val = NULL_TREE; |
4267 | break; | |
4268 | case TYPE_DECL: | |
4269 | if (LOOKUP_NAMESPACES_ONLY (flags)) | |
4270 | val = NULL_TREE; | |
4271 | break; | |
4272 | case NAMESPACE_DECL: | |
4273 | if (LOOKUP_TYPES_ONLY (flags)) | |
4274 | val = NULL_TREE; | |
4275 | break; | |
4276 | default: | |
4277 | if (LOOKUP_QUALIFIERS_ONLY (flags)) | |
4278 | val = NULL_TREE; | |
4279 | } | |
4280 | ||
2c73f9f5 | 4281 | if (!BINDING_VALUE (old)) |
52c11ef6 JM |
4282 | BINDING_VALUE (old) = val; |
4283 | else if (val && val != BINDING_VALUE (old)) | |
2c73f9f5 ML |
4284 | { |
4285 | if (is_overloaded_fn (BINDING_VALUE (old)) | |
52c11ef6 | 4286 | && is_overloaded_fn (val)) |
2c73f9f5 ML |
4287 | { |
4288 | BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old), | |
52c11ef6 | 4289 | val); |
2c73f9f5 ML |
4290 | } |
4291 | else | |
4292 | { | |
4293 | /* Some declarations are functions, some are not. */ | |
52c11ef6 JM |
4294 | if (flags & LOOKUP_COMPLAIN) |
4295 | { | |
2642b9bf JM |
4296 | /* If we've already given this error for this lookup, |
4297 | BINDING_VALUE (old) is error_mark_node, so let's not | |
4298 | repeat ourselves. */ | |
4299 | if (BINDING_VALUE (old) != error_mark_node) | |
4300 | { | |
4301 | cp_error ("use of `%D' is ambiguous", name); | |
4302 | cp_error_at (" first declared as `%#D' here", | |
4303 | BINDING_VALUE (old)); | |
4304 | } | |
8251199e | 4305 | cp_error_at (" also declared as `%#D' here", val); |
52c11ef6 | 4306 | } |
d67cdbc3 | 4307 | BINDING_VALUE (old) = error_mark_node; |
2c73f9f5 ML |
4308 | } |
4309 | } | |
4310 | /* ... and copy the type. */ | |
52c11ef6 JM |
4311 | type = BINDING_TYPE (new); |
4312 | if (LOOKUP_NAMESPACES_ONLY (flags)) | |
4313 | type = NULL_TREE; | |
2c73f9f5 | 4314 | if (!BINDING_TYPE (old)) |
52c11ef6 | 4315 | BINDING_TYPE (old) = type; |
1c35f5b6 | 4316 | else if (type && BINDING_TYPE (old) != type) |
30394414 | 4317 | { |
52c11ef6 JM |
4318 | if (flags & LOOKUP_COMPLAIN) |
4319 | { | |
8251199e JM |
4320 | cp_error ("`%D' denotes an ambiguous type",name); |
4321 | cp_error_at (" first type here", BINDING_TYPE (old)); | |
4322 | cp_error_at (" other type here", type); | |
52c11ef6 | 4323 | } |
30394414 | 4324 | } |
2c73f9f5 | 4325 | return old; |
30394414 JM |
4326 | } |
4327 | ||
2c169bab JM |
4328 | /* Subroutine of unualified_namespace_lookup: |
4329 | Add the bindings of NAME in used namespaces to VAL. | |
4330 | We are currently looking for names in namespace SCOPE, so we | |
4331 | look through USINGS for using-directives of namespaces | |
4332 | which have SCOPE as a common ancestor with the current scope. | |
2c73f9f5 ML |
4333 | Returns zero on errors. */ |
4334 | ||
4335 | int | |
2c169bab | 4336 | lookup_using_namespace (name, val, usings, scope, flags, spacesp) |
ea9635c7 | 4337 | tree name, val, usings, scope; |
52c11ef6 | 4338 | int flags; |
2c169bab | 4339 | tree *spacesp; |
30394414 JM |
4340 | { |
4341 | tree iter; | |
4342 | tree val1; | |
ea9635c7 ML |
4343 | /* Iterate over all used namespaces in current, searching for using |
4344 | directives of scope. */ | |
4345 | for (iter = usings; iter; iter = TREE_CHAIN (iter)) | |
4346 | if (TREE_VALUE (iter) == scope) | |
4347 | { | |
2c169bab | 4348 | if (spacesp) |
e1b3e07d MM |
4349 | *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE, |
4350 | *spacesp); | |
ea9635c7 ML |
4351 | val1 = binding_for_name (name, TREE_PURPOSE (iter)); |
4352 | /* Resolve ambiguities. */ | |
52c11ef6 | 4353 | val = ambiguous_decl (name, val, val1, flags); |
ea9635c7 | 4354 | } |
d67cdbc3 | 4355 | return BINDING_VALUE (val) != error_mark_node; |
30394414 JM |
4356 | } |
4357 | ||
2c73f9f5 | 4358 | /* [namespace.qual] |
6ad07332 JM |
4359 | Accepts the NAME to lookup and its qualifying SCOPE. |
4360 | Returns the name/type pair found into the CPLUS_BINDING RESULT, | |
2c73f9f5 ML |
4361 | or 0 on error. */ |
4362 | ||
4363 | int | |
52c11ef6 | 4364 | qualified_lookup_using_namespace (name, scope, result, flags) |
30394414 JM |
4365 | tree name; |
4366 | tree scope; | |
2c73f9f5 | 4367 | tree result; |
52c11ef6 | 4368 | int flags; |
30394414 | 4369 | { |
2c73f9f5 | 4370 | /* Maintain a list of namespaces visited... */ |
30394414 | 4371 | tree seen = NULL_TREE; |
2c73f9f5 | 4372 | /* ... and a list of namespace yet to see. */ |
30394414 JM |
4373 | tree todo = NULL_TREE; |
4374 | tree usings; | |
2c73f9f5 | 4375 | while (scope && (result != error_mark_node)) |
30394414 | 4376 | { |
58010b57 | 4377 | seen = tree_cons (scope, NULL_TREE, seen); |
52c11ef6 JM |
4378 | result = ambiguous_decl (name, result, |
4379 | binding_for_name (name, scope), flags); | |
2c73f9f5 ML |
4380 | if (!BINDING_VALUE (result) && !BINDING_TYPE (result)) |
4381 | /* Consider using directives. */ | |
30394414 JM |
4382 | for (usings = DECL_NAMESPACE_USING (scope); usings; |
4383 | usings = TREE_CHAIN (usings)) | |
2c73f9f5 | 4384 | /* If this was a real directive, and we have not seen it. */ |
30394414 | 4385 | if (!TREE_INDIRECT_USING (usings) |
2b9dc906 | 4386 | && !purpose_member (TREE_PURPOSE (usings), seen)) |
58010b57 | 4387 | todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo); |
30394414 JM |
4388 | if (todo) |
4389 | { | |
4390 | scope = TREE_PURPOSE (todo); | |
4391 | todo = TREE_CHAIN (todo); | |
4392 | } | |
4393 | else | |
2c73f9f5 | 4394 | scope = NULL_TREE; /* If there never was a todo list. */ |
30394414 | 4395 | } |
2c73f9f5 | 4396 | return result != error_mark_node; |
30394414 | 4397 | } |
6060a796 | 4398 | |
2c73f9f5 ML |
4399 | /* [namespace.memdef]/2 */ |
4400 | ||
4401 | /* Set the context of a declaration to scope. Complain if we are not | |
4402 | outside scope. */ | |
4403 | ||
4404 | void | |
b262d64c | 4405 | set_decl_namespace (decl, scope, friendp) |
2c73f9f5 ML |
4406 | tree decl; |
4407 | tree scope; | |
b262d64c | 4408 | int friendp; |
2c73f9f5 ML |
4409 | { |
4410 | tree old; | |
4411 | if (scope == std_node) | |
4412 | scope = global_namespace; | |
3e3f722c ML |
4413 | /* Get rid of namespace aliases. */ |
4414 | scope = ORIGINAL_NAMESPACE (scope); | |
4415 | ||
b262d64c JM |
4416 | /* It is ok for friends to be qualified in parallel space. */ |
4417 | if (!friendp && !is_namespace_ancestor (current_namespace, scope)) | |
8251199e | 4418 | cp_error ("declaration of `%D' not in a namespace surrounding `%D'", |
2c73f9f5 | 4419 | decl, scope); |
cb0dbb9a | 4420 | DECL_CONTEXT (decl) = FROB_CONTEXT (scope); |
2c73f9f5 ML |
4421 | if (scope != current_namespace) |
4422 | { | |
4423 | /* See whether this has been declared in the namespace. */ | |
4424 | old = namespace_binding (DECL_NAME (decl), scope); | |
4425 | if (!old) | |
4426 | /* No old declaration at all. */ | |
4427 | goto complain; | |
4428 | if (!is_overloaded_fn (decl)) | |
4429 | /* Don't compare non-function decls with decls_match here, | |
4430 | since it can't check for the correct constness at this | |
4431 | point. pushdecl will find those errors later. */ | |
4432 | return; | |
4433 | /* Since decl is a function, old should contain a function decl. */ | |
4434 | if (!is_overloaded_fn (old)) | |
4435 | goto complain; | |
d82d65d8 ML |
4436 | if (processing_template_decl || processing_specialization) |
4437 | /* We have not yet called push_template_decl to turn the | |
4438 | FUNCTION_DECL into a TEMPLATE_DECL, so the declarations | |
4439 | won't match. But, we'll check later, when we construct the | |
4440 | template. */ | |
4441 | return; | |
2c73f9f5 ML |
4442 | for (; old; old = OVL_NEXT (old)) |
4443 | if (decls_match (decl, OVL_CURRENT (old))) | |
4444 | return; | |
4445 | } | |
4446 | else | |
4447 | return; | |
4448 | complain: | |
8251199e | 4449 | cp_error ("`%D' should have been declared inside `%D'", |
2c73f9f5 ML |
4450 | decl, scope); |
4451 | } | |
4452 | ||
4453 | /* Compute the namespace where a declaration is defined. */ | |
e92cc029 | 4454 | |
d8e178a0 | 4455 | static tree |
2c73f9f5 ML |
4456 | decl_namespace (decl) |
4457 | tree decl; | |
6060a796 | 4458 | { |
2c73f9f5 ML |
4459 | while (DECL_CONTEXT (decl)) |
4460 | { | |
4461 | decl = DECL_CONTEXT (decl); | |
4462 | if (TREE_CODE (decl) == NAMESPACE_DECL) | |
4463 | return decl; | |
4464 | if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't') | |
4465 | decl = TYPE_STUB_DECL (decl); | |
4466 | my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390); | |
4467 | } | |
4468 | ||
cb0dbb9a | 4469 | return global_namespace; |
6060a796 MS |
4470 | } |
4471 | ||
2c73f9f5 | 4472 | /* Return the namespace where the current declaration is declared. */ |
e92cc029 | 4473 | |
6060a796 | 4474 | tree |
2c73f9f5 | 4475 | current_decl_namespace () |
6060a796 | 4476 | { |
2c73f9f5 ML |
4477 | tree result; |
4478 | /* If we have been pushed into a different namespace, use it. */ | |
4479 | if (decl_namespace_list) | |
4480 | return TREE_PURPOSE (decl_namespace_list); | |
4481 | ||
4482 | if (current_class_type) | |
c3baf4b5 | 4483 | result = decl_namespace (TYPE_STUB_DECL (current_class_type)); |
2c73f9f5 | 4484 | else if (current_function_decl) |
c3baf4b5 | 4485 | result = decl_namespace (current_function_decl); |
2c73f9f5 ML |
4486 | else |
4487 | result = current_namespace; | |
4488 | return result; | |
4489 | } | |
6060a796 | 4490 | |
2c73f9f5 | 4491 | /* Temporarily set the namespace for the current declaration. */ |
6060a796 | 4492 | |
2c73f9f5 ML |
4493 | void |
4494 | push_decl_namespace (decl) | |
4495 | tree decl; | |
4496 | { | |
4497 | if (TREE_CODE (decl) != NAMESPACE_DECL) | |
4498 | decl = decl_namespace (decl); | |
4499 | decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list); | |
4500 | } | |
4501 | ||
4502 | void | |
4503 | pop_decl_namespace () | |
4504 | { | |
4505 | decl_namespace_list = TREE_CHAIN (decl_namespace_list); | |
4506 | } | |
4507 | ||
f09bbbed ML |
4508 | /* Enter a class or namespace scope. */ |
4509 | ||
4510 | void | |
4511 | push_scope (t) | |
4512 | tree t; | |
4513 | { | |
4514 | if (TREE_CODE (t) == NAMESPACE_DECL) | |
4515 | push_decl_namespace (t); | |
4516 | else | |
4517 | pushclass (t, 2); | |
4518 | } | |
4519 | ||
4520 | /* Leave scope pushed by push_scope. */ | |
4521 | ||
4522 | void | |
4523 | pop_scope (t) | |
4524 | tree t; | |
4525 | { | |
4526 | if (TREE_CODE (t) == NAMESPACE_DECL) | |
4527 | pop_decl_namespace (); | |
4528 | else | |
b74a0560 | 4529 | popclass (); |
f09bbbed ML |
4530 | } |
4531 | ||
2c73f9f5 ML |
4532 | /* [basic.lookup.koenig] */ |
4533 | /* A non-zero return value in the functions below indicates an error. | |
4534 | All nodes allocated in the procedure are on the scratch obstack. */ | |
4535 | ||
4536 | struct arg_lookup | |
4537 | { | |
4538 | tree name; | |
4539 | tree namespaces; | |
4540 | tree classes; | |
4541 | tree functions; | |
4542 | }; | |
4543 | ||
158991b7 KG |
4544 | static int arg_assoc PARAMS ((struct arg_lookup*, tree)); |
4545 | static int arg_assoc_args PARAMS ((struct arg_lookup*, tree)); | |
4546 | static int arg_assoc_type PARAMS ((struct arg_lookup*, tree)); | |
4547 | static int add_function PARAMS ((struct arg_lookup *, tree)); | |
4548 | static int arg_assoc_namespace PARAMS ((struct arg_lookup *, tree)); | |
4549 | static int arg_assoc_class PARAMS ((struct arg_lookup *, tree)); | |
4550 | static int arg_assoc_template_arg PARAMS ((struct arg_lookup*, tree)); | |
2c73f9f5 | 4551 | |
2d390867 JM |
4552 | /* Add a function to the lookup structure. |
4553 | Returns 1 on error. */ | |
2c73f9f5 ML |
4554 | |
4555 | static int | |
4556 | add_function (k, fn) | |
4557 | struct arg_lookup *k; | |
4558 | tree fn; | |
4559 | { | |
2c169bab JM |
4560 | /* We used to check here to see if the function was already in the list, |
4561 | but that's O(n^2), which is just too expensive for function lookup. | |
4562 | Now we deal with the occasional duplicate in joust. In doing this, we | |
4563 | assume that the number of duplicates will be small compared to the | |
4564 | total number of functions being compared, which should usually be the | |
4565 | case. */ | |
4566 | ||
5f8ac7d1 ML |
4567 | /* We must find only functions, or exactly one non-function. */ |
4568 | if (k->functions && is_overloaded_fn (k->functions) | |
4569 | && is_overloaded_fn (fn)) | |
4570 | k->functions = build_overload (fn, k->functions); | |
2c169bab JM |
4571 | else if (k->functions) |
4572 | { | |
4573 | tree f1 = OVL_CURRENT (k->functions); | |
4574 | tree f2 = fn; | |
4575 | if (is_overloaded_fn (f1)) | |
4576 | { | |
4577 | fn = f1; f1 = f2; f2 = fn; | |
4578 | } | |
4579 | cp_error_at ("`%D' is not a function,", f1); | |
4580 | cp_error_at (" conflict with `%D'", f2); | |
4581 | cp_error (" in call to `%D'", k->name); | |
4582 | return 1; | |
4583 | } | |
4584 | else | |
4585 | k->functions = fn; | |
2c73f9f5 ML |
4586 | return 0; |
4587 | } | |
4588 | ||
2d390867 JM |
4589 | /* Add functions of a namespace to the lookup structure. |
4590 | Returns 1 on error. */ | |
2c73f9f5 ML |
4591 | |
4592 | static int | |
4593 | arg_assoc_namespace (k, scope) | |
4594 | struct arg_lookup *k; | |
4595 | tree scope; | |
4596 | { | |
4597 | tree value; | |
4598 | ||
4599 | if (purpose_member (scope, k->namespaces)) | |
4600 | return 0; | |
4601 | k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces); | |
4602 | ||
4603 | value = namespace_binding (k->name, scope); | |
4604 | if (!value) | |
4605 | return 0; | |
2c169bab | 4606 | |
2c73f9f5 ML |
4607 | for (; value; value = OVL_NEXT (value)) |
4608 | if (add_function (k, OVL_CURRENT (value))) | |
4609 | return 1; | |
4610 | ||
4611 | return 0; | |
6060a796 | 4612 | } |
2c73f9f5 | 4613 | |
ec4f972f AS |
4614 | /* Adds everything associated with a template argument to the lookup |
4615 | structure. Returns 1 on error. */ | |
4616 | ||
4617 | static int | |
4618 | arg_assoc_template_arg (k, arg) | |
4619 | struct arg_lookup* k; | |
4620 | tree arg; | |
4621 | { | |
4622 | /* [basic.lookup.koenig] | |
4623 | ||
4624 | If T is a template-id, its associated namespaces and classes are | |
4625 | ... the namespaces and classes associated with the types of the | |
4626 | template arguments provided for template type parameters | |
4627 | (excluding template template parameters); the namespaces in which | |
4628 | any template template arguments are defined; and the classes in | |
4629 | which any member templates used as template template arguments | |
4630 | are defined. [Note: non-type template arguments do not | |
4631 | contribute to the set of associated namespaces. ] */ | |
4632 | ||
4633 | /* Consider first template template arguments. */ | |
4634 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
4635 | { | |
4636 | tree ctx = CP_DECL_CONTEXT (arg); | |
4637 | ||
4638 | /* It's not a member template. */ | |
4639 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
4640 | return arg_assoc_namespace (k, ctx); | |
4641 | /* Otherwise, it must be member template. */ | |
4642 | else | |
4643 | return arg_assoc_class (k, ctx); | |
4644 | } | |
4645 | /* It's not a template template argument, but it is a type template | |
4646 | argument. */ | |
4647 | else if (TREE_CODE_CLASS (TREE_CODE (arg)) == 't') | |
4648 | return arg_assoc_type (k, arg); | |
4649 | /* It's a non-type template argument. */ | |
4650 | else | |
4651 | return 0; | |
4652 | } | |
4653 | ||
2d390867 JM |
4654 | /* Adds everything associated with class to the lookup structure. |
4655 | Returns 1 on error. */ | |
2c73f9f5 ML |
4656 | |
4657 | static int | |
4658 | arg_assoc_class (k, type) | |
4659 | struct arg_lookup* k; | |
4660 | tree type; | |
4661 | { | |
4662 | tree list, friends, context; | |
4663 | int i; | |
4664 | ||
31aa49b7 RH |
4665 | /* Backend build structures, such as __builtin_va_list, aren't |
4666 | affected by all this. */ | |
4667 | if (!CLASS_TYPE_P (type)) | |
4668 | return 0; | |
4669 | ||
2c73f9f5 ML |
4670 | if (purpose_member (type, k->classes)) |
4671 | return 0; | |
4672 | k->classes = tree_cons (type, NULL_TREE, k->classes); | |
4673 | ||
4674 | context = decl_namespace (TYPE_MAIN_DECL (type)); | |
4675 | if (arg_assoc_namespace (k, context)) | |
4676 | return 1; | |
4677 | ||
4678 | /* Process baseclasses. */ | |
4679 | for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++) | |
4680 | if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i))) | |
4681 | return 1; | |
4682 | ||
4683 | /* Process friends. */ | |
4684 | for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list; | |
4685 | list = TREE_CHAIN (list)) | |
4686 | if (k->name == TREE_PURPOSE (list)) | |
4687 | for (friends = TREE_VALUE (list); friends; | |
4688 | friends = TREE_CHAIN (friends)) | |
4689 | /* Only interested in global functions with potentially hidden | |
4690 | (i.e. unqualified) declarations. */ | |
4691 | if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list) | |
4692 | && decl_namespace (TREE_VALUE (list)) == context) | |
4693 | if (add_function (k, TREE_VALUE (list))) | |
4694 | return 1; | |
00dc6358 JM |
4695 | |
4696 | /* Process template arguments. */ | |
4697 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
4698 | { | |
36a117a5 | 4699 | list = innermost_args (CLASSTYPE_TI_ARGS (type)); |
ec4f972f AS |
4700 | for (i = 0; i < TREE_VEC_LENGTH (list); ++i) |
4701 | arg_assoc_template_arg (k, TREE_VEC_ELT (list, i)); | |
00dc6358 JM |
4702 | } |
4703 | ||
2c73f9f5 ML |
4704 | return 0; |
4705 | } | |
4706 | ||
2d390867 JM |
4707 | /* Adds everything associated with a given type. |
4708 | Returns 1 on error. */ | |
2c73f9f5 ML |
4709 | |
4710 | static int | |
4711 | arg_assoc_type (k, type) | |
4712 | struct arg_lookup *k; | |
4713 | tree type; | |
4714 | { | |
4715 | switch (TREE_CODE (type)) | |
4716 | { | |
4717 | case VOID_TYPE: | |
4718 | case INTEGER_TYPE: | |
4719 | case REAL_TYPE: | |
4720 | case COMPLEX_TYPE: | |
4721 | case CHAR_TYPE: | |
4722 | case BOOLEAN_TYPE: | |
4723 | return 0; | |
4724 | case RECORD_TYPE: | |
4725 | if (TYPE_PTRMEMFUNC_P (type)) | |
4726 | return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type)); | |
4727 | return arg_assoc_class (k, type); | |
4728 | case POINTER_TYPE: | |
4729 | case REFERENCE_TYPE: | |
4730 | case ARRAY_TYPE: | |
4731 | return arg_assoc_type (k, TREE_TYPE (type)); | |
4732 | case UNION_TYPE: | |
4733 | case ENUMERAL_TYPE: | |
4734 | return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type))); | |
1813dd7b ML |
4735 | case OFFSET_TYPE: |
4736 | /* Pointer to member: associate class type and value type. */ | |
4737 | if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type))) | |
4738 | return 1; | |
4739 | return arg_assoc_type (k, TREE_TYPE (type)); | |
2c73f9f5 | 4740 | case METHOD_TYPE: |
2d390867 JM |
4741 | /* The basetype is referenced in the first arg type, so just |
4742 | fall through. */ | |
2c73f9f5 ML |
4743 | case FUNCTION_TYPE: |
4744 | /* Associate the parameter types. */ | |
4745 | if (arg_assoc_args (k, TYPE_ARG_TYPES (type))) | |
4746 | return 1; | |
4747 | /* Associate the return type. */ | |
4748 | return arg_assoc_type (k, TREE_TYPE (type)); | |
2d390867 | 4749 | case TEMPLATE_TYPE_PARM: |
700466c2 | 4750 | case TEMPLATE_TEMPLATE_PARM: |
2d390867 | 4751 | return 0; |
1813dd7b ML |
4752 | case LANG_TYPE: |
4753 | if (type == unknown_type_node) | |
4754 | return 0; | |
4755 | /* else fall through */ | |
2c73f9f5 ML |
4756 | default: |
4757 | my_friendly_abort (390); | |
4758 | } | |
4759 | return 0; | |
4760 | } | |
4761 | ||
2d390867 | 4762 | /* Adds everything associated with arguments. Returns 1 on error. */ |
2c73f9f5 ML |
4763 | |
4764 | static int | |
4765 | arg_assoc_args (k, args) | |
4766 | struct arg_lookup* k; | |
4767 | tree args; | |
4768 | { | |
4769 | for (; args; args = TREE_CHAIN (args)) | |
4770 | if (arg_assoc (k, TREE_VALUE (args))) | |
4771 | return 1; | |
4772 | return 0; | |
4773 | } | |
4774 | ||
2d390867 | 4775 | /* Adds everything associated with a given tree_node. Returns 1 on error. */ |
2c73f9f5 ML |
4776 | |
4777 | static int | |
4778 | arg_assoc (k, n) | |
4779 | struct arg_lookup* k; | |
4780 | tree n; | |
4781 | { | |
00dc6358 JM |
4782 | if (n == error_mark_node) |
4783 | return 0; | |
4784 | ||
2d390867 JM |
4785 | if (TREE_CODE_CLASS (TREE_CODE (n)) == 't') |
4786 | return arg_assoc_type (k, n); | |
4787 | ||
4788 | if (! type_unknown_p (n)) | |
4789 | return arg_assoc_type (k, TREE_TYPE (n)); | |
4790 | ||
4791 | if (TREE_CODE (n) == ADDR_EXPR) | |
4792 | n = TREE_OPERAND (n, 0); | |
51924768 JM |
4793 | if (TREE_CODE (n) == COMPONENT_REF) |
4794 | n = TREE_OPERAND (n, 1); | |
05e0b2f4 JM |
4795 | if (TREE_CODE (n) == OFFSET_REF) |
4796 | n = TREE_OPERAND (n, 1); | |
00dc6358 | 4797 | while (TREE_CODE (n) == TREE_LIST) |
2d390867 JM |
4798 | n = TREE_VALUE (n); |
4799 | ||
51924768 JM |
4800 | if (TREE_CODE (n) == FUNCTION_DECL) |
4801 | return arg_assoc_type (k, TREE_TYPE (n)); | |
0c8bfdbc MM |
4802 | if (TREE_CODE (n) == TEMPLATE_ID_EXPR) |
4803 | { | |
4804 | /* [basic.lookup.koenig] | |
4805 | ||
4806 | If T is a template-id, its associated namespaces and classes | |
4807 | are the namespace in which the template is defined; for | |
ec4f972f | 4808 | member templates, the member template's class... */ |
0c8bfdbc MM |
4809 | tree template = TREE_OPERAND (n, 0); |
4810 | tree args = TREE_OPERAND (n, 1); | |
4811 | tree ctx; | |
4812 | tree arg; | |
4813 | ||
4814 | /* First, the template. There may actually be more than one if | |
4815 | this is an overloaded function template. But, in that case, | |
4816 | we only need the first; all the functions will be in the same | |
4817 | namespace. */ | |
4818 | template = OVL_CURRENT (template); | |
4819 | ||
4820 | ctx = CP_DECL_CONTEXT (template); | |
4821 | ||
4822 | if (TREE_CODE (ctx) == NAMESPACE_DECL) | |
4823 | { | |
4824 | if (arg_assoc_namespace (k, ctx) == 1) | |
4825 | return 1; | |
4826 | } | |
4827 | /* It must be a member template. */ | |
4828 | else if (arg_assoc_class (k, ctx) == 1) | |
4829 | return 1; | |
2d390867 | 4830 | |
0c8bfdbc MM |
4831 | /* Now the arguments. */ |
4832 | for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg)) | |
ec4f972f AS |
4833 | if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1) |
4834 | return 1; | |
0c8bfdbc MM |
4835 | } |
4836 | else | |
4837 | { | |
4838 | my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715); | |
4839 | ||
4840 | for (; n; n = OVL_CHAIN (n)) | |
51924768 | 4841 | if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n)))) |
0c8bfdbc MM |
4842 | return 1; |
4843 | } | |
2c73f9f5 | 4844 | |
2c73f9f5 ML |
4845 | return 0; |
4846 | } | |
4847 | ||
4848 | /* Performs Koenig lookup depending on arguments, where fns | |
4849 | are the functions found in normal lookup. */ | |
4850 | ||
4851 | tree | |
4852 | lookup_arg_dependent (name, fns, args) | |
4853 | tree name; | |
4854 | tree fns; | |
4855 | tree args; | |
4856 | { | |
4857 | struct arg_lookup k; | |
f0b9bc6c | 4858 | tree fn = NULL_TREE; |
2c169bab | 4859 | |
2c73f9f5 ML |
4860 | k.name = name; |
4861 | k.functions = fns; | |
2c73f9f5 | 4862 | k.classes = NULL_TREE; |
2c169bab JM |
4863 | |
4864 | /* Note that we've already looked at some namespaces during normal | |
4865 | unqualified lookup, unless we found a decl in function scope. */ | |
f0b9bc6c NS |
4866 | if (fns) |
4867 | fn = OVL_CURRENT (fns); | |
4868 | if (fn && TREE_CODE (fn) == FUNCTION_DECL && DECL_LOCAL_FUNCTION_P (fn)) | |
2c169bab JM |
4869 | k.namespaces = NULL_TREE; |
4870 | else | |
4871 | unqualified_namespace_lookup (name, 0, &k.namespaces); | |
4872 | ||
2c73f9f5 | 4873 | arg_assoc_args (&k, args); |
2c73f9f5 ML |
4874 | return k.functions; |
4875 | } | |
4876 | ||
4877 | /* Process a namespace-alias declaration. */ | |
6060a796 | 4878 | |
6060a796 | 4879 | void |
a9aedbc2 MS |
4880 | do_namespace_alias (alias, namespace) |
4881 | tree alias, namespace; | |
6060a796 | 4882 | { |
3e3f722c | 4883 | if (TREE_CODE (namespace) != NAMESPACE_DECL) |
30394414 | 4884 | { |
3e3f722c | 4885 | /* The parser did not find it, so it's not there. */ |
8251199e | 4886 | cp_error ("unknown namespace `%D'", namespace); |
30394414 JM |
4887 | return; |
4888 | } | |
3e3f722c ML |
4889 | |
4890 | namespace = ORIGINAL_NAMESPACE (namespace); | |
4891 | ||
85c6cbaf ML |
4892 | /* Build the alias. */ |
4893 | alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node); | |
4894 | DECL_NAMESPACE_ALIAS (alias) = namespace; | |
4895 | pushdecl (alias); | |
6060a796 MS |
4896 | } |
4897 | ||
ea9635c7 ML |
4898 | /* Check a non-member using-declaration. Return the name and scope |
4899 | being used, and the USING_DECL, or NULL_TREE on failure. */ | |
2c73f9f5 | 4900 | |
ea9635c7 ML |
4901 | static tree |
4902 | validate_nonmember_using_decl (decl, scope, name) | |
a9aedbc2 | 4903 | tree decl; |
ea9635c7 ML |
4904 | tree *scope; |
4905 | tree *name; | |
6060a796 | 4906 | { |
6633d636 MS |
4907 | if (TREE_CODE (decl) == SCOPE_REF |
4908 | && TREE_OPERAND (decl, 0) == std_node) | |
39ee4d93 | 4909 | { |
7bdbfa05 MM |
4910 | if (namespace_bindings_p () |
4911 | && current_namespace == global_namespace) | |
4912 | /* There's no need for a using declaration at all, here, | |
4913 | since `std' is the same as `::'. We can't just pass this | |
4914 | on because we'll complain later about declaring something | |
4915 | in the same scope as a using declaration with the same | |
4916 | name. We return NULL_TREE which indicates to the caller | |
4917 | that there's no need to do any further processing. */ | |
4918 | return NULL_TREE; | |
4919 | ||
39ee4d93 ML |
4920 | *scope = global_namespace; |
4921 | *name = TREE_OPERAND (decl, 1); | |
4922 | } | |
4923 | else if (TREE_CODE (decl) == SCOPE_REF) | |
2c73f9f5 | 4924 | { |
ea9635c7 ML |
4925 | *scope = TREE_OPERAND (decl, 0); |
4926 | *name = TREE_OPERAND (decl, 1); | |
066b4a1c MM |
4927 | |
4928 | /* [namespace.udecl] | |
4929 | ||
4930 | A using-declaration for a class member shall be a | |
4931 | member-declaration. */ | |
4932 | if (TREE_CODE (*scope) != NAMESPACE_DECL) | |
4933 | { | |
b5d51daa MM |
4934 | if (TYPE_P (*scope)) |
4935 | cp_error ("`%T' is not a namespace", *scope); | |
4936 | else | |
4937 | cp_error ("`%D' is not a namespace", *scope); | |
066b4a1c MM |
4938 | return NULL_TREE; |
4939 | } | |
2c73f9f5 | 4940 | } |
0228fa7e | 4941 | else if (TREE_CODE (decl) == IDENTIFIER_NODE |
75fbcb7d ML |
4942 | || TREE_CODE (decl) == TYPE_DECL |
4943 | || TREE_CODE (decl) == TEMPLATE_DECL) | |
2c73f9f5 | 4944 | { |
ea9635c7 ML |
4945 | *scope = global_namespace; |
4946 | *name = decl; | |
2c73f9f5 ML |
4947 | } |
4948 | else | |
4949 | my_friendly_abort (382); | |
ea9635c7 ML |
4950 | if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd') |
4951 | *name = DECL_NAME (*name); | |
2c73f9f5 | 4952 | /* Make a USING_DECL. */ |
ea9635c7 ML |
4953 | return push_using_decl (*scope, *name); |
4954 | } | |
4955 | ||
4956 | /* Process local and global using-declarations. */ | |
4957 | ||
4958 | static void | |
4959 | do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype) | |
4960 | tree scope, name; | |
4961 | tree oldval, oldtype; | |
4962 | tree *newval, *newtype; | |
4963 | { | |
4964 | tree decls; | |
ea9635c7 ML |
4965 | |
4966 | *newval = *newtype = NULL_TREE; | |
87e3dbc9 | 4967 | decls = make_node (CPLUS_BINDING); |
52c11ef6 | 4968 | if (!qualified_lookup_using_namespace (name, scope, decls, 0)) |
2c73f9f5 | 4969 | /* Lookup error */ |
a9aedbc2 | 4970 | return; |
6060a796 | 4971 | |
2c73f9f5 ML |
4972 | if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls)) |
4973 | { | |
8251199e | 4974 | cp_error ("`%D' not declared", name); |
2c73f9f5 ML |
4975 | return; |
4976 | } | |
2c73f9f5 ML |
4977 | |
4978 | /* Check for using functions. */ | |
4979 | if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls))) | |
4980 | { | |
2c73f9f5 | 4981 | tree tmp, tmp1; |
9ed182dc JM |
4982 | |
4983 | if (oldval && !is_overloaded_fn (oldval)) | |
4984 | { | |
4985 | duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval); | |
4986 | oldval = NULL_TREE; | |
4987 | } | |
4988 | ||
ea9635c7 | 4989 | *newval = oldval; |
2c73f9f5 ML |
4990 | for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp)) |
4991 | { | |
7bdbfa05 MM |
4992 | tree new_fn = OVL_CURRENT (tmp); |
4993 | ||
4994 | /* [namespace.udecl] | |
4995 | ||
4996 | If a function declaration in namespace scope or block | |
4997 | scope has the same name and the same parameter types as a | |
4998 | function introduced by a using declaration the program is | |
4999 | ill-formed. */ | |
2c73f9f5 | 5000 | for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1)) |
7bdbfa05 MM |
5001 | { |
5002 | tree old_fn = OVL_CURRENT (tmp1); | |
a9aedbc2 | 5003 | |
7bdbfa05 MM |
5004 | if (!OVL_USED (tmp1) |
5005 | && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)), | |
5006 | TYPE_ARG_TYPES (TREE_TYPE (old_fn)))) | |
5007 | { | |
5008 | /* There was already a non-using declaration in | |
5009 | this scope with the same parameter types. */ | |
5010 | cp_error ("`%D' is already declared in this scope", | |
5011 | name); | |
5012 | break; | |
5013 | } | |
5014 | else if (duplicate_decls (new_fn, old_fn)) | |
5015 | /* We're re-using something we already used | |
5016 | before. We don't need to add it again. */ | |
5017 | break; | |
5018 | } | |
5019 | ||
5020 | /* If we broke out of the loop, there's no reason to add | |
5021 | this function to the using declarations for this | |
5022 | scope. */ | |
2c73f9f5 ML |
5023 | if (tmp1) |
5024 | continue; | |
5025 | ||
ea9635c7 ML |
5026 | *newval = build_overload (OVL_CURRENT (tmp), *newval); |
5027 | if (TREE_CODE (*newval) != OVERLOAD) | |
5028 | *newval = ovl_cons (*newval, NULL_TREE); | |
5029 | OVL_USED (*newval) = 1; | |
2c73f9f5 ML |
5030 | } |
5031 | } | |
5032 | else | |
a9aedbc2 | 5033 | { |
ea9635c7 | 5034 | *newval = BINDING_VALUE (decls); |
9ed182dc JM |
5035 | if (oldval) |
5036 | duplicate_decls (*newval, oldval); | |
2c73f9f5 ML |
5037 | } |
5038 | ||
ea9635c7 ML |
5039 | *newtype = BINDING_TYPE (decls); |
5040 | if (oldtype && *newtype && oldtype != *newtype) | |
2c73f9f5 | 5041 | { |
8251199e | 5042 | cp_error ("using directive `%D' introduced ambiguous type `%T'", |
ea9635c7 | 5043 | name, oldtype); |
2c73f9f5 | 5044 | return; |
a9aedbc2 | 5045 | } |
ea9635c7 ML |
5046 | } |
5047 | ||
5048 | /* Process a using-declaration not appearing in class or local scope. */ | |
5049 | ||
5050 | void | |
5051 | do_toplevel_using_decl (decl) | |
5052 | tree decl; | |
5053 | { | |
5054 | tree scope, name, binding; | |
5055 | tree oldval, oldtype, newval, newtype; | |
5056 | ||
5057 | decl = validate_nonmember_using_decl (decl, &scope, &name); | |
5058 | if (decl == NULL_TREE) | |
5059 | return; | |
5060 | ||
5061 | binding = binding_for_name (name, current_namespace); | |
5062 | ||
5063 | oldval = BINDING_VALUE (binding); | |
5064 | oldtype = BINDING_TYPE (binding); | |
5065 | ||
5066 | do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype); | |
5067 | ||
2c73f9f5 ML |
5068 | /* Copy declarations found. */ |
5069 | if (newval) | |
5070 | BINDING_VALUE (binding) = newval; | |
5071 | if (newtype) | |
5072 | BINDING_TYPE (binding) = newtype; | |
5073 | return; | |
6060a796 MS |
5074 | } |
5075 | ||
9ed182dc JM |
5076 | /* Process a using-declaration at function scope. */ |
5077 | ||
ea9635c7 ML |
5078 | void |
5079 | do_local_using_decl (decl) | |
5080 | tree decl; | |
5081 | { | |
5082 | tree scope, name; | |
5083 | tree oldval, oldtype, newval, newtype; | |
9ed182dc | 5084 | |
ea9635c7 ML |
5085 | decl = validate_nonmember_using_decl (decl, &scope, &name); |
5086 | if (decl == NULL_TREE) | |
5087 | return; | |
5088 | ||
9ed182dc JM |
5089 | oldval = lookup_name_current_level (name); |
5090 | oldtype = lookup_type_current_level (name); | |
ea9635c7 ML |
5091 | |
5092 | do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype); | |
5093 | ||
5094 | if (newval) | |
7bdbfa05 MM |
5095 | { |
5096 | if (is_overloaded_fn (newval)) | |
5097 | { | |
0580c9aa | 5098 | tree fn, term; |
7bdbfa05 MM |
5099 | |
5100 | /* We only need to push declarations for those functions | |
0580c9aa ML |
5101 | that were not already bound in the current level. |
5102 | The old value might be NULL_TREE, it might be a single | |
5103 | function, or an OVERLOAD. */ | |
5104 | if (oldval && TREE_CODE (oldval) == OVERLOAD) | |
5105 | term = OVL_FUNCTION (oldval); | |
5106 | else | |
5107 | term = oldval; | |
5108 | for (fn = newval; fn && OVL_CURRENT (fn) != term; | |
5109 | fn = OVL_NEXT (fn)) | |
7bdbfa05 MM |
5110 | push_overloaded_decl (OVL_CURRENT (fn), |
5111 | PUSH_LOCAL | PUSH_USING); | |
5112 | } | |
5113 | else | |
0034cf72 | 5114 | push_local_binding (name, newval, PUSH_USING); |
7bdbfa05 | 5115 | } |
9ed182dc JM |
5116 | if (newtype) |
5117 | set_identifier_type_value (name, newtype); | |
ea9635c7 ML |
5118 | } |
5119 | ||
6060a796 | 5120 | tree |
a9aedbc2 | 5121 | do_class_using_decl (decl) |
6060a796 MS |
5122 | tree decl; |
5123 | { | |
cffa8729 | 5124 | tree name, value; |
f30432d7 | 5125 | |
2c73f9f5 ML |
5126 | if (TREE_CODE (decl) != SCOPE_REF |
5127 | || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't') | |
cffa8729 | 5128 | { |
8251199e | 5129 | cp_error ("using-declaration for non-member at class scope"); |
cffa8729 MS |
5130 | return NULL_TREE; |
5131 | } | |
5132 | name = TREE_OPERAND (decl, 1); | |
5133 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
5134 | { | |
8251199e | 5135 | cp_error ("using-declaration for destructor"); |
cffa8729 MS |
5136 | return NULL_TREE; |
5137 | } | |
1c35f5b6 JM |
5138 | if (TREE_CODE (name) == TYPE_DECL) |
5139 | name = DECL_NAME (name); | |
5140 | ||
5141 | my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716); | |
cffa8729 | 5142 | |
4ce3d537 | 5143 | value = build_lang_decl (USING_DECL, name, void_type_node); |
cffa8729 MS |
5144 | DECL_INITIAL (value) = TREE_OPERAND (decl, 0); |
5145 | return value; | |
6060a796 MS |
5146 | } |
5147 | ||
2c73f9f5 ML |
5148 | /* Process a using-directive. */ |
5149 | ||
6060a796 MS |
5150 | void |
5151 | do_using_directive (namespace) | |
5152 | tree namespace; | |
5153 | { | |
6633d636 MS |
5154 | if (namespace == std_node) |
5155 | return; | |
3e3f722c | 5156 | /* using namespace A::B::C; */ |
30394414 JM |
5157 | if (TREE_CODE (namespace) == SCOPE_REF) |
5158 | namespace = TREE_OPERAND (namespace, 1); | |
2c73f9f5 ML |
5159 | if (TREE_CODE (namespace) == IDENTIFIER_NODE) |
5160 | { | |
5161 | /* Lookup in lexer did not find a namespace. */ | |
8251199e | 5162 | cp_error ("namespace `%T' undeclared", namespace); |
2c73f9f5 ML |
5163 | return; |
5164 | } | |
5165 | if (TREE_CODE (namespace) != NAMESPACE_DECL) | |
5166 | { | |
8251199e | 5167 | cp_error ("`%T' is not a namespace", namespace); |
2c73f9f5 ML |
5168 | return; |
5169 | } | |
3e3f722c | 5170 | namespace = ORIGINAL_NAMESPACE (namespace); |
ea9635c7 | 5171 | if (!toplevel_bindings_p ()) |
9ed182dc | 5172 | push_using_directive (namespace); |
ea9635c7 ML |
5173 | else |
5174 | /* direct usage */ | |
5175 | add_using_namespace (current_namespace, namespace, 0); | |
6060a796 | 5176 | } |
f30432d7 MS |
5177 | |
5178 | void | |
5179 | check_default_args (x) | |
5180 | tree x; | |
5181 | { | |
5182 | tree arg = TYPE_ARG_TYPES (TREE_TYPE (x)); | |
5183 | int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE); | |
5184 | for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i) | |
5185 | { | |
5186 | if (TREE_PURPOSE (arg)) | |
5187 | saw_def = 1; | |
5188 | else if (saw_def) | |
5189 | { | |
8251199e | 5190 | cp_error_at ("default argument missing for parameter %P of `%+#D'", |
b7698cf0 | 5191 | i, x); |
f30432d7 MS |
5192 | break; |
5193 | } | |
5194 | } | |
5195 | } | |
72b7eeff MS |
5196 | |
5197 | void | |
5198 | mark_used (decl) | |
5199 | tree decl; | |
5200 | { | |
5201 | TREE_USED (decl) = 1; | |
5156628f | 5202 | if (processing_template_decl) |
5566b478 | 5203 | return; |
72b7eeff | 5204 | assemble_external (decl); |
36a117a5 | 5205 | |
73aad9b9 | 5206 | /* Is it a synthesized method that needs to be synthesized? */ |
4f1c5b7d MM |
5207 | if (TREE_CODE (decl) == FUNCTION_DECL |
5208 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl) | |
5209 | && DECL_ARTIFICIAL (decl) | |
5210 | && ! DECL_INITIAL (decl) | |
73aad9b9 JM |
5211 | /* Kludge: don't synthesize for default args. */ |
5212 | && current_function_decl) | |
5213 | synthesize_method (decl); | |
36a117a5 MM |
5214 | |
5215 | /* If this is a function or variable that is an instance of some | |
5216 | template, we now know that we will need to actually do the | |
7c355bca | 5217 | instantiation. We check that DECL is not an explicit |
03d0f4af | 5218 | instantiation because that is not checked in instantiate_decl. */ |
7c355bca | 5219 | if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL) |
03d0f4af | 5220 | && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl) |
7610f2ce JM |
5221 | && (!DECL_EXPLICIT_INSTANTIATION (decl) |
5222 | || (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl)))) | |
5566b478 | 5223 | instantiate_decl (decl); |
72b7eeff | 5224 | } |
f62dbf03 | 5225 | |
3d7de1fa MM |
5226 | /* Helper function for named_class_head_sans_basetype nonterminal. We |
5227 | have just seen something of the form `AGGR SCOPE::ID'. Return a | |
5228 | TYPE_DECL for the type declared by ID in SCOPE. */ | |
f62dbf03 JM |
5229 | |
5230 | tree | |
5231 | handle_class_head (aggr, scope, id) | |
5232 | tree aggr, scope, id; | |
5233 | { | |
3d7de1fa MM |
5234 | tree decl; |
5235 | ||
f62dbf03 | 5236 | if (TREE_CODE (id) == TYPE_DECL) |
3d7de1fa MM |
5237 | decl = id; |
5238 | else if (DECL_CLASS_TEMPLATE_P (id)) | |
5239 | decl = DECL_TEMPLATE_RESULT (id); | |
5240 | else | |
5241 | { | |
d7f426dc NS |
5242 | tree current = current_scope(); |
5243 | ||
5244 | if (current == NULL_TREE) | |
5245 | current = current_namespace; | |
5246 | if (scope == std_node) | |
5247 | scope = global_namespace; | |
5248 | if (scope == NULL_TREE) | |
5249 | scope = global_namespace; | |
5250 | if (scope == current) | |
5251 | { | |
5252 | /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE. | |
5253 | Be nice about it. */ | |
5254 | if (pedantic) | |
5255 | cp_pedwarn ("extra qualification `%T::' on member `%D' ignored", | |
5256 | FROB_CONTEXT (scope), id); | |
5257 | } | |
5258 | else if (scope != global_namespace) | |
5259 | cp_error ("`%T' does not have a nested type named `%D'", scope, id); | |
3d7de1fa MM |
5260 | else |
5261 | cp_error ("no file-scope type named `%D'", id); | |
5262 | ||
d7f426dc NS |
5263 | /* Inject it at the current scope. */ |
5264 | decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1)); | |
3d7de1fa | 5265 | } |
d7f426dc NS |
5266 | |
5267 | /* Enter the SCOPE. If this turns out not to be a definition, the | |
5268 | parser must leave the scope. */ | |
3d7de1fa MM |
5269 | push_scope (CP_DECL_CONTEXT (decl)); |
5270 | ||
5271 | /* If we see something like: | |
f62dbf03 | 5272 | |
3d7de1fa MM |
5273 | template <typename T> struct S::I .... |
5274 | ||
5275 | we must create a TEMPLATE_DECL for the nested type. */ | |
5276 | if (PROCESSING_REAL_TEMPLATE_DECL_P ()) | |
5277 | decl = push_template_decl (decl); | |
5278 | ||
5279 | return decl; | |
f62dbf03 | 5280 | } |
fc6af6e3 RH |
5281 | |
5282 | /* Initialize decl2.c. */ | |
5283 | ||
5284 | void | |
5285 | init_decl2 () | |
5286 | { | |
5287 | ggc_add_tree_root (&decl_namespace_list, 1); | |
5288 | ggc_add_tree_varray_root (&saved_inlines, 1); | |
9cd64686 MM |
5289 | ggc_add_tree_varray_root (&pending_statics, 1); |
5290 | ggc_add_tree_varray_root (&ssdf_decls, 1); | |
5291 | ggc_add_tree_root (&ssdf_decl, 1); | |
5292 | ggc_add_tree_root (&priority_decl, 1); | |
5293 | ggc_add_tree_root (&initialize_p_decl, 1); | |
5294 | ggc_add_tree_root (&pending_vtables, 1); | |
fc6af6e3 | 5295 | } |