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, 2004 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 *);
65 static tree make_alias_for_thunk (tree);
67 /* Called once to initialize method.c. */
75 /* Return a this or result adjusting thunk to FUNCTION. THIS_ADJUSTING
76 indicates whether it is a this or result adjusting thunk.
77 FIXED_OFFSET and VIRTUAL_OFFSET indicate how to do the adjustment
78 (see thunk_adjust). VIRTUAL_OFFSET can be NULL, but FIXED_OFFSET
79 never is. VIRTUAL_OFFSET is the /index/ into the vtable for this
80 adjusting thunks, we scale it to a byte offset. For covariant
81 thunks VIRTUAL_OFFSET is the virtual binfo. You must post process
82 the returned thunk with finish_thunk. */
85 make_thunk (tree function, bool this_adjusting,
86 tree fixed_offset, tree virtual_offset)
91 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 20021025);
92 /* We can have this thunks to covariant thunks, but not vice versa. */
93 my_friendly_assert (!DECL_THIS_THUNK_P (function), 20021127);
94 my_friendly_assert (!DECL_RESULT_THUNK_P (function) || this_adjusting,
97 /* Scale the VIRTUAL_OFFSET to be in terms of bytes. */
98 if (this_adjusting && virtual_offset)
100 = size_binop (MULT_EXPR,
103 TYPE_SIZE_UNIT (vtable_entry_type)));
105 d = tree_low_cst (fixed_offset, 0);
107 /* See if we already have the thunk in question. For this_adjusting
108 thunks VIRTUAL_OFFSET will be an INTEGER_CST, for covariant thunks it
110 for (thunk = DECL_THUNKS (function); thunk; thunk = TREE_CHAIN (thunk))
111 if (DECL_THIS_THUNK_P (thunk) == this_adjusting
112 && THUNK_FIXED_OFFSET (thunk) == d
113 && !virtual_offset == !THUNK_VIRTUAL_OFFSET (thunk)
116 ? tree_int_cst_equal (THUNK_VIRTUAL_OFFSET (thunk),
118 : THUNK_VIRTUAL_OFFSET (thunk) == virtual_offset)))
121 /* All thunks must be created before FUNCTION is actually emitted;
122 the ABI requires that all thunks be emitted together with the
123 function to which they transfer control. */
124 my_friendly_assert (!TREE_ASM_WRITTEN (function), 20021025);
125 /* Likewise, we can only be adding thunks to a function declared in
126 the class currently being laid out. */
127 my_friendly_assert (TYPE_SIZE (DECL_CONTEXT (function))
128 && TYPE_BEING_DEFINED (DECL_CONTEXT (function)),
131 thunk = build_decl (FUNCTION_DECL, NULL_TREE, TREE_TYPE (function));
132 DECL_LANG_SPECIFIC (thunk) = DECL_LANG_SPECIFIC (function);
133 cxx_dup_lang_specific_decl (thunk);
134 DECL_THUNKS (thunk) = NULL_TREE;
136 DECL_CONTEXT (thunk) = DECL_CONTEXT (function);
137 TREE_READONLY (thunk) = TREE_READONLY (function);
138 TREE_THIS_VOLATILE (thunk) = TREE_THIS_VOLATILE (function);
139 TREE_PUBLIC (thunk) = TREE_PUBLIC (function);
141 comdat_linkage (thunk);
142 SET_DECL_THUNK_P (thunk, this_adjusting);
143 THUNK_TARGET (thunk) = function;
144 THUNK_FIXED_OFFSET (thunk) = d;
145 THUNK_VIRTUAL_OFFSET (thunk) = virtual_offset;
146 THUNK_ALIAS (thunk) = NULL_TREE;
148 /* The thunk itself is not a constructor or destructor, even if
149 the thing it is thunking to is. */
150 DECL_INTERFACE_KNOWN (thunk) = 1;
151 DECL_NOT_REALLY_EXTERN (thunk) = 1;
152 DECL_SAVED_FUNCTION_DATA (thunk) = NULL;
153 DECL_DESTRUCTOR_P (thunk) = 0;
154 DECL_CONSTRUCTOR_P (thunk) = 0;
155 /* And neither is it a clone. */
156 DECL_CLONED_FUNCTION (thunk) = NULL_TREE;
157 DECL_EXTERNAL (thunk) = 1;
158 DECL_ARTIFICIAL (thunk) = 1;
159 /* Even if this thunk is a member of a local class, we don't
160 need a static chain. */
161 DECL_NO_STATIC_CHAIN (thunk) = 1;
162 /* The THUNK is not a pending inline, even if the FUNCTION is. */
163 DECL_PENDING_INLINE_P (thunk) = 0;
164 DECL_INLINE (thunk) = 0;
165 DECL_DECLARED_INLINE_P (thunk) = 0;
166 /* Nor has it been deferred. */
167 DECL_DEFERRED_FN (thunk) = 0;
169 /* Add it to the list of thunks associated with FUNCTION. */
170 TREE_CHAIN (thunk) = DECL_THUNKS (function);
171 DECL_THUNKS (function) = thunk;
176 /* Finish THUNK, a thunk decl. */
179 finish_thunk (tree thunk)
182 tree fixed_offset = ssize_int (THUNK_FIXED_OFFSET (thunk));
183 tree virtual_offset = THUNK_VIRTUAL_OFFSET (thunk);
185 my_friendly_assert (!DECL_NAME (thunk) && DECL_THUNK_P (thunk), 20021127);
186 if (virtual_offset && DECL_RESULT_THUNK_P (thunk))
187 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
188 function = THUNK_TARGET (thunk);
189 name = mangle_thunk (function, DECL_THIS_THUNK_P (thunk),
190 fixed_offset, virtual_offset);
192 /* We can end up with declarations of (logically) different
193 covariant thunks, that do identical adjustments. The two thunks
194 will be adjusting between within different hierarchies, which
195 happen to have the same layout. We must nullify one of them to
196 refer to the other. */
197 if (DECL_RESULT_THUNK_P (thunk))
201 for (cov_probe = DECL_THUNKS (function);
202 cov_probe; cov_probe = TREE_CHAIN (cov_probe))
203 if (DECL_NAME (cov_probe) == name)
205 my_friendly_assert (!DECL_THUNKS (thunk), 20031023);
206 THUNK_ALIAS (thunk) = (THUNK_ALIAS (cov_probe)
207 ? THUNK_ALIAS (cov_probe) : cov_probe);
212 DECL_NAME (thunk) = name;
213 SET_DECL_ASSEMBLER_NAME (thunk, name);
216 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
217 offset indicated by VIRTUAL_OFFSET, if that is
218 non-null. THIS_ADJUSTING is nonzero for a this adjusting thunk and
219 zero for a result adjusting thunk. */
222 thunk_adjust (tree ptr, bool this_adjusting,
223 HOST_WIDE_INT fixed_offset, tree virtual_offset)
226 /* Adjust the pointer by the constant. */
227 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
228 ssize_int (fixed_offset)));
230 /* If there's a virtual offset, look up that value in the vtable and
231 adjust the pointer again. */
236 ptr = save_expr (ptr);
237 /* The vptr is always at offset zero in the object. */
238 vtable = build1 (NOP_EXPR,
239 build_pointer_type (build_pointer_type
240 (vtable_entry_type)),
242 /* Form the vtable address. */
243 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
244 /* Find the entry with the vcall offset. */
245 vtable = build (PLUS_EXPR, TREE_TYPE (vtable), vtable, virtual_offset);
246 /* Get the offset itself. */
247 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
248 /* Adjust the `this' pointer. */
249 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr, vtable));
253 /* Adjust the pointer by the constant. */
254 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
255 ssize_int (fixed_offset)));
260 static GTY (()) int thunk_labelno;
262 /* Create a static alias to function. */
265 make_alias_for_thunk (tree function)
270 ASM_GENERATE_INTERNAL_LABEL (buf, "LTHUNK", thunk_labelno);
272 alias = build_decl (FUNCTION_DECL, get_identifier (buf),
273 TREE_TYPE (function));
274 DECL_LANG_SPECIFIC (alias) = DECL_LANG_SPECIFIC (function);
275 cxx_dup_lang_specific_decl (alias);
276 DECL_CONTEXT (alias) = NULL;
277 TREE_READONLY (alias) = TREE_READONLY (function);
278 TREE_THIS_VOLATILE (alias) = TREE_THIS_VOLATILE (function);
279 TREE_PUBLIC (alias) = 0;
280 DECL_INTERFACE_KNOWN (alias) = 1;
281 DECL_NOT_REALLY_EXTERN (alias) = 1;
282 DECL_THIS_STATIC (alias) = 1;
283 DECL_SAVED_FUNCTION_DATA (alias) = NULL;
284 DECL_DESTRUCTOR_P (alias) = 0;
285 DECL_CONSTRUCTOR_P (alias) = 0;
286 DECL_CLONED_FUNCTION (alias) = NULL_TREE;
287 DECL_EXTERNAL (alias) = 0;
288 DECL_ARTIFICIAL (alias) = 1;
289 DECL_NO_STATIC_CHAIN (alias) = 1;
290 DECL_PENDING_INLINE_P (alias) = 0;
291 DECL_INLINE (alias) = 0;
292 DECL_DECLARED_INLINE_P (alias) = 0;
293 DECL_DEFERRED_FN (alias) = 0;
294 DECL_USE_TEMPLATE (alias) = 0;
295 DECL_TEMPLATE_INSTANTIATED (alias) = 0;
296 DECL_TEMPLATE_INFO (alias) = NULL;
297 DECL_INITIAL (alias) = error_mark_node;
298 TREE_ADDRESSABLE (alias) = 1;
299 TREE_USED (alias) = 1;
300 SET_DECL_ASSEMBLER_NAME (alias, DECL_NAME (alias));
301 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias)) = 1;
302 if (!flag_syntax_only)
303 assemble_alias (alias, DECL_ASSEMBLER_NAME (function));
307 /* Emit the definition of a C++ multiple inheritance or covariant
308 return vtable thunk. If EMIT_P is nonzero, the thunk is emitted
312 use_thunk (tree thunk_fndecl, bool emit_p)
314 tree a, t, function, alias;
316 HOST_WIDE_INT fixed_offset, virtual_value;
317 bool this_adjusting = DECL_THIS_THUNK_P (thunk_fndecl);
319 /* We should have called finish_thunk to give it a name. */
320 my_friendly_assert (DECL_NAME (thunk_fndecl), 20021127);
322 /* We should never be using an alias, always refer to the
324 my_friendly_assert (!THUNK_ALIAS (thunk_fndecl), 20031023);
326 if (TREE_ASM_WRITTEN (thunk_fndecl))
329 function = THUNK_TARGET (thunk_fndecl);
330 if (DECL_RESULT (thunk_fndecl))
331 /* We already turned this thunk into an ordinary function.
332 There's no need to process this thunk again. */
335 /* Thunks are always addressable; they only appear in vtables. */
336 TREE_ADDRESSABLE (thunk_fndecl) = 1;
338 /* Figure out what function is being thunked to. It's referenced in
339 this translation unit. */
340 TREE_ADDRESSABLE (function) = 1;
341 mark_used (function);
345 if (TARGET_USE_LOCAL_THUNK_ALIAS_P (function))
346 alias = make_alias_for_thunk (function);
350 fixed_offset = THUNK_FIXED_OFFSET (thunk_fndecl);
351 virtual_offset = THUNK_VIRTUAL_OFFSET (thunk_fndecl);
356 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
357 virtual_value = tree_low_cst (virtual_offset, /*pos=*/0);
358 my_friendly_assert (virtual_value, 20021026);
363 /* And, if we need to emit the thunk, it's used. */
364 mark_used (thunk_fndecl);
365 /* This thunk is actually defined. */
366 DECL_EXTERNAL (thunk_fndecl) = 0;
367 /* The linkage of the function may have changed. FIXME in linkage
369 TREE_PUBLIC (thunk_fndecl) = TREE_PUBLIC (function);
370 DECL_VISIBILITY (thunk_fndecl) = DECL_VISIBILITY (function);
371 if (flag_weak && TREE_PUBLIC (thunk_fndecl))
372 comdat_linkage (thunk_fndecl);
374 if (flag_syntax_only)
376 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
380 push_to_top_level ();
382 if (TARGET_USE_LOCAL_THUNK_ALIAS_P (function)
383 && targetm.have_named_sections)
385 resolve_unique_section (function, 0, flag_function_sections);
387 if (DECL_SECTION_NAME (function) != NULL && DECL_ONE_ONLY (function))
389 resolve_unique_section (thunk_fndecl, 0, flag_function_sections);
391 /* Output the thunk into the same section as function. */
392 DECL_SECTION_NAME (thunk_fndecl) = DECL_SECTION_NAME (function);
396 /* The back-end expects DECL_INITIAL to contain a BLOCK, so we
398 DECL_INITIAL (thunk_fndecl) = make_node (BLOCK);
400 /* Set up cloned argument trees for the thunk. */
402 for (a = DECL_ARGUMENTS (function); a; a = TREE_CHAIN (a))
404 tree x = copy_node (a);
406 DECL_CONTEXT (x) = thunk_fndecl;
407 SET_DECL_RTL (x, NULL_RTX);
411 DECL_ARGUMENTS (thunk_fndecl) = a;
412 BLOCK_VARS (DECL_INITIAL (thunk_fndecl)) = a;
415 && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset,
416 virtual_value, alias))
419 current_function_decl = thunk_fndecl;
420 DECL_RESULT (thunk_fndecl)
421 = build_decl (RESULT_DECL, 0, integer_type_node);
422 fnname = XSTR (XEXP (DECL_RTL (thunk_fndecl), 0), 0);
423 init_function_start (thunk_fndecl);
424 current_function_is_thunk = 1;
425 assemble_start_function (thunk_fndecl, fnname);
427 targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl,
428 fixed_offset, virtual_value, alias);
430 assemble_end_function (thunk_fndecl, fnname);
431 current_function_decl = 0;
433 /* Because init_function_start increments this, we must
435 immediate_size_expand--;
436 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
440 /* If this is a covariant thunk, or we don't have the necessary
441 code for efficient thunks, generate a thunk function that
442 just makes a call to the real function. Unfortunately, this
443 doesn't work for varargs. */
445 if (varargs_function_p (function))
446 error ("generic thunk code fails for method `%#D' which uses `...'",
449 DECL_RESULT (thunk_fndecl) = NULL_TREE;
451 start_function (NULL_TREE, thunk_fndecl, NULL_TREE, SF_PRE_PARSED);
452 /* We don't bother with a body block for thunks. */
454 /* There's no need to check accessibility inside the thunk body. */
455 push_deferring_access_checks (dk_no_check);
459 t = thunk_adjust (t, /*this_adjusting=*/1,
460 fixed_offset, virtual_offset);
462 /* Build up the call to the real function. */
463 t = tree_cons (NULL_TREE, t, NULL_TREE);
464 for (a = TREE_CHAIN (a); a; a = TREE_CHAIN (a))
465 t = tree_cons (NULL_TREE, a, t);
467 t = build_call (alias, t);
468 CALL_FROM_THUNK_P (t) = 1;
470 if (VOID_TYPE_P (TREE_TYPE (t)))
471 finish_expr_stmt (t);
474 t = force_target_expr (TREE_TYPE (t), t);
476 t = thunk_adjust (t, /*this_adjusting=*/0,
477 fixed_offset, virtual_offset);
478 finish_return_stmt (t);
481 /* Since we want to emit the thunk, we explicitly mark its name as
483 mark_decl_referenced (thunk_fndecl);
485 /* But we don't want debugging information about it. */
486 DECL_IGNORED_P (thunk_fndecl) = 1;
488 /* Re-enable access control. */
489 pop_deferring_access_checks ();
491 expand_body (finish_function (0));
494 pop_from_top_level ();
497 /* Code for synthesizing methods which have default semantics defined. */
499 /* Generate code for default X(X&) constructor. */
502 do_build_copy_constructor (tree fndecl)
504 tree parm = FUNCTION_FIRST_USER_PARM (fndecl);
507 parm = convert_from_reference (parm);
509 if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type)
510 && is_empty_class (current_class_type))
511 /* Don't copy the padding byte; it might not have been allocated
512 if *this is a base subobject. */;
513 else if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type))
515 t = build (INIT_EXPR, void_type_node, current_class_ref, parm);
516 finish_expr_stmt (t);
520 tree fields = TYPE_FIELDS (current_class_type);
521 int n_bases = CLASSTYPE_N_BASECLASSES (current_class_type);
522 tree binfos = TYPE_BINFO_BASETYPES (current_class_type);
523 tree member_init_list = NULL_TREE;
524 int cvquals = cp_type_quals (TREE_TYPE (parm));
527 /* Initialize all the base-classes with the parameter converted
528 to their type so that we get their copy constructor and not
529 another constructor that takes current_class_type. We must
530 deal with the binfo's directly as a direct base might be
531 inaccessible due to ambiguity. */
532 for (t = CLASSTYPE_VBASECLASSES (current_class_type); t;
535 tree binfo = TREE_VALUE (t);
539 build_tree_list (NULL_TREE,
540 build_base_path (PLUS_EXPR, parm,
545 for (i = 0; i < n_bases; ++i)
547 tree binfo = TREE_VEC_ELT (binfos, i);
548 if (TREE_VIA_VIRTUAL (binfo))
553 build_tree_list (NULL_TREE,
554 build_base_path (PLUS_EXPR, parm,
559 for (; fields; fields = TREE_CHAIN (fields))
565 if (TREE_CODE (field) != FIELD_DECL)
569 if (DECL_NAME (field))
571 if (VFIELD_NAME_P (DECL_NAME (field)))
574 /* True for duplicate members. */
575 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
578 else if ((t = TREE_TYPE (field)) != NULL_TREE
579 && ANON_AGGR_TYPE_P (t)
580 && TYPE_FIELDS (t) != NULL_TREE)
581 /* Just use the field; anonymous types can't have
582 nontrivial copy ctors or assignment ops. */;
586 /* Compute the type of "init->field". If the copy-constructor
587 parameter is, for example, "const S&", and the type of
588 the field is "T", then the type will usually be "const
589 T". (There are no cv-qualified variants of reference
591 expr_type = TREE_TYPE (field);
592 if (TREE_CODE (expr_type) != REFERENCE_TYPE)
593 expr_type = cp_build_qualified_type (expr_type, cvquals);
594 init = build (COMPONENT_REF, expr_type, init, field, NULL_TREE);
595 init = build_tree_list (NULL_TREE, init);
598 = tree_cons (field, init, member_init_list);
600 finish_mem_initializers (member_init_list);
605 do_build_assign_ref (tree fndecl)
607 tree parm = TREE_CHAIN (DECL_ARGUMENTS (fndecl));
610 compound_stmt = begin_compound_stmt (0);
611 parm = convert_from_reference (parm);
613 if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type)
614 && is_empty_class (current_class_type))
615 /* Don't copy the padding byte; it might not have been allocated
616 if *this is a base subobject. */;
617 else if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type))
619 tree t = build (MODIFY_EXPR, void_type_node, current_class_ref, parm);
620 finish_expr_stmt (t);
625 int cvquals = cp_type_quals (TREE_TYPE (parm));
628 /* Assign to each of the direct base classes. */
629 for (i = 0; i < CLASSTYPE_N_BASECLASSES (current_class_type); ++i)
634 binfo = BINFO_BASETYPE (TYPE_BINFO (current_class_type), i);
635 /* We must convert PARM directly to the base class
636 explicitly since the base class may be ambiguous. */
637 converted_parm = build_base_path (PLUS_EXPR, parm, binfo, 1);
638 /* Call the base class assignment operator. */
640 (build_special_member_call (current_class_ref,
641 ansi_assopname (NOP_EXPR),
642 build_tree_list (NULL_TREE,
645 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL));
648 /* Assign to each of the non-static data members. */
649 for (fields = TYPE_FIELDS (current_class_type);
651 fields = TREE_CHAIN (fields))
656 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
659 if (CP_TYPE_CONST_P (TREE_TYPE (field)))
661 error ("non-static const member `%#D', can't use default assignment operator", field);
664 else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE)
666 error ("non-static reference member `%#D', can't use default assignment operator", field);
670 comp = current_class_ref;
673 if (DECL_NAME (field))
675 if (VFIELD_NAME_P (DECL_NAME (field)))
678 /* True for duplicate members. */
679 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
682 else if ((t = TREE_TYPE (field)) != NULL_TREE
683 && ANON_AGGR_TYPE_P (t)
684 && TYPE_FIELDS (t) != NULL_TREE)
685 /* Just use the field; anonymous types can't have
686 nontrivial copy ctors or assignment ops. */;
690 comp = build (COMPONENT_REF, TREE_TYPE (field), comp, field,
692 init = build (COMPONENT_REF,
693 cp_build_qualified_type (TREE_TYPE (field), cvquals),
694 init, field, NULL_TREE);
696 if (DECL_NAME (field))
697 finish_expr_stmt (build_modify_expr (comp, NOP_EXPR, init));
699 finish_expr_stmt (build (MODIFY_EXPR, TREE_TYPE (comp), comp,
703 finish_return_stmt (current_class_ref);
704 finish_compound_stmt (compound_stmt);
708 synthesize_method (tree fndecl)
710 bool nested = (current_function_decl != NULL_TREE);
711 tree context = decl_function_context (fndecl);
712 bool need_body = true;
716 import_export_decl (fndecl);
718 /* If we've been asked to synthesize a clone, just synthesize the
719 cloned function instead. Doing so will automatically fill in the
720 body for the clone. */
721 if (DECL_CLONED_FUNCTION_P (fndecl))
723 synthesize_method (DECL_CLONED_FUNCTION (fndecl));
727 /* We may be in the middle of deferred access check. Disable
729 push_deferring_access_checks (dk_no_deferred);
732 push_to_top_level ();
734 push_function_context_to (context);
736 /* Put the function definition at the position where it is needed,
737 rather than within the body of the class. That way, an error
738 during the generation of the implicit body points at the place
739 where the attempt to generate the function occurs, giving the
740 user a hint as to why we are attempting to generate the
742 DECL_SOURCE_LOCATION (fndecl) = input_location;
744 interface_unknown = 1;
745 start_function (NULL_TREE, fndecl, NULL_TREE, SF_DEFAULT | SF_PRE_PARSED);
747 stmt = begin_function_body ();
749 if (DECL_OVERLOADED_OPERATOR_P (fndecl) == NOP_EXPR)
751 do_build_assign_ref (fndecl);
754 else if (DECL_CONSTRUCTOR_P (fndecl))
756 tree arg_chain = FUNCTION_FIRST_USER_PARMTYPE (fndecl);
757 if (arg_chain != void_list_node)
758 do_build_copy_constructor (fndecl);
759 else if (TYPE_NEEDS_CONSTRUCTING (current_class_type))
760 finish_mem_initializers (NULL_TREE);
763 /* If we haven't yet generated the body of the function, just
764 generate an empty compound statement. */
768 compound_stmt = begin_compound_stmt (BCS_FN_BODY);
769 finish_compound_stmt (compound_stmt);
772 finish_function_body (stmt);
773 expand_or_defer_fn (finish_function (0));
775 extract_interface_info ();
777 pop_from_top_level ();
779 pop_function_context_from (context);
781 pop_deferring_access_checks ();
784 /* Use EXTRACTOR to locate the relevant function called for each base &
785 class field of TYPE. CLIENT allows additional information to be passed
786 to EXTRACTOR. Generates the union of all exceptions generated by those
787 functions. Note that we haven't updated TYPE_FIELDS and such of any
788 variants yet, so we need to look at the main one. */
791 synthesize_exception_spec (tree type, tree (*extractor) (tree, void*),
794 tree raises = empty_except_spec;
795 tree fields = TYPE_FIELDS (type);
796 int i, n_bases = CLASSTYPE_N_BASECLASSES (type);
797 tree binfos = TYPE_BINFO_BASETYPES (type);
799 for (i = 0; i != n_bases; i++)
801 tree base = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
802 tree fn = (*extractor) (base, client);
805 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
807 raises = merge_exception_specifiers (raises, fn_raises);
810 for (; fields; fields = TREE_CHAIN (fields))
812 tree type = TREE_TYPE (fields);
815 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
817 while (TREE_CODE (type) == ARRAY_TYPE)
818 type = TREE_TYPE (type);
819 if (TREE_CODE (type) != RECORD_TYPE)
822 fn = (*extractor) (type, client);
825 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
827 raises = merge_exception_specifiers (raises, fn_raises);
833 /* Locate the dtor of TYPE. */
836 locate_dtor (tree type, void *client ATTRIBUTE_UNUSED)
840 if (!TYPE_HAS_DESTRUCTOR (type))
842 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
843 CLASSTYPE_DESTRUCTOR_SLOT);
847 /* Locate the default ctor of TYPE. */
850 locate_ctor (tree type, void *client ATTRIBUTE_UNUSED)
854 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
857 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
858 CLASSTYPE_CONSTRUCTOR_SLOT);
859 for (; fns; fns = OVL_NEXT (fns))
861 tree fn = OVL_CURRENT (fns);
862 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
864 if (sufficient_parms_p (TREE_CHAIN (parms)))
876 /* Locate the copy ctor or copy assignment of TYPE. CLIENT_
877 points to a COPY_DATA holding the name (NULL for the ctor)
878 and desired qualifiers of the source operand. */
881 locate_copy (tree type, void *client_)
883 struct copy_data *client = (struct copy_data *)client_;
886 tree best = NULL_TREE;
887 bool excess_p = false;
891 if (TYPE_HAS_ASSIGN_REF (type))
892 ix = lookup_fnfields_1 (type, client->name);
894 else if (TYPE_HAS_INIT_REF (type))
895 ix = CLASSTYPE_CONSTRUCTOR_SLOT;
898 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
900 for (; fns; fns = OVL_NEXT (fns))
902 tree fn = OVL_CURRENT (fns);
903 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
908 parms = TREE_CHAIN (parms);
911 src_type = non_reference (TREE_VALUE (parms));
912 if (!same_type_ignoring_top_level_qualifiers_p (src_type, type))
914 if (!sufficient_parms_p (TREE_CHAIN (parms)))
916 quals = cp_type_quals (src_type);
917 if (client->quals & ~quals)
919 excess = quals & ~client->quals;
920 if (!best || (excess_p && !excess))
932 /* Implicitly declare the special function indicated by KIND, as a
933 member of TYPE. For copy constructors and assignment operators,
934 CONST_P indicates whether these functions should take a const
935 reference argument or a non-const reference. */
938 implicitly_declare_fn (special_function_kind kind, tree type, bool const_p)
940 tree declspecs = NULL_TREE;
941 tree fn, args = NULL_TREE;
942 tree raises = empty_except_spec;
944 bool has_parm = false;
945 tree name = constructor_name (type);
951 name = build_nt (BIT_NOT_EXPR, name);
952 args = void_list_node;
953 raises = synthesize_exception_spec (type, &locate_dtor, 0);
956 case sfk_constructor:
957 /* Default constructor. */
958 args = void_list_node;
959 raises = synthesize_exception_spec (type, &locate_ctor, 0);
962 case sfk_copy_constructor:
963 case sfk_assignment_operator:
965 struct copy_data data;
971 if (kind == sfk_assignment_operator)
974 declspecs = build_tree_list (NULL_TREE, type);
976 name = ansi_assopname (NOP_EXPR);
981 data.quals = TYPE_QUAL_CONST;
982 argtype = build_qualified_type (argtype, TYPE_QUAL_CONST);
985 argtype = build_reference_type (argtype);
986 args = build_tree_list (hash_tree_chain (argtype, NULL_TREE),
987 get_identifier ("_ctor_arg"));
988 args = tree_cons (NULL_TREE, args, void_list_node);
990 raises = synthesize_exception_spec (type, &locate_copy, &data);
997 TREE_PARMLIST (args) = 1;
1000 tree declarator = make_call_declarator (name, args, NULL_TREE, raises);
1003 declarator = build_nt (ADDR_EXPR, declarator);
1005 fn = grokfield (declarator, declspecs, NULL_TREE, NULL_TREE, NULL_TREE);
1007 TREE_USED (FUNCTION_FIRST_USER_PARM (fn)) = 1;
1010 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 20000408);
1012 DECL_ARTIFICIAL (fn) = 1;
1013 DECL_NOT_REALLY_EXTERN (fn) = 1;
1014 DECL_DECLARED_INLINE_P (fn) = 1;
1015 DECL_INLINE (fn) = 1;
1022 /* Given a FUNCTION_DECL FN and a chain LIST, skip as many elements of LIST
1023 as there are artificial parms in FN. */
1026 skip_artificial_parms_for (tree fn, tree list)
1028 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1029 list = TREE_CHAIN (list);
1033 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
1034 list = TREE_CHAIN (list);
1035 if (DECL_HAS_VTT_PARM_P (fn))
1036 list = TREE_CHAIN (list);
1040 #include "gt-cp-method.h"