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