1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 89, 92-96, 1997 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* High-level class interface. */
34 extern void compiler_error ();
36 /* In C++, structures with well-defined constructors are initialized by
37 those constructors, unasked. CURRENT_BASE_INIT_LIST
38 holds a list of stmts for a BASE_INIT term in the grammar.
39 This list has one element for each base class which must be
40 initialized. The list elements are [basename, init], with
41 type basetype. This allows the possibly anachronistic form
42 (assuming d : a, b, c) "d (int a) : c(a+5), b (a-4), a (a+3)"
43 where each successive term can be handed down the constructor
44 line. Perhaps this was not intended. */
45 tree current_base_init_list
, current_member_init_list
;
47 static void expand_aggr_vbase_init_1
PROTO((tree
, tree
, tree
, tree
));
48 static void expand_aggr_vbase_init
PROTO((tree
, tree
, tree
, tree
));
49 static void expand_aggr_init_1
PROTO((tree
, tree
, tree
, tree
, int,
51 static void expand_default_init
PROTO((tree
, tree
, tree
, tree
, int,
53 static tree build_vec_delete_1
PROTO((tree
, tree
, tree
, tree
, tree
,
55 static void perform_member_init
PROTO((tree
, tree
, tree
, int));
56 static void sort_base_init
PROTO((tree
, tree
*, tree
*));
57 static tree build_builtin_call
PROTO((tree
, tree
, tree
));
58 static tree build_array_eh_cleanup
PROTO((tree
, tree
, tree
));
59 static int member_init_ok_or_else
PROTO((tree
, tree
, char *));
60 static void expand_virtual_init
PROTO((tree
, tree
));
61 static tree sort_member_init
PROTO((tree
));
62 static tree build_partial_cleanup_for
PROTO((tree
));
63 static tree initializing_context
PROTO((tree
));
65 /* Cache _builtin_new and _builtin_delete exprs. */
66 static tree BIN
, BID
, BIVN
, BIVD
;
68 /* Cache the identifier nodes for the magic field of a new cookie. */
69 static tree nc_nelts_field_id
;
71 static tree minus_one
;
73 /* Set up local variable for this file. MUST BE CALLED AFTER
74 INIT_DECL_PROCESSING. */
76 static tree BI_header_type
, BI_header_size
;
78 void init_init_processing ()
82 /* Define implicit `operator new' and `operator delete' functions. */
83 BIN
= default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname
[(int) NEW_EXPR
])));
84 TREE_USED (TREE_OPERAND (BIN
, 0)) = 0;
85 BID
= default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname
[(int) DELETE_EXPR
])));
86 TREE_USED (TREE_OPERAND (BID
, 0)) = 0;
87 BIVN
= default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname
[(int) VEC_NEW_EXPR
])));
88 TREE_USED (TREE_OPERAND (BIVN
, 0)) = 0;
89 BIVD
= default_conversion (get_first_fn (IDENTIFIER_GLOBAL_VALUE (ansi_opname
[(int) VEC_DELETE_EXPR
])));
90 TREE_USED (TREE_OPERAND (BIVD
, 0)) = 0;
91 minus_one
= build_int_2 (-1, -1);
93 /* Define the structure that holds header information for
94 arrays allocated via operator new. */
95 BI_header_type
= make_lang_type (RECORD_TYPE
);
96 nc_nelts_field_id
= get_identifier ("nelts");
97 fields
[0] = build_lang_field_decl (FIELD_DECL
, nc_nelts_field_id
, sizetype
);
98 finish_builtin_type (BI_header_type
, "__new_cookie", fields
,
100 BI_header_size
= size_in_bytes (BI_header_type
);
103 /* Subroutine of emit_base_init. For BINFO, initialize all the
104 virtual function table pointers, except those that come from
105 virtual base classes. Initialize binfo's vtable pointer, if
106 INIT_SELF is true. CAN_ELIDE is true when we know that all virtual
107 function table pointers in all bases have been initialized already,
108 probably because their constructors have just be run. ADDR is the
109 pointer to the object whos vtables we are going to initialize.
111 REAL_BINFO is usually the same as BINFO, except when addr is not of
112 pointer to the type of the real derived type that we want to
113 initialize for. This is the case when addr is a pointer to a sub
114 object of a complete object, and we only want to do part of the
115 complete object's initialization of vtable pointers. This is done
116 for all virtual table pointers in virtual base classes. REAL_BINFO
117 is used to find the BINFO_VTABLE that we initialize with. BINFO is
118 used for conversions of addr to subobjects.
120 BINFO_TYPE (real_binfo) must be BINFO_TYPE (binfo).
122 Relies upon binfo being inside TYPE_BINFO (TREE_TYPE (TREE_TYPE
126 expand_direct_vtbls_init (real_binfo
, binfo
, init_self
, can_elide
, addr
)
127 tree real_binfo
, binfo
, addr
;
128 int init_self
, can_elide
;
130 tree real_binfos
= BINFO_BASETYPES (real_binfo
);
131 tree binfos
= BINFO_BASETYPES (binfo
);
132 int i
, n_baselinks
= real_binfos
? TREE_VEC_LENGTH (real_binfos
) : 0;
134 for (i
= 0; i
< n_baselinks
; i
++)
136 tree real_base_binfo
= TREE_VEC_ELT (real_binfos
, i
);
137 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
138 int is_not_base_vtable
139 = i
!= CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (real_binfo
));
140 if (! TREE_VIA_VIRTUAL (real_base_binfo
))
141 expand_direct_vtbls_init (real_base_binfo
, base_binfo
,
142 is_not_base_vtable
, can_elide
, addr
);
145 /* Before turning this on, make sure it is correct. */
146 if (can_elide
&& ! BINFO_MODIFIED (binfo
))
149 /* Should we use something besides CLASSTYPE_VFIELDS? */
150 if (init_self
&& CLASSTYPE_VFIELDS (BINFO_TYPE (real_binfo
)))
152 tree base_ptr
= convert_pointer_to_real (binfo
, addr
);
153 expand_virtual_init (real_binfo
, base_ptr
);
158 /* Subroutine of emit_base_init. */
161 perform_member_init (member
, name
, init
, explicit)
162 tree member
, name
, init
;
166 tree type
= TREE_TYPE (member
);
168 expand_start_target_temps ();
170 if (TYPE_NEEDS_CONSTRUCTING (type
)
171 || (init
&& TYPE_HAS_CONSTRUCTOR (type
)))
173 /* Since `init' is already a TREE_LIST on the current_member_init_list,
174 only build it into one if we aren't already a list. */
175 if (init
!= NULL_TREE
&& TREE_CODE (init
) != TREE_LIST
)
176 init
= build_expr_list (NULL_TREE
, init
);
178 decl
= build_component_ref (current_class_ref
, name
, NULL_TREE
, explicit);
181 && TREE_CODE (type
) == ARRAY_TYPE
183 && TREE_CHAIN (init
) == NULL_TREE
184 && TREE_CODE (TREE_TYPE (TREE_VALUE (init
))) == ARRAY_TYPE
)
186 /* Initialization of one array from another. */
187 expand_vec_init (TREE_OPERAND (decl
, 1), decl
,
188 array_type_nelts (type
), TREE_VALUE (init
), 1);
191 expand_aggr_init (decl
, init
, 0, 0);
195 if (init
== NULL_TREE
)
199 cp_error ("incomplete initializer for member `%D' of class `%T' which has no constructor",
200 member
, current_class_type
);
201 init
= error_mark_node
;
203 /* member traversal: note it leaves init NULL */
204 else if (TREE_CODE (TREE_TYPE (member
)) == REFERENCE_TYPE
)
205 cp_pedwarn ("uninitialized reference member `%D'", member
);
207 else if (TREE_CODE (init
) == TREE_LIST
)
209 /* There was an explicit member initialization. Do some
210 work in that case. */
211 if (TREE_CHAIN (init
))
213 warning ("initializer list treated as compound expression");
214 init
= build_compound_expr (init
);
217 init
= TREE_VALUE (init
);
220 /* We only build this with a null init if we got it from the
221 current_member_init_list. */
222 if (init
|| explicit)
224 decl
= build_component_ref (current_class_ref
, name
, NULL_TREE
, explicit);
225 expand_expr_stmt (build_modify_expr (decl
, INIT_EXPR
, init
));
229 expand_end_target_temps ();
232 if (TYPE_NEEDS_DESTRUCTOR (type
))
236 /* All cleanups must be on the function_obstack. */
237 push_obstacks_nochange ();
238 resume_temporary_allocation ();
240 expr
= build_component_ref (current_class_ref
, name
, NULL_TREE
, explicit);
241 expr
= build_delete (type
, expr
, integer_zero_node
,
242 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
244 if (expr
!= error_mark_node
)
245 add_partial_entry (expr
);
251 extern int warn_reorder
;
253 /* Subroutine of emit_member_init. */
259 tree x
, member
, name
, field
;
260 tree init_list
= NULL_TREE
;
262 tree last_field
= NULL_TREE
;
264 for (member
= TYPE_FIELDS (t
); member
; member
= TREE_CHAIN (member
))
268 /* member could be, for example, a CONST_DECL for an enumerated
269 tag; we don't want to try to initialize that, since it already
271 if (TREE_CODE (member
) != FIELD_DECL
|| !DECL_NAME (member
))
274 for (x
= current_member_init_list
, pos
= 0; x
; x
= TREE_CHAIN (x
), ++pos
)
276 /* If we cleared this out, then pay no attention to it. */
277 if (TREE_PURPOSE (x
) == NULL_TREE
)
279 name
= TREE_PURPOSE (x
);
282 /* This happens in templates, since the IDENTIFIER is replaced
283 with the COMPONENT_REF in tsubst_expr. */
284 field
= (TREE_CODE (name
) == COMPONENT_REF
285 ? TREE_OPERAND (name
, 1) : IDENTIFIER_CLASS_VALUE (name
));
287 /* Let's find out when this happens. */
288 my_friendly_assert (TREE_CODE (name
) != COMPONENT_REF
, 348);
289 field
= IDENTIFIER_CLASS_VALUE (name
);
292 /* If one member shadows another, get the outermost one. */
293 if (TREE_CODE (field
) == TREE_LIST
)
294 field
= TREE_VALUE (field
);
302 cp_warning_at ("member initializers for `%#D'", last_field
);
303 cp_warning_at (" and `%#D'", field
);
304 warning (" will be re-ordered to match declaration order");
310 /* Make sure we won't try to work on this init again. */
311 TREE_PURPOSE (x
) = NULL_TREE
;
312 x
= build_tree_list (name
, TREE_VALUE (x
));
317 /* If we didn't find MEMBER in the list, create a dummy entry
318 so the two lists (INIT_LIST and the list of members) will be
320 x
= build_tree_list (NULL_TREE
, NULL_TREE
);
322 init_list
= chainon (init_list
, x
);
325 /* Initializers for base members go at the end. */
326 for (x
= current_member_init_list
; x
; x
= TREE_CHAIN (x
))
328 name
= TREE_PURPOSE (x
);
331 if (purpose_member (name
, init_list
))
333 cp_error ("multiple initializations given for member `%D'",
334 IDENTIFIER_CLASS_VALUE (name
));
338 init_list
= chainon (init_list
,
339 build_tree_list (name
, TREE_VALUE (x
)));
340 TREE_PURPOSE (x
) = NULL_TREE
;
348 sort_base_init (t
, rbase_ptr
, vbase_ptr
)
349 tree t
, *rbase_ptr
, *vbase_ptr
;
351 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (t
));
352 int n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
358 /* For warn_reorder. */
360 tree last_base
= NULL_TREE
;
362 tree rbases
= NULL_TREE
;
363 tree vbases
= NULL_TREE
;
365 /* First walk through and splice out vbase and invalid initializers.
366 Also replace names with binfos. */
368 last
= tree_cons (NULL_TREE
, NULL_TREE
, current_base_init_list
);
369 for (x
= TREE_CHAIN (last
); x
; x
= TREE_CHAIN (x
))
371 tree basetype
= TREE_PURPOSE (x
);
372 tree binfo
= NULL_TREE
;
374 if (basetype
== NULL_TREE
)
376 /* Initializer for single base class. Must not
377 use multiple inheritance or this is ambiguous. */
378 switch (n_baseclasses
)
381 cp_error ("`%T' does not have a base class to initialize",
387 cp_error ("unnamed initializer ambiguous for `%T' which uses multiple inheritance",
391 binfo
= TREE_VEC_ELT (binfos
, 0);
393 else if (is_aggr_type (basetype
, 1))
395 binfo
= binfo_or_else (basetype
, t
);
396 if (binfo
== NULL_TREE
)
399 /* Virtual base classes are special cases. Their initializers
400 are recorded with this constructor, and they are used when
401 this constructor is the top-level constructor called. */
402 if (TREE_VIA_VIRTUAL (binfo
))
404 tree v
= CLASSTYPE_VBASECLASSES (t
);
405 while (BINFO_TYPE (v
) != BINFO_TYPE (binfo
))
408 vbases
= tree_cons (v
, TREE_VALUE (x
), vbases
);
413 /* Otherwise, if it is not an immediate base class, complain. */
414 for (i
= n_baseclasses
-1; i
>= 0; i
--)
415 if (BINFO_TYPE (binfo
) == BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)))
419 cp_error ("`%T' is not an immediate base class of `%T'",
420 basetype
, current_class_type
);
426 my_friendly_abort (365);
428 TREE_PURPOSE (x
) = binfo
;
429 TREE_CHAIN (last
) = x
;
432 TREE_CHAIN (last
) = NULL_TREE
;
434 /* Now walk through our regular bases and make sure they're initialized. */
436 for (i
= 0; i
< n_baseclasses
; ++i
)
438 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
441 if (TREE_VIA_VIRTUAL (base_binfo
))
444 for (x
= current_base_init_list
, pos
= 0; x
; x
= TREE_CHAIN (x
), ++pos
)
446 tree binfo
= TREE_PURPOSE (x
);
448 if (binfo
== NULL_TREE
)
451 if (binfo
== base_binfo
)
457 cp_warning_at ("base initializers for `%#T'", last_base
);
458 cp_warning_at (" and `%#T'", BINFO_TYPE (binfo
));
459 warning (" will be re-ordered to match inheritance order");
462 last_base
= BINFO_TYPE (binfo
);
465 /* Make sure we won't try to work on this init again. */
466 TREE_PURPOSE (x
) = NULL_TREE
;
467 x
= build_tree_list (binfo
, TREE_VALUE (x
));
472 /* If we didn't find BASE_BINFO in the list, create a dummy entry
473 so the two lists (RBASES and the list of bases) will be
475 x
= build_tree_list (NULL_TREE
, NULL_TREE
);
477 rbases
= chainon (rbases
, x
);
484 /* Perform partial cleanups for a base for exception handling. */
487 build_partial_cleanup_for (binfo
)
490 return build_scoped_method_call
491 (current_class_ref
, binfo
, dtor_identifier
,
492 build_expr_list (NULL_TREE
, integer_zero_node
));
495 /* Perform whatever initializations have yet to be done on the base
496 class of the class variable. These actions are in the global
497 variable CURRENT_BASE_INIT_LIST. Such an action could be
498 NULL_TREE, meaning that the user has explicitly called the base
499 class constructor with no arguments.
501 If there is a need for a call to a constructor, we must surround
502 that call with a pushlevel/poplevel pair, since we are technically
503 at the PARM level of scope.
505 Argument IMMEDIATELY, if zero, forces a new sequence to be
506 generated to contain these new insns, so it can be emitted later.
507 This sequence is saved in the global variable BASE_INIT_EXPR.
508 Otherwise, the insns are emitted into the current sequence.
510 Note that emit_base_init does *not* initialize virtual base
511 classes. That is done specially, elsewhere. */
513 extern tree base_init_expr
, rtl_expr_chain
;
516 emit_base_init (t
, immediately
)
522 tree rbase_init_list
, vbase_init_list
;
523 tree t_binfo
= TYPE_BINFO (t
);
524 tree binfos
= BINFO_BASETYPES (t_binfo
);
525 int i
, n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
526 tree expr
= NULL_TREE
;
531 do_pending_stack_adjust ();
532 /* Make the RTL_EXPR node temporary, not momentary,
533 so that rtl_expr_chain doesn't become garbage. */
534 momentary
= suspend_momentary ();
535 expr
= make_node (RTL_EXPR
);
536 resume_momentary (momentary
);
537 start_sequence_for_rtl_expr (expr
);
540 if (write_symbols
== NO_DEBUG
)
541 /* As a matter of principle, `start_sequence' should do this. */
544 /* Always emit a line number note so we can step into constructors. */
545 emit_line_note_force (DECL_SOURCE_FILE (current_function_decl
),
546 DECL_SOURCE_LINE (current_function_decl
));
548 mem_init_list
= sort_member_init (t
);
549 current_member_init_list
= NULL_TREE
;
551 sort_base_init (t
, &rbase_init_list
, &vbase_init_list
);
552 current_base_init_list
= NULL_TREE
;
554 if (TYPE_USES_VIRTUAL_BASECLASSES (t
))
556 tree first_arg
= TREE_CHAIN (DECL_ARGUMENTS (current_function_decl
));
558 expand_start_cond (first_arg
, 0);
559 expand_aggr_vbase_init (t_binfo
, current_class_ref
, current_class_ptr
,
564 /* Now, perform initialization of non-virtual base classes. */
565 for (i
= 0; i
< n_baseclasses
; i
++)
567 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
568 tree init
= void_list_node
;
570 if (TREE_VIA_VIRTUAL (base_binfo
))
573 #if 0 /* Once unsharing happens soon enough. */
574 my_friendly_assert (BINFO_INHERITANCE_CHAIN (base_binfo
) == t_binfo
, 999);
576 BINFO_INHERITANCE_CHAIN (base_binfo
) = t_binfo
;
579 if (TREE_PURPOSE (rbase_init_list
))
580 init
= TREE_VALUE (rbase_init_list
);
581 else if (TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (base_binfo
)))
584 if (extra_warnings
&& copy_args_p (current_function_decl
))
585 cp_warning ("base class `%#T' should be explicitly initialized in the copy constructor",
586 BINFO_TYPE (base_binfo
));
589 if (init
!= void_list_node
)
591 expand_start_target_temps ();
593 member
= convert_pointer_to_real (base_binfo
, current_class_ptr
);
594 expand_aggr_init_1 (base_binfo
, NULL_TREE
,
595 build_indirect_ref (member
, NULL_PTR
), init
,
596 BINFO_OFFSET_ZEROP (base_binfo
), LOOKUP_NORMAL
);
598 expand_end_target_temps ();
602 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
606 /* All cleanups must be on the function_obstack. */
607 push_obstacks_nochange ();
608 resume_temporary_allocation ();
609 expr
= build_partial_cleanup_for (base_binfo
);
611 add_partial_entry (expr
);
614 rbase_init_list
= TREE_CHAIN (rbase_init_list
);
617 /* Initialize all the virtual function table fields that
618 do come from virtual base classes. */
619 if (TYPE_USES_VIRTUAL_BASECLASSES (t
))
620 expand_indirect_vtbls_init (t_binfo
, current_class_ref
, current_class_ptr
);
622 /* Initialize all the virtual function table fields that
623 do not come from virtual base classes. */
624 expand_direct_vtbls_init (t_binfo
, t_binfo
, 1, 1, current_class_ptr
);
626 for (member
= TYPE_FIELDS (t
); member
; member
= TREE_CHAIN (member
))
631 /* member could be, for example, a CONST_DECL for an enumerated
632 tag; we don't want to try to initialize that, since it already
634 if (TREE_CODE (member
) != FIELD_DECL
|| !DECL_NAME (member
))
637 /* See if we had a user-specified member initialization. */
638 if (TREE_PURPOSE (mem_init_list
))
640 name
= TREE_PURPOSE (mem_init_list
);
641 init
= TREE_VALUE (mem_init_list
);
645 if (TREE_CODE (name
) == COMPONENT_REF
)
646 name
= DECL_NAME (TREE_OPERAND (name
, 1));
648 /* Also see if it's ever a COMPONENT_REF here. If it is, we
649 need to do `expand_assignment (name, init, 0, 0);' and
651 my_friendly_assert (TREE_CODE (name
) != COMPONENT_REF
, 349);
656 name
= DECL_NAME (member
);
657 init
= DECL_INITIAL (member
);
661 /* Effective C++ rule 12. */
662 if (warn_ecpp
&& init
== NULL_TREE
663 && !DECL_ARTIFICIAL (member
)
664 && TREE_CODE (TREE_TYPE (member
)) != ARRAY_TYPE
)
665 cp_warning ("`%D' should be initialized in the member initialization list", member
);
668 perform_member_init (member
, name
, init
, from_init_list
);
669 mem_init_list
= TREE_CHAIN (mem_init_list
);
672 /* Now initialize any members from our bases. */
673 while (mem_init_list
)
675 tree name
, init
, field
;
677 if (TREE_PURPOSE (mem_init_list
))
679 name
= TREE_PURPOSE (mem_init_list
);
680 init
= TREE_VALUE (mem_init_list
);
681 /* XXX: this may need the COMPONENT_REF operand 0 check if
682 it turns out we actually get them. */
683 field
= IDENTIFIER_CLASS_VALUE (name
);
685 /* If one member shadows another, get the outermost one. */
686 if (TREE_CODE (field
) == TREE_LIST
)
688 field
= TREE_VALUE (field
);
689 if (decl_type_context (field
) != current_class_type
)
690 cp_error ("field `%D' not in immediate context", field
);
694 /* It turns out if you have an anonymous union in the
695 class, a member from it can end up not being on the
696 list of fields (rather, the type is), and therefore
697 won't be seen by the for loop above. */
699 /* The code in this for loop is derived from a general loop
700 which had this check in it. Theoretically, we've hit
701 every initialization for the list of members in T, so
702 we shouldn't have anything but these left in this list. */
703 my_friendly_assert (DECL_FIELD_CONTEXT (field
) != t
, 351);
706 perform_member_init (field
, name
, init
, 1);
708 mem_init_list
= TREE_CHAIN (mem_init_list
);
713 do_pending_stack_adjust ();
714 my_friendly_assert (base_init_expr
== 0, 207);
715 base_init_expr
= expr
;
716 TREE_TYPE (expr
) = void_type_node
;
717 RTL_EXPR_RTL (expr
) = const0_rtx
;
718 RTL_EXPR_SEQUENCE (expr
) = get_insns ();
719 rtl_expr_chain
= tree_cons (NULL_TREE
, expr
, rtl_expr_chain
);
721 TREE_SIDE_EFFECTS (expr
) = 1;
724 /* All the implicit try blocks we built up will be zapped
725 when we come to a real binding contour boundary. */
728 /* Check that all fields are properly initialized after
729 an assignment to `this'. */
736 for (member
= TYPE_FIELDS (t
); member
; member
= TREE_CHAIN (member
))
737 if (DECL_NAME (member
) && TREE_USED (member
))
738 cp_error ("field `%D' used before initialized (after assignment to `this')",
742 /* This code sets up the virtual function tables appropriate for
743 the pointer DECL. It is a one-ply initialization.
745 BINFO is the exact type that DECL is supposed to be. In
746 multiple inheritance, this might mean "C's A" if C : A, B. */
749 expand_virtual_init (binfo
, decl
)
752 tree type
= BINFO_TYPE (binfo
);
754 tree vtype
, vtype_binfo
;
756 /* This code is crusty. Should be simple, like:
757 vtbl = BINFO_VTABLE (binfo);
759 vtype
= DECL_CONTEXT (CLASSTYPE_VFIELD (type
));
760 vtype_binfo
= get_binfo (vtype
, TREE_TYPE (TREE_TYPE (decl
)), 0);
761 vtbl
= BINFO_VTABLE (binfo_value (DECL_FIELD_CONTEXT (CLASSTYPE_VFIELD (type
)), binfo
));
762 assemble_external (vtbl
);
763 TREE_USED (vtbl
) = 1;
764 vtbl
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (vtbl
)), vtbl
);
765 decl
= convert_pointer_to_real (vtype_binfo
, decl
);
766 vtbl_ptr
= build_vfield_ref (build_indirect_ref (decl
, NULL_PTR
), vtype
);
767 if (vtbl_ptr
== error_mark_node
)
770 /* Have to convert VTBL since array sizes may be different. */
771 vtbl
= convert_force (TREE_TYPE (vtbl_ptr
), vtbl
, 0);
772 expand_expr_stmt (build_modify_expr (vtbl_ptr
, NOP_EXPR
, vtbl
));
775 /* Subroutine of `expand_aggr_vbase_init'.
776 BINFO is the binfo of the type that is being initialized.
777 INIT_LIST is the list of initializers for the virtual baseclass. */
780 expand_aggr_vbase_init_1 (binfo
, exp
, addr
, init_list
)
781 tree binfo
, exp
, addr
, init_list
;
783 tree init
= purpose_member (binfo
, init_list
);
784 tree ref
= build_indirect_ref (addr
, NULL_PTR
);
786 expand_start_target_temps ();
789 init
= TREE_VALUE (init
);
790 /* Call constructors, but don't set up vtables. */
791 expand_aggr_init_1 (binfo
, exp
, ref
, init
, 0, LOOKUP_COMPLAIN
);
793 expand_end_target_temps ();
797 /* Initialize this object's virtual base class pointers. This must be
798 done only at the top-level of the object being constructed.
800 INIT_LIST is list of initialization for constructor to perform. */
803 expand_aggr_vbase_init (binfo
, exp
, addr
, init_list
)
809 tree type
= BINFO_TYPE (binfo
);
811 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
813 tree result
= init_vbase_pointers (type
, addr
);
817 expand_expr_stmt (build_compound_expr (result
));
819 for (vbases
= CLASSTYPE_VBASECLASSES (type
); vbases
;
820 vbases
= TREE_CHAIN (vbases
))
822 tree tmp
= purpose_member (vbases
, result
);
823 expand_aggr_vbase_init_1 (vbases
, exp
,
824 TREE_OPERAND (TREE_VALUE (tmp
), 0),
830 /* Subroutine to perform parser actions for member initialization.
831 S_ID is the scoped identifier.
832 NAME is the name of the member.
833 INIT is the initializer, or `void_type_node' if none. */
836 do_member_init (s_id
, name
, init
)
837 tree s_id
, name
, init
;
841 if (current_class_type
== NULL_TREE
842 || ! is_aggr_typedef (s_id
, 1))
844 binfo
= get_binfo (IDENTIFIER_TYPE_VALUE (s_id
),
845 current_class_type
, 1);
846 if (binfo
== error_mark_node
)
850 error_not_base_type (IDENTIFIER_TYPE_VALUE (s_id
), current_class_type
);
854 base
= convert_pointer_to (binfo
, current_class_ptr
);
855 expand_member_init (build_indirect_ref (base
, NULL_PTR
), name
, init
);
858 /* Find the context in which this FIELD can be initialized. */
861 initializing_context (field
)
864 tree t
= DECL_CONTEXT (field
);
866 /* Anonymous union members can be initialized in the first enclosing
867 non-anonymous union context. */
868 while (t
&& ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
869 t
= TYPE_CONTEXT (t
);
873 /* Function to give error message if member initialization specification
874 is erroneous. FIELD is the member we decided to initialize.
875 TYPE is the type for which the initialization is being performed.
876 FIELD must be a member of TYPE.
878 MEMBER_NAME is the name of the member. */
881 member_init_ok_or_else (field
, type
, member_name
)
886 if (field
== error_mark_node
)
888 if (field
== NULL_TREE
|| initializing_context (field
) != type
)
890 cp_error ("class `%T' does not have any field named `%s'", type
,
894 if (TREE_STATIC (field
))
896 cp_error ("field `%#D' is static; only point of initialization is its declaration",
904 /* If NAME is a viable field name for the aggregate DECL,
905 and PARMS is a viable parameter list, then expand an _EXPR
906 which describes this initialization.
908 Note that we do not need to chase through the class's base classes
909 to look for NAME, because if it's in that list, it will be handled
910 by the constructor for that base class.
912 We do not yet have a fixed-point finder to instantiate types
913 being fed to overloaded constructors. If there is a unique
914 constructor, then argument types can be got from that one.
916 If INIT is non-NULL, then it the initialization should
917 be placed in `current_base_init_list', where it will be processed
918 by `emit_base_init'. */
921 expand_member_init (exp
, name
, init
)
922 tree exp
, name
, init
;
924 extern tree ptr_type_node
; /* should be in tree.h */
926 tree basetype
= NULL_TREE
, field
;
928 tree rval
= NULL_TREE
, type
;
930 if (exp
== NULL_TREE
)
931 return; /* complain about this later */
933 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
935 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
937 basetype
= TREE_TYPE (name
);
938 name
= DECL_NAME (name
);
941 if (name
== NULL_TREE
&& IS_AGGR_TYPE (type
))
942 switch (CLASSTYPE_N_BASECLASSES (type
))
945 error ("base class initializer specified, but no base class to initialize");
948 basetype
= TYPE_BINFO_BASETYPE (type
, 0);
951 error ("initializer for unnamed base class ambiguous");
952 cp_error ("(type `%T' uses multiple inheritance)", type
);
958 /* The grammar should not allow fields which have names
959 that are TYPENAMEs. Therefore, if the field has
960 a non-NULL TREE_TYPE, we may assume that this is an
961 attempt to initialize a base class member of the current
962 type. Otherwise, it is an attempt to initialize a
965 if (init
== void_type_node
)
968 if (name
== NULL_TREE
|| basetype
)
972 if (name
== NULL_TREE
)
976 name
= TYPE_IDENTIFIER (basetype
);
979 error ("no base class to initialize");
984 else if (basetype
!= type
985 && ! current_template_parms
986 && ! vec_binfo_member (basetype
,
987 TYPE_BINFO_BASETYPES (type
))
988 && ! binfo_member (basetype
, CLASSTYPE_VBASECLASSES (type
)))
990 if (IDENTIFIER_CLASS_VALUE (name
))
992 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
993 cp_error ("type `%T' is not an immediate or virtual basetype for `%T'",
996 cp_error ("type `%T' is not an immediate basetype for `%T'",
1001 if (purpose_member (basetype
, current_base_init_list
))
1003 cp_error ("base class `%T' already initialized", basetype
);
1007 if (warn_reorder
&& current_member_init_list
)
1009 cp_warning ("base initializer for `%T'", basetype
);
1010 warning (" will be re-ordered to precede member initializations");
1013 base_init
= build_tree_list (basetype
, init
);
1014 current_base_init_list
= chainon (current_base_init_list
, base_init
);
1021 field
= lookup_field (type
, name
, 1, 0);
1023 if (! member_init_ok_or_else (field
, type
, IDENTIFIER_POINTER (name
)))
1026 if (purpose_member (name
, current_member_init_list
))
1028 cp_error ("field `%D' already initialized", field
);
1032 member_init
= build_tree_list (name
, init
);
1033 current_member_init_list
= chainon (current_member_init_list
, member_init
);
1037 else if (name
== NULL_TREE
)
1039 compiler_error ("expand_member_init: name == NULL_TREE");
1044 field
= lookup_field (basetype
, name
, 0, 0);
1046 if (! member_init_ok_or_else (field
, basetype
, IDENTIFIER_POINTER (name
)))
1049 /* now see if there is a constructor for this type
1050 which will take these args. */
1052 if (TYPE_HAS_CONSTRUCTOR (TREE_TYPE (field
)))
1054 tree parmtypes
, fndecl
;
1056 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1058 /* just know that we've seen something for this node */
1059 DECL_INITIAL (exp
) = error_mark_node
;
1060 TREE_USED (exp
) = 1;
1062 type
= TYPE_MAIN_VARIANT (TREE_TYPE (field
));
1063 parm
= build_component_ref (exp
, name
, NULL_TREE
, 0);
1065 /* Now get to the constructors. */
1066 fndecl
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type
), 0);
1069 my_friendly_assert (TREE_CODE (fndecl
) == FUNCTION_DECL
, 209);
1071 /* If the field is unique, we can use the parameter
1072 types to guide possible type instantiation. */
1073 if (DECL_CHAIN (fndecl
) == NULL_TREE
)
1075 /* There was a confusion here between
1076 FIELD and FNDECL. The following code
1077 should be correct, but abort is here
1079 my_friendly_abort (48);
1080 parmtypes
= FUNCTION_ARG_CHAIN (fndecl
);
1084 parmtypes
= NULL_TREE
;
1088 init
= convert_arguments (parm
, parmtypes
, NULL_TREE
, fndecl
, LOOKUP_NORMAL
);
1089 if (init
== NULL_TREE
|| TREE_TYPE (init
) != error_mark_node
)
1090 rval
= build_method_call (NULL_TREE
, ctor_identifier
, init
,
1091 TYPE_BINFO (type
), LOOKUP_NORMAL
);
1095 if (rval
!= error_mark_node
)
1097 /* Now, fill in the first parm with our guy */
1098 TREE_VALUE (TREE_OPERAND (rval
, 1))
1099 = build_unary_op (ADDR_EXPR
, parm
, 0);
1100 TREE_TYPE (rval
) = ptr_type_node
;
1101 TREE_SIDE_EFFECTS (rval
) = 1;
1104 else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field
)))
1106 parm
= build_component_ref (exp
, name
, NULL_TREE
, 0);
1107 expand_aggr_init (parm
, NULL_TREE
, 0, 0);
1108 rval
= error_mark_node
;
1111 /* Now initialize the member. It does not have to
1112 be of aggregate type to receive initialization. */
1113 if (rval
!= error_mark_node
)
1114 expand_expr_stmt (rval
);
1117 /* This is like `expand_member_init', only it stores one aggregate
1120 INIT comes in two flavors: it is either a value which
1121 is to be stored in EXP, or it is a parameter list
1122 to go to a constructor, which will operate on EXP.
1123 If INIT is not a parameter list for a constructor, then set
1124 LOOKUP_ONLYCONVERTING.
1125 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1126 the initializer, if FLAGS is 0, then it is the (init) form.
1127 If `init' is a CONSTRUCTOR, then we emit a warning message,
1128 explaining that such initializations are invalid.
1130 ALIAS_THIS is nonzero iff we are initializing something which is
1131 essentially an alias for current_class_ref. In this case, the base
1132 constructor may move it on us, and we must keep track of such
1135 If INIT resolves to a CALL_EXPR which happens to return
1136 something of the type we are looking for, then we know
1137 that we can safely use that call to perform the
1140 The virtual function table pointer cannot be set up here, because
1141 we do not really know its type.
1143 Virtual baseclass pointers are also set up here.
1145 This never calls operator=().
1147 When initializing, nothing is CONST.
1149 A default copy constructor may have to be used to perform the
1152 A constructor or a conversion operator may have to be used to
1153 perform the initialization, but not both, as it would be ambiguous. */
1156 expand_aggr_init (exp
, init
, alias_this
, flags
)
1161 tree type
= TREE_TYPE (exp
);
1162 int was_const
= TREE_READONLY (exp
);
1163 int was_volatile
= TREE_THIS_VOLATILE (exp
);
1165 if (init
== error_mark_node
)
1168 TREE_READONLY (exp
) = 0;
1169 TREE_THIS_VOLATILE (exp
) = 0;
1171 if (init
&& TREE_CODE (init
) != TREE_LIST
)
1172 flags
|= LOOKUP_ONLYCONVERTING
;
1174 if (TREE_CODE (type
) == ARRAY_TYPE
)
1176 /* Must arrange to initialize each element of EXP
1177 from elements of INIT. */
1178 tree itype
= init
? TREE_TYPE (init
) : NULL_TREE
;
1179 if (TYPE_READONLY (TREE_TYPE (type
)) || TYPE_VOLATILE (TREE_TYPE (type
)))
1181 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1183 TREE_TYPE (init
) = TYPE_MAIN_VARIANT (itype
);
1185 if (init
&& TREE_TYPE (init
) == NULL_TREE
)
1187 /* Handle bad initializers like:
1191 COMPLEX(double r = 0.0, double i = 0.0) {re = r; im = i;};
1195 int main(int argc, char **argv) {
1196 COMPLEX zees(1.0, 0.0)[10];
1199 error ("bad array initializer");
1202 expand_vec_init (exp
, exp
, array_type_nelts (type
), init
,
1203 init
&& comptypes (TREE_TYPE (init
), TREE_TYPE (exp
), 1));
1204 TREE_READONLY (exp
) = was_const
;
1205 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1206 TREE_TYPE (exp
) = type
;
1208 TREE_TYPE (init
) = itype
;
1212 if (TREE_CODE (exp
) == VAR_DECL
|| TREE_CODE (exp
) == PARM_DECL
)
1213 /* just know that we've seen something for this node */
1214 TREE_USED (exp
) = 1;
1217 /* If initializing from a GNU C CONSTRUCTOR, consider the elts in the
1218 constructor as parameters to an implicit GNU C++ constructor. */
1219 if (init
&& TREE_CODE (init
) == CONSTRUCTOR
1220 && TYPE_HAS_CONSTRUCTOR (type
)
1221 && TREE_TYPE (init
) == type
)
1222 init
= CONSTRUCTOR_ELTS (init
);
1225 TREE_TYPE (exp
) = TYPE_MAIN_VARIANT (type
);
1226 expand_aggr_init_1 (TYPE_BINFO (type
), exp
, exp
,
1227 init
, alias_this
, LOOKUP_NORMAL
|flags
);
1228 TREE_TYPE (exp
) = type
;
1229 TREE_READONLY (exp
) = was_const
;
1230 TREE_THIS_VOLATILE (exp
) = was_volatile
;
1234 expand_default_init (binfo
, true_exp
, exp
, init
, alias_this
, flags
)
1241 tree type
= TREE_TYPE (exp
);
1243 /* It fails because there may not be a constructor which takes
1244 its own type as the first (or only parameter), but which does
1245 take other types via a conversion. So, if the thing initializing
1246 the expression is a unit element of type X, first try X(X&),
1247 followed by initialization by X. If neither of these work
1248 out, then look hard. */
1252 if (init
&& TREE_CODE (init
) != TREE_LIST
1253 && (flags
& LOOKUP_ONLYCONVERTING
))
1255 /* Base subobjects should only get direct-initialization. */
1256 if (true_exp
!= exp
)
1259 /* We special-case TARGET_EXPRs here to avoid an error about
1260 private copy constructors for temporaries bound to reference vars.
1261 If the TARGET_EXPR represents a call to a function that has
1262 permission to create such objects, a reference can bind directly
1263 to the return value. An object variable must be initialized
1264 via the copy constructor, even if the call is elided. */
1265 if (! (TREE_CODE (exp
) == VAR_DECL
&& DECL_ARTIFICIAL (exp
)
1266 && TREE_CODE (init
) == TARGET_EXPR
&& TREE_TYPE (init
) == type
))
1267 init
= ocp_convert (type
, init
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
1269 if (TREE_CODE (init
) == TRY_CATCH_EXPR
)
1270 /* We need to protect the initialization of a catch parm
1271 with a call to terminate(), which shows up as a TRY_CATCH_EXPR
1272 around the TARGET_EXPR for the copy constructor. See
1273 expand_start_catch_block. */
1274 TREE_OPERAND (init
, 0) = build (INIT_EXPR
, TREE_TYPE (exp
), exp
,
1275 TREE_OPERAND (init
, 0));
1277 init
= build (INIT_EXPR
, TREE_TYPE (exp
), exp
, init
);
1278 TREE_SIDE_EFFECTS (init
) = 1;
1279 expand_expr_stmt (init
);
1283 if (init
== NULL_TREE
1284 || (TREE_CODE (init
) == TREE_LIST
&& ! TREE_TYPE (init
)))
1288 init
= TREE_VALUE (parms
);
1291 parms
= build_expr_list (NULL_TREE
, init
);
1293 if (TYPE_USES_VIRTUAL_BASECLASSES (type
))
1295 if (true_exp
== exp
)
1296 parms
= expr_tree_cons (NULL_TREE
, integer_one_node
, parms
);
1298 parms
= expr_tree_cons (NULL_TREE
, integer_zero_node
, parms
);
1299 flags
|= LOOKUP_HAS_IN_CHARGE
;
1302 rval
= build_method_call (exp
, ctor_identifier
,
1303 parms
, binfo
, flags
);
1304 expand_expr_stmt (rval
);
1307 /* This function is responsible for initializing EXP with INIT
1310 BINFO is the binfo of the type for who we are performing the
1311 initialization. For example, if W is a virtual base class of A and B,
1313 If we are initializing B, then W must contain B's W vtable, whereas
1314 were we initializing C, W must contain C's W vtable.
1316 TRUE_EXP is nonzero if it is the true expression being initialized.
1317 In this case, it may be EXP, or may just contain EXP. The reason we
1318 need this is because if EXP is a base element of TRUE_EXP, we
1319 don't necessarily know by looking at EXP where its virtual
1320 baseclass fields should really be pointing. But we do know
1321 from TRUE_EXP. In constructors, we don't know anything about
1322 the value being initialized.
1324 ALIAS_THIS serves the same purpose it serves for expand_aggr_init.
1326 FLAGS is just passes to `build_method_call'. See that function for
1330 expand_aggr_init_1 (binfo
, true_exp
, exp
, init
, alias_this
, flags
)
1337 tree type
= TREE_TYPE (exp
);
1339 my_friendly_assert (init
!= error_mark_node
&& type
!= error_mark_node
, 211);
1341 /* Use a function returning the desired type to initialize EXP for us.
1342 If the function is a constructor, and its first argument is
1343 NULL_TREE, know that it was meant for us--just slide exp on
1344 in and expand the constructor. Constructors now come
1347 if (init
&& TREE_CODE (exp
) == VAR_DECL
1348 && TREE_CODE (init
) == CONSTRUCTOR
1349 && TREE_HAS_CONSTRUCTOR (init
))
1351 tree t
= store_init_value (exp
, init
);
1354 expand_decl_init (exp
);
1357 t
= build (INIT_EXPR
, type
, exp
, init
);
1358 TREE_SIDE_EFFECTS (t
) = 1;
1359 expand_expr_stmt (t
);
1363 /* We know that expand_default_init can handle everything we want
1365 expand_default_init (binfo
, true_exp
, exp
, init
, alias_this
, flags
);
1368 /* Report an error if NAME is not the name of a user-defined,
1369 aggregate type. If OR_ELSE is nonzero, give an error message. */
1372 is_aggr_typedef (name
, or_else
)
1378 if (name
== error_mark_node
)
1381 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1382 type
= IDENTIFIER_TYPE_VALUE (name
);
1386 cp_error ("`%T' is not an aggregate typedef", name
);
1390 if (! IS_AGGR_TYPE (type
)
1391 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1392 && TREE_CODE (type
) != TEMPLATE_TEMPLATE_PARM
)
1395 cp_error ("`%T' is not an aggregate type", type
);
1401 /* Report an error if TYPE is not a user-defined, aggregate type. If
1402 OR_ELSE is nonzero, give an error message. */
1405 is_aggr_type (type
, or_else
)
1409 if (type
== error_mark_node
)
1412 if (! IS_AGGR_TYPE (type
)
1413 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1414 && TREE_CODE (type
) != TEMPLATE_TEMPLATE_PARM
)
1417 cp_error ("`%T' is not an aggregate type", type
);
1423 /* Like is_aggr_typedef, but returns typedef if successful. */
1426 get_aggr_from_typedef (name
, or_else
)
1432 if (name
== error_mark_node
)
1435 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1436 type
= IDENTIFIER_TYPE_VALUE (name
);
1440 cp_error ("`%T' fails to be an aggregate typedef", name
);
1444 if (! IS_AGGR_TYPE (type
)
1445 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
1446 && TREE_CODE (type
) != TEMPLATE_TEMPLATE_PARM
)
1449 cp_error ("type `%T' is of non-aggregate type", type
);
1456 get_type_value (name
)
1459 if (name
== error_mark_node
)
1462 if (IDENTIFIER_HAS_TYPE_VALUE (name
))
1463 return IDENTIFIER_TYPE_VALUE (name
);
1469 /* This code could just as well go in `class.c', but is placed here for
1472 /* For an expression of the form TYPE :: NAME (PARMLIST), build
1473 the appropriate function call. */
1476 build_member_call (type
, name
, parmlist
)
1477 tree type
, name
, parmlist
;
1482 int dont_use_this
= 0;
1483 tree basetype_path
, decl
;
1485 if (type
== std_node
)
1486 return build_x_function_call (do_scoped_id (name
, 0), parmlist
,
1488 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1489 return build_x_function_call (lookup_namespace_name (type
, name
),
1490 parmlist
, current_class_ref
);
1492 if (TREE_CODE (name
) != TEMPLATE_ID_EXPR
)
1495 method_name
= TREE_OPERAND (name
, 0);
1497 if (TREE_CODE (method_name
) == BIT_NOT_EXPR
)
1499 method_name
= TREE_OPERAND (method_name
, 0);
1503 /* This shouldn't be here, and build_member_call shouldn't appear in
1505 if (type
&& TREE_CODE (type
) == IDENTIFIER_NODE
1506 && get_aggr_from_typedef (type
, 0) == 0)
1508 tree ns
= lookup_name (type
, 0);
1509 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
)
1511 return build_x_function_call (build_offset_ref (type
, name
), parmlist
, current_class_ref
);
1515 if (type
== NULL_TREE
|| ! is_aggr_type (type
, 1))
1516 return error_mark_node
;
1518 /* An operator we did not like. */
1519 if (name
== NULL_TREE
)
1520 return error_mark_node
;
1524 cp_error ("cannot call destructor `%T::~%T' without object", type
,
1526 return error_mark_node
;
1529 /* No object? Then just fake one up, and let build_method_call
1530 figure out what to do. */
1531 if (current_class_type
== 0
1532 || get_base_distance (type
, current_class_type
, 0, &basetype_path
) == -1)
1537 basetype_path
= TYPE_BINFO (type
);
1538 decl
= build1 (NOP_EXPR
, build_pointer_type (type
), error_mark_node
);
1540 else if (current_class_ptr
== 0)
1543 decl
= build1 (NOP_EXPR
, build_pointer_type (type
), error_mark_node
);
1547 tree olddecl
= current_class_ptr
;
1548 tree oldtype
= TREE_TYPE (TREE_TYPE (olddecl
));
1549 if (oldtype
!= type
)
1551 tree newtype
= build_type_variant (type
, TYPE_READONLY (oldtype
),
1552 TYPE_VOLATILE (oldtype
));
1553 decl
= convert_force (build_pointer_type (newtype
), olddecl
, 0);
1559 decl
= build_indirect_ref (decl
, NULL_PTR
);
1561 if (method_name
== constructor_name (type
)
1562 || method_name
== constructor_name_full (type
))
1563 return build_functional_cast (type
, parmlist
);
1564 if ((t
= lookup_fnfields (basetype_path
, method_name
, 0)))
1565 return build_method_call (decl
,
1566 TREE_CODE (name
) == TEMPLATE_ID_EXPR
1567 ? name
: method_name
,
1568 parmlist
, basetype_path
,
1569 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
);
1570 if (TREE_CODE (name
) == IDENTIFIER_NODE
1571 && ((t
= lookup_field (TYPE_BINFO (type
), name
, 1, 0))))
1573 if (t
== error_mark_node
)
1574 return error_mark_node
;
1575 if (TREE_CODE (t
) == FIELD_DECL
)
1579 cp_error ("invalid use of non-static field `%D'", t
);
1580 return error_mark_node
;
1582 decl
= build (COMPONENT_REF
, TREE_TYPE (t
), decl
, t
);
1584 else if (TREE_CODE (t
) == VAR_DECL
)
1588 cp_error ("invalid use of member `%D'", t
);
1589 return error_mark_node
;
1591 if (TYPE_LANG_SPECIFIC (TREE_TYPE (decl
)))
1592 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, decl
,
1593 parmlist
, NULL_TREE
);
1594 return build_function_call (decl
, parmlist
);
1598 cp_error ("no method `%T::%D'", type
, name
);
1599 return error_mark_node
;
1603 /* Build a reference to a member of an aggregate. This is not a
1604 C++ `&', but really something which can have its address taken,
1605 and then act as a pointer to member, for example TYPE :: FIELD
1606 can have its address taken by saying & TYPE :: FIELD.
1608 @@ Prints out lousy diagnostics for operator <typename>
1611 @@ This function should be rewritten and placed in search.c. */
1614 build_offset_ref (type
, name
)
1617 tree decl
, fnfields
, fields
, t
= error_mark_node
;
1618 tree basebinfo
= NULL_TREE
;
1621 /* class templates can come in as TEMPLATE_DECLs here. */
1622 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
1625 if (type
== std_node
)
1626 return do_scoped_id (name
, 0);
1628 if (processing_template_decl
|| uses_template_parms (type
))
1629 return build_min_nt (SCOPE_REF
, type
, name
);
1631 /* Handle namespace names fully here. */
1632 if (TREE_CODE (type
) == NAMESPACE_DECL
)
1633 return lookup_namespace_name (type
, name
);
1635 if (type
== NULL_TREE
|| ! is_aggr_type (type
, 1))
1636 return error_mark_node
;
1638 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1641 name
= TREE_OPERAND (name
, 0);
1644 if (name
== constructor_name_full (type
))
1645 name
= constructor_name (type
);
1647 if (TYPE_SIZE (complete_type (type
)) == 0)
1649 if (type
== current_class_type
)
1650 t
= IDENTIFIER_CLASS_VALUE (name
);
1655 cp_error ("incomplete type `%T' does not have member `%D'", type
,
1657 return error_mark_node
;
1659 if (TREE_CODE (t
) == TYPE_DECL
|| TREE_CODE (t
) == VAR_DECL
1660 || TREE_CODE (t
) == CONST_DECL
)
1665 if (TREE_CODE (t
) == FIELD_DECL
)
1666 sorry ("use of member in incomplete aggregate type");
1667 else if (TREE_CODE (t
) == FUNCTION_DECL
)
1668 sorry ("use of member function in incomplete aggregate type");
1670 my_friendly_abort (52);
1671 return error_mark_node
;
1674 if (current_class_type
== 0
1675 || get_base_distance (type
, current_class_type
, 0, &basebinfo
) == -1)
1677 basebinfo
= TYPE_BINFO (type
);
1678 decl
= build1 (NOP_EXPR
, type
, error_mark_node
);
1680 else if (current_class_ptr
== 0)
1681 decl
= build1 (NOP_EXPR
, type
, error_mark_node
);
1683 decl
= current_class_ref
;
1685 if (constructor_name (BINFO_TYPE (basebinfo
)) == name
)
1688 name
= dtor_identifier
;
1690 name
= ctor_identifier
;
1694 my_friendly_abort (999);
1697 fnfields
= lookup_fnfields (basebinfo
, name
, 1);
1698 fields
= lookup_field (basebinfo
, name
, 0, 0);
1700 if (fields
== error_mark_node
|| fnfields
== error_mark_node
)
1701 return error_mark_node
;
1703 /* A lot of this logic is now handled in lookup_field and
1707 extern int flag_save_memoized_contexts
;
1708 basebinfo
= TREE_PURPOSE (fnfields
);
1710 /* Go from the TREE_BASELINK to the member function info. */
1711 t
= TREE_VALUE (fnfields
);
1713 if (DECL_CHAIN (t
) == NULL_TREE
)
1717 /* unique functions are handled easily. */
1718 access
= compute_access (basebinfo
, t
);
1719 if (access
== access_protected_node
)
1721 cp_error_at ("member function `%#D' is protected", t
);
1722 error ("in this context");
1723 return error_mark_node
;
1725 if (access
== access_private_node
)
1727 cp_error_at ("member function `%#D' is private", t
);
1728 error ("in this context");
1729 return error_mark_node
;
1732 return build (OFFSET_REF
, TREE_TYPE (t
), decl
, t
);
1735 /* FNFIELDS is most likely allocated on the search_obstack,
1736 which will go away after this class scope. If we need
1737 to save this value for later (either for memoization
1738 or for use as an initializer for a static variable), then
1741 ??? The smart thing to do for the case of saving initializers
1742 is to resolve them before we're done with this scope. */
1743 if (!TREE_PERMANENT (fnfields
)
1744 && ((flag_save_memoized_contexts
&& global_bindings_p ())
1745 || ! allocation_temporary_p ()))
1746 fnfields
= copy_list (fnfields
);
1748 t
= build_tree_list (error_mark_node
, fnfields
);
1749 TREE_TYPE (t
) = build_offset_type (type
, unknown_type_node
);
1753 /* Now that we know we are looking for a field, see if we
1754 have access to that field. Lookup_field will give us the
1757 t
= lookup_field (basebinfo
, name
, 1, 0);
1759 if (t
== error_mark_node
)
1760 return error_mark_node
;
1764 cp_error ("`%D' is not a member of type `%T'", name
, type
);
1765 return error_mark_node
;
1768 if (TREE_CODE (t
) == TYPE_DECL
)
1773 /* static class members and class-specific enum
1774 values can be returned without further ado. */
1775 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == CONST_DECL
)
1778 return convert_from_reference (t
);
1781 if (TREE_CODE (t
) == FIELD_DECL
&& DECL_BIT_FIELD (t
))
1783 cp_error ("illegal pointer to bit field `%D'", t
);
1784 return error_mark_node
;
1787 /* static class functions too. */
1788 if (TREE_CODE (t
) == FUNCTION_DECL
1789 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1790 my_friendly_abort (53);
1792 /* In member functions, the form `type::name' is no longer
1793 equivalent to `this->type::name', at least not until
1794 resolve_offset_ref. */
1795 return build (OFFSET_REF
, build_offset_type (type
, TREE_TYPE (t
)), decl
, t
);
1798 /* If a OFFSET_REF made it through to here, then it did
1799 not have its address taken. */
1802 resolve_offset_ref (exp
)
1805 tree type
= TREE_TYPE (exp
);
1806 tree base
= NULL_TREE
;
1808 tree basetype
, addr
;
1810 if (TREE_CODE (exp
) == TREE_LIST
)
1812 cp_pedwarn ("assuming & on overloaded member function");
1813 return build_unary_op (ADDR_EXPR
, exp
, 0);
1816 if (TREE_CODE (exp
) == OFFSET_REF
)
1818 member
= TREE_OPERAND (exp
, 1);
1819 base
= TREE_OPERAND (exp
, 0);
1823 my_friendly_assert (TREE_CODE (type
) == OFFSET_TYPE
, 214);
1824 if (TYPE_OFFSET_BASETYPE (type
) != current_class_type
)
1826 error ("object missing in use of pointer-to-member construct");
1827 return error_mark_node
;
1830 type
= TREE_TYPE (type
);
1831 base
= current_class_ref
;
1834 if ((TREE_CODE (member
) == VAR_DECL
1835 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (member
)))
1836 || TREE_CODE (TREE_TYPE (member
)) == FUNCTION_TYPE
1837 || TREE_CODE (TREE_TYPE (member
)) == METHOD_TYPE
)
1839 /* These were static members. */
1840 if (mark_addressable (member
) == 0)
1841 return error_mark_node
;
1845 if (TREE_CODE (TREE_TYPE (member
)) == POINTER_TYPE
1846 && TREE_CODE (TREE_TYPE (TREE_TYPE (member
))) == METHOD_TYPE
)
1849 /* Syntax error can cause a member which should
1850 have been seen as static to be grok'd as non-static. */
1851 if (TREE_CODE (member
) == FIELD_DECL
&& current_class_ref
== NULL_TREE
)
1853 if (TREE_ADDRESSABLE (member
) == 0)
1855 cp_error_at ("member `%D' is non-static but referenced as a static member",
1857 error ("at this point in file");
1858 TREE_ADDRESSABLE (member
) = 1;
1860 return error_mark_node
;
1863 /* The first case is really just a reference to a member of `this'. */
1864 if (TREE_CODE (member
) == FIELD_DECL
1865 && (base
== current_class_ref
1866 || (TREE_CODE (base
) == NOP_EXPR
1867 && TREE_OPERAND (base
, 0) == error_mark_node
)))
1869 tree basetype_path
, access
;
1871 if (TREE_CODE (exp
) == OFFSET_REF
&& TREE_CODE (type
) == OFFSET_TYPE
)
1872 basetype
= TYPE_OFFSET_BASETYPE (type
);
1874 basetype
= DECL_CONTEXT (member
);
1876 base
= current_class_ptr
;
1878 if (get_base_distance (basetype
, TREE_TYPE (TREE_TYPE (base
)), 0, &basetype_path
) < 0)
1880 error_not_base_type (basetype
, TREE_TYPE (TREE_TYPE (base
)));
1881 return error_mark_node
;
1883 addr
= convert_pointer_to (basetype
, base
);
1884 access
= compute_access (basetype_path
, member
);
1885 if (access
== access_public_node
)
1886 return build (COMPONENT_REF
, TREE_TYPE (member
),
1887 build_indirect_ref (addr
, NULL_PTR
), member
);
1888 if (access
== access_protected_node
)
1890 cp_error_at ("member `%D' is protected", member
);
1891 error ("in this context");
1892 return error_mark_node
;
1894 if (access
== access_private_node
)
1896 cp_error_at ("member `%D' is private", member
);
1897 error ("in this context");
1898 return error_mark_node
;
1900 my_friendly_abort (55);
1903 /* Ensure that we have an object. */
1904 if (TREE_CODE (base
) == NOP_EXPR
1905 && TREE_OPERAND (base
, 0) == error_mark_node
)
1906 addr
= error_mark_node
;
1909 /* If this is a reference to a member function, then return the
1910 address of the member function (which may involve going
1911 through the object's vtable), otherwise, return an expression
1912 for the dereferenced pointer-to-member construct. */
1913 addr
= build_unary_op (ADDR_EXPR
, base
, 0);
1916 if (TREE_CODE (TREE_TYPE (member
)) == OFFSET_TYPE
)
1918 if (addr
== error_mark_node
)
1920 cp_error ("object missing in `%E'", exp
);
1921 return error_mark_node
;
1924 basetype
= TYPE_OFFSET_BASETYPE (TREE_TYPE (member
));
1925 addr
= convert_pointer_to (basetype
, addr
);
1926 member
= cp_convert (ptrdiff_type_node
,
1927 build_unary_op (ADDR_EXPR
, member
, 0));
1929 /* Pointer to data members are offset by one, so that a null
1930 pointer with a real value of 0 is distinguishable from an
1931 offset of the first member of a structure. */
1932 member
= build_binary_op (MINUS_EXPR
, member
,
1933 cp_convert (ptrdiff_type_node
, integer_one_node
),
1936 return build1 (INDIRECT_REF
, type
,
1937 build (PLUS_EXPR
, build_pointer_type (type
),
1940 else if (TYPE_PTRMEMFUNC_P (TREE_TYPE (member
)))
1942 return get_member_function_from_ptrfunc (&addr
, member
);
1944 my_friendly_abort (56);
1949 /* Return either DECL or its known constant value (if it has one). */
1952 decl_constant_value (decl
)
1955 if (! TREE_THIS_VOLATILE (decl
)
1957 /* These may be necessary for C, but they break C++. */
1958 ! TREE_PUBLIC (decl
)
1959 /* Don't change a variable array bound or initial value to a constant
1960 in a place where a variable is invalid. */
1963 && DECL_INITIAL (decl
) != 0
1964 && DECL_INITIAL (decl
) != error_mark_node
1965 /* This is invalid if initial value is not constant.
1966 If it has either a function call, a memory reference,
1967 or a variable, then re-evaluating it could give different results. */
1968 && TREE_CONSTANT (DECL_INITIAL (decl
))
1969 /* Check for cases where this is sub-optimal, even though valid. */
1970 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
1972 /* We must allow this to work outside of functions so that
1973 static constants can be used for array sizes. */
1974 && current_function_decl
!= 0
1975 && DECL_MODE (decl
) != BLKmode
1978 return DECL_INITIAL (decl
);
1982 /* Common subroutines of build_new and build_vec_delete. */
1984 /* Common interface for calling "builtin" functions that are not
1988 build_builtin_call (type
, node
, arglist
)
1993 tree rval
= build (CALL_EXPR
, type
, node
, arglist
, NULL_TREE
);
1994 TREE_SIDE_EFFECTS (rval
) = 1;
1995 assemble_external (TREE_OPERAND (node
, 0));
1996 TREE_USED (TREE_OPERAND (node
, 0)) = 1;
2000 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
2001 (which needs to go through some sort of groktypename) or it
2002 is the name of the class we are newing. INIT is an initialization value.
2003 It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
2004 If INIT is void_type_node, it means do *not* call a constructor
2007 For types with constructors, the data returned is initialized
2008 by the appropriate constructor.
2010 Whether the type has a constructor or not, if it has a pointer
2011 to a virtual function table, then that pointer is set up
2014 Unless I am mistaken, a call to new () will return initialized
2015 data regardless of whether the constructor itself is private or
2016 not. NOPE; new fails if the constructor is private (jcm).
2018 Note that build_new does nothing to assure that any special
2019 alignment requirements of the type are met. Rather, it leaves
2020 it up to malloc to do the right thing. Otherwise, folding to
2021 the right alignment cal cause problems if the user tries to later
2022 free the memory returned by `new'.
2024 PLACEMENT is the `placement' list for user-defined operator new (). */
2026 extern int flag_check_new
;
2029 build_new (placement
, decl
, init
, use_global_new
)
2035 tree nelts
= NULL_TREE
, t
;
2038 tree pending_sizes
= NULL_TREE
;
2040 if (decl
== error_mark_node
)
2041 return error_mark_node
;
2043 if (TREE_CODE (decl
) == TREE_LIST
)
2045 tree absdcl
= TREE_VALUE (decl
);
2046 tree last_absdcl
= NULL_TREE
;
2047 int old_immediate_size_expand
= 0;
2049 if (current_function_decl
2050 && DECL_CONSTRUCTOR_P (current_function_decl
))
2052 old_immediate_size_expand
= immediate_size_expand
;
2053 immediate_size_expand
= 0;
2056 nelts
= integer_one_node
;
2058 if (absdcl
&& TREE_CODE (absdcl
) == CALL_EXPR
)
2059 my_friendly_abort (215);
2060 while (absdcl
&& TREE_CODE (absdcl
) == INDIRECT_REF
)
2062 last_absdcl
= absdcl
;
2063 absdcl
= TREE_OPERAND (absdcl
, 0);
2066 if (absdcl
&& TREE_CODE (absdcl
) == ARRAY_REF
)
2068 /* probably meant to be a vec new */
2071 while (TREE_OPERAND (absdcl
, 0)
2072 && TREE_CODE (TREE_OPERAND (absdcl
, 0)) == ARRAY_REF
)
2074 last_absdcl
= absdcl
;
2075 absdcl
= TREE_OPERAND (absdcl
, 0);
2079 this_nelts
= TREE_OPERAND (absdcl
, 1);
2080 if (this_nelts
!= error_mark_node
)
2082 if (this_nelts
== NULL_TREE
)
2083 error ("new of array type fails to specify size");
2084 else if (processing_template_decl
)
2087 absdcl
= TREE_OPERAND (absdcl
, 0);
2091 this_nelts
= save_expr (cp_convert (sizetype
, this_nelts
));
2092 absdcl
= TREE_OPERAND (absdcl
, 0);
2093 if (this_nelts
== integer_zero_node
)
2095 warning ("zero size array reserves no space");
2096 nelts
= integer_zero_node
;
2099 nelts
= build_binary_op (MULT_EXPR
, nelts
, this_nelts
, 1);
2103 nelts
= integer_zero_node
;
2107 TREE_OPERAND (last_absdcl
, 0) = absdcl
;
2109 TREE_VALUE (decl
) = absdcl
;
2111 type
= groktypename (decl
);
2112 if (! type
|| type
== error_mark_node
)
2114 immediate_size_expand
= old_immediate_size_expand
;
2115 return error_mark_node
;
2118 if (current_function_decl
2119 && DECL_CONSTRUCTOR_P (current_function_decl
))
2121 pending_sizes
= get_pending_sizes ();
2122 immediate_size_expand
= old_immediate_size_expand
;
2125 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
2127 if (IDENTIFIER_HAS_TYPE_VALUE (decl
))
2129 /* An aggregate type. */
2130 type
= IDENTIFIER_TYPE_VALUE (decl
);
2131 decl
= TYPE_MAIN_DECL (type
);
2135 /* A builtin type. */
2136 decl
= lookup_name (decl
, 1);
2137 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 215);
2138 type
= TREE_TYPE (decl
);
2141 else if (TREE_CODE (decl
) == TYPE_DECL
)
2143 type
= TREE_TYPE (decl
);
2148 decl
= TYPE_MAIN_DECL (type
);
2151 if (processing_template_decl
)
2154 t
= min_tree_cons (min_tree_cons (NULL_TREE
, type
, NULL_TREE
),
2155 build_min_nt (ARRAY_REF
, NULL_TREE
, nelts
),
2160 rval
= build_min_nt (NEW_EXPR
, placement
, t
, init
);
2161 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2165 /* ``A reference cannot be created by the new operator. A reference
2166 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2167 returned by new.'' ARM 5.3.3 */
2168 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2170 error ("new cannot be applied to a reference type");
2171 type
= TREE_TYPE (type
);
2174 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2176 error ("new cannot be applied to a function type");
2177 return error_mark_node
;
2180 /* When the object being created is an array, the new-expression yields a
2181 pointer to the initial element (if any) of the array. For example,
2182 both new int and new int[10] return an int*. 5.3.4. */
2183 if (TREE_CODE (type
) == ARRAY_TYPE
&& has_array
== 0)
2185 nelts
= array_type_nelts_top (type
);
2187 type
= TREE_TYPE (type
);
2191 t
= build_nt (ARRAY_REF
, type
, nelts
);
2195 rval
= build (NEW_EXPR
, build_pointer_type (type
), placement
, t
, init
);
2196 NEW_EXPR_USE_GLOBAL (rval
) = use_global_new
;
2197 TREE_SIDE_EFFECTS (rval
) = 1;
2199 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2200 rval
= build1 (NOP_EXPR
, TREE_TYPE (rval
), rval
);
2201 TREE_NO_UNUSED_WARNING (rval
) = 1;
2204 rval
= build_compound_expr (chainon (pending_sizes
,
2205 build_expr_list (NULL_TREE
, rval
)));
2210 /* Called from cplus_expand_expr when expanding a NEW_EXPR. The return
2211 value is immediately handed to expand_expr. */
2217 tree placement
, init
;
2218 tree type
, true_type
, size
, rval
;
2219 tree nelts
= NULL_TREE
;
2220 tree alloc_expr
, alloc_node
= NULL_TREE
;
2222 enum tree_code code
= NEW_EXPR
;
2223 int use_cookie
, nothrow
, check_new
;
2226 placement
= TREE_OPERAND (exp
, 0);
2227 type
= TREE_OPERAND (exp
, 1);
2228 init
= TREE_OPERAND (exp
, 2);
2229 use_global_new
= NEW_EXPR_USE_GLOBAL (exp
);
2231 if (TREE_CODE (type
) == ARRAY_REF
)
2234 nelts
= TREE_OPERAND (type
, 1);
2235 type
= TREE_OPERAND (type
, 0);
2239 if (TYPE_READONLY (type
) || TYPE_VOLATILE (type
))
2240 type
= TYPE_MAIN_VARIANT (type
);
2242 /* If our base type is an array, then make sure we know how many elements
2244 while (TREE_CODE (true_type
) == ARRAY_TYPE
)
2246 tree this_nelts
= array_type_nelts_top (true_type
);
2247 nelts
= build_binary_op (MULT_EXPR
, nelts
, this_nelts
, 1);
2248 true_type
= TREE_TYPE (true_type
);
2251 if (TYPE_SIZE (complete_type (true_type
)) == 0)
2253 incomplete_type_error (0, true_type
);
2254 return error_mark_node
;
2258 size
= fold (build_binary_op (MULT_EXPR
, size_in_bytes (true_type
),
2261 size
= size_in_bytes (type
);
2263 if (true_type
== void_type_node
)
2265 error ("invalid type `void' for new");
2266 return error_mark_node
;
2269 if (TYPE_LANG_SPECIFIC (true_type
)
2270 && CLASSTYPE_ABSTRACT_VIRTUALS (true_type
))
2272 abstract_virtuals_error (NULL_TREE
, true_type
);
2273 return error_mark_node
;
2276 if (TYPE_LANG_SPECIFIC (true_type
) && IS_SIGNATURE (true_type
))
2278 signature_error (NULL_TREE
, true_type
);
2279 return error_mark_node
;
2283 /* Get a little extra space to store a couple of things before the new'ed
2284 array, if this isn't the default placement new. */
2286 use_cookie
= (has_array
&& TYPE_VEC_NEW_USES_COOKIE (true_type
)
2287 && ! (placement
&& ! TREE_CHAIN (placement
)
2288 && TREE_TYPE (TREE_VALUE (placement
)) == ptr_type_node
));
2290 /* Get a little extra space to store a couple of things before the new'ed
2291 array, if this is either non-placement new or new (nothrow). */
2293 use_cookie
= (has_array
&& TYPE_VEC_NEW_USES_COOKIE (true_type
)
2294 && (! placement
|| nothrow
));
2299 tree extra
= BI_header_size
;
2301 size
= size_binop (PLUS_EXPR
, size
, extra
);
2306 code
= VEC_NEW_EXPR
;
2308 if (init
&& pedantic
)
2309 cp_pedwarn ("initialization in array new");
2312 /* Allocate the object. */
2314 if (! has_array
&& ! placement
&& flag_this_is_variable
> 0
2315 && TYPE_NEEDS_CONSTRUCTING (true_type
) && init
!= void_type_node
)
2317 if (init
== NULL_TREE
|| TREE_CODE (init
) == TREE_LIST
)
2321 error ("constructors take parameter lists");
2322 return error_mark_node
;
2327 rval
= build_op_new_call
2328 (code
, true_type
, expr_tree_cons (NULL_TREE
, size
, placement
),
2329 LOOKUP_NORMAL
| (use_global_new
* LOOKUP_GLOBAL
));
2330 rval
= cp_convert (build_pointer_type (true_type
), rval
);
2333 /* unless an allocation function is declared with an empty excep-
2334 tion-specification (_except.spec_), throw(), it indicates failure to
2335 allocate storage by throwing a bad_alloc exception (clause _except_,
2336 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2337 cation function is declared with an empty exception-specification,
2338 throw(), it returns null to indicate failure to allocate storage and a
2339 non-null pointer otherwise.
2341 So check for a null exception spec on the op new we just called. */
2346 /* The CALL_EXPR. */
2347 tree t
= TREE_OPERAND (rval
, 0);
2349 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
2350 t
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (t
));
2352 if (t
&& TREE_VALUE (t
) == NULL_TREE
)
2355 check_new
= flag_check_new
|| nothrow
;
2357 if ((check_new
|| flag_exceptions
) && rval
)
2359 alloc_expr
= get_target_expr (rval
);
2360 alloc_node
= rval
= TREE_OPERAND (alloc_expr
, 0);
2363 alloc_expr
= NULL_TREE
;
2365 /* if rval is NULL_TREE I don't have to allocate it, but are we totally
2366 sure we have some extra bytes in that case for the BI_header_size
2367 cookies? And how does that interact with the code below? (mrs) */
2368 /* Finish up some magic for new'ed arrays */
2369 if (use_cookie
&& rval
!= NULL_TREE
)
2371 tree extra
= BI_header_size
;
2373 rval
= convert (string_type_node
, rval
); /* for ptr arithmetic */
2374 rval
= save_expr (build_binary_op (PLUS_EXPR
, rval
, extra
, 1));
2375 /* Store header info. */
2376 cookie
= build_indirect_ref (build (MINUS_EXPR
,
2377 build_pointer_type (BI_header_type
),
2378 rval
, extra
), NULL_PTR
);
2379 exp1
= build (MODIFY_EXPR
, void_type_node
,
2380 build_component_ref (cookie
, nc_nelts_field_id
,
2383 TREE_SIDE_EFFECTS (exp1
) = 1;
2384 rval
= cp_convert (build_pointer_type (true_type
), rval
);
2385 rval
= build_compound_expr
2386 (expr_tree_cons (NULL_TREE
, exp1
,
2387 build_expr_list (NULL_TREE
, rval
)));
2390 if (rval
== error_mark_node
)
2391 return error_mark_node
;
2393 /* Don't call any constructors or do any initialization. */
2394 if (init
== void_type_node
)
2397 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
)
2399 if (! TYPE_NEEDS_CONSTRUCTING (type
)
2400 && ! IS_AGGR_TYPE (type
) && ! has_array
)
2402 /* New 2.0 interpretation: `new int (10)' means
2403 allocate an int, and initialize it with 10. */
2406 rval
= save_expr (rval
);
2407 deref
= build_indirect_ref (rval
, NULL_PTR
);
2408 TREE_READONLY (deref
) = 0;
2410 if (TREE_CHAIN (init
) != NULL_TREE
)
2411 pedwarn ("initializer list being treated as compound expression");
2412 else if (TREE_CODE (init
) == CONSTRUCTOR
)
2414 pedwarn ("initializer list appears where operand should be used");
2415 init
= TREE_OPERAND (init
, 1);
2417 init
= build_compound_expr (init
);
2419 init
= convert_for_initialization (deref
, type
, init
, LOOKUP_NORMAL
,
2420 "new", NULL_TREE
, 0);
2421 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
),
2422 build_modify_expr (deref
, NOP_EXPR
, init
),
2424 TREE_NO_UNUSED_WARNING (rval
) = 1;
2425 TREE_SIDE_EFFECTS (rval
) = 1;
2427 else if (! has_array
)
2430 /* Constructors are never virtual. If it has an initialization, we
2431 need to complain if we aren't allowed to use the ctor that took
2433 int flags
= LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_COMPLAIN
;
2435 if (rval
&& TYPE_USES_VIRTUAL_BASECLASSES (true_type
))
2437 init
= expr_tree_cons (NULL_TREE
, integer_one_node
, init
);
2438 flags
|= LOOKUP_HAS_IN_CHARGE
;
2443 if (newrval
&& TREE_CODE (TREE_TYPE (newrval
)) == POINTER_TYPE
)
2444 newrval
= build_indirect_ref (newrval
, NULL_PTR
);
2446 newrval
= build_method_call (newrval
, ctor_identifier
,
2447 init
, TYPE_BINFO (true_type
), flags
);
2449 if (newrval
== NULL_TREE
|| newrval
== error_mark_node
)
2450 return error_mark_node
;
2453 TREE_HAS_CONSTRUCTOR (rval
) = 1;
2456 rval
= build (VEC_INIT_EXPR
, TREE_TYPE (rval
),
2457 save_expr (rval
), init
, nelts
);
2459 /* If any part of the object initialization terminates by throwing
2460 an exception and the new-expression does not contain a
2461 new-placement, then the deallocation function is called to free
2462 the memory in which the object was being constructed. */
2463 if (flag_exceptions
&& alloc_expr
)
2465 enum tree_code dcode
= has_array
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2467 int flags
= LOOKUP_NORMAL
| (use_global_new
* LOOKUP_GLOBAL
);
2469 /* All cleanups must last longer than normal. */
2470 int yes
= suspend_momentary ();
2473 flags
|= LOOKUP_SPECULATIVELY
;
2475 /* Copy size to the saveable obstack. */
2476 size
= copy_node (size
);
2478 /* If we have a new-placement, we need to pass the alloc TARGET_EXPR
2479 to build_op_delete_call so it can extract the args. */
2480 cleanup
= build_op_delete_call
2481 (dcode
, placement
? alloc_expr
: alloc_node
, size
, flags
);
2483 resume_momentary (yes
);
2485 /* Ack! First we allocate the memory. Then we set our sentry
2486 variable to true, and expand a cleanup that deletes the memory
2487 if sentry is true. Then we run the constructor and store the
2488 returned pointer in buf. Then we clear sentry and return buf. */
2493 /* Disable this until flow is fixed so that it doesn't
2494 think the initialization of sentry is a dead write. */
2495 tree end
, sentry
, begin
, buf
, t
= TREE_TYPE (rval
);
2497 begin
= get_target_expr (boolean_true_node
);
2498 sentry
= TREE_OPERAND (begin
, 0);
2500 yes
= suspend_momentary ();
2501 TREE_OPERAND (begin
, 2)
2502 = build (COND_EXPR
, void_type_node
, sentry
,
2503 cleanup
, void_zero_node
);
2504 resume_momentary (yes
);
2506 rval
= get_target_expr (rval
);
2508 end
= build (MODIFY_EXPR
, TREE_TYPE (sentry
),
2509 sentry
, boolean_false_node
);
2510 TREE_SIDE_EFFECTS (end
) = 1;
2512 buf
= TREE_OPERAND (rval
, 0);
2514 rval
= build (COMPOUND_EXPR
, t
, begin
,
2515 build (COMPOUND_EXPR
, t
, rval
,
2516 build (COMPOUND_EXPR
, t
, end
, buf
)));
2518 /* FIXME: this is a workaround for a crash due to overlapping
2519 exception regions. Cleanups shouldn't really happen here. */
2520 rval
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (rval
), rval
);
2522 rval
= build (TRY_CATCH_EXPR
, TREE_TYPE (rval
), rval
, cleanup
);
2523 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2528 else if (TYPE_READONLY (true_type
))
2529 cp_error ("uninitialized const in `new' of `%#T'", true_type
);
2533 if (alloc_expr
&& rval
== alloc_node
)
2535 rval
= TREE_OPERAND (alloc_expr
, 1);
2536 alloc_expr
= NULL_TREE
;
2539 if (check_new
&& alloc_expr
)
2541 /* Did we modify the storage? */
2542 tree ifexp
= build_binary_op (NE_EXPR
, alloc_node
,
2543 integer_zero_node
, 1);
2544 rval
= build_conditional_expr (ifexp
, rval
, alloc_node
);
2548 rval
= build (COMPOUND_EXPR
, TREE_TYPE (rval
), alloc_expr
, rval
);
2550 if (rval
&& TREE_TYPE (rval
) != build_pointer_type (type
))
2552 /* The type of new int [3][3] is not int *, but int [3] * */
2553 rval
= build_c_cast (build_pointer_type (type
), rval
);
2560 build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
, auto_delete
,
2562 tree base
, maxindex
, type
;
2563 tree auto_delete_vec
, auto_delete
;
2564 int use_global_delete
;
2567 tree ptype
= build_pointer_type (type
= complete_type (type
));
2568 tree size_exp
= size_in_bytes (type
);
2570 /* Temporary variables used by the loop. */
2571 tree tbase
, tbase_init
;
2573 /* This is the body of the loop that implements the deletion of a
2574 single element, and moves temp variables to next elements. */
2577 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2580 /* This is the thing that governs what to do after the loop has run. */
2581 tree deallocate_expr
= 0;
2583 /* This is the BIND_EXPR which holds the outermost iterator of the
2584 loop. It is convenient to set this variable up and test it before
2585 executing any other code in the loop.
2586 This is also the containing expression returned by this function. */
2587 tree controller
= NULL_TREE
;
2589 if (! IS_AGGR_TYPE (type
) || ! TYPE_NEEDS_DESTRUCTOR (type
))
2591 loop
= integer_zero_node
;
2595 /* The below is short by BI_header_size */
2596 virtual_size
= fold (size_binop (MULT_EXPR
, size_exp
, maxindex
));
2598 tbase
= build_decl (VAR_DECL
, NULL_TREE
, ptype
);
2599 tbase_init
= build_modify_expr (tbase
, NOP_EXPR
,
2600 fold (build (PLUS_EXPR
, ptype
,
2603 DECL_REGISTER (tbase
) = 1;
2604 controller
= build (BIND_EXPR
, void_type_node
, tbase
, NULL_TREE
, NULL_TREE
);
2605 TREE_SIDE_EFFECTS (controller
) = 1;
2607 if (auto_delete
!= integer_zero_node
2608 && auto_delete
!= integer_two_node
)
2610 tree base_tbd
= cp_convert (ptype
,
2611 build_binary_op (MINUS_EXPR
,
2612 cp_convert (ptr_type_node
, base
),
2615 /* This is the real size */
2616 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, BI_header_size
);
2617 body
= build_expr_list (NULL_TREE
,
2618 build_x_delete (ptype
, base_tbd
,
2619 2 | use_global_delete
,
2621 body
= build (COND_EXPR
, void_type_node
,
2622 build (BIT_AND_EXPR
, integer_type_node
,
2623 auto_delete
, integer_one_node
),
2624 body
, integer_zero_node
);
2629 body
= expr_tree_cons (NULL_TREE
,
2630 build_delete (ptype
, tbase
, auto_delete
,
2631 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 1),
2634 body
= expr_tree_cons (NULL_TREE
,
2635 build_modify_expr (tbase
, NOP_EXPR
, build (MINUS_EXPR
, ptype
, tbase
, size_exp
)),
2638 body
= expr_tree_cons (NULL_TREE
,
2639 build (EXIT_EXPR
, void_type_node
,
2640 build (EQ_EXPR
, boolean_type_node
, base
, tbase
)),
2643 loop
= build (LOOP_EXPR
, void_type_node
, build_compound_expr (body
));
2645 loop
= expr_tree_cons (NULL_TREE
, tbase_init
,
2646 expr_tree_cons (NULL_TREE
, loop
, NULL_TREE
));
2647 loop
= build_compound_expr (loop
);
2650 /* If the delete flag is one, or anything else with the low bit set,
2651 delete the storage. */
2652 if (auto_delete_vec
== integer_zero_node
2653 || auto_delete_vec
== integer_two_node
)
2654 deallocate_expr
= integer_zero_node
;
2659 /* The below is short by BI_header_size */
2660 virtual_size
= fold (size_binop (MULT_EXPR
, size_exp
, maxindex
));
2662 if (! TYPE_VEC_NEW_USES_COOKIE (type
))
2667 base_tbd
= cp_convert (ptype
,
2668 build_binary_op (MINUS_EXPR
,
2669 cp_convert (string_type_node
, base
),
2672 /* True size with header. */
2673 virtual_size
= size_binop (PLUS_EXPR
, virtual_size
, BI_header_size
);
2675 deallocate_expr
= build_x_delete (ptype
, base_tbd
,
2676 2 | use_global_delete
,
2678 if (auto_delete_vec
!= integer_one_node
)
2679 deallocate_expr
= build (COND_EXPR
, void_type_node
,
2680 build (BIT_AND_EXPR
, integer_type_node
,
2681 auto_delete_vec
, integer_one_node
),
2682 deallocate_expr
, integer_zero_node
);
2685 if (loop
&& deallocate_expr
!= integer_zero_node
)
2687 body
= expr_tree_cons (NULL_TREE
, loop
,
2688 expr_tree_cons (NULL_TREE
, deallocate_expr
, NULL_TREE
));
2689 body
= build_compound_expr (body
);
2694 /* Outermost wrapper: If pointer is null, punt. */
2695 body
= build (COND_EXPR
, void_type_node
,
2696 build (NE_EXPR
, boolean_type_node
, base
, integer_zero_node
),
2697 body
, integer_zero_node
);
2698 body
= build1 (NOP_EXPR
, void_type_node
, body
);
2702 TREE_OPERAND (controller
, 1) = body
;
2706 return cp_convert (void_type_node
, body
);
2709 /* Build a tree to cleanup partially built arrays.
2710 BASE is that starting address of the array.
2711 COUNT is the count of objects that have been built, that need destroying.
2712 TYPE is the type of elements in the array. */
2715 build_array_eh_cleanup (base
, count
, type
)
2716 tree base
, count
, type
;
2718 tree expr
= build_vec_delete_1 (base
, count
, type
, integer_two_node
,
2719 integer_zero_node
, 0);
2723 /* `expand_vec_init' performs initialization of a vector of aggregate
2726 DECL is passed only for error reporting, and provides line number
2727 and source file name information.
2728 BASE is the space where the vector will be.
2729 MAXINDEX is the maximum index of the array (one less than the
2730 number of elements).
2731 INIT is the (possibly NULL) initializer.
2733 FROM_ARRAY is 0 if we should init everything with INIT
2734 (i.e., every element initialized from INIT).
2735 FROM_ARRAY is 1 if we should index into INIT in parallel
2736 with initialization of DECL.
2737 FROM_ARRAY is 2 if we should index into INIT in parallel,
2738 but use assignment instead of initialization. */
2741 expand_vec_init (decl
, base
, maxindex
, init
, from_array
)
2742 tree decl
, base
, maxindex
, init
;
2746 tree iterator
, base2
= NULL_TREE
;
2747 tree type
= TREE_TYPE (TREE_TYPE (base
));
2750 maxindex
= cp_convert (ptrdiff_type_node
, maxindex
);
2751 if (maxindex
== error_mark_node
)
2752 return error_mark_node
;
2754 if (current_function_decl
== NULL_TREE
)
2756 rval
= make_tree_vec (3);
2757 TREE_VEC_ELT (rval
, 0) = base
;
2758 TREE_VEC_ELT (rval
, 1) = maxindex
;
2759 TREE_VEC_ELT (rval
, 2) = init
;
2763 size
= size_in_bytes (type
);
2765 /* Set to zero in case size is <= 0. Optimizer will delete this if
2766 it is not needed. */
2767 rval
= get_temp_regvar (build_pointer_type (type
),
2768 cp_convert (build_pointer_type (type
), null_pointer_node
));
2769 base
= default_conversion (base
);
2770 base
= cp_convert (build_pointer_type (type
), base
);
2771 expand_assignment (rval
, base
, 0, 0);
2772 base
= get_temp_regvar (build_pointer_type (type
), base
);
2774 if (init
!= NULL_TREE
2775 && TREE_CODE (init
) == CONSTRUCTOR
2776 && (! decl
|| TREE_TYPE (init
) == TREE_TYPE (decl
)))
2778 /* Initialization of array from {...}. */
2779 tree elts
= CONSTRUCTOR_ELTS (init
);
2780 tree baseref
= build1 (INDIRECT_REF
, type
, base
);
2781 tree baseinc
= build (PLUS_EXPR
, build_pointer_type (type
), base
, size
);
2782 int host_i
= TREE_INT_CST_LOW (maxindex
);
2784 if (IS_AGGR_TYPE (type
))
2789 expand_aggr_init (baseref
, TREE_VALUE (elts
), 0, 0);
2791 expand_assignment (base
, baseinc
, 0, 0);
2792 elts
= TREE_CHAIN (elts
);
2794 /* Initialize any elements by default if possible. */
2797 if (TYPE_NEEDS_CONSTRUCTING (type
) == 0)
2800 use_variable (DECL_RTL (base
));
2804 iterator
= get_temp_regvar (ptrdiff_type_node
,
2805 build_int_2 (host_i
, 0));
2807 goto init_by_default
;
2813 expand_assignment (baseref
, TREE_VALUE (elts
), 0, 0);
2815 expand_assignment (base
, baseinc
, 0, 0);
2816 elts
= TREE_CHAIN (elts
);
2820 use_variable (DECL_RTL (base
));
2826 iterator
= get_temp_regvar (ptrdiff_type_node
, maxindex
);
2831 /* If initializing one array from another,
2832 initialize element by element. */
2835 /* We rely upon the below calls the do argument checking */
2836 if (decl
== NULL_TREE
)
2838 sorry ("initialization of array from dissimilar array type");
2839 return error_mark_node
;
2843 base2
= default_conversion (init
);
2844 itype
= TREE_TYPE (base2
);
2845 base2
= get_temp_regvar (itype
, base2
);
2846 itype
= TREE_TYPE (itype
);
2848 else if (TYPE_LANG_SPECIFIC (type
)
2849 && TYPE_NEEDS_CONSTRUCTING (type
)
2850 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
2852 error ("initializer ends prematurely");
2853 return error_mark_node
;
2857 expand_start_cond (build (GE_EXPR
, boolean_type_node
,
2858 iterator
, integer_zero_node
), 0);
2859 if (TYPE_NEEDS_DESTRUCTOR (type
))
2860 expand_eh_region_start ();
2861 expand_start_loop_continue_elsewhere (1);
2865 tree to
= build1 (INDIRECT_REF
, type
, base
);
2869 from
= build1 (INDIRECT_REF
, itype
, base2
);
2873 if (from_array
== 2)
2874 expand_expr_stmt (build_modify_expr (to
, NOP_EXPR
, from
));
2875 else if (TYPE_NEEDS_CONSTRUCTING (type
))
2876 expand_aggr_init (to
, from
, 0, 0);
2878 expand_assignment (to
, from
, 0, 0);
2880 my_friendly_abort (57);
2882 else if (TREE_CODE (type
) == ARRAY_TYPE
)
2885 sorry ("cannot initialize multi-dimensional array with initializer");
2886 expand_vec_init (decl
, build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), base
),
2887 array_type_nelts (type
), 0, 0);
2890 expand_aggr_init (build1 (INDIRECT_REF
, type
, base
), init
, 0, 0);
2892 expand_assignment (base
,
2893 build (PLUS_EXPR
, build_pointer_type (type
), base
, size
),
2896 expand_assignment (base2
,
2897 build (PLUS_EXPR
, build_pointer_type (type
), base2
, size
), 0, 0);
2898 expand_loop_continue_here ();
2899 expand_exit_loop_if_false (0, build (NE_EXPR
, boolean_type_node
,
2900 build (PREDECREMENT_EXPR
, ptrdiff_type_node
, iterator
, integer_one_node
), minus_one
));
2904 use_variable (DECL_RTL (base
));
2906 use_variable (DECL_RTL (base2
));
2909 if (TYPE_NEEDS_DESTRUCTOR (type
) && flag_exceptions
)
2911 /* We have to ensure that this can live to the cleanup
2912 expansion time, since we know it is only ever needed
2913 once, generate code now. */
2914 push_obstacks_nochange ();
2915 resume_temporary_allocation ();
2917 tree e1
, cleanup
= make_node (RTL_EXPR
);
2918 TREE_TYPE (cleanup
) = void_type_node
;
2919 RTL_EXPR_RTL (cleanup
) = const0_rtx
;
2920 TREE_SIDE_EFFECTS (cleanup
) = 1;
2921 do_pending_stack_adjust ();
2922 start_sequence_for_rtl_expr (cleanup
);
2924 e1
= build_array_eh_cleanup
2926 build_binary_op (MINUS_EXPR
, maxindex
, iterator
, 1),
2928 expand_expr (e1
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
2929 do_pending_stack_adjust ();
2930 RTL_EXPR_SEQUENCE (cleanup
) = get_insns ();
2933 cleanup
= protect_with_terminate (cleanup
);
2934 expand_eh_region_end (cleanup
);
2940 use_variable (DECL_RTL (iterator
));
2945 use_variable (DECL_RTL (rval
));
2949 /* Free up storage of type TYPE, at address ADDR.
2951 TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2954 VIRTUAL_SIZE is the amount of storage that was allocated, and is
2955 used as the second argument to operator delete. It can include
2956 things like padding and magic size cookies. It has virtual in it,
2957 because if you have a base pointer and you delete through a virtual
2958 destructor, it should be the size of the dynamic object, not the
2959 static object, see Free Store 12.5 ANSI C++ WP.
2961 This does not call any destructors. */
2964 build_x_delete (type
, addr
, which_delete
, virtual_size
)
2969 int use_global_delete
= which_delete
& 1;
2970 int use_vec_delete
= !!(which_delete
& 2);
2971 enum tree_code code
= use_vec_delete
? VEC_DELETE_EXPR
: DELETE_EXPR
;
2972 int flags
= LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
);
2974 return build_op_delete_call (code
, addr
, virtual_size
, flags
);
2977 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2978 ADDR is an expression which yields the store to be destroyed.
2979 AUTO_DELETE is nonzero if a call to DELETE should be made or not.
2980 If in the program, (AUTO_DELETE & 2) is non-zero, we tear down the
2981 virtual baseclasses.
2982 If in the program, (AUTO_DELETE & 1) is non-zero, then we deallocate.
2984 FLAGS is the logical disjunction of zero or more LOOKUP_
2985 flags. See cp-tree.h for more info.
2987 This function does not delete an object's virtual base classes. */
2990 build_delete (type
, addr
, auto_delete
, flags
, use_global_delete
)
2994 int use_global_delete
;
3000 if (addr
== error_mark_node
)
3001 return error_mark_node
;
3003 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3004 set to `error_mark_node' before it gets properly cleaned up. */
3005 if (type
== error_mark_node
)
3006 return error_mark_node
;
3008 type
= TYPE_MAIN_VARIANT (type
);
3010 if (TREE_CODE (type
) == POINTER_TYPE
)
3012 type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3013 if (TYPE_SIZE (complete_type (type
)) == 0)
3015 incomplete_type_error (0, type
);
3016 return error_mark_node
;
3018 if (TREE_CODE (type
) == ARRAY_TYPE
)
3020 if (! IS_AGGR_TYPE (type
))
3022 /* Call the builtin operator delete. */
3023 return build_builtin_call (void_type_node
, BID
,
3024 build_expr_list (NULL_TREE
, addr
));
3026 if (TREE_SIDE_EFFECTS (addr
))
3027 addr
= save_expr (addr
);
3029 /* throw away const and volatile on target type of addr */
3030 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3031 ref
= build_indirect_ref (addr
, NULL_PTR
);
3033 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3036 if (TREE_SIDE_EFFECTS (addr
))
3037 addr
= save_expr (addr
);
3038 if (TYPE_DOMAIN (type
) == NULL_TREE
)
3040 error ("unknown array size in delete");
3041 return error_mark_node
;
3043 return build_vec_delete (addr
, array_type_nelts (type
),
3044 auto_delete
, integer_two_node
,
3049 /* Don't check PROTECT here; leave that decision to the
3050 destructor. If the destructor is accessible, call it,
3051 else report error. */
3052 addr
= build_unary_op (ADDR_EXPR
, addr
, 0);
3053 if (TREE_SIDE_EFFECTS (addr
))
3054 addr
= save_expr (addr
);
3056 if (TREE_CONSTANT (addr
))
3057 addr
= convert_pointer_to (type
, addr
);
3059 addr
= convert_force (build_pointer_type (type
), addr
, 0);
3061 ref
= build_indirect_ref (addr
, NULL_PTR
);
3064 my_friendly_assert (IS_AGGR_TYPE (type
), 220);
3066 if (! TYPE_NEEDS_DESTRUCTOR (type
))
3068 if (auto_delete
== integer_zero_node
)
3069 return void_zero_node
;
3071 return build_op_delete_call
3072 (DELETE_EXPR
, addr
, c_sizeof_nowarn (type
),
3073 LOOKUP_NORMAL
| (use_global_delete
* LOOKUP_GLOBAL
));
3076 /* Below, we will reverse the order in which these calls are made.
3077 If we have a destructor, then that destructor will take care
3078 of the base classes; otherwise, we must do that here. */
3079 if (TYPE_HAS_DESTRUCTOR (type
))
3081 tree passed_auto_delete
;
3082 tree do_delete
= NULL_TREE
;
3085 if (use_global_delete
)
3087 tree cond
= fold (build (BIT_AND_EXPR
, integer_type_node
,
3088 auto_delete
, integer_one_node
));
3089 tree call
= build_builtin_call
3090 (void_type_node
, BID
, build_expr_list (NULL_TREE
, addr
));
3092 cond
= fold (build (COND_EXPR
, void_type_node
, cond
,
3093 call
, void_zero_node
));
3094 if (cond
!= void_zero_node
)
3097 passed_auto_delete
= fold (build (BIT_AND_EXPR
, integer_type_node
,
3098 auto_delete
, integer_two_node
));
3101 passed_auto_delete
= auto_delete
;
3103 expr
= build_method_call
3104 (ref
, dtor_identifier
, build_expr_list (NULL_TREE
, passed_auto_delete
),
3108 expr
= build (COMPOUND_EXPR
, void_type_node
, expr
, do_delete
);
3110 if (flags
& LOOKUP_DESTRUCTOR
)
3111 /* Explicit destructor call; don't check for null pointer. */
3112 ifexp
= integer_one_node
;
3114 /* Handle deleting a null pointer. */
3115 ifexp
= fold (build_binary_op (NE_EXPR
, addr
, integer_zero_node
, 1));
3117 if (ifexp
!= integer_one_node
)
3118 expr
= build (COND_EXPR
, void_type_node
,
3119 ifexp
, expr
, void_zero_node
);
3125 /* We only get here from finish_function for a destructor. */
3126 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (type
));
3127 int i
, n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
3128 tree base_binfo
= n_baseclasses
> 0 ? TREE_VEC_ELT (binfos
, 0) : NULL_TREE
;
3129 tree exprstmt
= NULL_TREE
;
3130 tree parent_auto_delete
= auto_delete
;
3133 /* If we have member delete or vbases, we call delete in
3135 if (auto_delete
== integer_zero_node
)
3137 else if (base_binfo
== NULL_TREE
3138 || ! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
3140 cond
= build (COND_EXPR
, void_type_node
,
3141 build (BIT_AND_EXPR
, integer_type_node
, auto_delete
, integer_one_node
),
3142 build_builtin_call (void_type_node
, BID
,
3143 build_expr_list (NULL_TREE
, addr
)),
3150 exprstmt
= build_expr_list (NULL_TREE
, cond
);
3153 && ! TREE_VIA_VIRTUAL (base_binfo
)
3154 && TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo
)))
3156 tree this_auto_delete
;
3158 if (BINFO_OFFSET_ZEROP (base_binfo
))
3159 this_auto_delete
= parent_auto_delete
;
3161 this_auto_delete
= integer_zero_node
;
3163 expr
= build_scoped_method_call
3164 (ref
, base_binfo
, dtor_identifier
,
3165 build_expr_list (NULL_TREE
, this_auto_delete
));
3166 exprstmt
= expr_tree_cons (NULL_TREE
, expr
, exprstmt
);
3169 /* Take care of the remaining baseclasses. */
3170 for (i
= 1; i
< n_baseclasses
; i
++)
3172 base_binfo
= TREE_VEC_ELT (binfos
, i
);
3173 if (! TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (base_binfo
))
3174 || TREE_VIA_VIRTUAL (base_binfo
))
3177 expr
= build_scoped_method_call
3178 (ref
, base_binfo
, dtor_identifier
,
3179 build_expr_list (NULL_TREE
, integer_zero_node
));
3181 exprstmt
= expr_tree_cons (NULL_TREE
, expr
, exprstmt
);
3184 for (member
= TYPE_FIELDS (type
); member
; member
= TREE_CHAIN (member
))
3186 if (TREE_CODE (member
) != FIELD_DECL
)
3188 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (member
)))
3190 tree this_member
= build_component_ref (ref
, DECL_NAME (member
), NULL_TREE
, 0);
3191 tree this_type
= TREE_TYPE (member
);
3192 expr
= build_delete (this_type
, this_member
, integer_two_node
, flags
, 0);
3193 exprstmt
= expr_tree_cons (NULL_TREE
, expr
, exprstmt
);
3198 return build_compound_expr (exprstmt
);
3199 /* Virtual base classes make this function do nothing. */
3200 return void_zero_node
;
3204 /* For type TYPE, delete the virtual baseclass objects of DECL. */
3207 build_vbase_delete (type
, decl
)
3210 tree vbases
= CLASSTYPE_VBASECLASSES (type
);
3211 tree result
= NULL_TREE
;
3212 tree addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
3214 my_friendly_assert (addr
!= error_mark_node
, 222);
3218 tree this_addr
= convert_force (build_pointer_type (BINFO_TYPE (vbases
)),
3220 result
= expr_tree_cons (NULL_TREE
,
3221 build_delete (TREE_TYPE (this_addr
), this_addr
,
3223 LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
, 0),
3225 vbases
= TREE_CHAIN (vbases
);
3227 return build_compound_expr (nreverse (result
));
3230 /* Build a C++ vector delete expression.
3231 MAXINDEX is the number of elements to be deleted.
3232 ELT_SIZE is the nominal size of each element in the vector.
3233 BASE is the expression that should yield the store to be deleted.
3234 This function expands (or synthesizes) these calls itself.
3235 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3236 AUTO_DELETE say whether each item in the container should be deallocated.
3238 This also calls delete for virtual baseclasses of elements of the vector.
3240 Update: MAXINDEX is no longer needed. The size can be extracted from the
3241 start of the vector for pointers, and from the type for arrays. We still
3242 use MAXINDEX for arrays because it happens to already have one of the
3243 values we'd have to extract. (We could use MAXINDEX with pointers to
3244 confirm the size, and trap if the numbers differ; not clear that it'd
3245 be worth bothering.) */
3248 build_vec_delete (base
, maxindex
, auto_delete_vec
, auto_delete
,
3250 tree base
, maxindex
;
3251 tree auto_delete_vec
, auto_delete
;
3252 int use_global_delete
;
3256 if (TREE_CODE (base
) == OFFSET_REF
)
3257 base
= resolve_offset_ref (base
);
3259 type
= TREE_TYPE (base
);
3261 base
= stabilize_reference (base
);
3263 /* Since we can use base many times, save_expr it. */
3264 if (TREE_SIDE_EFFECTS (base
))
3265 base
= save_expr (base
);
3267 if (TREE_CODE (type
) == POINTER_TYPE
)
3269 /* Step back one from start of vector, and read dimension. */
3270 tree cookie_addr
= build (MINUS_EXPR
, build_pointer_type (BI_header_type
),
3271 base
, BI_header_size
);
3272 tree cookie
= build_indirect_ref (cookie_addr
, NULL_PTR
);
3273 maxindex
= build_component_ref (cookie
, nc_nelts_field_id
, NULL_TREE
, 0);
3275 type
= TREE_TYPE (type
);
3276 while (TREE_CODE (type
) == ARRAY_TYPE
);
3278 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3280 /* get the total number of things in the array, maxindex is a bad name */
3281 maxindex
= array_type_nelts_total (type
);
3282 while (TREE_CODE (type
) == ARRAY_TYPE
)
3283 type
= TREE_TYPE (type
);
3284 base
= build_unary_op (ADDR_EXPR
, base
, 1);
3288 if (base
!= error_mark_node
)
3289 error ("type to vector delete is neither pointer or array type");
3290 return error_mark_node
;
3293 return build_vec_delete_1 (base
, maxindex
, type
, auto_delete_vec
, auto_delete
,