1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization.
29 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
30 and to process initializations in declarations (since they work
31 like a strange sort of assignment). */
45 static tree convert_for_assignment PARAMS ((tree, tree, const char *, tree,
47 static tree pointer_int_sum PARAMS ((enum tree_code, tree, tree));
48 static tree rationalize_conditional_expr PARAMS ((enum tree_code, tree));
49 static int comp_target_parms PARAMS ((tree, tree, int));
50 static int comp_ptr_ttypes_real PARAMS ((tree, tree, int));
51 static int comp_ptr_ttypes_const PARAMS ((tree, tree));
52 static int comp_ptr_ttypes_reinterpret PARAMS ((tree, tree));
53 static int comp_except_types PARAMS ((tree, tree, int));
54 static int comp_array_types PARAMS ((int (*) (tree, tree, int), tree,
56 static tree common_base_type PARAMS ((tree, tree));
58 static tree convert_sequence PARAMS ((tree, tree));
60 static tree lookup_anon_field PARAMS ((tree, tree));
61 static tree pointer_diff PARAMS ((tree, tree, tree));
62 static tree build_component_addr PARAMS ((tree, tree));
63 static tree qualify_type PARAMS ((tree, tree));
64 static tree qualify_type_recursive PARAMS ((tree, tree));
65 static tree get_delta_difference PARAMS ((tree, tree, int));
66 static int comp_cv_target_types PARAMS ((tree, tree, int));
67 static void casts_away_constness_r PARAMS ((tree *, tree *));
68 static int casts_away_constness PARAMS ((tree, tree));
69 static void maybe_warn_about_returning_address_of_local PARAMS ((tree));
70 static tree strip_all_pointer_quals PARAMS ((tree));
72 /* Return the target type of TYPE, which means return T for:
73 T*, T&, T[], T (...), and otherwise, just T. */
79 if (TREE_CODE (type) == REFERENCE_TYPE)
80 type = TREE_TYPE (type);
81 while (TREE_CODE (type) == POINTER_TYPE
82 || TREE_CODE (type) == ARRAY_TYPE
83 || TREE_CODE (type) == FUNCTION_TYPE
84 || TREE_CODE (type) == METHOD_TYPE
85 || TREE_CODE (type) == OFFSET_TYPE)
86 type = TREE_TYPE (type);
90 /* Do `exp = require_complete_type (exp);' to make sure exp
91 does not have an incomplete type. (That includes void types.)
92 Returns the error_mark_node if the VALUE does not have
93 complete type when this function returns. */
96 require_complete_type (value)
101 if (processing_template_decl || value == error_mark_node)
104 if (TREE_CODE (value) == OVERLOAD)
105 type = unknown_type_node;
107 type = TREE_TYPE (value);
109 /* First, detect a valid value with a complete type. */
110 if (COMPLETE_TYPE_P (type))
113 /* If we see X::Y, we build an OFFSET_TYPE which has
114 not been laid out. Try to avoid an error by interpreting
115 it as this->X::Y, if reasonable. */
116 if (TREE_CODE (value) == OFFSET_REF
117 && current_class_ref != 0
118 && TREE_OPERAND (value, 0) == current_class_ref)
120 tree base, member = TREE_OPERAND (value, 1);
121 tree basetype = TYPE_OFFSET_BASETYPE (type);
122 my_friendly_assert (TREE_CODE (member) == FIELD_DECL, 305);
123 base = convert_pointer_to (basetype, current_class_ptr);
124 value = build (COMPONENT_REF, TREE_TYPE (member),
125 build_indirect_ref (base, NULL_PTR), member);
126 return require_complete_type (value);
129 if (complete_type_or_else (type, value))
132 return error_mark_node;
135 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
136 a template instantiation, do the instantiation. Returns TYPE,
137 whether or not it could be completed, unless something goes
138 horribly wrong, in which case the error_mark_node is returned. */
144 if (type == NULL_TREE)
145 /* Rather than crash, we return something sure to cause an error
147 return error_mark_node;
149 if (type == error_mark_node || COMPLETE_TYPE_P (type))
151 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
153 tree t = complete_type (TREE_TYPE (type));
154 if (COMPLETE_TYPE_P (t) && ! processing_template_decl)
156 TYPE_NEEDS_CONSTRUCTING (type)
157 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
158 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
159 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
161 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
162 instantiate_class_template (TYPE_MAIN_VARIANT (type));
167 /* Like complete_type, but issue an error if the TYPE cannot be
168 completed. VALUE is used for informative diagnostics.
169 Returns NULL_TREE if the type cannot be made complete. */
172 complete_type_or_else (type, value)
176 type = complete_type (type);
177 if (type == error_mark_node)
178 /* We already issued an error. */
180 else if (!COMPLETE_TYPE_P (type))
182 incomplete_type_error (value, type);
189 /* Return truthvalue of whether type of EXP is instantiated. */
195 return (TREE_CODE (exp) == OVERLOAD
196 || TREE_CODE (exp) == TREE_LIST
197 || TREE_TYPE (exp) == unknown_type_node
198 || (TREE_CODE (TREE_TYPE (exp)) == OFFSET_TYPE
199 && TREE_TYPE (TREE_TYPE (exp)) == unknown_type_node));
202 /* Return a variant of TYPE which has all the type qualifiers of LIKE
203 as well as those of TYPE. */
206 qualify_type (type, like)
209 /* @@ Must do member pointers here. */
210 return cp_build_qualified_type (type, (CP_TYPE_QUALS (type)
211 | CP_TYPE_QUALS (like)));
214 /* Return a pointer or pointer to member type similar to T1, with a
215 cv-qualification signature that is the union of the cv-qualification
216 signatures of T1 and T2: [expr.rel], [expr.eq]. */
219 qualify_type_recursive (t1, t2)
222 if ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
223 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2)))
225 tree tt1 = TREE_TYPE (t1);
226 tree tt2 = TREE_TYPE (t2);
230 tree attributes = merge_machine_type_attributes (t1, t2);
232 if (TREE_CODE (tt1) == OFFSET_TYPE)
234 b1 = TYPE_OFFSET_BASETYPE (tt1);
235 tt1 = TREE_TYPE (tt1);
236 tt2 = TREE_TYPE (tt2);
241 type_quals = (CP_TYPE_QUALS (tt1) | CP_TYPE_QUALS (tt2));
242 target = qualify_type_recursive (tt1, tt2);
243 target = cp_build_qualified_type (target, type_quals);
245 target = build_offset_type (b1, target);
246 t1 = build_pointer_type (target);
247 t1 = build_type_attribute_variant (t1, attributes);
252 /* Return the common type of two parameter lists.
253 We assume that comptypes has already been done and returned 1;
254 if that isn't so, this may crash.
256 As an optimization, free the space we allocate if the parameter
257 lists are already common. */
263 tree oldargs = p1, newargs, n;
267 len = list_length (p1);
268 newargs = tree_last (p1);
270 if (newargs == void_list_node)
279 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
284 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
286 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
288 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
291 else if (! TREE_PURPOSE (p1))
293 if (TREE_PURPOSE (p2))
295 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
301 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
303 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
305 if (TREE_VALUE (p1) != TREE_VALUE (p2))
308 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
311 TREE_VALUE (n) = TREE_VALUE (p1);
319 /* Given a type, perhaps copied for a typedef,
320 find the "original" version of it. */
325 while (TYPE_NAME (t) != NULL_TREE)
327 tree x = TYPE_NAME (t);
328 if (TREE_CODE (x) != TYPE_DECL)
330 x = DECL_ORIGINAL_TYPE (x);
338 /* T1 and T2 are arithmetic or enumeration types. Return the type
339 that will result from the "usual arithmetic converions" on T1 and
340 T2 as described in [expr]. */
343 type_after_usual_arithmetic_conversions (t1, t2)
347 enum tree_code code1 = TREE_CODE (t1);
348 enum tree_code code2 = TREE_CODE (t2);
351 /* FIXME: Attributes. */
352 my_friendly_assert (ARITHMETIC_TYPE_P (t1)
353 || TREE_CODE (t1) == ENUMERAL_TYPE,
355 my_friendly_assert (ARITHMETIC_TYPE_P (t2)
356 || TREE_CODE (t2) == ENUMERAL_TYPE,
359 /* In what follows, we slightly generalize the rules given in [expr]
360 so as to deal with `long long'. First, merge the attributes. */
361 attributes = merge_machine_type_attributes (t1, t2);
363 /* If only one is real, use it as the result. */
364 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
365 return build_type_attribute_variant (t1, attributes);
366 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
367 return build_type_attribute_variant (t2, attributes);
369 /* Perform the integral promotions. */
370 if (code1 != REAL_TYPE)
372 t1 = type_promotes_to (t1);
373 t2 = type_promotes_to (t2);
376 /* Both real or both integers; use the one with greater precision. */
377 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
378 return build_type_attribute_variant (t1, attributes);
379 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
380 return build_type_attribute_variant (t2, attributes);
382 if (code1 != REAL_TYPE)
384 /* If one is a sizetype, use it so size_binop doesn't blow up. */
385 if (TYPE_IS_SIZETYPE (t1) > TYPE_IS_SIZETYPE (t2))
386 return build_type_attribute_variant (t1, attributes);
387 if (TYPE_IS_SIZETYPE (t2) > TYPE_IS_SIZETYPE (t1))
388 return build_type_attribute_variant (t2, attributes);
390 /* If one is unsigned long long, then convert the other to unsigned
392 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
393 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
394 return build_type_attribute_variant (long_long_unsigned_type_node,
396 /* If one is a long long, and the other is an unsigned long, and
397 long long can represent all the values of an unsigned long, then
398 convert to a long long. Otherwise, convert to an unsigned long
399 long. Otherwise, if either operand is long long, convert the
402 Since we're here, we know the TYPE_PRECISION is the same;
403 therefore converting to long long cannot represent all the values
404 of an unsigned long, so we choose unsigned long long in that
406 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
407 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
409 tree t = ((TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
410 ? long_long_unsigned_type_node
411 : long_long_integer_type_node);
412 return build_type_attribute_variant (t, attributes);
415 /* Go through the same procedure, but for longs. */
416 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
417 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
418 return build_type_attribute_variant (long_unsigned_type_node,
420 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
421 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
423 tree t = ((TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
424 ? long_unsigned_type_node : long_integer_type_node);
425 return build_type_attribute_variant (t, attributes);
427 /* Otherwise prefer the unsigned one. */
428 if (TREE_UNSIGNED (t1))
429 return build_type_attribute_variant (t1, attributes);
431 return build_type_attribute_variant (t2, attributes);
435 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
436 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
437 return build_type_attribute_variant (long_double_type_node,
439 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
440 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
441 return build_type_attribute_variant (double_type_node,
444 return build_type_attribute_variant (float_type_node,
449 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
450 ARG1 and ARG2 are the values with those types. The LOCATION is a
451 string describing the current location, in case an error occurs. */
454 composite_pointer_type (t1, t2, arg1, arg2, location)
459 const char* location;
465 If one operand is a null pointer constant, the composite pointer
466 type is the type of the other operand. */
467 if (null_ptr_cst_p (arg1))
469 if (null_ptr_cst_p (arg2))
472 /* Deal with pointer-to-member functions in the same way as we deal
473 with pointers to functions. */
474 if (TYPE_PTRMEMFUNC_P (t1))
475 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
476 if (TYPE_PTRMEMFUNC_P (t2))
477 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
479 if (VOID_TYPE_P (TREE_TYPE (t1)))
481 if (pedantic && TYPE_PTRFN_P (t2))
482 pedwarn ("ISO C++ forbids %s between pointer of type `void *' and pointer-to-function", location);
483 result_type = qualify_type (t1, t2);
485 else if (VOID_TYPE_P (TREE_TYPE (t2)))
487 if (pedantic && TYPE_PTRFN_P (t1))
488 pedwarn ("ISO C++ forbids %s between pointer of type `void *' and pointer-to-function", location);
489 result_type = qualify_type (t2, t1);
493 tree full1 = qualify_type_recursive (t1, t2);
494 tree full2 = qualify_type_recursive (t2, t1);
496 int val = comp_target_types (full1, full2, 1);
504 cp_pedwarn ("%s between distinct pointer types `%T' and `%T' lacks a cast",
506 result_type = ptr_type_node;
513 /* Return the common type of two types.
514 We assume that comptypes has already been done and returned 1;
515 if that isn't so, this may crash.
517 This is the type for the result of most arithmetic operations
518 if the operands have the given two types.
520 We do not deal with enumeral types here because they have already been
521 converted to integer types. */
527 register enum tree_code code1;
528 register enum tree_code code2;
531 /* Save time if the two types are the same. */
534 t1 = original_type (t1);
535 t2 = original_type (t2);
539 /* If one type is nonsense, use the other. */
540 if (t1 == error_mark_node)
542 if (t2 == error_mark_node)
545 if ((ARITHMETIC_TYPE_P (t1) || TREE_CODE (t1) == ENUMERAL_TYPE)
546 && (ARITHMETIC_TYPE_P (t2) || TREE_CODE (t2) == ENUMERAL_TYPE))
547 return type_after_usual_arithmetic_conversions (t1, t2);
549 /* Merge the attributes. */
550 attributes = merge_machine_type_attributes (t1, t2);
552 /* Treat an enum type as the unsigned integer type of the same width. */
554 if (TREE_CODE (t1) == ENUMERAL_TYPE)
555 t1 = type_for_size (TYPE_PRECISION (t1), 1);
556 if (TREE_CODE (t2) == ENUMERAL_TYPE)
557 t2 = type_for_size (TYPE_PRECISION (t2), 1);
559 if (TYPE_PTRMEMFUNC_P (t1))
560 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
561 if (TYPE_PTRMEMFUNC_P (t2))
562 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
564 code1 = TREE_CODE (t1);
565 code2 = TREE_CODE (t2);
567 /* If one type is complex, form the common type of the non-complex
568 components, then make that complex. Use T1 or T2 if it is the
570 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
572 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
573 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
574 tree subtype = common_type (subtype1, subtype2);
576 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
577 return build_type_attribute_variant (t1, attributes);
578 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
579 return build_type_attribute_variant (t2, attributes);
581 return build_type_attribute_variant (build_complex_type (subtype),
589 /* We should have called type_after_usual_arithmetic_conversions
591 my_friendly_abort (19990725);
596 /* For two pointers, do this recursively on the target type,
597 and combine the qualifiers of the two types' targets. */
598 /* This code was turned off; I don't know why.
599 But ISO C++ specifies doing this with the qualifiers.
600 So I turned it on again. */
602 tree tt1 = TREE_TYPE (t1);
603 tree tt2 = TREE_TYPE (t2);
608 if (TREE_CODE (tt1) == OFFSET_TYPE)
610 b1 = TYPE_OFFSET_BASETYPE (tt1);
611 b2 = TYPE_OFFSET_BASETYPE (tt2);
612 tt1 = TREE_TYPE (tt1);
613 tt2 = TREE_TYPE (tt2);
618 type_quals = (CP_TYPE_QUALS (tt1) | CP_TYPE_QUALS (tt2));
619 tt1 = TYPE_MAIN_VARIANT (tt1);
620 tt2 = TYPE_MAIN_VARIANT (tt2);
624 else if (VOID_TYPE_P (tt1) || VOID_TYPE_P (tt2))
625 target = void_type_node;
626 else if (tt1 == unknown_type_node)
628 else if (tt2 == unknown_type_node)
631 target = common_type (tt1, tt2);
633 target = cp_build_qualified_type (target, type_quals);
637 if (same_type_p (b1, b2)
638 || (DERIVED_FROM_P (b1, b2) && binfo_or_else (b1, b2)))
639 target = build_offset_type (b2, target);
640 else if (binfo_or_else (b2, b1))
641 target = build_offset_type (b1, target);
644 if (code1 == POINTER_TYPE)
645 t1 = build_pointer_type (target);
647 t1 = build_reference_type (target);
648 t1 = build_type_attribute_variant (t1, attributes);
650 if (TREE_CODE (target) == METHOD_TYPE)
651 t1 = build_ptrmemfunc_type (t1);
658 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
659 /* Save space: see if the result is identical to one of the args. */
660 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
661 return build_type_attribute_variant (t1, attributes);
662 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
663 return build_type_attribute_variant (t2, attributes);
664 /* Merge the element types, and have a size if either arg has one. */
665 t1 = build_cplus_array_type
666 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
667 return build_type_attribute_variant (t1, attributes);
671 /* Function types: prefer the one that specified arg types.
672 If both do, merge the arg types. Also merge the return types. */
674 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
675 tree p1 = TYPE_ARG_TYPES (t1);
676 tree p2 = TYPE_ARG_TYPES (t2);
679 /* Save space: see if the result is identical to one of the args. */
680 if (valtype == TREE_TYPE (t1) && ! p2)
681 return build_type_attribute_variant (t1, attributes);
682 if (valtype == TREE_TYPE (t2) && ! p1)
683 return build_type_attribute_variant (t2, attributes);
685 /* Simple way if one arg fails to specify argument types. */
686 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
688 rval = build_function_type (valtype, p2);
689 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
690 rval = build_exception_variant (rval, raises);
691 return build_type_attribute_variant (rval, attributes);
693 raises = TYPE_RAISES_EXCEPTIONS (t1);
694 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
696 rval = build_function_type (valtype, p1);
698 rval = build_exception_variant (rval, raises);
699 return build_type_attribute_variant (rval, attributes);
702 rval = build_function_type (valtype, commonparms (p1, p2));
703 rval = build_exception_variant (rval, raises);
704 return build_type_attribute_variant (rval, attributes);
709 t1 = TYPE_MAIN_VARIANT (t1);
710 t2 = TYPE_MAIN_VARIANT (t2);
712 if (DERIVED_FROM_P (t1, t2) && binfo_or_else (t1, t2))
713 return build_type_attribute_variant (t1, attributes);
714 else if (binfo_or_else (t2, t1))
715 return build_type_attribute_variant (t2, attributes);
718 compiler_error ("common_type called with uncommon aggregate types");
719 return error_mark_node;
723 if (TREE_CODE (TREE_TYPE (t1)) == TREE_CODE (TREE_TYPE (t2)))
725 /* Get this value the long way, since TYPE_METHOD_BASETYPE
726 is just the main variant of this. */
730 tree b1 = TYPE_OFFSET_BASETYPE (t1);
731 tree b2 = TYPE_OFFSET_BASETYPE (t2);
733 if (same_type_p (b1, b2)
734 || (DERIVED_FROM_P (b1, b2) && binfo_or_else (b1, b2)))
735 basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
738 if (binfo_or_else (b2, b1) == NULL_TREE)
739 compiler_error ("common_type called with uncommon method types");
740 basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t1)));
743 raises = TYPE_RAISES_EXCEPTIONS (t1);
745 /* If this was a member function type, get back to the
746 original type of type member function (i.e., without
747 the class instance variable up front. */
748 t1 = build_function_type (TREE_TYPE (t1),
749 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
750 t2 = build_function_type (TREE_TYPE (t2),
751 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
752 t3 = common_type (t1, t2);
753 t3 = build_cplus_method_type (basetype, TREE_TYPE (t3),
754 TYPE_ARG_TYPES (t3));
755 t1 = build_exception_variant (t3, raises);
758 compiler_error ("common_type called with uncommon method types");
760 return build_type_attribute_variant (t1, attributes);
763 /* Pointers to members should now be handled by the POINTER_TYPE
765 my_friendly_abort (990325);
768 return build_type_attribute_variant (t1, attributes);
772 /* Compare two exception specifier types for exactness or subsetness, if
773 allowed. Returns 0 for mismatch, 1 for same, 2 if B is allowed by A.
775 [except.spec] "If a class X ... objects of class X or any class publicly
776 and unambigously derrived from X. Similarly, if a pointer type Y * ...
777 exceptions of type Y * or that are pointers to any type publicly and
778 unambigously derrived from Y. Otherwise a function only allows exceptions
779 that have the same type ..."
780 This does not mention cv qualifiers and is different to what throw
781 [except.throw] and catch [except.catch] will do. They will ignore the
782 top level cv qualifiers, and allow qualifiers in the pointer to class
785 We implement the letter of the standard. */
788 comp_except_types (a, b, exact)
792 if (same_type_p (a, b))
796 if (CP_TYPE_QUALS (a) || CP_TYPE_QUALS (b))
799 if (TREE_CODE (a) == POINTER_TYPE
800 && TREE_CODE (b) == POINTER_TYPE)
804 if (CP_TYPE_QUALS (a) || CP_TYPE_QUALS (b))
808 if (TREE_CODE (a) != RECORD_TYPE
809 || TREE_CODE (b) != RECORD_TYPE)
812 if (ACCESSIBLY_UNIQUELY_DERIVED_P (a, b))
818 /* Return 1 if TYPE1 and TYPE2 are equivalent exception specifiers.
819 If EXACT is 0, T2 can be a subset of T1 (according to 15.4/7),
820 otherwise it must be exact. Exception lists are unordered, but
821 we've already filtered out duplicates. Most lists will be in order,
822 we should try to make use of that. */
825 comp_except_specs (t1, t2, exact)
836 if (t1 == NULL_TREE) /* T1 is ... */
837 return t2 == NULL_TREE || !exact;
838 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
839 return t2 != NULL_TREE && !TREE_VALUE (t2);
840 if (t2 == NULL_TREE) /* T2 is ... */
842 if (TREE_VALUE(t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
845 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
846 Count how many we find, to determine exactness. For exact matching and
847 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
849 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
851 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
853 tree a = TREE_VALUE (probe);
854 tree b = TREE_VALUE (t2);
856 if (comp_except_types (a, b, exact))
858 if (probe == base && exact)
859 base = TREE_CHAIN (probe);
864 if (probe == NULL_TREE)
867 return !exact || base == NULL_TREE || length == list_length (t1);
870 /* Compare the array types T1 and T2, using CMP as the type comparison
871 function for the element types. STRICT is as for comptypes. */
874 comp_array_types (cmp, t1, t2, strict)
875 register int (*cmp) PARAMS ((tree, tree, int));
885 /* The type of the array elements must be the same. */
886 if (!(TREE_TYPE (t1) == TREE_TYPE (t2)
887 || (*cmp) (TREE_TYPE (t1), TREE_TYPE (t2),
888 strict & ~COMPARE_REDECLARATION)))
891 d1 = TYPE_DOMAIN (t1);
892 d2 = TYPE_DOMAIN (t2);
897 /* If one of the arrays is dimensionless, and the other has a
898 dimension, they are of different types. However, it is legal to
906 declarations for an array object can specify
907 array types that differ by the presence or absence of a major
908 array bound (_dcl.array_). */
910 return strict & COMPARE_REDECLARATION;
912 /* Check that the dimensions are the same. */
913 return (cp_tree_equal (TYPE_MIN_VALUE (d1),
915 && cp_tree_equal (TYPE_MAX_VALUE (d1),
916 TYPE_MAX_VALUE (d2)));
919 /* Return 1 if T1 and T2 are compatible types for assignment or
920 various other operations. STRICT is a bitwise-or of the COMPARE_*
924 comptypes (t1, t2, strict)
930 int orig_strict = strict;
932 /* The special exemption for redeclaring array types without an
933 array bound only applies at the top level:
938 is not legal, for example. */
939 strict &= ~COMPARE_REDECLARATION;
941 /* Suppress errors caused by previously reported errors */
945 /* This should never happen. */
946 my_friendly_assert (t1 != error_mark_node, 307);
948 if (t2 == error_mark_node)
951 /* If either type is the internal version of sizetype, return the
953 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
954 && TYPE_DOMAIN (t1) != 0)
955 t1 = TYPE_DOMAIN (t1);
957 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
958 && TYPE_DOMAIN (t2) != 0)
959 t2 = TYPE_DOMAIN (t2);
961 if (strict & COMPARE_RELAXED)
963 /* Treat an enum type as the unsigned integer type of the same width. */
965 if (TREE_CODE (t1) == ENUMERAL_TYPE)
966 t1 = type_for_size (TYPE_PRECISION (t1), 1);
967 if (TREE_CODE (t2) == ENUMERAL_TYPE)
968 t2 = type_for_size (TYPE_PRECISION (t2), 1);
974 if (TYPE_PTRMEMFUNC_P (t1))
975 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
976 if (TYPE_PTRMEMFUNC_P (t2))
977 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
979 /* Different classes of types can't be compatible. */
980 if (TREE_CODE (t1) != TREE_CODE (t2))
983 /* Qualifiers must match. */
984 if (CP_TYPE_QUALS (t1) != CP_TYPE_QUALS (t2))
986 if (strict == COMPARE_STRICT
987 && TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
990 /* Allow for two different type nodes which have essentially the same
991 definition. Note that we already checked for equality of the type
992 qualifiers (just above). */
994 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
997 /* ??? COMP_TYPE_ATTRIBUTES is currently useless for variables as each
998 attribute is its own main variant (`val' will remain 0). */
999 #ifndef COMP_TYPE_ATTRIBUTES
1000 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
1003 if (strict & COMPARE_NO_ATTRIBUTES)
1005 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1006 else if (! (attrval = COMP_TYPE_ATTRIBUTES (t1, t2)))
1009 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1012 switch (TREE_CODE (t1))
1014 case TEMPLATE_TEMPLATE_PARM:
1015 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1016 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2))
1018 if (! comp_template_parms
1019 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1020 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1022 if (!TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t1)
1023 && ! TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t2))
1025 /* Don't check inheritance. */
1026 strict = COMPARE_STRICT;
1031 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1032 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1033 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM))
1034 val = comp_template_args (TYPE_TI_ARGS (t1),
1037 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1039 else if ((strict & COMPARE_RELAXED) && DERIVED_FROM_P (t2, t1))
1044 val = (comptypes (build_pointer_type (TYPE_OFFSET_BASETYPE (t1)),
1045 build_pointer_type (TYPE_OFFSET_BASETYPE (t2)), strict)
1046 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict));
1050 if (! comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1),
1051 TYPE_RAISES_EXCEPTIONS (t2), 1))
1054 /* This case is anti-symmetrical!
1055 One can pass a base member (or member function)
1056 to something expecting a derived member (or member function),
1057 but not vice-versa! */
1059 val = (comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict)
1060 && compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)));
1064 case REFERENCE_TYPE:
1065 t1 = TREE_TYPE (t1);
1066 t2 = TREE_TYPE (t2);
1067 /* first, check whether the referred types match with the
1068 required level of strictness */
1069 val = comptypes (t1, t2, strict);
1072 if (TREE_CODE (t1) == RECORD_TYPE
1073 && TREE_CODE (t2) == RECORD_TYPE)
1078 if (! comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1),
1079 TYPE_RAISES_EXCEPTIONS (t2), 1))
1082 val = ((TREE_TYPE (t1) == TREE_TYPE (t2)
1083 || comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict))
1084 && compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)));
1088 /* Target types must match incl. qualifiers. We use ORIG_STRICT
1089 here since this is the one place where
1090 COMPARE_REDECLARATION should be used. */
1091 val = comp_array_types (comptypes, t1, t2, orig_strict);
1094 case TEMPLATE_TYPE_PARM:
1095 return TEMPLATE_TYPE_IDX (t1) == TEMPLATE_TYPE_IDX (t2)
1096 && TEMPLATE_TYPE_LEVEL (t1) == TEMPLATE_TYPE_LEVEL (t2);
1099 if (TYPE_IDENTIFIER (t1) != TYPE_IDENTIFIER (t2))
1101 return same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2));
1104 return same_type_p (TREE_TYPE (t1), TREE_TYPE (t2));
1109 return attrval == 2 && val == 1 ? 2 : val;
1112 /* Subroutine of comp_target-types. Make sure that the cv-quals change
1113 only in the same direction as the target type. */
1116 comp_cv_target_types (ttl, ttr, nptrs)
1122 if (!at_least_as_qualified_p (ttl, ttr)
1123 && !at_least_as_qualified_p (ttr, ttl))
1124 /* The qualifications are incomparable. */
1127 if (TYPE_MAIN_VARIANT (ttl) == TYPE_MAIN_VARIANT (ttr))
1128 return more_qualified_p (ttr, ttl) ? -1 : 1;
1130 t = comp_target_types (ttl, ttr, nptrs);
1131 if ((t == 1 && at_least_as_qualified_p (ttl, ttr))
1132 || (t == -1 && at_least_as_qualified_p (ttr, ttl)))
1138 /* Return 1 or -1 if TTL and TTR are pointers to types that are equivalent,
1139 ignoring their qualifiers, 0 if not. Return 1 means that TTR can be
1140 converted to TTL. Return -1 means that TTL can be converted to TTR but
1143 NPTRS is the number of pointers we can strip off and keep cool.
1144 This is used to permit (for aggr A, aggr B) A, B* to convert to A*,
1145 but to not permit B** to convert to A**.
1147 This should go away. Callers should use can_convert or something
1148 similar instead. (jason 17 Apr 1997) */
1151 comp_target_types (ttl, ttr, nptrs)
1155 ttl = TYPE_MAIN_VARIANT (ttl);
1156 ttr = TYPE_MAIN_VARIANT (ttr);
1157 if (same_type_p (ttl, ttr))
1160 if (TREE_CODE (ttr) != TREE_CODE (ttl))
1163 if ((TREE_CODE (ttr) == POINTER_TYPE
1164 || TREE_CODE (ttr) == REFERENCE_TYPE)
1165 /* If we get a pointer with nptrs == 0, we don't allow any tweaking
1166 of the type pointed to. This is necessary for reference init
1167 semantics. We won't get here from a previous call with nptrs == 1;
1168 for multi-level pointers we end up in comp_ptr_ttypes. */
1171 int is_ptr = TREE_CODE (ttr) == POINTER_TYPE;
1173 ttl = TREE_TYPE (ttl);
1174 ttr = TREE_TYPE (ttr);
1178 if (TREE_CODE (ttl) == UNKNOWN_TYPE
1179 || TREE_CODE (ttr) == UNKNOWN_TYPE)
1181 else if (TREE_CODE (ttl) == VOID_TYPE
1182 && TREE_CODE (ttr) != FUNCTION_TYPE
1183 && TREE_CODE (ttr) != METHOD_TYPE
1184 && TREE_CODE (ttr) != OFFSET_TYPE)
1186 else if (TREE_CODE (ttr) == VOID_TYPE
1187 && TREE_CODE (ttl) != FUNCTION_TYPE
1188 && TREE_CODE (ttl) != METHOD_TYPE
1189 && TREE_CODE (ttl) != OFFSET_TYPE)
1191 else if (TREE_CODE (ttl) == POINTER_TYPE
1192 || TREE_CODE (ttl) == ARRAY_TYPE)
1194 if (comp_ptr_ttypes (ttl, ttr))
1196 else if (comp_ptr_ttypes (ttr, ttl))
1202 /* Const and volatile mean something different for function types,
1203 so the usual checks are not appropriate. */
1204 if (TREE_CODE (ttl) == FUNCTION_TYPE || TREE_CODE (ttl) == METHOD_TYPE)
1205 return comp_target_types (ttl, ttr, nptrs - 1);
1207 return comp_cv_target_types (ttl, ttr, nptrs - 1);
1210 if (TREE_CODE (ttr) == ARRAY_TYPE)
1211 return comp_array_types (comp_target_types, ttl, ttr, COMPARE_STRICT);
1212 else if (TREE_CODE (ttr) == FUNCTION_TYPE || TREE_CODE (ttr) == METHOD_TYPE)
1219 if (!same_type_p (TREE_TYPE (ttl), TREE_TYPE (ttr)))
1224 switch (comp_target_types (TREE_TYPE (ttl), TREE_TYPE (ttr), -1))
1233 argsl = TYPE_ARG_TYPES (ttl);
1234 argsr = TYPE_ARG_TYPES (ttr);
1236 /* Compare 'this' here, not in comp_target_parms. */
1237 if (TREE_CODE (ttr) == METHOD_TYPE)
1239 tree tl = TYPE_METHOD_BASETYPE (ttl);
1240 tree tr = TYPE_METHOD_BASETYPE (ttr);
1242 if (!same_or_base_type_p (tr, tl))
1244 if (same_or_base_type_p (tl, tr))
1250 argsl = TREE_CHAIN (argsl);
1251 argsr = TREE_CHAIN (argsr);
1254 switch (comp_target_parms (argsl, argsr, 1))
1262 return saw_contra ? -1 : 1;
1265 else if (TREE_CODE (ttr) == OFFSET_TYPE)
1269 /* Contravariance: we can assign a pointer to base member to a pointer
1270 to derived member. Note difference from simple pointer case, where
1271 we can pass a pointer to derived to a pointer to base. */
1272 if (same_or_base_type_p (TYPE_OFFSET_BASETYPE (ttr),
1273 TYPE_OFFSET_BASETYPE (ttl)))
1275 else if (same_or_base_type_p (TYPE_OFFSET_BASETYPE (ttl),
1276 TYPE_OFFSET_BASETYPE (ttr)))
1286 ttl = TREE_TYPE (ttl);
1287 ttr = TREE_TYPE (ttr);
1289 if (TREE_CODE (ttl) == POINTER_TYPE
1290 || TREE_CODE (ttl) == ARRAY_TYPE)
1292 if (comp_ptr_ttypes (ttl, ttr))
1298 if (comp_cv_target_types (ttl, ttr, nptrs) == 1)
1303 else if (IS_AGGR_TYPE (ttl))
1307 if (same_or_base_type_p (build_pointer_type (ttl),
1308 build_pointer_type (ttr)))
1310 if (same_or_base_type_p (build_pointer_type (ttr),
1311 build_pointer_type (ttl)))
1319 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1322 at_least_as_qualified_p (type1, type2)
1326 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1327 return ((CP_TYPE_QUALS (type1) & CP_TYPE_QUALS (type2))
1328 == CP_TYPE_QUALS (type2));
1331 /* Returns 1 if TYPE1 is more qualified than TYPE2. */
1334 more_qualified_p (type1, type2)
1338 return (CP_TYPE_QUALS (type1) != CP_TYPE_QUALS (type2)
1339 && at_least_as_qualified_p (type1, type2));
1342 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1343 more cv-qualified that TYPE1, and 0 otherwise. */
1346 comp_cv_qualification (type1, type2)
1350 if (CP_TYPE_QUALS (type1) == CP_TYPE_QUALS (type2))
1353 if (at_least_as_qualified_p (type1, type2))
1356 else if (at_least_as_qualified_p (type2, type1))
1362 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1363 subset of the cv-qualification signature of TYPE2, and the types
1364 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1367 comp_cv_qual_signature (type1, type2)
1371 if (comp_ptr_ttypes_real (type2, type1, -1))
1373 else if (comp_ptr_ttypes_real (type1, type2, -1))
1379 /* If two types share a common base type, return that basetype.
1380 If there is not a unique most-derived base type, this function
1381 returns ERROR_MARK_NODE. */
1384 common_base_type (tt1, tt2)
1387 tree best = NULL_TREE;
1390 /* If one is a baseclass of another, that's good enough. */
1391 if (UNIQUELY_DERIVED_FROM_P (tt1, tt2))
1393 if (UNIQUELY_DERIVED_FROM_P (tt2, tt1))
1396 /* Otherwise, try to find a unique baseclass of TT1
1397 that is shared by TT2, and follow that down. */
1398 for (i = CLASSTYPE_N_BASECLASSES (tt1)-1; i >= 0; i--)
1400 tree basetype = TYPE_BINFO_BASETYPE (tt1, i);
1401 tree trial = common_base_type (basetype, tt2);
1404 if (trial == error_mark_node)
1406 if (best == NULL_TREE)
1408 else if (best != trial)
1409 return error_mark_node;
1414 for (i = CLASSTYPE_N_BASECLASSES (tt2)-1; i >= 0; i--)
1416 tree basetype = TYPE_BINFO_BASETYPE (tt2, i);
1417 tree trial = common_base_type (tt1, basetype);
1420 if (trial == error_mark_node)
1422 if (best == NULL_TREE)
1424 else if (best != trial)
1425 return error_mark_node;
1431 /* Subroutines of `comptypes'. */
1433 /* Return 1 if two parameter type lists PARMS1 and PARMS2 are
1434 equivalent in the sense that functions with those parameter types
1435 can have equivalent types. The two lists must be equivalent,
1438 C++: See comment above about TYPE1, TYPE2. */
1441 compparms (parms1, parms2)
1442 tree parms1, parms2;
1444 register tree t1 = parms1, t2 = parms2;
1446 /* An unspecified parmlist matches any specified parmlist
1447 whose argument types don't need default promotions. */
1451 if (t1 == 0 && t2 == 0)
1453 /* If one parmlist is shorter than the other,
1454 they fail to match. */
1455 if (t1 == 0 || t2 == 0)
1457 if (!same_type_p (TREE_VALUE (t2), TREE_VALUE (t1)))
1460 t1 = TREE_CHAIN (t1);
1461 t2 = TREE_CHAIN (t2);
1465 /* This really wants return whether or not parameter type lists
1466 would make their owning functions assignment compatible or not.
1468 The return value is like for comp_target_types.
1470 This should go away, possibly with the exception of the empty parmlist
1471 conversion; there are no conversions between function types in C++.
1472 (jason 17 Apr 1997) */
1475 comp_target_parms (parms1, parms2, strict)
1476 tree parms1, parms2;
1479 register tree t1 = parms1, t2 = parms2;
1480 int warn_contravariance = 0;
1482 /* In C, an unspecified parmlist matches any specified parmlist
1483 whose argument types don't need default promotions. This is not
1484 true for C++, but let's do it anyway for unfixed headers. */
1486 if (t1 == 0 && t2 != 0)
1488 if (! flag_strict_prototype && t2 == void_list_node)
1489 /* t1 might be the arglist of a function pointer in extern "C"
1490 declared to take (), which we fudged to (...). Don't make the
1491 user pay for our mistake. */;
1493 cp_pedwarn ("ISO C++ prohibits conversion from `%#T' to `(...)'",
1495 return self_promoting_args_p (t2);
1498 return self_promoting_args_p (t1);
1500 for (; t1 || t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1504 /* If one parmlist is shorter than the other,
1505 they fail to match, unless STRICT is <= 0. */
1506 if (t1 == 0 || t2 == 0)
1511 return 1 + warn_contravariance;
1512 return ((t1 && TREE_PURPOSE (t1)) + warn_contravariance);
1514 p1 = TREE_VALUE (t1);
1515 p2 = TREE_VALUE (t2);
1516 if (same_type_p (p1, p2))
1522 if ((TREE_CODE (p1) == POINTER_TYPE && TREE_CODE (p2) == POINTER_TYPE)
1523 || (TREE_CODE (p1) == REFERENCE_TYPE
1524 && TREE_CODE (p2) == REFERENCE_TYPE))
1527 && (TYPE_MAIN_VARIANT (TREE_TYPE (p1))
1528 == TYPE_MAIN_VARIANT (TREE_TYPE (p2))))
1531 /* The following is wrong for contravariance,
1532 but many programs depend on it. */
1533 if (TREE_TYPE (p1) == void_type_node)
1535 if (TREE_TYPE (p2) == void_type_node)
1537 warn_contravariance = 1;
1540 if (IS_AGGR_TYPE (TREE_TYPE (p1))
1541 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (p1),
1545 /* Note backwards order due to contravariance. */
1546 if (comp_target_types (p2, p1, 1) <= 0)
1548 if (comp_target_types (p1, p2, 1) > 0)
1550 warn_contravariance = 1;
1557 return warn_contravariance ? -1 : 1;
1560 /* Compute the value of the `sizeof' operator. */
1566 enum tree_code code = TREE_CODE (type);
1568 if (processing_template_decl)
1569 return build_min (SIZEOF_EXPR, sizetype, type);
1571 if (code == FUNCTION_TYPE)
1573 if (pedantic || warn_pointer_arith)
1574 pedwarn ("ISO C++ forbids applying `sizeof' to a function type");
1575 return size_one_node;
1577 if (code == METHOD_TYPE)
1579 if (pedantic || warn_pointer_arith)
1580 pedwarn ("ISO C++ forbids applying `sizeof' to a member function");
1581 return size_one_node;
1583 if (code == VOID_TYPE)
1585 if (pedantic || warn_pointer_arith)
1586 pedwarn ("ISO C++ forbids applying `sizeof' to type `void' which is an incomplete type");
1587 return size_one_node;
1589 if (code == ERROR_MARK)
1590 return size_one_node;
1592 /* ARM $5.3.2: ``When applied to a reference, the result is the size of the
1593 referenced object.'' */
1594 if (code == REFERENCE_TYPE)
1595 type = TREE_TYPE (type);
1597 if (code == OFFSET_TYPE)
1599 cp_error ("`sizeof' applied to non-static member");
1600 return size_zero_node;
1603 if (!COMPLETE_TYPE_P (complete_type (type)))
1605 cp_error ("`sizeof' applied to incomplete type `%T'", type);
1606 return size_zero_node;
1609 /* Convert in case a char is more than one unit. */
1610 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1611 size_int (TYPE_PRECISION (char_type_node)
1619 if (processing_template_decl)
1620 return build_min (SIZEOF_EXPR, sizetype, e);
1622 if (TREE_CODE (e) == COMPONENT_REF
1623 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1624 error ("sizeof applied to a bit-field");
1625 if (is_overloaded_fn (e))
1627 pedwarn ("ISO C++ forbids applying `sizeof' to an expression of function type");
1628 return size_one_node;
1630 else if (type_unknown_p (e))
1632 incomplete_type_error (e, TREE_TYPE (e));
1633 return size_one_node;
1635 /* It's illegal to say `sizeof (X::i)' for `i' a non-static data
1636 member unless you're in a non-static member of X. So hand off to
1637 resolve_offset_ref. [expr.prim] */
1638 else if (TREE_CODE (e) == OFFSET_REF)
1639 e = resolve_offset_ref (e);
1641 if (e == error_mark_node)
1644 return c_sizeof (TREE_TYPE (e));
1648 c_sizeof_nowarn (type)
1651 enum tree_code code = TREE_CODE (type);
1653 if (code == FUNCTION_TYPE
1654 || code == METHOD_TYPE
1655 || code == VOID_TYPE
1656 || code == ERROR_MARK)
1657 return size_one_node;
1659 if (code == REFERENCE_TYPE)
1660 type = TREE_TYPE (type);
1662 if (!COMPLETE_TYPE_P (type))
1663 return size_zero_node;
1665 /* Convert in case a char is more than one unit. */
1666 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1667 size_int (TYPE_PRECISION (char_type_node)
1671 /* Implement the __alignof keyword: Return the minimum required
1672 alignment of TYPE, measured in bytes. */
1678 enum tree_code code = TREE_CODE (type);
1681 if (processing_template_decl)
1682 return build_min (ALIGNOF_EXPR, sizetype, type);
1684 if (code == FUNCTION_TYPE || code == METHOD_TYPE)
1685 return size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1687 if (code == VOID_TYPE || code == ERROR_MARK)
1688 return size_one_node;
1690 /* C++: this is really correct! */
1691 if (code == REFERENCE_TYPE)
1692 type = TREE_TYPE (type);
1694 t = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
1695 force_fit_type (t, 0);
1699 /* Perform the array-to-pointer and function-to-pointer conversions
1702 In addition, references are converted to lvalues and manifest
1703 constants are replaced by their values. */
1706 decay_conversion (exp)
1710 register enum tree_code code;
1712 if (TREE_CODE (exp) == OFFSET_REF)
1713 exp = resolve_offset_ref (exp);
1715 type = TREE_TYPE (exp);
1716 code = TREE_CODE (type);
1718 if (code == REFERENCE_TYPE)
1720 exp = convert_from_reference (exp);
1721 type = TREE_TYPE (exp);
1722 code = TREE_CODE (type);
1725 if (type == error_mark_node)
1726 return error_mark_node;
1728 /* Constants can be used directly unless they're not loadable. */
1729 if (TREE_CODE (exp) == CONST_DECL)
1730 exp = DECL_INITIAL (exp);
1731 /* Replace a nonvolatile const static variable with its value. We
1732 don't do this for arrays, though; we want the address of the
1733 first element of the array, not the address of the first element
1734 of its initializing constant. */
1735 else if (code != ARRAY_TYPE)
1737 exp = decl_constant_value (exp);
1738 type = TREE_TYPE (exp);
1741 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1742 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1744 if (code == VOID_TYPE)
1746 error ("void value not ignored as it ought to be");
1747 return error_mark_node;
1749 if (code == METHOD_TYPE)
1750 my_friendly_abort (990506);
1751 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1752 return build_unary_op (ADDR_EXPR, exp, 0);
1753 if (code == ARRAY_TYPE)
1758 if (TREE_CODE (exp) == INDIRECT_REF)
1760 /* Stripping away the INDIRECT_REF is not the right
1761 thing to do for references... */
1762 tree inner = TREE_OPERAND (exp, 0);
1763 if (TREE_CODE (TREE_TYPE (inner)) == REFERENCE_TYPE)
1765 inner = build1 (CONVERT_EXPR,
1766 build_pointer_type (TREE_TYPE
1767 (TREE_TYPE (inner))),
1769 TREE_CONSTANT (inner) = TREE_CONSTANT (TREE_OPERAND (inner, 0));
1771 return cp_convert (build_pointer_type (TREE_TYPE (type)), inner);
1774 if (TREE_CODE (exp) == COMPOUND_EXPR)
1776 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1777 return build (COMPOUND_EXPR, TREE_TYPE (op1),
1778 TREE_OPERAND (exp, 0), op1);
1782 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1784 error ("invalid use of non-lvalue array");
1785 return error_mark_node;
1788 ptrtype = build_pointer_type (TREE_TYPE (type));
1790 if (TREE_CODE (exp) == VAR_DECL)
1792 /* ??? This is not really quite correct
1793 in that the type of the operand of ADDR_EXPR
1794 is not the target type of the type of the ADDR_EXPR itself.
1795 Question is, can this lossage be avoided? */
1796 adr = build1 (ADDR_EXPR, ptrtype, exp);
1797 if (mark_addressable (exp) == 0)
1798 return error_mark_node;
1799 TREE_CONSTANT (adr) = staticp (exp);
1800 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1803 /* This way is better for a COMPONENT_REF since it can
1804 simplify the offset for a component. */
1805 adr = build_unary_op (ADDR_EXPR, exp, 1);
1806 return cp_convert (ptrtype, adr);
1809 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1810 rvalues always have cv-unqualified types. */
1811 if (! CLASS_TYPE_P (type))
1812 exp = cp_convert (TYPE_MAIN_VARIANT (type), exp);
1818 default_conversion (exp)
1822 enum tree_code code;
1824 exp = decay_conversion (exp);
1826 type = TREE_TYPE (exp);
1827 code = TREE_CODE (type);
1829 if (INTEGRAL_CODE_P (code))
1831 tree t = type_promotes_to (type);
1833 return cp_convert (t, exp);
1839 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1843 inline_conversion (exp)
1846 if (TREE_CODE (exp) == FUNCTION_DECL)
1847 exp = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (exp)), exp);
1852 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1853 decay_conversion to one. */
1856 string_conv_p (totype, exp, warn)
1862 if (! flag_const_strings || TREE_CODE (totype) != POINTER_TYPE)
1865 t = TREE_TYPE (totype);
1866 if (!same_type_p (t, char_type_node)
1867 && !same_type_p (t, wchar_type_node))
1870 if (TREE_CODE (exp) == STRING_CST)
1872 /* Make sure that we don't try to convert between char and wchar_t. */
1873 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1878 /* Is this a string constant which has decayed to 'const char *'? */
1879 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1880 if (!same_type_p (TREE_TYPE (exp), t))
1883 if (TREE_CODE (exp) != ADDR_EXPR
1884 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1888 /* This warning is not very useful, as it complains about printf. */
1889 if (warn && warn_write_strings)
1890 cp_warning ("deprecated conversion from string constant to `%T'", totype);
1896 build_object_ref (datum, basetype, field)
1897 tree datum, basetype, field;
1900 if (datum == error_mark_node)
1901 return error_mark_node;
1903 dtype = TREE_TYPE (datum);
1904 if (TREE_CODE (dtype) == REFERENCE_TYPE)
1905 dtype = TREE_TYPE (dtype);
1906 if (! IS_AGGR_TYPE_CODE (TREE_CODE (dtype)))
1908 cp_error ("request for member `%T::%D' in expression of non-aggregate type `%T'",
1909 basetype, field, dtype);
1910 return error_mark_node;
1912 else if (is_aggr_type (basetype, 1))
1914 tree binfo = binfo_or_else (basetype, dtype);
1916 return build_x_component_ref (build_scoped_ref (datum, basetype),
1919 return error_mark_node;
1922 /* Like `build_component_ref, but uses an already found field, and converts
1923 from a reference. Must compute access for current_class_ref.
1927 build_component_ref_1 (datum, field, protect)
1931 return convert_from_reference
1932 (build_component_ref (datum, field, NULL_TREE, protect));
1935 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1936 can, for example, use as an lvalue. This code used to be in
1937 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1938 expressions, where we're dealing with aggregates. But now it's again only
1939 called from unary_complex_lvalue. The case (in particular) that led to
1940 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1944 rationalize_conditional_expr (code, t)
1945 enum tree_code code;
1948 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1949 the first operand is always the one to be used if both operands
1950 are equal, so we know what conditional expression this used to be. */
1951 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1954 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1955 ? LE_EXPR : GE_EXPR),
1956 TREE_OPERAND (t, 0),
1957 TREE_OPERAND (t, 1)),
1958 build_unary_op (code, TREE_OPERAND (t, 0), 0),
1959 build_unary_op (code, TREE_OPERAND (t, 1), 0));
1963 build_conditional_expr (TREE_OPERAND (t, 0),
1964 build_unary_op (code, TREE_OPERAND (t, 1), 0),
1965 build_unary_op (code, TREE_OPERAND (t, 2), 0));
1968 /* Given the TYPE of an anonymous union field inside T, return the
1969 FIELD_DECL for the field. If not found return NULL_TREE. Because
1970 anonymous unions can nest, we must also search all anonymous unions
1971 that are directly reachable. */
1974 lookup_anon_field (t, type)
1979 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1981 if (TREE_STATIC (field))
1983 if (TREE_CODE (field) != FIELD_DECL)
1986 /* If we find it directly, return the field. */
1987 if (DECL_NAME (field) == NULL_TREE
1988 && type == TREE_TYPE (field))
1993 /* Otherwise, it could be nested, search harder. */
1994 if (DECL_NAME (field) == NULL_TREE
1995 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1997 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2005 /* Build a COMPONENT_REF for a given DATUM, and it's member COMPONENT.
2006 COMPONENT can be an IDENTIFIER_NODE that is the name of the member
2007 that we are interested in, or it can be a FIELD_DECL. */
2010 build_component_ref (datum, component, basetype_path, protect)
2011 tree datum, component, basetype_path;
2014 register tree basetype;
2015 register enum tree_code code;
2016 register tree field = NULL;
2021 if (processing_template_decl)
2022 return build_min_nt (COMPONENT_REF, datum, component);
2024 if (datum == error_mark_node
2025 || TREE_TYPE (datum) == error_mark_node)
2026 return error_mark_node;
2028 /* BASETYPE holds the type of the class containing the COMPONENT. */
2029 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (datum));
2031 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference
2033 switch (TREE_CODE (datum))
2037 tree value = build_component_ref (TREE_OPERAND (datum, 1), component,
2038 basetype_path, protect);
2039 return build (COMPOUND_EXPR, TREE_TYPE (value),
2040 TREE_OPERAND (datum, 0), value);
2043 return build_conditional_expr
2044 (TREE_OPERAND (datum, 0),
2045 build_component_ref (TREE_OPERAND (datum, 1), component,
2046 basetype_path, protect),
2047 build_component_ref (TREE_OPERAND (datum, 2), component,
2048 basetype_path, protect));
2051 cp_error ("invalid use of %D", datum);
2052 datum = error_mark_node;
2059 code = TREE_CODE (basetype);
2061 if (code == REFERENCE_TYPE)
2063 datum = convert_from_reference (datum);
2064 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (datum));
2065 code = TREE_CODE (basetype);
2067 if (TREE_CODE (datum) == OFFSET_REF)
2069 datum = resolve_offset_ref (datum);
2070 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (datum));
2071 code = TREE_CODE (basetype);
2074 /* First, see if there is a field or component with name COMPONENT. */
2075 if (TREE_CODE (component) == TREE_LIST)
2077 /* I could not trigger this code. MvL */
2078 my_friendly_abort (980326);
2080 my_friendly_assert (!(TREE_CHAIN (component) == NULL_TREE
2081 && DECL_CHAIN (TREE_VALUE (component)) == NULL_TREE), 309);
2083 return build (COMPONENT_REF, TREE_TYPE (component), datum, component);
2086 if (! IS_AGGR_TYPE_CODE (code))
2088 if (code != ERROR_MARK)
2089 cp_error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
2090 component, datum, basetype);
2091 return error_mark_node;
2094 if (!complete_type_or_else (basetype, datum))
2095 return error_mark_node;
2097 if (TREE_CODE (component) == BIT_NOT_EXPR)
2099 if (TYPE_IDENTIFIER (basetype) != TREE_OPERAND (component, 0))
2101 cp_error ("destructor specifier `%T::~%T' must have matching names",
2102 basetype, TREE_OPERAND (component, 0));
2103 return error_mark_node;
2105 if (! TYPE_HAS_DESTRUCTOR (basetype))
2107 cp_error ("type `%T' has no destructor", basetype);
2108 return error_mark_node;
2110 return TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1);
2113 /* Look up component name in the structure type definition. */
2114 if (TYPE_VFIELD (basetype)
2115 && DECL_NAME (TYPE_VFIELD (basetype)) == component)
2116 /* Special-case this because if we use normal lookups in an ambiguous
2117 hierarchy, the compiler will abort (because vptr lookups are
2118 not supposed to be ambiguous. */
2119 field = TYPE_VFIELD (basetype);
2120 else if (TREE_CODE (component) == FIELD_DECL)
2122 else if (TREE_CODE (component) == TYPE_DECL)
2124 cp_error ("invalid use of type decl `%#D' as expression", component);
2125 return error_mark_node;
2127 else if (TREE_CODE (component) == TEMPLATE_DECL)
2129 cp_error ("invalid use of template `%#D' as expression", component);
2130 return error_mark_node;
2134 tree name = component;
2135 if (TREE_CODE (component) == VAR_DECL)
2136 name = DECL_NAME (component);
2137 if (TREE_CODE (component) == NAMESPACE_DECL)
2138 /* Source is in error, but produce a sensible diagnostic. */
2139 name = DECL_NAME (component);
2140 if (basetype_path == NULL_TREE)
2141 basetype_path = TYPE_BINFO (basetype);
2142 field = lookup_field (basetype_path, name,
2143 protect && !VFIELD_NAME_P (name), 0);
2144 if (field == error_mark_node)
2145 return error_mark_node;
2147 if (field == NULL_TREE)
2149 /* Not found as a data field, look for it as a method. If found,
2150 then if this is the only possible one, return it, else
2151 report ambiguity error. */
2152 tree fndecls = lookup_fnfields (basetype_path, name, 1);
2153 if (fndecls == error_mark_node)
2154 return error_mark_node;
2157 /* If the function is unique and static, we can resolve it
2158 now. Otherwise, we have to wait and see what context it is
2159 used in; a component_ref involving a non-static member
2160 function can only be used in a call (expr.ref). */
2162 if (TREE_CHAIN (fndecls) == NULL_TREE
2163 && TREE_CODE (TREE_VALUE (fndecls)) == FUNCTION_DECL)
2165 if (DECL_STATIC_FUNCTION_P (TREE_VALUE (fndecls)))
2167 tree fndecl = TREE_VALUE (fndecls);
2168 enforce_access (basetype_path, fndecl);
2174 /* A unique non-static member function. Other parts
2175 of the compiler expect something with
2176 unknown_type_node to be really overloaded, so
2178 TREE_VALUE (fndecls)
2179 = ovl_cons (TREE_VALUE (fndecls), NULL_TREE);
2183 ref = build (COMPONENT_REF, unknown_type_node,
2184 datum, TREE_VALUE (fndecls));
2188 cp_error ("`%#T' has no member named `%D'", basetype, name);
2189 return error_mark_node;
2191 else if (TREE_TYPE (field) == error_mark_node)
2192 return error_mark_node;
2194 if (TREE_CODE (field) != FIELD_DECL)
2196 if (TREE_CODE (field) == TYPE_DECL)
2197 cp_pedwarn ("invalid use of type decl `%#D' as expression", field);
2198 else if (DECL_RTL (field) != 0)
2201 TREE_USED (field) = 1;
2206 /* See if we have to do any conversions so that we pick up the field from the
2208 if (DECL_FIELD_CONTEXT (field) != basetype)
2210 tree context = DECL_FIELD_CONTEXT (field);
2211 tree base = context;
2212 while (!same_type_p (base, basetype) && TYPE_NAME (base)
2213 && ANON_AGGR_TYPE_P (base))
2214 base = TYPE_CONTEXT (base);
2216 /* Handle base classes here... */
2217 if (base != basetype && TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype))
2219 tree addr = build_unary_op (ADDR_EXPR, datum, 0);
2220 if (integer_zerop (addr))
2222 error ("invalid reference to NULL ptr, use ptr-to-member instead");
2223 return error_mark_node;
2225 if (VBASE_NAME_P (DECL_NAME (field)))
2227 /* It doesn't matter which vbase pointer we grab, just
2228 find one of them. */
2229 tree binfo = get_binfo (base,
2230 TREE_TYPE (TREE_TYPE (addr)), 0);
2231 addr = convert_pointer_to_real (binfo, addr);
2234 addr = convert_pointer_to (base, addr);
2235 datum = build_indirect_ref (addr, NULL_PTR);
2236 if (datum == error_mark_node)
2237 return error_mark_node;
2241 /* Handle things from anon unions here... */
2242 if (TYPE_NAME (context) && ANON_AGGR_TYPE_P (context))
2244 tree subfield = lookup_anon_field (basetype, context);
2245 tree subdatum = build_component_ref (datum, subfield,
2246 basetype_path, protect);
2247 return build_component_ref (subdatum, field, basetype_path, protect);
2251 /* Compute the type of the field, as described in [expr.ref]. */
2252 type_quals = TYPE_UNQUALIFIED;
2253 field_type = TREE_TYPE (field);
2254 if (TREE_CODE (field_type) == REFERENCE_TYPE)
2255 /* The standard says that the type of the result should be the
2256 type referred to by the reference. But for now, at least, we
2257 do the conversion from reference type later. */
2261 type_quals = (CP_TYPE_QUALS (field_type)
2262 | CP_TYPE_QUALS (TREE_TYPE (datum)));
2264 /* A field is const (volatile) if the enclosing object, or the
2265 field itself, is const (volatile). But, a mutable field is
2266 not const, even within a const object. */
2267 if (DECL_MUTABLE_P (field))
2268 type_quals &= ~TYPE_QUAL_CONST;
2269 field_type = cp_build_qualified_type (field_type, type_quals);
2272 ref = fold (build (COMPONENT_REF, field_type,
2273 break_out_cleanups (datum), field));
2275 /* Mark the expression const or volatile, as appropriate. Even
2276 though we've dealt with the type above, we still have to mark the
2277 expression itself. */
2278 if (type_quals & TYPE_QUAL_CONST)
2279 TREE_READONLY (ref) = 1;
2280 else if (type_quals & TYPE_QUAL_VOLATILE)
2281 TREE_THIS_VOLATILE (ref) = 1;
2286 /* Variant of build_component_ref for use in expressions, which should
2287 never have REFERENCE_TYPE. */
2290 build_x_component_ref (datum, component, basetype_path, protect)
2291 tree datum, component, basetype_path;
2294 tree t = build_component_ref (datum, component, basetype_path, protect);
2296 if (! processing_template_decl)
2297 t = convert_from_reference (t);
2302 /* Given an expression PTR for a pointer, return an expression
2303 for the value pointed to.
2304 ERRORSTRING is the name of the operator to appear in error messages.
2306 This function may need to overload OPERATOR_FNNAME.
2307 Must also handle REFERENCE_TYPEs for C++. */
2310 build_x_indirect_ref (ptr, errorstring)
2312 const char *errorstring;
2316 if (processing_template_decl)
2317 return build_min_nt (INDIRECT_REF, ptr);
2319 rval = build_opfncall (INDIRECT_REF, LOOKUP_NORMAL, ptr, NULL_TREE,
2323 return build_indirect_ref (ptr, errorstring);
2327 build_indirect_ref (ptr, errorstring)
2329 const char *errorstring;
2331 register tree pointer, type;
2333 if (ptr == error_mark_node)
2334 return error_mark_node;
2336 if (ptr == current_class_ptr)
2337 return current_class_ref;
2339 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2340 ? ptr : default_conversion (ptr));
2341 type = TREE_TYPE (pointer);
2343 if (TYPE_PTR_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
2347 If the type of the expression is "pointer to T," the type
2348 of the result is "T."
2350 We must use the canonical variant because certain parts of
2351 the back end, like fold, do pointer comparisons between
2353 tree t = canonical_type_variant (TREE_TYPE (type));
2355 if (VOID_TYPE_P (t))
2357 /* A pointer to incomplete type (other than cv void) can be
2358 dereferenced [expr.unary.op]/1 */
2359 cp_error ("`%T' is not a pointer-to-object type", type);
2360 return error_mark_node;
2362 else if (TREE_CODE (pointer) == ADDR_EXPR
2364 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2365 /* The POINTER was something like `&x'. We simplify `*&x' to
2367 return TREE_OPERAND (pointer, 0);
2370 tree ref = build1 (INDIRECT_REF, t, pointer);
2372 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2373 so that we get the proper error message if the result is used
2374 to assign to. Also, &* is supposed to be a no-op. */
2375 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2376 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2377 TREE_SIDE_EFFECTS (ref)
2378 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer)
2383 /* `pointer' won't be an error_mark_node if we were given a
2384 pointer to member, so it's cool to check for this here. */
2385 else if (TYPE_PTRMEM_P (type) || TYPE_PTRMEMFUNC_P (type))
2386 error ("invalid use of `%s' on pointer to member", errorstring);
2387 else if (pointer != error_mark_node)
2390 error ("invalid type argument of `%s'", errorstring);
2392 error ("invalid type argument");
2394 return error_mark_node;
2397 /* This handles expressions of the form "a[i]", which denotes
2400 This is logically equivalent in C to *(a+i), but we may do it differently.
2401 If A is a variable or a member, we generate a primitive ARRAY_REF.
2402 This avoids forcing the array out of registers, and can work on
2403 arrays that are not lvalues (for example, members of structures returned
2406 If INDEX is of some user-defined type, it must be converted to
2407 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2408 will inherit the type of the array, which will be some pointer type. */
2411 build_array_ref (array, idx)
2416 error ("subscript missing in array reference");
2417 return error_mark_node;
2420 if (TREE_TYPE (array) == error_mark_node
2421 || TREE_TYPE (idx) == error_mark_node)
2422 return error_mark_node;
2424 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
2425 && TREE_CODE (array) != INDIRECT_REF)
2429 /* Subscripting with type char is likely to lose
2430 on a machine where chars are signed.
2431 So warn on any machine, but optionally.
2432 Don't warn for unsigned char since that type is safe.
2433 Don't warn for signed char because anyone who uses that
2434 must have done so deliberately. */
2435 if (warn_char_subscripts
2436 && TYPE_MAIN_VARIANT (TREE_TYPE (idx)) == char_type_node)
2437 warning ("array subscript has type `char'");
2439 /* Apply default promotions *after* noticing character types. */
2440 idx = default_conversion (idx);
2442 if (TREE_CODE (TREE_TYPE (idx)) != INTEGER_TYPE)
2444 error ("array subscript is not an integer");
2445 return error_mark_node;
2448 /* An array that is indexed by a non-constant
2449 cannot be stored in a register; we must be able to do
2450 address arithmetic on its address.
2451 Likewise an array of elements of variable size. */
2452 if (TREE_CODE (idx) != INTEGER_CST
2453 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2454 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2457 if (mark_addressable (array) == 0)
2458 return error_mark_node;
2460 /* An array that is indexed by a constant value which is not within
2461 the array bounds cannot be stored in a register either; because we
2462 would get a crash in store_bit_field/extract_bit_field when trying
2463 to access a non-existent part of the register. */
2464 if (TREE_CODE (idx) == INTEGER_CST
2465 && TYPE_VALUES (TREE_TYPE (array))
2466 && ! int_fits_type_p (idx, TYPE_VALUES (TREE_TYPE (array))))
2468 if (mark_addressable (array) == 0)
2469 return error_mark_node;
2472 if (pedantic && !lvalue_p (array))
2473 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2475 /* Note in C++ it is valid to subscript a `register' array, since
2476 it is valid to take the address of something with that
2477 storage specification. */
2481 while (TREE_CODE (foo) == COMPONENT_REF)
2482 foo = TREE_OPERAND (foo, 0);
2483 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2484 warning ("subscripting array declared `register'");
2487 type = TREE_TYPE (TREE_TYPE (array));
2488 rval = build (ARRAY_REF, type, array, idx);
2489 /* Array ref is const/volatile if the array elements are
2490 or if the array is.. */
2491 TREE_READONLY (rval)
2492 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2493 TREE_SIDE_EFFECTS (rval)
2494 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2495 TREE_THIS_VOLATILE (rval)
2496 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2497 return require_complete_type (fold (rval));
2501 tree ar = default_conversion (array);
2502 tree ind = default_conversion (idx);
2504 /* Put the integer in IND to simplify error checking. */
2505 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2512 if (ar == error_mark_node)
2515 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2517 error ("subscripted value is neither array nor pointer");
2518 return error_mark_node;
2520 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2522 error ("array subscript is not an integer");
2523 return error_mark_node;
2526 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR, ar, ind),
2531 /* Build a function call to function FUNCTION with parameters PARAMS.
2532 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2533 TREE_VALUE of each node is a parameter-expression. The PARAMS do
2534 not include any object pointer that may be required. FUNCTION's
2535 data type may be a function type or a pointer-to-function.
2537 For C++: If FUNCTION's data type is a TREE_LIST, then the tree list
2538 is the list of possible methods that FUNCTION could conceivably
2539 be. If the list of methods comes from a class, then it will be
2540 a list of lists (where each element is associated with the class
2541 that produced it), otherwise it will be a simple list (for
2542 functions overloaded in global scope).
2544 In the first case, TREE_VALUE (function) is the head of one of those
2545 lists, and TREE_PURPOSE is the name of the function.
2547 In the second case, TREE_PURPOSE (function) is the function's
2550 DECL is the class instance variable, usually CURRENT_CLASS_REF.
2552 When calling a TEMPLATE_DECL, we don't require a complete return
2556 build_x_function_call (function, params, decl)
2557 tree function, params, decl;
2560 tree template_id = NULL_TREE;
2563 if (function == error_mark_node)
2564 return error_mark_node;
2566 if (processing_template_decl)
2567 return build_min_nt (CALL_EXPR, function, params, NULL_TREE);
2569 /* Save explicit template arguments if found */
2570 if (TREE_CODE (function) == TEMPLATE_ID_EXPR)
2572 template_id = function;
2573 function = TREE_OPERAND (function, 0);
2576 type = TREE_TYPE (function);
2578 if (TREE_CODE (type) == OFFSET_TYPE
2579 && TREE_TYPE (type) == unknown_type_node
2580 && TREE_CODE (function) == TREE_LIST
2581 && TREE_CHAIN (function) == NULL_TREE)
2583 /* Undo (Foo:bar)()... */
2584 type = TYPE_OFFSET_BASETYPE (type);
2585 function = TREE_VALUE (function);
2586 my_friendly_assert (TREE_CODE (function) == TREE_LIST, 999);
2587 my_friendly_assert (TREE_CHAIN (function) == NULL_TREE, 999);
2588 function = TREE_VALUE (function);
2589 if (TREE_CODE (function) == OVERLOAD)
2590 function = OVL_FUNCTION (function);
2591 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 999);
2592 function = DECL_NAME (function);
2593 return build_method_call (decl, function, params,
2594 TYPE_BINFO (type), LOOKUP_NORMAL);
2597 if (TREE_CODE (function) == OFFSET_REF
2598 && TREE_CODE (type) != METHOD_TYPE)
2599 function = resolve_offset_ref (function);
2601 if ((TREE_CODE (function) == FUNCTION_DECL
2602 && DECL_STATIC_FUNCTION_P (function))
2603 || (DECL_FUNCTION_TEMPLATE_P (function)
2604 && DECL_STATIC_FUNCTION_P (DECL_TEMPLATE_RESULT (function))))
2605 return build_member_call (DECL_CONTEXT (function),
2607 ? template_id : DECL_NAME (function),
2610 is_method = ((TREE_CODE (function) == TREE_LIST
2611 && current_class_type != NULL_TREE
2612 && (IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (function))
2614 || (TREE_CODE (function) == OVERLOAD
2615 && DECL_FUNCTION_MEMBER_P (OVL_CURRENT (function)))
2616 || TREE_CODE (function) == IDENTIFIER_NODE
2617 || TREE_CODE (type) == METHOD_TYPE
2618 || TYPE_PTRMEMFUNC_P (type));
2620 /* A friend template. Make it look like a toplevel declaration. */
2621 if (! is_method && TREE_CODE (function) == TEMPLATE_DECL)
2622 function = ovl_cons (function, NULL_TREE);
2624 /* Handle methods, friends, and overloaded functions, respectively. */
2627 tree basetype = NULL_TREE;
2629 if (TREE_CODE (function) == OVERLOAD)
2630 function = OVL_CURRENT (function);
2632 if (TREE_CODE (function) == FUNCTION_DECL
2633 || DECL_FUNCTION_TEMPLATE_P (function))
2635 basetype = DECL_CONTEXT (function);
2637 if (DECL_NAME (function))
2638 function = DECL_NAME (function);
2640 function = TYPE_IDENTIFIER (DECL_CONTEXT (function));
2642 else if (TREE_CODE (function) == TREE_LIST)
2644 my_friendly_assert (TREE_CODE (TREE_VALUE (function))
2645 == FUNCTION_DECL, 312);
2646 basetype = DECL_CONTEXT (TREE_VALUE (function));
2647 function = TREE_PURPOSE (function);
2649 else if (TREE_CODE (function) != IDENTIFIER_NODE)
2651 if (TREE_CODE (function) == OFFSET_REF)
2653 if (TREE_OPERAND (function, 0))
2654 decl = TREE_OPERAND (function, 0);
2656 /* Call via a pointer to member function. */
2657 if (decl == NULL_TREE)
2659 error ("pointer to member function called, but not in class scope");
2660 return error_mark_node;
2662 /* What other type of POINTER_TYPE could this be? */
2663 if (TREE_CODE (TREE_TYPE (function)) != POINTER_TYPE
2664 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (function))
2665 && TREE_CODE (function) != OFFSET_REF)
2666 function = build (OFFSET_REF, TREE_TYPE (type), NULL_TREE,
2671 /* this is an abbreviated method call.
2672 must go through here in case it is a virtual function.
2673 @@ Perhaps this could be optimized. */
2675 if (basetype && (! current_class_type
2676 || ! DERIVED_FROM_P (basetype, current_class_type)))
2677 return build_member_call (basetype, function, params);
2679 if (decl == NULL_TREE)
2681 if (current_class_type == NULL_TREE)
2683 cp_error ("object missing in call to method `%D'", function);
2684 return error_mark_node;
2686 /* Yow: call from a static member function. */
2687 decl = build_dummy_object (current_class_type);
2690 /* Put back explicit template arguments, if any. */
2692 function = template_id;
2693 return build_method_call (decl, function, params,
2694 NULL_TREE, LOOKUP_NORMAL);
2696 else if (TREE_CODE (function) == COMPONENT_REF
2697 && type == unknown_type_node)
2699 /* Undo what we did in build_component_ref. */
2700 decl = TREE_OPERAND (function, 0);
2701 function = TREE_OPERAND (function, 1);
2702 function = DECL_NAME (OVL_CURRENT (function));
2706 TREE_OPERAND (template_id, 0) = function;
2707 function = template_id;
2710 return build_method_call (decl, function, params,
2711 NULL_TREE, LOOKUP_NORMAL);
2713 else if (really_overloaded_fn (function))
2715 if (OVL_FUNCTION (function) == NULL_TREE)
2717 cp_error ("function `%D' declared overloaded, but no definitions appear with which to resolve it?!?",
2718 TREE_PURPOSE (function));
2719 return error_mark_node;
2723 /* Put back explicit template arguments, if any. */
2725 function = template_id;
2726 return build_new_function_call (function, params);
2730 /* Remove a potential OVERLOAD around it */
2731 function = OVL_CURRENT (function);
2734 if (TREE_CODE (function) == OFFSET_REF)
2736 /* If the component is a data element (or a virtual function), we play
2737 games here to make things work. */
2740 if (TREE_OPERAND (function, 0))
2741 decl = TREE_OPERAND (function, 0);
2743 decl = current_class_ref;
2745 decl_addr = build_unary_op (ADDR_EXPR, decl, 0);
2747 /* Sigh. OFFSET_REFs are being used for too many things.
2748 They're being used both for -> and ->*, and we want to resolve
2749 the -> cases here, but leave the ->*. We could use
2750 resolve_offset_ref for those, too, but it would call
2751 get_member_function_from_ptrfunc and decl_addr wouldn't get
2752 updated properly. Nasty. */
2753 if (TREE_CODE (TREE_OPERAND (function, 1)) == FIELD_DECL)
2754 function = resolve_offset_ref (function);
2756 function = TREE_OPERAND (function, 1);
2758 function = get_member_function_from_ptrfunc (&decl_addr, function);
2759 params = tree_cons (NULL_TREE, decl_addr, params);
2760 return build_function_call (function, params);
2763 type = TREE_TYPE (function);
2764 if (type != error_mark_node)
2766 if (TREE_CODE (type) == REFERENCE_TYPE)
2767 type = TREE_TYPE (type);
2769 if (IS_AGGR_TYPE (type))
2770 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, function, params, NULL_TREE);
2775 tree fntype = TREE_TYPE (function);
2776 tree ctypeptr = NULL_TREE;
2778 /* Explicitly named method? */
2779 if (TREE_CODE (function) == FUNCTION_DECL)
2780 ctypeptr = build_pointer_type (DECL_CLASS_CONTEXT (function));
2781 /* Expression with ptr-to-method type? It could either be a plain
2782 usage, or it might be a case where the ptr-to-method is being
2783 passed in as an argument. */
2784 else if (TYPE_PTRMEMFUNC_P (fntype))
2786 tree rec = TYPE_METHOD_BASETYPE (TREE_TYPE
2787 (TYPE_PTRMEMFUNC_FN_TYPE (fntype)));
2788 ctypeptr = build_pointer_type (rec);
2790 /* Unexpected node type? */
2792 my_friendly_abort (116);
2793 if (decl == NULL_TREE)
2795 if (current_function_decl
2796 && DECL_STATIC_FUNCTION_P (current_function_decl))
2797 error ("invalid call to member function needing `this' in static member function scope");
2799 error ("pointer to member function called, but not in class scope");
2800 return error_mark_node;
2802 if (TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE
2803 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (decl)))
2805 decl = build_unary_op (ADDR_EXPR, decl, 0);
2806 decl = convert_pointer_to (TREE_TYPE (ctypeptr), decl);
2809 decl = build_c_cast (ctypeptr, decl);
2810 params = tree_cons (NULL_TREE, decl, params);
2813 return build_function_call (function, params);
2816 /* Resolve a pointer to member function. INSTANCE is the object
2817 instance to use, if the member points to a virtual member. */
2820 get_member_function_from_ptrfunc (instance_ptrptr, function)
2821 tree *instance_ptrptr;
2824 if (TREE_CODE (function) == OFFSET_REF)
2826 function = TREE_OPERAND (function, 1);
2829 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2831 tree fntype, idx, e1, delta, delta2, e2, e3, aref, vtbl;
2832 tree instance, basetype;
2834 tree instance_ptr = *instance_ptrptr;
2836 if (instance_ptr == error_mark_node
2837 && TREE_CODE (function) == PTRMEM_CST)
2839 /* Extracting the function address from a pmf is only
2840 allowed with -Wno-pmf-conversions. It only works for
2842 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2843 e1 = convert (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function)), e1);
2847 if (TREE_SIDE_EFFECTS (instance_ptr))
2848 instance_ptr = save_expr (instance_ptr);
2850 if (TREE_SIDE_EFFECTS (function))
2851 function = save_expr (function);
2853 fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2854 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2856 /* Convert down to the right base, before using the instance. */
2857 instance = convert_pointer_to_real (basetype, instance_ptr);
2858 if (instance == error_mark_node && instance_ptr != error_mark_node)
2861 e3 = PFN_FROM_PTRMEMFUNC (function);
2863 /* This used to avoid checking for virtual functions if basetype
2864 has no virtual functions, according to an earlier ANSI draft.
2865 With the final ISO C++ rules, such an optimization is
2866 incorrect: A pointer to a derived member can be static_cast
2867 to pointer-to-base-member, as long as the dynamic object
2868 later has the right member. */
2870 /* Promoting idx before saving it improves performance on RISC
2871 targets. Without promoting, the first compare used
2872 load-with-sign-extend, while the second used normal load then
2873 shift to sign-extend. An optimizer flaw, perhaps, but it's
2874 easier to make this change. */
2877 idx = cp_build_binary_op (TRUNC_DIV_EXPR,
2878 build1 (NOP_EXPR, vtable_index_type, e3),
2879 TYPE_SIZE_UNIT (vtable_entry_type));
2880 e1 = cp_build_binary_op (BIT_AND_EXPR,
2881 build1 (NOP_EXPR, vtable_index_type, e3),
2886 idx = save_expr (default_conversion
2887 (build_component_ref (function,
2890 e1 = cp_build_binary_op (GE_EXPR, idx, integer_zero_node);
2891 idx = cp_build_binary_op (MINUS_EXPR, idx, integer_one_node);
2894 vtbl = convert_pointer_to (ptr_type_node, instance);
2895 delta = cp_convert (ptrdiff_type_node,
2896 build_component_ref (function, delta_identifier,
2899 /* DELTA2 is the amount by which to adjust the `this' pointer
2900 to find the vtbl. */
2903 delta2 = DELTA2_FROM_PTRMEMFUNC (function);
2906 build_pointer_type (build_pointer_type (vtable_entry_type)),
2907 vtbl, cp_convert (ptrdiff_type_node, delta2));
2908 vtbl = build_indirect_ref (vtbl, NULL_PTR);
2909 aref = build_array_ref (vtbl, idx);
2911 if (! flag_vtable_thunks)
2913 aref = save_expr (aref);
2915 delta = cp_build_binary_op
2917 build_conditional_expr (e1,
2918 build_component_ref (aref,
2925 if (flag_vtable_thunks)
2928 e2 = build_component_ref (aref, pfn_identifier, NULL_TREE, 0);
2929 TREE_TYPE (e2) = TREE_TYPE (e3);
2930 e1 = build_conditional_expr (e1, e2, e3);
2932 /* Make sure this doesn't get evaluated first inside one of the
2933 branches of the COND_EXPR. */
2934 if (TREE_CODE (instance_ptr) == SAVE_EXPR)
2935 e1 = build (COMPOUND_EXPR, TREE_TYPE (e1),
2938 *instance_ptrptr = build (PLUS_EXPR, TREE_TYPE (instance_ptr),
2939 instance_ptr, delta);
2941 if (instance_ptr == error_mark_node
2942 && TREE_CODE (e1) != ADDR_EXPR
2943 && TREE_CODE (TREE_OPERAND (e1, 0)) != FUNCTION_DECL)
2944 cp_error ("object missing in `%E'", function);
2952 build_function_call_real (function, params, require_complete, flags)
2953 tree function, params;
2954 int require_complete, flags;
2956 register tree fntype, fndecl;
2957 register tree value_type;
2958 register tree coerced_params;
2960 tree name = NULL_TREE, assembler_name = NULL_TREE;
2963 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2964 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2965 if (TREE_CODE (function) == NOP_EXPR
2966 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2967 function = TREE_OPERAND (function, 0);
2969 if (TREE_CODE (function) == FUNCTION_DECL)
2971 name = DECL_NAME (function);
2972 assembler_name = DECL_ASSEMBLER_NAME (function);
2974 GNU_xref_call (current_function_decl,
2975 IDENTIFIER_POINTER (name ? name
2976 : TYPE_IDENTIFIER (DECL_CLASS_CONTEXT
2978 mark_used (function);
2981 /* Convert anything with function type to a pointer-to-function. */
2982 if (pedantic && DECL_MAIN_P (function))
2983 pedwarn ("ISO C++ forbids calling `::main' from within program");
2985 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2986 (because calling an inline function does not mean the function
2987 needs to be separately compiled). */
2989 if (DECL_INLINE (function))
2990 function = inline_conversion (function);
2992 function = build_addr_func (function);
2998 function = build_addr_func (function);
3001 if (function == error_mark_node)
3002 return error_mark_node;
3004 fntype = TREE_TYPE (function);
3006 if (TYPE_PTRMEMFUNC_P (fntype))
3008 cp_error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
3010 return error_mark_node;
3013 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3014 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3016 if (!((TREE_CODE (fntype) == POINTER_TYPE
3017 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3019 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3021 cp_error ("`%E' cannot be used as a function", function);
3022 return error_mark_node;
3025 /* fntype now gets the type of function pointed to. */
3026 fntype = TREE_TYPE (fntype);
3028 /* Convert the parameters to the types declared in the
3029 function prototype, or apply default promotions. */
3031 if (flags & LOOKUP_COMPLAIN)
3032 coerced_params = convert_arguments (TYPE_ARG_TYPES (fntype),
3033 params, fndecl, LOOKUP_NORMAL);
3035 coerced_params = convert_arguments (TYPE_ARG_TYPES (fntype),
3038 if (coerced_params == error_mark_node)
3040 if (flags & LOOKUP_SPECULATIVELY)
3043 return error_mark_node;
3046 /* Check for errors in format strings. */
3048 if (warn_format && (name || assembler_name))
3049 check_function_format (name, assembler_name, coerced_params);
3051 /* Recognize certain built-in functions so we can make tree-codes
3052 other than CALL_EXPR. We do this when it enables fold-const.c
3053 to do something useful. */
3055 if (TREE_CODE (function) == ADDR_EXPR
3056 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
3057 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
3059 result = expand_tree_builtin (TREE_OPERAND (function, 0),
3060 params, coerced_params);
3066 result = build_call (function, coerced_params);
3067 value_type = TREE_TYPE (result);
3069 if (require_complete)
3071 if (TREE_CODE (value_type) == VOID_TYPE)
3073 result = require_complete_type (result);
3075 if (IS_AGGR_TYPE (value_type))
3076 result = build_cplus_new (value_type, result);
3077 return convert_from_reference (result);
3081 build_function_call (function, params)
3082 tree function, params;
3084 return build_function_call_real (function, params, 1, LOOKUP_NORMAL);
3087 /* Convert the actual parameter expressions in the list VALUES
3088 to the types in the list TYPELIST.
3089 If parmdecls is exhausted, or when an element has NULL as its type,
3090 perform the default conversions.
3092 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3094 This is also where warnings about wrong number of args are generated.
3096 Return a list of expressions for the parameters as converted.
3098 Both VALUES and the returned value are chains of TREE_LIST nodes
3099 with the elements of the list in the TREE_VALUE slots of those nodes.
3101 In C++, unspecified trailing parameters can be filled in with their
3102 default arguments, if such were specified. Do so here. */
3105 convert_arguments (typelist, values, fndecl, flags)
3106 tree typelist, values, fndecl;
3109 register tree typetail, valtail;
3110 register tree result = NULL_TREE;
3111 const char *called_thing = 0;
3114 /* Argument passing is always copy-initialization. */
3115 flags |= LOOKUP_ONLYCONVERTING;
3119 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3121 if (DECL_NAME (fndecl) == NULL_TREE
3122 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3123 called_thing = "constructor";
3125 called_thing = "member function";
3128 called_thing = "function";
3131 for (valtail = values, typetail = typelist;
3133 valtail = TREE_CHAIN (valtail), i++)
3135 register tree type = typetail ? TREE_VALUE (typetail) : 0;
3136 register tree val = TREE_VALUE (valtail);
3138 if (val == error_mark_node)
3139 return error_mark_node;
3141 if (type == void_type_node)
3145 cp_error_at ("too many arguments to %s `%+#D'", called_thing,
3147 error ("at this point in file");
3150 error ("too many arguments to function");
3151 /* In case anybody wants to know if this argument
3154 TREE_TYPE (tree_last (result)) = error_mark_node;
3158 if (TREE_CODE (val) == OFFSET_REF)
3159 val = resolve_offset_ref (val);
3161 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3162 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3163 if (TREE_CODE (val) == NOP_EXPR
3164 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3165 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3166 val = TREE_OPERAND (val, 0);
3168 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3170 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3171 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3172 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3173 val = default_conversion (val);
3176 if (val == error_mark_node)
3177 return error_mark_node;
3181 /* Formal parm type is specified by a function prototype. */
3184 if (!COMPLETE_TYPE_P (complete_type (type)))
3186 error ("parameter type of called function is incomplete");
3191 parmval = convert_for_initialization
3192 (NULL_TREE, type, val, flags,
3193 "argument passing", fndecl, i);
3194 if (PROMOTE_PROTOTYPES
3195 && (TREE_CODE (type) == INTEGER_TYPE
3196 || TREE_CODE (type) == ENUMERAL_TYPE)
3197 && (TYPE_PRECISION (type)
3198 < TYPE_PRECISION (integer_type_node)))
3199 parmval = default_conversion (parmval);
3202 if (parmval == error_mark_node)
3203 return error_mark_node;
3205 result = tree_cons (NULL_TREE, parmval, result);
3209 if (TREE_CODE (TREE_TYPE (val)) == REFERENCE_TYPE)
3210 val = convert_from_reference (val);
3212 result = tree_cons (NULL_TREE,
3213 convert_arg_to_ellipsis (val),
3218 typetail = TREE_CHAIN (typetail);
3221 if (typetail != 0 && typetail != void_list_node)
3223 /* See if there are default arguments that can be used */
3224 if (TREE_PURPOSE (typetail))
3226 for (; typetail != void_list_node; ++i)
3229 = convert_default_arg (TREE_VALUE (typetail),
3230 TREE_PURPOSE (typetail),
3233 if (parmval == error_mark_node)
3234 return error_mark_node;
3236 result = tree_cons (0, parmval, result);
3237 typetail = TREE_CHAIN (typetail);
3238 /* ends with `...'. */
3239 if (typetail == NULL_TREE)
3247 cp_error_at ("too few arguments to %s `%+#D'",
3248 called_thing, fndecl);
3249 error ("at this point in file");
3252 error ("too few arguments to function");
3253 return error_mark_list;
3257 return nreverse (result);
3260 /* Build a binary-operation expression, after performing default
3261 conversions on the operands. CODE is the kind of expression to build. */
3264 build_x_binary_op (code, arg1, arg2)
3265 enum tree_code code;
3268 if (processing_template_decl)
3269 return build_min_nt (code, arg1, arg2);
3271 return build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE);
3274 /* Build a binary-operation expression without default conversions.
3275 CODE is the kind of expression to build.
3276 This function differs from `build' in several ways:
3277 the data type of the result is computed and recorded in it,
3278 warnings are generated if arg data types are invalid,
3279 special handling for addition and subtraction of pointers is known,
3280 and some optimization is done (operations on narrow ints
3281 are done in the narrower type when that gives the same result).
3282 Constant folding is also done before the result is returned.
3284 Note that the operands will never have enumeral types
3285 because either they have just had the default conversions performed
3286 or they have both just been converted to some other type in which
3287 the arithmetic is to be done.
3289 C++: must do special pointer arithmetic when implementing
3290 multiple inheritance, and deal with pointer to member functions. */
3293 build_binary_op (code, orig_op0, orig_op1, convert_p)
3294 enum tree_code code;
3295 tree orig_op0, orig_op1;
3296 int convert_p ATTRIBUTE_UNUSED;
3299 register enum tree_code code0, code1;
3302 /* Expression code to give to the expression when it is built.
3303 Normally this is CODE, which is what the caller asked for,
3304 but in some special cases we change it. */
3305 register enum tree_code resultcode = code;
3307 /* Data type in which the computation is to be performed.
3308 In the simplest cases this is the common type of the arguments. */
3309 register tree result_type = NULL;
3311 /* Nonzero means operands have already been type-converted
3312 in whatever way is necessary.
3313 Zero means they need to be converted to RESULT_TYPE. */
3316 /* Nonzero means create the expression with this type, rather than
3318 tree build_type = 0;
3320 /* Nonzero means after finally constructing the expression
3321 convert it to this type. */
3322 tree final_type = 0;
3324 /* Nonzero if this is an operation like MIN or MAX which can
3325 safely be computed in short if both args are promoted shorts.
3326 Also implies COMMON.
3327 -1 indicates a bitwise operation; this makes a difference
3328 in the exact conditions for when it is safe to do the operation
3329 in a narrower mode. */
3332 /* Nonzero if this is a comparison operation;
3333 if both args are promoted shorts, compare the original shorts.
3334 Also implies COMMON. */
3335 int short_compare = 0;
3337 /* Nonzero if this is a right-shift operation, which can be computed on the
3338 original short and then promoted if the operand is a promoted short. */
3339 int short_shift = 0;
3341 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3344 /* Apply default conversions. */
3345 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3346 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3347 || code == TRUTH_XOR_EXPR)
3349 op0 = decay_conversion (orig_op0);
3350 op1 = decay_conversion (orig_op1);
3354 op0 = default_conversion (orig_op0);
3355 op1 = default_conversion (orig_op1);
3358 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3359 STRIP_TYPE_NOPS (op0);
3360 STRIP_TYPE_NOPS (op1);
3362 /* DTRT if one side is an overloaded function, but complain about it. */
3363 if (type_unknown_p (op0))
3365 tree t = instantiate_type (TREE_TYPE (op1), op0, 0);
3366 if (t != error_mark_node)
3368 cp_pedwarn ("assuming cast to type `%T' from overloaded function",
3373 if (type_unknown_p (op1))
3375 tree t = instantiate_type (TREE_TYPE (op0), op1, 0);
3376 if (t != error_mark_node)
3378 cp_pedwarn ("assuming cast to type `%T' from overloaded function",
3384 type0 = TREE_TYPE (op0);
3385 type1 = TREE_TYPE (op1);
3387 /* The expression codes of the data types of the arguments tell us
3388 whether the arguments are integers, floating, pointers, etc. */
3389 code0 = TREE_CODE (type0);
3390 code1 = TREE_CODE (type1);
3392 /* If an error was already reported for one of the arguments,
3393 avoid reporting another error. */
3395 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3396 return error_mark_node;
3401 /* Handle the pointer + int case. */
3402 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3403 return pointer_int_sum (PLUS_EXPR, op0, op1);
3404 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
3405 return pointer_int_sum (PLUS_EXPR, op1, op0);
3411 /* Subtraction of two similar pointers.
3412 We must subtract them as integers, then divide by object size. */
3413 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3414 && comp_target_types (type0, type1, 1))
3415 return pointer_diff (op0, op1, common_type (type0, type1));
3416 /* Handle pointer minus int. Just like pointer plus int. */
3417 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3418 return pointer_int_sum (MINUS_EXPR, op0, op1);
3427 case TRUNC_DIV_EXPR:
3429 case FLOOR_DIV_EXPR:
3430 case ROUND_DIV_EXPR:
3431 case EXACT_DIV_EXPR:
3432 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3433 || code0 == COMPLEX_TYPE)
3434 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3435 || code1 == COMPLEX_TYPE))
3437 if (TREE_CODE (op1) == INTEGER_CST && integer_zerop (op1))
3438 cp_warning ("division by zero in `%E / 0'", op0);
3439 else if (TREE_CODE (op1) == REAL_CST && real_zerop (op1))
3440 cp_warning ("division by zero in `%E / 0.'", op0);
3442 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
3443 resultcode = RDIV_EXPR;
3445 /* When dividing two signed integers, we have to promote to int.
3446 unless we divide by a constant != -1. Note that default
3447 conversion will have been performed on the operands at this
3448 point, so we have to dig out the original type to find out if
3450 shorten = ((TREE_CODE (op0) == NOP_EXPR
3451 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3452 || (TREE_CODE (op1) == INTEGER_CST
3453 && ! integer_all_onesp (op1)));
3460 case BIT_ANDTC_EXPR:
3463 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3465 /* If one operand is a constant, and the other is a short type
3466 that has been converted to an int,
3467 really do the work in the short type and then convert the
3468 result to int. If we are lucky, the constant will be 0 or 1
3469 in the short type, making the entire operation go away. */
3470 if (TREE_CODE (op0) == INTEGER_CST
3471 && TREE_CODE (op1) == NOP_EXPR
3472 && (TYPE_PRECISION (type1)
3473 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0))))
3474 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
3476 final_type = result_type;
3477 op1 = TREE_OPERAND (op1, 0);
3478 result_type = TREE_TYPE (op1);
3480 if (TREE_CODE (op1) == INTEGER_CST
3481 && TREE_CODE (op0) == NOP_EXPR
3482 && (TYPE_PRECISION (type0)
3483 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0))))
3484 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3486 final_type = result_type;
3487 op0 = TREE_OPERAND (op0, 0);
3488 result_type = TREE_TYPE (op0);
3492 case TRUNC_MOD_EXPR:
3493 case FLOOR_MOD_EXPR:
3494 if (code1 == INTEGER_TYPE && integer_zerop (op1))
3495 cp_warning ("division by zero in `%E %% 0'", op0);
3496 else if (code1 == REAL_TYPE && real_zerop (op1))
3497 cp_warning ("division by zero in `%E %% 0.'", op0);
3499 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3501 /* Although it would be tempting to shorten always here, that loses
3502 on some targets, since the modulo instruction is undefined if the
3503 quotient can't be represented in the computation mode. We shorten
3504 only if unsigned or if dividing by something we know != -1. */
3505 shorten = ((TREE_CODE (op0) == NOP_EXPR
3506 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3507 || (TREE_CODE (op1) == INTEGER_CST
3508 && ! integer_all_onesp (op1)));
3513 case TRUTH_ANDIF_EXPR:
3514 case TRUTH_ORIF_EXPR:
3515 case TRUTH_AND_EXPR:
3517 result_type = boolean_type_node;
3520 /* Shift operations: result has same type as first operand;
3521 always convert second operand to int.
3522 Also set SHORT_SHIFT if shifting rightward. */
3525 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3527 result_type = type0;
3528 if (TREE_CODE (op1) == INTEGER_CST)
3530 if (tree_int_cst_lt (op1, integer_zero_node))
3531 warning ("right shift count is negative");
3534 if (! integer_zerop (op1))
3536 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3537 warning ("right shift count >= width of type");
3540 /* Convert the shift-count to an integer, regardless of
3541 size of value being shifted. */
3542 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3543 op1 = cp_convert (integer_type_node, op1);
3544 /* Avoid converting op1 to result_type later. */
3550 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3552 result_type = type0;
3553 if (TREE_CODE (op1) == INTEGER_CST)
3555 if (tree_int_cst_lt (op1, integer_zero_node))
3556 warning ("left shift count is negative");
3557 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3558 warning ("left shift count >= width of type");
3560 /* Convert the shift-count to an integer, regardless of
3561 size of value being shifted. */
3562 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3563 op1 = cp_convert (integer_type_node, op1);
3564 /* Avoid converting op1 to result_type later. */
3571 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3573 result_type = type0;
3574 if (TREE_CODE (op1) == INTEGER_CST)
3576 if (tree_int_cst_lt (op1, integer_zero_node))
3577 warning ("%s rotate count is negative",
3578 (code == LROTATE_EXPR) ? "left" : "right");
3579 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3580 warning ("%s rotate count >= width of type",
3581 (code == LROTATE_EXPR) ? "left" : "right");
3583 /* Convert the shift-count to an integer, regardless of
3584 size of value being shifted. */
3585 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3586 op1 = cp_convert (integer_type_node, op1);
3592 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
3593 warning ("comparing floating point with == or != is unsafe");
3595 build_type = boolean_type_node;
3596 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3597 || code0 == COMPLEX_TYPE)
3598 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3599 || code1 == COMPLEX_TYPE))
3601 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3602 result_type = composite_pointer_type (type0, type1, op0, op1,
3604 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
3605 result_type = type0;
3606 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
3607 result_type = type1;
3608 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3610 result_type = type0;
3611 error ("ISO C++ forbids comparison between pointer and integer");
3613 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3615 result_type = type1;
3616 error ("ISO C++ forbids comparison between pointer and integer");
3618 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3622 op0 = build_component_ref (op0, pfn_identifier, NULL_TREE, 0);
3623 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3627 op0 = build_component_ref (op0, index_identifier, NULL_TREE, 0);
3628 op1 = integer_zero_node;
3630 result_type = TREE_TYPE (op0);
3632 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3633 return cp_build_binary_op (code, op1, op0);
3634 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1)
3635 && same_type_p (type0, type1))
3637 /* E will be the final comparison. */
3639 /* E1 and E2 are for scratch. */
3648 && (!op0.pfn || op0.delta == op1.delta))
3650 The reason for the `!op0.pfn' bit is that a NULL
3651 pointer-to-member is any member with a zero PFN; the
3652 DELTA field is unspecified. */
3658 pfn0 = pfn_from_ptrmemfunc (op0);
3659 pfn1 = pfn_from_ptrmemfunc (op1);
3660 delta0 = build_component_ref (op0, delta_identifier,
3662 delta1 = build_component_ref (op1, delta_identifier,
3664 e1 = cp_build_binary_op (EQ_EXPR, delta0, delta1);
3665 e2 = cp_build_binary_op (NE_EXPR,
3667 cp_convert (TREE_TYPE (pfn0),
3668 integer_zero_node));
3669 e1 = cp_build_binary_op (TRUTH_ORIF_EXPR, e1, e2);
3670 e2 = build (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3671 e = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1);
3675 /* The code we generate for the test is:
3677 (op0.index == op1.index
3678 && ((op1.index != -1 && op0.delta2 == op1.delta2)
3679 || op0.pfn == op1.pfn)) */
3681 tree index0 = build_component_ref (op0, index_identifier,
3683 tree index1 = save_expr (build_component_ref (op1, index_identifier,
3685 tree pfn0 = PFN_FROM_PTRMEMFUNC (op0);
3686 tree pfn1 = PFN_FROM_PTRMEMFUNC (op1);
3687 tree delta20 = DELTA2_FROM_PTRMEMFUNC (op0);
3688 tree delta21 = DELTA2_FROM_PTRMEMFUNC (op1);
3690 tree integer_neg_one_node
3691 = cp_build_binary_op (MINUS_EXPR, integer_zero_node,
3693 e1 = cp_build_binary_op (EQ_EXPR, index0, index1);
3694 e2 = cp_build_binary_op (NE_EXPR, index1, integer_neg_one_node);
3695 e2 = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2,
3696 cp_build_binary_op (EQ_EXPR,
3698 /* We can't use build_binary_op for this cmp because it
3699 would get confused by the ptr to method types and
3700 think we want pmfs. */
3701 e3 = build (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3702 e2 = cp_build_binary_op (TRUTH_ORIF_EXPR, e2, e3);
3703 e = cp_build_binary_op (TRUTH_ANDIF_EXPR, e1, e2);
3705 if (code == EQ_EXPR)
3707 return cp_build_binary_op (EQ_EXPR, e, integer_zero_node);
3709 else if ((TYPE_PTRMEMFUNC_P (type0)
3710 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0), type1))
3711 || (TYPE_PTRMEMFUNC_P (type1)
3712 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1), type0)))
3713 my_friendly_abort (20000221);
3718 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3719 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3721 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3722 result_type = composite_pointer_type (type0, type1, op0, op1,
3730 build_type = boolean_type_node;
3731 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3732 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3734 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3735 result_type = composite_pointer_type (type0, type1, op0, op1,
3737 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3738 && integer_zerop (op1))
3739 result_type = type0;
3740 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3741 && integer_zerop (op0))
3742 result_type = type1;
3743 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3745 result_type = type0;
3746 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3748 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3750 result_type = type1;
3751 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3755 case UNORDERED_EXPR:
3762 build_type = integer_type_node;
3763 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
3765 error ("unordered comparison on non-floating point argument");
3766 return error_mark_node;
3775 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
3777 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
3779 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
3781 if (shorten || common || short_compare)
3782 result_type = common_type (type0, type1);
3784 /* For certain operations (which identify themselves by shorten != 0)
3785 if both args were extended from the same smaller type,
3786 do the arithmetic in that type and then extend.
3788 shorten !=0 and !=1 indicates a bitwise operation.
3789 For them, this optimization is safe only if
3790 both args are zero-extended or both are sign-extended.
3791 Otherwise, we might change the result.
3792 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3793 but calculated in (unsigned short) it would be (unsigned short)-1. */
3795 if (shorten && none_complex)
3797 int unsigned0, unsigned1;
3798 tree arg0 = get_narrower (op0, &unsigned0);
3799 tree arg1 = get_narrower (op1, &unsigned1);
3800 /* UNS is 1 if the operation to be done is an unsigned one. */
3801 int uns = TREE_UNSIGNED (result_type);
3804 final_type = result_type;
3806 /* Handle the case that OP0 does not *contain* a conversion
3807 but it *requires* conversion to FINAL_TYPE. */
3809 if (op0 == arg0 && TREE_TYPE (op0) != final_type)
3810 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
3811 if (op1 == arg1 && TREE_TYPE (op1) != final_type)
3812 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
3814 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3816 /* For bitwise operations, signedness of nominal type
3817 does not matter. Consider only how operands were extended. */
3821 /* Note that in all three cases below we refrain from optimizing
3822 an unsigned operation on sign-extended args.
3823 That would not be valid. */
3825 /* Both args variable: if both extended in same way
3826 from same width, do it in that width.
3827 Do it unsigned if args were zero-extended. */
3828 if ((TYPE_PRECISION (TREE_TYPE (arg0))
3829 < TYPE_PRECISION (result_type))
3830 && (TYPE_PRECISION (TREE_TYPE (arg1))
3831 == TYPE_PRECISION (TREE_TYPE (arg0)))
3832 && unsigned0 == unsigned1
3833 && (unsigned0 || !uns))
3835 = signed_or_unsigned_type (unsigned0,
3836 common_type (TREE_TYPE (arg0),
3838 else if (TREE_CODE (arg0) == INTEGER_CST
3839 && (unsigned1 || !uns)
3840 && (TYPE_PRECISION (TREE_TYPE (arg1))
3841 < TYPE_PRECISION (result_type))
3842 && (type = signed_or_unsigned_type (unsigned1,
3844 int_fits_type_p (arg0, type)))
3846 else if (TREE_CODE (arg1) == INTEGER_CST
3847 && (unsigned0 || !uns)
3848 && (TYPE_PRECISION (TREE_TYPE (arg0))
3849 < TYPE_PRECISION (result_type))
3850 && (type = signed_or_unsigned_type (unsigned0,
3852 int_fits_type_p (arg1, type)))
3856 /* Shifts can be shortened if shifting right. */
3861 tree arg0 = get_narrower (op0, &unsigned_arg);
3863 final_type = result_type;
3865 if (arg0 == op0 && final_type == TREE_TYPE (op0))
3866 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
3868 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
3869 /* We can shorten only if the shift count is less than the
3870 number of bits in the smaller type size. */
3871 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
3872 /* If arg is sign-extended and then unsigned-shifted,
3873 we can simulate this with a signed shift in arg's type
3874 only if the extended result is at least twice as wide
3875 as the arg. Otherwise, the shift could use up all the
3876 ones made by sign-extension and bring in zeros.
3877 We can't optimize that case at all, but in most machines
3878 it never happens because available widths are 2**N. */
3879 && (!TREE_UNSIGNED (final_type)
3881 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0)))
3882 <= TYPE_PRECISION (result_type))))
3884 /* Do an unsigned shift if the operand was zero-extended. */
3886 = signed_or_unsigned_type (unsigned_arg,
3888 /* Convert value-to-be-shifted to that type. */
3889 if (TREE_TYPE (op0) != result_type)
3890 op0 = cp_convert (result_type, op0);
3895 /* Comparison operations are shortened too but differently.
3896 They identify themselves by setting short_compare = 1. */
3900 /* Don't write &op0, etc., because that would prevent op0
3901 from being kept in a register.
3902 Instead, make copies of the our local variables and
3903 pass the copies by reference, then copy them back afterward. */
3904 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3905 enum tree_code xresultcode = resultcode;
3907 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3909 return cp_convert (boolean_type_node, val);
3910 op0 = xop0, op1 = xop1;
3912 resultcode = xresultcode;
3915 if (short_compare && warn_sign_compare)
3917 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
3918 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
3920 int unsignedp0, unsignedp1;
3921 tree primop0 = get_narrower (op0, &unsignedp0);
3922 tree primop1 = get_narrower (op1, &unsignedp1);
3924 /* Check for comparison of different enum types. */
3925 if (TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
3926 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
3927 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
3928 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
3930 cp_warning ("comparison between types `%#T' and `%#T'",
3931 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
3934 /* Give warnings for comparisons between signed and unsigned
3935 quantities that may fail. */
3936 /* Do the checking based on the original operand trees, so that
3937 casts will be considered, but default promotions won't be. */
3939 /* Do not warn if the comparison is being done in a signed type,
3940 since the signed type will only be chosen if it can represent
3941 all the values of the unsigned type. */
3942 if (! TREE_UNSIGNED (result_type))
3944 /* Do not warn if both operands are unsigned. */
3945 else if (op0_signed == op1_signed)
3947 /* Do not warn if the signed quantity is an unsuffixed
3948 integer literal (or some static constant expression
3949 involving such literals or a conditional expression
3950 involving such literals) and it is non-negative. */
3951 else if ((op0_signed && tree_expr_nonnegative_p (orig_op0))
3952 || (op1_signed && tree_expr_nonnegative_p (orig_op1)))
3954 /* Do not warn if the comparison is an equality operation,
3955 the unsigned quantity is an integral constant and it does
3956 not use the most significant bit of result_type. */
3957 else if ((resultcode == EQ_EXPR || resultcode == NE_EXPR)
3958 && ((op0_signed && TREE_CODE (orig_op1) == INTEGER_CST
3959 && int_fits_type_p (orig_op1,
3960 signed_type (result_type)))
3961 || (op1_signed && TREE_CODE (orig_op0) == INTEGER_CST
3962 && int_fits_type_p (orig_op0,
3963 signed_type (result_type)))))
3966 warning ("comparison between a signed and an unsigned integer expressions");
3968 /* Warn if two unsigned values are being compared in a size
3969 larger than their original size, and one (and only one) is the
3970 result of a `~' operator. This comparison will always fail.
3972 Also warn if one operand is a constant, and the constant does not
3973 have all bits set that are set in the ~ operand when it is
3976 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
3977 ^ (TREE_CODE (primop1) == BIT_NOT_EXPR))
3979 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
3980 primop0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
3981 if (TREE_CODE (primop1) == BIT_NOT_EXPR)
3982 primop1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
3984 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
3987 HOST_WIDE_INT constant, mask;
3991 if (host_integerp (primop0, 0))
3994 unsignedp = unsignedp1;
3995 constant = tree_low_cst (primop0, 0);
4000 unsignedp = unsignedp0;
4001 constant = tree_low_cst (primop1, 0);
4004 bits = TYPE_PRECISION (TREE_TYPE (primop));
4005 if (bits < TYPE_PRECISION (result_type)
4006 && bits < HOST_BITS_PER_LONG && unsignedp)
4008 mask = (~ (HOST_WIDE_INT) 0) << bits;
4009 if ((mask & constant) != mask)
4010 warning ("comparison of promoted ~unsigned with constant");
4013 else if (unsignedp0 && unsignedp1
4014 && (TYPE_PRECISION (TREE_TYPE (primop0))
4015 < TYPE_PRECISION (result_type))
4016 && (TYPE_PRECISION (TREE_TYPE (primop1))
4017 < TYPE_PRECISION (result_type)))
4018 warning ("comparison of promoted ~unsigned with unsigned");
4023 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
4024 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4025 Then the expression will be built.
4026 It will be given type FINAL_TYPE if that is nonzero;
4027 otherwise, it will be given type RESULT_TYPE. */
4031 cp_error ("invalid operands of types `%T' and `%T' to binary `%O'",
4032 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4033 return error_mark_node;
4036 /* Issue warnings about peculiar, but legal, uses of NULL. */
4037 if (/* It's reasonable to use pointer values as operands of &&
4038 and ||, so NULL is no exception. */
4039 !(code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
4040 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
4041 (orig_op0 == null_node
4042 && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE)
4043 /* Or vice versa. */
4044 || (orig_op1 == null_node
4045 && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE)
4046 /* Or, both are NULL and the operation was not a comparison. */
4047 || (orig_op0 == null_node && orig_op1 == null_node
4048 && code != EQ_EXPR && code != NE_EXPR)))
4049 /* Some sort of arithmetic operation involving NULL was
4050 performed. Note that pointer-difference and pointer-addition
4051 have already been handled above, and so we don't end up here in
4053 cp_warning ("NULL used in arithmetic");
4057 if (TREE_TYPE (op0) != result_type)
4058 op0 = cp_convert (result_type, op0);
4059 if (TREE_TYPE (op1) != result_type)
4060 op1 = cp_convert (result_type, op1);
4062 if (op0 == error_mark_node || op1 == error_mark_node)
4063 return error_mark_node;
4066 if (build_type == NULL_TREE)
4067 build_type = result_type;
4070 register tree result = build (resultcode, build_type, op0, op1);
4071 register tree folded;
4073 folded = fold (result);
4074 if (folded == result)
4075 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
4076 if (final_type != 0)
4077 return cp_convert (final_type, folded);
4082 /* Return a tree for the sum or difference (RESULTCODE says which)
4083 of pointer PTROP and integer INTOP. */
4086 pointer_int_sum (resultcode, ptrop, intop)
4087 enum tree_code resultcode;
4088 register tree ptrop, intop;
4092 register tree result;
4093 register tree folded = fold (intop);
4095 /* The result is a pointer of the same type that is being added. */
4097 register tree result_type = TREE_TYPE (ptrop);
4099 if (!complete_type_or_else (result_type, ptrop))
4100 return error_mark_node;
4102 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
4104 if (pedantic || warn_pointer_arith)
4105 pedwarn ("ISO C++ forbids using pointer of type `void *' in pointer arithmetic");
4106 size_exp = integer_one_node;
4108 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
4110 if (pedantic || warn_pointer_arith)
4111 pedwarn ("ISO C++ forbids using a pointer-to-function in pointer arithmetic");
4112 size_exp = integer_one_node;
4114 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
4116 if (pedantic || warn_pointer_arith)
4117 pedwarn ("ISO C++ forbids using a pointer to member function in pointer arithmetic");
4118 size_exp = integer_one_node;
4120 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
4122 if (pedantic || warn_pointer_arith)
4123 pedwarn ("ISO C++ forbids using pointer to a member in pointer arithmetic");
4124 size_exp = integer_one_node;
4127 size_exp = size_in_bytes (complete_type (TREE_TYPE (result_type)));
4129 /* Needed to make OOPS V2R3 work. */
4131 if (integer_zerop (intop))
4134 /* If what we are about to multiply by the size of the elements
4135 contains a constant term, apply distributive law
4136 and multiply that constant term separately.
4137 This helps produce common subexpressions. */
4139 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
4140 && ! TREE_CONSTANT (intop)
4141 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
4142 && TREE_CONSTANT (size_exp))
4144 enum tree_code subcode = resultcode;
4145 if (TREE_CODE (intop) == MINUS_EXPR)
4146 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
4147 ptrop = cp_build_binary_op (subcode, ptrop, TREE_OPERAND (intop, 1));
4148 intop = TREE_OPERAND (intop, 0);
4151 /* Convert the integer argument to a type the same size as sizetype
4152 so the multiply won't overflow spuriously. */
4154 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype))
4155 intop = cp_convert (type_for_size (TYPE_PRECISION (sizetype), 0), intop);
4157 /* Replace the integer argument with a suitable product by the object size.
4158 Do this multiplication as signed, then convert to the appropriate
4159 pointer type (actually unsigned integral). */
4161 intop = cp_convert (result_type,
4162 cp_build_binary_op (MULT_EXPR, intop,
4163 cp_convert (TREE_TYPE (intop),
4166 /* Create the sum or difference. */
4168 result = build (resultcode, result_type, ptrop, intop);
4170 folded = fold (result);
4171 if (folded == result)
4172 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
4176 /* Return a tree for the difference of pointers OP0 and OP1.
4177 The resulting tree has type int. */
4180 pointer_diff (op0, op1, ptrtype)
4181 register tree op0, op1;
4182 register tree ptrtype;
4184 register tree result, folded;
4185 tree restype = ptrdiff_type_node;
4186 tree target_type = TREE_TYPE (ptrtype);
4188 if (!complete_type_or_else (target_type, NULL_TREE))
4189 return error_mark_node;
4191 if (pedantic || warn_pointer_arith)
4193 if (TREE_CODE (target_type) == VOID_TYPE)
4194 pedwarn ("ISO C++ forbids using pointer of type `void *' in subtraction");
4195 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4196 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
4197 if (TREE_CODE (target_type) == METHOD_TYPE)
4198 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
4199 if (TREE_CODE (target_type) == OFFSET_TYPE)
4200 pedwarn ("ISO C++ forbids using pointer to a member in subtraction");
4203 /* First do the subtraction as integers;
4204 then drop through to build the divide operator. */
4206 op0 = cp_build_binary_op (MINUS_EXPR,
4207 cp_convert (restype, op0),
4208 cp_convert (restype, op1));
4210 /* This generates an error if op1 is a pointer to an incomplete type. */
4211 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4212 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4214 op1 = ((TREE_CODE (target_type) == VOID_TYPE
4215 || TREE_CODE (target_type) == FUNCTION_TYPE
4216 || TREE_CODE (target_type) == METHOD_TYPE
4217 || TREE_CODE (target_type) == OFFSET_TYPE)
4219 : size_in_bytes (target_type));
4221 /* Do the division. */
4223 result = build (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4225 folded = fold (result);
4226 if (folded == result)
4227 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
4231 /* Handle the case of taking the address of a COMPONENT_REF.
4232 Called by `build_unary_op'.
4234 ARG is the COMPONENT_REF whose address we want.
4235 ARGTYPE is the pointer type that this address should have. */
4238 build_component_addr (arg, argtype)
4241 tree field = TREE_OPERAND (arg, 1);
4242 tree basetype = decl_type_context (field);
4243 tree rval = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0);
4245 my_friendly_assert (TREE_CODE (field) == FIELD_DECL, 981018);
4247 if (DECL_C_BIT_FIELD (field))
4249 cp_error ("attempt to take address of bit-field structure member `%D'",
4251 return error_mark_node;
4254 if (TREE_CODE (field) == FIELD_DECL
4255 && TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype))
4257 /* Can't convert directly to ARGTYPE, since that
4258 may have the same pointer type as one of our
4260 rval = build1 (NOP_EXPR, argtype,
4261 convert_pointer_to (basetype, rval));
4262 TREE_CONSTANT (rval) = TREE_CONSTANT (TREE_OPERAND (rval, 0));
4265 /* This conversion is harmless. */
4266 rval = convert_force (argtype, rval, 0);
4268 return fold (build (PLUS_EXPR, argtype, rval,
4269 cp_convert (argtype, byte_position (field))));
4272 /* Construct and perhaps optimize a tree representation
4273 for a unary operation. CODE, a tree_code, specifies the operation
4274 and XARG is the operand. */
4277 build_x_unary_op (code, xarg)
4278 enum tree_code code;
4281 if (processing_template_decl)
4282 return build_min_nt (code, xarg, NULL_TREE);
4284 /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an
4286 if (code == ADDR_EXPR
4287 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4288 && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg)))
4289 && !COMPLETE_TYPE_P (TREE_TYPE (xarg)))
4290 || (TREE_CODE (xarg) == OFFSET_REF)))
4291 /* don't look for a function */;
4296 rval = build_new_op (code, LOOKUP_NORMAL, xarg,
4297 NULL_TREE, NULL_TREE);
4298 if (rval || code != ADDR_EXPR)
4302 if (code == ADDR_EXPR)
4304 if (TREE_CODE (xarg) == TARGET_EXPR)
4305 warning ("taking address of temporary");
4308 return build_unary_op (code, xarg, 0);
4311 /* Just like truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4314 condition_conversion (expr)
4318 if (processing_template_decl)
4320 t = perform_implicit_conversion (boolean_type_node, expr);
4321 t = fold (build1 (CLEANUP_POINT_EXPR, boolean_type_node, t));
4325 /* C++: Must handle pointers to members.
4327 Perhaps type instantiation should be extended to handle conversion
4328 from aggregates to types we don't yet know we want? (Or are those
4329 cases typically errors which should be reported?)
4331 NOCONVERT nonzero suppresses the default promotions
4332 (such as from short to int). */
4335 build_unary_op (code, xarg, noconvert)
4336 enum tree_code code;
4340 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4341 register tree arg = xarg;
4342 register tree argtype = 0;
4343 const char *errstring = NULL;
4346 if (arg == error_mark_node)
4347 return error_mark_node;
4352 /* This is used for unary plus, because a CONVERT_EXPR
4353 is enough to prevent anybody from looking inside for
4354 associativity, but won't generate any code. */
4355 if (!(arg = build_expr_type_conversion
4356 (WANT_ARITH | WANT_ENUM | WANT_POINTER, arg, 1)))
4357 errstring = "wrong type argument to unary plus";
4361 arg = default_conversion (arg);
4362 arg = build1 (NON_LVALUE_EXPR, TREE_TYPE (arg), arg);
4363 TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0));
4368 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, 1)))
4369 errstring = "wrong type argument to unary minus";
4370 else if (!noconvert)
4371 arg = default_conversion (arg);
4375 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4379 arg = default_conversion (arg);
4381 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM,
4383 errstring = "wrong type argument to bit-complement";
4384 else if (!noconvert)
4385 arg = default_conversion (arg);
4389 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, 1)))
4390 errstring = "wrong type argument to abs";
4391 else if (!noconvert)
4392 arg = default_conversion (arg);
4396 /* Conjugating a real value is a no-op, but allow it anyway. */
4397 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, 1)))
4398 errstring = "wrong type argument to conjugation";
4399 else if (!noconvert)
4400 arg = default_conversion (arg);
4403 case TRUTH_NOT_EXPR:
4404 arg = cp_convert (boolean_type_node, arg);
4405 val = invert_truthvalue (arg);
4406 if (arg != error_mark_node)
4408 errstring = "in argument to unary !";
4415 if (TREE_CODE (arg) == COMPLEX_CST)
4416 return TREE_REALPART (arg);
4417 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4418 return fold (build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
4423 if (TREE_CODE (arg) == COMPLEX_CST)
4424 return TREE_IMAGPART (arg);
4425 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4426 return fold (build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg));
4428 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4430 case PREINCREMENT_EXPR:
4431 case POSTINCREMENT_EXPR:
4432 case PREDECREMENT_EXPR:
4433 case POSTDECREMENT_EXPR:
4434 /* Handle complex lvalues (when permitted)
4435 by reduction to simpler cases. */
4437 val = unary_complex_lvalue (code, arg);
4441 /* Increment or decrement the real part of the value,
4442 and don't change the imaginary part. */
4443 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4447 arg = stabilize_reference (arg);
4448 real = build_unary_op (REALPART_EXPR, arg, 1);
4449 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
4450 return build (COMPLEX_EXPR, TREE_TYPE (arg),
4451 build_unary_op (code, real, 1), imag);
4454 /* Report invalid types. */
4456 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4459 if (code == PREINCREMENT_EXPR)
4460 errstring ="no pre-increment operator for type";
4461 else if (code == POSTINCREMENT_EXPR)
4462 errstring ="no post-increment operator for type";
4463 else if (code == PREDECREMENT_EXPR)
4464 errstring ="no pre-decrement operator for type";
4466 errstring ="no post-decrement operator for type";
4470 /* Report something read-only. */
4472 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4473 || TREE_READONLY (arg))
4474 readonly_error (arg, ((code == PREINCREMENT_EXPR
4475 || code == POSTINCREMENT_EXPR)
4476 ? "increment" : "decrement"),
4481 tree result_type = TREE_TYPE (arg);
4483 arg = get_unwidened (arg, 0);
4484 argtype = TREE_TYPE (arg);
4486 /* ARM $5.2.5 last annotation says this should be forbidden. */
4487 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4488 pedwarn ("ISO C++ forbids %sing an enum",
4489 (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4490 ? "increment" : "decrement");
4492 /* Compute the increment. */
4494 if (TREE_CODE (argtype) == POINTER_TYPE)
4496 enum tree_code tmp = TREE_CODE (TREE_TYPE (argtype));
4497 tree type = complete_type (TREE_TYPE (argtype));
4499 if (!COMPLETE_OR_VOID_TYPE_P (type))
4500 cp_error ("cannot %s a pointer to incomplete type `%T'",
4501 ((code == PREINCREMENT_EXPR
4502 || code == POSTINCREMENT_EXPR)
4503 ? "increment" : "decrement"), TREE_TYPE (argtype));
4504 else if ((pedantic || warn_pointer_arith)
4505 && (tmp == FUNCTION_TYPE || tmp == METHOD_TYPE
4506 || tmp == VOID_TYPE || tmp == OFFSET_TYPE))
4507 cp_pedwarn ("ISO C++ forbids %sing a pointer of type `%T'",
4508 ((code == PREINCREMENT_EXPR
4509 || code == POSTINCREMENT_EXPR)
4510 ? "increment" : "decrement"), argtype);
4511 inc = c_sizeof_nowarn (TREE_TYPE (argtype));
4514 inc = integer_one_node;
4516 inc = cp_convert (argtype, inc);
4518 /* Handle incrementing a cast-expression. */
4520 switch (TREE_CODE (arg))
4525 case FIX_TRUNC_EXPR:
4526 case FIX_FLOOR_EXPR:
4527 case FIX_ROUND_EXPR:
4530 tree incremented, modify, value, compound;
4531 if (! lvalue_p (arg) && pedantic)
4532 pedwarn ("cast to non-reference type used as lvalue");
4533 arg = stabilize_reference (arg);
4534 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
4537 value = save_expr (arg);
4538 incremented = build (((code == PREINCREMENT_EXPR
4539 || code == POSTINCREMENT_EXPR)
4540 ? PLUS_EXPR : MINUS_EXPR),
4541 argtype, value, inc);
4543 modify = build_modify_expr (arg, NOP_EXPR, incremented);
4544 compound = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
4546 /* Eliminate warning about unused result of + or -. */
4547 TREE_NO_UNUSED_WARNING (compound) = 1;
4555 /* Complain about anything else that is not a true lvalue. */
4556 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4557 || code == POSTINCREMENT_EXPR)
4558 ? "increment" : "decrement")))
4559 return error_mark_node;
4561 /* Forbid using -- on `bool'. */
4562 if (TREE_TYPE (arg) == boolean_type_node)
4564 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4566 cp_error ("invalid use of `--' on bool variable `%D'", arg);
4567 return error_mark_node;
4570 /* This will only work if someone can convince Kenner to accept
4571 my patch to expand_increment. (jason) */
4572 val = build (code, TREE_TYPE (arg), arg, inc);
4574 if (code == POSTINCREMENT_EXPR)
4576 arg = stabilize_reference (arg);
4577 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg,
4579 arg = save_expr (arg);
4580 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4581 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4584 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg,
4589 val = build (code, TREE_TYPE (arg), arg, inc);
4591 TREE_SIDE_EFFECTS (val) = 1;
4592 return cp_convert (result_type, val);
4596 /* Note that this operation never does default_conversion
4597 regardless of NOCONVERT. */
4599 argtype = lvalue_type (arg);
4600 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4604 build_pointer_type (TREE_TYPE (argtype)), arg);
4605 TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0));
4608 else if (pedantic && DECL_MAIN_P (arg))
4610 pedwarn ("ISO C++ forbids taking address of function `::main'");
4612 /* Let &* cancel out to simplify resulting code. */
4613 if (TREE_CODE (arg) == INDIRECT_REF)
4615 /* We don't need to have `current_class_ptr' wrapped in a
4616 NON_LVALUE_EXPR node. */
4617 if (arg == current_class_ref)
4618 return current_class_ptr;
4620 arg = TREE_OPERAND (arg, 0);
4621 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4625 build_pointer_type (TREE_TYPE (TREE_TYPE (arg))), arg);
4626 TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0));
4628 else if (lvalue_p (arg))
4629 /* Don't let this be an lvalue. */
4630 return non_lvalue (arg);
4634 /* For &x[y], return x+y */
4635 if (TREE_CODE (arg) == ARRAY_REF)
4637 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
4638 return error_mark_node;
4639 return cp_build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
4640 TREE_OPERAND (arg, 1));
4643 /* Uninstantiated types are all functions. Taking the
4644 address of a function is a no-op, so just return the
4647 if (TREE_CODE (arg) == IDENTIFIER_NODE
4648 && IDENTIFIER_OPNAME_P (arg))
4650 my_friendly_abort (117);
4651 /* We don't know the type yet, so just work around the problem.
4652 We know that this will resolve to an lvalue. */
4653 return build1 (ADDR_EXPR, unknown_type_node, arg);
4656 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4657 && OVL_NEXT (TREE_OPERAND (arg, 1)) == NULL_TREE)
4659 /* They're trying to take the address of a unique non-static
4660 member function. This is ill-formed, but let's try to DTRT.
4661 Note: We only handle unique functions here because we don't
4662 want to complain if there's a static overload; non-unique
4663 cases will be handled by instantiate_type. But we need to
4664 handle this case here to allow casts on the resulting PMF. */
4666 tree base = TREE_TYPE (TREE_OPERAND (arg, 0));
4667 tree name = DECL_NAME (OVL_CURRENT (TREE_OPERAND (arg, 1)));
4669 if (! flag_ms_extensions)
4671 if (current_class_type
4672 && TREE_OPERAND (arg, 0) == current_class_ref)
4673 /* An expression like &memfn. */
4674 cp_pedwarn ("ISO C++ forbids taking the address of a non-static member function to form a pointer to member function. Say `&%T::%D'", base, name);
4676 cp_pedwarn ("ISO C++ forbids taking the address of a bound member function to form a pointer to member function", base, name);
4679 arg = build_offset_ref (base, name);
4682 if (type_unknown_p (arg))
4683 return build1 (ADDR_EXPR, unknown_type_node, arg);
4685 /* Handle complex lvalues (when permitted)
4686 by reduction to simpler cases. */
4687 val = unary_complex_lvalue (code, arg);
4691 switch (TREE_CODE (arg))
4696 case FIX_TRUNC_EXPR:
4697 case FIX_FLOOR_EXPR:
4698 case FIX_ROUND_EXPR:
4700 if (! lvalue_p (arg) && pedantic)
4701 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4708 /* Allow the address of a constructor if all the elements
4710 if (TREE_CODE (arg) == CONSTRUCTOR && TREE_HAS_CONSTRUCTOR (arg)
4711 && TREE_CONSTANT (arg))
4713 /* Anything not already handled and not a true memory reference
4715 else if (TREE_CODE (argtype) != FUNCTION_TYPE
4716 && TREE_CODE (argtype) != METHOD_TYPE
4717 && !lvalue_or_else (arg, "unary `&'"))
4718 return error_mark_node;
4720 if (argtype != error_mark_node)
4721 argtype = build_pointer_type (argtype);
4723 if (mark_addressable (arg) == 0)
4724 return error_mark_node;
4729 if (TREE_CODE (arg) == COMPONENT_REF)
4730 addr = build_component_addr (arg, argtype);
4732 addr = build1 (ADDR_EXPR, argtype, arg);
4734 /* Address of a static or external variable or
4735 function counts as a constant */
4737 TREE_CONSTANT (addr) = 1;
4739 if (TREE_CODE (argtype) == POINTER_TYPE
4740 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4742 build_ptrmemfunc_type (argtype);
4743 addr = build_ptrmemfunc (argtype, addr, 0);
4756 argtype = TREE_TYPE (arg);
4757 return fold (build1 (code, argtype, arg));
4760 error ("%s", errstring);
4761 return error_mark_node;
4765 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
4766 convert ARG with the same conversions in the same order
4767 and return the result. */
4770 convert_sequence (conversions, arg)
4774 switch (TREE_CODE (conversions))
4779 case FIX_TRUNC_EXPR:
4780 case FIX_FLOOR_EXPR:
4781 case FIX_ROUND_EXPR:
4783 return cp_convert (TREE_TYPE (conversions),
4784 convert_sequence (TREE_OPERAND (conversions, 0),
4793 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4794 for certain kinds of expressions which are not really lvalues
4795 but which we can accept as lvalues.
4797 If ARG is not a kind of expression we can handle, return zero. */
4800 unary_complex_lvalue (code, arg)
4801 enum tree_code code;
4804 /* Handle (a, b) used as an "lvalue". */
4805 if (TREE_CODE (arg) == COMPOUND_EXPR)
4807 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
4808 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
4809 TREE_OPERAND (arg, 0), real_result);
4812 /* Handle (a ? b : c) used as an "lvalue". */
4813 if (TREE_CODE (arg) == COND_EXPR
4814 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
4815 return rationalize_conditional_expr (code, arg);
4817 if (TREE_CODE (arg) == MODIFY_EXPR
4818 || TREE_CODE (arg) == PREINCREMENT_EXPR
4819 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4820 return unary_complex_lvalue
4821 (code, build (COMPOUND_EXPR, TREE_TYPE (TREE_OPERAND (arg, 0)),
4822 arg, TREE_OPERAND (arg, 0)));
4824 if (code != ADDR_EXPR)
4827 /* Handle (a = b) used as an "lvalue" for `&'. */
4828 if (TREE_CODE (arg) == MODIFY_EXPR
4829 || TREE_CODE (arg) == INIT_EXPR)
4831 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 0), 0);
4832 arg = build (COMPOUND_EXPR, TREE_TYPE (real_result), arg, real_result);
4833 TREE_NO_UNUSED_WARNING (arg) = 1;
4837 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4838 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4839 || TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE)
4841 /* The representation of something of type OFFSET_TYPE
4842 is really the representation of a pointer to it.
4843 Here give the representation its true type. */
4846 my_friendly_assert (TREE_CODE (arg) != SCOPE_REF, 313);
4848 if (TREE_CODE (arg) != OFFSET_REF)
4851 t = TREE_OPERAND (arg, 1);
4853 /* Check all this code for right semantics. */
4854 if (TREE_CODE (t) == FUNCTION_DECL)
4856 if (DECL_DESTRUCTOR_P (t))
4857 cp_error ("taking address of destructor");
4858 return build_unary_op (ADDR_EXPR, t, 0);
4860 if (TREE_CODE (t) == VAR_DECL)
4861 return build_unary_op (ADDR_EXPR, t, 0);
4866 if (TREE_OPERAND (arg, 0)
4867 && ! is_dummy_object (TREE_OPERAND (arg, 0))
4868 && TREE_CODE (t) != FIELD_DECL)
4870 cp_error ("taking address of bound pointer-to-member expression");
4871 return error_mark_node;
4874 type = build_offset_type (DECL_FIELD_CONTEXT (t), TREE_TYPE (t));
4875 type = build_pointer_type (type);
4877 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4883 /* We permit compiler to make function calls returning
4884 objects of aggregate type look like lvalues. */
4888 if (TREE_CODE (targ) == SAVE_EXPR)
4889 targ = TREE_OPERAND (targ, 0);
4891 if (TREE_CODE (targ) == CALL_EXPR && IS_AGGR_TYPE (TREE_TYPE (targ)))
4893 if (TREE_CODE (arg) == SAVE_EXPR)
4896 targ = build_cplus_new (TREE_TYPE (arg), arg);
4897 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
4900 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
4901 return build (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
4902 TREE_OPERAND (targ, 0), current_function_decl, NULL);
4905 /* Don't let anything else be handled specially. */
4909 /* Mark EXP saying that we need to be able to take the
4910 address of it; it should not be allocated in a register.
4911 Value is 1 if successful.
4913 C++: we do not allow `current_class_ptr' to be addressable. */
4916 mark_addressable (exp)
4919 register tree x = exp;
4921 if (TREE_ADDRESSABLE (x) == 1)
4925 switch (TREE_CODE (x))
4932 x = TREE_OPERAND (x, 0);
4936 if (x == current_class_ptr)
4938 if (! flag_this_is_variable)
4939 error ("cannot take the address of `this', which is an ravlue expression");
4940 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later */
4941 put_var_into_stack (x);
4945 if (TREE_STATIC (x) && TREE_READONLY (x)
4946 && DECL_RTL (x) != 0
4947 && ! DECL_IN_MEMORY_P (x))
4949 TREE_ASM_WRITTEN (x) = 0;
4951 rest_of_decl_compilation (x, 0,
4952 !DECL_FUNCTION_SCOPE_P (x),
4954 TREE_ADDRESSABLE (x) = 1;
4958 /* Caller should not be trying to mark initialized
4959 constant fields addressable. */
4960 my_friendly_assert (DECL_LANG_SPECIFIC (x) == 0
4961 || DECL_IN_AGGR_P (x) == 0
4963 || DECL_EXTERNAL (x), 314);
4967 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
4968 && !DECL_ARTIFICIAL (x) && extra_warnings)
4969 cp_warning ("address requested for `%D', which is declared `register'",
4971 TREE_ADDRESSABLE (x) = 1;
4973 if (cfun && expanding_p)
4974 put_var_into_stack (x);
4978 /* We have to test both conditions here. The first may be
4979 non-zero in the case of processing a default function. The
4980 second may be non-zero in the case of a template function. */
4981 if (DECL_LANG_SPECIFIC (x)
4982 && DECL_TEMPLATE_INFO (x)
4983 && !DECL_TEMPLATE_SPECIALIZATION (x))
4985 TREE_ADDRESSABLE (x) = 1;
4987 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
4991 TREE_ADDRESSABLE (x) = 1;
4995 TREE_ADDRESSABLE (x) = 1;
4996 mark_addressable (TREE_OPERAND (x, 0));
5004 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5007 build_x_conditional_expr (ifexp, op1, op2)
5008 tree ifexp, op1, op2;
5010 if (processing_template_decl)
5011 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5013 return build_conditional_expr (ifexp, op1, op2);
5016 /* Handle overloading of the ',' operator when needed. Otherwise,
5017 this function just builds an expression list. */
5020 build_x_compound_expr (list)
5023 tree rest = TREE_CHAIN (list);
5026 if (processing_template_decl)
5027 return build_min_nt (COMPOUND_EXPR, list, NULL_TREE);
5029 if (rest == NULL_TREE)
5030 return build_compound_expr (list);
5032 result = build_opfncall (COMPOUND_EXPR, LOOKUP_NORMAL,
5033 TREE_VALUE (list), TREE_VALUE (rest), NULL_TREE);
5035 return build_x_compound_expr (tree_cons (NULL_TREE, result,
5036 TREE_CHAIN (rest)));
5038 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
5040 /* FIXME: This test should be in the implicit cast to void of the LHS. */
5041 /* the left-hand operand of a comma expression is like an expression
5042 statement: we should warn if it doesn't have any side-effects,
5043 unless it was explicitly cast to (void). */
5044 if ((extra_warnings || warn_unused_value)
5045 && !(TREE_CODE (TREE_VALUE(list)) == CONVERT_EXPR
5046 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE(list)))))
5047 warning("left-hand operand of comma expression has no effect");
5049 #if 0 /* this requires a gcc backend patch to export warn_if_unused_value */
5050 else if (warn_unused_value)
5051 warn_if_unused_value (TREE_VALUE(list));
5054 return build_compound_expr
5055 (tree_cons (NULL_TREE, TREE_VALUE (list),
5056 build_tree_list (NULL_TREE,
5057 build_x_compound_expr (rest))));
5060 /* Given a list of expressions, return a compound expression
5061 that performs them all and returns the value of the last of them. */
5064 build_compound_expr (list)
5070 TREE_VALUE (list) = decl_constant_value (TREE_VALUE (list));
5072 if (TREE_CHAIN (list) == 0)
5074 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5075 Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
5076 if (TREE_CODE (list) == NOP_EXPR
5077 && TREE_TYPE (list) == TREE_TYPE (TREE_OPERAND (list, 0)))
5078 list = TREE_OPERAND (list, 0);
5080 return TREE_VALUE (list);
5083 first = TREE_VALUE (list);
5084 first = convert_to_void (first, "left-hand operand of comma");
5085 if (first == error_mark_node)
5086 return error_mark_node;
5088 rest = build_compound_expr (TREE_CHAIN (list));
5089 if (rest == error_mark_node)
5090 return error_mark_node;
5092 /* When pedantic, a compound expression cannot be a constant expression. */
5093 if (! TREE_SIDE_EFFECTS (first) && ! pedantic)
5096 return build (COMPOUND_EXPR, TREE_TYPE (rest),
5097 break_out_cleanups (first), rest);
5101 build_static_cast (type, expr)
5107 if (type == error_mark_node || expr == error_mark_node)
5108 return error_mark_node;
5110 if (TREE_CODE (expr) == OFFSET_REF)
5111 expr = resolve_offset_ref (expr);
5113 if (processing_template_decl)
5115 tree t = build_min (STATIC_CAST_EXPR, type, expr);
5119 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5120 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5121 if (TREE_CODE (type) != REFERENCE_TYPE
5122 && TREE_CODE (expr) == NOP_EXPR
5123 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5124 expr = TREE_OPERAND (expr, 0);
5126 if (TREE_CODE (type) == VOID_TYPE)
5128 expr = convert_to_void (expr, /*implicit=*/NULL);
5132 if (TREE_CODE (type) == REFERENCE_TYPE)
5133 return (convert_from_reference
5134 (convert_to_reference (type, expr, CONV_STATIC|CONV_IMPLICIT,
5135 LOOKUP_COMPLAIN, NULL_TREE)));
5137 if (IS_AGGR_TYPE (type))
5138 return build_cplus_new (type, (build_method_call
5139 (NULL_TREE, complete_ctor_identifier,
5140 build_tree_list (NULL_TREE, expr),
5141 TYPE_BINFO (type), LOOKUP_NORMAL)));
5143 expr = decay_conversion (expr);
5144 intype = TREE_TYPE (expr);
5146 /* FIXME handle casting to array type. */
5149 if (IS_AGGR_TYPE (intype)
5150 ? can_convert_arg (type, intype, expr)
5151 : can_convert_arg (strip_all_pointer_quals (type),
5152 strip_all_pointer_quals (intype), expr))
5154 else if (TYPE_PTROB_P (type) && TYPE_PTROB_P (intype))
5157 if (IS_AGGR_TYPE (TREE_TYPE (type)) && IS_AGGR_TYPE (TREE_TYPE (intype))
5158 && (binfo = get_binfo (TREE_TYPE (intype), TREE_TYPE (type), 0))
5159 && ! TREE_VIA_VIRTUAL (binfo))
5162 else if (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5164 if (same_type_ignoring_top_level_qualifiers_p
5165 (TREE_TYPE (TREE_TYPE (type)),
5166 TREE_TYPE (TREE_TYPE (intype)))
5167 && (binfo = get_binfo (TYPE_OFFSET_BASETYPE (TREE_TYPE (type)),
5168 TYPE_OFFSET_BASETYPE (TREE_TYPE (intype)), 0))
5169 && ! TREE_VIA_VIRTUAL (binfo))
5172 else if (TREE_CODE (intype) != BOOLEAN_TYPE
5173 && TREE_CODE (type) != ARRAY_TYPE
5174 && TREE_CODE (type) != FUNCTION_TYPE
5175 && can_convert (intype, strip_all_pointer_quals (type)))
5178 /* [expr.static.cast]
5180 The static_cast operator shall not be used to cast away
5182 if (ok && casts_away_constness (intype, type))
5184 cp_error ("static_cast from type `%T' to type `%T' casts away constness",
5186 return error_mark_node;
5190 return build_c_cast (type, expr);
5192 cp_error ("invalid static_cast from type `%T' to type `%T'", intype, type);
5193 return error_mark_node;
5197 build_reinterpret_cast (type, expr)
5202 if (type == error_mark_node || expr == error_mark_node)
5203 return error_mark_node;
5205 if (TREE_CODE (expr) == OFFSET_REF)
5206 expr = resolve_offset_ref (expr);
5208 if (processing_template_decl)
5210 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5214 if (TREE_CODE (type) != REFERENCE_TYPE)
5216 expr = decay_conversion (expr);
5218 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5219 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5220 if (TREE_CODE (expr) == NOP_EXPR
5221 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5222 expr = TREE_OPERAND (expr, 0);
5225 intype = TREE_TYPE (expr);
5227 if (TREE_CODE (type) == REFERENCE_TYPE)
5229 if (! real_lvalue_p (expr))
5231 cp_error ("invalid reinterpret_cast of an rvalue expression of type `%T' to type `%T'", intype, type);
5232 return error_mark_node;
5234 expr = build_unary_op (ADDR_EXPR, expr, 0);
5235 if (expr != error_mark_node)
5236 expr = build_reinterpret_cast
5237 (build_pointer_type (TREE_TYPE (type)), expr);
5238 if (expr != error_mark_node)
5239 expr = build_indirect_ref (expr, 0);
5242 else if (same_type_ignoring_top_level_qualifiers_p (intype, type))
5243 return build_static_cast (type, expr);
5245 if (TYPE_PTR_P (type) && (TREE_CODE (intype) == INTEGER_TYPE
5246 || TREE_CODE (intype) == ENUMERAL_TYPE))
5248 else if (TREE_CODE (type) == INTEGER_TYPE && TYPE_PTR_P (intype))
5250 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5251 cp_pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
5254 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5255 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5257 expr = decl_constant_value (expr);
5258 return fold (build1 (NOP_EXPR, type, expr));
5260 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5261 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5263 if (! comp_ptr_ttypes_reinterpret (TREE_TYPE (type), TREE_TYPE (intype)))
5264 cp_pedwarn ("reinterpret_cast from `%T' to `%T' casts away const (or volatile)",
5267 expr = decl_constant_value (expr);
5268 return fold (build1 (NOP_EXPR, type, expr));
5270 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
5271 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
5273 pedwarn ("ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5274 expr = decl_constant_value (expr);
5275 return fold (build1 (NOP_EXPR, type, expr));
5279 cp_error ("invalid reinterpret_cast from type `%T' to type `%T'",
5281 return error_mark_node;
5284 return cp_convert (type, expr);
5288 build_const_cast (type, expr)
5293 if (type == error_mark_node || expr == error_mark_node)
5294 return error_mark_node;
5296 if (TREE_CODE (expr) == OFFSET_REF)
5297 expr = resolve_offset_ref (expr);
5299 if (processing_template_decl)
5301 tree t = build_min (CONST_CAST_EXPR, type, expr);
5305 if (!POINTER_TYPE_P (type))
5306 cp_error ("invalid use of const_cast with type `%T', which is not a pointer, reference, nor a pointer-to-data-member type", type);
5307 else if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
5309 cp_error ("invalid use of const_cast with type `%T', which is a pointer or reference to a function type", type);
5310 return error_mark_node;
5313 if (TREE_CODE (type) != REFERENCE_TYPE)
5315 expr = decay_conversion (expr);
5317 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5318 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5319 if (TREE_CODE (expr) == NOP_EXPR
5320 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5321 expr = TREE_OPERAND (expr, 0);
5324 intype = TREE_TYPE (expr);
5326 if (same_type_ignoring_top_level_qualifiers_p (intype, type))
5327 return build_static_cast (type, expr);
5328 else if (TREE_CODE (type) == REFERENCE_TYPE)
5330 if (! real_lvalue_p (expr))
5332 cp_error ("invalid const_cast of an rvalue of type `%T' to type `%T'", intype, type);
5333 return error_mark_node;
5336 if (comp_ptr_ttypes_const (TREE_TYPE (type), intype))
5338 expr = build_unary_op (ADDR_EXPR, expr, 0);
5339 expr = build1 (NOP_EXPR, type, expr);
5340 return convert_from_reference (expr);
5343 else if (TREE_CODE (type) == POINTER_TYPE
5344 && TREE_CODE (intype) == POINTER_TYPE
5345 && comp_ptr_ttypes_const (TREE_TYPE (type), TREE_TYPE (intype)))
5346 return cp_convert (type, expr);
5348 cp_error ("invalid const_cast from type `%T' to type `%T'", intype, type);
5349 return error_mark_node;
5352 /* Build an expression representing a cast to type TYPE of expression EXPR.
5354 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
5355 when doing the cast. */
5358 build_c_cast (type, expr)
5361 register tree value = expr;
5364 if (type == error_mark_node || expr == error_mark_node)
5365 return error_mark_node;
5367 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5368 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5369 if (TREE_CODE (type) != REFERENCE_TYPE
5370 && TREE_CODE (value) == NOP_EXPR
5371 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
5372 value = TREE_OPERAND (value, 0);
5374 if (TREE_CODE (value) == OFFSET_REF)
5375 value = resolve_offset_ref (value);
5377 if (TREE_CODE (type) == ARRAY_TYPE)
5379 /* Allow casting from T1* to T2[] because Cfront allows it.
5380 NIHCL uses it. It is not valid ISO C++ however. */
5381 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
5384 pedwarn ("ISO C++ forbids casting to an array type");
5385 type = build_pointer_type (TREE_TYPE (type));
5389 error ("ISO C++ forbids casting to an array type");
5390 return error_mark_node;
5394 if (TREE_CODE (type) == FUNCTION_TYPE
5395 || TREE_CODE (type) == METHOD_TYPE)
5397 cp_error ("invalid cast to function type `%T'", type);
5398 return error_mark_node;
5401 if (processing_template_decl)
5403 tree t = build_min (CAST_EXPR, type,
5404 tree_cons (NULL_TREE, value, NULL_TREE));
5408 if (TREE_CODE (type) == VOID_TYPE)
5410 /* Conversion to void does not cause any of the normal function to
5411 * pointer, array to pointer and lvalue to rvalue decays. */
5413 value = convert_to_void (value, /*implicit=*/NULL);
5416 /* Convert functions and arrays to pointers and
5417 convert references to their expanded types,
5418 but don't convert any other types. If, however, we are
5419 casting to a class type, there's no reason to do this: the
5420 cast will only succeed if there is a converting constructor,
5421 and the default conversions will be done at that point. In
5422 fact, doing the default conversion here is actually harmful
5426 struct S { S(const A&); };
5428 since we don't want the array-to-pointer conversion done. */
5429 if (!IS_AGGR_TYPE (type))
5431 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
5432 || (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE
5433 /* Don't do the default conversion on a ->* expression. */
5434 && ! (TREE_CODE (type) == POINTER_TYPE
5435 && bound_pmf_p (value)))
5436 || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5437 || TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE)
5438 value = default_conversion (value);
5440 else if (TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE)
5441 /* However, even for class types, we still need to strip away
5442 the reference type, since the call to convert_force below
5443 does not expect the input expression to be of reference
5445 value = convert_from_reference (value);
5447 otype = TREE_TYPE (value);
5449 /* Optionally warn about potentially worrisome casts. */
5452 && TREE_CODE (type) == POINTER_TYPE
5453 && TREE_CODE (otype) == POINTER_TYPE
5454 && !at_least_as_qualified_p (TREE_TYPE (type),
5456 cp_warning ("cast from `%T' to `%T' discards qualifiers from pointer target type",
5459 if (TREE_CODE (type) == INTEGER_TYPE
5460 && TREE_CODE (otype) == POINTER_TYPE
5461 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
5462 warning ("cast from pointer to integer of different size");
5464 if (TREE_CODE (type) == POINTER_TYPE
5465 && TREE_CODE (otype) == INTEGER_TYPE
5466 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
5467 /* Don't warn about converting any constant. */
5468 && !TREE_CONSTANT (value))
5469 warning ("cast to pointer from integer of different size");
5471 if (TREE_CODE (type) == REFERENCE_TYPE)
5472 value = (convert_from_reference
5473 (convert_to_reference (type, value, CONV_C_CAST,
5474 LOOKUP_COMPLAIN, NULL_TREE)));
5479 value = decl_constant_value (value);
5482 value = convert_force (type, value, CONV_C_CAST);
5484 /* Ignore any integer overflow caused by the cast. */
5485 if (TREE_CODE (value) == INTEGER_CST)
5487 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
5488 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
5492 /* Warn about possible alignment problems. Do this here when we will have
5493 instantiated any necessary template types. */
5494 if (STRICT_ALIGNMENT && warn_cast_align
5495 && TREE_CODE (type) == POINTER_TYPE
5496 && TREE_CODE (otype) == POINTER_TYPE
5497 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
5498 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
5499 && COMPLETE_TYPE_P (TREE_TYPE (otype))
5500 && COMPLETE_TYPE_P (TREE_TYPE (type))
5501 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
5502 cp_warning ("cast from `%T' to `%T' increases required alignment of target type",
5505 /* Always produce some operator for an explicit cast,
5506 so we can tell (for -pedantic) that the cast is no lvalue. */
5507 if (TREE_CODE (type) != REFERENCE_TYPE && value == expr
5508 && real_lvalue_p (value))
5509 value = non_lvalue (value);
5514 /* Build an assignment expression of lvalue LHS from value RHS.
5515 MODIFYCODE is the code for a binary operator that we use
5516 to combine the old value of LHS with RHS to get the new value.
5517 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5519 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5522 build_modify_expr (lhs, modifycode, rhs)
5524 enum tree_code modifycode;
5527 register tree result;
5529 tree lhstype = TREE_TYPE (lhs);
5530 tree olhstype = lhstype;
5533 /* Avoid duplicate error messages from operands that had errors. */
5534 if (lhs == error_mark_node || rhs == error_mark_node)
5535 return error_mark_node;
5537 /* Types that aren't fully specified cannot be used in assignments. */
5538 lhs = require_complete_type (lhs);
5542 /* Handle control structure constructs used as "lvalues". */
5544 switch (TREE_CODE (lhs))
5546 /* Handle --foo = 5; as these are valid constructs in C++ */
5547 case PREDECREMENT_EXPR:
5548 case PREINCREMENT_EXPR:
5549 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5550 lhs = build (TREE_CODE (lhs), TREE_TYPE (lhs),
5551 stabilize_reference (TREE_OPERAND (lhs, 0)),
5552 TREE_OPERAND (lhs, 1));
5553 return build (COMPOUND_EXPR, lhstype,
5555 build_modify_expr (TREE_OPERAND (lhs, 0),
5558 /* Handle (a, b) used as an "lvalue". */
5560 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1),
5562 if (newrhs == error_mark_node)
5563 return error_mark_node;
5564 return build (COMPOUND_EXPR, lhstype,
5565 TREE_OPERAND (lhs, 0), newrhs);
5568 newrhs = build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs);
5569 if (newrhs == error_mark_node)
5570 return error_mark_node;
5571 return build (COMPOUND_EXPR, lhstype, lhs, newrhs);
5573 /* Handle (a ? b : c) used as an "lvalue". */
5575 rhs = save_expr (rhs);
5577 /* Produce (a ? (b = rhs) : (c = rhs))
5578 except that the RHS goes through a save-expr
5579 so the code to compute it is only emitted once. */
5582 /* Check this here to avoid odd errors when trying to convert
5583 a throw to the type of the COND_EXPR. */
5584 if (!lvalue_or_else (lhs, "assignment"))
5585 return error_mark_node;
5587 cond = build_conditional_expr
5588 (TREE_OPERAND (lhs, 0),
5589 build_modify_expr (cp_convert (TREE_TYPE (lhs),
5590 TREE_OPERAND (lhs, 1)),
5592 build_modify_expr (cp_convert (TREE_TYPE (lhs),
5593 TREE_OPERAND (lhs, 2)),
5596 if (cond == error_mark_node)
5598 /* Make sure the code to compute the rhs comes out
5599 before the split. */
5600 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
5601 /* Case to void to suppress warning
5602 from warn_if_unused_value. */
5603 cp_convert (void_type_node, rhs), cond);
5610 if (TREE_CODE (lhs) == OFFSET_REF)
5612 if (TREE_OPERAND (lhs, 0) == NULL_TREE)
5614 /* Static class member? */
5615 tree member = TREE_OPERAND (lhs, 1);
5616 if (TREE_CODE (member) == VAR_DECL)
5620 compiler_error ("invalid static class member");
5621 return error_mark_node;
5625 lhs = resolve_offset_ref (lhs);
5627 olhstype = lhstype = TREE_TYPE (lhs);
5630 if (lhs == error_mark_node)
5633 if (TREE_CODE (lhstype) == REFERENCE_TYPE
5634 && modifycode != INIT_EXPR)
5636 lhs = convert_from_reference (lhs);
5637 olhstype = lhstype = TREE_TYPE (lhs);
5640 /* If a binary op has been requested, combine the old LHS value with the RHS
5641 producing the value we should actually store into the LHS. */
5643 if (modifycode == INIT_EXPR)
5645 if (! IS_AGGR_TYPE (lhstype))
5646 /* Do the default thing */;
5649 result = build_method_call (lhs, complete_ctor_identifier,
5650 build_tree_list (NULL_TREE, rhs),
5651 TYPE_BINFO (lhstype), LOOKUP_NORMAL);
5652 if (result == NULL_TREE)
5653 return error_mark_node;
5657 else if (modifycode == NOP_EXPR)
5659 /* `operator=' is not an inheritable operator. */
5660 if (! IS_AGGR_TYPE (lhstype))
5661 /* Do the default thing */;
5664 result = build_opfncall (MODIFY_EXPR, LOOKUP_NORMAL,
5665 lhs, rhs, make_node (NOP_EXPR));
5666 if (result == NULL_TREE)
5667 return error_mark_node;
5672 else if (PROMOTES_TO_AGGR_TYPE (lhstype, REFERENCE_TYPE))
5674 my_friendly_abort (978652);
5678 lhs = stabilize_reference (lhs);
5679 newrhs = cp_build_binary_op (modifycode, lhs, rhs);
5680 if (newrhs == error_mark_node)
5682 cp_error (" in evaluation of `%Q(%#T, %#T)'", modifycode,
5683 TREE_TYPE (lhs), TREE_TYPE (rhs));
5684 return error_mark_node;
5688 /* Handle a cast used as an "lvalue".
5689 We have already performed any binary operator using the value as cast.
5690 Now convert the result to the cast type of the lhs,
5691 and then true type of the lhs and store it there;
5692 then convert result back to the cast type to be the value
5693 of the assignment. */
5695 switch (TREE_CODE (lhs))
5700 case FIX_TRUNC_EXPR:
5701 case FIX_FLOOR_EXPR:
5702 case FIX_ROUND_EXPR:
5704 if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
5705 || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE
5706 || TREE_CODE (TREE_TYPE (newrhs)) == METHOD_TYPE
5707 || TREE_CODE (TREE_TYPE (newrhs)) == OFFSET_TYPE)
5708 newrhs = default_conversion (newrhs);
5710 tree inner_lhs = TREE_OPERAND (lhs, 0);
5713 /* ISO C++ 5.4/1: The result is an lvalue if T is a reference
5714 type, otherwise the result is an rvalue. */
5715 if (! lvalue_p (lhs))
5716 pedwarn ("ISO C++ forbids cast to non-reference type used as lvalue");
5718 result = build_modify_expr (inner_lhs, NOP_EXPR,
5719 cp_convert (TREE_TYPE (inner_lhs),
5720 cp_convert (lhstype, newrhs)));
5721 if (result == error_mark_node)
5723 return cp_convert (TREE_TYPE (lhs), result);
5730 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
5731 Reject anything strange now. */
5733 if (!lvalue_or_else (lhs, "assignment"))
5734 return error_mark_node;
5736 GNU_xref_assign (lhs);
5738 /* Warn about storing in something that is `const'. */
5739 /* For C++, don't warn if this is initialization. */
5740 if (modifycode != INIT_EXPR
5741 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
5742 /* Functions are not modifiable, even though they are
5744 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
5745 || (IS_AGGR_TYPE_CODE (TREE_CODE (lhstype))
5746 && C_TYPE_FIELDS_READONLY (lhstype))
5747 || (TREE_CODE (lhstype) == REFERENCE_TYPE
5748 && CP_TYPE_CONST_P (TREE_TYPE (lhstype)))))
5749 readonly_error (lhs, "assignment", 0);
5751 /* If storing into a structure or union member,
5752 it has probably been given type `int'.
5753 Compute the type that would go with
5754 the actual amount of storage the member occupies. */
5756 if (TREE_CODE (lhs) == COMPONENT_REF
5757 && (TREE_CODE (lhstype) == INTEGER_TYPE
5758 || TREE_CODE (lhstype) == REAL_TYPE
5759 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
5761 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
5763 /* If storing in a field that is in actuality a short or narrower
5764 than one, we must store in the field in its actual type. */
5766 if (lhstype != TREE_TYPE (lhs))
5768 lhs = copy_node (lhs);
5769 TREE_TYPE (lhs) = lhstype;
5773 if (modifycode != INIT_EXPR)
5775 /* Make modifycode now either a NOP_EXPR or an INIT_EXPR. */
5776 modifycode = NOP_EXPR;
5777 /* Reference-bashing */
5778 if (TREE_CODE (lhstype) == REFERENCE_TYPE)
5780 tree tmp = convert_from_reference (lhs);
5781 lhstype = TREE_TYPE (tmp);
5782 if (!COMPLETE_TYPE_P (lhstype))
5784 incomplete_type_error (lhs, lhstype);
5785 return error_mark_node;
5790 if (TREE_CODE (TREE_TYPE (newrhs)) == REFERENCE_TYPE)
5792 tree tmp = convert_from_reference (newrhs);
5793 if (!COMPLETE_TYPE_P (TREE_TYPE (tmp)))
5795 incomplete_type_error (newrhs, TREE_TYPE (tmp));
5796 return error_mark_node;
5802 if (TREE_SIDE_EFFECTS (lhs))
5803 lhs = stabilize_reference (lhs);
5804 if (TREE_SIDE_EFFECTS (newrhs))
5805 newrhs = stabilize_reference (newrhs);
5807 /* Convert new value to destination type. */
5809 if (TREE_CODE (lhstype) == ARRAY_TYPE)
5813 if (!same_or_base_type_p (lhstype, TREE_TYPE (rhs)))
5815 cp_error ("incompatible types in assignment of `%T' to `%T'",
5816 TREE_TYPE (rhs), lhstype);
5817 return error_mark_node;
5820 /* Allow array assignment in compiler-generated code. */
5821 if (pedantic && ! DECL_ARTIFICIAL (current_function_decl))
5822 pedwarn ("ISO C++ forbids assignment of arrays");
5824 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
5825 ? 1 + (modifycode != INIT_EXPR): 0;
5826 return (build_vec_init
5827 (lhs, lhs, array_type_nelts (lhstype), newrhs,
5831 if (modifycode == INIT_EXPR)
5833 newrhs = convert_for_initialization (lhs, lhstype, newrhs, LOOKUP_NORMAL,
5834 "assignment", NULL_TREE, 0);
5835 if (current_function_decl &&
5836 lhs == DECL_RESULT (current_function_decl))
5838 if (DECL_INITIAL (lhs))
5839 warning ("return value from function receives multiple initializations");
5840 DECL_INITIAL (lhs) = newrhs;
5845 /* Avoid warnings on enum bit fields. */
5846 if (TREE_CODE (olhstype) == ENUMERAL_TYPE
5847 && TREE_CODE (lhstype) == INTEGER_TYPE)
5849 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
5851 newrhs = convert_force (lhstype, newrhs, 0);
5854 newrhs = convert_for_assignment (lhstype, newrhs, "assignment",
5856 if (TREE_CODE (newrhs) == CALL_EXPR
5857 && TYPE_NEEDS_CONSTRUCTING (lhstype))
5858 newrhs = build_cplus_new (lhstype, newrhs);
5860 /* Can't initialize directly from a TARGET_EXPR, since that would
5861 cause the lhs to be constructed twice, and possibly result in
5862 accidental self-initialization. So we force the TARGET_EXPR to be
5863 expanded without a target. */
5864 if (TREE_CODE (newrhs) == TARGET_EXPR)
5865 newrhs = build (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
5866 TREE_OPERAND (newrhs, 0));
5869 if (newrhs == error_mark_node)
5870 return error_mark_node;
5872 if (TREE_CODE (newrhs) == COND_EXPR)
5875 tree cond = TREE_OPERAND (newrhs, 0);
5877 if (TREE_SIDE_EFFECTS (lhs))
5878 cond = build_compound_expr (tree_cons
5880 build_tree_list (NULL_TREE, cond)));
5882 /* Cannot have two identical lhs on this one tree (result) as preexpand
5883 calls will rip them out and fill in RTL for them, but when the
5884 rtl is generated, the calls will only be in the first side of the
5885 condition, not on both, or before the conditional jump! (mrs) */
5886 lhs1 = break_out_calls (lhs);
5889 /* If there's no change, the COND_EXPR behaves like any other rhs. */
5890 result = build (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
5891 lhstype, lhs, newrhs);
5894 tree result_type = TREE_TYPE (newrhs);
5895 /* We have to convert each arm to the proper type because the
5896 types may have been munged by constant folding. */
5898 = build (COND_EXPR, result_type, cond,
5899 build_modify_expr (lhs, modifycode,
5900 cp_convert (result_type,
5901 TREE_OPERAND (newrhs, 1))),
5902 build_modify_expr (lhs1, modifycode,
5903 cp_convert (result_type,
5904 TREE_OPERAND (newrhs, 2))));
5908 result = build (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
5909 lhstype, lhs, newrhs);
5911 TREE_SIDE_EFFECTS (result) = 1;
5913 /* If we got the LHS in a different type for storing in,
5914 convert the result back to the nominal type of LHS
5915 so that the value we return always has the same type
5916 as the LHS argument. */
5918 if (olhstype == TREE_TYPE (result))
5920 /* Avoid warnings converting integral types back into enums
5921 for enum bit fields. */
5922 if (TREE_CODE (TREE_TYPE (result)) == INTEGER_TYPE
5923 && TREE_CODE (olhstype) == ENUMERAL_TYPE)
5925 result = build (COMPOUND_EXPR, olhstype, result, olhs);
5926 TREE_NO_UNUSED_WARNING (result) = 1;
5929 return convert_for_assignment (olhstype, result, "assignment",
5934 build_x_modify_expr (lhs, modifycode, rhs)
5936 enum tree_code modifycode;
5939 if (processing_template_decl)
5940 return build_min_nt (MODOP_EXPR, lhs,
5941 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
5943 if (modifycode != NOP_EXPR)
5945 tree rval = build_opfncall (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
5946 make_node (modifycode));
5950 return build_modify_expr (lhs, modifycode, rhs);
5954 /* Get difference in deltas for different pointer to member function
5955 types. Return integer_zero_node, if FROM cannot be converted to a
5956 TO type. If FORCE is true, then allow reverse conversions as well.
5958 Note that the naming of FROM and TO is kind of backwards; the return
5959 value is what we add to a TO in order to get a FROM. They are named
5960 this way because we call this function to find out how to convert from
5961 a pointer to member of FROM to a pointer to member of TO. */
5964 get_delta_difference (from, to, force)
5968 tree delta = integer_zero_node;
5974 /* Should get_base_distance here, so we can check if any thing along
5975 the path is virtual, and we need to make sure we stay inside the
5976 real binfos when going through virtual bases. Maybe we should
5977 replace virtual bases with BINFO_FOR_VBASE ... (mrs) */
5978 binfo = get_binfo (from, to, 1);
5979 if (binfo == error_mark_node)
5981 error (" in pointer to member function conversion");
5988 error_not_base_type (from, to);
5989 error (" in pointer to member conversion");
5992 binfo = get_binfo (to, from, 1);
5993 if (binfo == 0 || binfo == error_mark_node)
5995 if (binfo_from_vbase (binfo))
5997 binfo = binfo_for_vbase (BINFO_TYPE (binfo), from);
5998 cp_warning ("pointer to member cast to virtual base `%T' will only work if you are very careful", BINFO_TYPE (binfo));
6000 delta = BINFO_OFFSET (binfo);
6001 delta = cp_convert (ptrdiff_type_node, delta);
6003 return cp_build_binary_op (MINUS_EXPR,
6008 if (binfo_from_vbase (binfo))
6012 cp_warning ("pointer to member cast from virtual base `%T' will only wokr if you are very careful", BINFO_TYPE (binfo));
6015 cp_error ("pointer to member conversion from virtual base `%T'",
6016 BINFO_TYPE (binfo));
6019 return BINFO_OFFSET (binfo);
6022 /* Return a constructor for the pointer-to-member-function TYPE using
6023 the other components as specified. */
6026 build_ptrmemfunc1 (type, delta, idx, pfn, delta2)
6027 tree type, delta, idx, pfn, delta2;
6032 tree pfn_or_delta2_field;
6036 int allconstant, allsimple;
6038 /* Pull the FIELD_DECLs out of the type. */
6041 pfn_field = TYPE_FIELDS (type);
6042 delta_field = TREE_CHAIN (pfn_field);
6043 idx_field = NULL_TREE;
6044 pfn_or_delta2_field = NULL_TREE;
6045 delta2_field = NULL_TREE;
6046 subtype = NULL_TREE;
6050 delta_field = TYPE_FIELDS (type);
6051 idx_field = TREE_CHAIN (delta_field);
6052 pfn_or_delta2_field = TREE_CHAIN (idx_field);
6053 subtype = TREE_TYPE (pfn_or_delta2_field);
6054 pfn_field = TYPE_FIELDS (subtype);
6055 delta2_field = TREE_CHAIN (pfn_field);
6058 /* Make sure DELTA has the type we want. */
6059 delta = convert_and_check (delta_type_node, delta);
6061 /* Keep track of whether the initializer is a) constant, and b) can
6062 be done statically. */
6063 allconstant = TREE_CONSTANT (delta);
6064 allsimple = (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6069 /* A non-virtual function. */
6071 u = build_tree_list (pfn_field, pfn);
6073 allconstant &= TREE_CONSTANT (pfn);
6074 allsimple &= (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6079 /* A virtual function. */
6082 allconstant &= TREE_CONSTANT (pfn);
6083 allsimple &= (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6088 idx = convert_and_check (delta_type_node, idx);
6089 u = build_tree_list (delta2_field, delta2);
6091 allconstant &= TREE_CONSTANT (idx) && TREE_CONSTANT (delta2);
6092 allsimple &= ((initializer_constant_valid_p (idx, TREE_TYPE (idx))
6094 && (initializer_constant_valid_p (delta2,
6100 /* Finish creating the initializer. */
6102 u = tree_cons (pfn_field, pfn,
6103 build_tree_list (delta_field, delta));
6106 u = build (CONSTRUCTOR, subtype, NULL_TREE, u);
6107 u = tree_cons (delta_field, delta,
6108 tree_cons (idx_field,
6110 build_tree_list (pfn_or_delta2_field,
6113 u = build (CONSTRUCTOR, type, NULL_TREE, u);
6114 TREE_CONSTANT (u) = allconstant;
6115 TREE_STATIC (u) = allconstant && allsimple;
6119 /* Build a constructor for a pointer to member function. It can be
6120 used to initialize global variables, local variable, or used
6121 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6124 If FORCE is non-zero, then force this conversion, even if
6125 we would rather not do it. Usually set when using an explicit
6128 Return error_mark_node, if something goes wrong. */
6131 build_ptrmemfunc (type, pfn, force)
6136 tree pfn_type = TREE_TYPE (pfn);
6137 tree to_type = build_ptrmemfunc_type (type);
6139 /* Handle multiple conversions of pointer to member functions. */
6140 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (pfn)))
6142 tree idx = integer_zero_node;
6143 tree delta = integer_zero_node;
6144 tree delta2 = integer_zero_node;
6145 tree npfn = NULL_TREE;
6146 tree ndelta, ndelta2;
6150 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn))
6151 cp_error ("invalid conversion to type `%T' from type `%T'",
6154 /* We don't have to do any conversion to convert a
6155 pointer-to-member to its own type. But, we don't want to
6156 just return a PTRMEM_CST if there's an explicit cast; that
6157 cast should make the expression an invalid template argument. */
6158 if (TREE_CODE (pfn) != PTRMEM_CST && same_type_p (to_type, pfn_type))
6163 /* Under the new ABI, the conversion is easy. Just adjust
6165 npfn = build_component_ref (pfn, pfn_identifier, NULL_TREE, 0);
6166 delta = build_component_ref (pfn, delta_identifier, NULL_TREE, 0);
6167 delta = cp_convert (ptrdiff_type_node, delta);
6168 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6169 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6171 delta = cp_build_binary_op (PLUS_EXPR, delta, n);
6172 return build_ptrmemfunc1 (to_type, delta, NULL_TREE, npfn,
6176 if (TREE_CODE (pfn) == PTRMEM_CST)
6178 /* We could just build the resulting CONSTRUCTOR now, but we
6179 don't, relying on the general machinery below, together
6180 with constant-folding, to do the right thing. */
6181 expand_ptrmemfunc_cst (pfn, &ndelta, &idx, &npfn, &ndelta2);
6183 /* This constant points to a non-virtual function.
6184 NDELTA2 will be NULL, but it's value doesn't really
6185 matter since we won't use it anyhow. */
6186 ndelta2 = integer_zero_node;
6190 ndelta = cp_convert (ptrdiff_type_node,
6191 build_component_ref (pfn,
6194 ndelta2 = cp_convert (ptrdiff_type_node,
6195 DELTA2_FROM_PTRMEMFUNC (pfn));
6196 idx = build_component_ref (pfn, index_identifier, NULL_TREE, 0);
6199 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6200 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6202 delta = cp_build_binary_op (PLUS_EXPR, ndelta, n);
6203 delta2 = cp_build_binary_op (PLUS_EXPR, ndelta2, n);
6204 e1 = fold (build (GT_EXPR, boolean_type_node, idx, integer_zero_node));
6206 /* If it's a virtual function, this is what we want. */
6207 e2 = build_ptrmemfunc1 (to_type, delta, idx, NULL_TREE, delta2);
6209 pfn = PFN_FROM_PTRMEMFUNC (pfn);
6210 npfn = build1 (NOP_EXPR, type, pfn);
6211 TREE_CONSTANT (npfn) = TREE_CONSTANT (pfn);
6213 /* But if it's a non-virtual function, or NULL, we use this
6215 e3 = build_ptrmemfunc1 (to_type, delta, idx, npfn, NULL_TREE);
6216 return build_conditional_expr (e1, e2, e3);
6219 /* Handle null pointer to member function conversions. */
6220 if (integer_zerop (pfn))
6222 pfn = build_c_cast (type, integer_zero_node);
6223 return build_ptrmemfunc1 (to_type,
6224 integer_zero_node, integer_zero_node,
6228 if (type_unknown_p (pfn))
6229 return instantiate_type (type, pfn, 1);
6231 fn = TREE_OPERAND (pfn, 0);
6232 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 0);
6233 return make_ptrmem_cst (to_type, fn);
6236 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6239 ??? There is no consistency as to the types returned for the above
6240 values. Some code acts as if its a sizetype and some as if its
6241 integer_type_node. */
6244 expand_ptrmemfunc_cst (cst, delta, idx, pfn, delta2)
6251 tree type = TREE_TYPE (cst);
6252 tree fn = PTRMEM_CST_MEMBER (cst);
6253 tree ptr_class, fn_class;
6255 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 0);
6257 /* The class that the function belongs to. */
6258 fn_class = DECL_CONTEXT (fn);
6260 /* The class that we're creating a pointer to member of. */
6261 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
6263 /* First, calculate the adjustment to the function's class. */
6264 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0);
6266 if (!DECL_VIRTUAL_P (fn))
6269 *idx = build_int_2 (-1, -1);
6272 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
6273 *delta2 = NULL_TREE;
6277 /* If we're dealing with a virtual function, we have to adjust 'this'
6278 again, to point to the base which provides the vtable entry for
6279 fn; the call will do the opposite adjustment. */
6280 tree orig_class = DECL_VIRTUAL_CONTEXT (fn);
6281 tree binfo = binfo_or_else (orig_class, fn_class);
6282 *delta = fold (build (PLUS_EXPR, TREE_TYPE (*delta),
6283 *delta, BINFO_OFFSET (binfo)));
6287 /* Map everything down one to make room for the null PMF. */
6288 *idx = fold (build (PLUS_EXPR, integer_type_node,
6289 DECL_VINDEX (fn), integer_one_node));
6294 /* Under the new ABI, we set PFN to the vtable offset, plus
6295 one, at which the function can be found. */
6297 *pfn = fold (build (MULT_EXPR, integer_type_node,
6299 TYPE_SIZE_UNIT (vtable_entry_type)));
6300 *pfn = fold (build (PLUS_EXPR, integer_type_node, *pfn,
6302 *pfn = fold (build1 (NOP_EXPR, TYPE_PTRMEMFUNC_FN_TYPE (type),
6306 /* Offset from an object of PTR_CLASS to the vptr for ORIG_CLASS. */
6307 *delta2 = fold (build (PLUS_EXPR, integer_type_node, *delta,
6308 get_vfield_offset (TYPE_BINFO (orig_class))));
6312 /* Return an expression for DELTA2 from the pointer-to-member function
6316 delta2_from_ptrmemfunc (t)
6319 my_friendly_assert (!flag_new_abi, 20000221);
6321 if (TREE_CODE (t) == PTRMEM_CST)
6328 expand_ptrmemfunc_cst (t, &delta, &idx, &pfn, &delta2);
6333 return (build_component_ref
6334 (build_component_ref (t,
6335 pfn_or_delta2_identifier, NULL_TREE,
6337 delta2_identifier, NULL_TREE, 0));
6340 /* Return an expression for PFN from the pointer-to-member function
6344 pfn_from_ptrmemfunc (t)
6347 if (TREE_CODE (t) == PTRMEM_CST)
6354 expand_ptrmemfunc_cst (t, &delta, &idx, &pfn, &delta2);
6360 return build_component_ref (t, pfn_identifier, NULL_TREE, 0);
6362 return (build_component_ref
6363 (build_component_ref (t,
6364 pfn_or_delta2_identifier, NULL_TREE,
6366 pfn_identifier, NULL_TREE, 0));
6369 /* Expression EXPR is about to be implicitly converted to TYPE. Warn
6370 if this is a potentially dangerous thing to do. Returns a possibly
6374 dubious_conversion_warnings (type, expr, errtype, fndecl, parmnum)
6377 const char *errtype;
6381 if (TREE_CODE (type) == REFERENCE_TYPE)
6382 type = TREE_TYPE (type);
6384 /* Issue warnings about peculiar, but legal, uses of NULL. */
6385 if (ARITHMETIC_TYPE_P (type) && expr == null_node)
6388 cp_warning ("passing NULL used for non-pointer %s %P of `%D'",
6389 errtype, parmnum, fndecl);
6391 cp_warning ("%s to non-pointer type `%T' from NULL", errtype, type);
6394 /* Warn about assigning a floating-point type to an integer type. */
6395 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
6396 && TREE_CODE (type) == INTEGER_TYPE)
6399 cp_warning ("passing `%T' for %s %P of `%D'",
6400 TREE_TYPE (expr), errtype, parmnum, fndecl);
6402 cp_warning ("%s to `%T' from `%T'", errtype, type, TREE_TYPE (expr));
6404 /* And warn about assigning a negative value to an unsigned
6406 else if (TREE_UNSIGNED (type) && TREE_CODE (type) != BOOLEAN_TYPE)
6408 if (TREE_CODE (expr) == INTEGER_CST
6409 && TREE_NEGATED_INT (expr))
6412 cp_warning ("passing negative value `%E' for %s %P of `%D'",
6413 expr, errtype, parmnum, fndecl);
6415 cp_warning ("%s of negative value `%E' to `%T'",
6416 errtype, expr, type);
6418 overflow_warning (expr);
6419 if (TREE_CONSTANT (expr))
6425 /* Convert value RHS to type TYPE as preparation for an assignment to
6426 an lvalue of type TYPE. ERRTYPE is a string to use in error
6427 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6428 are doing the conversion in order to pass the PARMNUMth argument of
6432 convert_for_assignment (type, rhs, errtype, fndecl, parmnum)
6434 const char *errtype;
6438 register enum tree_code codel = TREE_CODE (type);
6439 register tree rhstype;
6440 register enum tree_code coder;
6442 if (codel == OFFSET_TYPE)
6443 my_friendly_abort (990505);
6445 if (TREE_CODE (rhs) == OFFSET_REF)
6446 rhs = resolve_offset_ref (rhs);
6448 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6449 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6450 rhs = TREE_OPERAND (rhs, 0);
6452 rhstype = TREE_TYPE (rhs);
6453 coder = TREE_CODE (rhstype);
6455 if (rhs == error_mark_node || rhstype == error_mark_node)
6456 return error_mark_node;
6457 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
6458 return error_mark_node;
6460 rhs = dubious_conversion_warnings (type, rhs, errtype, fndecl, parmnum);
6462 /* The RHS of an assignment cannot have void type. */
6463 if (coder == VOID_TYPE)
6465 error ("void value not ignored as it ought to be");
6466 return error_mark_node;
6469 /* Simplify the RHS if possible. */
6470 if (TREE_CODE (rhs) == CONST_DECL)
6471 rhs = DECL_INITIAL (rhs);
6472 else if (coder != ARRAY_TYPE)
6473 rhs = decl_constant_value (rhs);
6477 The expression is implicitly converted (clause _conv_) to the
6478 cv-unqualified type of the left operand. */
6479 if (!can_convert_arg (type, rhstype, rhs))
6481 /* When -Wno-pmf-conversions is use, we just silently allow
6482 conversions from pointers-to-members to plain pointers. If
6483 the conversion doesn't work, cp_convert will complain. */
6485 && TYPE_PTR_P (type)
6486 && TYPE_PTRMEMFUNC_P (rhstype))
6487 rhs = cp_convert (strip_top_quals (type), rhs);
6490 /* If the right-hand side has unknown type, then it is an
6491 overloaded function. Call instantiate_type to get error
6493 if (rhstype == unknown_type_node)
6494 instantiate_type (type, rhs, 1);
6496 cp_error ("cannot convert `%T' to `%T' for argument `%P' to `%D'",
6497 rhstype, type, parmnum, fndecl);
6499 cp_error ("cannot convert `%T' to `%T' in %s", rhstype, type,
6501 return error_mark_node;
6504 return perform_implicit_conversion (strip_top_quals (type), rhs);
6507 /* Convert RHS to be of type TYPE.
6508 If EXP is non-zero, it is the target of the initialization.
6509 ERRTYPE is a string to use in error messages.
6511 Two major differences between the behavior of
6512 `convert_for_assignment' and `convert_for_initialization'
6513 are that references are bashed in the former, while
6514 copied in the latter, and aggregates are assigned in
6515 the former (operator=) while initialized in the
6518 If using constructor make sure no conversion operator exists, if one does
6519 exist, an ambiguity exists.
6521 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6524 convert_for_initialization (exp, type, rhs, flags, errtype, fndecl, parmnum)
6525 tree exp, type, rhs;
6527 const char *errtype;
6531 register enum tree_code codel = TREE_CODE (type);
6532 register tree rhstype;
6533 register enum tree_code coder;
6535 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6536 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6537 if (TREE_CODE (rhs) == NOP_EXPR
6538 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6539 && codel != REFERENCE_TYPE)
6540 rhs = TREE_OPERAND (rhs, 0);
6542 if (rhs == error_mark_node
6543 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6544 return error_mark_node;
6546 if (TREE_CODE (rhs) == OFFSET_REF)
6548 rhs = resolve_offset_ref (rhs);
6549 if (rhs == error_mark_node)
6550 return error_mark_node;
6553 if (TREE_CODE (TREE_TYPE (rhs)) == REFERENCE_TYPE)
6554 rhs = convert_from_reference (rhs);
6556 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6557 && TREE_CODE (type) != ARRAY_TYPE
6558 && (TREE_CODE (type) != REFERENCE_TYPE
6559 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6560 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6561 && (TREE_CODE (type) != REFERENCE_TYPE
6562 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
6563 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6564 rhs = default_conversion (rhs);
6566 rhstype = TREE_TYPE (rhs);
6567 coder = TREE_CODE (rhstype);
6569 if (coder == ERROR_MARK)
6570 return error_mark_node;
6572 /* We accept references to incomplete types, so we can
6573 return here before checking if RHS is of complete type. */
6575 if (codel == REFERENCE_TYPE)
6577 /* This should eventually happen in convert_arguments. */
6578 extern int warningcount, errorcount;
6579 int savew = 0, savee = 0;
6582 savew = warningcount, savee = errorcount;
6583 rhs = initialize_reference (type, rhs);
6586 if (warningcount > savew)
6587 cp_warning_at ("in passing argument %P of `%+D'", parmnum, fndecl);
6588 else if (errorcount > savee)
6589 cp_error_at ("in passing argument %P of `%+D'", parmnum, fndecl);
6595 exp = require_complete_type (exp);
6596 if (exp == error_mark_node)
6597 return error_mark_node;
6599 if (TREE_CODE (rhstype) == REFERENCE_TYPE)
6600 rhstype = TREE_TYPE (rhstype);
6602 type = complete_type (type);
6604 if (IS_AGGR_TYPE (type))
6605 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
6607 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum);
6610 /* Expand an ASM statement with operands, handling output operands
6611 that are not variables or INDIRECT_REFS by transforming such
6612 cases into cases that expand_asm_operands can handle.
6614 Arguments are same as for expand_asm_operands.
6616 We don't do default conversions on all inputs, because it can screw
6617 up operands that are expected to be in memory. */
6620 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6621 tree string, outputs, inputs, clobbers;
6623 const char *filename;
6626 int noutputs = list_length (outputs);
6628 /* o[I] is the place that output number I should be written. */
6629 register tree *o = (tree *) alloca (noutputs * sizeof (tree));
6632 /* Record the contents of OUTPUTS before it is modified. */
6633 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6634 o[i] = TREE_VALUE (tail);
6636 /* Generate the ASM_OPERANDS insn;
6637 store into the TREE_VALUEs of OUTPUTS some trees for
6638 where the values were actually stored. */
6639 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
6641 /* Copy all the intermediate outputs into the specified outputs. */
6642 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6644 if (o[i] != TREE_VALUE (tail))
6646 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
6647 const0_rtx, VOIDmode, EXPAND_NORMAL);
6650 /* Restore the original value so that it's correct the next
6651 time we expand this function. */
6652 TREE_VALUE (tail) = o[i];
6654 /* Detect modification of read-only values.
6655 (Otherwise done by build_modify_expr.) */
6658 tree type = TREE_TYPE (o[i]);
6659 if (CP_TYPE_CONST_P (type)
6660 || (IS_AGGR_TYPE_CODE (TREE_CODE (type))
6661 && C_TYPE_FIELDS_READONLY (type)))
6662 readonly_error (o[i], "modification by `asm'", 1);
6666 /* Those MODIFY_EXPRs could do autoincrements. */
6670 /* If RETVAL is the address of, or a reference to, a local variable or
6671 temporary give an appropraite warning. */
6674 maybe_warn_about_returning_address_of_local (retval)
6677 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
6678 tree whats_returned = retval;
6682 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
6683 whats_returned = TREE_OPERAND (whats_returned, 1);
6684 else if (TREE_CODE (whats_returned) == CONVERT_EXPR
6685 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR
6686 || TREE_CODE (whats_returned) == NOP_EXPR)
6687 whats_returned = TREE_OPERAND (whats_returned, 0);
6692 if (TREE_CODE (whats_returned) != ADDR_EXPR)
6694 whats_returned = TREE_OPERAND (whats_returned, 0);
6696 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6698 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
6699 || TREE_CODE (whats_returned) == TARGET_EXPR)
6701 /* Get the target. */
6702 whats_returned = TREE_OPERAND (whats_returned, 0);
6703 warning ("returning reference to temporary");
6706 if (TREE_CODE (whats_returned) == VAR_DECL
6707 && DECL_NAME (whats_returned)
6708 && TEMP_NAME_P (DECL_NAME (whats_returned)))
6710 warning ("reference to non-lvalue returned");
6715 if (TREE_CODE (whats_returned) == VAR_DECL
6716 && DECL_NAME (whats_returned)
6717 && DECL_FUNCTION_SCOPE_P (whats_returned)
6718 && !(TREE_STATIC (whats_returned)
6719 || TREE_PUBLIC (whats_returned)))
6721 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6722 cp_warning_at ("reference to local variable `%D' returned",
6725 cp_warning_at ("address of local variable `%D' returned",
6731 /* Check that returning RETVAL from the current function is legal.
6732 Return an expression explicitly showing all conversions required to
6733 change RETVAL into the function return type, and to assign it to
6734 the DECL_RESULT for the function. */
6737 check_return_expr (retval)
6741 /* The type actually returned by the function, after any
6744 int fn_returns_value_p;
6746 /* A `volatile' function is one that isn't supposed to return, ever.
6747 (This is a G++ extension, used to get better code for functions
6748 that call the `volatile' function.) */
6749 if (TREE_THIS_VOLATILE (current_function_decl))
6750 warning ("function declared `noreturn' has a `return' statement");
6752 /* Check for various simple errors. */
6756 error ("returning a value from a destructor");
6759 else if (DECL_CONSTRUCTOR_P (current_function_decl))
6761 if (in_function_try_handler)
6762 /* If a return statement appears in a handler of the
6763 function-try-block of a constructor, the program is ill-formed. */
6764 error ("cannot return from a handler of a function-try-block of a constructor");
6766 /* You can't return a value from a constructor. */
6767 error ("returning a value from a constructor");
6771 /* Under the old ABI, constructors actually always return `this',
6772 even though in C++ you can't return a value from a constructor. */
6773 if (!flag_new_abi && DECL_CONSTRUCTOR_P (current_function_decl))
6774 retval = current_class_ptr;
6776 /* When no explicit return-value is given in a function with a named
6777 return value, the named return value is used. */
6778 result = DECL_RESULT (current_function_decl);
6779 valtype = TREE_TYPE (result);
6780 my_friendly_assert (valtype != NULL_TREE, 19990924);
6781 fn_returns_value_p = !VOID_TYPE_P (valtype);
6782 if (!retval && DECL_NAME (result) && fn_returns_value_p)
6785 /* Check for a return statement with no return value in a function
6786 that's supposed to return a value. */
6787 if (!retval && fn_returns_value_p)
6789 pedwarn ("return-statement with no value, in function declared with a non-void return type");
6790 /* Clear this, so finish_function won't say that we reach the
6791 end of a non-void function (which we don't, we gave a
6793 current_function_returns_null = 0;
6795 /* Check for a return statement with a value in a function that
6796 isn't supposed to return a value. */
6797 else if (retval && !fn_returns_value_p)
6799 if (VOID_TYPE_P (TREE_TYPE (retval)))
6800 /* You can return a `void' value from a function of `void'
6801 type. In that case, we have to evaluate the expression for
6802 its side-effects. */
6803 finish_expr_stmt (retval);
6805 pedwarn ("return-statement with a value, in function declared with a void return type");
6807 current_function_returns_null = 1;
6809 /* There's really no value to return, after all. */
6813 /* Remember that this function can sometimes return without a
6815 current_function_returns_null = 1;
6817 /* Remember that this function did return a value. */
6818 current_function_returns_value = 1;
6820 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6821 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
6822 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
6823 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
6825 && null_ptr_cst_p (retval))
6826 cp_warning ("`operator new' must not return NULL unless it is declared `throw()' (or -fcheck-new is in effect)");
6828 /* Effective C++ rule 15. See also start_function. */
6830 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR)
6831 && retval != current_class_ref)
6832 cp_warning ("`operator=' should return a reference to `*this'");
6834 /* We don't need to do any conversions when there's nothing being
6836 if (!retval || retval == error_mark_node)
6839 /* Do any required conversions. */
6840 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
6841 /* No conversions are required. */
6845 /* The type the function is declared to return. */
6846 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
6848 /* First convert the value to the function's return type, then
6849 to the type of return value's location to handle the
6850 case that functype is thiner than the valtype. */
6851 retval = convert_for_initialization
6852 (NULL_TREE, functype, retval, LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING,
6853 "return", NULL_TREE, 0);
6854 retval = convert (valtype, retval);
6856 /* If the conversion failed, treat this just like `return;'. */
6857 if (retval == error_mark_node)
6859 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6860 else if (! current_function_returns_struct
6861 && TREE_CODE (retval) == TARGET_EXPR
6862 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
6863 retval = build (COMPOUND_EXPR, TREE_TYPE (retval), retval,
6864 TREE_OPERAND (retval, 0));
6866 maybe_warn_about_returning_address_of_local (retval);
6869 /* Actually copy the value returned into the appropriate location. */
6870 if (retval && retval != result)
6871 retval = build (INIT_EXPR, TREE_TYPE (result), result, retval);
6876 /* Expand a C `return' statement.
6877 RETVAL is the expression for what to return,
6878 or a null pointer for `return;' with no value.
6880 C++: upon seeing a `return', we must call destructors on all
6881 variables in scope which had constructors called on them.
6882 This means that if in a destructor, the base class destructors
6883 must be called before returning.
6885 The RETURN statement in C++ has initialization semantics. */
6888 c_expand_return (retval)
6892 expand_null_return ();
6895 expand_start_target_temps ();
6896 expand_return (retval);
6897 expand_end_target_temps ();
6901 /* Start a C switch statement, testing expression EXP.
6902 Return EXP if it is valid, an error node otherwise. */
6905 c_expand_start_case (exp)
6911 type = TREE_TYPE (exp);
6912 index = get_unwidened (exp, NULL_TREE);
6913 /* We can't strip a conversion from a signed type to an unsigned,
6914 because if we did, int_fits_type_p would do the wrong thing
6915 when checking case values for being in range,
6916 and it's too hard to do the right thing. */
6917 if (TREE_UNSIGNED (TREE_TYPE (exp))
6918 == TREE_UNSIGNED (TREE_TYPE (index)))
6921 expand_start_case (1, exp, type, "switch statement");
6926 /* Returns non-zero if the pointer-type FROM can be converted to the
6927 pointer-type TO via a qualification conversion. If CONSTP is -1,
6928 then we return non-zero if the pointers are similar, and the
6929 cv-qualification signature of FROM is a proper subset of that of TO.
6931 If CONSTP is positive, then all outer pointers have been
6935 comp_ptr_ttypes_real (to, from, constp)
6939 int to_more_cv_qualified = 0;
6941 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
6943 if (TREE_CODE (to) != TREE_CODE (from))
6946 if (TREE_CODE (from) == OFFSET_TYPE
6947 && same_type_p (TYPE_OFFSET_BASETYPE (from),
6948 TYPE_OFFSET_BASETYPE (to)))
6951 /* Const and volatile mean something different for function types,
6952 so the usual checks are not appropriate. */
6953 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
6955 if (!at_least_as_qualified_p (to, from))
6958 if (!at_least_as_qualified_p (from, to))
6963 ++to_more_cv_qualified;
6967 constp &= TYPE_READONLY (to);
6970 if (TREE_CODE (to) != POINTER_TYPE)
6972 same_type_ignoring_top_level_qualifiers_p (to, from)
6973 && (constp >= 0 || to_more_cv_qualified);
6977 /* When comparing, say, char ** to char const **, this function takes the
6978 'char *' and 'char const *'. Do not pass non-pointer types to this
6982 comp_ptr_ttypes (to, from)
6985 return comp_ptr_ttypes_real (to, from, 1);
6988 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6989 type or inheritance-related types, regardless of cv-quals. */
6992 ptr_reasonably_similar (to, from)
6995 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
6997 if (TREE_CODE (to) != TREE_CODE (from))
7000 if (TREE_CODE (from) == OFFSET_TYPE
7001 && comptypes (TYPE_OFFSET_BASETYPE (to),
7002 TYPE_OFFSET_BASETYPE (from),
7003 COMPARE_BASE | COMPARE_RELAXED))
7006 if (TREE_CODE (to) != POINTER_TYPE)
7008 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7009 COMPARE_BASE | COMPARE_RELAXED);
7013 /* Like comp_ptr_ttypes, for const_cast. */
7016 comp_ptr_ttypes_const (to, from)
7019 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7021 if (TREE_CODE (to) != TREE_CODE (from))
7024 if (TREE_CODE (from) == OFFSET_TYPE
7025 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7026 TYPE_OFFSET_BASETYPE (to)))
7029 if (TREE_CODE (to) != POINTER_TYPE)
7030 return same_type_ignoring_top_level_qualifiers_p (to, from);
7034 /* Like comp_ptr_ttypes, for reinterpret_cast. */
7037 comp_ptr_ttypes_reinterpret (to, from)
7042 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7044 if (TREE_CODE (from) == OFFSET_TYPE)
7045 from = TREE_TYPE (from);
7046 if (TREE_CODE (to) == OFFSET_TYPE)
7047 to = TREE_TYPE (to);
7049 /* Const and volatile mean something different for function types,
7050 so the usual checks are not appropriate. */
7051 if (TREE_CODE (from) != FUNCTION_TYPE && TREE_CODE (from) != METHOD_TYPE
7052 && TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7054 if (!at_least_as_qualified_p (to, from))
7058 && !at_least_as_qualified_p (from, to))
7060 constp &= TYPE_READONLY (to);
7063 if (TREE_CODE (from) != POINTER_TYPE
7064 || TREE_CODE (to) != POINTER_TYPE)
7069 /* Recursively examines the array elements of TYPE, until a non-array
7070 element type is found. */
7073 strip_array_types (type)
7076 while (TREE_CODE (type) == ARRAY_TYPE)
7077 type = TREE_TYPE (type);
7082 /* Returns the type-qualifier set corresponding to TYPE. */
7085 cp_type_quals (type)
7088 return TYPE_QUALS (strip_array_types (type));
7091 /* Returns non-zero if the TYPE contains a mutable member */
7094 cp_has_mutable_p (type)
7097 while (TREE_CODE (type) == ARRAY_TYPE)
7098 type = TREE_TYPE (type);
7100 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
7103 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7104 exemplar types such that casting T1 to T2 is casting away castness
7105 if and only if there is no implicit conversion from T1 to T2. */
7108 casts_away_constness_r (t1, t2)
7115 /* [expr.const.cast]
7117 For multi-level pointer to members and multi-level mixed pointers
7118 and pointers to members (conv.qual), the "member" aspect of a
7119 pointer to member level is ignored when determining if a const
7120 cv-qualifier has been cast away. */
7121 if (TYPE_PTRMEM_P (*t1))
7122 *t1 = build_pointer_type (TREE_TYPE (TREE_TYPE (*t1)));
7123 if (TYPE_PTRMEM_P (*t2))
7124 *t2 = build_pointer_type (TREE_TYPE (TREE_TYPE (*t2)));
7126 /* [expr.const.cast]
7128 For two pointer types:
7130 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7131 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7134 casting from X1 to X2 casts away constness if, for a non-pointer
7135 type T there does not exist an implicit conversion (clause
7138 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7142 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7144 if (TREE_CODE (*t1) != POINTER_TYPE
7145 || TREE_CODE (*t2) != POINTER_TYPE)
7147 *t1 = cp_build_qualified_type (void_type_node,
7148 CP_TYPE_QUALS (*t1));
7149 *t2 = cp_build_qualified_type (void_type_node,
7150 CP_TYPE_QUALS (*t2));
7154 quals1 = CP_TYPE_QUALS (*t1);
7155 quals2 = CP_TYPE_QUALS (*t2);
7156 *t1 = TREE_TYPE (*t1);
7157 *t2 = TREE_TYPE (*t2);
7158 casts_away_constness_r (t1, t2);
7159 *t1 = build_pointer_type (*t1);
7160 *t2 = build_pointer_type (*t2);
7161 *t1 = cp_build_qualified_type (*t1, quals1);
7162 *t2 = cp_build_qualified_type (*t2, quals2);
7165 /* Returns non-zero if casting from TYPE1 to TYPE2 casts away
7169 casts_away_constness (t1, t2)
7173 if (TREE_CODE (t2) == REFERENCE_TYPE)
7175 /* [expr.const.cast]
7177 Casting from an lvalue of type T1 to an lvalue of type T2
7178 using a reference cast casts away constness if a cast from an
7179 rvalue of type "pointer to T1" to the type "pointer to T2"
7180 casts away constness. */
7181 t1 = (TREE_CODE (t1) == REFERENCE_TYPE
7182 ? TREE_TYPE (t1) : t1);
7183 return casts_away_constness (build_pointer_type (t1),
7184 build_pointer_type (TREE_TYPE (t2)));
7187 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
7188 /* [expr.const.cast]
7190 Casting from an rvalue of type "pointer to data member of X
7191 of type T1" to the type "pointer to data member of Y of type
7192 T2" casts away constness if a cast from an rvalue of type
7193 "poitner to T1" to the type "pointer to T2" casts away
7195 return casts_away_constness
7196 (build_pointer_type (TREE_TYPE (TREE_TYPE (t1))),
7197 build_pointer_type (TREE_TYPE (TREE_TYPE (t2))));
7199 /* Casting away constness is only something that makes sense for
7200 pointer or reference types. */
7201 if (TREE_CODE (t1) != POINTER_TYPE
7202 || TREE_CODE (t2) != POINTER_TYPE)
7205 /* Top-level qualifiers don't matter. */
7206 t1 = TYPE_MAIN_VARIANT (t1);
7207 t2 = TYPE_MAIN_VARIANT (t2);
7208 casts_away_constness_r (&t1, &t2);
7209 if (!can_convert (t2, t1))
7215 /* Returns TYPE with its cv qualifiers removed
7216 TYPE is T cv* .. *cv where T is not a pointer type,
7217 returns T * .. *. (If T is an array type, then the cv qualifiers
7218 above are those of the array members.) */
7221 strip_all_pointer_quals (type)
7224 if (TREE_CODE (type) == POINTER_TYPE)
7225 return build_pointer_type (strip_all_pointer_quals (TREE_TYPE (type)));
7227 return TYPE_MAIN_VARIANT (type);