1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This file is part of the C++ front end.
23 It contains routines to build C++ expressions given their operands,
24 including computing the types of the result, C and C++ specific error
25 checks, and some optimization. */
29 #include "coretypes.h"
32 #include "stor-layout.h"
36 #include "c-family/c-objc.h"
37 #include "c-family/c-ubsan.h"
39 #include "gcc-rich-location.h"
40 #include "stringpool.h"
44 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
45 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
46 static tree
pfn_from_ptrmemfunc (tree
);
47 static tree
delta_from_ptrmemfunc (tree
);
48 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
50 static tree
cp_pointer_int_sum (location_t
, enum tree_code
, tree
, tree
,
52 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
54 static int comp_ptr_ttypes_real (tree
, tree
, int);
55 static bool comp_except_types (tree
, tree
, bool);
56 static bool comp_array_types (const_tree
, const_tree
, bool);
57 static tree
pointer_diff (location_t
, tree
, tree
, tree
, tsubst_flags_t
, tree
*);
58 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
59 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
60 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
61 static bool maybe_warn_about_returning_address_of_local (tree
);
62 static tree
lookup_destructor (tree
, tree
, tree
, tsubst_flags_t
);
63 static void error_args_num (location_t
, tree
, bool);
64 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
67 /* Do `exp = require_complete_type (exp);' to make sure exp
68 does not have an incomplete type. (That includes void types.)
69 Returns error_mark_node if the VALUE does not have
70 complete type when this function returns. */
73 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
77 if (processing_template_decl
|| value
== error_mark_node
)
80 if (TREE_CODE (value
) == OVERLOAD
)
81 type
= unknown_type_node
;
83 type
= TREE_TYPE (value
);
85 if (type
== error_mark_node
)
86 return error_mark_node
;
88 /* First, detect a valid value with a complete type. */
89 if (COMPLETE_TYPE_P (type
))
92 if (complete_type_or_maybe_complain (type
, value
, complain
))
95 return error_mark_node
;
99 require_complete_type (tree value
)
101 return require_complete_type_sfinae (value
, tf_warning_or_error
);
104 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
105 a template instantiation, do the instantiation. Returns TYPE,
106 whether or not it could be completed, unless something goes
107 horribly wrong, in which case the error_mark_node is returned. */
110 complete_type (tree type
)
112 if (type
== NULL_TREE
)
113 /* Rather than crash, we return something sure to cause an error
115 return error_mark_node
;
117 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
119 else if (TREE_CODE (type
) == ARRAY_TYPE
)
121 tree t
= complete_type (TREE_TYPE (type
));
122 unsigned int needs_constructing
, has_nontrivial_dtor
;
123 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
126 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
128 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
129 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
131 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
132 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
135 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
136 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
141 /* Like complete_type, but issue an error if the TYPE cannot be completed.
142 VALUE is used for informative diagnostics.
143 Returns NULL_TREE if the type cannot be made complete. */
146 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
148 type
= complete_type (type
);
149 if (type
== error_mark_node
)
150 /* We already issued an error. */
152 else if (!COMPLETE_TYPE_P (type
))
154 if (complain
& tf_error
)
155 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
163 complete_type_or_else (tree type
, tree value
)
165 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
169 /* Return the common type of two parameter lists.
170 We assume that comptypes has already been done and returned 1;
171 if that isn't so, this may crash.
173 As an optimization, free the space we allocate if the parameter
174 lists are already common. */
177 commonparms (tree p1
, tree p2
)
179 tree oldargs
= p1
, newargs
, n
;
183 len
= list_length (p1
);
184 newargs
= tree_last (p1
);
186 if (newargs
== void_list_node
)
195 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
200 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
202 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
204 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
207 else if (! TREE_PURPOSE (p1
))
209 if (TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
217 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
219 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
221 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
224 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
227 TREE_VALUE (n
) = TREE_VALUE (p1
);
235 /* Given a type, perhaps copied for a typedef,
236 find the "original" version of it. */
238 original_type (tree t
)
240 int quals
= cp_type_quals (t
);
241 while (t
!= error_mark_node
242 && TYPE_NAME (t
) != NULL_TREE
)
244 tree x
= TYPE_NAME (t
);
245 if (TREE_CODE (x
) != TYPE_DECL
)
247 x
= DECL_ORIGINAL_TYPE (x
);
252 return cp_build_qualified_type (t
, quals
);
255 /* Return the common type for two arithmetic types T1 and T2 under the
256 usual arithmetic conversions. The default conversions have already
257 been applied, and enumerated types converted to their compatible
261 cp_common_type (tree t1
, tree t2
)
263 enum tree_code code1
= TREE_CODE (t1
);
264 enum tree_code code2
= TREE_CODE (t2
);
269 /* In what follows, we slightly generalize the rules given in [expr] so
270 as to deal with `long long' and `complex'. First, merge the
272 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
274 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
276 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
277 return build_type_attribute_variant (t1
, attributes
);
282 /* FIXME: Attributes. */
283 gcc_assert (ARITHMETIC_TYPE_P (t1
)
284 || VECTOR_TYPE_P (t1
)
285 || UNSCOPED_ENUM_P (t1
));
286 gcc_assert (ARITHMETIC_TYPE_P (t2
)
287 || VECTOR_TYPE_P (t2
)
288 || UNSCOPED_ENUM_P (t2
));
290 /* If one type is complex, form the common type of the non-complex
291 components, then make that complex. Use T1 or T2 if it is the
293 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
295 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
296 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
298 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
300 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
301 return build_type_attribute_variant (t1
, attributes
);
302 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
303 return build_type_attribute_variant (t2
, attributes
);
305 return build_type_attribute_variant (build_complex_type (subtype
),
309 if (code1
== VECTOR_TYPE
)
311 /* When we get here we should have two vectors of the same size.
312 Just prefer the unsigned one if present. */
313 if (TYPE_UNSIGNED (t1
))
314 return build_type_attribute_variant (t1
, attributes
);
316 return build_type_attribute_variant (t2
, attributes
);
319 /* If only one is real, use it as the result. */
320 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
321 return build_type_attribute_variant (t1
, attributes
);
322 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
323 return build_type_attribute_variant (t2
, attributes
);
325 /* Both real or both integers; use the one with greater precision. */
326 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
327 return build_type_attribute_variant (t1
, attributes
);
328 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
329 return build_type_attribute_variant (t2
, attributes
);
331 /* The types are the same; no need to do anything fancy. */
332 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
335 if (code1
!= REAL_TYPE
)
337 /* If one is unsigned long long, then convert the other to unsigned
339 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
340 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
341 return build_type_attribute_variant (long_long_unsigned_type_node
,
343 /* If one is a long long, and the other is an unsigned long, and
344 long long can represent all the values of an unsigned long, then
345 convert to a long long. Otherwise, convert to an unsigned long
346 long. Otherwise, if either operand is long long, convert the
349 Since we're here, we know the TYPE_PRECISION is the same;
350 therefore converting to long long cannot represent all the values
351 of an unsigned long, so we choose unsigned long long in that
353 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
354 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
356 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
357 ? long_long_unsigned_type_node
358 : long_long_integer_type_node
);
359 return build_type_attribute_variant (t
, attributes
);
362 /* Go through the same procedure, but for longs. */
363 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
364 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
365 return build_type_attribute_variant (long_unsigned_type_node
,
367 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
368 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
370 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
371 ? long_unsigned_type_node
: long_integer_type_node
);
372 return build_type_attribute_variant (t
, attributes
);
375 /* For __intN types, either the type is __int128 (and is lower
376 priority than the types checked above, but higher than other
377 128-bit types) or it's known to not be the same size as other
378 types (enforced in toplev.c). Prefer the unsigned type. */
379 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
381 if (int_n_enabled_p
[i
]
382 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
383 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
384 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
387 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
388 ? int_n_trees
[i
].unsigned_type
389 : int_n_trees
[i
].signed_type
);
390 return build_type_attribute_variant (t
, attributes
);
394 /* Otherwise prefer the unsigned one. */
395 if (TYPE_UNSIGNED (t1
))
396 return build_type_attribute_variant (t1
, attributes
);
398 return build_type_attribute_variant (t2
, attributes
);
402 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
403 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
404 return build_type_attribute_variant (long_double_type_node
,
406 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
407 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
408 return build_type_attribute_variant (double_type_node
,
410 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
411 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
412 return build_type_attribute_variant (float_type_node
,
415 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
416 the standard C++ floating-point types. Logic earlier in this
417 function has already eliminated the possibility that
418 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
419 compelling reason to choose one or the other. */
420 return build_type_attribute_variant (t1
, attributes
);
424 /* T1 and T2 are arithmetic or enumeration types. Return the type
425 that will result from the "usual arithmetic conversions" on T1 and
426 T2 as described in [expr]. */
429 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
431 gcc_assert (ARITHMETIC_TYPE_P (t1
)
432 || VECTOR_TYPE_P (t1
)
433 || UNSCOPED_ENUM_P (t1
));
434 gcc_assert (ARITHMETIC_TYPE_P (t2
)
435 || VECTOR_TYPE_P (t2
)
436 || UNSCOPED_ENUM_P (t2
));
438 /* Perform the integral promotions. We do not promote real types here. */
439 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
440 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
442 t1
= type_promotes_to (t1
);
443 t2
= type_promotes_to (t2
);
446 return cp_common_type (t1
, t2
);
450 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
451 composite_pointer_operation operation
)
456 emit_diagnostic (kind
, input_location
, 0,
457 "comparison between "
458 "distinct pointer types %qT and %qT lacks a cast",
462 emit_diagnostic (kind
, input_location
, 0,
463 "conversion between "
464 "distinct pointer types %qT and %qT lacks a cast",
467 case CPO_CONDITIONAL_EXPR
:
468 emit_diagnostic (kind
, input_location
, 0,
469 "conditional expression between "
470 "distinct pointer types %qT and %qT lacks a cast",
478 /* Subroutine of composite_pointer_type to implement the recursive
479 case. See that function for documentation of the parameters. */
482 composite_pointer_type_r (tree t1
, tree t2
,
483 composite_pointer_operation operation
,
484 tsubst_flags_t complain
)
491 /* Determine the types pointed to by T1 and T2. */
494 pointee1
= TREE_TYPE (t1
);
495 pointee2
= TREE_TYPE (t2
);
499 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
500 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
505 Otherwise, the composite pointer type is a pointer type
506 similar (_conv.qual_) to the type of one of the operands,
507 with a cv-qualification signature (_conv.qual_) that is the
508 union of the cv-qualification signatures of the operand
510 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
511 result_type
= pointee1
;
512 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
513 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
515 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
517 if (result_type
== error_mark_node
)
518 return error_mark_node
;
522 if (complain
& tf_error
)
523 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
525 return error_mark_node
;
526 result_type
= void_type_node
;
528 result_type
= cp_build_qualified_type (result_type
,
529 (cp_type_quals (pointee1
)
530 | cp_type_quals (pointee2
)));
531 /* If the original types were pointers to members, so is the
533 if (TYPE_PTRMEM_P (t1
))
535 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
536 TYPE_PTRMEM_CLASS_TYPE (t2
)))
538 if (complain
& tf_error
)
539 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
541 return error_mark_node
;
543 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
547 result_type
= build_pointer_type (result_type
);
549 /* Merge the attributes. */
550 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
551 return build_type_attribute_variant (result_type
, attributes
);
554 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
555 ARG1 and ARG2 are the values with those types. The OPERATION is to
556 describe the operation between the pointer types,
557 in case an error occurs.
559 This routine also implements the computation of a common type for
560 pointers-to-members as per [expr.eq]. */
563 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
564 composite_pointer_operation operation
,
565 tsubst_flags_t complain
)
572 If one operand is a null pointer constant, the composite pointer
573 type is the type of the other operand. */
574 if (null_ptr_cst_p (arg1
))
576 if (null_ptr_cst_p (arg2
))
583 If one of the operands has type "pointer to cv1 void*", then
584 the other has type "pointer to cv2T", and the composite pointer
585 type is "pointer to cv12 void", where cv12 is the union of cv1
588 If either type is a pointer to void, make sure it is T1. */
589 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
592 /* Now, if T1 is a pointer to void, merge the qualifiers. */
593 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
598 if (TYPE_PTRFN_P (t2
))
600 if (complain
& tf_error
)
605 pedwarn (input_location
, OPT_Wpedantic
,
606 "ISO C++ forbids comparison between pointer "
607 "of type %<void *%> and pointer-to-function");
610 pedwarn (input_location
, OPT_Wpedantic
,
611 "ISO C++ forbids conversion between pointer "
612 "of type %<void *%> and pointer-to-function");
614 case CPO_CONDITIONAL_EXPR
:
615 pedwarn (input_location
, OPT_Wpedantic
,
616 "ISO C++ forbids conditional expression between "
617 "pointer of type %<void *%> and "
618 "pointer-to-function");
625 return error_mark_node
;
628 = cp_build_qualified_type (void_type_node
,
629 (cp_type_quals (TREE_TYPE (t1
))
630 | cp_type_quals (TREE_TYPE (t2
))));
631 result_type
= build_pointer_type (result_type
);
632 /* Merge the attributes. */
633 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
634 return build_type_attribute_variant (result_type
, attributes
);
637 if (c_dialect_objc () && TYPE_PTR_P (t1
)
640 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
641 return objc_common_type (t1
, t2
);
644 /* if T1 or T2 is "pointer to noexcept function" and the other type is
645 "pointer to function", where the function types are otherwise the same,
646 "pointer to function" */
647 if (fnptr_conv_p (t1
, t2
))
649 if (fnptr_conv_p (t2
, t1
))
652 /* [expr.eq] permits the application of a pointer conversion to
653 bring the pointers to a common type. */
654 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
655 && CLASS_TYPE_P (TREE_TYPE (t1
))
656 && CLASS_TYPE_P (TREE_TYPE (t2
))
657 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
660 class1
= TREE_TYPE (t1
);
661 class2
= TREE_TYPE (t2
);
663 if (DERIVED_FROM_P (class1
, class2
))
664 t2
= (build_pointer_type
665 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
666 else if (DERIVED_FROM_P (class2
, class1
))
667 t1
= (build_pointer_type
668 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
671 if (complain
& tf_error
)
672 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
673 return error_mark_node
;
676 /* [expr.eq] permits the application of a pointer-to-member
677 conversion to change the class type of one of the types. */
678 else if (TYPE_PTRMEM_P (t1
)
679 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
680 TYPE_PTRMEM_CLASS_TYPE (t2
)))
682 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
683 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
685 if (DERIVED_FROM_P (class1
, class2
))
686 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
687 else if (DERIVED_FROM_P (class2
, class1
))
688 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
691 if (complain
& tf_error
)
695 error ("comparison between distinct "
696 "pointer-to-member types %qT and %qT lacks a cast",
700 error ("conversion between distinct "
701 "pointer-to-member types %qT and %qT lacks a cast",
704 case CPO_CONDITIONAL_EXPR
:
705 error ("conditional expression between distinct "
706 "pointer-to-member types %qT and %qT lacks a cast",
712 return error_mark_node
;
716 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
719 /* Return the merged type of two types.
720 We assume that comptypes has already been done and returned 1;
721 if that isn't so, this may crash.
723 This just combines attributes and default arguments; any other
724 differences would cause the two types to compare unalike. */
727 merge_types (tree t1
, tree t2
)
729 enum tree_code code1
;
730 enum tree_code code2
;
733 /* Save time if the two types are the same. */
736 if (original_type (t1
) == original_type (t2
))
739 /* If one type is nonsense, use the other. */
740 if (t1
== error_mark_node
)
742 if (t2
== error_mark_node
)
745 /* Handle merging an auto redeclaration with a previous deduced
750 /* Merge the attributes. */
751 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
753 if (TYPE_PTRMEMFUNC_P (t1
))
754 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
755 if (TYPE_PTRMEMFUNC_P (t2
))
756 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
758 code1
= TREE_CODE (t1
);
759 code2
= TREE_CODE (t2
);
762 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
763 if (code1
== TYPENAME_TYPE
)
765 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
766 code1
= TREE_CODE (t1
);
770 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
771 code2
= TREE_CODE (t2
);
779 /* For two pointers, do this recursively on the target type. */
781 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
782 int quals
= cp_type_quals (t1
);
784 if (code1
== POINTER_TYPE
)
786 t1
= build_pointer_type (target
);
787 if (TREE_CODE (target
) == METHOD_TYPE
)
788 t1
= build_ptrmemfunc_type (t1
);
791 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
792 t1
= build_type_attribute_variant (t1
, attributes
);
793 t1
= cp_build_qualified_type (t1
, quals
);
802 quals
= cp_type_quals (t1
);
803 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
804 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
805 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
807 t1
= cp_build_qualified_type (t1
, quals
);
813 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
814 /* Save space: see if the result is identical to one of the args. */
815 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
816 return build_type_attribute_variant (t1
, attributes
);
817 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
818 return build_type_attribute_variant (t2
, attributes
);
819 /* Merge the element types, and have a size if either arg has one. */
820 t1
= build_cplus_array_type
821 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
826 /* Function types: prefer the one that specified arg types.
827 If both do, merge the arg types. Also merge the return types. */
829 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
830 tree p1
= TYPE_ARG_TYPES (t1
);
831 tree p2
= TYPE_ARG_TYPES (t2
);
834 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
836 /* Save space: see if the result is identical to one of the args. */
837 if (valtype
== TREE_TYPE (t1
) && ! p2
)
838 return cp_build_type_attribute_variant (t1
, attributes
);
839 if (valtype
== TREE_TYPE (t2
) && ! p1
)
840 return cp_build_type_attribute_variant (t2
, attributes
);
842 /* Simple way if one arg fails to specify argument types. */
843 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
845 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
848 parms
= commonparms (p1
, p2
);
850 rval
= build_function_type (valtype
, parms
);
851 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
852 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
853 rval
= apply_memfn_quals (rval
,
854 type_memfn_quals (t1
),
855 type_memfn_rqual (t1
));
856 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
857 TYPE_RAISES_EXCEPTIONS (t2
));
858 t1
= build_exception_variant (rval
, raises
);
859 if (late_return_type_p
)
860 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
866 /* Get this value the long way, since TYPE_METHOD_BASETYPE
867 is just the main variant of this. */
868 tree basetype
= class_of_this_parm (t2
);
869 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
870 TYPE_RAISES_EXCEPTIONS (t2
));
871 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
873 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
874 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
876 /* If this was a member function type, get back to the
877 original type of type member function (i.e., without
878 the class instance variable up front. */
879 t1
= build_function_type (TREE_TYPE (t1
),
880 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
881 t2
= build_function_type (TREE_TYPE (t2
),
882 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
883 t3
= merge_types (t1
, t2
);
884 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
885 TYPE_ARG_TYPES (t3
));
886 t1
= build_exception_variant (t3
, raises
);
887 t1
= build_ref_qualified_type (t1
, rqual
);
888 if (late_return_type_1_p
)
889 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
890 if (late_return_type_2_p
)
891 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
896 /* There is no need to merge attributes into a TYPENAME_TYPE.
897 When the type is instantiated it will have whatever
898 attributes result from the instantiation. */
904 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
906 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
909 return cp_build_type_attribute_variant (t1
, attributes
);
912 /* Return the ARRAY_TYPE type without its domain. */
915 strip_array_domain (tree type
)
918 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
919 if (TYPE_DOMAIN (type
) == NULL_TREE
)
921 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
922 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
925 /* Wrapper around cp_common_type that is used by c-common.c and other
926 front end optimizations that remove promotions.
928 Return the common type for two arithmetic types T1 and T2 under the
929 usual arithmetic conversions. The default conversions have already
930 been applied, and enumerated types converted to their compatible
934 common_type (tree t1
, tree t2
)
936 /* If one type is nonsense, use the other */
937 if (t1
== error_mark_node
)
939 if (t2
== error_mark_node
)
942 return cp_common_type (t1
, t2
);
945 /* Return the common type of two pointer types T1 and T2. This is the
946 type for the result of most arithmetic operations if the operands
947 have the given two types.
949 We assume that comp_target_types has already been done and returned
950 nonzero; if that isn't so, this may crash. */
953 common_pointer_type (tree t1
, tree t2
)
955 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
956 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
957 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
959 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
960 CPO_CONVERSION
, tf_warning_or_error
);
963 /* Compare two exception specifier types for exactness or subsetness, if
964 allowed. Returns false for mismatch, true for match (same, or
967 [except.spec] "If a class X ... objects of class X or any class publicly
968 and unambiguously derived from X. Similarly, if a pointer type Y * ...
969 exceptions of type Y * or that are pointers to any type publicly and
970 unambiguously derived from Y. Otherwise a function only allows exceptions
971 that have the same type ..."
972 This does not mention cv qualifiers and is different to what throw
973 [except.throw] and catch [except.catch] will do. They will ignore the
974 top level cv qualifiers, and allow qualifiers in the pointer to class
977 We implement the letter of the standard. */
980 comp_except_types (tree a
, tree b
, bool exact
)
982 if (same_type_p (a
, b
))
986 if (cp_type_quals (a
) || cp_type_quals (b
))
989 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
993 if (cp_type_quals (a
) || cp_type_quals (b
))
997 if (TREE_CODE (a
) != RECORD_TYPE
998 || TREE_CODE (b
) != RECORD_TYPE
)
1001 if (publicly_uniquely_derived_p (a
, b
))
1007 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1008 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1009 If EXACT is ce_type, the C++17 type compatibility rules apply.
1010 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1011 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1012 are unordered, but we've already filtered out duplicates. Most lists will
1013 be in order, we should try to make use of that. */
1016 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1025 /* First handle noexcept. */
1026 if (exact
< ce_exact
)
1028 if (exact
== ce_type
1029 && (canonical_eh_spec (CONST_CAST_TREE (t1
))
1030 == canonical_eh_spec (CONST_CAST_TREE (t2
))))
1033 /* noexcept(false) is compatible with no exception-specification,
1034 and less strict than any spec. */
1035 if (t1
== noexcept_false_spec
)
1036 return t2
== NULL_TREE
|| exact
== ce_derived
;
1037 /* Even a derived noexcept(false) is compatible with no
1038 exception-specification. */
1039 if (t2
== noexcept_false_spec
)
1040 return t1
== NULL_TREE
;
1042 /* Otherwise, if we aren't looking for an exact match, noexcept is
1043 equivalent to throw(). */
1044 if (t1
== noexcept_true_spec
)
1045 t1
= empty_except_spec
;
1046 if (t2
== noexcept_true_spec
)
1047 t2
= empty_except_spec
;
1050 /* If any noexcept is left, it is only comparable to itself;
1051 either we're looking for an exact match or we're redeclaring a
1052 template with dependent noexcept. */
1053 if ((t1
&& TREE_PURPOSE (t1
))
1054 || (t2
&& TREE_PURPOSE (t2
)))
1056 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1058 if (t1
== NULL_TREE
) /* T1 is ... */
1059 return t2
== NULL_TREE
|| exact
== ce_derived
;
1060 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1061 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1062 if (t2
== NULL_TREE
) /* T2 is ... */
1064 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1065 return exact
== ce_derived
;
1067 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1068 Count how many we find, to determine exactness. For exact matching and
1069 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1071 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1073 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1075 tree a
= TREE_VALUE (probe
);
1076 tree b
= TREE_VALUE (t2
);
1078 if (comp_except_types (a
, b
, exact
))
1080 if (probe
== base
&& exact
> ce_derived
)
1081 base
= TREE_CHAIN (probe
);
1086 if (probe
== NULL_TREE
)
1089 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1092 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1093 [] can match [size]. */
1096 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1105 /* The type of the array elements must be the same. */
1106 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1109 d1
= TYPE_DOMAIN (t1
);
1110 d2
= TYPE_DOMAIN (t2
);
1115 /* If one of the arrays is dimensionless, and the other has a
1116 dimension, they are of different types. However, it is valid to
1124 declarations for an array object can specify
1125 array types that differ by the presence or absence of a major
1126 array bound (_dcl.array_). */
1128 return allow_redeclaration
;
1130 /* Check that the dimensions are the same. */
1132 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1134 max1
= TYPE_MAX_VALUE (d1
);
1135 max2
= TYPE_MAX_VALUE (d2
);
1137 if (!cp_tree_equal (max1
, max2
))
1143 /* Compare the relative position of T1 and T2 into their respective
1144 template parameter list.
1145 T1 and T2 must be template parameter types.
1146 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1149 comp_template_parms_position (tree t1
, tree t2
)
1151 tree index1
, index2
;
1152 gcc_assert (t1
&& t2
1153 && TREE_CODE (t1
) == TREE_CODE (t2
)
1154 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1155 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1156 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1158 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1159 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1161 /* Then compare their relative position. */
1162 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1163 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1164 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1165 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1168 /* In C++14 we can end up comparing 'auto' to a normal template
1169 parameter. Don't confuse them. */
1170 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1171 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1176 /* Subroutine in comptypes. */
1179 structural_comptypes (tree t1
, tree t2
, int strict
)
1184 /* Suppress errors caused by previously reported errors. */
1185 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1188 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1190 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1191 current instantiation. */
1192 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1193 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1195 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1196 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1198 if (TYPE_PTRMEMFUNC_P (t1
))
1199 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1200 if (TYPE_PTRMEMFUNC_P (t2
))
1201 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1203 /* Different classes of types can't be compatible. */
1204 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1207 /* Qualifiers must match. For array types, we will check when we
1208 recur on the array element types. */
1209 if (TREE_CODE (t1
) != ARRAY_TYPE
1210 && cp_type_quals (t1
) != cp_type_quals (t2
))
1212 if (TREE_CODE (t1
) == FUNCTION_TYPE
1213 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1215 /* Need to check this before TYPE_MAIN_VARIANT.
1216 FIXME function qualifiers should really change the main variant. */
1217 if (TREE_CODE (t1
) == FUNCTION_TYPE
1218 || TREE_CODE (t1
) == METHOD_TYPE
)
1220 if (type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1222 if (flag_noexcept_type
1223 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1
),
1224 TYPE_RAISES_EXCEPTIONS (t2
),
1229 /* Allow for two different type nodes which have essentially the same
1230 definition. Note that we already checked for equality of the type
1231 qualifiers (just above). */
1233 if (TREE_CODE (t1
) != ARRAY_TYPE
1234 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1238 /* Compare the types. Break out if they could be the same. */
1239 switch (TREE_CODE (t1
))
1243 /* All void and bool types are the same. */
1247 case FIXED_POINT_TYPE
:
1249 /* With these nodes, we can't determine type equivalence by
1250 looking at what is stored in the nodes themselves, because
1251 two nodes might have different TYPE_MAIN_VARIANTs but still
1252 represent the same type. For example, wchar_t and int could
1253 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1254 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1255 and are distinct types. On the other hand, int and the
1258 typedef int INT __attribute((may_alias));
1260 have identical properties, different TYPE_MAIN_VARIANTs, but
1261 represent the same type. The canonical type system keeps
1262 track of equivalence in this case, so we fall back on it. */
1263 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1265 case TEMPLATE_TEMPLATE_PARM
:
1266 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1267 if (!comp_template_parms_position (t1
, t2
))
1269 if (!comp_template_parms
1270 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1271 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1273 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1275 /* Don't check inheritance. */
1276 strict
= COMPARE_STRICT
;
1281 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1282 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1283 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1284 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1287 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1289 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1295 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1296 strict
& ~COMPARE_REDECLARATION
))
1298 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1302 case REFERENCE_TYPE
:
1303 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1305 /* fall through to checks for pointer types */
1309 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1310 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1316 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1323 /* Target types must match incl. qualifiers. */
1324 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1328 case TEMPLATE_TYPE_PARM
:
1329 /* If T1 and T2 don't have the same relative position in their
1330 template parameters set, they can't be equal. */
1331 if (!comp_template_parms_position (t1
, t2
))
1333 /* Constrained 'auto's are distinct from parms that don't have the same
1335 if (!equivalent_placeholder_constraints (t1
, t2
))
1340 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1341 TYPENAME_TYPE_FULLNAME (t2
)))
1343 /* Qualifiers don't matter on scopes. */
1344 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1349 case UNBOUND_CLASS_TEMPLATE
:
1350 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1352 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1357 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1362 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1363 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1367 case TYPE_PACK_EXPANSION
:
1368 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1369 PACK_EXPANSION_PATTERN (t2
))
1370 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1371 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1374 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1375 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1376 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1377 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1378 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1379 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1380 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1381 DECLTYPE_TYPE_EXPR (t2
)))
1385 case UNDERLYING_TYPE
:
1386 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1387 UNDERLYING_TYPE_TYPE (t2
));
1393 /* If we get here, we know that from a target independent POV the
1394 types are the same. Make sure the target attributes are also
1396 return comp_type_attributes (t1
, t2
);
1399 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1400 is a bitwise-or of the COMPARE_* flags. */
1403 comptypes (tree t1
, tree t2
, int strict
)
1405 if (strict
== COMPARE_STRICT
)
1410 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1413 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1414 /* At least one of the types requires structural equality, so
1415 perform a deep check. */
1416 return structural_comptypes (t1
, t2
, strict
);
1418 if (flag_checking
&& USE_CANONICAL_TYPES
)
1420 bool result
= structural_comptypes (t1
, t2
, strict
);
1422 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1423 /* The two types are structurally equivalent, but their
1424 canonical types were different. This is a failure of the
1425 canonical type propagation code.*/
1427 ("canonical types differ for identical types %qT and %qT",
1429 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1430 /* Two types are structurally different, but the canonical
1431 types are the same. This means we were over-eager in
1432 assigning canonical types. */
1434 ("same canonical type node for different types %qT and %qT",
1439 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1440 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1442 return structural_comptypes (t1
, t2
, strict
);
1444 else if (strict
== COMPARE_STRUCTURAL
)
1445 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1447 return structural_comptypes (t1
, t2
, strict
);
1450 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1451 top-level qualifiers. */
1454 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1456 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1459 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1460 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1461 return same_type_p (type1
, type2
);
1464 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1467 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1469 int q1
= cp_type_quals (type1
);
1470 int q2
= cp_type_quals (type2
);
1472 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1473 return (q1
& q2
) == q2
;
1476 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1477 more cv-qualified that TYPE1, and 0 otherwise. */
1480 comp_cv_qualification (int q1
, int q2
)
1485 if ((q1
& q2
) == q2
)
1487 else if ((q1
& q2
) == q1
)
1494 comp_cv_qualification (const_tree type1
, const_tree type2
)
1496 int q1
= cp_type_quals (type1
);
1497 int q2
= cp_type_quals (type2
);
1498 return comp_cv_qualification (q1
, q2
);
1501 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1502 subset of the cv-qualification signature of TYPE2, and the types
1503 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1506 comp_cv_qual_signature (tree type1
, tree type2
)
1508 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1510 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1516 /* Subroutines of `comptypes'. */
1518 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1519 equivalent in the sense that functions with those parameter types
1520 can have equivalent types. The two lists must be equivalent,
1521 element by element. */
1524 compparms (const_tree parms1
, const_tree parms2
)
1528 /* An unspecified parmlist matches any specified parmlist
1529 whose argument types don't need default promotions. */
1531 for (t1
= parms1
, t2
= parms2
;
1533 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1535 /* If one parmlist is shorter than the other,
1536 they fail to match. */
1539 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1546 /* Process a sizeof or alignof expression where the operand is a
1550 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1555 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1556 if (type
== error_mark_node
)
1557 return error_mark_node
;
1559 type
= non_reference (type
);
1560 if (TREE_CODE (type
) == METHOD_TYPE
)
1563 pedwarn (input_location
, OPT_Wpointer_arith
,
1564 "invalid application of %qs to a member function",
1565 OVL_OP_INFO (false, op
)->name
);
1567 return error_mark_node
;
1568 value
= size_one_node
;
1571 dependent_p
= dependent_type_p (type
);
1573 complete_type (type
);
1575 /* VLA types will have a non-constant size. In the body of an
1576 uninstantiated template, we don't need to try to compute the
1577 value, because the sizeof expression is not an integral
1578 constant expression in that case. And, if we do try to
1579 compute the value, we'll likely end up with SAVE_EXPRs, which
1580 the template substitution machinery does not expect to see. */
1581 || (processing_template_decl
1582 && COMPLETE_TYPE_P (type
)
1583 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1585 value
= build_min (op
, size_type_node
, type
);
1586 TREE_READONLY (value
) = 1;
1590 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1591 op
== SIZEOF_EXPR
, false,
1595 /* Return the size of the type, without producing any warnings for
1596 types whose size cannot be taken. This routine should be used only
1597 in some other routine that has already produced a diagnostic about
1598 using the size of such a type. */
1600 cxx_sizeof_nowarn (tree type
)
1602 if (TREE_CODE (type
) == FUNCTION_TYPE
1603 || VOID_TYPE_P (type
)
1604 || TREE_CODE (type
) == ERROR_MARK
)
1605 return size_one_node
;
1606 else if (!COMPLETE_TYPE_P (type
))
1607 return size_zero_node
;
1609 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1612 /* Process a sizeof expression where the operand is an expression. */
1615 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1617 if (e
== error_mark_node
)
1618 return error_mark_node
;
1620 if (processing_template_decl
)
1622 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1623 TREE_SIDE_EFFECTS (e
) = 0;
1624 TREE_READONLY (e
) = 1;
1629 /* To get the size of a static data member declared as an array of
1630 unknown bound, we need to instantiate it. */
1632 && VAR_HAD_UNKNOWN_BOUND (e
)
1633 && DECL_TEMPLATE_INSTANTIATION (e
))
1634 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1636 if (TREE_CODE (e
) == PARM_DECL
1637 && DECL_ARRAY_PARAMETER_P (e
)
1638 && (complain
& tf_warning
))
1640 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1641 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1642 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1645 e
= mark_type_use (e
);
1649 if (complain
& tf_error
)
1650 error ("invalid application of %<sizeof%> to a bit-field");
1652 return error_mark_node
;
1655 else if (is_overloaded_fn (e
))
1657 if (complain
& tf_error
)
1658 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1661 return error_mark_node
;
1664 else if (type_unknown_p (e
))
1666 if (complain
& tf_error
)
1667 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1669 return error_mark_node
;
1675 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1678 /* Implement the __alignof keyword: Return the minimum required
1679 alignment of E, measured in bytes. For VAR_DECL's and
1680 FIELD_DECL's return DECL_ALIGN (which can be set from an
1681 "aligned" __attribute__ specification). */
1684 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1688 if (e
== error_mark_node
)
1689 return error_mark_node
;
1691 if (processing_template_decl
)
1693 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1694 TREE_SIDE_EFFECTS (e
) = 0;
1695 TREE_READONLY (e
) = 1;
1700 e
= mark_type_use (e
);
1703 t
= size_int (DECL_ALIGN_UNIT (e
));
1704 else if (bitfield_p (e
))
1706 if (complain
& tf_error
)
1707 error ("invalid application of %<__alignof%> to a bit-field");
1709 return error_mark_node
;
1712 else if (TREE_CODE (e
) == COMPONENT_REF
1713 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1714 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1715 else if (is_overloaded_fn (e
))
1717 if (complain
& tf_error
)
1718 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1721 return error_mark_node
;
1722 if (TREE_CODE (e
) == FUNCTION_DECL
)
1723 t
= size_int (DECL_ALIGN_UNIT (e
));
1727 else if (type_unknown_p (e
))
1729 if (complain
& tf_error
)
1730 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1732 return error_mark_node
;
1736 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1737 complain
& tf_error
);
1739 return fold_convert (size_type_node
, t
);
1742 /* Process a sizeof or alignof expression E with code OP where the operand
1743 is an expression. */
1746 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1748 if (op
== SIZEOF_EXPR
)
1749 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1751 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1754 /* Build a representation of an expression 'alignas(E).' Return the
1755 folded integer value of E if it is an integral constant expression
1756 that resolves to a valid alignment. If E depends on a template
1757 parameter, return a syntactic representation tree of kind
1758 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1759 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1762 cxx_alignas_expr (tree e
)
1764 if (e
== NULL_TREE
|| e
== error_mark_node
1765 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1771 When the alignment-specifier is of the form
1772 alignas(type-id ), it shall have the same effect as
1773 alignas(alignof(type-id )). */
1775 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1777 /* If we reach this point, it means the alignas expression if of
1778 the form "alignas(assignment-expression)", so we should follow
1779 what is stated by [dcl.align]/2. */
1781 if (value_dependent_expression_p (e
))
1782 /* Leave value-dependent expression alone for now. */
1785 e
= instantiate_non_dependent_expr (e
);
1786 e
= mark_rvalue_use (e
);
1788 /* [dcl.align]/2 says:
1790 the assignment-expression shall be an integral constant
1793 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e
)))
1795 error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e
));
1796 return error_mark_node
;
1799 return cxx_constant_value (e
);
1803 /* EXPR is being used in a context that is not a function call.
1808 The expression can be used only as the left-hand operand of a
1809 member function call.
1811 [expr.mptr.operator]
1813 If the result of .* or ->* is a function, then that result can be
1814 used only as the operand for the function call operator ().
1816 by issuing an error message if appropriate. Returns true iff EXPR
1817 violates these rules. */
1820 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1822 if (expr
== NULL_TREE
)
1824 /* Don't enforce this in MS mode. */
1825 if (flag_ms_extensions
)
1827 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1828 expr
= get_first_fn (expr
);
1829 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1831 if (complain
& tf_error
)
1835 error_at (loc
, "invalid use of non-static member function %qD",
1837 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1840 error_at (loc
, "invalid use of non-static member function of "
1841 "type %qT", TREE_TYPE (expr
));
1848 /* If EXP is a reference to a bitfield, and the type of EXP does not
1849 match the declared type of the bitfield, return the declared type
1850 of the bitfield. Otherwise, return NULL_TREE. */
1853 is_bitfield_expr_with_lowered_type (const_tree exp
)
1855 switch (TREE_CODE (exp
))
1858 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1859 ? TREE_OPERAND (exp
, 1)
1860 : TREE_OPERAND (exp
, 0)))
1862 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1865 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1869 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1875 field
= TREE_OPERAND (exp
, 1);
1876 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1878 if (same_type_ignoring_top_level_qualifiers_p
1879 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1881 return DECL_BIT_FIELD_TYPE (field
);
1885 if (DECL_HAS_VALUE_EXPR_P (exp
))
1886 return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
1887 (CONST_CAST_TREE (exp
)));
1891 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1892 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1893 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1901 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1902 bitfield with a lowered type, the type of EXP is returned, rather
1906 unlowered_expr_type (const_tree exp
)
1909 tree etype
= TREE_TYPE (exp
);
1911 type
= is_bitfield_expr_with_lowered_type (exp
);
1913 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1920 /* Perform the conversions in [expr] that apply when an lvalue appears
1921 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1922 function-to-pointer conversions. In addition, bitfield references are
1923 converted to their declared types. Note that this function does not perform
1924 the lvalue-to-rvalue conversion for class types. If you need that conversion
1925 for class types, then you probably need to use force_rvalue.
1927 Although the returned value is being used as an rvalue, this
1928 function does not wrap the returned expression in a
1929 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1930 that the return value is no longer an lvalue. */
1933 decay_conversion (tree exp
,
1934 tsubst_flags_t complain
,
1935 bool reject_builtin
/* = true */)
1938 enum tree_code code
;
1939 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1941 type
= TREE_TYPE (exp
);
1942 if (type
== error_mark_node
)
1943 return error_mark_node
;
1945 exp
= resolve_nondeduced_context (exp
, complain
);
1946 if (type_unknown_p (exp
))
1948 if (complain
& tf_error
)
1949 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1950 return error_mark_node
;
1953 code
= TREE_CODE (type
);
1955 if (error_operand_p (exp
))
1956 return error_mark_node
;
1958 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
1959 return nullptr_node
;
1961 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1962 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1963 if (code
== VOID_TYPE
)
1965 if (complain
& tf_error
)
1966 error_at (loc
, "void value not ignored as it ought to be");
1967 return error_mark_node
;
1969 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
1970 return error_mark_node
;
1971 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1973 exp
= mark_lvalue_use (exp
);
1974 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
1975 return error_mark_node
;
1976 return cp_build_addr_expr (exp
, complain
);
1978 if (code
== ARRAY_TYPE
)
1983 exp
= mark_lvalue_use (exp
);
1985 if (INDIRECT_REF_P (exp
))
1986 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1987 TREE_OPERAND (exp
, 0));
1989 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1991 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
1992 if (op1
== error_mark_node
)
1993 return error_mark_node
;
1994 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1995 TREE_OPERAND (exp
, 0), op1
);
1998 if (!obvalue_p (exp
)
1999 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
2001 if (complain
& tf_error
)
2002 error_at (loc
, "invalid use of non-lvalue array");
2003 return error_mark_node
;
2006 /* Don't let an array compound literal decay to a pointer. It can
2007 still be used to initialize an array or bind to a reference. */
2008 if (TREE_CODE (exp
) == TARGET_EXPR
)
2010 if (complain
& tf_error
)
2011 error_at (loc
, "taking address of temporary array");
2012 return error_mark_node
;
2015 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2019 if (!cxx_mark_addressable (exp
))
2020 return error_mark_node
;
2021 adr
= build_nop (ptrtype
, build_address (exp
));
2024 /* This way is better for a COMPONENT_REF since it can
2025 simplify the offset for a component. */
2026 adr
= cp_build_addr_expr (exp
, complain
);
2027 return cp_convert (ptrtype
, adr
, complain
);
2030 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2031 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2033 /* If a bitfield is used in a context where integral promotion
2034 applies, then the caller is expected to have used
2035 default_conversion. That function promotes bitfields correctly
2036 before calling this function. At this point, if we have a
2037 bitfield referenced, we may assume that is not subject to
2038 promotion, and that, therefore, the type of the resulting rvalue
2039 is the declared type of the bitfield. */
2040 exp
= convert_bitfield_to_declared_type (exp
);
2042 /* We do not call rvalue() here because we do not want to wrap EXP
2043 in a NON_LVALUE_EXPR. */
2047 Non-class rvalues always have cv-unqualified types. */
2048 type
= TREE_TYPE (exp
);
2049 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2050 exp
= build_nop (cv_unqualified (type
), exp
);
2052 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2053 return error_mark_node
;
2058 /* Perform preparatory conversions, as part of the "usual arithmetic
2059 conversions". In particular, as per [expr]:
2061 Whenever an lvalue expression appears as an operand of an
2062 operator that expects the rvalue for that operand, the
2063 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2064 standard conversions are applied to convert the expression to an
2067 In addition, we perform integral promotions here, as those are
2068 applied to both operands to a binary operator before determining
2069 what additional conversions should apply. */
2072 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2074 /* Check for target-specific promotions. */
2075 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2077 exp
= cp_convert (promoted_type
, exp
, complain
);
2078 /* Perform the integral promotions first so that bitfield
2079 expressions (which may promote to "int", even if the bitfield is
2080 declared "unsigned") are promoted correctly. */
2081 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2082 exp
= cp_perform_integral_promotions (exp
, complain
);
2083 /* Perform the other conversions. */
2084 exp
= decay_conversion (exp
, complain
);
2092 default_conversion (tree exp
)
2094 return cp_default_conversion (exp
, tf_warning_or_error
);
2097 /* EXPR is an expression with an integral or enumeration type.
2098 Perform the integral promotions in [conv.prom], and return the
2102 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2107 expr
= mark_rvalue_use (expr
);
2111 If the bitfield has an enumerated type, it is treated as any
2112 other value of that type for promotion purposes. */
2113 type
= is_bitfield_expr_with_lowered_type (expr
);
2114 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2115 type
= TREE_TYPE (expr
);
2116 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2117 /* Scoped enums don't promote. */
2118 if (SCOPED_ENUM_P (type
))
2120 promoted_type
= type_promotes_to (type
);
2121 if (type
!= promoted_type
)
2122 expr
= cp_convert (promoted_type
, expr
, complain
);
2129 perform_integral_promotions (tree expr
)
2131 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2134 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2135 decay_conversion to one. */
2138 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2142 if (!TYPE_PTR_P (totype
))
2145 t
= TREE_TYPE (totype
);
2146 if (!same_type_p (t
, char_type_node
)
2147 && !same_type_p (t
, char16_type_node
)
2148 && !same_type_p (t
, char32_type_node
)
2149 && !same_type_p (t
, wchar_type_node
))
2152 if (TREE_CODE (exp
) == STRING_CST
)
2154 /* Make sure that we don't try to convert between char and wide chars. */
2155 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2160 /* Is this a string constant which has decayed to 'const char *'? */
2161 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2162 if (!same_type_p (TREE_TYPE (exp
), t
))
2165 if (TREE_CODE (exp
) != ADDR_EXPR
2166 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2171 if (cxx_dialect
>= cxx11
)
2172 pedwarn (input_location
, OPT_Wwrite_strings
,
2173 "ISO C++ forbids converting a string constant to %qT",
2176 warning (OPT_Wwrite_strings
,
2177 "deprecated conversion from string constant to %qT",
2184 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2185 can, for example, use as an lvalue. This code used to be in
2186 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2187 expressions, where we're dealing with aggregates. But now it's again only
2188 called from unary_complex_lvalue. The case (in particular) that led to
2189 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2193 rationalize_conditional_expr (enum tree_code code
, tree t
,
2194 tsubst_flags_t complain
)
2196 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2198 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2199 the first operand is always the one to be used if both operands
2200 are equal, so we know what conditional expression this used to be. */
2201 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2203 tree op0
= TREE_OPERAND (t
, 0);
2204 tree op1
= TREE_OPERAND (t
, 1);
2206 /* The following code is incorrect if either operand side-effects. */
2207 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2208 && !TREE_SIDE_EFFECTS (op1
));
2210 build_conditional_expr (loc
,
2211 build_x_binary_op (loc
,
2212 (TREE_CODE (t
) == MIN_EXPR
2213 ? LE_EXPR
: GE_EXPR
),
2214 op0
, TREE_CODE (op0
),
2215 op1
, TREE_CODE (op1
),
2218 cp_build_unary_op (code
, op0
, false, complain
),
2219 cp_build_unary_op (code
, op1
, false, complain
),
2224 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2225 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), false,
2227 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), false,
2232 /* Given the TYPE of an anonymous union field inside T, return the
2233 FIELD_DECL for the field. If not found return NULL_TREE. Because
2234 anonymous unions can nest, we must also search all anonymous unions
2235 that are directly reachable. */
2238 lookup_anon_field (tree t
, tree type
)
2242 t
= TYPE_MAIN_VARIANT (t
);
2244 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2246 if (TREE_STATIC (field
))
2248 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2251 /* If we find it directly, return the field. */
2252 if (DECL_NAME (field
) == NULL_TREE
2253 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2258 /* Otherwise, it could be nested, search harder. */
2259 if (DECL_NAME (field
) == NULL_TREE
2260 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2262 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2270 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2271 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2272 non-NULL, it indicates the path to the base used to name MEMBER.
2273 If PRESERVE_REFERENCE is true, the expression returned will have
2274 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2275 returned will have the type referred to by the reference.
2277 This function does not perform access control; that is either done
2278 earlier by the parser when the name of MEMBER is resolved to MEMBER
2279 itself, or later when overload resolution selects one of the
2280 functions indicated by MEMBER. */
2283 build_class_member_access_expr (cp_expr object
, tree member
,
2284 tree access_path
, bool preserve_reference
,
2285 tsubst_flags_t complain
)
2289 tree result
= NULL_TREE
;
2290 tree using_decl
= NULL_TREE
;
2292 if (error_operand_p (object
) || error_operand_p (member
))
2293 return error_mark_node
;
2295 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2299 The type of the first expression shall be "class object" (of a
2301 object_type
= TREE_TYPE (object
);
2302 if (!currently_open_class (object_type
)
2303 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2304 return error_mark_node
;
2305 if (!CLASS_TYPE_P (object_type
))
2307 if (complain
& tf_error
)
2309 if (POINTER_TYPE_P (object_type
)
2310 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2311 error ("request for member %qD in %qE, which is of pointer "
2312 "type %qT (maybe you meant to use %<->%> ?)",
2313 member
, object
.get_value (), object_type
);
2315 error ("request for member %qD in %qE, which is of non-class "
2316 "type %qT", member
, object
.get_value (), object_type
);
2318 return error_mark_node
;
2321 /* The standard does not seem to actually say that MEMBER must be a
2322 member of OBJECT_TYPE. However, that is clearly what is
2324 if (DECL_P (member
))
2326 member_scope
= DECL_CLASS_CONTEXT (member
);
2327 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2328 return error_mark_node
;
2329 if (TREE_DEPRECATED (member
))
2330 warn_deprecated_use (member
, NULL_TREE
);
2333 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2334 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2335 presently be the anonymous union. Go outwards until we find a
2336 type related to OBJECT_TYPE. */
2337 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2338 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2340 member_scope
= TYPE_CONTEXT (member_scope
);
2341 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2343 if (complain
& tf_error
)
2345 if (TREE_CODE (member
) == FIELD_DECL
)
2346 error ("invalid use of nonstatic data member %qE", member
);
2348 error ("%qD is not a member of %qT", member
, object_type
);
2350 return error_mark_node
;
2353 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2354 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2355 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2357 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2359 object
= cp_build_fold_indirect_ref (temp
);
2362 /* In [expr.ref], there is an explicit list of the valid choices for
2363 MEMBER. We check for each of those cases here. */
2366 /* A static data member. */
2368 mark_exp_read (object
);
2369 /* If OBJECT has side-effects, they are supposed to occur. */
2370 if (TREE_SIDE_EFFECTS (object
))
2371 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2373 else if (TREE_CODE (member
) == FIELD_DECL
)
2375 /* A non-static data member. */
2380 if (INDIRECT_REF_P (object
))
2382 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2384 null_object_p
= false;
2386 /* Convert OBJECT to the type of MEMBER. */
2387 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2388 TYPE_MAIN_VARIANT (member_scope
)))
2393 binfo
= lookup_base (access_path
? access_path
: object_type
,
2394 member_scope
, ba_unique
, &kind
, complain
);
2395 if (binfo
== error_mark_node
)
2396 return error_mark_node
;
2398 /* It is invalid to try to get to a virtual base of a
2399 NULL object. The most common cause is invalid use of
2401 if (null_object_p
&& kind
== bk_via_virtual
)
2403 if (complain
& tf_error
)
2405 error ("invalid access to non-static data member %qD in "
2406 "virtual base of NULL object", member
);
2408 return error_mark_node
;
2411 /* Convert to the base. */
2412 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2413 /*nonnull=*/1, complain
);
2414 /* If we found the base successfully then we should be able
2415 to convert to it successfully. */
2416 gcc_assert (object
!= error_mark_node
);
2419 /* If MEMBER is from an anonymous aggregate, we have converted
2420 OBJECT so that it refers to the class containing the
2421 anonymous union. Generate a reference to the anonymous union
2422 itself, and recur to find MEMBER. */
2423 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2424 /* When this code is called from build_field_call, the
2425 object already has the type of the anonymous union.
2426 That is because the COMPONENT_REF was already
2427 constructed, and was then disassembled before calling
2428 build_field_call. After the function-call code is
2429 cleaned up, this waste can be eliminated. */
2430 && (!same_type_ignoring_top_level_qualifiers_p
2431 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2433 tree anonymous_union
;
2435 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2436 DECL_CONTEXT (member
));
2437 object
= build_class_member_access_expr (object
,
2439 /*access_path=*/NULL_TREE
,
2444 /* Compute the type of the field, as described in [expr.ref]. */
2445 type_quals
= TYPE_UNQUALIFIED
;
2446 member_type
= TREE_TYPE (member
);
2447 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2449 type_quals
= (cp_type_quals (member_type
)
2450 | cp_type_quals (object_type
));
2452 /* A field is const (volatile) if the enclosing object, or the
2453 field itself, is const (volatile). But, a mutable field is
2454 not const, even within a const object. */
2455 if (DECL_MUTABLE_P (member
))
2456 type_quals
&= ~TYPE_QUAL_CONST
;
2457 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2460 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2461 object
, member
, NULL_TREE
);
2463 /* Mark the expression const or volatile, as appropriate. Even
2464 though we've dealt with the type above, we still have to mark the
2465 expression itself. */
2466 if (type_quals
& TYPE_QUAL_CONST
)
2467 TREE_READONLY (result
) = 1;
2468 if (type_quals
& TYPE_QUAL_VOLATILE
)
2469 TREE_THIS_VOLATILE (result
) = 1;
2471 else if (BASELINK_P (member
))
2473 /* The member is a (possibly overloaded) member function. */
2477 /* If the MEMBER is exactly one static member function, then we
2478 know the type of the expression. Otherwise, we must wait
2479 until overload resolution has been performed. */
2480 functions
= BASELINK_FUNCTIONS (member
);
2481 if (TREE_CODE (functions
) == FUNCTION_DECL
2482 && DECL_STATIC_FUNCTION_P (functions
))
2483 type
= TREE_TYPE (functions
);
2485 type
= unknown_type_node
;
2486 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2487 base. That will happen when the function is called. */
2488 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2490 else if (TREE_CODE (member
) == CONST_DECL
)
2492 /* The member is an enumerator. */
2494 /* If OBJECT has side-effects, they are supposed to occur. */
2495 if (TREE_SIDE_EFFECTS (object
))
2496 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2499 else if ((using_decl
= strip_using_decl (member
)) != member
)
2500 result
= build_class_member_access_expr (object
,
2502 access_path
, preserve_reference
,
2506 if (complain
& tf_error
)
2507 error ("invalid use of %qD", member
);
2508 return error_mark_node
;
2511 if (!preserve_reference
)
2514 If E2 is declared to have type "reference to T", then ... the
2515 type of E1.E2 is T. */
2516 result
= convert_from_reference (result
);
2521 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2522 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2525 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2526 tsubst_flags_t complain
)
2528 tree object_type
= TREE_TYPE (object
);
2529 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2532 /* We've already complained about this destructor. */
2533 if (dtor_type
== error_mark_node
)
2534 return error_mark_node
;
2536 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2538 if (complain
& tf_error
)
2539 error ("qualified type %qT does not match destructor name ~%qT",
2541 return error_mark_node
;
2543 if (is_auto (dtor_type
))
2544 dtor_type
= object_type
;
2545 else if (identifier_p (dtor_type
))
2547 /* In a template, names we can't find a match for are still accepted
2548 destructor names, and we check them here. */
2549 if (check_dtor_name (object_type
, dtor_type
))
2550 dtor_type
= object_type
;
2553 if (complain
& tf_error
)
2554 error ("object type %qT does not match destructor name ~%qT",
2555 object_type
, dtor_type
);
2556 return error_mark_node
;
2560 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2562 if (complain
& tf_error
)
2563 error ("the type being destroyed is %qT, but the destructor "
2564 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2565 return error_mark_node
;
2567 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2568 /*protect=*/1, /*want_type=*/false,
2569 tf_warning_or_error
);
2572 if (complain
& tf_error
)
2573 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2574 return error_mark_node
;
2576 expr
= (adjust_result_of_qualified_name_lookup
2577 (expr
, dtor_type
, object_type
));
2578 if (scope
== NULL_TREE
)
2579 /* We need to call adjust_result_of_qualified_name_lookup in case the
2580 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2581 that we still get virtual function binding. */
2582 BASELINK_QUALIFIED_P (expr
) = false;
2586 /* An expression of the form "A::template B" has been resolved to
2587 DECL. Issue a diagnostic if B is not a template or template
2591 check_template_keyword (tree decl
)
2593 /* The standard says:
2597 If a name prefixed by the keyword template is not a member
2598 template, the program is ill-formed.
2600 DR 228 removed the restriction that the template be a member
2603 DR 96, if accepted would add the further restriction that explicit
2604 template arguments must be provided if the template keyword is
2605 used, but, as of 2005-10-16, that DR is still in "drafting". If
2606 this DR is accepted, then the semantic checks here can be
2607 simplified, as the entity named must in fact be a template
2608 specialization, rather than, as at present, a set of overloaded
2609 functions containing at least one template function. */
2610 if (TREE_CODE (decl
) != TEMPLATE_DECL
2611 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2615 if (DECL_USE_TEMPLATE (decl
)
2616 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2619 permerror (input_location
, "%qD is not a template", decl
);
2621 else if (!is_overloaded_fn (decl
))
2622 permerror (input_location
, "%qD is not a template", decl
);
2627 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
2628 !found
&& iter
; ++iter
)
2631 if (TREE_CODE (fn
) == TEMPLATE_DECL
2632 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
2633 || (TREE_CODE (fn
) == FUNCTION_DECL
2634 && DECL_USE_TEMPLATE (fn
)
2635 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
))))
2639 permerror (input_location
, "%qD is not a template", decl
);
2644 /* Record that an access failure occurred on BASETYPE_PATH attempting
2645 to access FIELD_DECL. */
2648 access_failure_info::record_access_failure (tree basetype_path
,
2651 m_was_inaccessible
= true;
2652 m_basetype_path
= basetype_path
;
2653 m_field_decl
= field_decl
;
2656 /* If an access failure was recorded, then attempt to locate an
2657 accessor function for the pertinent field, and if one is
2658 available, add a note and fix-it hint suggesting using it. */
2661 access_failure_info::maybe_suggest_accessor (bool const_p
) const
2663 if (!m_was_inaccessible
)
2667 = locate_field_accessor (m_basetype_path
, m_field_decl
, const_p
);
2671 /* The accessor must itself be accessible for it to be a reasonable
2673 if (!accessible_p (m_basetype_path
, accessor
, true))
2676 rich_location
richloc (line_table
, input_location
);
2678 pp_printf (&pp
, "%s()", IDENTIFIER_POINTER (DECL_NAME (accessor
)));
2679 richloc
.add_fixit_replace (pp_formatted_text (&pp
));
2680 inform (&richloc
, "field %q#D can be accessed via %q#D",
2681 m_field_decl
, accessor
);
2684 /* This function is called by the parser to process a class member
2685 access expression of the form OBJECT.NAME. NAME is a node used by
2686 the parser to represent a name; it is not yet a DECL. It may,
2687 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2688 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2689 there is no reason to do the lookup twice, so the parser keeps the
2690 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2691 be a template via the use of the "A::template B" syntax. */
2694 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2695 tsubst_flags_t complain
)
2700 tree access_path
= NULL_TREE
;
2701 tree orig_object
= object
;
2702 tree orig_name
= name
;
2704 if (object
== error_mark_node
|| name
== error_mark_node
)
2705 return error_mark_node
;
2707 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2708 if (!objc_is_public (object
, name
))
2709 return error_mark_node
;
2711 object_type
= TREE_TYPE (object
);
2713 if (processing_template_decl
)
2715 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2716 type_dependent_object_expression_p (object
)
2717 /* If NAME is "f<args>", where either 'f' or 'args' is
2718 dependent, then the expression is dependent. */
2719 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2720 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2721 TREE_OPERAND (name
, 1)))
2722 /* If NAME is "T::X" where "T" is dependent, then the
2723 expression is dependent. */
2724 || (TREE_CODE (name
) == SCOPE_REF
2725 && TYPE_P (TREE_OPERAND (name
, 0))
2726 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2729 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2730 orig_object
, orig_name
, NULL_TREE
);
2732 object
= build_non_dependent_expr (object
);
2734 else if (c_dialect_objc ()
2735 && identifier_p (name
)
2736 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2741 The type of the first expression shall be "class object" (of a
2743 if (!currently_open_class (object_type
)
2744 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2745 return error_mark_node
;
2746 if (!CLASS_TYPE_P (object_type
))
2748 if (complain
& tf_error
)
2750 if (POINTER_TYPE_P (object_type
)
2751 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2752 error ("request for member %qD in %qE, which is of pointer "
2753 "type %qT (maybe you meant to use %<->%> ?)",
2754 name
, object
.get_value (), object_type
);
2756 error ("request for member %qD in %qE, which is of non-class "
2757 "type %qT", name
, object
.get_value (), object_type
);
2759 return error_mark_node
;
2762 if (BASELINK_P (name
))
2763 /* A member function that has already been looked up. */
2767 bool is_template_id
= false;
2768 tree template_args
= NULL_TREE
;
2769 tree scope
= NULL_TREE
;
2771 access_path
= object_type
;
2773 if (TREE_CODE (name
) == SCOPE_REF
)
2775 /* A qualified name. The qualifying class or namespace `S'
2776 has already been looked up; it is either a TYPE or a
2778 scope
= TREE_OPERAND (name
, 0);
2779 name
= TREE_OPERAND (name
, 1);
2781 /* If SCOPE is a namespace, then the qualified name does not
2782 name a member of OBJECT_TYPE. */
2783 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2785 if (complain
& tf_error
)
2786 error ("%<%D::%D%> is not a member of %qT",
2787 scope
, name
, object_type
);
2788 return error_mark_node
;
2792 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2794 is_template_id
= true;
2795 template_args
= TREE_OPERAND (name
, 1);
2796 name
= TREE_OPERAND (name
, 0);
2798 if (!identifier_p (name
))
2799 name
= OVL_NAME (name
);
2804 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2806 gcc_assert (!is_template_id
);
2807 /* Looking up a member enumerator (c++/56793). */
2808 if (!TYPE_CLASS_SCOPE_P (scope
)
2809 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2811 if (complain
& tf_error
)
2812 error ("%<%D::%D%> is not a member of %qT",
2813 scope
, name
, object_type
);
2814 return error_mark_node
;
2816 tree val
= lookup_enumerator (scope
, name
);
2819 if (complain
& tf_error
)
2820 error ("%qD is not a member of %qD",
2822 return error_mark_node
;
2825 if (TREE_SIDE_EFFECTS (object
))
2826 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2830 gcc_assert (CLASS_TYPE_P (scope
));
2831 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2833 if (constructor_name_p (name
, scope
))
2835 if (complain
& tf_error
)
2836 error ("cannot call constructor %<%T::%D%> directly",
2838 return error_mark_node
;
2841 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2842 access_path
= lookup_base (object_type
, scope
, ba_check
,
2844 if (access_path
== error_mark_node
)
2845 return error_mark_node
;
2848 if (any_dependent_bases_p (object_type
))
2850 if (complain
& tf_error
)
2851 error ("%qT is not a base of %qT", scope
, object_type
);
2852 return error_mark_node
;
2856 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2858 if (dependent_type_p (object_type
))
2859 /* The destructor isn't declared yet. */
2861 member
= lookup_destructor (object
, scope
, name
, complain
);
2865 /* Look up the member. */
2866 access_failure_info afi
;
2867 member
= lookup_member (access_path
, name
, /*protect=*/1,
2868 /*want_type=*/false, complain
,
2870 afi
.maybe_suggest_accessor (TYPE_READONLY (object_type
));
2871 if (member
== NULL_TREE
)
2873 if (dependent_type_p (object_type
))
2874 /* Try again at instantiation time. */
2876 if (complain
& tf_error
)
2878 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2879 /*want_type=*/false);
2882 location_t bogus_component_loc
= input_location
;
2883 gcc_rich_location
rich_loc (bogus_component_loc
);
2884 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
2886 error_at (&rich_loc
,
2887 "%q#T has no member named %qE;"
2888 " did you mean %qE?",
2889 TREE_CODE (access_path
) == TREE_BINFO
2890 ? TREE_TYPE (access_path
) : object_type
,
2894 error ("%q#T has no member named %qE",
2895 TREE_CODE (access_path
) == TREE_BINFO
2896 ? TREE_TYPE (access_path
) : object_type
, name
);
2898 return error_mark_node
;
2900 if (member
== error_mark_node
)
2901 return error_mark_node
;
2903 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
2904 /* Dependent type attributes on the decl mean that the TREE_TYPE is
2905 wrong, so don't use it. */
2907 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2913 tree templ
= member
;
2915 if (BASELINK_P (templ
))
2916 member
= lookup_template_function (templ
, template_args
);
2917 else if (variable_template_p (templ
))
2918 member
= (lookup_and_finish_template_variable
2919 (templ
, template_args
, complain
));
2922 if (complain
& tf_error
)
2923 error ("%qD is not a member template function", name
);
2924 return error_mark_node
;
2929 if (TREE_DEPRECATED (member
))
2930 warn_deprecated_use (member
, NULL_TREE
);
2933 check_template_keyword (member
);
2935 expr
= build_class_member_access_expr (object
, member
, access_path
,
2936 /*preserve_reference=*/false,
2938 if (processing_template_decl
&& expr
!= error_mark_node
)
2940 if (BASELINK_P (member
))
2942 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2943 BASELINK_QUALIFIED_P (member
) = 1;
2946 return build_min_non_dep (COMPONENT_REF
, expr
,
2947 orig_object
, orig_name
,
2954 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2958 build_simple_component_ref (tree object
, tree member
)
2960 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
2961 cp_type_quals (TREE_TYPE (object
)));
2962 return build3_loc (input_location
,
2963 COMPONENT_REF
, type
,
2964 object
, member
, NULL_TREE
);
2967 /* Return an expression for the MEMBER_NAME field in the internal
2968 representation of PTRMEM, a pointer-to-member function. (Each
2969 pointer-to-member function type gets its own RECORD_TYPE so it is
2970 more convenient to access the fields by name than by FIELD_DECL.)
2971 This routine converts the NAME to a FIELD_DECL and then creates the
2972 node for the complete expression. */
2975 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2980 /* This code is a stripped down version of
2981 build_class_member_access_expr. It does not work to use that
2982 routine directly because it expects the object to be of class
2984 ptrmem_type
= TREE_TYPE (ptrmem
);
2985 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2986 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
2987 member
= DECL_CHAIN (member
))
2988 if (DECL_NAME (member
) == member_name
)
2990 tree res
= build_simple_component_ref (ptrmem
, member
);
2992 TREE_NO_WARNING (res
) = 1;
2996 /* Given an expression PTR for a pointer, return an expression
2997 for the value pointed to.
2998 ERRORSTRING is the name of the operator to appear in error messages.
3000 This function may need to overload OPERATOR_FNNAME.
3001 Must also handle REFERENCE_TYPEs for C++. */
3004 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
3005 tsubst_flags_t complain
)
3007 tree orig_expr
= expr
;
3009 tree overload
= NULL_TREE
;
3011 if (processing_template_decl
)
3013 /* Retain the type if we know the operand is a pointer. */
3014 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
3015 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
3016 if (type_dependent_expression_p (expr
))
3017 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
3018 expr
= build_non_dependent_expr (expr
);
3021 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
3022 NULL_TREE
, NULL_TREE
, &overload
, complain
);
3024 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
3026 if (processing_template_decl
&& rval
!= error_mark_node
)
3028 if (overload
!= NULL_TREE
)
3029 return (build_min_non_dep_op_overload
3030 (INDIRECT_REF
, rval
, overload
, orig_expr
));
3032 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
3038 /* The implementation of the above, and of indirection implied by other
3039 constructs. If DO_FOLD is true, fold away INDIRECT_REF of ADDR_EXPR. */
3042 cp_build_indirect_ref_1 (tree ptr
, ref_operator errorstring
,
3043 tsubst_flags_t complain
, bool do_fold
)
3047 /* RO_NULL should only be used with the folding entry points below, not
3048 cp_build_indirect_ref. */
3049 gcc_checking_assert (errorstring
!= RO_NULL
|| do_fold
);
3051 if (ptr
== current_class_ptr
3052 || (TREE_CODE (ptr
) == NOP_EXPR
3053 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3054 && (same_type_ignoring_top_level_qualifiers_p
3055 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3056 return current_class_ref
;
3058 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
3059 ? ptr
: decay_conversion (ptr
, complain
));
3060 if (pointer
== error_mark_node
)
3061 return error_mark_node
;
3063 type
= TREE_TYPE (pointer
);
3065 if (POINTER_TYPE_P (type
))
3069 If the type of the expression is "pointer to T," the type
3070 of the result is "T." */
3071 tree t
= TREE_TYPE (type
);
3073 if ((CONVERT_EXPR_P (ptr
)
3074 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3075 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3077 /* If a warning is issued, mark it to avoid duplicates from
3078 the backend. This only needs to be done at
3079 warn_strict_aliasing > 2. */
3080 if (warn_strict_aliasing
> 2)
3081 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
3082 type
, TREE_OPERAND (ptr
, 0)))
3083 TREE_NO_WARNING (ptr
) = 1;
3086 if (VOID_TYPE_P (t
))
3088 /* A pointer to incomplete type (other than cv void) can be
3089 dereferenced [expr.unary.op]/1 */
3090 if (complain
& tf_error
)
3091 error ("%qT is not a pointer-to-object type", type
);
3092 return error_mark_node
;
3094 else if (do_fold
&& TREE_CODE (pointer
) == ADDR_EXPR
3095 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3096 /* The POINTER was something like `&x'. We simplify `*&x' to
3098 return TREE_OPERAND (pointer
, 0);
3101 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3103 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3104 so that we get the proper error message if the result is used
3105 to assign to. Also, &* is supposed to be a no-op. */
3106 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3107 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3108 TREE_SIDE_EFFECTS (ref
)
3109 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3113 else if (!(complain
& tf_error
))
3114 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3116 /* `pointer' won't be an error_mark_node if we were given a
3117 pointer to member, so it's cool to check for this here. */
3118 else if (TYPE_PTRMEM_P (type
))
3119 switch (errorstring
)
3121 case RO_ARRAY_INDEXING
:
3122 error ("invalid use of array indexing on pointer to member");
3125 error ("invalid use of unary %<*%> on pointer to member");
3127 case RO_IMPLICIT_CONVERSION
:
3128 error ("invalid use of implicit conversion on pointer to member");
3131 error ("left hand operand of %<->*%> must be a pointer to class, "
3132 "but is a pointer to member of type %qT", type
);
3137 else if (pointer
!= error_mark_node
)
3138 invalid_indirection_error (input_location
, type
, errorstring
);
3140 return error_mark_node
;
3143 /* Entry point used by c-common, which expects folding. */
3146 build_indirect_ref (location_t
/*loc*/,
3147 tree ptr
, ref_operator errorstring
)
3149 return cp_build_indirect_ref_1 (ptr
, errorstring
, tf_warning_or_error
, true);
3152 /* Entry point used by internal indirection needs that don't correspond to any
3153 syntactic construct. */
3156 cp_build_fold_indirect_ref (tree pointer
)
3158 return cp_build_indirect_ref_1 (pointer
, RO_NULL
, tf_warning_or_error
, true);
3161 /* Entry point used by indirection needs that correspond to some syntactic
3165 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
3166 tsubst_flags_t complain
)
3168 return cp_build_indirect_ref_1 (ptr
, errorstring
, complain
, false);
3171 /* This handles expressions of the form "a[i]", which denotes
3174 This is logically equivalent in C to *(a+i), but we may do it differently.
3175 If A is a variable or a member, we generate a primitive ARRAY_REF.
3176 This avoids forcing the array out of registers, and can work on
3177 arrays that are not lvalues (for example, members of structures returned
3180 If INDEX is of some user-defined type, it must be converted to
3181 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3182 will inherit the type of the array, which will be some pointer type.
3184 LOC is the location to use in building the array reference. */
3187 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3188 tsubst_flags_t complain
)
3194 if (complain
& tf_error
)
3195 error_at (loc
, "subscript missing in array reference");
3196 return error_mark_node
;
3199 if (TREE_TYPE (array
) == error_mark_node
3200 || TREE_TYPE (idx
) == error_mark_node
)
3201 return error_mark_node
;
3203 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3205 switch (TREE_CODE (array
))
3209 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3211 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3212 TREE_OPERAND (array
, 0), value
);
3213 SET_EXPR_LOCATION (ret
, loc
);
3218 ret
= build_conditional_expr
3219 (loc
, TREE_OPERAND (array
, 0),
3220 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3222 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3225 protected_set_expr_location (ret
, loc
);
3232 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3234 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3238 warn_array_subscript_with_type_char (loc
, idx
);
3240 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3242 if (complain
& tf_error
)
3243 error_at (loc
, "array subscript is not an integer");
3244 return error_mark_node
;
3247 /* Apply integral promotions *after* noticing character types.
3248 (It is unclear why we do these promotions -- the standard
3249 does not say that we should. In fact, the natural thing would
3250 seem to be to convert IDX to ptrdiff_t; we're performing
3251 pointer arithmetic.) */
3252 idx
= cp_perform_integral_promotions (idx
, complain
);
3254 /* An array that is indexed by a non-constant
3255 cannot be stored in a register; we must be able to do
3256 address arithmetic on its address.
3257 Likewise an array of elements of variable size. */
3258 if (TREE_CODE (idx
) != INTEGER_CST
3259 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3260 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3263 if (!cxx_mark_addressable (array
, true))
3264 return error_mark_node
;
3267 /* An array that is indexed by a constant value which is not within
3268 the array bounds cannot be stored in a register either; because we
3269 would get a crash in store_bit_field/extract_bit_field when trying
3270 to access a non-existent part of the register. */
3271 if (TREE_CODE (idx
) == INTEGER_CST
3272 && TYPE_DOMAIN (TREE_TYPE (array
))
3273 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3275 if (!cxx_mark_addressable (array
))
3276 return error_mark_node
;
3279 /* Note in C++ it is valid to subscript a `register' array, since
3280 it is valid to take the address of something with that
3281 storage specification. */
3285 while (TREE_CODE (foo
) == COMPONENT_REF
)
3286 foo
= TREE_OPERAND (foo
, 0);
3287 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3288 && (complain
& tf_warning
))
3289 warning_at (loc
, OPT_Wextra
,
3290 "subscripting array declared %<register%>");
3293 type
= TREE_TYPE (TREE_TYPE (array
));
3294 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3295 /* Array ref is const/volatile if the array elements are
3296 or if the array is.. */
3297 TREE_READONLY (rval
)
3298 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3299 TREE_SIDE_EFFECTS (rval
)
3300 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3301 TREE_THIS_VOLATILE (rval
)
3302 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3303 ret
= require_complete_type_sfinae (rval
, complain
);
3304 protected_set_expr_location (ret
, loc
);
3306 ret
= non_lvalue_loc (loc
, ret
);
3311 tree ar
= cp_default_conversion (array
, complain
);
3312 tree ind
= cp_default_conversion (idx
, complain
);
3314 /* Put the integer in IND to simplify error checking. */
3315 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3316 std::swap (ar
, ind
);
3318 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3319 return error_mark_node
;
3321 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3323 if (complain
& tf_error
)
3324 error_at (loc
, "subscripted value is neither array nor pointer");
3325 return error_mark_node
;
3327 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3329 if (complain
& tf_error
)
3330 error_at (loc
, "array subscript is not an integer");
3331 return error_mark_node
;
3334 warn_array_subscript_with_type_char (loc
, idx
);
3336 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3341 protected_set_expr_location (ret
, loc
);
3343 ret
= non_lvalue_loc (loc
, ret
);
3348 /* Entry point for Obj-C++. */
3351 build_array_ref (location_t loc
, tree array
, tree idx
)
3353 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3356 /* Resolve a pointer to member function. INSTANCE is the object
3357 instance to use, if the member points to a virtual member.
3359 This used to avoid checking for virtual functions if basetype
3360 has no virtual functions, according to an earlier ANSI draft.
3361 With the final ISO C++ rules, such an optimization is
3362 incorrect: A pointer to a derived member can be static_cast
3363 to pointer-to-base-member, as long as the dynamic object
3364 later has the right member. So now we only do this optimization
3365 when we know the dynamic type of the object. */
3368 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3369 tsubst_flags_t complain
)
3371 if (TREE_CODE (function
) == OFFSET_REF
)
3372 function
= TREE_OPERAND (function
, 1);
3374 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3376 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3378 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3379 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3381 tree instance_ptr
= *instance_ptrptr
;
3382 tree instance_save_expr
= 0;
3383 if (instance_ptr
== error_mark_node
)
3385 if (TREE_CODE (function
) == PTRMEM_CST
)
3387 /* Extracting the function address from a pmf is only
3388 allowed with -Wno-pmf-conversions. It only works for
3390 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3391 e1
= convert (fntype
, e1
);
3396 if (complain
& tf_error
)
3397 error ("object missing in use of %qE", function
);
3398 return error_mark_node
;
3402 /* True if we know that the dynamic type of the object doesn't have
3403 virtual functions, so we can assume the PFN field is a pointer. */
3404 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3405 && !TYPE_POLYMORPHIC_P (basetype
)
3406 && resolves_to_fixed_type_p (instance_ptr
, 0));
3408 /* If we don't really have an object (i.e. in an ill-formed
3409 conversion from PMF to pointer), we can't resolve virtual
3410 functions anyway. */
3411 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3414 if (TREE_SIDE_EFFECTS (instance_ptr
))
3415 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3417 if (TREE_SIDE_EFFECTS (function
))
3418 function
= save_expr (function
);
3420 /* Start by extracting all the information from the PMF itself. */
3421 e3
= pfn_from_ptrmemfunc (function
);
3422 delta
= delta_from_ptrmemfunc (function
);
3423 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3424 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3426 int flag_sanitize_save
;
3427 case ptrmemfunc_vbit_in_pfn
:
3428 e1
= cp_build_binary_op (input_location
,
3429 BIT_AND_EXPR
, idx
, integer_one_node
,
3431 idx
= cp_build_binary_op (input_location
,
3432 MINUS_EXPR
, idx
, integer_one_node
,
3434 if (idx
== error_mark_node
)
3435 return error_mark_node
;
3438 case ptrmemfunc_vbit_in_delta
:
3439 e1
= cp_build_binary_op (input_location
,
3440 BIT_AND_EXPR
, delta
, integer_one_node
,
3442 /* Don't instrument the RSHIFT_EXPR we're about to create because
3443 we're going to use DELTA number of times, and that wouldn't play
3444 well with SAVE_EXPRs therein. */
3445 flag_sanitize_save
= flag_sanitize
;
3447 delta
= cp_build_binary_op (input_location
,
3448 RSHIFT_EXPR
, delta
, integer_one_node
,
3450 flag_sanitize
= flag_sanitize_save
;
3451 if (delta
== error_mark_node
)
3452 return error_mark_node
;
3459 if (e1
== error_mark_node
)
3460 return error_mark_node
;
3462 /* Convert down to the right base before using the instance. A
3463 special case is that in a pointer to member of class C, C may
3464 be incomplete. In that case, the function will of course be
3465 a member of C, and no conversion is required. In fact,
3466 lookup_base will fail in that case, because incomplete
3467 classes do not have BINFOs. */
3468 if (!same_type_ignoring_top_level_qualifiers_p
3469 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3471 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3472 basetype
, ba_check
, NULL
, complain
);
3473 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3475 if (instance_ptr
== error_mark_node
)
3476 return error_mark_node
;
3478 /* ...and then the delta in the PMF. */
3479 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3481 /* Hand back the adjusted 'this' argument to our caller. */
3482 *instance_ptrptr
= instance_ptr
;
3485 /* Now just return the pointer. */
3488 /* Next extract the vtable pointer from the object. */
3489 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3491 vtbl
= cp_build_fold_indirect_ref (vtbl
);
3492 if (vtbl
== error_mark_node
)
3493 return error_mark_node
;
3495 /* Finally, extract the function pointer from the vtable. */
3496 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3497 e2
= cp_build_fold_indirect_ref (e2
);
3498 if (e2
== error_mark_node
)
3499 return error_mark_node
;
3500 TREE_CONSTANT (e2
) = 1;
3502 /* When using function descriptors, the address of the
3503 vtable entry is treated as a function pointer. */
3504 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3505 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3506 cp_build_addr_expr (e2
, complain
));
3508 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3509 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3510 if (e1
== error_mark_node
)
3511 return error_mark_node
;
3513 /* Make sure this doesn't get evaluated first inside one of the
3514 branches of the COND_EXPR. */
3515 if (instance_save_expr
)
3516 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3517 instance_save_expr
, e1
);
3524 /* Used by the C-common bits. */
3526 build_function_call (location_t
/*loc*/,
3527 tree function
, tree params
)
3529 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3532 /* Used by the C-common bits. */
3534 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3535 tree function
, vec
<tree
, va_gc
> *params
,
3536 vec
<tree
, va_gc
> * /*origtypes*/)
3538 vec
<tree
, va_gc
> *orig_params
= params
;
3539 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3540 tf_warning_or_error
);
3542 /* cp_build_function_call_vec can reallocate PARAMS by adding
3543 default arguments. That should never happen here. Verify
3545 gcc_assert (params
== orig_params
);
3550 /* Build a function call using a tree list of arguments. */
3553 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3555 vec
<tree
, va_gc
> *vec
;
3558 vec
= make_tree_vector ();
3559 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3560 vec_safe_push (vec
, TREE_VALUE (params
));
3561 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3562 release_tree_vector (vec
);
3566 /* Build a function call using varargs. */
3569 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3571 vec
<tree
, va_gc
> *vec
;
3575 vec
= make_tree_vector ();
3576 va_start (args
, complain
);
3577 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3578 vec_safe_push (vec
, t
);
3580 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3581 release_tree_vector (vec
);
3585 /* Build a function call using a vector of arguments. PARAMS may be
3586 NULL if there are no parameters. This changes the contents of
3590 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3591 tsubst_flags_t complain
)
3593 tree fntype
, fndecl
;
3595 tree original
= function
;
3599 vec
<tree
, va_gc
> *allocated
= NULL
;
3602 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3603 expressions, like those used for ObjC messenger dispatches. */
3604 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3605 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3607 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3608 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3609 if (TREE_CODE (function
) == NOP_EXPR
3610 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3611 function
= TREE_OPERAND (function
, 0);
3613 if (TREE_CODE (function
) == FUNCTION_DECL
)
3615 /* If the function is a non-template member function
3616 or a non-template friend, then we need to check the
3619 Note that if overload resolution failed with a single
3620 candidate this function will be used to explicitly diagnose
3621 the failure for the single call expression. The check is
3622 technically redundant since we also would have failed in
3623 add_function_candidate. */
3625 && (complain
& tf_error
)
3626 && !constraints_satisfied_p (function
))
3628 error ("cannot call function %qD", function
);
3629 location_t loc
= DECL_SOURCE_LOCATION (function
);
3630 diagnose_constraints (loc
, function
, NULL_TREE
);
3631 return error_mark_node
;
3634 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3635 return error_mark_node
;
3638 /* Convert anything with function type to a pointer-to-function. */
3639 if (DECL_MAIN_P (function
))
3641 if (complain
& tf_error
)
3642 pedwarn (input_location
, OPT_Wpedantic
,
3643 "ISO C++ forbids calling %<::main%> from within program");
3645 return error_mark_node
;
3647 function
= build_addr_func (function
, complain
);
3653 function
= build_addr_func (function
, complain
);
3656 if (function
== error_mark_node
)
3657 return error_mark_node
;
3659 fntype
= TREE_TYPE (function
);
3661 if (TYPE_PTRMEMFUNC_P (fntype
))
3663 if (complain
& tf_error
)
3664 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3665 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3666 original
, original
);
3667 return error_mark_node
;
3670 is_method
= (TYPE_PTR_P (fntype
)
3671 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3673 if (!(TYPE_PTRFN_P (fntype
)
3675 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3677 if (complain
& tf_error
)
3679 if (!flag_diagnostics_show_caret
)
3680 error_at (input_location
,
3681 "%qE cannot be used as a function", original
);
3682 else if (DECL_P (original
))
3683 error_at (input_location
,
3684 "%qD cannot be used as a function", original
);
3686 error_at (input_location
,
3687 "expression cannot be used as a function");
3690 return error_mark_node
;
3693 /* fntype now gets the type of function pointed to. */
3694 fntype
= TREE_TYPE (fntype
);
3695 parm_types
= TYPE_ARG_TYPES (fntype
);
3699 allocated
= make_tree_vector ();
3700 params
= &allocated
;
3703 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3706 return error_mark_node
;
3708 argarray
= (*params
)->address ();
3710 /* Check for errors in format strings and inappropriately
3712 bool warned_p
= check_function_arguments (input_location
, fndecl
, fntype
,
3713 nargs
, argarray
, NULL
);
3715 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3719 tree c
= extract_call_expr (ret
);
3720 if (TREE_CODE (c
) == CALL_EXPR
)
3721 TREE_NO_WARNING (c
) = 1;
3724 if (allocated
!= NULL
)
3725 release_tree_vector (allocated
);
3730 /* Subroutine of convert_arguments.
3731 Print an error message about a wrong number of arguments. */
3734 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3738 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3740 if (DECL_NAME (fndecl
) == NULL_TREE
3741 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3744 ? G_("too many arguments to constructor %q#D")
3745 : G_("too few arguments to constructor %q#D"),
3750 ? G_("too many arguments to member function %q#D")
3751 : G_("too few arguments to member function %q#D"),
3757 ? G_("too many arguments to function %q#D")
3758 : G_("too few arguments to function %q#D"),
3760 if (!DECL_IS_BUILTIN (fndecl
))
3761 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3765 if (c_dialect_objc () && objc_message_selector ())
3768 ? G_("too many arguments to method %q#D")
3769 : G_("too few arguments to method %q#D"),
3770 objc_message_selector ());
3772 error_at (loc
, too_many_p
? G_("too many arguments to function")
3773 : G_("too few arguments to function"));
3777 /* Convert the actual parameter expressions in the list VALUES to the
3778 types in the list TYPELIST. The converted expressions are stored
3779 back in the VALUES vector.
3780 If parmdecls is exhausted, or when an element has NULL as its type,
3781 perform the default conversions.
3783 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3785 This is also where warnings about wrong number of args are generated.
3787 Returns the actual number of arguments processed (which might be less
3788 than the length of the vector), or -1 on error.
3790 In C++, unspecified trailing parameters can be filled in with their
3791 default arguments, if such were specified. Do so here. */
3794 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3795 int flags
, tsubst_flags_t complain
)
3800 /* Argument passing is always copy-initialization. */
3801 flags
|= LOOKUP_ONLYCONVERTING
;
3803 for (i
= 0, typetail
= typelist
;
3804 i
< vec_safe_length (*values
);
3807 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3808 tree val
= (**values
)[i
];
3810 if (val
== error_mark_node
|| type
== error_mark_node
)
3813 if (type
== void_type_node
)
3815 if (complain
& tf_error
)
3817 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3824 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3825 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3826 if (TREE_CODE (val
) == NOP_EXPR
3827 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3828 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3829 val
= TREE_OPERAND (val
, 0);
3831 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3833 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3834 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3835 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3836 val
= decay_conversion (val
, complain
);
3839 if (val
== error_mark_node
)
3844 /* Formal parm type is specified by a function prototype. */
3847 if (!COMPLETE_TYPE_P (complete_type (type
)))
3849 if (complain
& tf_error
)
3852 error ("parameter %P of %qD has incomplete type %qT",
3855 error ("parameter %P has incomplete type %qT", i
, type
);
3857 parmval
= error_mark_node
;
3861 parmval
= convert_for_initialization
3862 (NULL_TREE
, type
, val
, flags
,
3863 ICR_ARGPASS
, fndecl
, i
, complain
);
3864 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3867 if (parmval
== error_mark_node
)
3870 (**values
)[i
] = parmval
;
3874 if (fndecl
&& magic_varargs_p (fndecl
))
3875 /* Don't do ellipsis conversion for __built_in_constant_p
3876 as this will result in spurious errors for non-trivial
3878 val
= require_complete_type_sfinae (val
, complain
);
3880 val
= convert_arg_to_ellipsis (val
, complain
);
3882 (**values
)[i
] = val
;
3886 typetail
= TREE_CHAIN (typetail
);
3889 if (typetail
!= 0 && typetail
!= void_list_node
)
3891 /* See if there are default arguments that can be used. Because
3892 we hold default arguments in the FUNCTION_TYPE (which is so
3893 wrong), we can see default parameters here from deduced
3894 contexts (and via typeof) for indirect function calls.
3895 Fortunately we know whether we have a function decl to
3896 provide default arguments in a language conformant
3898 if (fndecl
&& TREE_PURPOSE (typetail
)
3899 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3901 for (; typetail
!= void_list_node
; ++i
)
3903 /* After DR777, with explicit template args we can end up with a
3904 default argument followed by no default argument. */
3905 if (!TREE_PURPOSE (typetail
))
3908 = convert_default_arg (TREE_VALUE (typetail
),
3909 TREE_PURPOSE (typetail
),
3910 fndecl
, i
, complain
);
3912 if (parmval
== error_mark_node
)
3915 vec_safe_push (*values
, parmval
);
3916 typetail
= TREE_CHAIN (typetail
);
3917 /* ends with `...'. */
3918 if (typetail
== NULL_TREE
)
3923 if (typetail
&& typetail
!= void_list_node
)
3925 if (complain
& tf_error
)
3926 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3934 /* Build a binary-operation expression, after performing default
3935 conversions on the operands. CODE is the kind of expression to
3936 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3937 are the tree codes which correspond to ARG1 and ARG2 when issuing
3938 warnings about possibly misplaced parentheses. They may differ
3939 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3940 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3941 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3942 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3943 ARG2_CODE as ERROR_MARK. */
3946 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
3947 enum tree_code arg1_code
, tree arg2
,
3948 enum tree_code arg2_code
, tree
*overload_p
,
3949 tsubst_flags_t complain
)
3954 tree overload
= NULL_TREE
;
3959 if (processing_template_decl
)
3961 if (type_dependent_expression_p (arg1
)
3962 || type_dependent_expression_p (arg2
))
3963 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
3964 arg1
= build_non_dependent_expr (arg1
);
3965 arg2
= build_non_dependent_expr (arg2
);
3968 if (code
== DOTSTAR_EXPR
)
3969 expr
= build_m_component_ref (arg1
, arg2
, complain
);
3971 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3972 &overload
, complain
);
3974 if (overload_p
!= NULL
)
3975 *overload_p
= overload
;
3977 /* Check for cases such as x+y<<z which users are likely to
3978 misinterpret. But don't warn about obj << x + y, since that is a
3979 common idiom for I/O. */
3980 if (warn_parentheses
3981 && (complain
& tf_warning
)
3982 && !processing_template_decl
3983 && !error_operand_p (arg1
)
3984 && !error_operand_p (arg2
)
3985 && (code
!= LSHIFT_EXPR
3986 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3987 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
3988 arg2_code
, orig_arg2
);
3990 if (processing_template_decl
&& expr
!= error_mark_node
)
3992 if (overload
!= NULL_TREE
)
3993 return (build_min_non_dep_op_overload
3994 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
3996 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
4002 /* Build and return an ARRAY_REF expression. */
4005 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
4006 tsubst_flags_t complain
)
4008 tree orig_arg1
= arg1
;
4009 tree orig_arg2
= arg2
;
4011 tree overload
= NULL_TREE
;
4013 if (processing_template_decl
)
4015 if (type_dependent_expression_p (arg1
)
4016 || type_dependent_expression_p (arg2
))
4017 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
4018 NULL_TREE
, NULL_TREE
);
4019 arg1
= build_non_dependent_expr (arg1
);
4020 arg2
= build_non_dependent_expr (arg2
);
4023 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
4024 NULL_TREE
, &overload
, complain
);
4026 if (processing_template_decl
&& expr
!= error_mark_node
)
4028 if (overload
!= NULL_TREE
)
4029 return (build_min_non_dep_op_overload
4030 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
4032 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
4033 NULL_TREE
, NULL_TREE
);
4038 /* Return whether OP is an expression of enum type cast to integer
4039 type. In C++ even unsigned enum types are cast to signed integer
4040 types. We do not want to issue warnings about comparisons between
4041 signed and unsigned types when one of the types is an enum type.
4042 Those warnings are always false positives in practice. */
4045 enum_cast_to_int (tree op
)
4047 if (CONVERT_EXPR_P (op
)
4048 && TREE_TYPE (op
) == integer_type_node
4049 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
4050 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
4053 /* The cast may have been pushed into a COND_EXPR. */
4054 if (TREE_CODE (op
) == COND_EXPR
)
4055 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
4056 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
4061 /* For the c-common bits. */
4063 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
4066 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
4069 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4070 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4073 build_vec_cmp (tree_code code
, tree type
,
4074 tree arg0
, tree arg1
)
4076 tree zero_vec
= build_zero_cst (type
);
4077 tree minus_one_vec
= build_minus_one_cst (type
);
4078 tree cmp_type
= build_same_sized_truth_vector_type(type
);
4079 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4080 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4083 /* Possibly warn about an address never being NULL. */
4086 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4089 || (complain
& tf_warning
) == 0
4090 || c_inhibit_evaluation_warnings
!= 0
4091 || TREE_NO_WARNING (op
))
4094 tree cop
= fold_non_dependent_expr (op
);
4096 if (TREE_CODE (cop
) == ADDR_EXPR
4097 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4098 && !TREE_NO_WARNING (cop
))
4099 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4100 "be NULL", TREE_OPERAND (cop
, 0));
4102 if (CONVERT_EXPR_P (op
)
4103 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == REFERENCE_TYPE
)
4106 STRIP_NOPS (inner_op
);
4108 if (DECL_P (inner_op
))
4109 warning_at (location
, OPT_Waddress
,
4110 "the compiler can assume that the address of "
4111 "%qD will never be NULL", inner_op
);
4115 /* Build a binary-operation expression without default conversions.
4116 CODE is the kind of expression to build.
4117 LOCATION is the location_t of the operator in the source code.
4118 This function differs from `build' in several ways:
4119 the data type of the result is computed and recorded in it,
4120 warnings are generated if arg data types are invalid,
4121 special handling for addition and subtraction of pointers is known,
4122 and some optimization is done (operations on narrow ints
4123 are done in the narrower type when that gives the same result).
4124 Constant folding is also done before the result is returned.
4126 Note that the operands will never have enumeral types
4127 because either they have just had the default conversions performed
4128 or they have both just been converted to some other type in which
4129 the arithmetic is to be done.
4131 C++: must do special pointer arithmetic when implementing
4132 multiple inheritance, and deal with pointer to member functions. */
4135 cp_build_binary_op (location_t location
,
4136 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4137 tsubst_flags_t complain
)
4140 enum tree_code code0
, code1
;
4142 const char *invalid_op_diag
;
4144 /* Expression code to give to the expression when it is built.
4145 Normally this is CODE, which is what the caller asked for,
4146 but in some special cases we change it. */
4147 enum tree_code resultcode
= code
;
4149 /* Data type in which the computation is to be performed.
4150 In the simplest cases this is the common type of the arguments. */
4151 tree result_type
= NULL_TREE
;
4153 /* Nonzero means operands have already been type-converted
4154 in whatever way is necessary.
4155 Zero means they need to be converted to RESULT_TYPE. */
4158 /* Nonzero means create the expression with this type, rather than
4160 tree build_type
= 0;
4162 /* Nonzero means after finally constructing the expression
4163 convert it to this type. */
4164 tree final_type
= 0;
4166 tree result
, result_ovl
;
4168 /* Nonzero if this is an operation like MIN or MAX which can
4169 safely be computed in short if both args are promoted shorts.
4170 Also implies COMMON.
4171 -1 indicates a bitwise operation; this makes a difference
4172 in the exact conditions for when it is safe to do the operation
4173 in a narrower mode. */
4176 /* Nonzero if this is a comparison operation;
4177 if both args are promoted shorts, compare the original shorts.
4178 Also implies COMMON. */
4179 int short_compare
= 0;
4181 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4184 /* True if both operands have arithmetic type. */
4185 bool arithmetic_types_p
;
4187 /* Apply default conversions. */
4191 /* Remember whether we're doing / or %. */
4192 bool doing_div_or_mod
= false;
4194 /* Remember whether we're doing << or >>. */
4195 bool doing_shift
= false;
4197 /* Tree holding instrumentation expression. */
4198 tree instrument_expr
= NULL_TREE
;
4200 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4201 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4202 || code
== TRUTH_XOR_EXPR
)
4204 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4205 op0
= decay_conversion (op0
, complain
);
4206 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4207 op1
= decay_conversion (op1
, complain
);
4211 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4212 op0
= cp_default_conversion (op0
, complain
);
4213 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4214 op1
= cp_default_conversion (op1
, complain
);
4217 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4218 STRIP_TYPE_NOPS (op0
);
4219 STRIP_TYPE_NOPS (op1
);
4221 /* DTRT if one side is an overloaded function, but complain about it. */
4222 if (type_unknown_p (op0
))
4224 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4225 if (t
!= error_mark_node
)
4227 if (complain
& tf_error
)
4228 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4233 if (type_unknown_p (op1
))
4235 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4236 if (t
!= error_mark_node
)
4238 if (complain
& tf_error
)
4239 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4245 type0
= TREE_TYPE (op0
);
4246 type1
= TREE_TYPE (op1
);
4248 /* The expression codes of the data types of the arguments tell us
4249 whether the arguments are integers, floating, pointers, etc. */
4250 code0
= TREE_CODE (type0
);
4251 code1
= TREE_CODE (type1
);
4253 /* If an error was already reported for one of the arguments,
4254 avoid reporting another error. */
4255 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4256 return error_mark_node
;
4258 if ((invalid_op_diag
4259 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4261 if (complain
& tf_error
)
4262 error (invalid_op_diag
);
4263 return error_mark_node
;
4266 /* Issue warnings about peculiar, but valid, uses of NULL. */
4267 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
4268 /* It's reasonable to use pointer values as operands of &&
4269 and ||, so NULL is no exception. */
4270 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4271 && ( /* Both are NULL (or 0) and the operation was not a
4272 comparison or a pointer subtraction. */
4273 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4274 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4275 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4276 || (!null_ptr_cst_p (orig_op0
)
4277 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4278 || (!null_ptr_cst_p (orig_op1
)
4279 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4280 && (complain
& tf_warning
))
4282 source_location loc
=
4283 expansion_point_location_if_in_system_header (input_location
);
4285 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4288 /* In case when one of the operands of the binary operation is
4289 a vector and another is a scalar -- convert scalar to vector. */
4290 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4292 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4293 complain
& tf_error
);
4295 switch (convert_flag
)
4298 return error_mark_node
;
4301 op0
= convert (TREE_TYPE (type1
), op0
);
4302 op0
= save_expr (op0
);
4303 op0
= build_vector_from_val (type1
, op0
);
4304 type0
= TREE_TYPE (op0
);
4305 code0
= TREE_CODE (type0
);
4311 op1
= convert (TREE_TYPE (type0
), op1
);
4312 op1
= save_expr (op1
);
4313 op1
= build_vector_from_val (type0
, op1
);
4314 type1
= TREE_TYPE (op1
);
4315 code1
= TREE_CODE (type1
);
4327 /* Subtraction of two similar pointers.
4328 We must subtract them as integers, then divide by object size. */
4329 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4330 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4333 result
= pointer_diff (location
, op0
, op1
,
4334 common_pointer_type (type0
, type1
), complain
,
4336 if (instrument_expr
!= NULL
)
4337 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
4338 instrument_expr
, result
);
4342 /* In all other cases except pointer - int, the usual arithmetic
4344 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4349 /* The pointer - int case is just like pointer + int; fall
4353 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4354 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4358 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4359 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4360 if (processing_template_decl
)
4362 result_type
= TREE_TYPE (ptr_operand
);
4365 return cp_pointer_int_sum (location
, code
,
4377 case TRUNC_DIV_EXPR
:
4379 case FLOOR_DIV_EXPR
:
4380 case ROUND_DIV_EXPR
:
4381 case EXACT_DIV_EXPR
:
4382 if (TREE_CODE (op0
) == SIZEOF_EXPR
&& TREE_CODE (op1
) == SIZEOF_EXPR
)
4384 tree type0
= TREE_OPERAND (op0
, 0);
4385 tree type1
= TREE_OPERAND (op1
, 0);
4386 tree first_arg
= type0
;
4387 if (!TYPE_P (type0
))
4388 type0
= TREE_TYPE (type0
);
4389 if (!TYPE_P (type1
))
4390 type1
= TREE_TYPE (type1
);
4391 if (POINTER_TYPE_P (type0
) && same_type_p (TREE_TYPE (type0
), type1
)
4392 && !(TREE_CODE (first_arg
) == PARM_DECL
4393 && DECL_ARRAY_PARAMETER_P (first_arg
)
4394 && warn_sizeof_array_argument
)
4395 && (complain
& tf_warning
))
4396 if (warning_at (location
, OPT_Wsizeof_pointer_div
,
4397 "division %<sizeof (%T) / sizeof (%T)%> does "
4398 "not compute the number of array elements",
4400 if (DECL_P (first_arg
))
4401 inform (DECL_SOURCE_LOCATION (first_arg
),
4402 "first %<sizeof%> operand was declared here");
4405 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4406 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4407 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4408 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4410 enum tree_code tcode0
= code0
, tcode1
= code1
;
4411 tree cop1
= fold_non_dependent_expr (op1
);
4412 doing_div_or_mod
= true;
4413 warn_for_div_by_zero (location
, cop1
);
4415 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4416 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4417 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4418 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4420 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4421 resultcode
= RDIV_EXPR
;
4423 /* When dividing two signed integers, we have to promote to int.
4424 unless we divide by a constant != -1. Note that default
4425 conversion will have been performed on the operands at this
4426 point, so we have to dig out the original type to find out if
4428 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4429 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4430 || (TREE_CODE (op1
) == INTEGER_CST
4431 && ! integer_all_onesp (op1
)));
4440 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4441 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4442 && !VECTOR_FLOAT_TYPE_P (type0
)
4443 && !VECTOR_FLOAT_TYPE_P (type1
)))
4447 case TRUNC_MOD_EXPR
:
4448 case FLOOR_MOD_EXPR
:
4450 tree cop1
= fold_non_dependent_expr (op1
);
4451 doing_div_or_mod
= true;
4452 warn_for_div_by_zero (location
, cop1
);
4455 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4456 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4457 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4459 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4461 /* Although it would be tempting to shorten always here, that loses
4462 on some targets, since the modulo instruction is undefined if the
4463 quotient can't be represented in the computation mode. We shorten
4464 only if unsigned or if dividing by something we know != -1. */
4465 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4466 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4467 || (TREE_CODE (op1
) == INTEGER_CST
4468 && ! integer_all_onesp (op1
)));
4473 case TRUTH_ANDIF_EXPR
:
4474 case TRUTH_ORIF_EXPR
:
4475 case TRUTH_AND_EXPR
:
4477 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4479 if (!COMPARISON_CLASS_P (op1
))
4480 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4481 build_zero_cst (type1
), complain
);
4482 if (code
== TRUTH_ANDIF_EXPR
)
4484 tree z
= build_zero_cst (TREE_TYPE (op1
));
4485 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4487 else if (code
== TRUTH_ORIF_EXPR
)
4489 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4490 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4495 if (VECTOR_TYPE_P (type0
))
4497 if (!COMPARISON_CLASS_P (op0
))
4498 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4499 build_zero_cst (type0
), complain
);
4500 if (!VECTOR_TYPE_P (type1
))
4502 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4503 tree z
= build_zero_cst (TREE_TYPE (op0
));
4504 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4506 else if (!COMPARISON_CLASS_P (op1
))
4507 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4508 build_zero_cst (type1
), complain
);
4510 if (code
== TRUTH_ANDIF_EXPR
)
4511 code
= BIT_AND_EXPR
;
4512 else if (code
== TRUTH_ORIF_EXPR
)
4513 code
= BIT_IOR_EXPR
;
4517 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4520 result_type
= boolean_type_node
;
4523 /* Shift operations: result has same type as first operand;
4524 always convert second operand to int.
4525 Also set SHORT_SHIFT if shifting rightward. */
4528 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4529 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4531 result_type
= type0
;
4534 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4535 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4536 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4537 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4539 result_type
= type0
;
4542 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4544 tree const_op1
= fold_non_dependent_expr (op1
);
4545 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4547 result_type
= type0
;
4549 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4551 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4553 if ((complain
& tf_warning
)
4554 && c_inhibit_evaluation_warnings
== 0)
4555 warning (OPT_Wshift_count_negative
,
4556 "right shift count is negative");
4560 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4561 && (complain
& tf_warning
)
4562 && c_inhibit_evaluation_warnings
== 0)
4563 warning (OPT_Wshift_count_overflow
,
4564 "right shift count >= width of type");
4567 /* Avoid converting op1 to result_type later. */
4573 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4574 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4576 result_type
= type0
;
4579 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4580 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4581 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4582 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4584 result_type
= type0
;
4587 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4589 tree const_op0
= fold_non_dependent_expr (op0
);
4590 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4592 tree const_op1
= fold_non_dependent_expr (op1
);
4593 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4595 result_type
= type0
;
4597 if (TREE_CODE (const_op0
) == INTEGER_CST
4598 && tree_int_cst_sgn (const_op0
) < 0
4599 && (complain
& tf_warning
)
4600 && c_inhibit_evaluation_warnings
== 0)
4601 warning (OPT_Wshift_negative_value
,
4602 "left shift of negative value");
4603 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4605 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4607 if ((complain
& tf_warning
)
4608 && c_inhibit_evaluation_warnings
== 0)
4609 warning (OPT_Wshift_count_negative
,
4610 "left shift count is negative");
4612 else if (compare_tree_int (const_op1
,
4613 TYPE_PRECISION (type0
)) >= 0)
4615 if ((complain
& tf_warning
)
4616 && c_inhibit_evaluation_warnings
== 0)
4617 warning (OPT_Wshift_count_overflow
,
4618 "left shift count >= width of type");
4620 else if (TREE_CODE (const_op0
) == INTEGER_CST
4621 && (complain
& tf_warning
))
4622 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4624 /* Avoid converting op1 to result_type later. */
4631 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4633 result_type
= type0
;
4634 if (TREE_CODE (op1
) == INTEGER_CST
)
4636 if (tree_int_cst_lt (op1
, integer_zero_node
))
4638 if (complain
& tf_warning
)
4639 warning (0, (code
== LROTATE_EXPR
)
4640 ? G_("left rotate count is negative")
4641 : G_("right rotate count is negative"));
4643 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4645 if (complain
& tf_warning
)
4646 warning (0, (code
== LROTATE_EXPR
)
4647 ? G_("left rotate count >= width of type")
4648 : G_("right rotate count >= width of type"));
4651 /* Convert the shift-count to an integer, regardless of
4652 size of value being shifted. */
4653 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4654 op1
= cp_convert (integer_type_node
, op1
, complain
);
4660 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4661 goto vector_compare
;
4662 if ((complain
& tf_warning
)
4663 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4664 warning (OPT_Wfloat_equal
,
4665 "comparing floating point with == or != is unsafe");
4666 if ((complain
& tf_warning
)
4667 && ((TREE_CODE (orig_op0
) == STRING_CST
4668 && !integer_zerop (cp_fully_fold (op1
)))
4669 || (TREE_CODE (orig_op1
) == STRING_CST
4670 && !integer_zerop (cp_fully_fold (op0
)))))
4671 warning (OPT_Waddress
, "comparison with string literal results "
4672 "in unspecified behavior");
4674 build_type
= boolean_type_node
;
4675 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4676 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4677 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4678 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4680 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4681 && null_ptr_cst_p (orig_op1
))
4682 /* Handle, eg, (void*)0 (c++/43906), and more. */
4683 || (code0
== POINTER_TYPE
4684 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4686 if (TYPE_PTR_P (type1
))
4687 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4688 CPO_COMPARISON
, complain
);
4690 result_type
= type0
;
4692 if (char_type_p (TREE_TYPE (orig_op1
))
4693 && warning (OPT_Wpointer_compare
,
4694 "comparison between pointer and zero character "
4696 inform (input_location
,
4697 "did you mean to dereference the pointer?");
4698 warn_for_null_address (location
, op0
, complain
);
4700 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4701 && null_ptr_cst_p (orig_op0
))
4702 /* Handle, eg, (void*)0 (c++/43906), and more. */
4703 || (code1
== POINTER_TYPE
4704 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4706 if (TYPE_PTR_P (type0
))
4707 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4708 CPO_COMPARISON
, complain
);
4710 result_type
= type1
;
4712 if (char_type_p (TREE_TYPE (orig_op0
))
4713 && warning (OPT_Wpointer_compare
,
4714 "comparison between pointer and zero character "
4716 inform (input_location
,
4717 "did you mean to dereference the pointer?");
4718 warn_for_null_address (location
, op1
, complain
);
4720 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4721 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4722 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4723 CPO_COMPARISON
, complain
);
4724 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
4725 /* One of the operands must be of nullptr_t type. */
4726 result_type
= TREE_TYPE (nullptr_node
);
4727 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4729 result_type
= type0
;
4730 if (complain
& tf_error
)
4731 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4733 return error_mark_node
;
4735 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4737 result_type
= type1
;
4738 if (complain
& tf_error
)
4739 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4741 return error_mark_node
;
4743 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (orig_op1
))
4745 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4746 == ptrmemfunc_vbit_in_delta
)
4748 tree pfn0
, delta0
, e1
, e2
;
4750 if (TREE_SIDE_EFFECTS (op0
))
4751 op0
= save_expr (op0
);
4753 pfn0
= pfn_from_ptrmemfunc (op0
);
4754 delta0
= delta_from_ptrmemfunc (op0
);
4755 e1
= cp_build_binary_op (location
,
4758 build_zero_cst (TREE_TYPE (pfn0
)),
4760 e2
= cp_build_binary_op (location
,
4766 if (complain
& tf_warning
)
4767 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4769 e2
= cp_build_binary_op (location
,
4770 EQ_EXPR
, e2
, integer_zero_node
,
4772 op0
= cp_build_binary_op (location
,
4773 TRUTH_ANDIF_EXPR
, e1
, e2
,
4775 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4779 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4780 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4782 result_type
= TREE_TYPE (op0
);
4784 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (orig_op0
))
4785 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4786 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4789 /* E will be the final comparison. */
4791 /* E1 and E2 are for scratch. */
4799 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4800 CPO_COMPARISON
, complain
);
4802 if (!same_type_p (TREE_TYPE (op0
), type
))
4803 op0
= cp_convert_and_check (type
, op0
, complain
);
4804 if (!same_type_p (TREE_TYPE (op1
), type
))
4805 op1
= cp_convert_and_check (type
, op1
, complain
);
4807 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4808 return error_mark_node
;
4810 if (TREE_SIDE_EFFECTS (op0
))
4811 op0
= save_expr (op0
);
4812 if (TREE_SIDE_EFFECTS (op1
))
4813 op1
= save_expr (op1
);
4815 pfn0
= pfn_from_ptrmemfunc (op0
);
4816 pfn0
= cp_fully_fold (pfn0
);
4817 /* Avoid -Waddress warnings (c++/64877). */
4818 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4819 TREE_NO_WARNING (pfn0
) = 1;
4820 pfn1
= pfn_from_ptrmemfunc (op1
);
4821 pfn1
= cp_fully_fold (pfn1
);
4822 delta0
= delta_from_ptrmemfunc (op0
);
4823 delta1
= delta_from_ptrmemfunc (op1
);
4824 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4825 == ptrmemfunc_vbit_in_delta
)
4830 && ((op0.delta == op1.delta)
4831 || (!op0.pfn && op0.delta & 1 == 0
4832 && op1.delta & 1 == 0))
4834 The reason for the `!op0.pfn' bit is that a NULL
4835 pointer-to-member is any member with a zero PFN and
4836 LSB of the DELTA field is 0. */
4838 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4842 e1
= cp_build_binary_op (location
,
4843 EQ_EXPR
, e1
, integer_zero_node
,
4845 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4849 e2
= cp_build_binary_op (location
,
4850 EQ_EXPR
, e2
, integer_zero_node
,
4852 e1
= cp_build_binary_op (location
,
4853 TRUTH_ANDIF_EXPR
, e2
, e1
,
4855 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4857 build_zero_cst (TREE_TYPE (pfn0
)),
4859 e2
= cp_build_binary_op (location
,
4860 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4861 e1
= cp_build_binary_op (location
,
4862 EQ_EXPR
, delta0
, delta1
, complain
);
4863 e1
= cp_build_binary_op (location
,
4864 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4871 && (!op0.pfn || op0.delta == op1.delta))
4873 The reason for the `!op0.pfn' bit is that a NULL
4874 pointer-to-member is any member with a zero PFN; the
4875 DELTA field is unspecified. */
4877 e1
= cp_build_binary_op (location
,
4878 EQ_EXPR
, delta0
, delta1
, complain
);
4879 e2
= cp_build_binary_op (location
,
4882 build_zero_cst (TREE_TYPE (pfn0
)),
4884 e1
= cp_build_binary_op (location
,
4885 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4887 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4888 e
= cp_build_binary_op (location
,
4889 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4890 if (code
== EQ_EXPR
)
4892 return cp_build_binary_op (location
,
4893 EQ_EXPR
, e
, integer_zero_node
, complain
);
4897 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4898 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4900 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4901 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4909 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4910 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4912 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4913 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4914 CPO_COMPARISON
, complain
);
4921 if (TREE_CODE (orig_op0
) == STRING_CST
4922 || TREE_CODE (orig_op1
) == STRING_CST
)
4924 if (complain
& tf_warning
)
4925 warning (OPT_Waddress
, "comparison with string literal results "
4926 "in unspecified behavior");
4929 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4933 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4935 && !vector_types_compatible_elements_p (type0
, type1
))
4937 if (complain
& tf_error
)
4939 error_at (location
, "comparing vectors with different "
4941 inform (location
, "operand types are %qT and %qT",
4944 return error_mark_node
;
4947 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
4949 if (complain
& tf_error
)
4951 error_at (location
, "comparing vectors with different "
4952 "number of elements");
4953 inform (location
, "operand types are %qT and %qT",
4956 return error_mark_node
;
4959 /* It's not precisely specified how the usual arithmetic
4960 conversions apply to the vector types. Here, we use
4961 the unsigned type if one of the operands is signed and
4962 the other one is unsigned. */
4963 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
4965 if (!TYPE_UNSIGNED (type0
))
4966 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
4968 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
4969 warning_at (location
, OPT_Wsign_compare
, "comparison between "
4970 "types %qT and %qT", type0
, type1
);
4973 /* Always construct signed integer vector type. */
4974 intt
= c_common_type_for_size
4975 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (type0
))), 0);
4978 if (complain
& tf_error
)
4979 error_at (location
, "could not find an integer type "
4980 "of the same size as %qT", TREE_TYPE (type0
));
4981 return error_mark_node
;
4983 result_type
= build_opaque_vector_type (intt
,
4984 TYPE_VECTOR_SUBPARTS (type0
));
4986 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
4988 build_type
= boolean_type_node
;
4989 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4990 || code0
== ENUMERAL_TYPE
)
4991 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4992 || code1
== ENUMERAL_TYPE
))
4994 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4995 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4996 CPO_COMPARISON
, complain
);
4997 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (orig_op1
))
4999 result_type
= type0
;
5000 if (extra_warnings
&& (complain
& tf_warning
))
5001 warning (OPT_Wextra
,
5002 "ordered comparison of pointer with integer zero");
5004 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (orig_op0
))
5006 result_type
= type1
;
5007 if (extra_warnings
&& (complain
& tf_warning
))
5008 warning (OPT_Wextra
,
5009 "ordered comparison of pointer with integer zero");
5011 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
5012 /* One of the operands must be of nullptr_t type. */
5013 result_type
= TREE_TYPE (nullptr_node
);
5014 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5016 result_type
= type0
;
5017 if (complain
& tf_error
)
5018 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5020 return error_mark_node
;
5022 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
5024 result_type
= type1
;
5025 if (complain
& tf_error
)
5026 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5028 return error_mark_node
;
5031 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
5032 && sanitize_flags_p (SANITIZE_POINTER_COMPARE
))
5034 op0
= save_expr (op0
);
5035 op1
= save_expr (op1
);
5037 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_COMPARE
);
5038 instrument_expr
= build_call_expr_loc (location
, tt
, 2, op0
, op1
);
5043 case UNORDERED_EXPR
:
5050 build_type
= integer_type_node
;
5051 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
5053 if (complain
& tf_error
)
5054 error ("unordered comparison on non-floating point argument");
5055 return error_mark_node
;
5064 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
5065 || code0
== ENUMERAL_TYPE
)
5066 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5067 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
5068 arithmetic_types_p
= 1;
5071 arithmetic_types_p
= 0;
5072 /* Vector arithmetic is only allowed when both sides are vectors. */
5073 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
5075 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
5076 || !vector_types_compatible_elements_p (type0
, type1
))
5078 if (complain
& tf_error
)
5080 /* "location" already embeds the locations of the
5081 operands, so we don't need to add them separately
5083 rich_location
richloc (line_table
, location
);
5084 binary_op_error (&richloc
, code
, type0
, type1
);
5086 return error_mark_node
;
5088 arithmetic_types_p
= 1;
5091 /* Determine the RESULT_TYPE, if it is not already known. */
5093 && arithmetic_types_p
5094 && (shorten
|| common
|| short_compare
))
5096 result_type
= cp_common_type (type0
, type1
);
5097 if (complain
& tf_warning
)
5098 do_warn_double_promotion (result_type
, type0
, type1
,
5099 "implicit conversion from %qH to %qI "
5100 "to match other operand of binary "
5107 if (complain
& tf_error
)
5109 "invalid operands of types %qT and %qT to binary %qO",
5110 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
5111 return error_mark_node
;
5114 /* If we're in a template, the only thing we need to know is the
5116 if (processing_template_decl
)
5118 /* Since the middle-end checks the type when doing a build2, we
5119 need to build the tree in pieces. This built tree will never
5120 get out of the front-end as we replace it when instantiating
5122 tree tmp
= build2 (resultcode
,
5123 build_type
? build_type
: result_type
,
5125 TREE_OPERAND (tmp
, 0) = op0
;
5129 /* Remember the original type; RESULT_TYPE might be changed later on
5130 by shorten_binary_op. */
5131 tree orig_type
= result_type
;
5133 if (arithmetic_types_p
)
5135 bool first_complex
= (code0
== COMPLEX_TYPE
);
5136 bool second_complex
= (code1
== COMPLEX_TYPE
);
5137 int none_complex
= (!first_complex
&& !second_complex
);
5139 /* Adapted from patch for c/24581. */
5140 if (first_complex
!= second_complex
5141 && (code
== PLUS_EXPR
5142 || code
== MINUS_EXPR
5143 || code
== MULT_EXPR
5144 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5145 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5146 && flag_signed_zeros
)
5148 /* An operation on mixed real/complex operands must be
5149 handled specially, but the language-independent code can
5150 more easily optimize the plain complex arithmetic if
5151 -fno-signed-zeros. */
5152 tree real_type
= TREE_TYPE (result_type
);
5156 if (TREE_TYPE (op0
) != result_type
)
5157 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5158 if (TREE_TYPE (op1
) != real_type
)
5159 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5163 if (TREE_TYPE (op0
) != real_type
)
5164 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5165 if (TREE_TYPE (op1
) != result_type
)
5166 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5168 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5169 return error_mark_node
;
5172 op0
= save_expr (op0
);
5173 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
5174 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
5178 case TRUNC_DIV_EXPR
:
5179 op1
= save_expr (op1
);
5180 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5184 real
= build2 (resultcode
, real_type
, real
, op1
);
5192 op1
= save_expr (op1
);
5193 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
5194 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
5198 op0
= save_expr (op0
);
5199 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5202 real
= build2 (resultcode
, real_type
, op0
, real
);
5205 real
= build2 (resultcode
, real_type
, op0
, real
);
5206 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5212 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5216 /* For certain operations (which identify themselves by shorten != 0)
5217 if both args were extended from the same smaller type,
5218 do the arithmetic in that type and then extend.
5220 shorten !=0 and !=1 indicates a bitwise operation.
5221 For them, this optimization is safe only if
5222 both args are zero-extended or both are sign-extended.
5223 Otherwise, we might change the result.
5224 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5225 but calculated in (unsigned short) it would be (unsigned short)-1. */
5227 if (shorten
&& none_complex
)
5229 final_type
= result_type
;
5230 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5234 /* Comparison operations are shortened too but differently.
5235 They identify themselves by setting short_compare = 1. */
5239 /* We call shorten_compare only for diagnostic-reason. */
5240 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5241 xresult_type
= result_type
;
5242 enum tree_code xresultcode
= resultcode
;
5243 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5247 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5248 && warn_sign_compare
5249 /* Do not warn until the template is instantiated; we cannot
5250 bound the ranges of the arguments until that point. */
5251 && !processing_template_decl
5252 && (complain
& tf_warning
)
5253 && c_inhibit_evaluation_warnings
== 0
5254 /* Even unsigned enum types promote to signed int. We don't
5255 want to issue -Wsign-compare warnings for this case. */
5256 && !enum_cast_to_int (orig_op0
)
5257 && !enum_cast_to_int (orig_op1
))
5259 tree oop0
= maybe_constant_value (orig_op0
);
5260 tree oop1
= maybe_constant_value (orig_op1
);
5262 if (TREE_CODE (oop0
) != INTEGER_CST
)
5263 oop0
= cp_fully_fold (orig_op0
);
5264 if (TREE_CODE (oop1
) != INTEGER_CST
)
5265 oop1
= cp_fully_fold (orig_op1
);
5266 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5267 result_type
, resultcode
);
5271 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5272 Then the expression will be built.
5273 It will be given type FINAL_TYPE if that is nonzero;
5274 otherwise, it will be given type RESULT_TYPE. */
5277 if (TREE_TYPE (op0
) != result_type
)
5278 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5279 if (TREE_TYPE (op1
) != result_type
)
5280 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5282 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5283 return error_mark_node
;
5286 if (build_type
== NULL_TREE
)
5287 build_type
= result_type
;
5289 if (sanitize_flags_p ((SANITIZE_SHIFT
5290 | SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5291 && current_function_decl
!= NULL_TREE
5292 && !processing_template_decl
5293 && (doing_div_or_mod
|| doing_shift
))
5295 /* OP0 and/or OP1 might have side-effects. */
5296 op0
= cp_save_expr (op0
);
5297 op1
= cp_save_expr (op1
);
5298 op0
= fold_non_dependent_expr (op0
);
5299 op1
= fold_non_dependent_expr (op1
);
5300 if (doing_div_or_mod
5301 && sanitize_flags_p (SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5303 /* For diagnostics we want to use the promoted types without
5304 shorten_binary_op. So convert the arguments to the
5305 original result_type. */
5308 if (TREE_TYPE (cop0
) != orig_type
)
5309 cop0
= cp_convert (orig_type
, op0
, complain
);
5310 if (TREE_TYPE (cop1
) != orig_type
)
5311 cop1
= cp_convert (orig_type
, op1
, complain
);
5312 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5314 else if (doing_shift
&& sanitize_flags_p (SANITIZE_SHIFT
))
5315 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5318 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5319 if (final_type
!= 0)
5320 result
= cp_convert (final_type
, result
, complain
);
5322 if (instrument_expr
!= NULL
)
5323 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5324 instrument_expr
, result
);
5326 if (!processing_template_decl
)
5328 op0
= cp_fully_fold (op0
);
5329 /* Only consider the second argument if the first isn't overflowed. */
5330 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5332 op1
= cp_fully_fold (op1
);
5333 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5336 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5337 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5340 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5341 if (TREE_OVERFLOW_P (result_ovl
))
5342 overflow_warning (location
, result_ovl
);
5347 /* Build a VEC_PERM_EXPR.
5348 This is a simple wrapper for c_build_vec_perm_expr. */
5350 build_x_vec_perm_expr (location_t loc
,
5351 tree arg0
, tree arg1
, tree arg2
,
5352 tsubst_flags_t complain
)
5354 tree orig_arg0
= arg0
;
5355 tree orig_arg1
= arg1
;
5356 tree orig_arg2
= arg2
;
5357 if (processing_template_decl
)
5359 if (type_dependent_expression_p (arg0
)
5360 || type_dependent_expression_p (arg1
)
5361 || type_dependent_expression_p (arg2
))
5362 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5363 arg0
= build_non_dependent_expr (arg0
);
5365 arg1
= build_non_dependent_expr (arg1
);
5366 arg2
= build_non_dependent_expr (arg2
);
5368 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5369 if (processing_template_decl
&& exp
!= error_mark_node
)
5370 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5371 orig_arg1
, orig_arg2
);
5375 /* Return a tree for the sum or difference (RESULTCODE says which)
5376 of pointer PTROP and integer INTOP. */
5379 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5380 tree intop
, tsubst_flags_t complain
)
5382 tree res_type
= TREE_TYPE (ptrop
);
5384 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5385 in certain circumstance (when it's valid to do so). So we need
5386 to make sure it's complete. We don't need to check here, if we
5387 can actually complete it at all, as those checks will be done in
5388 pointer_int_sum() anyway. */
5389 complete_type (TREE_TYPE (res_type
));
5391 return pointer_int_sum (loc
, resultcode
, ptrop
,
5392 intop
, complain
& tf_warning_or_error
);
5395 /* Return a tree for the difference of pointers OP0 and OP1.
5396 The resulting tree has type int. If POINTER_SUBTRACT sanitization is
5397 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
5400 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5401 tsubst_flags_t complain
, tree
*instrument_expr
)
5403 tree result
, inttype
;
5404 tree restype
= ptrdiff_type_node
;
5405 tree target_type
= TREE_TYPE (ptrtype
);
5407 if (!complete_type_or_else (target_type
, NULL_TREE
))
5408 return error_mark_node
;
5410 if (VOID_TYPE_P (target_type
))
5412 if (complain
& tf_error
)
5413 permerror (loc
, "ISO C++ forbids using pointer of "
5414 "type %<void *%> in subtraction");
5416 return error_mark_node
;
5418 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5420 if (complain
& tf_error
)
5421 permerror (loc
, "ISO C++ forbids using pointer to "
5422 "a function in subtraction");
5424 return error_mark_node
;
5426 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5428 if (complain
& tf_error
)
5429 permerror (loc
, "ISO C++ forbids using pointer to "
5430 "a method in subtraction");
5432 return error_mark_node
;
5435 /* Determine integer type result of the subtraction. This will usually
5436 be the same as the result type (ptrdiff_t), but may need to be a wider
5437 type if pointers for the address space are wider than ptrdiff_t. */
5438 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
5439 inttype
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
5443 if (sanitize_flags_p (SANITIZE_POINTER_SUBTRACT
))
5445 op0
= save_expr (op0
);
5446 op1
= save_expr (op1
);
5448 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_SUBTRACT
);
5449 *instrument_expr
= build_call_expr_loc (loc
, tt
, 2, op0
, op1
);
5452 /* First do the subtraction, then build the divide operator
5453 and only convert at the very end.
5454 Do not do default conversions in case restype is a short type. */
5456 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
5457 pointers. If some platform cannot provide that, or has a larger
5458 ptrdiff_type to support differences larger than half the address
5459 space, cast the pointers to some larger integer type and do the
5460 computations in that type. */
5461 if (TYPE_PRECISION (inttype
) > TYPE_PRECISION (TREE_TYPE (op0
)))
5462 op0
= cp_build_binary_op (loc
,
5464 cp_convert (inttype
, op0
, complain
),
5465 cp_convert (inttype
, op1
, complain
),
5468 op0
= build2_loc (loc
, POINTER_DIFF_EXPR
, inttype
, op0
, op1
);
5470 /* This generates an error if op1 is a pointer to an incomplete type. */
5471 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5473 if (complain
& tf_error
)
5474 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5475 "pointer arithmetic");
5477 return error_mark_node
;
5480 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5482 if (complain
& tf_error
)
5483 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5485 return error_mark_node
;
5488 op1
= (TYPE_PTROB_P (ptrtype
)
5489 ? size_in_bytes_loc (loc
, target_type
)
5490 : integer_one_node
);
5492 /* Do the division. */
5494 result
= build2_loc (loc
, EXACT_DIV_EXPR
, inttype
, op0
,
5495 cp_convert (inttype
, op1
, complain
));
5496 return cp_convert (restype
, result
, complain
);
5499 /* Construct and perhaps optimize a tree representation
5500 for a unary operation. CODE, a tree_code, specifies the operation
5501 and XARG is the operand. */
5504 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5505 tsubst_flags_t complain
)
5507 tree orig_expr
= xarg
;
5510 tree overload
= NULL_TREE
;
5512 if (processing_template_decl
)
5514 if (type_dependent_expression_p (xarg
))
5515 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5517 xarg
= build_non_dependent_expr (xarg
);
5522 /* [expr.unary.op] says:
5524 The address of an object of incomplete type can be taken.
5526 (And is just the ordinary address operator, not an overloaded
5527 "operator &".) However, if the type is a template
5528 specialization, we must complete the type at this point so that
5529 an overloaded "operator &" will be available if required. */
5530 if (code
== ADDR_EXPR
5531 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5532 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5533 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5534 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5535 /* Don't look for a function. */;
5537 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5538 NULL_TREE
, &overload
, complain
);
5540 if (!exp
&& code
== ADDR_EXPR
)
5542 if (is_overloaded_fn (xarg
))
5544 tree fn
= get_first_fn (xarg
);
5545 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5547 if (complain
& tf_error
)
5548 error (DECL_CONSTRUCTOR_P (fn
)
5549 ? G_("taking address of constructor %qD")
5550 : G_("taking address of destructor %qD"),
5552 return error_mark_node
;
5556 /* A pointer to member-function can be formed only by saying
5558 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5559 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5561 if (TREE_CODE (xarg
) != OFFSET_REF
5562 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5564 if (complain
& tf_error
)
5566 error ("invalid use of %qE to form a "
5567 "pointer-to-member-function", xarg
.get_value ());
5568 if (TREE_CODE (xarg
) != OFFSET_REF
)
5569 inform (input_location
, " a qualified-id is required");
5571 return error_mark_node
;
5575 if (complain
& tf_error
)
5576 error ("parentheses around %qE cannot be used to form a"
5577 " pointer-to-member-function",
5580 return error_mark_node
;
5581 PTRMEM_OK_P (xarg
) = 1;
5585 if (TREE_CODE (xarg
) == OFFSET_REF
)
5587 ptrmem
= PTRMEM_OK_P (xarg
);
5589 if (!ptrmem
&& !flag_ms_extensions
5590 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5592 /* A single non-static member, make sure we don't allow a
5593 pointer-to-member. */
5594 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5595 TREE_OPERAND (xarg
, 0),
5596 ovl_make (TREE_OPERAND (xarg
, 1)));
5597 PTRMEM_OK_P (xarg
) = ptrmem
;
5601 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5604 if (processing_template_decl
&& exp
!= error_mark_node
)
5606 if (overload
!= NULL_TREE
)
5607 return (build_min_non_dep_op_overload
5608 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5610 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5611 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5613 if (TREE_CODE (exp
) == ADDR_EXPR
)
5614 PTRMEM_OK_P (exp
) = ptrmem
;
5618 /* Construct and perhaps optimize a tree representation
5619 for __builtin_addressof operation. ARG specifies the operand. */
5622 cp_build_addressof (location_t loc
, tree arg
, tsubst_flags_t complain
)
5624 tree orig_expr
= arg
;
5626 if (processing_template_decl
)
5628 if (type_dependent_expression_p (arg
))
5629 return build_min_nt_loc (loc
, ADDRESSOF_EXPR
, arg
, NULL_TREE
);
5631 arg
= build_non_dependent_expr (arg
);
5634 tree exp
= cp_build_addr_expr_strict (arg
, complain
);
5636 if (processing_template_decl
&& exp
!= error_mark_node
)
5637 exp
= build_min_non_dep (ADDRESSOF_EXPR
, exp
, orig_expr
, NULL_TREE
);
5641 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5642 constants, where a null value is represented by an INTEGER_CST of
5646 cp_truthvalue_conversion (tree expr
)
5648 tree type
= TREE_TYPE (expr
);
5649 if (TYPE_PTR_OR_PTRMEM_P (type
)
5650 /* Avoid ICE on invalid use of non-static member function. */
5651 || TREE_CODE (expr
) == FUNCTION_DECL
)
5652 return build_binary_op (input_location
, NE_EXPR
, expr
, nullptr_node
, true);
5654 return c_common_truthvalue_conversion (input_location
, expr
);
5657 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5660 condition_conversion (tree expr
)
5663 /* Anything that might happen in a template should go through
5664 maybe_convert_cond. */
5665 gcc_assert (!processing_template_decl
);
5666 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5667 tf_warning_or_error
, LOOKUP_NORMAL
);
5668 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5672 /* Returns the address of T. This function will fold away
5673 ADDR_EXPR of INDIRECT_REF. */
5676 build_address (tree t
)
5678 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5679 return error_mark_node
;
5680 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
);
5681 t
= build_fold_addr_expr (t
);
5682 if (TREE_CODE (t
) != ADDR_EXPR
)
5687 /* Return a NOP_EXPR converting EXPR to TYPE. */
5690 build_nop (tree type
, tree expr
)
5692 if (type
== error_mark_node
|| error_operand_p (expr
))
5694 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5697 /* Take the address of ARG, whatever that means under C++ semantics.
5698 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5699 and class rvalues as well.
5701 Nothing should call this function directly; instead, callers should use
5702 cp_build_addr_expr or cp_build_addr_expr_strict. */
5705 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5710 if (!arg
|| error_operand_p (arg
))
5711 return error_mark_node
;
5713 arg
= mark_lvalue_use (arg
);
5714 if (error_operand_p (arg
))
5715 return error_mark_node
;
5717 argtype
= lvalue_type (arg
);
5719 gcc_assert (!(identifier_p (arg
) && IDENTIFIER_ANY_OP_P (arg
)));
5721 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5722 && !really_overloaded_fn (arg
))
5724 /* They're trying to take the address of a unique non-static
5725 member function. This is ill-formed (except in MS-land),
5726 but let's try to DTRT.
5727 Note: We only handle unique functions here because we don't
5728 want to complain if there's a static overload; non-unique
5729 cases will be handled by instantiate_type. But we need to
5730 handle this case here to allow casts on the resulting PMF.
5731 We could defer this in non-MS mode, but it's easier to give
5732 a useful error here. */
5734 /* Inside constant member functions, the `this' pointer
5735 contains an extra const qualifier. TYPE_MAIN_VARIANT
5736 is used here to remove this const from the diagnostics
5737 and the created OFFSET_REF. */
5738 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5739 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5740 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5741 return error_mark_node
;
5743 if (! flag_ms_extensions
)
5745 tree name
= DECL_NAME (fn
);
5746 if (!(complain
& tf_error
))
5747 return error_mark_node
;
5748 else if (current_class_type
5749 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5750 /* An expression like &memfn. */
5751 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5752 " or parenthesized non-static member function to form"
5753 " a pointer to member function. Say %<&%T::%D%>",
5756 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5757 " function to form a pointer to member function."
5761 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5764 /* Uninstantiated types are all functions. Taking the
5765 address of a function is a no-op, so just return the
5767 if (type_unknown_p (arg
))
5768 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5770 if (TREE_CODE (arg
) == OFFSET_REF
)
5771 /* We want a pointer to member; bypass all the code for actually taking
5772 the address of something. */
5775 /* Anything not already handled and not a true memory reference
5777 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5778 && TREE_CODE (argtype
) != METHOD_TYPE
)
5780 cp_lvalue_kind kind
= lvalue_kind (arg
);
5781 if (kind
== clk_none
)
5783 if (complain
& tf_error
)
5784 lvalue_error (input_location
, lv_addressof
);
5785 return error_mark_node
;
5787 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5789 if (!(complain
& tf_error
))
5790 return error_mark_node
;
5791 if (kind
& clk_class
)
5792 /* Make this a permerror because we used to accept it. */
5793 permerror (input_location
, "taking address of temporary");
5795 error ("taking address of xvalue (rvalue reference)");
5799 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5801 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5802 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5805 else if (pedantic
&& DECL_MAIN_P (arg
))
5808 /* Apparently a lot of autoconf scripts for C++ packages do this,
5809 so only complain if -Wpedantic. */
5810 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5811 pedwarn (input_location
, OPT_Wpedantic
,
5812 "ISO C++ forbids taking address of function %<::main%>");
5813 else if (flag_pedantic_errors
)
5814 return error_mark_node
;
5817 /* Let &* cancel out to simplify resulting code. */
5818 if (INDIRECT_REF_P (arg
))
5820 arg
= TREE_OPERAND (arg
, 0);
5821 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5823 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5824 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5827 /* Don't let this be an lvalue. */
5832 /* ??? Cope with user tricks that amount to offsetof. */
5833 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5834 && TREE_CODE (argtype
) != METHOD_TYPE
5835 && argtype
!= unknown_type_node
5836 && (val
= get_base_address (arg
))
5837 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5838 && INDIRECT_REF_P (val
)
5839 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5841 tree type
= build_pointer_type (argtype
);
5842 return fold_convert (type
, fold_offsetof_1 (arg
));
5845 /* Handle complex lvalues (when permitted)
5846 by reduction to simpler cases. */
5847 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5851 switch (TREE_CODE (arg
))
5855 case FIX_TRUNC_EXPR
:
5856 /* We should have handled this above in the lvalue_kind check. */
5861 arg
= BASELINK_FUNCTIONS (arg
);
5865 arg
= OVL_FIRST (arg
);
5870 /* Turn a reference to a non-static data member into a
5871 pointer-to-member. */
5876 gcc_assert (PTRMEM_OK_P (arg
));
5878 t
= TREE_OPERAND (arg
, 1);
5879 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5881 if (complain
& tf_error
)
5882 error ("cannot create pointer to reference member %qD", t
);
5883 return error_mark_node
;
5886 type
= build_ptrmem_type (context_for_name_lookup (t
),
5888 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5896 if (argtype
!= error_mark_node
)
5897 argtype
= build_pointer_type (argtype
);
5899 if (bitfield_p (arg
))
5901 if (complain
& tf_error
)
5902 error ("attempt to take address of bit-field");
5903 return error_mark_node
;
5906 /* In a template, we are processing a non-dependent expression
5907 so we can just form an ADDR_EXPR with the correct type. */
5908 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5910 val
= build_address (arg
);
5911 if (TREE_CODE (arg
) == OFFSET_REF
)
5912 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5914 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5916 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5918 /* We can only get here with a single static member
5920 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5921 && DECL_STATIC_FUNCTION_P (fn
));
5922 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5923 return error_mark_node
;
5924 val
= build_address (fn
);
5925 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5926 /* Do not lose object's side effects. */
5927 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5928 TREE_OPERAND (arg
, 0), val
);
5932 tree object
= TREE_OPERAND (arg
, 0);
5933 tree field
= TREE_OPERAND (arg
, 1);
5934 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5935 (TREE_TYPE (object
), decl_type_context (field
)));
5936 val
= build_address (arg
);
5939 if (TYPE_PTR_P (argtype
)
5940 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5942 build_ptrmemfunc_type (argtype
);
5943 val
= build_ptrmemfunc (argtype
, val
, 0,
5951 /* Take the address of ARG if it has one, even if it's an rvalue. */
5954 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5956 return cp_build_addr_expr_1 (arg
, 0, complain
);
5959 /* Take the address of ARG, but only if it's an lvalue. */
5962 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5964 return cp_build_addr_expr_1 (arg
, 1, complain
);
5967 /* C++: Must handle pointers to members.
5969 Perhaps type instantiation should be extended to handle conversion
5970 from aggregates to types we don't yet know we want? (Or are those
5971 cases typically errors which should be reported?)
5973 NOCONVERT suppresses the default promotions (such as from short to int). */
5976 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
5977 tsubst_flags_t complain
)
5979 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5981 location_t location
= EXPR_LOC_OR_LOC (arg
, input_location
);
5983 const char *errstring
= NULL
;
5985 const char *invalid_op_diag
;
5987 if (!arg
|| error_operand_p (arg
))
5988 return error_mark_node
;
5990 if ((invalid_op_diag
5991 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5996 if (complain
& tf_error
)
5997 error (invalid_op_diag
);
5998 return error_mark_node
;
6003 case UNARY_PLUS_EXPR
:
6006 int flags
= WANT_ARITH
| WANT_ENUM
;
6007 /* Unary plus (but not unary minus) is allowed on pointers. */
6008 if (code
== UNARY_PLUS_EXPR
)
6009 flags
|= WANT_POINTER
;
6010 arg
= build_expr_type_conversion (flags
, arg
, true);
6012 errstring
= (code
== NEGATE_EXPR
6013 ? _("wrong type argument to unary minus")
6014 : _("wrong type argument to unary plus"));
6017 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6018 arg
= cp_perform_integral_promotions (arg
, complain
);
6020 /* Make sure the result is not an lvalue: a unary plus or minus
6021 expression is always a rvalue. */
6028 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6033 arg
= cp_default_conversion (arg
, complain
);
6034 if (arg
== error_mark_node
)
6035 return error_mark_node
;
6038 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
6039 | WANT_VECTOR_OR_COMPLEX
,
6041 errstring
= _("wrong type argument to bit-complement");
6042 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6044 /* Warn if the expression has boolean value. */
6045 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
6046 && (complain
& tf_warning
)
6047 && warning_at (location
, OPT_Wbool_operation
,
6048 "%<~%> on an expression of type bool"))
6049 inform (location
, "did you mean to use logical not (%<!%>)?");
6050 arg
= cp_perform_integral_promotions (arg
, complain
);
6052 else if (!noconvert
&& VECTOR_TYPE_P (TREE_TYPE (arg
)))
6053 arg
= mark_rvalue_use (arg
);
6057 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6058 errstring
= _("wrong type argument to abs");
6059 else if (!noconvert
)
6061 arg
= cp_default_conversion (arg
, complain
);
6062 if (arg
== error_mark_node
)
6063 return error_mark_node
;
6068 /* Conjugating a real value is a no-op, but allow it anyway. */
6069 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6070 errstring
= _("wrong type argument to conjugation");
6071 else if (!noconvert
)
6073 arg
= cp_default_conversion (arg
, complain
);
6074 if (arg
== error_mark_node
)
6075 return error_mark_node
;
6079 case TRUTH_NOT_EXPR
:
6080 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
6081 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
6082 build_zero_cst (TREE_TYPE (arg
)), complain
);
6083 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
6085 val
= invert_truthvalue_loc (input_location
, arg
);
6086 if (arg
!= error_mark_node
)
6088 errstring
= _("in argument to unary !");
6096 arg
= build_real_imag_expr (input_location
, code
, arg
);
6099 case PREINCREMENT_EXPR
:
6100 case POSTINCREMENT_EXPR
:
6101 case PREDECREMENT_EXPR
:
6102 case POSTDECREMENT_EXPR
:
6103 /* Handle complex lvalues (when permitted)
6104 by reduction to simpler cases. */
6106 val
= unary_complex_lvalue (code
, arg
);
6110 arg
= mark_lvalue_use (arg
);
6112 /* Increment or decrement the real part of the value,
6113 and don't change the imaginary part. */
6114 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6118 arg
= cp_stabilize_reference (arg
);
6119 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
6120 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
6121 real
= cp_build_unary_op (code
, real
, true, complain
);
6122 if (real
== error_mark_node
|| imag
== error_mark_node
)
6123 return error_mark_node
;
6124 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
6128 /* Report invalid types. */
6130 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
6133 if (code
== PREINCREMENT_EXPR
)
6134 errstring
= _("no pre-increment operator for type");
6135 else if (code
== POSTINCREMENT_EXPR
)
6136 errstring
= _("no post-increment operator for type");
6137 else if (code
== PREDECREMENT_EXPR
)
6138 errstring
= _("no pre-decrement operator for type");
6140 errstring
= _("no post-decrement operator for type");
6143 else if (arg
== error_mark_node
)
6144 return error_mark_node
;
6146 /* Report something read-only. */
6148 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
6149 || TREE_READONLY (arg
))
6151 if (complain
& tf_error
)
6152 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
6153 || code
== POSTINCREMENT_EXPR
)
6154 ? lv_increment
: lv_decrement
));
6156 return error_mark_node
;
6161 tree declared_type
= unlowered_expr_type (arg
);
6163 argtype
= TREE_TYPE (arg
);
6165 /* ARM $5.2.5 last annotation says this should be forbidden. */
6166 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
6168 if (complain
& tf_error
)
6169 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
6170 ? G_("ISO C++ forbids incrementing an enum")
6171 : G_("ISO C++ forbids decrementing an enum"));
6173 return error_mark_node
;
6176 /* Compute the increment. */
6178 if (TYPE_PTR_P (argtype
))
6180 tree type
= complete_type (TREE_TYPE (argtype
));
6182 if (!COMPLETE_OR_VOID_TYPE_P (type
))
6184 if (complain
& tf_error
)
6185 error (((code
== PREINCREMENT_EXPR
6186 || code
== POSTINCREMENT_EXPR
))
6187 ? G_("cannot increment a pointer to incomplete type %qT")
6188 : G_("cannot decrement a pointer to incomplete type %qT"),
6189 TREE_TYPE (argtype
));
6191 return error_mark_node
;
6193 else if (!TYPE_PTROB_P (argtype
))
6195 if (complain
& tf_error
)
6196 pedwarn (input_location
, OPT_Wpointer_arith
,
6197 (code
== PREINCREMENT_EXPR
6198 || code
== POSTINCREMENT_EXPR
)
6199 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6200 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6203 return error_mark_node
;
6206 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6209 inc
= VECTOR_TYPE_P (argtype
)
6210 ? build_one_cst (argtype
)
6213 inc
= cp_convert (argtype
, inc
, complain
);
6215 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6216 need to ask Objective-C to build the increment or decrement
6217 expression for it. */
6218 if (objc_is_property_ref (arg
))
6219 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6222 /* Complain about anything else that is not a true lvalue. */
6223 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6224 || code
== POSTINCREMENT_EXPR
)
6225 ? lv_increment
: lv_decrement
),
6227 return error_mark_node
;
6229 /* Forbid using -- or ++ in C++17 on `bool'. */
6230 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6232 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6234 if (complain
& tf_error
)
6235 error ("use of an operand of type %qT in %<operator--%> "
6236 "is forbidden", boolean_type_node
);
6237 return error_mark_node
;
6241 if (cxx_dialect
>= cxx17
)
6243 if (complain
& tf_error
)
6244 error ("use of an operand of type %qT in "
6245 "%<operator++%> is forbidden in C++17",
6247 return error_mark_node
;
6249 /* Otherwise, [depr.incr.bool] says this is deprecated. */
6250 else if (!in_system_header_at (input_location
))
6251 warning (OPT_Wdeprecated
, "use of an operand of type %qT "
6252 "in %<operator++%> is deprecated",
6255 val
= boolean_increment (code
, arg
);
6257 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6258 /* An rvalue has no cv-qualifiers. */
6259 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6261 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6263 TREE_SIDE_EFFECTS (val
) = 1;
6268 /* Note that this operation never does default_conversion
6269 regardless of NOCONVERT. */
6270 return cp_build_addr_expr (arg
, complain
);
6279 argtype
= TREE_TYPE (arg
);
6280 return build1 (code
, argtype
, arg
);
6283 if (complain
& tf_error
)
6284 error ("%s", errstring
);
6285 return error_mark_node
;
6288 /* Hook for the c-common bits that build a unary op. */
6290 build_unary_op (location_t
/*location*/,
6291 enum tree_code code
, tree xarg
, bool noconvert
)
6293 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6296 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6297 for certain kinds of expressions which are not really lvalues
6298 but which we can accept as lvalues.
6300 If ARG is not a kind of expression we can handle, return
6304 unary_complex_lvalue (enum tree_code code
, tree arg
)
6306 /* Inside a template, making these kinds of adjustments is
6307 pointless; we are only concerned with the type of the
6309 if (processing_template_decl
)
6312 /* Handle (a, b) used as an "lvalue". */
6313 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6315 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
6316 tf_warning_or_error
);
6317 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6318 TREE_OPERAND (arg
, 0), real_result
);
6321 /* Handle (a ? b : c) used as an "lvalue". */
6322 if (TREE_CODE (arg
) == COND_EXPR
6323 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6324 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6326 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6327 if (TREE_CODE (arg
) == MODIFY_EXPR
6328 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6329 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6331 tree lvalue
= TREE_OPERAND (arg
, 0);
6332 if (TREE_SIDE_EFFECTS (lvalue
))
6334 lvalue
= cp_stabilize_reference (lvalue
);
6335 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6336 lvalue
, TREE_OPERAND (arg
, 1));
6338 return unary_complex_lvalue
6339 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6342 if (code
!= ADDR_EXPR
)
6345 /* Handle (a = b) used as an "lvalue" for `&'. */
6346 if (TREE_CODE (arg
) == MODIFY_EXPR
6347 || TREE_CODE (arg
) == INIT_EXPR
)
6349 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
6350 tf_warning_or_error
);
6351 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6353 TREE_NO_WARNING (arg
) = 1;
6357 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6358 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6359 || TREE_CODE (arg
) == OFFSET_REF
)
6362 /* We permit compiler to make function calls returning
6363 objects of aggregate type look like lvalues. */
6367 if (TREE_CODE (targ
) == SAVE_EXPR
)
6368 targ
= TREE_OPERAND (targ
, 0);
6370 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6372 if (TREE_CODE (arg
) == SAVE_EXPR
)
6375 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6376 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6379 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6380 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6381 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6384 /* Don't let anything else be handled specially. */
6388 /* Mark EXP saying that we need to be able to take the
6389 address of it; it should not be allocated in a register.
6390 Value is true if successful. ARRAY_REF_P is true if this
6391 is for ARRAY_REF construction - in that case we don't want
6392 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
6393 it is fine to use ARRAY_REFs for vector subscripts on vector
6396 C++: we do not allow `current_class_ptr' to be addressable. */
6399 cxx_mark_addressable (tree exp
, bool array_ref_p
)
6404 switch (TREE_CODE (x
))
6406 case VIEW_CONVERT_EXPR
:
6408 && TREE_CODE (TREE_TYPE (x
)) == ARRAY_TYPE
6409 && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x
, 0))))
6417 x
= TREE_OPERAND (x
, 0);
6421 if (x
== current_class_ptr
)
6423 error ("cannot take the address of %<this%>, which is an rvalue expression");
6424 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6430 /* Caller should not be trying to mark initialized
6431 constant fields addressable. */
6432 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6433 || DECL_IN_AGGR_P (x
) == 0
6435 || DECL_EXTERNAL (x
));
6439 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6440 && !DECL_ARTIFICIAL (x
))
6442 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6445 ("address of explicit register variable %qD requested", x
);
6448 else if (extra_warnings
)
6450 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6452 TREE_ADDRESSABLE (x
) = 1;
6457 TREE_ADDRESSABLE (x
) = 1;
6461 TREE_ADDRESSABLE (x
) = 1;
6465 TREE_ADDRESSABLE (x
) = 1;
6466 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6474 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6477 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6478 tsubst_flags_t complain
)
6480 tree orig_ifexp
= ifexp
;
6481 tree orig_op1
= op1
;
6482 tree orig_op2
= op2
;
6485 if (processing_template_decl
)
6487 /* The standard says that the expression is type-dependent if
6488 IFEXP is type-dependent, even though the eventual type of the
6489 expression doesn't dependent on IFEXP. */
6490 if (type_dependent_expression_p (ifexp
)
6491 /* As a GNU extension, the middle operand may be omitted. */
6492 || (op1
&& type_dependent_expression_p (op1
))
6493 || type_dependent_expression_p (op2
))
6494 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6495 ifexp
= build_non_dependent_expr (ifexp
);
6497 op1
= build_non_dependent_expr (op1
);
6498 op2
= build_non_dependent_expr (op2
);
6501 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6502 if (processing_template_decl
&& expr
!= error_mark_node
)
6504 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6505 orig_ifexp
, orig_op1
, orig_op2
);
6506 /* Remember that the result is an lvalue or xvalue. */
6507 if (glvalue_p (expr
) && !glvalue_p (min
))
6508 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6510 expr
= convert_from_reference (min
);
6515 /* Given a list of expressions, return a compound expression
6516 that performs them all and returns the value of the last of them. */
6519 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6520 tsubst_flags_t complain
)
6522 tree expr
= TREE_VALUE (list
);
6524 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6525 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6527 if (complain
& tf_error
)
6528 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6529 "list-initializer for non-class type must not "
6530 "be parenthesized");
6532 return error_mark_node
;
6535 if (TREE_CHAIN (list
))
6537 if (complain
& tf_error
)
6541 permerror (input_location
, "expression list treated as compound "
6542 "expression in initializer");
6545 permerror (input_location
, "expression list treated as compound "
6546 "expression in mem-initializer");
6549 permerror (input_location
, "expression list treated as compound "
6550 "expression in functional cast");
6556 return error_mark_node
;
6558 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6559 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6560 expr
, TREE_VALUE (list
), complain
);
6566 /* Like build_x_compound_expr_from_list, but using a VEC. */
6569 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6570 tsubst_flags_t complain
)
6572 if (vec_safe_is_empty (vec
))
6574 else if (vec
->length () == 1)
6584 if (complain
& tf_error
)
6585 permerror (input_location
,
6586 "%s expression list treated as compound expression",
6589 return error_mark_node
;
6593 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6594 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6601 /* Handle overloading of the ',' operator when needed. */
6604 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6605 tsubst_flags_t complain
)
6608 tree orig_op1
= op1
;
6609 tree orig_op2
= op2
;
6610 tree overload
= NULL_TREE
;
6612 if (processing_template_decl
)
6614 if (type_dependent_expression_p (op1
)
6615 || type_dependent_expression_p (op2
))
6616 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6617 op1
= build_non_dependent_expr (op1
);
6618 op2
= build_non_dependent_expr (op2
);
6621 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6622 NULL_TREE
, &overload
, complain
);
6624 result
= cp_build_compound_expr (op1
, op2
, complain
);
6626 if (processing_template_decl
&& result
!= error_mark_node
)
6628 if (overload
!= NULL_TREE
)
6629 return (build_min_non_dep_op_overload
6630 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6632 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6638 /* Like cp_build_compound_expr, but for the c-common bits. */
6641 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6643 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6646 /* Build a compound expression. */
6649 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6651 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6653 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6654 return error_mark_node
;
6656 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6658 /* If the rhs is a TARGET_EXPR, then build the compound
6659 expression inside the target_expr's initializer. This
6660 helps the compiler to eliminate unnecessary temporaries. */
6661 tree init
= TREE_OPERAND (rhs
, 1);
6663 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6664 TREE_OPERAND (rhs
, 1) = init
;
6669 if (type_unknown_p (rhs
))
6671 if (complain
& tf_error
)
6672 error ("no context to resolve type of %qE", rhs
);
6673 return error_mark_node
;
6676 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6679 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6680 casts away constness. CAST gives the type of cast. Returns true
6681 if the cast is ill-formed, false if it is well-formed.
6683 ??? This function warns for casting away any qualifier not just
6684 const. We would like to specify exactly what qualifiers are casted
6689 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6690 enum tree_code cast
, tsubst_flags_t complain
)
6692 /* C-style casts are allowed to cast away constness. With
6693 WARN_CAST_QUAL, we still want to issue a warning. */
6694 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6697 if (!casts_away_constness (src_type
, dest_type
, complain
))
6703 if (complain
& tf_warning
)
6704 warning (OPT_Wcast_qual
,
6705 "cast from type %qT to type %qT casts away qualifiers",
6706 src_type
, dest_type
);
6709 case STATIC_CAST_EXPR
:
6710 if (complain
& tf_error
)
6711 error ("static_cast from type %qT to type %qT casts away qualifiers",
6712 src_type
, dest_type
);
6715 case REINTERPRET_CAST_EXPR
:
6716 if (complain
& tf_error
)
6717 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6718 src_type
, dest_type
);
6726 /* Warns if the cast from expression EXPR to type TYPE is useless. */
6728 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6730 if (warn_useless_cast
6731 && complain
& tf_warning
)
6733 if ((TREE_CODE (type
) == REFERENCE_TYPE
6734 && (TYPE_REF_IS_RVALUE (type
)
6735 ? xvalue_p (expr
) : lvalue_p (expr
))
6736 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6737 || same_type_p (TREE_TYPE (expr
), type
))
6738 warning (OPT_Wuseless_cast
, "useless cast to type %q#T", type
);
6742 /* Warns if the cast ignores cv-qualifiers on TYPE. */
6744 maybe_warn_about_cast_ignoring_quals (tree type
, tsubst_flags_t complain
)
6746 if (warn_ignored_qualifiers
6747 && complain
& tf_warning
6748 && !CLASS_TYPE_P (type
)
6749 && (cp_type_quals (type
) & (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)))
6751 warning (OPT_Wignored_qualifiers
, "type qualifiers ignored on cast "
6756 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6757 (another pointer-to-member type in the same hierarchy) and return
6758 the converted expression. If ALLOW_INVERSE_P is permitted, a
6759 pointer-to-derived may be converted to pointer-to-base; otherwise,
6760 only the other direction is permitted. If C_CAST_P is true, this
6761 conversion is taking place as part of a C-style cast. */
6764 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6765 bool c_cast_p
, tsubst_flags_t complain
)
6767 if (same_type_p (type
, TREE_TYPE (expr
)))
6770 if (TYPE_PTRDATAMEM_P (type
))
6774 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6775 TYPE_PTRMEM_CLASS_TYPE (type
),
6777 c_cast_p
, complain
);
6778 if (delta
== error_mark_node
)
6779 return error_mark_node
;
6781 if (!integer_zerop (delta
))
6783 tree cond
, op1
, op2
;
6785 if (TREE_CODE (expr
) == PTRMEM_CST
)
6786 expr
= cplus_expand_constant (expr
);
6787 cond
= cp_build_binary_op (input_location
,
6790 build_int_cst (TREE_TYPE (expr
), -1),
6792 op1
= build_nop (ptrdiff_type_node
, expr
);
6793 op2
= cp_build_binary_op (input_location
,
6794 PLUS_EXPR
, op1
, delta
,
6797 expr
= fold_build3_loc (input_location
,
6798 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6802 return build_nop (type
, expr
);
6805 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6806 allow_inverse_p
, c_cast_p
, complain
);
6809 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6810 this static_cast is being attempted as one of the possible casts
6811 allowed by a C-style cast. (In that case, accessibility of base
6812 classes is not considered, and it is OK to cast away
6813 constness.) Return the result of the cast. *VALID_P is set to
6814 indicate whether or not the cast was valid. */
6817 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6818 bool *valid_p
, tsubst_flags_t complain
)
6824 /* Assume the cast is valid. */
6827 intype
= unlowered_expr_type (expr
);
6829 /* Save casted types in the function's used types hash table. */
6830 used_types_insert (type
);
6832 /* A prvalue of non-class type is cv-unqualified. */
6833 if (!CLASS_TYPE_P (type
))
6834 type
= cv_unqualified (type
);
6836 /* [expr.static.cast]
6838 An lvalue of type "cv1 B", where B is a class type, can be cast
6839 to type "reference to cv2 D", where D is a class derived (clause
6840 _class.derived_) from B, if a valid standard conversion from
6841 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6842 same cv-qualification as, or greater cv-qualification than, cv1,
6843 and B is not a virtual base class of D. */
6844 /* We check this case before checking the validity of "TYPE t =
6845 EXPR;" below because for this case:
6848 struct D : public B { D(const B&); };
6850 void f() { static_cast<const D&>(b); }
6852 we want to avoid constructing a new D. The standard is not
6853 completely clear about this issue, but our interpretation is
6854 consistent with other compilers. */
6855 if (TREE_CODE (type
) == REFERENCE_TYPE
6856 && CLASS_TYPE_P (TREE_TYPE (type
))
6857 && CLASS_TYPE_P (intype
)
6858 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
6859 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6860 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6861 build_pointer_type (TYPE_MAIN_VARIANT
6862 (TREE_TYPE (type
))),
6865 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6869 if (processing_template_decl
)
6872 /* There is a standard conversion from "D*" to "B*" even if "B"
6873 is ambiguous or inaccessible. If this is really a
6874 static_cast, then we check both for inaccessibility and
6875 ambiguity. However, if this is a static_cast being performed
6876 because the user wrote a C-style cast, then accessibility is
6878 base
= lookup_base (TREE_TYPE (type
), intype
,
6879 c_cast_p
? ba_unique
: ba_check
,
6881 expr
= build_address (expr
);
6883 if (sanitize_flags_p (SANITIZE_VPTR
))
6886 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6892 /* Convert from "B*" to "D*". This function will check that "B"
6893 is not a virtual base of "D". */
6894 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6897 /* Convert the pointer to a reference -- but then remember that
6898 there are no expressions with reference type in C++.
6900 We call rvalue so that there's an actual tree code
6901 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6902 is a variable with the same type, the conversion would get folded
6903 away, leaving just the variable and causing lvalue_kind to give
6904 the wrong answer. */
6905 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
6908 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6909 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6910 if (TREE_CODE (type
) == REFERENCE_TYPE
6911 && TYPE_REF_IS_RVALUE (type
)
6912 && (clk
= real_lvalue_p (expr
))
6913 && reference_related_p (TREE_TYPE (type
), intype
)
6914 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6916 if (processing_template_decl
)
6918 if (clk
== clk_ordinary
)
6920 /* Handle the (non-bit-field) lvalue case here by casting to
6921 lvalue reference and then changing it to an rvalue reference.
6922 Casting an xvalue to rvalue reference will be handled by the
6924 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
6925 result
= (perform_direct_initialization_if_possible
6926 (lref
, expr
, c_cast_p
, complain
));
6927 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
6928 return convert_from_reference (result
);
6931 /* For a bit-field or packed field, bind to a temporary. */
6932 expr
= rvalue (expr
);
6935 /* Resolve overloaded address here rather than once in
6936 implicit_conversion and again in the inverse code below. */
6937 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
6939 expr
= instantiate_type (type
, expr
, complain
);
6940 intype
= TREE_TYPE (expr
);
6943 /* [expr.static.cast]
6945 Any expression can be explicitly converted to type cv void. */
6946 if (VOID_TYPE_P (type
))
6947 return convert_to_void (expr
, ICV_CAST
, complain
);
6950 An abstract class shall not be used ... as the type of an explicit
6952 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
6953 return error_mark_node
;
6955 /* [expr.static.cast]
6957 An expression e can be explicitly converted to a type T using a
6958 static_cast of the form static_cast<T>(e) if the declaration T
6959 t(e);" is well-formed, for some invented temporary variable
6961 result
= perform_direct_initialization_if_possible (type
, expr
,
6962 c_cast_p
, complain
);
6965 if (processing_template_decl
)
6968 result
= convert_from_reference (result
);
6970 /* [expr.static.cast]
6972 If T is a reference type, the result is an lvalue; otherwise,
6973 the result is an rvalue. */
6974 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6976 result
= rvalue (result
);
6978 if (result
== expr
&& SCALAR_TYPE_P (type
))
6979 /* Leave some record of the cast. */
6980 result
= build_nop (type
, expr
);
6985 /* [expr.static.cast]
6987 The inverse of any standard conversion sequence (clause _conv_),
6988 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6989 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6990 (_conv.bool_) conversions, can be performed explicitly using
6991 static_cast subject to the restriction that the explicit
6992 conversion does not cast away constness (_expr.const.cast_), and
6993 the following additional rules for specific cases: */
6994 /* For reference, the conversions not excluded are: integral
6995 promotions, floating point promotion, integral conversions,
6996 floating point conversions, floating-integral conversions,
6997 pointer conversions, and pointer to member conversions. */
7000 A value of integral _or enumeration_ type can be explicitly
7001 converted to an enumeration type. */
7002 /* The effect of all that is that any conversion between any two
7003 types which are integral, floating, or enumeration types can be
7005 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7006 || SCALAR_FLOAT_TYPE_P (type
))
7007 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
7008 || SCALAR_FLOAT_TYPE_P (intype
)))
7010 if (processing_template_decl
)
7012 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
7015 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
7016 && CLASS_TYPE_P (TREE_TYPE (type
))
7017 && CLASS_TYPE_P (TREE_TYPE (intype
))
7018 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
7019 (TREE_TYPE (intype
))),
7020 build_pointer_type (TYPE_MAIN_VARIANT
7021 (TREE_TYPE (type
))),
7026 if (processing_template_decl
)
7030 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7032 return error_mark_node
;
7033 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
7034 c_cast_p
? ba_unique
: ba_check
,
7036 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
7039 if (sanitize_flags_p (SANITIZE_VPTR
))
7042 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
7048 return cp_fold_convert (type
, expr
);
7051 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7052 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7059 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
7060 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
7062 if (TYPE_PTRDATAMEM_P (type
))
7064 t1
= (build_ptrmem_type
7066 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
7067 t2
= (build_ptrmem_type
7069 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
7076 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
7079 && check_for_casting_away_constness (intype
, type
,
7082 return error_mark_node
;
7083 if (processing_template_decl
)
7085 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
7086 c_cast_p
, complain
);
7090 /* [expr.static.cast]
7092 An rvalue of type "pointer to cv void" can be explicitly
7093 converted to a pointer to object type. A value of type pointer
7094 to object converted to "pointer to cv void" and back to the
7095 original pointer type will have its original value. */
7096 if (TYPE_PTR_P (intype
)
7097 && VOID_TYPE_P (TREE_TYPE (intype
))
7098 && TYPE_PTROB_P (type
))
7101 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7103 return error_mark_node
;
7104 if (processing_template_decl
)
7106 return build_nop (type
, expr
);
7110 return error_mark_node
;
7113 /* Return an expression representing static_cast<TYPE>(EXPR). */
7116 build_static_cast (tree type
, tree oexpr
, tsubst_flags_t complain
)
7122 if (type
== error_mark_node
|| expr
== error_mark_node
)
7123 return error_mark_node
;
7125 bool dependent
= (dependent_type_p (type
)
7126 || type_dependent_expression_p (expr
));
7130 expr
= build_min (STATIC_CAST_EXPR
, type
, oexpr
);
7131 /* We don't know if it will or will not have side effects. */
7132 TREE_SIDE_EFFECTS (expr
) = 1;
7133 return convert_from_reference (expr
);
7136 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7137 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7138 if (TREE_CODE (type
) != REFERENCE_TYPE
7139 && TREE_CODE (expr
) == NOP_EXPR
7140 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7141 expr
= TREE_OPERAND (expr
, 0);
7143 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
7147 if (result
!= error_mark_node
)
7149 maybe_warn_about_useless_cast (type
, expr
, complain
);
7150 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7152 if (processing_template_decl
)
7157 if (complain
& tf_error
)
7158 error ("invalid static_cast from type %qT to type %qT",
7159 TREE_TYPE (expr
), type
);
7160 return error_mark_node
;
7163 /* EXPR is an expression with member function or pointer-to-member
7164 function type. TYPE is a pointer type. Converting EXPR to TYPE is
7165 not permitted by ISO C++, but we accept it in some modes. If we
7166 are not in one of those modes, issue a diagnostic. Return the
7167 converted expression. */
7170 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
7175 intype
= TREE_TYPE (expr
);
7176 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
7177 || TREE_CODE (intype
) == METHOD_TYPE
);
7179 if (!(complain
& tf_warning_or_error
))
7180 return error_mark_node
;
7182 if (pedantic
|| warn_pmf2ptr
)
7183 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
7184 "converting from %qH to %qI", intype
, type
);
7186 if (TREE_CODE (intype
) == METHOD_TYPE
)
7187 expr
= build_addr_func (expr
, complain
);
7188 else if (TREE_CODE (expr
) == PTRMEM_CST
)
7189 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
7192 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
7193 decl
= build_address (decl
);
7194 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
7197 if (expr
== error_mark_node
)
7198 return error_mark_node
;
7200 return build_nop (type
, expr
);
7203 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
7204 If C_CAST_P is true, this reinterpret cast is being done as part of
7205 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
7206 indicate whether or not reinterpret_cast was valid. */
7209 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
7210 bool *valid_p
, tsubst_flags_t complain
)
7214 /* Assume the cast is invalid. */
7218 if (type
== error_mark_node
|| error_operand_p (expr
))
7219 return error_mark_node
;
7221 intype
= TREE_TYPE (expr
);
7223 /* Save casted types in the function's used types hash table. */
7224 used_types_insert (type
);
7226 /* A prvalue of non-class type is cv-unqualified. */
7227 if (!CLASS_TYPE_P (type
))
7228 type
= cv_unqualified (type
);
7230 /* [expr.reinterpret.cast]
7231 An lvalue expression of type T1 can be cast to the type
7232 "reference to T2" if an expression of type "pointer to T1" can be
7233 explicitly converted to the type "pointer to T2" using a
7234 reinterpret_cast. */
7235 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7237 if (! lvalue_p (expr
))
7239 if (complain
& tf_error
)
7240 error ("invalid cast of an rvalue expression of type "
7243 return error_mark_node
;
7246 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7247 "B" are related class types; the reinterpret_cast does not
7248 adjust the pointer. */
7249 if (TYPE_PTR_P (intype
)
7250 && (complain
& tf_warning
)
7251 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7252 COMPARE_BASE
| COMPARE_DERIVED
)))
7253 warning (0, "casting %qT to %qT does not dereference pointer",
7256 expr
= cp_build_addr_expr (expr
, complain
);
7258 if (warn_strict_aliasing
> 2)
7259 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
7261 if (expr
!= error_mark_node
)
7262 expr
= build_reinterpret_cast_1
7263 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7265 if (expr
!= error_mark_node
)
7266 /* cp_build_indirect_ref isn't right for rvalue refs. */
7267 expr
= convert_from_reference (fold_convert (type
, expr
));
7271 /* As a G++ extension, we consider conversions from member
7272 functions, and pointers to member functions to
7273 pointer-to-function and pointer-to-void types. If
7274 -Wno-pmf-conversions has not been specified,
7275 convert_member_func_to_ptr will issue an error message. */
7276 if ((TYPE_PTRMEMFUNC_P (intype
)
7277 || TREE_CODE (intype
) == METHOD_TYPE
)
7278 && TYPE_PTR_P (type
)
7279 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7280 || VOID_TYPE_P (TREE_TYPE (type
))))
7281 return convert_member_func_to_ptr (type
, expr
, complain
);
7283 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7284 array-to-pointer, and function-to-pointer conversions are
7286 expr
= decay_conversion (expr
, complain
);
7288 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7289 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7290 if (TREE_CODE (expr
) == NOP_EXPR
7291 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7292 expr
= TREE_OPERAND (expr
, 0);
7294 if (error_operand_p (expr
))
7295 return error_mark_node
;
7297 intype
= TREE_TYPE (expr
);
7299 /* [expr.reinterpret.cast]
7300 A pointer can be converted to any integral type large enough to
7301 hold it. ... A value of type std::nullptr_t can be converted to
7302 an integral type; the conversion has the same meaning and
7303 validity as a conversion of (void*)0 to the integral type. */
7304 if (CP_INTEGRAL_TYPE_P (type
)
7305 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7307 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7309 if (complain
& tf_error
)
7310 permerror (input_location
, "cast from %qH to %qI loses precision",
7313 return error_mark_node
;
7315 if (NULLPTR_TYPE_P (intype
))
7316 return build_int_cst (type
, 0);
7318 /* [expr.reinterpret.cast]
7319 A value of integral or enumeration type can be explicitly
7320 converted to a pointer. */
7321 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7324 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7325 || TYPE_PTR_OR_PTRMEM_P (type
))
7326 && same_type_p (type
, intype
))
7328 return rvalue (expr
);
7329 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7330 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7331 return build_nop (type
, expr
);
7332 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7333 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7338 && check_for_casting_away_constness (intype
, type
,
7339 REINTERPRET_CAST_EXPR
,
7341 return error_mark_node
;
7342 /* Warn about possible alignment problems. */
7343 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7344 && (complain
& tf_warning
)
7345 && !VOID_TYPE_P (type
)
7346 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7347 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7348 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7349 && min_align_of_type (TREE_TYPE (type
))
7350 > min_align_of_type (TREE_TYPE (intype
)))
7351 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7352 "increases required alignment of target type", intype
, type
);
7354 /* We need to strip nops here, because the front end likes to
7355 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
7357 if (warn_strict_aliasing
<= 2)
7358 strict_aliasing_warning (intype
, type
, sexpr
);
7360 return build_nop (type
, expr
);
7362 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7363 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7365 if (complain
& tf_warning
)
7366 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7367 object pointer type or vice versa is conditionally-supported." */
7368 warning (OPT_Wconditionally_supported
,
7369 "casting between pointer-to-function and pointer-to-object "
7370 "is conditionally-supported");
7371 return build_nop (type
, expr
);
7373 else if (VECTOR_TYPE_P (type
))
7374 return convert_to_vector (type
, expr
);
7375 else if (VECTOR_TYPE_P (intype
)
7376 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7377 return convert_to_integer_nofold (type
, expr
);
7382 if (complain
& tf_error
)
7383 error ("invalid cast from type %qT to type %qT", intype
, type
);
7384 return error_mark_node
;
7387 return cp_convert (type
, expr
, complain
);
7391 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7395 if (type
== error_mark_node
|| expr
== error_mark_node
)
7396 return error_mark_node
;
7398 if (processing_template_decl
)
7400 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7402 if (!TREE_SIDE_EFFECTS (t
)
7403 && type_dependent_expression_p (expr
))
7404 /* There might turn out to be side effects inside expr. */
7405 TREE_SIDE_EFFECTS (t
) = 1;
7406 return convert_from_reference (t
);
7409 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7410 /*valid_p=*/NULL
, complain
);
7411 if (r
!= error_mark_node
)
7413 maybe_warn_about_useless_cast (type
, expr
, complain
);
7414 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7419 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7420 return an appropriate expression. Otherwise, return
7421 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7422 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7423 performing a C-style cast, its value upon return will indicate
7424 whether or not the conversion succeeded. */
7427 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7431 tree reference_type
;
7433 /* Callers are responsible for handling error_mark_node as a
7434 destination type. */
7435 gcc_assert (dst_type
!= error_mark_node
);
7436 /* In a template, callers should be building syntactic
7437 representations of casts, not using this machinery. */
7438 gcc_assert (!processing_template_decl
);
7440 /* Assume the conversion is invalid. */
7444 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7446 if (complain
& tf_error
)
7447 error ("invalid use of const_cast with type %qT, "
7448 "which is not a pointer, "
7449 "reference, nor a pointer-to-data-member type", dst_type
);
7450 return error_mark_node
;
7453 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7455 if (complain
& tf_error
)
7456 error ("invalid use of const_cast with type %qT, which is a pointer "
7457 "or reference to a function type", dst_type
);
7458 return error_mark_node
;
7461 /* A prvalue of non-class type is cv-unqualified. */
7462 dst_type
= cv_unqualified (dst_type
);
7464 /* Save casted types in the function's used types hash table. */
7465 used_types_insert (dst_type
);
7467 src_type
= TREE_TYPE (expr
);
7468 /* Expressions do not really have reference types. */
7469 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7470 src_type
= TREE_TYPE (src_type
);
7472 /* [expr.const.cast]
7474 For two object types T1 and T2, if a pointer to T1 can be explicitly
7475 converted to the type "pointer to T2" using a const_cast, then the
7476 following conversions can also be made:
7478 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7479 type T2 using the cast const_cast<T2&>;
7481 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7482 type T2 using the cast const_cast<T2&&>; and
7484 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7485 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7487 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7489 reference_type
= dst_type
;
7490 if (!TYPE_REF_IS_RVALUE (dst_type
)
7496 if (complain
& tf_error
)
7497 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7498 src_type
, dst_type
);
7499 return error_mark_node
;
7501 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7502 src_type
= build_pointer_type (src_type
);
7506 reference_type
= NULL_TREE
;
7507 /* If the destination type is not a reference type, the
7508 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7509 conversions are performed. */
7510 src_type
= type_decays_to (src_type
);
7511 if (src_type
== error_mark_node
)
7512 return error_mark_node
;
7515 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7517 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7522 /* This cast is actually a C-style cast. Issue a warning if
7523 the user is making a potentially unsafe cast. */
7524 check_for_casting_away_constness (src_type
, dst_type
,
7525 CAST_EXPR
, complain
);
7526 /* ??? comp_ptr_ttypes_const ignores TYPE_ALIGN. */
7527 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7528 && (complain
& tf_warning
)
7529 && min_align_of_type (TREE_TYPE (dst_type
))
7530 > min_align_of_type (TREE_TYPE (src_type
)))
7531 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7532 "increases required alignment of target type",
7533 src_type
, dst_type
);
7537 expr
= cp_build_addr_expr (expr
, complain
);
7538 if (expr
== error_mark_node
)
7539 return error_mark_node
;
7540 expr
= build_nop (reference_type
, expr
);
7541 return convert_from_reference (expr
);
7545 expr
= decay_conversion (expr
, complain
);
7546 if (expr
== error_mark_node
)
7547 return error_mark_node
;
7549 /* build_c_cast puts on a NOP_EXPR to make the result not an
7550 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7551 non-lvalue context. */
7552 if (TREE_CODE (expr
) == NOP_EXPR
7553 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7554 expr
= TREE_OPERAND (expr
, 0);
7555 return build_nop (dst_type
, expr
);
7559 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7560 TREE_TYPE (src_type
)))
7561 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7565 if (complain
& tf_error
)
7566 error ("invalid const_cast from type %qT to type %qT",
7567 src_type
, dst_type
);
7568 return error_mark_node
;
7572 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7576 if (type
== error_mark_node
|| error_operand_p (expr
))
7577 return error_mark_node
;
7579 if (processing_template_decl
)
7581 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7583 if (!TREE_SIDE_EFFECTS (t
)
7584 && type_dependent_expression_p (expr
))
7585 /* There might turn out to be side effects inside expr. */
7586 TREE_SIDE_EFFECTS (t
) = 1;
7587 return convert_from_reference (t
);
7590 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7591 if (r
!= error_mark_node
)
7593 maybe_warn_about_useless_cast (type
, expr
, complain
);
7594 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7599 /* Like cp_build_c_cast, but for the c-common bits. */
7602 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7604 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7607 /* Like the "build_c_cast" used for c-common, but using cp_expr to
7608 preserve location information even for tree nodes that don't
7612 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
7614 cp_expr result
= cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7615 result
.set_location (loc
);
7619 /* Build an expression representing an explicit C-style cast to type
7620 TYPE of expression EXPR. */
7623 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7629 if (type
== error_mark_node
|| error_operand_p (expr
))
7630 return error_mark_node
;
7632 if (processing_template_decl
)
7634 tree t
= build_min (CAST_EXPR
, type
,
7635 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7636 /* We don't know if it will or will not have side effects. */
7637 TREE_SIDE_EFFECTS (t
) = 1;
7638 return convert_from_reference (t
);
7641 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7642 'Class') should always be retained, because this information aids
7643 in method lookup. */
7644 if (objc_is_object_ptr (type
)
7645 && objc_is_object_ptr (TREE_TYPE (expr
)))
7646 return build_nop (type
, expr
);
7648 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7649 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7650 if (TREE_CODE (type
) != REFERENCE_TYPE
7651 && TREE_CODE (value
) == NOP_EXPR
7652 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7653 value
= TREE_OPERAND (value
, 0);
7655 if (TREE_CODE (type
) == ARRAY_TYPE
)
7657 /* Allow casting from T1* to T2[] because Cfront allows it.
7658 NIHCL uses it. It is not valid ISO C++ however. */
7659 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7661 if (complain
& tf_error
)
7662 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7664 return error_mark_node
;
7665 type
= build_pointer_type (TREE_TYPE (type
));
7669 if (complain
& tf_error
)
7670 error ("ISO C++ forbids casting to an array type %qT", type
);
7671 return error_mark_node
;
7675 if (TREE_CODE (type
) == FUNCTION_TYPE
7676 || TREE_CODE (type
) == METHOD_TYPE
)
7678 if (complain
& tf_error
)
7679 error ("invalid cast to function type %qT", type
);
7680 return error_mark_node
;
7683 if (TYPE_PTR_P (type
)
7684 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7685 /* Casting to an integer of smaller size is an error detected elsewhere. */
7686 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7687 /* Don't warn about converting any constant. */
7688 && !TREE_CONSTANT (value
))
7689 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7690 "cast to pointer from integer of different size");
7692 /* A C-style cast can be a const_cast. */
7693 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7697 if (result
!= error_mark_node
)
7699 maybe_warn_about_useless_cast (type
, value
, complain
);
7700 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7705 /* Or a static cast. */
7706 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7707 &valid_p
, complain
);
7708 /* Or a reinterpret_cast. */
7710 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7711 &valid_p
, complain
);
7712 /* The static_cast or reinterpret_cast may be followed by a
7715 /* A valid cast may result in errors if, for example, a
7716 conversion to an ambiguous base class is required. */
7717 && !error_operand_p (result
))
7721 maybe_warn_about_useless_cast (type
, value
, complain
);
7722 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7724 /* Non-class rvalues always have cv-unqualified type. */
7725 if (!CLASS_TYPE_P (type
))
7726 type
= TYPE_MAIN_VARIANT (type
);
7727 result_type
= TREE_TYPE (result
);
7728 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
7729 result_type
= TYPE_MAIN_VARIANT (result_type
);
7730 /* If the type of RESULT does not match TYPE, perform a
7731 const_cast to make it match. If the static_cast or
7732 reinterpret_cast succeeded, we will differ by at most
7733 cv-qualification, so the follow-on const_cast is guaranteed
7735 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7737 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7738 gcc_assert (valid_p
);
7743 return error_mark_node
;
7746 /* For use from the C common bits. */
7748 build_modify_expr (location_t location
,
7749 tree lhs
, tree
/*lhs_origtype*/,
7750 enum tree_code modifycode
,
7751 location_t
/*rhs_location*/, tree rhs
,
7752 tree
/*rhs_origtype*/)
7754 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
7755 tf_warning_or_error
);
7758 /* Build an assignment expression of lvalue LHS from value RHS.
7759 MODIFYCODE is the code for a binary operator that we use
7760 to combine the old value of LHS with RHS to get the new value.
7761 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7763 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7766 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7767 tree rhs
, tsubst_flags_t complain
)
7769 lhs
= mark_lvalue_use_nonread (lhs
);
7771 tree result
= NULL_TREE
;
7773 tree lhstype
= TREE_TYPE (lhs
);
7775 tree olhstype
= lhstype
;
7776 bool plain_assign
= (modifycode
== NOP_EXPR
);
7777 bool compound_side_effects_p
= false;
7778 tree preeval
= NULL_TREE
;
7780 /* Avoid duplicate error messages from operands that had errors. */
7781 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7782 return error_mark_node
;
7784 while (TREE_CODE (lhs
) == COMPOUND_EXPR
)
7786 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7787 compound_side_effects_p
= true;
7788 lhs
= TREE_OPERAND (lhs
, 1);
7791 /* Handle control structure constructs used as "lvalues". Note that we
7792 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
7793 switch (TREE_CODE (lhs
))
7795 /* Handle --foo = 5; as these are valid constructs in C++. */
7796 case PREDECREMENT_EXPR
:
7797 case PREINCREMENT_EXPR
:
7798 if (compound_side_effects_p
)
7799 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7800 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7801 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7802 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7803 TREE_OPERAND (lhs
, 1));
7804 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7806 /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
7807 and looked through the COMPOUND_EXPRs, readd them now around
7808 the resulting lhs. */
7809 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7811 lhs
= build2 (COMPOUND_EXPR
, lhstype
, TREE_OPERAND (olhs
, 0), lhs
);
7812 tree
*ptr
= &TREE_OPERAND (lhs
, 1);
7813 for (olhs
= TREE_OPERAND (olhs
, 1);
7814 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7815 olhs
= TREE_OPERAND (olhs
, 1))
7817 *ptr
= build2 (COMPOUND_EXPR
, lhstype
,
7818 TREE_OPERAND (olhs
, 0), *ptr
);
7819 ptr
= &TREE_OPERAND (*ptr
, 1);
7825 if (compound_side_effects_p
)
7826 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7827 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7828 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7829 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7830 TREE_OPERAND (lhs
, 1));
7831 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7832 goto maybe_add_compound
;
7836 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7837 when neither operand has side-effects. */
7838 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7839 return error_mark_node
;
7841 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7842 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7844 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7845 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7847 TREE_OPERAND (lhs
, 0),
7848 TREE_OPERAND (lhs
, 1)),
7849 TREE_OPERAND (lhs
, 0),
7850 TREE_OPERAND (lhs
, 1));
7853 /* Handle (a ? b : c) used as an "lvalue". */
7856 /* Produce (a ? (b = rhs) : (c = rhs))
7857 except that the RHS goes through a save-expr
7858 so the code to compute it is only emitted once. */
7861 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7863 if (complain
& tf_error
)
7864 error ("void value not ignored as it ought to be");
7865 return error_mark_node
;
7868 rhs
= stabilize_expr (rhs
, &preeval
);
7870 /* Check this here to avoid odd errors when trying to convert
7871 a throw to the type of the COND_EXPR. */
7872 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7873 return error_mark_node
;
7875 cond
= build_conditional_expr
7876 (input_location
, TREE_OPERAND (lhs
, 0),
7877 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7878 modifycode
, rhs
, complain
),
7879 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7880 modifycode
, rhs
, complain
),
7883 if (cond
== error_mark_node
)
7885 /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
7886 and looked through the COMPOUND_EXPRs, readd them now around
7887 the resulting cond before adding the preevaluated rhs. */
7888 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7890 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7891 TREE_OPERAND (olhs
, 0), cond
);
7892 tree
*ptr
= &TREE_OPERAND (cond
, 1);
7893 for (olhs
= TREE_OPERAND (olhs
, 1);
7894 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7895 olhs
= TREE_OPERAND (olhs
, 1))
7897 *ptr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7898 TREE_OPERAND (olhs
, 0), *ptr
);
7899 ptr
= &TREE_OPERAND (*ptr
, 1);
7902 /* Make sure the code to compute the rhs comes out
7903 before the split. */
7913 if (modifycode
== INIT_EXPR
)
7915 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7916 /* Do the default thing. */;
7917 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
7919 /* Compound literal. */
7920 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
7921 /* Call convert to generate an error; see PR 11063. */
7922 rhs
= convert (lhstype
, rhs
);
7923 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
7924 TREE_SIDE_EFFECTS (result
) = 1;
7927 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
7928 /* Do the default thing. */;
7931 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
7932 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
7933 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
7935 release_tree_vector (rhs_vec
);
7936 if (result
== NULL_TREE
)
7937 return error_mark_node
;
7943 lhs
= require_complete_type_sfinae (lhs
, complain
);
7944 if (lhs
== error_mark_node
)
7945 return error_mark_node
;
7947 if (modifycode
== NOP_EXPR
)
7949 if (c_dialect_objc ())
7951 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
7956 /* `operator=' is not an inheritable operator. */
7957 if (! MAYBE_CLASS_TYPE_P (lhstype
))
7958 /* Do the default thing. */;
7961 result
= build_new_op (input_location
, MODIFY_EXPR
,
7962 LOOKUP_NORMAL
, lhs
, rhs
,
7963 make_node (NOP_EXPR
), /*overload=*/NULL
,
7965 if (result
== NULL_TREE
)
7966 return error_mark_node
;
7973 tree init
= NULL_TREE
;
7975 /* A binary op has been requested. Combine the old LHS
7976 value with the RHS producing the value we should actually
7977 store into the LHS. */
7978 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
7979 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
7980 || MAYBE_CLASS_TYPE_P (lhstype
)));
7982 /* Preevaluate the RHS to make sure its evaluation is complete
7983 before the lvalue-to-rvalue conversion of the LHS:
7985 [expr.ass] With respect to an indeterminately-sequenced
7986 function call, the operation of a compound assignment is a
7987 single evaluation. [ Note: Therefore, a function call shall
7988 not intervene between the lvalue-to-rvalue conversion and the
7989 side effect associated with any single compound assignment
7990 operator. -- end note ] */
7991 lhs
= cp_stabilize_reference (lhs
);
7993 if (rhs
== error_mark_node
)
7994 return error_mark_node
;
7995 rhs
= stabilize_expr (rhs
, &init
);
7996 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
7997 if (newrhs
== error_mark_node
)
7999 if (complain
& tf_error
)
8000 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
8001 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
8002 return error_mark_node
;
8006 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
8008 /* Now it looks like a plain assignment. */
8009 modifycode
= NOP_EXPR
;
8010 if (c_dialect_objc ())
8012 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
8017 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
8018 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
8021 /* The left-hand side must be an lvalue. */
8022 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
8023 return error_mark_node
;
8025 /* Warn about modifying something that is `const'. Don't warn if
8026 this is initialization. */
8027 if (modifycode
!= INIT_EXPR
8028 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
8029 /* Functions are not modifiable, even though they are
8031 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
8032 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
8033 /* If it's an aggregate and any field is const, then it is
8034 effectively const. */
8035 || (CLASS_TYPE_P (lhstype
)
8036 && C_TYPE_FIELDS_READONLY (lhstype
))))
8038 if (complain
& tf_error
)
8039 cxx_readonly_error (lhs
, lv_assign
);
8041 return error_mark_node
;
8044 /* If storing into a structure or union member, it may have been given a
8045 lowered bitfield type. We need to convert to the declared type first,
8046 so retrieve it now. */
8048 olhstype
= unlowered_expr_type (lhs
);
8050 /* Convert new value to destination type. */
8052 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
8056 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
8058 if (modifycode
!= INIT_EXPR
)
8060 if (complain
& tf_error
)
8061 error ("assigning to an array from an initializer list");
8062 return error_mark_node
;
8064 if (check_array_initializer (lhs
, lhstype
, newrhs
))
8065 return error_mark_node
;
8066 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8067 if (newrhs
== error_mark_node
)
8068 return error_mark_node
;
8071 /* C++11 8.5/17: "If the destination type is an array of characters,
8072 an array of char16_t, an array of char32_t, or an array of wchar_t,
8073 and the initializer is a string literal...". */
8074 else if (TREE_CODE (newrhs
) == STRING_CST
8075 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
8076 && modifycode
== INIT_EXPR
)
8078 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8079 if (newrhs
== error_mark_node
)
8080 return error_mark_node
;
8083 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
8084 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
8086 if (complain
& tf_error
)
8087 error ("incompatible types in assignment of %qT to %qT",
8088 TREE_TYPE (rhs
), lhstype
);
8089 return error_mark_node
;
8092 /* Allow array assignment in compiler-generated code. */
8093 else if (!current_function_decl
8094 || !DECL_DEFAULTED_FN (current_function_decl
))
8096 /* This routine is used for both initialization and assignment.
8097 Make sure the diagnostic message differentiates the context. */
8098 if (complain
& tf_error
)
8100 if (modifycode
== INIT_EXPR
)
8101 error ("array used as initializer");
8103 error ("invalid array assignment");
8105 return error_mark_node
;
8108 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
8109 ? 1 + (modifycode
!= INIT_EXPR
): 0;
8110 result
= build_vec_init (lhs
, NULL_TREE
, newrhs
,
8111 /*explicit_value_init_p=*/false,
8112 from_array
, complain
);
8116 if (modifycode
== INIT_EXPR
)
8117 /* Calls with INIT_EXPR are all direct-initialization, so don't set
8118 LOOKUP_ONLYCONVERTING. */
8119 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
8120 ICR_INIT
, NULL_TREE
, 0,
8123 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
8124 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
8126 if (!same_type_p (lhstype
, olhstype
))
8127 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
8129 if (modifycode
!= INIT_EXPR
)
8131 if (TREE_CODE (newrhs
) == CALL_EXPR
8132 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
8133 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
8135 /* Can't initialize directly from a TARGET_EXPR, since that would
8136 cause the lhs to be constructed twice, and possibly result in
8137 accidental self-initialization. So we force the TARGET_EXPR to be
8138 expanded without a target. */
8139 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
8140 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
8141 TREE_OPERAND (newrhs
, 0));
8144 if (newrhs
== error_mark_node
)
8145 return error_mark_node
;
8147 if (c_dialect_objc () && flag_objc_gc
)
8149 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
8155 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
8156 lhstype
, lhs
, newrhs
);
8158 TREE_SIDE_EFFECTS (result
) = 1;
8160 TREE_NO_WARNING (result
) = 1;
8164 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), preeval
, result
);
8169 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
8170 tree rhs
, tsubst_flags_t complain
)
8172 tree orig_lhs
= lhs
;
8173 tree orig_rhs
= rhs
;
8174 tree overload
= NULL_TREE
;
8175 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
8177 if (processing_template_decl
)
8179 if (modifycode
== NOP_EXPR
8180 || type_dependent_expression_p (lhs
)
8181 || type_dependent_expression_p (rhs
))
8182 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
8183 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
8186 lhs
= build_non_dependent_expr (lhs
);
8187 rhs
= build_non_dependent_expr (rhs
);
8190 if (modifycode
!= NOP_EXPR
)
8192 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
8193 lhs
, rhs
, op
, &overload
, complain
);
8196 if (rval
== error_mark_node
)
8198 TREE_NO_WARNING (rval
) = 1;
8199 if (processing_template_decl
)
8201 if (overload
!= NULL_TREE
)
8202 return (build_min_non_dep_op_overload
8203 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
8205 return (build_min_non_dep
8206 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
8211 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
8214 /* Helper function for get_delta_difference which assumes FROM is a base
8215 class of TO. Returns a delta for the conversion of pointer-to-member
8216 of FROM to pointer-to-member of TO. If the conversion is invalid and
8217 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
8218 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
8219 If C_CAST_P is true, this conversion is taking place as part of a
8223 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
8224 tsubst_flags_t complain
)
8229 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
8232 if (binfo
== error_mark_node
)
8234 if (!(complain
& tf_error
))
8235 return error_mark_node
;
8237 error (" in pointer to member function conversion");
8238 return size_zero_node
;
8242 if (kind
!= bk_via_virtual
)
8243 return BINFO_OFFSET (binfo
);
8245 /* FROM is a virtual base class of TO. Issue an error or warning
8246 depending on whether or not this is a reinterpret cast. */
8248 if (!(complain
& tf_error
))
8249 return error_mark_node
;
8251 error ("pointer to member conversion via virtual base %qT",
8252 BINFO_TYPE (binfo_from_vbase (binfo
)));
8254 return size_zero_node
;
8261 /* Get difference in deltas for different pointer to member function
8262 types. If the conversion is invalid and tf_error is not set in
8263 COMPLAIN, returns error_mark_node, otherwise returns an integer
8264 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
8265 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
8266 conversions as well. If C_CAST_P is true this conversion is taking
8267 place as part of a C-style cast.
8269 Note that the naming of FROM and TO is kind of backwards; the return
8270 value is what we add to a TO in order to get a FROM. They are named
8271 this way because we call this function to find out how to convert from
8272 a pointer to member of FROM to a pointer to member of TO. */
8275 get_delta_difference (tree from
, tree to
,
8276 bool allow_inverse_p
,
8277 bool c_cast_p
, tsubst_flags_t complain
)
8281 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
8282 /* Pointer to member of incomplete class is permitted*/
8283 result
= size_zero_node
;
8285 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
8287 if (result
== error_mark_node
)
8288 return error_mark_node
;
8292 if (!allow_inverse_p
)
8294 if (!(complain
& tf_error
))
8295 return error_mark_node
;
8297 error_not_base_type (from
, to
);
8298 error (" in pointer to member conversion");
8299 result
= size_zero_node
;
8303 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
8305 if (result
== error_mark_node
)
8306 return error_mark_node
;
8309 result
= size_diffop_loc (input_location
,
8310 size_zero_node
, result
);
8313 if (!(complain
& tf_error
))
8314 return error_mark_node
;
8316 error_not_base_type (from
, to
);
8317 error (" in pointer to member conversion");
8318 result
= size_zero_node
;
8323 return convert_to_integer (ptrdiff_type_node
, result
);
8326 /* Return a constructor for the pointer-to-member-function TYPE using
8327 the other components as specified. */
8330 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8335 vec
<constructor_elt
, va_gc
> *v
;
8337 /* Pull the FIELD_DECLs out of the type. */
8338 pfn_field
= TYPE_FIELDS (type
);
8339 delta_field
= DECL_CHAIN (pfn_field
);
8341 /* Make sure DELTA has the type we want. */
8342 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8344 /* Convert to the correct target type if necessary. */
8345 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8347 /* Finish creating the initializer. */
8349 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8350 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8351 u
= build_constructor (type
, v
);
8352 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8353 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8354 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8356 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8361 /* Build a constructor for a pointer to member function. It can be
8362 used to initialize global variables, local variable, or used
8363 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8366 If FORCE is nonzero, then force this conversion, even if
8367 we would rather not do it. Usually set when using an explicit
8368 cast. A C-style cast is being processed iff C_CAST_P is true.
8370 Return error_mark_node, if something goes wrong. */
8373 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8374 tsubst_flags_t complain
)
8380 if (error_operand_p (pfn
))
8381 return error_mark_node
;
8383 pfn_type
= TREE_TYPE (pfn
);
8384 to_type
= build_ptrmemfunc_type (type
);
8386 /* Handle multiple conversions of pointer to member functions. */
8387 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8389 tree delta
= NULL_TREE
;
8390 tree npfn
= NULL_TREE
;
8394 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8395 LOOKUP_NORMAL
, complain
))
8397 if (complain
& tf_error
)
8398 error ("invalid conversion to type %qT from type %qT",
8401 return error_mark_node
;
8404 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8405 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8407 c_cast_p
, complain
);
8408 if (n
== error_mark_node
)
8409 return error_mark_node
;
8411 /* We don't have to do any conversion to convert a
8412 pointer-to-member to its own type. But, we don't want to
8413 just return a PTRMEM_CST if there's an explicit cast; that
8414 cast should make the expression an invalid template argument. */
8415 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8417 if (same_type_p (to_type
, pfn_type
))
8419 else if (integer_zerop (n
))
8420 return build_reinterpret_cast (to_type
, pfn
,
8424 if (TREE_SIDE_EFFECTS (pfn
))
8425 pfn
= save_expr (pfn
);
8427 /* Obtain the function pointer and the current DELTA. */
8428 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8429 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8432 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8433 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8436 /* Just adjust the DELTA field. */
8437 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8438 (TREE_TYPE (delta
), ptrdiff_type_node
));
8439 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8440 n
= cp_build_binary_op (input_location
,
8441 LSHIFT_EXPR
, n
, integer_one_node
,
8443 delta
= cp_build_binary_op (input_location
,
8444 PLUS_EXPR
, delta
, n
, complain
);
8445 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8448 /* Handle null pointer to member function conversions. */
8449 if (null_ptr_cst_p (pfn
))
8451 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8452 return build_ptrmemfunc1 (to_type
,
8457 if (type_unknown_p (pfn
))
8458 return instantiate_type (type
, pfn
, complain
);
8460 fn
= TREE_OPERAND (pfn
, 0);
8461 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8462 /* In a template, we will have preserved the
8464 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8465 return make_ptrmem_cst (to_type
, fn
);
8468 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8471 ??? There is no consistency as to the types returned for the above
8472 values. Some code acts as if it were a sizetype and some as if it were
8473 integer_type_node. */
8476 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8478 tree type
= TREE_TYPE (cst
);
8479 tree fn
= PTRMEM_CST_MEMBER (cst
);
8480 tree ptr_class
, fn_class
;
8482 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8484 /* The class that the function belongs to. */
8485 fn_class
= DECL_CONTEXT (fn
);
8487 /* The class that we're creating a pointer to member of. */
8488 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8490 /* First, calculate the adjustment to the function's class. */
8491 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8492 /*c_cast_p=*/0, tf_warning_or_error
);
8494 if (!DECL_VIRTUAL_P (fn
))
8495 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8496 build_addr_func (fn
, tf_warning_or_error
));
8499 /* If we're dealing with a virtual function, we have to adjust 'this'
8500 again, to point to the base which provides the vtable entry for
8501 fn; the call will do the opposite adjustment. */
8502 tree orig_class
= DECL_CONTEXT (fn
);
8503 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8504 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8505 *delta
, BINFO_OFFSET (binfo
));
8507 /* We set PFN to the vtable offset at which the function can be
8508 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8509 case delta is shifted left, and then incremented). */
8510 *pfn
= DECL_VINDEX (fn
);
8511 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8512 TYPE_SIZE_UNIT (vtable_entry_type
));
8514 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8516 case ptrmemfunc_vbit_in_pfn
:
8517 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8521 case ptrmemfunc_vbit_in_delta
:
8522 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8523 *delta
, integer_one_node
);
8524 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8525 *delta
, integer_one_node
);
8532 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8536 /* Return an expression for PFN from the pointer-to-member function
8540 pfn_from_ptrmemfunc (tree t
)
8542 if (TREE_CODE (t
) == PTRMEM_CST
)
8547 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8552 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8555 /* Return an expression for DELTA from the pointer-to-member function
8559 delta_from_ptrmemfunc (tree t
)
8561 if (TREE_CODE (t
) == PTRMEM_CST
)
8566 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8571 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8574 /* Convert value RHS to type TYPE as preparation for an assignment to
8575 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8576 implicit conversion is. If FNDECL is non-NULL, we are doing the
8577 conversion in order to pass the PARMNUMth argument of FNDECL.
8578 If FNDECL is NULL, we are doing the conversion in function pointer
8579 argument passing, conversion in initialization, etc. */
8582 convert_for_assignment (tree type
, tree rhs
,
8583 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8584 tsubst_flags_t complain
, int flags
)
8587 enum tree_code coder
;
8589 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8590 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8591 rhs
= TREE_OPERAND (rhs
, 0);
8593 /* Handle [dcl.init.list] direct-list-initialization from
8594 single element of enumeration with a fixed underlying type. */
8595 if (is_direct_enum_init (type
, rhs
))
8597 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
8598 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
8600 warning_sentinel
w (warn_useless_cast
);
8601 rhs
= cp_build_c_cast (type
, elt
, complain
);
8604 rhs
= error_mark_node
;
8607 rhstype
= TREE_TYPE (rhs
);
8608 coder
= TREE_CODE (rhstype
);
8610 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8611 && vector_types_convertible_p (type
, rhstype
, true))
8613 rhs
= mark_rvalue_use (rhs
);
8614 return convert (type
, rhs
);
8617 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8618 return error_mark_node
;
8619 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8620 return error_mark_node
;
8622 /* The RHS of an assignment cannot have void type. */
8623 if (coder
== VOID_TYPE
)
8625 if (complain
& tf_error
)
8626 error ("void value not ignored as it ought to be");
8627 return error_mark_node
;
8630 if (c_dialect_objc ())
8634 tree rname
= fndecl
;
8645 selector
= objc_message_selector ();
8647 if (selector
&& parmno
> 1)
8654 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8656 rhs
= mark_rvalue_use (rhs
);
8657 return convert (type
, rhs
);
8663 The expression is implicitly converted (clause _conv_) to the
8664 cv-unqualified type of the left operand.
8666 We allow bad conversions here because by the time we get to this point
8667 we are committed to doing the conversion. If we end up doing a bad
8668 conversion, convert_like will complain. */
8669 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8671 /* When -Wno-pmf-conversions is use, we just silently allow
8672 conversions from pointers-to-members to plain pointers. If
8673 the conversion doesn't work, cp_convert will complain. */
8675 && TYPE_PTR_P (type
)
8676 && TYPE_PTRMEMFUNC_P (rhstype
))
8677 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8680 if (complain
& tf_error
)
8682 /* If the right-hand side has unknown type, then it is an
8683 overloaded function. Call instantiate_type to get error
8685 if (rhstype
== unknown_type_node
)
8687 tree r
= instantiate_type (type
, rhs
, tf_warning_or_error
);
8688 /* -fpermissive might allow this; recurse. */
8690 return convert_for_assignment (type
, r
, errtype
, fndecl
,
8691 parmnum
, complain
, flags
);
8694 error ("cannot convert %qH to %qI for argument %qP to %qD",
8695 rhstype
, type
, parmnum
, fndecl
);
8699 case ICR_DEFAULT_ARGUMENT
:
8700 error ("cannot convert %qH to %qI in default argument",
8704 error ("cannot convert %qH to %qI in argument passing",
8707 case ICR_CONVERTING
:
8708 error ("cannot convert %qH to %qI",
8712 error ("cannot convert %qH to %qI in initialization",
8716 error ("cannot convert %qH to %qI in return",
8720 error ("cannot convert %qH to %qI in assignment",
8726 if (TYPE_PTR_P (rhstype
)
8727 && TYPE_PTR_P (type
)
8728 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8729 && CLASS_TYPE_P (TREE_TYPE (type
))
8730 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8731 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8732 (TREE_TYPE (rhstype
))),
8733 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8735 return error_mark_node
;
8738 if (warn_suggest_attribute_format
)
8740 const enum tree_code codel
= TREE_CODE (type
);
8741 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8743 && check_missing_format_attribute (type
, rhstype
)
8744 && (complain
& tf_warning
))
8748 case ICR_DEFAULT_ARGUMENT
:
8750 warning (OPT_Wsuggest_attribute_format
,
8751 "parameter %qP of %qD might be a candidate "
8752 "for a format attribute", parmnum
, fndecl
);
8754 warning (OPT_Wsuggest_attribute_format
,
8755 "parameter might be a candidate "
8756 "for a format attribute");
8758 case ICR_CONVERTING
:
8759 warning (OPT_Wsuggest_attribute_format
,
8760 "target of conversion might be a candidate "
8761 "for a format attribute");
8764 warning (OPT_Wsuggest_attribute_format
,
8765 "target of initialization might be a candidate "
8766 "for a format attribute");
8769 warning (OPT_Wsuggest_attribute_format
,
8770 "return type might be a candidate "
8771 "for a format attribute");
8774 warning (OPT_Wsuggest_attribute_format
,
8775 "left-hand side of assignment might be a candidate "
8776 "for a format attribute");
8783 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8785 if (warn_parentheses
8786 && TREE_CODE (type
) == BOOLEAN_TYPE
8787 && TREE_CODE (rhs
) == MODIFY_EXPR
8788 && !TREE_NO_WARNING (rhs
)
8789 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8790 && (complain
& tf_warning
))
8792 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8794 warning_at (loc
, OPT_Wparentheses
,
8795 "suggest parentheses around assignment used as truth value");
8796 TREE_NO_WARNING (rhs
) = 1;
8799 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8803 /* Convert RHS to be of type TYPE.
8804 If EXP is nonzero, it is the target of the initialization.
8805 ERRTYPE indicates what kind of error the implicit conversion is.
8807 Two major differences between the behavior of
8808 `convert_for_assignment' and `convert_for_initialization'
8809 are that references are bashed in the former, while
8810 copied in the latter, and aggregates are assigned in
8811 the former (operator=) while initialized in the
8814 If using constructor make sure no conversion operator exists, if one does
8815 exist, an ambiguity exists. */
8818 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8819 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8820 tsubst_flags_t complain
)
8822 enum tree_code codel
= TREE_CODE (type
);
8824 enum tree_code coder
;
8826 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8827 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8828 if (TREE_CODE (rhs
) == NOP_EXPR
8829 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8830 && codel
!= REFERENCE_TYPE
)
8831 rhs
= TREE_OPERAND (rhs
, 0);
8833 if (type
== error_mark_node
8834 || rhs
== error_mark_node
8835 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8836 return error_mark_node
;
8838 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8840 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8841 && TREE_CODE (type
) != ARRAY_TYPE
8842 && (TREE_CODE (type
) != REFERENCE_TYPE
8843 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8844 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8845 && !TYPE_REFFN_P (type
))
8846 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8847 rhs
= decay_conversion (rhs
, complain
);
8849 rhstype
= TREE_TYPE (rhs
);
8850 coder
= TREE_CODE (rhstype
);
8852 if (coder
== ERROR_MARK
)
8853 return error_mark_node
;
8855 /* We accept references to incomplete types, so we can
8856 return here before checking if RHS is of complete type. */
8858 if (codel
== REFERENCE_TYPE
)
8860 /* This should eventually happen in convert_arguments. */
8861 int savew
= 0, savee
= 0;
8864 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8865 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8868 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8869 inform (DECL_SOURCE_LOCATION (fndecl
),
8870 "in passing argument %P of %qD", parmnum
, fndecl
);
8876 exp
= require_complete_type_sfinae (exp
, complain
);
8877 if (exp
== error_mark_node
)
8878 return error_mark_node
;
8880 rhstype
= non_reference (rhstype
);
8882 type
= complete_type (type
);
8884 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8885 /* Don't try to do copy-initialization if we already have
8886 direct-initialization. */
8889 if (MAYBE_CLASS_TYPE_P (type
))
8890 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8892 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8896 /* If RETVAL is the address of, or a reference to, a local variable or
8897 temporary give an appropriate warning and return true. */
8900 maybe_warn_about_returning_address_of_local (tree retval
)
8902 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8903 tree whats_returned
= fold_for_warn (retval
);
8907 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
8908 whats_returned
= TREE_OPERAND (whats_returned
, 1);
8909 else if (CONVERT_EXPR_P (whats_returned
)
8910 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
8911 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8916 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
8918 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8920 while (TREE_CODE (whats_returned
) == COMPONENT_REF
8921 || TREE_CODE (whats_returned
) == ARRAY_REF
)
8922 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8924 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8926 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
8927 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
8929 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
8932 if (VAR_P (whats_returned
)
8933 && DECL_NAME (whats_returned
)
8934 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
8936 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
8941 if (DECL_P (whats_returned
)
8942 && DECL_NAME (whats_returned
)
8943 && DECL_FUNCTION_SCOPE_P (whats_returned
)
8944 && !is_capture_proxy (whats_returned
)
8945 && !(TREE_STATIC (whats_returned
)
8946 || TREE_PUBLIC (whats_returned
)))
8948 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8949 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8950 OPT_Wreturn_local_addr
,
8951 "reference to local variable %qD returned",
8953 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
8954 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8955 OPT_Wreturn_local_addr
, "address of label %qD returned",
8958 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8959 OPT_Wreturn_local_addr
, "address of local variable %qD "
8960 "returned", whats_returned
);
8967 /* Check that returning RETVAL from the current function is valid.
8968 Return an expression explicitly showing all conversions required to
8969 change RETVAL into the function return type, and to assign it to
8970 the DECL_RESULT for the function. Set *NO_WARNING to true if
8971 code reaches end of non-void function warning shouldn't be issued
8972 on this RETURN_EXPR. */
8975 check_return_expr (tree retval
, bool *no_warning
)
8978 /* The type actually returned by the function. */
8980 /* The type the function is declared to return, or void if
8981 the declared type is incomplete. */
8983 int fn_returns_value_p
;
8984 bool named_return_value_okay_p
;
8986 *no_warning
= false;
8988 /* A `volatile' function is one that isn't supposed to return, ever.
8989 (This is a G++ extension, used to get better code for functions
8990 that call the `volatile' function.) */
8991 if (TREE_THIS_VOLATILE (current_function_decl
))
8992 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8994 /* Check for various simple errors. */
8995 if (DECL_DESTRUCTOR_P (current_function_decl
))
8998 error ("returning a value from a destructor");
9001 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
9003 if (in_function_try_handler
)
9004 /* If a return statement appears in a handler of the
9005 function-try-block of a constructor, the program is ill-formed. */
9006 error ("cannot return from a handler of a function-try-block of a constructor");
9008 /* You can't return a value from a constructor. */
9009 error ("returning a value from a constructor");
9013 const tree saved_retval
= retval
;
9015 if (processing_template_decl
)
9017 current_function_returns_value
= 1;
9019 if (check_for_bare_parameter_packs (retval
))
9020 return error_mark_node
;
9022 /* If one of the types might be void, we can't tell whether we're
9023 returning a value. */
9024 if ((WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
9025 && !current_function_auto_return_pattern
)
9026 || (retval
!= NULL_TREE
9027 && (TREE_TYPE (retval
) == NULL_TREE
9028 || WILDCARD_TYPE_P (TREE_TYPE (retval
)))))
9032 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
9034 /* Deduce auto return type from a return statement. */
9035 if (current_function_auto_return_pattern
)
9040 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
9042 /* Give a helpful error message. */
9043 error ("return-statement with no value, in function returning %qT",
9044 current_function_auto_return_pattern
);
9045 inform (input_location
, "only plain %<auto%> return type can be "
9046 "deduced to %<void%>");
9047 type
= error_mark_node
;
9049 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
9051 error ("returning initializer list");
9052 type
= error_mark_node
;
9058 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
9059 type
= do_auto_deduction (current_function_auto_return_pattern
,
9063 if (type
== error_mark_node
)
9065 else if (functype
== current_function_auto_return_pattern
)
9066 apply_deduced_return_type (current_function_decl
, type
);
9067 else if (!same_type_p (type
, functype
))
9069 if (LAMBDA_FUNCTION_P (current_function_decl
))
9070 error ("inconsistent types %qT and %qT deduced for "
9071 "lambda return type", functype
, type
);
9073 error ("inconsistent deduction for auto return type: "
9074 "%qT and then %qT", functype
, type
);
9079 result
= DECL_RESULT (current_function_decl
);
9080 valtype
= TREE_TYPE (result
);
9081 gcc_assert (valtype
!= NULL_TREE
);
9082 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
9084 /* Check for a return statement with no return value in a function
9085 that's supposed to return a value. */
9086 if (!retval
&& fn_returns_value_p
)
9088 if (functype
!= error_mark_node
)
9089 permerror (input_location
, "return-statement with no value, in "
9090 "function returning %qT", valtype
);
9091 /* Remember that this function did return. */
9092 current_function_returns_value
= 1;
9093 /* And signal caller that TREE_NO_WARNING should be set on the
9094 RETURN_EXPR to avoid control reaches end of non-void function
9095 warnings in tree-cfg.c. */
9098 /* Check for a return statement with a value in a function that
9099 isn't supposed to return a value. */
9100 else if (retval
&& !fn_returns_value_p
)
9102 if (VOID_TYPE_P (TREE_TYPE (retval
)))
9103 /* You can return a `void' value from a function of `void'
9104 type. In that case, we have to evaluate the expression for
9105 its side-effects. */
9106 finish_expr_stmt (retval
);
9108 permerror (input_location
,
9109 "return-statement with a value, in function "
9110 "returning %qT", valtype
);
9111 current_function_returns_null
= 1;
9113 /* There's really no value to return, after all. */
9117 /* Remember that this function can sometimes return without a
9119 current_function_returns_null
= 1;
9121 /* Remember that this function did return a value. */
9122 current_function_returns_value
= 1;
9124 /* Check for erroneous operands -- but after giving ourselves a
9125 chance to provide an error about returning a value from a void
9127 if (error_operand_p (retval
))
9129 current_function_return_value
= error_mark_node
;
9130 return error_mark_node
;
9133 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
9134 if (IDENTIFIER_NEW_OP_P (DECL_NAME (current_function_decl
))
9135 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
9137 && retval
&& null_ptr_cst_p (retval
))
9138 warning (0, "%<operator new%> must not return NULL unless it is "
9139 "declared %<throw()%> (or -fcheck-new is in effect)");
9141 /* Effective C++ rule 15. See also start_function. */
9143 && DECL_NAME (current_function_decl
) == assign_op_identifier
)
9147 /* The function return type must be a reference to the current
9149 if (TREE_CODE (valtype
) == REFERENCE_TYPE
9150 && same_type_ignoring_top_level_qualifiers_p
9151 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
9153 /* Returning '*this' is obviously OK. */
9154 if (retval
== current_class_ref
)
9156 /* If we are calling a function whose return type is the same of
9157 the current class reference, it is ok. */
9158 else if (INDIRECT_REF_P (retval
)
9159 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
9164 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
9167 if (dependent_type_p (functype
)
9168 || type_dependent_expression_p (retval
))
9171 /* We should not have changed the return value. */
9172 gcc_assert (retval
== saved_retval
);
9176 /* The fabled Named Return Value optimization, as per [class.copy]/15:
9178 [...] For a function with a class return type, if the expression
9179 in the return statement is the name of a local object, and the cv-
9180 unqualified type of the local object is the same as the function
9181 return type, an implementation is permitted to omit creating the tem-
9182 porary object to hold the function return value [...]
9184 So, if this is a value-returning function that always returns the same
9185 local variable, remember it.
9187 It might be nice to be more flexible, and choose the first suitable
9188 variable even if the function sometimes returns something else, but
9189 then we run the risk of clobbering the variable we chose if the other
9190 returned expression uses the chosen variable somehow. And people expect
9191 this restriction, anyway. (jason 2000-11-19)
9193 See finish_function and finalize_nrv for the rest of this optimization. */
9195 named_return_value_okay_p
=
9196 (retval
!= NULL_TREE
9197 && !processing_template_decl
9198 /* Must be a local, automatic variable. */
9200 && DECL_CONTEXT (retval
) == current_function_decl
9201 && ! TREE_STATIC (retval
)
9202 /* And not a lambda or anonymous union proxy. */
9203 && !DECL_HAS_VALUE_EXPR_P (retval
)
9204 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
9205 /* The cv-unqualified type of the returned value must be the
9206 same as the cv-unqualified return type of the
9208 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
9209 (TYPE_MAIN_VARIANT (functype
)))
9210 /* And the returned value must be non-volatile. */
9211 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
9213 if (fn_returns_value_p
&& flag_elide_constructors
)
9215 if (named_return_value_okay_p
9216 && (current_function_return_value
== NULL_TREE
9217 || current_function_return_value
== retval
))
9218 current_function_return_value
= retval
;
9220 current_function_return_value
= error_mark_node
;
9223 /* We don't need to do any conversions when there's nothing being
9228 /* Do any required conversions. */
9229 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
9230 /* No conversions are required. */
9234 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
9236 /* The functype's return type will have been set to void, if it
9237 was an incomplete type. Just treat this as 'return;' */
9238 if (VOID_TYPE_P (functype
))
9239 return error_mark_node
;
9241 /* If we had an id-expression obfuscated by force_paren_expr, we need
9242 to undo it so we can try to treat it as an rvalue below. */
9243 retval
= maybe_undo_parenthesized_ref (retval
);
9245 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
9246 treated as an rvalue for the purposes of overload resolution to
9247 favor move constructors over copy constructors.
9249 Note that these conditions are similar to, but not as strict as,
9250 the conditions for the named return value optimization. */
9251 bool converted
= false;
9252 if ((cxx_dialect
!= cxx98
)
9253 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
9254 || TREE_CODE (retval
) == PARM_DECL
)
9255 && DECL_CONTEXT (retval
) == current_function_decl
9256 && !TREE_STATIC (retval
)
9257 /* This is only interesting for class type. */
9258 && CLASS_TYPE_P (functype
))
9260 tree moved
= move (retval
);
9261 moved
= convert_for_initialization
9262 (NULL_TREE
, functype
, moved
, flags
|LOOKUP_PREFER_RVALUE
,
9263 ICR_RETURN
, NULL_TREE
, 0, tf_none
);
9264 if (moved
!= error_mark_node
)
9271 /* First convert the value to the function's return type, then
9272 to the type of return value's location to handle the
9273 case that functype is smaller than the valtype. */
9275 retval
= convert_for_initialization
9276 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
9277 tf_warning_or_error
);
9278 retval
= convert (valtype
, retval
);
9280 /* If the conversion failed, treat this just like `return;'. */
9281 if (retval
== error_mark_node
)
9283 /* We can't initialize a register from a AGGR_INIT_EXPR. */
9284 else if (! cfun
->returns_struct
9285 && TREE_CODE (retval
) == TARGET_EXPR
9286 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
9287 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9288 TREE_OPERAND (retval
, 0));
9289 else if (!processing_template_decl
9290 && maybe_warn_about_returning_address_of_local (retval
))
9291 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9292 build_zero_cst (TREE_TYPE (retval
)));
9295 if (processing_template_decl
)
9296 return saved_retval
;
9298 /* Actually copy the value returned into the appropriate location. */
9299 if (retval
&& retval
!= result
)
9300 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
9306 /* Returns nonzero if the pointer-type FROM can be converted to the
9307 pointer-type TO via a qualification conversion. If CONSTP is -1,
9308 then we return nonzero if the pointers are similar, and the
9309 cv-qualification signature of FROM is a proper subset of that of TO.
9311 If CONSTP is positive, then all outer pointers have been
9315 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
9317 bool to_more_cv_qualified
= false;
9318 bool is_opaque_pointer
= false;
9320 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9322 if (TREE_CODE (to
) != TREE_CODE (from
))
9325 if (TREE_CODE (from
) == OFFSET_TYPE
9326 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
9327 TYPE_OFFSET_BASETYPE (to
)))
9330 /* Const and volatile mean something different for function types,
9331 so the usual checks are not appropriate. */
9332 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
9334 if (!at_least_as_qualified_p (to
, from
))
9337 if (!at_least_as_qualified_p (from
, to
))
9341 to_more_cv_qualified
= true;
9345 constp
&= TYPE_READONLY (to
);
9348 if (VECTOR_TYPE_P (to
))
9349 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9351 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9352 return ((constp
>= 0 || to_more_cv_qualified
)
9353 && (is_opaque_pointer
9354 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9358 /* When comparing, say, char ** to char const **, this function takes
9359 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9360 types to this function. */
9363 comp_ptr_ttypes (tree to
, tree from
)
9365 return comp_ptr_ttypes_real (to
, from
, 1);
9368 /* Returns true iff FNTYPE is a non-class type that involves
9369 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9370 if a parameter type is ill-formed. */
9373 error_type_p (const_tree type
)
9377 switch (TREE_CODE (type
))
9383 case REFERENCE_TYPE
:
9385 return error_type_p (TREE_TYPE (type
));
9389 if (error_type_p (TREE_TYPE (type
)))
9391 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9392 if (error_type_p (TREE_VALUE (t
)))
9397 if (TYPE_PTRMEMFUNC_P (type
))
9398 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9406 /* Returns true if to and from are (possibly multi-level) pointers to the same
9407 type or inheritance-related types, regardless of cv-quals. */
9410 ptr_reasonably_similar (const_tree to
, const_tree from
)
9412 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9414 /* Any target type is similar enough to void. */
9415 if (VOID_TYPE_P (to
))
9416 return !error_type_p (from
);
9417 if (VOID_TYPE_P (from
))
9418 return !error_type_p (to
);
9420 if (TREE_CODE (to
) != TREE_CODE (from
))
9423 if (TREE_CODE (from
) == OFFSET_TYPE
9424 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9425 TYPE_OFFSET_BASETYPE (from
),
9426 COMPARE_BASE
| COMPARE_DERIVED
))
9429 if (VECTOR_TYPE_P (to
)
9430 && vector_types_convertible_p (to
, from
, false))
9433 if (TREE_CODE (to
) == INTEGER_TYPE
9434 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9437 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9438 return !error_type_p (to
) && !error_type_p (from
);
9440 if (!TYPE_PTR_P (to
))
9442 /* When either type is incomplete avoid DERIVED_FROM_P,
9443 which may call complete_type (c++/57942). */
9444 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9446 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9447 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9452 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9453 pointer-to-member types) are the same, ignoring cv-qualification at
9457 comp_ptr_ttypes_const (tree to
, tree from
)
9459 bool is_opaque_pointer
= false;
9461 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9463 if (TREE_CODE (to
) != TREE_CODE (from
))
9466 if (TREE_CODE (from
) == OFFSET_TYPE
9467 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9468 TYPE_OFFSET_BASETYPE (to
)))
9471 if (VECTOR_TYPE_P (to
))
9472 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9474 if (!TYPE_PTR_P (to
))
9475 return (is_opaque_pointer
9476 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9480 /* Returns the type qualifiers for this type, including the qualifiers on the
9481 elements for an array type. */
9484 cp_type_quals (const_tree type
)
9487 /* This CONST_CAST is okay because strip_array_types returns its
9488 argument unmodified and we assign it to a const_tree. */
9489 type
= strip_array_types (CONST_CAST_TREE (type
));
9490 if (type
== error_mark_node
9491 /* Quals on a FUNCTION_TYPE are memfn quals. */
9492 || TREE_CODE (type
) == FUNCTION_TYPE
)
9493 return TYPE_UNQUALIFIED
;
9494 quals
= TYPE_QUALS (type
);
9495 /* METHOD and REFERENCE_TYPEs should never have quals. */
9496 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9497 && TREE_CODE (type
) != REFERENCE_TYPE
)
9498 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9499 == TYPE_UNQUALIFIED
));
9503 /* Returns the function-ref-qualifier for TYPE */
9506 type_memfn_rqual (const_tree type
)
9508 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9509 || TREE_CODE (type
) == METHOD_TYPE
);
9511 if (!FUNCTION_REF_QUALIFIED (type
))
9512 return REF_QUAL_NONE
;
9513 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9514 return REF_QUAL_RVALUE
;
9516 return REF_QUAL_LVALUE
;
9519 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9523 type_memfn_quals (const_tree type
)
9525 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9526 return TYPE_QUALS (type
);
9527 else if (TREE_CODE (type
) == METHOD_TYPE
)
9528 return cp_type_quals (class_of_this_parm (type
));
9533 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9534 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9537 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9539 /* Could handle METHOD_TYPE here if necessary. */
9540 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9541 if (TYPE_QUALS (type
) == memfn_quals
9542 && type_memfn_rqual (type
) == rqual
)
9545 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9547 tree result
= build_qualified_type (type
, memfn_quals
);
9548 return build_ref_qualified_type (result
, rqual
);
9551 /* Returns nonzero if TYPE is const or volatile. */
9554 cv_qualified_p (const_tree type
)
9556 int quals
= cp_type_quals (type
);
9557 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9560 /* Returns nonzero if the TYPE contains a mutable member. */
9563 cp_has_mutable_p (const_tree type
)
9565 /* This CONST_CAST is okay because strip_array_types returns its
9566 argument unmodified and we assign it to a const_tree. */
9567 type
= strip_array_types (CONST_CAST_TREE(type
));
9569 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9572 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9573 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9574 approximation. In particular, consider:
9577 struct S { int i; };
9578 const S s = { f(); }
9580 Here, we will make "s" as TREE_READONLY (because it is declared
9581 "const") -- only to reverse ourselves upon seeing that the
9582 initializer is non-constant. */
9585 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9587 tree type
= TREE_TYPE (decl
);
9589 if (type
== error_mark_node
)
9592 if (TREE_CODE (decl
) == TYPE_DECL
)
9595 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9596 && type_quals
!= TYPE_UNQUALIFIED
));
9598 /* Avoid setting TREE_READONLY incorrectly. */
9599 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9600 constructor can produce constant init, so rely on cp_finish_decl to
9601 clear TREE_READONLY if the variable has non-constant init. */
9603 /* If the type has (or might have) a mutable component, that component
9604 might be modified. */
9605 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9606 type_quals
&= ~TYPE_QUAL_CONST
;
9608 c_apply_type_quals_to_decl (type_quals
, decl
);
9611 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9612 exemplar types such that casting T1 to T2 is casting away constness
9613 if and only if there is no implicit conversion from T1 to T2. */
9616 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9621 /* [expr.const.cast]
9623 For multi-level pointer to members and multi-level mixed pointers
9624 and pointers to members (conv.qual), the "member" aspect of a
9625 pointer to member level is ignored when determining if a const
9626 cv-qualifier has been cast away. */
9627 /* [expr.const.cast]
9629 For two pointer types:
9631 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9632 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9635 casting from X1 to X2 casts away constness if, for a non-pointer
9636 type T there does not exist an implicit conversion (clause
9639 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9643 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9644 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9645 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9647 *t1
= cp_build_qualified_type (void_type_node
,
9648 cp_type_quals (*t1
));
9649 *t2
= cp_build_qualified_type (void_type_node
,
9650 cp_type_quals (*t2
));
9654 quals1
= cp_type_quals (*t1
);
9655 quals2
= cp_type_quals (*t2
);
9657 if (TYPE_PTRDATAMEM_P (*t1
))
9658 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9660 *t1
= TREE_TYPE (*t1
);
9661 if (TYPE_PTRDATAMEM_P (*t2
))
9662 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9664 *t2
= TREE_TYPE (*t2
);
9666 casts_away_constness_r (t1
, t2
, complain
);
9667 *t1
= build_pointer_type (*t1
);
9668 *t2
= build_pointer_type (*t2
);
9669 *t1
= cp_build_qualified_type (*t1
, quals1
);
9670 *t2
= cp_build_qualified_type (*t2
, quals2
);
9673 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9676 ??? This function returns non-zero if casting away qualifiers not
9677 just const. We would like to return to the caller exactly which
9678 qualifiers are casted away to give more accurate diagnostics.
9682 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9684 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9686 /* [expr.const.cast]
9688 Casting from an lvalue of type T1 to an lvalue of type T2
9689 using a reference cast casts away constness if a cast from an
9690 rvalue of type "pointer to T1" to the type "pointer to T2"
9691 casts away constness. */
9692 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9693 return casts_away_constness (build_pointer_type (t1
),
9694 build_pointer_type (TREE_TYPE (t2
)),
9698 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9699 /* [expr.const.cast]
9701 Casting from an rvalue of type "pointer to data member of X
9702 of type T1" to the type "pointer to data member of Y of type
9703 T2" casts away constness if a cast from an rvalue of type
9704 "pointer to T1" to the type "pointer to T2" casts away
9706 return casts_away_constness
9707 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9708 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9711 /* Casting away constness is only something that makes sense for
9712 pointer or reference types. */
9713 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9716 /* Top-level qualifiers don't matter. */
9717 t1
= TYPE_MAIN_VARIANT (t1
);
9718 t2
= TYPE_MAIN_VARIANT (t2
);
9719 casts_away_constness_r (&t1
, &t2
, complain
);
9720 if (!can_convert (t2
, t1
, complain
))
9726 /* If T is a REFERENCE_TYPE return the type to which T refers.
9727 Otherwise, return T itself. */
9730 non_reference (tree t
)
9732 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9738 /* Return nonzero if REF is an lvalue valid for this language;
9739 otherwise, print an error message and return zero. USE says
9740 how the lvalue is being used and so selects the error message. */
9743 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9745 cp_lvalue_kind kind
= lvalue_kind (ref
);
9747 if (kind
== clk_none
)
9749 if (complain
& tf_error
)
9750 lvalue_error (input_location
, use
);
9753 else if (kind
& (clk_rvalueref
|clk_class
))
9755 if (!(complain
& tf_error
))
9757 if (kind
& clk_class
)
9758 /* Make this a permerror because we used to accept it. */
9759 permerror (input_location
, "using temporary as lvalue");
9761 error ("using xvalue (rvalue reference) as lvalue");
9766 /* Return true if a user-defined literal operator is a raw operator. */
9769 check_raw_literal_operator (const_tree decl
)
9771 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9774 bool maybe_raw_p
= false;
9776 /* Count the number and type of arguments and check for ellipsis. */
9777 for (argtype
= argtypes
, arity
= 0;
9778 argtype
&& argtype
!= void_list_node
;
9779 ++arity
, argtype
= TREE_CHAIN (argtype
))
9781 tree t
= TREE_VALUE (argtype
);
9783 if (same_type_p (t
, const_string_type_node
))
9787 return false; /* Found ellipsis. */
9789 if (!maybe_raw_p
|| arity
!= 1)
9796 /* Return true if a user-defined literal operator has one of the allowed
9800 check_literal_operator_args (const_tree decl
,
9801 bool *long_long_unsigned_p
, bool *long_double_p
)
9803 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9805 *long_long_unsigned_p
= false;
9806 *long_double_p
= false;
9807 if (processing_template_decl
|| processing_specialization
)
9808 return argtypes
== void_list_node
;
9815 /* Count the number and type of arguments and check for ellipsis. */
9816 for (argtype
= argtypes
, arity
= 0;
9817 argtype
&& argtype
!= void_list_node
;
9818 argtype
= TREE_CHAIN (argtype
))
9820 tree t
= TREE_VALUE (argtype
);
9825 bool maybe_raw_p
= false;
9827 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9829 t
= TYPE_MAIN_VARIANT (t
);
9830 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9831 || same_type_p (t
, wchar_type_node
)
9832 || same_type_p (t
, char16_type_node
)
9833 || same_type_p (t
, char32_type_node
))
9835 argtype
= TREE_CHAIN (argtype
);
9838 t
= TREE_VALUE (argtype
);
9839 if (maybe_raw_p
&& argtype
== void_list_node
)
9841 else if (same_type_p (t
, size_type_node
))
9850 else if (same_type_p (t
, long_long_unsigned_type_node
))
9853 *long_long_unsigned_p
= true;
9855 else if (same_type_p (t
, long_double_type_node
))
9858 *long_double_p
= true;
9860 else if (same_type_p (t
, char_type_node
))
9862 else if (same_type_p (t
, wchar_type_node
))
9864 else if (same_type_p (t
, char16_type_node
))
9866 else if (same_type_p (t
, char32_type_node
))
9872 return false; /* Found ellipsis. */
9874 if (arity
!= max_arity
)
9881 /* Always returns false since unlike C90, C++ has no concept of implicit
9882 function declarations. */
9885 c_decl_implicit (const_tree
)