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, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
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. */
31 #include "coretypes.h"
41 #include "diagnostic.h"
48 static tree pfn_from_ptrmemfunc (tree);
49 static tree convert_for_assignment (tree, tree, const char *, tree, int);
50 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
51 static tree rationalize_conditional_expr (enum tree_code, tree);
52 static int comp_ptr_ttypes_real (tree, tree, int);
53 static bool comp_except_types (tree, tree, bool);
54 static bool comp_array_types (tree, tree, bool);
55 static tree pointer_diff (tree, tree, tree);
56 static tree get_delta_difference (tree, tree, bool, bool);
57 static void casts_away_constness_r (tree *, tree *);
58 static bool casts_away_constness (tree, tree);
59 static void maybe_warn_about_returning_address_of_local (tree);
60 static tree lookup_destructor (tree, tree, tree);
61 static int convert_arguments (int, tree *, tree, tree, tree, int);
63 /* Do `exp = require_complete_type (exp);' to make sure exp
64 does not have an incomplete type. (That includes void types.)
65 Returns the error_mark_node if the VALUE does not have
66 complete type when this function returns. */
69 require_complete_type (tree value)
73 if (processing_template_decl || value == error_mark_node)
76 if (TREE_CODE (value) == OVERLOAD)
77 type = unknown_type_node;
79 type = TREE_TYPE (value);
81 if (type == error_mark_node)
82 return error_mark_node;
84 /* First, detect a valid value with a complete type. */
85 if (COMPLETE_TYPE_P (type))
88 if (complete_type_or_else (type, value))
91 return error_mark_node;
94 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
95 a template instantiation, do the instantiation. Returns TYPE,
96 whether or not it could be completed, unless something goes
97 horribly wrong, in which case the error_mark_node is returned. */
100 complete_type (tree type)
102 if (type == NULL_TREE)
103 /* Rather than crash, we return something sure to cause an error
105 return error_mark_node;
107 if (type == error_mark_node || COMPLETE_TYPE_P (type))
109 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
111 tree t = complete_type (TREE_TYPE (type));
112 unsigned int needs_constructing, has_nontrivial_dtor;
113 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
116 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
118 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
119 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
121 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
122 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
125 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
126 instantiate_class_template (TYPE_MAIN_VARIANT (type));
131 /* Like complete_type, but issue an error if the TYPE cannot be completed.
132 VALUE is used for informative diagnostics.
133 Returns NULL_TREE if the type cannot be made complete. */
136 complete_type_or_else (tree type, tree value)
138 type = complete_type (type);
139 if (type == error_mark_node)
140 /* We already issued an error. */
142 else if (!COMPLETE_TYPE_P (type))
144 cxx_incomplete_type_diagnostic (value, type, 0);
151 /* Return truthvalue of whether type of EXP is instantiated. */
154 type_unknown_p (tree exp)
156 return (TREE_CODE (exp) == TREE_LIST
157 || TREE_TYPE (exp) == unknown_type_node);
161 /* Return the common type of two parameter lists.
162 We assume that comptypes has already been done and returned 1;
163 if that isn't so, this may crash.
165 As an optimization, free the space we allocate if the parameter
166 lists are already common. */
169 commonparms (tree p1, tree p2)
171 tree oldargs = p1, newargs, n;
175 len = list_length (p1);
176 newargs = tree_last (p1);
178 if (newargs == void_list_node)
187 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
192 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
194 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
196 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
199 else if (! TREE_PURPOSE (p1))
201 if (TREE_PURPOSE (p2))
203 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
209 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
211 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
213 if (TREE_VALUE (p1) != TREE_VALUE (p2))
216 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
219 TREE_VALUE (n) = TREE_VALUE (p1);
227 /* Given a type, perhaps copied for a typedef,
228 find the "original" version of it. */
230 original_type (tree t)
232 int quals = cp_type_quals (t);
233 while (t != error_mark_node
234 && TYPE_NAME (t) != NULL_TREE)
236 tree x = TYPE_NAME (t);
237 if (TREE_CODE (x) != TYPE_DECL)
239 x = DECL_ORIGINAL_TYPE (x);
244 return cp_build_qualified_type (t, quals);
247 /* T1 and T2 are arithmetic or enumeration types. Return the type
248 that will result from the "usual arithmetic conversions" on T1 and
249 T2 as described in [expr]. */
252 type_after_usual_arithmetic_conversions (tree t1, tree t2)
254 enum tree_code code1 = TREE_CODE (t1);
255 enum tree_code code2 = TREE_CODE (t2);
258 /* FIXME: Attributes. */
259 gcc_assert (ARITHMETIC_TYPE_P (t1)
260 || TREE_CODE (t1) == VECTOR_TYPE
261 || TREE_CODE (t1) == ENUMERAL_TYPE);
262 gcc_assert (ARITHMETIC_TYPE_P (t2)
263 || TREE_CODE (t2) == VECTOR_TYPE
264 || TREE_CODE (t2) == ENUMERAL_TYPE);
266 /* In what follows, we slightly generalize the rules given in [expr] so
267 as to deal with `long long' and `complex'. First, merge the
269 attributes = (*targetm.merge_type_attributes) (t1, t2);
271 /* If one type is complex, form the common type of the non-complex
272 components, then make that complex. Use T1 or T2 if it is the
274 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
276 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
277 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
279 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
281 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
282 return build_type_attribute_variant (t1, attributes);
283 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
284 return build_type_attribute_variant (t2, attributes);
286 return build_type_attribute_variant (build_complex_type (subtype),
290 if (code1 == VECTOR_TYPE)
292 /* When we get here we should have two vectors of the same size.
293 Just prefer the unsigned one if present. */
294 if (TYPE_UNSIGNED (t1))
295 return build_type_attribute_variant (t1, attributes);
297 return build_type_attribute_variant (t2, attributes);
300 /* If only one is real, use it as the result. */
301 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
302 return build_type_attribute_variant (t1, attributes);
303 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
304 return build_type_attribute_variant (t2, attributes);
306 /* Perform the integral promotions. */
307 if (code1 != REAL_TYPE)
309 t1 = type_promotes_to (t1);
310 t2 = type_promotes_to (t2);
313 /* Both real or both integers; use the one with greater precision. */
314 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
315 return build_type_attribute_variant (t1, attributes);
316 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
317 return build_type_attribute_variant (t2, attributes);
319 /* The types are the same; no need to do anything fancy. */
320 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
321 return build_type_attribute_variant (t1, attributes);
323 if (code1 != REAL_TYPE)
325 /* If one is unsigned long long, then convert the other to unsigned
327 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
328 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
329 return build_type_attribute_variant (long_long_unsigned_type_node,
331 /* If one is a long long, and the other is an unsigned long, and
332 long long can represent all the values of an unsigned long, then
333 convert to a long long. Otherwise, convert to an unsigned long
334 long. Otherwise, if either operand is long long, convert the
337 Since we're here, we know the TYPE_PRECISION is the same;
338 therefore converting to long long cannot represent all the values
339 of an unsigned long, so we choose unsigned long long in that
341 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
342 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
344 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
345 ? long_long_unsigned_type_node
346 : long_long_integer_type_node);
347 return build_type_attribute_variant (t, attributes);
350 /* Go through the same procedure, but for longs. */
351 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
352 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
353 return build_type_attribute_variant (long_unsigned_type_node,
355 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
356 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
358 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
359 ? long_unsigned_type_node : long_integer_type_node);
360 return build_type_attribute_variant (t, attributes);
362 /* Otherwise prefer the unsigned one. */
363 if (TYPE_UNSIGNED (t1))
364 return build_type_attribute_variant (t1, attributes);
366 return build_type_attribute_variant (t2, attributes);
370 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
371 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
372 return build_type_attribute_variant (long_double_type_node,
374 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
375 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
376 return build_type_attribute_variant (double_type_node,
378 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
379 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
380 return build_type_attribute_variant (float_type_node,
383 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
384 the standard C++ floating-point types. Logic earlier in this
385 function has already eliminated the possibility that
386 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
387 compelling reason to choose one or the other. */
388 return build_type_attribute_variant (t1, attributes);
392 /* Subroutine of composite_pointer_type to implement the recursive
393 case. See that function for documentation fo the parameters. */
396 composite_pointer_type_r (tree t1, tree t2, const char* location)
403 /* Determine the types pointed to by T1 and T2. */
404 if (TREE_CODE (t1) == POINTER_TYPE)
406 pointee1 = TREE_TYPE (t1);
407 pointee2 = TREE_TYPE (t2);
411 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
412 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
417 Otherwise, the composite pointer type is a pointer type
418 similar (_conv.qual_) to the type of one of the operands,
419 with a cv-qualification signature (_conv.qual_) that is the
420 union of the cv-qualification signatures of the operand
422 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
423 result_type = pointee1;
424 else if ((TREE_CODE (pointee1) == POINTER_TYPE
425 && TREE_CODE (pointee2) == POINTER_TYPE)
426 || (TYPE_PTR_TO_MEMBER_P (pointee1)
427 && TYPE_PTR_TO_MEMBER_P (pointee2)))
428 result_type = composite_pointer_type_r (pointee1, pointee2, location);
431 pedwarn ("%s between distinct pointer types %qT and %qT "
434 result_type = void_type_node;
436 result_type = cp_build_qualified_type (result_type,
437 (cp_type_quals (pointee1)
438 | cp_type_quals (pointee2)));
439 /* If the original types were pointers to members, so is the
441 if (TYPE_PTR_TO_MEMBER_P (t1))
443 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
444 TYPE_PTRMEM_CLASS_TYPE (t2)))
445 pedwarn ("%s between distinct pointer types %qT and %qT "
448 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
452 result_type = build_pointer_type (result_type);
454 /* Merge the attributes. */
455 attributes = (*targetm.merge_type_attributes) (t1, t2);
456 return build_type_attribute_variant (result_type, attributes);
459 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
460 ARG1 and ARG2 are the values with those types. The LOCATION is a
461 string describing the current location, in case an error occurs.
463 This routine also implements the computation of a common type for
464 pointers-to-members as per [expr.eq]. */
467 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
468 const char* location)
475 If one operand is a null pointer constant, the composite pointer
476 type is the type of the other operand. */
477 if (null_ptr_cst_p (arg1))
479 if (null_ptr_cst_p (arg2))
486 If one of the operands has type "pointer to cv1 void*", then
487 the other has type "pointer to cv2T", and the composite pointer
488 type is "pointer to cv12 void", where cv12 is the union of cv1
491 If either type is a pointer to void, make sure it is T1. */
492 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
500 /* Now, if T1 is a pointer to void, merge the qualifiers. */
501 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
506 if (pedantic && TYPE_PTRFN_P (t2))
507 pedwarn ("ISO C++ forbids %s between pointer of type %<void *%> "
508 "and pointer-to-function", location);
510 = cp_build_qualified_type (void_type_node,
511 (cp_type_quals (TREE_TYPE (t1))
512 | cp_type_quals (TREE_TYPE (t2))));
513 result_type = build_pointer_type (result_type);
514 /* Merge the attributes. */
515 attributes = (*targetm.merge_type_attributes) (t1, t2);
516 return build_type_attribute_variant (result_type, attributes);
519 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
520 && TREE_CODE (t2) == POINTER_TYPE)
522 if (objc_compare_types (t1, t2, -3, NULL_TREE))
526 /* [expr.eq] permits the application of a pointer conversion to
527 bring the pointers to a common type. */
528 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
529 && CLASS_TYPE_P (TREE_TYPE (t1))
530 && CLASS_TYPE_P (TREE_TYPE (t2))
531 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
534 class1 = TREE_TYPE (t1);
535 class2 = TREE_TYPE (t2);
537 if (DERIVED_FROM_P (class1, class2))
538 t2 = (build_pointer_type
539 (cp_build_qualified_type (class1, TYPE_QUALS (class2))));
540 else if (DERIVED_FROM_P (class2, class1))
541 t1 = (build_pointer_type
542 (cp_build_qualified_type (class2, TYPE_QUALS (class1))));
545 error ("%s between distinct pointer types %qT and %qT "
546 "lacks a cast", location, t1, t2);
547 return error_mark_node;
550 /* [expr.eq] permits the application of a pointer-to-member
551 conversion to change the class type of one of the types. */
552 else if (TYPE_PTR_TO_MEMBER_P (t1)
553 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
554 TYPE_PTRMEM_CLASS_TYPE (t2)))
556 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
557 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
559 if (DERIVED_FROM_P (class1, class2))
560 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
561 else if (DERIVED_FROM_P (class2, class1))
562 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
565 error ("%s between distinct pointer-to-member types %qT and %qT "
566 "lacks a cast", location, t1, t2);
567 return error_mark_node;
571 return composite_pointer_type_r (t1, t2, location);
574 /* Return the merged type of two types.
575 We assume that comptypes has already been done and returned 1;
576 if that isn't so, this may crash.
578 This just combines attributes and default arguments; any other
579 differences would cause the two types to compare unalike. */
582 merge_types (tree t1, tree t2)
584 enum tree_code code1;
585 enum tree_code code2;
588 /* Save time if the two types are the same. */
591 if (original_type (t1) == original_type (t2))
594 /* If one type is nonsense, use the other. */
595 if (t1 == error_mark_node)
597 if (t2 == error_mark_node)
600 /* Merge the attributes. */
601 attributes = (*targetm.merge_type_attributes) (t1, t2);
603 if (TYPE_PTRMEMFUNC_P (t1))
604 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
605 if (TYPE_PTRMEMFUNC_P (t2))
606 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
608 code1 = TREE_CODE (t1);
609 code2 = TREE_CODE (t2);
615 /* For two pointers, do this recursively on the target type. */
617 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
618 int quals = cp_type_quals (t1);
620 if (code1 == POINTER_TYPE)
621 t1 = build_pointer_type (target);
623 t1 = build_reference_type (target);
624 t1 = build_type_attribute_variant (t1, attributes);
625 t1 = cp_build_qualified_type (t1, quals);
627 if (TREE_CODE (target) == METHOD_TYPE)
628 t1 = build_ptrmemfunc_type (t1);
637 quals = cp_type_quals (t1);
638 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
639 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
640 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
642 t1 = cp_build_qualified_type (t1, quals);
648 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
649 /* Save space: see if the result is identical to one of the args. */
650 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
651 return build_type_attribute_variant (t1, attributes);
652 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
653 return build_type_attribute_variant (t2, attributes);
654 /* Merge the element types, and have a size if either arg has one. */
655 t1 = build_cplus_array_type
656 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
661 /* Function types: prefer the one that specified arg types.
662 If both do, merge the arg types. Also merge the return types. */
664 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
665 tree p1 = TYPE_ARG_TYPES (t1);
666 tree p2 = TYPE_ARG_TYPES (t2);
669 /* Save space: see if the result is identical to one of the args. */
670 if (valtype == TREE_TYPE (t1) && ! p2)
671 return cp_build_type_attribute_variant (t1, attributes);
672 if (valtype == TREE_TYPE (t2) && ! p1)
673 return cp_build_type_attribute_variant (t2, attributes);
675 /* Simple way if one arg fails to specify argument types. */
676 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
678 rval = build_function_type (valtype, p2);
679 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
680 rval = build_exception_variant (rval, raises);
681 return cp_build_type_attribute_variant (rval, attributes);
683 raises = TYPE_RAISES_EXCEPTIONS (t1);
684 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
686 rval = build_function_type (valtype, p1);
688 rval = build_exception_variant (rval, raises);
689 return cp_build_type_attribute_variant (rval, attributes);
692 rval = build_function_type (valtype, commonparms (p1, p2));
693 t1 = build_exception_variant (rval, raises);
699 /* Get this value the long way, since TYPE_METHOD_BASETYPE
700 is just the main variant of this. */
701 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
702 tree raises = TYPE_RAISES_EXCEPTIONS (t1);
705 /* If this was a member function type, get back to the
706 original type of type member function (i.e., without
707 the class instance variable up front. */
708 t1 = build_function_type (TREE_TYPE (t1),
709 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
710 t2 = build_function_type (TREE_TYPE (t2),
711 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
712 t3 = merge_types (t1, t2);
713 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
714 TYPE_ARG_TYPES (t3));
715 t1 = build_exception_variant (t3, raises);
720 /* There is no need to merge attributes into a TYPENAME_TYPE.
721 When the type is instantiated it will have whatever
722 attributes result from the instantiation. */
728 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
730 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
733 return cp_build_type_attribute_variant (t1, attributes);
736 /* Return the common type of two types.
737 We assume that comptypes has already been done and returned 1;
738 if that isn't so, this may crash.
740 This is the type for the result of most arithmetic operations
741 if the operands have the given two types. */
744 common_type (tree t1, tree t2)
746 enum tree_code code1;
747 enum tree_code code2;
749 /* If one type is nonsense, bail. */
750 if (t1 == error_mark_node || t2 == error_mark_node)
751 return error_mark_node;
753 code1 = TREE_CODE (t1);
754 code2 = TREE_CODE (t2);
756 if ((ARITHMETIC_TYPE_P (t1) || code1 == ENUMERAL_TYPE
757 || code1 == VECTOR_TYPE)
758 && (ARITHMETIC_TYPE_P (t2) || code2 == ENUMERAL_TYPE
759 || code2 == VECTOR_TYPE))
760 return type_after_usual_arithmetic_conversions (t1, t2);
762 else if ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
763 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
764 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)))
765 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
771 /* Compare two exception specifier types for exactness or subsetness, if
772 allowed. Returns false for mismatch, true for match (same, or
775 [except.spec] "If a class X ... objects of class X or any class publicly
776 and unambiguously derived from X. Similarly, if a pointer type Y * ...
777 exceptions of type Y * or that are pointers to any type publicly and
778 unambiguously derived 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 (tree a, tree b, bool exact)
790 if (same_type_p (a, b))
794 if (cp_type_quals (a) || cp_type_quals (b))
797 if (TREE_CODE (a) == POINTER_TYPE
798 && TREE_CODE (b) == POINTER_TYPE)
802 if (cp_type_quals (a) || cp_type_quals (b))
806 if (TREE_CODE (a) != RECORD_TYPE
807 || TREE_CODE (b) != RECORD_TYPE)
810 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
816 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
817 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
818 otherwise it must be exact. Exception lists are unordered, but
819 we've already filtered out duplicates. Most lists will be in order,
820 we should try to make use of that. */
823 comp_except_specs (tree t1, tree t2, bool exact)
832 if (t1 == NULL_TREE) /* T1 is ... */
833 return t2 == NULL_TREE || !exact;
834 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
835 return t2 != NULL_TREE && !TREE_VALUE (t2);
836 if (t2 == NULL_TREE) /* T2 is ... */
838 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
841 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
842 Count how many we find, to determine exactness. For exact matching and
843 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
845 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
847 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
849 tree a = TREE_VALUE (probe);
850 tree b = TREE_VALUE (t2);
852 if (comp_except_types (a, b, exact))
854 if (probe == base && exact)
855 base = TREE_CHAIN (probe);
860 if (probe == NULL_TREE)
863 return !exact || base == NULL_TREE || length == list_length (t1);
866 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
867 [] can match [size]. */
870 comp_array_types (tree t1, tree t2, bool allow_redeclaration)
879 /* The type of the array elements must be the same. */
880 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
883 d1 = TYPE_DOMAIN (t1);
884 d2 = TYPE_DOMAIN (t2);
889 /* If one of the arrays is dimensionless, and the other has a
890 dimension, they are of different types. However, it is valid to
898 declarations for an array object can specify
899 array types that differ by the presence or absence of a major
900 array bound (_dcl.array_). */
902 return allow_redeclaration;
904 /* Check that the dimensions are the same. */
906 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
908 max1 = TYPE_MAX_VALUE (d1);
909 max2 = TYPE_MAX_VALUE (d2);
910 if (processing_template_decl && !abi_version_at_least (2)
911 && !value_dependent_expression_p (max1)
912 && !value_dependent_expression_p (max2))
914 /* With abi-1 we do not fold non-dependent array bounds, (and
915 consequently mangle them incorrectly). We must therefore
916 fold them here, to verify the domains have the same
922 if (!cp_tree_equal (max1, max2))
928 /* Subroutine in comptypes. */
931 structural_comptypes (tree t1, tree t2, int strict)
936 /* Suppress errors caused by previously reported errors. */
937 if (t1 == error_mark_node || t2 == error_mark_node)
940 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
942 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
943 current instantiation. */
944 if (TREE_CODE (t1) == TYPENAME_TYPE)
945 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
947 if (TREE_CODE (t2) == TYPENAME_TYPE)
948 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
950 if (TYPE_PTRMEMFUNC_P (t1))
951 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
952 if (TYPE_PTRMEMFUNC_P (t2))
953 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
955 /* Different classes of types can't be compatible. */
956 if (TREE_CODE (t1) != TREE_CODE (t2))
959 /* Qualifiers must match. For array types, we will check when we
960 recur on the array element types. */
961 if (TREE_CODE (t1) != ARRAY_TYPE
962 && TYPE_QUALS (t1) != TYPE_QUALS (t2))
964 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
967 /* Allow for two different type nodes which have essentially the same
968 definition. Note that we already checked for equality of the type
969 qualifiers (just above). */
971 if (TREE_CODE (t1) != ARRAY_TYPE
972 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
975 /* Compare the types. Break out if they could be the same. */
976 switch (TREE_CODE (t1))
978 case TEMPLATE_TEMPLATE_PARM:
979 case BOUND_TEMPLATE_TEMPLATE_PARM:
980 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
981 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
982 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
983 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
985 if (!comp_template_parms
986 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
987 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
989 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
991 /* Don't check inheritance. */
992 strict = COMPARE_STRICT;
997 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
998 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
999 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1000 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1003 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1005 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1011 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1012 strict & ~COMPARE_REDECLARATION))
1014 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1018 case REFERENCE_TYPE:
1019 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1021 /* fall through to checks for pointer types */
1024 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1025 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1026 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1032 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1034 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1039 /* Target types must match incl. qualifiers. */
1040 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1044 case TEMPLATE_TYPE_PARM:
1045 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1046 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1047 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1048 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1053 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1054 TYPENAME_TYPE_FULLNAME (t2)))
1056 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1060 case UNBOUND_CLASS_TEMPLATE:
1061 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1063 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1068 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1073 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1074 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1078 case TYPE_PACK_EXPANSION:
1079 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1080 PACK_EXPANSION_PATTERN (t2));
1083 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1084 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1085 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1086 DECLTYPE_TYPE_EXPR (t2)))
1094 /* If we get here, we know that from a target independent POV the
1095 types are the same. Make sure the target attributes are also
1097 return targetm.comp_type_attributes (t1, t2);
1100 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1101 is a bitwise-or of the COMPARE_* flags. */
1104 comptypes (tree t1, tree t2, int strict)
1106 if (strict == COMPARE_STRICT)
1111 if (t1 == error_mark_node || t2 == error_mark_node)
1114 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1115 /* At least one of the types requires structural equality, so
1116 perform a deep check. */
1117 return structural_comptypes (t1, t2, strict);
1119 #ifdef ENABLE_CHECKING
1120 if (USE_CANONICAL_TYPES)
1122 bool result = structural_comptypes (t1, t2, strict);
1124 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1125 /* The two types are structurally equivalent, but their
1126 canonical types were different. This is a failure of the
1127 canonical type propagation code.*/
1129 ("canonical types differ for identical types %T and %T",
1131 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1132 /* Two types are structurally different, but the canonical
1133 types are the same. This means we were over-eager in
1134 assigning canonical types. */
1136 ("same canonical type node for different types %T and %T",
1142 if (USE_CANONICAL_TYPES)
1143 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1146 return structural_comptypes (t1, t2, strict);
1148 else if (strict == COMPARE_STRUCTURAL)
1149 return structural_comptypes (t1, t2, COMPARE_STRICT);
1151 return structural_comptypes (t1, t2, strict);
1154 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1157 at_least_as_qualified_p (tree type1, tree type2)
1159 int q1 = cp_type_quals (type1);
1160 int q2 = cp_type_quals (type2);
1162 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1163 return (q1 & q2) == q2;
1166 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1167 more cv-qualified that TYPE1, and 0 otherwise. */
1170 comp_cv_qualification (tree type1, tree type2)
1172 int q1 = cp_type_quals (type1);
1173 int q2 = cp_type_quals (type2);
1178 if ((q1 & q2) == q2)
1180 else if ((q1 & q2) == q1)
1186 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1187 subset of the cv-qualification signature of TYPE2, and the types
1188 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1191 comp_cv_qual_signature (tree type1, tree type2)
1193 if (comp_ptr_ttypes_real (type2, type1, -1))
1195 else if (comp_ptr_ttypes_real (type1, type2, -1))
1201 /* Subroutines of `comptypes'. */
1203 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1204 equivalent in the sense that functions with those parameter types
1205 can have equivalent types. The two lists must be equivalent,
1206 element by element. */
1209 compparms (tree parms1, tree parms2)
1213 /* An unspecified parmlist matches any specified parmlist
1214 whose argument types don't need default promotions. */
1216 for (t1 = parms1, t2 = parms2;
1218 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1220 /* If one parmlist is shorter than the other,
1221 they fail to match. */
1224 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1231 /* Process a sizeof or alignof expression where the operand is a
1235 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1240 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1241 if (type == error_mark_node)
1242 return error_mark_node;
1244 type = non_reference (type);
1245 if (TREE_CODE (type) == METHOD_TYPE)
1247 if (complain && (pedantic || warn_pointer_arith))
1248 pedwarn ("invalid application of %qs to a member function",
1249 operator_name_info[(int) op].name);
1250 value = size_one_node;
1253 dependent_p = dependent_type_p (type);
1255 complete_type (type);
1257 /* VLA types will have a non-constant size. In the body of an
1258 uninstantiated template, we don't need to try to compute the
1259 value, because the sizeof expression is not an integral
1260 constant expression in that case. And, if we do try to
1261 compute the value, we'll likely end up with SAVE_EXPRs, which
1262 the template substitution machinery does not expect to see. */
1263 || (processing_template_decl
1264 && COMPLETE_TYPE_P (type)
1265 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1267 value = build_min (op, size_type_node, type);
1268 TREE_READONLY (value) = 1;
1272 return c_sizeof_or_alignof_type (complete_type (type),
1277 /* Process a sizeof expression where the operand is an expression. */
1280 cxx_sizeof_expr (tree e)
1282 if (e == error_mark_node)
1283 return error_mark_node;
1285 if (processing_template_decl)
1287 e = build_min (SIZEOF_EXPR, size_type_node, e);
1288 TREE_SIDE_EFFECTS (e) = 0;
1289 TREE_READONLY (e) = 1;
1294 if (TREE_CODE (e) == COMPONENT_REF
1295 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1296 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1298 error ("invalid application of %<sizeof%> to a bit-field");
1301 else if (is_overloaded_fn (e))
1303 pedwarn ("ISO C++ forbids applying %<sizeof%> to an expression of "
1307 else if (type_unknown_p (e))
1309 cxx_incomplete_type_error (e, TREE_TYPE (e));
1315 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, true);
1318 /* Implement the __alignof keyword: Return the minimum required
1319 alignment of E, measured in bytes. For VAR_DECL's and
1320 FIELD_DECL's return DECL_ALIGN (which can be set from an
1321 "aligned" __attribute__ specification). */
1324 cxx_alignof_expr (tree e)
1328 if (e == error_mark_node)
1329 return error_mark_node;
1331 if (processing_template_decl)
1333 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1334 TREE_SIDE_EFFECTS (e) = 0;
1335 TREE_READONLY (e) = 1;
1340 if (TREE_CODE (e) == VAR_DECL)
1341 t = size_int (DECL_ALIGN_UNIT (e));
1342 else if (TREE_CODE (e) == COMPONENT_REF
1343 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1344 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1346 error ("invalid application of %<__alignof%> to a bit-field");
1349 else if (TREE_CODE (e) == COMPONENT_REF
1350 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1351 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1352 else if (is_overloaded_fn (e))
1354 pedwarn ("ISO C++ forbids applying %<__alignof%> to an expression of "
1356 if (TREE_CODE (e) == FUNCTION_DECL)
1357 t = size_int (DECL_ALIGN_UNIT (e));
1361 else if (type_unknown_p (e))
1363 cxx_incomplete_type_error (e, TREE_TYPE (e));
1367 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR, true);
1369 return fold_convert (size_type_node, t);
1372 /* Process a sizeof or alignof expression E with code OP where the operand
1373 is an expression. */
1376 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op)
1378 if (op == SIZEOF_EXPR)
1379 return cxx_sizeof_expr (e);
1381 return cxx_alignof_expr (e);
1384 /* EXPR is being used in a context that is not a function call.
1389 The expression can be used only as the left-hand operand of a
1390 member function call.
1392 [expr.mptr.operator]
1394 If the result of .* or ->* is a function, then that result can be
1395 used only as the operand for the function call operator ().
1397 by issuing an error message if appropriate. Returns true iff EXPR
1398 violates these rules. */
1401 invalid_nonstatic_memfn_p (tree expr)
1403 if (TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE)
1405 error ("invalid use of non-static member function");
1411 /* If EXP is a reference to a bitfield, and the type of EXP does not
1412 match the declared type of the bitfield, return the declared type
1413 of the bitfield. Otherwise, return NULL_TREE. */
1416 is_bitfield_expr_with_lowered_type (tree exp)
1418 switch (TREE_CODE (exp))
1421 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)))
1423 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1426 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1430 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1436 field = TREE_OPERAND (exp, 1);
1437 if (TREE_CODE (field) != FIELD_DECL || !DECL_C_BIT_FIELD (field))
1439 if (same_type_ignoring_top_level_qualifiers_p
1440 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1442 return DECL_BIT_FIELD_TYPE (field);
1450 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1451 bitfield with a lowered type, the type of EXP is returned, rather
1455 unlowered_expr_type (tree exp)
1459 type = is_bitfield_expr_with_lowered_type (exp);
1461 type = TREE_TYPE (exp);
1466 /* Perform the conversions in [expr] that apply when an lvalue appears
1467 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1468 function-to-pointer conversions. In addition, manifest constants
1469 are replaced by their values, and bitfield references are converted
1470 to their declared types.
1472 Although the returned value is being used as an rvalue, this
1473 function does not wrap the returned expression in a
1474 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1475 that the return value is no longer an lvalue. */
1478 decay_conversion (tree exp)
1481 enum tree_code code;
1483 type = TREE_TYPE (exp);
1484 if (type == error_mark_node)
1485 return error_mark_node;
1487 if (type_unknown_p (exp))
1489 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1490 return error_mark_node;
1493 exp = decl_constant_value (exp);
1494 if (error_operand_p (exp))
1495 return error_mark_node;
1497 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1498 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1499 code = TREE_CODE (type);
1500 if (code == VOID_TYPE)
1502 error ("void value not ignored as it ought to be");
1503 return error_mark_node;
1505 if (invalid_nonstatic_memfn_p (exp))
1506 return error_mark_node;
1507 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1508 return build_unary_op (ADDR_EXPR, exp, 0);
1509 if (code == ARRAY_TYPE)
1514 if (TREE_CODE (exp) == INDIRECT_REF)
1515 return build_nop (build_pointer_type (TREE_TYPE (type)),
1516 TREE_OPERAND (exp, 0));
1518 if (TREE_CODE (exp) == COMPOUND_EXPR)
1520 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1521 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1522 TREE_OPERAND (exp, 0), op1);
1526 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1528 error ("invalid use of non-lvalue array");
1529 return error_mark_node;
1532 ptrtype = build_pointer_type (TREE_TYPE (type));
1534 if (TREE_CODE (exp) == VAR_DECL)
1536 if (!cxx_mark_addressable (exp))
1537 return error_mark_node;
1538 adr = build_nop (ptrtype, build_address (exp));
1541 /* This way is better for a COMPONENT_REF since it can
1542 simplify the offset for a component. */
1543 adr = build_unary_op (ADDR_EXPR, exp, 1);
1544 return cp_convert (ptrtype, adr);
1547 /* If a bitfield is used in a context where integral promotion
1548 applies, then the caller is expected to have used
1549 default_conversion. That function promotes bitfields correctly
1550 before calling this function. At this point, if we have a
1551 bitfield referenced, we may assume that is not subject to
1552 promotion, and that, therefore, the type of the resulting rvalue
1553 is the declared type of the bitfield. */
1554 exp = convert_bitfield_to_declared_type (exp);
1556 /* We do not call rvalue() here because we do not want to wrap EXP
1557 in a NON_LVALUE_EXPR. */
1561 Non-class rvalues always have cv-unqualified types. */
1562 type = TREE_TYPE (exp);
1563 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
1564 exp = build_nop (TYPE_MAIN_VARIANT (type), exp);
1569 /* Perform prepatory conversions, as part of the "usual arithmetic
1570 conversions". In particular, as per [expr]:
1572 Whenever an lvalue expression appears as an operand of an
1573 operator that expects the rvalue for that operand, the
1574 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1575 standard conversions are applied to convert the expression to an
1578 In addition, we perform integral promotions here, as those are
1579 applied to both operands to a binary operator before determining
1580 what additional conversions should apply. */
1583 default_conversion (tree exp)
1585 /* Perform the integral promotions first so that bitfield
1586 expressions (which may promote to "int", even if the bitfield is
1587 declared "unsigned") are promoted correctly. */
1588 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1589 exp = perform_integral_promotions (exp);
1590 /* Perform the other conversions. */
1591 exp = decay_conversion (exp);
1596 /* EXPR is an expression with an integral or enumeration type.
1597 Perform the integral promotions in [conv.prom], and return the
1601 perform_integral_promotions (tree expr)
1608 If the bitfield has an enumerated type, it is treated as any
1609 other value of that type for promotion purposes. */
1610 type = is_bitfield_expr_with_lowered_type (expr);
1611 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1612 type = TREE_TYPE (expr);
1613 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1614 promoted_type = type_promotes_to (type);
1615 if (type != promoted_type)
1616 expr = cp_convert (promoted_type, expr);
1620 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1624 inline_conversion (tree exp)
1626 if (TREE_CODE (exp) == FUNCTION_DECL)
1627 exp = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (exp)), exp);
1632 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1633 decay_conversion to one. */
1636 string_conv_p (tree totype, tree exp, int warn)
1640 if (TREE_CODE (totype) != POINTER_TYPE)
1643 t = TREE_TYPE (totype);
1644 if (!same_type_p (t, char_type_node)
1645 && !same_type_p (t, wchar_type_node))
1648 if (TREE_CODE (exp) == STRING_CST)
1650 /* Make sure that we don't try to convert between char and wchar_t. */
1651 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1656 /* Is this a string constant which has decayed to 'const char *'? */
1657 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1658 if (!same_type_p (TREE_TYPE (exp), t))
1661 if (TREE_CODE (exp) != ADDR_EXPR
1662 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1666 /* This warning is not very useful, as it complains about printf. */
1668 warning (OPT_Wwrite_strings,
1669 "deprecated conversion from string constant to %qT",
1675 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1676 can, for example, use as an lvalue. This code used to be in
1677 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1678 expressions, where we're dealing with aggregates. But now it's again only
1679 called from unary_complex_lvalue. The case (in particular) that led to
1680 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1684 rationalize_conditional_expr (enum tree_code code, tree t)
1686 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1687 the first operand is always the one to be used if both operands
1688 are equal, so we know what conditional expression this used to be. */
1689 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1691 tree op0 = TREE_OPERAND (t, 0);
1692 tree op1 = TREE_OPERAND (t, 1);
1694 /* The following code is incorrect if either operand side-effects. */
1695 gcc_assert (!TREE_SIDE_EFFECTS (op0)
1696 && !TREE_SIDE_EFFECTS (op1));
1698 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1699 ? LE_EXPR : GE_EXPR),
1700 op0, TREE_CODE (op0),
1701 op1, TREE_CODE (op1),
1702 /*overloaded_p=*/NULL),
1703 build_unary_op (code, op0, 0),
1704 build_unary_op (code, op1, 0));
1708 build_conditional_expr (TREE_OPERAND (t, 0),
1709 build_unary_op (code, TREE_OPERAND (t, 1), 0),
1710 build_unary_op (code, TREE_OPERAND (t, 2), 0));
1713 /* Given the TYPE of an anonymous union field inside T, return the
1714 FIELD_DECL for the field. If not found return NULL_TREE. Because
1715 anonymous unions can nest, we must also search all anonymous unions
1716 that are directly reachable. */
1719 lookup_anon_field (tree t, tree type)
1723 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1725 if (TREE_STATIC (field))
1727 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1730 /* If we find it directly, return the field. */
1731 if (DECL_NAME (field) == NULL_TREE
1732 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
1737 /* Otherwise, it could be nested, search harder. */
1738 if (DECL_NAME (field) == NULL_TREE
1739 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1741 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1749 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1750 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1751 non-NULL, it indicates the path to the base used to name MEMBER.
1752 If PRESERVE_REFERENCE is true, the expression returned will have
1753 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1754 returned will have the type referred to by the reference.
1756 This function does not perform access control; that is either done
1757 earlier by the parser when the name of MEMBER is resolved to MEMBER
1758 itself, or later when overload resolution selects one of the
1759 functions indicated by MEMBER. */
1762 build_class_member_access_expr (tree object, tree member,
1763 tree access_path, bool preserve_reference)
1767 tree result = NULL_TREE;
1769 if (error_operand_p (object) || error_operand_p (member))
1770 return error_mark_node;
1772 gcc_assert (DECL_P (member) || BASELINK_P (member));
1776 The type of the first expression shall be "class object" (of a
1778 object_type = TREE_TYPE (object);
1779 if (!currently_open_class (object_type)
1780 && !complete_type_or_else (object_type, object))
1781 return error_mark_node;
1782 if (!CLASS_TYPE_P (object_type))
1784 error ("request for member %qD in %qE, which is of non-class type %qT",
1785 member, object, object_type);
1786 return error_mark_node;
1789 /* The standard does not seem to actually say that MEMBER must be a
1790 member of OBJECT_TYPE. However, that is clearly what is
1792 if (DECL_P (member))
1794 member_scope = DECL_CLASS_CONTEXT (member);
1796 if (TREE_DEPRECATED (member))
1797 warn_deprecated_use (member);
1800 member_scope = BINFO_TYPE (BASELINK_BINFO (member));
1801 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1802 presently be the anonymous union. Go outwards until we find a
1803 type related to OBJECT_TYPE. */
1804 while (ANON_AGGR_TYPE_P (member_scope)
1805 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
1807 member_scope = TYPE_CONTEXT (member_scope);
1808 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
1810 if (TREE_CODE (member) == FIELD_DECL)
1811 error ("invalid use of nonstatic data member %qE", member);
1813 error ("%qD is not a member of %qT", member, object_type);
1814 return error_mark_node;
1817 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1818 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1819 in the front end; only _DECLs and _REFs are lvalues in the back end. */
1821 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
1823 object = build_indirect_ref (temp, NULL);
1826 /* In [expr.ref], there is an explicit list of the valid choices for
1827 MEMBER. We check for each of those cases here. */
1828 if (TREE_CODE (member) == VAR_DECL)
1830 /* A static data member. */
1832 /* If OBJECT has side-effects, they are supposed to occur. */
1833 if (TREE_SIDE_EFFECTS (object))
1834 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
1836 else if (TREE_CODE (member) == FIELD_DECL)
1838 /* A non-static data member. */
1843 null_object_p = (TREE_CODE (object) == INDIRECT_REF
1844 && integer_zerop (TREE_OPERAND (object, 0)));
1846 /* Convert OBJECT to the type of MEMBER. */
1847 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
1848 TYPE_MAIN_VARIANT (member_scope)))
1853 binfo = lookup_base (access_path ? access_path : object_type,
1854 member_scope, ba_unique, &kind);
1855 if (binfo == error_mark_node)
1856 return error_mark_node;
1858 /* It is invalid to try to get to a virtual base of a
1859 NULL object. The most common cause is invalid use of
1861 if (null_object_p && kind == bk_via_virtual)
1863 error ("invalid access to non-static data member %qD of "
1866 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1867 return error_mark_node;
1870 /* Convert to the base. */
1871 object = build_base_path (PLUS_EXPR, object, binfo,
1873 /* If we found the base successfully then we should be able
1874 to convert to it successfully. */
1875 gcc_assert (object != error_mark_node);
1878 /* Complain about other invalid uses of offsetof, even though they will
1879 give the right answer. Note that we complain whether or not they
1880 actually used the offsetof macro, since there's no way to know at this
1881 point. So we just give a warning, instead of a pedwarn. */
1882 /* Do not produce this warning for base class field references, because
1883 we know for a fact that didn't come from offsetof. This does occur
1884 in various testsuite cases where a null object is passed where a
1885 vtable access is required. */
1886 if (null_object_p && warn_invalid_offsetof
1887 && CLASSTYPE_NON_POD_P (object_type)
1888 && !DECL_FIELD_IS_BASE (member)
1889 && !skip_evaluation)
1891 warning (0, "invalid access to non-static data member %qD of NULL object",
1893 warning (0, "(perhaps the %<offsetof%> macro was used incorrectly)");
1896 /* If MEMBER is from an anonymous aggregate, we have converted
1897 OBJECT so that it refers to the class containing the
1898 anonymous union. Generate a reference to the anonymous union
1899 itself, and recur to find MEMBER. */
1900 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
1901 /* When this code is called from build_field_call, the
1902 object already has the type of the anonymous union.
1903 That is because the COMPONENT_REF was already
1904 constructed, and was then disassembled before calling
1905 build_field_call. After the function-call code is
1906 cleaned up, this waste can be eliminated. */
1907 && (!same_type_ignoring_top_level_qualifiers_p
1908 (TREE_TYPE (object), DECL_CONTEXT (member))))
1910 tree anonymous_union;
1912 anonymous_union = lookup_anon_field (TREE_TYPE (object),
1913 DECL_CONTEXT (member));
1914 object = build_class_member_access_expr (object,
1916 /*access_path=*/NULL_TREE,
1917 preserve_reference);
1920 /* Compute the type of the field, as described in [expr.ref]. */
1921 type_quals = TYPE_UNQUALIFIED;
1922 member_type = TREE_TYPE (member);
1923 if (TREE_CODE (member_type) != REFERENCE_TYPE)
1925 type_quals = (cp_type_quals (member_type)
1926 | cp_type_quals (object_type));
1928 /* A field is const (volatile) if the enclosing object, or the
1929 field itself, is const (volatile). But, a mutable field is
1930 not const, even within a const object. */
1931 if (DECL_MUTABLE_P (member))
1932 type_quals &= ~TYPE_QUAL_CONST;
1933 member_type = cp_build_qualified_type (member_type, type_quals);
1936 result = build3 (COMPONENT_REF, member_type, object, member,
1938 result = fold_if_not_in_template (result);
1940 /* Mark the expression const or volatile, as appropriate. Even
1941 though we've dealt with the type above, we still have to mark the
1942 expression itself. */
1943 if (type_quals & TYPE_QUAL_CONST)
1944 TREE_READONLY (result) = 1;
1945 if (type_quals & TYPE_QUAL_VOLATILE)
1946 TREE_THIS_VOLATILE (result) = 1;
1948 else if (BASELINK_P (member))
1950 /* The member is a (possibly overloaded) member function. */
1954 /* If the MEMBER is exactly one static member function, then we
1955 know the type of the expression. Otherwise, we must wait
1956 until overload resolution has been performed. */
1957 functions = BASELINK_FUNCTIONS (member);
1958 if (TREE_CODE (functions) == FUNCTION_DECL
1959 && DECL_STATIC_FUNCTION_P (functions))
1960 type = TREE_TYPE (functions);
1962 type = unknown_type_node;
1963 /* Note that we do not convert OBJECT to the BASELINK_BINFO
1964 base. That will happen when the function is called. */
1965 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
1967 else if (TREE_CODE (member) == CONST_DECL)
1969 /* The member is an enumerator. */
1971 /* If OBJECT has side-effects, they are supposed to occur. */
1972 if (TREE_SIDE_EFFECTS (object))
1973 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
1978 error ("invalid use of %qD", member);
1979 return error_mark_node;
1982 if (!preserve_reference)
1985 If E2 is declared to have type "reference to T", then ... the
1986 type of E1.E2 is T. */
1987 result = convert_from_reference (result);
1992 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
1993 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
1996 lookup_destructor (tree object, tree scope, tree dtor_name)
1998 tree object_type = TREE_TYPE (object);
1999 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2002 if (scope && !check_dtor_name (scope, dtor_type))
2004 error ("qualified type %qT does not match destructor name ~%qT",
2006 return error_mark_node;
2008 if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2010 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2011 TYPE_MAIN_VARIANT (object_type), dtor_type);
2012 return error_mark_node;
2014 expr = lookup_member (dtor_type, complete_dtor_identifier,
2015 /*protect=*/1, /*want_type=*/false);
2016 expr = (adjust_result_of_qualified_name_lookup
2017 (expr, dtor_type, object_type));
2021 /* An expression of the form "A::template B" has been resolved to
2022 DECL. Issue a diagnostic if B is not a template or template
2026 check_template_keyword (tree decl)
2028 /* The standard says:
2032 If a name prefixed by the keyword template is not a member
2033 template, the program is ill-formed.
2035 DR 228 removed the restriction that the template be a member
2038 DR 96, if accepted would add the further restriction that explicit
2039 template arguments must be provided if the template keyword is
2040 used, but, as of 2005-10-16, that DR is still in "drafting". If
2041 this DR is accepted, then the semantic checks here can be
2042 simplified, as the entity named must in fact be a template
2043 specialization, rather than, as at present, a set of overloaded
2044 functions containing at least one template function. */
2045 if (TREE_CODE (decl) != TEMPLATE_DECL
2046 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2048 if (!is_overloaded_fn (decl))
2049 pedwarn ("%qD is not a template", decl);
2054 if (BASELINK_P (fns))
2055 fns = BASELINK_FUNCTIONS (fns);
2058 tree fn = OVL_CURRENT (fns);
2059 if (TREE_CODE (fn) == TEMPLATE_DECL
2060 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2062 if (TREE_CODE (fn) == FUNCTION_DECL
2063 && DECL_USE_TEMPLATE (fn)
2064 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2066 fns = OVL_NEXT (fns);
2069 pedwarn ("%qD is not a template", decl);
2074 /* This function is called by the parser to process a class member
2075 access expression of the form OBJECT.NAME. NAME is a node used by
2076 the parser to represent a name; it is not yet a DECL. It may,
2077 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2078 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2079 there is no reason to do the lookup twice, so the parser keeps the
2080 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2081 be a template via the use of the "A::template B" syntax. */
2084 finish_class_member_access_expr (tree object, tree name, bool template_p)
2089 tree access_path = NULL_TREE;
2090 tree orig_object = object;
2091 tree orig_name = name;
2093 if (object == error_mark_node || name == error_mark_node)
2094 return error_mark_node;
2096 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2097 if (!objc_is_public (object, name))
2098 return error_mark_node;
2100 object_type = TREE_TYPE (object);
2102 if (processing_template_decl)
2104 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2105 dependent_type_p (object_type)
2106 /* If NAME is just an IDENTIFIER_NODE, then the expression
2108 || TREE_CODE (object) == IDENTIFIER_NODE
2109 /* If NAME is "f<args>", where either 'f' or 'args' is
2110 dependent, then the expression is dependent. */
2111 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2112 && dependent_template_id_p (TREE_OPERAND (name, 0),
2113 TREE_OPERAND (name, 1)))
2114 /* If NAME is "T::X" where "T" is dependent, then the
2115 expression is dependent. */
2116 || (TREE_CODE (name) == SCOPE_REF
2117 && TYPE_P (TREE_OPERAND (name, 0))
2118 && dependent_type_p (TREE_OPERAND (name, 0))))
2119 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2120 object = build_non_dependent_expr (object);
2125 The type of the first expression shall be "class object" (of a
2127 if (!currently_open_class (object_type)
2128 && !complete_type_or_else (object_type, object))
2129 return error_mark_node;
2130 if (!CLASS_TYPE_P (object_type))
2132 error ("request for member %qD in %qE, which is of non-class type %qT",
2133 name, object, object_type);
2134 return error_mark_node;
2137 if (BASELINK_P (name))
2138 /* A member function that has already been looked up. */
2142 bool is_template_id = false;
2143 tree template_args = NULL_TREE;
2146 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2148 is_template_id = true;
2149 template_args = TREE_OPERAND (name, 1);
2150 name = TREE_OPERAND (name, 0);
2152 if (TREE_CODE (name) == OVERLOAD)
2153 name = DECL_NAME (get_first_fn (name));
2154 else if (DECL_P (name))
2155 name = DECL_NAME (name);
2158 if (TREE_CODE (name) == SCOPE_REF)
2160 /* A qualified name. The qualifying class or namespace `S'
2161 has already been looked up; it is either a TYPE or a
2163 scope = TREE_OPERAND (name, 0);
2164 name = TREE_OPERAND (name, 1);
2166 /* If SCOPE is a namespace, then the qualified name does not
2167 name a member of OBJECT_TYPE. */
2168 if (TREE_CODE (scope) == NAMESPACE_DECL)
2170 error ("%<%D::%D%> is not a member of %qT",
2171 scope, name, object_type);
2172 return error_mark_node;
2175 gcc_assert (CLASS_TYPE_P (scope));
2176 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2177 || TREE_CODE (name) == BIT_NOT_EXPR);
2179 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2180 access_path = lookup_base (object_type, scope, ba_check, NULL);
2181 if (access_path == error_mark_node)
2182 return error_mark_node;
2185 error ("%qT is not a base of %qT", scope, object_type);
2186 return error_mark_node;
2192 access_path = object_type;
2195 if (TREE_CODE (name) == BIT_NOT_EXPR)
2196 member = lookup_destructor (object, scope, name);
2199 /* Look up the member. */
2200 member = lookup_member (access_path, name, /*protect=*/1,
2201 /*want_type=*/false);
2202 if (member == NULL_TREE)
2204 error ("%qD has no member named %qE", object_type, name);
2205 return error_mark_node;
2207 if (member == error_mark_node)
2208 return error_mark_node;
2213 tree template = member;
2215 if (BASELINK_P (template))
2216 template = lookup_template_function (template, template_args);
2219 error ("%qD is not a member template function", name);
2220 return error_mark_node;
2225 if (TREE_DEPRECATED (member))
2226 warn_deprecated_use (member);
2229 check_template_keyword (member);
2231 expr = build_class_member_access_expr (object, member, access_path,
2232 /*preserve_reference=*/false);
2233 if (processing_template_decl && expr != error_mark_node)
2235 if (BASELINK_P (member))
2237 if (TREE_CODE (orig_name) == SCOPE_REF)
2238 BASELINK_QUALIFIED_P (member) = 1;
2241 return build_min_non_dep (COMPONENT_REF, expr,
2242 orig_object, orig_name,
2249 /* Return an expression for the MEMBER_NAME field in the internal
2250 representation of PTRMEM, a pointer-to-member function. (Each
2251 pointer-to-member function type gets its own RECORD_TYPE so it is
2252 more convenient to access the fields by name than by FIELD_DECL.)
2253 This routine converts the NAME to a FIELD_DECL and then creates the
2254 node for the complete expression. */
2257 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2263 /* This code is a stripped down version of
2264 build_class_member_access_expr. It does not work to use that
2265 routine directly because it expects the object to be of class
2267 ptrmem_type = TREE_TYPE (ptrmem);
2268 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2269 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2270 /*want_type=*/false);
2271 member_type = cp_build_qualified_type (TREE_TYPE (member),
2272 cp_type_quals (ptrmem_type));
2273 return fold_build3 (COMPONENT_REF, member_type,
2274 ptrmem, member, NULL_TREE);
2277 /* Given an expression PTR for a pointer, return an expression
2278 for the value pointed to.
2279 ERRORSTRING is the name of the operator to appear in error messages.
2281 This function may need to overload OPERATOR_FNNAME.
2282 Must also handle REFERENCE_TYPEs for C++. */
2285 build_x_indirect_ref (tree expr, const char *errorstring)
2287 tree orig_expr = expr;
2290 if (processing_template_decl)
2292 if (type_dependent_expression_p (expr))
2293 return build_min_nt (INDIRECT_REF, expr);
2294 expr = build_non_dependent_expr (expr);
2297 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2298 NULL_TREE, /*overloaded_p=*/NULL);
2300 rval = build_indirect_ref (expr, errorstring);
2302 if (processing_template_decl && rval != error_mark_node)
2303 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2309 build_indirect_ref (tree ptr, const char *errorstring)
2313 if (ptr == error_mark_node)
2314 return error_mark_node;
2316 if (ptr == current_class_ptr)
2317 return current_class_ref;
2319 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2320 ? ptr : decay_conversion (ptr));
2321 type = TREE_TYPE (pointer);
2323 if (POINTER_TYPE_P (type))
2327 If the type of the expression is "pointer to T," the type
2328 of the result is "T."
2330 We must use the canonical variant because certain parts of
2331 the back end, like fold, do pointer comparisons between
2333 tree t = canonical_type_variant (TREE_TYPE (type));
2335 if (TREE_CODE (ptr) == CONVERT_EXPR
2336 || TREE_CODE (ptr) == NOP_EXPR
2337 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2339 /* If a warning is issued, mark it to avoid duplicates from
2340 the backend. This only needs to be done at
2341 warn_strict_aliasing > 2. */
2342 if (warn_strict_aliasing > 2)
2343 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2344 type, TREE_OPERAND (ptr, 0)))
2345 TREE_NO_WARNING (ptr) = 1;
2348 if (VOID_TYPE_P (t))
2350 /* A pointer to incomplete type (other than cv void) can be
2351 dereferenced [expr.unary.op]/1 */
2352 error ("%qT is not a pointer-to-object type", type);
2353 return error_mark_node;
2355 else if (TREE_CODE (pointer) == ADDR_EXPR
2356 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2357 /* The POINTER was something like `&x'. We simplify `*&x' to
2359 return TREE_OPERAND (pointer, 0);
2362 tree ref = build1 (INDIRECT_REF, t, pointer);
2364 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2365 so that we get the proper error message if the result is used
2366 to assign to. Also, &* is supposed to be a no-op. */
2367 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2368 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2369 TREE_SIDE_EFFECTS (ref)
2370 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2374 /* `pointer' won't be an error_mark_node if we were given a
2375 pointer to member, so it's cool to check for this here. */
2376 else if (TYPE_PTR_TO_MEMBER_P (type))
2377 error ("invalid use of %qs on pointer to member", errorstring);
2378 else if (pointer != error_mark_node)
2381 error ("invalid type argument of %qs", errorstring);
2383 error ("invalid type argument");
2385 return error_mark_node;
2388 /* This handles expressions of the form "a[i]", which denotes
2391 This is logically equivalent in C to *(a+i), but we may do it differently.
2392 If A is a variable or a member, we generate a primitive ARRAY_REF.
2393 This avoids forcing the array out of registers, and can work on
2394 arrays that are not lvalues (for example, members of structures returned
2397 If INDEX is of some user-defined type, it must be converted to
2398 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2399 will inherit the type of the array, which will be some pointer type. */
2402 build_array_ref (tree array, tree idx)
2406 error ("subscript missing in array reference");
2407 return error_mark_node;
2410 if (TREE_TYPE (array) == error_mark_node
2411 || TREE_TYPE (idx) == error_mark_node)
2412 return error_mark_node;
2414 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2416 switch (TREE_CODE (array))
2420 tree value = build_array_ref (TREE_OPERAND (array, 1), idx);
2421 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2422 TREE_OPERAND (array, 0), value);
2426 return build_conditional_expr
2427 (TREE_OPERAND (array, 0),
2428 build_array_ref (TREE_OPERAND (array, 1), idx),
2429 build_array_ref (TREE_OPERAND (array, 2), idx));
2435 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2439 warn_array_subscript_with_type_char (idx);
2441 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2443 error ("array subscript is not an integer");
2444 return error_mark_node;
2447 /* Apply integral promotions *after* noticing character types.
2448 (It is unclear why we do these promotions -- the standard
2449 does not say that we should. In fact, the natural thing would
2450 seem to be to convert IDX to ptrdiff_t; we're performing
2451 pointer arithmetic.) */
2452 idx = perform_integral_promotions (idx);
2454 /* An array that is indexed by a non-constant
2455 cannot be stored in a register; we must be able to do
2456 address arithmetic on its address.
2457 Likewise an array of elements of variable size. */
2458 if (TREE_CODE (idx) != INTEGER_CST
2459 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2460 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2463 if (!cxx_mark_addressable (array))
2464 return error_mark_node;
2467 /* An array that is indexed by a constant value which is not within
2468 the array bounds cannot be stored in a register either; because we
2469 would get a crash in store_bit_field/extract_bit_field when trying
2470 to access a non-existent part of the register. */
2471 if (TREE_CODE (idx) == INTEGER_CST
2472 && TYPE_DOMAIN (TREE_TYPE (array))
2473 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2475 if (!cxx_mark_addressable (array))
2476 return error_mark_node;
2479 if (pedantic && !lvalue_p (array))
2480 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2482 /* Note in C++ it is valid to subscript a `register' array, since
2483 it is valid to take the address of something with that
2484 storage specification. */
2488 while (TREE_CODE (foo) == COMPONENT_REF)
2489 foo = TREE_OPERAND (foo, 0);
2490 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2491 warning (OPT_Wextra, "subscripting array declared %<register%>");
2494 type = TREE_TYPE (TREE_TYPE (array));
2495 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2496 /* Array ref is const/volatile if the array elements are
2497 or if the array is.. */
2498 TREE_READONLY (rval)
2499 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2500 TREE_SIDE_EFFECTS (rval)
2501 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2502 TREE_THIS_VOLATILE (rval)
2503 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2504 return require_complete_type (fold_if_not_in_template (rval));
2508 tree ar = default_conversion (array);
2509 tree ind = default_conversion (idx);
2511 /* Put the integer in IND to simplify error checking. */
2512 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2519 if (ar == error_mark_node)
2522 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2524 error ("subscripted value is neither array nor pointer");
2525 return error_mark_node;
2527 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2529 error ("array subscript is not an integer");
2530 return error_mark_node;
2533 warn_array_subscript_with_type_char (idx);
2535 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR, ar, ind),
2540 /* Resolve a pointer to member function. INSTANCE is the object
2541 instance to use, if the member points to a virtual member.
2543 This used to avoid checking for virtual functions if basetype
2544 has no virtual functions, according to an earlier ANSI draft.
2545 With the final ISO C++ rules, such an optimization is
2546 incorrect: A pointer to a derived member can be static_cast
2547 to pointer-to-base-member, as long as the dynamic object
2548 later has the right member. */
2551 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2553 if (TREE_CODE (function) == OFFSET_REF)
2554 function = TREE_OPERAND (function, 1);
2556 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2558 tree idx, delta, e1, e2, e3, vtbl, basetype;
2559 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2561 tree instance_ptr = *instance_ptrptr;
2562 tree instance_save_expr = 0;
2563 if (instance_ptr == error_mark_node)
2565 if (TREE_CODE (function) == PTRMEM_CST)
2567 /* Extracting the function address from a pmf is only
2568 allowed with -Wno-pmf-conversions. It only works for
2570 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2571 e1 = convert (fntype, e1);
2576 error ("object missing in use of %qE", function);
2577 return error_mark_node;
2581 if (TREE_SIDE_EFFECTS (instance_ptr))
2582 instance_ptr = instance_save_expr = save_expr (instance_ptr);
2584 if (TREE_SIDE_EFFECTS (function))
2585 function = save_expr (function);
2587 /* Start by extracting all the information from the PMF itself. */
2588 e3 = pfn_from_ptrmemfunc (function);
2589 delta = build_ptrmemfunc_access_expr (function, delta_identifier);
2590 idx = build1 (NOP_EXPR, vtable_index_type, e3);
2591 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
2593 case ptrmemfunc_vbit_in_pfn:
2594 e1 = cp_build_binary_op (BIT_AND_EXPR, idx, integer_one_node);
2595 idx = cp_build_binary_op (MINUS_EXPR, idx, integer_one_node);
2598 case ptrmemfunc_vbit_in_delta:
2599 e1 = cp_build_binary_op (BIT_AND_EXPR, delta, integer_one_node);
2600 delta = cp_build_binary_op (RSHIFT_EXPR, delta, integer_one_node);
2607 /* Convert down to the right base before using the instance. A
2608 special case is that in a pointer to member of class C, C may
2609 be incomplete. In that case, the function will of course be
2610 a member of C, and no conversion is required. In fact,
2611 lookup_base will fail in that case, because incomplete
2612 classes do not have BINFOs. */
2613 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2614 if (!same_type_ignoring_top_level_qualifiers_p
2615 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
2617 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
2618 basetype, ba_check, NULL);
2619 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
2621 if (instance_ptr == error_mark_node)
2622 return error_mark_node;
2624 /* ...and then the delta in the PMF. */
2625 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
2626 instance_ptr, fold_convert (sizetype, delta));
2628 /* Hand back the adjusted 'this' argument to our caller. */
2629 *instance_ptrptr = instance_ptr;
2631 /* Next extract the vtable pointer from the object. */
2632 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
2634 vtbl = build_indirect_ref (vtbl, NULL);
2636 /* Finally, extract the function pointer from the vtable. */
2637 e2 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
2638 fold_convert (sizetype, idx));
2639 e2 = build_indirect_ref (e2, NULL);
2640 TREE_CONSTANT (e2) = 1;
2641 TREE_INVARIANT (e2) = 1;
2643 /* When using function descriptors, the address of the
2644 vtable entry is treated as a function pointer. */
2645 if (TARGET_VTABLE_USES_DESCRIPTORS)
2646 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
2647 build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1));
2649 TREE_TYPE (e2) = TREE_TYPE (e3);
2650 e1 = build_conditional_expr (e1, e2, e3);
2652 /* Make sure this doesn't get evaluated first inside one of the
2653 branches of the COND_EXPR. */
2654 if (instance_save_expr)
2655 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
2656 instance_save_expr, e1);
2664 build_function_call (tree function, tree params)
2666 tree fntype, fndecl;
2667 tree name = NULL_TREE;
2669 tree original = function;
2670 int nargs, parm_types_len;
2674 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2675 expressions, like those used for ObjC messenger dispatches. */
2676 function = objc_rewrite_function_call (function, params);
2678 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2679 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2680 if (TREE_CODE (function) == NOP_EXPR
2681 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2682 function = TREE_OPERAND (function, 0);
2684 if (TREE_CODE (function) == FUNCTION_DECL)
2686 name = DECL_NAME (function);
2688 mark_used (function);
2691 /* Convert anything with function type to a pointer-to-function. */
2692 if (pedantic && DECL_MAIN_P (function))
2693 pedwarn ("ISO C++ forbids calling %<::main%> from within program");
2695 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2696 (because calling an inline function does not mean the function
2697 needs to be separately compiled). */
2699 if (DECL_INLINE (function))
2700 function = inline_conversion (function);
2702 function = build_addr_func (function);
2708 function = build_addr_func (function);
2711 if (function == error_mark_node)
2712 return error_mark_node;
2714 fntype = TREE_TYPE (function);
2716 if (TYPE_PTRMEMFUNC_P (fntype))
2718 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2719 "function in %<%E (...)%>",
2721 return error_mark_node;
2724 is_method = (TREE_CODE (fntype) == POINTER_TYPE
2725 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
2727 if (!((TREE_CODE (fntype) == POINTER_TYPE
2728 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
2730 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
2732 error ("%qE cannot be used as a function", original);
2733 return error_mark_node;
2736 /* fntype now gets the type of function pointed to. */
2737 fntype = TREE_TYPE (fntype);
2738 parm_types = TYPE_ARG_TYPES (fntype);
2740 /* Allocate storage for converted arguments. */
2741 parm_types_len = list_length (parm_types);
2742 nargs = list_length (params);
2743 if (parm_types_len > nargs)
2744 nargs = parm_types_len;
2745 argarray = (tree *) alloca (nargs * sizeof (tree));
2747 /* Convert the parameters to the types declared in the
2748 function prototype, or apply default promotions. */
2749 nargs = convert_arguments (nargs, argarray, parm_types,
2750 params, fndecl, LOOKUP_NORMAL);
2752 return error_mark_node;
2754 /* Check for errors in format strings and inappropriately
2757 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2760 return build_cxx_call (function, nargs, argarray);
2763 /* Convert the actual parameter expressions in the list VALUES
2764 to the types in the list TYPELIST.
2765 If parmdecls is exhausted, or when an element has NULL as its type,
2766 perform the default conversions.
2768 Store the converted arguments in ARGARRAY. NARGS is the size of this array.
2770 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2772 This is also where warnings about wrong number of args are generated.
2774 Returns the actual number of arguments processed (which might be less
2775 than NARGS), or -1 on error.
2777 VALUES is a chain of TREE_LIST nodes with the elements of the list
2778 in the TREE_VALUE slots of those nodes.
2780 In C++, unspecified trailing parameters can be filled in with their
2781 default arguments, if such were specified. Do so here. */
2784 convert_arguments (int nargs, tree *argarray,
2785 tree typelist, tree values, tree fndecl, int flags)
2787 tree typetail, valtail;
2788 const char *called_thing = 0;
2791 /* Argument passing is always copy-initialization. */
2792 flags |= LOOKUP_ONLYCONVERTING;
2796 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
2798 if (DECL_NAME (fndecl) == NULL_TREE
2799 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
2800 called_thing = "constructor";
2802 called_thing = "member function";
2805 called_thing = "function";
2808 for (valtail = values, typetail = typelist;
2810 valtail = TREE_CHAIN (valtail), i++)
2812 tree type = typetail ? TREE_VALUE (typetail) : 0;
2813 tree val = TREE_VALUE (valtail);
2815 if (val == error_mark_node || type == error_mark_node)
2818 if (type == void_type_node)
2822 error ("too many arguments to %s %q+#D", called_thing, fndecl);
2823 error ("at this point in file");
2826 error ("too many arguments to function");
2830 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2831 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2832 if (TREE_CODE (val) == NOP_EXPR
2833 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
2834 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
2835 val = TREE_OPERAND (val, 0);
2837 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
2839 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
2840 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
2841 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
2842 val = decay_conversion (val);
2845 if (val == error_mark_node)
2850 /* Formal parm type is specified by a function prototype. */
2853 if (!COMPLETE_TYPE_P (complete_type (type)))
2856 error ("parameter %P of %qD has incomplete type %qT",
2859 error ("parameter %P has incomplete type %qT", i, type);
2860 parmval = error_mark_node;
2864 parmval = convert_for_initialization
2865 (NULL_TREE, type, val, flags,
2866 "argument passing", fndecl, i);
2867 parmval = convert_for_arg_passing (type, parmval);
2870 if (parmval == error_mark_node)
2873 argarray[i] = parmval;
2877 if (fndecl && DECL_BUILT_IN (fndecl)
2878 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
2879 /* Don't do ellipsis conversion for __built_in_constant_p
2880 as this will result in spurious warnings for non-POD
2882 val = require_complete_type (val);
2884 val = convert_arg_to_ellipsis (val);
2890 typetail = TREE_CHAIN (typetail);
2893 if (typetail != 0 && typetail != void_list_node)
2895 /* See if there are default arguments that can be used. Because
2896 we hold default arguments in the FUNCTION_TYPE (which is so
2897 wrong), we can see default parameters here from deduced
2898 contexts (and via typeof) for indirect function calls.
2899 Fortunately we know whether we have a function decl to
2900 provide default arguments in a language conformant
2902 if (fndecl && TREE_PURPOSE (typetail)
2903 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
2905 for (; typetail != void_list_node; ++i)
2908 = convert_default_arg (TREE_VALUE (typetail),
2909 TREE_PURPOSE (typetail),
2912 if (parmval == error_mark_node)
2915 argarray[i] = parmval;
2916 typetail = TREE_CHAIN (typetail);
2917 /* ends with `...'. */
2918 if (typetail == NULL_TREE)
2926 error ("too few arguments to %s %q+#D", called_thing, fndecl);
2927 error ("at this point in file");
2930 error ("too few arguments to function");
2935 gcc_assert (i <= nargs);
2939 /* Build a binary-operation expression, after performing default
2940 conversions on the operands. CODE is the kind of expression to
2941 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
2942 are the tree codes which correspond to ARG1 and ARG2 when issuing
2943 warnings about possibly misplaced parentheses. They may differ
2944 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
2945 folding (e.g., if the parser sees "a | 1 + 1", it may call this
2946 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
2947 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
2948 ARG2_CODE as ERROR_MARK. */
2951 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
2952 tree arg2, enum tree_code arg2_code, bool *overloaded_p)
2961 if (processing_template_decl)
2963 if (type_dependent_expression_p (arg1)
2964 || type_dependent_expression_p (arg2))
2965 return build_min_nt (code, arg1, arg2);
2966 arg1 = build_non_dependent_expr (arg1);
2967 arg2 = build_non_dependent_expr (arg2);
2970 if (code == DOTSTAR_EXPR)
2971 expr = build_m_component_ref (arg1, arg2);
2973 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
2976 /* Check for cases such as x+y<<z which users are likely to
2977 misinterpret. But don't warn about obj << x + y, since that is a
2978 common idiom for I/O. */
2979 if (warn_parentheses
2980 && !processing_template_decl
2981 && !error_operand_p (arg1)
2982 && !error_operand_p (arg2)
2983 && (code != LSHIFT_EXPR
2984 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
2985 warn_about_parentheses (code, arg1_code, arg2_code);
2987 if (processing_template_decl && expr != error_mark_node)
2988 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
2993 /* Build a binary-operation expression without default conversions.
2994 CODE is the kind of expression to build.
2995 This function differs from `build' in several ways:
2996 the data type of the result is computed and recorded in it,
2997 warnings are generated if arg data types are invalid,
2998 special handling for addition and subtraction of pointers is known,
2999 and some optimization is done (operations on narrow ints
3000 are done in the narrower type when that gives the same result).
3001 Constant folding is also done before the result is returned.
3003 Note that the operands will never have enumeral types
3004 because either they have just had the default conversions performed
3005 or they have both just been converted to some other type in which
3006 the arithmetic is to be done.
3008 C++: must do special pointer arithmetic when implementing
3009 multiple inheritance, and deal with pointer to member functions. */
3012 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
3013 int convert_p ATTRIBUTE_UNUSED)
3016 enum tree_code code0, code1;
3018 const char *invalid_op_diag;
3020 /* Expression code to give to the expression when it is built.
3021 Normally this is CODE, which is what the caller asked for,
3022 but in some special cases we change it. */
3023 enum tree_code resultcode = code;
3025 /* Data type in which the computation is to be performed.
3026 In the simplest cases this is the common type of the arguments. */
3027 tree result_type = NULL;
3029 /* Nonzero means operands have already been type-converted
3030 in whatever way is necessary.
3031 Zero means they need to be converted to RESULT_TYPE. */
3034 /* Nonzero means create the expression with this type, rather than
3036 tree build_type = 0;
3038 /* Nonzero means after finally constructing the expression
3039 convert it to this type. */
3040 tree final_type = 0;
3044 /* Nonzero if this is an operation like MIN or MAX which can
3045 safely be computed in short if both args are promoted shorts.
3046 Also implies COMMON.
3047 -1 indicates a bitwise operation; this makes a difference
3048 in the exact conditions for when it is safe to do the operation
3049 in a narrower mode. */
3052 /* Nonzero if this is a comparison operation;
3053 if both args are promoted shorts, compare the original shorts.
3054 Also implies COMMON. */
3055 int short_compare = 0;
3057 /* Nonzero if this is a right-shift operation, which can be computed on the
3058 original short and then promoted if the operand is a promoted short. */
3059 int short_shift = 0;
3061 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3064 /* True if both operands have arithmetic type. */
3065 bool arithmetic_types_p;
3067 /* Apply default conversions. */
3071 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3072 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3073 || code == TRUTH_XOR_EXPR)
3075 if (!really_overloaded_fn (op0))
3076 op0 = decay_conversion (op0);
3077 if (!really_overloaded_fn (op1))
3078 op1 = decay_conversion (op1);
3082 if (!really_overloaded_fn (op0))
3083 op0 = default_conversion (op0);
3084 if (!really_overloaded_fn (op1))
3085 op1 = default_conversion (op1);
3088 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3089 STRIP_TYPE_NOPS (op0);
3090 STRIP_TYPE_NOPS (op1);
3092 /* DTRT if one side is an overloaded function, but complain about it. */
3093 if (type_unknown_p (op0))
3095 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3096 if (t != error_mark_node)
3098 pedwarn ("assuming cast to type %qT from overloaded function",
3103 if (type_unknown_p (op1))
3105 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3106 if (t != error_mark_node)
3108 pedwarn ("assuming cast to type %qT from overloaded function",
3114 type0 = TREE_TYPE (op0);
3115 type1 = TREE_TYPE (op1);
3117 /* The expression codes of the data types of the arguments tell us
3118 whether the arguments are integers, floating, pointers, etc. */
3119 code0 = TREE_CODE (type0);
3120 code1 = TREE_CODE (type1);
3122 /* If an error was already reported for one of the arguments,
3123 avoid reporting another error. */
3125 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3126 return error_mark_node;
3128 if ((invalid_op_diag
3129 = targetm.invalid_binary_op (code, type0, type1)))
3131 error (invalid_op_diag);
3132 return error_mark_node;
3138 /* Subtraction of two similar pointers.
3139 We must subtract them as integers, then divide by object size. */
3140 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3141 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3143 return pointer_diff (op0, op1, common_type (type0, type1));
3144 /* In all other cases except pointer - int, the usual arithmetic
3146 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3151 /* The pointer - int case is just like pointer + int; fall
3154 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3155 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3159 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3160 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3161 if (processing_template_decl)
3163 result_type = TREE_TYPE (ptr_operand);
3166 return cp_pointer_int_sum (code,
3177 case TRUNC_DIV_EXPR:
3179 case FLOOR_DIV_EXPR:
3180 case ROUND_DIV_EXPR:
3181 case EXACT_DIV_EXPR:
3182 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3183 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3184 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3185 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3187 enum tree_code tcode0 = code0, tcode1 = code1;
3189 warn_for_div_by_zero (op1);
3191 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3192 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3193 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3194 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3196 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3197 resultcode = RDIV_EXPR;
3199 /* When dividing two signed integers, we have to promote to int.
3200 unless we divide by a constant != -1. Note that default
3201 conversion will have been performed on the operands at this
3202 point, so we have to dig out the original type to find out if
3204 shorten = ((TREE_CODE (op0) == NOP_EXPR
3205 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3206 || (TREE_CODE (op1) == INTEGER_CST
3207 && ! integer_all_onesp (op1)));
3216 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3217 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE))
3221 case TRUNC_MOD_EXPR:
3222 case FLOOR_MOD_EXPR:
3223 warn_for_div_by_zero (op1);
3225 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3227 /* Although it would be tempting to shorten always here, that loses
3228 on some targets, since the modulo instruction is undefined if the
3229 quotient can't be represented in the computation mode. We shorten
3230 only if unsigned or if dividing by something we know != -1. */
3231 shorten = ((TREE_CODE (op0) == NOP_EXPR
3232 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3233 || (TREE_CODE (op1) == INTEGER_CST
3234 && ! integer_all_onesp (op1)));
3239 case TRUTH_ANDIF_EXPR:
3240 case TRUTH_ORIF_EXPR:
3241 case TRUTH_AND_EXPR:
3243 result_type = boolean_type_node;
3246 /* Shift operations: result has same type as first operand;
3247 always convert second operand to int.
3248 Also set SHORT_SHIFT if shifting rightward. */
3251 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3253 result_type = type0;
3254 if (TREE_CODE (op1) == INTEGER_CST)
3256 if (tree_int_cst_lt (op1, integer_zero_node))
3257 warning (0, "right shift count is negative");
3260 if (! integer_zerop (op1))
3262 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3263 warning (0, "right shift count >= width of type");
3266 /* Convert the shift-count to an integer, regardless of
3267 size of value being shifted. */
3268 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3269 op1 = cp_convert (integer_type_node, op1);
3270 /* Avoid converting op1 to result_type later. */
3276 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3278 result_type = type0;
3279 if (TREE_CODE (op1) == INTEGER_CST)
3281 if (tree_int_cst_lt (op1, integer_zero_node))
3282 warning (0, "left shift count is negative");
3283 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3284 warning (0, "left shift count >= width of type");
3286 /* Convert the shift-count to an integer, regardless of
3287 size of value being shifted. */
3288 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3289 op1 = cp_convert (integer_type_node, op1);
3290 /* Avoid converting op1 to result_type later. */
3297 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3299 result_type = type0;
3300 if (TREE_CODE (op1) == INTEGER_CST)
3302 if (tree_int_cst_lt (op1, integer_zero_node))
3303 warning (0, (code == LROTATE_EXPR)
3304 ? G_("left rotate count is negative")
3305 : G_("right rotate count is negative"));
3306 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3307 warning (0, (code == LROTATE_EXPR)
3308 ? G_("left rotate count >= width of type")
3309 : G_("right rotate count >= width of type"));
3311 /* Convert the shift-count to an integer, regardless of
3312 size of value being shifted. */
3313 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3314 op1 = cp_convert (integer_type_node, op1);
3320 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
3321 warning (OPT_Wfloat_equal,
3322 "comparing floating point with == or != is unsafe");
3323 if ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3324 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0)))
3325 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3327 build_type = boolean_type_node;
3328 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3329 || code0 == COMPLEX_TYPE)
3330 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3331 || code1 == COMPLEX_TYPE))
3333 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3334 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3335 result_type = composite_pointer_type (type0, type1, op0, op1,
3337 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3338 && null_ptr_cst_p (op1))
3340 if (TREE_CODE (op0) == ADDR_EXPR
3341 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3342 warning (OPT_Waddress, "the address of %qD will never be NULL",
3343 TREE_OPERAND (op0, 0));
3344 result_type = type0;
3346 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3347 && null_ptr_cst_p (op0))
3349 if (TREE_CODE (op1) == ADDR_EXPR
3350 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3351 warning (OPT_Waddress, "the address of %qD will never be NULL",
3352 TREE_OPERAND (op1, 0));
3353 result_type = type1;
3355 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3357 result_type = type0;
3358 error ("ISO C++ forbids comparison between pointer and integer");
3360 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3362 result_type = type1;
3363 error ("ISO C++ forbids comparison between pointer and integer");
3365 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3367 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3368 == ptrmemfunc_vbit_in_delta)
3370 tree pfn0 = pfn_from_ptrmemfunc (op0);
3371 tree delta0 = build_ptrmemfunc_access_expr (op0,
3373 tree e1 = cp_build_binary_op (EQ_EXPR,
3375 fold_convert (TREE_TYPE (pfn0),
3376 integer_zero_node));
3377 tree e2 = cp_build_binary_op (BIT_AND_EXPR,
3380 e2 = cp_build_binary_op (EQ_EXPR, e2, integer_zero_node);
3381 op0 = cp_build_binary_op (TRUTH_ANDIF_EXPR, e1, e2);
3382 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
3386 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
3387 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3389 result_type = TREE_TYPE (op0);
3391 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3392 return cp_build_binary_op (code, op1, op0);
3393 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1)
3394 && same_type_p (type0, type1))
3396 /* E will be the final comparison. */
3398 /* E1 and E2 are for scratch. */
3406 if (TREE_SIDE_EFFECTS (op0))
3407 op0 = save_expr (op0);
3408 if (TREE_SIDE_EFFECTS (op1))
3409 op1 = save_expr (op1);
3411 pfn0 = pfn_from_ptrmemfunc (op0);
3412 pfn1 = pfn_from_ptrmemfunc (op1);
3413 delta0 = build_ptrmemfunc_access_expr (op0,
3415 delta1 = build_ptrmemfunc_access_expr (op1,
3417 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3418 == ptrmemfunc_vbit_in_delta)
3423 && ((op0.delta == op1.delta)
3424 || (!op0.pfn && op0.delta & 1 == 0
3425 && op1.delta & 1 == 0))
3427 The reason for the `!op0.pfn' bit is that a NULL
3428 pointer-to-member is any member with a zero PFN and
3429 LSB of the DELTA field is 0. */
3431 e1 = cp_build_binary_op (BIT_AND_EXPR,
3434 e1 = cp_build_binary_op (EQ_EXPR, e1, integer_zero_node);
3435 e2 = cp_build_binary_op (BIT_AND_EXPR,
3438 e2 = cp_build_binary_op (EQ_EXPR, e2, integer_zero_node);
3439 e1 = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1);
3440 e2 = cp_build_binary_op (EQ_EXPR,
3442 fold_convert (TREE_TYPE (pfn0),
3443 integer_zero_node));
3444 e2 = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1);
3445 e1 = cp_build_binary_op (EQ_EXPR, delta0, delta1);
3446 e1 = cp_build_binary_op (TRUTH_ORIF_EXPR, e1, e2);
3453 && (!op0.pfn || op0.delta == op1.delta))
3455 The reason for the `!op0.pfn' bit is that a NULL
3456 pointer-to-member is any member with a zero PFN; the
3457 DELTA field is unspecified. */
3459 e1 = cp_build_binary_op (EQ_EXPR, delta0, delta1);
3460 e2 = cp_build_binary_op (EQ_EXPR,
3462 fold_convert (TREE_TYPE (pfn0),
3463 integer_zero_node));
3464 e1 = cp_build_binary_op (TRUTH_ORIF_EXPR, e1, e2);
3466 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3467 e = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1);
3468 if (code == EQ_EXPR)
3470 return cp_build_binary_op (EQ_EXPR, e, integer_zero_node);
3474 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
3475 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
3477 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
3478 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
3486 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3487 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3489 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3490 result_type = composite_pointer_type (type0, type1, op0, op1,
3498 if (TREE_CODE (orig_op0) == STRING_CST
3499 || TREE_CODE (orig_op1) == STRING_CST)
3500 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3502 build_type = boolean_type_node;
3503 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3504 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3506 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3507 result_type = composite_pointer_type (type0, type1, op0, op1,
3509 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3510 && integer_zerop (op1))
3511 result_type = type0;
3512 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3513 && integer_zerop (op0))
3514 result_type = type1;
3515 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3517 result_type = type0;
3518 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3520 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3522 result_type = type1;
3523 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3527 case UNORDERED_EXPR:
3534 build_type = integer_type_node;
3535 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
3537 error ("unordered comparison on non-floating point argument");
3538 return error_mark_node;
3547 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
3548 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3549 || code1 == COMPLEX_TYPE)))
3550 arithmetic_types_p = 1;
3553 arithmetic_types_p = 0;
3554 /* Vector arithmetic is only allowed when both sides are vectors. */
3555 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
3557 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
3558 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
3561 binary_op_error (code, type0, type1);
3562 return error_mark_node;
3564 arithmetic_types_p = 1;
3567 /* Determine the RESULT_TYPE, if it is not already known. */
3569 && arithmetic_types_p
3570 && (shorten || common || short_compare))
3571 result_type = common_type (type0, type1);
3575 error ("invalid operands of types %qT and %qT to binary %qO",
3576 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
3577 return error_mark_node;
3580 /* If we're in a template, the only thing we need to know is the
3582 if (processing_template_decl)
3584 /* Since the middle-end checks the type when doing a build2, we
3585 need to build the tree in pieces. This built tree will never
3586 get out of the front-end as we replace it when instantiating
3588 tree tmp = build2 (resultcode,
3589 build_type ? build_type : result_type,
3591 TREE_OPERAND (tmp, 0) = op0;
3595 if (arithmetic_types_p)
3597 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
3599 /* For certain operations (which identify themselves by shorten != 0)
3600 if both args were extended from the same smaller type,
3601 do the arithmetic in that type and then extend.
3603 shorten !=0 and !=1 indicates a bitwise operation.
3604 For them, this optimization is safe only if
3605 both args are zero-extended or both are sign-extended.
3606 Otherwise, we might change the result.
3607 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3608 but calculated in (unsigned short) it would be (unsigned short)-1. */
3610 if (shorten && none_complex)
3612 int unsigned0, unsigned1;
3613 tree arg0 = get_narrower (op0, &unsigned0);
3614 tree arg1 = get_narrower (op1, &unsigned1);
3615 /* UNS is 1 if the operation to be done is an unsigned one. */
3616 int uns = TYPE_UNSIGNED (result_type);
3619 final_type = result_type;
3621 /* Handle the case that OP0 does not *contain* a conversion
3622 but it *requires* conversion to FINAL_TYPE. */
3624 if (op0 == arg0 && TREE_TYPE (op0) != final_type)
3625 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
3626 if (op1 == arg1 && TREE_TYPE (op1) != final_type)
3627 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
3629 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3631 /* For bitwise operations, signedness of nominal type
3632 does not matter. Consider only how operands were extended. */
3636 /* Note that in all three cases below we refrain from optimizing
3637 an unsigned operation on sign-extended args.
3638 That would not be valid. */
3640 /* Both args variable: if both extended in same way
3641 from same width, do it in that width.
3642 Do it unsigned if args were zero-extended. */
3643 if ((TYPE_PRECISION (TREE_TYPE (arg0))
3644 < TYPE_PRECISION (result_type))
3645 && (TYPE_PRECISION (TREE_TYPE (arg1))
3646 == TYPE_PRECISION (TREE_TYPE (arg0)))
3647 && unsigned0 == unsigned1
3648 && (unsigned0 || !uns))
3649 result_type = c_common_signed_or_unsigned_type
3650 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
3651 else if (TREE_CODE (arg0) == INTEGER_CST
3652 && (unsigned1 || !uns)
3653 && (TYPE_PRECISION (TREE_TYPE (arg1))
3654 < TYPE_PRECISION (result_type))
3655 && (type = c_common_signed_or_unsigned_type
3656 (unsigned1, TREE_TYPE (arg1)),
3657 int_fits_type_p (arg0, type)))
3659 else if (TREE_CODE (arg1) == INTEGER_CST
3660 && (unsigned0 || !uns)
3661 && (TYPE_PRECISION (TREE_TYPE (arg0))
3662 < TYPE_PRECISION (result_type))
3663 && (type = c_common_signed_or_unsigned_type
3664 (unsigned0, TREE_TYPE (arg0)),
3665 int_fits_type_p (arg1, type)))
3669 /* Shifts can be shortened if shifting right. */
3674 tree arg0 = get_narrower (op0, &unsigned_arg);
3676 final_type = result_type;
3678 if (arg0 == op0 && final_type == TREE_TYPE (op0))
3679 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
3681 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
3682 /* We can shorten only if the shift count is less than the
3683 number of bits in the smaller type size. */
3684 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
3685 /* If arg is sign-extended and then unsigned-shifted,
3686 we can simulate this with a signed shift in arg's type
3687 only if the extended result is at least twice as wide
3688 as the arg. Otherwise, the shift could use up all the
3689 ones made by sign-extension and bring in zeros.
3690 We can't optimize that case at all, but in most machines
3691 it never happens because available widths are 2**N. */
3692 && (!TYPE_UNSIGNED (final_type)
3694 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0)))
3695 <= TYPE_PRECISION (result_type))))
3697 /* Do an unsigned shift if the operand was zero-extended. */
3699 = c_common_signed_or_unsigned_type (unsigned_arg,
3701 /* Convert value-to-be-shifted to that type. */
3702 if (TREE_TYPE (op0) != result_type)
3703 op0 = cp_convert (result_type, op0);
3708 /* Comparison operations are shortened too but differently.
3709 They identify themselves by setting short_compare = 1. */
3713 /* Don't write &op0, etc., because that would prevent op0
3714 from being kept in a register.
3715 Instead, make copies of the our local variables and
3716 pass the copies by reference, then copy them back afterward. */
3717 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3718 enum tree_code xresultcode = resultcode;
3720 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3722 return cp_convert (boolean_type_node, val);
3723 op0 = xop0, op1 = xop1;
3725 resultcode = xresultcode;
3728 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
3729 && warn_sign_compare
3730 /* Do not warn until the template is instantiated; we cannot
3731 bound the ranges of the arguments until that point. */
3732 && !processing_template_decl)
3734 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
3735 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3737 int unsignedp0, unsignedp1;
3738 tree primop0 = get_narrower (op0, &unsignedp0);
3739 tree primop1 = get_narrower (op1, &unsignedp1);
3741 /* Check for comparison of different enum types. */
3742 if (TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
3743 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
3744 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
3745 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
3747 warning (0, "comparison between types %q#T and %q#T",
3748 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
3751 /* Give warnings for comparisons between signed and unsigned
3752 quantities that may fail. */
3753 /* Do the checking based on the original operand trees, so that
3754 casts will be considered, but default promotions won't be. */
3756 /* Do not warn if the comparison is being done in a signed type,
3757 since the signed type will only be chosen if it can represent
3758 all the values of the unsigned type. */
3759 if (!TYPE_UNSIGNED (result_type))
3761 /* Do not warn if both operands are unsigned. */
3762 else if (op0_signed == op1_signed)
3764 /* Do not warn if the signed quantity is an unsuffixed
3765 integer literal (or some static constant expression
3766 involving such literals or a conditional expression
3767 involving such literals) and it is non-negative. */
3768 else if ((op0_signed && tree_expr_nonnegative_p (orig_op0))
3769 || (op1_signed && tree_expr_nonnegative_p (orig_op1)))
3771 /* Do not warn if the comparison is an equality operation,
3772 the unsigned quantity is an integral constant and it does
3773 not use the most significant bit of result_type. */
3774 else if ((resultcode == EQ_EXPR || resultcode == NE_EXPR)
3775 && ((op0_signed && TREE_CODE (orig_op1) == INTEGER_CST
3776 && int_fits_type_p (orig_op1, c_common_signed_type
3778 || (op1_signed && TREE_CODE (orig_op0) == INTEGER_CST
3779 && int_fits_type_p (orig_op0, c_common_signed_type
3783 warning (0, "comparison between signed and unsigned integer expressions");
3785 /* Warn if two unsigned values are being compared in a size
3786 larger than their original size, and one (and only one) is the
3787 result of a `~' operator. This comparison will always fail.
3789 Also warn if one operand is a constant, and the constant does not
3790 have all bits set that are set in the ~ operand when it is
3793 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
3794 ^ (TREE_CODE (primop1) == BIT_NOT_EXPR))
3796 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
3797 primop0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
3798 if (TREE_CODE (primop1) == BIT_NOT_EXPR)
3799 primop1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
3801 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
3804 HOST_WIDE_INT constant, mask;
3808 if (host_integerp (primop0, 0))
3811 unsignedp = unsignedp1;
3812 constant = tree_low_cst (primop0, 0);
3817 unsignedp = unsignedp0;
3818 constant = tree_low_cst (primop1, 0);
3821 bits = TYPE_PRECISION (TREE_TYPE (primop));
3822 if (bits < TYPE_PRECISION (result_type)
3823 && bits < HOST_BITS_PER_LONG && unsignedp)
3825 mask = (~ (HOST_WIDE_INT) 0) << bits;
3826 if ((mask & constant) != mask)
3827 warning (0, "comparison of promoted ~unsigned with constant");
3830 else if (unsignedp0 && unsignedp1
3831 && (TYPE_PRECISION (TREE_TYPE (primop0))
3832 < TYPE_PRECISION (result_type))
3833 && (TYPE_PRECISION (TREE_TYPE (primop1))
3834 < TYPE_PRECISION (result_type)))
3835 warning (0, "comparison of promoted ~unsigned with unsigned");
3840 /* Issue warnings about peculiar, but valid, uses of NULL. */
3841 if ((orig_op0 == null_node || orig_op1 == null_node)
3842 /* It's reasonable to use pointer values as operands of &&
3843 and ||, so NULL is no exception. */
3844 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3845 && ( /* Both are NULL (or 0) and the operation was not a comparison. */
3846 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3847 && code != EQ_EXPR && code != NE_EXPR)
3848 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3849 || (!null_ptr_cst_p (orig_op0) && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE)
3850 || (!null_ptr_cst_p (orig_op1) && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE)))
3851 /* Some sort of arithmetic operation involving NULL was
3852 performed. Note that pointer-difference and pointer-addition
3853 have already been handled above, and so we don't end up here in
3855 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3858 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3859 Then the expression will be built.
3860 It will be given type FINAL_TYPE if that is nonzero;
3861 otherwise, it will be given type RESULT_TYPE. */
3864 if (TREE_TYPE (op0) != result_type)
3865 op0 = cp_convert_and_check (result_type, op0);
3866 if (TREE_TYPE (op1) != result_type)
3867 op1 = cp_convert_and_check (result_type, op1);
3869 if (op0 == error_mark_node || op1 == error_mark_node)
3870 return error_mark_node;
3873 if (build_type == NULL_TREE)
3874 build_type = result_type;
3876 result = build2 (resultcode, build_type, op0, op1);
3877 result = fold_if_not_in_template (result);
3878 if (final_type != 0)
3879 result = cp_convert (final_type, result);
3881 if (TREE_OVERFLOW_P (result)
3882 && !TREE_OVERFLOW_P (op0)
3883 && !TREE_OVERFLOW_P (op1))
3884 overflow_warning (result);
3889 /* Return a tree for the sum or difference (RESULTCODE says which)
3890 of pointer PTROP and integer INTOP. */
3893 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
3895 tree res_type = TREE_TYPE (ptrop);
3897 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3898 in certain circumstance (when it's valid to do so). So we need
3899 to make sure it's complete. We don't need to check here, if we
3900 can actually complete it at all, as those checks will be done in
3901 pointer_int_sum() anyway. */
3902 complete_type (TREE_TYPE (res_type));
3904 return pointer_int_sum (resultcode, ptrop,
3905 fold_if_not_in_template (intop));
3908 /* Return a tree for the difference of pointers OP0 and OP1.
3909 The resulting tree has type int. */
3912 pointer_diff (tree op0, tree op1, tree ptrtype)
3915 tree restype = ptrdiff_type_node;
3916 tree target_type = TREE_TYPE (ptrtype);
3918 if (!complete_type_or_else (target_type, NULL_TREE))
3919 return error_mark_node;
3921 if (pedantic || warn_pointer_arith)
3923 if (TREE_CODE (target_type) == VOID_TYPE)
3924 pedwarn ("ISO C++ forbids using pointer of type %<void *%> in subtraction");
3925 if (TREE_CODE (target_type) == FUNCTION_TYPE)
3926 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3927 if (TREE_CODE (target_type) == METHOD_TYPE)
3928 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3931 /* First do the subtraction as integers;
3932 then drop through to build the divide operator. */
3934 op0 = cp_build_binary_op (MINUS_EXPR,
3935 cp_convert (restype, op0),
3936 cp_convert (restype, op1));
3938 /* This generates an error if op1 is a pointer to an incomplete type. */
3939 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
3940 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3942 op1 = (TYPE_PTROB_P (ptrtype)
3943 ? size_in_bytes (target_type)
3944 : integer_one_node);
3946 /* Do the division. */
3948 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
3949 return fold_if_not_in_template (result);
3952 /* Construct and perhaps optimize a tree representation
3953 for a unary operation. CODE, a tree_code, specifies the operation
3954 and XARG is the operand. */
3957 build_x_unary_op (enum tree_code code, tree xarg)
3959 tree orig_expr = xarg;
3963 if (processing_template_decl)
3965 if (type_dependent_expression_p (xarg))
3966 return build_min_nt (code, xarg, NULL_TREE);
3968 xarg = build_non_dependent_expr (xarg);
3973 /* [expr.unary.op] says:
3975 The address of an object of incomplete type can be taken.
3977 (And is just the ordinary address operator, not an overloaded
3978 "operator &".) However, if the type is a template
3979 specialization, we must complete the type at this point so that
3980 an overloaded "operator &" will be available if required. */
3981 if (code == ADDR_EXPR
3982 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
3983 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
3984 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
3985 || (TREE_CODE (xarg) == OFFSET_REF)))
3986 /* Don't look for a function. */;
3988 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
3989 /*overloaded_p=*/NULL);
3990 if (!exp && code == ADDR_EXPR)
3992 /* A pointer to member-function can be formed only by saying
3994 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
3995 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
3997 if (TREE_CODE (xarg) != OFFSET_REF
3998 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4000 error ("invalid use of %qE to form a pointer-to-member-function",
4002 if (TREE_CODE (xarg) != OFFSET_REF)
4003 inform (" a qualified-id is required");
4004 return error_mark_node;
4008 error ("parentheses around %qE cannot be used to form a"
4009 " pointer-to-member-function",
4011 PTRMEM_OK_P (xarg) = 1;
4015 if (TREE_CODE (xarg) == OFFSET_REF)
4017 ptrmem = PTRMEM_OK_P (xarg);
4019 if (!ptrmem && !flag_ms_extensions
4020 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4022 /* A single non-static member, make sure we don't allow a
4023 pointer-to-member. */
4024 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4025 TREE_OPERAND (xarg, 0),
4026 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4027 PTRMEM_OK_P (xarg) = ptrmem;
4030 else if (TREE_CODE (xarg) == TARGET_EXPR)
4031 warning (0, "taking address of temporary");
4032 exp = build_unary_op (ADDR_EXPR, xarg, 0);
4035 if (processing_template_decl && exp != error_mark_node)
4036 exp = build_min_non_dep (code, exp, orig_expr,
4037 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4038 if (TREE_CODE (exp) == ADDR_EXPR)
4039 PTRMEM_OK_P (exp) = ptrmem;
4043 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4044 constants, where a null value is represented by an INTEGER_CST of
4048 cp_truthvalue_conversion (tree expr)
4050 tree type = TREE_TYPE (expr);
4051 if (TYPE_PTRMEM_P (type))
4052 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
4054 return c_common_truthvalue_conversion (expr);
4057 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4060 condition_conversion (tree expr)
4063 if (processing_template_decl)
4065 t = perform_implicit_conversion (boolean_type_node, expr);
4066 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4070 /* Return an ADDR_EXPR giving the address of T. This function
4071 attempts no optimizations or simplifications; it is a low-level
4075 build_address (tree t)
4079 if (error_operand_p (t) || !cxx_mark_addressable (t))
4080 return error_mark_node;
4082 addr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (t)), t);
4087 /* Return a NOP_EXPR converting EXPR to TYPE. */
4090 build_nop (tree type, tree expr)
4092 if (type == error_mark_node || error_operand_p (expr))
4094 return build1 (NOP_EXPR, type, expr);
4097 /* C++: Must handle pointers to members.
4099 Perhaps type instantiation should be extended to handle conversion
4100 from aggregates to types we don't yet know we want? (Or are those
4101 cases typically errors which should be reported?)
4103 NOCONVERT nonzero suppresses the default promotions
4104 (such as from short to int). */
4107 build_unary_op (enum tree_code code, tree xarg, int noconvert)
4109 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4112 const char *errstring = NULL;
4114 const char *invalid_op_diag;
4116 if (arg == error_mark_node)
4117 return error_mark_node;
4119 if ((invalid_op_diag
4120 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4125 error (invalid_op_diag);
4126 return error_mark_node;
4131 case UNARY_PLUS_EXPR:
4134 int flags = WANT_ARITH | WANT_ENUM;
4135 /* Unary plus (but not unary minus) is allowed on pointers. */
4136 if (code == UNARY_PLUS_EXPR)
4137 flags |= WANT_POINTER;
4138 arg = build_expr_type_conversion (flags, arg, true);
4140 errstring = (code == NEGATE_EXPR
4141 ? "wrong type argument to unary minus"
4142 : "wrong type argument to unary plus");
4145 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4146 arg = perform_integral_promotions (arg);
4148 /* Make sure the result is not an lvalue: a unary plus or minus
4149 expression is always a rvalue. */
4156 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4160 arg = default_conversion (arg);
4162 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4165 errstring = "wrong type argument to bit-complement";
4166 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4167 arg = perform_integral_promotions (arg);
4171 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4172 errstring = "wrong type argument to abs";
4173 else if (!noconvert)
4174 arg = default_conversion (arg);
4178 /* Conjugating a real value is a no-op, but allow it anyway. */
4179 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4180 errstring = "wrong type argument to conjugation";
4181 else if (!noconvert)
4182 arg = default_conversion (arg);
4185 case TRUTH_NOT_EXPR:
4186 arg = perform_implicit_conversion (boolean_type_node, arg);
4187 val = invert_truthvalue (arg);
4188 if (arg != error_mark_node)
4190 errstring = "in argument to unary !";
4197 if (TREE_CODE (arg) == COMPLEX_CST)
4198 return TREE_REALPART (arg);
4199 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4201 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4202 return fold_if_not_in_template (arg);
4208 if (TREE_CODE (arg) == COMPLEX_CST)
4209 return TREE_IMAGPART (arg);
4210 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4212 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4213 return fold_if_not_in_template (arg);
4216 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4218 case PREINCREMENT_EXPR:
4219 case POSTINCREMENT_EXPR:
4220 case PREDECREMENT_EXPR:
4221 case POSTDECREMENT_EXPR:
4222 /* Handle complex lvalues (when permitted)
4223 by reduction to simpler cases. */
4225 val = unary_complex_lvalue (code, arg);
4229 /* Increment or decrement the real part of the value,
4230 and don't change the imaginary part. */
4231 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4235 arg = stabilize_reference (arg);
4236 real = build_unary_op (REALPART_EXPR, arg, 1);
4237 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
4238 real = build_unary_op (code, real, 1);
4239 if (real == error_mark_node || imag == error_mark_node)
4240 return error_mark_node;
4241 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4245 /* Report invalid types. */
4247 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4250 if (code == PREINCREMENT_EXPR)
4251 errstring ="no pre-increment operator for type";
4252 else if (code == POSTINCREMENT_EXPR)
4253 errstring ="no post-increment operator for type";
4254 else if (code == PREDECREMENT_EXPR)
4255 errstring ="no pre-decrement operator for type";
4257 errstring ="no post-decrement operator for type";
4261 /* Report something read-only. */
4263 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4264 || TREE_READONLY (arg))
4265 readonly_error (arg, ((code == PREINCREMENT_EXPR
4266 || code == POSTINCREMENT_EXPR)
4267 ? "increment" : "decrement"));
4272 tree result_type = TREE_TYPE (arg);
4274 declared_type = unlowered_expr_type (arg);
4276 arg = get_unwidened (arg, 0);
4277 argtype = TREE_TYPE (arg);
4279 /* ARM $5.2.5 last annotation says this should be forbidden. */
4280 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4281 pedwarn ((code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4282 ? G_("ISO C++ forbids incrementing an enum")
4283 : G_("ISO C++ forbids decrementing an enum"));
4285 /* Compute the increment. */
4287 if (TREE_CODE (argtype) == POINTER_TYPE)
4289 tree type = complete_type (TREE_TYPE (argtype));
4291 if (!COMPLETE_OR_VOID_TYPE_P (type))
4292 error (((code == PREINCREMENT_EXPR
4293 || code == POSTINCREMENT_EXPR))
4294 ? G_("cannot increment a pointer to incomplete type %qT")
4295 : G_("cannot decrement a pointer to incomplete type %qT"),
4296 TREE_TYPE (argtype));
4297 else if ((pedantic || warn_pointer_arith)
4298 && !TYPE_PTROB_P (argtype))
4299 pedwarn ((code == PREINCREMENT_EXPR
4300 || code == POSTINCREMENT_EXPR)
4301 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4302 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4304 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
4307 inc = integer_one_node;
4309 inc = cp_convert (argtype, inc);
4311 /* Complain about anything else that is not a true lvalue. */
4312 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4313 || code == POSTINCREMENT_EXPR)
4314 ? lv_increment : lv_decrement)))
4315 return error_mark_node;
4317 /* Forbid using -- on `bool'. */
4318 if (same_type_p (declared_type, boolean_type_node))
4320 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4322 error ("invalid use of %<--%> on bool variable %qD", arg);
4323 return error_mark_node;
4325 val = boolean_increment (code, arg);
4328 val = build2 (code, TREE_TYPE (arg), arg, inc);
4330 TREE_SIDE_EFFECTS (val) = 1;
4331 return cp_convert (result_type, val);
4335 /* Note that this operation never does default_conversion
4336 regardless of NOCONVERT. */
4338 argtype = lvalue_type (arg);
4340 if (TREE_CODE (arg) == OFFSET_REF)
4343 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4345 tree type = build_pointer_type (TREE_TYPE (argtype));
4346 arg = build1 (CONVERT_EXPR, type, arg);
4349 else if (pedantic && DECL_MAIN_P (arg))
4351 pedwarn ("ISO C++ forbids taking address of function %<::main%>");
4353 /* Let &* cancel out to simplify resulting code. */
4354 if (TREE_CODE (arg) == INDIRECT_REF)
4356 /* We don't need to have `current_class_ptr' wrapped in a
4357 NON_LVALUE_EXPR node. */
4358 if (arg == current_class_ref)
4359 return current_class_ptr;
4361 arg = TREE_OPERAND (arg, 0);
4362 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4364 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4365 arg = build1 (CONVERT_EXPR, type, arg);
4368 /* Don't let this be an lvalue. */
4373 /* Uninstantiated types are all functions. Taking the
4374 address of a function is a no-op, so just return the
4377 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4378 || !IDENTIFIER_OPNAME_P (arg));
4380 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4381 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4383 /* They're trying to take the address of a unique non-static
4384 member function. This is ill-formed (except in MS-land),
4385 but let's try to DTRT.
4386 Note: We only handle unique functions here because we don't
4387 want to complain if there's a static overload; non-unique
4388 cases will be handled by instantiate_type. But we need to
4389 handle this case here to allow casts on the resulting PMF.
4390 We could defer this in non-MS mode, but it's easier to give
4391 a useful error here. */
4393 /* Inside constant member functions, the `this' pointer
4394 contains an extra const qualifier. TYPE_MAIN_VARIANT
4395 is used here to remove this const from the diagnostics
4396 and the created OFFSET_REF. */
4397 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4398 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4401 if (! flag_ms_extensions)
4403 tree name = DECL_NAME (fn);
4404 if (current_class_type
4405 && TREE_OPERAND (arg, 0) == current_class_ref)
4406 /* An expression like &memfn. */
4407 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4408 " or parenthesized non-static member function to form"
4409 " a pointer to member function. Say %<&%T::%D%>",
4412 pedwarn ("ISO C++ forbids taking the address of a bound member"
4413 " function to form a pointer to member function."
4417 arg = build_offset_ref (base, fn, /*address_p=*/true);
4421 if (type_unknown_p (arg))
4422 return build1 (ADDR_EXPR, unknown_type_node, arg);
4424 /* Handle complex lvalues (when permitted)
4425 by reduction to simpler cases. */
4426 val = unary_complex_lvalue (code, arg);
4430 switch (TREE_CODE (arg))
4435 case FIX_TRUNC_EXPR:
4436 if (! lvalue_p (arg) && pedantic)
4437 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4441 arg = BASELINK_FUNCTIONS (arg);
4445 arg = OVL_CURRENT (arg);
4449 /* Turn a reference to a non-static data member into a
4450 pointer-to-member. */
4455 if (!PTRMEM_OK_P (arg))
4456 return build_unary_op (code, arg, 0);
4458 t = TREE_OPERAND (arg, 1);
4459 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4461 error ("cannot create pointer to reference member %qD", t);
4462 return error_mark_node;
4465 type = build_ptrmem_type (context_for_name_lookup (t),
4467 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4475 /* Anything not already handled and not a true memory reference
4477 if (TREE_CODE (argtype) != FUNCTION_TYPE
4478 && TREE_CODE (argtype) != METHOD_TYPE
4479 && TREE_CODE (arg) != OFFSET_REF
4480 && !lvalue_or_else (arg, lv_addressof))
4481 return error_mark_node;
4483 if (argtype != error_mark_node)
4484 argtype = build_pointer_type (argtype);
4486 /* In a template, we are processing a non-dependent expression
4487 so we can just form an ADDR_EXPR with the correct type. */
4488 if (processing_template_decl)
4490 val = build_address (arg);
4491 if (TREE_CODE (arg) == OFFSET_REF)
4492 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4496 if (TREE_CODE (arg) != COMPONENT_REF)
4498 val = build_address (arg);
4499 if (TREE_CODE (arg) == OFFSET_REF)
4500 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4502 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4504 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4506 /* We can only get here with a single static member
4508 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4509 && DECL_STATIC_FUNCTION_P (fn));
4511 val = build_address (fn);
4512 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4513 /* Do not lose object's side effects. */
4514 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4515 TREE_OPERAND (arg, 0), val);
4517 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4519 error ("attempt to take address of bit-field structure member %qD",
4520 TREE_OPERAND (arg, 1));
4521 return error_mark_node;
4525 tree object = TREE_OPERAND (arg, 0);
4526 tree field = TREE_OPERAND (arg, 1);
4527 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4528 (TREE_TYPE (object), decl_type_context (field)));
4529 val = build_address (arg);
4532 if (TREE_CODE (argtype) == POINTER_TYPE
4533 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4535 build_ptrmemfunc_type (argtype);
4536 val = build_ptrmemfunc (argtype, val, 0,
4537 /*c_cast_p=*/false);
4549 argtype = TREE_TYPE (arg);
4550 return fold_if_not_in_template (build1 (code, argtype, arg));
4553 error ("%s", errstring);
4554 return error_mark_node;
4557 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4558 for certain kinds of expressions which are not really lvalues
4559 but which we can accept as lvalues.
4561 If ARG is not a kind of expression we can handle, return
4565 unary_complex_lvalue (enum tree_code code, tree arg)
4567 /* Inside a template, making these kinds of adjustments is
4568 pointless; we are only concerned with the type of the
4570 if (processing_template_decl)
4573 /* Handle (a, b) used as an "lvalue". */
4574 if (TREE_CODE (arg) == COMPOUND_EXPR)
4576 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
4577 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4578 TREE_OPERAND (arg, 0), real_result);
4581 /* Handle (a ? b : c) used as an "lvalue". */
4582 if (TREE_CODE (arg) == COND_EXPR
4583 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
4584 return rationalize_conditional_expr (code, arg);
4586 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4587 if (TREE_CODE (arg) == MODIFY_EXPR
4588 || TREE_CODE (arg) == PREINCREMENT_EXPR
4589 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4591 tree lvalue = TREE_OPERAND (arg, 0);
4592 if (TREE_SIDE_EFFECTS (lvalue))
4594 lvalue = stabilize_reference (lvalue);
4595 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
4596 lvalue, TREE_OPERAND (arg, 1));
4598 return unary_complex_lvalue
4599 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
4602 if (code != ADDR_EXPR)
4605 /* Handle (a = b) used as an "lvalue" for `&'. */
4606 if (TREE_CODE (arg) == MODIFY_EXPR
4607 || TREE_CODE (arg) == INIT_EXPR)
4609 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 0), 0);
4610 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4612 TREE_NO_WARNING (arg) = 1;
4616 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4617 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4618 || TREE_CODE (arg) == OFFSET_REF)
4621 /* We permit compiler to make function calls returning
4622 objects of aggregate type look like lvalues. */
4626 if (TREE_CODE (targ) == SAVE_EXPR)
4627 targ = TREE_OPERAND (targ, 0);
4629 if (TREE_CODE (targ) == CALL_EXPR && IS_AGGR_TYPE (TREE_TYPE (targ)))
4631 if (TREE_CODE (arg) == SAVE_EXPR)
4634 targ = build_cplus_new (TREE_TYPE (arg), arg);
4635 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
4638 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
4639 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
4640 TREE_OPERAND (targ, 0), current_function_decl, NULL);
4643 /* Don't let anything else be handled specially. */
4647 /* Mark EXP saying that we need to be able to take the
4648 address of it; it should not be allocated in a register.
4649 Value is true if successful.
4651 C++: we do not allow `current_class_ptr' to be addressable. */
4654 cxx_mark_addressable (tree exp)
4659 switch (TREE_CODE (x))
4666 x = TREE_OPERAND (x, 0);
4670 if (x == current_class_ptr)
4672 error ("cannot take the address of %<this%>, which is an rvalue expression");
4673 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
4679 /* Caller should not be trying to mark initialized
4680 constant fields addressable. */
4681 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
4682 || DECL_IN_AGGR_P (x) == 0
4684 || DECL_EXTERNAL (x));
4689 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
4690 && !DECL_ARTIFICIAL (x))
4692 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
4695 ("address of explicit register variable %qD requested", x);
4698 else if (extra_warnings)
4700 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
4702 TREE_ADDRESSABLE (x) = 1;
4706 TREE_ADDRESSABLE (x) = 1;
4710 TREE_ADDRESSABLE (x) = 1;
4714 TREE_ADDRESSABLE (x) = 1;
4715 cxx_mark_addressable (TREE_OPERAND (x, 0));
4723 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4726 build_x_conditional_expr (tree ifexp, tree op1, tree op2)
4728 tree orig_ifexp = ifexp;
4729 tree orig_op1 = op1;
4730 tree orig_op2 = op2;
4733 if (processing_template_decl)
4735 /* The standard says that the expression is type-dependent if
4736 IFEXP is type-dependent, even though the eventual type of the
4737 expression doesn't dependent on IFEXP. */
4738 if (type_dependent_expression_p (ifexp)
4739 /* As a GNU extension, the middle operand may be omitted. */
4740 || (op1 && type_dependent_expression_p (op1))
4741 || type_dependent_expression_p (op2))
4742 return build_min_nt (COND_EXPR, ifexp, op1, op2);
4743 ifexp = build_non_dependent_expr (ifexp);
4745 op1 = build_non_dependent_expr (op1);
4746 op2 = build_non_dependent_expr (op2);
4749 expr = build_conditional_expr (ifexp, op1, op2);
4750 if (processing_template_decl && expr != error_mark_node)
4751 return build_min_non_dep (COND_EXPR, expr,
4752 orig_ifexp, orig_op1, orig_op2);
4756 /* Given a list of expressions, return a compound expression
4757 that performs them all and returns the value of the last of them. */
4759 tree build_x_compound_expr_from_list (tree list, const char *msg)
4761 tree expr = TREE_VALUE (list);
4763 if (TREE_CHAIN (list))
4766 pedwarn ("%s expression list treated as compound expression", msg);
4768 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
4769 expr = build_x_compound_expr (expr, TREE_VALUE (list));
4775 /* Handle overloading of the ',' operator when needed. */
4778 build_x_compound_expr (tree op1, tree op2)
4781 tree orig_op1 = op1;
4782 tree orig_op2 = op2;
4784 if (processing_template_decl)
4786 if (type_dependent_expression_p (op1)
4787 || type_dependent_expression_p (op2))
4788 return build_min_nt (COMPOUND_EXPR, op1, op2);
4789 op1 = build_non_dependent_expr (op1);
4790 op2 = build_non_dependent_expr (op2);
4793 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
4794 /*overloaded_p=*/NULL);
4796 result = build_compound_expr (op1, op2);
4798 if (processing_template_decl && result != error_mark_node)
4799 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
4804 /* Build a compound expression. */
4807 build_compound_expr (tree lhs, tree rhs)
4809 lhs = convert_to_void (lhs, "left-hand operand of comma");
4811 if (lhs == error_mark_node || rhs == error_mark_node)
4812 return error_mark_node;
4814 if (TREE_CODE (rhs) == TARGET_EXPR)
4816 /* If the rhs is a TARGET_EXPR, then build the compound
4817 expression inside the target_expr's initializer. This
4818 helps the compiler to eliminate unnecessary temporaries. */
4819 tree init = TREE_OPERAND (rhs, 1);
4821 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
4822 TREE_OPERAND (rhs, 1) = init;
4827 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
4830 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
4831 casts away constness. DIAG_FN gives the function to call if we
4832 need to issue a diagnostic; if it is NULL, no diagnostic will be
4833 issued. DESCRIPTION explains what operation is taking place. */
4836 check_for_casting_away_constness (tree src_type, tree dest_type,
4837 void (*diag_fn)(const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2),
4838 const char *description)
4840 if (diag_fn && casts_away_constness (src_type, dest_type))
4841 diag_fn ("%s from type %qT to type %qT casts away constness",
4842 description, src_type, dest_type);
4845 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
4846 (another pointer-to-member type in the same hierarchy) and return
4847 the converted expression. If ALLOW_INVERSE_P is permitted, a
4848 pointer-to-derived may be converted to pointer-to-base; otherwise,
4849 only the other direction is permitted. If C_CAST_P is true, this
4850 conversion is taking place as part of a C-style cast. */
4853 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
4856 if (TYPE_PTRMEM_P (type))
4860 if (TREE_CODE (expr) == PTRMEM_CST)
4861 expr = cplus_expand_constant (expr);
4862 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
4863 TYPE_PTRMEM_CLASS_TYPE (type),
4866 if (!integer_zerop (delta))
4867 expr = cp_build_binary_op (PLUS_EXPR,
4868 build_nop (ptrdiff_type_node, expr),
4870 return build_nop (type, expr);
4873 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
4874 allow_inverse_p, c_cast_p);
4877 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
4878 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
4879 Otherwise, return EXPR unchanged. */
4882 ignore_overflows (tree expr, tree orig)
4884 if (TREE_CODE (expr) == INTEGER_CST
4885 && CONSTANT_CLASS_P (orig)
4886 && TREE_CODE (orig) != STRING_CST
4887 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
4889 if (!TREE_OVERFLOW (orig))
4890 /* Ensure constant sharing. */
4891 expr = build_int_cst_wide (TREE_TYPE (expr),
4892 TREE_INT_CST_LOW (expr),
4893 TREE_INT_CST_HIGH (expr));
4896 /* Avoid clobbering a shared constant. */
4897 expr = copy_node (expr);
4898 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
4904 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
4905 this static_cast is being attempted as one of the possible casts
4906 allowed by a C-style cast. (In that case, accessibility of base
4907 classes is not considered, and it is OK to cast away
4908 constness.) Return the result of the cast. *VALID_P is set to
4909 indicate whether or not the cast was valid. */
4912 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
4918 void (*diag_fn)(const char*, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
4921 /* Assume the cast is valid. */
4924 intype = TREE_TYPE (expr);
4926 /* Save casted types in the function's used types hash table. */
4927 used_types_insert (type);
4929 /* Determine what to do when casting away constness. */
4932 /* C-style casts are allowed to cast away constness. With
4933 WARN_CAST_QUAL, we still want to issue a warning. */
4934 diag_fn = warn_cast_qual ? warning0 : NULL;
4939 /* A static_cast may not cast away constness. */
4941 desc = "static_cast";
4944 /* [expr.static.cast]
4946 An lvalue of type "cv1 B", where B is a class type, can be cast
4947 to type "reference to cv2 D", where D is a class derived (clause
4948 _class.derived_) from B, if a valid standard conversion from
4949 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
4950 same cv-qualification as, or greater cv-qualification than, cv1,
4951 and B is not a virtual base class of D. */
4952 /* We check this case before checking the validity of "TYPE t =
4953 EXPR;" below because for this case:
4956 struct D : public B { D(const B&); };
4958 void f() { static_cast<const D&>(b); }
4960 we want to avoid constructing a new D. The standard is not
4961 completely clear about this issue, but our interpretation is
4962 consistent with other compilers. */
4963 if (TREE_CODE (type) == REFERENCE_TYPE
4964 && CLASS_TYPE_P (TREE_TYPE (type))
4965 && CLASS_TYPE_P (intype)
4966 && real_lvalue_p (expr)
4967 && DERIVED_FROM_P (intype, TREE_TYPE (type))
4968 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
4969 build_pointer_type (TYPE_MAIN_VARIANT
4970 (TREE_TYPE (type))))
4972 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
4976 /* There is a standard conversion from "D*" to "B*" even if "B"
4977 is ambiguous or inaccessible. If this is really a
4978 static_cast, then we check both for inaccessibility and
4979 ambiguity. However, if this is a static_cast being performed
4980 because the user wrote a C-style cast, then accessibility is
4982 base = lookup_base (TREE_TYPE (type), intype,
4983 c_cast_p ? ba_unique : ba_check,
4986 /* Convert from "B*" to "D*". This function will check that "B"
4987 is not a virtual base of "D". */
4988 expr = build_base_path (MINUS_EXPR, build_address (expr),
4989 base, /*nonnull=*/false);
4990 /* Convert the pointer to a reference -- but then remember that
4991 there are no expressions with reference type in C++. */
4992 return convert_from_reference (build_nop (type, expr));
4997 /* [expr.static.cast]
4999 An expression e can be explicitly converted to a type T using a
5000 static_cast of the form static_cast<T>(e) if the declaration T
5001 t(e);" is well-formed, for some invented temporary variable
5003 result = perform_direct_initialization_if_possible (type, expr,
5007 result = convert_from_reference (result);
5009 /* Ignore any integer overflow caused by the cast. */
5010 result = ignore_overflows (result, orig);
5012 /* [expr.static.cast]
5014 If T is a reference type, the result is an lvalue; otherwise,
5015 the result is an rvalue. */
5016 if (TREE_CODE (type) != REFERENCE_TYPE)
5017 result = rvalue (result);
5021 /* [expr.static.cast]
5023 Any expression can be explicitly converted to type cv void. */
5024 if (TREE_CODE (type) == VOID_TYPE)
5025 return convert_to_void (expr, /*implicit=*/NULL);
5027 /* [expr.static.cast]
5029 The inverse of any standard conversion sequence (clause _conv_),
5030 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5031 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5032 (_conv.bool_) conversions, can be performed explicitly using
5033 static_cast subject to the restriction that the explicit
5034 conversion does not cast away constness (_expr.const.cast_), and
5035 the following additional rules for specific cases: */
5036 /* For reference, the conversions not excluded are: integral
5037 promotions, floating point promotion, integral conversions,
5038 floating point conversions, floating-integral conversions,
5039 pointer conversions, and pointer to member conversions. */
5042 A value of integral _or enumeration_ type can be explicitly
5043 converted to an enumeration type. */
5044 /* The effect of all that is that any conversion between any two
5045 types which are integral, floating, or enumeration types can be
5047 if ((INTEGRAL_TYPE_P (type) || SCALAR_FLOAT_TYPE_P (type))
5048 && (INTEGRAL_TYPE_P (intype) || SCALAR_FLOAT_TYPE_P (intype)))
5050 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5052 /* Ignore any integer overflow caused by the cast. */
5053 expr = ignore_overflows (expr, orig);
5057 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5058 && CLASS_TYPE_P (TREE_TYPE (type))
5059 && CLASS_TYPE_P (TREE_TYPE (intype))
5060 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5061 (TREE_TYPE (intype))),
5062 build_pointer_type (TYPE_MAIN_VARIANT
5063 (TREE_TYPE (type)))))
5068 check_for_casting_away_constness (intype, type, diag_fn, desc);
5069 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5070 c_cast_p ? ba_unique : ba_check,
5072 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5075 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5076 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5083 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5084 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5086 if (TYPE_PTRMEM_P (type))
5088 t1 = (build_ptrmem_type
5090 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5091 t2 = (build_ptrmem_type
5093 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5100 if (can_convert (t1, t2))
5103 check_for_casting_away_constness (intype, type, diag_fn,
5105 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5110 /* [expr.static.cast]
5112 An rvalue of type "pointer to cv void" can be explicitly
5113 converted to a pointer to object type. A value of type pointer
5114 to object converted to "pointer to cv void" and back to the
5115 original pointer type will have its original value. */
5116 if (TREE_CODE (intype) == POINTER_TYPE
5117 && VOID_TYPE_P (TREE_TYPE (intype))
5118 && TYPE_PTROB_P (type))
5121 check_for_casting_away_constness (intype, type, diag_fn, desc);
5122 return build_nop (type, expr);
5126 return error_mark_node;
5129 /* Return an expression representing static_cast<TYPE>(EXPR). */
5132 build_static_cast (tree type, tree expr)
5137 if (type == error_mark_node || expr == error_mark_node)
5138 return error_mark_node;
5140 if (processing_template_decl)
5142 expr = build_min (STATIC_CAST_EXPR, type, expr);
5143 /* We don't know if it will or will not have side effects. */
5144 TREE_SIDE_EFFECTS (expr) = 1;
5145 return convert_from_reference (expr);
5148 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5149 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5150 if (TREE_CODE (type) != REFERENCE_TYPE
5151 && TREE_CODE (expr) == NOP_EXPR
5152 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5153 expr = TREE_OPERAND (expr, 0);
5155 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p);
5159 error ("invalid static_cast from type %qT to type %qT",
5160 TREE_TYPE (expr), type);
5161 return error_mark_node;
5164 /* EXPR is an expression with member function or pointer-to-member
5165 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5166 not permitted by ISO C++, but we accept it in some modes. If we
5167 are not in one of those modes, issue a diagnostic. Return the
5168 converted expression. */
5171 convert_member_func_to_ptr (tree type, tree expr)
5176 intype = TREE_TYPE (expr);
5177 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5178 || TREE_CODE (intype) == METHOD_TYPE);
5180 if (pedantic || warn_pmf2ptr)
5181 pedwarn ("converting from %qT to %qT", intype, type);
5183 if (TREE_CODE (intype) == METHOD_TYPE)
5184 expr = build_addr_func (expr);
5185 else if (TREE_CODE (expr) == PTRMEM_CST)
5186 expr = build_address (PTRMEM_CST_MEMBER (expr));
5189 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5190 decl = build_address (decl);
5191 expr = get_member_function_from_ptrfunc (&decl, expr);
5194 return build_nop (type, expr);
5197 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5198 If C_CAST_P is true, this reinterpret cast is being done as part of
5199 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5200 indicate whether or not reinterpret_cast was valid. */
5203 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5208 /* Assume the cast is invalid. */
5212 if (type == error_mark_node || error_operand_p (expr))
5213 return error_mark_node;
5215 intype = TREE_TYPE (expr);
5217 /* Save casted types in the function's used types hash table. */
5218 used_types_insert (type);
5220 /* [expr.reinterpret.cast]
5221 An lvalue expression of type T1 can be cast to the type
5222 "reference to T2" if an expression of type "pointer to T1" can be
5223 explicitly converted to the type "pointer to T2" using a
5224 reinterpret_cast. */
5225 if (TREE_CODE (type) == REFERENCE_TYPE)
5227 if (! real_lvalue_p (expr))
5229 error ("invalid cast of an rvalue expression of type "
5232 return error_mark_node;
5235 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5236 "B" are related class types; the reinterpret_cast does not
5237 adjust the pointer. */
5238 if (TYPE_PTR_P (intype)
5239 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
5240 COMPARE_BASE | COMPARE_DERIVED)))
5241 warning (0, "casting %qT to %qT does not dereference pointer",
5244 expr = build_unary_op (ADDR_EXPR, expr, 0);
5245 if (expr != error_mark_node)
5246 expr = build_reinterpret_cast_1
5247 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
5249 if (expr != error_mark_node)
5250 expr = build_indirect_ref (expr, 0);
5254 /* As a G++ extension, we consider conversions from member
5255 functions, and pointers to member functions to
5256 pointer-to-function and pointer-to-void types. If
5257 -Wno-pmf-conversions has not been specified,
5258 convert_member_func_to_ptr will issue an error message. */
5259 if ((TYPE_PTRMEMFUNC_P (intype)
5260 || TREE_CODE (intype) == METHOD_TYPE)
5261 && TYPE_PTR_P (type)
5262 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
5263 || VOID_TYPE_P (TREE_TYPE (type))))
5264 return convert_member_func_to_ptr (type, expr);
5266 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5267 array-to-pointer, and function-to-pointer conversions are
5269 expr = decay_conversion (expr);
5271 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5272 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5273 if (TREE_CODE (expr) == NOP_EXPR
5274 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5275 expr = TREE_OPERAND (expr, 0);
5277 if (error_operand_p (expr))
5278 return error_mark_node;
5280 intype = TREE_TYPE (expr);
5282 /* [expr.reinterpret.cast]
5283 A pointer can be converted to any integral type large enough to
5285 if (CP_INTEGRAL_TYPE_P (type) && TYPE_PTR_P (intype))
5287 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5288 pedwarn ("cast from %qT to %qT loses precision",
5291 /* [expr.reinterpret.cast]
5292 A value of integral or enumeration type can be explicitly
5293 converted to a pointer. */
5294 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
5297 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5298 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5299 return fold_if_not_in_template (build_nop (type, expr));
5300 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5301 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5306 check_for_casting_away_constness (intype, type, error,
5307 "reinterpret_cast");
5308 /* Warn about possible alignment problems. */
5309 if (STRICT_ALIGNMENT && warn_cast_align
5310 && !VOID_TYPE_P (type)
5311 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
5312 && COMPLETE_TYPE_P (TREE_TYPE (type))
5313 && COMPLETE_TYPE_P (TREE_TYPE (intype))
5314 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
5315 warning (0, "cast from %qT to %qT increases required alignment of "
5319 /* We need to strip nops here, because the front end likes to
5320 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5322 if (warn_strict_aliasing <= 2)
5323 strict_aliasing_warning (intype, type, sexpr);
5325 return fold_if_not_in_template (build_nop (type, expr));
5327 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
5328 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
5331 /* Only issue a warning, as we have always supported this
5332 where possible, and it is necessary in some cases. DR 195
5333 addresses this issue, but as of 2004/10/26 is still in
5335 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5336 return fold_if_not_in_template (build_nop (type, expr));
5338 else if (TREE_CODE (type) == VECTOR_TYPE)
5339 return fold_if_not_in_template (convert_to_vector (type, expr));
5340 else if (TREE_CODE (intype) == VECTOR_TYPE && INTEGRAL_TYPE_P (type))
5341 return fold_if_not_in_template (convert_to_integer (type, expr));
5346 error ("invalid cast from type %qT to type %qT", intype, type);
5347 return error_mark_node;
5350 return cp_convert (type, expr);
5354 build_reinterpret_cast (tree type, tree expr)
5356 if (type == error_mark_node || expr == error_mark_node)
5357 return error_mark_node;
5359 if (processing_template_decl)
5361 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5363 if (!TREE_SIDE_EFFECTS (t)
5364 && type_dependent_expression_p (expr))
5365 /* There might turn out to be side effects inside expr. */
5366 TREE_SIDE_EFFECTS (t) = 1;
5367 return convert_from_reference (t);
5370 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
5374 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5375 return an appropriate expression. Otherwise, return
5376 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5377 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5378 performing a C-style cast, its value upon return will indicate
5379 whether or not the conversion succeeded. */
5382 build_const_cast_1 (tree dst_type, tree expr, bool complain,
5386 tree reference_type;
5388 /* Callers are responsible for handling error_mark_node as a
5389 destination type. */
5390 gcc_assert (dst_type != error_mark_node);
5391 /* In a template, callers should be building syntactic
5392 representations of casts, not using this machinery. */
5393 gcc_assert (!processing_template_decl);
5395 /* Assume the conversion is invalid. */
5399 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
5402 error ("invalid use of const_cast with type %qT, "
5403 "which is not a pointer, "
5404 "reference, nor a pointer-to-data-member type", dst_type);
5405 return error_mark_node;
5408 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
5411 error ("invalid use of const_cast with type %qT, which is a pointer "
5412 "or reference to a function type", dst_type);
5413 return error_mark_node;
5416 /* Save casted types in the function's used types hash table. */
5417 used_types_insert (dst_type);
5419 src_type = TREE_TYPE (expr);
5420 /* Expressions do not really have reference types. */
5421 if (TREE_CODE (src_type) == REFERENCE_TYPE)
5422 src_type = TREE_TYPE (src_type);
5424 /* [expr.const.cast]
5426 An lvalue of type T1 can be explicitly converted to an lvalue of
5427 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5428 types) if a pointer to T1 can be explicitly converted to the type
5429 pointer to T2 using a const_cast. */
5430 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
5432 reference_type = dst_type;
5433 if (! real_lvalue_p (expr))
5436 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5437 src_type, dst_type);
5438 return error_mark_node;
5440 dst_type = build_pointer_type (TREE_TYPE (dst_type));
5441 src_type = build_pointer_type (src_type);
5445 reference_type = NULL_TREE;
5446 /* If the destination type is not a reference type, the
5447 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5448 conversions are performed. */
5449 src_type = type_decays_to (src_type);
5450 if (src_type == error_mark_node)
5451 return error_mark_node;
5454 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
5455 && comp_ptr_ttypes_const (dst_type, src_type))
5460 /* This cast is actually a C-style cast. Issue a warning if
5461 the user is making a potentially unsafe cast. */
5463 check_for_casting_away_constness (src_type, dst_type,
5469 expr = build_unary_op (ADDR_EXPR, expr, 0);
5470 expr = build_nop (reference_type, expr);
5471 return convert_from_reference (expr);
5475 expr = decay_conversion (expr);
5476 /* build_c_cast puts on a NOP_EXPR to make the result not an
5477 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5478 non-lvalue context. */
5479 if (TREE_CODE (expr) == NOP_EXPR
5480 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5481 expr = TREE_OPERAND (expr, 0);
5482 return build_nop (dst_type, expr);
5487 error ("invalid const_cast from type %qT to type %qT",
5488 src_type, dst_type);
5489 return error_mark_node;
5493 build_const_cast (tree type, tree expr)
5495 if (type == error_mark_node || error_operand_p (expr))
5496 return error_mark_node;
5498 if (processing_template_decl)
5500 tree t = build_min (CONST_CAST_EXPR, type, expr);
5502 if (!TREE_SIDE_EFFECTS (t)
5503 && type_dependent_expression_p (expr))
5504 /* There might turn out to be side effects inside expr. */
5505 TREE_SIDE_EFFECTS (t) = 1;
5506 return convert_from_reference (t);
5509 return build_const_cast_1 (type, expr, /*complain=*/true,
5513 /* Build an expression representing an explicit C-style cast to type
5514 TYPE of expression EXPR. */
5517 build_c_cast (tree type, tree expr)
5523 if (type == error_mark_node || error_operand_p (expr))
5524 return error_mark_node;
5526 if (processing_template_decl)
5528 tree t = build_min (CAST_EXPR, type,
5529 tree_cons (NULL_TREE, value, NULL_TREE));
5530 /* We don't know if it will or will not have side effects. */
5531 TREE_SIDE_EFFECTS (t) = 1;
5532 return convert_from_reference (t);
5535 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5536 'Class') should always be retained, because this information aids
5537 in method lookup. */
5538 if (objc_is_object_ptr (type)
5539 && objc_is_object_ptr (TREE_TYPE (expr)))
5540 return build_nop (type, expr);
5542 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5543 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5544 if (TREE_CODE (type) != REFERENCE_TYPE
5545 && TREE_CODE (value) == NOP_EXPR
5546 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
5547 value = TREE_OPERAND (value, 0);
5549 if (TREE_CODE (type) == ARRAY_TYPE)
5551 /* Allow casting from T1* to T2[] because Cfront allows it.
5552 NIHCL uses it. It is not valid ISO C++ however. */
5553 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
5555 pedwarn ("ISO C++ forbids casting to an array type %qT", type);
5556 type = build_pointer_type (TREE_TYPE (type));
5560 error ("ISO C++ forbids casting to an array type %qT", type);
5561 return error_mark_node;
5565 if (TREE_CODE (type) == FUNCTION_TYPE
5566 || TREE_CODE (type) == METHOD_TYPE)
5568 error ("invalid cast to function type %qT", type);
5569 return error_mark_node;
5572 /* A C-style cast can be a const_cast. */
5573 result = build_const_cast_1 (type, value, /*complain=*/false,
5578 /* Or a static cast. */
5579 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
5581 /* Or a reinterpret_cast. */
5583 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
5585 /* The static_cast or reinterpret_cast may be followed by a
5588 /* A valid cast may result in errors if, for example, a
5589 conversion to am ambiguous base class is required. */
5590 && !error_operand_p (result))
5594 /* Non-class rvalues always have cv-unqualified type. */
5595 if (!CLASS_TYPE_P (type))
5596 type = TYPE_MAIN_VARIANT (type);
5597 result_type = TREE_TYPE (result);
5598 if (!CLASS_TYPE_P (result_type))
5599 result_type = TYPE_MAIN_VARIANT (result_type);
5600 /* If the type of RESULT does not match TYPE, perform a
5601 const_cast to make it match. If the static_cast or
5602 reinterpret_cast succeeded, we will differ by at most
5603 cv-qualification, so the follow-on const_cast is guaranteed
5605 if (!same_type_p (non_reference (type), non_reference (result_type)))
5607 result = build_const_cast_1 (type, result, false, &valid_p);
5608 gcc_assert (valid_p);
5613 return error_mark_node;
5616 /* Build an assignment expression of lvalue LHS from value RHS.
5617 MODIFYCODE is the code for a binary operator that we use
5618 to combine the old value of LHS with RHS to get the new value.
5619 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5621 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5624 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
5628 tree lhstype = TREE_TYPE (lhs);
5629 tree olhstype = lhstype;
5630 tree olhs = NULL_TREE;
5631 bool plain_assign = (modifycode == NOP_EXPR);
5633 /* Avoid duplicate error messages from operands that had errors. */
5634 if (error_operand_p (lhs) || error_operand_p (rhs))
5635 return error_mark_node;
5637 /* Handle control structure constructs used as "lvalues". */
5638 switch (TREE_CODE (lhs))
5640 /* Handle --foo = 5; as these are valid constructs in C++. */
5641 case PREDECREMENT_EXPR:
5642 case PREINCREMENT_EXPR:
5643 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5644 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5645 stabilize_reference (TREE_OPERAND (lhs, 0)),
5646 TREE_OPERAND (lhs, 1));
5647 return build2 (COMPOUND_EXPR, lhstype,
5649 build_modify_expr (TREE_OPERAND (lhs, 0),
5652 /* Handle (a, b) used as an "lvalue". */
5654 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1),
5656 if (newrhs == error_mark_node)
5657 return error_mark_node;
5658 return build2 (COMPOUND_EXPR, lhstype,
5659 TREE_OPERAND (lhs, 0), newrhs);
5662 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5663 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5664 stabilize_reference (TREE_OPERAND (lhs, 0)),
5665 TREE_OPERAND (lhs, 1));
5666 newrhs = build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs);
5667 if (newrhs == error_mark_node)
5668 return error_mark_node;
5669 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
5673 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5674 when neither operand has side-effects. */
5675 if (!lvalue_or_else (lhs, lv_assign))
5676 return error_mark_node;
5678 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
5679 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
5681 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
5682 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
5684 TREE_OPERAND (lhs, 0),
5685 TREE_OPERAND (lhs, 1)),
5686 TREE_OPERAND (lhs, 0),
5687 TREE_OPERAND (lhs, 1));
5690 /* Handle (a ? b : c) used as an "lvalue". */
5693 /* Produce (a ? (b = rhs) : (c = rhs))
5694 except that the RHS goes through a save-expr
5695 so the code to compute it is only emitted once. */
5697 tree preeval = NULL_TREE;
5699 if (VOID_TYPE_P (TREE_TYPE (rhs)))
5701 error ("void value not ignored as it ought to be");
5702 return error_mark_node;
5705 rhs = stabilize_expr (rhs, &preeval);
5707 /* Check this here to avoid odd errors when trying to convert
5708 a throw to the type of the COND_EXPR. */
5709 if (!lvalue_or_else (lhs, lv_assign))
5710 return error_mark_node;
5712 cond = build_conditional_expr
5713 (TREE_OPERAND (lhs, 0),
5714 build_modify_expr (TREE_OPERAND (lhs, 1),
5716 build_modify_expr (TREE_OPERAND (lhs, 2),
5719 if (cond == error_mark_node)
5721 /* Make sure the code to compute the rhs comes out
5722 before the split. */
5724 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
5732 if (modifycode == INIT_EXPR)
5734 if (TREE_CODE (rhs) == CONSTRUCTOR)
5736 if (! same_type_p (TREE_TYPE (rhs), lhstype))
5737 /* Call convert to generate an error; see PR 11063. */
5738 rhs = convert (lhstype, rhs);
5739 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
5740 TREE_SIDE_EFFECTS (result) = 1;
5743 else if (! IS_AGGR_TYPE (lhstype))
5744 /* Do the default thing. */;
5747 result = build_special_member_call (lhs, complete_ctor_identifier,
5748 build_tree_list (NULL_TREE, rhs),
5749 lhstype, LOOKUP_NORMAL);
5750 if (result == NULL_TREE)
5751 return error_mark_node;
5757 lhs = require_complete_type (lhs);
5758 if (lhs == error_mark_node)
5759 return error_mark_node;
5761 if (modifycode == NOP_EXPR)
5763 /* `operator=' is not an inheritable operator. */
5764 if (! IS_AGGR_TYPE (lhstype))
5765 /* Do the default thing. */;
5768 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
5769 lhs, rhs, make_node (NOP_EXPR),
5770 /*overloaded_p=*/NULL);
5771 if (result == NULL_TREE)
5772 return error_mark_node;
5779 /* A binary op has been requested. Combine the old LHS
5780 value with the RHS producing the value we should actually
5781 store into the LHS. */
5783 gcc_assert (!PROMOTES_TO_AGGR_TYPE (lhstype, REFERENCE_TYPE));
5784 lhs = stabilize_reference (lhs);
5785 newrhs = cp_build_binary_op (modifycode, lhs, rhs);
5786 if (newrhs == error_mark_node)
5788 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
5789 TREE_TYPE (lhs), TREE_TYPE (rhs));
5790 return error_mark_node;
5793 /* Now it looks like a plain assignment. */
5794 modifycode = NOP_EXPR;
5796 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
5797 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
5800 /* The left-hand side must be an lvalue. */
5801 if (!lvalue_or_else (lhs, lv_assign))
5802 return error_mark_node;
5804 /* Warn about modifying something that is `const'. Don't warn if
5805 this is initialization. */
5806 if (modifycode != INIT_EXPR
5807 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
5808 /* Functions are not modifiable, even though they are
5810 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
5811 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
5812 /* If it's an aggregate and any field is const, then it is
5813 effectively const. */
5814 || (CLASS_TYPE_P (lhstype)
5815 && C_TYPE_FIELDS_READONLY (lhstype))))
5816 readonly_error (lhs, "assignment");
5818 /* If storing into a structure or union member, it has probably been
5819 given type `int'. Compute the type that would go with the actual
5820 amount of storage the member occupies. */
5822 if (TREE_CODE (lhs) == COMPONENT_REF
5823 && (TREE_CODE (lhstype) == INTEGER_TYPE
5824 || TREE_CODE (lhstype) == REAL_TYPE
5825 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
5827 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
5829 /* If storing in a field that is in actuality a short or narrower
5830 than one, we must store in the field in its actual type. */
5832 if (lhstype != TREE_TYPE (lhs))
5834 /* Avoid warnings converting integral types back into enums for
5836 if (TREE_CODE (lhstype) == INTEGER_TYPE
5837 && TREE_CODE (olhstype) == ENUMERAL_TYPE)
5839 if (TREE_SIDE_EFFECTS (lhs))
5840 lhs = stabilize_reference (lhs);
5843 lhs = copy_node (lhs);
5844 TREE_TYPE (lhs) = lhstype;
5848 /* Convert new value to destination type. */
5850 if (TREE_CODE (lhstype) == ARRAY_TYPE)
5854 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
5855 TYPE_MAIN_VARIANT (TREE_TYPE (rhs))))
5857 error ("incompatible types in assignment of %qT to %qT",
5858 TREE_TYPE (rhs), lhstype);
5859 return error_mark_node;
5862 /* Allow array assignment in compiler-generated code. */
5863 if (! DECL_ARTIFICIAL (current_function_decl))
5865 /* This routine is used for both initialization and assignment.
5866 Make sure the diagnostic message differentiates the context. */
5867 if (modifycode == INIT_EXPR)
5868 error ("array used as initializer");
5870 error ("invalid array assignment");
5871 return error_mark_node;
5874 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
5875 ? 1 + (modifycode != INIT_EXPR): 0;
5876 return build_vec_init (lhs, NULL_TREE, newrhs,
5877 /*explicit_default_init_p=*/false,
5881 if (modifycode == INIT_EXPR)
5882 newrhs = convert_for_initialization (lhs, lhstype, newrhs, LOOKUP_NORMAL,
5883 "initialization", NULL_TREE, 0);
5886 /* Avoid warnings on enum bit fields. */
5887 if (TREE_CODE (olhstype) == ENUMERAL_TYPE
5888 && TREE_CODE (lhstype) == INTEGER_TYPE)
5890 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
5892 newrhs = convert_force (lhstype, newrhs, 0);
5895 newrhs = convert_for_assignment (lhstype, newrhs, "assignment",
5897 if (TREE_CODE (newrhs) == CALL_EXPR
5898 && TYPE_NEEDS_CONSTRUCTING (lhstype))
5899 newrhs = build_cplus_new (lhstype, newrhs);
5901 /* Can't initialize directly from a TARGET_EXPR, since that would
5902 cause the lhs to be constructed twice, and possibly result in
5903 accidental self-initialization. So we force the TARGET_EXPR to be
5904 expanded without a target. */
5905 if (TREE_CODE (newrhs) == TARGET_EXPR)
5906 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
5907 TREE_OPERAND (newrhs, 0));
5910 if (newrhs == error_mark_node)
5911 return error_mark_node;
5913 if (c_dialect_objc () && flag_objc_gc)
5915 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
5921 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
5922 lhstype, lhs, newrhs);
5924 TREE_SIDE_EFFECTS (result) = 1;
5926 TREE_NO_WARNING (result) = 1;
5928 /* If we got the LHS in a different type for storing in,
5929 convert the result back to the nominal type of LHS
5930 so that the value we return always has the same type
5931 as the LHS argument. */
5933 if (olhstype == TREE_TYPE (result))
5937 result = build2 (COMPOUND_EXPR, olhstype, result, olhs);
5938 TREE_NO_WARNING (result) = 1;
5941 return convert_for_assignment (olhstype, result, "assignment",
5946 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
5948 if (processing_template_decl)
5949 return build_min_nt (MODOP_EXPR, lhs,
5950 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
5952 if (modifycode != NOP_EXPR)
5954 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
5955 make_node (modifycode),
5956 /*overloaded_p=*/NULL);
5959 TREE_NO_WARNING (rval) = 1;
5963 return build_modify_expr (lhs, modifycode, rhs);
5967 /* Get difference in deltas for different pointer to member function
5968 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
5969 the conversion is invalid, the constant is zero. If
5970 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
5971 If C_CAST_P is true this conversion is taking place as part of a
5974 Note that the naming of FROM and TO is kind of backwards; the return
5975 value is what we add to a TO in order to get a FROM. They are named
5976 this way because we call this function to find out how to convert from
5977 a pointer to member of FROM to a pointer to member of TO. */
5980 get_delta_difference (tree from, tree to,
5981 bool allow_inverse_p,
5988 /* Assume no conversion is required. */
5989 result = integer_zero_node;
5990 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check, &kind);
5991 if (kind == bk_inaccessible || kind == bk_ambig)
5992 error (" in pointer to member function conversion");
5995 if (kind != bk_via_virtual)
5996 result = BINFO_OFFSET (binfo);
5999 tree virt_binfo = binfo_from_vbase (binfo);
6001 /* This is a reinterpret cast, we choose to do nothing. */
6002 if (allow_inverse_p)
6003 warning (0, "pointer to member cast via virtual base %qT",
6004 BINFO_TYPE (virt_binfo));
6006 error ("pointer to member conversion via virtual base %qT",
6007 BINFO_TYPE (virt_binfo));
6010 else if (same_type_ignoring_top_level_qualifiers_p (from, to))
6011 /* Pointer to member of incomplete class is permitted*/;
6012 else if (!allow_inverse_p)
6014 error_not_base_type (from, to);
6015 error (" in pointer to member conversion");
6019 binfo = lookup_base (from, to, c_cast_p ? ba_unique : ba_check, &kind);
6022 if (kind != bk_via_virtual)
6023 result = size_diffop (size_zero_node, BINFO_OFFSET (binfo));
6026 /* This is a reinterpret cast, we choose to do nothing. */
6027 tree virt_binfo = binfo_from_vbase (binfo);
6029 warning (0, "pointer to member cast via virtual base %qT",
6030 BINFO_TYPE (virt_binfo));
6035 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6039 /* Return a constructor for the pointer-to-member-function TYPE using
6040 the other components as specified. */
6043 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6048 VEC(constructor_elt, gc) *v;
6050 /* Pull the FIELD_DECLs out of the type. */
6051 pfn_field = TYPE_FIELDS (type);
6052 delta_field = TREE_CHAIN (pfn_field);
6054 /* Make sure DELTA has the type we want. */
6055 delta = convert_and_check (delta_type_node, delta);
6057 /* Finish creating the initializer. */
6058 v = VEC_alloc(constructor_elt, gc, 2);
6059 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6060 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6061 u = build_constructor (type, v);
6062 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6063 TREE_INVARIANT (u) = TREE_INVARIANT (pfn) & TREE_INVARIANT (delta);
6064 TREE_STATIC (u) = (TREE_CONSTANT (u)
6065 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6067 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6072 /* Build a constructor for a pointer to member function. It can be
6073 used to initialize global variables, local variable, or used
6074 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6077 If FORCE is nonzero, then force this conversion, even if
6078 we would rather not do it. Usually set when using an explicit
6079 cast. A C-style cast is being processed iff C_CAST_P is true.
6081 Return error_mark_node, if something goes wrong. */
6084 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p)
6090 if (error_operand_p (pfn))
6091 return error_mark_node;
6093 pfn_type = TREE_TYPE (pfn);
6094 to_type = build_ptrmemfunc_type (type);
6096 /* Handle multiple conversions of pointer to member functions. */
6097 if (TYPE_PTRMEMFUNC_P (pfn_type))
6099 tree delta = NULL_TREE;
6100 tree npfn = NULL_TREE;
6104 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
6105 error ("invalid conversion to type %qT from type %qT",
6108 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6109 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6113 /* We don't have to do any conversion to convert a
6114 pointer-to-member to its own type. But, we don't want to
6115 just return a PTRMEM_CST if there's an explicit cast; that
6116 cast should make the expression an invalid template argument. */
6117 if (TREE_CODE (pfn) != PTRMEM_CST)
6119 if (same_type_p (to_type, pfn_type))
6121 else if (integer_zerop (n))
6122 return build_reinterpret_cast (to_type, pfn);
6125 if (TREE_SIDE_EFFECTS (pfn))
6126 pfn = save_expr (pfn);
6128 /* Obtain the function pointer and the current DELTA. */
6129 if (TREE_CODE (pfn) == PTRMEM_CST)
6130 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
6133 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
6134 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
6137 /* Just adjust the DELTA field. */
6138 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6139 (TREE_TYPE (delta), ptrdiff_type_node));
6140 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
6141 n = cp_build_binary_op (LSHIFT_EXPR, n, integer_one_node);
6142 delta = cp_build_binary_op (PLUS_EXPR, delta, n);
6143 return build_ptrmemfunc1 (to_type, delta, npfn);
6146 /* Handle null pointer to member function conversions. */
6147 if (integer_zerop (pfn))
6149 pfn = build_c_cast (type, integer_zero_node);
6150 return build_ptrmemfunc1 (to_type,
6155 if (type_unknown_p (pfn))
6156 return instantiate_type (type, pfn, tf_warning_or_error);
6158 fn = TREE_OPERAND (pfn, 0);
6159 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
6160 /* In a template, we will have preserved the
6162 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
6163 return make_ptrmem_cst (to_type, fn);
6166 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6169 ??? There is no consistency as to the types returned for the above
6170 values. Some code acts as if it were a sizetype and some as if it were
6171 integer_type_node. */
6174 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
6176 tree type = TREE_TYPE (cst);
6177 tree fn = PTRMEM_CST_MEMBER (cst);
6178 tree ptr_class, fn_class;
6180 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6182 /* The class that the function belongs to. */
6183 fn_class = DECL_CONTEXT (fn);
6185 /* The class that we're creating a pointer to member of. */
6186 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
6188 /* First, calculate the adjustment to the function's class. */
6189 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
6192 if (!DECL_VIRTUAL_P (fn))
6193 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
6196 /* If we're dealing with a virtual function, we have to adjust 'this'
6197 again, to point to the base which provides the vtable entry for
6198 fn; the call will do the opposite adjustment. */
6199 tree orig_class = DECL_CONTEXT (fn);
6200 tree binfo = binfo_or_else (orig_class, fn_class);
6201 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6202 *delta, BINFO_OFFSET (binfo));
6203 *delta = fold_if_not_in_template (*delta);
6205 /* We set PFN to the vtable offset at which the function can be
6206 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6207 case delta is shifted left, and then incremented). */
6208 *pfn = DECL_VINDEX (fn);
6209 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
6210 TYPE_SIZE_UNIT (vtable_entry_type));
6211 *pfn = fold_if_not_in_template (*pfn);
6213 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
6215 case ptrmemfunc_vbit_in_pfn:
6216 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
6218 *pfn = fold_if_not_in_template (*pfn);
6221 case ptrmemfunc_vbit_in_delta:
6222 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
6223 *delta, integer_one_node);
6224 *delta = fold_if_not_in_template (*delta);
6225 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6226 *delta, integer_one_node);
6227 *delta = fold_if_not_in_template (*delta);
6234 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
6235 *pfn = fold_if_not_in_template (*pfn);
6239 /* Return an expression for PFN from the pointer-to-member function
6243 pfn_from_ptrmemfunc (tree t)
6245 if (TREE_CODE (t) == PTRMEM_CST)
6250 expand_ptrmemfunc_cst (t, &delta, &pfn);
6255 return build_ptrmemfunc_access_expr (t, pfn_identifier);
6258 /* Convert value RHS to type TYPE as preparation for an assignment to
6259 an lvalue of type TYPE. ERRTYPE is a string to use in error
6260 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6261 are doing the conversion in order to pass the PARMNUMth argument of
6265 convert_for_assignment (tree type, tree rhs,
6266 const char *errtype, tree fndecl, int parmnum)
6269 enum tree_code coder;
6271 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6272 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6273 rhs = TREE_OPERAND (rhs, 0);
6275 rhstype = TREE_TYPE (rhs);
6276 coder = TREE_CODE (rhstype);
6278 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
6279 && vector_types_convertible_p (type, rhstype, true))
6280 return convert (type, rhs);
6282 if (rhs == error_mark_node || rhstype == error_mark_node)
6283 return error_mark_node;
6284 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
6285 return error_mark_node;
6287 /* The RHS of an assignment cannot have void type. */
6288 if (coder == VOID_TYPE)
6290 error ("void value not ignored as it ought to be");
6291 return error_mark_node;
6294 /* Simplify the RHS if possible. */
6295 if (TREE_CODE (rhs) == CONST_DECL)
6296 rhs = DECL_INITIAL (rhs);
6298 if (c_dialect_objc ())
6301 tree rname = fndecl;
6303 if (!strcmp (errtype, "assignment"))
6305 else if (!strcmp (errtype, "initialization"))
6309 tree selector = objc_message_selector ();
6313 if (selector && parmno > 1)
6320 if (objc_compare_types (type, rhstype, parmno, rname))
6321 return convert (type, rhs);
6326 The expression is implicitly converted (clause _conv_) to the
6327 cv-unqualified type of the left operand.
6329 We allow bad conversions here because by the time we get to this point
6330 we are committed to doing the conversion. If we end up doing a bad
6331 conversion, convert_like will complain. */
6332 if (!can_convert_arg_bad (type, rhstype, rhs))
6334 /* When -Wno-pmf-conversions is use, we just silently allow
6335 conversions from pointers-to-members to plain pointers. If
6336 the conversion doesn't work, cp_convert will complain. */
6338 && TYPE_PTR_P (type)
6339 && TYPE_PTRMEMFUNC_P (rhstype))
6340 rhs = cp_convert (strip_top_quals (type), rhs);
6343 /* If the right-hand side has unknown type, then it is an
6344 overloaded function. Call instantiate_type to get error
6346 if (rhstype == unknown_type_node)
6347 instantiate_type (type, rhs, tf_warning_or_error);
6349 error ("cannot convert %qT to %qT for argument %qP to %qD",
6350 rhstype, type, parmnum, fndecl);
6352 error ("cannot convert %qT to %qT in %s", rhstype, type, errtype);
6353 return error_mark_node;
6356 if (warn_missing_format_attribute)
6358 const enum tree_code codel = TREE_CODE (type);
6359 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6361 && check_missing_format_attribute (type, rhstype))
6362 warning (OPT_Wmissing_format_attribute,
6363 "%s might be a candidate for a format attribute",
6367 /* If -Wparentheses, warn about a = b = c when a has type bool and b
6369 if (warn_parentheses
6370 && type == boolean_type_node
6371 && TREE_CODE (rhs) == MODIFY_EXPR
6372 && !TREE_NO_WARNING (rhs)
6373 && TREE_TYPE (rhs) != boolean_type_node)
6375 warning (OPT_Wparentheses,
6376 "suggest parentheses around assignment used as truth value");
6377 TREE_NO_WARNING (rhs) = 1;
6380 return perform_implicit_conversion (strip_top_quals (type), rhs);
6383 /* Convert RHS to be of type TYPE.
6384 If EXP is nonzero, it is the target of the initialization.
6385 ERRTYPE is a string to use in error messages.
6387 Two major differences between the behavior of
6388 `convert_for_assignment' and `convert_for_initialization'
6389 are that references are bashed in the former, while
6390 copied in the latter, and aggregates are assigned in
6391 the former (operator=) while initialized in the
6394 If using constructor make sure no conversion operator exists, if one does
6395 exist, an ambiguity exists.
6397 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6400 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
6401 const char *errtype, tree fndecl, int parmnum)
6403 enum tree_code codel = TREE_CODE (type);
6405 enum tree_code coder;
6407 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6408 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6409 if (TREE_CODE (rhs) == NOP_EXPR
6410 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6411 && codel != REFERENCE_TYPE)
6412 rhs = TREE_OPERAND (rhs, 0);
6414 if (type == error_mark_node
6415 || rhs == error_mark_node
6416 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6417 return error_mark_node;
6419 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6420 && TREE_CODE (type) != ARRAY_TYPE
6421 && (TREE_CODE (type) != REFERENCE_TYPE
6422 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6423 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6424 && (TREE_CODE (type) != REFERENCE_TYPE
6425 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
6426 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6427 rhs = decay_conversion (rhs);
6429 rhstype = TREE_TYPE (rhs);
6430 coder = TREE_CODE (rhstype);
6432 if (coder == ERROR_MARK)
6433 return error_mark_node;
6435 /* We accept references to incomplete types, so we can
6436 return here before checking if RHS is of complete type. */
6438 if (codel == REFERENCE_TYPE)
6440 /* This should eventually happen in convert_arguments. */
6441 int savew = 0, savee = 0;
6444 savew = warningcount, savee = errorcount;
6445 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
6449 if (warningcount > savew)
6450 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
6451 else if (errorcount > savee)
6452 error ("in passing argument %P of %q+D", parmnum, fndecl);
6458 exp = require_complete_type (exp);
6459 if (exp == error_mark_node)
6460 return error_mark_node;
6462 rhstype = non_reference (rhstype);
6464 type = complete_type (type);
6466 if (IS_AGGR_TYPE (type))
6467 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
6469 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum);
6472 /* If RETVAL is the address of, or a reference to, a local variable or
6473 temporary give an appropriate warning. */
6476 maybe_warn_about_returning_address_of_local (tree retval)
6478 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
6479 tree whats_returned = retval;
6483 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
6484 whats_returned = TREE_OPERAND (whats_returned, 1);
6485 else if (TREE_CODE (whats_returned) == CONVERT_EXPR
6486 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR
6487 || TREE_CODE (whats_returned) == NOP_EXPR)
6488 whats_returned = TREE_OPERAND (whats_returned, 0);
6493 if (TREE_CODE (whats_returned) != ADDR_EXPR)
6495 whats_returned = TREE_OPERAND (whats_returned, 0);
6497 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6499 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
6500 || TREE_CODE (whats_returned) == TARGET_EXPR)
6502 warning (0, "returning reference to temporary");
6505 if (TREE_CODE (whats_returned) == VAR_DECL
6506 && DECL_NAME (whats_returned)
6507 && TEMP_NAME_P (DECL_NAME (whats_returned)))
6509 warning (0, "reference to non-lvalue returned");
6514 while (TREE_CODE (whats_returned) == COMPONENT_REF
6515 || TREE_CODE (whats_returned) == ARRAY_REF)
6516 whats_returned = TREE_OPERAND (whats_returned, 0);
6518 if (DECL_P (whats_returned)
6519 && DECL_NAME (whats_returned)
6520 && DECL_FUNCTION_SCOPE_P (whats_returned)
6521 && !(TREE_STATIC (whats_returned)
6522 || TREE_PUBLIC (whats_returned)))
6524 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6525 warning (0, "reference to local variable %q+D returned",
6528 warning (0, "address of local variable %q+D returned",
6534 /* Check that returning RETVAL from the current function is valid.
6535 Return an expression explicitly showing all conversions required to
6536 change RETVAL into the function return type, and to assign it to
6537 the DECL_RESULT for the function. Set *NO_WARNING to true if
6538 code reaches end of non-void function warning shouldn't be issued
6539 on this RETURN_EXPR. */
6542 check_return_expr (tree retval, bool *no_warning)
6545 /* The type actually returned by the function, after any
6548 int fn_returns_value_p;
6549 bool named_return_value_okay_p;
6551 *no_warning = false;
6553 /* A `volatile' function is one that isn't supposed to return, ever.
6554 (This is a G++ extension, used to get better code for functions
6555 that call the `volatile' function.) */
6556 if (TREE_THIS_VOLATILE (current_function_decl))
6557 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6559 /* Check for various simple errors. */
6560 if (DECL_DESTRUCTOR_P (current_function_decl))
6563 error ("returning a value from a destructor");
6566 else if (DECL_CONSTRUCTOR_P (current_function_decl))
6568 if (in_function_try_handler)
6569 /* If a return statement appears in a handler of the
6570 function-try-block of a constructor, the program is ill-formed. */
6571 error ("cannot return from a handler of a function-try-block of a constructor");
6573 /* You can't return a value from a constructor. */
6574 error ("returning a value from a constructor");
6578 if (processing_template_decl)
6580 current_function_returns_value = 1;
6581 check_for_bare_parameter_packs (retval);
6585 /* When no explicit return-value is given in a function with a named
6586 return value, the named return value is used. */
6587 result = DECL_RESULT (current_function_decl);
6588 valtype = TREE_TYPE (result);
6589 gcc_assert (valtype != NULL_TREE);
6590 fn_returns_value_p = !VOID_TYPE_P (valtype);
6591 if (!retval && DECL_NAME (result) && fn_returns_value_p)
6594 /* Check for a return statement with no return value in a function
6595 that's supposed to return a value. */
6596 if (!retval && fn_returns_value_p)
6598 pedwarn ("return-statement with no value, in function returning %qT",
6600 /* Clear this, so finish_function won't say that we reach the
6601 end of a non-void function (which we don't, we gave a
6603 current_function_returns_null = 0;
6604 /* And signal caller that TREE_NO_WARNING should be set on the
6605 RETURN_EXPR to avoid control reaches end of non-void function
6606 warnings in tree-cfg.c. */
6609 /* Check for a return statement with a value in a function that
6610 isn't supposed to return a value. */
6611 else if (retval && !fn_returns_value_p)
6613 if (VOID_TYPE_P (TREE_TYPE (retval)))
6614 /* You can return a `void' value from a function of `void'
6615 type. In that case, we have to evaluate the expression for
6616 its side-effects. */
6617 finish_expr_stmt (retval);
6619 pedwarn ("return-statement with a value, in function "
6620 "returning 'void'");
6622 current_function_returns_null = 1;
6624 /* There's really no value to return, after all. */
6628 /* Remember that this function can sometimes return without a
6630 current_function_returns_null = 1;
6632 /* Remember that this function did return a value. */
6633 current_function_returns_value = 1;
6635 /* Check for erroneous operands -- but after giving ourselves a
6636 chance to provide an error about returning a value from a void
6638 if (error_operand_p (retval))
6640 current_function_return_value = error_mark_node;
6641 return error_mark_node;
6644 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6645 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
6646 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
6647 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
6649 && retval && null_ptr_cst_p (retval))
6650 warning (0, "%<operator new%> must not return NULL unless it is "
6651 "declared %<throw()%> (or -fcheck-new is in effect)");
6653 /* Effective C++ rule 15. See also start_function. */
6655 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
6659 /* The function return type must be a reference to the current
6661 if (TREE_CODE (valtype) == REFERENCE_TYPE
6662 && same_type_ignoring_top_level_qualifiers_p
6663 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
6665 /* Returning '*this' is obviously OK. */
6666 if (retval == current_class_ref)
6668 /* If we are calling a function whose return type is the same of
6669 the current class reference, it is ok. */
6670 else if (TREE_CODE (retval) == INDIRECT_REF
6671 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
6676 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
6679 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6681 [...] For a function with a class return type, if the expression
6682 in the return statement is the name of a local object, and the cv-
6683 unqualified type of the local object is the same as the function
6684 return type, an implementation is permitted to omit creating the tem-
6685 porary object to hold the function return value [...]
6687 So, if this is a value-returning function that always returns the same
6688 local variable, remember it.
6690 It might be nice to be more flexible, and choose the first suitable
6691 variable even if the function sometimes returns something else, but
6692 then we run the risk of clobbering the variable we chose if the other
6693 returned expression uses the chosen variable somehow. And people expect
6694 this restriction, anyway. (jason 2000-11-19)
6696 See finish_function and finalize_nrv for the rest of this optimization. */
6698 named_return_value_okay_p =
6699 (retval != NULL_TREE
6700 /* Must be a local, automatic variable. */
6701 && TREE_CODE (retval) == VAR_DECL
6702 && DECL_CONTEXT (retval) == current_function_decl
6703 && ! TREE_STATIC (retval)
6704 && (DECL_ALIGN (retval)
6705 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
6706 /* The cv-unqualified type of the returned value must be the
6707 same as the cv-unqualified return type of the
6709 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
6711 (TREE_TYPE (TREE_TYPE (current_function_decl))))));
6713 if (fn_returns_value_p && flag_elide_constructors)
6715 if (named_return_value_okay_p
6716 && (current_function_return_value == NULL_TREE
6717 || current_function_return_value == retval))
6718 current_function_return_value = retval;
6720 current_function_return_value = error_mark_node;
6723 /* We don't need to do any conversions when there's nothing being
6728 /* Do any required conversions. */
6729 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
6730 /* No conversions are required. */
6734 /* The type the function is declared to return. */
6735 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
6736 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
6738 /* The functype's return type will have been set to void, if it
6739 was an incomplete type. Just treat this as 'return;' */
6740 if (VOID_TYPE_P (functype))
6741 return error_mark_node;
6743 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
6744 treated as an rvalue for the purposes of overload resolution to
6745 favor move constructors over copy constructors. */
6746 if ((cxx_dialect != cxx98)
6747 && named_return_value_okay_p
6748 /* The variable must not have the `volatile' qualifier. */
6749 && !(cp_type_quals (TREE_TYPE (retval)) & TYPE_QUAL_VOLATILE)
6750 /* The return type must be a class type. */
6751 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
6752 flags = flags | LOOKUP_PREFER_RVALUE;
6754 /* First convert the value to the function's return type, then
6755 to the type of return value's location to handle the
6756 case that functype is smaller than the valtype. */
6757 retval = convert_for_initialization
6758 (NULL_TREE, functype, retval, flags, "return", NULL_TREE, 0);
6759 retval = convert (valtype, retval);
6761 /* If the conversion failed, treat this just like `return;'. */
6762 if (retval == error_mark_node)
6764 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6765 else if (! current_function_returns_struct
6766 && TREE_CODE (retval) == TARGET_EXPR
6767 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
6768 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
6769 TREE_OPERAND (retval, 0));
6771 maybe_warn_about_returning_address_of_local (retval);
6774 /* Actually copy the value returned into the appropriate location. */
6775 if (retval && retval != result)
6776 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
6782 /* Returns nonzero if the pointer-type FROM can be converted to the
6783 pointer-type TO via a qualification conversion. If CONSTP is -1,
6784 then we return nonzero if the pointers are similar, and the
6785 cv-qualification signature of FROM is a proper subset of that of TO.
6787 If CONSTP is positive, then all outer pointers have been
6791 comp_ptr_ttypes_real (tree to, tree from, int constp)
6793 bool to_more_cv_qualified = false;
6795 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
6797 if (TREE_CODE (to) != TREE_CODE (from))
6800 if (TREE_CODE (from) == OFFSET_TYPE
6801 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
6802 TYPE_OFFSET_BASETYPE (to)))
6805 /* Const and volatile mean something different for function types,
6806 so the usual checks are not appropriate. */
6807 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
6809 /* In Objective-C++, some types may have been 'volatilized' by
6810 the compiler for EH; when comparing them here, the volatile
6811 qualification must be ignored. */
6812 bool objc_quals_match = objc_type_quals_match (to, from);
6814 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
6817 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
6821 to_more_cv_qualified = true;
6825 constp &= TYPE_READONLY (to);
6828 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
6829 return ((constp >= 0 || to_more_cv_qualified)
6830 && same_type_ignoring_top_level_qualifiers_p (to, from));
6834 /* When comparing, say, char ** to char const **, this function takes
6835 the 'char *' and 'char const *'. Do not pass non-pointer/reference
6836 types to this function. */
6839 comp_ptr_ttypes (tree to, tree from)
6841 return comp_ptr_ttypes_real (to, from, 1);
6844 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6845 type or inheritance-related types, regardless of cv-quals. */
6848 ptr_reasonably_similar (tree to, tree from)
6850 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
6852 /* Any target type is similar enough to void. */
6853 if (TREE_CODE (to) == VOID_TYPE
6854 || TREE_CODE (from) == VOID_TYPE)
6857 if (TREE_CODE (to) != TREE_CODE (from))
6860 if (TREE_CODE (from) == OFFSET_TYPE
6861 && comptypes (TYPE_OFFSET_BASETYPE (to),
6862 TYPE_OFFSET_BASETYPE (from),
6863 COMPARE_BASE | COMPARE_DERIVED))
6866 if (TREE_CODE (to) == VECTOR_TYPE
6867 && vector_types_convertible_p (to, from, false))
6870 if (TREE_CODE (to) == INTEGER_TYPE
6871 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
6874 if (TREE_CODE (to) == FUNCTION_TYPE)
6877 if (TREE_CODE (to) != POINTER_TYPE)
6879 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
6880 COMPARE_BASE | COMPARE_DERIVED);
6884 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
6885 pointer-to-member types) are the same, ignoring cv-qualification at
6889 comp_ptr_ttypes_const (tree to, tree from)
6891 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
6893 if (TREE_CODE (to) != TREE_CODE (from))
6896 if (TREE_CODE (from) == OFFSET_TYPE
6897 && same_type_p (TYPE_OFFSET_BASETYPE (from),
6898 TYPE_OFFSET_BASETYPE (to)))
6901 if (TREE_CODE (to) != POINTER_TYPE)
6902 return same_type_ignoring_top_level_qualifiers_p (to, from);
6906 /* Returns the type qualifiers for this type, including the qualifiers on the
6907 elements for an array type. */
6910 cp_type_quals (tree type)
6912 type = strip_array_types (type);
6913 if (type == error_mark_node)
6914 return TYPE_UNQUALIFIED;
6915 return TYPE_QUALS (type);
6918 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
6922 cp_type_readonly (tree type)
6924 type = strip_array_types (type);
6925 return TYPE_READONLY (type);
6928 /* Returns nonzero if the TYPE contains a mutable member. */
6931 cp_has_mutable_p (tree type)
6933 type = strip_array_types (type);
6935 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
6938 /* Apply the TYPE_QUALS to the new DECL. */
6940 cp_apply_type_quals_to_decl (int type_quals, tree decl)
6942 tree type = TREE_TYPE (decl);
6944 if (type == error_mark_node)
6947 if (TREE_CODE (type) == FUNCTION_TYPE
6948 && type_quals != TYPE_UNQUALIFIED)
6950 /* This was an error in C++98 (cv-qualifiers cannot be added to
6951 a function type), but DR 295 makes the code well-formed by
6952 dropping the extra qualifiers. */
6955 tree bad_type = build_qualified_type (type, type_quals);
6956 pedwarn ("ignoring %qV qualifiers added to function type %qT",
6960 TREE_TYPE (decl) = TYPE_MAIN_VARIANT (type);
6964 /* Avoid setting TREE_READONLY incorrectly. */
6965 if (/* If the object has a constructor, the constructor may modify
6967 TYPE_NEEDS_CONSTRUCTING (type)
6968 /* If the type isn't complete, we don't know yet if it will need
6970 || !COMPLETE_TYPE_P (type)
6971 /* If the type has a mutable component, that component might be
6973 || TYPE_HAS_MUTABLE_P (type))
6974 type_quals &= ~TYPE_QUAL_CONST;
6976 c_apply_type_quals_to_decl (type_quals, decl);
6979 /* Subroutine of casts_away_constness. Make T1 and T2 point at
6980 exemplar types such that casting T1 to T2 is casting away constness
6981 if and only if there is no implicit conversion from T1 to T2. */
6984 casts_away_constness_r (tree *t1, tree *t2)
6989 /* [expr.const.cast]
6991 For multi-level pointer to members and multi-level mixed pointers
6992 and pointers to members (conv.qual), the "member" aspect of a
6993 pointer to member level is ignored when determining if a const
6994 cv-qualifier has been cast away. */
6995 /* [expr.const.cast]
6997 For two pointer types:
6999 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7000 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7003 casting from X1 to X2 casts away constness if, for a non-pointer
7004 type T there does not exist an implicit conversion (clause
7007 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7011 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7012 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
7013 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
7015 *t1 = cp_build_qualified_type (void_type_node,
7016 cp_type_quals (*t1));
7017 *t2 = cp_build_qualified_type (void_type_node,
7018 cp_type_quals (*t2));
7022 quals1 = cp_type_quals (*t1);
7023 quals2 = cp_type_quals (*t2);
7025 if (TYPE_PTRMEM_P (*t1))
7026 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
7028 *t1 = TREE_TYPE (*t1);
7029 if (TYPE_PTRMEM_P (*t2))
7030 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
7032 *t2 = TREE_TYPE (*t2);
7034 casts_away_constness_r (t1, t2);
7035 *t1 = build_pointer_type (*t1);
7036 *t2 = build_pointer_type (*t2);
7037 *t1 = cp_build_qualified_type (*t1, quals1);
7038 *t2 = cp_build_qualified_type (*t2, quals2);
7041 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7045 casts_away_constness (tree t1, tree t2)
7047 if (TREE_CODE (t2) == REFERENCE_TYPE)
7049 /* [expr.const.cast]
7051 Casting from an lvalue of type T1 to an lvalue of type T2
7052 using a reference cast casts away constness if a cast from an
7053 rvalue of type "pointer to T1" to the type "pointer to T2"
7054 casts away constness. */
7055 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
7056 return casts_away_constness (build_pointer_type (t1),
7057 build_pointer_type (TREE_TYPE (t2)));
7060 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
7061 /* [expr.const.cast]
7063 Casting from an rvalue of type "pointer to data member of X
7064 of type T1" to the type "pointer to data member of Y of type
7065 T2" casts away constness if a cast from an rvalue of type
7066 "pointer to T1" to the type "pointer to T2" casts away
7068 return casts_away_constness
7069 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
7070 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
7072 /* Casting away constness is only something that makes sense for
7073 pointer or reference types. */
7074 if (TREE_CODE (t1) != POINTER_TYPE
7075 || TREE_CODE (t2) != POINTER_TYPE)
7078 /* Top-level qualifiers don't matter. */
7079 t1 = TYPE_MAIN_VARIANT (t1);
7080 t2 = TYPE_MAIN_VARIANT (t2);
7081 casts_away_constness_r (&t1, &t2);
7082 if (!can_convert (t2, t1))
7088 /* If T is a REFERENCE_TYPE return the type to which T refers.
7089 Otherwise, return T itself. */
7092 non_reference (tree t)
7094 if (TREE_CODE (t) == REFERENCE_TYPE)
7100 /* Return nonzero if REF is an lvalue valid for this language;
7101 otherwise, print an error message and return zero. USE says
7102 how the lvalue is being used and so selects the error message. */
7105 lvalue_or_else (tree ref, enum lvalue_use use)
7107 int win = lvalue_p (ref);