1 /* Process declarations and variables for C++ compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C++ front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
33 #include "coretypes.h"
40 #include "tree-inline.h"
51 #include "diagnostic.h"
54 #include "tree-flow.h"
56 static tree
grokparms (tree
, tree
*);
57 static const char *redeclaration_error_message (tree
, tree
);
59 static int decl_jump_unsafe (tree
);
60 static void require_complete_types_for_parms (tree
);
61 static int ambi_op_p (enum tree_code
);
62 static int unary_op_p (enum tree_code
);
63 static void push_local_name (tree
);
64 static tree
grok_reference_init (tree
, tree
, tree
, tree
*);
65 static tree
grokfndecl (tree
, tree
, tree
, tree
, tree
, int,
66 enum overload_flags
, tree
,
67 tree
, int, int, int, int, int, int, tree
);
68 static tree
grokvardecl (tree
, tree
, RID_BIT_TYPE
*, int, int, tree
);
69 static void record_unknown_type (tree
, const char *);
70 static tree
builtin_function_1 (const char *, tree
, tree
, int,
71 enum built_in_class
, const char *,
73 static tree
build_library_fn_1 (tree
, enum tree_code
, tree
);
74 static int member_function_or_else (tree
, tree
, enum overload_flags
);
75 static void bad_specifiers (tree
, const char *, int, int, int, int,
77 static void check_for_uninitialized_const_var (tree
);
78 static hashval_t
typename_hash (const void *);
79 static int typename_compare (const void *, const void *);
80 static tree
local_variable_p_walkfn (tree
*, int *, void *);
81 static tree
record_builtin_java_type (const char *, int);
82 static const char *tag_name (enum tag_types code
);
83 static int walk_namespaces_r (tree
, walk_namespaces_fn
, void *);
84 static int walk_globals_r (tree
, void*);
85 static int walk_vtables_r (tree
, void*);
86 static tree
make_label_decl (tree
, int);
87 static void use_label (tree
);
88 static void check_previous_goto_1 (tree
, struct cp_binding_level
*, tree
,
90 static void check_previous_goto (struct named_label_use_list
*);
91 static void check_switch_goto (struct cp_binding_level
*);
92 static void check_previous_gotos (tree
);
93 static void pop_label (tree
, tree
);
94 static void pop_labels (tree
);
95 static void maybe_deduce_size_from_array_init (tree
, tree
);
96 static void layout_var_decl (tree
);
97 static void maybe_commonize_var (tree
);
98 static tree
check_initializer (tree
, tree
, int, tree
*);
99 static void make_rtl_for_nonlocal_decl (tree
, tree
, const char *);
100 static void save_function_data (tree
);
101 static void check_function_type (tree
, tree
);
102 static void begin_constructor_body (void);
103 static void finish_constructor_body (void);
104 static void begin_destructor_body (void);
105 static void finish_destructor_body (void);
106 static tree
create_array_type_for_decl (tree
, tree
, tree
);
107 static tree
get_atexit_node (void);
108 static tree
get_dso_handle_node (void);
109 static tree
start_cleanup_fn (void);
110 static void end_cleanup_fn (void);
111 static tree
cp_make_fname_decl (tree
, int);
112 static void initialize_predefined_identifiers (void);
113 static tree check_special_function_return_type
114 (special_function_kind
, tree
, tree
);
115 static tree
push_cp_library_fn (enum tree_code
, tree
);
116 static tree
build_cp_library_fn (tree
, enum tree_code
, tree
);
117 static void store_parm_decls (tree
);
118 static void initialize_local_var (tree
, tree
);
119 static void expand_static_init (tree
, tree
);
120 static tree
next_initializable_field (tree
);
121 static tree
reshape_init (tree
, tree
*);
122 static tree
build_typename_type (tree
, tree
, tree
);
124 /* Erroneous argument lists can use this *IFF* they do not modify it. */
125 tree error_mark_list
;
127 /* The following symbols are subsumed in the cp_global_trees array, and
128 listed here individually for documentation purposes.
131 tree wchar_decl_node;
133 tree vtable_entry_type;
134 tree delta_type_node;
135 tree __t_desc_type_node;
136 tree ti_desc_type_node;
137 tree bltn_desc_type_node, ptr_desc_type_node;
138 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
139 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
140 tree ptm_desc_type_node;
141 tree base_desc_type_node;
143 tree class_type_node;
144 tree unknown_type_node;
146 Array type `vtable_entry_type[]'
149 tree vtbl_ptr_type_node;
156 A FUNCTION_DECL which can call `abort'. Not necessarily the
157 one that the user will declare, but sufficient to be called
158 by routines that want to abort the program.
162 The FUNCTION_DECL for the default `::operator delete'.
164 tree global_delete_fndecl;
167 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
172 tree cp_global_trees
[CPTI_MAX
];
174 /* Indicates that there is a type value in some namespace, although
175 that is not necessarily in scope at the moment. */
177 tree global_type_node
;
179 /* The node that holds the "name" of the global scope. */
180 tree global_scope_name
;
182 /* Used only for jumps to as-yet undefined labels, since jumps to
183 defined labels can have their validity checked immediately. */
185 struct named_label_use_list
GTY(())
187 struct cp_binding_level
*binding_level
;
190 location_t o_goto_locus
;
191 struct named_label_use_list
*next
;
194 #define named_label_uses cp_function_chain->x_named_label_uses
196 #define local_names cp_function_chain->x_local_names
198 /* A list of objects which have constructors or destructors
199 which reside in the global scope. The decl is stored in
200 the TREE_VALUE slot and the initializer is stored
201 in the TREE_PURPOSE slot. */
202 tree static_aggregates
;
206 /* A node for the integer constants 2, and 3. */
208 tree integer_two_node
, integer_three_node
;
210 /* A list of all LABEL_DECLs in the function that have names. Here so
211 we can clear out their names' definitions at the end of the
212 function, and so we can check the validity of jumps to these labels. */
214 struct named_label_list
GTY(())
216 struct cp_binding_level
*binding_level
;
221 struct named_label_list
*next
;
222 unsigned int in_try_scope
: 1;
223 unsigned int in_catch_scope
: 1;
226 #define named_labels cp_function_chain->x_named_labels
228 /* The number of function bodies which we are currently processing.
229 (Zero if we are at namespace scope, one inside the body of a
230 function, two inside the body of a function in a local class, etc.) */
233 /* States indicating how grokdeclarator() should handle declspecs marked
234 with __attribute__((deprecated)). An object declared as
235 __attribute__((deprecated)) suppresses warnings of uses of other
238 enum deprecated_states
{
243 static enum deprecated_states deprecated_state
= DEPRECATED_NORMAL
;
245 /* Set by add_implicitly_declared_members() to keep those members from
246 being flagged as deprecated or reported as using deprecated
248 int adding_implicit_members
= 0;
250 /* True if a declaration with an `extern' linkage specifier is being
252 bool have_extern_spec
;
255 /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or
256 UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the
257 time the VAR_DECL was declared, the type was incomplete. */
259 static GTY(()) tree incomplete_vars
;
261 /* Returns the kind of template specialization we are currently
262 processing, given that it's declaration contained N_CLASS_SCOPES
263 explicit scope qualifications. */
266 current_tmpl_spec_kind (int n_class_scopes
)
268 int n_template_parm_scopes
= 0;
269 int seen_specialization_p
= 0;
270 int innermost_specialization_p
= 0;
271 struct cp_binding_level
*b
;
273 /* Scan through the template parameter scopes. */
274 for (b
= current_binding_level
;
275 b
->kind
== sk_template_parms
;
278 /* If we see a specialization scope inside a parameter scope,
279 then something is wrong. That corresponds to a declaration
282 template <class T> template <> ...
284 which is always invalid since [temp.expl.spec] forbids the
285 specialization of a class member template if the enclosing
286 class templates are not explicitly specialized as well. */
287 if (b
->explicit_spec_p
)
289 if (n_template_parm_scopes
== 0)
290 innermost_specialization_p
= 1;
292 seen_specialization_p
= 1;
294 else if (seen_specialization_p
== 1)
295 return tsk_invalid_member_spec
;
297 ++n_template_parm_scopes
;
300 /* Handle explicit instantiations. */
301 if (processing_explicit_instantiation
)
303 if (n_template_parm_scopes
!= 0)
304 /* We've seen a template parameter list during an explicit
305 instantiation. For example:
307 template <class T> template void f(int);
309 This is erroneous. */
310 return tsk_invalid_expl_inst
;
312 return tsk_expl_inst
;
315 if (n_template_parm_scopes
< n_class_scopes
)
316 /* We've not seen enough template headers to match all the
317 specialized classes present. For example:
319 template <class T> void R<T>::S<T>::f(int);
321 This is invalid; there needs to be one set of template
322 parameters for each class. */
323 return tsk_insufficient_parms
;
324 else if (n_template_parm_scopes
== n_class_scopes
)
325 /* We're processing a non-template declaration (even though it may
326 be a member of a template class.) For example:
328 template <class T> void S<T>::f(int);
330 The `class T' maches the `S<T>', leaving no template headers
331 corresponding to the `f'. */
333 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
334 /* We've got too many template headers. For example:
336 template <> template <class T> void f (T);
338 There need to be more enclosing classes. */
339 return tsk_excessive_parms
;
341 /* This must be a template. It's of the form:
343 template <class T> template <class U> void S<T>::f(U);
345 This is a specialization if the innermost level was a
346 specialization; otherwise it's just a definition of the
348 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
351 /* Exit the current scope. */
359 /* When a label goes out of scope, check to see if that label was used
360 in a valid manner, and issue any appropriate warnings or errors. */
363 pop_label (tree label
, tree old_value
)
365 if (!processing_template_decl
)
367 if (DECL_INITIAL (label
) == NULL_TREE
)
371 cp_error_at ("label `%D' used but not defined", label
);
372 location
.file
= input_filename
;
374 /* Avoid crashing later. */
375 define_label (location
, DECL_NAME (label
));
377 else if (warn_unused_label
&& !TREE_USED (label
))
378 cp_warning_at ("label `%D' defined but not used", label
);
381 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
384 /* At the end of a function, all labels declared within the function
385 go out of scope. BLOCK is the top-level block for the
389 pop_labels (tree block
)
391 struct named_label_list
*link
;
393 /* Clear out the definitions of all label names, since their scopes
395 for (link
= named_labels
; link
; link
= link
->next
)
397 pop_label (link
->label_decl
, link
->old_value
);
398 /* Put the labels into the "variables" of the top-level block,
399 so debugger can see them. */
400 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
401 BLOCK_VARS (block
) = link
->label_decl
;
407 /* Exit a binding level.
408 Pop the level off, and restore the state of the identifier-decl mappings
409 that were in effect when this level was entered.
411 If KEEP == 1, this level had explicit declarations, so
412 and create a "block" (a BLOCK node) for the level
413 to record its declarations and subblocks for symbol table output.
415 If FUNCTIONBODY is nonzero, this level is the body of a function,
416 so create a block as if KEEP were set and also clear out all
419 If REVERSE is nonzero, reverse the order of decls before putting
420 them into the BLOCK. */
423 poplevel (int keep
, int reverse
, int functionbody
)
426 /* The chain of decls was accumulated in reverse order.
427 Put it into forward order, just for cleanliness. */
429 int tmp
= functionbody
;
430 int real_functionbody
;
434 int leaving_for_scope
;
437 timevar_push (TV_NAME_LOOKUP
);
442 my_friendly_assert (current_binding_level
->kind
!= sk_class
, 19990916);
444 real_functionbody
= (current_binding_level
->kind
== sk_cleanup
445 ? ((functionbody
= 0), tmp
) : functionbody
);
446 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
448 my_friendly_assert (!current_binding_level
->class_shadowed
,
451 /* We used to use KEEP == 2 to indicate that the new block should go
452 at the beginning of the list of blocks at this binding level,
453 rather than the end. This hack is no longer used. */
454 my_friendly_assert (keep
== 0 || keep
== 1, 0);
456 if (current_binding_level
->keep
)
459 /* Any uses of undefined labels, and any defined labels, now operate
460 under constraints of next binding contour. */
461 if (cfun
&& !functionbody
)
463 struct cp_binding_level
*level_chain
;
464 level_chain
= current_binding_level
->level_chain
;
467 struct named_label_use_list
*uses
;
468 struct named_label_list
*labels
;
469 for (labels
= named_labels
; labels
; labels
= labels
->next
)
470 if (labels
->binding_level
== current_binding_level
)
473 if (current_binding_level
->kind
== sk_try
)
474 labels
->in_try_scope
= 1;
475 if (current_binding_level
->kind
== sk_catch
)
476 labels
->in_catch_scope
= 1;
477 for (decl
= labels
->names_in_scope
; decl
;
478 decl
= TREE_CHAIN (decl
))
479 if (decl_jump_unsafe (decl
))
480 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
482 labels
->binding_level
= level_chain
;
483 labels
->names_in_scope
= level_chain
->names
;
486 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
487 if (uses
->binding_level
== current_binding_level
)
489 uses
->binding_level
= level_chain
;
490 uses
->names_in_scope
= level_chain
->names
;
495 /* Get the decls in the order they were written.
496 Usually current_binding_level->names is in reverse order.
497 But parameter decls were previously put in forward order. */
500 current_binding_level
->names
501 = decls
= nreverse (current_binding_level
->names
);
503 decls
= current_binding_level
->names
;
505 /* When not in function-at-a-time mode, expand_end_bindings will
506 warn about unused variables. But, in function-at-a-time mode
507 expand_end_bindings is not passed the list of variables in the
508 current scope, and therefore no warning is emitted. So, we
509 explicitly warn here. */
510 if (!processing_template_decl
)
511 warn_about_unused_variables (getdecls ());
513 /* If there were any declarations or structure tags in that level,
514 or if this level is a function body,
515 create a BLOCK to record them for the life of this function. */
517 if (keep
== 1 || functionbody
)
518 block
= make_node (BLOCK
);
519 if (block
!= NULL_TREE
)
521 BLOCK_VARS (block
) = decls
;
522 BLOCK_SUBBLOCKS (block
) = subblocks
;
525 /* In each subblock, record that this is its superior. */
527 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
528 BLOCK_SUPERCONTEXT (link
) = block
;
530 /* We still support the old for-scope rules, whereby the variables
531 in a for-init statement were in scope after the for-statement
532 ended. We only use the new rules if flag_new_for_scope is
535 = current_binding_level
->kind
== sk_for
&& flag_new_for_scope
== 1;
537 /* Remove declarations for all the DECLs in this level. */
538 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
540 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
543 cxx_binding
*outer_binding
544 = IDENTIFIER_BINDING (DECL_NAME (link
))->previous
;
548 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
550 ns_binding
= NULL_TREE
;
553 && outer_binding
->scope
== current_binding_level
->level_chain
)
554 /* We have something like:
559 and we are leaving the `for' scope. There's no reason to
560 keep the binding of the inner `i' in this case. */
561 pop_binding (DECL_NAME (link
), link
);
562 else if ((outer_binding
563 && (TREE_CODE (outer_binding
->value
) == TYPE_DECL
))
564 || (ns_binding
&& TREE_CODE (ns_binding
) == TYPE_DECL
))
565 /* Here, we have something like:
573 We must pop the for-scope binding so we know what's a
574 type and what isn't. */
575 pop_binding (DECL_NAME (link
), link
);
578 /* Mark this VAR_DECL as dead so that we can tell we left it
579 there only for backward compatibility. */
580 DECL_DEAD_FOR_LOCAL (link
) = 1;
582 /* Keep track of what should have happened when we
583 popped the binding. */
584 if (outer_binding
&& outer_binding
->value
)
585 DECL_SHADOWED_FOR_VAR (link
) = outer_binding
->value
;
587 /* Add it to the list of dead variables in the next
588 outermost binding to that we can remove these when we
589 leave that binding. */
590 current_binding_level
->level_chain
->dead_vars_from_for
591 = tree_cons (NULL_TREE
, link
,
592 current_binding_level
->level_chain
->
595 /* Although we don't pop the cxx_binding, we do clear
596 its SCOPE since the scope is going away now. */
597 IDENTIFIER_BINDING (DECL_NAME (link
))->scope
= NULL
;
602 /* Remove the binding. */
604 if (TREE_CODE (decl
) == TREE_LIST
)
605 decl
= TREE_VALUE (decl
);
607 pop_binding (DECL_NAME (decl
), decl
);
608 else if (TREE_CODE (decl
) == OVERLOAD
)
609 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
615 /* Remove declarations for any `for' variables from inner scopes
616 that we kept around. */
617 for (link
= current_binding_level
->dead_vars_from_for
;
618 link
; link
= TREE_CHAIN (link
))
619 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
621 /* Restore the IDENTIFIER_TYPE_VALUEs. */
622 for (link
= current_binding_level
->type_shadowed
;
623 link
; link
= TREE_CHAIN (link
))
624 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
626 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
627 for (link
= current_binding_level
->shadowed_labels
;
629 link
= TREE_CHAIN (link
))
630 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
632 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
633 list if a `using' declaration put them there. The debugging
634 back-ends won't understand OVERLOAD, so we remove them here.
635 Because the BLOCK_VARS are (temporarily) shared with
636 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
637 popped all the bindings. */
642 for (d
= &BLOCK_VARS (block
); *d
; )
644 if (TREE_CODE (*d
) == TREE_LIST
)
645 *d
= TREE_CHAIN (*d
);
647 d
= &TREE_CHAIN (*d
);
651 /* If the level being exited is the top level of a function,
652 check over all the labels. */
655 /* Since this is the top level block of a function, the vars are
656 the function's parameters. Don't leave them in the BLOCK
657 because they are found in the FUNCTION_DECL instead. */
658 BLOCK_VARS (block
) = 0;
662 kind
= current_binding_level
->kind
;
663 if (kind
== sk_cleanup
)
667 /* If this is a temporary binding created for a cleanup, then we'll
668 have pushed a statement list level. Pop that, create a new
669 BIND_EXPR for the block, and insert it into the stream. */
670 stmt
= pop_stmt_list (current_binding_level
->statement_list
);
671 stmt
= c_build_bind_expr (block
, stmt
);
677 DECL_INITIAL (current_function_decl
) = block
;
679 current_binding_level
->blocks
680 = chainon (current_binding_level
->blocks
, block
);
682 /* If we did not make a block for the level just exited,
683 any blocks made for inner levels
684 (since they cannot be recorded as subblocks in that level)
685 must be carried forward so they will later become subblocks
686 of something else. */
688 current_binding_level
->blocks
689 = chainon (current_binding_level
->blocks
, subblocks
);
691 /* Each and every BLOCK node created here in `poplevel' is important
692 (e.g. for proper debugging information) so if we created one
693 earlier, mark it as "used". */
695 TREE_USED (block
) = 1;
697 /* All temporary bindings created for cleanups are popped silently. */
698 if (kind
== sk_cleanup
)
701 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, block
);
704 /* Delete the node BLOCK from the current binding level.
705 This is used for the block inside a stmt expr ({...})
706 so that the block can be reinserted where appropriate. */
709 delete_block (tree block
)
712 if (current_binding_level
->blocks
== block
)
713 current_binding_level
->blocks
= TREE_CHAIN (block
);
714 for (t
= current_binding_level
->blocks
; t
;)
716 if (TREE_CHAIN (t
) == block
)
717 TREE_CHAIN (t
) = TREE_CHAIN (block
);
721 TREE_CHAIN (block
) = NULL_TREE
;
722 /* Clear TREE_USED which is always set by poplevel.
723 The flag is set again if insert_block is called. */
724 TREE_USED (block
) = 0;
727 /* Insert BLOCK at the end of the list of subblocks of the
728 current binding level. This is used when a BIND_EXPR is expanded,
729 to handle the BLOCK node inside the BIND_EXPR. */
732 insert_block (tree block
)
734 TREE_USED (block
) = 1;
735 current_binding_level
->blocks
736 = chainon (current_binding_level
->blocks
, block
);
739 /* Set the BLOCK node for the innermost scope
740 (the one we are currently in). */
743 set_block (tree block ATTRIBUTE_UNUSED
)
745 /* The RTL expansion machinery requires us to provide this callback,
746 but it is not applicable in function-at-a-time mode. */
749 /* Returns nonzero if T is a virtual function table. */
752 vtable_decl_p (tree t
, void* data ATTRIBUTE_UNUSED
)
754 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
757 /* Returns nonzero if T is a TYPE_DECL for a type with virtual
761 vtype_decl_p (tree t
, void *data ATTRIBUTE_UNUSED
)
763 return (TREE_CODE (t
) == TYPE_DECL
764 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
765 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
768 struct walk_globals_data
{
774 /* Walk the vtable declarations in NAMESPACE. Whenever one is found
775 for which P returns nonzero, call F with its address. If any call
776 to F returns a nonzero value, return a nonzero value. */
779 walk_vtables_r (tree
namespace, void* data
)
781 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
782 walk_globals_fn f
= wgd
->f
;
784 tree decl
= NAMESPACE_LEVEL (namespace)->vtables
;
787 for (; decl
; decl
= TREE_CHAIN (decl
))
788 result
|= (*f
) (&decl
, d
);
793 /* Walk the vtable declarations. Whenever one is found for which P
794 returns nonzero, call F with its address. If any call to F
795 returns a nonzero value, return a nonzero value. */
797 walk_vtables (walk_globals_pred p
, walk_globals_fn f
, void *data
)
799 struct walk_globals_data wgd
;
804 return walk_namespaces (walk_vtables_r
, &wgd
);
807 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
808 itself, calling F for each. The DATA is passed to F as well. */
811 walk_namespaces_r (tree
namespace, walk_namespaces_fn f
, void* data
)
814 tree current
= NAMESPACE_LEVEL (namespace)->namespaces
;
816 result
|= (*f
) (namespace, data
);
818 for (; current
; current
= TREE_CHAIN (current
))
819 result
|= walk_namespaces_r (current
, f
, data
);
824 /* Walk all the namespaces, calling F for each. The DATA is passed to
828 walk_namespaces (walk_namespaces_fn f
, void* data
)
830 return walk_namespaces_r (global_namespace
, f
, data
);
833 /* Walk the global declarations in NAMESPACE. Whenever one is found
834 for which P returns nonzero, call F with its address. If any call
835 to F returns a nonzero value, return a nonzero value. */
838 walk_globals_r (tree
namespace, void* data
)
840 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
841 walk_globals_pred p
= wgd
->p
;
842 walk_globals_fn f
= wgd
->f
;
847 t
= &NAMESPACE_LEVEL (namespace)->names
;
854 result
|= (*f
) (t
, d
);
856 /* If F changed *T, then *T still points at the next item to
859 t
= &TREE_CHAIN (*t
);
865 /* Walk the global declarations. Whenever one is found for which P
866 returns true, call F with its address. If any call to F
867 returns true, return true. */
870 walk_globals (walk_globals_pred p
, walk_globals_fn f
, void *data
)
872 struct walk_globals_data wgd
;
877 return walk_namespaces (walk_globals_r
, &wgd
);
880 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
881 DATA is non-NULL, this is the last time we will call
882 wrapup_global_declarations for this NAMESPACE. */
885 wrapup_globals_for_namespace (tree
namespace, void* data
)
887 struct cp_binding_level
*level
= NAMESPACE_LEVEL (namespace);
888 varray_type statics
= level
->static_decls
;
889 tree
*vec
= &VARRAY_TREE (statics
, 0);
890 int len
= VARRAY_ACTIVE_SIZE (statics
);
891 int last_time
= (data
!= 0);
895 check_global_declarations (vec
, len
);
899 /* Write out any globals that need to be output. */
900 return wrapup_global_declarations (vec
, len
);
904 /* In C++, you don't have to write `struct S' to refer to `S'; you
905 can just use `S'. We accomplish this by creating a TYPE_DECL as
906 if the user had written `typedef struct S S'. Create and return
907 the TYPE_DECL for TYPE. */
910 create_implicit_typedef (tree name
, tree type
)
914 decl
= build_decl (TYPE_DECL
, name
, type
);
915 DECL_ARTIFICIAL (decl
) = 1;
916 /* There are other implicit type declarations, like the one *within*
917 a class that allows you to write `S::S'. We must distinguish
919 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
920 TYPE_NAME (type
) = decl
;
925 /* Remember a local name for name-mangling purposes. */
928 push_local_name (tree decl
)
933 timevar_push (TV_NAME_LOOKUP
);
935 VARRAY_TREE_INIT (local_names
, 8, "local_names");
937 name
= DECL_NAME (decl
);
939 nelts
= VARRAY_ACTIVE_SIZE (local_names
);
940 for (i
= 0; i
< nelts
; i
++)
942 t
= VARRAY_TREE (local_names
, i
);
943 if (DECL_NAME (t
) == name
)
945 if (!DECL_LANG_SPECIFIC (decl
))
946 retrofit_lang_decl (decl
);
947 DECL_LANG_SPECIFIC (decl
)->decl_flags
.u2sel
= 1;
948 if (DECL_LANG_SPECIFIC (t
))
949 DECL_DISCRIMINATOR (decl
) = DECL_DISCRIMINATOR (t
) + 1;
951 DECL_DISCRIMINATOR (decl
) = 1;
953 VARRAY_TREE (local_names
, i
) = decl
;
954 timevar_pop (TV_NAME_LOOKUP
);
959 VARRAY_PUSH_TREE (local_names
, decl
);
960 timevar_pop (TV_NAME_LOOKUP
);
963 /* Subroutine of duplicate_decls: return truthvalue of whether
964 or not types of these decls match.
966 For C++, we must compare the parameter list so that `int' can match
967 `int&' in a parameter position, but `int&' is not confused with
971 decls_match (tree newdecl
, tree olddecl
)
975 if (newdecl
== olddecl
)
978 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
979 /* If the two DECLs are not even the same kind of thing, we're not
980 interested in their types. */
983 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
985 tree f1
= TREE_TYPE (newdecl
);
986 tree f2
= TREE_TYPE (olddecl
);
987 tree p1
= TYPE_ARG_TYPES (f1
);
988 tree p2
= TYPE_ARG_TYPES (f2
);
990 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
991 && ! (DECL_EXTERN_C_P (newdecl
)
992 && DECL_EXTERN_C_P (olddecl
)))
995 if (TREE_CODE (f1
) != TREE_CODE (f2
))
998 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
1000 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
1001 && (DECL_BUILT_IN (olddecl
)
1002 #ifndef NO_IMPLICIT_EXTERN_C
1003 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
1004 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
1008 types_match
= self_promoting_args_p (p1
);
1009 if (p1
== void_list_node
)
1010 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
1012 #ifndef NO_IMPLICIT_EXTERN_C
1013 else if (p1
== NULL_TREE
1014 && (DECL_EXTERN_C_P (olddecl
)
1015 && DECL_IN_SYSTEM_HEADER (olddecl
)
1016 && !DECL_CLASS_SCOPE_P (olddecl
))
1017 && (DECL_EXTERN_C_P (newdecl
)
1018 && DECL_IN_SYSTEM_HEADER (newdecl
)
1019 && !DECL_CLASS_SCOPE_P (newdecl
)))
1021 types_match
= self_promoting_args_p (p2
);
1022 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
1026 types_match
= compparms (p1
, p2
);
1031 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
1033 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
1034 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
1037 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
1038 DECL_TEMPLATE_PARMS (olddecl
)))
1041 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
1042 types_match
= same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
)),
1043 TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
)));
1045 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
1046 DECL_TEMPLATE_RESULT (newdecl
));
1050 if (TREE_TYPE (newdecl
) == error_mark_node
)
1051 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
1052 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
1053 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
1054 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
1057 types_match
= comptypes (TREE_TYPE (newdecl
),
1058 TREE_TYPE (olddecl
),
1059 COMPARE_REDECLARATION
);
1065 /* If NEWDECL is `static' and an `extern' was seen previously,
1066 warn about it. OLDDECL is the previous declaration.
1068 Note that this does not apply to the C++ case of declaring
1069 a variable `extern const' and then later `const'.
1071 Don't complain about built-in functions, since they are beyond
1072 the user's control. */
1075 warn_extern_redeclared_static (tree newdecl
, tree olddecl
)
1079 if (TREE_CODE (newdecl
) == TYPE_DECL
1080 || TREE_CODE (newdecl
) == TEMPLATE_DECL
1081 || TREE_CODE (newdecl
) == CONST_DECL
1082 || TREE_CODE (newdecl
) == NAMESPACE_DECL
)
1085 /* Don't get confused by static member functions; that's a different
1087 if (TREE_CODE (newdecl
) == FUNCTION_DECL
1088 && DECL_STATIC_FUNCTION_P (newdecl
))
1091 /* If the old declaration was `static', or the new one isn't, then
1092 then everything is OK. */
1093 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
1096 /* It's OK to declare a builtin function as `static'. */
1097 if (TREE_CODE (olddecl
) == FUNCTION_DECL
1098 && DECL_ARTIFICIAL (olddecl
))
1101 name
= DECL_ASSEMBLER_NAME (newdecl
);
1102 pedwarn ("`%D' was declared `extern' and later `static'", newdecl
);
1103 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
1106 /* If NEWDECL is a redeclaration of OLDDECL, merge the declarations.
1107 If the redeclaration is invalid, a diagnostic is issued, and the
1108 error_mark_node is returned. Otherwise, OLDDECL is returned.
1110 If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is
1114 duplicate_decls (tree newdecl
, tree olddecl
)
1116 unsigned olddecl_uid
= DECL_UID (olddecl
);
1117 int olddecl_friend
= 0, types_match
= 0;
1118 int new_defines_function
= 0;
1120 if (newdecl
== olddecl
)
1123 types_match
= decls_match (newdecl
, olddecl
);
1125 /* If either the type of the new decl or the type of the old decl is an
1126 error_mark_node, then that implies that we have already issued an
1127 error (earlier) for some bogus type specification, and in that case,
1128 it is rather pointless to harass the user with yet more error message
1129 about the same declaration, so just pretend the types match here. */
1130 if (TREE_TYPE (newdecl
) == error_mark_node
1131 || TREE_TYPE (olddecl
) == error_mark_node
)
1134 if (DECL_P (olddecl
)
1135 && TREE_CODE (newdecl
) == FUNCTION_DECL
1136 && TREE_CODE (olddecl
) == FUNCTION_DECL
1137 && (DECL_UNINLINABLE (newdecl
) || DECL_UNINLINABLE (olddecl
)))
1139 if (DECL_DECLARED_INLINE_P (newdecl
)
1140 && DECL_UNINLINABLE (newdecl
)
1141 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
1142 /* Already warned elsewhere. */;
1143 else if (DECL_DECLARED_INLINE_P (olddecl
)
1144 && DECL_UNINLINABLE (olddecl
)
1145 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
1146 /* Already warned. */;
1147 else if (DECL_DECLARED_INLINE_P (newdecl
)
1148 && DECL_UNINLINABLE (olddecl
)
1149 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
1151 warning ("%Jfunction '%D' redeclared as inline", newdecl
, newdecl
);
1152 warning ("%Jprevious declaration of '%D' with attribute noinline",
1155 else if (DECL_DECLARED_INLINE_P (olddecl
)
1156 && DECL_UNINLINABLE (newdecl
)
1157 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
1159 warning ("%Jfunction '%D' redeclared with attribute noinline",
1161 warning ("%Jprevious declaration of '%D' was inline",
1166 /* Check for redeclaration and other discrepancies. */
1167 if (TREE_CODE (olddecl
) == FUNCTION_DECL
1168 && DECL_ARTIFICIAL (olddecl
))
1170 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
1172 /* Avoid warnings redeclaring anticipated built-ins. */
1173 if (DECL_ANTICIPATED (olddecl
))
1176 /* If you declare a built-in or predefined function name as static,
1177 the old definition is overridden, but optionally warn this was a
1178 bad choice of name. */
1179 if (! TREE_PUBLIC (newdecl
))
1182 warning ("shadowing %s function `%#D'",
1183 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
1185 /* Discard the old built-in function. */
1188 /* If the built-in is not ansi, then programs can override
1189 it even globally without an error. */
1190 else if (! DECL_BUILT_IN (olddecl
))
1191 warning ("library function `%#D' redeclared as non-function `%#D'",
1195 error ("declaration of `%#D'", newdecl
);
1196 error ("conflicts with built-in declaration `%#D'",
1201 else if (!types_match
)
1203 /* Avoid warnings redeclaring anticipated built-ins. */
1204 if (DECL_ANTICIPATED (olddecl
))
1206 /* Deal with fileptr_type_node. FILE type is not known
1207 at the time we create the builtins. */
1210 for (t1
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
1211 t2
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
1213 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1216 else if (TREE_VALUE (t2
) == fileptr_type_node
)
1218 tree t
= TREE_VALUE (t1
);
1220 if (TREE_CODE (t
) == POINTER_TYPE
1221 && TYPE_NAME (TREE_TYPE (t
))
1222 && DECL_NAME (TYPE_NAME (TREE_TYPE (t
)))
1223 == get_identifier ("FILE")
1224 && compparms (TREE_CHAIN (t1
), TREE_CHAIN (t2
)))
1226 tree oldargs
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
1228 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))
1229 = TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
1230 types_match
= decls_match (newdecl
, olddecl
);
1232 return duplicate_decls (newdecl
, olddecl
);
1233 TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) = oldargs
;
1236 else if (! same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1239 else if ((DECL_EXTERN_C_P (newdecl
)
1240 && DECL_EXTERN_C_P (olddecl
))
1241 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
1242 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
1244 /* A near match; override the builtin. */
1246 if (TREE_PUBLIC (newdecl
))
1248 warning ("new declaration `%#D'", newdecl
);
1249 warning ("ambiguates built-in declaration `%#D'",
1252 else if (warn_shadow
)
1253 warning ("shadowing %s function `%#D'",
1254 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
1258 /* Discard the old built-in function. */
1261 /* Replace the old RTL to avoid problems with inlining. */
1262 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
1264 /* Even if the types match, prefer the new declarations type
1265 for anticipated built-ins, for exception lists, etc... */
1266 else if (DECL_ANTICIPATED (olddecl
))
1268 tree type
= TREE_TYPE (newdecl
);
1269 tree attribs
= (*targetm
.merge_type_attributes
)
1270 (TREE_TYPE (olddecl
), type
);
1272 type
= cp_build_type_attribute_variant (type
, attribs
);
1273 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = type
;
1276 /* Whether or not the builtin can throw exceptions has no
1277 bearing on this declarator. */
1278 TREE_NOTHROW (olddecl
) = 0;
1280 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
1282 /* If a builtin function is redeclared as `static', merge
1283 the declarations, but make the original one static. */
1284 DECL_THIS_STATIC (olddecl
) = 1;
1285 TREE_PUBLIC (olddecl
) = 0;
1287 /* Make the old declaration consistent with the new one so
1288 that all remnants of the builtin-ness of this function
1289 will be banished. */
1290 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
1291 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
1294 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
1296 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
1297 && TREE_CODE (newdecl
) != TYPE_DECL
1298 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
1299 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
1300 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
1301 && TREE_CODE (olddecl
) != TYPE_DECL
1302 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
1303 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
1306 /* We do nothing special here, because C++ does such nasty
1307 things with TYPE_DECLs. Instead, just let the TYPE_DECL
1308 get shadowed, and know that if we need to find a TYPE_DECL
1309 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
1310 slot of the identifier. */
1314 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
1315 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
1316 || (TREE_CODE (olddecl
) == FUNCTION_DECL
1317 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
1320 error ("`%#D' redeclared as different kind of symbol", newdecl
);
1321 if (TREE_CODE (olddecl
) == TREE_LIST
)
1322 olddecl
= TREE_VALUE (olddecl
);
1323 cp_error_at ("previous declaration of `%#D'", olddecl
);
1325 return error_mark_node
;
1327 else if (!types_match
)
1329 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
1330 /* These are certainly not duplicate declarations; they're
1331 from different scopes. */
1334 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
1336 /* The name of a class template may not be declared to refer to
1337 any other template, class, function, object, namespace, value,
1338 or type in the same scope. */
1339 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
1340 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
1342 error ("declaration of template `%#D'", newdecl
);
1343 cp_error_at ("conflicts with previous declaration `%#D'",
1346 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
1347 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
1348 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
1349 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
1350 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
1351 DECL_TEMPLATE_PARMS (olddecl
))
1352 /* Template functions can be disambiguated by
1354 && same_type_p (TREE_TYPE (TREE_TYPE (newdecl
)),
1355 TREE_TYPE (TREE_TYPE (olddecl
))))
1357 error ("new declaration `%#D'", newdecl
);
1358 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
1362 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1364 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
1366 error ("declaration of C function `%#D' conflicts with",
1368 cp_error_at ("previous declaration `%#D' here", olddecl
);
1370 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
1371 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
1373 error ("new declaration `%#D'", newdecl
);
1374 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
1381 error ("conflicting declaration '%#D'", newdecl
);
1382 cp_error_at ("'%D' has a previous declaration as `%#D'",
1387 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
1388 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
1389 && (!DECL_TEMPLATE_INFO (newdecl
)
1390 || (DECL_TI_TEMPLATE (newdecl
)
1391 != DECL_TI_TEMPLATE (olddecl
))))
1392 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
1393 && (!DECL_TEMPLATE_INFO (olddecl
)
1394 || (DECL_TI_TEMPLATE (olddecl
)
1395 != DECL_TI_TEMPLATE (newdecl
))))))
1396 /* It's OK to have a template specialization and a non-template
1397 with the same type, or to have specializations of two
1398 different templates with the same type. Note that if one is a
1399 specialization, and the other is an instantiation of the same
1400 template, that we do not exit at this point. That situation
1401 can occur if we instantiate a template class, and then
1402 specialize one of its methods. This situation is valid, but
1403 the declarations must be merged in the usual way. */
1405 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
1406 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
1407 && !DECL_USE_TEMPLATE (newdecl
))
1408 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
1409 && !DECL_USE_TEMPLATE (olddecl
))))
1410 /* One of the declarations is a template instantiation, and the
1411 other is not a template at all. That's OK. */
1413 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
1414 && DECL_NAMESPACE_ALIAS (newdecl
)
1415 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
1416 /* In [namespace.alias] we have:
1418 In a declarative region, a namespace-alias-definition can be
1419 used to redefine a namespace-alias declared in that declarative
1420 region to refer only to the namespace to which it already
1423 Therefore, if we encounter a second alias directive for the same
1424 alias, we can just ignore the second directive. */
1428 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
1431 error (errmsg
, newdecl
);
1432 if (DECL_NAME (olddecl
) != NULL_TREE
)
1433 cp_error_at ((DECL_INITIAL (olddecl
)
1434 && namespace_bindings_p ())
1435 ? "`%#D' previously defined here"
1436 : "`%#D' previously declared here", olddecl
);
1437 return error_mark_node
;
1439 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
1440 && DECL_INITIAL (olddecl
) != NULL_TREE
1441 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
1442 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
1444 /* Prototype decl follows defn w/o prototype. */
1445 cp_warning_at ("prototype for `%#D'", newdecl
);
1446 warning ("%Jfollows non-prototype definition here", olddecl
);
1448 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
1449 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
1451 /* extern "C" int foo ();
1452 int foo () { bar (); }
1454 if (current_lang_depth () == 0)
1455 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
1458 cp_error_at ("previous declaration of `%#D' with %L linkage",
1459 olddecl
, DECL_LANGUAGE (olddecl
));
1460 error ("conflicts with new declaration with %L linkage",
1461 DECL_LANGUAGE (newdecl
));
1465 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
1467 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
1469 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
1470 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
1473 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
1474 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
1476 for (; t1
&& t1
!= void_list_node
;
1477 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
1478 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
1480 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
1483 pedwarn ("default argument given for parameter %d of `%#D'",
1485 cp_pedwarn_at ("after previous specification in `%#D'",
1490 error ("default argument given for parameter %d of `%#D'",
1492 cp_error_at ("after previous specification in `%#D'",
1497 if (DECL_DECLARED_INLINE_P (newdecl
)
1498 && ! DECL_DECLARED_INLINE_P (olddecl
)
1499 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
1501 warning ("`%#D' was used before it was declared inline", newdecl
);
1502 warning ("%Jprevious non-inline declaration here", olddecl
);
1507 /* Do not merge an implicit typedef with an explicit one. In:
1511 typedef class A A __attribute__ ((foo));
1513 the attribute should apply only to the typedef. */
1514 if (TREE_CODE (olddecl
) == TYPE_DECL
1515 && (DECL_IMPLICIT_TYPEDEF_P (olddecl
)
1516 || DECL_IMPLICIT_TYPEDEF_P (newdecl
)))
1519 /* If new decl is `static' and an `extern' was seen previously,
1521 warn_extern_redeclared_static (newdecl
, olddecl
);
1523 /* We have committed to returning 1 at this point. */
1524 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1526 /* Now that functions must hold information normally held
1527 by field decls, there is extra work to do so that
1528 declaration information does not get destroyed during
1530 if (DECL_VINDEX (olddecl
))
1531 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
1532 if (DECL_CONTEXT (olddecl
))
1533 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
1534 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
1535 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
1536 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
1537 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
1538 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
1539 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
1540 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
1541 SET_OVERLOADED_OPERATOR_CODE
1542 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
1543 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
1545 /* Optionally warn about more than one declaration for the same
1546 name, but don't warn about a function declaration followed by a
1548 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
1549 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
1550 /* Don't warn about extern decl followed by definition. */
1551 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
1552 /* Don't warn about friends, let add_friend take care of it. */
1553 && ! (DECL_FRIEND_P (newdecl
) || DECL_FRIEND_P (olddecl
)))
1555 warning ("redundant redeclaration of `%D' in same scope", newdecl
);
1556 cp_warning_at ("previous declaration of `%D'", olddecl
);
1560 /* Deal with C++: must preserve virtual function table size. */
1561 if (TREE_CODE (olddecl
) == TYPE_DECL
)
1563 tree newtype
= TREE_TYPE (newdecl
);
1564 tree oldtype
= TREE_TYPE (olddecl
);
1566 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
1567 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
1568 CLASSTYPE_FRIEND_CLASSES (newtype
)
1569 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
1571 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
1574 /* Copy all the DECL_... slots specified in the new decl
1575 except for any that we copy here from the old type. */
1576 DECL_ATTRIBUTES (newdecl
)
1577 = (*targetm
.merge_decl_attributes
) (olddecl
, newdecl
);
1579 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
1581 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
1582 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
1583 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
1584 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
1586 /* If the new declaration is a definition, update the file and
1587 line information on the declaration. */
1588 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)) == NULL_TREE
1589 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
)) != NULL_TREE
)
1591 DECL_SOURCE_LOCATION (olddecl
)
1592 = DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (olddecl
))
1593 = DECL_SOURCE_LOCATION (newdecl
);
1594 if (DECL_FUNCTION_TEMPLATE_P (newdecl
))
1595 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (olddecl
))
1596 = DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (newdecl
));
1599 if (DECL_FUNCTION_TEMPLATE_P (newdecl
))
1601 DECL_INLINE (DECL_TEMPLATE_RESULT (olddecl
))
1602 |= DECL_INLINE (DECL_TEMPLATE_RESULT (newdecl
));
1603 DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (olddecl
))
1604 |= DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (newdecl
));
1612 /* Automatically handles default parameters. */
1613 tree oldtype
= TREE_TYPE (olddecl
);
1616 /* Merge the data types specified in the two decls. */
1617 newtype
= merge_types (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
1619 /* If merge_types produces a non-typedef type, just use the old type. */
1620 if (TREE_CODE (newdecl
) == TYPE_DECL
1621 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
1624 if (TREE_CODE (newdecl
) == VAR_DECL
)
1626 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
1627 DECL_INITIALIZED_P (newdecl
) |= DECL_INITIALIZED_P (olddecl
);
1628 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl
)
1629 |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl
);
1632 /* Do this after calling `merge_types' so that default
1633 parameters don't confuse us. */
1634 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
1635 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
1636 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
1638 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
1639 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
1640 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
1641 TYPE_RAISES_EXCEPTIONS (oldtype
));
1643 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
1644 && DECL_SOURCE_LINE (olddecl
) != 0
1646 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
1647 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
1649 error ("declaration of `%F' throws different exceptions",
1651 cp_error_at ("than previous declaration `%F'", olddecl
);
1654 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
1656 /* Lay the type out, unless already done. */
1657 if (! same_type_p (newtype
, oldtype
)
1658 && TREE_TYPE (newdecl
) != error_mark_node
1659 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
1660 layout_type (TREE_TYPE (newdecl
));
1662 if ((TREE_CODE (newdecl
) == VAR_DECL
1663 || TREE_CODE (newdecl
) == PARM_DECL
1664 || TREE_CODE (newdecl
) == RESULT_DECL
1665 || TREE_CODE (newdecl
) == FIELD_DECL
1666 || TREE_CODE (newdecl
) == TYPE_DECL
)
1667 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
1668 layout_decl (newdecl
, 0);
1670 /* Merge the type qualifiers. */
1671 if (TREE_READONLY (newdecl
))
1672 TREE_READONLY (olddecl
) = 1;
1673 if (TREE_THIS_VOLATILE (newdecl
))
1674 TREE_THIS_VOLATILE (olddecl
) = 1;
1676 /* Merge the initialization information. */
1677 if (DECL_INITIAL (newdecl
) == NULL_TREE
1678 && DECL_INITIAL (olddecl
) != NULL_TREE
)
1680 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
1681 DECL_SOURCE_LOCATION (newdecl
) = DECL_SOURCE_LOCATION (olddecl
);
1682 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
1683 && DECL_LANG_SPECIFIC (newdecl
)
1684 && DECL_LANG_SPECIFIC (olddecl
))
1686 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
1687 DECL_STRUCT_FUNCTION (newdecl
) = DECL_STRUCT_FUNCTION (olddecl
);
1691 /* Merge the section attribute.
1692 We want to issue an error if the sections conflict but that must be
1693 done later in decl_attributes since we are called before attributes
1695 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
1696 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
1698 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1700 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
1701 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
1702 DECL_NO_LIMIT_STACK (newdecl
) |= DECL_NO_LIMIT_STACK (olddecl
);
1703 TREE_THIS_VOLATILE (newdecl
) |= TREE_THIS_VOLATILE (olddecl
);
1704 TREE_READONLY (newdecl
) |= TREE_READONLY (olddecl
);
1705 TREE_NOTHROW (newdecl
) |= TREE_NOTHROW (olddecl
);
1706 DECL_IS_MALLOC (newdecl
) |= DECL_IS_MALLOC (olddecl
);
1707 DECL_IS_PURE (newdecl
) |= DECL_IS_PURE (olddecl
);
1708 /* Keep the old RTL. */
1709 COPY_DECL_RTL (olddecl
, newdecl
);
1711 else if (TREE_CODE (newdecl
) == VAR_DECL
1712 && (DECL_SIZE (olddecl
) || !DECL_SIZE (newdecl
)))
1714 /* Keep the old RTL. We cannot keep the old RTL if the old
1715 declaration was for an incomplete object and the new
1716 declaration is not since many attributes of the RTL will
1718 COPY_DECL_RTL (olddecl
, newdecl
);
1721 /* If cannot merge, then use the new type and qualifiers,
1722 and don't preserve the old rtl. */
1725 /* Clean out any memory we had of the old declaration. */
1726 tree oldstatic
= value_member (olddecl
, static_aggregates
);
1728 TREE_VALUE (oldstatic
) = error_mark_node
;
1730 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
1731 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
1732 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
1733 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
1736 /* Merge the storage class information. */
1737 merge_weak (newdecl
, olddecl
);
1739 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
1740 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
1741 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
1742 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
1743 if (! DECL_EXTERNAL (olddecl
))
1744 DECL_EXTERNAL (newdecl
) = 0;
1746 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
1748 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
1749 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
1750 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
1751 DECL_TEMPLATE_INSTANTIATED (newdecl
)
1752 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
1753 /* Don't really know how much of the language-specific
1754 values we should copy from old to new. */
1755 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
1756 DECL_LANG_SPECIFIC (newdecl
)->decl_flags
.u2
=
1757 DECL_LANG_SPECIFIC (olddecl
)->decl_flags
.u2
;
1758 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
1759 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
1760 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
1761 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
1762 olddecl_friend
= DECL_FRIEND_P (olddecl
);
1764 /* Only functions have DECL_BEFRIENDING_CLASSES. */
1765 if (TREE_CODE (newdecl
) == FUNCTION_DECL
1766 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
1768 DECL_BEFRIENDING_CLASSES (newdecl
)
1769 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
1770 DECL_BEFRIENDING_CLASSES (olddecl
));
1771 /* DECL_THUNKS is only valid for virtual functions,
1772 otherwise it is a DECL_FRIEND_CONTEXT. */
1773 if (DECL_VIRTUAL_P (newdecl
))
1774 DECL_THUNKS (newdecl
) = DECL_THUNKS (olddecl
);
1778 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1780 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
1781 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
1783 /* If newdecl is not a specialization, then it is not a
1784 template-related function at all. And that means that we
1785 should have exited above, returning 0. */
1786 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
1789 if (TREE_USED (olddecl
))
1790 /* From [temp.expl.spec]:
1792 If a template, a member template or the member of a class
1793 template is explicitly specialized then that
1794 specialization shall be declared before the first use of
1795 that specialization that would cause an implicit
1796 instantiation to take place, in every translation unit in
1797 which such a use occurs. */
1798 error ("explicit specialization of %D after first use",
1801 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
1803 /* [temp.expl.spec/14] We don't inline explicit specialization
1804 just because the primary template says so. */
1808 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
1809 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
1811 DECL_DECLARED_INLINE_P (newdecl
) |= DECL_DECLARED_INLINE_P (olddecl
);
1813 /* If either decl says `inline', this fn is inline, unless
1814 its definition was passed already. */
1815 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
1816 DECL_INLINE (olddecl
) = 1;
1817 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
1819 DECL_UNINLINABLE (newdecl
) = DECL_UNINLINABLE (olddecl
)
1820 = (DECL_UNINLINABLE (newdecl
) || DECL_UNINLINABLE (olddecl
));
1823 /* Preserve abstractness on cloned [cd]tors. */
1824 DECL_ABSTRACT (newdecl
) = DECL_ABSTRACT (olddecl
);
1828 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
1829 COPY_DECL_ASSEMBLER_NAME (newdecl
, olddecl
);
1830 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
1832 if (! types_match
|| new_defines_function
)
1834 /* These need to be copied so that the names are available.
1835 Note that if the types do match, we'll preserve inline
1836 info and other bits, but if not, we won't. */
1837 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
1838 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
1840 if (new_defines_function
)
1841 /* If defining a function declared with other language
1842 linkage, use the previously declared language linkage. */
1843 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
1844 else if (types_match
)
1846 /* If redeclaring a builtin function, and not a definition,
1847 it stays built in. */
1848 if (DECL_BUILT_IN (olddecl
))
1850 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
1851 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
1852 /* If we're keeping the built-in definition, keep the rtl,
1853 regardless of declaration matches. */
1854 SET_DECL_RTL (newdecl
, DECL_RTL (olddecl
));
1857 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
1858 /* Don't clear out the arguments if we're redefining a function. */
1859 if (DECL_ARGUMENTS (olddecl
))
1860 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
1863 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
1864 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
1866 /* Now preserve various other info from the definition. */
1867 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
1868 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
1869 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
1870 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
1872 /* If either declaration has a nondefault visibility, use it. */
1873 if (DECL_VISIBILITY (olddecl
) != VISIBILITY_DEFAULT
)
1875 if (DECL_VISIBILITY (newdecl
) != VISIBILITY_DEFAULT
1876 && DECL_VISIBILITY (newdecl
) != DECL_VISIBILITY (olddecl
))
1878 warning ("%J'%D': visibility attribute ignored because it",
1880 warning ("%Jconflicts with previous declaration here", olddecl
);
1882 DECL_VISIBILITY (newdecl
) = DECL_VISIBILITY (olddecl
);
1885 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1889 function_size
= sizeof (struct tree_decl
);
1891 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
1892 (char *) newdecl
+ sizeof (struct tree_common
),
1893 function_size
- sizeof (struct tree_common
));
1895 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
1896 /* If newdecl is a template instantiation, it is possible that
1897 the following sequence of events has occurred:
1899 o A friend function was declared in a class template. The
1900 class template was instantiated.
1902 o The instantiation of the friend declaration was
1903 recorded on the instantiation list, and is newdecl.
1905 o Later, however, instantiate_class_template called pushdecl
1906 on the newdecl to perform name injection. But, pushdecl in
1907 turn called duplicate_decls when it discovered that another
1908 declaration of a global function with the same name already
1911 o Here, in duplicate_decls, we decided to clobber newdecl.
1913 If we're going to do that, we'd better make sure that
1914 olddecl, and not newdecl, is on the list of
1915 instantiations so that if we try to do the instantiation
1916 again we won't get the clobbered declaration. */
1917 reregister_specialization (newdecl
,
1918 DECL_TI_TEMPLATE (newdecl
),
1923 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
1924 (char *) newdecl
+ sizeof (struct tree_common
),
1925 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
1926 + TREE_CODE_LENGTH (TREE_CODE (newdecl
)) * sizeof (char *));
1929 DECL_UID (olddecl
) = olddecl_uid
;
1931 DECL_FRIEND_P (olddecl
) = 1;
1933 /* NEWDECL contains the merged attribute lists.
1934 Update OLDDECL to be the same. */
1935 DECL_ATTRIBUTES (olddecl
) = DECL_ATTRIBUTES (newdecl
);
1937 /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl
1938 so that encode_section_info has a chance to look at the new decl
1939 flags and attributes. */
1940 if (DECL_RTL_SET_P (olddecl
)
1941 && (TREE_CODE (olddecl
) == FUNCTION_DECL
1942 || (TREE_CODE (olddecl
) == VAR_DECL
1943 && TREE_STATIC (olddecl
))))
1944 make_decl_rtl (olddecl
, NULL
);
1949 /* Return zero if the declaration NEWDECL is valid
1950 when the declaration OLDDECL (assumed to be for the same name)
1951 has already been seen.
1952 Otherwise return an error message format string with a %s
1953 where the identifier should go. */
1956 redeclaration_error_message (tree newdecl
, tree olddecl
)
1958 if (TREE_CODE (newdecl
) == TYPE_DECL
)
1960 /* Because C++ can put things into name space for free,
1961 constructs like "typedef struct foo { ... } foo"
1962 would look like an erroneous redeclaration. */
1963 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
1966 return "redefinition of `%#D'";
1968 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
1970 /* If this is a pure function, its olddecl will actually be
1971 the original initialization to `0' (which we force to call
1972 abort()). Don't complain about redefinition in this case. */
1973 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
1976 /* If both functions come from different namespaces, this is not
1977 a redeclaration - this is a conflict with a used function. */
1978 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
1979 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
1980 return "`%D' conflicts with used function";
1982 /* We'll complain about linkage mismatches in
1983 warn_extern_redeclared_static. */
1985 /* Defining the same name twice is no good. */
1986 if (DECL_INITIAL (olddecl
) != NULL_TREE
1987 && DECL_INITIAL (newdecl
) != NULL_TREE
)
1989 if (DECL_NAME (olddecl
) == NULL_TREE
)
1990 return "`%#D' not declared in class";
1992 return "redefinition of `%#D'";
1996 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2000 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2002 if (COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
2003 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
)))
2004 return "redefinition of `%#D'";
2008 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) != FUNCTION_DECL
2009 || (DECL_TEMPLATE_RESULT (newdecl
)
2010 == DECL_TEMPLATE_RESULT (olddecl
)))
2013 nt
= DECL_TEMPLATE_RESULT (newdecl
);
2014 if (DECL_TEMPLATE_INFO (nt
))
2015 nt
= DECL_TEMPLATE_RESULT (template_for_substitution (nt
));
2016 ot
= DECL_TEMPLATE_RESULT (olddecl
);
2017 if (DECL_TEMPLATE_INFO (ot
))
2018 ot
= DECL_TEMPLATE_RESULT (template_for_substitution (ot
));
2019 if (DECL_INITIAL (nt
) && DECL_INITIAL (ot
))
2020 return "redefinition of `%#D'";
2024 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
2026 /* Objects declared at top level: */
2027 /* If at least one is a reference, it's ok. */
2028 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
2030 /* Reject two definitions. */
2031 return "redefinition of `%#D'";
2035 /* Objects declared with block scope: */
2036 /* Reject two definitions, and reject a definition
2037 together with an external reference. */
2038 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
2039 return "redeclaration of `%#D'";
2044 /* Create a new label, named ID. */
2047 make_label_decl (tree id
, int local_p
)
2051 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
2053 DECL_CONTEXT (decl
) = current_function_decl
;
2054 DECL_MODE (decl
) = VOIDmode
;
2055 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
2057 /* Say where one reference is to the label, for the sake of the
2058 error if it is not defined. */
2059 DECL_SOURCE_LOCATION (decl
) = input_location
;
2061 /* Record the fact that this identifier is bound to this label. */
2062 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
2067 /* Record this label on the list of used labels so that we can check
2068 at the end of the function to see whether or not the label was
2069 actually defined, and so we can check when the label is defined whether
2070 this use is valid. */
2073 use_label (tree decl
)
2075 if (named_label_uses
== NULL
2076 || named_label_uses
->names_in_scope
!= current_binding_level
->names
2077 || named_label_uses
->label_decl
!= decl
)
2079 struct named_label_use_list
*new_ent
;
2080 new_ent
= ggc_alloc (sizeof (struct named_label_use_list
));
2081 new_ent
->label_decl
= decl
;
2082 new_ent
->names_in_scope
= current_binding_level
->names
;
2083 new_ent
->binding_level
= current_binding_level
;
2084 new_ent
->o_goto_locus
= input_location
;
2085 new_ent
->next
= named_label_uses
;
2086 named_label_uses
= new_ent
;
2090 /* Look for a label named ID in the current function. If one cannot
2091 be found, create one. (We keep track of used, but undefined,
2092 labels, and complain about them at the end of a function.) */
2095 lookup_label (tree id
)
2098 struct named_label_list
*ent
;
2100 timevar_push (TV_NAME_LOOKUP
);
2101 /* You can't use labels at global scope. */
2102 if (current_function_decl
== NULL_TREE
)
2104 error ("label `%E' referenced outside of any function", id
);
2105 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, NULL_TREE
);
2108 /* See if we've already got this label. */
2109 decl
= IDENTIFIER_LABEL_VALUE (id
);
2110 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
2111 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, decl
);
2113 /* Record this label on the list of labels used in this function.
2114 We do this before calling make_label_decl so that we get the
2115 IDENTIFIER_LABEL_VALUE before the new label is declared. */
2116 ent
= ggc_alloc_cleared (sizeof (struct named_label_list
));
2117 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
2118 ent
->next
= named_labels
;
2121 /* We need a new label. */
2122 decl
= make_label_decl (id
, /*local_p=*/0);
2124 /* Now fill in the information we didn't have before. */
2125 ent
->label_decl
= decl
;
2127 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, decl
);
2130 /* Declare a local label named ID. */
2133 declare_local_label (tree id
)
2137 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
2138 this scope we can restore the old value of
2139 IDENTIFIER_TYPE_VALUE. */
2140 current_binding_level
->shadowed_labels
2141 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
2142 current_binding_level
->shadowed_labels
);
2143 /* Look for the label. */
2144 decl
= make_label_decl (id
, /*local_p=*/1);
2145 /* Now fill in the information we didn't have before. */
2146 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
2151 /* Returns nonzero if it is ill-formed to jump past the declaration of
2152 DECL. Returns 2 if it's also a real problem. */
2155 decl_jump_unsafe (tree decl
)
2157 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
2160 if (DECL_INITIAL (decl
) == NULL_TREE
2161 && pod_type_p (TREE_TYPE (decl
)))
2164 /* This is really only important if we're crossing an initialization.
2165 The POD stuff is just pedantry; why should it matter if the class
2166 contains a field of pointer to member type? */
2167 if (DECL_INITIAL (decl
)
2168 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
2173 /* Check that a single previously seen jump to a newly defined label
2174 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
2175 the jump context; NAMES are the names in scope in LEVEL at the jump
2176 context; FILE and LINE are the source position of the jump or 0. */
2179 check_previous_goto_1 (tree decl
,
2180 struct cp_binding_level
* level
,
2181 tree names
, const location_t
*locus
)
2185 struct cp_binding_level
*b
= current_binding_level
;
2186 for (; b
; b
= b
->level_chain
)
2188 tree new_decls
= b
->names
;
2189 tree old_decls
= (b
== level
? names
: NULL_TREE
);
2190 for (; new_decls
!= old_decls
;
2191 new_decls
= TREE_CHAIN (new_decls
))
2193 int problem
= decl_jump_unsafe (new_decls
);
2200 pedwarn ("jump to label `%D'", decl
);
2202 pedwarn ("jump to case label");
2205 pedwarn ("%H from here", locus
);
2210 cp_error_at (" crosses initialization of `%#D'",
2213 cp_pedwarn_at (" enters scope of non-POD `%#D'",
2219 if ((b
->kind
== sk_try
|| b
->kind
== sk_catch
) && ! saw_eh
)
2224 pedwarn ("jump to label `%D'", decl
);
2226 pedwarn ("jump to case label");
2229 pedwarn ("%H from here", locus
);
2232 if (b
->kind
== sk_try
)
2233 error (" enters try block");
2235 error (" enters catch block");
2242 check_previous_goto (struct named_label_use_list
* use
)
2244 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
2245 use
->names_in_scope
, &use
->o_goto_locus
);
2249 check_switch_goto (struct cp_binding_level
* level
)
2251 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
);
2254 /* Check that any previously seen jumps to a newly defined label DECL
2255 are OK. Called by define_label. */
2258 check_previous_gotos (tree decl
)
2260 struct named_label_use_list
**usep
;
2262 if (! TREE_USED (decl
))
2265 for (usep
= &named_label_uses
; *usep
; )
2267 struct named_label_use_list
*use
= *usep
;
2268 if (use
->label_decl
== decl
)
2270 check_previous_goto (use
);
2274 usep
= &(use
->next
);
2278 /* Check that a new jump to a label DECL is OK. Called by
2279 finish_goto_stmt. */
2282 check_goto (tree decl
)
2286 struct named_label_list
*lab
;
2288 /* We can't know where a computed goto is jumping. So we assume
2290 if (! DECL_P (decl
))
2293 /* If the label hasn't been defined yet, defer checking. */
2294 if (! DECL_INITIAL (decl
))
2300 for (lab
= named_labels
; lab
; lab
= lab
->next
)
2301 if (decl
== lab
->label_decl
)
2304 /* If the label is not on named_labels it's a gcc local label, so
2305 it must be in an outer scope, so jumping to it is always OK. */
2309 if ((lab
->in_try_scope
|| lab
->in_catch_scope
|| lab
->bad_decls
)
2312 cp_pedwarn_at ("jump to label `%D'", decl
);
2313 pedwarn (" from here");
2317 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
2319 tree b
= TREE_VALUE (bad
);
2320 int u
= decl_jump_unsafe (b
);
2322 if (u
> 1 && DECL_ARTIFICIAL (b
))
2323 /* Can't skip init of __exception_info. */
2324 error ("%J enters catch block", b
);
2326 cp_error_at (" skips initialization of `%#D'", b
);
2328 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
2331 if (lab
->in_try_scope
)
2332 error (" enters try block");
2333 else if (lab
->in_catch_scope
)
2334 error (" enters catch block");
2337 /* Define a label, specifying the location in the source file.
2338 Return the LABEL_DECL node for the label. */
2341 define_label (location_t location
, tree name
)
2343 tree decl
= lookup_label (name
);
2344 struct named_label_list
*ent
;
2345 struct cp_binding_level
*p
;
2347 timevar_push (TV_NAME_LOOKUP
);
2348 for (ent
= named_labels
; ent
; ent
= ent
->next
)
2349 if (ent
->label_decl
== decl
)
2352 /* After labels, make any new cleanups in the function go into their
2353 own new (temporary) binding contour. */
2354 for (p
= current_binding_level
;
2355 p
->kind
!= sk_function_parms
;
2357 p
->more_cleanups_ok
= 0;
2359 if (name
== get_identifier ("wchar_t"))
2360 pedwarn ("label named wchar_t");
2362 if (DECL_INITIAL (decl
) != NULL_TREE
)
2363 error ("duplicate label `%D'", decl
);
2366 /* Mark label as having been defined. */
2367 DECL_INITIAL (decl
) = error_mark_node
;
2368 /* Say where in the source. */
2369 DECL_SOURCE_LOCATION (decl
) = location
;
2372 ent
->names_in_scope
= current_binding_level
->names
;
2373 ent
->binding_level
= current_binding_level
;
2375 check_previous_gotos (decl
);
2378 timevar_pop (TV_NAME_LOOKUP
);
2384 struct cp_binding_level
*level
;
2385 struct cp_switch
*next
;
2386 /* The SWITCH_STMT being built. */
2388 /* A splay-tree mapping the low element of a case range to the high
2389 element, or NULL_TREE if there is no high element. Used to
2390 determine whether or not a new case label duplicates an old case
2391 label. We need a tree, rather than simply a hash table, because
2392 of the GNU case range extension. */
2396 /* A stack of the currently active switch statements. The innermost
2397 switch statement is on the top of the stack. There is no need to
2398 mark the stack for garbage collection because it is only active
2399 during the processing of the body of a function, and we never
2400 collect at that point. */
2402 static struct cp_switch
*switch_stack
;
2404 /* Called right after a switch-statement condition is parsed.
2405 SWITCH_STMT is the switch statement being parsed. */
2408 push_switch (tree switch_stmt
)
2410 struct cp_switch
*p
= xmalloc (sizeof (struct cp_switch
));
2411 p
->level
= current_binding_level
;
2412 p
->next
= switch_stack
;
2413 p
->switch_stmt
= switch_stmt
;
2414 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
2421 struct cp_switch
*cs
= switch_stack
;
2423 /* Emit warnings as needed. */
2424 c_do_switch_warnings (cs
->cases
, cs
->switch_stmt
);
2426 splay_tree_delete (cs
->cases
);
2427 switch_stack
= switch_stack
->next
;
2431 /* Note that we've seen a definition of a case label, and complain if this
2432 is a bad place for one. */
2435 finish_case_label (tree low_value
, tree high_value
)
2438 struct cp_binding_level
*p
;
2440 if (processing_template_decl
)
2444 /* For templates, just add the case label; we'll do semantic
2445 analysis at instantiation-time. */
2446 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
2447 return add_stmt (build_case_label (low_value
, high_value
, label
));
2450 /* Find the condition on which this switch statement depends. */
2451 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
2452 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
2453 cond
= TREE_VALUE (cond
);
2455 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
2457 check_switch_goto (switch_stack
->level
);
2459 /* After labels, make any new cleanups in the function go into their
2460 own new (temporary) binding contour. */
2461 for (p
= current_binding_level
;
2462 p
->kind
!= sk_function_parms
;
2464 p
->more_cleanups_ok
= 0;
2469 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
2472 typename_hash (const void* k
)
2477 hash
= (htab_hash_pointer (TYPE_CONTEXT (t
))
2478 ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t
))));
2483 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
2486 typename_compare (const void * k1
, const void * k2
)
2495 d1
= TYPE_NAME (t1
);
2496 d2
= TYPE_NAME (t2
);
2498 return (DECL_NAME (d1
) == DECL_NAME (d2
)
2499 && TYPE_CONTEXT (t1
) == TYPE_CONTEXT (t2
)
2500 && ((TREE_TYPE (t1
) != NULL_TREE
)
2501 == (TREE_TYPE (t2
) != NULL_TREE
))
2502 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
2503 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
2506 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
2507 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
2508 is non-NULL, this type is being created by the implicit typename
2509 extension, and BASE_TYPE is a type named `t' in some base class of
2510 `T' which depends on template parameters.
2512 Returns the new TYPENAME_TYPE. */
2514 static GTY ((param_is (union tree_node
))) htab_t typename_htab
;
2517 build_typename_type (tree context
, tree name
, tree fullname
)
2523 if (typename_htab
== NULL
)
2525 typename_htab
= htab_create_ggc (61, &typename_hash
,
2526 &typename_compare
, NULL
);
2529 /* Build the TYPENAME_TYPE. */
2530 t
= make_aggr_type (TYPENAME_TYPE
);
2531 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
2532 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
2534 /* Build the corresponding TYPE_DECL. */
2535 d
= build_decl (TYPE_DECL
, name
, t
);
2536 TYPE_NAME (TREE_TYPE (d
)) = d
;
2537 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
2538 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2539 DECL_ARTIFICIAL (d
) = 1;
2541 /* See if we already have this type. */
2542 e
= htab_find_slot (typename_htab
, t
, INSERT
);
2551 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
2552 unless an error occurs, in which case error_mark_node is returned.
2553 If we locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is
2554 set, we return that, rather than the _TYPE it corresponds to, in
2555 other cases we look through the type decl. If TF_ERROR is set,
2556 complain about errors, otherwise be quiet. */
2559 make_typename_type (tree context
, tree name
, tsubst_flags_t complain
)
2563 if (name
== error_mark_node
2564 || context
== NULL_TREE
2565 || context
== error_mark_node
)
2566 return error_mark_node
;
2570 if (!(TYPE_LANG_SPECIFIC (name
)
2571 && (CLASSTYPE_IS_TEMPLATE (name
)
2572 || CLASSTYPE_USE_TEMPLATE (name
))))
2573 name
= TYPE_IDENTIFIER (name
);
2575 /* Create a TEMPLATE_ID_EXPR for the type. */
2576 name
= build_nt (TEMPLATE_ID_EXPR
,
2577 CLASSTYPE_TI_TEMPLATE (name
),
2578 CLASSTYPE_TI_ARGS (name
));
2580 else if (TREE_CODE (name
) == TYPE_DECL
)
2581 name
= DECL_NAME (name
);
2585 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2587 name
= TREE_OPERAND (name
, 0);
2588 if (TREE_CODE (name
) == TEMPLATE_DECL
)
2589 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
2591 if (TREE_CODE (name
) == TEMPLATE_DECL
)
2593 error ("`%D' used without template parameters", name
);
2594 return error_mark_node
;
2596 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 20030802);
2598 if (TREE_CODE (context
) == NAMESPACE_DECL
)
2600 /* We can get here from typename_sub0 in the explicit_template_type
2601 expansion. Just fail. */
2602 if (complain
& tf_error
)
2603 error ("no class template named `%#T' in `%#T'",
2605 return error_mark_node
;
2608 if (!dependent_type_p (context
)
2609 || currently_open_class (context
))
2611 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
2613 tree tmpl
= NULL_TREE
;
2614 if (IS_AGGR_TYPE (context
))
2615 tmpl
= lookup_field (context
, name
, 0, false);
2616 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
2618 if (complain
& tf_error
)
2619 error ("no class template named `%#T' in `%#T'",
2621 return error_mark_node
;
2624 if (complain
& tf_error
)
2625 perform_or_defer_access_check (TYPE_BINFO (context
), tmpl
);
2627 return lookup_template_class (tmpl
,
2628 TREE_OPERAND (fullname
, 1),
2630 /*entering_scope=*/0,
2631 tf_error
| tf_warning
| tf_user
);
2637 if (!IS_AGGR_TYPE (context
))
2639 if (complain
& tf_error
)
2640 error ("no type named `%#T' in `%#T'", name
, context
);
2641 return error_mark_node
;
2644 t
= lookup_field (context
, name
, 0, true);
2647 if (TREE_CODE (t
) != TYPE_DECL
)
2649 if (complain
& tf_error
)
2650 error ("no type named `%#T' in `%#T'", name
, context
);
2651 return error_mark_node
;
2654 if (complain
& tf_error
)
2655 perform_or_defer_access_check (TYPE_BINFO (context
), t
);
2657 if (DECL_ARTIFICIAL (t
) || !(complain
& tf_keep_type_decl
))
2665 /* If the CONTEXT is not a template type, then either the field is
2666 there now or its never going to be. */
2667 if (!dependent_type_p (context
))
2669 if (complain
& tf_error
)
2670 error ("no type named `%#T' in `%#T'", name
, context
);
2671 return error_mark_node
;
2674 return build_typename_type (context
, name
, fullname
);
2677 /* Resolve `CONTEXT::template NAME'. Returns an appropriate type,
2678 unless an error occurs, in which case error_mark_node is returned.
2679 If we locate a TYPE_DECL, we return that, rather than the _TYPE it
2680 corresponds to. If COMPLAIN zero, don't complain about any errors
2684 make_unbound_class_template (tree context
, tree name
, tsubst_flags_t complain
)
2690 name
= TYPE_IDENTIFIER (name
);
2691 else if (DECL_P (name
))
2692 name
= DECL_NAME (name
);
2693 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
2696 if (!dependent_type_p (context
)
2697 || currently_open_class (context
))
2699 tree tmpl
= NULL_TREE
;
2701 if (IS_AGGR_TYPE (context
))
2702 tmpl
= lookup_field (context
, name
, 0, false);
2704 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
2706 if (complain
& tf_error
)
2707 error ("no class template named `%#T' in `%#T'", name
, context
);
2708 return error_mark_node
;
2711 if (complain
& tf_error
)
2712 perform_or_defer_access_check (TYPE_BINFO (context
), tmpl
);
2717 /* Build the UNBOUND_CLASS_TEMPLATE. */
2718 t
= make_aggr_type (UNBOUND_CLASS_TEMPLATE
);
2719 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
2720 TREE_TYPE (t
) = NULL_TREE
;
2722 /* Build the corresponding TEMPLATE_DECL. */
2723 d
= build_decl (TEMPLATE_DECL
, name
, t
);
2724 TYPE_NAME (TREE_TYPE (d
)) = d
;
2725 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
2726 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2727 DECL_ARTIFICIAL (d
) = 1;
2734 /* Push the declarations of builtin types into the namespace.
2735 RID_INDEX is the index of the builtin type in the array
2736 RID_POINTERS. NAME is the name used when looking up the builtin
2737 type. TYPE is the _TYPE node for the builtin type. */
2740 record_builtin_type (enum rid rid_index
,
2744 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
2745 tree tdecl
= NULL_TREE
;
2747 if ((int) rid_index
< (int) RID_MAX
)
2748 rname
= ridpointers
[(int) rid_index
];
2750 tname
= get_identifier (name
);
2752 /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be
2753 eliminated. Built-in types should not be looked up name; their
2754 names are keywords that the parser can recognize. However, there
2755 is code in c-common.c that uses identifier_global_value to look
2756 up built-in types by name. */
2759 tdecl
= build_decl (TYPE_DECL
, tname
, type
);
2760 DECL_ARTIFICIAL (tdecl
) = 1;
2761 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
2767 tdecl
= build_decl (TYPE_DECL
, rname
, type
);
2768 DECL_ARTIFICIAL (tdecl
) = 1;
2770 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
2773 if (!TYPE_NAME (type
))
2774 TYPE_NAME (type
) = tdecl
;
2777 debug_hooks
->type_decl (tdecl
, 0);
2780 /* Record one of the standard Java types.
2781 * Declare it as having the given NAME.
2782 * If SIZE > 0, it is the size of one of the integral types;
2783 * otherwise it is the negative of the size of one of the other types. */
2786 record_builtin_java_type (const char* name
, int size
)
2790 type
= make_signed_type (size
);
2791 else if (size
> -32)
2792 { /* "__java_char" or ""__java_boolean". */
2793 type
= make_unsigned_type (-size
);
2794 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
2797 { /* "__java_float" or ""__java_double". */
2798 type
= make_node (REAL_TYPE
);
2799 TYPE_PRECISION (type
) = - size
;
2802 record_builtin_type (RID_MAX
, name
, type
);
2803 decl
= TYPE_NAME (type
);
2805 /* Suppress generate debug symbol entries for these types,
2806 since for normal C++ they are just clutter.
2807 However, push_lang_context undoes this if extern "Java" is seen. */
2808 DECL_IGNORED_P (decl
) = 1;
2810 TYPE_FOR_JAVA (type
) = 1;
2814 /* Push a type into the namespace so that the back-ends ignore it. */
2817 record_unknown_type (tree type
, const char* name
)
2819 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
2820 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
2821 DECL_IGNORED_P (decl
) = 1;
2822 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
2823 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
2824 TYPE_ALIGN (type
) = 1;
2825 TYPE_USER_ALIGN (type
) = 0;
2826 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
2829 /* An string for which we should create an IDENTIFIER_NODE at
2832 typedef struct predefined_identifier
2834 /* The name of the identifier. */
2835 const char *const name
;
2836 /* The place where the IDENTIFIER_NODE should be stored. */
2838 /* Nonzero if this is the name of a constructor or destructor. */
2839 const int ctor_or_dtor_p
;
2840 } predefined_identifier
;
2842 /* Create all the predefined identifiers. */
2845 initialize_predefined_identifiers (void)
2847 const predefined_identifier
*pid
;
2849 /* A table of identifiers to create at startup. */
2850 static const predefined_identifier predefined_identifiers
[] = {
2851 { "C++", &lang_name_cplusplus
, 0 },
2852 { "C", &lang_name_c
, 0 },
2853 { "Java", &lang_name_java
, 0 },
2854 { CTOR_NAME
, &ctor_identifier
, 1 },
2855 { "__base_ctor", &base_ctor_identifier
, 1 },
2856 { "__comp_ctor", &complete_ctor_identifier
, 1 },
2857 { DTOR_NAME
, &dtor_identifier
, 1 },
2858 { "__comp_dtor", &complete_dtor_identifier
, 1 },
2859 { "__base_dtor", &base_dtor_identifier
, 1 },
2860 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
2861 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
2862 { "nelts", &nelts_identifier
, 0 },
2863 { THIS_NAME
, &this_identifier
, 0 },
2864 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
2865 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
2866 { "_vptr", &vptr_identifier
, 0 },
2867 { "__vtt_parm", &vtt_parm_identifier
, 0 },
2868 { "::", &global_scope_name
, 0 },
2869 { "std", &std_identifier
, 0 },
2873 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
2875 *pid
->node
= get_identifier (pid
->name
);
2876 if (pid
->ctor_or_dtor_p
)
2877 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
2881 /* Create the predefined scalar types of C,
2882 and some nodes representing standard constants (0, 1, (void *)0).
2883 Initialize the global binding level.
2884 Make definitions for built-in primitive functions. */
2887 cxx_init_decl_processing (void)
2890 tree void_ftype_ptr
;
2892 /* Create all the identifiers we need. */
2893 initialize_predefined_identifiers ();
2895 /* Create the global variables. */
2896 push_to_top_level ();
2898 current_function_decl
= NULL_TREE
;
2899 current_binding_level
= NULL
;
2900 /* Enter the global namespace. */
2901 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
2902 global_namespace
= build_lang_decl (NAMESPACE_DECL
, global_scope_name
,
2904 begin_scope (sk_namespace
, global_namespace
);
2906 current_lang_name
= NULL_TREE
;
2908 /* Adjust various flags based on command-line settings. */
2909 if (!flag_permissive
)
2910 flag_pedantic_errors
= 1;
2911 if (!flag_no_inline
)
2913 flag_inline_trees
= 1;
2916 if (flag_inline_functions
)
2918 flag_inline_trees
= 2;
2919 flag_inline_functions
= 0;
2922 /* Force minimum function alignment if using the least significant
2923 bit of function pointers to store the virtual bit. */
2924 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
2925 && force_align_functions_log
< 1)
2926 force_align_functions_log
= 1;
2929 current_lang_name
= lang_name_c
;
2931 build_common_tree_nodes (flag_signed_char
);
2933 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
2934 TREE_TYPE (error_mark_list
) = error_mark_node
;
2936 /* Create the `std' namespace. */
2937 push_namespace (std_identifier
);
2938 std_node
= current_namespace
;
2941 c_common_nodes_and_builtins ();
2943 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
2944 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
2945 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
2946 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
2947 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
2948 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
2949 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
2950 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
2952 integer_two_node
= build_int_2 (2, 0);
2953 TREE_TYPE (integer_two_node
) = integer_type_node
;
2954 integer_three_node
= build_int_2 (3, 0);
2955 TREE_TYPE (integer_three_node
) = integer_type_node
;
2957 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
2958 truthvalue_type_node
= boolean_type_node
;
2959 truthvalue_false_node
= boolean_false_node
;
2960 truthvalue_true_node
= boolean_true_node
;
2962 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
2965 record_builtin_type (RID_MAX
, NULL
, string_type_node
);
2968 delta_type_node
= ptrdiff_type_node
;
2969 vtable_index_type
= ptrdiff_type_node
;
2971 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
2972 void_ftype
= build_function_type (void_type_node
, void_list_node
);
2973 void_ftype_ptr
= build_function_type (void_type_node
,
2974 tree_cons (NULL_TREE
,
2978 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
2980 /* C++ extensions */
2982 unknown_type_node
= make_node (UNKNOWN_TYPE
);
2983 record_unknown_type (unknown_type_node
, "unknown type");
2985 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
2986 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
2988 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
2990 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
2991 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
2994 /* Make sure we get a unique function type, so we can give
2995 its pointer type a name. (This wins for gdb.) */
2996 tree vfunc_type
= make_node (FUNCTION_TYPE
);
2997 TREE_TYPE (vfunc_type
) = integer_type_node
;
2998 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
2999 layout_type (vfunc_type
);
3001 vtable_entry_type
= build_pointer_type (vfunc_type
);
3003 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
3006 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
3007 layout_type (vtbl_type_node
);
3008 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
3009 record_builtin_type (RID_MAX
, NULL
, vtbl_type_node
);
3010 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
3011 layout_type (vtbl_ptr_type_node
);
3012 record_builtin_type (RID_MAX
, NULL
, vtbl_ptr_type_node
);
3014 push_namespace (get_identifier ("__cxxabiv1"));
3015 abi_node
= current_namespace
;
3018 global_type_node
= make_node (LANG_TYPE
);
3019 record_unknown_type (global_type_node
, "global type");
3022 current_lang_name
= lang_name_cplusplus
;
3026 tree bad_alloc_type_node
;
3027 tree bad_alloc_decl
;
3028 tree newtype
, deltype
;
3029 tree ptr_ftype_sizetype
;
3031 push_namespace (std_identifier
);
3032 bad_alloc_id
= get_identifier ("bad_alloc");
3033 bad_alloc_type_node
= make_aggr_type (RECORD_TYPE
);
3034 TYPE_CONTEXT (bad_alloc_type_node
) = current_namespace
;
3036 = create_implicit_typedef (bad_alloc_id
, bad_alloc_type_node
);
3037 DECL_CONTEXT (bad_alloc_decl
) = current_namespace
;
3038 TYPE_STUB_DECL (bad_alloc_type_node
) = bad_alloc_decl
;
3042 = build_function_type (ptr_type_node
,
3043 tree_cons (NULL_TREE
,
3046 newtype
= build_exception_variant
3047 (ptr_ftype_sizetype
, add_exception_specifier
3048 (NULL_TREE
, bad_alloc_type_node
, -1));
3049 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
3050 push_cp_library_fn (NEW_EXPR
, newtype
);
3051 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
3052 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
3053 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
3057 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
3059 /* Perform other language dependent initializations. */
3060 init_class_processing ();
3061 init_search_processing ();
3062 init_rtti_processing ();
3064 if (flag_exceptions
)
3065 init_exception_processing ();
3067 if (! supports_one_only ())
3070 make_fname_decl
= cp_make_fname_decl
;
3071 start_fname_decls ();
3073 /* Show we use EH for cleanups. */
3074 if (flag_exceptions
)
3075 using_eh_for_cleanups ();
3078 /* Generate an initializer for a function naming variable from
3079 NAME. NAME may be NULL, to indicate a dependent name. TYPE_P is
3080 filled in with the type of the init. */
3083 cp_fname_init (const char* name
, tree
*type_p
)
3085 tree domain
= NULL_TREE
;
3087 tree init
= NULL_TREE
;
3092 length
= strlen (name
);
3093 domain
= build_index_type (size_int (length
));
3094 init
= build_string (length
+ 1, name
);
3097 type
= build_qualified_type (char_type_node
, TYPE_QUAL_CONST
);
3098 type
= build_cplus_array_type (type
, domain
);
3103 TREE_TYPE (init
) = type
;
3105 init
= error_mark_node
;
3110 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
3111 decl, NAME is the initialization string and TYPE_DEP indicates whether
3112 NAME depended on the type of the function. We make use of that to detect
3113 __PRETTY_FUNCTION__ inside a template fn. This is being done
3114 lazily at the point of first use, so we mustn't push the decl now. */
3117 cp_make_fname_decl (tree id
, int type_dep
)
3119 const char *const name
= (type_dep
&& processing_template_decl
3120 ? NULL
: fname_as_string (type_dep
));
3122 tree init
= cp_fname_init (name
, &type
);
3123 tree decl
= build_decl (VAR_DECL
, id
, type
);
3126 free ((char *) name
);
3128 /* As we're using pushdecl_with_scope, we must set the context. */
3129 DECL_CONTEXT (decl
) = current_function_decl
;
3130 DECL_PRETTY_FUNCTION_P (decl
) = type_dep
;
3132 TREE_STATIC (decl
) = 1;
3133 TREE_READONLY (decl
) = 1;
3134 DECL_ARTIFICIAL (decl
) = 1;
3135 DECL_INITIAL (decl
) = init
;
3137 TREE_USED (decl
) = 1;
3139 if (current_function_decl
)
3141 struct cp_binding_level
*b
= current_binding_level
;
3142 while (b
->level_chain
->kind
!= sk_function_parms
)
3144 pushdecl_with_scope (decl
, b
);
3145 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
3148 pushdecl_top_level_and_finish (decl
, init
);
3153 /* Make a definition for a builtin function named NAME in the current
3154 namespace, whose data type is TYPE and whose context is CONTEXT.
3155 TYPE should be a function type with argument types.
3157 CLASS and CODE tell later passes how to compile calls to this function.
3158 See tree.h for possible values.
3160 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
3161 the name to be called if we can't opencode the function.
3162 If ATTRS is nonzero, use that for the function's attribute
3166 builtin_function_1 (const char* name
,
3170 enum built_in_class
class,
3171 const char* libname
,
3174 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
3175 DECL_BUILT_IN_CLASS (decl
) = class;
3176 DECL_FUNCTION_CODE (decl
) = code
;
3177 DECL_CONTEXT (decl
) = context
;
3181 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
3182 we cannot change DECL_ASSEMBLER_NAME until we have installed this
3183 function in the namespace. */
3185 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (libname
));
3186 make_decl_rtl (decl
, NULL
);
3188 /* Warn if a function in the namespace for users
3189 is used without an occasion to consider it declared. */
3190 if (name
[0] != '_' || name
[1] != '_')
3191 DECL_ANTICIPATED (decl
) = 1;
3193 /* Possibly apply some default attributes to this built-in function. */
3195 decl_attributes (&decl
, attrs
, ATTR_FLAG_BUILT_IN
);
3197 decl_attributes (&decl
, NULL_TREE
, 0);
3202 /* Entry point for the benefit of c_common_nodes_and_builtins.
3204 Make a definition for a builtin function named NAME and whose data type
3205 is TYPE. TYPE should be a function type with argument types. This
3206 function places the anticipated declaration in the global namespace
3207 and additionally in the std namespace if appropriate.
3209 CLASS and CODE tell later passes how to compile calls to this function.
3210 See tree.h for possible values.
3212 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
3213 the name to be called if we can't opencode the function.
3215 If ATTRS is nonzero, use that for the function's attribute
3219 builtin_function (const char* name
,
3222 enum built_in_class
class,
3223 const char* libname
,
3226 /* All builtins that don't begin with an '_' should additionally
3227 go in the 'std' namespace. */
3230 push_namespace (std_identifier
);
3231 builtin_function_1 (name
, type
, std_node
, code
, class, libname
, attrs
);
3235 return builtin_function_1 (name
, type
, NULL_TREE
, code
,
3236 class, libname
, attrs
);
3239 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
3240 function. Not called directly. */
3243 build_library_fn_1 (tree name
, enum tree_code operator_code
, tree type
)
3245 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
3246 DECL_EXTERNAL (fn
) = 1;
3247 TREE_PUBLIC (fn
) = 1;
3248 DECL_ARTIFICIAL (fn
) = 1;
3249 TREE_NOTHROW (fn
) = 1;
3250 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
3251 SET_DECL_LANGUAGE (fn
, lang_c
);
3255 /* Returns the _DECL for a library function with C linkage.
3256 We assume that such functions never throw; if this is incorrect,
3257 callers should unset TREE_NOTHROW. */
3260 build_library_fn (tree name
, tree type
)
3262 return build_library_fn_1 (name
, ERROR_MARK
, type
);
3265 /* Returns the _DECL for a library function with C++ linkage. */
3268 build_cp_library_fn (tree name
, enum tree_code operator_code
, tree type
)
3270 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
3271 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
3272 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
3273 SET_DECL_LANGUAGE (fn
, lang_cplusplus
);
3274 set_mangled_name_for_decl (fn
);
3278 /* Like build_library_fn, but takes a C string instead of an
3282 build_library_fn_ptr (const char* name
, tree type
)
3284 return build_library_fn (get_identifier (name
), type
);
3287 /* Like build_cp_library_fn, but takes a C string instead of an
3291 build_cp_library_fn_ptr (const char* name
, tree type
)
3293 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
3296 /* Like build_library_fn, but also pushes the function so that we will
3297 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
3300 push_library_fn (tree name
, tree type
)
3302 tree fn
= build_library_fn (name
, type
);
3303 pushdecl_top_level (fn
);
3307 /* Like build_cp_library_fn, but also pushes the function so that it
3308 will be found by normal lookup. */
3311 push_cp_library_fn (enum tree_code operator_code
, tree type
)
3313 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
3320 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
3324 push_void_library_fn (tree name
, tree parmtypes
)
3326 tree type
= build_function_type (void_type_node
, parmtypes
);
3327 return push_library_fn (name
, type
);
3330 /* Like push_library_fn, but also note that this function throws
3331 and does not return. Used for __throw_foo and the like. */
3334 push_throw_library_fn (tree name
, tree type
)
3336 tree fn
= push_library_fn (name
, type
);
3337 TREE_THIS_VOLATILE (fn
) = 1;
3338 TREE_NOTHROW (fn
) = 0;
3342 /* When we call finish_struct for an anonymous union, we create
3343 default copy constructors and such. But, an anonymous union
3344 shouldn't have such things; this function undoes the damage to the
3345 anonymous union type T.
3347 (The reason that we create the synthesized methods is that we don't
3348 distinguish `union { int i; }' from `typedef union { int i; } U'.
3349 The first is an anonymous union; the second is just an ordinary
3353 fixup_anonymous_aggr (tree t
)
3357 /* Wipe out memory of synthesized methods. */
3358 TYPE_HAS_CONSTRUCTOR (t
) = 0;
3359 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
3360 TYPE_HAS_INIT_REF (t
) = 0;
3361 TYPE_HAS_CONST_INIT_REF (t
) = 0;
3362 TYPE_HAS_ASSIGN_REF (t
) = 0;
3363 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
3365 /* Splice the implicitly generated functions out of the TYPE_METHODS
3367 q
= &TYPE_METHODS (t
);
3370 if (DECL_ARTIFICIAL (*q
))
3371 *q
= TREE_CHAIN (*q
);
3373 q
= &TREE_CHAIN (*q
);
3376 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
3377 if (TYPE_METHODS (t
))
3378 error ("%Jan anonymous union cannot have function members",
3379 TYPE_MAIN_DECL (t
));
3381 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
3382 assignment operators (because they cannot have these methods themselves).
3383 For anonymous unions this is already checked because they are not allowed
3384 in any union, otherwise we have to check it. */
3385 if (TREE_CODE (t
) != UNION_TYPE
)
3389 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
3390 if (TREE_CODE (field
) == FIELD_DECL
)
3392 type
= TREE_TYPE (field
);
3393 if (CLASS_TYPE_P (type
))
3395 if (TYPE_NEEDS_CONSTRUCTING (type
))
3396 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
3398 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3399 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
3401 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
3402 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
3409 /* Make sure that a declaration with no declarator is well-formed, i.e.
3410 just declares a tagged type or anonymous union.
3412 Returns the type declared; or NULL_TREE if none. */
3415 check_tag_decl (tree declspecs
)
3419 int saw_typedef
= 0;
3420 tree ob_modifier
= NULL_TREE
;
3422 /* If a class, struct, or enum type is declared by the DECLSPECS
3423 (i.e, if a class-specifier, enum-specifier, or non-typename
3424 elaborated-type-specifier appears in the DECLSPECS),
3425 DECLARED_TYPE is set to the corresponding type. */
3426 tree declared_type
= NULL_TREE
;
3427 bool error_p
= false;
3429 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
3431 tree value
= TREE_VALUE (link
);
3433 if (TYPE_P (value
) || TREE_CODE (value
) == TYPE_DECL
3434 || (TREE_CODE (value
) == IDENTIFIER_NODE
3435 && is_typename_at_global_scope (value
)))
3439 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
3441 if (! in_system_header
)
3442 pedwarn ("redeclaration of C++ built-in type `%T'", value
);
3447 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
3448 || TREE_CODE (value
) == ENUMERAL_TYPE
))
3450 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
3451 declared_type
= value
;
3454 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
3456 else if (value
== ridpointers
[(int) RID_FRIEND
])
3458 if (current_class_type
== NULL_TREE
3459 || current_scope () != current_class_type
)
3460 ob_modifier
= value
;
3464 else if (value
== ridpointers
[(int) RID_STATIC
]
3465 || value
== ridpointers
[(int) RID_EXTERN
]
3466 || value
== ridpointers
[(int) RID_AUTO
]
3467 || value
== ridpointers
[(int) RID_REGISTER
]
3468 || value
== ridpointers
[(int) RID_INLINE
]
3469 || value
== ridpointers
[(int) RID_VIRTUAL
]
3470 || value
== ridpointers
[(int) RID_CONST
]
3471 || value
== ridpointers
[(int) RID_VOLATILE
]
3472 || value
== ridpointers
[(int) RID_EXPLICIT
]
3473 || value
== ridpointers
[(int) RID_THREAD
])
3474 ob_modifier
= value
;
3475 else if (value
== error_mark_node
)
3480 error ("multiple types in one declaration");
3482 if (declared_type
== NULL_TREE
&& ! saw_friend
&& !error_p
)
3483 pedwarn ("declaration does not declare anything");
3484 /* Check for an anonymous union. */
3485 else if (declared_type
&& IS_AGGR_TYPE_CODE (TREE_CODE (declared_type
))
3486 && TYPE_ANONYMOUS_P (declared_type
))
3488 /* 7/3 In a simple-declaration, the optional init-declarator-list
3489 can be omitted only when declaring a class (clause 9) or
3490 enumeration (7.2), that is, when the decl-specifier-seq contains
3491 either a class-specifier, an elaborated-type-specifier with
3492 a class-key (9.1), or an enum-specifier. In these cases and
3493 whenever a class-specifier or enum-specifier is present in the
3494 decl-specifier-seq, the identifiers in these specifiers are among
3495 the names being declared by the declaration (as class-name,
3496 enum-names, or enumerators, depending on the syntax). In such
3497 cases, and except for the declaration of an unnamed bit-field (9.6),
3498 the decl-specifier-seq shall introduce one or more names into the
3499 program, or shall redeclare a name introduced by a previous
3500 declaration. [Example:
3501 enum { }; // ill-formed
3502 typedef class { }; // ill-formed
3506 error ("missing type-name in typedef-declaration");
3509 /* Anonymous unions are objects, so they can have specifiers. */;
3510 SET_ANON_AGGR_TYPE_P (declared_type
);
3512 if (TREE_CODE (declared_type
) != UNION_TYPE
&& pedantic
3513 && !in_system_header
)
3514 pedwarn ("ISO C++ prohibits anonymous structs");
3517 else if (ob_modifier
)
3519 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
3520 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
3521 error ("`%D' can only be specified for functions", ob_modifier
);
3522 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
3523 error ("`%D' can only be specified inside a class", ob_modifier
);
3524 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
3525 error ("`%D' can only be specified for constructors",
3528 error ("`%D' can only be specified for objects and functions",
3532 return declared_type
;
3535 /* Called when a declaration is seen that contains no names to declare.
3536 If its type is a reference to a structure, union or enum inherited
3537 from a containing scope, shadow that tag name for the current scope
3538 with a forward reference.
3539 If its type defines a new named structure or union
3540 or defines an enum, it is valid but we need not do anything here.
3541 Otherwise, it is an error.
3543 C++: may have to grok the declspecs to learn about static,
3544 complain for anonymous unions.
3546 Returns the TYPE declared -- or NULL_TREE if none. */
3549 shadow_tag (tree declspecs
)
3551 tree t
= check_tag_decl (declspecs
);
3556 maybe_process_partial_specialization (t
);
3558 /* This is where the variables in an anonymous union are
3559 declared. An anonymous union declaration looks like:
3561 because there is no declarator after the union, the parser
3562 sends that declaration here. */
3563 if (ANON_AGGR_TYPE_P (t
))
3565 fixup_anonymous_aggr (t
);
3567 if (TYPE_FIELDS (t
))
3569 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
3571 finish_anon_union (decl
);
3578 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
3581 groktypename (tree typename
)
3585 if (TREE_CODE (typename
) != TREE_LIST
)
3587 split_specs_attrs (TREE_PURPOSE (typename
), &specs
, &attrs
);
3588 type
= grokdeclarator (TREE_VALUE (typename
), specs
,
3589 TYPENAME
, 0, &attrs
);
3591 cplus_decl_attributes (&type
, attrs
, 0);
3595 /* Decode a declarator in an ordinary declaration or data definition.
3596 This is called as soon as the type information and variable name
3597 have been parsed, before parsing the initializer if any.
3598 Here we create the ..._DECL node, fill in its type,
3599 and put it on the list of decls for the current context.
3600 The ..._DECL node is returned as the value.
3602 Exception: for arrays where the length is not specified,
3603 the type is left null, to be filled in by `cp_finish_decl'.
3605 Function definitions do not come here; they go to start_function
3606 instead. However, external and forward declarations of functions
3607 do go through here. Structure field declarations are done by
3608 grokfield and not through here. */
3611 start_decl (tree declarator
,
3615 tree prefix_attributes
)
3621 /* This should only be done once on the top most decl. */
3622 if (have_extern_spec
)
3624 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
3626 have_extern_spec
= false;
3629 /* An object declared as __attribute__((deprecated)) suppresses
3630 warnings of uses of other deprecated items. */
3631 if (lookup_attribute ("deprecated", attributes
))
3632 deprecated_state
= DEPRECATED_SUPPRESS
;
3634 attributes
= chainon (attributes
, prefix_attributes
);
3636 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
3639 deprecated_state
= DEPRECATED_NORMAL
;
3641 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
3644 type
= TREE_TYPE (decl
);
3646 if (type
== error_mark_node
)
3649 context
= DECL_CONTEXT (decl
);
3651 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
3652 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
3654 /* When parsing the initializer, lookup should use the object's
3656 push_decl_namespace (context
);
3659 /* We are only interested in class contexts, later. */
3660 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
3661 context
= NULL_TREE
;
3664 /* Is it valid for this decl to have an initializer at all?
3665 If not, set INITIALIZED to zero, which will indirectly
3666 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
3667 switch (TREE_CODE (decl
))
3670 error ("typedef `%D' is initialized (use __typeof__ instead)", decl
);
3675 error ("function `%#D' is initialized like a variable", decl
);
3685 if (! toplevel_bindings_p ()
3686 && DECL_EXTERNAL (decl
))
3687 warning ("declaration of `%#D' has `extern' and is initialized",
3689 DECL_EXTERNAL (decl
) = 0;
3690 if (toplevel_bindings_p ())
3691 TREE_STATIC (decl
) = 1;
3693 /* Tell `pushdecl' this is an initialized decl
3694 even though we don't yet have the initializer expression.
3695 Also tell `cp_finish_decl' it may store the real initializer. */
3696 DECL_INITIAL (decl
) = error_mark_node
;
3699 /* Set attributes here so if duplicate decl, will have proper attributes. */
3700 cplus_decl_attributes (&decl
, attributes
, 0);
3702 /* If #pragma weak was used, mark the decl weak now. */
3703 if (global_scope_p (current_binding_level
))
3704 maybe_apply_pragma_weak (decl
);
3706 if (TREE_CODE (decl
) == FUNCTION_DECL
3707 && DECL_DECLARED_INLINE_P (decl
)
3708 && DECL_UNINLINABLE (decl
)
3709 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl
)))
3710 warning ("%Jinline function '%D' given attribute noinline", decl
, decl
);
3712 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
3714 push_nested_class (context
);
3716 if (TREE_CODE (decl
) == VAR_DECL
)
3718 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, false);
3719 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
3720 error ("`%#D' is not a static member of `%#T'", decl
, context
);
3723 if (DECL_CONTEXT (field
) != context
)
3725 if (!same_type_p (DECL_CONTEXT (field
), context
))
3726 pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
3727 DECL_CONTEXT (field
), DECL_NAME (decl
),
3728 context
, DECL_NAME (decl
));
3729 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
3731 /* Static data member are tricky; an in-class initialization
3732 still doesn't provide a definition, so the in-class
3733 declaration will have DECL_EXTERNAL set, but will have an
3734 initialization. Thus, duplicate_decls won't warn
3735 about this situation, and so we check here. */
3736 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
3737 error ("duplicate initialization of %D", decl
);
3738 if (duplicate_decls (decl
, field
))
3744 tree field
= check_classfn (context
, decl
,
3745 (processing_template_decl
3746 > template_class_depth (context
))
3747 ? current_template_parms
3749 if (field
&& duplicate_decls (decl
, field
))
3753 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
3754 DECL_IN_AGGR_P (decl
) = 0;
3755 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
3756 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
3758 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
3759 /* [temp.expl.spec] An explicit specialization of a static data
3760 member of a template is a definition if the declaration
3761 includes an initializer; otherwise, it is a declaration.
3763 We check for processing_specialization so this only applies
3764 to the new specialization syntax. */
3765 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
3766 DECL_EXTERNAL (decl
) = 1;
3769 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
3770 pedwarn ("declaration of `%#D' outside of class is not definition",
3774 /* Enter this declaration into the symbol table. */
3775 tem
= maybe_push_decl (decl
);
3777 if (processing_template_decl
)
3778 tem
= push_template_decl (tem
);
3779 if (tem
== error_mark_node
)
3780 return error_mark_node
;
3782 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
3783 /* Tell the back-end to use or not use .common as appropriate. If we say
3784 -fconserve-space, we want this to save .data space, at the expense of
3785 wrong semantics. If we say -fno-conserve-space, we want this to
3786 produce errors about redefs; to do this we force variables into the
3788 DECL_COMMON (tem
) = ((TREE_CODE (tem
) != VAR_DECL
3789 || !DECL_THREAD_LOCAL (tem
))
3790 && (flag_conserve_space
|| ! TREE_PUBLIC (tem
)));
3793 if (! processing_template_decl
)
3800 start_decl_1 (tree decl
)
3802 tree type
= TREE_TYPE (decl
);
3803 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
3805 if (type
== error_mark_node
)
3809 /* Is it valid for this decl to have an initializer at all?
3810 If not, set INITIALIZED to zero, which will indirectly
3811 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
3813 /* Don't allow initializations for incomplete types except for
3814 arrays which might be completed by the initialization. */
3815 if (COMPLETE_TYPE_P (complete_type (type
)))
3816 ; /* A complete type is ok. */
3817 else if (TREE_CODE (type
) != ARRAY_TYPE
)
3819 error ("variable `%#D' has initializer but incomplete type",
3822 type
= TREE_TYPE (decl
) = error_mark_node
;
3824 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
3826 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
3827 error ("elements of array `%#D' have incomplete type", decl
);
3828 /* else we already gave an error in start_decl. */
3834 && TREE_CODE (decl
) != TYPE_DECL
3835 && TREE_CODE (decl
) != TEMPLATE_DECL
3836 && type
!= error_mark_node
3837 && IS_AGGR_TYPE (type
)
3838 && ! DECL_EXTERNAL (decl
))
3840 if ((! processing_template_decl
|| ! uses_template_parms (type
))
3841 && !COMPLETE_TYPE_P (complete_type (type
)))
3843 error ("aggregate `%#D' has incomplete type and cannot be defined",
3845 /* Change the type so that assemble_variable will give
3846 DECL an rtl we can live with: (mem (const_int 0)). */
3847 type
= TREE_TYPE (decl
) = error_mark_node
;
3851 /* If any base type in the hierarchy of TYPE needs a constructor,
3852 then we set initialized to 1. This way any nodes which are
3853 created for the purposes of initializing this aggregate
3854 will live as long as it does. This is necessary for global
3855 aggregates which do not have their initializers processed until
3856 the end of the file. */
3857 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
3862 DECL_INITIAL (decl
) = NULL_TREE
;
3864 /* Create a new scope to hold this declaration if necessary.
3865 Whether or not a new scope is necessary cannot be determined
3866 until after the type has been completed; if the type is a
3867 specialization of a class template it is not until after
3868 instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR
3869 will be set correctly. */
3870 maybe_push_cleanup_level (type
);
3873 /* Handle initialization of references. DECL, TYPE, and INIT have the
3874 same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry,
3875 but will be set to a new CLEANUP_STMT if a temporary is created
3876 that must be destroyed subsequently.
3878 Returns an initializer expression to use to initialize DECL, or
3879 NULL if the initialization can be performed statically.
3881 Quotes on semantics can be found in ARM 8.4.3. */
3884 grok_reference_init (tree decl
, tree type
, tree init
, tree
*cleanup
)
3888 if (init
== NULL_TREE
)
3890 if ((DECL_LANG_SPECIFIC (decl
) == 0
3891 || DECL_IN_AGGR_P (decl
) == 0)
3892 && ! DECL_THIS_EXTERN (decl
))
3893 error ("`%D' declared as reference but not initialized", decl
);
3897 if (TREE_CODE (init
) == CONSTRUCTOR
)
3899 error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
3903 if (TREE_CODE (init
) == TREE_LIST
)
3904 init
= build_x_compound_expr_from_list (init
, "initializer");
3906 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
3907 init
= convert_from_reference (init
);
3909 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
3910 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
3911 /* Note: default conversion is only called in very special cases. */
3912 init
= decay_conversion (init
);
3914 /* Convert INIT to the reference type TYPE. This may involve the
3915 creation of a temporary, whose lifetime must be the same as that
3916 of the reference. If so, a DECL_STMT for the temporary will be
3917 added just after the DECL_STMT for DECL. That's why we don't set
3918 DECL_INITIAL for local references (instead assigning to them
3919 explicitly); we need to allow the temporary to be initialized
3921 tmp
= initialize_reference (type
, init
, decl
, cleanup
);
3923 if (tmp
== error_mark_node
)
3925 else if (tmp
== NULL_TREE
)
3927 error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
3931 if (TREE_STATIC (decl
) && !TREE_CONSTANT (tmp
))
3934 DECL_INITIAL (decl
) = tmp
;
3939 /* When parsing `int a[] = {1, 2};' we don't know the size of the
3940 array until we finish parsing the initializer. If that's the
3941 situation we're in, update DECL accordingly. */
3944 maybe_deduce_size_from_array_init (tree decl
, tree init
)
3946 tree type
= TREE_TYPE (decl
);
3948 if (TREE_CODE (type
) == ARRAY_TYPE
3949 && TYPE_DOMAIN (type
) == NULL_TREE
3950 && TREE_CODE (decl
) != TYPE_DECL
)
3952 /* do_default is really a C-ism to deal with tentative definitions.
3953 But let's leave it here to ease the eventual merge. */
3954 int do_default
= !DECL_EXTERNAL (decl
);
3955 tree initializer
= init
? init
: DECL_INITIAL (decl
);
3956 int failure
= complete_array_type (type
, initializer
, do_default
);
3959 error ("initializer fails to determine size of `%D'", decl
);
3964 error ("array size missing in `%D'", decl
);
3965 /* If a `static' var's size isn't known, make it extern as
3966 well as static, so it does not get allocated. If it's not
3967 `static', then don't mark it extern; finish_incomplete_decl
3968 will give it a default size and it will get allocated. */
3969 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
3970 DECL_EXTERNAL (decl
) = 1;
3973 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
3974 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
3976 error ("zero-size array `%D'", decl
);
3978 layout_decl (decl
, 0);
3982 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
3983 any appropriate error messages regarding the layout. */
3986 layout_var_decl (tree decl
)
3988 tree type
= TREE_TYPE (decl
);
3990 tree ttype
= target_type (type
);
3993 /* If we haven't already layed out this declaration, do so now.
3994 Note that we must not call complete type for an external object
3995 because it's type might involve templates that we are not
3996 supposed to instantiate yet. (And it's perfectly valid to say
3997 `extern X x' for some incomplete type `X'.) */
3998 if (!DECL_EXTERNAL (decl
))
3999 complete_type (type
);
4000 if (!DECL_SIZE (decl
)
4001 && TREE_TYPE (decl
) != error_mark_node
4002 && (COMPLETE_TYPE_P (type
)
4003 || (TREE_CODE (type
) == ARRAY_TYPE
4004 && !TYPE_DOMAIN (type
)
4005 && COMPLETE_TYPE_P (TREE_TYPE (type
)))))
4006 layout_decl (decl
, 0);
4008 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
4010 /* An automatic variable with an incomplete type: that is an error.
4011 Don't talk about array types here, since we took care of that
4012 message in grokdeclarator. */
4013 error ("storage size of `%D' isn't known", decl
);
4014 TREE_TYPE (decl
) = error_mark_node
;
4017 /* Keep this code around in case we later want to control debug info
4018 based on whether a type is "used". (jason 1999-11-11) */
4020 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
4021 /* Let debugger know it should output info for this type. */
4022 note_debug_info_needed (ttype
);
4024 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
4025 note_debug_info_needed (DECL_CONTEXT (decl
));
4028 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
4029 && DECL_SIZE (decl
) != NULL_TREE
4030 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
4032 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
4033 constant_expression_warning (DECL_SIZE (decl
));
4035 error ("storage size of `%D' isn't constant", decl
);
4038 if (TREE_STATIC (decl
)
4039 && !DECL_ARTIFICIAL (decl
)
4040 && current_function_decl
4041 && DECL_CONTEXT (decl
) == current_function_decl
)
4042 push_local_name (decl
);
4045 /* If a local static variable is declared in an inline function, or if
4046 we have a weak definition, we must endeavor to create only one
4047 instance of the variable at link-time. */
4050 maybe_commonize_var (tree decl
)
4052 /* Static data in a function with comdat linkage also has comdat
4054 if (TREE_STATIC (decl
)
4055 /* Don't mess with __FUNCTION__. */
4056 && ! DECL_ARTIFICIAL (decl
)
4057 && DECL_FUNCTION_SCOPE_P (decl
)
4058 /* Unfortunately, import_export_decl has not always been called
4059 before the function is processed, so we cannot simply check
4061 && (DECL_COMDAT (DECL_CONTEXT (decl
))
4062 || ((DECL_DECLARED_INLINE_P (DECL_CONTEXT (decl
))
4063 || DECL_TEMPLATE_INSTANTIATION (DECL_CONTEXT (decl
)))
4064 && TREE_PUBLIC (DECL_CONTEXT (decl
)))))
4068 /* With weak symbols, we simply make the variable COMDAT;
4069 that will cause copies in multiple translations units to
4071 comdat_linkage (decl
);
4075 if (DECL_INITIAL (decl
) == NULL_TREE
4076 || DECL_INITIAL (decl
) == error_mark_node
)
4078 /* Without weak symbols, we can use COMMON to merge
4079 uninitialized variables. */
4080 TREE_PUBLIC (decl
) = 1;
4081 DECL_COMMON (decl
) = 1;
4085 /* While for initialized variables, we must use internal
4086 linkage -- which means that multiple copies will not
4088 TREE_PUBLIC (decl
) = 0;
4089 DECL_COMMON (decl
) = 0;
4090 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
4091 warning ("%J you can work around this by removing the initializer",
4096 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
4097 /* Set it up again; we might have set DECL_INITIAL since the last
4099 comdat_linkage (decl
);
4102 /* Issue an error message if DECL is an uninitialized const variable. */
4105 check_for_uninitialized_const_var (tree decl
)
4107 tree type
= TREE_TYPE (decl
);
4109 /* ``Unless explicitly declared extern, a const object does not have
4110 external linkage and must be initialized. ($8.4; $12.1)'' ARM
4112 if (TREE_CODE (decl
) == VAR_DECL
4113 && TREE_CODE (type
) != REFERENCE_TYPE
4114 && CP_TYPE_CONST_P (type
)
4115 && !TYPE_NEEDS_CONSTRUCTING (type
)
4116 && !DECL_INITIAL (decl
))
4117 error ("uninitialized const `%D'", decl
);
4120 /* FIELD is a FIELD_DECL or NULL. In the former case, the value
4121 returned is the next FIELD_DECL (possibly FIELD itself) that can be
4122 initialized. If there are no more such fields, the return value
4126 next_initializable_field (tree field
)
4129 && (TREE_CODE (field
) != FIELD_DECL
4130 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
))
4131 || DECL_ARTIFICIAL (field
)))
4132 field
= TREE_CHAIN (field
);
4137 /* Undo the brace-elision allowed by [dcl.init.aggr] in a
4138 brace-enclosed aggregate initializer.
4140 *INITP is one of a list of initializers describing a brace-enclosed
4141 initializer for an entity of the indicated aggregate TYPE. It may
4142 not presently match the shape of the TYPE; for example:
4144 struct S { int a; int b; };
4145 struct S a[] = { 1, 2, 3, 4 };
4147 Here *INITP will point to TREE_LIST of four elements, rather than a
4148 list of two elements, each itself a list of two elements. This
4149 routine transforms INIT from the former form into the latter. The
4150 revised initializer is returned. */
4153 reshape_init (tree type
, tree
*initp
)
4157 tree old_init_value
;
4159 bool brace_enclosed_p
;
4162 old_init_value
= (TREE_CODE (*initp
) == TREE_LIST
4163 ? TREE_VALUE (*initp
) : old_init
);
4165 my_friendly_assert (old_init_value
, 20030723);
4167 /* If the initializer is brace-enclosed, pull initializers from the
4168 enclosed elements. Advance past the brace-enclosed initializer
4170 if (TREE_CODE (old_init_value
) == CONSTRUCTOR
4171 && BRACE_ENCLOSED_INITIALIZER_P (old_init_value
))
4173 *initp
= TREE_CHAIN (old_init
);
4174 TREE_CHAIN (old_init
) = NULL_TREE
;
4175 inits
= CONSTRUCTOR_ELTS (old_init_value
);
4177 brace_enclosed_p
= true;
4182 brace_enclosed_p
= false;
4185 /* A non-aggregate type is always initialized with a single
4187 if (!CP_AGGREGATE_TYPE_P (type
))
4189 *initp
= TREE_CHAIN (old_init
);
4190 TREE_CHAIN (old_init
) = NULL_TREE
;
4191 /* It is invalid to initialize a non-aggregate type with a
4192 brace-enclosed initializer. */
4193 if (brace_enclosed_p
)
4195 error ("brace-enclosed initializer used to initialize `%T'",
4197 if (TREE_CODE (old_init
) == TREE_LIST
)
4198 TREE_VALUE (old_init
) = error_mark_node
;
4200 old_init
= error_mark_node
;
4208 All implicit type conversions (clause _conv_) are considered when
4209 initializing the aggregate member with an initializer from an
4210 initializer-list. If the initializer can initialize a member,
4211 the member is initialized. Otherwise, if the member is itself a
4212 non-empty subaggregate, brace elision is assumed and the
4213 initializer is considered for the initialization of the first
4214 member of the subaggregate. */
4215 if (!brace_enclosed_p
4216 && can_convert_arg (type
, TREE_TYPE (old_init_value
), old_init_value
))
4218 *initp
= TREE_CHAIN (old_init
);
4219 TREE_CHAIN (old_init
) = NULL_TREE
;
4223 if (TREE_CODE (old_init_value
) == STRING_CST
4224 && TREE_CODE (type
) == ARRAY_TYPE
4225 && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
))))
4227 /* [dcl.init.string]
4229 A char array (whether plain char, signed char, or unsigned char)
4230 can be initialized by a string-literal (optionally enclosed in
4231 braces); a wchar_t array can be initialized by a wide
4232 string-literal (optionally enclosed in braces). */
4233 new_init
= old_init
;
4234 /* Move past the initializer. */
4235 *initp
= TREE_CHAIN (old_init
);
4236 TREE_CHAIN (old_init
) = NULL_TREE
;
4240 /* Build a CONSTRUCTOR to hold the contents of the aggregate. */
4241 new_init
= build_constructor (NULL_TREE
, NULL_TREE
);
4243 if (CLASS_TYPE_P (type
))
4247 field
= next_initializable_field (TYPE_FIELDS (type
));
4253 An initializer for an aggregate member that is an
4254 empty class shall have the form of an empty
4255 initializer-list {}. */
4256 if (!brace_enclosed_p
)
4258 error ("initializer for `%T' must be brace-enclosed",
4260 return error_mark_node
;
4265 /* Loop through the initializable fields, gathering
4271 /* Handle designated initializers, as an extension. */
4272 if (TREE_PURPOSE (*initp
))
4275 pedwarn ("ISO C++ does not allow designated initializers");
4276 field
= lookup_field_1 (type
, TREE_PURPOSE (*initp
),
4277 /*want_type=*/false);
4278 if (!field
|| TREE_CODE (field
) != FIELD_DECL
)
4279 error ("`%T' has no non-static data member named `%D'",
4280 type
, TREE_PURPOSE (*initp
));
4285 field_init
= reshape_init (TREE_TYPE (field
), initp
);
4286 if (field_init
== error_mark_node
)
4287 return error_mark_node
;
4288 TREE_CHAIN (field_init
) = CONSTRUCTOR_ELTS (new_init
);
4289 CONSTRUCTOR_ELTS (new_init
) = field_init
;
4292 When a union is initialized with a brace-enclosed
4293 initializer, the braces shall only contain an
4294 initializer for the first member of the union. */
4295 if (TREE_CODE (type
) == UNION_TYPE
)
4297 field
= next_initializable_field (TREE_CHAIN (field
));
4301 else if (TREE_CODE (type
) == ARRAY_TYPE
4302 || TREE_CODE (type
) == VECTOR_TYPE
)
4307 /* If the bound of the array is known, take no more initializers
4308 than are allowed. */
4309 max_index
= NULL_TREE
;
4310 if (TREE_CODE (type
) == ARRAY_TYPE
)
4312 if (TYPE_DOMAIN (type
))
4313 max_index
= array_type_nelts (type
);
4317 /* For a vector, the representation type is a struct
4318 containing a single member which is an array of the
4319 appropriate size. */
4320 tree rtype
= TYPE_DEBUG_REPRESENTATION_TYPE (type
);
4321 if (rtype
&& TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype
))))
4322 max_index
= array_type_nelts (TREE_TYPE (TYPE_FIELDS (rtype
)));
4325 /* Loop through the array elements, gathering initializers. */
4326 for (index
= size_zero_node
;
4327 *initp
&& (!max_index
|| !tree_int_cst_lt (max_index
, index
));
4328 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
4332 element_init
= reshape_init (TREE_TYPE (type
), initp
);
4333 if (element_init
== error_mark_node
)
4334 return error_mark_node
;
4335 TREE_CHAIN (element_init
) = CONSTRUCTOR_ELTS (new_init
);
4336 CONSTRUCTOR_ELTS (new_init
) = element_init
;
4337 if (TREE_PURPOSE (element_init
))
4339 tree next_index
= TREE_PURPOSE (element_init
);
4340 if (TREE_CODE (next_index
) == IDENTIFIER_NODE
)
4342 error ("name `%D' used in a GNU-style designated "
4343 "initializer for an array", next_index
);
4344 TREE_PURPOSE (element_init
) = NULL_TREE
;
4354 /* The initializers were placed in reverse order in the
4356 CONSTRUCTOR_ELTS (new_init
) = nreverse (CONSTRUCTOR_ELTS (new_init
));
4358 if (TREE_CODE (old_init
) == TREE_LIST
)
4359 new_init
= build_tree_list (TREE_PURPOSE (old_init
), new_init
);
4362 /* If this was a brace-enclosed initializer and all of the
4363 initializers were not used up, there is a problem. */
4364 if (brace_enclosed_p
&& *initp
)
4365 error ("too many initializers for `%T'", type
);
4370 /* Verify INIT (the initializer for DECL), and record the
4371 initialization in DECL_INITIAL, if appropriate. CLEANUP is as for
4372 grok_reference_init.
4374 If the return value is non-NULL, it is an expression that must be
4375 evaluated dynamically to initialize DECL. */
4378 check_initializer (tree decl
, tree init
, int flags
, tree
*cleanup
)
4380 tree type
= TREE_TYPE (decl
);
4381 tree init_code
= NULL
;
4383 /* If `start_decl' didn't like having an initialization, ignore it now. */
4384 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
4387 /* If an initializer is present, DECL_INITIAL has been
4388 error_mark_node, to indicate that an as-of-yet unevaluated
4389 initialization will occur. From now on, DECL_INITIAL reflects
4390 the static initialization -- if any -- of DECL. */
4391 DECL_INITIAL (decl
) = NULL_TREE
;
4393 /* Things that are going to be initialized need to have complete
4395 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
4397 if (type
== error_mark_node
)
4398 /* We will have already complained. */
4400 else if (init
&& COMPLETE_TYPE_P (type
)
4401 && !TREE_CONSTANT (TYPE_SIZE (type
)))
4403 error ("variable-sized object `%D' may not be initialized", decl
);
4406 else if (TREE_CODE (type
) == ARRAY_TYPE
4407 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
4409 error ("elements of array `%#D' have incomplete type", decl
);
4412 else if (TREE_CODE (type
) != ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
4414 error ("`%D' has incomplete type", decl
);
4415 TREE_TYPE (decl
) = error_mark_node
;
4419 if (TREE_CODE (decl
) == CONST_DECL
)
4421 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
4423 DECL_INITIAL (decl
) = init
;
4425 my_friendly_assert (init
!= NULL_TREE
, 149);
4428 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
4429 init
= grok_reference_init (decl
, type
, init
, cleanup
);
4432 if (TREE_CODE (init
) == CONSTRUCTOR
4433 && BRACE_ENCLOSED_INITIALIZER_P (init
))
4435 /* [dcl.init] paragraph 13,
4436 If T is a scalar type, then a declaration of the form
4441 reshape_init will complain about the extra braces,
4442 and doesn't do anything useful in the case where TYPE is
4443 scalar, so just don't call it. */
4444 if (CP_AGGREGATE_TYPE_P (type
))
4445 init
= reshape_init (type
, &init
);
4447 if ((*targetm
.vector_opaque_p
) (type
))
4449 error ("opaque vector types cannot be initialized");
4450 init
= error_mark_node
;
4454 /* If DECL has an array type without a specific bound, deduce the
4455 array size from the initializer. */
4456 maybe_deduce_size_from_array_init (decl
, init
);
4457 type
= TREE_TYPE (decl
);
4459 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
4461 if (TREE_CODE (type
) == ARRAY_TYPE
)
4462 goto initialize_aggr
;
4463 else if (TREE_CODE (init
) == CONSTRUCTOR
4464 && BRACE_ENCLOSED_INITIALIZER_P (init
))
4466 if (TYPE_NON_AGGREGATE_CLASS (type
))
4468 error ("`%D' must be initialized by constructor, not by `{...}'",
4470 init
= error_mark_node
;
4473 goto dont_use_constructor
;
4477 int saved_stmts_are_full_exprs_p
;
4480 saved_stmts_are_full_exprs_p
= 0;
4481 if (building_stmt_tree ())
4483 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
4484 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
4486 init
= build_aggr_init (decl
, init
, flags
);
4487 if (building_stmt_tree ())
4488 current_stmt_tree ()->stmts_are_full_exprs_p
=
4489 saved_stmts_are_full_exprs_p
;
4495 dont_use_constructor
:
4496 if (TREE_CODE (init
) != TREE_VEC
)
4498 init_code
= store_init_value (decl
, init
);
4503 else if (DECL_EXTERNAL (decl
))
4505 else if (TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
4506 goto initialize_aggr
;
4507 else if (IS_AGGR_TYPE (type
))
4509 tree core_type
= strip_array_types (type
);
4511 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
4512 error ("structure `%D' with uninitialized const members", decl
);
4513 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
4514 error ("structure `%D' with uninitialized reference members",
4517 check_for_uninitialized_const_var (decl
);
4520 check_for_uninitialized_const_var (decl
);
4522 if (init
&& init
!= error_mark_node
)
4523 init_code
= build (INIT_EXPR
, type
, decl
, init
);
4528 /* If DECL is not a local variable, give it RTL. */
4531 make_rtl_for_nonlocal_decl (tree decl
, tree init
, const char* asmspec
)
4533 int toplev
= toplevel_bindings_p ();
4536 /* Handle non-variables up front. */
4537 if (TREE_CODE (decl
) != VAR_DECL
)
4539 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
4543 /* If we see a class member here, it should be a static data
4545 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
4547 my_friendly_assert (TREE_STATIC (decl
), 19990828);
4548 /* An in-class declaration of a static data member should be
4549 external; it is only a declaration, and not a definition. */
4550 if (init
== NULL_TREE
)
4551 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
4554 /* Set the DECL_ASSEMBLER_NAME for the variable. */
4557 change_decl_assembler_name (decl
, get_identifier (asmspec
));
4558 /* The `register' keyword, when used together with an
4559 asm-specification, indicates that the variable should be
4560 placed in a particular register. */
4561 if (DECL_REGISTER (decl
))
4562 DECL_HARD_REGISTER (decl
) = 1;
4565 /* We don't create any RTL for local variables. */
4566 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
4569 /* We defer emission of local statics until the corresponding
4570 DECL_STMT is expanded. */
4571 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
4573 /* We try to defer namespace-scope static constants so that they are
4574 not emitted into the object file unnecessarily. */
4575 if (!DECL_VIRTUAL_P (decl
)
4576 && TREE_READONLY (decl
)
4577 && DECL_INITIAL (decl
) != NULL_TREE
4578 && DECL_INITIAL (decl
) != error_mark_node
4579 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
4581 && !TREE_PUBLIC (decl
))
4583 /* Fool with the linkage of static consts according to #pragma
4585 if (!interface_unknown
&& !TREE_PUBLIC (decl
))
4587 TREE_PUBLIC (decl
) = 1;
4588 DECL_EXTERNAL (decl
) = interface_only
;
4593 /* Likewise for template instantiations. */
4594 else if (DECL_COMDAT (decl
))
4597 /* If we're deferring the variable, we only need to make RTL if
4598 there's an ASMSPEC. Otherwise, we'll lazily create it later when
4599 we need it. (There's no way to lazily create RTL for things that
4600 have assembly specs because the information about the specifier
4601 isn't stored in the tree, yet) */
4602 if (defer_p
&& asmspec
)
4603 make_decl_rtl (decl
, asmspec
);
4604 /* If we're not deferring, go ahead and assemble the variable. */
4606 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
4609 /* Generate code to initialize DECL (a local variable). */
4612 initialize_local_var (tree decl
, tree init
)
4614 tree type
= TREE_TYPE (decl
);
4617 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
4618 || TREE_CODE (decl
) == RESULT_DECL
,
4620 my_friendly_assert (!TREE_STATIC (decl
), 20021010);
4622 if (DECL_SIZE (decl
) == NULL_TREE
)
4624 /* If we used it already as memory, it must stay in memory. */
4625 DECL_INITIAL (decl
) = NULL_TREE
;
4626 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
4629 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
4633 /* Compute and store the initial value. */
4634 already_used
= TREE_USED (decl
) || TREE_USED (type
);
4636 /* Perform the initialization. */
4639 int saved_stmts_are_full_exprs_p
;
4641 my_friendly_assert (building_stmt_tree (), 20000906);
4642 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
4643 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
4644 finish_expr_stmt (init
);
4645 current_stmt_tree ()->stmts_are_full_exprs_p
=
4646 saved_stmts_are_full_exprs_p
;
4649 /* Set this to 0 so we can tell whether an aggregate which was
4650 initialized was ever used. Don't do this if it has a
4651 destructor, so we don't complain about the 'resource
4652 allocation is initialization' idiom. Now set
4653 attribute((unused)) on types so decls of that type will be
4654 marked used. (see TREE_USED, above.) */
4655 if (TYPE_NEEDS_CONSTRUCTING (type
)
4657 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
4658 && DECL_NAME (decl
))
4659 TREE_USED (decl
) = 0;
4660 else if (already_used
)
4661 TREE_USED (decl
) = 1;
4664 /* Generate a cleanup, if necessary. */
4665 cleanup
= cxx_maybe_build_cleanup (decl
);
4666 if (DECL_SIZE (decl
) && cleanup
)
4667 finish_decl_cleanup (decl
, cleanup
);
4670 /* Finish processing of a declaration;
4671 install its line number and initial value.
4672 If the length of an array type is not known before,
4673 it must be determined now, from the initial value, or it is an error.
4675 INIT holds the value of an initializer that should be allowed to escape
4678 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
4679 if the (init) syntax was used. */
4682 cp_finish_decl (tree decl
, tree init
, tree asmspec_tree
, int flags
)
4685 tree ttype
= NULL_TREE
;
4687 const char *asmspec
= NULL
;
4688 int was_readonly
= 0;
4690 if (decl
== error_mark_node
)
4695 error ("assignment (not initialization) in declaration");
4699 my_friendly_assert (TREE_CODE (decl
) != RESULT_DECL
, 20030619);
4701 /* Assume no cleanup is required. */
4702 cleanup
= NULL_TREE
;
4704 /* If a name was specified, get the string. */
4705 if (global_scope_p (current_binding_level
))
4706 asmspec_tree
= maybe_apply_renaming_pragma (decl
, asmspec_tree
);
4708 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
4710 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
4712 error ("cannot initialize `%D' to namespace `%D'",
4717 if (current_class_type
4718 && CP_DECL_CONTEXT (decl
) == current_class_type
4719 && TYPE_BEING_DEFINED (current_class_type
)
4720 && (DECL_INITIAL (decl
) || init
))
4721 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
4723 if (TREE_CODE (decl
) == VAR_DECL
4724 && DECL_CONTEXT (decl
)
4725 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
4726 && DECL_CONTEXT (decl
) != current_namespace
4729 /* Leave the namespace of the object. */
4730 pop_decl_namespace ();
4733 type
= TREE_TYPE (decl
);
4735 if (type
== error_mark_node
)
4738 if (TYPE_HAS_MUTABLE_P (type
))
4739 TREE_READONLY (decl
) = 0;
4741 if (processing_template_decl
)
4743 /* Add this declaration to the statement-tree. */
4744 if (at_function_scope_p ())
4745 add_decl_stmt (decl
);
4747 if (init
&& DECL_INITIAL (decl
))
4748 DECL_INITIAL (decl
) = init
;
4749 if (TREE_CODE (decl
) == VAR_DECL
4750 && !DECL_PRETTY_FUNCTION_P (decl
)
4751 && !dependent_type_p (TREE_TYPE (decl
)))
4752 maybe_deduce_size_from_array_init (decl
, init
);
4756 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
4757 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
4759 /* Take care of TYPE_DECLs up front. */
4760 if (TREE_CODE (decl
) == TYPE_DECL
)
4762 if (type
!= error_mark_node
4763 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
4765 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
4766 warning ("shadowing previous type declaration of `%#D'", decl
);
4767 set_identifier_type_value (DECL_NAME (decl
), decl
);
4770 /* If we have installed this as the canonical typedef for this
4771 type, and that type has not been defined yet, delay emitting
4772 the debug information for it, as we will emit it later. */
4773 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
4774 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
4775 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
4777 rest_of_decl_compilation (decl
, NULL
,
4778 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
4782 if (TREE_CODE (decl
) != FUNCTION_DECL
)
4783 ttype
= target_type (type
);
4786 /* Currently, GNU C++ puts constants in text space, making them
4787 impossible to initialize. In the future, one would hope for
4788 an operating system which understood the difference between
4789 initialization and the running of a program. */
4790 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
))
4793 if (TYPE_NEEDS_CONSTRUCTING (type
)
4794 || TREE_CODE (type
) == REFERENCE_TYPE
)
4795 TREE_READONLY (decl
) = 0;
4798 if (TREE_CODE (decl
) == VAR_DECL
)
4800 /* Only PODs can have thread-local storage. Other types may require
4801 various kinds of non-trivial initialization. */
4802 if (DECL_THREAD_LOCAL (decl
) && !pod_type_p (TREE_TYPE (decl
)))
4803 error ("`%D' cannot be thread-local because it has non-POD type `%T'",
4804 decl
, TREE_TYPE (decl
));
4805 /* Convert the initializer to the type of DECL, if we have not
4806 already initialized DECL. */
4807 if (!DECL_INITIALIZED_P (decl
)
4808 /* If !DECL_EXTERNAL then DECL is being defined. In the
4809 case of a static data member initialized inside the
4810 class-specifier, there can be an initializer even if DECL
4811 is *not* defined. */
4812 && (!DECL_EXTERNAL (decl
) || init
))
4814 init
= check_initializer (decl
, init
, flags
, &cleanup
);
4815 /* Thread-local storage cannot be dynamically initialized. */
4816 if (DECL_THREAD_LOCAL (decl
) && init
)
4818 error ("`%D' is thread-local and so cannot be dynamically "
4819 "initialized", decl
);
4826 The memory occupied by any object of static storage
4827 duration is zero-initialized at program startup before
4828 any other initialization takes place.
4830 We cannot create an appropriate initializer until after
4831 the type of DECL is finalized. If DECL_INITIAL is set,
4832 then the DECL is statically initialized, and any
4833 necessary zero-initialization has already been performed. */
4834 if (TREE_STATIC (decl
) && !DECL_INITIAL (decl
))
4835 DECL_INITIAL (decl
) = build_zero_init (TREE_TYPE (decl
),
4836 /*nelts=*/NULL_TREE
,
4837 /*static_storage_p=*/true);
4838 /* Remember that the initialization for this variable has
4840 DECL_INITIALIZED_P (decl
) = 1;
4842 /* If the variable has an array type, lay out the type, even if
4843 there is no initializer. It is valid to index through the
4844 array, and we must get TYPE_ALIGN set correctly on the array
4846 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4850 /* Add this declaration to the statement-tree. This needs to happen
4851 after the call to check_initializer so that the DECL_STMT for a
4852 reference temp is added before the DECL_STMT for the reference itself. */
4853 if (at_function_scope_p ())
4854 add_decl_stmt (decl
);
4856 if (TREE_CODE (decl
) == VAR_DECL
)
4857 layout_var_decl (decl
);
4859 /* Output the assembler code and/or RTL code for variables and functions,
4860 unless the type is an undefined structure or union.
4861 If not, it will get done when the type is completed. */
4862 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
)
4864 if (TREE_CODE (decl
) == VAR_DECL
)
4865 maybe_commonize_var (decl
);
4867 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
4869 if (TREE_CODE (type
) == FUNCTION_TYPE
4870 || TREE_CODE (type
) == METHOD_TYPE
)
4871 abstract_virtuals_error (decl
,
4872 strip_array_types (TREE_TYPE (type
)));
4873 else if (POINTER_TYPE_P (type
) || TREE_CODE (type
) == ARRAY_TYPE
)
4875 /* If it's either a pointer or an array type, strip through all
4876 of them but the last one. If the last is an array type, issue
4877 an error if the element type is abstract. */
4878 while (POINTER_TYPE_P (TREE_TYPE (type
))
4879 || TREE_CODE (TREE_TYPE (type
)) == ARRAY_TYPE
)
4880 type
= TREE_TYPE (type
);
4881 if (TREE_CODE (type
) == ARRAY_TYPE
)
4882 abstract_virtuals_error (decl
, TREE_TYPE (type
));
4885 abstract_virtuals_error (decl
, type
);
4887 if (TREE_CODE (decl
) == FUNCTION_DECL
4888 || TREE_TYPE (decl
) == error_mark_node
)
4889 /* No initialization required. */
4891 else if (DECL_EXTERNAL (decl
)
4892 && ! (DECL_LANG_SPECIFIC (decl
)
4893 && DECL_NOT_REALLY_EXTERN (decl
)))
4896 DECL_INITIAL (decl
) = init
;
4900 /* A variable definition. */
4901 if (DECL_FUNCTION_SCOPE_P (decl
))
4903 /* This is a local declaration. */
4904 maybe_inject_for_scope_var (decl
);
4905 /* Initialize the local variable. */
4906 if (processing_template_decl
)
4908 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
4909 DECL_INITIAL (decl
) = init
;
4911 else if (!TREE_STATIC (decl
))
4912 initialize_local_var (decl
, init
);
4915 if (TREE_STATIC (decl
))
4916 expand_static_init (decl
, init
);
4920 /* Undo call to `pushclass' that was done in `start_decl'
4921 due to initialization of qualified member variable.
4922 I.e., Foo::x = 10; */
4924 tree context
= CP_DECL_CONTEXT (decl
);
4927 && (TREE_CODE (decl
) == VAR_DECL
4928 /* We also have a pushclass done that we need to undo here
4929 if we're at top level and declare a method. */
4930 || TREE_CODE (decl
) == FUNCTION_DECL
)
4931 /* If size hasn't been set, we're still defining it,
4932 and therefore inside the class body; don't pop
4933 the binding level.. */
4934 && COMPLETE_TYPE_P (context
)
4935 && context
== current_class_type
)
4936 pop_nested_class ();
4940 /* If a CLEANUP_STMT was created to destroy a temporary bound to a
4941 reference, insert it in the statement-tree now. */
4943 push_cleanup (decl
, cleanup
, false);
4948 TREE_READONLY (decl
) = 1;
4950 /* If this was marked 'used', be sure it will be output. */
4951 if (lookup_attribute ("used", DECL_ATTRIBUTES (decl
)))
4952 mark_decl_referenced (decl
);
4955 /* This is here for a midend callback from c-common.c. */
4958 finish_decl (tree decl
, tree init
, tree asmspec_tree
)
4960 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
4963 /* Returns a declaration for a VAR_DECL as if:
4965 extern "C" TYPE NAME;
4967 had been seen. Used to create compiler-generated global
4971 declare_global_var (tree name
, tree type
)
4975 push_to_top_level ();
4976 decl
= build_decl (VAR_DECL
, name
, type
);
4977 TREE_PUBLIC (decl
) = 1;
4978 DECL_EXTERNAL (decl
) = 1;
4979 DECL_ARTIFICIAL (decl
) = 1;
4981 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
4982 pop_from_top_level ();
4987 /* Returns a pointer to the `atexit' function. Note that if
4988 FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new
4989 `__cxa_atexit' function specified in the IA64 C++ ABI. */
4992 get_atexit_node (void)
5003 if (flag_use_cxa_atexit
)
5005 /* The declaration for `__cxa_atexit' is:
5007 int __cxa_atexit (void (*)(void *), void *, void *)
5009 We build up the argument types and then then function type
5012 /* First, build the pointer-to-function type for the first
5014 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5015 fn_type
= build_function_type (void_type_node
, arg_types
);
5016 fn_ptr_type
= build_pointer_type (fn_type
);
5017 /* Then, build the rest of the argument types. */
5018 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5019 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
5020 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
5021 /* And the final __cxa_atexit type. */
5022 fn_type
= build_function_type (integer_type_node
, arg_types
);
5023 fn_ptr_type
= build_pointer_type (fn_type
);
5024 name
= "__cxa_atexit";
5028 /* The declaration for `atexit' is:
5030 int atexit (void (*)());
5032 We build up the argument types and then then function type
5034 fn_type
= build_function_type (void_type_node
, void_list_node
);
5035 fn_ptr_type
= build_pointer_type (fn_type
);
5036 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
5037 /* Build the final atexit type. */
5038 fn_type
= build_function_type (integer_type_node
, arg_types
);
5042 /* Now, build the function declaration. */
5043 push_lang_context (lang_name_c
);
5044 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
5045 mark_used (atexit_fndecl
);
5046 pop_lang_context ();
5047 atexit_node
= decay_conversion (atexit_fndecl
);
5052 /* Returns the __dso_handle VAR_DECL. */
5055 get_dso_handle_node (void)
5057 if (dso_handle_node
)
5058 return dso_handle_node
;
5060 /* Declare the variable. */
5061 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
5064 return dso_handle_node
;
5067 /* Begin a new function with internal linkage whose job will be simply
5068 to destroy some particular variable. */
5070 static GTY(()) int start_cleanup_cnt
;
5073 start_cleanup_fn (void)
5075 int old_interface_only
= interface_only
;
5076 int old_interface_unknown
= interface_unknown
;
5082 push_to_top_level ();
5084 /* No need to mangle this. */
5085 push_lang_context (lang_name_c
);
5088 interface_unknown
= 1;
5090 /* Build the parameter-types. */
5091 parmtypes
= void_list_node
;
5092 /* Functions passed to __cxa_atexit take an additional parameter.
5093 We'll just ignore it. After we implement the new calling
5094 convention for destructors, we can eliminate the use of
5095 additional cleanup functions entirely in the -fnew-abi case. */
5096 if (flag_use_cxa_atexit
)
5097 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
5098 /* Build the function type itself. */
5099 fntype
= build_function_type (void_type_node
, parmtypes
);
5100 /* Build the name of the function. */
5101 sprintf (name
, "__tcf_%d", start_cleanup_cnt
++);
5102 /* Build the function declaration. */
5103 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
5104 /* It's a function with internal linkage, generated by the
5106 TREE_PUBLIC (fndecl
) = 0;
5107 DECL_ARTIFICIAL (fndecl
) = 1;
5108 /* Make the function `inline' so that it is only emitted if it is
5109 actually needed. It is unlikely that it will be inlined, since
5110 it is only called via a function pointer, but we avoid unnecessary
5111 emissions this way. */
5112 DECL_INLINE (fndecl
) = 1;
5113 DECL_DECLARED_INLINE_P (fndecl
) = 1;
5114 DECL_INTERFACE_KNOWN (fndecl
) = 1;
5115 /* Build the parameter. */
5116 if (flag_use_cxa_atexit
)
5120 parmdecl
= cp_build_parm_decl (NULL_TREE
, ptr_type_node
);
5121 DECL_CONTEXT (parmdecl
) = fndecl
;
5122 TREE_USED (parmdecl
) = 1;
5123 DECL_ARGUMENTS (fndecl
) = parmdecl
;
5127 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
5129 interface_unknown
= old_interface_unknown
;
5130 interface_only
= old_interface_only
;
5132 pop_lang_context ();
5134 return current_function_decl
;
5137 /* Finish the cleanup function begun by start_cleanup_fn. */
5140 end_cleanup_fn (void)
5142 expand_or_defer_fn (finish_function (0));
5144 pop_from_top_level ();
5147 /* Generate code to handle the destruction of DECL, an object with
5148 static storage duration. */
5151 register_dtor_fn (tree decl
)
5158 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
5161 /* Call build_cleanup before we enter the anonymous function so that
5162 any access checks will be done relative to the current scope,
5163 rather than the scope of the anonymous function. */
5164 build_cleanup (decl
);
5166 /* Now start the function. */
5167 cleanup
= start_cleanup_fn ();
5169 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
5170 to the original function, rather than the anonymous one. That
5171 will make the back-end think that nested functions are in use,
5172 which causes confusion. */
5174 push_deferring_access_checks (dk_no_check
);
5175 fcall
= build_cleanup (decl
);
5176 pop_deferring_access_checks ();
5178 /* Create the body of the anonymous function. */
5179 compound_stmt
= begin_compound_stmt (BCS_FN_BODY
);
5180 finish_expr_stmt (fcall
);
5181 finish_compound_stmt (compound_stmt
);
5184 /* Call atexit with the cleanup function. */
5185 cxx_mark_addressable (cleanup
);
5186 mark_used (cleanup
);
5187 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
5188 if (flag_use_cxa_atexit
)
5190 args
= tree_cons (NULL_TREE
,
5191 build_unary_op (ADDR_EXPR
, get_dso_handle_node (), 0),
5193 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
5194 args
= tree_cons (NULL_TREE
, cleanup
, args
);
5197 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
5198 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
5201 /* DECL is a VAR_DECL with static storage duration. INIT, if present,
5202 is its initializer. Generate code to handle the construction
5203 and destruction of DECL. */
5206 expand_static_init (tree decl
, tree init
)
5208 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 20021010);
5209 my_friendly_assert (TREE_STATIC (decl
), 20021010);
5211 /* Some variables require no initialization. */
5213 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
5214 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
5217 if (! toplevel_bindings_p ())
5219 /* Emit code to perform this initialization but once. */
5226 /* Emit code to perform this initialization but once. This code
5229 static int guard = 0;
5231 // Do initialization.
5233 // Register variable for destruction at end of program.
5236 Note that the `temp' variable is only set to 1 *after* the
5237 initialization is complete. This ensures that an exception,
5238 thrown during the construction, will cause the variable to
5239 reinitialized when we pass through this code again, as per:
5243 If the initialization exits by throwing an exception, the
5244 initialization is not complete, so it will be tried again
5245 the next time control enters the declaration.
5247 In theory, this process should be thread-safe, too; multiple
5248 threads should not be able to initialize the variable more
5249 than once. We don't yet attempt to ensure thread-safety. */
5251 /* Create the guard variable. */
5252 guard
= get_guard (decl
);
5254 /* Begin the conditional initialization. */
5255 if_stmt
= begin_if_stmt ();
5256 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
5257 then_clause
= begin_compound_stmt (0);
5259 /* Do the initialization itself. */
5260 assignment
= init
? init
: NULL_TREE
;
5262 /* Once the assignment is complete, set TEMP to 1. Since the
5263 construction of the static object is complete at this point,
5264 we want to make sure TEMP is set to 1 even if a temporary
5265 constructed during the initialization throws an exception
5266 when it is destroyed. So, we combine the initialization and
5267 the assignment to TEMP into a single expression, ensuring
5268 that when we call finish_expr_stmt the cleanups will not be
5269 run until after TEMP is set to 1. */
5270 guard_init
= set_guard (guard
);
5272 assignment
= build_compound_expr (assignment
, guard_init
);
5274 assignment
= guard_init
;
5275 finish_expr_stmt (assignment
);
5277 /* Use atexit to register a function for destroying this static
5279 register_dtor_fn (decl
);
5281 finish_compound_stmt (then_clause
);
5282 finish_then_clause (if_stmt
);
5283 finish_if_stmt (if_stmt
);
5286 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
5289 /* Finish the declaration of a catch-parameter. */
5292 start_handler_parms (tree declspecs
, tree declarator
)
5297 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
5299 if (decl
== NULL_TREE
)
5300 error ("invalid catch parameter");
5309 /* Make TYPE a complete type based on INITIAL_VALUE.
5310 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
5311 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
5314 complete_array_type (tree type
, tree initial_value
, int do_default
)
5316 tree maxindex
= NULL_TREE
;
5321 /* An array of character type can be initialized from a
5322 brace-enclosed string constant. */
5323 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
5324 && TREE_CODE (initial_value
) == CONSTRUCTOR
5325 && CONSTRUCTOR_ELTS (initial_value
)
5326 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
5328 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
5329 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
5331 /* Note MAXINDEX is really the maximum index, one less than the
5333 if (TREE_CODE (initial_value
) == STRING_CST
)
5336 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
5337 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
5340 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
5342 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
5344 maxindex
= ssize_int (-1);
5345 for (; elts
; elts
= TREE_CHAIN (elts
))
5347 if (TREE_PURPOSE (elts
))
5348 maxindex
= TREE_PURPOSE (elts
);
5350 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
5352 maxindex
= copy_node (maxindex
);
5356 /* Make an error message unless that happened already. */
5357 if (initial_value
!= error_mark_node
)
5360 initial_value
= NULL_TREE
;
5362 /* Prevent further error messages. */
5363 maxindex
= build_int_2 (0, 0);
5370 maxindex
= build_int_2 (0, 0);
5380 domain
= build_index_type (maxindex
);
5381 TYPE_DOMAIN (type
) = domain
;
5383 if (! TREE_TYPE (maxindex
))
5384 TREE_TYPE (maxindex
) = domain
;
5386 itype
= TREE_TYPE (initial_value
);
5389 if (itype
&& !TYPE_DOMAIN (itype
))
5390 TYPE_DOMAIN (itype
) = domain
;
5391 /* The type of the main variant should never be used for arrays
5392 of different sizes. It should only ever be completed with the
5393 size of the array. */
5394 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
5395 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
5397 elt_type
= TREE_TYPE (type
);
5398 TYPE_NEEDS_CONSTRUCTING (type
)
5399 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (elt_type
));
5400 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
5401 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (elt_type
));
5404 /* Lay out the type now that we can get the real answer. */
5411 /* Return zero if something is declared to be a member of type
5412 CTYPE when in the context of CUR_TYPE. STRING is the error
5413 message to print in that case. Otherwise, quietly return 1. */
5416 member_function_or_else (tree ctype
, tree cur_type
, enum overload_flags flags
)
5418 if (ctype
&& ctype
!= cur_type
)
5420 if (flags
== DTOR_FLAG
)
5421 error ("destructor for alien class `%T' cannot be a member",
5424 error ("constructor for alien class `%T' cannot be a member",
5431 /* Subroutine of `grokdeclarator'. */
5433 /* Generate errors possibly applicable for a given set of specifiers.
5434 This is for ARM $7.1.2. */
5437 bad_specifiers (tree object
,
5446 error ("`%D' declared as a `virtual' %s", object
, type
);
5448 error ("`%D' declared as an `inline' %s", object
, type
);
5450 error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
5453 cp_error_at ("`%D' declared as a friend", object
);
5455 && (TREE_CODE (object
) == TYPE_DECL
5456 || (!TYPE_PTRFN_P (TREE_TYPE (object
))
5457 && !TYPE_REFFN_P (TREE_TYPE (object
))
5458 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))))
5459 cp_error_at ("`%D' declared with an exception specification", object
);
5462 /* CTYPE is class type, or null if non-class.
5463 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
5465 DECLARATOR is the function's name.
5466 PARMS is a chain of PARM_DECLs for the function.
5467 VIRTUALP is truthvalue of whether the function is virtual or not.
5468 FLAGS are to be passed through to `grokclassfn'.
5469 QUALS are qualifiers indicating whether the function is `const'
5471 RAISES is a list of exceptions that this function can raise.
5472 CHECK is 1 if we must find this method in CTYPE, 0 if we should
5473 not look, and -1 if we should not call `grokclassfn' at all.
5475 Returns `NULL_TREE' if something goes wrong, after issuing
5476 applicable error messages. */
5479 grokfndecl (tree ctype
,
5483 tree orig_declarator
,
5485 enum overload_flags flags
,
5497 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
5498 int has_default_arg
= 0;
5502 type
= build_exception_variant (type
, raises
);
5504 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
5505 DECL_ARGUMENTS (decl
) = parms
;
5506 /* Propagate volatile out from type to decl. */
5507 if (TYPE_VOLATILE (type
))
5508 TREE_THIS_VOLATILE (decl
) = 1;
5510 /* If this decl has namespace scope, set that up. */
5512 set_decl_namespace (decl
, in_namespace
, friendp
);
5514 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5516 /* `main' and builtins have implicit 'C' linkage. */
5517 if ((MAIN_NAME_P (declarator
)
5518 || (IDENTIFIER_LENGTH (declarator
) > 10
5519 && IDENTIFIER_POINTER (declarator
)[0] == '_'
5520 && IDENTIFIER_POINTER (declarator
)[1] == '_'
5521 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
5522 && current_lang_name
== lang_name_cplusplus
5523 && ctype
== NULL_TREE
5524 /* NULL_TREE means global namespace. */
5525 && DECL_CONTEXT (decl
) == NULL_TREE
)
5526 SET_DECL_LANGUAGE (decl
, lang_c
);
5528 /* Should probably propagate const out from type to decl I bet (mrs). */
5531 DECL_STATIC_FUNCTION_P (decl
) = 1;
5532 DECL_CONTEXT (decl
) = ctype
;
5536 DECL_CONTEXT (decl
) = ctype
;
5538 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
5540 if (processing_template_decl
)
5541 error ("cannot declare `::main' to be a template");
5543 error ("cannot declare `::main' to be inline");
5545 error ("cannot declare `::main' to be static");
5546 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
5548 error ("`main' must return `int'");
5553 /* Members of anonymous types and local classes have no linkage; make
5554 them internal. If a typedef is made later, this will be changed. */
5555 if (ctype
&& (TYPE_ANONYMOUS_P (ctype
)
5556 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
5561 /* [basic.link]: A name with no linkage (notably, the name of a class
5562 or enumeration declared in a local scope) shall not be used to
5563 declare an entity with linkage.
5565 Only check this for public decls for now. See core 319, 389. */
5566 t
= no_linkage_check (TREE_TYPE (decl
));
5569 if (TYPE_ANONYMOUS_P (t
))
5571 if (DECL_EXTERN_C_P (decl
))
5572 /* Allow this; it's pretty common in C. */;
5575 pedwarn ("non-local function `%#D' uses anonymous type",
5577 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
5579 `%#D' does not refer to the unqualified type, so it is not used for linkage",
5584 pedwarn ("non-local function `%#D' uses local type `%T'",
5589 TREE_PUBLIC (decl
) = publicp
;
5592 DECL_INTERFACE_KNOWN (decl
) = 1;
5593 DECL_NOT_REALLY_EXTERN (decl
) = 1;
5596 /* If the declaration was declared inline, mark it as such. */
5598 DECL_DECLARED_INLINE_P (decl
) = 1;
5599 /* We inline functions that are explicitly declared inline, or, when
5600 the user explicitly asks us to, all functions. */
5601 if (DECL_DECLARED_INLINE_P (decl
)
5602 || (flag_inline_trees
== 2 && !DECL_INLINE (decl
) && funcdef_flag
))
5603 DECL_INLINE (decl
) = 1;
5605 DECL_EXTERNAL (decl
) = 1;
5606 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
5608 error ("%smember function `%D' cannot have `%T' method qualifier",
5609 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
5613 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
5614 grok_op_properties (decl
, friendp
, /*complain=*/true);
5616 if (ctype
&& decl_function_context (decl
))
5617 DECL_NO_STATIC_CHAIN (decl
) = 1;
5619 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
5620 if (TREE_PURPOSE (t
)
5621 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
5623 has_default_arg
= 1;
5628 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
5632 ("defining explicit specialization `%D' in friend declaration",
5636 tree fns
= TREE_OPERAND (orig_declarator
, 0);
5637 tree args
= TREE_OPERAND (orig_declarator
, 1);
5639 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5641 /* Something like `template <class T> friend void f<T>()'. */
5642 error ("invalid use of template-id `%D' in declaration of primary template",
5648 /* A friend declaration of the form friend void f<>(). Record
5649 the information in the TEMPLATE_ID_EXPR. */
5650 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
5652 if (TREE_CODE (fns
) == COMPONENT_REF
)
5654 /* Due to bison parser ickiness, we will have already looked
5655 up an operator_name or PFUNCNAME within the current class
5656 (see template_id in parse.y). If the current class contains
5657 such a name, we'll get a COMPONENT_REF here. Undo that. */
5659 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
5660 == current_class_type
, 20001120);
5661 fns
= TREE_OPERAND (fns
, 1);
5663 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
5664 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
5665 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
5667 if (has_default_arg
)
5669 error ("default arguments are not allowed in declaration of friend template specialization `%D'",
5676 error ("`inline' is not allowed in declaration of friend template specialization `%D'",
5684 /* Make the init_value nonzero so pushdecl knows this is not
5685 tentative. error_mark_node is replaced later with the BLOCK. */
5686 DECL_INITIAL (decl
) = error_mark_node
;
5688 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
5689 TREE_NOTHROW (decl
) = 1;
5691 /* Caller will do the rest of this. */
5695 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name_p (declarator
, ctype
))
5696 DECL_CONSTRUCTOR_P (decl
) = 1;
5698 /* Function gets the ugly name, field gets the nice one. This call
5699 may change the type of the function (because of default
5701 if (ctype
!= NULL_TREE
)
5702 grokclassfn (ctype
, decl
, flags
, quals
);
5704 decl
= check_explicit_specialization (orig_declarator
, decl
,
5706 2 * (funcdef_flag
!= 0) +
5707 4 * (friendp
!= 0));
5708 if (decl
== error_mark_node
)
5711 if (ctype
!= NULL_TREE
5712 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
5717 old_decl
= check_classfn (ctype
, decl
,
5718 (processing_template_decl
5719 > template_class_depth (ctype
))
5720 ? current_template_parms
5723 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
5724 /* Because grokfndecl is always supposed to return a
5725 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
5726 here. We depend on our callers to figure out that its
5727 really a template that's being returned. */
5728 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
5730 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
5731 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
5732 /* Remove the `this' parm added by grokclassfn.
5733 XXX Isn't this done in start_function, too? */
5734 revert_static_member_fn (decl
);
5735 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
5736 error ("definition of implicitly-declared `%D'", old_decl
);
5743 /* Since we've smashed OLD_DECL to its
5744 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
5745 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5746 decl
= DECL_TEMPLATE_RESULT (decl
);
5748 /* Attempt to merge the declarations. This can fail, in
5749 the case of some invalid specialization declarations. */
5750 pop_p
= push_scope (ctype
);
5751 ok
= duplicate_decls (decl
, old_decl
);
5756 error ("no `%#D' member function declared in class `%T'",
5764 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
5767 if (ctype
== NULL_TREE
|| check
)
5771 DECL_VIRTUAL_P (decl
) = 1;
5776 /* Create a VAR_DECL named NAME with the indicated TYPE.
5778 If SCOPE is non-NULL, it is the class type or namespace containing
5779 the variable. If SCOPE is NULL, the variable should is created in
5780 the innermost enclosings scope. */
5783 grokvardecl (tree type
,
5785 RID_BIT_TYPE
* specbits_in
,
5791 RID_BIT_TYPE specbits
;
5793 my_friendly_assert (!name
|| TREE_CODE (name
) == IDENTIFIER_NODE
,
5796 specbits
= *specbits_in
;
5798 /* Compute the scope in which to place the variable. */
5801 /* An explicit "extern" specifier indicates a namespace-scope
5803 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
5804 scope
= current_namespace
;
5805 else if (!at_function_scope_p ())
5807 scope
= current_scope ();
5809 scope
= current_namespace
;
5814 && (/* If the variable is a namespace-scope variable declared in a
5815 template, we need DECL_LANG_SPECIFIC. */
5816 (TREE_CODE (scope
) == NAMESPACE_DECL
&& processing_template_decl
)
5817 /* Similarly for namespace-scope variables with language linkage
5819 || (TREE_CODE (scope
) == NAMESPACE_DECL
5820 && current_lang_name
!= lang_name_cplusplus
)
5821 /* Similarly for static data members. */
5823 decl
= build_lang_decl (VAR_DECL
, name
, type
);
5825 decl
= build_decl (VAR_DECL
, name
, type
);
5827 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
5828 set_decl_namespace (decl
, scope
, 0);
5830 DECL_CONTEXT (decl
) = scope
;
5832 if (name
&& scope
&& current_lang_name
!= lang_name_c
)
5833 /* We can't mangle lazily here because we don't have any
5834 way to recover whether or not a variable was `extern
5838 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
5840 DECL_THIS_EXTERN (decl
) = 1;
5841 DECL_EXTERNAL (decl
) = !initialized
;
5844 /* In class context, static means one per class,
5845 public access, and static storage. */
5846 if (DECL_CLASS_SCOPE_P (decl
))
5848 TREE_PUBLIC (decl
) = 1;
5849 TREE_STATIC (decl
) = 1;
5850 DECL_EXTERNAL (decl
) = 0;
5852 /* At top level, either `static' or no s.c. makes a definition
5853 (perhaps tentative), and absence of `static' makes it public. */
5854 else if (toplevel_bindings_p ())
5856 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
5857 && (DECL_THIS_EXTERN (decl
) || ! constp
));
5858 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
5860 /* Not at top level, only `static' makes a static definition. */
5863 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
5864 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
5867 if (RIDBIT_SETP (RID_THREAD
, specbits
))
5869 if (targetm
.have_tls
)
5870 DECL_THREAD_LOCAL (decl
) = 1;
5872 /* A mere warning is sure to result in improper semantics
5873 at runtime. Don't bother to allow this to compile. */
5874 error ("thread-local storage not supported for this target");
5877 if (TREE_PUBLIC (decl
))
5879 /* [basic.link]: A name with no linkage (notably, the name of a class
5880 or enumeration declared in a local scope) shall not be used to
5881 declare an entity with linkage.
5883 Only check this for public decls for now. */
5884 tree t
= no_linkage_check (TREE_TYPE (decl
));
5887 if (TYPE_ANONYMOUS_P (t
))
5889 if (DECL_EXTERN_C_P (decl
))
5890 /* Allow this; it's pretty common in C. */;
5893 pedwarn ("non-local variable `%#D' uses anonymous type",
5895 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
5897 `%#D' does not refer to the unqualified type, so it is not used for linkage",
5902 pedwarn ("non-local variable `%#D' uses local type `%T'",
5910 /* Create and return a canonical pointer to member function type, for
5911 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
5914 build_ptrmemfunc_type (tree type
)
5918 tree unqualified_variant
= NULL_TREE
;
5920 if (type
== error_mark_node
)
5923 /* If a canonical type already exists for this type, use it. We use
5924 this method instead of type_hash_canon, because it only does a
5925 simple equality check on the list of field members. */
5927 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
5930 /* Make sure that we always have the unqualified pointer-to-member
5932 if (cp_type_quals (type
) != TYPE_UNQUALIFIED
)
5934 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
5936 t
= make_aggr_type (RECORD_TYPE
);
5937 /* Let the front-end know this is a pointer to member function... */
5938 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
5939 /* ... and not really an aggregate. */
5940 SET_IS_AGGR_TYPE (t
, 0);
5942 field
= build_decl (FIELD_DECL
, pfn_identifier
, type
);
5945 field
= build_decl (FIELD_DECL
, delta_identifier
, delta_type_node
);
5946 TREE_CHAIN (field
) = fields
;
5949 finish_builtin_struct (t
, "__ptrmemfunc_type", fields
, ptr_type_node
);
5951 /* Zap out the name so that the back-end will give us the debugging
5952 information for this anonymous RECORD_TYPE. */
5953 TYPE_NAME (t
) = NULL_TREE
;
5955 /* If this is not the unqualified form of this pointer-to-member
5956 type, set the TYPE_MAIN_VARIANT for this type to be the
5957 unqualified type. Since they are actually RECORD_TYPEs that are
5958 not variants of each other, we must do this manually. */
5959 if (cp_type_quals (type
) != TYPE_UNQUALIFIED
)
5961 t
= build_qualified_type (t
, cp_type_quals (type
));
5962 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
5963 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
5964 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
5967 /* Cache this pointer-to-member type so that we can find it again
5969 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
5974 /* Create and return a pointer to data member type. */
5977 build_ptrmem_type (tree class_type
, tree member_type
)
5979 if (TREE_CODE (member_type
) == METHOD_TYPE
)
5983 arg_types
= TYPE_ARG_TYPES (member_type
);
5984 class_type
= (cp_build_qualified_type
5986 cp_type_quals (TREE_TYPE (TREE_VALUE (arg_types
)))));
5988 = build_method_type_directly (class_type
,
5989 TREE_TYPE (member_type
),
5990 TREE_CHAIN (arg_types
));
5991 return build_ptrmemfunc_type (build_pointer_type (member_type
));
5995 my_friendly_assert (TREE_CODE (member_type
) != FUNCTION_TYPE
,
5997 return build_offset_type (class_type
, member_type
);
6001 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
6002 Check to see that the definition is valid. Issue appropriate error
6003 messages. Return 1 if the definition is particularly bad, or 0
6007 check_static_variable_definition (tree decl
, tree type
)
6009 /* Motion 10 at San Diego: If a static const integral data member is
6010 initialized with an integral constant expression, the initializer
6011 may appear either in the declaration (within the class), or in
6012 the definition, but not both. If it appears in the class, the
6013 member is a member constant. The file-scope definition is always
6015 if (!ARITHMETIC_TYPE_P (type
) && TREE_CODE (type
) != ENUMERAL_TYPE
)
6017 error ("invalid in-class initialization of static data member of non-integral type `%T'",
6019 /* If we just return the declaration, crashes will sometimes
6020 occur. We therefore return void_type_node, as if this were a
6021 friend declaration, to cause callers to completely ignore
6022 this declaration. */
6025 else if (!CP_TYPE_CONST_P (type
))
6026 error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
6028 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
6029 pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
6034 /* Given the SIZE (i.e., number of elements) in an array, compute an
6035 appropriate index type for the array. If non-NULL, NAME is the
6036 name of the thing being declared. */
6039 compute_array_index_type (tree name
, tree size
)
6041 tree type
= TREE_TYPE (size
);
6044 /* The array bound must be an integer type. */
6045 if (!dependent_type_p (type
) && !INTEGRAL_TYPE_P (type
))
6048 error ("size of array `%D' has non-integral type `%T'", name
, type
);
6050 error ("size of array has non-integral type `%T'", type
);
6051 size
= integer_one_node
;
6052 type
= TREE_TYPE (size
);
6055 if (abi_version_at_least (2)
6056 /* We should only handle value dependent expressions specially. */
6057 ? value_dependent_expression_p (size
)
6058 /* But for abi-1, we handled all instances in templates. This
6059 effects the manglings produced. */
6060 : processing_template_decl
)
6061 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
6062 size
, integer_one_node
));
6064 /* The size might be the result of a cast. */
6065 STRIP_TYPE_NOPS (size
);
6067 /* It might be a const variable or enumeration constant. */
6068 size
= decl_constant_value (size
);
6070 /* Normally, the array-bound will be a constant. */
6071 if (TREE_CODE (size
) == INTEGER_CST
)
6073 /* Check to see if the array bound overflowed. Make that an
6074 error, no matter how generous we're being. */
6075 int old_flag_pedantic_errors
= flag_pedantic_errors
;
6076 int old_pedantic
= pedantic
;
6077 pedantic
= flag_pedantic_errors
= 1;
6078 constant_expression_warning (size
);
6079 pedantic
= old_pedantic
;
6080 flag_pedantic_errors
= old_flag_pedantic_errors
;
6082 /* An array must have a positive number of elements. */
6083 if (INT_CST_LT (size
, integer_zero_node
))
6086 error ("size of array `%D' is negative", name
);
6088 error ("size of array is negative");
6089 size
= integer_one_node
;
6091 /* As an extension we allow zero-sized arrays. We always allow
6092 them in system headers because glibc uses them. */
6093 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
6096 pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
6098 pedwarn ("ISO C++ forbids zero-size array");
6101 else if (TREE_CONSTANT (size
))
6103 /* `(int) &fn' is not a valid array bound. */
6105 error ("size of array `%D' is not an integral constant-expression",
6108 error ("size of array is not an integral constant-expression");
6113 pedwarn ("ISO C++ forbids variable-size array `%D'", name
);
6115 pedwarn ("ISO C++ forbids variable-size array");
6118 if (processing_template_decl
&& !TREE_CONSTANT (size
))
6119 /* A variable sized array. */
6120 itype
= build_min (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
6123 /* Compute the index of the largest element in the array. It is
6124 one less than the number of elements in the array. */
6126 = fold (cp_build_binary_op (MINUS_EXPR
,
6127 cp_convert (ssizetype
, size
),
6128 cp_convert (ssizetype
, integer_one_node
)));
6129 if (!TREE_CONSTANT (itype
))
6130 /* A variable sized array. */
6131 itype
= variable_size (itype
);
6132 /* Make sure that there was no overflow when creating to a signed
6133 index type. (For example, on a 32-bit machine, an array with
6134 size 2^32 - 1 is too big.) */
6135 else if (TREE_OVERFLOW (itype
))
6137 error ("overflow in array dimension");
6138 TREE_OVERFLOW (itype
) = 0;
6142 /* Create and return the appropriate index type. */
6143 return build_index_type (itype
);
6146 /* Returns the scope (if any) in which the entity declared by
6147 DECLARATOR will be located. If the entity was declared with an
6148 unqualified name, NULL_TREE is returned. */
6151 get_scope_of_declarator (tree declarator
)
6156 switch (TREE_CODE (declarator
))
6162 /* For any of these, the main declarator is the first operand. */
6163 return get_scope_of_declarator (TREE_OPERAND
6167 /* For a pointer-to-member, continue descending. */
6168 if (TREE_CODE (TREE_OPERAND (declarator
, 1))
6170 return get_scope_of_declarator (TREE_OPERAND
6172 /* Otherwise, if the declarator-id is a SCOPE_REF, the scope in
6173 which the declaration occurs is the first operand. */
6174 return TREE_OPERAND (declarator
, 0);
6177 /* Attributes to be applied. The declarator is TREE_VALUE. */
6178 return get_scope_of_declarator (TREE_VALUE (declarator
));
6181 /* Otherwise, we have a declarator-id which is not a qualified
6182 name; the entity will be declared in the current scope. */
6187 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
6188 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
6192 create_array_type_for_decl (tree name
, tree type
, tree size
)
6194 tree itype
= NULL_TREE
;
6195 const char* error_msg
;
6197 /* If things have already gone awry, bail now. */
6198 if (type
== error_mark_node
|| size
== error_mark_node
)
6199 return error_mark_node
;
6201 /* Assume that everything will go OK. */
6204 /* There are some types which cannot be array elements. */
6205 switch (TREE_CODE (type
))
6208 error_msg
= "array of void";
6212 error_msg
= "array of functions";
6215 case REFERENCE_TYPE
:
6216 error_msg
= "array of references";
6220 error_msg
= "array of function members";
6227 /* If something went wrong, issue an error-message and return. */
6231 error ("declaration of `%D' as %s", name
, error_msg
);
6233 error ("creating %s", error_msg
);
6235 return error_mark_node
;
6240 The constant expressions that specify the bounds of the arrays
6241 can be omitted only for the first member of the sequence. */
6242 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
6245 error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
6248 error ("multidimensional array must have bounds for all dimensions except the first");
6250 return error_mark_node
;
6253 /* Figure out the index type for the array. */
6255 itype
= compute_array_index_type (name
, size
);
6257 return build_cplus_array_type (type
, itype
);
6260 /* Check that it's OK to declare a function with the indicated TYPE.
6261 SFK indicates the kind of special function (if any) that this
6262 function is. OPTYPE is the type given in a conversion operator
6263 declaration. Returns the actual return type of the function; that
6264 may be different than TYPE if an error occurs, or for certain
6265 special functions. */
6268 check_special_function_return_type (special_function_kind sfk
,
6274 case sfk_constructor
:
6276 error ("return type specification for constructor invalid");
6278 type
= void_type_node
;
6281 case sfk_destructor
:
6283 error ("return type specification for destructor invalid");
6284 type
= void_type_node
;
6287 case sfk_conversion
:
6288 if (type
&& !same_type_p (type
, optype
))
6289 error ("operator `%T' declared to return `%T'", optype
, type
);
6291 pedwarn ("return type specified for `operator %T'", optype
);
6303 /* Given declspecs and a declarator (abstract or otherwise), determine
6304 the name and type of the object declared and construct a DECL node
6307 DECLSPECS is a chain of tree_list nodes whose value fields
6308 are the storage classes and type specifiers.
6310 DECL_CONTEXT says which syntactic context this declaration is in:
6311 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
6312 FUNCDEF for a function definition. Like NORMAL but a few different
6313 error messages in each case. Return value may be zero meaning
6314 this definition is too screwy to try to parse.
6315 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
6316 handle member functions (which have FIELD context).
6317 Return value may be zero meaning this definition is too screwy to
6319 PARM for a parameter declaration (either within a function prototype
6320 or before a function body). Make a PARM_DECL, or return void_type_node.
6321 CATCHPARM for a parameter declaration before a catch clause.
6322 TYPENAME if for a typename (in a cast or sizeof).
6323 Don't make a DECL node; just return the ..._TYPE node.
6324 FIELD for a struct or union field; make a FIELD_DECL.
6325 BITFIELD for a field with specified width.
6326 INITIALIZED is 1 if the decl has an initializer.
6328 ATTRLIST is a pointer to the list of attributes, which may be NULL
6329 if there are none; *ATTRLIST may be modified if attributes from inside
6330 the declarator should be applied to the declaration.
6332 When this function is called, scoping variables (such as
6333 CURRENT_CLASS_TYPE) should reflect the scope in which the
6334 declaration occurs, not the scope in which the new declaration will
6335 be placed. For example, on:
6339 when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE
6340 should not be `S'. */
6343 grokdeclarator (tree declarator
,
6345 enum decl_context decl_context
,
6349 RID_BIT_TYPE specbits
;
6352 tree type
= NULL_TREE
;
6355 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
6356 int explicit_int
= 0;
6357 int explicit_char
= 0;
6358 int defaulted_int
= 0;
6359 int extern_langp
= 0;
6360 tree dependant_name
= NULL_TREE
;
6362 tree typedef_decl
= NULL_TREE
;
6364 tree typedef_type
= NULL_TREE
;
6365 int funcdef_flag
= 0;
6366 enum tree_code innermost_code
= ERROR_MARK
;
6369 /* See the code below that used this. */
6370 tree decl_attr
= NULL_TREE
;
6373 /* Keep track of what sort of function is being processed
6374 so that we can warn about default return values, or explicit
6375 return values which do not match prescribed defaults. */
6376 special_function_kind sfk
= sfk_none
;
6378 tree dname
= NULL_TREE
;
6379 tree ctype
= current_class_type
;
6380 tree ctor_return_type
= NULL_TREE
;
6381 enum overload_flags flags
= NO_SPECIAL
;
6382 tree quals
= NULL_TREE
;
6383 tree raises
= NULL_TREE
;
6384 int template_count
= 0;
6385 tree in_namespace
= NULL_TREE
;
6386 tree returned_attrs
= NULL_TREE
;
6387 tree scope
= NULL_TREE
;
6388 tree parms
= NULL_TREE
;
6390 RIDBIT_RESET_ALL (specbits
);
6391 if (decl_context
== FUNCDEF
)
6392 funcdef_flag
= 1, decl_context
= NORMAL
;
6393 else if (decl_context
== MEMFUNCDEF
)
6394 funcdef_flag
= -1, decl_context
= FIELD
;
6395 else if (decl_context
== BITFIELD
)
6396 bitfield
= 1, decl_context
= FIELD
;
6398 /* Look inside a declarator for the name being declared
6399 and get it as a string, for an error message. */
6401 tree
*next
= &declarator
;
6405 while (next
&& *next
)
6408 switch (TREE_CODE (decl
))
6411 /* For attributes. */
6412 next
= &TREE_VALUE (decl
);
6417 next
= &TREE_OPERAND (decl
, 0);
6420 case BIT_NOT_EXPR
: /* For C++ destructors! */
6422 tree name
= TREE_OPERAND (decl
, 0);
6423 tree rename
= NULL_TREE
;
6425 my_friendly_assert (flags
== NO_SPECIAL
, 152);
6427 sfk
= sfk_destructor
;
6429 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
6430 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
6431 if (ctype
== NULL_TREE
)
6433 if (current_class_type
== NULL_TREE
)
6435 error ("destructors must be member functions");
6440 tree t
= constructor_name (current_class_type
);
6447 tree t
= constructor_name (ctype
);
6454 error ("destructor `%T' must match class name `%T'",
6456 TREE_OPERAND (decl
, 0) = rename
;
6462 case ADDR_EXPR
: /* C++ reference declaration */
6467 innermost_code
= TREE_CODE (decl
);
6468 next
= &TREE_OPERAND (decl
, 0);
6472 innermost_code
= TREE_CODE (decl
);
6473 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
6474 ctype
= current_class_type
;
6476 && TREE_OPERAND (decl
, 0)
6477 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
6478 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl
, 0)),
6480 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
6481 next
= &TREE_OPERAND (decl
, 0);
6483 if (ctype
!= NULL_TREE
6484 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
6485 && constructor_name_p (decl
, ctype
))
6487 sfk
= sfk_constructor
;
6488 ctor_return_type
= ctype
;
6493 case TEMPLATE_ID_EXPR
:
6495 tree fns
= TREE_OPERAND (decl
, 0);
6498 if (TREE_CODE (dname
) == COMPONENT_REF
)
6499 dname
= TREE_OPERAND (dname
, 1);
6500 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
6502 my_friendly_assert (is_overloaded_fn (dname
),
6504 dname
= DECL_NAME (get_first_fn (dname
));
6509 case IDENTIFIER_NODE
:
6510 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6515 if (C_IS_RESERVED_WORD (dname
))
6517 error ("declarator-id missing; using reserved word `%D'",
6519 name
= IDENTIFIER_POINTER (dname
);
6521 else if (!IDENTIFIER_TYPENAME_P (dname
))
6522 name
= IDENTIFIER_POINTER (dname
);
6525 my_friendly_assert (flags
== NO_SPECIAL
, 154);
6526 flags
= TYPENAME_FLAG
;
6527 ctor_return_type
= TREE_TYPE (dname
);
6528 sfk
= sfk_conversion
;
6529 if (is_typename_at_global_scope (dname
))
6530 name
= IDENTIFIER_POINTER (dname
);
6532 name
= "<invalid operator>";
6539 /* Perform error checking, and decide on a ctype. */
6540 tree cname
= TREE_OPERAND (decl
, 0);
6541 if (cname
== NULL_TREE
)
6543 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
6546 in_namespace
= TREE_OPERAND (decl
, 0);
6548 else if (! is_aggr_type (cname
, 1))
6550 /* Must test TREE_OPERAND (decl, 1), in case user gives
6551 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
6552 else if (TREE_OPERAND (decl
, 1)
6553 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
6555 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
6556 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6558 /* This might be declaring a member of a template
6559 parm to be a friend. */
6561 dependant_name
= TREE_OPERAND (decl
, 1);
6563 else if (ctype
== NULL_TREE
)
6565 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
6569 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
6571 error ("type `%T' is not derived from type `%T'",
6579 /* It is valid to write:
6581 class C { void f(); };
6585 The standard is not clear about whether `typedef const C D' is
6586 legal; as of 2002-09-15 the committee is considering
6587 that question. EDG 3.0 allows that syntax.
6588 Therefore, we do as well. */
6590 ctype
= TYPE_MAIN_VARIANT (ctype
);
6591 /* Update the declarator so that when we process it
6592 again the correct type is present. */
6593 TREE_OPERAND (decl
, 0) = ctype
;
6595 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
6596 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl
, 1)),
6598 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
6599 next
= &TREE_OPERAND (decl
, 1);
6605 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6606 name
= TREE_OPERAND (name
, 0);
6608 if (!constructor_name_p (decl
, ctype
))
6610 else if (decl
== name
)
6612 sfk
= sfk_constructor
;
6613 ctor_return_type
= ctype
;
6617 sfk
= sfk_destructor
;
6618 ctor_return_type
= ctype
;
6620 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
6621 next
= &TREE_OPERAND (decl
, 0);
6632 /* Parse error puts this typespec where
6633 a declarator should go. */
6634 error ("`%T' specified as declarator-id", DECL_NAME (decl
));
6635 if (TREE_TYPE (decl
) == current_class_type
)
6636 error (" perhaps you want `%T' for a constructor",
6637 current_class_name
);
6638 dname
= DECL_NAME (decl
);
6639 name
= IDENTIFIER_POINTER (dname
);
6641 /* Avoid giving two errors for this. */
6642 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
6644 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
6650 next
= &BASELINK_FUNCTIONS (decl
);
6654 /* Sometimes, we see a template-name used as part of a
6655 decl-specifier like in
6656 std::allocator alloc;
6657 Handle that gracefully. */
6658 error ("invalid use of template-name '%E' in a declarator", decl
);
6659 return error_mark_node
;
6663 my_friendly_assert (0, 20020917);
6668 /* A function definition's declarator must have the form of
6669 a function declarator. */
6671 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
6674 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
6675 && innermost_code
!= CALL_EXPR
6676 && ! (ctype
&& declspecs
== NULL_TREE
))
6678 error ("declaration of `%D' as non-function", dname
);
6679 return void_type_node
;
6682 /* Anything declared one level down from the top level
6683 must be one of the parameters of a function
6684 (because the body is at least two levels down). */
6686 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
6687 by not allowing C++ class definitions to specify their parameters
6688 with xdecls (must be spec.d in the parmlist).
6690 Since we now wait to push a class scope until we are sure that
6691 we are in a legitimate method context, we must set oldcname
6692 explicitly (since current_class_name is not yet alive).
6694 We also want to avoid calling this a PARM if it is in a namespace. */
6696 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
6698 struct cp_binding_level
*b
= current_binding_level
;
6699 current_binding_level
= b
->level_chain
;
6700 if (current_binding_level
!= 0 && toplevel_bindings_p ())
6701 decl_context
= PARM
;
6702 current_binding_level
= b
;
6706 name
= decl_context
== PARM
? "parameter" : "type name";
6708 /* Look through the decl specs and record which ones appear.
6709 Some typespecs are defined as built-in typenames.
6710 Others, the ones that are modifiers of other types,
6711 are represented by bits in SPECBITS: set the bits for
6712 the modifiers that appear. Storage class keywords are also in SPECBITS.
6714 If there is a typedef name or a type, store the type in TYPE.
6715 This includes builtin typedefs such as `int'.
6717 Set EXPLICIT_INT if the type is `int' or `char' and did not
6718 come from a user typedef.
6720 Set LONGLONG if `long' is mentioned twice.
6722 For C++, constructors and destructors have their own fast treatment. */
6724 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
6729 /* Certain parse errors slip through. For example,
6730 `int class;' is not caught by the parser. Try
6731 weakly to recover here. */
6732 if (TREE_CODE (spec
) != TREE_LIST
)
6735 id
= TREE_VALUE (spec
);
6737 /* If the entire declaration is itself tagged as deprecated then
6738 suppress reports of deprecated items. */
6739 if (!adding_implicit_members
&& id
&& TREE_DEPRECATED (id
))
6741 if (deprecated_state
!= DEPRECATED_SUPPRESS
)
6742 warn_deprecated_use (id
);
6745 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
6747 if (id
== ridpointers
[(int) RID_INT
]
6748 || id
== ridpointers
[(int) RID_CHAR
]
6749 || id
== ridpointers
[(int) RID_BOOL
]
6750 || id
== ridpointers
[(int) RID_WCHAR
])
6754 if (id
== ridpointers
[(int) RID_BOOL
])
6755 error ("`bool' is now a keyword");
6757 error ("extraneous `%T' ignored", id
);
6761 if (id
== ridpointers
[(int) RID_INT
])
6763 else if (id
== ridpointers
[(int) RID_CHAR
])
6765 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
6769 /* C++ aggregate types. */
6770 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
6773 error ("multiple declarations `%T' and `%T'", type
, id
);
6775 type
= IDENTIFIER_TYPE_VALUE (id
);
6779 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
6781 if (ridpointers
[i
] == id
)
6783 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
6785 if (pedantic
&& ! in_system_header
&& warn_long_long
)
6786 pedwarn ("ISO C++ does not support `long long'");
6788 error ("`long long long' is too long for GCC");
6792 else if (RIDBIT_SETP (i
, specbits
))
6793 pedwarn ("duplicate `%E'", id
);
6795 /* Diagnose "__thread extern" or "__thread static". */
6796 if (RIDBIT_SETP (RID_THREAD
, specbits
))
6798 if (i
== (int)RID_EXTERN
)
6799 error ("`__thread' before `extern'");
6800 else if (i
== (int)RID_STATIC
)
6801 error ("`__thread' before `static'");
6804 if (i
== (int)RID_EXTERN
6805 && TREE_PURPOSE (spec
) == error_mark_node
)
6806 /* This extern was part of a language linkage. */
6809 RIDBIT_SET (i
, specbits
);
6814 else if (TREE_CODE (id
) == TYPE_DECL
)
6817 error ("multiple declarations `%T' and `%T'", type
,
6821 type
= TREE_TYPE (id
);
6822 TREE_VALUE (spec
) = type
;
6828 error ("two or more data types in declaration of `%s'", name
);
6829 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
6831 tree t
= lookup_name (id
, 1);
6832 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
6833 error ("`%E' fails to be a typedef or built in type", id
);
6836 type
= TREE_TYPE (t
);
6840 else if (id
!= error_mark_node
)
6841 /* Can't change CLASS nodes into RECORD nodes here! */
6848 /* See the code below that used this. */
6850 decl_attr
= DECL_ATTRIBUTES (typedef_decl
);
6852 typedef_type
= type
;
6854 /* No type at all: default to `int', and set DEFAULTED_INT
6855 because it was not a user-defined typedef. */
6857 if (type
== NULL_TREE
6858 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
6859 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
6860 || RIDBIT_SETP (RID_LONG
, specbits
)
6861 || RIDBIT_SETP (RID_SHORT
, specbits
)))
6863 /* These imply 'int'. */
6864 type
= integer_type_node
;
6868 if (sfk
!= sfk_none
)
6869 type
= check_special_function_return_type (sfk
, type
,
6871 else if (type
== NULL_TREE
)
6877 /* We handle `main' specially here, because 'main () { }' is so
6878 common. With no options, it is allowed. With -Wreturn-type,
6879 it is a warning. It is only an error with -pedantic-errors. */
6880 is_main
= (funcdef_flag
6881 && dname
&& MAIN_NAME_P (dname
)
6882 && ctype
== NULL_TREE
6883 && in_namespace
== NULL_TREE
6884 && current_namespace
== global_namespace
);
6886 if (in_system_header
|| flag_ms_extensions
)
6887 /* Allow it, sigh. */;
6888 else if (pedantic
|| ! is_main
)
6889 pedwarn ("ISO C++ forbids declaration of `%s' with no type",
6891 else if (warn_return_type
)
6892 warning ("ISO C++ forbids declaration of `%s' with no type",
6895 type
= integer_type_node
;
6900 /* Now process the modifiers that were specified
6901 and check for invalid combinations. */
6903 /* Long double is a special combination. */
6905 if (RIDBIT_SETP (RID_LONG
, specbits
)
6906 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
6908 RIDBIT_RESET (RID_LONG
, specbits
);
6909 type
= build_qualified_type (long_double_type_node
,
6910 cp_type_quals (type
));
6913 /* Check all other uses of type modifiers. */
6915 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
6916 || RIDBIT_SETP (RID_SIGNED
, specbits
)
6917 || RIDBIT_SETP (RID_LONG
, specbits
)
6918 || RIDBIT_SETP (RID_SHORT
, specbits
))
6922 if (TREE_CODE (type
) == REAL_TYPE
)
6923 error ("short, signed or unsigned invalid for `%s'", name
);
6924 else if (TREE_CODE (type
) != INTEGER_TYPE
)
6925 error ("long, short, signed or unsigned invalid for `%s'", name
);
6926 else if (RIDBIT_SETP (RID_LONG
, specbits
)
6927 && RIDBIT_SETP (RID_SHORT
, specbits
))
6928 error ("long and short specified together for `%s'", name
);
6929 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
6930 || RIDBIT_SETP (RID_SHORT
, specbits
))
6932 error ("long or short specified with char for `%s'", name
);
6933 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
6934 || RIDBIT_SETP (RID_SHORT
, specbits
))
6935 && TREE_CODE (type
) == REAL_TYPE
)
6936 error ("long or short specified with floating type for `%s'", name
);
6937 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
6938 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
6939 error ("signed and unsigned given together for `%s'", name
);
6943 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
6945 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
6947 if (flag_pedantic_errors
)
6952 /* Discard the type modifiers if they are invalid. */
6955 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
6956 RIDBIT_RESET (RID_SIGNED
, specbits
);
6957 RIDBIT_RESET (RID_LONG
, specbits
);
6958 RIDBIT_RESET (RID_SHORT
, specbits
);
6963 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
6964 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
6966 error ("complex invalid for `%s'", name
);
6967 RIDBIT_RESET (RID_COMPLEX
, specbits
);
6970 /* Decide whether an integer type is signed or not.
6971 Optionally treat bitfields as signed by default. */
6972 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
6975 It is implementation-defined whether a plain (neither
6976 explicitly signed or unsigned) char, short, int, or long
6977 bit-field is signed or unsigned.
6979 Naturally, we extend this to long long as well. Note that
6980 this does not include wchar_t. */
6981 || (bitfield
&& !flag_signed_bitfields
6982 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
6983 /* A typedef for plain `int' without `signed' can be
6984 controlled just like plain `int', but a typedef for
6985 `signed int' cannot be so controlled. */
6987 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
6988 && (TREE_CODE (type
) == INTEGER_TYPE
6989 || TREE_CODE (type
) == CHAR_TYPE
)
6990 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
6993 type
= long_long_unsigned_type_node
;
6994 else if (RIDBIT_SETP (RID_LONG
, specbits
))
6995 type
= long_unsigned_type_node
;
6996 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
6997 type
= short_unsigned_type_node
;
6998 else if (type
== char_type_node
)
6999 type
= unsigned_char_type_node
;
7000 else if (typedef_decl
)
7001 type
= c_common_unsigned_type (type
);
7003 type
= unsigned_type_node
;
7005 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
7006 && type
== char_type_node
)
7007 type
= signed_char_type_node
;
7009 type
= long_long_integer_type_node
;
7010 else if (RIDBIT_SETP (RID_LONG
, specbits
))
7011 type
= long_integer_type_node
;
7012 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
7013 type
= short_integer_type_node
;
7015 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
7017 /* If we just have "complex", it is equivalent to
7018 "complex double", but if any modifiers at all are specified it is
7019 the complex form of TYPE. E.g, "complex short" is
7020 "complex short int". */
7022 if (defaulted_int
&& ! longlong
7023 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
7024 || RIDBIT_SETP (RID_SHORT
, specbits
)
7025 || RIDBIT_SETP (RID_SIGNED
, specbits
)
7026 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
7027 type
= complex_double_type_node
;
7028 else if (type
== integer_type_node
)
7029 type
= complex_integer_type_node
;
7030 else if (type
== float_type_node
)
7031 type
= complex_float_type_node
;
7032 else if (type
== double_type_node
)
7033 type
= complex_double_type_node
;
7034 else if (type
== long_double_type_node
)
7035 type
= complex_long_double_type_node
;
7037 type
= build_complex_type (type
);
7040 type_quals
= TYPE_UNQUALIFIED
;
7041 if (RIDBIT_SETP (RID_CONST
, specbits
))
7042 type_quals
|= TYPE_QUAL_CONST
;
7043 if (RIDBIT_SETP (RID_VOLATILE
, specbits
))
7044 type_quals
|= TYPE_QUAL_VOLATILE
;
7045 if (RIDBIT_SETP (RID_RESTRICT
, specbits
))
7046 type_quals
|= TYPE_QUAL_RESTRICT
;
7047 if (sfk
== sfk_conversion
&& type_quals
!= TYPE_UNQUALIFIED
)
7048 error ("qualifiers are not allowed on declaration of `operator %T'",
7051 type_quals
|= cp_type_quals (type
);
7052 type
= cp_build_qualified_type_real
7053 (type
, type_quals
, ((typedef_decl
&& !DECL_ARTIFICIAL (typedef_decl
)
7054 ? tf_ignore_bad_quals
: 0) | tf_error
| tf_warning
));
7055 /* We might have ignored or rejected some of the qualifiers. */
7056 type_quals
= cp_type_quals (type
);
7059 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
7060 virtualp
= !! RIDBIT_SETP (RID_VIRTUAL
, specbits
);
7061 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
7062 explicitp
= !! RIDBIT_SETP (RID_EXPLICIT
, specbits
);
7063 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
7065 if (RIDBIT_SETP (RID_STATIC
, specbits
))
7066 staticp
= 1 + (decl_context
== FIELD
);
7068 if (virtualp
&& staticp
== 2)
7070 error ("member `%D' cannot be declared both virtual and static",
7074 friendp
= !! RIDBIT_SETP (RID_FRIEND
, specbits
);
7075 RIDBIT_RESET (RID_FRIEND
, specbits
);
7077 if (dependant_name
&& !friendp
)
7079 error ("`%T::%D' is not a valid declarator", ctype
, dependant_name
);
7080 return void_type_node
;
7083 /* Warn if two storage classes are given. Default to `auto'. */
7085 if (RIDBIT_ANY_SET (specbits
))
7087 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
7088 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && !extern_langp
) nclasses
++;
7089 if (RIDBIT_SETP (RID_THREAD
, specbits
)) nclasses
++;
7090 if (decl_context
== PARM
&& nclasses
> 0)
7091 error ("storage class specifiers invalid in parameter declarations");
7092 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
7094 if (decl_context
== PARM
)
7095 error ("typedef declaration invalid in parameter declaration");
7098 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
7099 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
7100 if (!nclasses
&& !friendp
&& extern_langp
)
7104 /* Give error if `virtual' is used outside of class declaration. */
7106 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
7108 error ("virtual outside class declaration");
7112 /* Static anonymous unions are dealt with here. */
7113 if (staticp
&& decl_context
== TYPENAME
7114 && TREE_CODE (declspecs
) == TREE_LIST
7115 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
7116 decl_context
= FIELD
;
7118 /* Warn about storage classes that are invalid for certain
7119 kinds of declarations (parameters, typenames, etc.). */
7121 /* "static __thread" and "extern __thread" are allowed. */
7123 && RIDBIT_SETP (RID_THREAD
, specbits
)
7124 && (RIDBIT_SETP (RID_EXTERN
, specbits
)
7125 || RIDBIT_SETP (RID_STATIC
, specbits
)))
7129 error ("multiple storage classes in declaration of `%s'", name
);
7130 else if (decl_context
!= NORMAL
&& nclasses
> 0)
7132 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
7133 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
7134 || RIDBIT_SETP (RID_AUTO
, specbits
)))
7136 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
7138 else if (decl_context
== FIELD
7139 /* C++ allows static class elements. */
7140 && RIDBIT_SETP (RID_STATIC
, specbits
))
7141 /* C++ also allows inlines and signed and unsigned elements,
7142 but in those cases we don't come in here. */
7146 if (decl_context
== FIELD
)
7148 tree tmp
= NULL_TREE
;
7153 /* Avoid trying to get an operand off an identifier node. */
7154 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
7157 tmp
= TREE_OPERAND (declarator
, 0);
7158 op
= IDENTIFIER_OPNAME_P (tmp
);
7159 if (IDENTIFIER_TYPENAME_P (tmp
))
7161 if (is_typename_at_global_scope (tmp
))
7162 name
= IDENTIFIER_POINTER (tmp
);
7164 name
= "<invalid operator>";
7167 error ("storage class specified for %s `%s'",
7168 op
? "member operator" : "field",
7173 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
7174 error ("storage class specified for parameter `%s'", name
);
7176 error ("storage class specified for typename");
7178 RIDBIT_RESET (RID_REGISTER
, specbits
);
7179 RIDBIT_RESET (RID_AUTO
, specbits
);
7180 RIDBIT_RESET (RID_EXTERN
, specbits
);
7181 RIDBIT_RESET (RID_THREAD
, specbits
);
7184 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
7186 if (toplevel_bindings_p ())
7188 /* It's common practice (and completely valid) to have a const
7189 be initialized and declared extern. */
7190 if (!(type_quals
& TYPE_QUAL_CONST
))
7191 warning ("`%s' initialized and declared `extern'", name
);
7194 error ("`%s' has both `extern' and initializer", name
);
7196 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
7197 && ! toplevel_bindings_p ())
7198 error ("nested function `%s' declared `extern'", name
);
7199 else if (toplevel_bindings_p ())
7201 if (RIDBIT_SETP (RID_AUTO
, specbits
))
7202 error ("top-level declaration of `%s' specifies `auto'", name
);
7204 else if (RIDBIT_SETP (RID_THREAD
, specbits
)
7205 && !RIDBIT_SETP (RID_EXTERN
, specbits
)
7206 && !RIDBIT_SETP (RID_STATIC
, specbits
))
7208 error ("function-scope `%s' implicitly auto and declared `__thread'",
7210 RIDBIT_RESET (RID_THREAD
, specbits
);
7213 if (nclasses
> 0 && friendp
)
7214 error ("storage class specifiers invalid in friend function declarations");
7216 scope
= get_scope_of_declarator (declarator
);
7218 /* Now figure out the structure of the declarator proper.
7219 Descend through it, creating more complex types, until we reach
7220 the declared identifier (or NULL_TREE, in an abstract declarator). */
7222 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
7223 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
7225 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
7226 an INDIRECT_REF (for *...),
7227 a CALL_EXPR (for ...(...)),
7228 an identifier (for the name being declared)
7229 or a null pointer (for the place in an absolute declarator
7230 where the name was omitted).
7231 For the last two cases, we have just exited the loop.
7233 For C++ it could also be
7234 a SCOPE_REF (for class :: ...). In this case, we have converted
7235 sensible names to types, and those are the values we use to
7236 qualify the member name.
7237 an ADDR_EXPR (for &...),
7238 a BIT_NOT_EXPR (for destructors)
7240 At this point, TYPE is the type of elements of an array,
7241 or for a function to return, or for a pointer to point to.
7242 After this sequence of ifs, TYPE is the type of the
7243 array or function or pointer, and DECLARATOR has had its
7244 outermost layer removed. */
7246 if (type
== error_mark_node
)
7248 if (declarator
== error_mark_node
)
7249 return error_mark_node
;
7250 else if (TREE_CODE (declarator
) == SCOPE_REF
)
7251 declarator
= TREE_OPERAND (declarator
, 1);
7253 declarator
= TREE_OPERAND (declarator
, 0);
7256 if (quals
!= NULL_TREE
7257 && (declarator
== NULL_TREE
7258 || TREE_CODE (declarator
) != SCOPE_REF
))
7260 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
7261 ctype
= TYPE_METHOD_BASETYPE (type
);
7262 if (ctype
!= NULL_TREE
)
7264 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
7265 grok_method_quals (ctype
, dummy
, quals
);
7266 type
= TREE_TYPE (dummy
);
7271 switch (TREE_CODE (declarator
))
7275 /* We encode a declarator with embedded attributes using
7277 tree attrs
= TREE_PURPOSE (declarator
);
7281 declarator
= TREE_VALUE (declarator
);
7282 inner_decl
= declarator
;
7283 while (inner_decl
!= NULL_TREE
7284 && TREE_CODE (inner_decl
) == TREE_LIST
)
7285 inner_decl
= TREE_VALUE (inner_decl
);
7287 if (inner_decl
== NULL_TREE
7288 || TREE_CODE (inner_decl
) == IDENTIFIER_NODE
)
7289 attr_flags
|= (int) ATTR_FLAG_DECL_NEXT
;
7290 if (TREE_CODE (inner_decl
) == CALL_EXPR
)
7291 attr_flags
|= (int) ATTR_FLAG_FUNCTION_NEXT
;
7292 if (TREE_CODE (inner_decl
) == ARRAY_REF
)
7293 attr_flags
|= (int) ATTR_FLAG_ARRAY_NEXT
;
7294 returned_attrs
= decl_attributes (&type
,
7295 chainon (returned_attrs
, attrs
),
7302 tree size
= TREE_OPERAND (declarator
, 1);
7303 declarator
= TREE_OPERAND (declarator
, 0);
7305 type
= create_array_type_for_decl (dname
, type
, size
);
7308 && (TREE_CODE (declarator
) == INDIRECT_REF
7309 || TREE_CODE (declarator
) == ADDR_EXPR
))
7310 /* We can never complete an array type which is the target of a
7311 pointer, so go ahead and lay it out. */
7322 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
7323 tree inner_decl
= TREE_OPERAND (declarator
, 0);
7325 /* Declaring a function type.
7326 Make sure we have a valid type for the function to return. */
7328 /* We now know that the TYPE_QUALS don't apply to the
7329 decl, but to its return type. */
7330 type_quals
= TYPE_UNQUALIFIED
;
7332 /* Warn about some types functions can't return. */
7334 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7336 error ("`%s' declared as function returning a function", name
);
7337 type
= integer_type_node
;
7339 if (TREE_CODE (type
) == ARRAY_TYPE
)
7341 error ("`%s' declared as function returning an array", name
);
7342 type
= integer_type_node
;
7345 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
7346 inner_decl
= TREE_OPERAND (inner_decl
, 1);
7348 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
7351 /* Pick up type qualifiers which should be applied to `this'. */
7352 quals
= CALL_DECLARATOR_QUALS (declarator
);
7354 /* Pick up the exception specifications. */
7355 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
7357 /* Say it's a definition only for the CALL_EXPR
7358 closest to the identifier. */
7361 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
7362 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
7363 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
7365 if (ctype
== NULL_TREE
7366 && decl_context
== FIELD
7368 && (friendp
== 0 || dname
== current_class_name
))
7369 ctype
= current_class_type
;
7371 if (ctype
&& sfk
== sfk_conversion
)
7372 TYPE_HAS_CONVERSION (ctype
) = 1;
7373 if (ctype
&& constructor_name_p (dname
, ctype
))
7375 /* We are within a class's scope. If our declarator name
7376 is the same as the class name, and we are defining
7377 a function, then it is a constructor/destructor, and
7378 therefore returns a void type. */
7380 if (flags
== DTOR_FLAG
)
7382 /* ISO C++ 12.4/2. A destructor may not be
7383 declared const or volatile. A destructor may
7386 error ("destructor cannot be static member function");
7389 error ("destructors may not be `%E'",
7390 TREE_VALUE (quals
));
7393 if (decl_context
== FIELD
)
7395 if (! member_function_or_else (ctype
,
7398 return void_type_node
;
7401 else /* It's a constructor. */
7405 /* ISO C++ 12.1. A constructor may not be
7406 declared const or volatile. A constructor may
7407 not be virtual. A constructor may not be
7410 error ("constructor cannot be static member function");
7413 pedwarn ("constructors cannot be declared virtual");
7418 error ("constructors may not be `%E'",
7419 TREE_VALUE (quals
));
7423 RID_BIT_TYPE tmp_bits
;
7424 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
7425 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
7426 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
7427 if (RIDBIT_ANY_SET (tmp_bits
))
7428 error ("return value type specifier for constructor ignored");
7430 if (decl_context
== FIELD
)
7432 if (! member_function_or_else (ctype
,
7435 return void_type_node
;
7436 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
7437 if (sfk
!= sfk_constructor
)
7441 if (decl_context
== FIELD
)
7447 error ("can't initialize friend function `%s'", name
);
7450 /* Cannot be both friend and virtual. */
7451 error ("virtual functions cannot be friends");
7452 RIDBIT_RESET (RID_FRIEND
, specbits
);
7455 if (decl_context
== NORMAL
)
7456 error ("friend declaration not in class definition");
7457 if (current_function_decl
&& funcdef_flag
)
7458 error ("can't define friend function `%s' in a local class definition",
7462 /* Construct the function type and go to the next
7463 inner layer of declarator. */
7465 declarator
= TREE_OPERAND (declarator
, 0);
7467 arg_types
= grokparms (inner_parms
, &parms
);
7469 if (declarator
&& flags
== DTOR_FLAG
)
7471 /* A destructor declared in the body of a class will
7472 be represented as a BIT_NOT_EXPR. But, we just
7473 want the underlying IDENTIFIER. */
7474 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
7475 declarator
= TREE_OPERAND (declarator
, 0);
7477 if (arg_types
!= void_list_node
)
7479 error ("destructors may not have parameters");
7480 arg_types
= void_list_node
;
7485 /* ANSI says that `const int foo ();'
7486 does not make the function foo const. */
7487 type
= build_function_type (type
, arg_types
);
7493 /* Filter out pointers-to-references and references-to-references.
7494 We can get these if a TYPE_DECL is used. */
7496 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7498 error (TREE_CODE (declarator
) == ADDR_EXPR
7499 ? "cannot declare reference to `%#T'"
7500 : "cannot declare pointer to `%#T'", type
);
7501 type
= TREE_TYPE (type
);
7503 else if (VOID_TYPE_P (type
)
7504 && (ctype
|| TREE_CODE (declarator
) == ADDR_EXPR
))
7505 error (ctype
? "cannot declare pointer to `%#T' member"
7506 : "cannot declare reference to `%#T'", type
);
7508 /* Merge any constancy or volatility into the target type
7511 /* We now know that the TYPE_QUALS don't apply to the decl,
7512 but to the target of the pointer. */
7513 type_quals
= TYPE_UNQUALIFIED
;
7515 if (TREE_CODE (declarator
) == ADDR_EXPR
)
7517 if (!VOID_TYPE_P (type
))
7518 type
= build_reference_type (type
);
7520 else if (TREE_CODE (type
) == METHOD_TYPE
)
7521 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7523 type
= build_ptrmem_type (ctype
, type
);
7525 type
= build_pointer_type (type
);
7527 /* Process a list of type modifier keywords (such as
7528 const or volatile) that were given inside the `*' or `&'. */
7530 if (TREE_TYPE (declarator
))
7538 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
7539 typemodlist
= TREE_CHAIN (typemodlist
))
7541 tree qualifier
= TREE_VALUE (typemodlist
);
7543 if (qualifier
== ridpointers
[(int) RID_CONST
])
7546 type_quals
|= TYPE_QUAL_CONST
;
7548 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
7551 type_quals
|= TYPE_QUAL_VOLATILE
;
7553 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
7556 type_quals
|= TYPE_QUAL_RESTRICT
;
7561 error ("invalid type modifier within pointer declarator");
7565 pedwarn ("duplicate `const'");
7567 pedwarn ("duplicate `volatile'");
7569 pedwarn ("duplicate `restrict'");
7570 type
= cp_build_qualified_type (type
, type_quals
);
7571 type_quals
= cp_type_quals (type
);
7573 declarator
= TREE_OPERAND (declarator
, 0);
7579 /* We have converted type names to NULL_TREE if the
7580 name was bogus, or to a _TYPE node, if not.
7582 The variable CTYPE holds the type we will ultimately
7583 resolve to. The code here just needs to build
7584 up appropriate member types. */
7585 tree sname
= TREE_OPERAND (declarator
, 1);
7588 /* Destructors can have their visibilities changed as well. */
7589 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
7590 sname
= TREE_OPERAND (sname
, 0);
7592 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
7594 /* We had a reference to a global decl, or
7595 perhaps we were given a non-aggregate typedef,
7596 in which case we cleared this out, and should just
7597 keep going as though it wasn't there. */
7601 ctype
= TREE_OPERAND (declarator
, 0);
7604 if (TREE_CODE (TREE_OPERAND (declarator
, 1)) != INDIRECT_REF
)
7605 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
7607 /* You're supposed to have one `template <...>'
7608 for every template class, but you don't need one
7609 for a full specialization. For example:
7611 template <class T> struct S{};
7612 template <> struct S<int> { void f(); };
7613 void S<int>::f () {}
7615 is correct; there shouldn't be a `template <>' for
7616 the definition of `S<int>::f'. */
7617 if (CLASSTYPE_TEMPLATE_INFO (t
)
7618 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
7619 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
7620 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
7621 template_count
+= 1;
7623 t
= TYPE_MAIN_DECL (t
);
7624 t
= DECL_CONTEXT (t
);
7627 if (sname
== NULL_TREE
)
7630 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
7632 /* This is the `standard' use of the scoping operator:
7633 basetype :: member . */
7635 if (ctype
== current_class_type
)
7641 Is this ill-formed? */
7644 pedwarn ("extra qualification `%T::' on member `%s' ignored",
7647 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7649 if (NEW_DELETE_OPNAME_P (sname
))
7650 /* Overloaded operator new and operator delete
7651 are always static functions. */
7653 else if (current_class_type
== NULL_TREE
|| friendp
)
7655 = build_method_type_directly (ctype
,
7657 TYPE_ARG_TYPES (type
));
7660 error ("cannot declare member function `%T::%s' within `%T'",
7661 ctype
, name
, current_class_type
);
7662 return error_mark_node
;
7665 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
7666 || COMPLETE_TYPE_P (complete_type (ctype
)))
7668 /* Have to move this code elsewhere in this function.
7669 this code is used for i.e., typedef int A::M; M *pm;
7671 It is? How? jason 10/2/94 */
7673 if (current_class_type
)
7675 error ("cannot declare member `%T::%s' within `%T'",
7676 ctype
, name
, current_class_type
);
7677 return void_type_node
;
7682 cxx_incomplete_type_error (NULL_TREE
, ctype
);
7683 return error_mark_node
;
7688 else if (TREE_CODE (sname
) == SCOPE_REF
)
7693 declarator
= TREE_OPERAND (declarator
, 1);
7694 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
7695 /* In this case, we will deal with it later. */
7697 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7698 type
= build_method_type_directly (ctype
,
7700 TYPE_ARG_TYPES (type
));
7706 declarator
= TREE_OPERAND (declarator
, 0);
7710 declarator
= BASELINK_FUNCTIONS (declarator
);
7716 declarator
= NULL_TREE
;
7720 declarator
= NULL_TREE
;
7731 *attrlist
= chainon (returned_attrs
, *attrlist
);
7733 attrlist
= &returned_attrs
;
7736 /* Now TYPE has the actual type. */
7738 /* Did array size calculations overflow? */
7740 if (TREE_CODE (type
) == ARRAY_TYPE
7741 && COMPLETE_TYPE_P (type
)
7742 && TREE_OVERFLOW (TYPE_SIZE (type
)))
7744 error ("size of array `%s' is too large", name
);
7745 /* If we proceed with the array type as it is, we'll eventually
7746 crash in tree_low_cst(). */
7747 type
= error_mark_node
;
7750 if ((decl_context
== FIELD
|| decl_context
== PARM
)
7751 && !processing_template_decl
7752 && variably_modified_type_p (type
))
7754 if (decl_context
== FIELD
)
7755 error ("data member may not have variably modified type `%T'", type
);
7757 error ("parameter may not have variably modified type `%T'", type
);
7758 type
= error_mark_node
;
7761 if (explicitp
== 1 || (explicitp
&& friendp
))
7763 /* [dcl.fct.spec] The explicit specifier shall only be used in
7764 declarations of constructors within a class definition. */
7765 error ("only declarations of constructors can be `explicit'");
7769 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
7771 if (decl_context
!= FIELD
|| friendp
)
7773 error ("non-member `%s' cannot be declared `mutable'", name
);
7774 RIDBIT_RESET (RID_MUTABLE
, specbits
);
7776 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
7778 error ("non-object member `%s' cannot be declared `mutable'", name
);
7779 RIDBIT_RESET (RID_MUTABLE
, specbits
);
7781 else if (TREE_CODE (type
) == FUNCTION_TYPE
7782 || TREE_CODE (type
) == METHOD_TYPE
)
7784 error ("function `%s' cannot be declared `mutable'", name
);
7785 RIDBIT_RESET (RID_MUTABLE
, specbits
);
7789 error ("static `%s' cannot be declared `mutable'", name
);
7790 RIDBIT_RESET (RID_MUTABLE
, specbits
);
7792 else if (type_quals
& TYPE_QUAL_CONST
)
7794 error ("const `%s' cannot be declared `mutable'", name
);
7795 RIDBIT_RESET (RID_MUTABLE
, specbits
);
7799 if (declarator
== NULL_TREE
7800 || TREE_CODE (declarator
) == ERROR_MARK
7801 || TREE_CODE (declarator
) == IDENTIFIER_NODE
7802 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
7803 && (TREE_CODE (type
) == FUNCTION_TYPE
7804 || TREE_CODE (type
) == METHOD_TYPE
)))
7806 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
7808 error ("template-id `%D' used as a declarator", declarator
);
7812 /* Unexpected declarator format. */
7815 /* If this is declaring a typedef name, return a TYPE_DECL. */
7817 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
7821 /* Note that the grammar rejects storage classes
7822 in typenames, fields or parameters. */
7823 if (current_lang_name
== lang_name_java
)
7824 TYPE_FOR_JAVA (type
) = 1;
7826 if (decl_context
== FIELD
)
7828 if (constructor_name_p (declarator
, current_class_type
))
7829 pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
7831 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
7835 decl
= build_decl (TYPE_DECL
, declarator
, type
);
7836 if (in_namespace
|| ctype
)
7837 error ("%Jtypedef name may not be a nested-name-specifier", decl
);
7838 if (!current_function_decl
)
7839 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
7842 /* If the user declares "typedef struct {...} foo" then the
7843 struct will have an anonymous name. Fill that name in now.
7844 Nothing can refer to it, so nothing needs know about the name
7846 if (type
!= error_mark_node
7849 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
7850 && TYPE_ANONYMOUS_P (type
)
7851 /* Don't do this if there are attributes. */
7852 && (!attrlist
|| !*attrlist
)
7853 && cp_type_quals (type
) == TYPE_UNQUALIFIED
)
7855 tree oldname
= TYPE_NAME (type
);
7858 /* Replace the anonymous name with the real name everywhere. */
7859 lookup_tag_reverse (type
, declarator
);
7860 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7861 if (TYPE_NAME (t
) == oldname
)
7862 TYPE_NAME (t
) = decl
;
7864 if (TYPE_LANG_SPECIFIC (type
))
7865 TYPE_WAS_ANONYMOUS (type
) = 1;
7867 /* If this is a typedef within a template class, the nested
7868 type is a (non-primary) template. The name for the
7869 template needs updating as well. */
7870 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
7871 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
7872 = TYPE_IDENTIFIER (type
);
7874 /* FIXME remangle member functions; member functions of a
7875 type with external linkage have external linkage. */
7880 if (ctype
== NULL_TREE
)
7882 if (TREE_CODE (type
) != METHOD_TYPE
)
7883 error ("%Jinvalid type qualifier for non-member function type",
7886 ctype
= TYPE_METHOD_BASETYPE (type
);
7888 if (ctype
!= NULL_TREE
)
7889 grok_method_quals (ctype
, decl
, quals
);
7892 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
7893 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
7894 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
7896 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
7897 inlinep
, friendp
, raises
!= NULL_TREE
);
7902 /* Detect the case of an array type of unspecified size
7903 which came, as such, direct from a typedef name.
7904 We must copy the type, so that the array's domain can be
7905 individually set by the object's initializer. */
7907 if (type
&& typedef_type
7908 && TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
7909 && TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (typedef_type
))
7910 type
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
7912 /* Detect where we're using a typedef of function type to declare a
7913 function. PARMS will not be set, so we must create it now. */
7915 if (type
== typedef_type
&& TREE_CODE (type
) == FUNCTION_TYPE
)
7917 tree decls
= NULL_TREE
;
7920 for (args
= TYPE_ARG_TYPES (type
); args
; args
= TREE_CHAIN (args
))
7922 tree decl
= cp_build_parm_decl (NULL_TREE
, TREE_VALUE (args
));
7924 TREE_CHAIN (decl
) = decls
;
7928 parms
= nreverse (decls
);
7931 /* If this is a type name (such as, in a cast or sizeof),
7932 compute the type and return it now. */
7934 if (decl_context
== TYPENAME
)
7936 /* Note that the grammar rejects storage classes
7937 in typenames, fields or parameters. */
7938 if (type_quals
!= TYPE_UNQUALIFIED
)
7939 type_quals
= TYPE_UNQUALIFIED
;
7941 /* Special case: "friend class foo" looks like a TYPENAME context. */
7944 if (type_quals
!= TYPE_UNQUALIFIED
)
7946 error ("type qualifiers specified for friend class declaration");
7947 type_quals
= TYPE_UNQUALIFIED
;
7951 error ("`inline' specified for friend class declaration");
7957 /* Don't allow friend declaration without a class-key. */
7958 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
7959 pedwarn ("template parameters cannot be friends");
7960 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
7961 pedwarn ("friend declaration requires class-key, "
7962 "i.e. `friend class %T::%D'",
7963 TYPE_CONTEXT (type
), TYPENAME_TYPE_FULLNAME (type
));
7965 pedwarn ("friend declaration requires class-key, "
7966 "i.e. `friend %#T'",
7970 /* Only try to do this stuff if we didn't already give up. */
7971 if (type
!= integer_type_node
)
7973 /* A friendly class? */
7974 if (current_class_type
)
7975 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
),
7978 error ("trying to make class `%T' a friend of global scope",
7981 type
= void_type_node
;
7986 if (ctype
== NULL_TREE
)
7988 if (TREE_CODE (type
) != METHOD_TYPE
)
7989 error ("invalid qualifiers on non-member function type");
7991 ctype
= TYPE_METHOD_BASETYPE (type
);
7995 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
7996 grok_method_quals (ctype
, dummy
, quals
);
7997 type
= TREE_TYPE (dummy
);
8003 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
8004 && decl_context
!= CATCHPARM
8005 && TREE_CODE (type
) != UNION_TYPE
8008 error ("abstract declarator `%T' used as declaration", type
);
8009 declarator
= make_anon_name ();
8012 /* `void' at top level (not within pointer)
8013 is allowed only in typedefs or type names.
8014 We don't complain about parms either, but that is because
8015 a better error message can be made later. */
8017 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
8020 error ("unnamed variable or field declared void");
8021 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
8023 if (IDENTIFIER_OPNAME_P (declarator
))
8026 error ("variable or field `%s' declared void", name
);
8029 error ("variable or field declared void");
8030 type
= integer_type_node
;
8033 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
8034 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
8036 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
8038 if (ctype
|| in_namespace
)
8039 error ("cannot use `::' in parameter declaration");
8041 /* A parameter declared as an array of T is really a pointer to T.
8042 One declared as a function is really a pointer to a function.
8043 One declared as a member is really a pointer to member. */
8045 if (TREE_CODE (type
) == ARRAY_TYPE
)
8047 /* Transfer const-ness of array into that of type pointed to. */
8048 type
= build_pointer_type (TREE_TYPE (type
));
8049 type_quals
= TYPE_UNQUALIFIED
;
8051 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
8052 type
= build_pointer_type (type
);
8058 if (decl_context
== PARM
)
8060 decl
= cp_build_parm_decl (declarator
, type
);
8062 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
8063 inlinep
, friendp
, raises
!= NULL_TREE
);
8065 else if (decl_context
== FIELD
)
8067 /* The C99 flexible array extension. */
8068 if (!staticp
&& TREE_CODE (type
) == ARRAY_TYPE
8069 && TYPE_DOMAIN (type
) == NULL_TREE
)
8071 tree itype
= compute_array_index_type (dname
, integer_zero_node
);
8072 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
8075 if (type
== error_mark_node
)
8077 /* Happens when declaring arrays of sizes which
8078 are error_mark_node, for example. */
8081 else if (in_namespace
&& !friendp
)
8083 /* Something like struct S { int N::j; }; */
8084 error ("invalid use of `::'");
8087 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
8090 tree function_context
;
8092 /* We catch the others as conflicts with the builtin
8094 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
8096 error ("function `%D' cannot be declared friend",
8103 if (ctype
== NULL_TREE
)
8104 ctype
= current_class_type
;
8106 if (ctype
== NULL_TREE
)
8108 error ("can't make `%D' into a method -- not in a class",
8110 return void_type_node
;
8113 /* ``A union may [ ... ] not [ have ] virtual functions.''
8115 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
8117 error ("function `%D' declared virtual inside a union",
8119 return void_type_node
;
8122 if (NEW_DELETE_OPNAME_P (declarator
))
8126 error ("`%D' cannot be declared virtual, since it is always static",
8131 else if (staticp
< 2)
8132 type
= build_method_type_directly (ctype
,
8134 TYPE_ARG_TYPES (type
));
8137 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
8138 function_context
= (ctype
!= NULL_TREE
) ?
8139 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
8140 publicp
= (! friendp
|| ! staticp
)
8141 && function_context
== NULL_TREE
;
8142 decl
= grokfndecl (ctype
, type
,
8143 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
8144 ? declarator
: dname
,
8147 virtualp
, flags
, quals
, raises
,
8148 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
8149 funcdef_flag
, template_count
, in_namespace
);
8150 if (decl
== NULL_TREE
)
8153 /* This clobbers the attrs stored in `decl' from `attrlist'. */
8154 /* The decl and setting of decl_attr is also turned off. */
8155 decl
= build_decl_attribute_variant (decl
, decl_attr
);
8158 /* [class.conv.ctor]
8160 A constructor declared without the function-specifier
8161 explicit that can be called with a single parameter
8162 specifies a conversion from the type of its first
8163 parameter to the type of its class. Such a constructor
8164 is called a converting constructor. */
8166 DECL_NONCONVERTING_P (decl
) = 1;
8167 else if (DECL_CONSTRUCTOR_P (decl
))
8169 /* The constructor can be called with exactly one
8170 parameter if there is at least one parameter, and
8171 any subsequent parameters have default arguments.
8172 Ignore any compiler-added parms. */
8173 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
8175 if (arg_types
== void_list_node
8177 && TREE_CHAIN (arg_types
)
8178 && TREE_CHAIN (arg_types
) != void_list_node
8179 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
8180 DECL_NONCONVERTING_P (decl
) = 1;
8183 else if (TREE_CODE (type
) == METHOD_TYPE
)
8185 /* We only get here for friend declarations of
8186 members of other classes. */
8187 /* All method decls are public, so tell grokfndecl to set
8188 TREE_PUBLIC, also. */
8189 decl
= grokfndecl (ctype
, type
,
8190 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
8191 ? declarator
: dname
,
8194 virtualp
, flags
, quals
, raises
,
8195 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
8196 template_count
, in_namespace
);
8197 if (decl
== NULL_TREE
)
8200 else if (!staticp
&& !dependent_type_p (type
)
8201 && !COMPLETE_TYPE_P (complete_type (type
))
8202 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
8205 error ("field `%D' has incomplete type", declarator
);
8207 error ("name `%T' has incomplete type", type
);
8209 /* If we're instantiating a template, tell them which
8210 instantiation made the field's type be incomplete. */
8211 if (current_class_type
8212 && TYPE_NAME (current_class_type
)
8213 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
8214 && declspecs
&& TREE_VALUE (declspecs
)
8215 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
8216 error (" in instantiation of template `%T'",
8217 current_class_type
);
8219 type
= error_mark_node
;
8226 error ("`%E' is neither function nor member function; "
8227 "cannot be declared friend", declarator
);
8235 /* Friends are treated specially. */
8236 if (ctype
== current_class_type
)
8237 warning ("member functions are implicitly friends of their class");
8238 else if (decl
&& DECL_NAME (decl
))
8240 if (template_class_depth (current_class_type
) == 0)
8242 decl
= check_explicit_specialization
8243 (declarator
, decl
, template_count
,
8244 2 * (funcdef_flag
!= 0) + 4);
8245 if (decl
== error_mark_node
)
8246 return error_mark_node
;
8249 decl
= do_friend (ctype
, declarator
, decl
,
8250 *attrlist
, flags
, quals
, funcdef_flag
);
8254 return void_type_node
;
8257 /* Structure field. It may not be a function, except for C++. */
8259 if (decl
== NULL_TREE
)
8265 /* An attempt is being made to initialize a non-static
8266 member. But, from [class.mem]:
8268 4 A member-declarator can contain a
8269 constant-initializer only if it declares a static
8270 member (_class.static_) of integral or enumeration
8271 type, see _class.static.data_.
8273 This used to be relatively common practice, but
8274 the rest of the compiler does not correctly
8275 handle the initialization unless the member is
8276 static so we make it static below. */
8277 pedwarn ("ISO C++ forbids initialization of member `%D'",
8279 pedwarn ("making `%D' static", declarator
);
8283 if (uses_template_parms (type
))
8284 /* We'll check at instantiation time. */
8286 else if (check_static_variable_definition (declarator
,
8288 /* If we just return the declaration, crashes
8289 will sometimes occur. We therefore return
8290 void_type_node, as if this was a friend
8291 declaration, to cause callers to completely
8292 ignore this declaration. */
8293 return void_type_node
;
8298 /* C++ allows static class members. All other work
8299 for this is done by grokfield. */
8300 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8301 TREE_STATIC (decl
) = 1;
8302 /* In class context, 'static' means public access. */
8303 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
8307 decl
= build_decl (FIELD_DECL
, declarator
, type
);
8308 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
8309 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
8311 DECL_MUTABLE_P (decl
) = 1;
8312 RIDBIT_RESET (RID_MUTABLE
, specbits
);
8316 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
8317 inlinep
, friendp
, raises
!= NULL_TREE
);
8320 else if (TREE_CODE (type
) == FUNCTION_TYPE
8321 || TREE_CODE (type
) == METHOD_TYPE
)
8329 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
8330 original_name
= dname
;
8332 original_name
= declarator
;
8334 if (RIDBIT_SETP (RID_AUTO
, specbits
))
8335 error ("storage class `auto' invalid for function `%s'", name
);
8336 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
8337 error ("storage class `register' invalid for function `%s'", name
);
8338 else if (RIDBIT_SETP (RID_THREAD
, specbits
))
8339 error ("storage class `__thread' invalid for function `%s'", name
);
8341 /* Function declaration not at top level.
8342 Storage classes other than `extern' are not allowed
8343 and `extern' makes no difference. */
8344 if (! toplevel_bindings_p ()
8345 && (RIDBIT_SETP (RID_STATIC
, specbits
)
8346 || RIDBIT_SETP (RID_INLINE
, specbits
))
8349 if (RIDBIT_SETP (RID_STATIC
, specbits
))
8350 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
8352 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
8355 if (ctype
== NULL_TREE
)
8359 error ("virtual non-class function `%s'", name
);
8363 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2
8364 && !NEW_DELETE_OPNAME_P (original_name
))
8365 type
= build_method_type_directly (ctype
,
8367 TYPE_ARG_TYPES (type
));
8369 /* Record presence of `static'. */
8370 publicp
= (ctype
!= NULL_TREE
8371 || RIDBIT_SETP (RID_EXTERN
, specbits
)
8372 || !RIDBIT_SETP (RID_STATIC
, specbits
));
8374 decl
= grokfndecl (ctype
, type
, original_name
, parms
, declarator
,
8375 virtualp
, flags
, quals
, raises
,
8377 publicp
, inlinep
, funcdef_flag
,
8378 template_count
, in_namespace
);
8379 if (decl
== NULL_TREE
)
8384 int invalid_static
= 0;
8386 /* Don't allow a static member function in a class, and forbid
8387 declaring main to be static. */
8388 if (TREE_CODE (type
) == METHOD_TYPE
)
8390 pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
8393 else if (current_function_decl
)
8395 /* FIXME need arm citation */
8396 error ("cannot declare static function inside another function");
8403 RIDBIT_RESET (RID_STATIC
, specbits
);
8409 /* It's a variable. */
8411 /* An uninitialized decl with `extern' is a reference. */
8412 decl
= grokvardecl (type
, declarator
, &specbits
,
8414 (type_quals
& TYPE_QUAL_CONST
) != 0,
8415 ctype
? ctype
: in_namespace
);
8416 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
8417 inlinep
, friendp
, raises
!= NULL_TREE
);
8421 DECL_CONTEXT (decl
) = ctype
;
8424 pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
8426 RIDBIT_RESET (RID_STATIC
, specbits
);
8428 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
8430 error ("static member `%D' declared `register'", decl
);
8431 RIDBIT_RESET (RID_REGISTER
, specbits
);
8433 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
8435 pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
8437 RIDBIT_RESET (RID_EXTERN
, specbits
);
8442 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
8444 /* Record `register' declaration for warnings on &
8445 and in case doing stupid register allocation. */
8447 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
8448 DECL_REGISTER (decl
) = 1;
8450 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8451 DECL_THIS_EXTERN (decl
) = 1;
8453 if (RIDBIT_SETP (RID_STATIC
, specbits
))
8454 DECL_THIS_STATIC (decl
) = 1;
8456 /* Record constancy and volatility. There's no need to do this
8457 when processing a template; we'll do this for the instantiated
8458 declaration based on the type of DECL. */
8459 if (!processing_template_decl
)
8460 c_apply_type_quals_to_decl (type_quals
, decl
);
8466 /* Subroutine of start_function. Ensure that each of the parameter
8467 types (as listed in PARMS) is complete, as is required for a
8468 function definition. */
8471 require_complete_types_for_parms (tree parms
)
8473 for (; parms
; parms
= TREE_CHAIN (parms
))
8475 if (VOID_TYPE_P (TREE_TYPE (parms
)))
8476 /* grokparms will have already issued an error. */
8477 TREE_TYPE (parms
) = error_mark_node
;
8478 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
8480 layout_decl (parms
, 0);
8481 DECL_ARG_TYPE (parms
) = type_passed_as (TREE_TYPE (parms
));
8486 /* Returns nonzero if T is a local variable. */
8489 local_variable_p (tree t
)
8491 if ((TREE_CODE (t
) == VAR_DECL
8492 /* A VAR_DECL with a context that is a _TYPE is a static data
8494 && !TYPE_P (CP_DECL_CONTEXT (t
))
8495 /* Any other non-local variable must be at namespace scope. */
8496 && !DECL_NAMESPACE_SCOPE_P (t
))
8497 || (TREE_CODE (t
) == PARM_DECL
))
8503 /* Returns nonzero if T is an automatic local variable or a label.
8504 (These are the declarations that need to be remapped when the code
8505 containing them is duplicated.) */
8508 nonstatic_local_decl_p (tree t
)
8510 return ((local_variable_p (t
) && !TREE_STATIC (t
))
8511 || TREE_CODE (t
) == LABEL_DECL
8512 || TREE_CODE (t
) == RESULT_DECL
);
8515 /* Like local_variable_p, but suitable for use as a tree-walking
8519 local_variable_p_walkfn (tree
* tp
,
8520 int* walk_subtrees ATTRIBUTE_UNUSED
,
8521 void* data ATTRIBUTE_UNUSED
)
8523 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
8527 /* Check that ARG, which is a default-argument expression for a
8528 parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if
8529 something goes wrong. DECL may also be a _TYPE node, rather than a
8530 DECL, if there is no DECL available. */
8533 check_default_argument (tree decl
, tree arg
)
8538 if (TREE_CODE (arg
) == DEFAULT_ARG
)
8539 /* We get a DEFAULT_ARG when looking at an in-class declaration
8540 with a default argument. Ignore the argument for now; we'll
8541 deal with it after the class is complete. */
8544 if (processing_template_decl
|| uses_template_parms (arg
))
8545 /* We don't do anything checking until instantiation-time. Note
8546 that there may be uninstantiated arguments even for an
8547 instantiated function, since default arguments are not
8548 instantiated until they are needed. */
8557 decl_type
= TREE_TYPE (decl
);
8559 if (arg
== error_mark_node
8560 || decl
== error_mark_node
8561 || TREE_TYPE (arg
) == error_mark_node
8562 || decl_type
== error_mark_node
)
8563 /* Something already went wrong. There's no need to check
8565 return error_mark_node
;
8567 /* [dcl.fct.default]
8569 A default argument expression is implicitly converted to the
8571 if (!TREE_TYPE (arg
)
8572 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
8575 error ("default argument for `%#D' has type `%T'",
8576 decl
, TREE_TYPE (arg
));
8578 error ("default argument for parameter of type `%T' has type `%T'",
8579 decl_type
, TREE_TYPE (arg
));
8581 return error_mark_node
;
8584 /* [dcl.fct.default]
8586 Local variables shall not be used in default argument
8589 The keyword `this' shall not be used in a default argument of a
8591 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
8595 error ("default argument `%E' uses local variable `%D'",
8597 return error_mark_node
;
8604 /* Decode the list of parameter types for a function type.
8605 Given the list of things declared inside the parens,
8606 return a list of types.
8608 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
8609 flag. If unset, we append void_list_node. A parmlist declared
8610 as `(void)' is accepted as the empty parmlist.
8612 *PARMS is set to the chain of PARM_DECLs created. */
8615 grokparms (tree first_parm
, tree
*parms
)
8617 tree result
= NULL_TREE
;
8618 tree decls
= NULL_TREE
;
8619 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
8623 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
8625 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
8627 tree type
= NULL_TREE
;
8628 tree decl
= TREE_VALUE (parm
);
8629 tree init
= TREE_PURPOSE (parm
);
8632 chain
= TREE_CHAIN (parm
);
8633 /* @@ weak defense against parse errors. */
8634 if (TREE_CODE (decl
) != VOID_TYPE
8635 && TREE_CODE (decl
) != TREE_LIST
)
8637 /* Give various messages as the need arises. */
8638 if (TREE_CODE (decl
) == STRING_CST
)
8639 error ("invalid string constant `%E'", decl
);
8640 else if (TREE_CODE (decl
) == INTEGER_CST
)
8641 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
8645 if (parm
== void_list_node
)
8648 split_specs_attrs (TREE_PURPOSE (decl
), &specs
, &attrs
);
8649 decl
= grokdeclarator (TREE_VALUE (decl
), specs
,
8650 PARM
, init
!= NULL_TREE
, &attrs
);
8651 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
8655 cplus_decl_attributes (&decl
, attrs
, 0);
8657 type
= TREE_TYPE (decl
);
8658 if (VOID_TYPE_P (type
))
8660 if (same_type_p (type
, void_type_node
)
8661 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
8662 /* this is a parmlist of `(void)', which is ok. */
8664 cxx_incomplete_type_error (decl
, type
);
8665 /* It's not a good idea to actually create parameters of
8666 type `void'; other parts of the compiler assume that a
8667 void type terminates the parameter list. */
8668 type
= error_mark_node
;
8669 TREE_TYPE (decl
) = error_mark_node
;
8672 if (type
!= error_mark_node
)
8674 /* Top-level qualifiers on the parameters are
8675 ignored for function types. */
8676 type
= cp_build_qualified_type (type
, 0);
8677 if (TREE_CODE (type
) == METHOD_TYPE
)
8679 error ("parameter `%D' invalidly declared method type", decl
);
8680 type
= build_pointer_type (type
);
8681 TREE_TYPE (decl
) = type
;
8683 else if (abstract_virtuals_error (decl
, type
))
8684 any_error
= 1; /* Seems like a good idea. */
8685 else if (POINTER_TYPE_P (type
))
8687 /* [dcl.fct]/6, parameter types cannot contain pointers
8688 (references) to arrays of unknown bound. */
8689 tree t
= TREE_TYPE (type
);
8690 int ptr
= TYPE_PTR_P (type
);
8696 else if (TREE_CODE (t
) != ARRAY_TYPE
)
8698 else if (!TYPE_DOMAIN (t
))
8702 if (TREE_CODE (t
) == ARRAY_TYPE
)
8703 error ("parameter `%D' includes %s to array of unknown bound `%T'",
8704 decl
, ptr
? "pointer" : "reference", t
);
8707 if (!any_error
&& init
)
8708 init
= check_default_argument (decl
, init
);
8713 TREE_CHAIN (decl
) = decls
;
8715 result
= tree_cons (init
, type
, result
);
8717 decls
= nreverse (decls
);
8718 result
= nreverse (result
);
8720 result
= chainon (result
, void_list_node
);
8727 /* D is a constructor or overloaded `operator='.
8729 Let T be the class in which D is declared. Then, this function
8732 -1 if D's is an ill-formed constructor or copy assignment operator
8733 whose first parameter is of type `T'.
8734 0 if D is not a copy constructor or copy assignment
8736 1 if D is a copy constructor or copy assignment operator whose
8737 first parameter is a reference to const qualified T.
8738 2 if D is a copy constructor or copy assignment operator whose
8739 first parameter is a reference to non-const qualified T.
8741 This function can be used as a predicate. Positive values indicate
8742 a copy constructor and nonzero values indicate a copy assignment
8752 my_friendly_assert (DECL_FUNCTION_MEMBER_P (d
), 20011208);
8754 if (DECL_TEMPLATE_INFO (d
) && is_member_template (DECL_TI_TEMPLATE (d
)))
8755 /* Instantiations of template member functions are never copy
8756 functions. Note that member functions of templated classes are
8757 represented as template functions internally, and we must
8758 accept those as copy functions. */
8761 args
= FUNCTION_FIRST_USER_PARMTYPE (d
);
8765 arg_type
= TREE_VALUE (args
);
8767 if (TYPE_MAIN_VARIANT (arg_type
) == DECL_CONTEXT (d
))
8769 /* Pass by value copy assignment operator. */
8772 else if (TREE_CODE (arg_type
) == REFERENCE_TYPE
8773 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type
)) == DECL_CONTEXT (d
))
8775 if (CP_TYPE_CONST_P (TREE_TYPE (arg_type
)))
8781 args
= TREE_CHAIN (args
);
8783 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
8784 /* There are more non-optional args. */
8790 /* Remember any special properties of member function DECL. */
8792 void grok_special_member_properties (tree decl
)
8794 if (!DECL_NONSTATIC_MEMBER_FUNCTION_P(decl
))
8795 ; /* Not special. */
8796 else if (DECL_CONSTRUCTOR_P (decl
))
8798 int ctor
= copy_fn_p (decl
);
8804 A non-template constructor for class X is a copy
8805 constructor if its first parameter is of type X&, const
8806 X&, volatile X& or const volatile X&, and either there
8807 are no other parameters or else all other parameters have
8808 default arguments. */
8809 TYPE_HAS_INIT_REF (DECL_CONTEXT (decl
)) = 1;
8811 TYPE_HAS_CONST_INIT_REF (DECL_CONTEXT (decl
)) = 1;
8813 else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl
)))
8814 TYPE_HAS_DEFAULT_CONSTRUCTOR (DECL_CONTEXT (decl
)) = 1;
8816 else if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
8820 A non-template assignment operator for class X is a copy
8821 assignment operator if its parameter is of type X, X&, const
8822 X&, volatile X& or const volatile X&. */
8824 int assop
= copy_fn_p (decl
);
8828 TYPE_HAS_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
8830 TYPE_HAS_CONST_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
8831 if (DECL_PURE_VIRTUAL_P (decl
))
8832 TYPE_HAS_ABSTRACT_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
8837 /* Check a constructor DECL has the correct form. Complains
8838 if the class has a constructor of the form X(X). */
8841 grok_ctor_properties (tree ctype
, tree decl
)
8843 int ctor_parm
= copy_fn_p (decl
);
8849 A declaration of a constructor for a class X is ill-formed if
8850 its first parameter is of type (optionally cv-qualified) X
8851 and either there are no other parameters or else all other
8852 parameters have default arguments.
8854 We *don't* complain about member template instantiations that
8855 have this form, though; they can occur as we try to decide
8856 what constructor to use during overload resolution. Since
8857 overload resolution will never prefer such a constructor to
8858 the non-template copy constructor (which is either explicitly
8859 or implicitly defined), there's no need to worry about their
8860 existence. Theoretically, they should never even be
8861 instantiated, but that's hard to forestall. */
8862 error ("invalid constructor; you probably meant `%T (const %T&)'",
8870 /* An operator with this code is unary, but can also be binary. */
8873 ambi_op_p (enum tree_code code
)
8875 return (code
== INDIRECT_REF
8876 || code
== ADDR_EXPR
8877 || code
== CONVERT_EXPR
8878 || code
== NEGATE_EXPR
8879 || code
== PREINCREMENT_EXPR
8880 || code
== PREDECREMENT_EXPR
);
8883 /* An operator with this name can only be unary. */
8886 unary_op_p (enum tree_code code
)
8888 return (code
== TRUTH_NOT_EXPR
8889 || code
== BIT_NOT_EXPR
8890 || code
== COMPONENT_REF
8891 || code
== TYPE_EXPR
);
8894 /* DECL is a declaration for an overloaded operator. Returns true if
8895 the declaration is valid; false otherwise. If COMPLAIN is true,
8896 errors are issued for invalid declarations. */
8899 grok_op_properties (tree decl
, int friendp
, bool complain
)
8901 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
8903 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
8904 tree name
= DECL_NAME (decl
);
8905 enum tree_code operator_code
;
8909 /* Assume that the declaration is valid. */
8912 /* Count the number of arguments. */
8913 for (argtype
= argtypes
, arity
= 0;
8914 argtype
&& argtype
!= void_list_node
;
8915 argtype
= TREE_CHAIN (argtype
))
8918 if (current_class_type
== NULL_TREE
)
8921 if (DECL_CONV_FN_P (decl
))
8922 operator_code
= TYPE_EXPR
;
8926 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
8927 if (ansi_opname (CODE) == name) \
8929 operator_code = (CODE); \
8932 else if (ansi_assopname (CODE) == name) \
8934 operator_code = (CODE); \
8935 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
8939 #include "operators.def"
8945 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
8946 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
8950 switch (operator_code
)
8953 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
8957 TYPE_GETS_DELETE (current_class_type
) |= 1;
8961 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
8964 case VEC_DELETE_EXPR
:
8965 TYPE_GETS_DELETE (current_class_type
) |= 2;
8973 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
8974 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
8975 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
8976 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
8979 /* An operator function must either be a non-static member function
8980 or have at least one parameter of a class, a reference to a class,
8981 an enumeration, or a reference to an enumeration. 13.4.0.6 */
8982 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
8984 if (operator_code
== TYPE_EXPR
8985 || operator_code
== CALL_EXPR
8986 || operator_code
== COMPONENT_REF
8987 || operator_code
== ARRAY_REF
8988 || operator_code
== NOP_EXPR
)
8989 error ("`%D' must be a nonstatic member function", decl
);
8994 if (DECL_STATIC_FUNCTION_P (decl
))
8995 error ("`%D' must be either a non-static member function or a non-member function", decl
);
8997 for (p
= argtypes
; p
&& p
!= void_list_node
; p
= TREE_CHAIN (p
))
8999 tree arg
= non_reference (TREE_VALUE (p
));
9000 /* IS_AGGR_TYPE, rather than CLASS_TYPE_P, is used
9001 because these checks are performed even on
9002 template functions. */
9003 if (IS_AGGR_TYPE (arg
) || TREE_CODE (arg
) == ENUMERAL_TYPE
)
9007 if (!p
|| p
== void_list_node
)
9012 error ("`%D' must have an argument of class or "
9020 /* There are no restrictions on the arguments to an overloaded
9022 if (operator_code
== CALL_EXPR
)
9025 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
9027 tree t
= TREE_TYPE (name
);
9030 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
9031 const char *what
= 0;
9034 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
9036 if (TREE_CODE (t
) == VOID_TYPE
)
9038 else if (t
== current_class_type
)
9039 what
= "the same type";
9040 /* Don't force t to be complete here. */
9041 else if (IS_AGGR_TYPE (t
)
9042 && COMPLETE_TYPE_P (t
)
9043 && DERIVED_FROM_P (t
, current_class_type
))
9044 what
= "a base class";
9046 if (what
&& warn_conversion
)
9047 warning ("conversion to %s%s will never use a type conversion operator",
9048 ref
? "a reference to " : "", what
);
9051 if (operator_code
== COND_EXPR
)
9054 error ("ISO C++ prohibits overloading operator ?:");
9056 else if (ambi_op_p (operator_code
))
9059 /* We pick the one-argument operator codes by default, so
9060 we don't have to change anything. */
9062 else if (arity
== 2)
9064 /* If we thought this was a unary operator, we now know
9065 it to be a binary operator. */
9066 switch (operator_code
)
9069 operator_code
= MULT_EXPR
;
9073 operator_code
= BIT_AND_EXPR
;
9077 operator_code
= PLUS_EXPR
;
9081 operator_code
= MINUS_EXPR
;
9084 case PREINCREMENT_EXPR
:
9085 operator_code
= POSTINCREMENT_EXPR
;
9088 case PREDECREMENT_EXPR
:
9089 operator_code
= POSTDECREMENT_EXPR
;
9096 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
9098 if ((operator_code
== POSTINCREMENT_EXPR
9099 || operator_code
== POSTDECREMENT_EXPR
)
9100 && ! processing_template_decl
9101 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
9104 error ("postfix `%D' must take `int' as its argument",
9108 ("postfix `%D' must take `int' as its second argument",
9115 error ("`%D' must take either zero or one argument", decl
);
9117 error ("`%D' must take either one or two arguments", decl
);
9120 /* More Effective C++ rule 6. */
9122 && (operator_code
== POSTINCREMENT_EXPR
9123 || operator_code
== POSTDECREMENT_EXPR
9124 || operator_code
== PREINCREMENT_EXPR
9125 || operator_code
== PREDECREMENT_EXPR
))
9127 tree arg
= TREE_VALUE (argtypes
);
9128 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
9129 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
9130 arg
= TREE_TYPE (arg
);
9131 arg
= TYPE_MAIN_VARIANT (arg
);
9132 if (operator_code
== PREINCREMENT_EXPR
9133 || operator_code
== PREDECREMENT_EXPR
)
9135 if (TREE_CODE (ret
) != REFERENCE_TYPE
9136 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
9138 warning ("prefix `%D' should return `%T'", decl
,
9139 build_reference_type (arg
));
9143 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
9144 warning ("postfix `%D' should return `%T'", decl
, arg
);
9148 else if (unary_op_p (operator_code
))
9153 error ("`%D' must take `void'", decl
);
9155 error ("`%D' must take exactly one argument", decl
);
9158 else /* if (binary_op_p (operator_code)) */
9163 error ("`%D' must take exactly one argument", decl
);
9165 error ("`%D' must take exactly two arguments", decl
);
9168 /* More Effective C++ rule 7. */
9170 && (operator_code
== TRUTH_ANDIF_EXPR
9171 || operator_code
== TRUTH_ORIF_EXPR
9172 || operator_code
== COMPOUND_EXPR
))
9173 warning ("user-defined `%D' always evaluates both arguments",
9177 /* Effective C++ rule 23. */
9180 && !DECL_ASSIGNMENT_OPERATOR_P (decl
)
9181 && (operator_code
== PLUS_EXPR
9182 || operator_code
== MINUS_EXPR
9183 || operator_code
== TRUNC_DIV_EXPR
9184 || operator_code
== MULT_EXPR
9185 || operator_code
== TRUNC_MOD_EXPR
)
9186 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
9187 warning ("`%D' should return by value", decl
);
9190 for (; argtypes
&& argtypes
!= void_list_node
;
9191 argtypes
= TREE_CHAIN (argtypes
))
9192 if (TREE_PURPOSE (argtypes
))
9194 TREE_PURPOSE (argtypes
) = NULL_TREE
;
9195 if (operator_code
== POSTINCREMENT_EXPR
9196 || operator_code
== POSTDECREMENT_EXPR
)
9199 pedwarn ("`%D' cannot have default arguments", decl
);
9202 error ("`%D' cannot have default arguments", decl
);
9211 tag_name (enum tag_types code
)
9228 /* Name lookup in an elaborated-type-specifier (after the keyword
9229 indicated by TAG_CODE) has found the TYPE_DECL DECL. If the
9230 elaborated-type-specifier is invalid, issue a diagnostic and return
9231 error_mark_node; otherwise, return the *_TYPE to which it referred.
9232 If ALLOW_TEMPLATE_P is true, TYPE may be a class template. */
9235 check_elaborated_type_specifier (enum tag_types tag_code
,
9237 bool allow_template_p
)
9243 struct S { struct S *p; };
9245 name lookup will find the TYPE_DECL for the implicit "S::S"
9246 typedef. Adjust for that here. */
9247 if (DECL_SELF_REFERENCE_P (decl
))
9248 decl
= TYPE_NAME (TREE_TYPE (decl
));
9250 type
= TREE_TYPE (decl
);
9254 If the identifier resolves to a typedef-name or a template
9255 type-parameter, the elaborated-type-specifier is ill-formed.
9257 In other words, the only legitimate declaration to use in the
9258 elaborated type specifier is the implicit typedef created when
9259 the type is declared. */
9260 if (!DECL_IMPLICIT_TYPEDEF_P (decl
))
9262 error ("using typedef-name `%D' after `%s'", decl
, tag_name (tag_code
));
9263 return IS_AGGR_TYPE (type
) ? type
: error_mark_node
;
9266 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
9268 error ("using template type parameter `%T' after `%s'",
9269 type
, tag_name (tag_code
));
9270 return error_mark_node
;
9272 else if (TREE_CODE (type
) != RECORD_TYPE
9273 && TREE_CODE (type
) != UNION_TYPE
9274 && tag_code
!= enum_type
)
9276 error ("`%T' referred to as `%s'", type
, tag_name (tag_code
));
9277 return error_mark_node
;
9279 else if (TREE_CODE (type
) != ENUMERAL_TYPE
9280 && tag_code
== enum_type
)
9282 error ("`%T' referred to as enum", type
);
9283 return error_mark_node
;
9285 else if (!allow_template_p
9286 && TREE_CODE (type
) == RECORD_TYPE
9287 && CLASSTYPE_IS_TEMPLATE (type
))
9289 /* If a class template appears as elaborated type specifier
9290 without a template header such as:
9292 template <class T> class C {};
9293 void f(class C); // No template header here
9295 then the required template argument is missing. */
9297 error ("template argument required for `%s %T'",
9298 tag_name (tag_code
),
9299 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
)));
9300 return error_mark_node
;
9306 /* Get the struct, enum or union (TAG_CODE says which) with tag NAME.
9307 Define the tag as a forward-reference if it is not defined.
9309 If a declaration is given, process it here, and report an error if
9310 multiple declarations are not identical.
9312 GLOBALIZE is false when this is also a definition. Only look in
9313 the current frame for the name (since C++ allows new names in any
9316 TEMPLATE_HEADER_P is true when this declaration is preceded by
9317 a set of template parameters. */
9320 xref_tag (enum tag_types tag_code
, tree name
,
9321 bool globalize
, bool template_header_p
)
9323 enum tree_code code
;
9325 struct cp_binding_level
*b
= current_binding_level
;
9326 tree context
= NULL_TREE
;
9328 timevar_push (TV_NAME_LOOKUP
);
9330 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 0);
9342 code
= ENUMERAL_TYPE
;
9350 /* If we know we are defining this tag, only look it up in
9351 this scope and don't try to find it as a type. */
9352 t
= lookup_tag (code
, name
, b
, 1);
9356 tree decl
= lookup_name (name
, 2);
9358 if (decl
&& DECL_CLASS_TEMPLATE_P (decl
))
9359 decl
= DECL_TEMPLATE_RESULT (decl
);
9361 if (decl
&& TREE_CODE (decl
) == TYPE_DECL
)
9363 /* Two cases we need to consider when deciding if a class
9364 template is allowed as an elaborated type specifier:
9365 1. It is a self reference to its own class.
9366 2. It comes with a template header.
9370 template <class T> class C {
9371 class C *c1; // DECL_SELF_REFERENCE_P is true
9374 template <class U> class C; // template_header_p is true
9375 template <class T> class C<T>::D {
9376 class C *c2; // DECL_SELF_REFERENCE_P is true
9379 t
= check_elaborated_type_specifier (tag_code
,
9382 | DECL_SELF_REFERENCE_P (decl
));
9383 if (t
== error_mark_node
)
9384 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
9389 if (t
&& current_class_type
9390 && template_class_depth (current_class_type
)
9391 && template_header_p
)
9393 /* Since GLOBALIZE is nonzero, we are not looking at a
9394 definition of this tag. Since, in addition, we are currently
9395 processing a (member) template declaration of a template
9396 class, we must be very careful; consider:
9403 { template <class V>
9404 friend struct S1; };
9406 Here, the S2::S1 declaration should not be confused with the
9407 outer declaration. In particular, the inner version should
9408 have a template parameter of level 2, not level 1. This
9409 would be particularly important if the member declaration
9412 template <class V = U> friend struct S1;
9414 say, when we should tsubst into `U' when instantiating
9415 S2. On the other hand, when presented with:
9425 we must find the inner binding eventually. We
9426 accomplish this by making sure that the new type we
9427 create to represent this declaration has the right
9429 context
= TYPE_CONTEXT (t
);
9436 /* If no such tag is yet defined, create a forward-reference node
9437 and record it as the "definition".
9438 When a real declaration of this type is found,
9439 the forward-reference will be altered into a real type. */
9440 if (code
== ENUMERAL_TYPE
)
9442 error ("use of enum `%#D' without previous declaration", name
);
9443 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
9447 t
= make_aggr_type (code
);
9448 TYPE_CONTEXT (t
) = context
;
9449 pushtag (name
, t
, globalize
);
9454 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (t
))
9455 redeclare_class_template (t
, current_template_parms
);
9456 else if (!processing_template_decl
9458 && CLASSTYPE_IS_TEMPLATE (t
))
9460 error ("redeclaration of `%T' as a non-template", t
);
9461 t
= error_mark_node
;
9465 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
9469 xref_tag_from_type (tree old
, tree id
, int globalize
)
9471 enum tag_types tag_kind
;
9473 if (TREE_CODE (old
) == RECORD_TYPE
)
9474 tag_kind
= (CLASSTYPE_DECLARED_CLASS (old
) ? class_type
: record_type
);
9476 tag_kind
= union_type
;
9478 if (id
== NULL_TREE
)
9479 id
= TYPE_IDENTIFIER (old
);
9481 return xref_tag (tag_kind
, id
, globalize
, false);
9484 /* REF is a type (named NAME), for which we have just seen some
9485 baseclasses. BASE_LIST is a list of those baseclasses; the
9486 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
9487 the base-class. TREE_VIA_VIRTUAL indicates virtual
9488 inheritance. CODE_TYPE_NODE indicates whether REF is a class,
9489 struct, or union. */
9492 xref_basetypes (tree ref
, tree base_list
)
9494 /* In the declaration `A : X, Y, ... Z' we mark all the types
9495 (A, X, Y, ..., Z) so we can check for duplicates. */
9499 enum tag_types tag_code
;
9501 if (ref
== error_mark_node
)
9504 if (TREE_CODE (ref
) == UNION_TYPE
)
9506 error ("derived union `%T' invalid", ref
);
9510 tag_code
= (CLASSTYPE_DECLARED_CLASS (ref
) ? class_type
: record_type
);
9512 /* First, make sure that any templates in base-classes are
9513 instantiated. This ensures that if we call ourselves recursively
9514 we do not get confused about which classes are marked and which
9519 tree basetype
= TREE_VALUE (*basep
);
9520 if (!(processing_template_decl
&& uses_template_parms (basetype
))
9521 && !complete_type_or_else (basetype
, NULL
))
9522 /* An incomplete type. Remove it from the list. */
9523 *basep
= TREE_CHAIN (*basep
);
9525 basep
= &TREE_CHAIN (*basep
);
9528 SET_CLASSTYPE_MARKED (ref
);
9529 i
= list_length (base_list
);
9532 tree binfo
= TYPE_BINFO (ref
);
9533 tree binfos
= make_tree_vec (i
);
9534 tree accesses
= make_tree_vec (i
);
9536 BINFO_BASETYPES (binfo
) = binfos
;
9537 BINFO_BASEACCESSES (binfo
) = accesses
;
9539 for (i
= 0; base_list
; base_list
= TREE_CHAIN (base_list
))
9541 tree access
= TREE_PURPOSE (base_list
);
9542 int via_virtual
= TREE_VIA_VIRTUAL (base_list
);
9543 tree basetype
= TREE_VALUE (base_list
);
9546 if (access
== access_default_node
)
9547 /* The base of a derived struct is public by default. */
9548 access
= (tag_code
== class_type
9549 ? access_private_node
: access_public_node
);
9551 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
9552 basetype
= TREE_TYPE (basetype
);
9554 || (TREE_CODE (basetype
) != RECORD_TYPE
9555 && TREE_CODE (basetype
) != TYPENAME_TYPE
9556 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
9557 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
9559 error ("base type `%T' fails to be a struct or class type",
9564 if (CLASSTYPE_MARKED (basetype
))
9566 if (basetype
== ref
)
9567 error ("recursive type `%T' undefined", basetype
);
9569 error ("duplicate base type `%T' invalid", basetype
);
9573 if (TYPE_FOR_JAVA (basetype
)
9574 && (current_lang_depth () == 0))
9575 TYPE_FOR_JAVA (ref
) = 1;
9577 if (CLASS_TYPE_P (basetype
))
9579 base_binfo
= TYPE_BINFO (basetype
);
9580 /* This flag will be in the binfo of the base type, we must
9581 clear it after copying the base binfos. */
9582 BINFO_DEPENDENT_BASE_P (base_binfo
)
9583 = dependent_type_p (basetype
);
9586 base_binfo
= make_binfo (size_zero_node
, basetype
,
9587 NULL_TREE
, NULL_TREE
);
9589 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
9590 TREE_VEC_ELT (accesses
, i
) = access
;
9591 /* This flag will be in the binfo of the base type, we must
9592 clear it after copying the base binfos. */
9593 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
9595 SET_CLASSTYPE_MARKED (basetype
);
9597 /* We are free to modify these bits because they are meaningless
9598 at top level, and BASETYPE is a top-level type. */
9599 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
9601 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
9602 /* Converting to a virtual base class requires looking
9603 up the offset of the virtual base. */
9604 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
9607 if (CLASS_TYPE_P (basetype
))
9609 TYPE_HAS_NEW_OPERATOR (ref
)
9610 |= TYPE_HAS_NEW_OPERATOR (basetype
);
9611 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
9612 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
9613 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
9614 /* If the base-class uses multiple inheritance, so do we. */
9615 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
9616 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
9617 /* Likewise, if converting to a base of the base may require
9618 code, then we may need to generate code to convert to a
9620 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
9621 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
9626 TREE_VEC_LENGTH (accesses
) = TREE_VEC_LENGTH (binfos
) = i
;
9628 BINFO_BASEACCESSES (binfo
) = BINFO_BASETYPES (binfo
) = NULL_TREE
;
9632 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
9633 /* If there is more than one non-empty they cannot be at the same
9635 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
9639 /* Copy the base binfos, collect the virtual bases and set the
9640 inheritance order chain. */
9641 copy_base_binfos (TYPE_BINFO (ref
), ref
, NULL_TREE
);
9642 CLASSTYPE_VBASECLASSES (ref
) = nreverse (CLASSTYPE_VBASECLASSES (ref
));
9644 if (TYPE_FOR_JAVA (ref
))
9646 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
9647 error ("Java class '%T' cannot have multiple bases", ref
);
9648 if (CLASSTYPE_VBASECLASSES (ref
))
9649 error ("Java class '%T' cannot have virtual bases", ref
);
9652 /* Unmark all the types. */
9655 tree basetype
= BINFO_TYPE (BINFO_BASETYPE (TYPE_BINFO (ref
), i
));
9657 CLEAR_CLASSTYPE_MARKED (basetype
);
9658 if (CLASS_TYPE_P (basetype
))
9660 TREE_VIA_VIRTUAL (TYPE_BINFO (basetype
)) = 0;
9661 BINFO_DEPENDENT_BASE_P (TYPE_BINFO (basetype
)) = 0;
9664 CLEAR_CLASSTYPE_MARKED (ref
);
9668 /* Begin compiling the definition of an enumeration type.
9669 NAME is its name (or null if anonymous).
9670 Returns the type object, as yet incomplete.
9671 Also records info about it so that build_enumerator
9672 may be used to declare the individual values as they are read. */
9675 start_enum (tree name
)
9677 tree enumtype
= NULL_TREE
;
9678 struct cp_binding_level
*b
= current_binding_level
;
9680 /* If this is the real definition for a previous forward reference,
9681 fill in the contents in the same object that used to be the
9682 forward reference. */
9684 if (name
!= NULL_TREE
)
9685 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
9687 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
9689 error ("multiple definition of `%#T'", enumtype
);
9690 error ("%Jprevious definition here", TYPE_MAIN_DECL (enumtype
));
9691 /* Clear out TYPE_VALUES, and start again. */
9692 TYPE_VALUES (enumtype
) = NULL_TREE
;
9696 enumtype
= make_node (ENUMERAL_TYPE
);
9697 pushtag (name
, enumtype
, 0);
9703 /* After processing and defining all the values of an enumeration type,
9704 install their decls in the enumeration type and finish it off.
9705 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
9708 finish_enum (tree enumtype
)
9720 integer_type_kind itk
;
9721 tree underlying_type
= NULL_TREE
;
9723 /* We built up the VALUES in reverse order. */
9724 TYPE_VALUES (enumtype
) = nreverse (TYPE_VALUES (enumtype
));
9726 /* For an enum defined in a template, just set the type of the values;
9727 all further processing is postponed until the template is
9728 instantiated. We need to set the type so that tsubst of a CONST_DECL
9730 if (processing_template_decl
)
9732 for (values
= TYPE_VALUES (enumtype
);
9734 values
= TREE_CHAIN (values
))
9735 TREE_TYPE (TREE_VALUE (values
)) = enumtype
;
9736 if (at_function_scope_p ())
9737 add_stmt (build_min (TAG_DEFN
, enumtype
));
9741 /* Determine the minimum and maximum values of the enumerators. */
9742 if (TYPE_VALUES (enumtype
))
9744 minnode
= maxnode
= NULL_TREE
;
9746 for (values
= TYPE_VALUES (enumtype
);
9748 values
= TREE_CHAIN (values
))
9750 decl
= TREE_VALUE (values
);
9752 /* [dcl.enum]: Following the closing brace of an enum-specifier,
9753 each enumerator has the type of its enumeration. Prior to the
9754 closing brace, the type of each enumerator is the type of its
9755 initializing value. */
9756 TREE_TYPE (decl
) = enumtype
;
9758 /* Update the minimum and maximum values, if appropriate. */
9759 value
= DECL_INITIAL (decl
);
9760 /* Figure out what the minimum and maximum values of the
9763 minnode
= maxnode
= value
;
9764 else if (tree_int_cst_lt (maxnode
, value
))
9766 else if (tree_int_cst_lt (value
, minnode
))
9769 /* Set the TREE_TYPE for the values as well. That's so that when
9770 we call decl_constant_value we get an entity of the right type
9771 (but with the constant value). But first make a copy so we
9772 don't clobber shared INTEGER_CSTs. */
9773 if (TREE_TYPE (value
) != enumtype
)
9775 value
= DECL_INITIAL (decl
) = copy_node (value
);
9776 TREE_TYPE (value
) = enumtype
;
9783 If the enumerator-list is empty, the underlying type is as if
9784 the enumeration had a single enumerator with value 0. */
9785 minnode
= maxnode
= integer_zero_node
;
9787 /* Compute the number of bits require to represent all values of the
9788 enumeration. We must do this before the type of MINNODE and
9789 MAXNODE are transformed, since min_precision relies on the
9790 TREE_TYPE of the value it is passed. */
9791 unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
9792 lowprec
= min_precision (minnode
, unsignedp
);
9793 highprec
= min_precision (maxnode
, unsignedp
);
9794 precision
= MAX (lowprec
, highprec
);
9796 /* Determine the underlying type of the enumeration.
9800 The underlying type of an enumeration is an integral type that
9801 can represent all the enumerator values defined in the
9802 enumeration. It is implementation-defined which integral type is
9803 used as the underlying type for an enumeration except that the
9804 underlying type shall not be larger than int unless the value of
9805 an enumerator cannot fit in an int or unsigned int.
9807 We use "int" or an "unsigned int" as the underlying type, even if
9808 a smaller integral type would work, unless the user has
9809 explicitly requested that we use the smallest possible type. */
9810 for (itk
= (flag_short_enums
? itk_char
: itk_int
);
9814 underlying_type
= integer_types
[itk
];
9815 if (TYPE_PRECISION (underlying_type
) >= precision
9816 && TYPE_UNSIGNED (underlying_type
) == unsignedp
)
9819 if (itk
== itk_none
)
9823 IF no integral type can represent all the enumerator values, the
9824 enumeration is ill-formed. */
9825 error ("no integral type can represent all of the enumerator values "
9826 "for `%T'", enumtype
);
9827 precision
= TYPE_PRECISION (long_long_integer_type_node
);
9828 underlying_type
= integer_types
[itk_unsigned_long_long
];
9831 /* Compute the minium and maximum values for the type.
9835 For an enumeration where emin is the smallest enumerator and emax
9836 is the largest, the values of the enumeration are the values of the
9837 underlying type in the range bmin to bmax, where bmin and bmax are,
9838 respectively, the smallest and largest values of the smallest bit-
9839 field that can store emin and emax. */
9840 TYPE_PRECISION (enumtype
) = precision
;
9841 set_min_and_max_values_for_integral_type (enumtype
, precision
, unsignedp
);
9845 The value of sizeof() applied to an enumeration type, an object
9846 of an enumeration type, or an enumerator, is the value of sizeof()
9847 applied to the underlying type. */
9848 TYPE_SIZE (enumtype
) = TYPE_SIZE (underlying_type
);
9849 TYPE_SIZE_UNIT (enumtype
) = TYPE_SIZE_UNIT (underlying_type
);
9850 TYPE_MODE (enumtype
) = TYPE_MODE (underlying_type
);
9851 TYPE_ALIGN (enumtype
) = TYPE_ALIGN (underlying_type
);
9852 TYPE_USER_ALIGN (enumtype
) = TYPE_USER_ALIGN (underlying_type
);
9853 TYPE_UNSIGNED (enumtype
) = TYPE_UNSIGNED (underlying_type
);
9855 /* Convert each of the enumerators to the type of the underlying
9856 type of the enumeration. */
9857 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
9859 decl
= TREE_VALUE (values
);
9860 value
= perform_implicit_conversion (underlying_type
,
9861 DECL_INITIAL (decl
));
9862 TREE_TYPE (value
) = enumtype
;
9863 DECL_INITIAL (decl
) = value
;
9864 TREE_VALUE (values
) = value
;
9867 /* Fix up all variant types of this enum type. */
9868 for (t
= TYPE_MAIN_VARIANT (enumtype
); t
; t
= TYPE_NEXT_VARIANT (t
))
9870 TYPE_VALUES (t
) = TYPE_VALUES (enumtype
);
9871 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (enumtype
);
9872 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (enumtype
);
9873 TYPE_SIZE (t
) = TYPE_SIZE (enumtype
);
9874 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (enumtype
);
9875 TYPE_MODE (t
) = TYPE_MODE (enumtype
);
9876 TYPE_PRECISION (t
) = TYPE_PRECISION (enumtype
);
9877 TYPE_ALIGN (t
) = TYPE_ALIGN (enumtype
);
9878 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (enumtype
);
9879 TYPE_UNSIGNED (t
) = TYPE_UNSIGNED (enumtype
);
9882 /* Finish debugging output for this type. */
9883 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
9886 /* Build and install a CONST_DECL for an enumeration constant of the
9887 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
9888 Assignment of sequential values by default is handled here. */
9891 build_enumerator (tree name
, tree value
, tree enumtype
)
9897 /* Remove no-op casts from the value. */
9899 STRIP_TYPE_NOPS (value
);
9901 if (! processing_template_decl
)
9903 /* Validate and default VALUE. */
9904 if (value
!= NULL_TREE
)
9906 value
= decl_constant_value (value
);
9908 if (TREE_CODE (value
) == INTEGER_CST
)
9910 value
= perform_integral_promotions (value
);
9911 constant_expression_warning (value
);
9915 error ("enumerator value for `%D' not integer constant", name
);
9920 /* Default based on previous value. */
9921 if (value
== NULL_TREE
)
9925 if (TYPE_VALUES (enumtype
))
9927 /* The next value is the previous value ... */
9928 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
9930 value
= cp_build_binary_op (PLUS_EXPR
,
9934 if (tree_int_cst_lt (value
, prev_value
))
9935 error ("overflow in enumeration values at `%D'", name
);
9938 value
= integer_zero_node
;
9941 /* Remove no-op casts from the value. */
9942 STRIP_TYPE_NOPS (value
);
9945 /* C++ associates enums with global, function, or class declarations. */
9946 context
= current_scope ();
9948 context
= current_namespace
;
9950 /* Build the actual enumeration constant. Note that the enumeration
9951 constants have the type of their initializers until the
9952 enumeration is complete:
9956 Following the closing brace of an enum-specifier, each enumer-
9957 ator has the type of its enumeration. Prior to the closing
9958 brace, the type of each enumerator is the type of its
9961 In finish_enum we will reset the type. Of course, if we're
9962 processing a template, there may be no value. */
9963 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
9965 if (context
&& context
== current_class_type
)
9966 /* This enum declaration is local to the class. We need the full
9967 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
9968 decl
= build_lang_decl (CONST_DECL
, name
, type
);
9970 /* It's a global enum, or it's local to a function. (Note local to
9971 a function could mean local to a class method. */
9972 decl
= build_decl (CONST_DECL
, name
, type
);
9974 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
9975 TREE_CONSTANT (decl
) = 1;
9976 TREE_INVARIANT (decl
) = 1;
9977 TREE_READONLY (decl
) = 1;
9978 DECL_INITIAL (decl
) = value
;
9980 if (context
&& context
== current_class_type
)
9981 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
9982 on the TYPE_FIELDS list for `S'. (That's so that you can say
9983 things like `S::i' later.) */
9984 finish_member_declaration (decl
);
9988 /* Add this enumeration constant to the list for this type. */
9989 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
9993 /* We're defining DECL. Make sure that it's type is OK. */
9996 check_function_type (tree decl
, tree current_function_parms
)
9998 tree fntype
= TREE_TYPE (decl
);
9999 tree return_type
= complete_type (TREE_TYPE (fntype
));
10001 /* In a function definition, arg types must be complete. */
10002 require_complete_types_for_parms (current_function_parms
);
10004 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
10006 error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
10008 /* Make it return void instead, but don't change the
10009 type of the DECL_RESULT, in case we have a named return value. */
10010 if (TREE_CODE (fntype
) == METHOD_TYPE
)
10012 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
10014 = build_method_type_directly (ctype
,
10016 FUNCTION_ARG_CHAIN (decl
));
10020 = build_function_type (void_type_node
,
10021 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10023 = build_exception_variant (fntype
,
10024 TYPE_RAISES_EXCEPTIONS (fntype
));
10027 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
10030 /* Create the FUNCTION_DECL for a function definition.
10031 DECLSPECS and DECLARATOR are the parts of the declaration;
10032 they describe the function's name and the type it returns,
10033 but twisted together in a fashion that parallels the syntax of C.
10035 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
10036 DECLARATOR is really the DECL for the function we are about to
10037 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
10038 indicating that the function is an inline defined in-class.
10040 This function creates a binding context for the function body
10041 as well as setting up the FUNCTION_DECL in current_function_decl.
10043 Returns 1 on success. If the DECLARATOR is not suitable for a function
10044 (it defines a datum instead), we return 0, which tells
10045 yyparse to report a parse error.
10047 For C++, we must first check whether that datum makes any sense.
10048 For example, "class A local_a(1,2);" means that variable local_a
10049 is an aggregate of type A, which should have a constructor
10050 applied to it with the argument list [1, 2]. */
10053 start_function (tree declspecs
, tree declarator
, tree attrs
, int flags
)
10056 tree ctype
= NULL_TREE
;
10059 int doing_friend
= 0;
10060 struct cp_binding_level
*bl
;
10061 tree current_function_parms
;
10063 /* Sanity check. */
10064 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
10065 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
10067 /* This should only be done once on the top most decl. */
10068 if (have_extern_spec
)
10070 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
10071 have_extern_spec
= false;
10074 if (flags
& SF_PRE_PARSED
)
10076 decl1
= declarator
;
10078 fntype
= TREE_TYPE (decl1
);
10079 if (TREE_CODE (fntype
) == METHOD_TYPE
)
10080 ctype
= TYPE_METHOD_BASETYPE (fntype
);
10082 /* ISO C++ 11.4/5. A friend function defined in a class is in
10083 the (lexical) scope of the class in which it is defined. */
10084 if (!ctype
&& DECL_FRIEND_P (decl1
))
10086 ctype
= DECL_FRIEND_CONTEXT (decl1
);
10088 /* CTYPE could be null here if we're dealing with a template;
10089 for example, `inline friend float foo()' inside a template
10090 will have no CTYPE set. */
10091 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
10099 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, &attrs
);
10100 /* If the declarator is not suitable for a function definition,
10101 cause a syntax error. */
10102 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
)
10105 cplus_decl_attributes (&decl1
, attrs
, 0);
10107 /* If #pragma weak was used, mark the decl weak now. */
10108 if (global_scope_p (current_binding_level
))
10109 maybe_apply_pragma_weak (decl1
);
10111 fntype
= TREE_TYPE (decl1
);
10113 restype
= TREE_TYPE (fntype
);
10115 if (TREE_CODE (fntype
) == METHOD_TYPE
)
10116 ctype
= TYPE_METHOD_BASETYPE (fntype
);
10117 else if (DECL_MAIN_P (decl1
))
10119 /* If this doesn't return integer_type, or a typedef to
10120 integer_type, complain. */
10121 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl1
)), integer_type_node
))
10123 if (pedantic
|| warn_return_type
)
10124 pedwarn ("return type for `main' changed to `int'");
10125 TREE_TYPE (decl1
) = fntype
= default_function_type
;
10130 if (DECL_DECLARED_INLINE_P (decl1
)
10131 && lookup_attribute ("noinline", attrs
))
10132 warning ("%Jinline function '%D' given attribute noinline", decl1
, decl1
);
10134 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1
))
10135 /* This is a constructor, we must ensure that any default args
10136 introduced by this definition are propagated to the clones
10137 now. The clones are used directly in overload resolution. */
10138 adjust_clone_args (decl1
);
10140 /* Sometimes we don't notice that a function is a static member, and
10141 build a METHOD_TYPE for it. Fix that up now. */
10142 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
10143 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
10145 revert_static_member_fn (decl1
);
10149 /* Set up current_class_type, and enter the scope of the class, if
10152 push_nested_class (ctype
);
10153 else if (DECL_STATIC_FUNCTION_P (decl1
))
10154 push_nested_class (DECL_CONTEXT (decl1
));
10156 /* Now that we have entered the scope of the class, we must restore
10157 the bindings for any template parameters surrounding DECL1, if it
10158 is an inline member template. (Order is important; consider the
10159 case where a template parameter has the same name as a field of
10160 the class.) It is not until after this point that
10161 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
10162 if (flags
& SF_INCLASS_INLINE
)
10163 maybe_begin_member_template_processing (decl1
);
10165 /* Effective C++ rule 15. */
10167 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
10168 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
10169 warning ("`operator=' should return a reference to `*this'");
10171 /* Make the init_value nonzero so pushdecl knows this is not tentative.
10172 error_mark_node is replaced below (in poplevel) with the BLOCK. */
10173 if (!DECL_INITIAL (decl1
))
10174 DECL_INITIAL (decl1
) = error_mark_node
;
10176 /* This function exists in static storage.
10177 (This does not mean `static' in the C sense!) */
10178 TREE_STATIC (decl1
) = 1;
10180 /* We must call push_template_decl after current_class_type is set
10181 up. (If we are processing inline definitions after exiting a
10182 class scope, current_class_type will be NULL_TREE until set above
10183 by push_nested_class.) */
10184 if (processing_template_decl
)
10185 decl1
= push_template_decl (decl1
);
10187 /* We are now in the scope of the function being defined. */
10188 current_function_decl
= decl1
;
10190 /* Save the parm names or decls from this function's declarator
10191 where store_parm_decls will find them. */
10192 current_function_parms
= DECL_ARGUMENTS (decl1
);
10194 /* Make sure the parameter and return types are reasonable. When
10195 you declare a function, these types can be incomplete, but they
10196 must be complete when you define the function. */
10197 if (! processing_template_decl
)
10198 check_function_type (decl1
, current_function_parms
);
10200 /* Build the return declaration for the function. */
10201 restype
= TREE_TYPE (fntype
);
10202 /* Promote the value to int before returning it. */
10203 if (c_promoting_integer_type_p (restype
))
10204 restype
= type_promotes_to (restype
);
10205 if (DECL_RESULT (decl1
) == NULL_TREE
)
10207 DECL_RESULT (decl1
)
10208 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
10209 c_apply_type_quals_to_decl (cp_type_quals (restype
),
10210 DECL_RESULT (decl1
));
10213 /* Initialize RTL machinery. We cannot do this until
10214 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
10215 even when processing a template; this is how we get
10216 CFUN set up, and our per-function variables initialized.
10217 FIXME factor out the non-RTL stuff. */
10218 bl
= current_binding_level
;
10219 allocate_struct_function (decl1
);
10220 current_binding_level
= bl
;
10222 /* Even though we're inside a function body, we still don't want to
10223 call expand_expr to calculate the size of a variable-sized array.
10224 We haven't necessarily assigned RTL to all variables yet, so it's
10225 not safe to try to expand expressions involving them. */
10226 immediate_size_expand
= 0;
10227 cfun
->x_dont_save_pending_sizes_p
= 1;
10229 /* Start the statement-tree, start the tree now. */
10230 DECL_SAVED_TREE (decl1
) = push_stmt_list ();
10232 /* Let the user know we're compiling this function. */
10233 announce_function (decl1
);
10235 /* Record the decl so that the function name is defined.
10236 If we already have a decl for this name, and it is a FUNCTION_DECL,
10237 use the old decl. */
10238 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
10240 /* A specialization is not used to guide overload resolution. */
10241 if (!DECL_FUNCTION_MEMBER_P (decl1
)
10242 && !(DECL_USE_TEMPLATE (decl1
) &&
10243 PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl1
))))
10245 tree olddecl
= pushdecl (decl1
);
10247 if (olddecl
== error_mark_node
)
10248 /* If something went wrong when registering the declaration,
10249 use DECL1; we have to have a FUNCTION_DECL to use when
10250 parsing the body of the function. */
10253 /* Otherwise, OLDDECL is either a previous declaration of
10254 the same function or DECL1 itself. */
10259 /* We need to set the DECL_CONTEXT. */
10260 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
10261 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
10262 /* And make sure we have enough default args. */
10263 check_default_args (decl1
);
10265 fntype
= TREE_TYPE (decl1
);
10268 /* Reset these in case the call to pushdecl changed them. */
10269 current_function_decl
= decl1
;
10270 cfun
->decl
= decl1
;
10272 /* If we are (erroneously) defining a function that we have already
10273 defined before, wipe out what we knew before. */
10274 if (!DECL_PENDING_INLINE_P (decl1
))
10275 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
10277 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
10279 /* We know that this was set up by `grokclassfn'. We do not
10280 wait until `store_parm_decls', since evil parse errors may
10281 never get us to that point. Here we keep the consistency
10282 between `current_class_type' and `current_class_ptr'. */
10283 tree t
= DECL_ARGUMENTS (decl1
);
10285 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
10287 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
10290 cp_function_chain
->x_current_class_ref
10291 = build_indirect_ref (t
, NULL
);
10292 cp_function_chain
->x_current_class_ptr
= t
;
10294 /* Constructors and destructors need to know whether they're "in
10295 charge" of initializing virtual base classes. */
10296 t
= TREE_CHAIN (t
);
10297 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
10299 current_in_charge_parm
= t
;
10300 t
= TREE_CHAIN (t
);
10302 if (DECL_HAS_VTT_PARM_P (decl1
))
10304 if (DECL_NAME (t
) != vtt_parm_identifier
)
10306 current_vtt_parm
= t
;
10310 if (DECL_INTERFACE_KNOWN (decl1
))
10312 tree ctx
= decl_function_context (decl1
);
10314 if (DECL_NOT_REALLY_EXTERN (decl1
))
10315 DECL_EXTERNAL (decl1
) = 0;
10317 if (ctx
!= NULL_TREE
&& DECL_DECLARED_INLINE_P (ctx
)
10318 && TREE_PUBLIC (ctx
))
10319 /* This is a function in a local class in an extern inline
10321 comdat_linkage (decl1
);
10323 /* If this function belongs to an interface, it is public.
10324 If it belongs to someone else's interface, it is also external.
10325 This only affects inlines and template instantiations. */
10326 else if (interface_unknown
== 0
10327 && ! DECL_TEMPLATE_INSTANTIATION (decl1
))
10329 if (DECL_DECLARED_INLINE_P (decl1
)
10330 || DECL_TEMPLATE_INSTANTIATION (decl1
)
10331 || processing_template_decl
)
10333 DECL_EXTERNAL (decl1
)
10335 || (DECL_DECLARED_INLINE_P (decl1
)
10336 && ! flag_implement_inlines
10337 && !DECL_VINDEX (decl1
)));
10339 /* For WIN32 we also want to put these in linkonce sections. */
10340 maybe_make_one_only (decl1
);
10343 DECL_EXTERNAL (decl1
) = 0;
10344 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
10345 DECL_INTERFACE_KNOWN (decl1
) = 1;
10347 else if (interface_unknown
&& interface_only
10348 && ! DECL_TEMPLATE_INSTANTIATION (decl1
))
10350 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
10351 interface, we will have interface_only set but not
10352 interface_known. In that case, we don't want to use the normal
10353 heuristics because someone will supply a #pragma implementation
10354 elsewhere, and deducing it here would produce a conflict. */
10355 comdat_linkage (decl1
);
10356 DECL_EXTERNAL (decl1
) = 0;
10357 DECL_INTERFACE_KNOWN (decl1
) = 1;
10358 DECL_DEFER_OUTPUT (decl1
) = 1;
10362 /* This is a definition, not a reference.
10363 So clear DECL_EXTERNAL. */
10364 DECL_EXTERNAL (decl1
) = 0;
10366 if ((DECL_DECLARED_INLINE_P (decl1
)
10367 || DECL_TEMPLATE_INSTANTIATION (decl1
))
10368 && ! DECL_INTERFACE_KNOWN (decl1
)
10369 /* Don't try to defer nested functions for now. */
10370 && ! decl_function_context (decl1
))
10371 DECL_DEFER_OUTPUT (decl1
) = 1;
10373 DECL_INTERFACE_KNOWN (decl1
) = 1;
10376 begin_scope (sk_function_parms
, decl1
);
10380 if (DECL_DESTRUCTOR_P (decl1
))
10382 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
10383 DECL_CONTEXT (dtor_label
) = current_function_decl
;
10386 start_fname_decls ();
10388 store_parm_decls (current_function_parms
);
10393 /* Store the parameter declarations into the current function declaration.
10394 This is called after parsing the parameter declarations, before
10395 digesting the body of the function.
10397 Also install to binding contour return value identifier, if any. */
10400 store_parm_decls (tree current_function_parms
)
10402 tree fndecl
= current_function_decl
;
10405 /* This is a chain of any other decls that came in among the parm
10406 declarations. If a parm is declared with enum {foo, bar} x;
10407 then CONST_DECLs for foo and bar are put here. */
10408 tree nonparms
= NULL_TREE
;
10410 if (current_function_parms
)
10412 /* This case is when the function was defined with an ANSI prototype.
10413 The parms already have decls, so we need not do anything here
10414 except record them as in effect
10415 and complain if any redundant old-style parm decls were written. */
10417 tree specparms
= current_function_parms
;
10420 /* Must clear this because it might contain TYPE_DECLs declared
10422 current_binding_level
->names
= NULL
;
10424 /* If we're doing semantic analysis, then we'll call pushdecl
10425 for each of these. We must do them in reverse order so that
10426 they end in the correct forward order. */
10427 specparms
= nreverse (specparms
);
10429 for (parm
= specparms
; parm
; parm
= next
)
10431 next
= TREE_CHAIN (parm
);
10432 if (TREE_CODE (parm
) == PARM_DECL
)
10434 if (DECL_NAME (parm
) == NULL_TREE
10435 || TREE_CODE (parm
) != VOID_TYPE
)
10438 error ("parameter `%D' declared void", parm
);
10442 /* If we find an enum constant or a type tag,
10443 put it aside for the moment. */
10444 TREE_CHAIN (parm
) = NULL_TREE
;
10445 nonparms
= chainon (nonparms
, parm
);
10449 /* Get the decls in their original chain order and record in the
10450 function. This is all and only the PARM_DECLs that were
10451 pushed into scope by the loop above. */
10452 DECL_ARGUMENTS (fndecl
) = getdecls ();
10455 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
10457 /* Now store the final chain of decls for the arguments
10458 as the decl-chain of the current lexical scope.
10459 Put the enumerators in as well, at the front so that
10460 DECL_ARGUMENTS is not modified. */
10461 current_binding_level
->names
= chainon (nonparms
, DECL_ARGUMENTS (fndecl
));
10463 /* Do the starting of the exception specifications, if we have any. */
10464 if (flag_exceptions
&& !processing_template_decl
10465 && flag_enforce_eh_specs
10466 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
10467 current_eh_spec_block
= begin_eh_spec_block ();
10471 /* We have finished doing semantic analysis on DECL, but have not yet
10472 generated RTL for its body. Save away our current state, so that
10473 when we want to generate RTL later we know what to do. */
10476 save_function_data (tree decl
)
10478 struct language_function
*f
;
10480 /* Save the language-specific per-function data so that we can
10481 get it back when we really expand this function. */
10482 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
10486 f
= ggc_alloc (sizeof (struct language_function
));
10487 memcpy (f
, cp_function_chain
, sizeof (struct language_function
));
10488 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
10490 /* Clear out the bits we don't need. */
10491 f
->base
.x_stmt_tree
.x_cur_stmt_list
= NULL_TREE
;
10492 f
->x_named_label_uses
= NULL
;
10493 f
->bindings
= NULL
;
10494 f
->x_local_names
= NULL
;
10497 /* Add a note to mark the beginning of the main body of the constructor.
10498 This is used to set up the data structures for the cleanup regions for
10499 fully-constructed bases and members. */
10502 begin_constructor_body (void)
10506 /* Add a note to mark the end of the main body of the constructor. This is
10507 used to end the cleanup regions for fully-constructed bases and
10511 finish_constructor_body (void)
10515 /* Do all the processing for the beginning of a destructor; set up the
10516 vtable pointers and cleanups for bases and members. */
10519 begin_destructor_body (void)
10522 tree compound_stmt
;
10524 /* If the dtor is empty, and we know there is not any possible
10525 way we could use any vtable entries, before they are possibly
10526 set by a base class dtor, we don't have to setup the vtables,
10527 as we know that any base class dtor will set up any vtables
10528 it needs. We avoid MI, because one base class dtor can do a
10529 virtual dispatch to an overridden function that would need to
10530 have a non-related vtable set up, we cannot avoid setting up
10531 vtables in that case. We could change this to see if there
10532 is just one vtable.
10534 ??? In the destructor for a class, the vtables are set
10535 appropriately for that class. There will be no non-related
10536 vtables. jason 2001-12-11. */
10537 if_stmt
= begin_if_stmt ();
10539 /* If it is not safe to avoid setting up the vtables, then
10540 someone will change the condition to be boolean_true_node.
10541 (Actually, for now, we do not have code to set the condition
10542 appropriately, so we just assume that we always need to
10543 initialize the vtables.) */
10544 finish_if_stmt_cond (boolean_true_node
, if_stmt
);
10546 compound_stmt
= begin_compound_stmt (0);
10548 /* Make all virtual function table pointers in non-virtual base
10549 classes point to CURRENT_CLASS_TYPE's virtual function
10551 initialize_vtbl_ptrs (current_class_ptr
);
10553 finish_compound_stmt (compound_stmt
);
10554 finish_then_clause (if_stmt
);
10555 finish_if_stmt (if_stmt
);
10557 /* And insert cleanups for our bases and members so that they
10558 will be properly destroyed if we throw. */
10559 push_base_cleanups ();
10562 /* At the end of every destructor we generate code to delete the object if
10563 necessary. Do that now. */
10566 finish_destructor_body (void)
10570 /* Any return from a destructor will end up here; that way all base
10571 and member cleanups will be run when the function returns. */
10572 add_stmt (build_stmt (LABEL_EXPR
, dtor_label
));
10574 /* In a virtual destructor, we must call delete. */
10575 if (DECL_VIRTUAL_P (current_function_decl
))
10578 tree virtual_size
= cxx_sizeof (current_class_type
);
10582 At the point of definition of a virtual destructor (including
10583 an implicit definition), non-placement operator delete shall
10584 be looked up in the scope of the destructor's class and if
10585 found shall be accessible and unambiguous. */
10586 exprstmt
= build_op_delete_call
10587 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
10588 /*global_p=*/false, NULL_TREE
);
10590 if_stmt
= begin_if_stmt ();
10591 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
10592 current_in_charge_parm
,
10595 finish_expr_stmt (exprstmt
);
10596 finish_then_clause (if_stmt
);
10597 finish_if_stmt (if_stmt
);
10601 /* Do the necessary processing for the beginning of a function body, which
10602 in this case includes member-initializers, but not the catch clauses of
10603 a function-try-block. Currently, this means opening a binding level
10604 for the member-initializers (in a ctor) and member cleanups (in a dtor).
10605 In other functions, this isn't necessary, but it doesn't hurt. */
10608 begin_function_body (void)
10612 if (processing_template_decl
)
10613 /* Do nothing now. */;
10615 /* Always keep the BLOCK node associated with the outermost pair of
10616 curly braces of a function. These are needed for correct
10617 operation of dwarfout.c. */
10618 keep_next_level (true);
10620 stmt
= begin_compound_stmt (BCS_FN_BODY
);
10622 if (processing_template_decl
)
10623 /* Do nothing now. */;
10624 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
10625 begin_constructor_body ();
10626 else if (DECL_DESTRUCTOR_P (current_function_decl
))
10627 begin_destructor_body ();
10632 /* Do the processing for the end of a function body. Currently, this means
10633 closing out the cleanups for fully-constructed bases and members, and in
10634 the case of the destructor, deleting the object if desired. Again, this
10635 is only meaningful for [cd]tors, since they are the only functions where
10636 there is a significant distinction between the main body and any
10637 function catch clauses. Handling, say, main() return semantics here
10638 would be wrong, as flowing off the end of a function catch clause for
10639 main() would also need to return 0. */
10642 finish_function_body (tree compstmt
)
10644 /* Close the block. */
10645 finish_compound_stmt (compstmt
);
10647 if (processing_template_decl
)
10648 /* Do nothing now. */;
10649 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
10650 finish_constructor_body ();
10651 else if (DECL_DESTRUCTOR_P (current_function_decl
))
10652 finish_destructor_body ();
10655 /* Finish up a function declaration and compile that function
10656 all the way to assembler language output. The free the storage
10657 for the function definition.
10659 FLAGS is a bitwise or of the following values:
10661 We just finished processing the body of an in-class inline
10662 function definition. (This processing will have taken place
10663 after the class definition is complete.) */
10666 finish_function (int flags
)
10668 tree fndecl
= current_function_decl
;
10669 tree fntype
, ctype
= NULL_TREE
;
10670 int inclass_inline
= (flags
& 2) != 0;
10673 /* When we get some parse errors, we can end up without a
10674 current_function_decl, so cope. */
10675 if (fndecl
== NULL_TREE
)
10676 return error_mark_node
;
10678 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fndecl
)
10679 && DECL_VIRTUAL_P (fndecl
)
10680 && !processing_template_decl
)
10682 tree fnclass
= DECL_CONTEXT (fndecl
);
10683 if (fndecl
== CLASSTYPE_KEY_METHOD (fnclass
))
10684 keyed_classes
= tree_cons (NULL_TREE
, fnclass
, keyed_classes
);
10687 nested
= function_depth
> 1;
10688 fntype
= TREE_TYPE (fndecl
);
10690 /* TREE_READONLY (fndecl) = 1;
10691 This caused &foo to be of type ptr-to-const-function
10692 which then got a warning when stored in a ptr-to-function variable. */
10694 my_friendly_assert (building_stmt_tree (), 20000911);
10696 /* For a cloned function, we've already got all the code we need;
10697 there's no need to add any extra bits. */
10698 if (!DECL_CLONED_FUNCTION_P (fndecl
))
10700 if (DECL_MAIN_P (current_function_decl
))
10702 /* Make it so that `main' always returns 0 by default. */
10704 finish_return_stmt (integer_one_node
);
10706 finish_return_stmt (integer_zero_node
);
10710 /* Finish dealing with exception specifiers. */
10711 if (flag_exceptions
&& !processing_template_decl
10712 && flag_enforce_eh_specs
10713 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
10714 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
10715 (TREE_TYPE (current_function_decl
)),
10716 current_eh_spec_block
);
10719 /* If we're saving up tree structure, tie off the function now. */
10720 DECL_SAVED_TREE (fndecl
) = pop_stmt_list (DECL_SAVED_TREE (fndecl
));
10722 finish_fname_decls ();
10724 /* If this function can't throw any exceptions, remember that. */
10725 if (!processing_template_decl
10726 && !cp_function_chain
->can_throw
10727 && !flag_non_call_exceptions
)
10728 TREE_NOTHROW (fndecl
) = 1;
10730 /* This must come after expand_function_end because cleanups might
10731 have declarations (from inline functions) that need to go into
10732 this function's blocks. */
10734 /* If the current binding level isn't the outermost binding level
10735 for this function, either there is a bug, or we have experienced
10736 syntax errors and the statement tree is malformed. */
10737 if (current_binding_level
->kind
!= sk_function_parms
)
10739 /* Make sure we have already experienced errors. */
10740 if (errorcount
== 0)
10743 /* Throw away the broken statement tree and extra binding
10745 DECL_SAVED_TREE (fndecl
) = alloc_stmt_list ();
10747 while (current_binding_level
->kind
!= sk_function_parms
)
10749 if (current_binding_level
->kind
== sk_class
)
10750 pop_nested_class ();
10752 poplevel (0, 0, 0);
10755 poplevel (1, 0, 1);
10757 /* Statements should always be full-expressions at the outermost set
10758 of curly braces for a function. */
10759 my_friendly_assert (stmts_are_full_exprs_p (), 19990831);
10761 /* Set up the named return value optimization, if we can. Candidate
10762 variables are selected in check_return_value. */
10763 if (current_function_return_value
)
10765 tree r
= current_function_return_value
;
10768 if (r
!= error_mark_node
10769 /* This is only worth doing for fns that return in memory--and
10770 simpler, since we don't have to worry about promoted modes. */
10771 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
)), fndecl
)
10772 /* Only allow this for variables declared in the outer scope of
10773 the function so we know that their lifetime always ends with a
10774 return; see g++.dg/opt/nrv6.C. We could be more flexible if
10775 we were to do this optimization in tree-ssa. */
10776 && (outer
= BLOCK_SUBBLOCKS (DECL_INITIAL (fndecl
)))
10777 /* Skip the artificial function body block. */
10778 && (outer
= BLOCK_SUBBLOCKS (outer
))
10779 && chain_member (r
, BLOCK_VARS (outer
)))
10780 finalize_nrv (&DECL_SAVED_TREE (fndecl
), r
, DECL_RESULT (fndecl
));
10782 current_function_return_value
= NULL_TREE
;
10785 /* Remember that we were in class scope. */
10786 if (current_class_name
)
10787 ctype
= current_class_type
;
10789 /* Must mark the RESULT_DECL as being in this function. */
10790 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
10792 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
10793 to the FUNCTION_DECL node itself. */
10794 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
10796 /* Save away current state, if appropriate. */
10797 if (!processing_template_decl
)
10798 save_function_data (fndecl
);
10800 /* Complain if there's just no return statement. */
10801 if (warn_return_type
10802 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
10803 && !dependent_type_p (TREE_TYPE (fntype
))
10804 && !current_function_returns_value
&& !current_function_returns_null
10805 /* Don't complain if we abort or throw. */
10806 && !current_function_returns_abnormally
10807 && !DECL_NAME (DECL_RESULT (fndecl
)))
10809 /* Enable this for all functions until bug 14107 is fixed properly. */
10810 /* Normally, with -Wreturn-type, flow will complain. Unless we're an
10811 inline function, as we might never be compiled separately. */
10812 && (DECL_INLINE (fndecl
) || processing_template_decl
))
10814 warning ("no return statement in function returning non-void");
10816 /* Store the end of the function, so that we get good line number
10817 info for the epilogue. */
10818 cfun
->function_end_locus
= input_location
;
10820 /* Genericize before inlining. */
10821 if (!processing_template_decl
)
10823 c_genericize (fndecl
);
10825 /* Handle attribute((warn_unused_result)). Relies on gimple input. */
10826 c_warn_unused_result (&DECL_SAVED_TREE (fndecl
));
10829 /* We're leaving the context of this function, so zap cfun. It's still in
10830 DECL_STRUCT_FUNCTION, and we'll restore it in tree_rest_of_compilation. */
10832 current_function_decl
= NULL
;
10834 /* If this is an in-class inline definition, we may have to pop the
10835 bindings for the template parameters that we added in
10836 maybe_begin_member_template_processing when start_function was
10838 if (inclass_inline
)
10839 maybe_end_member_template_processing ();
10841 /* Leave the scope of the class. */
10843 pop_nested_class ();
10849 /* Let the error reporting routines know that we're outside a
10850 function. For a nested function, this value is used in
10851 cxx_pop_function_context and then reset via pop_function_context. */
10852 current_function_decl
= NULL_TREE
;
10857 /* Create the FUNCTION_DECL for a function definition.
10858 DECLSPECS and DECLARATOR are the parts of the declaration;
10859 they describe the return type and the name of the function,
10860 but twisted together in a fashion that parallels the syntax of C.
10862 This function creates a binding context for the function body
10863 as well as setting up the FUNCTION_DECL in current_function_decl.
10865 Returns a FUNCTION_DECL on success.
10867 If the DECLARATOR is not suitable for a function (it defines a datum
10868 instead), we return 0, which tells yyparse to report a parse error.
10870 May return void_type_node indicating that this method is actually
10871 a friend. See grokfield for more details.
10873 Came here with a `.pushlevel' .
10875 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
10876 CHANGES TO CODE IN `grokfield'. */
10879 start_method (tree declspecs
, tree declarator
, tree attrlist
)
10881 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
10884 if (fndecl
== error_mark_node
)
10885 return error_mark_node
;
10887 if (fndecl
== NULL
|| TREE_CODE (fndecl
) != FUNCTION_DECL
)
10889 error ("invalid member function declaration");
10890 return error_mark_node
;
10894 cplus_decl_attributes (&fndecl
, attrlist
, 0);
10896 /* Pass friends other than inline friend functions back. */
10897 if (fndecl
== void_type_node
)
10900 if (DECL_IN_AGGR_P (fndecl
))
10902 if (DECL_CONTEXT (fndecl
)
10903 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
10904 error ("`%D' is already defined in class `%T'", fndecl
,
10905 DECL_CONTEXT (fndecl
));
10906 return void_type_node
;
10909 check_template_shadow (fndecl
);
10911 DECL_DECLARED_INLINE_P (fndecl
) = 1;
10912 if (flag_default_inline
)
10913 DECL_INLINE (fndecl
) = 1;
10915 /* We process method specializations in finish_struct_1. */
10916 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
10918 fndecl
= push_template_decl (fndecl
);
10919 if (fndecl
== error_mark_node
)
10923 if (! DECL_FRIEND_P (fndecl
))
10925 if (TREE_CHAIN (fndecl
))
10927 fndecl
= copy_node (fndecl
);
10928 TREE_CHAIN (fndecl
) = NULL_TREE
;
10930 grok_special_member_properties (fndecl
);
10933 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
10935 /* Make a place for the parms. */
10936 begin_scope (sk_function_parms
, fndecl
);
10938 DECL_IN_AGGR_P (fndecl
) = 1;
10942 /* Go through the motions of finishing a function definition.
10943 We don't compile this method until after the whole class has
10946 FINISH_METHOD must return something that looks as though it
10947 came from GROKFIELD (since we are defining a method, after all).
10949 This is called after parsing the body of the function definition.
10950 STMTS is the chain of statements that makes up the function body.
10952 DECL is the ..._DECL that `start_method' provided. */
10955 finish_method (tree decl
)
10957 tree fndecl
= decl
;
10962 if (decl
== void_type_node
)
10965 old_initial
= DECL_INITIAL (fndecl
);
10967 /* Undo the level for the parms (from start_method).
10968 This is like poplevel, but it causes nothing to be
10969 saved. Saving information here confuses symbol-table
10970 output routines. Besides, this information will
10971 be correctly output when this method is actually
10974 /* Clear out the meanings of the local variables of this level;
10975 also record in each decl which block it belongs to. */
10977 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
10979 if (DECL_NAME (link
) != NULL_TREE
)
10980 pop_binding (DECL_NAME (link
), link
);
10981 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
10982 DECL_CONTEXT (link
) = NULL_TREE
;
10985 poplevel (0, 0, 0);
10987 DECL_INITIAL (fndecl
) = old_initial
;
10989 /* We used to check if the context of FNDECL was different from
10990 current_class_type as another way to get inside here. This didn't work
10991 for String.cc in libg++. */
10992 if (DECL_FRIEND_P (fndecl
))
10994 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
10995 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
10996 decl
= void_type_node
;
11003 /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that
11004 we can lay it out later, when and if its type becomes complete. */
11007 maybe_register_incomplete_var (tree var
)
11009 my_friendly_assert (TREE_CODE (var
) == VAR_DECL
, 20020406);
11011 /* Keep track of variables with incomplete types. */
11012 if (!processing_template_decl
&& TREE_TYPE (var
) != error_mark_node
11013 && DECL_EXTERNAL (var
))
11015 tree inner_type
= TREE_TYPE (var
);
11017 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
11018 inner_type
= TREE_TYPE (inner_type
);
11019 inner_type
= TYPE_MAIN_VARIANT (inner_type
);
11021 if ((!COMPLETE_TYPE_P (inner_type
) && CLASS_TYPE_P (inner_type
))
11022 /* RTTI TD entries are created while defining the type_info. */
11023 || (TYPE_LANG_SPECIFIC (inner_type
)
11024 && TYPE_BEING_DEFINED (inner_type
)))
11025 incomplete_vars
= tree_cons (inner_type
, var
, incomplete_vars
);
11029 /* Called when a class type (given by TYPE) is defined. If there are
11030 any existing VAR_DECLs whose type hsa been completed by this
11031 declaration, update them now. */
11034 complete_vars (tree type
)
11036 tree
*list
= &incomplete_vars
;
11038 my_friendly_assert (CLASS_TYPE_P (type
), 20020406);
11041 if (same_type_p (type
, TREE_PURPOSE (*list
)))
11043 tree var
= TREE_VALUE (*list
);
11044 /* Complete the type of the variable. The VAR_DECL itself
11045 will be laid out in expand_expr. */
11046 complete_type (TREE_TYPE (var
));
11047 /* Remove this entry from the list. */
11048 *list
= TREE_CHAIN (*list
);
11051 list
= &TREE_CHAIN (*list
);
11055 /* If DECL is of a type which needs a cleanup, build that cleanup
11059 cxx_maybe_build_cleanup (tree decl
)
11061 tree type
= TREE_TYPE (decl
);
11063 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11065 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
11068 if (TREE_CODE (type
) == ARRAY_TYPE
)
11072 cxx_mark_addressable (decl
);
11073 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
11076 /* Optimize for space over speed here. */
11077 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
11078 || flag_expensive_optimizations
)
11079 flags
|= LOOKUP_NONVIRTUAL
;
11081 rval
= build_delete (TREE_TYPE (rval
), rval
,
11082 sfk_complete_destructor
, flags
, 0);
11084 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
11085 && ! TYPE_HAS_DESTRUCTOR (type
))
11086 rval
= build_compound_expr (rval
, build_vbase_delete (type
, decl
));
11093 /* When a stmt has been parsed, this function is called. */
11100 /* DECL was originally constructed as a non-static member function,
11101 but turned out to be static. Update it accordingly. */
11104 revert_static_member_fn (tree decl
)
11107 tree function
= TREE_TYPE (decl
);
11108 tree args
= TYPE_ARG_TYPES (function
);
11110 if (cp_type_quals (TREE_TYPE (TREE_VALUE (args
)))
11111 != TYPE_UNQUALIFIED
)
11112 error ("static member function `%#D' declared with type qualifiers",
11115 args
= TREE_CHAIN (args
);
11116 tmp
= build_function_type (TREE_TYPE (function
), args
);
11117 tmp
= build_qualified_type (tmp
, cp_type_quals (function
));
11118 tmp
= build_exception_variant (tmp
,
11119 TYPE_RAISES_EXCEPTIONS (function
));
11120 TREE_TYPE (decl
) = tmp
;
11121 if (DECL_ARGUMENTS (decl
))
11122 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
11123 DECL_STATIC_FUNCTION_P (decl
) = 1;
11126 /* Initialize the variables used during compilation of a C++
11130 cxx_push_function_context (struct function
* f
)
11132 struct language_function
*p
11133 = ggc_alloc_cleared (sizeof (struct language_function
));
11136 /* Whenever we start a new function, we destroy temporaries in the
11138 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
11144 if (DECL_SAVED_FUNCTION_DATA (fn
))
11146 /* If we already parsed this function, and we're just expanding it
11147 now, restore saved state. */
11148 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (fn
);
11150 /* We don't need the saved data anymore. Unless this is an inline
11151 function; we need the named return value info for
11152 cp_copy_res_decl_for_inlining. */
11153 if (! DECL_INLINE (fn
))
11154 DECL_SAVED_FUNCTION_DATA (fn
) = NULL
;
11159 /* Free the language-specific parts of F, now that we've finished
11160 compiling the function. */
11163 cxx_pop_function_context (struct function
* f
)
11168 /* Return which tree structure is used by T, or TS_CP_GENERIC if T is
11169 one of the language-independent trees. */
11171 enum cp_tree_node_structure_enum
11172 cp_tree_node_structure (union lang_tree_node
* t
)
11174 switch (TREE_CODE (&t
->generic
))
11176 case DEFAULT_ARG
: return TS_CP_DEFAULT_ARG
;
11177 case IDENTIFIER_NODE
: return TS_CP_IDENTIFIER
;
11178 case OVERLOAD
: return TS_CP_OVERLOAD
;
11179 case TEMPLATE_PARM_INDEX
: return TS_CP_TPI
;
11180 case PTRMEM_CST
: return TS_CP_PTRMEM
;
11181 case BASELINK
: return TS_CP_BASELINK
;
11182 default: return TS_CP_GENERIC
;
11186 /* Build the void_list_node (void_type_node having been created). */
11188 build_void_list_node (void)
11190 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
11191 TREE_PARMLIST (t
) = 1;
11196 cp_missing_noreturn_ok_p (tree decl
)
11198 /* A missing noreturn is ok for the `main' function. */
11199 return DECL_MAIN_P (decl
);
11202 #include "gt-cp-decl.h"
11203 #include "gtype-cp.h"