1 /* Handle the hair of processing (but not expanding) inline functions.
2 Also manage function and variable name overloading.
3 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
4 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
25 /* Handle method declarations. */
28 #include "coretypes.h"
40 /* Various flags to control the mangling process. */
46 /* The thing we are presently mangling is part of a template type,
47 rather than a fully instantiated type. Therefore, we may see
48 complex expressions where we would normally expect to see a
49 simple integer constant. */
50 mf_maybe_uninstantiated = 1,
51 /* When mangling a numeric value, use the form `_XX_' (instead of
52 just `XX') if the value has more than one digit. */
53 mf_use_underscores_around_value = 2
56 typedef enum mangling_flags mangling_flags;
58 static tree thunk_adjust (tree, bool, HOST_WIDE_INT, tree);
59 static void do_build_assign_ref (tree);
60 static void do_build_copy_constructor (tree);
61 static tree synthesize_exception_spec (tree, tree (*) (tree, void *), void *);
62 static tree locate_dtor (tree, void *);
63 static tree locate_ctor (tree, void *);
64 static tree locate_copy (tree, void *);
66 static tree make_alias_for_thunk (tree);
69 /* Called once to initialize method.c. */
78 /* Set the mangled name (DECL_ASSEMBLER_NAME) for DECL. */
81 set_mangled_name_for_decl (tree decl)
83 if (processing_template_decl)
84 /* There's no need to mangle the name of a template function. */
91 /* Return a this or result adjusting thunk to FUNCTION. THIS_ADJUSTING
92 indicates whether it is a this or result adjusting thunk.
93 FIXED_OFFSET and VIRTUAL_OFFSET indicate how to do the adjustment
94 (see thunk_adjust). VIRTUAL_OFFSET can be NULL, but FIXED_OFFSET
95 never is. VIRTUAL_OFFSET is the /index/ into the vtable for this
96 adjusting thunks, we scale it to a byte offset. For covariant
97 thunks VIRTUAL_OFFSET is the virtual binfo. You must post process
98 the returned thunk with finish_thunk. */
101 make_thunk (tree function, bool this_adjusting,
102 tree fixed_offset, tree virtual_offset)
107 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 20021025);
108 /* We can have this thunks to covariant thunks, but not vice versa. */
109 my_friendly_assert (!DECL_THIS_THUNK_P (function), 20021127);
110 my_friendly_assert (!DECL_RESULT_THUNK_P (function) || this_adjusting,
113 /* Scale the VIRTUAL_OFFSET to be in terms of bytes. */
114 if (this_adjusting && virtual_offset)
116 = size_binop (MULT_EXPR,
119 TYPE_SIZE_UNIT (vtable_entry_type)));
121 d = tree_low_cst (fixed_offset, 0);
123 /* See if we already have the thunk in question. For this_adjusting
124 thunks VIRTUAL_OFFSET will be an INTEGER_CST, for covariant thunks it
126 for (thunk = DECL_THUNKS (function); thunk; thunk = TREE_CHAIN (thunk))
127 if (DECL_THIS_THUNK_P (thunk) == this_adjusting
128 && THUNK_FIXED_OFFSET (thunk) == d
130 ? (!THUNK_VIRTUAL_OFFSET (thunk) == !virtual_offset
132 || tree_int_cst_equal (THUNK_VIRTUAL_OFFSET (thunk),
134 : THUNK_VIRTUAL_OFFSET (thunk) == virtual_offset))
137 /* All thunks must be created before FUNCTION is actually emitted;
138 the ABI requires that all thunks be emitted together with the
139 function to which they transfer control. */
140 my_friendly_assert (!TREE_ASM_WRITTEN (function), 20021025);
142 thunk = build_decl (FUNCTION_DECL, NULL_TREE, TREE_TYPE (function));
143 DECL_LANG_SPECIFIC (thunk) = DECL_LANG_SPECIFIC (function);
144 cxx_dup_lang_specific_decl (thunk);
145 DECL_THUNKS (thunk) = NULL_TREE;
147 DECL_CONTEXT (thunk) = DECL_CONTEXT (function);
148 TREE_READONLY (thunk) = TREE_READONLY (function);
149 TREE_THIS_VOLATILE (thunk) = TREE_THIS_VOLATILE (function);
150 TREE_PUBLIC (thunk) = TREE_PUBLIC (function);
152 comdat_linkage (thunk);
153 SET_DECL_THUNK_P (thunk, this_adjusting);
154 THUNK_TARGET (thunk) = function;
155 THUNK_FIXED_OFFSET (thunk) = d;
156 THUNK_VIRTUAL_OFFSET (thunk) = virtual_offset;
158 /* The thunk itself is not a constructor or destructor, even if
159 the thing it is thunking to is. */
160 DECL_INTERFACE_KNOWN (thunk) = 1;
161 DECL_NOT_REALLY_EXTERN (thunk) = 1;
162 DECL_SAVED_FUNCTION_DATA (thunk) = NULL;
163 DECL_DESTRUCTOR_P (thunk) = 0;
164 DECL_CONSTRUCTOR_P (thunk) = 0;
165 /* And neither is it a clone. */
166 DECL_CLONED_FUNCTION (thunk) = NULL_TREE;
167 DECL_EXTERNAL (thunk) = 1;
168 DECL_ARTIFICIAL (thunk) = 1;
169 /* Even if this thunk is a member of a local class, we don't
170 need a static chain. */
171 DECL_NO_STATIC_CHAIN (thunk) = 1;
172 /* The THUNK is not a pending inline, even if the FUNCTION is. */
173 DECL_PENDING_INLINE_P (thunk) = 0;
174 DECL_INLINE (thunk) = 0;
175 DECL_DECLARED_INLINE_P (thunk) = 0;
176 /* Nor has it been deferred. */
177 DECL_DEFERRED_FN (thunk) = 0;
179 /* Add it to the list of thunks associated with FUNCTION. */
180 TREE_CHAIN (thunk) = DECL_THUNKS (function);
181 DECL_THUNKS (function) = thunk;
186 /* Finish THUNK, a thunk decl. */
189 finish_thunk (tree thunk)
192 tree fixed_offset = ssize_int (THUNK_FIXED_OFFSET (thunk));
193 tree virtual_offset = THUNK_VIRTUAL_OFFSET (thunk);
195 my_friendly_assert (!DECL_NAME (thunk) && DECL_THUNK_P (thunk), 20021127);
196 if (virtual_offset && DECL_RESULT_THUNK_P (thunk))
197 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
198 function = THUNK_TARGET (thunk);
199 name = mangle_thunk (function, DECL_THIS_THUNK_P (thunk),
200 fixed_offset, virtual_offset);
202 /* We can end up with declarations of (logically) different
203 covariant thunks, that do identical adjustments. The two thunks
204 will be adjusting between within different hierarchies, which
205 happen to have the same layout. We must nullify one of them to
206 refer to the other. */
207 if (DECL_RESULT_THUNK_P (thunk))
211 for (cov_probe = DECL_THUNKS (function);
212 cov_probe; cov_probe = TREE_CHAIN (cov_probe))
213 if (DECL_NAME (cov_probe) == name)
215 my_friendly_assert (!DECL_THUNKS (thunk), 20031023);
216 THUNK_ALIAS (thunk) = (THUNK_ALIAS_P (cov_probe)
217 ? THUNK_ALIAS (cov_probe) : cov_probe);
222 DECL_NAME (thunk) = name;
223 SET_DECL_ASSEMBLER_NAME (thunk, name);
226 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
227 offset indicated by VIRTUAL_OFFSET, if that is
228 non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and
229 zero for a result adjusting thunk. */
232 thunk_adjust (tree ptr, bool this_adjusting,
233 HOST_WIDE_INT fixed_offset, tree virtual_offset)
236 /* Adjust the pointer by the constant. */
237 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
238 ssize_int (fixed_offset)));
240 /* If there's a virtual offset, look up that value in the vtable and
241 adjust the pointer again. */
246 ptr = save_expr (ptr);
247 /* The vptr is always at offset zero in the object. */
248 vtable = build1 (NOP_EXPR,
249 build_pointer_type (build_pointer_type
250 (vtable_entry_type)),
252 /* Form the vtable address. */
253 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
254 /* Find the entry with the vcall offset. */
255 vtable = build (PLUS_EXPR, TREE_TYPE (vtable), vtable, virtual_offset);
256 /* Get the offset itself. */
257 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
258 /* Adjust the `this' pointer. */
259 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr, vtable));
263 /* Adjust the pointer by the constant. */
264 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
265 ssize_int (fixed_offset)));
270 /* Garbage collector tables contains thunk_labelno even when places
271 inside ifdef block. */
272 static GTY (()) int thunk_labelno;
273 #ifdef ASM_OUTPUT_DEF
275 /* Create a static alias to function. */
278 make_alias_for_thunk (tree function)
283 ASM_GENERATE_INTERNAL_LABEL (buf, "LTHUNK", thunk_labelno);
285 alias = build_decl (FUNCTION_DECL, get_identifier (buf),
286 TREE_TYPE (function));
287 DECL_LANG_SPECIFIC (alias) = DECL_LANG_SPECIFIC (function);
288 cxx_dup_lang_specific_decl (alias);
289 DECL_CONTEXT (alias) = NULL;
290 TREE_READONLY (alias) = TREE_READONLY (function);
291 TREE_THIS_VOLATILE (alias) = TREE_THIS_VOLATILE (function);
292 TREE_PUBLIC (alias) = 0;
293 DECL_INTERFACE_KNOWN (alias) = 1;
294 DECL_NOT_REALLY_EXTERN (alias) = 1;
295 DECL_THIS_STATIC (alias) = 1;
296 DECL_SAVED_FUNCTION_DATA (alias) = NULL;
297 DECL_DESTRUCTOR_P (alias) = 0;
298 DECL_CONSTRUCTOR_P (alias) = 0;
299 DECL_CLONED_FUNCTION (alias) = NULL_TREE;
300 DECL_EXTERNAL (alias) = 0;
301 DECL_ARTIFICIAL (alias) = 1;
302 DECL_NO_STATIC_CHAIN (alias) = 1;
303 DECL_PENDING_INLINE_P (alias) = 0;
304 DECL_INLINE (alias) = 0;
305 DECL_DECLARED_INLINE_P (alias) = 0;
306 DECL_DEFERRED_FN (alias) = 0;
307 DECL_USE_TEMPLATE (alias) = 0;
308 DECL_TEMPLATE_INSTANTIATED (alias) = 0;
309 DECL_TEMPLATE_INFO (alias) = NULL;
310 DECL_INITIAL (alias) = error_mark_node;
311 TREE_ADDRESSABLE (alias) = 1;
312 TREE_USED (alias) = 1;
313 SET_DECL_ASSEMBLER_NAME (alias, DECL_NAME (alias));
314 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias)) = 1;
315 if (!flag_syntax_only)
316 assemble_alias (alias, DECL_ASSEMBLER_NAME (function));
321 /* Emit the definition of a C++ multiple inheritance or covariant
322 return vtable thunk. If EMIT_P is nonzero, the thunk is emitted
326 use_thunk (tree thunk_fndecl, bool emit_p)
328 tree function, alias;
330 HOST_WIDE_INT fixed_offset, virtual_value;
331 bool this_adjusting = DECL_THIS_THUNK_P (thunk_fndecl);
333 /* We should have called finish_thunk to give it a name. */
334 my_friendly_assert (DECL_NAME (thunk_fndecl), 20021127);
336 /* We should never be using an alias, always refer to the
338 my_friendly_assert (!THUNK_ALIAS_P (thunk_fndecl), 20031023);
340 if (TREE_ASM_WRITTEN (thunk_fndecl))
343 function = THUNK_TARGET (thunk_fndecl);
344 if (DECL_RESULT (thunk_fndecl))
345 /* We already turned this thunk into an ordinary function.
346 There's no need to process this thunk again. */
349 /* Thunks are always addressable; they only appear in vtables. */
350 TREE_ADDRESSABLE (thunk_fndecl) = 1;
352 /* Figure out what function is being thunked to. It's referenced in
353 this translation unit. */
354 TREE_ADDRESSABLE (function) = 1;
355 mark_used (function);
356 mark_referenced (DECL_ASSEMBLER_NAME (function));
360 #ifdef ASM_OUTPUT_DEF
361 alias = make_alias_for_thunk (function);
366 fixed_offset = THUNK_FIXED_OFFSET (thunk_fndecl);
367 virtual_offset = THUNK_VIRTUAL_OFFSET (thunk_fndecl);
372 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
373 virtual_value = tree_low_cst (virtual_offset, /*pos=*/0);
374 my_friendly_assert (virtual_value, 20021026);
379 /* And, if we need to emit the thunk, it's used. */
380 mark_used (thunk_fndecl);
381 /* This thunk is actually defined. */
382 DECL_EXTERNAL (thunk_fndecl) = 0;
383 /* The linkage of the function may have changed. FIXME in linkage
385 TREE_PUBLIC (thunk_fndecl) = TREE_PUBLIC (function);
387 if (flag_syntax_only)
389 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
393 push_to_top_level ();
395 #ifdef ASM_OUTPUT_DEF
396 if (targetm.have_named_sections)
398 resolve_unique_section (function, 0, flag_function_sections);
400 if (DECL_SECTION_NAME (function) != NULL && DECL_ONE_ONLY (function))
402 resolve_unique_section (thunk_fndecl, 0, flag_function_sections);
404 /* Output the thunk into the same section as function. */
405 DECL_SECTION_NAME (thunk_fndecl) = DECL_SECTION_NAME (function);
410 /* The back-end expects DECL_INITIAL to contain a BLOCK, so we
412 DECL_INITIAL (thunk_fndecl) = make_node (BLOCK);
413 BLOCK_VARS (DECL_INITIAL (thunk_fndecl)) = DECL_ARGUMENTS (thunk_fndecl);
416 && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset,
417 virtual_value, alias))
420 current_function_decl = thunk_fndecl;
421 DECL_RESULT (thunk_fndecl)
422 = build_decl (RESULT_DECL, 0, integer_type_node);
423 fnname = XSTR (XEXP (DECL_RTL (thunk_fndecl), 0), 0);
424 init_function_start (thunk_fndecl);
425 current_function_is_thunk = 1;
426 assemble_start_function (thunk_fndecl, fnname);
428 targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl,
429 fixed_offset, virtual_value, alias);
431 assemble_end_function (thunk_fndecl, fnname);
432 current_function_decl = 0;
434 /* Because init_function_start increments this, we must
436 immediate_size_expand--;
437 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
441 /* If this is a covariant thunk, or we don't have the necessary
442 code for efficient thunks, generate a thunk function that
443 just makes a call to the real function. Unfortunately, this
444 doesn't work for varargs. */
448 if (varargs_function_p (function))
449 error ("generic thunk code fails for method `%#D' which uses `...'",
452 /* Set up cloned argument trees for the thunk. */
454 for (a = DECL_ARGUMENTS (function); a; a = TREE_CHAIN (a))
456 tree x = copy_node (a);
458 DECL_CONTEXT (x) = thunk_fndecl;
459 SET_DECL_RTL (x, NULL_RTX);
463 DECL_ARGUMENTS (thunk_fndecl) = a;
464 DECL_RESULT (thunk_fndecl) = NULL_TREE;
466 start_function (NULL_TREE, thunk_fndecl, NULL_TREE, SF_PRE_PARSED);
467 /* We don't bother with a body block for thunks. */
469 /* There's no need to check accessibility inside the thunk body. */
470 push_deferring_access_checks (dk_no_check);
474 t = thunk_adjust (t, /*this_adjusting=*/1,
475 fixed_offset, virtual_offset);
477 /* Build up the call to the real function. */
478 t = tree_cons (NULL_TREE, t, NULL_TREE);
479 for (a = TREE_CHAIN (a); a; a = TREE_CHAIN (a))
480 t = tree_cons (NULL_TREE, a, t);
482 t = build_call (alias, t);
484 t = thunk_adjust (t, /*this_adjusting=*/0,
485 fixed_offset, virtual_offset);
487 if (VOID_TYPE_P (TREE_TYPE (t)))
488 finish_expr_stmt (t);
490 finish_return_stmt (t);
492 /* Since we want to emit the thunk, we explicitly mark its name as
494 mark_referenced (DECL_ASSEMBLER_NAME (thunk_fndecl));
496 /* But we don't want debugging information about it. */
497 DECL_IGNORED_P (thunk_fndecl) = 1;
499 /* Re-enable access control. */
500 pop_deferring_access_checks ();
502 expand_body (finish_function (0));
505 pop_from_top_level ();
508 /* Code for synthesizing methods which have default semantics defined. */
510 /* Generate code for default X(X&) constructor. */
513 do_build_copy_constructor (tree fndecl)
515 tree parm = FUNCTION_FIRST_USER_PARM (fndecl);
518 parm = convert_from_reference (parm);
520 if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type)
521 && is_empty_class (current_class_type))
522 /* Don't copy the padding byte; it might not have been allocated
523 if *this is a base subobject. */;
524 else if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type))
526 t = build (INIT_EXPR, void_type_node, current_class_ref, parm);
527 finish_expr_stmt (t);
531 tree fields = TYPE_FIELDS (current_class_type);
532 int n_bases = CLASSTYPE_N_BASECLASSES (current_class_type);
533 tree binfos = TYPE_BINFO_BASETYPES (current_class_type);
534 tree member_init_list = NULL_TREE;
535 int cvquals = cp_type_quals (TREE_TYPE (parm));
538 /* Initialize all the base-classes with the parameter converted
539 to their type so that we get their copy constructor and not
540 another constructor that takes current_class_type. We must
541 deal with the binfo's directly as a direct base might be
542 inaccessible due to ambiguity. */
543 for (t = CLASSTYPE_VBASECLASSES (current_class_type); t;
546 tree binfo = TREE_VALUE (t);
550 build_tree_list (NULL_TREE,
551 build_base_path (PLUS_EXPR, parm,
556 for (i = 0; i < n_bases; ++i)
558 tree binfo = TREE_VEC_ELT (binfos, i);
559 if (TREE_VIA_VIRTUAL (binfo))
564 build_tree_list (NULL_TREE,
565 build_base_path (PLUS_EXPR, parm,
570 for (; fields; fields = TREE_CHAIN (fields))
576 if (TREE_CODE (field) != FIELD_DECL)
580 if (DECL_NAME (field))
582 if (VFIELD_NAME_P (DECL_NAME (field)))
585 /* True for duplicate members. */
586 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
589 else if ((t = TREE_TYPE (field)) != NULL_TREE
590 && ANON_AGGR_TYPE_P (t)
591 && TYPE_FIELDS (t) != NULL_TREE)
592 /* Just use the field; anonymous types can't have
593 nontrivial copy ctors or assignment ops. */;
597 /* Compute the type of "init->field". If the copy-constructor
598 parameter is, for example, "const S&", and the type of
599 the field is "T", then the type will usually be "const
600 T". (There are no cv-qualified variants of reference
602 expr_type = TREE_TYPE (field);
603 if (TREE_CODE (expr_type) != REFERENCE_TYPE)
604 expr_type = cp_build_qualified_type (expr_type, cvquals);
605 init = build (COMPONENT_REF, expr_type, init, field);
606 init = build_tree_list (NULL_TREE, init);
609 = tree_cons (field, init, member_init_list);
611 finish_mem_initializers (member_init_list);
616 do_build_assign_ref (tree fndecl)
618 tree parm = TREE_CHAIN (DECL_ARGUMENTS (fndecl));
621 compound_stmt = begin_compound_stmt (/*has_no_scope=*/false);
622 parm = convert_from_reference (parm);
624 if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type)
625 && is_empty_class (current_class_type))
626 /* Don't copy the padding byte; it might not have been allocated
627 if *this is a base subobject. */;
628 else if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type))
630 tree t = build (MODIFY_EXPR, void_type_node, current_class_ref, parm);
631 finish_expr_stmt (t);
636 int cvquals = cp_type_quals (TREE_TYPE (parm));
639 /* Assign to each of the direct base classes. */
640 for (i = 0; i < CLASSTYPE_N_BASECLASSES (current_class_type); ++i)
645 binfo = BINFO_BASETYPE (TYPE_BINFO (current_class_type), i);
646 /* We must convert PARM directly to the base class
647 explicitly since the base class may be ambiguous. */
648 converted_parm = build_base_path (PLUS_EXPR, parm, binfo, 1);
649 /* Call the base class assignment operator. */
651 (build_special_member_call (current_class_ref,
652 ansi_assopname (NOP_EXPR),
653 build_tree_list (NULL_TREE,
656 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL));
659 /* Assign to each of the non-static data members. */
660 for (fields = TYPE_FIELDS (current_class_type);
662 fields = TREE_CHAIN (fields))
667 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
670 if (CP_TYPE_CONST_P (TREE_TYPE (field)))
672 error ("non-static const member `%#D', can't use default assignment operator", field);
675 else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE)
677 error ("non-static reference member `%#D', can't use default assignment operator", field);
681 comp = current_class_ref;
684 if (DECL_NAME (field))
686 if (VFIELD_NAME_P (DECL_NAME (field)))
689 /* True for duplicate members. */
690 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
693 else if ((t = TREE_TYPE (field)) != NULL_TREE
694 && ANON_AGGR_TYPE_P (t)
695 && TYPE_FIELDS (t) != NULL_TREE)
696 /* Just use the field; anonymous types can't have
697 nontrivial copy ctors or assignment ops. */;
701 comp = build (COMPONENT_REF, TREE_TYPE (field), comp, field);
702 init = build (COMPONENT_REF,
703 cp_build_qualified_type (TREE_TYPE (field), cvquals),
706 if (DECL_NAME (field))
707 finish_expr_stmt (build_modify_expr (comp, NOP_EXPR, init));
709 finish_expr_stmt (build (MODIFY_EXPR, TREE_TYPE (comp), comp,
713 finish_return_stmt (current_class_ref);
714 finish_compound_stmt (compound_stmt);
718 synthesize_method (tree fndecl)
720 bool nested = (current_function_decl != NULL_TREE);
721 tree context = decl_function_context (fndecl);
722 bool need_body = true;
726 import_export_decl (fndecl);
728 /* If we've been asked to synthesize a clone, just synthesize the
729 cloned function instead. Doing so will automatically fill in the
730 body for the clone. */
731 if (DECL_CLONED_FUNCTION_P (fndecl))
733 synthesize_method (DECL_CLONED_FUNCTION (fndecl));
737 /* We may be in the middle of deferred access check. Disable
739 push_deferring_access_checks (dk_no_deferred);
742 push_to_top_level ();
744 push_function_context_to (context);
746 /* Put the function definition at the position where it is needed,
747 rather than within the body of the class. That way, an error
748 during the generation of the implicit body points at the place
749 where the attempt to generate the function occurs, giving the
750 user a hint as to why we are attempting to generate the
752 DECL_SOURCE_LOCATION (fndecl) = input_location;
754 interface_unknown = 1;
755 start_function (NULL_TREE, fndecl, NULL_TREE, SF_DEFAULT | SF_PRE_PARSED);
757 stmt = begin_function_body ();
759 if (DECL_OVERLOADED_OPERATOR_P (fndecl) == NOP_EXPR)
761 do_build_assign_ref (fndecl);
764 else if (DECL_CONSTRUCTOR_P (fndecl))
766 tree arg_chain = FUNCTION_FIRST_USER_PARMTYPE (fndecl);
767 if (arg_chain != void_list_node)
768 do_build_copy_constructor (fndecl);
769 else if (TYPE_NEEDS_CONSTRUCTING (current_class_type))
770 finish_mem_initializers (NULL_TREE);
773 /* If we haven't yet generated the body of the function, just
774 generate an empty compound statement. */
778 compound_stmt = begin_compound_stmt (/*has_no_scope=*/false);
779 finish_compound_stmt (compound_stmt);
782 finish_function_body (stmt);
783 expand_or_defer_fn (finish_function (0));
785 extract_interface_info ();
787 pop_from_top_level ();
789 pop_function_context_from (context);
791 pop_deferring_access_checks ();
794 /* Use EXTRACTOR to locate the relevant function called for each base &
795 class field of TYPE. CLIENT allows additional information to be passed
796 to EXTRACTOR. Generates the union of all exceptions generated by those
797 functions. Note that we haven't updated TYPE_FIELDS and such of any
798 variants yet, so we need to look at the main one. */
801 synthesize_exception_spec (tree type, tree (*extractor) (tree, void*),
804 tree raises = empty_except_spec;
805 tree fields = TYPE_FIELDS (type);
806 int i, n_bases = CLASSTYPE_N_BASECLASSES (type);
807 tree binfos = TYPE_BINFO_BASETYPES (type);
809 for (i = 0; i != n_bases; i++)
811 tree base = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
812 tree fn = (*extractor) (base, client);
815 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
817 raises = merge_exception_specifiers (raises, fn_raises);
820 for (; fields; fields = TREE_CHAIN (fields))
822 tree type = TREE_TYPE (fields);
825 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
827 while (TREE_CODE (type) == ARRAY_TYPE)
828 type = TREE_TYPE (type);
829 if (TREE_CODE (type) != RECORD_TYPE)
832 fn = (*extractor) (type, client);
835 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
837 raises = merge_exception_specifiers (raises, fn_raises);
843 /* Locate the dtor of TYPE. */
846 locate_dtor (tree type, void *client ATTRIBUTE_UNUSED)
850 if (!TYPE_HAS_DESTRUCTOR (type))
852 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
853 CLASSTYPE_DESTRUCTOR_SLOT);
857 /* Locate the default ctor of TYPE. */
860 locate_ctor (tree type, void *client ATTRIBUTE_UNUSED)
864 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
867 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
868 CLASSTYPE_CONSTRUCTOR_SLOT);
869 for (; fns; fns = OVL_NEXT (fns))
871 tree fn = OVL_CURRENT (fns);
872 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
874 if (sufficient_parms_p (TREE_CHAIN (parms)))
886 /* Locate the copy ctor or copy assignment of TYPE. CLIENT_
887 points to a COPY_DATA holding the name (NULL for the ctor)
888 and desired qualifiers of the source operand. */
891 locate_copy (tree type, void *client_)
893 struct copy_data *client = (struct copy_data *)client_;
896 tree best = NULL_TREE;
897 bool excess_p = false;
901 if (TYPE_HAS_ASSIGN_REF (type))
902 ix = lookup_fnfields_1 (type, client->name);
904 else if (TYPE_HAS_INIT_REF (type))
905 ix = CLASSTYPE_CONSTRUCTOR_SLOT;
908 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
910 for (; fns; fns = OVL_NEXT (fns))
912 tree fn = OVL_CURRENT (fns);
913 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
918 parms = TREE_CHAIN (parms);
921 src_type = non_reference (TREE_VALUE (parms));
922 if (!same_type_ignoring_top_level_qualifiers_p (src_type, type))
924 if (!sufficient_parms_p (TREE_CHAIN (parms)))
926 quals = cp_type_quals (src_type);
927 if (client->quals & ~quals)
929 excess = quals & ~client->quals;
930 if (!best || (excess_p && !excess))
942 /* Implicitly declare the special function indicated by KIND, as a
943 member of TYPE. For copy constructors and assignment operators,
944 CONST_P indicates whether these functions should take a const
945 reference argument or a non-const reference. */
948 implicitly_declare_fn (special_function_kind kind, tree type, bool const_p)
950 tree declspecs = NULL_TREE;
951 tree fn, args = NULL_TREE;
952 tree raises = empty_except_spec;
954 bool has_parm = false;
955 tree name = constructor_name (type);
961 name = build_nt (BIT_NOT_EXPR, name);
962 args = void_list_node;
963 raises = synthesize_exception_spec (type, &locate_dtor, 0);
966 case sfk_constructor:
967 /* Default constructor. */
968 args = void_list_node;
969 raises = synthesize_exception_spec (type, &locate_ctor, 0);
972 case sfk_copy_constructor:
973 case sfk_assignment_operator:
975 struct copy_data data;
981 if (kind == sfk_assignment_operator)
984 declspecs = build_tree_list (NULL_TREE, type);
986 name = ansi_assopname (NOP_EXPR);
991 data.quals = TYPE_QUAL_CONST;
992 argtype = build_qualified_type (argtype, TYPE_QUAL_CONST);
995 argtype = build_reference_type (argtype);
996 args = build_tree_list (hash_tree_chain (argtype, NULL_TREE),
997 get_identifier ("_ctor_arg"));
998 args = tree_cons (NULL_TREE, args, void_list_node);
1000 raises = synthesize_exception_spec (type, &locate_copy, &data);
1007 TREE_PARMLIST (args) = 1;
1010 tree declarator = make_call_declarator (name, args, NULL_TREE, raises);
1013 declarator = build_nt (ADDR_EXPR, declarator);
1015 fn = grokfield (declarator, declspecs, NULL_TREE, NULL_TREE, NULL_TREE);
1017 TREE_USED (FUNCTION_FIRST_USER_PARM (fn)) = 1;
1020 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 20000408);
1022 DECL_ARTIFICIAL (fn) = 1;
1023 DECL_NOT_REALLY_EXTERN (fn) = 1;
1024 DECL_DECLARED_INLINE_P (fn) = 1;
1025 DECL_INLINE (fn) = 1;
1031 /* Given a FUNCTION_DECL FN and a chain LIST, skip as many elements of LIST
1032 as there are artificial parms in FN. */
1035 skip_artificial_parms_for (tree fn, tree list)
1037 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1038 list = TREE_CHAIN (list);
1042 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
1043 list = TREE_CHAIN (list);
1044 if (DECL_HAS_VTT_PARM_P (fn))
1045 list = TREE_CHAIN (list);
1049 #include "gt-cp-method.h"