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, 2008, 2009, 2010, 2011
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"
37 #include "diagnostic.h"
41 #include "c-family/c-common.h"
42 #include "c-family/c-objc.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 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 (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
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 void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp
)
171 return (TREE_CODE (exp
) == TREE_LIST
172 || TREE_TYPE (exp
) == unknown_type_node
);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1
, tree p2
)
186 tree oldargs
= p1
, newargs
, n
;
190 len
= list_length (p1
);
191 newargs
= tree_last (p1
);
193 if (newargs
== void_list_node
)
202 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
207 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
209 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
214 else if (! TREE_PURPOSE (p1
))
216 if (TREE_PURPOSE (p2
))
218 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
226 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
231 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
234 TREE_VALUE (n
) = TREE_VALUE (p1
);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t
)
247 int quals
= cp_type_quals (t
);
248 while (t
!= error_mark_node
249 && TYPE_NAME (t
) != NULL_TREE
)
251 tree x
= TYPE_NAME (t
);
252 if (TREE_CODE (x
) != TYPE_DECL
)
254 x
= DECL_ORIGINAL_TYPE (x
);
259 return cp_build_qualified_type (t
, quals
);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1
, tree t2
)
270 enum tree_code code1
= TREE_CODE (t1
);
271 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || TREE_CODE (t1
) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || TREE_CODE (t2
) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 if (int128_integer_type_node
!= NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
369 int128_integer_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
),
371 int128_integer_type_node
)))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node
);
376 return build_type_attribute_variant (t
, attributes
);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
382 return build_type_attribute_variant (long_unsigned_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? long_unsigned_type_node
: long_integer_type_node
);
389 return build_type_attribute_variant (t
, attributes
);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1
))
393 return build_type_attribute_variant (t1
, attributes
);
395 return build_type_attribute_variant (t2
, attributes
);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
400 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
401 return build_type_attribute_variant (long_double_type_node
,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
404 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
405 return build_type_attribute_variant (double_type_node
,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
409 return build_type_attribute_variant (float_type_node
,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1
, attributes
);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
428 gcc_assert (ARITHMETIC_TYPE_P (t1
)
429 || TREE_CODE (t1
) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1
));
431 gcc_assert (ARITHMETIC_TYPE_P (t2
)
432 || TREE_CODE (t2
) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2
));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
439 t1
= type_promotes_to (t1
);
440 t2
= type_promotes_to (t2
);
443 return cp_common_type (t1
, t2
);
447 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
448 composite_pointer_operation operation
)
453 emit_diagnostic (kind
, input_location
, 0,
454 "comparison between "
455 "distinct pointer types %qT and %qT lacks a cast",
459 emit_diagnostic (kind
, input_location
, 0,
460 "conversion between "
461 "distinct pointer types %qT and %qT lacks a cast",
464 case CPO_CONDITIONAL_EXPR
:
465 emit_diagnostic (kind
, input_location
, 0,
466 "conditional expression between "
467 "distinct pointer types %qT and %qT lacks a cast",
475 /* Subroutine of composite_pointer_type to implement the recursive
476 case. See that function for documentation of the parameters. */
479 composite_pointer_type_r (tree t1
, tree t2
,
480 composite_pointer_operation operation
,
481 tsubst_flags_t complain
)
488 /* Determine the types pointed to by T1 and T2. */
489 if (TREE_CODE (t1
) == POINTER_TYPE
)
491 pointee1
= TREE_TYPE (t1
);
492 pointee2
= TREE_TYPE (t2
);
496 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
497 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
502 Otherwise, the composite pointer type is a pointer type
503 similar (_conv.qual_) to the type of one of the operands,
504 with a cv-qualification signature (_conv.qual_) that is the
505 union of the cv-qualification signatures of the operand
507 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
508 result_type
= pointee1
;
509 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
510 && TREE_CODE (pointee2
) == POINTER_TYPE
)
511 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
512 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
513 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
517 if (complain
& tf_error
)
518 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
520 result_type
= void_type_node
;
522 result_type
= cp_build_qualified_type (result_type
,
523 (cp_type_quals (pointee1
)
524 | cp_type_quals (pointee2
)));
525 /* If the original types were pointers to members, so is the
527 if (TYPE_PTR_TO_MEMBER_P (t1
))
529 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
530 TYPE_PTRMEM_CLASS_TYPE (t2
))
531 && (complain
& tf_error
))
532 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
533 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
537 result_type
= build_pointer_type (result_type
);
539 /* Merge the attributes. */
540 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
541 return build_type_attribute_variant (result_type
, attributes
);
544 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
545 ARG1 and ARG2 are the values with those types. The OPERATION is to
546 describe the operation between the pointer types,
547 in case an error occurs.
549 This routine also implements the computation of a common type for
550 pointers-to-members as per [expr.eq]. */
553 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
554 composite_pointer_operation operation
,
555 tsubst_flags_t complain
)
562 If one operand is a null pointer constant, the composite pointer
563 type is the type of the other operand. */
564 if (null_ptr_cst_p (arg1
))
566 if (null_ptr_cst_p (arg2
))
573 If one of the operands has type "pointer to cv1 void*", then
574 the other has type "pointer to cv2T", and the composite pointer
575 type is "pointer to cv12 void", where cv12 is the union of cv1
578 If either type is a pointer to void, make sure it is T1. */
579 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
587 /* Now, if T1 is a pointer to void, merge the qualifiers. */
588 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
593 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
598 pedwarn (input_location
, OPT_pedantic
,
599 "ISO C++ forbids comparison between "
600 "pointer of type %<void *%> and pointer-to-function");
603 pedwarn (input_location
, OPT_pedantic
,
604 "ISO C++ forbids conversion between "
605 "pointer of type %<void *%> and pointer-to-function");
607 case CPO_CONDITIONAL_EXPR
:
608 pedwarn (input_location
, OPT_pedantic
,
609 "ISO C++ forbids conditional expression between "
610 "pointer of type %<void *%> and pointer-to-function");
617 = cp_build_qualified_type (void_type_node
,
618 (cp_type_quals (TREE_TYPE (t1
))
619 | cp_type_quals (TREE_TYPE (t2
))));
620 result_type
= build_pointer_type (result_type
);
621 /* Merge the attributes. */
622 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
623 return build_type_attribute_variant (result_type
, attributes
);
626 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
627 && TREE_CODE (t2
) == POINTER_TYPE
)
629 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
630 return objc_common_type (t1
, t2
);
633 /* [expr.eq] permits the application of a pointer conversion to
634 bring the pointers to a common type. */
635 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
636 && CLASS_TYPE_P (TREE_TYPE (t1
))
637 && CLASS_TYPE_P (TREE_TYPE (t2
))
638 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
641 class1
= TREE_TYPE (t1
);
642 class2
= TREE_TYPE (t2
);
644 if (DERIVED_FROM_P (class1
, class2
))
645 t2
= (build_pointer_type
646 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
647 else if (DERIVED_FROM_P (class2
, class1
))
648 t1
= (build_pointer_type
649 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
652 if (complain
& tf_error
)
653 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
654 return error_mark_node
;
657 /* [expr.eq] permits the application of a pointer-to-member
658 conversion to change the class type of one of the types. */
659 else if (TYPE_PTR_TO_MEMBER_P (t1
)
660 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
661 TYPE_PTRMEM_CLASS_TYPE (t2
)))
663 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
664 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
666 if (DERIVED_FROM_P (class1
, class2
))
667 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
668 else if (DERIVED_FROM_P (class2
, class1
))
669 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
672 if (complain
& tf_error
)
676 error ("comparison between distinct "
677 "pointer-to-member types %qT and %qT lacks a cast",
681 error ("conversion between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
685 case CPO_CONDITIONAL_EXPR
:
686 error ("conditional expression between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
693 return error_mark_node
;
697 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
700 /* Return the merged type of two types.
701 We assume that comptypes has already been done and returned 1;
702 if that isn't so, this may crash.
704 This just combines attributes and default arguments; any other
705 differences would cause the two types to compare unalike. */
708 merge_types (tree t1
, tree t2
)
710 enum tree_code code1
;
711 enum tree_code code2
;
714 /* Save time if the two types are the same. */
717 if (original_type (t1
) == original_type (t2
))
720 /* If one type is nonsense, use the other. */
721 if (t1
== error_mark_node
)
723 if (t2
== error_mark_node
)
726 /* Merge the attributes. */
727 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
729 if (TYPE_PTRMEMFUNC_P (t1
))
730 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
731 if (TYPE_PTRMEMFUNC_P (t2
))
732 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
734 code1
= TREE_CODE (t1
);
735 code2
= TREE_CODE (t2
);
738 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
739 if (code1
== TYPENAME_TYPE
)
741 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
742 code1
= TREE_CODE (t1
);
746 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
747 code2
= TREE_CODE (t2
);
755 /* For two pointers, do this recursively on the target type. */
757 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
758 int quals
= cp_type_quals (t1
);
760 if (code1
== POINTER_TYPE
)
761 t1
= build_pointer_type (target
);
763 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
764 t1
= build_type_attribute_variant (t1
, attributes
);
765 t1
= cp_build_qualified_type (t1
, quals
);
767 if (TREE_CODE (target
) == METHOD_TYPE
)
768 t1
= build_ptrmemfunc_type (t1
);
777 quals
= cp_type_quals (t1
);
778 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
779 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
780 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
782 t1
= cp_build_qualified_type (t1
, quals
);
788 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
789 /* Save space: see if the result is identical to one of the args. */
790 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
791 return build_type_attribute_variant (t1
, attributes
);
792 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
793 return build_type_attribute_variant (t2
, attributes
);
794 /* Merge the element types, and have a size if either arg has one. */
795 t1
= build_cplus_array_type
796 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
801 /* Function types: prefer the one that specified arg types.
802 If both do, merge the arg types. Also merge the return types. */
804 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
805 tree p1
= TYPE_ARG_TYPES (t1
);
806 tree p2
= TYPE_ARG_TYPES (t2
);
810 /* Save space: see if the result is identical to one of the args. */
811 if (valtype
== TREE_TYPE (t1
) && ! p2
)
812 return cp_build_type_attribute_variant (t1
, attributes
);
813 if (valtype
== TREE_TYPE (t2
) && ! p1
)
814 return cp_build_type_attribute_variant (t2
, attributes
);
816 /* Simple way if one arg fails to specify argument types. */
817 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
819 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
822 parms
= commonparms (p1
, p2
);
824 rval
= build_function_type (valtype
, parms
);
825 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
826 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
827 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
828 TYPE_RAISES_EXCEPTIONS (t2
));
829 t1
= build_exception_variant (rval
, raises
);
835 /* Get this value the long way, since TYPE_METHOD_BASETYPE
836 is just the main variant of this. */
837 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
838 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
839 TYPE_RAISES_EXCEPTIONS (t2
));
842 /* If this was a member function type, get back to the
843 original type of type member function (i.e., without
844 the class instance variable up front. */
845 t1
= build_function_type (TREE_TYPE (t1
),
846 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
847 t2
= build_function_type (TREE_TYPE (t2
),
848 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
849 t3
= merge_types (t1
, t2
);
850 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
851 TYPE_ARG_TYPES (t3
));
852 t1
= build_exception_variant (t3
, raises
);
857 /* There is no need to merge attributes into a TYPENAME_TYPE.
858 When the type is instantiated it will have whatever
859 attributes result from the instantiation. */
865 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
867 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
870 return cp_build_type_attribute_variant (t1
, attributes
);
873 /* Return the ARRAY_TYPE type without its domain. */
876 strip_array_domain (tree type
)
879 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
880 if (TYPE_DOMAIN (type
) == NULL_TREE
)
882 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
883 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
886 /* Wrapper around cp_common_type that is used by c-common.c and other
887 front end optimizations that remove promotions.
889 Return the common type for two arithmetic types T1 and T2 under the
890 usual arithmetic conversions. The default conversions have already
891 been applied, and enumerated types converted to their compatible
895 common_type (tree t1
, tree t2
)
897 /* If one type is nonsense, use the other */
898 if (t1
== error_mark_node
)
900 if (t2
== error_mark_node
)
903 return cp_common_type (t1
, t2
);
906 /* Return the common type of two pointer types T1 and T2. This is the
907 type for the result of most arithmetic operations if the operands
908 have the given two types.
910 We assume that comp_target_types has already been done and returned
911 nonzero; if that isn't so, this may crash. */
914 common_pointer_type (tree t1
, tree t2
)
916 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
917 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
918 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
920 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
921 CPO_CONVERSION
, tf_warning_or_error
);
924 /* Compare two exception specifier types for exactness or subsetness, if
925 allowed. Returns false for mismatch, true for match (same, or
928 [except.spec] "If a class X ... objects of class X or any class publicly
929 and unambiguously derived from X. Similarly, if a pointer type Y * ...
930 exceptions of type Y * or that are pointers to any type publicly and
931 unambiguously derived from Y. Otherwise a function only allows exceptions
932 that have the same type ..."
933 This does not mention cv qualifiers and is different to what throw
934 [except.throw] and catch [except.catch] will do. They will ignore the
935 top level cv qualifiers, and allow qualifiers in the pointer to class
938 We implement the letter of the standard. */
941 comp_except_types (tree a
, tree b
, bool exact
)
943 if (same_type_p (a
, b
))
947 if (cp_type_quals (a
) || cp_type_quals (b
))
950 if (TREE_CODE (a
) == POINTER_TYPE
951 && TREE_CODE (b
) == POINTER_TYPE
)
955 if (cp_type_quals (a
) || cp_type_quals (b
))
959 if (TREE_CODE (a
) != RECORD_TYPE
960 || TREE_CODE (b
) != RECORD_TYPE
)
963 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
969 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
970 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
971 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
972 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
973 are unordered, but we've already filtered out duplicates. Most lists will
974 be in order, we should try to make use of that. */
977 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
986 /* First handle noexcept. */
987 if (exact
< ce_exact
)
989 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
990 and stricter than any spec. */
991 if (t1
== noexcept_false_spec
)
992 return !nothrow_spec_p (t2
) || exact
== ce_derived
;
993 /* Even a derived noexcept(false) is compatible with a throwing
995 if (t2
== noexcept_false_spec
)
996 return !nothrow_spec_p (t1
);
998 /* Otherwise, if we aren't looking for an exact match, noexcept is
999 equivalent to throw(). */
1000 if (t1
== noexcept_true_spec
)
1001 t1
= empty_except_spec
;
1002 if (t2
== noexcept_true_spec
)
1003 t2
= empty_except_spec
;
1006 /* If any noexcept is left, it is only comparable to itself;
1007 either we're looking for an exact match or we're redeclaring a
1008 template with dependent noexcept. */
1009 if ((t1
&& TREE_PURPOSE (t1
))
1010 || (t2
&& TREE_PURPOSE (t2
)))
1012 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1014 if (t1
== NULL_TREE
) /* T1 is ... */
1015 return t2
== NULL_TREE
|| exact
== ce_derived
;
1016 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1017 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1018 if (t2
== NULL_TREE
) /* T2 is ... */
1020 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1021 return exact
== ce_derived
;
1023 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1024 Count how many we find, to determine exactness. For exact matching and
1025 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1027 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1029 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1031 tree a
= TREE_VALUE (probe
);
1032 tree b
= TREE_VALUE (t2
);
1034 if (comp_except_types (a
, b
, exact
))
1036 if (probe
== base
&& exact
> ce_derived
)
1037 base
= TREE_CHAIN (probe
);
1042 if (probe
== NULL_TREE
)
1045 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1048 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1049 [] can match [size]. */
1052 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1061 /* The type of the array elements must be the same. */
1062 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1065 d1
= TYPE_DOMAIN (t1
);
1066 d2
= TYPE_DOMAIN (t2
);
1071 /* If one of the arrays is dimensionless, and the other has a
1072 dimension, they are of different types. However, it is valid to
1080 declarations for an array object can specify
1081 array types that differ by the presence or absence of a major
1082 array bound (_dcl.array_). */
1084 return allow_redeclaration
;
1086 /* Check that the dimensions are the same. */
1088 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1090 max1
= TYPE_MAX_VALUE (d1
);
1091 max2
= TYPE_MAX_VALUE (d2
);
1092 if (processing_template_decl
&& !abi_version_at_least (2)
1093 && !value_dependent_expression_p (max1
)
1094 && !value_dependent_expression_p (max2
))
1096 /* With abi-1 we do not fold non-dependent array bounds, (and
1097 consequently mangle them incorrectly). We must therefore
1098 fold them here, to verify the domains have the same
1104 if (!cp_tree_equal (max1
, max2
))
1110 /* Compare the relative position of T1 and T2 into their respective
1111 template parameter list.
1112 T1 and T2 must be template parameter types.
1113 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1116 comp_template_parms_position (tree t1
, tree t2
)
1118 tree index1
, index2
;
1119 gcc_assert (t1
&& t2
1120 && TREE_CODE (t1
) == TREE_CODE (t2
)
1121 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1122 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1123 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1125 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1126 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1128 /* If T1 and T2 belong to template parm lists of different size,
1129 let's assume they are different. */
1130 if (TEMPLATE_PARM_NUM_SIBLINGS (index1
)
1131 != TEMPLATE_PARM_NUM_SIBLINGS (index2
))
1134 /* Then compare their relative position. */
1135 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1136 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1137 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1138 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1144 /* Subroutine in comptypes. */
1147 structural_comptypes (tree t1
, tree t2
, int strict
)
1152 /* Suppress errors caused by previously reported errors. */
1153 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1156 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1158 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1159 current instantiation. */
1160 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1161 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1163 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1164 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1166 if (TYPE_PTRMEMFUNC_P (t1
))
1167 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1168 if (TYPE_PTRMEMFUNC_P (t2
))
1169 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1171 /* Different classes of types can't be compatible. */
1172 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1175 /* Qualifiers must match. For array types, we will check when we
1176 recur on the array element types. */
1177 if (TREE_CODE (t1
) != ARRAY_TYPE
1178 && cp_type_quals (t1
) != cp_type_quals (t2
))
1180 if (TREE_CODE (t1
) == FUNCTION_TYPE
1181 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1183 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1186 /* Allow for two different type nodes which have essentially the same
1187 definition. Note that we already checked for equality of the type
1188 qualifiers (just above). */
1190 if (TREE_CODE (t1
) != ARRAY_TYPE
1191 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1195 /* Compare the types. Break out if they could be the same. */
1196 switch (TREE_CODE (t1
))
1200 /* All void and bool types are the same. */
1204 case FIXED_POINT_TYPE
:
1206 /* With these nodes, we can't determine type equivalence by
1207 looking at what is stored in the nodes themselves, because
1208 two nodes might have different TYPE_MAIN_VARIANTs but still
1209 represent the same type. For example, wchar_t and int could
1210 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1211 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1212 and are distinct types. On the other hand, int and the
1215 typedef int INT __attribute((may_alias));
1217 have identical properties, different TYPE_MAIN_VARIANTs, but
1218 represent the same type. The canonical type system keeps
1219 track of equivalence in this case, so we fall back on it. */
1220 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1222 case TEMPLATE_TEMPLATE_PARM
:
1223 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1224 if (!comp_template_parms_position (t1
, t2
))
1226 if (!comp_template_parms
1227 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1228 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1230 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1232 /* Don't check inheritance. */
1233 strict
= COMPARE_STRICT
;
1238 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1239 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1240 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1241 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1244 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1246 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1252 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1253 strict
& ~COMPARE_REDECLARATION
))
1255 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1259 case REFERENCE_TYPE
:
1260 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1262 /* fall through to checks for pointer types */
1265 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1266 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1267 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1273 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1275 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1280 /* Target types must match incl. qualifiers. */
1281 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1285 case TEMPLATE_TYPE_PARM
:
1286 /* If T1 and T2 don't have the same relative position in their
1287 template parameters set, they can't be equal. */
1288 if (!comp_template_parms_position (t1
, t2
))
1293 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1294 TYPENAME_TYPE_FULLNAME (t2
)))
1296 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1300 case UNBOUND_CLASS_TEMPLATE
:
1301 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1303 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1308 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1313 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1314 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 case TYPE_PACK_EXPANSION
:
1319 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1320 PACK_EXPANSION_PATTERN (t2
));
1323 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1324 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1325 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1326 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1327 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1328 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1329 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1330 DECLTYPE_TYPE_EXPR (t2
)))
1338 /* If we get here, we know that from a target independent POV the
1339 types are the same. Make sure the target attributes are also
1341 return targetm
.comp_type_attributes (t1
, t2
);
1344 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1345 is a bitwise-or of the COMPARE_* flags. */
1348 comptypes (tree t1
, tree t2
, int strict
)
1350 if (strict
== COMPARE_STRICT
)
1355 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1358 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1359 /* At least one of the types requires structural equality, so
1360 perform a deep check. */
1361 return structural_comptypes (t1
, t2
, strict
);
1363 #ifdef ENABLE_CHECKING
1364 if (USE_CANONICAL_TYPES
)
1366 bool result
= structural_comptypes (t1
, t2
, strict
);
1368 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1369 /* The two types are structurally equivalent, but their
1370 canonical types were different. This is a failure of the
1371 canonical type propagation code.*/
1373 ("canonical types differ for identical types %T and %T",
1375 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1376 /* Two types are structurally different, but the canonical
1377 types are the same. This means we were over-eager in
1378 assigning canonical types. */
1380 ("same canonical type node for different types %T and %T",
1386 if (USE_CANONICAL_TYPES
)
1387 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1390 return structural_comptypes (t1
, t2
, strict
);
1392 else if (strict
== COMPARE_STRUCTURAL
)
1393 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1395 return structural_comptypes (t1
, t2
, strict
);
1398 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1399 top-level qualifiers. */
1402 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1404 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1407 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1410 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1413 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1415 int q1
= cp_type_quals (type1
);
1416 int q2
= cp_type_quals (type2
);
1418 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1419 return (q1
& q2
) == q2
;
1422 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1423 more cv-qualified that TYPE1, and 0 otherwise. */
1426 comp_cv_qualification (const_tree type1
, const_tree type2
)
1428 int q1
= cp_type_quals (type1
);
1429 int q2
= cp_type_quals (type2
);
1434 if ((q1
& q2
) == q2
)
1436 else if ((q1
& q2
) == q1
)
1442 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1443 subset of the cv-qualification signature of TYPE2, and the types
1444 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1447 comp_cv_qual_signature (tree type1
, tree type2
)
1449 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1451 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1457 /* Subroutines of `comptypes'. */
1459 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1460 equivalent in the sense that functions with those parameter types
1461 can have equivalent types. The two lists must be equivalent,
1462 element by element. */
1465 compparms (const_tree parms1
, const_tree parms2
)
1469 /* An unspecified parmlist matches any specified parmlist
1470 whose argument types don't need default promotions. */
1472 for (t1
= parms1
, t2
= parms2
;
1474 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1476 /* If one parmlist is shorter than the other,
1477 they fail to match. */
1480 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1487 /* Process a sizeof or alignof expression where the operand is a
1491 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1496 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1497 if (type
== error_mark_node
)
1498 return error_mark_node
;
1500 type
= non_reference (type
);
1501 if (TREE_CODE (type
) == METHOD_TYPE
)
1504 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1505 "invalid application of %qs to a member function",
1506 operator_name_info
[(int) op
].name
);
1507 value
= size_one_node
;
1510 dependent_p
= dependent_type_p (type
);
1512 complete_type (type
);
1514 /* VLA types will have a non-constant size. In the body of an
1515 uninstantiated template, we don't need to try to compute the
1516 value, because the sizeof expression is not an integral
1517 constant expression in that case. And, if we do try to
1518 compute the value, we'll likely end up with SAVE_EXPRs, which
1519 the template substitution machinery does not expect to see. */
1520 || (processing_template_decl
1521 && COMPLETE_TYPE_P (type
)
1522 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1524 value
= build_min (op
, size_type_node
, type
);
1525 TREE_READONLY (value
) = 1;
1529 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1534 /* Return the size of the type, without producing any warnings for
1535 types whose size cannot be taken. This routine should be used only
1536 in some other routine that has already produced a diagnostic about
1537 using the size of such a type. */
1539 cxx_sizeof_nowarn (tree type
)
1541 if (TREE_CODE (type
) == FUNCTION_TYPE
1542 || TREE_CODE (type
) == VOID_TYPE
1543 || TREE_CODE (type
) == ERROR_MARK
)
1544 return size_one_node
;
1545 else if (!COMPLETE_TYPE_P (type
))
1546 return size_zero_node
;
1548 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1551 /* Process a sizeof expression where the operand is an expression. */
1554 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1556 if (e
== error_mark_node
)
1557 return error_mark_node
;
1559 if (processing_template_decl
)
1561 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1562 TREE_SIDE_EFFECTS (e
) = 0;
1563 TREE_READONLY (e
) = 1;
1568 /* To get the size of a static data member declared as an array of
1569 unknown bound, we need to instantiate it. */
1570 if (TREE_CODE (e
) == VAR_DECL
1571 && VAR_HAD_UNKNOWN_BOUND (e
)
1572 && DECL_TEMPLATE_INSTANTIATION (e
))
1573 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1575 e
= mark_type_use (e
);
1577 if (TREE_CODE (e
) == COMPONENT_REF
1578 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1579 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1581 if (complain
& tf_error
)
1582 error ("invalid application of %<sizeof%> to a bit-field");
1584 return error_mark_node
;
1587 else if (is_overloaded_fn (e
))
1589 if (complain
& tf_error
)
1590 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1593 return error_mark_node
;
1596 else if (type_unknown_p (e
))
1598 if (complain
& tf_error
)
1599 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1601 return error_mark_node
;
1607 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1610 /* Implement the __alignof keyword: Return the minimum required
1611 alignment of E, measured in bytes. For VAR_DECL's and
1612 FIELD_DECL's return DECL_ALIGN (which can be set from an
1613 "aligned" __attribute__ specification). */
1616 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1620 if (e
== error_mark_node
)
1621 return error_mark_node
;
1623 if (processing_template_decl
)
1625 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1626 TREE_SIDE_EFFECTS (e
) = 0;
1627 TREE_READONLY (e
) = 1;
1632 e
= mark_type_use (e
);
1634 if (TREE_CODE (e
) == VAR_DECL
)
1635 t
= size_int (DECL_ALIGN_UNIT (e
));
1636 else if (TREE_CODE (e
) == COMPONENT_REF
1637 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1638 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1640 if (complain
& tf_error
)
1641 error ("invalid application of %<__alignof%> to a bit-field");
1643 return error_mark_node
;
1646 else if (TREE_CODE (e
) == COMPONENT_REF
1647 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1648 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1649 else if (is_overloaded_fn (e
))
1651 if (complain
& tf_error
)
1652 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1655 return error_mark_node
;
1656 if (TREE_CODE (e
) == FUNCTION_DECL
)
1657 t
= size_int (DECL_ALIGN_UNIT (e
));
1661 else if (type_unknown_p (e
))
1663 if (complain
& tf_error
)
1664 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1666 return error_mark_node
;
1670 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1671 complain
& tf_error
);
1673 return fold_convert (size_type_node
, t
);
1676 /* Process a sizeof or alignof expression E with code OP where the operand
1677 is an expression. */
1680 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1682 if (op
== SIZEOF_EXPR
)
1683 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1685 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1688 /* EXPR is being used in a context that is not a function call.
1693 The expression can be used only as the left-hand operand of a
1694 member function call.
1696 [expr.mptr.operator]
1698 If the result of .* or ->* is a function, then that result can be
1699 used only as the operand for the function call operator ().
1701 by issuing an error message if appropriate. Returns true iff EXPR
1702 violates these rules. */
1705 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1707 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1709 if (complain
& tf_error
)
1710 error ("invalid use of non-static member function");
1716 /* If EXP is a reference to a bitfield, and the type of EXP does not
1717 match the declared type of the bitfield, return the declared type
1718 of the bitfield. Otherwise, return NULL_TREE. */
1721 is_bitfield_expr_with_lowered_type (const_tree exp
)
1723 switch (TREE_CODE (exp
))
1726 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1727 ? TREE_OPERAND (exp
, 1)
1728 : TREE_OPERAND (exp
, 0)))
1730 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1733 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1737 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1743 field
= TREE_OPERAND (exp
, 1);
1744 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1746 if (same_type_ignoring_top_level_qualifiers_p
1747 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1749 return DECL_BIT_FIELD_TYPE (field
);
1753 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1754 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1755 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1763 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1764 bitfield with a lowered type, the type of EXP is returned, rather
1768 unlowered_expr_type (const_tree exp
)
1772 type
= is_bitfield_expr_with_lowered_type (exp
);
1774 type
= TREE_TYPE (exp
);
1779 /* Perform the conversions in [expr] that apply when an lvalue appears
1780 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1781 function-to-pointer conversions. In addition, manifest constants
1782 are replaced by their values, and bitfield references are converted
1783 to their declared types. Note that this function does not perform the
1784 lvalue-to-rvalue conversion for class types. If you need that conversion
1785 to for class types, then you probably need to use force_rvalue.
1787 Although the returned value is being used as an rvalue, this
1788 function does not wrap the returned expression in a
1789 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1790 that the return value is no longer an lvalue. */
1793 decay_conversion (tree exp
)
1796 enum tree_code code
;
1798 type
= TREE_TYPE (exp
);
1799 if (type
== error_mark_node
)
1800 return error_mark_node
;
1802 exp
= mark_rvalue_use (exp
);
1804 exp
= resolve_nondeduced_context (exp
);
1805 if (type_unknown_p (exp
))
1807 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1808 return error_mark_node
;
1811 /* FIXME remove? at least need to remember that this isn't really a
1812 constant expression if EXP isn't decl_constant_var_p, like with
1813 C_MAYBE_CONST_EXPR. */
1814 exp
= decl_constant_value (exp
);
1815 if (error_operand_p (exp
))
1816 return error_mark_node
;
1818 if (NULLPTR_TYPE_P (type
))
1819 return nullptr_node
;
1821 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1822 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1823 code
= TREE_CODE (type
);
1824 if (code
== VOID_TYPE
)
1826 error ("void value not ignored as it ought to be");
1827 return error_mark_node
;
1829 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1830 return error_mark_node
;
1831 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1832 return cp_build_addr_expr (exp
, tf_warning_or_error
);
1833 if (code
== ARRAY_TYPE
)
1838 if (TREE_CODE (exp
) == INDIRECT_REF
)
1839 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1840 TREE_OPERAND (exp
, 0));
1842 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1844 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1845 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1846 TREE_OPERAND (exp
, 0), op1
);
1850 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1852 error ("invalid use of non-lvalue array");
1853 return error_mark_node
;
1856 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1858 if (TREE_CODE (exp
) == VAR_DECL
)
1860 if (!cxx_mark_addressable (exp
))
1861 return error_mark_node
;
1862 adr
= build_nop (ptrtype
, build_address (exp
));
1865 /* This way is better for a COMPONENT_REF since it can
1866 simplify the offset for a component. */
1867 adr
= cp_build_addr_expr (exp
, tf_warning_or_error
);
1868 return cp_convert (ptrtype
, adr
);
1871 /* If a bitfield is used in a context where integral promotion
1872 applies, then the caller is expected to have used
1873 default_conversion. That function promotes bitfields correctly
1874 before calling this function. At this point, if we have a
1875 bitfield referenced, we may assume that is not subject to
1876 promotion, and that, therefore, the type of the resulting rvalue
1877 is the declared type of the bitfield. */
1878 exp
= convert_bitfield_to_declared_type (exp
);
1880 /* We do not call rvalue() here because we do not want to wrap EXP
1881 in a NON_LVALUE_EXPR. */
1885 Non-class rvalues always have cv-unqualified types. */
1886 type
= TREE_TYPE (exp
);
1887 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1888 exp
= build_nop (cv_unqualified (type
), exp
);
1893 /* Perform preparatory conversions, as part of the "usual arithmetic
1894 conversions". In particular, as per [expr]:
1896 Whenever an lvalue expression appears as an operand of an
1897 operator that expects the rvalue for that operand, the
1898 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1899 standard conversions are applied to convert the expression to an
1902 In addition, we perform integral promotions here, as those are
1903 applied to both operands to a binary operator before determining
1904 what additional conversions should apply. */
1907 default_conversion (tree exp
)
1909 /* Check for target-specific promotions. */
1910 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1912 exp
= cp_convert (promoted_type
, exp
);
1913 /* Perform the integral promotions first so that bitfield
1914 expressions (which may promote to "int", even if the bitfield is
1915 declared "unsigned") are promoted correctly. */
1916 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1917 exp
= perform_integral_promotions (exp
);
1918 /* Perform the other conversions. */
1919 exp
= decay_conversion (exp
);
1924 /* EXPR is an expression with an integral or enumeration type.
1925 Perform the integral promotions in [conv.prom], and return the
1929 perform_integral_promotions (tree expr
)
1934 expr
= mark_rvalue_use (expr
);
1938 If the bitfield has an enumerated type, it is treated as any
1939 other value of that type for promotion purposes. */
1940 type
= is_bitfield_expr_with_lowered_type (expr
);
1941 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1942 type
= TREE_TYPE (expr
);
1943 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1944 promoted_type
= type_promotes_to (type
);
1945 if (type
!= promoted_type
)
1946 expr
= cp_convert (promoted_type
, expr
);
1950 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1951 decay_conversion to one. */
1954 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1958 if (TREE_CODE (totype
) != POINTER_TYPE
)
1961 t
= TREE_TYPE (totype
);
1962 if (!same_type_p (t
, char_type_node
)
1963 && !same_type_p (t
, char16_type_node
)
1964 && !same_type_p (t
, char32_type_node
)
1965 && !same_type_p (t
, wchar_type_node
))
1968 if (TREE_CODE (exp
) == STRING_CST
)
1970 /* Make sure that we don't try to convert between char and wide chars. */
1971 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1976 /* Is this a string constant which has decayed to 'const char *'? */
1977 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
1978 if (!same_type_p (TREE_TYPE (exp
), t
))
1981 if (TREE_CODE (exp
) != ADDR_EXPR
1982 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1986 /* This warning is not very useful, as it complains about printf. */
1988 warning (OPT_Wwrite_strings
,
1989 "deprecated conversion from string constant to %qT",
1995 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1996 can, for example, use as an lvalue. This code used to be in
1997 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1998 expressions, where we're dealing with aggregates. But now it's again only
1999 called from unary_complex_lvalue. The case (in particular) that led to
2000 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2004 rationalize_conditional_expr (enum tree_code code
, tree t
,
2005 tsubst_flags_t complain
)
2007 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2008 the first operand is always the one to be used if both operands
2009 are equal, so we know what conditional expression this used to be. */
2010 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2012 tree op0
= TREE_OPERAND (t
, 0);
2013 tree op1
= TREE_OPERAND (t
, 1);
2015 /* The following code is incorrect if either operand side-effects. */
2016 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2017 && !TREE_SIDE_EFFECTS (op1
));
2019 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2020 ? LE_EXPR
: GE_EXPR
),
2021 op0
, TREE_CODE (op0
),
2022 op1
, TREE_CODE (op1
),
2023 /*overloaded_p=*/NULL
,
2025 cp_build_unary_op (code
, op0
, 0, complain
),
2026 cp_build_unary_op (code
, op1
, 0, complain
),
2031 build_conditional_expr (TREE_OPERAND (t
, 0),
2032 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2034 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2039 /* Given the TYPE of an anonymous union field inside T, return the
2040 FIELD_DECL for the field. If not found return NULL_TREE. Because
2041 anonymous unions can nest, we must also search all anonymous unions
2042 that are directly reachable. */
2045 lookup_anon_field (tree t
, tree type
)
2049 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2051 if (TREE_STATIC (field
))
2053 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2056 /* If we find it directly, return the field. */
2057 if (DECL_NAME (field
) == NULL_TREE
2058 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2063 /* Otherwise, it could be nested, search harder. */
2064 if (DECL_NAME (field
) == NULL_TREE
2065 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2067 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2075 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2076 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2077 non-NULL, it indicates the path to the base used to name MEMBER.
2078 If PRESERVE_REFERENCE is true, the expression returned will have
2079 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2080 returned will have the type referred to by the reference.
2082 This function does not perform access control; that is either done
2083 earlier by the parser when the name of MEMBER is resolved to MEMBER
2084 itself, or later when overload resolution selects one of the
2085 functions indicated by MEMBER. */
2088 build_class_member_access_expr (tree object
, tree member
,
2089 tree access_path
, bool preserve_reference
,
2090 tsubst_flags_t complain
)
2094 tree result
= NULL_TREE
;
2096 if (error_operand_p (object
) || error_operand_p (member
))
2097 return error_mark_node
;
2099 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2103 The type of the first expression shall be "class object" (of a
2105 object_type
= TREE_TYPE (object
);
2106 if (!currently_open_class (object_type
)
2107 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2108 return error_mark_node
;
2109 if (!CLASS_TYPE_P (object_type
))
2111 if (complain
& tf_error
)
2112 error ("request for member %qD in %qE, which is of non-class type %qT",
2113 member
, object
, object_type
);
2114 return error_mark_node
;
2117 /* The standard does not seem to actually say that MEMBER must be a
2118 member of OBJECT_TYPE. However, that is clearly what is
2120 if (DECL_P (member
))
2122 member_scope
= DECL_CLASS_CONTEXT (member
);
2124 if (TREE_DEPRECATED (member
))
2125 warn_deprecated_use (member
, NULL_TREE
);
2128 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2129 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2130 presently be the anonymous union. Go outwards until we find a
2131 type related to OBJECT_TYPE. */
2132 while (ANON_AGGR_TYPE_P (member_scope
)
2133 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2135 member_scope
= TYPE_CONTEXT (member_scope
);
2136 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2138 if (complain
& tf_error
)
2140 if (TREE_CODE (member
) == FIELD_DECL
)
2141 error ("invalid use of nonstatic data member %qE", member
);
2143 error ("%qD is not a member of %qT", member
, object_type
);
2145 return error_mark_node
;
2148 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2149 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2150 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2152 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2154 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2157 /* In [expr.ref], there is an explicit list of the valid choices for
2158 MEMBER. We check for each of those cases here. */
2159 if (TREE_CODE (member
) == VAR_DECL
)
2161 /* A static data member. */
2163 mark_exp_read (object
);
2164 /* If OBJECT has side-effects, they are supposed to occur. */
2165 if (TREE_SIDE_EFFECTS (object
))
2166 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2168 else if (TREE_CODE (member
) == FIELD_DECL
)
2170 /* A non-static data member. */
2175 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2176 && integer_zerop (TREE_OPERAND (object
, 0)));
2178 /* Convert OBJECT to the type of MEMBER. */
2179 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2180 TYPE_MAIN_VARIANT (member_scope
)))
2185 binfo
= lookup_base (access_path
? access_path
: object_type
,
2186 member_scope
, ba_unique
, &kind
);
2187 if (binfo
== error_mark_node
)
2188 return error_mark_node
;
2190 /* It is invalid to try to get to a virtual base of a
2191 NULL object. The most common cause is invalid use of
2193 if (null_object_p
&& kind
== bk_via_virtual
)
2195 if (complain
& tf_error
)
2197 error ("invalid access to non-static data member %qD of "
2200 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2202 return error_mark_node
;
2205 /* Convert to the base. */
2206 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2208 /* If we found the base successfully then we should be able
2209 to convert to it successfully. */
2210 gcc_assert (object
!= error_mark_node
);
2213 /* Complain about other invalid uses of offsetof, even though they will
2214 give the right answer. Note that we complain whether or not they
2215 actually used the offsetof macro, since there's no way to know at this
2216 point. So we just give a warning, instead of a pedwarn. */
2217 /* Do not produce this warning for base class field references, because
2218 we know for a fact that didn't come from offsetof. This does occur
2219 in various testsuite cases where a null object is passed where a
2220 vtable access is required. */
2221 if (null_object_p
&& warn_invalid_offsetof
2222 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2223 && !DECL_FIELD_IS_BASE (member
)
2224 && cp_unevaluated_operand
== 0
2225 && (complain
& tf_warning
))
2227 warning (OPT_Winvalid_offsetof
,
2228 "invalid access to non-static data member %qD "
2229 " of NULL object", member
);
2230 warning (OPT_Winvalid_offsetof
,
2231 "(perhaps the %<offsetof%> macro was used incorrectly)");
2234 /* If MEMBER is from an anonymous aggregate, we have converted
2235 OBJECT so that it refers to the class containing the
2236 anonymous union. Generate a reference to the anonymous union
2237 itself, and recur to find MEMBER. */
2238 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2239 /* When this code is called from build_field_call, the
2240 object already has the type of the anonymous union.
2241 That is because the COMPONENT_REF was already
2242 constructed, and was then disassembled before calling
2243 build_field_call. After the function-call code is
2244 cleaned up, this waste can be eliminated. */
2245 && (!same_type_ignoring_top_level_qualifiers_p
2246 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2248 tree anonymous_union
;
2250 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2251 DECL_CONTEXT (member
));
2252 object
= build_class_member_access_expr (object
,
2254 /*access_path=*/NULL_TREE
,
2259 /* Compute the type of the field, as described in [expr.ref]. */
2260 type_quals
= TYPE_UNQUALIFIED
;
2261 member_type
= TREE_TYPE (member
);
2262 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2264 type_quals
= (cp_type_quals (member_type
)
2265 | cp_type_quals (object_type
));
2267 /* A field is const (volatile) if the enclosing object, or the
2268 field itself, is const (volatile). But, a mutable field is
2269 not const, even within a const object. */
2270 if (DECL_MUTABLE_P (member
))
2271 type_quals
&= ~TYPE_QUAL_CONST
;
2272 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2275 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2277 result
= fold_if_not_in_template (result
);
2279 /* Mark the expression const or volatile, as appropriate. Even
2280 though we've dealt with the type above, we still have to mark the
2281 expression itself. */
2282 if (type_quals
& TYPE_QUAL_CONST
)
2283 TREE_READONLY (result
) = 1;
2284 if (type_quals
& TYPE_QUAL_VOLATILE
)
2285 TREE_THIS_VOLATILE (result
) = 1;
2287 else if (BASELINK_P (member
))
2289 /* The member is a (possibly overloaded) member function. */
2293 /* If the MEMBER is exactly one static member function, then we
2294 know the type of the expression. Otherwise, we must wait
2295 until overload resolution has been performed. */
2296 functions
= BASELINK_FUNCTIONS (member
);
2297 if (TREE_CODE (functions
) == FUNCTION_DECL
2298 && DECL_STATIC_FUNCTION_P (functions
))
2299 type
= TREE_TYPE (functions
);
2301 type
= unknown_type_node
;
2302 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2303 base. That will happen when the function is called. */
2304 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2306 else if (TREE_CODE (member
) == CONST_DECL
)
2308 /* The member is an enumerator. */
2310 /* If OBJECT has side-effects, they are supposed to occur. */
2311 if (TREE_SIDE_EFFECTS (object
))
2312 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2317 if (complain
& tf_error
)
2318 error ("invalid use of %qD", member
);
2319 return error_mark_node
;
2322 if (!preserve_reference
)
2325 If E2 is declared to have type "reference to T", then ... the
2326 type of E1.E2 is T. */
2327 result
= convert_from_reference (result
);
2332 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2333 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2336 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2338 tree object_type
= TREE_TYPE (object
);
2339 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2342 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2344 error ("qualified type %qT does not match destructor name ~%qT",
2346 return error_mark_node
;
2348 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2350 /* In a template, names we can't find a match for are still accepted
2351 destructor names, and we check them here. */
2352 if (check_dtor_name (object_type
, dtor_type
))
2353 dtor_type
= object_type
;
2356 error ("object type %qT does not match destructor name ~%qT",
2357 object_type
, dtor_type
);
2358 return error_mark_node
;
2362 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2364 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2365 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2366 return error_mark_node
;
2368 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2369 /*protect=*/1, /*want_type=*/false);
2370 expr
= (adjust_result_of_qualified_name_lookup
2371 (expr
, dtor_type
, object_type
));
2375 /* An expression of the form "A::template B" has been resolved to
2376 DECL. Issue a diagnostic if B is not a template or template
2380 check_template_keyword (tree decl
)
2382 /* The standard says:
2386 If a name prefixed by the keyword template is not a member
2387 template, the program is ill-formed.
2389 DR 228 removed the restriction that the template be a member
2392 DR 96, if accepted would add the further restriction that explicit
2393 template arguments must be provided if the template keyword is
2394 used, but, as of 2005-10-16, that DR is still in "drafting". If
2395 this DR is accepted, then the semantic checks here can be
2396 simplified, as the entity named must in fact be a template
2397 specialization, rather than, as at present, a set of overloaded
2398 functions containing at least one template function. */
2399 if (TREE_CODE (decl
) != TEMPLATE_DECL
2400 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2402 if (!is_overloaded_fn (decl
))
2403 permerror (input_location
, "%qD is not a template", decl
);
2408 if (BASELINK_P (fns
))
2409 fns
= BASELINK_FUNCTIONS (fns
);
2412 tree fn
= OVL_CURRENT (fns
);
2413 if (TREE_CODE (fn
) == TEMPLATE_DECL
2414 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2416 if (TREE_CODE (fn
) == FUNCTION_DECL
2417 && DECL_USE_TEMPLATE (fn
)
2418 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2420 fns
= OVL_NEXT (fns
);
2423 permerror (input_location
, "%qD is not a template", decl
);
2428 /* This function is called by the parser to process a class member
2429 access expression of the form OBJECT.NAME. NAME is a node used by
2430 the parser to represent a name; it is not yet a DECL. It may,
2431 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2432 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2433 there is no reason to do the lookup twice, so the parser keeps the
2434 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2435 be a template via the use of the "A::template B" syntax. */
2438 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2439 tsubst_flags_t complain
)
2444 tree access_path
= NULL_TREE
;
2445 tree orig_object
= object
;
2446 tree orig_name
= name
;
2448 if (object
== error_mark_node
|| name
== error_mark_node
)
2449 return error_mark_node
;
2451 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2452 if (!objc_is_public (object
, name
))
2453 return error_mark_node
;
2455 object_type
= TREE_TYPE (object
);
2457 if (processing_template_decl
)
2459 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2460 dependent_type_p (object_type
)
2461 /* If NAME is just an IDENTIFIER_NODE, then the expression
2463 || TREE_CODE (object
) == IDENTIFIER_NODE
2464 /* If NAME is "f<args>", where either 'f' or 'args' is
2465 dependent, then the expression is dependent. */
2466 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2467 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2468 TREE_OPERAND (name
, 1)))
2469 /* If NAME is "T::X" where "T" is dependent, then the
2470 expression is dependent. */
2471 || (TREE_CODE (name
) == SCOPE_REF
2472 && TYPE_P (TREE_OPERAND (name
, 0))
2473 && dependent_type_p (TREE_OPERAND (name
, 0))))
2474 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2475 object
= build_non_dependent_expr (object
);
2477 else if (c_dialect_objc ()
2478 && TREE_CODE (name
) == IDENTIFIER_NODE
2479 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2484 The type of the first expression shall be "class object" (of a
2486 if (!currently_open_class (object_type
)
2487 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2488 return error_mark_node
;
2489 if (!CLASS_TYPE_P (object_type
))
2491 if (complain
& tf_error
)
2492 error ("request for member %qD in %qE, which is of non-class type %qT",
2493 name
, object
, object_type
);
2494 return error_mark_node
;
2497 if (BASELINK_P (name
))
2498 /* A member function that has already been looked up. */
2502 bool is_template_id
= false;
2503 tree template_args
= NULL_TREE
;
2506 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2508 is_template_id
= true;
2509 template_args
= TREE_OPERAND (name
, 1);
2510 name
= TREE_OPERAND (name
, 0);
2512 if (TREE_CODE (name
) == OVERLOAD
)
2513 name
= DECL_NAME (get_first_fn (name
));
2514 else if (DECL_P (name
))
2515 name
= DECL_NAME (name
);
2518 if (TREE_CODE (name
) == SCOPE_REF
)
2520 /* A qualified name. The qualifying class or namespace `S'
2521 has already been looked up; it is either a TYPE or a
2523 scope
= TREE_OPERAND (name
, 0);
2524 name
= TREE_OPERAND (name
, 1);
2526 /* If SCOPE is a namespace, then the qualified name does not
2527 name a member of OBJECT_TYPE. */
2528 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2530 if (complain
& tf_error
)
2531 error ("%<%D::%D%> is not a member of %qT",
2532 scope
, name
, object_type
);
2533 return error_mark_node
;
2536 gcc_assert (CLASS_TYPE_P (scope
));
2537 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2538 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2540 if (constructor_name_p (name
, scope
))
2542 if (complain
& tf_error
)
2543 error ("cannot call constructor %<%T::%D%> directly",
2545 return error_mark_node
;
2548 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2549 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2550 if (access_path
== error_mark_node
)
2551 return error_mark_node
;
2554 if (complain
& tf_error
)
2555 error ("%qT is not a base of %qT", scope
, object_type
);
2556 return error_mark_node
;
2562 access_path
= object_type
;
2565 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2566 member
= lookup_destructor (object
, scope
, name
);
2569 /* Look up the member. */
2570 member
= lookup_member (access_path
, name
, /*protect=*/1,
2571 /*want_type=*/false);
2572 if (member
== NULL_TREE
)
2574 if (complain
& tf_error
)
2575 error ("%qD has no member named %qE", object_type
, name
);
2576 return error_mark_node
;
2578 if (member
== error_mark_node
)
2579 return error_mark_node
;
2584 tree templ
= member
;
2586 if (BASELINK_P (templ
))
2587 templ
= lookup_template_function (templ
, template_args
);
2590 if (complain
& tf_error
)
2591 error ("%qD is not a member template function", name
);
2592 return error_mark_node
;
2597 if (TREE_DEPRECATED (member
))
2598 warn_deprecated_use (member
, NULL_TREE
);
2601 check_template_keyword (member
);
2603 expr
= build_class_member_access_expr (object
, member
, access_path
,
2604 /*preserve_reference=*/false,
2606 if (processing_template_decl
&& expr
!= error_mark_node
)
2608 if (BASELINK_P (member
))
2610 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2611 BASELINK_QUALIFIED_P (member
) = 1;
2614 return build_min_non_dep (COMPONENT_REF
, expr
,
2615 orig_object
, orig_name
,
2622 /* Return an expression for the MEMBER_NAME field in the internal
2623 representation of PTRMEM, a pointer-to-member function. (Each
2624 pointer-to-member function type gets its own RECORD_TYPE so it is
2625 more convenient to access the fields by name than by FIELD_DECL.)
2626 This routine converts the NAME to a FIELD_DECL and then creates the
2627 node for the complete expression. */
2630 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2636 /* This code is a stripped down version of
2637 build_class_member_access_expr. It does not work to use that
2638 routine directly because it expects the object to be of class
2640 ptrmem_type
= TREE_TYPE (ptrmem
);
2641 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2642 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2643 /*want_type=*/false);
2644 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2645 cp_type_quals (ptrmem_type
));
2646 return fold_build3_loc (input_location
,
2647 COMPONENT_REF
, member_type
,
2648 ptrmem
, member
, NULL_TREE
);
2651 /* Given an expression PTR for a pointer, return an expression
2652 for the value pointed to.
2653 ERRORSTRING is the name of the operator to appear in error messages.
2655 This function may need to overload OPERATOR_FNNAME.
2656 Must also handle REFERENCE_TYPEs for C++. */
2659 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2660 tsubst_flags_t complain
)
2662 tree orig_expr
= expr
;
2665 if (processing_template_decl
)
2667 /* Retain the type if we know the operand is a pointer so that
2668 describable_type doesn't make auto deduction break. */
2669 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2670 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2671 if (type_dependent_expression_p (expr
))
2672 return build_min_nt (INDIRECT_REF
, expr
);
2673 expr
= build_non_dependent_expr (expr
);
2676 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2677 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2679 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2681 if (processing_template_decl
&& rval
!= error_mark_node
)
2682 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2687 /* Helper function called from c-common. */
2689 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2690 tree ptr
, ref_operator errorstring
)
2692 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2696 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2697 tsubst_flags_t complain
)
2701 if (ptr
== error_mark_node
)
2702 return error_mark_node
;
2704 if (ptr
== current_class_ptr
)
2705 return current_class_ref
;
2707 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2708 ? ptr
: decay_conversion (ptr
));
2709 type
= TREE_TYPE (pointer
);
2711 if (POINTER_TYPE_P (type
))
2715 If the type of the expression is "pointer to T," the type
2716 of the result is "T." */
2717 tree t
= TREE_TYPE (type
);
2719 if (CONVERT_EXPR_P (ptr
)
2720 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2722 /* If a warning is issued, mark it to avoid duplicates from
2723 the backend. This only needs to be done at
2724 warn_strict_aliasing > 2. */
2725 if (warn_strict_aliasing
> 2)
2726 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2727 type
, TREE_OPERAND (ptr
, 0)))
2728 TREE_NO_WARNING (ptr
) = 1;
2731 if (VOID_TYPE_P (t
))
2733 /* A pointer to incomplete type (other than cv void) can be
2734 dereferenced [expr.unary.op]/1 */
2735 if (complain
& tf_error
)
2736 error ("%qT is not a pointer-to-object type", type
);
2737 return error_mark_node
;
2739 else if (TREE_CODE (pointer
) == ADDR_EXPR
2740 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2741 /* The POINTER was something like `&x'. We simplify `*&x' to
2743 return TREE_OPERAND (pointer
, 0);
2746 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2748 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2749 so that we get the proper error message if the result is used
2750 to assign to. Also, &* is supposed to be a no-op. */
2751 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2752 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2753 TREE_SIDE_EFFECTS (ref
)
2754 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2758 else if (!(complain
& tf_error
))
2759 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2761 /* `pointer' won't be an error_mark_node if we were given a
2762 pointer to member, so it's cool to check for this here. */
2763 else if (TYPE_PTR_TO_MEMBER_P (type
))
2764 switch (errorstring
)
2766 case RO_ARRAY_INDEXING
:
2767 error ("invalid use of array indexing on pointer to member");
2770 error ("invalid use of unary %<*%> on pointer to member");
2772 case RO_IMPLICIT_CONVERSION
:
2773 error ("invalid use of implicit conversion on pointer to member");
2778 else if (pointer
!= error_mark_node
)
2779 invalid_indirection_error (input_location
, type
, errorstring
);
2781 return error_mark_node
;
2784 /* This handles expressions of the form "a[i]", which denotes
2787 This is logically equivalent in C to *(a+i), but we may do it differently.
2788 If A is a variable or a member, we generate a primitive ARRAY_REF.
2789 This avoids forcing the array out of registers, and can work on
2790 arrays that are not lvalues (for example, members of structures returned
2793 If INDEX is of some user-defined type, it must be converted to
2794 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2795 will inherit the type of the array, which will be some pointer type.
2797 LOC is the location to use in building the array reference. */
2800 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2801 tsubst_flags_t complain
)
2807 if (complain
& tf_error
)
2808 error_at (loc
, "subscript missing in array reference");
2809 return error_mark_node
;
2812 if (TREE_TYPE (array
) == error_mark_node
2813 || TREE_TYPE (idx
) == error_mark_node
)
2814 return error_mark_node
;
2816 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2818 switch (TREE_CODE (array
))
2822 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2824 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2825 TREE_OPERAND (array
, 0), value
);
2826 SET_EXPR_LOCATION (ret
, loc
);
2831 ret
= build_conditional_expr
2832 (TREE_OPERAND (array
, 0),
2833 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2835 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2837 tf_warning_or_error
);
2838 protected_set_expr_location (ret
, loc
);
2845 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2849 warn_array_subscript_with_type_char (idx
);
2851 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2853 if (complain
& tf_error
)
2854 error_at (loc
, "array subscript is not an integer");
2855 return error_mark_node
;
2858 /* Apply integral promotions *after* noticing character types.
2859 (It is unclear why we do these promotions -- the standard
2860 does not say that we should. In fact, the natural thing would
2861 seem to be to convert IDX to ptrdiff_t; we're performing
2862 pointer arithmetic.) */
2863 idx
= perform_integral_promotions (idx
);
2865 /* An array that is indexed by a non-constant
2866 cannot be stored in a register; we must be able to do
2867 address arithmetic on its address.
2868 Likewise an array of elements of variable size. */
2869 if (TREE_CODE (idx
) != INTEGER_CST
2870 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2871 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2874 if (!cxx_mark_addressable (array
))
2875 return error_mark_node
;
2878 /* An array that is indexed by a constant value which is not within
2879 the array bounds cannot be stored in a register either; because we
2880 would get a crash in store_bit_field/extract_bit_field when trying
2881 to access a non-existent part of the register. */
2882 if (TREE_CODE (idx
) == INTEGER_CST
2883 && TYPE_DOMAIN (TREE_TYPE (array
))
2884 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2886 if (!cxx_mark_addressable (array
))
2887 return error_mark_node
;
2890 if (!lvalue_p (array
) && (complain
& tf_error
))
2891 pedwarn (loc
, OPT_pedantic
,
2892 "ISO C++ forbids subscripting non-lvalue array");
2894 /* Note in C++ it is valid to subscript a `register' array, since
2895 it is valid to take the address of something with that
2896 storage specification. */
2900 while (TREE_CODE (foo
) == COMPONENT_REF
)
2901 foo
= TREE_OPERAND (foo
, 0);
2902 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2903 && (complain
& tf_warning
))
2904 warning_at (loc
, OPT_Wextra
,
2905 "subscripting array declared %<register%>");
2908 type
= TREE_TYPE (TREE_TYPE (array
));
2909 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2910 /* Array ref is const/volatile if the array elements are
2911 or if the array is.. */
2912 TREE_READONLY (rval
)
2913 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2914 TREE_SIDE_EFFECTS (rval
)
2915 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2916 TREE_THIS_VOLATILE (rval
)
2917 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2918 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
2920 protected_set_expr_location (ret
, loc
);
2925 tree ar
= default_conversion (array
);
2926 tree ind
= default_conversion (idx
);
2928 /* Put the integer in IND to simplify error checking. */
2929 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2936 if (ar
== error_mark_node
)
2939 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2941 if (complain
& tf_error
)
2942 error_at (loc
, "subscripted value is neither array nor pointer");
2943 return error_mark_node
;
2945 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2947 if (complain
& tf_error
)
2948 error_at (loc
, "array subscript is not an integer");
2949 return error_mark_node
;
2952 warn_array_subscript_with_type_char (idx
);
2954 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2959 protected_set_expr_location (ret
, loc
);
2964 /* Entry point for Obj-C++. */
2967 build_array_ref (location_t loc
, tree array
, tree idx
)
2969 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
2972 /* Resolve a pointer to member function. INSTANCE is the object
2973 instance to use, if the member points to a virtual member.
2975 This used to avoid checking for virtual functions if basetype
2976 has no virtual functions, according to an earlier ANSI draft.
2977 With the final ISO C++ rules, such an optimization is
2978 incorrect: A pointer to a derived member can be static_cast
2979 to pointer-to-base-member, as long as the dynamic object
2980 later has the right member. */
2983 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2985 if (TREE_CODE (function
) == OFFSET_REF
)
2986 function
= TREE_OPERAND (function
, 1);
2988 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2990 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2991 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2993 tree instance_ptr
= *instance_ptrptr
;
2994 tree instance_save_expr
= 0;
2995 if (instance_ptr
== error_mark_node
)
2997 if (TREE_CODE (function
) == PTRMEM_CST
)
2999 /* Extracting the function address from a pmf is only
3000 allowed with -Wno-pmf-conversions. It only works for
3002 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3003 e1
= convert (fntype
, e1
);
3008 error ("object missing in use of %qE", function
);
3009 return error_mark_node
;
3013 if (TREE_SIDE_EFFECTS (instance_ptr
))
3014 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3016 if (TREE_SIDE_EFFECTS (function
))
3017 function
= save_expr (function
);
3019 /* Start by extracting all the information from the PMF itself. */
3020 e3
= pfn_from_ptrmemfunc (function
);
3021 delta
= delta_from_ptrmemfunc (function
);
3022 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3023 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3025 case ptrmemfunc_vbit_in_pfn
:
3026 e1
= cp_build_binary_op (input_location
,
3027 BIT_AND_EXPR
, idx
, integer_one_node
,
3028 tf_warning_or_error
);
3029 idx
= cp_build_binary_op (input_location
,
3030 MINUS_EXPR
, idx
, integer_one_node
,
3031 tf_warning_or_error
);
3034 case ptrmemfunc_vbit_in_delta
:
3035 e1
= cp_build_binary_op (input_location
,
3036 BIT_AND_EXPR
, delta
, integer_one_node
,
3037 tf_warning_or_error
);
3038 delta
= cp_build_binary_op (input_location
,
3039 RSHIFT_EXPR
, delta
, integer_one_node
,
3040 tf_warning_or_error
);
3047 /* Convert down to the right base before using the instance. A
3048 special case is that in a pointer to member of class C, C may
3049 be incomplete. In that case, the function will of course be
3050 a member of C, and no conversion is required. In fact,
3051 lookup_base will fail in that case, because incomplete
3052 classes do not have BINFOs. */
3053 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3054 if (!same_type_ignoring_top_level_qualifiers_p
3055 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3057 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3058 basetype
, ba_check
, NULL
);
3059 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3061 if (instance_ptr
== error_mark_node
)
3062 return error_mark_node
;
3064 /* ...and then the delta in the PMF. */
3065 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3066 instance_ptr
, fold_convert (sizetype
, delta
));
3068 /* Hand back the adjusted 'this' argument to our caller. */
3069 *instance_ptrptr
= instance_ptr
;
3071 /* Next extract the vtable pointer from the object. */
3072 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3074 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3075 /* If the object is not dynamic the access invokes undefined
3076 behavior. As it is not executed in this case silence the
3077 spurious warnings it may provoke. */
3078 TREE_NO_WARNING (vtbl
) = 1;
3080 /* Finally, extract the function pointer from the vtable. */
3081 e2
= fold_build2_loc (input_location
,
3082 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3083 fold_convert (sizetype
, idx
));
3084 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3085 TREE_CONSTANT (e2
) = 1;
3087 /* When using function descriptors, the address of the
3088 vtable entry is treated as a function pointer. */
3089 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3090 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3091 cp_build_addr_expr (e2
, tf_warning_or_error
));
3093 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3094 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3096 /* Make sure this doesn't get evaluated first inside one of the
3097 branches of the COND_EXPR. */
3098 if (instance_save_expr
)
3099 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3100 instance_save_expr
, e1
);
3107 /* Used by the C-common bits. */
3109 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3110 tree function
, tree params
)
3112 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3115 /* Used by the C-common bits. */
3117 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3118 tree function
, VEC(tree
,gc
) *params
,
3119 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3121 VEC(tree
,gc
) *orig_params
= params
;
3122 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3123 tf_warning_or_error
);
3125 /* cp_build_function_call_vec can reallocate PARAMS by adding
3126 default arguments. That should never happen here. Verify
3128 gcc_assert (params
== orig_params
);
3133 /* Build a function call using a tree list of arguments. */
3136 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3141 vec
= make_tree_vector ();
3142 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3143 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3144 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3145 release_tree_vector (vec
);
3149 /* Build a function call using varargs. */
3152 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3158 vec
= make_tree_vector ();
3159 va_start (args
, complain
);
3160 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3161 VEC_safe_push (tree
, gc
, vec
, t
);
3163 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3164 release_tree_vector (vec
);
3168 /* Build a function call using a vector of arguments. PARAMS may be
3169 NULL if there are no parameters. This changes the contents of
3173 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3174 tsubst_flags_t complain
)
3176 tree fntype
, fndecl
;
3178 tree original
= function
;
3182 VEC(tree
,gc
) *allocated
= NULL
;
3185 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3186 expressions, like those used for ObjC messenger dispatches. */
3187 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3188 function
= objc_rewrite_function_call (function
,
3189 VEC_index (tree
, *params
, 0));
3191 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3192 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3193 if (TREE_CODE (function
) == NOP_EXPR
3194 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3195 function
= TREE_OPERAND (function
, 0);
3197 if (TREE_CODE (function
) == FUNCTION_DECL
)
3199 mark_used (function
);
3202 /* Convert anything with function type to a pointer-to-function. */
3203 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3204 pedwarn (input_location
, OPT_pedantic
,
3205 "ISO C++ forbids calling %<::main%> from within program");
3207 function
= build_addr_func (function
);
3213 function
= build_addr_func (function
);
3216 if (function
== error_mark_node
)
3217 return error_mark_node
;
3219 fntype
= TREE_TYPE (function
);
3221 if (TYPE_PTRMEMFUNC_P (fntype
))
3223 if (complain
& tf_error
)
3224 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3225 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3226 original
, original
);
3227 return error_mark_node
;
3230 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3231 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3233 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3234 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3236 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3238 if (complain
& tf_error
)
3239 error ("%qE cannot be used as a function", original
);
3240 return error_mark_node
;
3243 /* fntype now gets the type of function pointed to. */
3244 fntype
= TREE_TYPE (fntype
);
3245 parm_types
= TYPE_ARG_TYPES (fntype
);
3249 allocated
= make_tree_vector ();
3250 params
= &allocated
;
3253 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3256 return error_mark_node
;
3258 argarray
= VEC_address (tree
, *params
);
3260 /* Check for errors in format strings and inappropriately
3262 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3265 ret
= build_cxx_call (function
, nargs
, argarray
);
3267 if (allocated
!= NULL
)
3268 release_tree_vector (allocated
);
3273 /* Subroutine of convert_arguments.
3274 Warn about wrong number of args are genereted. */
3277 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3281 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3283 if (DECL_NAME (fndecl
) == NULL_TREE
3284 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3287 ? G_("too many arguments to constructor %q#D")
3288 : G_("too few arguments to constructor %q#D"),
3293 ? G_("too many arguments to member function %q#D")
3294 : G_("too few arguments to member function %q#D"),
3300 ? G_("too many arguments to function %q#D")
3301 : G_("too few arguments to function %q#D"),
3303 inform (DECL_SOURCE_LOCATION (fndecl
),
3308 if (c_dialect_objc () && objc_message_selector ())
3311 ? G_("too many arguments to method %q#D")
3312 : G_("too few arguments to method %q#D"),
3313 objc_message_selector ());
3315 error_at (loc
, too_many_p
? G_("too many arguments to function")
3316 : G_("too few arguments to function"));
3320 /* Convert the actual parameter expressions in the list VALUES to the
3321 types in the list TYPELIST. The converted expressions are stored
3322 back in the VALUES vector.
3323 If parmdecls is exhausted, or when an element has NULL as its type,
3324 perform the default conversions.
3326 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3328 This is also where warnings about wrong number of args are generated.
3330 Returns the actual number of arguments processed (which might be less
3331 than the length of the vector), or -1 on error.
3333 In C++, unspecified trailing parameters can be filled in with their
3334 default arguments, if such were specified. Do so here. */
3337 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3338 int flags
, tsubst_flags_t complain
)
3343 /* Argument passing is always copy-initialization. */
3344 flags
|= LOOKUP_ONLYCONVERTING
;
3346 for (i
= 0, typetail
= typelist
;
3347 i
< VEC_length (tree
, *values
);
3350 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3351 tree val
= VEC_index (tree
, *values
, i
);
3353 if (val
== error_mark_node
|| type
== error_mark_node
)
3356 if (type
== void_type_node
)
3358 if (complain
& tf_error
)
3360 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3367 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3368 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3369 if (TREE_CODE (val
) == NOP_EXPR
3370 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3371 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3372 val
= TREE_OPERAND (val
, 0);
3374 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3376 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3377 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3378 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3379 val
= decay_conversion (val
);
3382 if (val
== error_mark_node
)
3387 /* Formal parm type is specified by a function prototype. */
3390 if (!COMPLETE_TYPE_P (complete_type (type
)))
3392 if (complain
& tf_error
)
3395 error ("parameter %P of %qD has incomplete type %qT",
3398 error ("parameter %P has incomplete type %qT", i
, type
);
3400 parmval
= error_mark_node
;
3404 parmval
= convert_for_initialization
3405 (NULL_TREE
, type
, val
, flags
,
3406 ICR_ARGPASS
, fndecl
, i
, complain
);
3407 parmval
= convert_for_arg_passing (type
, parmval
);
3410 if (parmval
== error_mark_node
)
3413 VEC_replace (tree
, *values
, i
, parmval
);
3417 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3418 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3419 /* Don't do ellipsis conversion for __built_in_constant_p
3420 as this will result in spurious errors for non-trivial
3422 val
= require_complete_type_sfinae (val
, complain
);
3424 val
= convert_arg_to_ellipsis (val
);
3426 VEC_replace (tree
, *values
, i
, val
);
3430 typetail
= TREE_CHAIN (typetail
);
3433 if (typetail
!= 0 && typetail
!= void_list_node
)
3435 /* See if there are default arguments that can be used. Because
3436 we hold default arguments in the FUNCTION_TYPE (which is so
3437 wrong), we can see default parameters here from deduced
3438 contexts (and via typeof) for indirect function calls.
3439 Fortunately we know whether we have a function decl to
3440 provide default arguments in a language conformant
3442 if (fndecl
&& TREE_PURPOSE (typetail
)
3443 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3445 for (; typetail
!= void_list_node
; ++i
)
3448 = convert_default_arg (TREE_VALUE (typetail
),
3449 TREE_PURPOSE (typetail
),
3452 if (parmval
== error_mark_node
)
3455 VEC_safe_push (tree
, gc
, *values
, parmval
);
3456 typetail
= TREE_CHAIN (typetail
);
3457 /* ends with `...'. */
3458 if (typetail
== NULL_TREE
)
3464 if (complain
& tf_error
)
3465 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3473 /* Build a binary-operation expression, after performing default
3474 conversions on the operands. CODE is the kind of expression to
3475 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3476 are the tree codes which correspond to ARG1 and ARG2 when issuing
3477 warnings about possibly misplaced parentheses. They may differ
3478 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3479 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3480 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3481 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3482 ARG2_CODE as ERROR_MARK. */
3485 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3486 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3487 tsubst_flags_t complain
)
3496 if (processing_template_decl
)
3498 if (type_dependent_expression_p (arg1
)
3499 || type_dependent_expression_p (arg2
))
3500 return build_min_nt (code
, arg1
, arg2
);
3501 arg1
= build_non_dependent_expr (arg1
);
3502 arg2
= build_non_dependent_expr (arg2
);
3505 if (code
== DOTSTAR_EXPR
)
3506 expr
= build_m_component_ref (arg1
, arg2
);
3508 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3509 overloaded_p
, complain
);
3511 /* Check for cases such as x+y<<z which users are likely to
3512 misinterpret. But don't warn about obj << x + y, since that is a
3513 common idiom for I/O. */
3514 if (warn_parentheses
3515 && (complain
& tf_warning
)
3516 && !processing_template_decl
3517 && !error_operand_p (arg1
)
3518 && !error_operand_p (arg2
)
3519 && (code
!= LSHIFT_EXPR
3520 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3521 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3523 if (processing_template_decl
&& expr
!= error_mark_node
)
3524 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3529 /* Build and return an ARRAY_REF expression. */
3532 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3534 tree orig_arg1
= arg1
;
3535 tree orig_arg2
= arg2
;
3538 if (processing_template_decl
)
3540 if (type_dependent_expression_p (arg1
)
3541 || type_dependent_expression_p (arg2
))
3542 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3543 NULL_TREE
, NULL_TREE
);
3544 arg1
= build_non_dependent_expr (arg1
);
3545 arg2
= build_non_dependent_expr (arg2
);
3548 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3549 /*overloaded_p=*/NULL
, complain
);
3551 if (processing_template_decl
&& expr
!= error_mark_node
)
3552 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3553 NULL_TREE
, NULL_TREE
);
3557 /* For the c-common bits. */
3559 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3560 int convert_p ATTRIBUTE_UNUSED
)
3562 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3566 /* Build a binary-operation expression without default conversions.
3567 CODE is the kind of expression to build.
3568 LOCATION is the location_t of the operator in the source code.
3569 This function differs from `build' in several ways:
3570 the data type of the result is computed and recorded in it,
3571 warnings are generated if arg data types are invalid,
3572 special handling for addition and subtraction of pointers is known,
3573 and some optimization is done (operations on narrow ints
3574 are done in the narrower type when that gives the same result).
3575 Constant folding is also done before the result is returned.
3577 Note that the operands will never have enumeral types
3578 because either they have just had the default conversions performed
3579 or they have both just been converted to some other type in which
3580 the arithmetic is to be done.
3582 C++: must do special pointer arithmetic when implementing
3583 multiple inheritance, and deal with pointer to member functions. */
3586 cp_build_binary_op (location_t location
,
3587 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3588 tsubst_flags_t complain
)
3591 enum tree_code code0
, code1
;
3593 const char *invalid_op_diag
;
3595 /* Expression code to give to the expression when it is built.
3596 Normally this is CODE, which is what the caller asked for,
3597 but in some special cases we change it. */
3598 enum tree_code resultcode
= code
;
3600 /* Data type in which the computation is to be performed.
3601 In the simplest cases this is the common type of the arguments. */
3602 tree result_type
= NULL
;
3604 /* Nonzero means operands have already been type-converted
3605 in whatever way is necessary.
3606 Zero means they need to be converted to RESULT_TYPE. */
3609 /* Nonzero means create the expression with this type, rather than
3611 tree build_type
= 0;
3613 /* Nonzero means after finally constructing the expression
3614 convert it to this type. */
3615 tree final_type
= 0;
3619 /* Nonzero if this is an operation like MIN or MAX which can
3620 safely be computed in short if both args are promoted shorts.
3621 Also implies COMMON.
3622 -1 indicates a bitwise operation; this makes a difference
3623 in the exact conditions for when it is safe to do the operation
3624 in a narrower mode. */
3627 /* Nonzero if this is a comparison operation;
3628 if both args are promoted shorts, compare the original shorts.
3629 Also implies COMMON. */
3630 int short_compare
= 0;
3632 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3635 /* True if both operands have arithmetic type. */
3636 bool arithmetic_types_p
;
3638 /* Apply default conversions. */
3642 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3643 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3644 || code
== TRUTH_XOR_EXPR
)
3646 if (!really_overloaded_fn (op0
))
3647 op0
= decay_conversion (op0
);
3648 if (!really_overloaded_fn (op1
))
3649 op1
= decay_conversion (op1
);
3653 if (!really_overloaded_fn (op0
))
3654 op0
= default_conversion (op0
);
3655 if (!really_overloaded_fn (op1
))
3656 op1
= default_conversion (op1
);
3659 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3660 STRIP_TYPE_NOPS (op0
);
3661 STRIP_TYPE_NOPS (op1
);
3663 /* DTRT if one side is an overloaded function, but complain about it. */
3664 if (type_unknown_p (op0
))
3666 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3667 if (t
!= error_mark_node
)
3669 if (complain
& tf_error
)
3670 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3675 if (type_unknown_p (op1
))
3677 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3678 if (t
!= error_mark_node
)
3680 if (complain
& tf_error
)
3681 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3687 type0
= TREE_TYPE (op0
);
3688 type1
= TREE_TYPE (op1
);
3690 /* The expression codes of the data types of the arguments tell us
3691 whether the arguments are integers, floating, pointers, etc. */
3692 code0
= TREE_CODE (type0
);
3693 code1
= TREE_CODE (type1
);
3695 /* If an error was already reported for one of the arguments,
3696 avoid reporting another error. */
3697 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3698 return error_mark_node
;
3700 if ((invalid_op_diag
3701 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3703 error (invalid_op_diag
);
3704 return error_mark_node
;
3707 /* Issue warnings about peculiar, but valid, uses of NULL. */
3708 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3709 /* It's reasonable to use pointer values as operands of &&
3710 and ||, so NULL is no exception. */
3711 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3712 && ( /* Both are NULL (or 0) and the operation was not a
3713 comparison or a pointer subtraction. */
3714 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3715 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3716 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3717 || (!null_ptr_cst_p (orig_op0
)
3718 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3719 || (!null_ptr_cst_p (orig_op1
)
3720 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3721 && (complain
& tf_warning
))
3722 /* Some sort of arithmetic operation involving NULL was
3724 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3729 /* Subtraction of two similar pointers.
3730 We must subtract them as integers, then divide by object size. */
3731 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3732 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3734 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3735 /* In all other cases except pointer - int, the usual arithmetic
3737 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3742 /* The pointer - int case is just like pointer + int; fall
3745 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3746 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3750 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3751 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3752 if (processing_template_decl
)
3754 result_type
= TREE_TYPE (ptr_operand
);
3757 return cp_pointer_int_sum (code
,
3768 case TRUNC_DIV_EXPR
:
3770 case FLOOR_DIV_EXPR
:
3771 case ROUND_DIV_EXPR
:
3772 case EXACT_DIV_EXPR
:
3773 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3774 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3775 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3776 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3778 enum tree_code tcode0
= code0
, tcode1
= code1
;
3780 warn_for_div_by_zero (location
, op1
);
3782 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3783 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3784 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3785 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3787 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3788 resultcode
= RDIV_EXPR
;
3790 /* When dividing two signed integers, we have to promote to int.
3791 unless we divide by a constant != -1. Note that default
3792 conversion will have been performed on the operands at this
3793 point, so we have to dig out the original type to find out if
3795 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3796 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3797 || (TREE_CODE (op1
) == INTEGER_CST
3798 && ! integer_all_onesp (op1
)));
3807 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3808 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3809 && !VECTOR_FLOAT_TYPE_P (type0
)
3810 && !VECTOR_FLOAT_TYPE_P (type1
)))
3814 case TRUNC_MOD_EXPR
:
3815 case FLOOR_MOD_EXPR
:
3816 warn_for_div_by_zero (location
, op1
);
3818 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3819 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3820 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3822 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3824 /* Although it would be tempting to shorten always here, that loses
3825 on some targets, since the modulo instruction is undefined if the
3826 quotient can't be represented in the computation mode. We shorten
3827 only if unsigned or if dividing by something we know != -1. */
3828 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3829 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3830 || (TREE_CODE (op1
) == INTEGER_CST
3831 && ! integer_all_onesp (op1
)));
3836 case TRUTH_ANDIF_EXPR
:
3837 case TRUTH_ORIF_EXPR
:
3838 case TRUTH_AND_EXPR
:
3840 result_type
= boolean_type_node
;
3843 /* Shift operations: result has same type as first operand;
3844 always convert second operand to int.
3845 Also set SHORT_SHIFT if shifting rightward. */
3848 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3850 result_type
= type0
;
3851 if (TREE_CODE (op1
) == INTEGER_CST
)
3853 if (tree_int_cst_lt (op1
, integer_zero_node
))
3855 if ((complain
& tf_warning
)
3856 && c_inhibit_evaluation_warnings
== 0)
3857 warning (0, "right shift count is negative");
3861 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3862 && (complain
& tf_warning
)
3863 && c_inhibit_evaluation_warnings
== 0)
3864 warning (0, "right shift count >= width of type");
3867 /* Convert the shift-count to an integer, regardless of
3868 size of value being shifted. */
3869 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3870 op1
= cp_convert (integer_type_node
, op1
);
3871 /* Avoid converting op1 to result_type later. */
3877 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3879 result_type
= type0
;
3880 if (TREE_CODE (op1
) == INTEGER_CST
)
3882 if (tree_int_cst_lt (op1
, integer_zero_node
))
3884 if ((complain
& tf_warning
)
3885 && c_inhibit_evaluation_warnings
== 0)
3886 warning (0, "left shift count is negative");
3888 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3890 if ((complain
& tf_warning
)
3891 && c_inhibit_evaluation_warnings
== 0)
3892 warning (0, "left shift count >= width of type");
3895 /* Convert the shift-count to an integer, regardless of
3896 size of value being shifted. */
3897 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3898 op1
= cp_convert (integer_type_node
, op1
);
3899 /* Avoid converting op1 to result_type later. */
3906 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3908 result_type
= type0
;
3909 if (TREE_CODE (op1
) == INTEGER_CST
)
3911 if (tree_int_cst_lt (op1
, integer_zero_node
))
3913 if (complain
& tf_warning
)
3914 warning (0, (code
== LROTATE_EXPR
)
3915 ? G_("left rotate count is negative")
3916 : G_("right rotate count is negative"));
3918 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3920 if (complain
& tf_warning
)
3921 warning (0, (code
== LROTATE_EXPR
)
3922 ? G_("left rotate count >= width of type")
3923 : G_("right rotate count >= width of type"));
3926 /* Convert the shift-count to an integer, regardless of
3927 size of value being shifted. */
3928 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3929 op1
= cp_convert (integer_type_node
, op1
);
3935 if ((complain
& tf_warning
)
3936 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3937 warning (OPT_Wfloat_equal
,
3938 "comparing floating point with == or != is unsafe");
3939 if ((complain
& tf_warning
)
3940 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3941 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3942 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3944 build_type
= boolean_type_node
;
3945 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3946 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3947 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3948 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3950 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3951 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3952 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3953 CPO_COMPARISON
, complain
);
3954 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3955 && null_ptr_cst_p (op1
))
3957 if (TREE_CODE (op0
) == ADDR_EXPR
3958 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3960 if (complain
& tf_warning
)
3961 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3962 TREE_OPERAND (op0
, 0));
3964 result_type
= type0
;
3966 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3967 && null_ptr_cst_p (op0
))
3969 if (TREE_CODE (op1
) == ADDR_EXPR
3970 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3972 if (complain
& tf_warning
)
3973 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3974 TREE_OPERAND (op1
, 0));
3976 result_type
= type1
;
3978 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
3979 /* One of the operands must be of nullptr_t type. */
3980 result_type
= TREE_TYPE (nullptr_node
);
3981 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3983 result_type
= type0
;
3984 if (complain
& tf_error
)
3985 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3987 return error_mark_node
;
3989 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3991 result_type
= type1
;
3992 if (complain
& tf_error
)
3993 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3995 return error_mark_node
;
3997 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3999 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4000 == ptrmemfunc_vbit_in_delta
)
4002 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4003 tree delta0
= delta_from_ptrmemfunc (op0
);
4004 tree e1
= cp_build_binary_op (location
,
4007 build_zero_cst (TREE_TYPE (pfn0
)),
4009 tree e2
= cp_build_binary_op (location
,
4014 e2
= cp_build_binary_op (location
,
4015 EQ_EXPR
, e2
, integer_zero_node
,
4017 op0
= cp_build_binary_op (location
,
4018 TRUTH_ANDIF_EXPR
, e1
, e2
,
4020 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4024 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4025 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4027 result_type
= TREE_TYPE (op0
);
4029 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4030 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4031 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4034 /* E will be the final comparison. */
4036 /* E1 and E2 are for scratch. */
4044 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4045 CPO_COMPARISON
, complain
);
4047 if (!same_type_p (TREE_TYPE (op0
), type
))
4048 op0
= cp_convert_and_check (type
, op0
);
4049 if (!same_type_p (TREE_TYPE (op1
), type
))
4050 op1
= cp_convert_and_check (type
, op1
);
4052 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4053 return error_mark_node
;
4055 if (TREE_SIDE_EFFECTS (op0
))
4056 op0
= save_expr (op0
);
4057 if (TREE_SIDE_EFFECTS (op1
))
4058 op1
= save_expr (op1
);
4060 pfn0
= pfn_from_ptrmemfunc (op0
);
4061 pfn1
= pfn_from_ptrmemfunc (op1
);
4062 delta0
= delta_from_ptrmemfunc (op0
);
4063 delta1
= delta_from_ptrmemfunc (op1
);
4064 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4065 == ptrmemfunc_vbit_in_delta
)
4070 && ((op0.delta == op1.delta)
4071 || (!op0.pfn && op0.delta & 1 == 0
4072 && op1.delta & 1 == 0))
4074 The reason for the `!op0.pfn' bit is that a NULL
4075 pointer-to-member is any member with a zero PFN and
4076 LSB of the DELTA field is 0. */
4078 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4082 e1
= cp_build_binary_op (location
,
4083 EQ_EXPR
, e1
, integer_zero_node
,
4085 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4089 e2
= cp_build_binary_op (location
,
4090 EQ_EXPR
, e2
, integer_zero_node
,
4092 e1
= cp_build_binary_op (location
,
4093 TRUTH_ANDIF_EXPR
, e2
, e1
,
4095 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4097 build_zero_cst (TREE_TYPE (pfn0
)),
4099 e2
= cp_build_binary_op (location
,
4100 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4101 e1
= cp_build_binary_op (location
,
4102 EQ_EXPR
, delta0
, delta1
, complain
);
4103 e1
= cp_build_binary_op (location
,
4104 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4111 && (!op0.pfn || op0.delta == op1.delta))
4113 The reason for the `!op0.pfn' bit is that a NULL
4114 pointer-to-member is any member with a zero PFN; the
4115 DELTA field is unspecified. */
4117 e1
= cp_build_binary_op (location
,
4118 EQ_EXPR
, delta0
, delta1
, complain
);
4119 e2
= cp_build_binary_op (location
,
4122 build_zero_cst (TREE_TYPE (pfn0
)),
4124 e1
= cp_build_binary_op (location
,
4125 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4127 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4128 e
= cp_build_binary_op (location
,
4129 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4130 if (code
== EQ_EXPR
)
4132 return cp_build_binary_op (location
,
4133 EQ_EXPR
, e
, integer_zero_node
, complain
);
4137 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4138 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4140 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4141 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4149 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4150 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4152 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4153 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4154 CPO_COMPARISON
, complain
);
4161 if (TREE_CODE (orig_op0
) == STRING_CST
4162 || TREE_CODE (orig_op1
) == STRING_CST
)
4164 if (complain
& tf_warning
)
4165 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4168 build_type
= boolean_type_node
;
4169 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4170 || code0
== ENUMERAL_TYPE
)
4171 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4172 || code1
== ENUMERAL_TYPE
))
4174 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4175 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4176 CPO_COMPARISON
, complain
);
4177 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4178 result_type
= type0
;
4179 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4180 result_type
= type1
;
4181 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4182 /* One of the operands must be of nullptr_t type. */
4183 result_type
= TREE_TYPE (nullptr_node
);
4184 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4186 result_type
= type0
;
4187 if (complain
& tf_error
)
4188 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4190 return error_mark_node
;
4192 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4194 result_type
= type1
;
4195 if (complain
& tf_error
)
4196 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4198 return error_mark_node
;
4202 case UNORDERED_EXPR
:
4209 build_type
= integer_type_node
;
4210 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4212 if (complain
& tf_error
)
4213 error ("unordered comparison on non-floating point argument");
4214 return error_mark_node
;
4223 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4224 || code0
== ENUMERAL_TYPE
)
4225 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4226 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4227 arithmetic_types_p
= 1;
4230 arithmetic_types_p
= 0;
4231 /* Vector arithmetic is only allowed when both sides are vectors. */
4232 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4234 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4235 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4238 binary_op_error (location
, code
, type0
, type1
);
4239 return error_mark_node
;
4241 arithmetic_types_p
= 1;
4244 /* Determine the RESULT_TYPE, if it is not already known. */
4246 && arithmetic_types_p
4247 && (shorten
|| common
|| short_compare
))
4249 result_type
= cp_common_type (type0
, type1
);
4250 do_warn_double_promotion (result_type
, type0
, type1
,
4251 "implicit conversion from %qT to %qT "
4252 "to match other operand of binary "
4259 if (complain
& tf_error
)
4260 error ("invalid operands of types %qT and %qT to binary %qO",
4261 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4262 return error_mark_node
;
4265 /* If we're in a template, the only thing we need to know is the
4267 if (processing_template_decl
)
4269 /* Since the middle-end checks the type when doing a build2, we
4270 need to build the tree in pieces. This built tree will never
4271 get out of the front-end as we replace it when instantiating
4273 tree tmp
= build2 (resultcode
,
4274 build_type
? build_type
: result_type
,
4276 TREE_OPERAND (tmp
, 0) = op0
;
4280 if (arithmetic_types_p
)
4282 bool first_complex
= (code0
== COMPLEX_TYPE
);
4283 bool second_complex
= (code1
== COMPLEX_TYPE
);
4284 int none_complex
= (!first_complex
&& !second_complex
);
4286 /* Adapted from patch for c/24581. */
4287 if (first_complex
!= second_complex
4288 && (code
== PLUS_EXPR
4289 || code
== MINUS_EXPR
4290 || code
== MULT_EXPR
4291 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4292 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4293 && flag_signed_zeros
)
4295 /* An operation on mixed real/complex operands must be
4296 handled specially, but the language-independent code can
4297 more easily optimize the plain complex arithmetic if
4298 -fno-signed-zeros. */
4299 tree real_type
= TREE_TYPE (result_type
);
4303 if (TREE_TYPE (op0
) != result_type
)
4304 op0
= cp_convert_and_check (result_type
, op0
);
4305 if (TREE_TYPE (op1
) != real_type
)
4306 op1
= cp_convert_and_check (real_type
, op1
);
4310 if (TREE_TYPE (op0
) != real_type
)
4311 op0
= cp_convert_and_check (real_type
, op0
);
4312 if (TREE_TYPE (op1
) != result_type
)
4313 op1
= cp_convert_and_check (result_type
, op1
);
4315 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4316 return error_mark_node
;
4319 op0
= save_expr (op0
);
4320 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4321 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4325 case TRUNC_DIV_EXPR
:
4326 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4330 real
= build2 (resultcode
, real_type
, real
, op1
);
4338 op1
= save_expr (op1
);
4339 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4340 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4344 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4347 real
= build2 (resultcode
, real_type
, op0
, real
);
4350 real
= build2 (resultcode
, real_type
, op0
, real
);
4351 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4357 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4360 /* For certain operations (which identify themselves by shorten != 0)
4361 if both args were extended from the same smaller type,
4362 do the arithmetic in that type and then extend.
4364 shorten !=0 and !=1 indicates a bitwise operation.
4365 For them, this optimization is safe only if
4366 both args are zero-extended or both are sign-extended.
4367 Otherwise, we might change the result.
4368 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4369 but calculated in (unsigned short) it would be (unsigned short)-1. */
4371 if (shorten
&& none_complex
)
4373 final_type
= result_type
;
4374 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4378 /* Comparison operations are shortened too but differently.
4379 They identify themselves by setting short_compare = 1. */
4383 /* Don't write &op0, etc., because that would prevent op0
4384 from being kept in a register.
4385 Instead, make copies of the our local variables and
4386 pass the copies by reference, then copy them back afterward. */
4387 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4388 enum tree_code xresultcode
= resultcode
;
4390 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4392 return cp_convert (boolean_type_node
, val
);
4393 op0
= xop0
, op1
= xop1
;
4395 resultcode
= xresultcode
;
4398 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4399 && warn_sign_compare
4400 && !TREE_NO_WARNING (orig_op0
)
4401 && !TREE_NO_WARNING (orig_op1
)
4402 /* Do not warn until the template is instantiated; we cannot
4403 bound the ranges of the arguments until that point. */
4404 && !processing_template_decl
4405 && (complain
& tf_warning
)
4406 && c_inhibit_evaluation_warnings
== 0)
4408 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4409 result_type
, resultcode
);
4413 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4414 Then the expression will be built.
4415 It will be given type FINAL_TYPE if that is nonzero;
4416 otherwise, it will be given type RESULT_TYPE. */
4419 if (TREE_TYPE (op0
) != result_type
)
4420 op0
= cp_convert_and_check (result_type
, op0
);
4421 if (TREE_TYPE (op1
) != result_type
)
4422 op1
= cp_convert_and_check (result_type
, op1
);
4424 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4425 return error_mark_node
;
4428 if (build_type
== NULL_TREE
)
4429 build_type
= result_type
;
4431 result
= build2 (resultcode
, build_type
, op0
, op1
);
4432 result
= fold_if_not_in_template (result
);
4433 if (final_type
!= 0)
4434 result
= cp_convert (final_type
, result
);
4436 if (TREE_OVERFLOW_P (result
)
4437 && !TREE_OVERFLOW_P (op0
)
4438 && !TREE_OVERFLOW_P (op1
))
4439 overflow_warning (location
, result
);
4444 /* Return a tree for the sum or difference (RESULTCODE says which)
4445 of pointer PTROP and integer INTOP. */
4448 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4450 tree res_type
= TREE_TYPE (ptrop
);
4452 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4453 in certain circumstance (when it's valid to do so). So we need
4454 to make sure it's complete. We don't need to check here, if we
4455 can actually complete it at all, as those checks will be done in
4456 pointer_int_sum() anyway. */
4457 complete_type (TREE_TYPE (res_type
));
4459 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4460 fold_if_not_in_template (intop
));
4463 /* Return a tree for the difference of pointers OP0 and OP1.
4464 The resulting tree has type int. */
4467 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4470 tree restype
= ptrdiff_type_node
;
4471 tree target_type
= TREE_TYPE (ptrtype
);
4473 if (!complete_type_or_else (target_type
, NULL_TREE
))
4474 return error_mark_node
;
4476 if (TREE_CODE (target_type
) == VOID_TYPE
)
4477 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4478 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4479 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4480 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4481 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4483 /* First do the subtraction as integers;
4484 then drop through to build the divide operator. */
4486 op0
= cp_build_binary_op (input_location
,
4488 cp_convert (restype
, op0
),
4489 cp_convert (restype
, op1
),
4490 tf_warning_or_error
);
4492 /* This generates an error if op1 is a pointer to an incomplete type. */
4493 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4494 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4496 op1
= (TYPE_PTROB_P (ptrtype
)
4497 ? size_in_bytes (target_type
)
4498 : integer_one_node
);
4500 /* Do the division. */
4502 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4503 return fold_if_not_in_template (result
);
4506 /* Construct and perhaps optimize a tree representation
4507 for a unary operation. CODE, a tree_code, specifies the operation
4508 and XARG is the operand. */
4511 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4513 tree orig_expr
= xarg
;
4517 if (processing_template_decl
)
4519 if (type_dependent_expression_p (xarg
))
4520 return build_min_nt (code
, xarg
, NULL_TREE
);
4522 xarg
= build_non_dependent_expr (xarg
);
4527 /* [expr.unary.op] says:
4529 The address of an object of incomplete type can be taken.
4531 (And is just the ordinary address operator, not an overloaded
4532 "operator &".) However, if the type is a template
4533 specialization, we must complete the type at this point so that
4534 an overloaded "operator &" will be available if required. */
4535 if (code
== ADDR_EXPR
4536 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4537 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4538 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4539 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4540 /* Don't look for a function. */;
4542 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4543 /*overloaded_p=*/NULL
, complain
);
4544 if (!exp
&& code
== ADDR_EXPR
)
4546 if (is_overloaded_fn (xarg
))
4548 tree fn
= get_first_fn (xarg
);
4549 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4551 error (DECL_CONSTRUCTOR_P (fn
)
4552 ? G_("taking address of constructor %qE")
4553 : G_("taking address of destructor %qE"),
4555 return error_mark_node
;
4559 /* A pointer to member-function can be formed only by saying
4561 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4562 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4564 if (TREE_CODE (xarg
) != OFFSET_REF
4565 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4567 error ("invalid use of %qE to form a pointer-to-member-function",
4569 if (TREE_CODE (xarg
) != OFFSET_REF
)
4570 inform (input_location
, " a qualified-id is required");
4571 return error_mark_node
;
4575 error ("parentheses around %qE cannot be used to form a"
4576 " pointer-to-member-function",
4578 PTRMEM_OK_P (xarg
) = 1;
4582 if (TREE_CODE (xarg
) == OFFSET_REF
)
4584 ptrmem
= PTRMEM_OK_P (xarg
);
4586 if (!ptrmem
&& !flag_ms_extensions
4587 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4589 /* A single non-static member, make sure we don't allow a
4590 pointer-to-member. */
4591 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4592 TREE_OPERAND (xarg
, 0),
4593 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4594 PTRMEM_OK_P (xarg
) = ptrmem
;
4598 exp
= cp_build_addr_expr_strict (xarg
, complain
);
4601 if (processing_template_decl
&& exp
!= error_mark_node
)
4602 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4603 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4604 if (TREE_CODE (exp
) == ADDR_EXPR
)
4605 PTRMEM_OK_P (exp
) = ptrmem
;
4609 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4610 constants, where a null value is represented by an INTEGER_CST of
4614 cp_truthvalue_conversion (tree expr
)
4616 tree type
= TREE_TYPE (expr
);
4617 if (TYPE_PTRMEM_P (type
))
4618 return build_binary_op (EXPR_LOCATION (expr
),
4619 NE_EXPR
, expr
, integer_zero_node
, 1);
4621 return c_common_truthvalue_conversion (input_location
, expr
);
4624 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4627 condition_conversion (tree expr
)
4630 if (processing_template_decl
)
4632 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4633 tf_warning_or_error
, LOOKUP_NORMAL
);
4634 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4638 /* Returns the address of T. This function will fold away
4639 ADDR_EXPR of INDIRECT_REF. */
4642 build_address (tree t
)
4644 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4645 return error_mark_node
;
4646 t
= build_fold_addr_expr (t
);
4647 if (TREE_CODE (t
) != ADDR_EXPR
)
4652 /* Returns the address of T with type TYPE. */
4655 build_typed_address (tree t
, tree type
)
4657 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4658 return error_mark_node
;
4659 t
= build_fold_addr_expr_with_type (t
, type
);
4660 if (TREE_CODE (t
) != ADDR_EXPR
)
4665 /* Return a NOP_EXPR converting EXPR to TYPE. */
4668 build_nop (tree type
, tree expr
)
4670 if (type
== error_mark_node
|| error_operand_p (expr
))
4672 return build1 (NOP_EXPR
, type
, expr
);
4675 /* Take the address of ARG, whatever that means under C++ semantics.
4676 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4677 and class rvalues as well.
4679 Nothing should call this function directly; instead, callers should use
4680 cp_build_addr_expr or cp_build_addr_expr_strict. */
4683 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
4688 if (!arg
|| error_operand_p (arg
))
4689 return error_mark_node
;
4691 arg
= mark_lvalue_use (arg
);
4692 argtype
= lvalue_type (arg
);
4694 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4695 || !IDENTIFIER_OPNAME_P (arg
));
4697 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4698 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4700 /* They're trying to take the address of a unique non-static
4701 member function. This is ill-formed (except in MS-land),
4702 but let's try to DTRT.
4703 Note: We only handle unique functions here because we don't
4704 want to complain if there's a static overload; non-unique
4705 cases will be handled by instantiate_type. But we need to
4706 handle this case here to allow casts on the resulting PMF.
4707 We could defer this in non-MS mode, but it's easier to give
4708 a useful error here. */
4710 /* Inside constant member functions, the `this' pointer
4711 contains an extra const qualifier. TYPE_MAIN_VARIANT
4712 is used here to remove this const from the diagnostics
4713 and the created OFFSET_REF. */
4714 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4715 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4718 if (! flag_ms_extensions
)
4720 tree name
= DECL_NAME (fn
);
4721 if (!(complain
& tf_error
))
4722 return error_mark_node
;
4723 else if (current_class_type
4724 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4725 /* An expression like &memfn. */
4726 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4727 " or parenthesized non-static member function to form"
4728 " a pointer to member function. Say %<&%T::%D%>",
4731 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4732 " function to form a pointer to member function."
4736 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4739 /* Uninstantiated types are all functions. Taking the
4740 address of a function is a no-op, so just return the
4742 if (type_unknown_p (arg
))
4743 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4745 if (TREE_CODE (arg
) == OFFSET_REF
)
4746 /* We want a pointer to member; bypass all the code for actually taking
4747 the address of something. */
4750 /* Anything not already handled and not a true memory reference
4752 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4753 && TREE_CODE (argtype
) != METHOD_TYPE
)
4755 cp_lvalue_kind kind
= lvalue_kind (arg
);
4756 if (kind
== clk_none
)
4758 if (complain
& tf_error
)
4759 lvalue_error (input_location
, lv_addressof
);
4760 return error_mark_node
;
4762 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
4764 if (!(complain
& tf_error
))
4765 return error_mark_node
;
4766 if (kind
& clk_class
)
4767 /* Make this a permerror because we used to accept it. */
4768 permerror (input_location
, "taking address of temporary");
4770 error ("taking address of xvalue (rvalue reference)");
4774 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4776 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4777 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4780 else if (pedantic
&& DECL_MAIN_P (arg
))
4783 /* Apparently a lot of autoconf scripts for C++ packages do this,
4784 so only complain if -pedantic. */
4785 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4786 pedwarn (input_location
, OPT_pedantic
,
4787 "ISO C++ forbids taking address of function %<::main%>");
4788 else if (flag_pedantic_errors
)
4789 return error_mark_node
;
4792 /* Let &* cancel out to simplify resulting code. */
4793 if (TREE_CODE (arg
) == INDIRECT_REF
)
4795 /* We don't need to have `current_class_ptr' wrapped in a
4796 NON_LVALUE_EXPR node. */
4797 if (arg
== current_class_ref
)
4798 return current_class_ptr
;
4800 arg
= TREE_OPERAND (arg
, 0);
4801 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4803 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4804 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4807 /* Don't let this be an lvalue. */
4812 /* ??? Cope with user tricks that amount to offsetof. */
4813 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4814 && TREE_CODE (argtype
) != METHOD_TYPE
4815 && argtype
!= unknown_type_node
4816 && (val
= get_base_address (arg
))
4817 && COMPLETE_TYPE_P (TREE_TYPE (val
))
4818 && TREE_CODE (val
) == INDIRECT_REF
4819 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
4821 tree type
= build_pointer_type (argtype
);
4822 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
4823 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
4824 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
4827 /* Handle complex lvalues (when permitted)
4828 by reduction to simpler cases. */
4829 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
4833 switch (TREE_CODE (arg
))
4837 case FIX_TRUNC_EXPR
:
4838 /* Even if we're not being pedantic, we cannot allow this
4839 extension when we're instantiating in a SFINAE
4841 if (! lvalue_p (arg
) && complain
== tf_none
)
4843 if (complain
& tf_error
)
4844 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4846 return error_mark_node
;
4851 arg
= BASELINK_FUNCTIONS (arg
);
4855 arg
= OVL_CURRENT (arg
);
4860 /* Turn a reference to a non-static data member into a
4861 pointer-to-member. */
4866 gcc_assert (PTRMEM_OK_P (arg
));
4868 t
= TREE_OPERAND (arg
, 1);
4869 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4871 if (complain
& tf_error
)
4872 error ("cannot create pointer to reference member %qD", t
);
4873 return error_mark_node
;
4876 type
= build_ptrmem_type (context_for_name_lookup (t
),
4878 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4886 if (argtype
!= error_mark_node
)
4887 argtype
= build_pointer_type (argtype
);
4889 /* In a template, we are processing a non-dependent expression
4890 so we can just form an ADDR_EXPR with the correct type. */
4891 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4893 val
= build_address (arg
);
4894 if (TREE_CODE (arg
) == OFFSET_REF
)
4895 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4897 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4899 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4901 /* We can only get here with a single static member
4903 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4904 && DECL_STATIC_FUNCTION_P (fn
));
4906 val
= build_address (fn
);
4907 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4908 /* Do not lose object's side effects. */
4909 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4910 TREE_OPERAND (arg
, 0), val
);
4912 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4914 if (complain
& tf_error
)
4915 error ("attempt to take address of bit-field structure member %qD",
4916 TREE_OPERAND (arg
, 1));
4917 return error_mark_node
;
4921 tree object
= TREE_OPERAND (arg
, 0);
4922 tree field
= TREE_OPERAND (arg
, 1);
4923 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4924 (TREE_TYPE (object
), decl_type_context (field
)));
4925 val
= build_address (arg
);
4928 if (TREE_CODE (argtype
) == POINTER_TYPE
4929 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4931 build_ptrmemfunc_type (argtype
);
4932 val
= build_ptrmemfunc (argtype
, val
, 0,
4934 tf_warning_or_error
);
4940 /* Take the address of ARG if it has one, even if it's an rvalue. */
4943 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
4945 return cp_build_addr_expr_1 (arg
, 0, complain
);
4948 /* Take the address of ARG, but only if it's an lvalue. */
4951 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
4953 return cp_build_addr_expr_1 (arg
, 1, complain
);
4956 /* C++: Must handle pointers to members.
4958 Perhaps type instantiation should be extended to handle conversion
4959 from aggregates to types we don't yet know we want? (Or are those
4960 cases typically errors which should be reported?)
4962 NOCONVERT nonzero suppresses the default promotions
4963 (such as from short to int). */
4966 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4967 tsubst_flags_t complain
)
4969 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4972 const char *errstring
= NULL
;
4974 const char *invalid_op_diag
;
4976 if (!arg
|| error_operand_p (arg
))
4977 return error_mark_node
;
4979 if ((invalid_op_diag
4980 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4985 error (invalid_op_diag
);
4986 return error_mark_node
;
4991 case UNARY_PLUS_EXPR
:
4994 int flags
= WANT_ARITH
| WANT_ENUM
;
4995 /* Unary plus (but not unary minus) is allowed on pointers. */
4996 if (code
== UNARY_PLUS_EXPR
)
4997 flags
|= WANT_POINTER
;
4998 arg
= build_expr_type_conversion (flags
, arg
, true);
5000 errstring
= (code
== NEGATE_EXPR
5001 ? _("wrong type argument to unary minus")
5002 : _("wrong type argument to unary plus"));
5005 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5006 arg
= perform_integral_promotions (arg
);
5008 /* Make sure the result is not an lvalue: a unary plus or minus
5009 expression is always a rvalue. */
5016 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5020 arg
= default_conversion (arg
);
5022 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5023 | WANT_VECTOR_OR_COMPLEX
,
5025 errstring
= _("wrong type argument to bit-complement");
5026 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5027 arg
= perform_integral_promotions (arg
);
5031 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5032 errstring
= _("wrong type argument to abs");
5033 else if (!noconvert
)
5034 arg
= default_conversion (arg
);
5038 /* Conjugating a real value is a no-op, but allow it anyway. */
5039 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5040 errstring
= _("wrong type argument to conjugation");
5041 else if (!noconvert
)
5042 arg
= default_conversion (arg
);
5045 case TRUTH_NOT_EXPR
:
5046 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5048 val
= invert_truthvalue_loc (input_location
, arg
);
5049 if (arg
!= error_mark_node
)
5051 errstring
= _("in argument to unary !");
5059 arg
= build_real_imag_expr (input_location
, code
, arg
);
5060 if (arg
== error_mark_node
)
5063 return fold_if_not_in_template (arg
);
5065 case PREINCREMENT_EXPR
:
5066 case POSTINCREMENT_EXPR
:
5067 case PREDECREMENT_EXPR
:
5068 case POSTDECREMENT_EXPR
:
5069 /* Handle complex lvalues (when permitted)
5070 by reduction to simpler cases. */
5072 val
= unary_complex_lvalue (code
, arg
);
5076 arg
= mark_lvalue_use (arg
);
5078 /* Increment or decrement the real part of the value,
5079 and don't change the imaginary part. */
5080 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5084 arg
= stabilize_reference (arg
);
5085 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5086 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5087 real
= cp_build_unary_op (code
, real
, 1, complain
);
5088 if (real
== error_mark_node
|| imag
== error_mark_node
)
5089 return error_mark_node
;
5090 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5094 /* Report invalid types. */
5096 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5099 if (code
== PREINCREMENT_EXPR
)
5100 errstring
= _("no pre-increment operator for type");
5101 else if (code
== POSTINCREMENT_EXPR
)
5102 errstring
= _("no post-increment operator for type");
5103 else if (code
== PREDECREMENT_EXPR
)
5104 errstring
= _("no pre-decrement operator for type");
5106 errstring
= _("no post-decrement operator for type");
5109 else if (arg
== error_mark_node
)
5110 return error_mark_node
;
5112 /* Report something read-only. */
5114 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5115 || TREE_READONLY (arg
))
5117 if (complain
& tf_error
)
5118 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5119 || code
== POSTINCREMENT_EXPR
)
5120 ? lv_increment
: lv_decrement
));
5122 return error_mark_node
;
5127 tree declared_type
= unlowered_expr_type (arg
);
5129 argtype
= TREE_TYPE (arg
);
5131 /* ARM $5.2.5 last annotation says this should be forbidden. */
5132 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5134 if (complain
& tf_error
)
5135 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5136 ? G_("ISO C++ forbids incrementing an enum")
5137 : G_("ISO C++ forbids decrementing an enum"));
5139 return error_mark_node
;
5142 /* Compute the increment. */
5144 if (TREE_CODE (argtype
) == POINTER_TYPE
)
5146 tree type
= complete_type (TREE_TYPE (argtype
));
5148 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5150 if (complain
& tf_error
)
5151 error (((code
== PREINCREMENT_EXPR
5152 || code
== POSTINCREMENT_EXPR
))
5153 ? G_("cannot increment a pointer to incomplete type %qT")
5154 : G_("cannot decrement a pointer to incomplete type %qT"),
5155 TREE_TYPE (argtype
));
5157 return error_mark_node
;
5159 else if ((pedantic
|| warn_pointer_arith
)
5160 && !TYPE_PTROB_P (argtype
))
5162 if (complain
& tf_error
)
5163 permerror (input_location
, (code
== PREINCREMENT_EXPR
5164 || code
== POSTINCREMENT_EXPR
)
5165 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5166 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5169 return error_mark_node
;
5172 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5175 inc
= integer_one_node
;
5177 inc
= cp_convert (argtype
, inc
);
5179 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5180 need to ask Objective-C to build the increment or decrement
5181 expression for it. */
5182 if (objc_is_property_ref (arg
))
5183 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5186 /* Complain about anything else that is not a true lvalue. */
5187 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5188 || code
== POSTINCREMENT_EXPR
)
5189 ? lv_increment
: lv_decrement
),
5191 return error_mark_node
;
5193 /* Forbid using -- on `bool'. */
5194 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5196 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5198 if (complain
& tf_error
)
5199 error ("invalid use of Boolean expression as operand "
5200 "to %<operator--%>");
5201 return error_mark_node
;
5203 val
= boolean_increment (code
, arg
);
5206 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5208 TREE_SIDE_EFFECTS (val
) = 1;
5213 /* Note that this operation never does default_conversion
5214 regardless of NOCONVERT. */
5215 return cp_build_addr_expr (arg
, complain
);
5224 argtype
= TREE_TYPE (arg
);
5225 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5228 if (complain
& tf_error
)
5229 error ("%s", errstring
);
5230 return error_mark_node
;
5233 /* Hook for the c-common bits that build a unary op. */
5235 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5236 enum tree_code code
, tree xarg
, int noconvert
)
5238 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5241 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5242 for certain kinds of expressions which are not really lvalues
5243 but which we can accept as lvalues.
5245 If ARG is not a kind of expression we can handle, return
5249 unary_complex_lvalue (enum tree_code code
, tree arg
)
5251 /* Inside a template, making these kinds of adjustments is
5252 pointless; we are only concerned with the type of the
5254 if (processing_template_decl
)
5257 /* Handle (a, b) used as an "lvalue". */
5258 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5260 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5261 tf_warning_or_error
);
5262 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5263 TREE_OPERAND (arg
, 0), real_result
);
5266 /* Handle (a ? b : c) used as an "lvalue". */
5267 if (TREE_CODE (arg
) == COND_EXPR
5268 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5269 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5271 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5272 if (TREE_CODE (arg
) == MODIFY_EXPR
5273 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5274 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5276 tree lvalue
= TREE_OPERAND (arg
, 0);
5277 if (TREE_SIDE_EFFECTS (lvalue
))
5279 lvalue
= stabilize_reference (lvalue
);
5280 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5281 lvalue
, TREE_OPERAND (arg
, 1));
5283 return unary_complex_lvalue
5284 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5287 if (code
!= ADDR_EXPR
)
5290 /* Handle (a = b) used as an "lvalue" for `&'. */
5291 if (TREE_CODE (arg
) == MODIFY_EXPR
5292 || TREE_CODE (arg
) == INIT_EXPR
)
5294 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5295 tf_warning_or_error
);
5296 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5298 TREE_NO_WARNING (arg
) = 1;
5302 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5303 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5304 || TREE_CODE (arg
) == OFFSET_REF
)
5307 /* We permit compiler to make function calls returning
5308 objects of aggregate type look like lvalues. */
5312 if (TREE_CODE (targ
) == SAVE_EXPR
)
5313 targ
= TREE_OPERAND (targ
, 0);
5315 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5317 if (TREE_CODE (arg
) == SAVE_EXPR
)
5320 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5321 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5324 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5325 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5326 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5329 /* Don't let anything else be handled specially. */
5333 /* Mark EXP saying that we need to be able to take the
5334 address of it; it should not be allocated in a register.
5335 Value is true if successful.
5337 C++: we do not allow `current_class_ptr' to be addressable. */
5340 cxx_mark_addressable (tree exp
)
5345 switch (TREE_CODE (x
))
5352 x
= TREE_OPERAND (x
, 0);
5356 if (x
== current_class_ptr
)
5358 error ("cannot take the address of %<this%>, which is an rvalue expression");
5359 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5365 /* Caller should not be trying to mark initialized
5366 constant fields addressable. */
5367 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5368 || DECL_IN_AGGR_P (x
) == 0
5370 || DECL_EXTERNAL (x
));
5375 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5376 && !DECL_ARTIFICIAL (x
))
5378 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5381 ("address of explicit register variable %qD requested", x
);
5384 else if (extra_warnings
)
5386 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5388 TREE_ADDRESSABLE (x
) = 1;
5392 TREE_ADDRESSABLE (x
) = 1;
5396 TREE_ADDRESSABLE (x
) = 1;
5400 TREE_ADDRESSABLE (x
) = 1;
5401 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5409 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5412 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5413 tsubst_flags_t complain
)
5415 tree orig_ifexp
= ifexp
;
5416 tree orig_op1
= op1
;
5417 tree orig_op2
= op2
;
5420 if (processing_template_decl
)
5422 /* The standard says that the expression is type-dependent if
5423 IFEXP is type-dependent, even though the eventual type of the
5424 expression doesn't dependent on IFEXP. */
5425 if (type_dependent_expression_p (ifexp
)
5426 /* As a GNU extension, the middle operand may be omitted. */
5427 || (op1
&& type_dependent_expression_p (op1
))
5428 || type_dependent_expression_p (op2
))
5429 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5430 ifexp
= build_non_dependent_expr (ifexp
);
5432 op1
= build_non_dependent_expr (op1
);
5433 op2
= build_non_dependent_expr (op2
);
5436 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5437 if (processing_template_decl
&& expr
!= error_mark_node
)
5438 return build_min_non_dep (COND_EXPR
, expr
,
5439 orig_ifexp
, orig_op1
, orig_op2
);
5443 /* Given a list of expressions, return a compound expression
5444 that performs them all and returns the value of the last of them. */
5447 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
5448 tsubst_flags_t complain
)
5450 tree expr
= TREE_VALUE (list
);
5452 if (TREE_CHAIN (list
))
5454 if (complain
& tf_error
)
5458 permerror (input_location
, "expression list treated as compound "
5459 "expression in initializer");
5462 permerror (input_location
, "expression list treated as compound "
5463 "expression in mem-initializer");
5466 permerror (input_location
, "expression list treated as compound "
5467 "expression in functional cast");
5473 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5474 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5481 /* Like build_x_compound_expr_from_list, but using a VEC. */
5484 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5486 if (VEC_empty (tree
, vec
))
5488 else if (VEC_length (tree
, vec
) == 1)
5489 return VEC_index (tree
, vec
, 0);
5497 permerror (input_location
,
5498 "%s expression list treated as compound expression",
5501 expr
= VEC_index (tree
, vec
, 0);
5502 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5503 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5509 /* Handle overloading of the ',' operator when needed. */
5512 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5515 tree orig_op1
= op1
;
5516 tree orig_op2
= op2
;
5518 if (processing_template_decl
)
5520 if (type_dependent_expression_p (op1
)
5521 || type_dependent_expression_p (op2
))
5522 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5523 op1
= build_non_dependent_expr (op1
);
5524 op2
= build_non_dependent_expr (op2
);
5527 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5528 /*overloaded_p=*/NULL
, complain
);
5530 result
= cp_build_compound_expr (op1
, op2
, complain
);
5532 if (processing_template_decl
&& result
!= error_mark_node
)
5533 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5538 /* Like cp_build_compound_expr, but for the c-common bits. */
5541 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5543 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5546 /* Build a compound expression. */
5549 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5551 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
5553 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5554 return error_mark_node
;
5556 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5558 /* If the rhs is a TARGET_EXPR, then build the compound
5559 expression inside the target_expr's initializer. This
5560 helps the compiler to eliminate unnecessary temporaries. */
5561 tree init
= TREE_OPERAND (rhs
, 1);
5563 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5564 TREE_OPERAND (rhs
, 1) = init
;
5569 if (type_unknown_p (rhs
))
5571 error ("no context to resolve type of %qE", rhs
);
5572 return error_mark_node
;
5575 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5578 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5579 casts away constness. CAST gives the type of cast.
5581 ??? This function warns for casting away any qualifier not just
5582 const. We would like to specify exactly what qualifiers are casted
5587 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5588 enum tree_code cast
)
5590 /* C-style casts are allowed to cast away constness. With
5591 WARN_CAST_QUAL, we still want to issue a warning. */
5592 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5595 if (!casts_away_constness (src_type
, dest_type
))
5601 warning (OPT_Wcast_qual
,
5602 "cast from type %qT to type %qT casts away qualifiers",
5603 src_type
, dest_type
);
5606 case STATIC_CAST_EXPR
:
5607 error ("static_cast from type %qT to type %qT casts away qualifiers",
5608 src_type
, dest_type
);
5611 case REINTERPRET_CAST_EXPR
:
5612 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5613 src_type
, dest_type
);
5620 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5621 (another pointer-to-member type in the same hierarchy) and return
5622 the converted expression. If ALLOW_INVERSE_P is permitted, a
5623 pointer-to-derived may be converted to pointer-to-base; otherwise,
5624 only the other direction is permitted. If C_CAST_P is true, this
5625 conversion is taking place as part of a C-style cast. */
5628 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5629 bool c_cast_p
, tsubst_flags_t complain
)
5631 if (TYPE_PTRMEM_P (type
))
5635 if (TREE_CODE (expr
) == PTRMEM_CST
)
5636 expr
= cplus_expand_constant (expr
);
5637 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5638 TYPE_PTRMEM_CLASS_TYPE (type
),
5640 c_cast_p
, complain
);
5641 if (delta
== error_mark_node
)
5642 return error_mark_node
;
5644 if (!integer_zerop (delta
))
5646 tree cond
, op1
, op2
;
5648 cond
= cp_build_binary_op (input_location
,
5651 build_int_cst (TREE_TYPE (expr
), -1),
5652 tf_warning_or_error
);
5653 op1
= build_nop (ptrdiff_type_node
, expr
);
5654 op2
= cp_build_binary_op (input_location
,
5655 PLUS_EXPR
, op1
, delta
,
5656 tf_warning_or_error
);
5658 expr
= fold_build3_loc (input_location
,
5659 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5663 return build_nop (type
, expr
);
5666 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5667 allow_inverse_p
, c_cast_p
, complain
);
5670 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5671 this static_cast is being attempted as one of the possible casts
5672 allowed by a C-style cast. (In that case, accessibility of base
5673 classes is not considered, and it is OK to cast away
5674 constness.) Return the result of the cast. *VALID_P is set to
5675 indicate whether or not the cast was valid. */
5678 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5679 bool *valid_p
, tsubst_flags_t complain
)
5684 /* Assume the cast is valid. */
5687 intype
= TREE_TYPE (expr
);
5689 /* Save casted types in the function's used types hash table. */
5690 used_types_insert (type
);
5692 /* [expr.static.cast]
5694 An lvalue of type "cv1 B", where B is a class type, can be cast
5695 to type "reference to cv2 D", where D is a class derived (clause
5696 _class.derived_) from B, if a valid standard conversion from
5697 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5698 same cv-qualification as, or greater cv-qualification than, cv1,
5699 and B is not a virtual base class of D. */
5700 /* We check this case before checking the validity of "TYPE t =
5701 EXPR;" below because for this case:
5704 struct D : public B { D(const B&); };
5706 void f() { static_cast<const D&>(b); }
5708 we want to avoid constructing a new D. The standard is not
5709 completely clear about this issue, but our interpretation is
5710 consistent with other compilers. */
5711 if (TREE_CODE (type
) == REFERENCE_TYPE
5712 && CLASS_TYPE_P (TREE_TYPE (type
))
5713 && CLASS_TYPE_P (intype
)
5714 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5715 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5716 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5717 build_pointer_type (TYPE_MAIN_VARIANT
5718 (TREE_TYPE (type
))))
5720 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5724 /* There is a standard conversion from "D*" to "B*" even if "B"
5725 is ambiguous or inaccessible. If this is really a
5726 static_cast, then we check both for inaccessibility and
5727 ambiguity. However, if this is a static_cast being performed
5728 because the user wrote a C-style cast, then accessibility is
5730 base
= lookup_base (TREE_TYPE (type
), intype
,
5731 c_cast_p
? ba_unique
: ba_check
,
5734 /* Convert from "B*" to "D*". This function will check that "B"
5735 is not a virtual base of "D". */
5736 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5737 base
, /*nonnull=*/false);
5738 /* Convert the pointer to a reference -- but then remember that
5739 there are no expressions with reference type in C++.
5741 We call rvalue so that there's an actual tree code
5742 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5743 is a variable with the same type, the conversion would get folded
5744 away, leaving just the variable and causing lvalue_kind to give
5745 the wrong answer. */
5746 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
5749 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5750 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5751 if (TREE_CODE (type
) == REFERENCE_TYPE
5752 && TYPE_REF_IS_RVALUE (type
)
5753 && real_lvalue_p (expr
)
5754 && reference_related_p (TREE_TYPE (type
), intype
)
5755 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5757 expr
= build_typed_address (expr
, type
);
5758 return convert_from_reference (expr
);
5761 /* Resolve overloaded address here rather than once in
5762 implicit_conversion and again in the inverse code below. */
5763 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5765 expr
= instantiate_type (type
, expr
, complain
);
5766 intype
= TREE_TYPE (expr
);
5769 /* [expr.static.cast]
5771 An expression e can be explicitly converted to a type T using a
5772 static_cast of the form static_cast<T>(e) if the declaration T
5773 t(e);" is well-formed, for some invented temporary variable
5775 result
= perform_direct_initialization_if_possible (type
, expr
,
5776 c_cast_p
, complain
);
5779 result
= convert_from_reference (result
);
5781 /* [expr.static.cast]
5783 If T is a reference type, the result is an lvalue; otherwise,
5784 the result is an rvalue. */
5785 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5786 result
= rvalue (result
);
5790 /* [expr.static.cast]
5792 Any expression can be explicitly converted to type cv void. */
5793 if (TREE_CODE (type
) == VOID_TYPE
)
5794 return convert_to_void (expr
, ICV_CAST
, complain
);
5796 /* [expr.static.cast]
5798 The inverse of any standard conversion sequence (clause _conv_),
5799 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5800 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5801 (_conv.bool_) conversions, can be performed explicitly using
5802 static_cast subject to the restriction that the explicit
5803 conversion does not cast away constness (_expr.const.cast_), and
5804 the following additional rules for specific cases: */
5805 /* For reference, the conversions not excluded are: integral
5806 promotions, floating point promotion, integral conversions,
5807 floating point conversions, floating-integral conversions,
5808 pointer conversions, and pointer to member conversions. */
5811 A value of integral _or enumeration_ type can be explicitly
5812 converted to an enumeration type. */
5813 /* The effect of all that is that any conversion between any two
5814 types which are integral, floating, or enumeration types can be
5816 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5817 || SCALAR_FLOAT_TYPE_P (type
))
5818 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5819 || SCALAR_FLOAT_TYPE_P (intype
)))
5820 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5822 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5823 && CLASS_TYPE_P (TREE_TYPE (type
))
5824 && CLASS_TYPE_P (TREE_TYPE (intype
))
5825 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5826 (TREE_TYPE (intype
))),
5827 build_pointer_type (TYPE_MAIN_VARIANT
5828 (TREE_TYPE (type
)))))
5833 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5834 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5835 c_cast_p
? ba_unique
: ba_check
,
5837 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5838 return cp_fold_convert(type
, expr
);
5841 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5842 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5849 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5850 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5852 if (TYPE_PTRMEM_P (type
))
5854 t1
= (build_ptrmem_type
5856 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5857 t2
= (build_ptrmem_type
5859 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5866 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5869 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5870 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5871 c_cast_p
, tf_warning_or_error
);
5875 /* [expr.static.cast]
5877 An rvalue of type "pointer to cv void" can be explicitly
5878 converted to a pointer to object type. A value of type pointer
5879 to object converted to "pointer to cv void" and back to the
5880 original pointer type will have its original value. */
5881 if (TREE_CODE (intype
) == POINTER_TYPE
5882 && VOID_TYPE_P (TREE_TYPE (intype
))
5883 && TYPE_PTROB_P (type
))
5886 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5887 return build_nop (type
, expr
);
5891 return error_mark_node
;
5894 /* Return an expression representing static_cast<TYPE>(EXPR). */
5897 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5902 if (type
== error_mark_node
|| expr
== error_mark_node
)
5903 return error_mark_node
;
5905 if (processing_template_decl
)
5907 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5908 /* We don't know if it will or will not have side effects. */
5909 TREE_SIDE_EFFECTS (expr
) = 1;
5910 return convert_from_reference (expr
);
5913 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5914 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5915 if (TREE_CODE (type
) != REFERENCE_TYPE
5916 && TREE_CODE (expr
) == NOP_EXPR
5917 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5918 expr
= TREE_OPERAND (expr
, 0);
5920 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5925 if (complain
& tf_error
)
5926 error ("invalid static_cast from type %qT to type %qT",
5927 TREE_TYPE (expr
), type
);
5928 return error_mark_node
;
5931 /* EXPR is an expression with member function or pointer-to-member
5932 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5933 not permitted by ISO C++, but we accept it in some modes. If we
5934 are not in one of those modes, issue a diagnostic. Return the
5935 converted expression. */
5938 convert_member_func_to_ptr (tree type
, tree expr
)
5943 intype
= TREE_TYPE (expr
);
5944 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5945 || TREE_CODE (intype
) == METHOD_TYPE
);
5947 if (pedantic
|| warn_pmf2ptr
)
5948 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5949 "converting from %qT to %qT", intype
, type
);
5951 if (TREE_CODE (intype
) == METHOD_TYPE
)
5952 expr
= build_addr_func (expr
);
5953 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5954 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5957 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5958 decl
= build_address (decl
);
5959 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5962 return build_nop (type
, expr
);
5965 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5966 If C_CAST_P is true, this reinterpret cast is being done as part of
5967 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5968 indicate whether or not reinterpret_cast was valid. */
5971 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5972 bool *valid_p
, tsubst_flags_t complain
)
5976 /* Assume the cast is invalid. */
5980 if (type
== error_mark_node
|| error_operand_p (expr
))
5981 return error_mark_node
;
5983 intype
= TREE_TYPE (expr
);
5985 /* Save casted types in the function's used types hash table. */
5986 used_types_insert (type
);
5988 /* [expr.reinterpret.cast]
5989 An lvalue expression of type T1 can be cast to the type
5990 "reference to T2" if an expression of type "pointer to T1" can be
5991 explicitly converted to the type "pointer to T2" using a
5992 reinterpret_cast. */
5993 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5995 if (! real_lvalue_p (expr
))
5997 if (complain
& tf_error
)
5998 error ("invalid cast of an rvalue expression of type "
6001 return error_mark_node
;
6004 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6005 "B" are related class types; the reinterpret_cast does not
6006 adjust the pointer. */
6007 if (TYPE_PTR_P (intype
)
6008 && (complain
& tf_warning
)
6009 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6010 COMPARE_BASE
| COMPARE_DERIVED
)))
6011 warning (0, "casting %qT to %qT does not dereference pointer",
6014 expr
= cp_build_addr_expr (expr
, complain
);
6016 if (warn_strict_aliasing
> 2)
6017 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6019 if (expr
!= error_mark_node
)
6020 expr
= build_reinterpret_cast_1
6021 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6023 if (expr
!= error_mark_node
)
6024 /* cp_build_indirect_ref isn't right for rvalue refs. */
6025 expr
= convert_from_reference (fold_convert (type
, expr
));
6029 /* As a G++ extension, we consider conversions from member
6030 functions, and pointers to member functions to
6031 pointer-to-function and pointer-to-void types. If
6032 -Wno-pmf-conversions has not been specified,
6033 convert_member_func_to_ptr will issue an error message. */
6034 if ((TYPE_PTRMEMFUNC_P (intype
)
6035 || TREE_CODE (intype
) == METHOD_TYPE
)
6036 && TYPE_PTR_P (type
)
6037 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6038 || VOID_TYPE_P (TREE_TYPE (type
))))
6039 return convert_member_func_to_ptr (type
, expr
);
6041 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6042 array-to-pointer, and function-to-pointer conversions are
6044 expr
= decay_conversion (expr
);
6046 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6047 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6048 if (TREE_CODE (expr
) == NOP_EXPR
6049 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6050 expr
= TREE_OPERAND (expr
, 0);
6052 if (error_operand_p (expr
))
6053 return error_mark_node
;
6055 intype
= TREE_TYPE (expr
);
6057 /* [expr.reinterpret.cast]
6058 A pointer can be converted to any integral type large enough to
6059 hold it. ... A value of type std::nullptr_t can be converted to
6060 an integral type; the conversion has the same meaning and
6061 validity as a conversion of (void*)0 to the integral type. */
6062 if (CP_INTEGRAL_TYPE_P (type
)
6063 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6065 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6067 if (complain
& tf_error
)
6068 permerror (input_location
, "cast from %qT to %qT loses precision",
6071 return error_mark_node
;
6073 if (NULLPTR_TYPE_P (intype
))
6074 return build_int_cst (type
, 0);
6076 /* [expr.reinterpret.cast]
6077 A value of integral or enumeration type can be explicitly
6078 converted to a pointer. */
6079 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6082 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6083 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6084 return fold_if_not_in_template (build_nop (type
, expr
));
6085 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6086 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6091 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6092 /* Warn about possible alignment problems. */
6093 if (STRICT_ALIGNMENT
&& warn_cast_align
6094 && (complain
& tf_warning
)
6095 && !VOID_TYPE_P (type
)
6096 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6097 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6098 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6099 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6100 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6101 "increases required alignment of target type", intype
, type
);
6103 /* We need to strip nops here, because the front end likes to
6104 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6106 if (warn_strict_aliasing
<= 2)
6107 strict_aliasing_warning (intype
, type
, sexpr
);
6109 return fold_if_not_in_template (build_nop (type
, expr
));
6111 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6112 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6114 if (pedantic
&& (complain
& tf_warning
))
6115 /* Only issue a warning, as we have always supported this
6116 where possible, and it is necessary in some cases. DR 195
6117 addresses this issue, but as of 2004/10/26 is still in
6119 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6120 return fold_if_not_in_template (build_nop (type
, expr
));
6122 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6123 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6124 else if (TREE_CODE (intype
) == VECTOR_TYPE
6125 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6126 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6131 if (complain
& tf_error
)
6132 error ("invalid cast from type %qT to type %qT", intype
, type
);
6133 return error_mark_node
;
6136 return cp_convert (type
, expr
);
6140 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6142 if (type
== error_mark_node
|| expr
== error_mark_node
)
6143 return error_mark_node
;
6145 if (processing_template_decl
)
6147 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6149 if (!TREE_SIDE_EFFECTS (t
)
6150 && type_dependent_expression_p (expr
))
6151 /* There might turn out to be side effects inside expr. */
6152 TREE_SIDE_EFFECTS (t
) = 1;
6153 return convert_from_reference (t
);
6156 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6157 /*valid_p=*/NULL
, complain
);
6160 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6161 return an appropriate expression. Otherwise, return
6162 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6163 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6164 performing a C-style cast, its value upon return will indicate
6165 whether or not the conversion succeeded. */
6168 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6172 tree reference_type
;
6174 /* Callers are responsible for handling error_mark_node as a
6175 destination type. */
6176 gcc_assert (dst_type
!= error_mark_node
);
6177 /* In a template, callers should be building syntactic
6178 representations of casts, not using this machinery. */
6179 gcc_assert (!processing_template_decl
);
6181 /* Assume the conversion is invalid. */
6185 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6188 error ("invalid use of const_cast with type %qT, "
6189 "which is not a pointer, "
6190 "reference, nor a pointer-to-data-member type", dst_type
);
6191 return error_mark_node
;
6194 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6197 error ("invalid use of const_cast with type %qT, which is a pointer "
6198 "or reference to a function type", dst_type
);
6199 return error_mark_node
;
6202 /* Save casted types in the function's used types hash table. */
6203 used_types_insert (dst_type
);
6205 src_type
= TREE_TYPE (expr
);
6206 /* Expressions do not really have reference types. */
6207 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6208 src_type
= TREE_TYPE (src_type
);
6210 /* [expr.const.cast]
6212 An lvalue of type T1 can be explicitly converted to an lvalue of
6213 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6214 types) if a pointer to T1 can be explicitly converted to the type
6215 pointer to T2 using a const_cast. */
6216 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6218 reference_type
= dst_type
;
6219 if (! real_lvalue_p (expr
))
6222 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6223 src_type
, dst_type
);
6224 return error_mark_node
;
6226 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6227 src_type
= build_pointer_type (src_type
);
6231 reference_type
= NULL_TREE
;
6232 /* If the destination type is not a reference type, the
6233 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6234 conversions are performed. */
6235 src_type
= type_decays_to (src_type
);
6236 if (src_type
== error_mark_node
)
6237 return error_mark_node
;
6240 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6241 && comp_ptr_ttypes_const (dst_type
, src_type
))
6246 /* This cast is actually a C-style cast. Issue a warning if
6247 the user is making a potentially unsafe cast. */
6248 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6252 expr
= cp_build_addr_expr (expr
,
6253 complain
? tf_warning_or_error
: tf_none
);
6254 expr
= build_nop (reference_type
, expr
);
6255 return convert_from_reference (expr
);
6259 expr
= decay_conversion (expr
);
6260 /* build_c_cast puts on a NOP_EXPR to make the result not an
6261 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6262 non-lvalue context. */
6263 if (TREE_CODE (expr
) == NOP_EXPR
6264 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6265 expr
= TREE_OPERAND (expr
, 0);
6266 return build_nop (dst_type
, expr
);
6271 error ("invalid const_cast from type %qT to type %qT",
6272 src_type
, dst_type
);
6273 return error_mark_node
;
6277 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6279 if (type
== error_mark_node
|| error_operand_p (expr
))
6280 return error_mark_node
;
6282 if (processing_template_decl
)
6284 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6286 if (!TREE_SIDE_EFFECTS (t
)
6287 && type_dependent_expression_p (expr
))
6288 /* There might turn out to be side effects inside expr. */
6289 TREE_SIDE_EFFECTS (t
) = 1;
6290 return convert_from_reference (t
);
6293 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6297 /* Like cp_build_c_cast, but for the c-common bits. */
6300 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6302 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6305 /* Build an expression representing an explicit C-style cast to type
6306 TYPE of expression EXPR. */
6309 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6315 if (type
== error_mark_node
|| error_operand_p (expr
))
6316 return error_mark_node
;
6318 if (processing_template_decl
)
6320 tree t
= build_min (CAST_EXPR
, type
,
6321 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6322 /* We don't know if it will or will not have side effects. */
6323 TREE_SIDE_EFFECTS (t
) = 1;
6324 return convert_from_reference (t
);
6327 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6328 'Class') should always be retained, because this information aids
6329 in method lookup. */
6330 if (objc_is_object_ptr (type
)
6331 && objc_is_object_ptr (TREE_TYPE (expr
)))
6332 return build_nop (type
, expr
);
6334 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6335 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6336 if (TREE_CODE (type
) != REFERENCE_TYPE
6337 && TREE_CODE (value
) == NOP_EXPR
6338 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6339 value
= TREE_OPERAND (value
, 0);
6341 if (TREE_CODE (type
) == ARRAY_TYPE
)
6343 /* Allow casting from T1* to T2[] because Cfront allows it.
6344 NIHCL uses it. It is not valid ISO C++ however. */
6345 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6347 if (complain
& tf_error
)
6348 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6350 return error_mark_node
;
6351 type
= build_pointer_type (TREE_TYPE (type
));
6355 if (complain
& tf_error
)
6356 error ("ISO C++ forbids casting to an array type %qT", type
);
6357 return error_mark_node
;
6361 if (TREE_CODE (type
) == FUNCTION_TYPE
6362 || TREE_CODE (type
) == METHOD_TYPE
)
6364 if (complain
& tf_error
)
6365 error ("invalid cast to function type %qT", type
);
6366 return error_mark_node
;
6369 if (TREE_CODE (type
) == POINTER_TYPE
6370 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6371 /* Casting to an integer of smaller size is an error detected elsewhere. */
6372 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6373 /* Don't warn about converting any constant. */
6374 && !TREE_CONSTANT (value
))
6375 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6376 "cast to pointer from integer of different size");
6378 /* A C-style cast can be a const_cast. */
6379 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6384 /* Or a static cast. */
6385 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6386 &valid_p
, complain
);
6387 /* Or a reinterpret_cast. */
6389 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6390 &valid_p
, complain
);
6391 /* The static_cast or reinterpret_cast may be followed by a
6394 /* A valid cast may result in errors if, for example, a
6395 conversion to am ambiguous base class is required. */
6396 && !error_operand_p (result
))
6400 /* Non-class rvalues always have cv-unqualified type. */
6401 if (!CLASS_TYPE_P (type
))
6402 type
= TYPE_MAIN_VARIANT (type
);
6403 result_type
= TREE_TYPE (result
);
6404 if (!CLASS_TYPE_P (result_type
))
6405 result_type
= TYPE_MAIN_VARIANT (result_type
);
6406 /* If the type of RESULT does not match TYPE, perform a
6407 const_cast to make it match. If the static_cast or
6408 reinterpret_cast succeeded, we will differ by at most
6409 cv-qualification, so the follow-on const_cast is guaranteed
6411 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6413 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6414 gcc_assert (valid_p
);
6419 return error_mark_node
;
6422 /* For use from the C common bits. */
6424 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6425 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6426 enum tree_code modifycode
,
6427 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6428 tree rhs_origtype ATTRIBUTE_UNUSED
)
6430 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6433 /* Build an assignment expression of lvalue LHS from value RHS.
6434 MODIFYCODE is the code for a binary operator that we use
6435 to combine the old value of LHS with RHS to get the new value.
6436 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6438 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6441 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6442 tsubst_flags_t complain
)
6446 tree lhstype
= TREE_TYPE (lhs
);
6447 tree olhstype
= lhstype
;
6448 bool plain_assign
= (modifycode
== NOP_EXPR
);
6450 /* Avoid duplicate error messages from operands that had errors. */
6451 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6452 return error_mark_node
;
6454 /* Handle control structure constructs used as "lvalues". */
6455 switch (TREE_CODE (lhs
))
6457 /* Handle --foo = 5; as these are valid constructs in C++. */
6458 case PREDECREMENT_EXPR
:
6459 case PREINCREMENT_EXPR
:
6460 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6461 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6462 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6463 TREE_OPERAND (lhs
, 1));
6464 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6465 modifycode
, rhs
, complain
);
6466 if (newrhs
== error_mark_node
)
6467 return error_mark_node
;
6468 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6470 /* Handle (a, b) used as an "lvalue". */
6472 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6473 modifycode
, rhs
, complain
);
6474 if (newrhs
== error_mark_node
)
6475 return error_mark_node
;
6476 return build2 (COMPOUND_EXPR
, lhstype
,
6477 TREE_OPERAND (lhs
, 0), newrhs
);
6480 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6481 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6482 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6483 TREE_OPERAND (lhs
, 1));
6484 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6486 if (newrhs
== error_mark_node
)
6487 return error_mark_node
;
6488 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6492 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6493 when neither operand has side-effects. */
6494 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6495 return error_mark_node
;
6497 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6498 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6500 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6501 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6503 TREE_OPERAND (lhs
, 0),
6504 TREE_OPERAND (lhs
, 1)),
6505 TREE_OPERAND (lhs
, 0),
6506 TREE_OPERAND (lhs
, 1));
6509 /* Handle (a ? b : c) used as an "lvalue". */
6512 /* Produce (a ? (b = rhs) : (c = rhs))
6513 except that the RHS goes through a save-expr
6514 so the code to compute it is only emitted once. */
6516 tree preeval
= NULL_TREE
;
6518 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6520 if (complain
& tf_error
)
6521 error ("void value not ignored as it ought to be");
6522 return error_mark_node
;
6525 rhs
= stabilize_expr (rhs
, &preeval
);
6527 /* Check this here to avoid odd errors when trying to convert
6528 a throw to the type of the COND_EXPR. */
6529 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6530 return error_mark_node
;
6532 cond
= build_conditional_expr
6533 (TREE_OPERAND (lhs
, 0),
6534 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6535 modifycode
, rhs
, complain
),
6536 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6537 modifycode
, rhs
, complain
),
6540 if (cond
== error_mark_node
)
6542 /* Make sure the code to compute the rhs comes out
6543 before the split. */
6545 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6553 if (modifycode
== INIT_EXPR
)
6555 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6556 /* Do the default thing. */;
6557 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6559 /* Compound literal. */
6560 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6561 /* Call convert to generate an error; see PR 11063. */
6562 rhs
= convert (lhstype
, rhs
);
6563 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6564 TREE_SIDE_EFFECTS (result
) = 1;
6567 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6568 /* Do the default thing. */;
6571 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6572 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6573 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6575 release_tree_vector (rhs_vec
);
6576 if (result
== NULL_TREE
)
6577 return error_mark_node
;
6583 lhs
= require_complete_type_sfinae (lhs
, complain
);
6584 if (lhs
== error_mark_node
)
6585 return error_mark_node
;
6587 if (modifycode
== NOP_EXPR
)
6589 if (c_dialect_objc ())
6591 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
6596 /* `operator=' is not an inheritable operator. */
6597 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6598 /* Do the default thing. */;
6601 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6602 lhs
, rhs
, make_node (NOP_EXPR
),
6603 /*overloaded_p=*/NULL
,
6605 if (result
== NULL_TREE
)
6606 return error_mark_node
;
6613 /* A binary op has been requested. Combine the old LHS
6614 value with the RHS producing the value we should actually
6615 store into the LHS. */
6616 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6617 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6618 || MAYBE_CLASS_TYPE_P (lhstype
)));
6620 lhs
= stabilize_reference (lhs
);
6621 newrhs
= cp_build_binary_op (input_location
,
6622 modifycode
, lhs
, rhs
,
6624 if (newrhs
== error_mark_node
)
6626 if (complain
& tf_error
)
6627 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6628 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6629 return error_mark_node
;
6632 /* Now it looks like a plain assignment. */
6633 modifycode
= NOP_EXPR
;
6634 if (c_dialect_objc ())
6636 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
6641 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6642 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6645 /* The left-hand side must be an lvalue. */
6646 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6647 return error_mark_node
;
6649 /* Warn about modifying something that is `const'. Don't warn if
6650 this is initialization. */
6651 if (modifycode
!= INIT_EXPR
6652 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6653 /* Functions are not modifiable, even though they are
6655 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6656 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6657 /* If it's an aggregate and any field is const, then it is
6658 effectively const. */
6659 || (CLASS_TYPE_P (lhstype
)
6660 && C_TYPE_FIELDS_READONLY (lhstype
))))
6662 if (complain
& tf_error
)
6663 cxx_readonly_error (lhs
, lv_assign
);
6665 return error_mark_node
;
6668 /* If storing into a structure or union member, it may have been given a
6669 lowered bitfield type. We need to convert to the declared type first,
6670 so retrieve it now. */
6672 olhstype
= unlowered_expr_type (lhs
);
6674 /* Convert new value to destination type. */
6676 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6680 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6682 if (modifycode
!= INIT_EXPR
)
6684 if (complain
& tf_error
)
6685 error ("assigning to an array from an initializer list");
6686 return error_mark_node
;
6688 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6689 return error_mark_node
;
6690 newrhs
= digest_init (lhstype
, newrhs
);
6693 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6694 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6696 if (complain
& tf_error
)
6697 error ("incompatible types in assignment of %qT to %qT",
6698 TREE_TYPE (rhs
), lhstype
);
6699 return error_mark_node
;
6702 /* Allow array assignment in compiler-generated code. */
6703 else if (!current_function_decl
6704 || !DECL_ARTIFICIAL (current_function_decl
))
6706 /* This routine is used for both initialization and assignment.
6707 Make sure the diagnostic message differentiates the context. */
6708 if (complain
& tf_error
)
6710 if (modifycode
== INIT_EXPR
)
6711 error ("array used as initializer");
6713 error ("invalid array assignment");
6715 return error_mark_node
;
6718 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6719 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6720 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6721 /*explicit_value_init_p=*/false,
6722 from_array
, complain
);
6725 if (modifycode
== INIT_EXPR
)
6726 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6727 LOOKUP_ONLYCONVERTING. */
6728 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6729 ICR_INIT
, NULL_TREE
, 0,
6732 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
6733 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6735 if (!same_type_p (lhstype
, olhstype
))
6736 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6738 if (modifycode
!= INIT_EXPR
)
6740 if (TREE_CODE (newrhs
) == CALL_EXPR
6741 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6742 newrhs
= build_cplus_new (lhstype
, newrhs
);
6744 /* Can't initialize directly from a TARGET_EXPR, since that would
6745 cause the lhs to be constructed twice, and possibly result in
6746 accidental self-initialization. So we force the TARGET_EXPR to be
6747 expanded without a target. */
6748 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6749 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6750 TREE_OPERAND (newrhs
, 0));
6753 if (newrhs
== error_mark_node
)
6754 return error_mark_node
;
6756 if (c_dialect_objc () && flag_objc_gc
)
6758 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6764 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6765 lhstype
, lhs
, newrhs
);
6767 TREE_SIDE_EFFECTS (result
) = 1;
6769 TREE_NO_WARNING (result
) = 1;
6775 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6776 tsubst_flags_t complain
)
6778 if (processing_template_decl
)
6779 return build_min_nt (MODOP_EXPR
, lhs
,
6780 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6782 if (modifycode
!= NOP_EXPR
)
6784 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6785 make_node (modifycode
),
6786 /*overloaded_p=*/NULL
,
6790 TREE_NO_WARNING (rval
) = 1;
6794 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6797 /* Helper function for get_delta_difference which assumes FROM is a base
6798 class of TO. Returns a delta for the conversion of pointer-to-member
6799 of FROM to pointer-to-member of TO. If the conversion is invalid and
6800 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6801 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6802 If C_CAST_P is true, this conversion is taking place as part of a
6806 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
6807 tsubst_flags_t complain
)
6811 base_access access
= c_cast_p
? ba_unique
: ba_check
;
6813 /* Note: ba_quiet does not distinguish between access control and
6815 if (!(complain
& tf_error
))
6818 binfo
= lookup_base (to
, from
, access
, &kind
);
6820 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6822 if (!(complain
& tf_error
))
6823 return error_mark_node
;
6825 error (" in pointer to member function conversion");
6826 return size_zero_node
;
6830 if (kind
!= bk_via_virtual
)
6831 return BINFO_OFFSET (binfo
);
6833 /* FROM is a virtual base class of TO. Issue an error or warning
6834 depending on whether or not this is a reinterpret cast. */
6836 if (!(complain
& tf_error
))
6837 return error_mark_node
;
6839 error ("pointer to member conversion via virtual base %qT",
6840 BINFO_TYPE (binfo_from_vbase (binfo
)));
6842 return size_zero_node
;
6849 /* Get difference in deltas for different pointer to member function
6850 types. If the conversion is invalid and tf_error is not set in
6851 COMPLAIN, returns error_mark_node, otherwise returns an integer
6852 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6853 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6854 conversions as well. If C_CAST_P is true this conversion is taking
6855 place as part of a C-style cast.
6857 Note that the naming of FROM and TO is kind of backwards; the return
6858 value is what we add to a TO in order to get a FROM. They are named
6859 this way because we call this function to find out how to convert from
6860 a pointer to member of FROM to a pointer to member of TO. */
6863 get_delta_difference (tree from
, tree to
,
6864 bool allow_inverse_p
,
6865 bool c_cast_p
, tsubst_flags_t complain
)
6869 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6870 /* Pointer to member of incomplete class is permitted*/
6871 result
= size_zero_node
;
6873 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
6875 if (result
== error_mark_node
)
6876 return error_mark_node
;
6880 if (!allow_inverse_p
)
6882 if (!(complain
& tf_error
))
6883 return error_mark_node
;
6885 error_not_base_type (from
, to
);
6886 error (" in pointer to member conversion");
6887 result
= size_zero_node
;
6891 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
6893 if (result
== error_mark_node
)
6894 return error_mark_node
;
6897 result
= size_diffop_loc (input_location
,
6898 size_zero_node
, result
);
6901 if (!(complain
& tf_error
))
6902 return error_mark_node
;
6904 error_not_base_type (from
, to
);
6905 error (" in pointer to member conversion");
6906 result
= size_zero_node
;
6911 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6915 /* Return a constructor for the pointer-to-member-function TYPE using
6916 the other components as specified. */
6919 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6924 VEC(constructor_elt
, gc
) *v
;
6926 /* Pull the FIELD_DECLs out of the type. */
6927 pfn_field
= TYPE_FIELDS (type
);
6928 delta_field
= DECL_CHAIN (pfn_field
);
6930 /* Make sure DELTA has the type we want. */
6931 delta
= convert_and_check (delta_type_node
, delta
);
6933 /* Convert to the correct target type if necessary. */
6934 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6936 /* Finish creating the initializer. */
6937 v
= VEC_alloc(constructor_elt
, gc
, 2);
6938 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6939 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6940 u
= build_constructor (type
, v
);
6941 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6942 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6943 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6945 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6950 /* Build a constructor for a pointer to member function. It can be
6951 used to initialize global variables, local variable, or used
6952 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6955 If FORCE is nonzero, then force this conversion, even if
6956 we would rather not do it. Usually set when using an explicit
6957 cast. A C-style cast is being processed iff C_CAST_P is true.
6959 Return error_mark_node, if something goes wrong. */
6962 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
6963 tsubst_flags_t complain
)
6969 if (error_operand_p (pfn
))
6970 return error_mark_node
;
6972 pfn_type
= TREE_TYPE (pfn
);
6973 to_type
= build_ptrmemfunc_type (type
);
6975 /* Handle multiple conversions of pointer to member functions. */
6976 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6978 tree delta
= NULL_TREE
;
6979 tree npfn
= NULL_TREE
;
6983 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6984 error ("invalid conversion to type %qT from type %qT",
6987 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6988 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6990 c_cast_p
, complain
);
6991 if (n
== error_mark_node
)
6992 return error_mark_node
;
6994 /* We don't have to do any conversion to convert a
6995 pointer-to-member to its own type. But, we don't want to
6996 just return a PTRMEM_CST if there's an explicit cast; that
6997 cast should make the expression an invalid template argument. */
6998 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7000 if (same_type_p (to_type
, pfn_type
))
7002 else if (integer_zerop (n
))
7003 return build_reinterpret_cast (to_type
, pfn
,
7004 tf_warning_or_error
);
7007 if (TREE_SIDE_EFFECTS (pfn
))
7008 pfn
= save_expr (pfn
);
7010 /* Obtain the function pointer and the current DELTA. */
7011 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7012 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7015 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7016 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7019 /* Just adjust the DELTA field. */
7020 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7021 (TREE_TYPE (delta
), ptrdiff_type_node
));
7022 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7023 n
= cp_build_binary_op (input_location
,
7024 LSHIFT_EXPR
, n
, integer_one_node
,
7025 tf_warning_or_error
);
7026 delta
= cp_build_binary_op (input_location
,
7027 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
7028 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7031 /* Handle null pointer to member function conversions. */
7032 if (null_ptr_cst_p (pfn
))
7034 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7035 return build_ptrmemfunc1 (to_type
,
7040 if (type_unknown_p (pfn
))
7041 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7043 fn
= TREE_OPERAND (pfn
, 0);
7044 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7045 /* In a template, we will have preserved the
7047 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7048 return make_ptrmem_cst (to_type
, fn
);
7051 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7054 ??? There is no consistency as to the types returned for the above
7055 values. Some code acts as if it were a sizetype and some as if it were
7056 integer_type_node. */
7059 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7061 tree type
= TREE_TYPE (cst
);
7062 tree fn
= PTRMEM_CST_MEMBER (cst
);
7063 tree ptr_class
, fn_class
;
7065 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7067 /* The class that the function belongs to. */
7068 fn_class
= DECL_CONTEXT (fn
);
7070 /* The class that we're creating a pointer to member of. */
7071 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7073 /* First, calculate the adjustment to the function's class. */
7074 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7075 /*c_cast_p=*/0, tf_warning_or_error
);
7077 if (!DECL_VIRTUAL_P (fn
))
7078 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7081 /* If we're dealing with a virtual function, we have to adjust 'this'
7082 again, to point to the base which provides the vtable entry for
7083 fn; the call will do the opposite adjustment. */
7084 tree orig_class
= DECL_CONTEXT (fn
);
7085 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7086 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7087 *delta
, BINFO_OFFSET (binfo
));
7088 *delta
= fold_if_not_in_template (*delta
);
7090 /* We set PFN to the vtable offset at which the function can be
7091 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7092 case delta is shifted left, and then incremented). */
7093 *pfn
= DECL_VINDEX (fn
);
7094 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7095 TYPE_SIZE_UNIT (vtable_entry_type
));
7096 *pfn
= fold_if_not_in_template (*pfn
);
7098 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7100 case ptrmemfunc_vbit_in_pfn
:
7101 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7103 *pfn
= fold_if_not_in_template (*pfn
);
7106 case ptrmemfunc_vbit_in_delta
:
7107 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7108 *delta
, integer_one_node
);
7109 *delta
= fold_if_not_in_template (*delta
);
7110 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7111 *delta
, integer_one_node
);
7112 *delta
= fold_if_not_in_template (*delta
);
7119 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7120 *pfn
= fold_if_not_in_template (*pfn
);
7124 /* Return an expression for PFN from the pointer-to-member function
7128 pfn_from_ptrmemfunc (tree t
)
7130 if (TREE_CODE (t
) == PTRMEM_CST
)
7135 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7140 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7143 /* Return an expression for DELTA from the pointer-to-member function
7147 delta_from_ptrmemfunc (tree t
)
7149 if (TREE_CODE (t
) == PTRMEM_CST
)
7154 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7159 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7162 /* Convert value RHS to type TYPE as preparation for an assignment to
7163 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7164 implicit conversion is. If FNDECL is non-NULL, we are doing the
7165 conversion in order to pass the PARMNUMth argument of FNDECL.
7166 If FNDECL is NULL, we are doing the conversion in function pointer
7167 argument passing, conversion in initialization, etc. */
7170 convert_for_assignment (tree type
, tree rhs
,
7171 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7172 tsubst_flags_t complain
, int flags
)
7175 enum tree_code coder
;
7177 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7178 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7179 rhs
= TREE_OPERAND (rhs
, 0);
7181 rhstype
= TREE_TYPE (rhs
);
7182 coder
= TREE_CODE (rhstype
);
7184 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7185 && vector_types_convertible_p (type
, rhstype
, true))
7187 rhs
= mark_rvalue_use (rhs
);
7188 return convert (type
, rhs
);
7191 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7192 return error_mark_node
;
7193 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7194 return error_mark_node
;
7196 /* The RHS of an assignment cannot have void type. */
7197 if (coder
== VOID_TYPE
)
7199 if (complain
& tf_error
)
7200 error ("void value not ignored as it ought to be");
7201 return error_mark_node
;
7204 /* Simplify the RHS if possible. */
7205 if (TREE_CODE (rhs
) == CONST_DECL
)
7206 rhs
= DECL_INITIAL (rhs
);
7208 if (c_dialect_objc ())
7212 tree rname
= fndecl
;
7223 selector
= objc_message_selector ();
7225 if (selector
&& parmno
> 1)
7232 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7234 rhs
= mark_rvalue_use (rhs
);
7235 return convert (type
, rhs
);
7241 The expression is implicitly converted (clause _conv_) to the
7242 cv-unqualified type of the left operand.
7244 We allow bad conversions here because by the time we get to this point
7245 we are committed to doing the conversion. If we end up doing a bad
7246 conversion, convert_like will complain. */
7247 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7249 /* When -Wno-pmf-conversions is use, we just silently allow
7250 conversions from pointers-to-members to plain pointers. If
7251 the conversion doesn't work, cp_convert will complain. */
7253 && TYPE_PTR_P (type
)
7254 && TYPE_PTRMEMFUNC_P (rhstype
))
7255 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7258 if (complain
& tf_error
)
7260 /* If the right-hand side has unknown type, then it is an
7261 overloaded function. Call instantiate_type to get error
7263 if (rhstype
== unknown_type_node
)
7264 instantiate_type (type
, rhs
, tf_warning_or_error
);
7266 error ("cannot convert %qT to %qT for argument %qP to %qD",
7267 rhstype
, type
, parmnum
, fndecl
);
7271 case ICR_DEFAULT_ARGUMENT
:
7272 error ("cannot convert %qT to %qT in default argument",
7276 error ("cannot convert %qT to %qT in argument passing",
7279 case ICR_CONVERTING
:
7280 error ("cannot convert %qT to %qT",
7284 error ("cannot convert %qT to %qT in initialization",
7288 error ("cannot convert %qT to %qT in return",
7292 error ("cannot convert %qT to %qT in assignment",
7299 return error_mark_node
;
7302 if (warn_missing_format_attribute
)
7304 const enum tree_code codel
= TREE_CODE (type
);
7305 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7307 && check_missing_format_attribute (type
, rhstype
)
7308 && (complain
& tf_warning
))
7312 case ICR_DEFAULT_ARGUMENT
:
7314 warning (OPT_Wmissing_format_attribute
,
7315 "parameter %qP of %qD might be a candidate "
7316 "for a format attribute", parmnum
, fndecl
);
7318 warning (OPT_Wmissing_format_attribute
,
7319 "parameter might be a candidate "
7320 "for a format attribute");
7322 case ICR_CONVERTING
:
7323 warning (OPT_Wmissing_format_attribute
,
7324 "target of conversion might be a candidate "
7325 "for a format attribute");
7328 warning (OPT_Wmissing_format_attribute
,
7329 "target of initialization might be a candidate "
7330 "for a format attribute");
7333 warning (OPT_Wmissing_format_attribute
,
7334 "return type might be a candidate "
7335 "for a format attribute");
7338 warning (OPT_Wmissing_format_attribute
,
7339 "left-hand side of assignment might be a candidate "
7340 "for a format attribute");
7347 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7349 if (warn_parentheses
7350 && TREE_CODE (type
) == BOOLEAN_TYPE
7351 && TREE_CODE (rhs
) == MODIFY_EXPR
7352 && !TREE_NO_WARNING (rhs
)
7353 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7354 && (complain
& tf_warning
))
7356 location_t loc
= EXPR_LOC_OR_HERE (rhs
);
7358 warning_at (loc
, OPT_Wparentheses
,
7359 "suggest parentheses around assignment used as truth value");
7360 TREE_NO_WARNING (rhs
) = 1;
7363 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7367 /* Convert RHS to be of type TYPE.
7368 If EXP is nonzero, it is the target of the initialization.
7369 ERRTYPE indicates what kind of error the implicit conversion is.
7371 Two major differences between the behavior of
7372 `convert_for_assignment' and `convert_for_initialization'
7373 are that references are bashed in the former, while
7374 copied in the latter, and aggregates are assigned in
7375 the former (operator=) while initialized in the
7378 If using constructor make sure no conversion operator exists, if one does
7379 exist, an ambiguity exists.
7381 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7384 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7385 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
7386 tsubst_flags_t complain
)
7388 enum tree_code codel
= TREE_CODE (type
);
7390 enum tree_code coder
;
7392 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7393 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7394 if (TREE_CODE (rhs
) == NOP_EXPR
7395 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7396 && codel
!= REFERENCE_TYPE
)
7397 rhs
= TREE_OPERAND (rhs
, 0);
7399 if (type
== error_mark_node
7400 || rhs
== error_mark_node
7401 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7402 return error_mark_node
;
7404 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7405 && TREE_CODE (type
) != ARRAY_TYPE
7406 && (TREE_CODE (type
) != REFERENCE_TYPE
7407 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7408 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7409 && (TREE_CODE (type
) != REFERENCE_TYPE
7410 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7411 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7412 rhs
= decay_conversion (rhs
);
7414 rhstype
= TREE_TYPE (rhs
);
7415 coder
= TREE_CODE (rhstype
);
7417 if (coder
== ERROR_MARK
)
7418 return error_mark_node
;
7420 /* We accept references to incomplete types, so we can
7421 return here before checking if RHS is of complete type. */
7423 if (codel
== REFERENCE_TYPE
)
7425 /* This should eventually happen in convert_arguments. */
7426 int savew
= 0, savee
= 0;
7429 savew
= warningcount
, savee
= errorcount
;
7430 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7431 /*cleanup=*/NULL
, complain
);
7434 if (warningcount
> savew
)
7435 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7436 else if (errorcount
> savee
)
7437 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7443 exp
= require_complete_type_sfinae (exp
, complain
);
7444 if (exp
== error_mark_node
)
7445 return error_mark_node
;
7447 rhstype
= non_reference (rhstype
);
7449 type
= complete_type (type
);
7451 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7452 /* Don't try to do copy-initialization if we already have
7453 direct-initialization. */
7456 if (MAYBE_CLASS_TYPE_P (type
))
7457 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
7459 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7463 /* If RETVAL is the address of, or a reference to, a local variable or
7464 temporary give an appropriate warning. */
7467 maybe_warn_about_returning_address_of_local (tree retval
)
7469 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7470 tree whats_returned
= retval
;
7474 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7475 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7476 else if (CONVERT_EXPR_P (whats_returned
)
7477 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7478 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7483 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7485 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7487 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7489 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7490 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7492 warning (0, "returning reference to temporary");
7495 if (TREE_CODE (whats_returned
) == VAR_DECL
7496 && DECL_NAME (whats_returned
)
7497 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7499 warning (0, "reference to non-lvalue returned");
7504 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7505 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7506 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7508 if (DECL_P (whats_returned
)
7509 && DECL_NAME (whats_returned
)
7510 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7511 && !(TREE_STATIC (whats_returned
)
7512 || TREE_PUBLIC (whats_returned
)))
7514 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7515 warning (0, "reference to local variable %q+D returned",
7518 warning (0, "address of local variable %q+D returned",
7524 /* Check that returning RETVAL from the current function is valid.
7525 Return an expression explicitly showing all conversions required to
7526 change RETVAL into the function return type, and to assign it to
7527 the DECL_RESULT for the function. Set *NO_WARNING to true if
7528 code reaches end of non-void function warning shouldn't be issued
7529 on this RETURN_EXPR. */
7532 check_return_expr (tree retval
, bool *no_warning
)
7535 /* The type actually returned by the function, after any
7538 int fn_returns_value_p
;
7539 bool named_return_value_okay_p
;
7541 *no_warning
= false;
7543 /* A `volatile' function is one that isn't supposed to return, ever.
7544 (This is a G++ extension, used to get better code for functions
7545 that call the `volatile' function.) */
7546 if (TREE_THIS_VOLATILE (current_function_decl
))
7547 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7549 /* Check for various simple errors. */
7550 if (DECL_DESTRUCTOR_P (current_function_decl
))
7553 error ("returning a value from a destructor");
7556 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7558 if (in_function_try_handler
)
7559 /* If a return statement appears in a handler of the
7560 function-try-block of a constructor, the program is ill-formed. */
7561 error ("cannot return from a handler of a function-try-block of a constructor");
7563 /* You can't return a value from a constructor. */
7564 error ("returning a value from a constructor");
7568 /* As an extension, deduce lambda return type from a return statement
7569 anywhere in the body. */
7570 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7572 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7573 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7575 tree type
= lambda_return_type (retval
);
7576 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7578 if (VOID_TYPE_P (type
))
7580 else if (oldtype
== NULL_TREE
)
7582 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7583 "can only be deduced when the return statement is "
7584 "the only statement in the function body");
7585 apply_lambda_return_type (lambda
, type
);
7587 else if (!same_type_p (type
, oldtype
))
7588 error ("inconsistent types %qT and %qT deduced for "
7589 "lambda return type", type
, oldtype
);
7593 if (processing_template_decl
)
7595 current_function_returns_value
= 1;
7596 if (check_for_bare_parameter_packs (retval
))
7597 retval
= error_mark_node
;
7601 /* When no explicit return-value is given in a function with a named
7602 return value, the named return value is used. */
7603 result
= DECL_RESULT (current_function_decl
);
7604 valtype
= TREE_TYPE (result
);
7605 gcc_assert (valtype
!= NULL_TREE
);
7606 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7607 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7610 /* Check for a return statement with no return value in a function
7611 that's supposed to return a value. */
7612 if (!retval
&& fn_returns_value_p
)
7614 permerror (input_location
, "return-statement with no value, in function returning %qT",
7616 /* Clear this, so finish_function won't say that we reach the
7617 end of a non-void function (which we don't, we gave a
7619 current_function_returns_null
= 0;
7620 /* And signal caller that TREE_NO_WARNING should be set on the
7621 RETURN_EXPR to avoid control reaches end of non-void function
7622 warnings in tree-cfg.c. */
7625 /* Check for a return statement with a value in a function that
7626 isn't supposed to return a value. */
7627 else if (retval
&& !fn_returns_value_p
)
7629 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7630 /* You can return a `void' value from a function of `void'
7631 type. In that case, we have to evaluate the expression for
7632 its side-effects. */
7633 finish_expr_stmt (retval
);
7635 permerror (input_location
, "return-statement with a value, in function "
7636 "returning 'void'");
7637 current_function_returns_null
= 1;
7639 /* There's really no value to return, after all. */
7643 /* Remember that this function can sometimes return without a
7645 current_function_returns_null
= 1;
7647 /* Remember that this function did return a value. */
7648 current_function_returns_value
= 1;
7650 /* Check for erroneous operands -- but after giving ourselves a
7651 chance to provide an error about returning a value from a void
7653 if (error_operand_p (retval
))
7655 current_function_return_value
= error_mark_node
;
7656 return error_mark_node
;
7659 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7660 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7661 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7662 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7664 && retval
&& null_ptr_cst_p (retval
))
7665 warning (0, "%<operator new%> must not return NULL unless it is "
7666 "declared %<throw()%> (or -fcheck-new is in effect)");
7668 /* Effective C++ rule 15. See also start_function. */
7670 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7674 /* The function return type must be a reference to the current
7676 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7677 && same_type_ignoring_top_level_qualifiers_p
7678 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7680 /* Returning '*this' is obviously OK. */
7681 if (retval
== current_class_ref
)
7683 /* If we are calling a function whose return type is the same of
7684 the current class reference, it is ok. */
7685 else if (TREE_CODE (retval
) == INDIRECT_REF
7686 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7691 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7694 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7696 [...] For a function with a class return type, if the expression
7697 in the return statement is the name of a local object, and the cv-
7698 unqualified type of the local object is the same as the function
7699 return type, an implementation is permitted to omit creating the tem-
7700 porary object to hold the function return value [...]
7702 So, if this is a value-returning function that always returns the same
7703 local variable, remember it.
7705 It might be nice to be more flexible, and choose the first suitable
7706 variable even if the function sometimes returns something else, but
7707 then we run the risk of clobbering the variable we chose if the other
7708 returned expression uses the chosen variable somehow. And people expect
7709 this restriction, anyway. (jason 2000-11-19)
7711 See finish_function and finalize_nrv for the rest of this optimization. */
7713 named_return_value_okay_p
=
7714 (retval
!= NULL_TREE
7715 /* Must be a local, automatic variable. */
7716 && TREE_CODE (retval
) == VAR_DECL
7717 && DECL_CONTEXT (retval
) == current_function_decl
7718 && ! TREE_STATIC (retval
)
7719 && ! DECL_ANON_UNION_VAR_P (retval
)
7720 && (DECL_ALIGN (retval
)
7721 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7722 /* The cv-unqualified type of the returned value must be the
7723 same as the cv-unqualified return type of the
7725 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7727 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7728 /* And the returned value must be non-volatile. */
7729 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7731 if (fn_returns_value_p
&& flag_elide_constructors
)
7733 if (named_return_value_okay_p
7734 && (current_function_return_value
== NULL_TREE
7735 || current_function_return_value
== retval
))
7736 current_function_return_value
= retval
;
7738 current_function_return_value
= error_mark_node
;
7741 /* We don't need to do any conversions when there's nothing being
7746 /* Do any required conversions. */
7747 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7748 /* No conversions are required. */
7752 /* The type the function is declared to return. */
7753 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7754 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7756 /* The functype's return type will have been set to void, if it
7757 was an incomplete type. Just treat this as 'return;' */
7758 if (VOID_TYPE_P (functype
))
7759 return error_mark_node
;
7761 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7762 treated as an rvalue for the purposes of overload resolution to
7763 favor move constructors over copy constructors.
7765 Note that these conditions are similar to, but not as strict as,
7766 the conditions for the named return value optimization. */
7767 if ((cxx_dialect
!= cxx98
)
7768 && (TREE_CODE (retval
) == VAR_DECL
7769 || TREE_CODE (retval
) == PARM_DECL
)
7770 && DECL_CONTEXT (retval
) == current_function_decl
7771 && !TREE_STATIC (retval
)
7772 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7774 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7775 /* This is only interesting for class type. */
7776 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7777 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7779 /* First convert the value to the function's return type, then
7780 to the type of return value's location to handle the
7781 case that functype is smaller than the valtype. */
7782 retval
= convert_for_initialization
7783 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
7784 tf_warning_or_error
);
7785 retval
= convert (valtype
, retval
);
7787 /* If the conversion failed, treat this just like `return;'. */
7788 if (retval
== error_mark_node
)
7790 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7791 else if (! cfun
->returns_struct
7792 && TREE_CODE (retval
) == TARGET_EXPR
7793 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7794 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7795 TREE_OPERAND (retval
, 0));
7797 maybe_warn_about_returning_address_of_local (retval
);
7800 /* Actually copy the value returned into the appropriate location. */
7801 if (retval
&& retval
!= result
)
7802 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7808 /* Returns nonzero if the pointer-type FROM can be converted to the
7809 pointer-type TO via a qualification conversion. If CONSTP is -1,
7810 then we return nonzero if the pointers are similar, and the
7811 cv-qualification signature of FROM is a proper subset of that of TO.
7813 If CONSTP is positive, then all outer pointers have been
7817 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7819 bool to_more_cv_qualified
= false;
7820 bool is_opaque_pointer
= false;
7822 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7824 if (TREE_CODE (to
) != TREE_CODE (from
))
7827 if (TREE_CODE (from
) == OFFSET_TYPE
7828 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7829 TYPE_OFFSET_BASETYPE (to
)))
7832 /* Const and volatile mean something different for function types,
7833 so the usual checks are not appropriate. */
7834 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7836 if (!at_least_as_qualified_p (to
, from
))
7839 if (!at_least_as_qualified_p (from
, to
))
7843 to_more_cv_qualified
= true;
7847 constp
&= TYPE_READONLY (to
);
7850 if (TREE_CODE (to
) == VECTOR_TYPE
)
7851 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7853 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7854 return ((constp
>= 0 || to_more_cv_qualified
)
7855 && (is_opaque_pointer
7856 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7860 /* When comparing, say, char ** to char const **, this function takes
7861 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7862 types to this function. */
7865 comp_ptr_ttypes (tree to
, tree from
)
7867 return comp_ptr_ttypes_real (to
, from
, 1);
7870 /* Returns true iff FNTYPE is a non-class type that involves
7871 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7872 if a parameter type is ill-formed. */
7875 error_type_p (const_tree type
)
7879 switch (TREE_CODE (type
))
7885 case REFERENCE_TYPE
:
7887 return error_type_p (TREE_TYPE (type
));
7891 if (error_type_p (TREE_TYPE (type
)))
7893 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7894 if (error_type_p (TREE_VALUE (t
)))
7899 if (TYPE_PTRMEMFUNC_P (type
))
7900 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7908 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7909 type or inheritance-related types, regardless of cv-quals. */
7912 ptr_reasonably_similar (const_tree to
, const_tree from
)
7914 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7916 /* Any target type is similar enough to void. */
7917 if (TREE_CODE (to
) == VOID_TYPE
)
7918 return !error_type_p (from
);
7919 if (TREE_CODE (from
) == VOID_TYPE
)
7920 return !error_type_p (to
);
7922 if (TREE_CODE (to
) != TREE_CODE (from
))
7925 if (TREE_CODE (from
) == OFFSET_TYPE
7926 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7927 TYPE_OFFSET_BASETYPE (from
),
7928 COMPARE_BASE
| COMPARE_DERIVED
))
7931 if (TREE_CODE (to
) == VECTOR_TYPE
7932 && vector_types_convertible_p (to
, from
, false))
7935 if (TREE_CODE (to
) == INTEGER_TYPE
7936 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7939 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7940 return !error_type_p (to
) && !error_type_p (from
);
7942 if (TREE_CODE (to
) != POINTER_TYPE
)
7944 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7945 COMPARE_BASE
| COMPARE_DERIVED
);
7949 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7950 pointer-to-member types) are the same, ignoring cv-qualification at
7954 comp_ptr_ttypes_const (tree to
, tree from
)
7956 bool is_opaque_pointer
= false;
7958 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7960 if (TREE_CODE (to
) != TREE_CODE (from
))
7963 if (TREE_CODE (from
) == OFFSET_TYPE
7964 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7965 TYPE_OFFSET_BASETYPE (to
)))
7968 if (TREE_CODE (to
) == VECTOR_TYPE
)
7969 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7971 if (TREE_CODE (to
) != POINTER_TYPE
)
7972 return (is_opaque_pointer
7973 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7977 /* Returns the type qualifiers for this type, including the qualifiers on the
7978 elements for an array type. */
7981 cp_type_quals (const_tree type
)
7984 /* This CONST_CAST is okay because strip_array_types returns its
7985 argument unmodified and we assign it to a const_tree. */
7986 type
= strip_array_types (CONST_CAST_TREE (type
));
7987 if (type
== error_mark_node
7988 /* Quals on a FUNCTION_TYPE are memfn quals. */
7989 || TREE_CODE (type
) == FUNCTION_TYPE
)
7990 return TYPE_UNQUALIFIED
;
7991 quals
= TYPE_QUALS (type
);
7992 /* METHOD and REFERENCE_TYPEs should never have quals. */
7993 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7994 && TREE_CODE (type
) != REFERENCE_TYPE
)
7995 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7996 == TYPE_UNQUALIFIED
));
8000 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8004 type_memfn_quals (const_tree type
)
8006 if (TREE_CODE (type
) == FUNCTION_TYPE
)
8007 return TYPE_QUALS (type
);
8008 else if (TREE_CODE (type
) == METHOD_TYPE
)
8009 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
8014 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8018 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
8020 /* Could handle METHOD_TYPE here if necessary. */
8021 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8022 if (TYPE_QUALS (type
) == memfn_quals
)
8024 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8026 return build_qualified_type (type
, memfn_quals
);
8029 /* Returns nonzero if TYPE is const or volatile. */
8032 cv_qualified_p (const_tree type
)
8034 int quals
= cp_type_quals (type
);
8035 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
8038 /* Returns nonzero if the TYPE contains a mutable member. */
8041 cp_has_mutable_p (const_tree type
)
8043 /* This CONST_CAST is okay because strip_array_types returns its
8044 argument unmodified and we assign it to a const_tree. */
8045 type
= strip_array_types (CONST_CAST_TREE(type
));
8047 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
8050 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8051 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8052 approximation. In particular, consider:
8055 struct S { int i; };
8056 const S s = { f(); }
8058 Here, we will make "s" as TREE_READONLY (because it is declared
8059 "const") -- only to reverse ourselves upon seeing that the
8060 initializer is non-constant. */
8063 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
8065 tree type
= TREE_TYPE (decl
);
8067 if (type
== error_mark_node
)
8070 if (TREE_CODE (decl
) == TYPE_DECL
)
8073 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
8074 && type_quals
!= TYPE_UNQUALIFIED
));
8076 /* Avoid setting TREE_READONLY incorrectly. */
8077 if (/* If the object has a constructor, the constructor may modify
8079 TYPE_NEEDS_CONSTRUCTING (type
)
8080 /* If the type isn't complete, we don't know yet if it will need
8082 || !COMPLETE_TYPE_P (type
)
8083 /* If the type has a mutable component, that component might be
8085 || TYPE_HAS_MUTABLE_P (type
))
8086 type_quals
&= ~TYPE_QUAL_CONST
;
8088 c_apply_type_quals_to_decl (type_quals
, decl
);
8091 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8092 exemplar types such that casting T1 to T2 is casting away constness
8093 if and only if there is no implicit conversion from T1 to T2. */
8096 casts_away_constness_r (tree
*t1
, tree
*t2
)
8101 /* [expr.const.cast]
8103 For multi-level pointer to members and multi-level mixed pointers
8104 and pointers to members (conv.qual), the "member" aspect of a
8105 pointer to member level is ignored when determining if a const
8106 cv-qualifier has been cast away. */
8107 /* [expr.const.cast]
8109 For two pointer types:
8111 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8112 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8115 casting from X1 to X2 casts away constness if, for a non-pointer
8116 type T there does not exist an implicit conversion (clause
8119 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8123 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8124 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8125 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8127 *t1
= cp_build_qualified_type (void_type_node
,
8128 cp_type_quals (*t1
));
8129 *t2
= cp_build_qualified_type (void_type_node
,
8130 cp_type_quals (*t2
));
8134 quals1
= cp_type_quals (*t1
);
8135 quals2
= cp_type_quals (*t2
);
8137 if (TYPE_PTRMEM_P (*t1
))
8138 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8140 *t1
= TREE_TYPE (*t1
);
8141 if (TYPE_PTRMEM_P (*t2
))
8142 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8144 *t2
= TREE_TYPE (*t2
);
8146 casts_away_constness_r (t1
, t2
);
8147 *t1
= build_pointer_type (*t1
);
8148 *t2
= build_pointer_type (*t2
);
8149 *t1
= cp_build_qualified_type (*t1
, quals1
);
8150 *t2
= cp_build_qualified_type (*t2
, quals2
);
8153 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8156 ??? This function returns non-zero if casting away qualifiers not
8157 just const. We would like to return to the caller exactly which
8158 qualifiers are casted away to give more accurate diagnostics.
8162 casts_away_constness (tree t1
, tree t2
)
8164 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8166 /* [expr.const.cast]
8168 Casting from an lvalue of type T1 to an lvalue of type T2
8169 using a reference cast casts away constness if a cast from an
8170 rvalue of type "pointer to T1" to the type "pointer to T2"
8171 casts away constness. */
8172 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8173 return casts_away_constness (build_pointer_type (t1
),
8174 build_pointer_type (TREE_TYPE (t2
)));
8177 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8178 /* [expr.const.cast]
8180 Casting from an rvalue of type "pointer to data member of X
8181 of type T1" to the type "pointer to data member of Y of type
8182 T2" casts away constness if a cast from an rvalue of type
8183 "pointer to T1" to the type "pointer to T2" casts away
8185 return casts_away_constness
8186 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8187 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8189 /* Casting away constness is only something that makes sense for
8190 pointer or reference types. */
8191 if (TREE_CODE (t1
) != POINTER_TYPE
8192 || TREE_CODE (t2
) != POINTER_TYPE
)
8195 /* Top-level qualifiers don't matter. */
8196 t1
= TYPE_MAIN_VARIANT (t1
);
8197 t2
= TYPE_MAIN_VARIANT (t2
);
8198 casts_away_constness_r (&t1
, &t2
);
8199 if (!can_convert (t2
, t1
))
8205 /* If T is a REFERENCE_TYPE return the type to which T refers.
8206 Otherwise, return T itself. */
8209 non_reference (tree t
)
8211 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8217 /* Return nonzero if REF is an lvalue valid for this language;
8218 otherwise, print an error message and return zero. USE says
8219 how the lvalue is being used and so selects the error message. */
8222 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8224 cp_lvalue_kind kind
= lvalue_kind (ref
);
8226 if (kind
== clk_none
)
8228 if (complain
& tf_error
)
8229 lvalue_error (input_location
, use
);
8232 else if (kind
& (clk_rvalueref
|clk_class
))
8234 if (!(complain
& tf_error
))
8236 if (kind
& clk_class
)
8237 /* Make this a permerror because we used to accept it. */
8238 permerror (input_location
, "using temporary as lvalue");
8240 error ("using xvalue (rvalue reference) as lvalue");