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 /* Called once to initialize method.c. */
75 /* Set the mangled name (DECL_ASSEMBLER_NAME) for DECL. */
78 set_mangled_name_for_decl (tree decl)
80 if (processing_template_decl)
81 /* There's no need to mangle the name of a template function. */
88 /* This function takes an identifier, ID, and attempts to figure out what
89 it means. There are a number of possible scenarios, presented in increasing
92 1) not in a class's scope
93 2) in class's scope, member name of the class's method
94 3) in class's scope, but not a member name of the class
95 4) in class's scope, member name of a class's variable
97 NAME is $1 from the bison rule. It is an IDENTIFIER_NODE.
98 VALUE is $$ from the bison rule. It is the value returned by lookup_name ($1)
100 As a last ditch, try to look up the name as a label and return that
103 Values which are declared as being of REFERENCE_TYPE are
104 automatically dereferenced here (as a hack to make the
108 hack_identifier (tree value, tree name)
112 if (value == error_mark_node)
113 return error_mark_node;
115 type = TREE_TYPE (value);
116 if (TREE_CODE (value) == FIELD_DECL)
117 value = finish_non_static_data_member (value,
118 /*qualifying_scope=*/NULL_TREE);
119 else if ((TREE_CODE (value) == FUNCTION_DECL
120 && DECL_FUNCTION_MEMBER_P (value))
121 || (TREE_CODE (value) == OVERLOAD
122 && DECL_FUNCTION_MEMBER_P (OVL_CURRENT (value))))
126 if (TREE_CODE (value) == OVERLOAD)
127 value = OVL_CURRENT (value);
129 decl = maybe_dummy_object (DECL_CONTEXT (value), 0);
130 value = finish_class_member_access_expr (decl, name);
132 else if (really_overloaded_fn (value))
134 else if (TREE_CODE (value) == OVERLOAD)
135 /* not really overloaded function */
136 mark_used (OVL_FUNCTION (value));
137 else if (TREE_CODE (value) == TREE_LIST)
139 /* Ambiguous reference to base members, possibly other cases?. */
141 while (t && TREE_CODE (t) == TREE_LIST)
143 mark_used (TREE_VALUE (t));
147 else if (TREE_CODE (value) == NAMESPACE_DECL)
149 error ("use of namespace `%D' as expression", value);
150 return error_mark_node;
152 else if (DECL_CLASS_TEMPLATE_P (value))
154 error ("use of class template `%T' as expression", value);
155 return error_mark_node;
160 if (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == PARM_DECL
161 || TREE_CODE (value) == RESULT_DECL)
163 tree context = decl_function_context (value);
164 if (context != NULL_TREE && context != current_function_decl
165 && ! TREE_STATIC (value))
167 error ("use of %s from containing function",
168 (TREE_CODE (value) == VAR_DECL
169 ? "`auto' variable" : "parameter"));
170 cp_error_at (" `%#D' declared here", value);
171 value = error_mark_node;
175 if (DECL_P (value) && DECL_NONLOCAL (value))
177 if (DECL_CLASS_SCOPE_P (value)
178 && DECL_CONTEXT (value) != current_class_type)
181 path = currently_open_derived_class (DECL_CONTEXT (value));
182 perform_or_defer_access_check (path, value);
185 else if (TREE_CODE (value) == TREE_LIST
186 && TREE_TYPE (value) == error_mark_node)
189 request for member `%D' is ambiguous in multiple inheritance lattice",
191 print_candidates (value);
192 return error_mark_node;
195 if (! processing_template_decl)
196 value = convert_from_reference (value);
201 /* Return a this or result adjusting thunk to FUNCTION. THIS_ADJUSTING
202 indicates whether it is a this or result adjusting thunk.
203 FIXED_OFFSET and VIRTUAL_OFFSET indicate how to do the adjustment
204 (see thunk_adjust). VIRTUAL_OFFSET can be NULL, but FIXED_OFFSET
205 never is. VIRTUAL_OFFSET is the /index/ into the vtable for this
206 adjusting thunks, we scale it to a byte offset. For covariant
207 thunks VIRTUAL_OFFSET is the virtual binfo. You must post process
208 the returned thunk with finish_thunk. */
211 make_thunk (tree function, bool this_adjusting,
212 tree fixed_offset, tree virtual_offset)
217 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 20021025);
218 /* We can have this thunks to covariant thunks, but not vice versa. */
219 my_friendly_assert (!DECL_THIS_THUNK_P (function), 20021127);
221 /* Scale the VIRTUAL_OFFSET to be in terms of bytes. */
222 if (this_adjusting && virtual_offset)
224 = size_binop (MULT_EXPR,
227 TYPE_SIZE_UNIT (vtable_entry_type)));
229 d = tree_low_cst (fixed_offset, 0);
231 /* See if we already have the thunk in question. For this_adjusting
232 thunks VIRTUAL_OFFSET will be an INTEGER_CST, for covariant thunks it
234 for (thunk = DECL_THUNKS (function); thunk; thunk = TREE_CHAIN (thunk))
235 if (DECL_THIS_THUNK_P (thunk) == this_adjusting
236 && THUNK_FIXED_OFFSET (thunk) == d
238 ? (!THUNK_VIRTUAL_OFFSET (thunk) == !virtual_offset
240 || tree_int_cst_equal (THUNK_VIRTUAL_OFFSET (thunk),
242 : THUNK_VIRTUAL_OFFSET (thunk) == virtual_offset))
245 /* All thunks must be created before FUNCTION is actually emitted;
246 the ABI requires that all thunks be emitted together with the
247 function to which they transfer control. */
248 my_friendly_assert (!TREE_ASM_WRITTEN (function), 20021025);
250 thunk = build_decl (FUNCTION_DECL, NULL_TREE, TREE_TYPE (function));
251 DECL_LANG_SPECIFIC (thunk) = DECL_LANG_SPECIFIC (function);
252 cxx_dup_lang_specific_decl (thunk);
253 DECL_CONTEXT (thunk) = DECL_CONTEXT (function);
254 TREE_READONLY (thunk) = TREE_READONLY (function);
255 TREE_THIS_VOLATILE (thunk) = TREE_THIS_VOLATILE (function);
256 TREE_PUBLIC (thunk) = TREE_PUBLIC (function);
258 comdat_linkage (thunk);
259 SET_DECL_THUNK_P (thunk, this_adjusting);
260 THUNK_TARGET (thunk) = function;
261 THUNK_FIXED_OFFSET (thunk) = d;
262 THUNK_VIRTUAL_OFFSET (thunk) = virtual_offset;
264 /* The thunk itself is not a constructor or destructor, even if
265 the thing it is thunking to is. */
266 DECL_INTERFACE_KNOWN (thunk) = 1;
267 DECL_NOT_REALLY_EXTERN (thunk) = 1;
268 DECL_SAVED_FUNCTION_DATA (thunk) = NULL;
269 DECL_DESTRUCTOR_P (thunk) = 0;
270 DECL_CONSTRUCTOR_P (thunk) = 0;
271 /* And neither is it a clone. */
272 DECL_CLONED_FUNCTION (thunk) = NULL_TREE;
273 DECL_EXTERNAL (thunk) = 1;
274 DECL_ARTIFICIAL (thunk) = 1;
275 /* Even if this thunk is a member of a local class, we don't
276 need a static chain. */
277 DECL_NO_STATIC_CHAIN (thunk) = 1;
278 /* The THUNK is not a pending inline, even if the FUNCTION is. */
279 DECL_PENDING_INLINE_P (thunk) = 0;
280 DECL_INLINE (thunk) = 0;
281 DECL_DECLARED_INLINE_P (thunk) = 0;
282 /* Nor has it been deferred. */
283 DECL_DEFERRED_FN (thunk) = 0;
284 /* Add it to the list of thunks associated with FUNCTION. */
285 TREE_CHAIN (thunk) = DECL_THUNKS (function);
286 DECL_THUNKS (function) = thunk;
291 /* Finish THUNK, a thunk decl. */
294 finish_thunk (tree thunk)
297 tree fixed_offset = ssize_int (THUNK_FIXED_OFFSET (thunk));
298 tree virtual_offset = THUNK_VIRTUAL_OFFSET (thunk);
300 my_friendly_assert (!DECL_NAME (thunk) && DECL_THUNK_P (thunk), 20021127);
301 if (virtual_offset && DECL_RESULT_THUNK_P (thunk))
302 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
303 function = THUNK_TARGET (thunk);
304 name = mangle_thunk (function, DECL_THIS_THUNK_P (thunk),
305 fixed_offset, virtual_offset);
306 DECL_NAME (thunk) = name;
307 SET_DECL_ASSEMBLER_NAME (thunk, name);
310 /* Adjust PTR by the constant FIXED_OFFSET, and by the vtable
311 offset indicated by VIRTUAL_OFFSET, if that is
312 non-null. THIS_ADJUSTING is non-zero for a this adjusting thunk and
313 zero for a result adjusting thunk. */
316 thunk_adjust (tree ptr, bool this_adjusting,
317 HOST_WIDE_INT fixed_offset, tree virtual_offset)
320 /* Adjust the pointer by the constant. */
321 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
322 ssize_int (fixed_offset)));
324 /* If there's a virtual offset, look up that value in the vtable and
325 adjust the pointer again. */
330 ptr = save_expr (ptr);
331 /* The vptr is always at offset zero in the object. */
332 vtable = build1 (NOP_EXPR,
333 build_pointer_type (build_pointer_type
334 (vtable_entry_type)),
336 /* Form the vtable address. */
337 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
338 /* Find the entry with the vcall offset. */
339 vtable = build (PLUS_EXPR, TREE_TYPE (vtable), vtable, virtual_offset);
340 /* Get the offset itself. */
341 vtable = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (vtable)), vtable);
342 /* Adjust the `this' pointer. */
343 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr, vtable));
347 /* Adjust the pointer by the constant. */
348 ptr = fold (build (PLUS_EXPR, TREE_TYPE (ptr), ptr,
349 ssize_int (fixed_offset)));
354 /* Emit the definition of a C++ multiple inheritance or covariant
355 return vtable thunk. If EMIT_P is nonzero, the thunk is emitted
359 use_thunk (tree thunk_fndecl, bool emit_p)
363 HOST_WIDE_INT fixed_offset, virtual_value;
364 bool this_adjusting = DECL_THIS_THUNK_P (thunk_fndecl);
366 /* We should have called finish_thunk to give it a name. */
367 my_friendly_assert (DECL_NAME (thunk_fndecl), 20021127);
369 if (TREE_ASM_WRITTEN (thunk_fndecl))
372 function = THUNK_TARGET (thunk_fndecl);
373 if (DECL_RESULT (thunk_fndecl))
374 /* We already turned this thunk into an ordinary function.
375 There's no need to process this thunk again. */
378 /* Thunks are always addressable; they only appear in vtables. */
379 TREE_ADDRESSABLE (thunk_fndecl) = 1;
381 /* Figure out what function is being thunked to. It's referenced in
382 this translation unit. */
383 TREE_ADDRESSABLE (function) = 1;
384 mark_used (function);
385 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (function)) = 1;
389 fixed_offset = THUNK_FIXED_OFFSET (thunk_fndecl);
390 virtual_offset = THUNK_VIRTUAL_OFFSET (thunk_fndecl);
395 virtual_offset = BINFO_VPTR_FIELD (virtual_offset);
396 virtual_value = tree_low_cst (virtual_offset, /*pos=*/0);
397 my_friendly_assert (virtual_value, 20021026);
402 /* And, if we need to emit the thunk, it's used. */
403 mark_used (thunk_fndecl);
404 /* This thunk is actually defined. */
405 DECL_EXTERNAL (thunk_fndecl) = 0;
406 /* The linkage of the function may have changed. FIXME in linkage
408 TREE_PUBLIC (thunk_fndecl) = TREE_PUBLIC (function);
410 if (flag_syntax_only)
412 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
416 push_to_top_level ();
418 /* The back-end expects DECL_INITIAL to contain a BLOCK, so we
420 DECL_INITIAL (thunk_fndecl) = make_node (BLOCK);
421 BLOCK_VARS (DECL_INITIAL (thunk_fndecl)) = DECL_ARGUMENTS (thunk_fndecl);
424 && targetm.asm_out.can_output_mi_thunk (thunk_fndecl, fixed_offset,
425 virtual_value, function))
428 current_function_decl = thunk_fndecl;
429 DECL_RESULT (thunk_fndecl)
430 = build_decl (RESULT_DECL, 0, integer_type_node);
431 fnname = XSTR (XEXP (DECL_RTL (thunk_fndecl), 0), 0);
432 init_function_start (thunk_fndecl, input_filename, input_line);
433 current_function_is_thunk = 1;
434 assemble_start_function (thunk_fndecl, fnname);
436 targetm.asm_out.output_mi_thunk (asm_out_file, thunk_fndecl,
437 fixed_offset, virtual_value, function);
439 assemble_end_function (thunk_fndecl, fnname);
440 current_function_decl = 0;
442 /* Because init_function_start increments this, we must
444 immediate_size_expand--;
445 TREE_ASM_WRITTEN (thunk_fndecl) = 1;
449 /* If this is a covariant thunk, or we don't have the necessary
450 code for efficient thunks, generate a thunk function that
451 just makes a call to the real function. Unfortunately, this
452 doesn't work for varargs. */
456 if (varargs_function_p (function))
457 error ("generic thunk code fails for method `%#D' which uses `...'",
460 /* Set up cloned argument trees for the thunk. */
462 for (a = DECL_ARGUMENTS (function); a; a = TREE_CHAIN (a))
464 tree x = copy_node (a);
466 DECL_CONTEXT (x) = thunk_fndecl;
470 DECL_ARGUMENTS (thunk_fndecl) = a;
471 DECL_RESULT (thunk_fndecl) = NULL_TREE;
473 start_function (NULL_TREE, thunk_fndecl, NULL_TREE, SF_PRE_PARSED);
474 /* We don't bother with a body block for thunks. */
476 /* There's no need to check accessibility inside the thunk body. */
477 push_deferring_access_checks (dk_no_check);
481 t = thunk_adjust (t, /*this_adjusting=*/1,
482 fixed_offset, virtual_offset);
484 /* Build up the call to the real function. */
485 t = tree_cons (NULL_TREE, t, NULL_TREE);
486 for (a = TREE_CHAIN (a); a; a = TREE_CHAIN (a))
487 t = tree_cons (NULL_TREE, a, t);
489 t = build_call (function, t);
491 t = thunk_adjust (t, /*this_adjusting=*/0,
492 fixed_offset, virtual_offset);
494 if (VOID_TYPE_P (TREE_TYPE (t)))
495 finish_expr_stmt (t);
497 finish_return_stmt (t);
499 /* Since we want to emit the thunk, we explicitly mark its name as
501 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (thunk_fndecl)) = 1;
503 /* But we don't want debugging information about it. */
504 DECL_IGNORED_P (thunk_fndecl) = 1;
506 /* Re-enable access control. */
507 pop_deferring_access_checks ();
509 expand_body (finish_function (0));
512 pop_from_top_level ();
515 /* Code for synthesizing methods which have default semantics defined. */
517 /* Generate code for default X(X&) constructor. */
520 do_build_copy_constructor (tree fndecl)
522 tree parm = FUNCTION_FIRST_USER_PARM (fndecl);
525 parm = convert_from_reference (parm);
527 if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type)
528 && is_empty_class (current_class_type))
529 /* Don't copy the padding byte; it might not have been allocated
530 if *this is a base subobject. */;
531 else if (TYPE_HAS_TRIVIAL_INIT_REF (current_class_type))
533 t = build (INIT_EXPR, void_type_node, current_class_ref, parm);
534 finish_expr_stmt (t);
538 tree fields = TYPE_FIELDS (current_class_type);
539 int n_bases = CLASSTYPE_N_BASECLASSES (current_class_type);
540 tree binfos = TYPE_BINFO_BASETYPES (current_class_type);
541 tree member_init_list = NULL_TREE;
542 int cvquals = cp_type_quals (TREE_TYPE (parm));
545 /* Initialize all the base-classes with the parameter converted
546 to their type so that we get their copy constructor and not
547 another constructor that takes current_class_type. We must
548 deal with the binfo's directly as a direct base might be
549 inaccessible due to ambiguity. */
550 for (t = CLASSTYPE_VBASECLASSES (current_class_type); t;
553 tree binfo = TREE_VALUE (t);
557 build_tree_list (NULL_TREE,
558 build_base_path (PLUS_EXPR, parm,
563 for (i = 0; i < n_bases; ++i)
565 tree binfo = TREE_VEC_ELT (binfos, i);
566 if (TREE_VIA_VIRTUAL (binfo))
571 build_tree_list (NULL_TREE,
572 build_base_path (PLUS_EXPR, parm,
577 for (; fields; fields = TREE_CHAIN (fields))
583 if (TREE_CODE (field) != FIELD_DECL)
587 if (DECL_NAME (field))
589 if (VFIELD_NAME_P (DECL_NAME (field)))
592 /* True for duplicate members. */
593 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
596 else if ((t = TREE_TYPE (field)) != NULL_TREE
597 && ANON_AGGR_TYPE_P (t)
598 && TYPE_FIELDS (t) != NULL_TREE)
599 /* Just use the field; anonymous types can't have
600 nontrivial copy ctors or assignment ops. */;
604 /* Compute the type of "init->field". If the copy-constructor
605 parameter is, for example, "const S&", and the type of
606 the field is "T", then the type will usually be "const
607 T". (There are no cv-qualified variants of reference
609 expr_type = TREE_TYPE (field);
610 if (TREE_CODE (expr_type) != REFERENCE_TYPE)
611 expr_type = cp_build_qualified_type (expr_type, cvquals);
612 init = build (COMPONENT_REF, expr_type, init, field);
613 init = build_tree_list (NULL_TREE, init);
616 = tree_cons (field, init, member_init_list);
618 finish_mem_initializers (member_init_list);
623 do_build_assign_ref (tree fndecl)
625 tree parm = TREE_CHAIN (DECL_ARGUMENTS (fndecl));
628 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
629 parm = convert_from_reference (parm);
631 if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type)
632 && is_empty_class (current_class_type))
633 /* Don't copy the padding byte; it might not have been allocated
634 if *this is a base subobject. */;
635 else if (TYPE_HAS_TRIVIAL_ASSIGN_REF (current_class_type))
637 tree t = build (MODIFY_EXPR, void_type_node, current_class_ref, parm);
638 finish_expr_stmt (t);
643 int cvquals = cp_type_quals (TREE_TYPE (parm));
646 /* Assign to each of thedirect base classes. */
647 for (i = 0; i < CLASSTYPE_N_BASECLASSES (current_class_type); ++i)
652 binfo = BINFO_BASETYPE (TYPE_BINFO (current_class_type), i);
653 /* We must convert PARM directly to the base class
654 explicitly since the base class may be ambiguous. */
655 converted_parm = build_base_path (PLUS_EXPR, parm, binfo, 1);
656 /* Call the base class assignment operator. */
658 (build_special_member_call (current_class_ref,
659 ansi_assopname (NOP_EXPR),
660 build_tree_list (NULL_TREE,
663 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL));
666 /* Assign to each of the non-static data members. */
667 for (fields = TYPE_FIELDS (current_class_type);
669 fields = TREE_CHAIN (fields))
674 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
677 if (CP_TYPE_CONST_P (TREE_TYPE (field)))
679 error ("non-static const member `%#D', can't use default assignment operator", field);
682 else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE)
684 error ("non-static reference member `%#D', can't use default assignment operator", field);
688 comp = current_class_ref;
691 if (DECL_NAME (field))
693 if (VFIELD_NAME_P (DECL_NAME (field)))
696 /* True for duplicate members. */
697 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (field)) != field)
700 else if ((t = TREE_TYPE (field)) != NULL_TREE
701 && ANON_AGGR_TYPE_P (t)
702 && TYPE_FIELDS (t) != NULL_TREE)
703 /* Just use the field; anonymous types can't have
704 nontrivial copy ctors or assignment ops. */;
708 comp = build (COMPONENT_REF, TREE_TYPE (field), comp, field);
709 init = build (COMPONENT_REF,
710 cp_build_qualified_type (TREE_TYPE (field), cvquals),
713 if (DECL_NAME (field))
714 finish_expr_stmt (build_modify_expr (comp, NOP_EXPR, init));
716 finish_expr_stmt (build (MODIFY_EXPR, TREE_TYPE (comp), comp,
720 finish_return_stmt (current_class_ref);
721 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
725 synthesize_method (tree fndecl)
727 bool nested = (current_function_decl != NULL_TREE);
728 tree context = decl_function_context (fndecl);
729 bool need_body = true;
733 import_export_decl (fndecl);
735 /* If we've been asked to synthesize a clone, just synthesize the
736 cloned function instead. Doing so will automatically fill in the
737 body for the clone. */
738 if (DECL_CLONED_FUNCTION_P (fndecl))
740 synthesize_method (DECL_CLONED_FUNCTION (fndecl));
744 /* We may be in the middle of deferred access check. Disable
746 push_deferring_access_checks (dk_no_deferred);
749 push_to_top_level ();
751 push_function_context_to (context);
753 /* Put the function definition at the position where it is needed,
754 rather than within the body of the class. That way, an error
755 during the generation of the implicit body points at the place
756 where the attempt to generate the function occurs, giving the
757 user a hint as to why we are attempting to generate the
759 DECL_SOURCE_LOCATION (fndecl) = input_location;
761 interface_unknown = 1;
762 start_function (NULL_TREE, fndecl, NULL_TREE, SF_DEFAULT | SF_PRE_PARSED);
764 stmt = begin_function_body ();
766 if (DECL_OVERLOADED_OPERATOR_P (fndecl) == NOP_EXPR)
768 do_build_assign_ref (fndecl);
771 else if (DECL_CONSTRUCTOR_P (fndecl))
773 tree arg_chain = FUNCTION_FIRST_USER_PARMTYPE (fndecl);
774 if (arg_chain != void_list_node)
775 do_build_copy_constructor (fndecl);
776 else if (TYPE_NEEDS_CONSTRUCTING (current_class_type))
777 finish_mem_initializers (NULL_TREE);
780 /* If we haven't yet generated the body of the function, just
781 generate an empty compound statement. */
785 compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
786 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
789 finish_function_body (stmt);
790 expand_body (finish_function (0));
792 extract_interface_info ();
794 pop_from_top_level ();
796 pop_function_context_from (context);
798 pop_deferring_access_checks ();
801 /* Use EXTRACTOR to locate the relevant function called for each base &
802 class field of TYPE. CLIENT allows additional information to be passed
803 to EXTRACTOR. Generates the union of all exceptions generated by those
804 functions. Note that we haven't updated TYPE_FIELDS and such of any
805 variants yet, so we need to look at the main one. */
808 synthesize_exception_spec (tree type, tree (*extractor) (tree, void*),
811 tree raises = empty_except_spec;
812 tree fields = TYPE_FIELDS (type);
813 int i, n_bases = CLASSTYPE_N_BASECLASSES (type);
814 tree binfos = TYPE_BINFO_BASETYPES (type);
816 for (i = 0; i != n_bases; i++)
818 tree base = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
819 tree fn = (*extractor) (base, client);
822 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
824 raises = merge_exception_specifiers (raises, fn_raises);
827 for (; fields; fields = TREE_CHAIN (fields))
829 tree type = TREE_TYPE (fields);
832 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
834 while (TREE_CODE (type) == ARRAY_TYPE)
835 type = TREE_TYPE (type);
836 if (TREE_CODE (type) != RECORD_TYPE)
839 fn = (*extractor) (type, client);
842 tree fn_raises = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn));
844 raises = merge_exception_specifiers (raises, fn_raises);
850 /* Locate the dtor of TYPE. */
853 locate_dtor (tree type, void *client ATTRIBUTE_UNUSED)
857 if (!TYPE_HAS_DESTRUCTOR (type))
859 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
860 CLASSTYPE_DESTRUCTOR_SLOT);
864 /* Locate the default ctor of TYPE. */
867 locate_ctor (tree type, void *client ATTRIBUTE_UNUSED)
871 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
874 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type),
875 CLASSTYPE_CONSTRUCTOR_SLOT);
876 for (; fns; fns = OVL_NEXT (fns))
878 tree fn = OVL_CURRENT (fns);
879 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
881 if (sufficient_parms_p (TREE_CHAIN (parms)))
893 /* Locate the copy ctor or copy assignment of TYPE. CLIENT_
894 points to a COPY_DATA holding the name (NULL for the ctor)
895 and desired qualifiers of the source operand. */
898 locate_copy (tree type, void *client_)
900 struct copy_data *client = (struct copy_data *)client_;
903 tree best = NULL_TREE;
904 bool excess_p = false;
908 if (TYPE_HAS_ASSIGN_REF (type))
909 ix = lookup_fnfields_1 (type, client->name);
911 else if (TYPE_HAS_INIT_REF (type))
912 ix = CLASSTYPE_CONSTRUCTOR_SLOT;
915 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
917 for (; fns; fns = OVL_NEXT (fns))
919 tree fn = OVL_CURRENT (fns);
920 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
925 parms = TREE_CHAIN (parms);
928 src_type = TREE_VALUE (parms);
929 if (TREE_CODE (src_type) == REFERENCE_TYPE)
930 src_type = TREE_TYPE (src_type);
931 if (!same_type_ignoring_top_level_qualifiers_p (src_type, type))
933 if (!sufficient_parms_p (TREE_CHAIN (parms)))
935 quals = cp_type_quals (src_type);
936 if (client->quals & ~quals)
938 excess = quals & ~client->quals;
939 if (!best || (excess_p && !excess))
951 /* Implicitly declare the special function indicated by KIND, as a
952 member of TYPE. For copy constructors and assignment operators,
953 CONST_P indicates whether these functions should take a const
954 reference argument or a non-const reference. */
957 implicitly_declare_fn (special_function_kind kind, tree type, bool const_p)
959 tree declspecs = NULL_TREE;
960 tree fn, args = NULL_TREE;
961 tree raises = empty_except_spec;
963 bool has_parm = false;
964 tree name = constructor_name (type);
970 name = build_nt (BIT_NOT_EXPR, name);
971 args = void_list_node;
972 raises = synthesize_exception_spec (type, &locate_dtor, 0);
975 case sfk_constructor:
976 /* Default constructor. */
977 args = void_list_node;
978 raises = synthesize_exception_spec (type, &locate_ctor, 0);
981 case sfk_copy_constructor:
982 case sfk_assignment_operator:
984 struct copy_data data;
990 if (kind == sfk_assignment_operator)
993 declspecs = build_tree_list (NULL_TREE, type);
995 name = ansi_assopname (NOP_EXPR);
1000 data.quals = TYPE_QUAL_CONST;
1001 argtype = build_qualified_type (argtype, TYPE_QUAL_CONST);
1004 argtype = build_reference_type (argtype);
1005 args = build_tree_list (hash_tree_chain (argtype, NULL_TREE),
1006 get_identifier ("_ctor_arg"));
1007 args = tree_cons (NULL_TREE, args, void_list_node);
1009 raises = synthesize_exception_spec (type, &locate_copy, &data);
1016 TREE_PARMLIST (args) = 1;
1019 tree declarator = make_call_declarator (name, args, NULL_TREE, raises);
1022 declarator = build_nt (ADDR_EXPR, declarator);
1024 fn = grokfield (declarator, declspecs, NULL_TREE, NULL_TREE, NULL_TREE);
1026 TREE_USED (FUNCTION_FIRST_USER_PARM (fn)) = 1;
1029 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 20000408);
1031 DECL_ARTIFICIAL (fn) = 1;
1032 DECL_NOT_REALLY_EXTERN (fn) = 1;
1033 DECL_DECLARED_INLINE_P (fn) = 1;
1034 DECL_INLINE (fn) = 1;
1040 /* Given a FUNCTION_DECL FN and a chain LIST, skip as many elements of LIST
1041 as there are artificial parms in FN. */
1044 skip_artificial_parms_for (tree fn, tree list)
1046 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1047 list = TREE_CHAIN (list);
1051 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
1052 list = TREE_CHAIN (list);
1053 if (DECL_HAS_VTT_PARM_P (fn))
1054 list = TREE_CHAIN (list);