1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2018 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 (simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)) != 1)
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 /* Save space: see if the result is identical to one of the args. */
835 if (valtype
== TREE_TYPE (t1
) && ! p2
)
836 return cp_build_type_attribute_variant (t1
, attributes
);
837 if (valtype
== TREE_TYPE (t2
) && ! p1
)
838 return cp_build_type_attribute_variant (t2
, attributes
);
840 /* Simple way if one arg fails to specify argument types. */
841 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
843 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
846 parms
= commonparms (p1
, p2
);
848 cp_cv_quals quals
= type_memfn_quals (t1
);
849 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
850 gcc_assert (quals
== type_memfn_quals (t2
));
851 gcc_assert (rqual
== type_memfn_rqual (t2
));
853 tree rval
= build_function_type (valtype
, parms
);
854 rval
= apply_memfn_quals (rval
, quals
);
855 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
856 TYPE_RAISES_EXCEPTIONS (t2
));
857 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
858 t1
= build_cp_fntype_variant (rval
, rqual
, raises
, late_return_type_p
);
864 /* Get this value the long way, since TYPE_METHOD_BASETYPE
865 is just the main variant of this. */
866 tree basetype
= class_of_this_parm (t2
);
867 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
868 TYPE_RAISES_EXCEPTIONS (t2
));
869 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
871 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
873 /* If this was a member function type, get back to the
874 original type of type member function (i.e., without
875 the class instance variable up front. */
876 t1
= build_function_type (TREE_TYPE (t1
),
877 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
878 t2
= build_function_type (TREE_TYPE (t2
),
879 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
880 t3
= merge_types (t1
, t2
);
881 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
882 TYPE_ARG_TYPES (t3
));
883 t1
= build_cp_fntype_variant (t3
, rqual
, raises
, late_return_type_1_p
);
888 /* There is no need to merge attributes into a TYPENAME_TYPE.
889 When the type is instantiated it will have whatever
890 attributes result from the instantiation. */
894 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
896 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
901 return cp_build_type_attribute_variant (t1
, attributes
);
904 /* Return the ARRAY_TYPE type without its domain. */
907 strip_array_domain (tree type
)
910 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
911 if (TYPE_DOMAIN (type
) == NULL_TREE
)
913 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
914 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
917 /* Wrapper around cp_common_type that is used by c-common.c and other
918 front end optimizations that remove promotions.
920 Return the common type for two arithmetic types T1 and T2 under the
921 usual arithmetic conversions. The default conversions have already
922 been applied, and enumerated types converted to their compatible
926 common_type (tree t1
, tree t2
)
928 /* If one type is nonsense, use the other */
929 if (t1
== error_mark_node
)
931 if (t2
== error_mark_node
)
934 return cp_common_type (t1
, t2
);
937 /* Return the common type of two pointer types T1 and T2. This is the
938 type for the result of most arithmetic operations if the operands
939 have the given two types.
941 We assume that comp_target_types has already been done and returned
942 nonzero; if that isn't so, this may crash. */
945 common_pointer_type (tree t1
, tree t2
)
947 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
948 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
949 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
951 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
952 CPO_CONVERSION
, tf_warning_or_error
);
955 /* Compare two exception specifier types for exactness or subsetness, if
956 allowed. Returns false for mismatch, true for match (same, or
959 [except.spec] "If a class X ... objects of class X or any class publicly
960 and unambiguously derived from X. Similarly, if a pointer type Y * ...
961 exceptions of type Y * or that are pointers to any type publicly and
962 unambiguously derived from Y. Otherwise a function only allows exceptions
963 that have the same type ..."
964 This does not mention cv qualifiers and is different to what throw
965 [except.throw] and catch [except.catch] will do. They will ignore the
966 top level cv qualifiers, and allow qualifiers in the pointer to class
969 We implement the letter of the standard. */
972 comp_except_types (tree a
, tree b
, bool exact
)
974 if (same_type_p (a
, b
))
978 if (cp_type_quals (a
) || cp_type_quals (b
))
981 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
985 if (cp_type_quals (a
) || cp_type_quals (b
))
989 if (TREE_CODE (a
) != RECORD_TYPE
990 || TREE_CODE (b
) != RECORD_TYPE
)
993 if (publicly_uniquely_derived_p (a
, b
))
999 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1000 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1001 If EXACT is ce_type, the C++17 type compatibility rules apply.
1002 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1003 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1004 are unordered, but we've already filtered out duplicates. Most lists will
1005 be in order, we should try to make use of that. */
1008 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1017 /* First handle noexcept. */
1018 if (exact
< ce_exact
)
1020 if (exact
== ce_type
1021 && (canonical_eh_spec (CONST_CAST_TREE (t1
))
1022 == canonical_eh_spec (CONST_CAST_TREE (t2
))))
1025 /* noexcept(false) is compatible with no exception-specification,
1026 and less strict than any spec. */
1027 if (t1
== noexcept_false_spec
)
1028 return t2
== NULL_TREE
|| exact
== ce_derived
;
1029 /* Even a derived noexcept(false) is compatible with no
1030 exception-specification. */
1031 if (t2
== noexcept_false_spec
)
1032 return t1
== NULL_TREE
;
1034 /* Otherwise, if we aren't looking for an exact match, noexcept is
1035 equivalent to throw(). */
1036 if (t1
== noexcept_true_spec
)
1037 t1
= empty_except_spec
;
1038 if (t2
== noexcept_true_spec
)
1039 t2
= empty_except_spec
;
1042 /* If any noexcept is left, it is only comparable to itself;
1043 either we're looking for an exact match or we're redeclaring a
1044 template with dependent noexcept. */
1045 if ((t1
&& TREE_PURPOSE (t1
))
1046 || (t2
&& TREE_PURPOSE (t2
)))
1048 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1050 if (t1
== NULL_TREE
) /* T1 is ... */
1051 return t2
== NULL_TREE
|| exact
== ce_derived
;
1052 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1053 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1054 if (t2
== NULL_TREE
) /* T2 is ... */
1056 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1057 return exact
== ce_derived
;
1059 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1060 Count how many we find, to determine exactness. For exact matching and
1061 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1063 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1065 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1067 tree a
= TREE_VALUE (probe
);
1068 tree b
= TREE_VALUE (t2
);
1070 if (comp_except_types (a
, b
, exact
))
1072 if (probe
== base
&& exact
> ce_derived
)
1073 base
= TREE_CHAIN (probe
);
1078 if (probe
== NULL_TREE
)
1081 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1084 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1085 [] can match [size]. */
1088 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1097 /* The type of the array elements must be the same. */
1098 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1101 d1
= TYPE_DOMAIN (t1
);
1102 d2
= TYPE_DOMAIN (t2
);
1107 /* If one of the arrays is dimensionless, and the other has a
1108 dimension, they are of different types. However, it is valid to
1116 declarations for an array object can specify
1117 array types that differ by the presence or absence of a major
1118 array bound (_dcl.array_). */
1120 return allow_redeclaration
;
1122 /* Check that the dimensions are the same. */
1124 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1126 max1
= TYPE_MAX_VALUE (d1
);
1127 max2
= TYPE_MAX_VALUE (d2
);
1129 if (!cp_tree_equal (max1
, max2
))
1135 /* Compare the relative position of T1 and T2 into their respective
1136 template parameter list.
1137 T1 and T2 must be template parameter types.
1138 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1141 comp_template_parms_position (tree t1
, tree t2
)
1143 tree index1
, index2
;
1144 gcc_assert (t1
&& t2
1145 && TREE_CODE (t1
) == TREE_CODE (t2
)
1146 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1147 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1148 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1150 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1151 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1153 /* Then compare their relative position. */
1154 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1155 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1156 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1157 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1160 /* In C++14 we can end up comparing 'auto' to a normal template
1161 parameter. Don't confuse them. */
1162 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1163 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1168 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
1171 cxx_safe_arg_type_equiv_p (tree t1
, tree t2
)
1173 t1
= TYPE_MAIN_VARIANT (t1
);
1174 t2
= TYPE_MAIN_VARIANT (t2
);
1180 /* The signedness of the parameter matters only when an integral
1181 type smaller than int is promoted to int, otherwise only the
1182 precision of the parameter matters.
1183 This check should make sure that the callee does not see
1184 undefined values in argument registers. */
1185 if (INTEGRAL_TYPE_P (t1
)
1186 && INTEGRAL_TYPE_P (t2
)
1187 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
)
1188 && (TYPE_UNSIGNED (t1
) == TYPE_UNSIGNED (t2
)
1189 || !targetm
.calls
.promote_prototypes (NULL_TREE
)
1190 || TYPE_PRECISION (t1
) >= TYPE_PRECISION (integer_type_node
)))
1193 return same_type_p (t1
, t2
);
1196 /* Check if a type cast between two function types can be considered safe. */
1199 cxx_safe_function_type_cast_p (tree t1
, tree t2
)
1201 if (TREE_TYPE (t1
) == void_type_node
&&
1202 TYPE_ARG_TYPES (t1
) == void_list_node
)
1205 if (TREE_TYPE (t2
) == void_type_node
&&
1206 TYPE_ARG_TYPES (t2
) == void_list_node
)
1209 if (!cxx_safe_arg_type_equiv_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1212 for (t1
= TYPE_ARG_TYPES (t1
), t2
= TYPE_ARG_TYPES (t2
);
1214 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1215 if (!cxx_safe_arg_type_equiv_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1221 /* Subroutine in comptypes. */
1224 structural_comptypes (tree t1
, tree t2
, int strict
)
1229 /* Suppress errors caused by previously reported errors. */
1230 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1233 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1235 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1236 current instantiation. */
1237 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1238 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1240 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1241 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1243 if (TYPE_PTRMEMFUNC_P (t1
))
1244 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1245 if (TYPE_PTRMEMFUNC_P (t2
))
1246 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1248 /* Different classes of types can't be compatible. */
1249 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1252 /* Qualifiers must match. For array types, we will check when we
1253 recur on the array element types. */
1254 if (TREE_CODE (t1
) != ARRAY_TYPE
1255 && cp_type_quals (t1
) != cp_type_quals (t2
))
1257 if (TREE_CODE (t1
) == FUNCTION_TYPE
1258 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1260 /* Need to check this before TYPE_MAIN_VARIANT.
1261 FIXME function qualifiers should really change the main variant. */
1262 if (TREE_CODE (t1
) == FUNCTION_TYPE
1263 || TREE_CODE (t1
) == METHOD_TYPE
)
1265 if (type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1267 if (flag_noexcept_type
1268 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1
),
1269 TYPE_RAISES_EXCEPTIONS (t2
),
1274 /* Allow for two different type nodes which have essentially the same
1275 definition. Note that we already checked for equality of the type
1276 qualifiers (just above). */
1278 if (TREE_CODE (t1
) != ARRAY_TYPE
1279 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1283 /* Compare the types. Break out if they could be the same. */
1284 switch (TREE_CODE (t1
))
1288 /* All void and bool types are the same. */
1292 case FIXED_POINT_TYPE
:
1294 /* With these nodes, we can't determine type equivalence by
1295 looking at what is stored in the nodes themselves, because
1296 two nodes might have different TYPE_MAIN_VARIANTs but still
1297 represent the same type. For example, wchar_t and int could
1298 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1299 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1300 and are distinct types. On the other hand, int and the
1303 typedef int INT __attribute((may_alias));
1305 have identical properties, different TYPE_MAIN_VARIANTs, but
1306 represent the same type. The canonical type system keeps
1307 track of equivalence in this case, so we fall back on it. */
1308 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1310 case TEMPLATE_TEMPLATE_PARM
:
1311 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1312 if (!comp_template_parms_position (t1
, t2
))
1314 if (!comp_template_parms
1315 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1316 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1318 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1320 /* Don't check inheritance. */
1321 strict
= COMPARE_STRICT
;
1326 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1327 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1328 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1329 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1332 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1334 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1340 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1341 strict
& ~COMPARE_REDECLARATION
))
1343 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1347 case REFERENCE_TYPE
:
1348 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1350 /* fall through to checks for pointer types */
1354 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1355 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1361 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1363 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1368 /* Target types must match incl. qualifiers. */
1369 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1373 case TEMPLATE_TYPE_PARM
:
1374 /* If T1 and T2 don't have the same relative position in their
1375 template parameters set, they can't be equal. */
1376 if (!comp_template_parms_position (t1
, t2
))
1378 /* If T1 and T2 don't represent the same class template deduction,
1379 they aren't equal. */
1380 if (CLASS_PLACEHOLDER_TEMPLATE (t1
)
1381 != CLASS_PLACEHOLDER_TEMPLATE (t2
))
1383 /* Constrained 'auto's are distinct from parms that don't have the same
1385 if (!equivalent_placeholder_constraints (t1
, t2
))
1390 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1391 TYPENAME_TYPE_FULLNAME (t2
)))
1393 /* Qualifiers don't matter on scopes. */
1394 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1399 case UNBOUND_CLASS_TEMPLATE
:
1400 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1402 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1407 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1412 if (maybe_ne (TYPE_VECTOR_SUBPARTS (t1
), TYPE_VECTOR_SUBPARTS (t2
))
1413 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1417 case TYPE_PACK_EXPANSION
:
1418 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1419 PACK_EXPANSION_PATTERN (t2
))
1420 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1421 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1424 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1425 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1426 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1427 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1428 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1429 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1430 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1431 DECLTYPE_TYPE_EXPR (t2
)))
1435 case UNDERLYING_TYPE
:
1436 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1437 UNDERLYING_TYPE_TYPE (t2
));
1443 /* If we get here, we know that from a target independent POV the
1444 types are the same. Make sure the target attributes are also
1446 return comp_type_attributes (t1
, t2
);
1449 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1450 is a bitwise-or of the COMPARE_* flags. */
1453 comptypes (tree t1
, tree t2
, int strict
)
1455 if (strict
== COMPARE_STRICT
)
1460 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1463 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1464 /* At least one of the types requires structural equality, so
1465 perform a deep check. */
1466 return structural_comptypes (t1
, t2
, strict
);
1468 if (flag_checking
&& USE_CANONICAL_TYPES
)
1470 bool result
= structural_comptypes (t1
, t2
, strict
);
1472 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1473 /* The two types are structurally equivalent, but their
1474 canonical types were different. This is a failure of the
1475 canonical type propagation code.*/
1477 ("canonical types differ for identical types %qT and %qT",
1479 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1480 /* Two types are structurally different, but the canonical
1481 types are the same. This means we were over-eager in
1482 assigning canonical types. */
1484 ("same canonical type node for different types %qT and %qT",
1489 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1490 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1492 return structural_comptypes (t1
, t2
, strict
);
1494 else if (strict
== COMPARE_STRUCTURAL
)
1495 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1497 return structural_comptypes (t1
, t2
, strict
);
1500 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1501 top-level qualifiers. */
1504 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1506 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1509 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1510 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1511 return same_type_p (type1
, type2
);
1514 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1517 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1519 int q1
= cp_type_quals (type1
);
1520 int q2
= cp_type_quals (type2
);
1522 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1523 return (q1
& q2
) == q2
;
1526 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1527 more cv-qualified that TYPE1, and 0 otherwise. */
1530 comp_cv_qualification (int q1
, int q2
)
1535 if ((q1
& q2
) == q2
)
1537 else if ((q1
& q2
) == q1
)
1544 comp_cv_qualification (const_tree type1
, const_tree type2
)
1546 int q1
= cp_type_quals (type1
);
1547 int q2
= cp_type_quals (type2
);
1548 return comp_cv_qualification (q1
, q2
);
1551 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1552 subset of the cv-qualification signature of TYPE2, and the types
1553 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1556 comp_cv_qual_signature (tree type1
, tree type2
)
1558 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1560 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1566 /* Subroutines of `comptypes'. */
1568 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1569 equivalent in the sense that functions with those parameter types
1570 can have equivalent types. The two lists must be equivalent,
1571 element by element. */
1574 compparms (const_tree parms1
, const_tree parms2
)
1578 /* An unspecified parmlist matches any specified parmlist
1579 whose argument types don't need default promotions. */
1581 for (t1
= parms1
, t2
= parms2
;
1583 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1585 /* If one parmlist is shorter than the other,
1586 they fail to match. */
1589 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1596 /* Process a sizeof or alignof expression where the operand is a
1597 type. STD_ALIGNOF indicates whether an alignof has C++11 (minimum alignment)
1598 or GNU (preferred alignment) semantics; it is ignored if op is
1602 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool std_alignof
,
1605 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1606 if (type
== error_mark_node
)
1607 return error_mark_node
;
1609 type
= non_reference (type
);
1610 if (TREE_CODE (type
) == METHOD_TYPE
)
1614 pedwarn (input_location
, OPT_Wpointer_arith
,
1615 "invalid application of %qs to a member function",
1616 OVL_OP_INFO (false, op
)->name
);
1617 return size_one_node
;
1620 return error_mark_node
;
1623 bool dependent_p
= dependent_type_p (type
);
1625 complete_type (type
);
1627 /* VLA types will have a non-constant size. In the body of an
1628 uninstantiated template, we don't need to try to compute the
1629 value, because the sizeof expression is not an integral
1630 constant expression in that case. And, if we do try to
1631 compute the value, we'll likely end up with SAVE_EXPRs, which
1632 the template substitution machinery does not expect to see. */
1633 || (processing_template_decl
1634 && COMPLETE_TYPE_P (type
)
1635 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1637 tree value
= build_min (op
, size_type_node
, type
);
1638 TREE_READONLY (value
) = 1;
1639 if (op
== ALIGNOF_EXPR
&& std_alignof
)
1640 ALIGNOF_EXPR_STD_P (value
) = true;
1644 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1645 op
== SIZEOF_EXPR
, std_alignof
,
1649 /* Return the size of the type, without producing any warnings for
1650 types whose size cannot be taken. This routine should be used only
1651 in some other routine that has already produced a diagnostic about
1652 using the size of such a type. */
1654 cxx_sizeof_nowarn (tree type
)
1656 if (TREE_CODE (type
) == FUNCTION_TYPE
1657 || VOID_TYPE_P (type
)
1658 || TREE_CODE (type
) == ERROR_MARK
)
1659 return size_one_node
;
1660 else if (!COMPLETE_TYPE_P (type
))
1661 return size_zero_node
;
1663 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false, false);
1666 /* Process a sizeof expression where the operand is an expression. */
1669 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1671 if (e
== error_mark_node
)
1672 return error_mark_node
;
1674 if (processing_template_decl
)
1676 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1677 TREE_SIDE_EFFECTS (e
) = 0;
1678 TREE_READONLY (e
) = 1;
1683 /* To get the size of a static data member declared as an array of
1684 unknown bound, we need to instantiate it. */
1686 && VAR_HAD_UNKNOWN_BOUND (e
)
1687 && DECL_TEMPLATE_INSTANTIATION (e
))
1688 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1690 if (TREE_CODE (e
) == PARM_DECL
1691 && DECL_ARRAY_PARAMETER_P (e
)
1692 && (complain
& tf_warning
))
1694 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1695 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1696 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1699 e
= mark_type_use (e
);
1703 if (complain
& tf_error
)
1704 error ("invalid application of %<sizeof%> to a bit-field");
1706 return error_mark_node
;
1709 else if (is_overloaded_fn (e
))
1711 if (complain
& tf_error
)
1712 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1715 return error_mark_node
;
1718 else if (type_unknown_p (e
))
1720 if (complain
& tf_error
)
1721 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1723 return error_mark_node
;
1729 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, false, complain
& tf_error
);
1732 /* Implement the __alignof keyword: Return the minimum required
1733 alignment of E, measured in bytes. For VAR_DECL's and
1734 FIELD_DECL's return DECL_ALIGN (which can be set from an
1735 "aligned" __attribute__ specification). */
1738 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1742 if (e
== error_mark_node
)
1743 return error_mark_node
;
1745 if (processing_template_decl
)
1747 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1748 TREE_SIDE_EFFECTS (e
) = 0;
1749 TREE_READONLY (e
) = 1;
1754 e
= mark_type_use (e
);
1757 t
= size_int (DECL_ALIGN_UNIT (e
));
1758 else if (bitfield_p (e
))
1760 if (complain
& tf_error
)
1761 error ("invalid application of %<__alignof%> to a bit-field");
1763 return error_mark_node
;
1766 else if (TREE_CODE (e
) == COMPONENT_REF
1767 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1768 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1769 else if (is_overloaded_fn (e
))
1771 if (complain
& tf_error
)
1772 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1775 return error_mark_node
;
1776 if (TREE_CODE (e
) == FUNCTION_DECL
)
1777 t
= size_int (DECL_ALIGN_UNIT (e
));
1781 else if (type_unknown_p (e
))
1783 if (complain
& tf_error
)
1784 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1786 return error_mark_node
;
1790 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
, false,
1791 complain
& tf_error
);
1793 return fold_convert (size_type_node
, t
);
1796 /* Process a sizeof or alignof expression E with code OP where the operand
1797 is an expression. */
1800 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1802 if (op
== SIZEOF_EXPR
)
1803 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1805 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1808 /* Build a representation of an expression 'alignas(E).' Return the
1809 folded integer value of E if it is an integral constant expression
1810 that resolves to a valid alignment. If E depends on a template
1811 parameter, return a syntactic representation tree of kind
1812 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1813 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1816 cxx_alignas_expr (tree e
)
1818 if (e
== NULL_TREE
|| e
== error_mark_node
1819 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1825 When the alignment-specifier is of the form
1826 alignas(type-id ), it shall have the same effect as
1827 alignas(alignof(type-id )). */
1829 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, true, false);
1831 /* If we reach this point, it means the alignas expression if of
1832 the form "alignas(assignment-expression)", so we should follow
1833 what is stated by [dcl.align]/2. */
1835 if (value_dependent_expression_p (e
))
1836 /* Leave value-dependent expression alone for now. */
1839 e
= instantiate_non_dependent_expr (e
);
1840 e
= mark_rvalue_use (e
);
1842 /* [dcl.align]/2 says:
1844 the assignment-expression shall be an integral constant
1847 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e
)))
1849 error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e
));
1850 return error_mark_node
;
1853 return cxx_constant_value (e
);
1857 /* EXPR is being used in a context that is not a function call.
1862 The expression can be used only as the left-hand operand of a
1863 member function call.
1865 [expr.mptr.operator]
1867 If the result of .* or ->* is a function, then that result can be
1868 used only as the operand for the function call operator ().
1870 by issuing an error message if appropriate. Returns true iff EXPR
1871 violates these rules. */
1874 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1876 if (expr
== NULL_TREE
)
1878 /* Don't enforce this in MS mode. */
1879 if (flag_ms_extensions
)
1881 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1882 expr
= get_first_fn (expr
);
1883 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1885 if (complain
& tf_error
)
1889 error_at (loc
, "invalid use of non-static member function %qD",
1891 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1894 error_at (loc
, "invalid use of non-static member function of "
1895 "type %qT", TREE_TYPE (expr
));
1902 /* If EXP is a reference to a bitfield, and the type of EXP does not
1903 match the declared type of the bitfield, return the declared type
1904 of the bitfield. Otherwise, return NULL_TREE. */
1907 is_bitfield_expr_with_lowered_type (const_tree exp
)
1909 switch (TREE_CODE (exp
))
1912 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1913 ? TREE_OPERAND (exp
, 1)
1914 : TREE_OPERAND (exp
, 0)))
1916 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1919 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1923 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1929 field
= TREE_OPERAND (exp
, 1);
1930 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1932 if (same_type_ignoring_top_level_qualifiers_p
1933 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1935 return DECL_BIT_FIELD_TYPE (field
);
1939 if (DECL_HAS_VALUE_EXPR_P (exp
))
1940 return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
1941 (CONST_CAST_TREE (exp
)));
1945 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1946 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1947 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1955 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1956 bitfield with a lowered type, the type of EXP is returned, rather
1960 unlowered_expr_type (const_tree exp
)
1963 tree etype
= TREE_TYPE (exp
);
1965 type
= is_bitfield_expr_with_lowered_type (exp
);
1967 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1974 /* Perform the conversions in [expr] that apply when an lvalue appears
1975 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1976 function-to-pointer conversions. In addition, bitfield references are
1977 converted to their declared types. Note that this function does not perform
1978 the lvalue-to-rvalue conversion for class types. If you need that conversion
1979 for class types, then you probably need to use force_rvalue.
1981 Although the returned value is being used as an rvalue, this
1982 function does not wrap the returned expression in a
1983 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1984 that the return value is no longer an lvalue. */
1987 decay_conversion (tree exp
,
1988 tsubst_flags_t complain
,
1989 bool reject_builtin
/* = true */)
1992 enum tree_code code
;
1993 location_t loc
= cp_expr_loc_or_loc (exp
, input_location
);
1995 type
= TREE_TYPE (exp
);
1996 if (type
== error_mark_node
)
1997 return error_mark_node
;
1999 exp
= resolve_nondeduced_context (exp
, complain
);
2000 if (type_unknown_p (exp
))
2002 if (complain
& tf_error
)
2003 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
2004 return error_mark_node
;
2007 code
= TREE_CODE (type
);
2009 if (error_operand_p (exp
))
2010 return error_mark_node
;
2012 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
2014 mark_rvalue_use (exp
, loc
, reject_builtin
);
2015 return nullptr_node
;
2018 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2019 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
2020 if (code
== VOID_TYPE
)
2022 if (complain
& tf_error
)
2023 error_at (loc
, "void value not ignored as it ought to be");
2024 return error_mark_node
;
2026 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
2027 return error_mark_node
;
2028 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
2030 exp
= mark_lvalue_use (exp
);
2031 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
2032 return error_mark_node
;
2033 return cp_build_addr_expr (exp
, complain
);
2035 if (code
== ARRAY_TYPE
)
2040 exp
= mark_lvalue_use (exp
);
2042 if (INDIRECT_REF_P (exp
))
2043 return build_nop (build_pointer_type (TREE_TYPE (type
)),
2044 TREE_OPERAND (exp
, 0));
2046 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
2048 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
2049 if (op1
== error_mark_node
)
2050 return error_mark_node
;
2051 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
2052 TREE_OPERAND (exp
, 0), op1
);
2055 if (!obvalue_p (exp
)
2056 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
2058 if (complain
& tf_error
)
2059 error_at (loc
, "invalid use of non-lvalue array");
2060 return error_mark_node
;
2063 /* Don't let an array compound literal decay to a pointer. It can
2064 still be used to initialize an array or bind to a reference. */
2065 if (TREE_CODE (exp
) == TARGET_EXPR
)
2067 if (complain
& tf_error
)
2068 error_at (loc
, "taking address of temporary array");
2069 return error_mark_node
;
2072 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2076 if (!cxx_mark_addressable (exp
))
2077 return error_mark_node
;
2078 adr
= build_nop (ptrtype
, build_address (exp
));
2081 /* This way is better for a COMPONENT_REF since it can
2082 simplify the offset for a component. */
2083 adr
= cp_build_addr_expr (exp
, complain
);
2084 return cp_convert (ptrtype
, adr
, complain
);
2087 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2088 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2090 /* If a bitfield is used in a context where integral promotion
2091 applies, then the caller is expected to have used
2092 default_conversion. That function promotes bitfields correctly
2093 before calling this function. At this point, if we have a
2094 bitfield referenced, we may assume that is not subject to
2095 promotion, and that, therefore, the type of the resulting rvalue
2096 is the declared type of the bitfield. */
2097 exp
= convert_bitfield_to_declared_type (exp
);
2099 /* We do not call rvalue() here because we do not want to wrap EXP
2100 in a NON_LVALUE_EXPR. */
2104 Non-class rvalues always have cv-unqualified types. */
2105 type
= TREE_TYPE (exp
);
2106 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2107 exp
= build_nop (cv_unqualified (type
), exp
);
2109 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2110 return error_mark_node
;
2115 /* Perform preparatory conversions, as part of the "usual arithmetic
2116 conversions". In particular, as per [expr]:
2118 Whenever an lvalue expression appears as an operand of an
2119 operator that expects the rvalue for that operand, the
2120 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2121 standard conversions are applied to convert the expression to an
2124 In addition, we perform integral promotions here, as those are
2125 applied to both operands to a binary operator before determining
2126 what additional conversions should apply. */
2129 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2131 /* Check for target-specific promotions. */
2132 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2134 exp
= cp_convert (promoted_type
, exp
, complain
);
2135 /* Perform the integral promotions first so that bitfield
2136 expressions (which may promote to "int", even if the bitfield is
2137 declared "unsigned") are promoted correctly. */
2138 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2139 exp
= cp_perform_integral_promotions (exp
, complain
);
2140 /* Perform the other conversions. */
2141 exp
= decay_conversion (exp
, complain
);
2149 default_conversion (tree exp
)
2151 return cp_default_conversion (exp
, tf_warning_or_error
);
2154 /* EXPR is an expression with an integral or enumeration type.
2155 Perform the integral promotions in [conv.prom], and return the
2159 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2164 expr
= mark_rvalue_use (expr
);
2165 if (error_operand_p (expr
))
2166 return error_mark_node
;
2170 If the bitfield has an enumerated type, it is treated as any
2171 other value of that type for promotion purposes. */
2172 type
= is_bitfield_expr_with_lowered_type (expr
);
2173 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2174 type
= TREE_TYPE (expr
);
2175 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2176 /* Scoped enums don't promote. */
2177 if (SCOPED_ENUM_P (type
))
2179 promoted_type
= type_promotes_to (type
);
2180 if (type
!= promoted_type
)
2181 expr
= cp_convert (promoted_type
, expr
, complain
);
2188 perform_integral_promotions (tree expr
)
2190 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2193 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2194 decay_conversion to one. */
2197 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2201 if (!TYPE_PTR_P (totype
))
2204 t
= TREE_TYPE (totype
);
2205 if (!same_type_p (t
, char_type_node
)
2206 && !same_type_p (t
, char16_type_node
)
2207 && !same_type_p (t
, char32_type_node
)
2208 && !same_type_p (t
, wchar_type_node
))
2211 STRIP_ANY_LOCATION_WRAPPER (exp
);
2213 if (TREE_CODE (exp
) == STRING_CST
)
2215 /* Make sure that we don't try to convert between char and wide chars. */
2216 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2221 /* Is this a string constant which has decayed to 'const char *'? */
2222 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2223 if (!same_type_p (TREE_TYPE (exp
), t
))
2226 if (TREE_CODE (exp
) != ADDR_EXPR
2227 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2232 if (cxx_dialect
>= cxx11
)
2233 pedwarn (input_location
, OPT_Wwrite_strings
,
2234 "ISO C++ forbids converting a string constant to %qT",
2237 warning (OPT_Wwrite_strings
,
2238 "deprecated conversion from string constant to %qT",
2245 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2246 can, for example, use as an lvalue. This code used to be in
2247 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2248 expressions, where we're dealing with aggregates. But now it's again only
2249 called from unary_complex_lvalue. The case (in particular) that led to
2250 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2254 rationalize_conditional_expr (enum tree_code code
, tree t
,
2255 tsubst_flags_t complain
)
2257 location_t loc
= cp_expr_loc_or_loc (t
, input_location
);
2259 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2260 the first operand is always the one to be used if both operands
2261 are equal, so we know what conditional expression this used to be. */
2262 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2264 tree op0
= TREE_OPERAND (t
, 0);
2265 tree op1
= TREE_OPERAND (t
, 1);
2267 /* The following code is incorrect if either operand side-effects. */
2268 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2269 && !TREE_SIDE_EFFECTS (op1
));
2271 build_conditional_expr (loc
,
2272 build_x_binary_op (loc
,
2273 (TREE_CODE (t
) == MIN_EXPR
2274 ? LE_EXPR
: GE_EXPR
),
2275 op0
, TREE_CODE (op0
),
2276 op1
, TREE_CODE (op1
),
2279 cp_build_unary_op (code
, op0
, false, complain
),
2280 cp_build_unary_op (code
, op1
, false, complain
),
2285 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2286 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), false,
2288 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), false,
2293 /* Given the TYPE of an anonymous union field inside T, return the
2294 FIELD_DECL for the field. If not found return NULL_TREE. Because
2295 anonymous unions can nest, we must also search all anonymous unions
2296 that are directly reachable. */
2299 lookup_anon_field (tree t
, tree type
)
2303 t
= TYPE_MAIN_VARIANT (t
);
2305 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2307 if (TREE_STATIC (field
))
2309 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2312 /* If we find it directly, return the field. */
2313 if (DECL_NAME (field
) == NULL_TREE
2314 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2319 /* Otherwise, it could be nested, search harder. */
2320 if (DECL_NAME (field
) == NULL_TREE
2321 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2323 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2331 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2332 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2333 non-NULL, it indicates the path to the base used to name MEMBER.
2334 If PRESERVE_REFERENCE is true, the expression returned will have
2335 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2336 returned will have the type referred to by the reference.
2338 This function does not perform access control; that is either done
2339 earlier by the parser when the name of MEMBER is resolved to MEMBER
2340 itself, or later when overload resolution selects one of the
2341 functions indicated by MEMBER. */
2344 build_class_member_access_expr (cp_expr object
, tree member
,
2345 tree access_path
, bool preserve_reference
,
2346 tsubst_flags_t complain
)
2350 tree result
= NULL_TREE
;
2351 tree using_decl
= NULL_TREE
;
2353 if (error_operand_p (object
) || error_operand_p (member
))
2354 return error_mark_node
;
2356 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2360 The type of the first expression shall be "class object" (of a
2362 object_type
= TREE_TYPE (object
);
2363 if (!currently_open_class (object_type
)
2364 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2365 return error_mark_node
;
2366 if (!CLASS_TYPE_P (object_type
))
2368 if (complain
& tf_error
)
2370 if (INDIRECT_TYPE_P (object_type
)
2371 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2372 error ("request for member %qD in %qE, which is of pointer "
2373 "type %qT (maybe you meant to use %<->%> ?)",
2374 member
, object
.get_value (), object_type
);
2376 error ("request for member %qD in %qE, which is of non-class "
2377 "type %qT", member
, object
.get_value (), object_type
);
2379 return error_mark_node
;
2382 /* The standard does not seem to actually say that MEMBER must be a
2383 member of OBJECT_TYPE. However, that is clearly what is
2385 if (DECL_P (member
))
2387 member_scope
= DECL_CLASS_CONTEXT (member
);
2388 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2389 return error_mark_node
;
2390 if (TREE_DEPRECATED (member
))
2391 warn_deprecated_use (member
, NULL_TREE
);
2394 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2395 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2396 presently be the anonymous union. Go outwards until we find a
2397 type related to OBJECT_TYPE. */
2398 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2399 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2401 member_scope
= TYPE_CONTEXT (member_scope
);
2402 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2404 if (complain
& tf_error
)
2406 if (TREE_CODE (member
) == FIELD_DECL
)
2407 error ("invalid use of nonstatic data member %qE", member
);
2409 error ("%qD is not a member of %qT", member
, object_type
);
2411 return error_mark_node
;
2414 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2415 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2416 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2418 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2420 object
= cp_build_fold_indirect_ref (temp
);
2423 /* In [expr.ref], there is an explicit list of the valid choices for
2424 MEMBER. We check for each of those cases here. */
2427 /* A static data member. */
2429 mark_exp_read (object
);
2430 /* If OBJECT has side-effects, they are supposed to occur. */
2431 if (TREE_SIDE_EFFECTS (object
))
2432 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2434 else if (TREE_CODE (member
) == FIELD_DECL
)
2436 /* A non-static data member. */
2441 if (INDIRECT_REF_P (object
))
2443 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2445 null_object_p
= false;
2447 /* Convert OBJECT to the type of MEMBER. */
2448 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2449 TYPE_MAIN_VARIANT (member_scope
)))
2454 binfo
= lookup_base (access_path
? access_path
: object_type
,
2455 member_scope
, ba_unique
, &kind
, complain
);
2456 if (binfo
== error_mark_node
)
2457 return error_mark_node
;
2459 /* It is invalid to try to get to a virtual base of a
2460 NULL object. The most common cause is invalid use of
2462 if (null_object_p
&& kind
== bk_via_virtual
)
2464 if (complain
& tf_error
)
2466 error ("invalid access to non-static data member %qD in "
2467 "virtual base of NULL object", member
);
2469 return error_mark_node
;
2472 /* Convert to the base. */
2473 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2474 /*nonnull=*/1, complain
);
2475 /* If we found the base successfully then we should be able
2476 to convert to it successfully. */
2477 gcc_assert (object
!= error_mark_node
);
2480 /* If MEMBER is from an anonymous aggregate, we have converted
2481 OBJECT so that it refers to the class containing the
2482 anonymous union. Generate a reference to the anonymous union
2483 itself, and recur to find MEMBER. */
2484 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2485 /* When this code is called from build_field_call, the
2486 object already has the type of the anonymous union.
2487 That is because the COMPONENT_REF was already
2488 constructed, and was then disassembled before calling
2489 build_field_call. After the function-call code is
2490 cleaned up, this waste can be eliminated. */
2491 && (!same_type_ignoring_top_level_qualifiers_p
2492 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2494 tree anonymous_union
;
2496 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2497 DECL_CONTEXT (member
));
2498 object
= build_class_member_access_expr (object
,
2500 /*access_path=*/NULL_TREE
,
2505 /* Compute the type of the field, as described in [expr.ref]. */
2506 type_quals
= TYPE_UNQUALIFIED
;
2507 member_type
= TREE_TYPE (member
);
2508 if (!TYPE_REF_P (member_type
))
2510 type_quals
= (cp_type_quals (member_type
)
2511 | cp_type_quals (object_type
));
2513 /* A field is const (volatile) if the enclosing object, or the
2514 field itself, is const (volatile). But, a mutable field is
2515 not const, even within a const object. */
2516 if (DECL_MUTABLE_P (member
))
2517 type_quals
&= ~TYPE_QUAL_CONST
;
2518 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2521 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2522 object
, member
, NULL_TREE
);
2524 /* Mark the expression const or volatile, as appropriate. Even
2525 though we've dealt with the type above, we still have to mark the
2526 expression itself. */
2527 if (type_quals
& TYPE_QUAL_CONST
)
2528 TREE_READONLY (result
) = 1;
2529 if (type_quals
& TYPE_QUAL_VOLATILE
)
2530 TREE_THIS_VOLATILE (result
) = 1;
2532 else if (BASELINK_P (member
))
2534 /* The member is a (possibly overloaded) member function. */
2538 /* If the MEMBER is exactly one static member function, then we
2539 know the type of the expression. Otherwise, we must wait
2540 until overload resolution has been performed. */
2541 functions
= BASELINK_FUNCTIONS (member
);
2542 if (TREE_CODE (functions
) == FUNCTION_DECL
2543 && DECL_STATIC_FUNCTION_P (functions
))
2544 type
= TREE_TYPE (functions
);
2546 type
= unknown_type_node
;
2547 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2548 base. That will happen when the function is called. */
2549 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2551 else if (TREE_CODE (member
) == CONST_DECL
)
2553 /* The member is an enumerator. */
2555 /* If OBJECT has side-effects, they are supposed to occur. */
2556 if (TREE_SIDE_EFFECTS (object
))
2557 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2560 else if ((using_decl
= strip_using_decl (member
)) != member
)
2561 result
= build_class_member_access_expr (object
,
2563 access_path
, preserve_reference
,
2567 if (complain
& tf_error
)
2568 error ("invalid use of %qD", member
);
2569 return error_mark_node
;
2572 if (!preserve_reference
)
2575 If E2 is declared to have type "reference to T", then ... the
2576 type of E1.E2 is T. */
2577 result
= convert_from_reference (result
);
2582 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2583 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2586 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2587 tsubst_flags_t complain
)
2589 tree object_type
= TREE_TYPE (object
);
2590 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2593 /* We've already complained about this destructor. */
2594 if (dtor_type
== error_mark_node
)
2595 return error_mark_node
;
2597 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2599 if (complain
& tf_error
)
2600 error ("qualified type %qT does not match destructor name ~%qT",
2602 return error_mark_node
;
2604 if (is_auto (dtor_type
))
2605 dtor_type
= object_type
;
2606 else if (identifier_p (dtor_type
))
2608 /* In a template, names we can't find a match for are still accepted
2609 destructor names, and we check them here. */
2610 if (check_dtor_name (object_type
, dtor_type
))
2611 dtor_type
= object_type
;
2614 if (complain
& tf_error
)
2615 error ("object type %qT does not match destructor name ~%qT",
2616 object_type
, dtor_type
);
2617 return error_mark_node
;
2621 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2623 if (complain
& tf_error
)
2624 error ("the type being destroyed is %qT, but the destructor "
2625 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2626 return error_mark_node
;
2628 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2629 /*protect=*/1, /*want_type=*/false,
2630 tf_warning_or_error
);
2633 if (complain
& tf_error
)
2634 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2635 return error_mark_node
;
2637 expr
= (adjust_result_of_qualified_name_lookup
2638 (expr
, dtor_type
, object_type
));
2639 if (scope
== NULL_TREE
)
2640 /* We need to call adjust_result_of_qualified_name_lookup in case the
2641 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2642 that we still get virtual function binding. */
2643 BASELINK_QUALIFIED_P (expr
) = false;
2647 /* An expression of the form "A::template B" has been resolved to
2648 DECL. Issue a diagnostic if B is not a template or template
2652 check_template_keyword (tree decl
)
2654 /* The standard says:
2658 If a name prefixed by the keyword template is not a member
2659 template, the program is ill-formed.
2661 DR 228 removed the restriction that the template be a member
2664 DR 96, if accepted would add the further restriction that explicit
2665 template arguments must be provided if the template keyword is
2666 used, but, as of 2005-10-16, that DR is still in "drafting". If
2667 this DR is accepted, then the semantic checks here can be
2668 simplified, as the entity named must in fact be a template
2669 specialization, rather than, as at present, a set of overloaded
2670 functions containing at least one template function. */
2671 if (TREE_CODE (decl
) != TEMPLATE_DECL
2672 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2676 if (DECL_USE_TEMPLATE (decl
)
2677 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2680 permerror (input_location
, "%qD is not a template", decl
);
2682 else if (!is_overloaded_fn (decl
))
2683 permerror (input_location
, "%qD is not a template", decl
);
2688 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
2689 !found
&& iter
; ++iter
)
2692 if (TREE_CODE (fn
) == TEMPLATE_DECL
2693 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
2694 || (TREE_CODE (fn
) == FUNCTION_DECL
2695 && DECL_USE_TEMPLATE (fn
)
2696 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
))))
2700 permerror (input_location
, "%qD is not a template", decl
);
2705 /* Record that an access failure occurred on BASETYPE_PATH attempting
2706 to access FIELD_DECL. */
2709 access_failure_info::record_access_failure (tree basetype_path
,
2712 m_was_inaccessible
= true;
2713 m_basetype_path
= basetype_path
;
2714 m_field_decl
= field_decl
;
2717 /* If an access failure was recorded, then attempt to locate an
2718 accessor function for the pertinent field, and if one is
2719 available, add a note and fix-it hint suggesting using it. */
2722 access_failure_info::maybe_suggest_accessor (bool const_p
) const
2724 if (!m_was_inaccessible
)
2728 = locate_field_accessor (m_basetype_path
, m_field_decl
, const_p
);
2732 /* The accessor must itself be accessible for it to be a reasonable
2734 if (!accessible_p (m_basetype_path
, accessor
, true))
2737 rich_location
richloc (line_table
, input_location
);
2739 pp_printf (&pp
, "%s()", IDENTIFIER_POINTER (DECL_NAME (accessor
)));
2740 richloc
.add_fixit_replace (pp_formatted_text (&pp
));
2741 inform (&richloc
, "field %q#D can be accessed via %q#D",
2742 m_field_decl
, accessor
);
2745 /* This function is called by the parser to process a class member
2746 access expression of the form OBJECT.NAME. NAME is a node used by
2747 the parser to represent a name; it is not yet a DECL. It may,
2748 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2749 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2750 there is no reason to do the lookup twice, so the parser keeps the
2751 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2752 be a template via the use of the "A::template B" syntax. */
2755 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2756 tsubst_flags_t complain
)
2761 tree access_path
= NULL_TREE
;
2762 tree orig_object
= object
;
2763 tree orig_name
= name
;
2765 if (object
== error_mark_node
|| name
== error_mark_node
)
2766 return error_mark_node
;
2768 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2769 if (!objc_is_public (object
, name
))
2770 return error_mark_node
;
2772 object_type
= TREE_TYPE (object
);
2774 if (processing_template_decl
)
2776 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2777 type_dependent_object_expression_p (object
)
2778 /* If NAME is "f<args>", where either 'f' or 'args' is
2779 dependent, then the expression is dependent. */
2780 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2781 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2782 TREE_OPERAND (name
, 1)))
2783 /* If NAME is "T::X" where "T" is dependent, then the
2784 expression is dependent. */
2785 || (TREE_CODE (name
) == SCOPE_REF
2786 && TYPE_P (TREE_OPERAND (name
, 0))
2787 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2790 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2791 orig_object
, orig_name
, NULL_TREE
);
2793 object
= build_non_dependent_expr (object
);
2795 else if (c_dialect_objc ()
2796 && identifier_p (name
)
2797 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2802 The type of the first expression shall be "class object" (of a
2804 if (!currently_open_class (object_type
)
2805 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2806 return error_mark_node
;
2807 if (!CLASS_TYPE_P (object_type
))
2809 if (complain
& tf_error
)
2811 if (INDIRECT_TYPE_P (object_type
)
2812 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2813 error ("request for member %qD in %qE, which is of pointer "
2814 "type %qT (maybe you meant to use %<->%> ?)",
2815 name
, object
.get_value (), object_type
);
2817 error ("request for member %qD in %qE, which is of non-class "
2818 "type %qT", name
, object
.get_value (), object_type
);
2820 return error_mark_node
;
2823 if (BASELINK_P (name
))
2824 /* A member function that has already been looked up. */
2828 bool is_template_id
= false;
2829 tree template_args
= NULL_TREE
;
2830 tree scope
= NULL_TREE
;
2832 access_path
= object_type
;
2834 if (TREE_CODE (name
) == SCOPE_REF
)
2836 /* A qualified name. The qualifying class or namespace `S'
2837 has already been looked up; it is either a TYPE or a
2839 scope
= TREE_OPERAND (name
, 0);
2840 name
= TREE_OPERAND (name
, 1);
2842 /* If SCOPE is a namespace, then the qualified name does not
2843 name a member of OBJECT_TYPE. */
2844 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2846 if (complain
& tf_error
)
2847 error ("%<%D::%D%> is not a member of %qT",
2848 scope
, name
, object_type
);
2849 return error_mark_node
;
2853 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2855 is_template_id
= true;
2856 template_args
= TREE_OPERAND (name
, 1);
2857 name
= TREE_OPERAND (name
, 0);
2859 if (!identifier_p (name
))
2860 name
= OVL_NAME (name
);
2865 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2867 gcc_assert (!is_template_id
);
2868 /* Looking up a member enumerator (c++/56793). */
2869 if (!TYPE_CLASS_SCOPE_P (scope
)
2870 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2872 if (complain
& tf_error
)
2873 error ("%<%D::%D%> is not a member of %qT",
2874 scope
, name
, object_type
);
2875 return error_mark_node
;
2877 tree val
= lookup_enumerator (scope
, name
);
2880 if (complain
& tf_error
)
2881 error ("%qD is not a member of %qD",
2883 return error_mark_node
;
2886 if (TREE_SIDE_EFFECTS (object
))
2887 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2891 gcc_assert (CLASS_TYPE_P (scope
));
2892 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2894 if (constructor_name_p (name
, scope
))
2896 if (complain
& tf_error
)
2897 error ("cannot call constructor %<%T::%D%> directly",
2899 return error_mark_node
;
2902 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2903 access_path
= lookup_base (object_type
, scope
, ba_check
,
2905 if (access_path
== error_mark_node
)
2906 return error_mark_node
;
2909 if (any_dependent_bases_p (object_type
))
2911 if (complain
& tf_error
)
2912 error ("%qT is not a base of %qT", scope
, object_type
);
2913 return error_mark_node
;
2917 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2919 if (dependent_type_p (object_type
))
2920 /* The destructor isn't declared yet. */
2922 member
= lookup_destructor (object
, scope
, name
, complain
);
2926 /* Look up the member. */
2927 access_failure_info afi
;
2928 member
= lookup_member (access_path
, name
, /*protect=*/1,
2929 /*want_type=*/false, complain
,
2931 afi
.maybe_suggest_accessor (TYPE_READONLY (object_type
));
2932 if (member
== NULL_TREE
)
2934 if (dependent_type_p (object_type
))
2935 /* Try again at instantiation time. */
2937 if (complain
& tf_error
)
2939 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2940 /*want_type=*/false);
2943 location_t bogus_component_loc
= input_location
;
2944 gcc_rich_location
rich_loc (bogus_component_loc
);
2945 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
2947 error_at (&rich_loc
,
2948 "%q#T has no member named %qE;"
2949 " did you mean %qE?",
2950 TREE_CODE (access_path
) == TREE_BINFO
2951 ? TREE_TYPE (access_path
) : object_type
,
2955 error ("%q#T has no member named %qE",
2956 TREE_CODE (access_path
) == TREE_BINFO
2957 ? TREE_TYPE (access_path
) : object_type
, name
);
2959 return error_mark_node
;
2961 if (member
== error_mark_node
)
2962 return error_mark_node
;
2964 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
2965 /* Dependent type attributes on the decl mean that the TREE_TYPE is
2966 wrong, so don't use it. */
2968 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2974 tree templ
= member
;
2976 if (BASELINK_P (templ
))
2977 member
= lookup_template_function (templ
, template_args
);
2978 else if (variable_template_p (templ
))
2979 member
= (lookup_and_finish_template_variable
2980 (templ
, template_args
, complain
));
2983 if (complain
& tf_error
)
2984 error ("%qD is not a member template function", name
);
2985 return error_mark_node
;
2990 if (TREE_DEPRECATED (member
))
2991 warn_deprecated_use (member
, NULL_TREE
);
2994 check_template_keyword (member
);
2996 expr
= build_class_member_access_expr (object
, member
, access_path
,
2997 /*preserve_reference=*/false,
2999 if (processing_template_decl
&& expr
!= error_mark_node
)
3001 if (BASELINK_P (member
))
3003 if (TREE_CODE (orig_name
) == SCOPE_REF
)
3004 BASELINK_QUALIFIED_P (member
) = 1;
3007 return build_min_non_dep (COMPONENT_REF
, expr
,
3008 orig_object
, orig_name
,
3015 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
3019 build_simple_component_ref (tree object
, tree member
)
3021 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
3022 cp_type_quals (TREE_TYPE (object
)));
3023 return build3_loc (input_location
,
3024 COMPONENT_REF
, type
,
3025 object
, member
, NULL_TREE
);
3028 /* Return an expression for the MEMBER_NAME field in the internal
3029 representation of PTRMEM, a pointer-to-member function. (Each
3030 pointer-to-member function type gets its own RECORD_TYPE so it is
3031 more convenient to access the fields by name than by FIELD_DECL.)
3032 This routine converts the NAME to a FIELD_DECL and then creates the
3033 node for the complete expression. */
3036 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
3041 if (TREE_CODE (ptrmem
) == CONSTRUCTOR
)
3045 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ptrmem
),
3047 if (index
&& DECL_P (index
) && DECL_NAME (index
) == member_name
)
3052 /* This code is a stripped down version of
3053 build_class_member_access_expr. It does not work to use that
3054 routine directly because it expects the object to be of class
3056 ptrmem_type
= TREE_TYPE (ptrmem
);
3057 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
3058 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
3059 member
= DECL_CHAIN (member
))
3060 if (DECL_NAME (member
) == member_name
)
3062 tree res
= build_simple_component_ref (ptrmem
, member
);
3064 TREE_NO_WARNING (res
) = 1;
3068 /* Given an expression PTR for a pointer, return an expression
3069 for the value pointed to.
3070 ERRORSTRING is the name of the operator to appear in error messages.
3072 This function may need to overload OPERATOR_FNNAME.
3073 Must also handle REFERENCE_TYPEs for C++. */
3076 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
3077 tsubst_flags_t complain
)
3079 tree orig_expr
= expr
;
3081 tree overload
= NULL_TREE
;
3083 if (processing_template_decl
)
3085 /* Retain the type if we know the operand is a pointer. */
3086 if (TREE_TYPE (expr
) && INDIRECT_TYPE_P (TREE_TYPE (expr
)))
3087 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
3088 if (type_dependent_expression_p (expr
))
3089 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
3090 expr
= build_non_dependent_expr (expr
);
3093 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
3094 NULL_TREE
, NULL_TREE
, &overload
, complain
);
3096 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
3098 if (processing_template_decl
&& rval
!= error_mark_node
)
3100 if (overload
!= NULL_TREE
)
3101 return (build_min_non_dep_op_overload
3102 (INDIRECT_REF
, rval
, overload
, orig_expr
));
3104 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
3110 /* The implementation of the above, and of indirection implied by other
3111 constructs. If DO_FOLD is true, fold away INDIRECT_REF of ADDR_EXPR. */
3114 cp_build_indirect_ref_1 (tree ptr
, ref_operator errorstring
,
3115 tsubst_flags_t complain
, bool do_fold
)
3119 /* RO_NULL should only be used with the folding entry points below, not
3120 cp_build_indirect_ref. */
3121 gcc_checking_assert (errorstring
!= RO_NULL
|| do_fold
);
3123 if (ptr
== current_class_ptr
3124 || (TREE_CODE (ptr
) == NOP_EXPR
3125 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3126 && (same_type_ignoring_top_level_qualifiers_p
3127 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3128 return current_class_ref
;
3130 pointer
= (TYPE_REF_P (TREE_TYPE (ptr
))
3131 ? ptr
: decay_conversion (ptr
, complain
));
3132 if (pointer
== error_mark_node
)
3133 return error_mark_node
;
3135 type
= TREE_TYPE (pointer
);
3137 if (INDIRECT_TYPE_P (type
))
3141 If the type of the expression is "pointer to T," the type
3142 of the result is "T." */
3143 tree t
= TREE_TYPE (type
);
3145 if ((CONVERT_EXPR_P (ptr
)
3146 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3147 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3149 /* If a warning is issued, mark it to avoid duplicates from
3150 the backend. This only needs to be done at
3151 warn_strict_aliasing > 2. */
3152 if (warn_strict_aliasing
> 2)
3153 if (strict_aliasing_warning (EXPR_LOCATION (ptr
),
3154 type
, TREE_OPERAND (ptr
, 0)))
3155 TREE_NO_WARNING (ptr
) = 1;
3158 if (VOID_TYPE_P (t
))
3160 /* A pointer to incomplete type (other than cv void) can be
3161 dereferenced [expr.unary.op]/1 */
3162 if (complain
& tf_error
)
3163 error ("%qT is not a pointer-to-object type", type
);
3164 return error_mark_node
;
3166 else if (do_fold
&& TREE_CODE (pointer
) == ADDR_EXPR
3167 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3168 /* The POINTER was something like `&x'. We simplify `*&x' to
3170 return TREE_OPERAND (pointer
, 0);
3173 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3175 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3176 so that we get the proper error message if the result is used
3177 to assign to. Also, &* is supposed to be a no-op. */
3178 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3179 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3180 TREE_SIDE_EFFECTS (ref
)
3181 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3185 else if (!(complain
& tf_error
))
3186 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3188 /* `pointer' won't be an error_mark_node if we were given a
3189 pointer to member, so it's cool to check for this here. */
3190 else if (TYPE_PTRMEM_P (type
))
3191 switch (errorstring
)
3193 case RO_ARRAY_INDEXING
:
3194 error ("invalid use of array indexing on pointer to member");
3197 error ("invalid use of unary %<*%> on pointer to member");
3199 case RO_IMPLICIT_CONVERSION
:
3200 error ("invalid use of implicit conversion on pointer to member");
3203 error ("left hand operand of %<->*%> must be a pointer to class, "
3204 "but is a pointer to member of type %qT", type
);
3209 else if (pointer
!= error_mark_node
)
3210 invalid_indirection_error (input_location
, type
, errorstring
);
3212 return error_mark_node
;
3215 /* Entry point used by c-common, which expects folding. */
3218 build_indirect_ref (location_t
/*loc*/,
3219 tree ptr
, ref_operator errorstring
)
3221 return cp_build_indirect_ref_1 (ptr
, errorstring
, tf_warning_or_error
, true);
3224 /* Entry point used by internal indirection needs that don't correspond to any
3225 syntactic construct. */
3228 cp_build_fold_indirect_ref (tree pointer
)
3230 return cp_build_indirect_ref_1 (pointer
, RO_NULL
, tf_warning_or_error
, true);
3233 /* Entry point used by indirection needs that correspond to some syntactic
3237 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
3238 tsubst_flags_t complain
)
3240 return cp_build_indirect_ref_1 (ptr
, errorstring
, complain
, false);
3243 /* This handles expressions of the form "a[i]", which denotes
3246 This is logically equivalent in C to *(a+i), but we may do it differently.
3247 If A is a variable or a member, we generate a primitive ARRAY_REF.
3248 This avoids forcing the array out of registers, and can work on
3249 arrays that are not lvalues (for example, members of structures returned
3252 If INDEX is of some user-defined type, it must be converted to
3253 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3254 will inherit the type of the array, which will be some pointer type.
3256 LOC is the location to use in building the array reference. */
3259 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3260 tsubst_flags_t complain
)
3266 if (complain
& tf_error
)
3267 error_at (loc
, "subscript missing in array reference");
3268 return error_mark_node
;
3271 if (TREE_TYPE (array
) == error_mark_node
3272 || TREE_TYPE (idx
) == error_mark_node
)
3273 return error_mark_node
;
3275 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3277 switch (TREE_CODE (array
))
3281 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3283 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3284 TREE_OPERAND (array
, 0), value
);
3285 SET_EXPR_LOCATION (ret
, loc
);
3290 ret
= build_conditional_expr
3291 (loc
, TREE_OPERAND (array
, 0),
3292 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3294 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3297 protected_set_expr_location (ret
, loc
);
3304 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3306 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3310 warn_array_subscript_with_type_char (loc
, idx
);
3312 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3314 if (complain
& tf_error
)
3315 error_at (loc
, "array subscript is not an integer");
3316 return error_mark_node
;
3319 /* Apply integral promotions *after* noticing character types.
3320 (It is unclear why we do these promotions -- the standard
3321 does not say that we should. In fact, the natural thing would
3322 seem to be to convert IDX to ptrdiff_t; we're performing
3323 pointer arithmetic.) */
3324 idx
= cp_perform_integral_promotions (idx
, complain
);
3326 /* An array that is indexed by a non-constant
3327 cannot be stored in a register; we must be able to do
3328 address arithmetic on its address.
3329 Likewise an array of elements of variable size. */
3330 if (TREE_CODE (idx
) != INTEGER_CST
3331 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3332 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3335 if (!cxx_mark_addressable (array
, true))
3336 return error_mark_node
;
3339 /* An array that is indexed by a constant value which is not within
3340 the array bounds cannot be stored in a register either; because we
3341 would get a crash in store_bit_field/extract_bit_field when trying
3342 to access a non-existent part of the register. */
3343 if (TREE_CODE (idx
) == INTEGER_CST
3344 && TYPE_DOMAIN (TREE_TYPE (array
))
3345 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3347 if (!cxx_mark_addressable (array
))
3348 return error_mark_node
;
3351 /* Note in C++ it is valid to subscript a `register' array, since
3352 it is valid to take the address of something with that
3353 storage specification. */
3357 while (TREE_CODE (foo
) == COMPONENT_REF
)
3358 foo
= TREE_OPERAND (foo
, 0);
3359 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3360 && (complain
& tf_warning
))
3361 warning_at (loc
, OPT_Wextra
,
3362 "subscripting array declared %<register%>");
3365 type
= TREE_TYPE (TREE_TYPE (array
));
3366 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3367 /* Array ref is const/volatile if the array elements are
3368 or if the array is.. */
3369 TREE_READONLY (rval
)
3370 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3371 TREE_SIDE_EFFECTS (rval
)
3372 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3373 TREE_THIS_VOLATILE (rval
)
3374 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3375 ret
= require_complete_type_sfinae (rval
, complain
);
3376 protected_set_expr_location (ret
, loc
);
3378 ret
= non_lvalue_loc (loc
, ret
);
3383 tree ar
= cp_default_conversion (array
, complain
);
3384 tree ind
= cp_default_conversion (idx
, complain
);
3386 /* Put the integer in IND to simplify error checking. */
3387 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3388 std::swap (ar
, ind
);
3390 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3391 return error_mark_node
;
3393 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3395 if (complain
& tf_error
)
3396 error_at (loc
, "subscripted value is neither array nor pointer");
3397 return error_mark_node
;
3399 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3401 if (complain
& tf_error
)
3402 error_at (loc
, "array subscript is not an integer");
3403 return error_mark_node
;
3406 warn_array_subscript_with_type_char (loc
, idx
);
3408 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3413 protected_set_expr_location (ret
, loc
);
3415 ret
= non_lvalue_loc (loc
, ret
);
3420 /* Entry point for Obj-C++. */
3423 build_array_ref (location_t loc
, tree array
, tree idx
)
3425 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3428 /* Resolve a pointer to member function. INSTANCE is the object
3429 instance to use, if the member points to a virtual member.
3431 This used to avoid checking for virtual functions if basetype
3432 has no virtual functions, according to an earlier ANSI draft.
3433 With the final ISO C++ rules, such an optimization is
3434 incorrect: A pointer to a derived member can be static_cast
3435 to pointer-to-base-member, as long as the dynamic object
3436 later has the right member. So now we only do this optimization
3437 when we know the dynamic type of the object. */
3440 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3441 tsubst_flags_t complain
)
3443 if (TREE_CODE (function
) == OFFSET_REF
)
3444 function
= TREE_OPERAND (function
, 1);
3446 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3448 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3450 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3451 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3453 tree instance_ptr
= *instance_ptrptr
;
3454 tree instance_save_expr
= 0;
3455 if (instance_ptr
== error_mark_node
)
3457 if (TREE_CODE (function
) == PTRMEM_CST
)
3459 /* Extracting the function address from a pmf is only
3460 allowed with -Wno-pmf-conversions. It only works for
3462 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3463 e1
= convert (fntype
, e1
);
3468 if (complain
& tf_error
)
3469 error ("object missing in use of %qE", function
);
3470 return error_mark_node
;
3474 /* True if we know that the dynamic type of the object doesn't have
3475 virtual functions, so we can assume the PFN field is a pointer. */
3476 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3477 && !TYPE_POLYMORPHIC_P (basetype
)
3478 && resolves_to_fixed_type_p (instance_ptr
, 0));
3480 /* If we don't really have an object (i.e. in an ill-formed
3481 conversion from PMF to pointer), we can't resolve virtual
3482 functions anyway. */
3483 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3486 if (TREE_SIDE_EFFECTS (instance_ptr
))
3487 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3489 if (TREE_SIDE_EFFECTS (function
))
3490 function
= save_expr (function
);
3492 /* Start by extracting all the information from the PMF itself. */
3493 e3
= pfn_from_ptrmemfunc (function
);
3494 delta
= delta_from_ptrmemfunc (function
);
3495 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3496 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3498 int flag_sanitize_save
;
3499 case ptrmemfunc_vbit_in_pfn
:
3500 e1
= cp_build_binary_op (input_location
,
3501 BIT_AND_EXPR
, idx
, integer_one_node
,
3503 idx
= cp_build_binary_op (input_location
,
3504 MINUS_EXPR
, idx
, integer_one_node
,
3506 if (idx
== error_mark_node
)
3507 return error_mark_node
;
3510 case ptrmemfunc_vbit_in_delta
:
3511 e1
= cp_build_binary_op (input_location
,
3512 BIT_AND_EXPR
, delta
, integer_one_node
,
3514 /* Don't instrument the RSHIFT_EXPR we're about to create because
3515 we're going to use DELTA number of times, and that wouldn't play
3516 well with SAVE_EXPRs therein. */
3517 flag_sanitize_save
= flag_sanitize
;
3519 delta
= cp_build_binary_op (input_location
,
3520 RSHIFT_EXPR
, delta
, integer_one_node
,
3522 flag_sanitize
= flag_sanitize_save
;
3523 if (delta
== error_mark_node
)
3524 return error_mark_node
;
3531 if (e1
== error_mark_node
)
3532 return error_mark_node
;
3534 /* Convert down to the right base before using the instance. A
3535 special case is that in a pointer to member of class C, C may
3536 be incomplete. In that case, the function will of course be
3537 a member of C, and no conversion is required. In fact,
3538 lookup_base will fail in that case, because incomplete
3539 classes do not have BINFOs. */
3540 if (!same_type_ignoring_top_level_qualifiers_p
3541 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3543 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3544 basetype
, ba_check
, NULL
, complain
);
3545 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3547 if (instance_ptr
== error_mark_node
)
3548 return error_mark_node
;
3550 /* ...and then the delta in the PMF. */
3551 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3553 /* Hand back the adjusted 'this' argument to our caller. */
3554 *instance_ptrptr
= instance_ptr
;
3557 /* Now just return the pointer. */
3560 /* Next extract the vtable pointer from the object. */
3561 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3563 vtbl
= cp_build_fold_indirect_ref (vtbl
);
3564 if (vtbl
== error_mark_node
)
3565 return error_mark_node
;
3567 /* Finally, extract the function pointer from the vtable. */
3568 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3569 e2
= cp_build_fold_indirect_ref (e2
);
3570 if (e2
== error_mark_node
)
3571 return error_mark_node
;
3572 TREE_CONSTANT (e2
) = 1;
3574 /* When using function descriptors, the address of the
3575 vtable entry is treated as a function pointer. */
3576 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3577 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3578 cp_build_addr_expr (e2
, complain
));
3580 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3581 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3582 if (e1
== error_mark_node
)
3583 return error_mark_node
;
3585 /* Make sure this doesn't get evaluated first inside one of the
3586 branches of the COND_EXPR. */
3587 if (instance_save_expr
)
3588 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3589 instance_save_expr
, e1
);
3596 /* Used by the C-common bits. */
3598 build_function_call (location_t
/*loc*/,
3599 tree function
, tree params
)
3601 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3604 /* Used by the C-common bits. */
3606 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3607 tree function
, vec
<tree
, va_gc
> *params
,
3608 vec
<tree
, va_gc
> * /*origtypes*/)
3610 vec
<tree
, va_gc
> *orig_params
= params
;
3611 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3612 tf_warning_or_error
);
3614 /* cp_build_function_call_vec can reallocate PARAMS by adding
3615 default arguments. That should never happen here. Verify
3617 gcc_assert (params
== orig_params
);
3622 /* Build a function call using a tree list of arguments. */
3625 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3627 vec
<tree
, va_gc
> *vec
;
3630 vec
= make_tree_vector ();
3631 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3632 vec_safe_push (vec
, TREE_VALUE (params
));
3633 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3634 release_tree_vector (vec
);
3638 /* Build a function call using varargs. */
3641 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3643 vec
<tree
, va_gc
> *vec
;
3647 vec
= make_tree_vector ();
3648 va_start (args
, complain
);
3649 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3650 vec_safe_push (vec
, t
);
3652 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3653 release_tree_vector (vec
);
3657 /* Build a function call using a vector of arguments. PARAMS may be
3658 NULL if there are no parameters. This changes the contents of
3662 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3663 tsubst_flags_t complain
)
3665 tree fntype
, fndecl
;
3667 tree original
= function
;
3671 vec
<tree
, va_gc
> *allocated
= NULL
;
3674 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3675 expressions, like those used for ObjC messenger dispatches. */
3676 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3677 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3679 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3680 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3681 if (TREE_CODE (function
) == NOP_EXPR
3682 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3683 function
= TREE_OPERAND (function
, 0);
3685 if (TREE_CODE (function
) == FUNCTION_DECL
)
3687 /* If the function is a non-template member function
3688 or a non-template friend, then we need to check the
3691 Note that if overload resolution failed with a single
3692 candidate this function will be used to explicitly diagnose
3693 the failure for the single call expression. The check is
3694 technically redundant since we also would have failed in
3695 add_function_candidate. */
3697 && (complain
& tf_error
)
3698 && !constraints_satisfied_p (function
))
3700 error ("cannot call function %qD", function
);
3701 location_t loc
= DECL_SOURCE_LOCATION (function
);
3702 diagnose_constraints (loc
, function
, NULL_TREE
);
3703 return error_mark_node
;
3706 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3707 return error_mark_node
;
3710 /* Convert anything with function type to a pointer-to-function. */
3711 if (DECL_MAIN_P (function
))
3713 if (complain
& tf_error
)
3714 pedwarn (input_location
, OPT_Wpedantic
,
3715 "ISO C++ forbids calling %<::main%> from within program");
3717 return error_mark_node
;
3719 function
= build_addr_func (function
, complain
);
3725 function
= build_addr_func (function
, complain
);
3728 if (function
== error_mark_node
)
3729 return error_mark_node
;
3731 fntype
= TREE_TYPE (function
);
3733 if (TYPE_PTRMEMFUNC_P (fntype
))
3735 if (complain
& tf_error
)
3736 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3737 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3738 original
, original
);
3739 return error_mark_node
;
3742 is_method
= (TYPE_PTR_P (fntype
)
3743 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3745 if (!(TYPE_PTRFN_P (fntype
)
3747 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3749 if (complain
& tf_error
)
3751 if (!flag_diagnostics_show_caret
)
3752 error_at (input_location
,
3753 "%qE cannot be used as a function", original
);
3754 else if (DECL_P (original
))
3755 error_at (input_location
,
3756 "%qD cannot be used as a function", original
);
3758 error_at (input_location
,
3759 "expression cannot be used as a function");
3762 return error_mark_node
;
3765 /* fntype now gets the type of function pointed to. */
3766 fntype
= TREE_TYPE (fntype
);
3767 parm_types
= TYPE_ARG_TYPES (fntype
);
3771 allocated
= make_tree_vector ();
3772 params
= &allocated
;
3775 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3778 return error_mark_node
;
3780 argarray
= (*params
)->address ();
3782 /* Check for errors in format strings and inappropriately
3784 bool warned_p
= check_function_arguments (input_location
, fndecl
, fntype
,
3785 nargs
, argarray
, NULL
);
3787 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3791 tree c
= extract_call_expr (ret
);
3792 if (TREE_CODE (c
) == CALL_EXPR
)
3793 TREE_NO_WARNING (c
) = 1;
3796 if (allocated
!= NULL
)
3797 release_tree_vector (allocated
);
3802 /* Subroutine of convert_arguments.
3803 Print an error message about a wrong number of arguments. */
3806 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3810 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3812 if (DECL_NAME (fndecl
) == NULL_TREE
3813 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3816 ? G_("too many arguments to constructor %q#D")
3817 : G_("too few arguments to constructor %q#D"),
3822 ? G_("too many arguments to member function %q#D")
3823 : G_("too few arguments to member function %q#D"),
3829 ? G_("too many arguments to function %q#D")
3830 : G_("too few arguments to function %q#D"),
3832 if (!DECL_IS_BUILTIN (fndecl
))
3833 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3837 if (c_dialect_objc () && objc_message_selector ())
3840 ? G_("too many arguments to method %q#D")
3841 : G_("too few arguments to method %q#D"),
3842 objc_message_selector ());
3844 error_at (loc
, too_many_p
? G_("too many arguments to function")
3845 : G_("too few arguments to function"));
3849 /* Convert the actual parameter expressions in the list VALUES to the
3850 types in the list TYPELIST. The converted expressions are stored
3851 back in the VALUES vector.
3852 If parmdecls is exhausted, or when an element has NULL as its type,
3853 perform the default conversions.
3855 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3857 This is also where warnings about wrong number of args are generated.
3859 Returns the actual number of arguments processed (which might be less
3860 than the length of the vector), or -1 on error.
3862 In C++, unspecified trailing parameters can be filled in with their
3863 default arguments, if such were specified. Do so here. */
3866 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3867 int flags
, tsubst_flags_t complain
)
3872 /* Argument passing is always copy-initialization. */
3873 flags
|= LOOKUP_ONLYCONVERTING
;
3875 for (i
= 0, typetail
= typelist
;
3876 i
< vec_safe_length (*values
);
3879 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3880 tree val
= (**values
)[i
];
3882 if (val
== error_mark_node
|| type
== error_mark_node
)
3885 if (type
== void_type_node
)
3887 if (complain
& tf_error
)
3889 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3896 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3897 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3898 if (TREE_CODE (val
) == NOP_EXPR
3899 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3900 && (type
== 0 || !TYPE_REF_P (type
)))
3901 val
= TREE_OPERAND (val
, 0);
3903 if (type
== 0 || !TYPE_REF_P (type
))
3905 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3906 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3907 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3908 val
= decay_conversion (val
, complain
);
3911 if (val
== error_mark_node
)
3916 /* Formal parm type is specified by a function prototype. */
3919 if (!COMPLETE_TYPE_P (complete_type (type
)))
3921 if (complain
& tf_error
)
3924 error ("parameter %P of %qD has incomplete type %qT",
3927 error ("parameter %P has incomplete type %qT", i
, type
);
3929 parmval
= error_mark_node
;
3933 parmval
= convert_for_initialization
3934 (NULL_TREE
, type
, val
, flags
,
3935 ICR_ARGPASS
, fndecl
, i
, complain
);
3936 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3939 if (parmval
== error_mark_node
)
3942 (**values
)[i
] = parmval
;
3946 if (fndecl
&& magic_varargs_p (fndecl
))
3947 /* Don't do ellipsis conversion for __built_in_constant_p
3948 as this will result in spurious errors for non-trivial
3950 val
= require_complete_type_sfinae (val
, complain
);
3952 val
= convert_arg_to_ellipsis (val
, complain
);
3954 (**values
)[i
] = val
;
3958 typetail
= TREE_CHAIN (typetail
);
3961 if (typetail
!= 0 && typetail
!= void_list_node
)
3963 /* See if there are default arguments that can be used. Because
3964 we hold default arguments in the FUNCTION_TYPE (which is so
3965 wrong), we can see default parameters here from deduced
3966 contexts (and via typeof) for indirect function calls.
3967 Fortunately we know whether we have a function decl to
3968 provide default arguments in a language conformant
3970 if (fndecl
&& TREE_PURPOSE (typetail
)
3971 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3973 for (; typetail
!= void_list_node
; ++i
)
3975 /* After DR777, with explicit template args we can end up with a
3976 default argument followed by no default argument. */
3977 if (!TREE_PURPOSE (typetail
))
3980 = convert_default_arg (TREE_VALUE (typetail
),
3981 TREE_PURPOSE (typetail
),
3982 fndecl
, i
, complain
);
3984 if (parmval
== error_mark_node
)
3987 vec_safe_push (*values
, parmval
);
3988 typetail
= TREE_CHAIN (typetail
);
3989 /* ends with `...'. */
3990 if (typetail
== NULL_TREE
)
3995 if (typetail
&& typetail
!= void_list_node
)
3997 if (complain
& tf_error
)
3998 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
4006 /* Build a binary-operation expression, after performing default
4007 conversions on the operands. CODE is the kind of expression to
4008 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
4009 are the tree codes which correspond to ARG1 and ARG2 when issuing
4010 warnings about possibly misplaced parentheses. They may differ
4011 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
4012 folding (e.g., if the parser sees "a | 1 + 1", it may call this
4013 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
4014 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
4015 ARG2_CODE as ERROR_MARK. */
4018 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
4019 enum tree_code arg1_code
, tree arg2
,
4020 enum tree_code arg2_code
, tree
*overload_p
,
4021 tsubst_flags_t complain
)
4026 tree overload
= NULL_TREE
;
4031 if (processing_template_decl
)
4033 if (type_dependent_expression_p (arg1
)
4034 || type_dependent_expression_p (arg2
))
4035 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
4036 arg1
= build_non_dependent_expr (arg1
);
4037 arg2
= build_non_dependent_expr (arg2
);
4040 if (code
== DOTSTAR_EXPR
)
4041 expr
= build_m_component_ref (arg1
, arg2
, complain
);
4043 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
4044 &overload
, complain
);
4046 if (overload_p
!= NULL
)
4047 *overload_p
= overload
;
4049 /* Check for cases such as x+y<<z which users are likely to
4050 misinterpret. But don't warn about obj << x + y, since that is a
4051 common idiom for I/O. */
4052 if (warn_parentheses
4053 && (complain
& tf_warning
)
4054 && !processing_template_decl
4055 && !error_operand_p (arg1
)
4056 && !error_operand_p (arg2
)
4057 && (code
!= LSHIFT_EXPR
4058 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
4059 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
4060 arg2_code
, orig_arg2
);
4062 if (processing_template_decl
&& expr
!= error_mark_node
)
4064 if (overload
!= NULL_TREE
)
4065 return (build_min_non_dep_op_overload
4066 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
4068 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
4074 /* Build and return an ARRAY_REF expression. */
4077 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
4078 tsubst_flags_t complain
)
4080 tree orig_arg1
= arg1
;
4081 tree orig_arg2
= arg2
;
4083 tree overload
= NULL_TREE
;
4085 if (processing_template_decl
)
4087 if (type_dependent_expression_p (arg1
)
4088 || type_dependent_expression_p (arg2
))
4089 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
4090 NULL_TREE
, NULL_TREE
);
4091 arg1
= build_non_dependent_expr (arg1
);
4092 arg2
= build_non_dependent_expr (arg2
);
4095 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
4096 NULL_TREE
, &overload
, complain
);
4098 if (processing_template_decl
&& expr
!= error_mark_node
)
4100 if (overload
!= NULL_TREE
)
4101 return (build_min_non_dep_op_overload
4102 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
4104 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
4105 NULL_TREE
, NULL_TREE
);
4110 /* Return whether OP is an expression of enum type cast to integer
4111 type. In C++ even unsigned enum types are cast to signed integer
4112 types. We do not want to issue warnings about comparisons between
4113 signed and unsigned types when one of the types is an enum type.
4114 Those warnings are always false positives in practice. */
4117 enum_cast_to_int (tree op
)
4119 if (CONVERT_EXPR_P (op
)
4120 && TREE_TYPE (op
) == integer_type_node
4121 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
4122 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
4125 /* The cast may have been pushed into a COND_EXPR. */
4126 if (TREE_CODE (op
) == COND_EXPR
)
4127 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
4128 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
4133 /* For the c-common bits. */
4135 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
4138 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
4141 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4142 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4145 build_vec_cmp (tree_code code
, tree type
,
4146 tree arg0
, tree arg1
)
4148 tree zero_vec
= build_zero_cst (type
);
4149 tree minus_one_vec
= build_minus_one_cst (type
);
4150 tree cmp_type
= build_same_sized_truth_vector_type(type
);
4151 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4152 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4155 /* Possibly warn about an address never being NULL. */
4158 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4161 || (complain
& tf_warning
) == 0
4162 || c_inhibit_evaluation_warnings
!= 0
4163 || TREE_NO_WARNING (op
))
4166 tree cop
= fold_non_dependent_expr (op
, complain
);
4168 if (TREE_CODE (cop
) == ADDR_EXPR
4169 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4170 && !TREE_NO_WARNING (cop
))
4171 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4172 "be NULL", TREE_OPERAND (cop
, 0));
4174 if (CONVERT_EXPR_P (op
)
4175 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (op
, 0))))
4178 STRIP_NOPS (inner_op
);
4180 if (DECL_P (inner_op
))
4181 warning_at (location
, OPT_Waddress
,
4182 "the compiler can assume that the address of "
4183 "%qD will never be NULL", inner_op
);
4187 /* Build a binary-operation expression without default conversions.
4188 CODE is the kind of expression to build.
4189 LOCATION is the location_t of the operator in the source code.
4190 This function differs from `build' in several ways:
4191 the data type of the result is computed and recorded in it,
4192 warnings are generated if arg data types are invalid,
4193 special handling for addition and subtraction of pointers is known,
4194 and some optimization is done (operations on narrow ints
4195 are done in the narrower type when that gives the same result).
4196 Constant folding is also done before the result is returned.
4198 Note that the operands will never have enumeral types
4199 because either they have just had the default conversions performed
4200 or they have both just been converted to some other type in which
4201 the arithmetic is to be done.
4203 C++: must do special pointer arithmetic when implementing
4204 multiple inheritance, and deal with pointer to member functions. */
4207 cp_build_binary_op (location_t location
,
4208 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4209 tsubst_flags_t complain
)
4212 enum tree_code code0
, code1
;
4214 const char *invalid_op_diag
;
4216 /* Expression code to give to the expression when it is built.
4217 Normally this is CODE, which is what the caller asked for,
4218 but in some special cases we change it. */
4219 enum tree_code resultcode
= code
;
4221 /* Data type in which the computation is to be performed.
4222 In the simplest cases this is the common type of the arguments. */
4223 tree result_type
= NULL_TREE
;
4225 /* Nonzero means operands have already been type-converted
4226 in whatever way is necessary.
4227 Zero means they need to be converted to RESULT_TYPE. */
4230 /* Nonzero means create the expression with this type, rather than
4232 tree build_type
= 0;
4234 /* Nonzero means after finally constructing the expression
4235 convert it to this type. */
4236 tree final_type
= 0;
4238 tree result
, result_ovl
;
4240 /* Nonzero if this is an operation like MIN or MAX which can
4241 safely be computed in short if both args are promoted shorts.
4242 Also implies COMMON.
4243 -1 indicates a bitwise operation; this makes a difference
4244 in the exact conditions for when it is safe to do the operation
4245 in a narrower mode. */
4248 /* Nonzero if this is a comparison operation;
4249 if both args are promoted shorts, compare the original shorts.
4250 Also implies COMMON. */
4251 int short_compare
= 0;
4253 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4256 /* True if both operands have arithmetic type. */
4257 bool arithmetic_types_p
;
4259 /* Apply default conversions. */
4263 /* Remember whether we're doing / or %. */
4264 bool doing_div_or_mod
= false;
4266 /* Remember whether we're doing << or >>. */
4267 bool doing_shift
= false;
4269 /* Tree holding instrumentation expression. */
4270 tree instrument_expr
= NULL_TREE
;
4272 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4273 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4274 || code
== TRUTH_XOR_EXPR
)
4276 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4277 op0
= decay_conversion (op0
, complain
);
4278 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4279 op1
= decay_conversion (op1
, complain
);
4283 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4284 op0
= cp_default_conversion (op0
, complain
);
4285 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4286 op1
= cp_default_conversion (op1
, complain
);
4289 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4290 STRIP_TYPE_NOPS (op0
);
4291 STRIP_TYPE_NOPS (op1
);
4293 /* DTRT if one side is an overloaded function, but complain about it. */
4294 if (type_unknown_p (op0
))
4296 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4297 if (t
!= error_mark_node
)
4299 if (complain
& tf_error
)
4300 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4305 if (type_unknown_p (op1
))
4307 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4308 if (t
!= error_mark_node
)
4310 if (complain
& tf_error
)
4311 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4317 type0
= TREE_TYPE (op0
);
4318 type1
= TREE_TYPE (op1
);
4320 /* The expression codes of the data types of the arguments tell us
4321 whether the arguments are integers, floating, pointers, etc. */
4322 code0
= TREE_CODE (type0
);
4323 code1
= TREE_CODE (type1
);
4325 /* If an error was already reported for one of the arguments,
4326 avoid reporting another error. */
4327 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4328 return error_mark_node
;
4330 if ((invalid_op_diag
4331 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4333 if (complain
& tf_error
)
4334 error (invalid_op_diag
);
4335 return error_mark_node
;
4338 /* Issue warnings about peculiar, but valid, uses of NULL. */
4339 if ((null_node_p (orig_op0
) || null_node_p (orig_op1
))
4340 /* It's reasonable to use pointer values as operands of &&
4341 and ||, so NULL is no exception. */
4342 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4343 && ( /* Both are NULL (or 0) and the operation was not a
4344 comparison or a pointer subtraction. */
4345 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4346 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4347 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4348 || (!null_ptr_cst_p (orig_op0
)
4349 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4350 || (!null_ptr_cst_p (orig_op1
)
4351 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4352 && (complain
& tf_warning
))
4354 source_location loc
=
4355 expansion_point_location_if_in_system_header (input_location
);
4357 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4360 /* In case when one of the operands of the binary operation is
4361 a vector and another is a scalar -- convert scalar to vector. */
4362 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4364 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4365 complain
& tf_error
);
4367 switch (convert_flag
)
4370 return error_mark_node
;
4373 op0
= convert (TREE_TYPE (type1
), op0
);
4374 op0
= save_expr (op0
);
4375 op0
= build_vector_from_val (type1
, op0
);
4376 type0
= TREE_TYPE (op0
);
4377 code0
= TREE_CODE (type0
);
4383 op1
= convert (TREE_TYPE (type0
), op1
);
4384 op1
= save_expr (op1
);
4385 op1
= build_vector_from_val (type0
, op1
);
4386 type1
= TREE_TYPE (op1
);
4387 code1
= TREE_CODE (type1
);
4399 /* Subtraction of two similar pointers.
4400 We must subtract them as integers, then divide by object size. */
4401 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4402 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4405 result
= pointer_diff (location
, op0
, op1
,
4406 common_pointer_type (type0
, type1
), complain
,
4408 if (instrument_expr
!= NULL
)
4409 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
4410 instrument_expr
, result
);
4414 /* In all other cases except pointer - int, the usual arithmetic
4416 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4421 /* The pointer - int case is just like pointer + int; fall
4425 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4426 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4430 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4431 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4432 if (processing_template_decl
)
4434 result_type
= TREE_TYPE (ptr_operand
);
4437 return cp_pointer_int_sum (location
, code
,
4449 case TRUNC_DIV_EXPR
:
4451 case FLOOR_DIV_EXPR
:
4452 case ROUND_DIV_EXPR
:
4453 case EXACT_DIV_EXPR
:
4454 if (TREE_CODE (op0
) == SIZEOF_EXPR
&& TREE_CODE (op1
) == SIZEOF_EXPR
)
4456 tree type0
= TREE_OPERAND (op0
, 0);
4457 tree type1
= TREE_OPERAND (op1
, 0);
4458 tree first_arg
= type0
;
4459 if (!TYPE_P (type0
))
4460 type0
= TREE_TYPE (type0
);
4461 if (!TYPE_P (type1
))
4462 type1
= TREE_TYPE (type1
);
4463 if (INDIRECT_TYPE_P (type0
) && same_type_p (TREE_TYPE (type0
), type1
)
4464 && !(TREE_CODE (first_arg
) == PARM_DECL
4465 && DECL_ARRAY_PARAMETER_P (first_arg
)
4466 && warn_sizeof_array_argument
)
4467 && (complain
& tf_warning
))
4468 if (warning_at (location
, OPT_Wsizeof_pointer_div
,
4469 "division %<sizeof (%T) / sizeof (%T)%> does "
4470 "not compute the number of array elements",
4472 if (DECL_P (first_arg
))
4473 inform (DECL_SOURCE_LOCATION (first_arg
),
4474 "first %<sizeof%> operand was declared here");
4477 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4478 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4479 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4480 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4482 enum tree_code tcode0
= code0
, tcode1
= code1
;
4483 tree cop1
= fold_non_dependent_expr (op1
, complain
);
4484 doing_div_or_mod
= true;
4485 warn_for_div_by_zero (location
, cop1
);
4487 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4488 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4489 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4490 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4492 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4493 resultcode
= RDIV_EXPR
;
4495 /* When dividing two signed integers, we have to promote to int.
4496 unless we divide by a constant != -1. Note that default
4497 conversion will have been performed on the operands at this
4498 point, so we have to dig out the original type to find out if
4500 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4501 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4502 || (TREE_CODE (op1
) == INTEGER_CST
4503 && ! integer_all_onesp (op1
)));
4512 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4513 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4514 && !VECTOR_FLOAT_TYPE_P (type0
)
4515 && !VECTOR_FLOAT_TYPE_P (type1
)))
4519 case TRUNC_MOD_EXPR
:
4520 case FLOOR_MOD_EXPR
:
4522 tree cop1
= fold_non_dependent_expr (op1
, complain
);
4523 doing_div_or_mod
= true;
4524 warn_for_div_by_zero (location
, cop1
);
4527 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4528 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4529 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4531 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4533 /* Although it would be tempting to shorten always here, that loses
4534 on some targets, since the modulo instruction is undefined if the
4535 quotient can't be represented in the computation mode. We shorten
4536 only if unsigned or if dividing by something we know != -1. */
4537 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4538 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4539 || (TREE_CODE (op1
) == INTEGER_CST
4540 && ! integer_all_onesp (op1
)));
4545 case TRUTH_ANDIF_EXPR
:
4546 case TRUTH_ORIF_EXPR
:
4547 case TRUTH_AND_EXPR
:
4549 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4551 if (!COMPARISON_CLASS_P (op1
))
4552 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4553 build_zero_cst (type1
), complain
);
4554 if (code
== TRUTH_ANDIF_EXPR
)
4556 tree z
= build_zero_cst (TREE_TYPE (op1
));
4557 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4559 else if (code
== TRUTH_ORIF_EXPR
)
4561 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4562 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4567 if (VECTOR_TYPE_P (type0
))
4569 if (!COMPARISON_CLASS_P (op0
))
4570 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4571 build_zero_cst (type0
), complain
);
4572 if (!VECTOR_TYPE_P (type1
))
4574 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4575 tree z
= build_zero_cst (TREE_TYPE (op0
));
4576 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4578 else if (!COMPARISON_CLASS_P (op1
))
4579 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4580 build_zero_cst (type1
), complain
);
4582 if (code
== TRUTH_ANDIF_EXPR
)
4583 code
= BIT_AND_EXPR
;
4584 else if (code
== TRUTH_ORIF_EXPR
)
4585 code
= BIT_IOR_EXPR
;
4589 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4592 result_type
= boolean_type_node
;
4595 /* Shift operations: result has same type as first operand;
4596 always convert second operand to int.
4597 Also set SHORT_SHIFT if shifting rightward. */
4600 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4601 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4603 result_type
= type0
;
4606 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4607 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4608 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4609 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
4610 TYPE_VECTOR_SUBPARTS (type1
)))
4612 result_type
= type0
;
4615 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4617 tree const_op1
= fold_non_dependent_expr (op1
, complain
);
4618 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4620 result_type
= type0
;
4622 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4624 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4626 if ((complain
& tf_warning
)
4627 && c_inhibit_evaluation_warnings
== 0)
4628 warning (OPT_Wshift_count_negative
,
4629 "right shift count is negative");
4633 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4634 && (complain
& tf_warning
)
4635 && c_inhibit_evaluation_warnings
== 0)
4636 warning (OPT_Wshift_count_overflow
,
4637 "right shift count >= width of type");
4640 /* Avoid converting op1 to result_type later. */
4646 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4647 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4649 result_type
= type0
;
4652 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4653 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4654 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4655 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
4656 TYPE_VECTOR_SUBPARTS (type1
)))
4658 result_type
= type0
;
4661 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4663 tree const_op0
= fold_non_dependent_expr (op0
, complain
);
4664 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4666 tree const_op1
= fold_non_dependent_expr (op1
, complain
);
4667 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4669 result_type
= type0
;
4671 if (TREE_CODE (const_op0
) == INTEGER_CST
4672 && tree_int_cst_sgn (const_op0
) < 0
4673 && (complain
& tf_warning
)
4674 && c_inhibit_evaluation_warnings
== 0)
4675 warning (OPT_Wshift_negative_value
,
4676 "left shift of negative value");
4677 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4679 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4681 if ((complain
& tf_warning
)
4682 && c_inhibit_evaluation_warnings
== 0)
4683 warning (OPT_Wshift_count_negative
,
4684 "left shift count is negative");
4686 else if (compare_tree_int (const_op1
,
4687 TYPE_PRECISION (type0
)) >= 0)
4689 if ((complain
& tf_warning
)
4690 && c_inhibit_evaluation_warnings
== 0)
4691 warning (OPT_Wshift_count_overflow
,
4692 "left shift count >= width of type");
4694 else if (TREE_CODE (const_op0
) == INTEGER_CST
4695 && (complain
& tf_warning
))
4696 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4698 /* Avoid converting op1 to result_type later. */
4705 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4707 result_type
= type0
;
4708 if (TREE_CODE (op1
) == INTEGER_CST
)
4710 if (tree_int_cst_lt (op1
, integer_zero_node
))
4712 if (complain
& tf_warning
)
4713 warning (0, (code
== LROTATE_EXPR
)
4714 ? G_("left rotate count is negative")
4715 : G_("right rotate count is negative"));
4717 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4719 if (complain
& tf_warning
)
4720 warning (0, (code
== LROTATE_EXPR
)
4721 ? G_("left rotate count >= width of type")
4722 : G_("right rotate count >= width of type"));
4725 /* Convert the shift-count to an integer, regardless of
4726 size of value being shifted. */
4727 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4728 op1
= cp_convert (integer_type_node
, op1
, complain
);
4734 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4735 goto vector_compare
;
4736 if ((complain
& tf_warning
)
4737 && c_inhibit_evaluation_warnings
== 0
4738 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4739 warning (OPT_Wfloat_equal
,
4740 "comparing floating point with == or != is unsafe");
4741 if ((complain
& tf_warning
)
4742 && ((TREE_CODE (orig_op0
) == STRING_CST
4743 && !integer_zerop (cp_fully_fold (op1
)))
4744 || (TREE_CODE (orig_op1
) == STRING_CST
4745 && !integer_zerop (cp_fully_fold (op0
)))))
4746 warning (OPT_Waddress
, "comparison with string literal results "
4747 "in unspecified behavior");
4749 build_type
= boolean_type_node
;
4750 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4751 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4752 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4753 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4755 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4756 && null_ptr_cst_p (orig_op1
))
4757 /* Handle, eg, (void*)0 (c++/43906), and more. */
4758 || (code0
== POINTER_TYPE
4759 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4761 if (TYPE_PTR_P (type1
))
4762 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4763 CPO_COMPARISON
, complain
);
4765 result_type
= type0
;
4767 if (char_type_p (TREE_TYPE (orig_op1
))
4768 && warning (OPT_Wpointer_compare
,
4769 "comparison between pointer and zero character "
4771 inform (input_location
,
4772 "did you mean to dereference the pointer?");
4773 warn_for_null_address (location
, op0
, complain
);
4775 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4776 && null_ptr_cst_p (orig_op0
))
4777 /* Handle, eg, (void*)0 (c++/43906), and more. */
4778 || (code1
== POINTER_TYPE
4779 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4781 if (TYPE_PTR_P (type0
))
4782 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4783 CPO_COMPARISON
, complain
);
4785 result_type
= type1
;
4787 if (char_type_p (TREE_TYPE (orig_op0
))
4788 && warning (OPT_Wpointer_compare
,
4789 "comparison between pointer and zero character "
4791 inform (input_location
,
4792 "did you mean to dereference the pointer?");
4793 warn_for_null_address (location
, op1
, complain
);
4795 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4796 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4797 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4798 CPO_COMPARISON
, complain
);
4799 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
4800 /* One of the operands must be of nullptr_t type. */
4801 result_type
= TREE_TYPE (nullptr_node
);
4802 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4804 result_type
= type0
;
4805 if (complain
& tf_error
)
4806 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4808 return error_mark_node
;
4810 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4812 result_type
= type1
;
4813 if (complain
& tf_error
)
4814 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4816 return error_mark_node
;
4818 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (orig_op1
))
4820 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4821 == ptrmemfunc_vbit_in_delta
)
4823 tree pfn0
, delta0
, e1
, e2
;
4825 if (TREE_SIDE_EFFECTS (op0
))
4826 op0
= save_expr (op0
);
4828 pfn0
= pfn_from_ptrmemfunc (op0
);
4829 delta0
= delta_from_ptrmemfunc (op0
);
4830 e1
= cp_build_binary_op (location
,
4833 build_zero_cst (TREE_TYPE (pfn0
)),
4835 e2
= cp_build_binary_op (location
,
4841 if (complain
& tf_warning
)
4842 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4844 e2
= cp_build_binary_op (location
,
4845 EQ_EXPR
, e2
, integer_zero_node
,
4847 op0
= cp_build_binary_op (location
,
4848 TRUTH_ANDIF_EXPR
, e1
, e2
,
4850 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4854 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4855 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4857 result_type
= TREE_TYPE (op0
);
4859 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (orig_op0
))
4860 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4861 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4864 /* E will be the final comparison. */
4866 /* E1 and E2 are for scratch. */
4874 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4875 CPO_COMPARISON
, complain
);
4877 if (!same_type_p (TREE_TYPE (op0
), type
))
4878 op0
= cp_convert_and_check (type
, op0
, complain
);
4879 if (!same_type_p (TREE_TYPE (op1
), type
))
4880 op1
= cp_convert_and_check (type
, op1
, complain
);
4882 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4883 return error_mark_node
;
4885 if (TREE_SIDE_EFFECTS (op0
))
4886 op0
= save_expr (op0
);
4887 if (TREE_SIDE_EFFECTS (op1
))
4888 op1
= save_expr (op1
);
4890 pfn0
= pfn_from_ptrmemfunc (op0
);
4891 pfn0
= cp_fully_fold (pfn0
);
4892 /* Avoid -Waddress warnings (c++/64877). */
4893 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4894 TREE_NO_WARNING (pfn0
) = 1;
4895 pfn1
= pfn_from_ptrmemfunc (op1
);
4896 pfn1
= cp_fully_fold (pfn1
);
4897 delta0
= delta_from_ptrmemfunc (op0
);
4898 delta1
= delta_from_ptrmemfunc (op1
);
4899 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4900 == ptrmemfunc_vbit_in_delta
)
4905 && ((op0.delta == op1.delta)
4906 || (!op0.pfn && op0.delta & 1 == 0
4907 && op1.delta & 1 == 0))
4909 The reason for the `!op0.pfn' bit is that a NULL
4910 pointer-to-member is any member with a zero PFN and
4911 LSB of the DELTA field is 0. */
4913 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4917 e1
= cp_build_binary_op (location
,
4918 EQ_EXPR
, e1
, integer_zero_node
,
4920 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4924 e2
= cp_build_binary_op (location
,
4925 EQ_EXPR
, e2
, integer_zero_node
,
4927 e1
= cp_build_binary_op (location
,
4928 TRUTH_ANDIF_EXPR
, e2
, e1
,
4930 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4932 build_zero_cst (TREE_TYPE (pfn0
)),
4934 e2
= cp_build_binary_op (location
,
4935 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4936 e1
= cp_build_binary_op (location
,
4937 EQ_EXPR
, delta0
, delta1
, complain
);
4938 e1
= cp_build_binary_op (location
,
4939 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4946 && (!op0.pfn || op0.delta == op1.delta))
4948 The reason for the `!op0.pfn' bit is that a NULL
4949 pointer-to-member is any member with a zero PFN; the
4950 DELTA field is unspecified. */
4952 e1
= cp_build_binary_op (location
,
4953 EQ_EXPR
, delta0
, delta1
, complain
);
4954 e2
= cp_build_binary_op (location
,
4957 build_zero_cst (TREE_TYPE (pfn0
)),
4959 e1
= cp_build_binary_op (location
,
4960 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4962 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4963 e
= cp_build_binary_op (location
,
4964 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4965 if (code
== EQ_EXPR
)
4967 return cp_build_binary_op (location
,
4968 EQ_EXPR
, e
, integer_zero_node
, complain
);
4972 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4973 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4975 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4976 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4984 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4985 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4987 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4988 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4989 CPO_COMPARISON
, complain
);
4996 if (TREE_CODE (orig_op0
) == STRING_CST
4997 || TREE_CODE (orig_op1
) == STRING_CST
)
4999 if (complain
& tf_warning
)
5000 warning (OPT_Waddress
, "comparison with string literal results "
5001 "in unspecified behavior");
5004 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
5008 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
5010 && !vector_types_compatible_elements_p (type0
, type1
))
5012 if (complain
& tf_error
)
5014 error_at (location
, "comparing vectors with different "
5016 inform (location
, "operand types are %qT and %qT",
5019 return error_mark_node
;
5022 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type0
),
5023 TYPE_VECTOR_SUBPARTS (type1
)))
5025 if (complain
& tf_error
)
5027 error_at (location
, "comparing vectors with different "
5028 "number of elements");
5029 inform (location
, "operand types are %qT and %qT",
5032 return error_mark_node
;
5035 /* It's not precisely specified how the usual arithmetic
5036 conversions apply to the vector types. Here, we use
5037 the unsigned type if one of the operands is signed and
5038 the other one is unsigned. */
5039 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
5041 if (!TYPE_UNSIGNED (type0
))
5042 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
5044 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
5045 warning_at (location
, OPT_Wsign_compare
, "comparison between "
5046 "types %qT and %qT", type0
, type1
);
5049 /* Always construct signed integer vector type. */
5050 intt
= c_common_type_for_size
5051 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (type0
))), 0);
5054 if (complain
& tf_error
)
5055 error_at (location
, "could not find an integer type "
5056 "of the same size as %qT", TREE_TYPE (type0
));
5057 return error_mark_node
;
5059 result_type
= build_opaque_vector_type (intt
,
5060 TYPE_VECTOR_SUBPARTS (type0
));
5062 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
5064 build_type
= boolean_type_node
;
5065 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
5066 || code0
== ENUMERAL_TYPE
)
5067 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5068 || code1
== ENUMERAL_TYPE
))
5070 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
5071 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
5072 CPO_COMPARISON
, complain
);
5073 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (orig_op1
))
5075 result_type
= type0
;
5076 if (extra_warnings
&& (complain
& tf_warning
))
5077 warning (OPT_Wextra
,
5078 "ordered comparison of pointer with integer zero");
5080 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (orig_op0
))
5082 result_type
= type1
;
5083 if (extra_warnings
&& (complain
& tf_warning
))
5084 warning (OPT_Wextra
,
5085 "ordered comparison of pointer with integer zero");
5087 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
5088 /* One of the operands must be of nullptr_t type. */
5089 result_type
= TREE_TYPE (nullptr_node
);
5090 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5092 result_type
= type0
;
5093 if (complain
& tf_error
)
5094 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5096 return error_mark_node
;
5098 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
5100 result_type
= type1
;
5101 if (complain
& tf_error
)
5102 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5104 return error_mark_node
;
5107 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
5108 && sanitize_flags_p (SANITIZE_POINTER_COMPARE
))
5110 op0
= save_expr (op0
);
5111 op1
= save_expr (op1
);
5113 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_COMPARE
);
5114 instrument_expr
= build_call_expr_loc (location
, tt
, 2, op0
, op1
);
5119 case UNORDERED_EXPR
:
5126 build_type
= integer_type_node
;
5127 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
5129 if (complain
& tf_error
)
5130 error ("unordered comparison on non-floating point argument");
5131 return error_mark_node
;
5140 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
5141 || code0
== ENUMERAL_TYPE
)
5142 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5143 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
5144 arithmetic_types_p
= 1;
5147 arithmetic_types_p
= 0;
5148 /* Vector arithmetic is only allowed when both sides are vectors. */
5149 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
5151 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
5152 || !vector_types_compatible_elements_p (type0
, type1
))
5154 if (complain
& tf_error
)
5156 /* "location" already embeds the locations of the
5157 operands, so we don't need to add them separately
5159 rich_location
richloc (line_table
, location
);
5160 binary_op_error (&richloc
, code
, type0
, type1
);
5162 return error_mark_node
;
5164 arithmetic_types_p
= 1;
5167 /* Determine the RESULT_TYPE, if it is not already known. */
5169 && arithmetic_types_p
5170 && (shorten
|| common
|| short_compare
))
5172 result_type
= cp_common_type (type0
, type1
);
5173 if (complain
& tf_warning
)
5174 do_warn_double_promotion (result_type
, type0
, type1
,
5175 "implicit conversion from %qH to %qI "
5176 "to match other operand of binary "
5183 if (complain
& tf_error
)
5185 "invalid operands of types %qT and %qT to binary %qO",
5186 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
5187 return error_mark_node
;
5190 /* If we're in a template, the only thing we need to know is the
5192 if (processing_template_decl
)
5194 /* Since the middle-end checks the type when doing a build2, we
5195 need to build the tree in pieces. This built tree will never
5196 get out of the front-end as we replace it when instantiating
5198 tree tmp
= build2 (resultcode
,
5199 build_type
? build_type
: result_type
,
5201 TREE_OPERAND (tmp
, 0) = op0
;
5205 /* Remember the original type; RESULT_TYPE might be changed later on
5206 by shorten_binary_op. */
5207 tree orig_type
= result_type
;
5209 if (arithmetic_types_p
)
5211 bool first_complex
= (code0
== COMPLEX_TYPE
);
5212 bool second_complex
= (code1
== COMPLEX_TYPE
);
5213 int none_complex
= (!first_complex
&& !second_complex
);
5215 /* Adapted from patch for c/24581. */
5216 if (first_complex
!= second_complex
5217 && (code
== PLUS_EXPR
5218 || code
== MINUS_EXPR
5219 || code
== MULT_EXPR
5220 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5221 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5222 && flag_signed_zeros
)
5224 /* An operation on mixed real/complex operands must be
5225 handled specially, but the language-independent code can
5226 more easily optimize the plain complex arithmetic if
5227 -fno-signed-zeros. */
5228 tree real_type
= TREE_TYPE (result_type
);
5232 if (TREE_TYPE (op0
) != result_type
)
5233 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5234 if (TREE_TYPE (op1
) != real_type
)
5235 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5239 if (TREE_TYPE (op0
) != real_type
)
5240 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5241 if (TREE_TYPE (op1
) != result_type
)
5242 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5244 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5245 return error_mark_node
;
5248 op0
= save_expr (op0
);
5249 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
5250 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
5254 case TRUNC_DIV_EXPR
:
5255 op1
= save_expr (op1
);
5256 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5260 real
= build2 (resultcode
, real_type
, real
, op1
);
5268 op1
= save_expr (op1
);
5269 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
5270 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
5274 op0
= save_expr (op0
);
5275 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5278 real
= build2 (resultcode
, real_type
, op0
, real
);
5281 real
= build2 (resultcode
, real_type
, op0
, real
);
5282 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5288 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5292 /* For certain operations (which identify themselves by shorten != 0)
5293 if both args were extended from the same smaller type,
5294 do the arithmetic in that type and then extend.
5296 shorten !=0 and !=1 indicates a bitwise operation.
5297 For them, this optimization is safe only if
5298 both args are zero-extended or both are sign-extended.
5299 Otherwise, we might change the result.
5300 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5301 but calculated in (unsigned short) it would be (unsigned short)-1. */
5303 if (shorten
&& none_complex
)
5305 final_type
= result_type
;
5306 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5310 /* Comparison operations are shortened too but differently.
5311 They identify themselves by setting short_compare = 1. */
5315 /* We call shorten_compare only for diagnostic-reason. */
5316 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5317 xresult_type
= result_type
;
5318 enum tree_code xresultcode
= resultcode
;
5319 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5323 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5324 && warn_sign_compare
5325 /* Do not warn until the template is instantiated; we cannot
5326 bound the ranges of the arguments until that point. */
5327 && !processing_template_decl
5328 && (complain
& tf_warning
)
5329 && c_inhibit_evaluation_warnings
== 0
5330 /* Even unsigned enum types promote to signed int. We don't
5331 want to issue -Wsign-compare warnings for this case. */
5332 && !enum_cast_to_int (orig_op0
)
5333 && !enum_cast_to_int (orig_op1
))
5335 tree oop0
= maybe_constant_value (orig_op0
);
5336 tree oop1
= maybe_constant_value (orig_op1
);
5338 if (TREE_CODE (oop0
) != INTEGER_CST
)
5339 oop0
= cp_fully_fold (orig_op0
);
5340 if (TREE_CODE (oop1
) != INTEGER_CST
)
5341 oop1
= cp_fully_fold (orig_op1
);
5342 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5343 result_type
, resultcode
);
5347 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5348 Then the expression will be built.
5349 It will be given type FINAL_TYPE if that is nonzero;
5350 otherwise, it will be given type RESULT_TYPE. */
5353 if (TREE_TYPE (op0
) != result_type
)
5354 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5355 if (TREE_TYPE (op1
) != result_type
)
5356 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5358 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5359 return error_mark_node
;
5362 if (build_type
== NULL_TREE
)
5363 build_type
= result_type
;
5365 if (sanitize_flags_p ((SANITIZE_SHIFT
5366 | SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5367 && current_function_decl
!= NULL_TREE
5368 && !processing_template_decl
5369 && (doing_div_or_mod
|| doing_shift
))
5371 /* OP0 and/or OP1 might have side-effects. */
5372 op0
= cp_save_expr (op0
);
5373 op1
= cp_save_expr (op1
);
5374 op0
= fold_non_dependent_expr (op0
, complain
);
5375 op1
= fold_non_dependent_expr (op1
, complain
);
5376 if (doing_div_or_mod
5377 && sanitize_flags_p (SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5379 /* For diagnostics we want to use the promoted types without
5380 shorten_binary_op. So convert the arguments to the
5381 original result_type. */
5384 if (TREE_TYPE (cop0
) != orig_type
)
5385 cop0
= cp_convert (orig_type
, op0
, complain
);
5386 if (TREE_TYPE (cop1
) != orig_type
)
5387 cop1
= cp_convert (orig_type
, op1
, complain
);
5388 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5390 else if (doing_shift
&& sanitize_flags_p (SANITIZE_SHIFT
))
5391 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5394 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5395 if (final_type
!= 0)
5396 result
= cp_convert (final_type
, result
, complain
);
5398 if (instrument_expr
!= NULL
)
5399 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5400 instrument_expr
, result
);
5402 if (!processing_template_decl
)
5404 op0
= cp_fully_fold (op0
);
5405 /* Only consider the second argument if the first isn't overflowed. */
5406 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5408 op1
= cp_fully_fold (op1
);
5409 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5412 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5413 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5416 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5417 if (TREE_OVERFLOW_P (result_ovl
))
5418 overflow_warning (location
, result_ovl
);
5423 /* Build a VEC_PERM_EXPR.
5424 This is a simple wrapper for c_build_vec_perm_expr. */
5426 build_x_vec_perm_expr (location_t loc
,
5427 tree arg0
, tree arg1
, tree arg2
,
5428 tsubst_flags_t complain
)
5430 tree orig_arg0
= arg0
;
5431 tree orig_arg1
= arg1
;
5432 tree orig_arg2
= arg2
;
5433 if (processing_template_decl
)
5435 if (type_dependent_expression_p (arg0
)
5436 || type_dependent_expression_p (arg1
)
5437 || type_dependent_expression_p (arg2
))
5438 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5439 arg0
= build_non_dependent_expr (arg0
);
5441 arg1
= build_non_dependent_expr (arg1
);
5442 arg2
= build_non_dependent_expr (arg2
);
5444 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5445 if (processing_template_decl
&& exp
!= error_mark_node
)
5446 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5447 orig_arg1
, orig_arg2
);
5451 /* Return a tree for the sum or difference (RESULTCODE says which)
5452 of pointer PTROP and integer INTOP. */
5455 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5456 tree intop
, tsubst_flags_t complain
)
5458 tree res_type
= TREE_TYPE (ptrop
);
5460 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5461 in certain circumstance (when it's valid to do so). So we need
5462 to make sure it's complete. We don't need to check here, if we
5463 can actually complete it at all, as those checks will be done in
5464 pointer_int_sum() anyway. */
5465 complete_type (TREE_TYPE (res_type
));
5467 return pointer_int_sum (loc
, resultcode
, ptrop
,
5468 intop
, complain
& tf_warning_or_error
);
5471 /* Return a tree for the difference of pointers OP0 and OP1.
5472 The resulting tree has type int. If POINTER_SUBTRACT sanitization is
5473 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
5476 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5477 tsubst_flags_t complain
, tree
*instrument_expr
)
5479 tree result
, inttype
;
5480 tree restype
= ptrdiff_type_node
;
5481 tree target_type
= TREE_TYPE (ptrtype
);
5483 if (!complete_type_or_else (target_type
, NULL_TREE
))
5484 return error_mark_node
;
5486 if (VOID_TYPE_P (target_type
))
5488 if (complain
& tf_error
)
5489 permerror (loc
, "ISO C++ forbids using pointer of "
5490 "type %<void *%> in subtraction");
5492 return error_mark_node
;
5494 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5496 if (complain
& tf_error
)
5497 permerror (loc
, "ISO C++ forbids using pointer to "
5498 "a function in subtraction");
5500 return error_mark_node
;
5502 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5504 if (complain
& tf_error
)
5505 permerror (loc
, "ISO C++ forbids using pointer to "
5506 "a method in subtraction");
5508 return error_mark_node
;
5511 /* Determine integer type result of the subtraction. This will usually
5512 be the same as the result type (ptrdiff_t), but may need to be a wider
5513 type if pointers for the address space are wider than ptrdiff_t. */
5514 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
5515 inttype
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
5519 if (sanitize_flags_p (SANITIZE_POINTER_SUBTRACT
))
5521 op0
= save_expr (op0
);
5522 op1
= save_expr (op1
);
5524 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_SUBTRACT
);
5525 *instrument_expr
= build_call_expr_loc (loc
, tt
, 2, op0
, op1
);
5528 /* First do the subtraction, then build the divide operator
5529 and only convert at the very end.
5530 Do not do default conversions in case restype is a short type. */
5532 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
5533 pointers. If some platform cannot provide that, or has a larger
5534 ptrdiff_type to support differences larger than half the address
5535 space, cast the pointers to some larger integer type and do the
5536 computations in that type. */
5537 if (TYPE_PRECISION (inttype
) > TYPE_PRECISION (TREE_TYPE (op0
)))
5538 op0
= cp_build_binary_op (loc
,
5540 cp_convert (inttype
, op0
, complain
),
5541 cp_convert (inttype
, op1
, complain
),
5544 op0
= build2_loc (loc
, POINTER_DIFF_EXPR
, inttype
, op0
, op1
);
5546 /* This generates an error if op1 is a pointer to an incomplete type. */
5547 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5549 if (complain
& tf_error
)
5550 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5551 "pointer arithmetic");
5553 return error_mark_node
;
5556 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5558 if (complain
& tf_error
)
5559 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5561 return error_mark_node
;
5564 op1
= (TYPE_PTROB_P (ptrtype
)
5565 ? size_in_bytes_loc (loc
, target_type
)
5566 : integer_one_node
);
5568 /* Do the division. */
5570 result
= build2_loc (loc
, EXACT_DIV_EXPR
, inttype
, op0
,
5571 cp_convert (inttype
, op1
, complain
));
5572 return cp_convert (restype
, result
, complain
);
5575 /* Construct and perhaps optimize a tree representation
5576 for a unary operation. CODE, a tree_code, specifies the operation
5577 and XARG is the operand. */
5580 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5581 tsubst_flags_t complain
)
5583 tree orig_expr
= xarg
;
5586 tree overload
= NULL_TREE
;
5588 if (processing_template_decl
)
5590 if (type_dependent_expression_p (xarg
))
5591 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5593 xarg
= build_non_dependent_expr (xarg
);
5598 /* [expr.unary.op] says:
5600 The address of an object of incomplete type can be taken.
5602 (And is just the ordinary address operator, not an overloaded
5603 "operator &".) However, if the type is a template
5604 specialization, we must complete the type at this point so that
5605 an overloaded "operator &" will be available if required. */
5606 if (code
== ADDR_EXPR
5607 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5608 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5609 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5610 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5611 /* Don't look for a function. */;
5613 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5614 NULL_TREE
, &overload
, complain
);
5616 if (!exp
&& code
== ADDR_EXPR
)
5618 if (is_overloaded_fn (xarg
))
5620 tree fn
= get_first_fn (xarg
);
5621 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5623 if (complain
& tf_error
)
5624 error (DECL_CONSTRUCTOR_P (fn
)
5625 ? G_("taking address of constructor %qD")
5626 : G_("taking address of destructor %qD"),
5628 return error_mark_node
;
5632 /* A pointer to member-function can be formed only by saying
5634 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5635 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5637 if (TREE_CODE (xarg
) != OFFSET_REF
5638 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5640 if (complain
& tf_error
)
5642 error ("invalid use of %qE to form a "
5643 "pointer-to-member-function", xarg
.get_value ());
5644 if (TREE_CODE (xarg
) != OFFSET_REF
)
5645 inform (input_location
, " a qualified-id is required");
5647 return error_mark_node
;
5651 if (complain
& tf_error
)
5652 error ("parentheses around %qE cannot be used to form a"
5653 " pointer-to-member-function",
5656 return error_mark_node
;
5657 PTRMEM_OK_P (xarg
) = 1;
5661 if (TREE_CODE (xarg
) == OFFSET_REF
)
5663 ptrmem
= PTRMEM_OK_P (xarg
);
5665 if (!ptrmem
&& !flag_ms_extensions
5666 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5668 /* A single non-static member, make sure we don't allow a
5669 pointer-to-member. */
5670 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5671 TREE_OPERAND (xarg
, 0),
5672 ovl_make (TREE_OPERAND (xarg
, 1)));
5673 PTRMEM_OK_P (xarg
) = ptrmem
;
5677 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5680 if (processing_template_decl
&& exp
!= error_mark_node
)
5682 if (overload
!= NULL_TREE
)
5683 return (build_min_non_dep_op_overload
5684 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5686 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5687 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5689 if (TREE_CODE (exp
) == ADDR_EXPR
)
5690 PTRMEM_OK_P (exp
) = ptrmem
;
5694 /* Construct and perhaps optimize a tree representation
5695 for __builtin_addressof operation. ARG specifies the operand. */
5698 cp_build_addressof (location_t loc
, tree arg
, tsubst_flags_t complain
)
5700 tree orig_expr
= arg
;
5702 if (processing_template_decl
)
5704 if (type_dependent_expression_p (arg
))
5705 return build_min_nt_loc (loc
, ADDRESSOF_EXPR
, arg
, NULL_TREE
);
5707 arg
= build_non_dependent_expr (arg
);
5710 tree exp
= cp_build_addr_expr_strict (arg
, complain
);
5712 if (processing_template_decl
&& exp
!= error_mark_node
)
5713 exp
= build_min_non_dep (ADDRESSOF_EXPR
, exp
, orig_expr
, NULL_TREE
);
5717 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5718 constants, where a null value is represented by an INTEGER_CST of
5722 cp_truthvalue_conversion (tree expr
)
5724 tree type
= TREE_TYPE (expr
);
5725 if (TYPE_PTR_OR_PTRMEM_P (type
)
5726 /* Avoid ICE on invalid use of non-static member function. */
5727 || TREE_CODE (expr
) == FUNCTION_DECL
)
5728 return build_binary_op (input_location
, NE_EXPR
, expr
, nullptr_node
, true);
5730 return c_common_truthvalue_conversion (input_location
, expr
);
5733 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5736 condition_conversion (tree expr
)
5739 /* Anything that might happen in a template should go through
5740 maybe_convert_cond. */
5741 gcc_assert (!processing_template_decl
);
5742 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5743 tf_warning_or_error
, LOOKUP_NORMAL
);
5744 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5748 /* Returns the address of T. This function will fold away
5749 ADDR_EXPR of INDIRECT_REF. */
5752 build_address (tree t
)
5754 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5755 return error_mark_node
;
5756 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
5757 || processing_template_decl
);
5758 t
= build_fold_addr_expr_loc (EXPR_LOCATION (t
), t
);
5759 if (TREE_CODE (t
) != ADDR_EXPR
)
5764 /* Return a NOP_EXPR converting EXPR to TYPE. */
5767 build_nop (tree type
, tree expr
)
5769 if (type
== error_mark_node
|| error_operand_p (expr
))
5771 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5774 /* Take the address of ARG, whatever that means under C++ semantics.
5775 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5776 and class rvalues as well.
5778 Nothing should call this function directly; instead, callers should use
5779 cp_build_addr_expr or cp_build_addr_expr_strict. */
5782 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5787 if (!arg
|| error_operand_p (arg
))
5788 return error_mark_node
;
5790 arg
= mark_lvalue_use (arg
);
5791 if (error_operand_p (arg
))
5792 return error_mark_node
;
5794 argtype
= lvalue_type (arg
);
5796 gcc_assert (!(identifier_p (arg
) && IDENTIFIER_ANY_OP_P (arg
)));
5798 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5799 && !really_overloaded_fn (arg
))
5801 /* They're trying to take the address of a unique non-static
5802 member function. This is ill-formed (except in MS-land),
5803 but let's try to DTRT.
5804 Note: We only handle unique functions here because we don't
5805 want to complain if there's a static overload; non-unique
5806 cases will be handled by instantiate_type. But we need to
5807 handle this case here to allow casts on the resulting PMF.
5808 We could defer this in non-MS mode, but it's easier to give
5809 a useful error here. */
5811 /* Inside constant member functions, the `this' pointer
5812 contains an extra const qualifier. TYPE_MAIN_VARIANT
5813 is used here to remove this const from the diagnostics
5814 and the created OFFSET_REF. */
5815 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5816 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5817 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5818 return error_mark_node
;
5820 if (! flag_ms_extensions
)
5822 tree name
= DECL_NAME (fn
);
5823 if (!(complain
& tf_error
))
5824 return error_mark_node
;
5825 else if (current_class_type
5826 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5827 /* An expression like &memfn. */
5828 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5829 " or parenthesized non-static member function to form"
5830 " a pointer to member function. Say %<&%T::%D%>",
5833 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5834 " function to form a pointer to member function."
5838 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5841 /* Uninstantiated types are all functions. Taking the
5842 address of a function is a no-op, so just return the
5844 if (type_unknown_p (arg
))
5845 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5847 if (TREE_CODE (arg
) == OFFSET_REF
)
5848 /* We want a pointer to member; bypass all the code for actually taking
5849 the address of something. */
5852 /* Anything not already handled and not a true memory reference
5854 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5855 && TREE_CODE (argtype
) != METHOD_TYPE
)
5857 cp_lvalue_kind kind
= lvalue_kind (arg
);
5858 if (kind
== clk_none
)
5860 if (complain
& tf_error
)
5861 lvalue_error (input_location
, lv_addressof
);
5862 return error_mark_node
;
5864 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5866 if (!(complain
& tf_error
))
5867 return error_mark_node
;
5868 /* Make this a permerror because we used to accept it. */
5869 permerror (input_location
, "taking address of rvalue");
5873 if (TYPE_REF_P (argtype
))
5875 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5876 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5879 else if (pedantic
&& DECL_MAIN_P (arg
))
5882 /* Apparently a lot of autoconf scripts for C++ packages do this,
5883 so only complain if -Wpedantic. */
5884 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5885 pedwarn (input_location
, OPT_Wpedantic
,
5886 "ISO C++ forbids taking address of function %<::main%>");
5887 else if (flag_pedantic_errors
)
5888 return error_mark_node
;
5891 /* Let &* cancel out to simplify resulting code. */
5892 if (INDIRECT_REF_P (arg
))
5894 arg
= TREE_OPERAND (arg
, 0);
5895 if (TYPE_REF_P (TREE_TYPE (arg
)))
5897 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5898 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5901 /* Don't let this be an lvalue. */
5906 /* Handle complex lvalues (when permitted)
5907 by reduction to simpler cases. */
5908 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5912 switch (TREE_CODE (arg
))
5916 case FIX_TRUNC_EXPR
:
5917 /* We should have handled this above in the lvalue_kind check. */
5922 arg
= BASELINK_FUNCTIONS (arg
);
5926 arg
= OVL_FIRST (arg
);
5931 /* Turn a reference to a non-static data member into a
5932 pointer-to-member. */
5937 gcc_assert (PTRMEM_OK_P (arg
));
5939 t
= TREE_OPERAND (arg
, 1);
5940 if (TYPE_REF_P (TREE_TYPE (t
)))
5942 if (complain
& tf_error
)
5943 error ("cannot create pointer to reference member %qD", t
);
5944 return error_mark_node
;
5947 type
= build_ptrmem_type (context_for_name_lookup (t
),
5949 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5957 if (argtype
!= error_mark_node
)
5958 argtype
= build_pointer_type (argtype
);
5960 if (bitfield_p (arg
))
5962 if (complain
& tf_error
)
5963 error ("attempt to take address of bit-field");
5964 return error_mark_node
;
5967 /* In a template, we are processing a non-dependent expression
5968 so we can just form an ADDR_EXPR with the correct type. */
5969 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5971 if (TREE_CODE (arg
) == FUNCTION_DECL
5972 && !mark_used (arg
, complain
) && !(complain
& tf_error
))
5973 return error_mark_node
;
5974 val
= build_address (arg
);
5975 if (TREE_CODE (arg
) == OFFSET_REF
)
5976 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5978 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5980 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5982 /* We can only get here with a single static member
5984 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5985 && DECL_STATIC_FUNCTION_P (fn
));
5986 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5987 return error_mark_node
;
5988 val
= build_address (fn
);
5989 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5990 /* Do not lose object's side effects. */
5991 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5992 TREE_OPERAND (arg
, 0), val
);
5996 tree object
= TREE_OPERAND (arg
, 0);
5997 tree field
= TREE_OPERAND (arg
, 1);
5998 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5999 (TREE_TYPE (object
), decl_type_context (field
)));
6000 val
= build_address (arg
);
6003 if (TYPE_PTR_P (argtype
)
6004 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
6006 build_ptrmemfunc_type (argtype
);
6007 val
= build_ptrmemfunc (argtype
, val
, 0,
6015 /* Take the address of ARG if it has one, even if it's an rvalue. */
6018 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
6020 return cp_build_addr_expr_1 (arg
, 0, complain
);
6023 /* Take the address of ARG, but only if it's an lvalue. */
6026 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
6028 return cp_build_addr_expr_1 (arg
, 1, complain
);
6031 /* C++: Must handle pointers to members.
6033 Perhaps type instantiation should be extended to handle conversion
6034 from aggregates to types we don't yet know we want? (Or are those
6035 cases typically errors which should be reported?)
6037 NOCONVERT suppresses the default promotions (such as from short to int). */
6040 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
6041 tsubst_flags_t complain
)
6043 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
6045 location_t location
= cp_expr_loc_or_loc (arg
, input_location
);
6047 const char *errstring
= NULL
;
6049 const char *invalid_op_diag
;
6051 if (!arg
|| error_operand_p (arg
))
6052 return error_mark_node
;
6054 if ((invalid_op_diag
6055 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
6060 if (complain
& tf_error
)
6061 error (invalid_op_diag
);
6062 return error_mark_node
;
6067 case UNARY_PLUS_EXPR
:
6070 int flags
= WANT_ARITH
| WANT_ENUM
;
6071 /* Unary plus (but not unary minus) is allowed on pointers. */
6072 if (code
== UNARY_PLUS_EXPR
)
6073 flags
|= WANT_POINTER
;
6074 arg
= build_expr_type_conversion (flags
, arg
, true);
6076 errstring
= (code
== NEGATE_EXPR
6077 ? _("wrong type argument to unary minus")
6078 : _("wrong type argument to unary plus"));
6081 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6082 arg
= cp_perform_integral_promotions (arg
, complain
);
6084 /* Make sure the result is not an lvalue: a unary plus or minus
6085 expression is always a rvalue. */
6092 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6097 arg
= cp_default_conversion (arg
, complain
);
6098 if (arg
== error_mark_node
)
6099 return error_mark_node
;
6102 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
6103 | WANT_VECTOR_OR_COMPLEX
,
6105 errstring
= _("wrong type argument to bit-complement");
6106 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6108 /* Warn if the expression has boolean value. */
6109 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
6110 && (complain
& tf_warning
)
6111 && warning_at (location
, OPT_Wbool_operation
,
6112 "%<~%> on an expression of type bool"))
6113 inform (location
, "did you mean to use logical not (%<!%>)?");
6114 arg
= cp_perform_integral_promotions (arg
, complain
);
6116 else if (!noconvert
&& VECTOR_TYPE_P (TREE_TYPE (arg
)))
6117 arg
= mark_rvalue_use (arg
);
6121 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6122 errstring
= _("wrong type argument to abs");
6123 else if (!noconvert
)
6125 arg
= cp_default_conversion (arg
, complain
);
6126 if (arg
== error_mark_node
)
6127 return error_mark_node
;
6132 /* Conjugating a real value is a no-op, but allow it anyway. */
6133 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6134 errstring
= _("wrong type argument to conjugation");
6135 else if (!noconvert
)
6137 arg
= cp_default_conversion (arg
, complain
);
6138 if (arg
== error_mark_node
)
6139 return error_mark_node
;
6143 case TRUTH_NOT_EXPR
:
6144 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
6145 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
6146 build_zero_cst (TREE_TYPE (arg
)), complain
);
6147 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
6149 val
= invert_truthvalue_loc (input_location
, arg
);
6150 if (arg
!= error_mark_node
)
6152 errstring
= _("in argument to unary !");
6160 arg
= build_real_imag_expr (input_location
, code
, arg
);
6163 case PREINCREMENT_EXPR
:
6164 case POSTINCREMENT_EXPR
:
6165 case PREDECREMENT_EXPR
:
6166 case POSTDECREMENT_EXPR
:
6167 /* Handle complex lvalues (when permitted)
6168 by reduction to simpler cases. */
6170 val
= unary_complex_lvalue (code
, arg
);
6174 arg
= mark_lvalue_use (arg
);
6176 /* Increment or decrement the real part of the value,
6177 and don't change the imaginary part. */
6178 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6182 arg
= cp_stabilize_reference (arg
);
6183 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
6184 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
6185 real
= cp_build_unary_op (code
, real
, true, complain
);
6186 if (real
== error_mark_node
|| imag
== error_mark_node
)
6187 return error_mark_node
;
6188 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
6192 /* Report invalid types. */
6194 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
6197 if (code
== PREINCREMENT_EXPR
)
6198 errstring
= _("no pre-increment operator for type");
6199 else if (code
== POSTINCREMENT_EXPR
)
6200 errstring
= _("no post-increment operator for type");
6201 else if (code
== PREDECREMENT_EXPR
)
6202 errstring
= _("no pre-decrement operator for type");
6204 errstring
= _("no post-decrement operator for type");
6207 else if (arg
== error_mark_node
)
6208 return error_mark_node
;
6210 /* Report something read-only. */
6212 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
6213 || TREE_READONLY (arg
))
6215 if (complain
& tf_error
)
6216 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
6217 || code
== POSTINCREMENT_EXPR
)
6218 ? lv_increment
: lv_decrement
));
6220 return error_mark_node
;
6225 tree declared_type
= unlowered_expr_type (arg
);
6227 argtype
= TREE_TYPE (arg
);
6229 /* ARM $5.2.5 last annotation says this should be forbidden. */
6230 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
6232 if (complain
& tf_error
)
6233 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
6234 ? G_("ISO C++ forbids incrementing an enum")
6235 : G_("ISO C++ forbids decrementing an enum"));
6237 return error_mark_node
;
6240 /* Compute the increment. */
6242 if (TYPE_PTR_P (argtype
))
6244 tree type
= complete_type (TREE_TYPE (argtype
));
6246 if (!COMPLETE_OR_VOID_TYPE_P (type
))
6248 if (complain
& tf_error
)
6249 error (((code
== PREINCREMENT_EXPR
6250 || code
== POSTINCREMENT_EXPR
))
6251 ? G_("cannot increment a pointer to incomplete type %qT")
6252 : G_("cannot decrement a pointer to incomplete type %qT"),
6253 TREE_TYPE (argtype
));
6255 return error_mark_node
;
6257 else if (!TYPE_PTROB_P (argtype
))
6259 if (complain
& tf_error
)
6260 pedwarn (input_location
, OPT_Wpointer_arith
,
6261 (code
== PREINCREMENT_EXPR
6262 || code
== POSTINCREMENT_EXPR
)
6263 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6264 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6267 return error_mark_node
;
6270 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6273 inc
= VECTOR_TYPE_P (argtype
)
6274 ? build_one_cst (argtype
)
6277 inc
= cp_convert (argtype
, inc
, complain
);
6279 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6280 need to ask Objective-C to build the increment or decrement
6281 expression for it. */
6282 if (objc_is_property_ref (arg
))
6283 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6286 /* Complain about anything else that is not a true lvalue. */
6287 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6288 || code
== POSTINCREMENT_EXPR
)
6289 ? lv_increment
: lv_decrement
),
6291 return error_mark_node
;
6293 /* Forbid using -- or ++ in C++17 on `bool'. */
6294 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6296 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6298 if (complain
& tf_error
)
6299 error ("use of an operand of type %qT in %<operator--%> "
6300 "is forbidden", boolean_type_node
);
6301 return error_mark_node
;
6305 if (cxx_dialect
>= cxx17
)
6307 if (complain
& tf_error
)
6308 error ("use of an operand of type %qT in "
6309 "%<operator++%> is forbidden in C++17",
6311 return error_mark_node
;
6313 /* Otherwise, [depr.incr.bool] says this is deprecated. */
6314 else if (!in_system_header_at (input_location
))
6315 warning (OPT_Wdeprecated
, "use of an operand of type %qT "
6316 "in %<operator++%> is deprecated",
6319 val
= boolean_increment (code
, arg
);
6321 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6322 /* An rvalue has no cv-qualifiers. */
6323 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6325 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6327 TREE_SIDE_EFFECTS (val
) = 1;
6332 /* Note that this operation never does default_conversion
6333 regardless of NOCONVERT. */
6334 return cp_build_addr_expr (arg
, complain
);
6343 argtype
= TREE_TYPE (arg
);
6344 return build1 (code
, argtype
, arg
);
6347 if (complain
& tf_error
)
6348 error ("%s", errstring
);
6349 return error_mark_node
;
6352 /* Hook for the c-common bits that build a unary op. */
6354 build_unary_op (location_t
/*location*/,
6355 enum tree_code code
, tree xarg
, bool noconvert
)
6357 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6360 /* Adjust LVALUE, an MODIFY_EXPR, PREINCREMENT_EXPR or PREDECREMENT_EXPR,
6361 so that it is a valid lvalue even for GENERIC by replacing
6362 (lhs = rhs) with ((lhs = rhs), lhs)
6363 (--lhs) with ((--lhs), lhs)
6364 (++lhs) with ((++lhs), lhs)
6365 and if lhs has side-effects, calling cp_stabilize_reference on it, so
6366 that it can be evaluated multiple times. */
6369 genericize_compound_lvalue (tree lvalue
)
6371 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lvalue
, 0)))
6372 lvalue
= build2 (TREE_CODE (lvalue
), TREE_TYPE (lvalue
),
6373 cp_stabilize_reference (TREE_OPERAND (lvalue
, 0)),
6374 TREE_OPERAND (lvalue
, 1));
6375 return build2 (COMPOUND_EXPR
, TREE_TYPE (TREE_OPERAND (lvalue
, 0)),
6376 lvalue
, TREE_OPERAND (lvalue
, 0));
6379 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6380 for certain kinds of expressions which are not really lvalues
6381 but which we can accept as lvalues.
6383 If ARG is not a kind of expression we can handle, return
6387 unary_complex_lvalue (enum tree_code code
, tree arg
)
6389 /* Inside a template, making these kinds of adjustments is
6390 pointless; we are only concerned with the type of the
6392 if (processing_template_decl
)
6395 /* Handle (a, b) used as an "lvalue". */
6396 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6398 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
6399 tf_warning_or_error
);
6400 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6401 TREE_OPERAND (arg
, 0), real_result
);
6404 /* Handle (a ? b : c) used as an "lvalue". */
6405 if (TREE_CODE (arg
) == COND_EXPR
6406 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6407 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6409 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6410 if (TREE_CODE (arg
) == MODIFY_EXPR
6411 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6412 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6413 return unary_complex_lvalue (code
, genericize_compound_lvalue (arg
));
6415 if (code
!= ADDR_EXPR
)
6418 /* Handle (a = b) used as an "lvalue" for `&'. */
6419 if (TREE_CODE (arg
) == MODIFY_EXPR
6420 || TREE_CODE (arg
) == INIT_EXPR
)
6422 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
6423 tf_warning_or_error
);
6424 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6426 TREE_NO_WARNING (arg
) = 1;
6430 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6431 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6432 || TREE_CODE (arg
) == OFFSET_REF
)
6435 /* We permit compiler to make function calls returning
6436 objects of aggregate type look like lvalues. */
6440 if (TREE_CODE (targ
) == SAVE_EXPR
)
6441 targ
= TREE_OPERAND (targ
, 0);
6443 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6445 if (TREE_CODE (arg
) == SAVE_EXPR
)
6448 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6449 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6452 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6453 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6454 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6457 /* Don't let anything else be handled specially. */
6461 /* Mark EXP saying that we need to be able to take the
6462 address of it; it should not be allocated in a register.
6463 Value is true if successful. ARRAY_REF_P is true if this
6464 is for ARRAY_REF construction - in that case we don't want
6465 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
6466 it is fine to use ARRAY_REFs for vector subscripts on vector
6469 C++: we do not allow `current_class_ptr' to be addressable. */
6472 cxx_mark_addressable (tree exp
, bool array_ref_p
)
6477 switch (TREE_CODE (x
))
6479 case VIEW_CONVERT_EXPR
:
6481 && TREE_CODE (TREE_TYPE (x
)) == ARRAY_TYPE
6482 && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x
, 0))))
6490 x
= TREE_OPERAND (x
, 0);
6494 if (x
== current_class_ptr
)
6496 error ("cannot take the address of %<this%>, which is an rvalue expression");
6497 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6503 /* Caller should not be trying to mark initialized
6504 constant fields addressable. */
6505 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6506 || DECL_IN_AGGR_P (x
) == 0
6508 || DECL_EXTERNAL (x
));
6512 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6513 && !DECL_ARTIFICIAL (x
))
6515 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6518 ("address of explicit register variable %qD requested", x
);
6521 else if (extra_warnings
)
6523 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6525 TREE_ADDRESSABLE (x
) = 1;
6530 TREE_ADDRESSABLE (x
) = 1;
6534 TREE_ADDRESSABLE (x
) = 1;
6538 TREE_ADDRESSABLE (x
) = 1;
6539 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6547 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6550 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6551 tsubst_flags_t complain
)
6553 tree orig_ifexp
= ifexp
;
6554 tree orig_op1
= op1
;
6555 tree orig_op2
= op2
;
6558 if (processing_template_decl
)
6560 /* The standard says that the expression is type-dependent if
6561 IFEXP is type-dependent, even though the eventual type of the
6562 expression doesn't dependent on IFEXP. */
6563 if (type_dependent_expression_p (ifexp
)
6564 /* As a GNU extension, the middle operand may be omitted. */
6565 || (op1
&& type_dependent_expression_p (op1
))
6566 || type_dependent_expression_p (op2
))
6567 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6568 ifexp
= build_non_dependent_expr (ifexp
);
6570 op1
= build_non_dependent_expr (op1
);
6571 op2
= build_non_dependent_expr (op2
);
6574 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6575 if (processing_template_decl
&& expr
!= error_mark_node
)
6577 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6578 orig_ifexp
, orig_op1
, orig_op2
);
6579 expr
= convert_from_reference (min
);
6584 /* Given a list of expressions, return a compound expression
6585 that performs them all and returns the value of the last of them. */
6588 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6589 tsubst_flags_t complain
)
6591 tree expr
= TREE_VALUE (list
);
6593 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6594 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6596 if (complain
& tf_error
)
6597 pedwarn (cp_expr_loc_or_loc (expr
, input_location
), 0,
6598 "list-initializer for non-class type must not "
6599 "be parenthesized");
6601 return error_mark_node
;
6604 if (TREE_CHAIN (list
))
6606 if (complain
& tf_error
)
6610 permerror (input_location
, "expression list treated as compound "
6611 "expression in initializer");
6614 permerror (input_location
, "expression list treated as compound "
6615 "expression in mem-initializer");
6618 permerror (input_location
, "expression list treated as compound "
6619 "expression in functional cast");
6625 return error_mark_node
;
6627 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6628 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6629 expr
, TREE_VALUE (list
), complain
);
6635 /* Like build_x_compound_expr_from_list, but using a VEC. */
6638 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6639 tsubst_flags_t complain
)
6641 if (vec_safe_is_empty (vec
))
6643 else if (vec
->length () == 1)
6653 if (complain
& tf_error
)
6654 permerror (input_location
,
6655 "%s expression list treated as compound expression",
6658 return error_mark_node
;
6662 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6663 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6670 /* Handle overloading of the ',' operator when needed. */
6673 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6674 tsubst_flags_t complain
)
6677 tree orig_op1
= op1
;
6678 tree orig_op2
= op2
;
6679 tree overload
= NULL_TREE
;
6681 if (processing_template_decl
)
6683 if (type_dependent_expression_p (op1
)
6684 || type_dependent_expression_p (op2
))
6685 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6686 op1
= build_non_dependent_expr (op1
);
6687 op2
= build_non_dependent_expr (op2
);
6690 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6691 NULL_TREE
, &overload
, complain
);
6693 result
= cp_build_compound_expr (op1
, op2
, complain
);
6695 if (processing_template_decl
&& result
!= error_mark_node
)
6697 if (overload
!= NULL_TREE
)
6698 return (build_min_non_dep_op_overload
6699 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6701 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6707 /* Like cp_build_compound_expr, but for the c-common bits. */
6710 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6712 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6715 /* Build a compound expression. */
6718 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6720 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6722 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6723 return error_mark_node
;
6725 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6727 /* If the rhs is a TARGET_EXPR, then build the compound
6728 expression inside the target_expr's initializer. This
6729 helps the compiler to eliminate unnecessary temporaries. */
6730 tree init
= TREE_OPERAND (rhs
, 1);
6732 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6733 TREE_OPERAND (rhs
, 1) = init
;
6738 if (type_unknown_p (rhs
))
6740 if (complain
& tf_error
)
6741 error ("no context to resolve type of %qE", rhs
);
6742 return error_mark_node
;
6745 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6748 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6749 casts away constness. CAST gives the type of cast. Returns true
6750 if the cast is ill-formed, false if it is well-formed.
6752 ??? This function warns for casting away any qualifier not just
6753 const. We would like to specify exactly what qualifiers are casted
6758 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6759 enum tree_code cast
, tsubst_flags_t complain
)
6761 /* C-style casts are allowed to cast away constness. With
6762 WARN_CAST_QUAL, we still want to issue a warning. */
6763 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6766 if (!casts_away_constness (src_type
, dest_type
, complain
))
6772 if (complain
& tf_warning
)
6773 warning (OPT_Wcast_qual
,
6774 "cast from type %qT to type %qT casts away qualifiers",
6775 src_type
, dest_type
);
6778 case STATIC_CAST_EXPR
:
6779 if (complain
& tf_error
)
6780 error ("static_cast from type %qT to type %qT casts away qualifiers",
6781 src_type
, dest_type
);
6784 case REINTERPRET_CAST_EXPR
:
6785 if (complain
& tf_error
)
6786 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6787 src_type
, dest_type
);
6795 /* Warns if the cast from expression EXPR to type TYPE is useless. */
6797 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6799 if (warn_useless_cast
6800 && complain
& tf_warning
)
6802 if ((TYPE_REF_P (type
)
6803 && (TYPE_REF_IS_RVALUE (type
)
6804 ? xvalue_p (expr
) : lvalue_p (expr
))
6805 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6806 || same_type_p (TREE_TYPE (expr
), type
))
6807 warning (OPT_Wuseless_cast
, "useless cast to type %q#T", type
);
6811 /* Warns if the cast ignores cv-qualifiers on TYPE. */
6813 maybe_warn_about_cast_ignoring_quals (tree type
, tsubst_flags_t complain
)
6815 if (warn_ignored_qualifiers
6816 && complain
& tf_warning
6817 && !CLASS_TYPE_P (type
)
6818 && (cp_type_quals (type
) & (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)))
6820 warning (OPT_Wignored_qualifiers
, "type qualifiers ignored on cast "
6825 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6826 (another pointer-to-member type in the same hierarchy) and return
6827 the converted expression. If ALLOW_INVERSE_P is permitted, a
6828 pointer-to-derived may be converted to pointer-to-base; otherwise,
6829 only the other direction is permitted. If C_CAST_P is true, this
6830 conversion is taking place as part of a C-style cast. */
6833 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6834 bool c_cast_p
, tsubst_flags_t complain
)
6836 if (same_type_p (type
, TREE_TYPE (expr
)))
6839 if (TYPE_PTRDATAMEM_P (type
))
6841 tree obase
= TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
));
6842 tree nbase
= TYPE_PTRMEM_CLASS_TYPE (type
);
6843 tree delta
= (get_delta_difference
6845 allow_inverse_p
, c_cast_p
, complain
));
6847 if (delta
== error_mark_node
)
6848 return error_mark_node
;
6850 if (!same_type_p (obase
, nbase
))
6852 if (TREE_CODE (expr
) == PTRMEM_CST
)
6853 expr
= cplus_expand_constant (expr
);
6855 tree cond
= cp_build_binary_op (input_location
, EQ_EXPR
, expr
,
6856 build_int_cst (TREE_TYPE (expr
), -1),
6858 tree op1
= build_nop (ptrdiff_type_node
, expr
);
6859 tree op2
= cp_build_binary_op (input_location
, PLUS_EXPR
, op1
, delta
,
6862 expr
= fold_build3_loc (input_location
,
6863 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6866 return build_nop (type
, expr
);
6869 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6870 allow_inverse_p
, c_cast_p
, complain
);
6873 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6874 this static_cast is being attempted as one of the possible casts
6875 allowed by a C-style cast. (In that case, accessibility of base
6876 classes is not considered, and it is OK to cast away
6877 constness.) Return the result of the cast. *VALID_P is set to
6878 indicate whether or not the cast was valid. */
6881 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6882 bool *valid_p
, tsubst_flags_t complain
)
6888 /* Assume the cast is valid. */
6891 intype
= unlowered_expr_type (expr
);
6893 /* Save casted types in the function's used types hash table. */
6894 used_types_insert (type
);
6896 /* A prvalue of non-class type is cv-unqualified. */
6897 if (!CLASS_TYPE_P (type
))
6898 type
= cv_unqualified (type
);
6900 /* [expr.static.cast]
6902 An lvalue of type "cv1 B", where B is a class type, can be cast
6903 to type "reference to cv2 D", where D is a class derived (clause
6904 _class.derived_) from B, if a valid standard conversion from
6905 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6906 same cv-qualification as, or greater cv-qualification than, cv1,
6907 and B is not a virtual base class of D. */
6908 /* We check this case before checking the validity of "TYPE t =
6909 EXPR;" below because for this case:
6912 struct D : public B { D(const B&); };
6914 void f() { static_cast<const D&>(b); }
6916 we want to avoid constructing a new D. The standard is not
6917 completely clear about this issue, but our interpretation is
6918 consistent with other compilers. */
6919 if (TYPE_REF_P (type
)
6920 && CLASS_TYPE_P (TREE_TYPE (type
))
6921 && CLASS_TYPE_P (intype
)
6922 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
6923 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6924 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6925 build_pointer_type (TYPE_MAIN_VARIANT
6926 (TREE_TYPE (type
))),
6929 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6933 if (processing_template_decl
)
6936 /* There is a standard conversion from "D*" to "B*" even if "B"
6937 is ambiguous or inaccessible. If this is really a
6938 static_cast, then we check both for inaccessibility and
6939 ambiguity. However, if this is a static_cast being performed
6940 because the user wrote a C-style cast, then accessibility is
6942 base
= lookup_base (TREE_TYPE (type
), intype
,
6943 c_cast_p
? ba_unique
: ba_check
,
6945 expr
= build_address (expr
);
6947 if (sanitize_flags_p (SANITIZE_VPTR
))
6950 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6956 /* Convert from "B*" to "D*". This function will check that "B"
6957 is not a virtual base of "D". Even if we don't have a guarantee
6958 that expr is NULL, if the static_cast is to a reference type,
6959 it is UB if it would be NULL, so omit the non-NULL check. */
6960 expr
= build_base_path (MINUS_EXPR
, expr
, base
,
6961 /*nonnull=*/flag_delete_null_pointer_checks
,
6964 /* Convert the pointer to a reference -- but then remember that
6965 there are no expressions with reference type in C++.
6967 We call rvalue so that there's an actual tree code
6968 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6969 is a variable with the same type, the conversion would get folded
6970 away, leaving just the variable and causing lvalue_kind to give
6971 the wrong answer. */
6972 expr
= cp_fold_convert (type
, expr
);
6974 /* When -fsanitize=null, make sure to diagnose reference binding to
6975 NULL even when the reference is converted to pointer later on. */
6976 if (sanitize_flags_p (SANITIZE_NULL
)
6977 && TREE_CODE (expr
) == COND_EXPR
6978 && TREE_OPERAND (expr
, 2)
6979 && TREE_CODE (TREE_OPERAND (expr
, 2)) == INTEGER_CST
6980 && TREE_TYPE (TREE_OPERAND (expr
, 2)) == type
)
6981 ubsan_maybe_instrument_reference (&TREE_OPERAND (expr
, 2));
6983 return convert_from_reference (rvalue (expr
));
6986 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6987 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6988 if (TYPE_REF_P (type
)
6989 && TYPE_REF_IS_RVALUE (type
)
6990 && (clk
= real_lvalue_p (expr
))
6991 && reference_related_p (TREE_TYPE (type
), intype
)
6992 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6994 if (processing_template_decl
)
6996 if (clk
== clk_ordinary
)
6998 /* Handle the (non-bit-field) lvalue case here by casting to
6999 lvalue reference and then changing it to an rvalue reference.
7000 Casting an xvalue to rvalue reference will be handled by the
7002 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
7003 result
= (perform_direct_initialization_if_possible
7004 (lref
, expr
, c_cast_p
, complain
));
7005 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
7006 return convert_from_reference (result
);
7009 /* For a bit-field or packed field, bind to a temporary. */
7010 expr
= rvalue (expr
);
7013 /* Resolve overloaded address here rather than once in
7014 implicit_conversion and again in the inverse code below. */
7015 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
7017 expr
= instantiate_type (type
, expr
, complain
);
7018 intype
= TREE_TYPE (expr
);
7021 /* [expr.static.cast]
7023 Any expression can be explicitly converted to type cv void. */
7024 if (VOID_TYPE_P (type
))
7025 return convert_to_void (expr
, ICV_CAST
, complain
);
7028 An abstract class shall not be used ... as the type of an explicit
7030 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
7031 return error_mark_node
;
7033 /* [expr.static.cast]
7035 An expression e can be explicitly converted to a type T using a
7036 static_cast of the form static_cast<T>(e) if the declaration T
7037 t(e);" is well-formed, for some invented temporary variable
7039 result
= perform_direct_initialization_if_possible (type
, expr
,
7040 c_cast_p
, complain
);
7043 if (processing_template_decl
)
7046 result
= convert_from_reference (result
);
7048 /* [expr.static.cast]
7050 If T is a reference type, the result is an lvalue; otherwise,
7051 the result is an rvalue. */
7052 if (!TYPE_REF_P (type
))
7054 result
= rvalue (result
);
7056 if (result
== expr
&& SCALAR_TYPE_P (type
))
7057 /* Leave some record of the cast. */
7058 result
= build_nop (type
, expr
);
7063 /* [expr.static.cast]
7065 The inverse of any standard conversion sequence (clause _conv_),
7066 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
7067 (_conv.array_), function-to-pointer (_conv.func_), and boolean
7068 (_conv.bool_) conversions, can be performed explicitly using
7069 static_cast subject to the restriction that the explicit
7070 conversion does not cast away constness (_expr.const.cast_), and
7071 the following additional rules for specific cases: */
7072 /* For reference, the conversions not excluded are: integral
7073 promotions, floating point promotion, integral conversions,
7074 floating point conversions, floating-integral conversions,
7075 pointer conversions, and pointer to member conversions. */
7078 A value of integral _or enumeration_ type can be explicitly
7079 converted to an enumeration type. */
7080 /* The effect of all that is that any conversion between any two
7081 types which are integral, floating, or enumeration types can be
7083 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7084 || SCALAR_FLOAT_TYPE_P (type
))
7085 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
7086 || SCALAR_FLOAT_TYPE_P (intype
)))
7088 if (processing_template_decl
)
7090 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
7093 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
7094 && CLASS_TYPE_P (TREE_TYPE (type
))
7095 && CLASS_TYPE_P (TREE_TYPE (intype
))
7096 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
7097 (TREE_TYPE (intype
))),
7098 build_pointer_type (TYPE_MAIN_VARIANT
7099 (TREE_TYPE (type
))),
7104 if (processing_template_decl
)
7108 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7110 return error_mark_node
;
7111 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
7112 c_cast_p
? ba_unique
: ba_check
,
7114 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
7117 if (sanitize_flags_p (SANITIZE_VPTR
))
7120 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
7126 return cp_fold_convert (type
, expr
);
7129 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7130 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7137 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
7138 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
7140 if (TYPE_PTRDATAMEM_P (type
))
7142 t1
= (build_ptrmem_type
7144 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
7145 t2
= (build_ptrmem_type
7147 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
7154 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
7157 && check_for_casting_away_constness (intype
, type
,
7160 return error_mark_node
;
7161 if (processing_template_decl
)
7163 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
7164 c_cast_p
, complain
);
7168 /* [expr.static.cast]
7170 An rvalue of type "pointer to cv void" can be explicitly
7171 converted to a pointer to object type. A value of type pointer
7172 to object converted to "pointer to cv void" and back to the
7173 original pointer type will have its original value. */
7174 if (TYPE_PTR_P (intype
)
7175 && VOID_TYPE_P (TREE_TYPE (intype
))
7176 && TYPE_PTROB_P (type
))
7179 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7181 return error_mark_node
;
7182 if (processing_template_decl
)
7184 return build_nop (type
, expr
);
7188 return error_mark_node
;
7191 /* Return an expression representing static_cast<TYPE>(EXPR). */
7194 build_static_cast (tree type
, tree oexpr
, tsubst_flags_t complain
)
7200 if (type
== error_mark_node
|| expr
== error_mark_node
)
7201 return error_mark_node
;
7203 bool dependent
= (dependent_type_p (type
)
7204 || type_dependent_expression_p (expr
));
7208 expr
= build_min (STATIC_CAST_EXPR
, type
, oexpr
);
7209 /* We don't know if it will or will not have side effects. */
7210 TREE_SIDE_EFFECTS (expr
) = 1;
7211 return convert_from_reference (expr
);
7213 else if (processing_template_decl
)
7214 expr
= build_non_dependent_expr (expr
);
7216 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7217 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7218 if (!TYPE_REF_P (type
)
7219 && TREE_CODE (expr
) == NOP_EXPR
7220 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7221 expr
= TREE_OPERAND (expr
, 0);
7223 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
7227 if (result
!= error_mark_node
)
7229 maybe_warn_about_useless_cast (type
, expr
, complain
);
7230 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7232 if (processing_template_decl
)
7237 if (complain
& tf_error
)
7238 error ("invalid static_cast from type %qT to type %qT",
7239 TREE_TYPE (expr
), type
);
7240 return error_mark_node
;
7243 /* EXPR is an expression with member function or pointer-to-member
7244 function type. TYPE is a pointer type. Converting EXPR to TYPE is
7245 not permitted by ISO C++, but we accept it in some modes. If we
7246 are not in one of those modes, issue a diagnostic. Return the
7247 converted expression. */
7250 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
7255 intype
= TREE_TYPE (expr
);
7256 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
7257 || TREE_CODE (intype
) == METHOD_TYPE
);
7259 if (!(complain
& tf_warning_or_error
))
7260 return error_mark_node
;
7262 if (pedantic
|| warn_pmf2ptr
)
7263 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
7264 "converting from %qH to %qI", intype
, type
);
7266 if (TREE_CODE (intype
) == METHOD_TYPE
)
7267 expr
= build_addr_func (expr
, complain
);
7268 else if (TREE_CODE (expr
) == PTRMEM_CST
)
7269 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
7272 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
7273 decl
= build_address (decl
);
7274 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
7277 if (expr
== error_mark_node
)
7278 return error_mark_node
;
7280 return build_nop (type
, expr
);
7283 /* Build a NOP_EXPR to TYPE, but mark it as a reinterpret_cast so that
7284 constexpr evaluation knows to reject it. */
7287 build_nop_reinterpret (tree type
, tree expr
)
7289 tree ret
= build_nop (type
, expr
);
7291 REINTERPRET_CAST_P (ret
) = true;
7295 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
7296 If C_CAST_P is true, this reinterpret cast is being done as part of
7297 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
7298 indicate whether or not reinterpret_cast was valid. */
7301 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
7302 bool *valid_p
, tsubst_flags_t complain
)
7306 /* Assume the cast is invalid. */
7310 if (type
== error_mark_node
|| error_operand_p (expr
))
7311 return error_mark_node
;
7313 intype
= TREE_TYPE (expr
);
7315 /* Save casted types in the function's used types hash table. */
7316 used_types_insert (type
);
7318 /* A prvalue of non-class type is cv-unqualified. */
7319 if (!CLASS_TYPE_P (type
))
7320 type
= cv_unqualified (type
);
7322 /* [expr.reinterpret.cast]
7323 A glvalue expression of type T1 can be cast to the type
7324 "reference to T2" if an expression of type "pointer to T1" can be
7325 explicitly converted to the type "pointer to T2" using a
7326 reinterpret_cast. */
7327 if (TYPE_REF_P (type
))
7329 if (TYPE_REF_IS_RVALUE (type
))
7331 if (!obvalue_p (expr
))
7332 /* Perform the temporary materialization conversion. */
7333 expr
= get_target_expr_sfinae (expr
, complain
);
7335 else if (!lvalue_p (expr
))
7337 if (complain
& tf_error
)
7338 error ("invalid cast of an rvalue expression of type "
7341 return error_mark_node
;
7344 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7345 "B" are related class types; the reinterpret_cast does not
7346 adjust the pointer. */
7347 if (TYPE_PTR_P (intype
)
7348 && (complain
& tf_warning
)
7349 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7350 COMPARE_BASE
| COMPARE_DERIVED
)))
7351 warning (0, "casting %qT to %qT does not dereference pointer",
7354 expr
= cp_build_addr_expr (expr
, complain
);
7356 if (warn_strict_aliasing
> 2)
7357 strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
7359 if (expr
!= error_mark_node
)
7360 expr
= build_reinterpret_cast_1
7361 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7363 if (expr
!= error_mark_node
)
7364 /* cp_build_indirect_ref isn't right for rvalue refs. */
7365 expr
= convert_from_reference (fold_convert (type
, expr
));
7369 /* As a G++ extension, we consider conversions from member
7370 functions, and pointers to member functions to
7371 pointer-to-function and pointer-to-void types. If
7372 -Wno-pmf-conversions has not been specified,
7373 convert_member_func_to_ptr will issue an error message. */
7374 if ((TYPE_PTRMEMFUNC_P (intype
)
7375 || TREE_CODE (intype
) == METHOD_TYPE
)
7376 && TYPE_PTR_P (type
)
7377 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7378 || VOID_TYPE_P (TREE_TYPE (type
))))
7379 return convert_member_func_to_ptr (type
, expr
, complain
);
7381 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7382 array-to-pointer, and function-to-pointer conversions are
7384 expr
= decay_conversion (expr
, complain
);
7386 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7387 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7388 if (TREE_CODE (expr
) == NOP_EXPR
7389 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7390 expr
= TREE_OPERAND (expr
, 0);
7392 if (error_operand_p (expr
))
7393 return error_mark_node
;
7395 intype
= TREE_TYPE (expr
);
7397 /* [expr.reinterpret.cast]
7398 A pointer can be converted to any integral type large enough to
7399 hold it. ... A value of type std::nullptr_t can be converted to
7400 an integral type; the conversion has the same meaning and
7401 validity as a conversion of (void*)0 to the integral type. */
7402 if (CP_INTEGRAL_TYPE_P (type
)
7403 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7405 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7407 if (complain
& tf_error
)
7408 permerror (input_location
, "cast from %qH to %qI loses precision",
7411 return error_mark_node
;
7413 if (NULLPTR_TYPE_P (intype
))
7414 return build_int_cst (type
, 0);
7416 /* [expr.reinterpret.cast]
7417 A value of integral or enumeration type can be explicitly
7418 converted to a pointer. */
7419 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7422 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7423 || TYPE_PTR_OR_PTRMEM_P (type
))
7424 && same_type_p (type
, intype
))
7426 return rvalue (expr
);
7427 else if (TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7429 if ((complain
& tf_warning
)
7430 && !cxx_safe_function_type_cast_p (TREE_TYPE (type
),
7431 TREE_TYPE (intype
)))
7432 warning (OPT_Wcast_function_type
,
7433 "cast between incompatible function types"
7434 " from %qH to %qI", intype
, type
);
7435 return build_nop_reinterpret (type
, expr
);
7437 else if (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
))
7439 if ((complain
& tf_warning
)
7440 && !cxx_safe_function_type_cast_p
7441 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (type
)),
7442 TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (intype
))))
7443 warning (OPT_Wcast_function_type
,
7444 "cast between incompatible pointer to member types"
7445 " from %qH to %qI", intype
, type
);
7446 return build_nop_reinterpret (type
, expr
);
7448 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7449 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7452 && check_for_casting_away_constness (intype
, type
,
7453 REINTERPRET_CAST_EXPR
,
7455 return error_mark_node
;
7456 /* Warn about possible alignment problems. */
7457 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7458 && (complain
& tf_warning
)
7459 && !VOID_TYPE_P (type
)
7460 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7461 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7462 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7463 && min_align_of_type (TREE_TYPE (type
))
7464 > min_align_of_type (TREE_TYPE (intype
)))
7465 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7466 "increases required alignment of target type", intype
, type
);
7468 if (warn_strict_aliasing
<= 2)
7469 /* strict_aliasing_warning STRIP_NOPs its expr. */
7470 strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
7472 return build_nop_reinterpret (type
, expr
);
7474 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7475 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7477 if (complain
& tf_warning
)
7478 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7479 object pointer type or vice versa is conditionally-supported." */
7480 warning (OPT_Wconditionally_supported
,
7481 "casting between pointer-to-function and pointer-to-object "
7482 "is conditionally-supported");
7483 return build_nop_reinterpret (type
, expr
);
7485 else if (VECTOR_TYPE_P (type
))
7486 return convert_to_vector (type
, expr
);
7487 else if (VECTOR_TYPE_P (intype
)
7488 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7489 return convert_to_integer_nofold (type
, expr
);
7494 if (complain
& tf_error
)
7495 error ("invalid cast from type %qT to type %qT", intype
, type
);
7496 return error_mark_node
;
7499 expr
= cp_convert (type
, expr
, complain
);
7500 if (TREE_CODE (expr
) == NOP_EXPR
)
7501 /* Mark any nop_expr that created as a reintepret_cast. */
7502 REINTERPRET_CAST_P (expr
) = true;
7507 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7511 if (type
== error_mark_node
|| expr
== error_mark_node
)
7512 return error_mark_node
;
7514 if (processing_template_decl
)
7516 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7518 if (!TREE_SIDE_EFFECTS (t
)
7519 && type_dependent_expression_p (expr
))
7520 /* There might turn out to be side effects inside expr. */
7521 TREE_SIDE_EFFECTS (t
) = 1;
7522 return convert_from_reference (t
);
7525 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7526 /*valid_p=*/NULL
, complain
);
7527 if (r
!= error_mark_node
)
7529 maybe_warn_about_useless_cast (type
, expr
, complain
);
7530 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7535 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7536 return an appropriate expression. Otherwise, return
7537 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7538 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7539 performing a C-style cast, its value upon return will indicate
7540 whether or not the conversion succeeded. */
7543 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7547 tree reference_type
;
7549 /* Callers are responsible for handling error_mark_node as a
7550 destination type. */
7551 gcc_assert (dst_type
!= error_mark_node
);
7552 /* In a template, callers should be building syntactic
7553 representations of casts, not using this machinery. */
7554 gcc_assert (!processing_template_decl
);
7556 /* Assume the conversion is invalid. */
7560 if (!INDIRECT_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7562 if (complain
& tf_error
)
7563 error ("invalid use of const_cast with type %qT, "
7564 "which is not a pointer, "
7565 "reference, nor a pointer-to-data-member type", dst_type
);
7566 return error_mark_node
;
7569 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7571 if (complain
& tf_error
)
7572 error ("invalid use of const_cast with type %qT, which is a pointer "
7573 "or reference to a function type", dst_type
);
7574 return error_mark_node
;
7577 /* A prvalue of non-class type is cv-unqualified. */
7578 dst_type
= cv_unqualified (dst_type
);
7580 /* Save casted types in the function's used types hash table. */
7581 used_types_insert (dst_type
);
7583 src_type
= TREE_TYPE (expr
);
7584 /* Expressions do not really have reference types. */
7585 if (TYPE_REF_P (src_type
))
7586 src_type
= TREE_TYPE (src_type
);
7588 /* [expr.const.cast]
7590 For two object types T1 and T2, if a pointer to T1 can be explicitly
7591 converted to the type "pointer to T2" using a const_cast, then the
7592 following conversions can also be made:
7594 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7595 type T2 using the cast const_cast<T2&>;
7597 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7598 type T2 using the cast const_cast<T2&&>; and
7600 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7601 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7603 if (TYPE_REF_P (dst_type
))
7605 reference_type
= dst_type
;
7606 if (!TYPE_REF_IS_RVALUE (dst_type
)
7612 if (complain
& tf_error
)
7613 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7614 src_type
, dst_type
);
7615 return error_mark_node
;
7617 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7618 src_type
= build_pointer_type (src_type
);
7622 reference_type
= NULL_TREE
;
7623 /* If the destination type is not a reference type, the
7624 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7625 conversions are performed. */
7626 src_type
= type_decays_to (src_type
);
7627 if (src_type
== error_mark_node
)
7628 return error_mark_node
;
7631 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7633 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7638 /* This cast is actually a C-style cast. Issue a warning if
7639 the user is making a potentially unsafe cast. */
7640 check_for_casting_away_constness (src_type
, dst_type
,
7641 CAST_EXPR
, complain
);
7642 /* ??? comp_ptr_ttypes_const ignores TYPE_ALIGN. */
7643 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7644 && (complain
& tf_warning
)
7645 && min_align_of_type (TREE_TYPE (dst_type
))
7646 > min_align_of_type (TREE_TYPE (src_type
)))
7647 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7648 "increases required alignment of target type",
7649 src_type
, dst_type
);
7653 expr
= cp_build_addr_expr (expr
, complain
);
7654 if (expr
== error_mark_node
)
7655 return error_mark_node
;
7656 expr
= build_nop (reference_type
, expr
);
7657 return convert_from_reference (expr
);
7661 expr
= decay_conversion (expr
, complain
);
7662 if (expr
== error_mark_node
)
7663 return error_mark_node
;
7665 /* build_c_cast puts on a NOP_EXPR to make the result not an
7666 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7667 non-lvalue context. */
7668 if (TREE_CODE (expr
) == NOP_EXPR
7669 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7670 expr
= TREE_OPERAND (expr
, 0);
7671 return build_nop (dst_type
, expr
);
7675 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7676 TREE_TYPE (src_type
)))
7677 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7681 if (complain
& tf_error
)
7682 error ("invalid const_cast from type %qT to type %qT",
7683 src_type
, dst_type
);
7684 return error_mark_node
;
7688 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7692 if (type
== error_mark_node
|| error_operand_p (expr
))
7693 return error_mark_node
;
7695 if (processing_template_decl
)
7697 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7699 if (!TREE_SIDE_EFFECTS (t
)
7700 && type_dependent_expression_p (expr
))
7701 /* There might turn out to be side effects inside expr. */
7702 TREE_SIDE_EFFECTS (t
) = 1;
7703 return convert_from_reference (t
);
7706 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7707 if (r
!= error_mark_node
)
7709 maybe_warn_about_useless_cast (type
, expr
, complain
);
7710 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7715 /* Like cp_build_c_cast, but for the c-common bits. */
7718 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7720 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7723 /* Like the "build_c_cast" used for c-common, but using cp_expr to
7724 preserve location information even for tree nodes that don't
7728 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
7730 cp_expr result
= cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7731 result
.set_location (loc
);
7735 /* Build an expression representing an explicit C-style cast to type
7736 TYPE of expression EXPR. */
7739 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7745 if (type
== error_mark_node
|| error_operand_p (expr
))
7746 return error_mark_node
;
7748 if (processing_template_decl
)
7750 tree t
= build_min (CAST_EXPR
, type
,
7751 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7752 /* We don't know if it will or will not have side effects. */
7753 TREE_SIDE_EFFECTS (t
) = 1;
7754 return convert_from_reference (t
);
7757 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7758 'Class') should always be retained, because this information aids
7759 in method lookup. */
7760 if (objc_is_object_ptr (type
)
7761 && objc_is_object_ptr (TREE_TYPE (expr
)))
7762 return build_nop (type
, expr
);
7764 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7765 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7766 if (!TYPE_REF_P (type
)
7767 && TREE_CODE (value
) == NOP_EXPR
7768 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7769 value
= TREE_OPERAND (value
, 0);
7771 if (TREE_CODE (type
) == ARRAY_TYPE
)
7773 /* Allow casting from T1* to T2[] because Cfront allows it.
7774 NIHCL uses it. It is not valid ISO C++ however. */
7775 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7777 if (complain
& tf_error
)
7778 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7780 return error_mark_node
;
7781 type
= build_pointer_type (TREE_TYPE (type
));
7785 if (complain
& tf_error
)
7786 error ("ISO C++ forbids casting to an array type %qT", type
);
7787 return error_mark_node
;
7791 if (TREE_CODE (type
) == FUNCTION_TYPE
7792 || TREE_CODE (type
) == METHOD_TYPE
)
7794 if (complain
& tf_error
)
7795 error ("invalid cast to function type %qT", type
);
7796 return error_mark_node
;
7799 if (TYPE_PTR_P (type
)
7800 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7801 /* Casting to an integer of smaller size is an error detected elsewhere. */
7802 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7803 /* Don't warn about converting any constant. */
7804 && !TREE_CONSTANT (value
))
7805 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7806 "cast to pointer from integer of different size");
7808 /* A C-style cast can be a const_cast. */
7809 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7813 if (result
!= error_mark_node
)
7815 maybe_warn_about_useless_cast (type
, value
, complain
);
7816 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7821 /* Or a static cast. */
7822 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7823 &valid_p
, complain
);
7824 /* Or a reinterpret_cast. */
7826 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7827 &valid_p
, complain
);
7828 /* The static_cast or reinterpret_cast may be followed by a
7831 /* A valid cast may result in errors if, for example, a
7832 conversion to an ambiguous base class is required. */
7833 && !error_operand_p (result
))
7837 maybe_warn_about_useless_cast (type
, value
, complain
);
7838 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7840 /* Non-class rvalues always have cv-unqualified type. */
7841 if (!CLASS_TYPE_P (type
))
7842 type
= TYPE_MAIN_VARIANT (type
);
7843 result_type
= TREE_TYPE (result
);
7844 if (!CLASS_TYPE_P (result_type
) && !TYPE_REF_P (type
))
7845 result_type
= TYPE_MAIN_VARIANT (result_type
);
7846 /* If the type of RESULT does not match TYPE, perform a
7847 const_cast to make it match. If the static_cast or
7848 reinterpret_cast succeeded, we will differ by at most
7849 cv-qualification, so the follow-on const_cast is guaranteed
7851 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7853 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7854 gcc_assert (valid_p
);
7859 return error_mark_node
;
7862 /* For use from the C common bits. */
7864 build_modify_expr (location_t location
,
7865 tree lhs
, tree
/*lhs_origtype*/,
7866 enum tree_code modifycode
,
7867 location_t
/*rhs_location*/, tree rhs
,
7868 tree
/*rhs_origtype*/)
7870 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
7871 tf_warning_or_error
);
7874 /* Build an assignment expression of lvalue LHS from value RHS.
7875 MODIFYCODE is the code for a binary operator that we use
7876 to combine the old value of LHS with RHS to get the new value.
7877 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7879 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7882 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7883 tree rhs
, tsubst_flags_t complain
)
7885 lhs
= mark_lvalue_use_nonread (lhs
);
7887 tree result
= NULL_TREE
;
7889 tree lhstype
= TREE_TYPE (lhs
);
7891 tree olhstype
= lhstype
;
7892 bool plain_assign
= (modifycode
== NOP_EXPR
);
7893 bool compound_side_effects_p
= false;
7894 tree preeval
= NULL_TREE
;
7896 /* Avoid duplicate error messages from operands that had errors. */
7897 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7898 return error_mark_node
;
7900 while (TREE_CODE (lhs
) == COMPOUND_EXPR
)
7902 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7903 compound_side_effects_p
= true;
7904 lhs
= TREE_OPERAND (lhs
, 1);
7907 /* Handle control structure constructs used as "lvalues". Note that we
7908 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
7909 switch (TREE_CODE (lhs
))
7911 /* Handle --foo = 5; as these are valid constructs in C++. */
7912 case PREDECREMENT_EXPR
:
7913 case PREINCREMENT_EXPR
:
7914 if (compound_side_effects_p
)
7915 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7916 lhs
= genericize_compound_lvalue (lhs
);
7918 /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
7919 and looked through the COMPOUND_EXPRs, readd them now around
7920 the resulting lhs. */
7921 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7923 lhs
= build2 (COMPOUND_EXPR
, lhstype
, TREE_OPERAND (olhs
, 0), lhs
);
7924 tree
*ptr
= &TREE_OPERAND (lhs
, 1);
7925 for (olhs
= TREE_OPERAND (olhs
, 1);
7926 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7927 olhs
= TREE_OPERAND (olhs
, 1))
7929 *ptr
= build2 (COMPOUND_EXPR
, lhstype
,
7930 TREE_OPERAND (olhs
, 0), *ptr
);
7931 ptr
= &TREE_OPERAND (*ptr
, 1);
7937 if (compound_side_effects_p
)
7938 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7939 lhs
= genericize_compound_lvalue (lhs
);
7940 goto maybe_add_compound
;
7944 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7945 when neither operand has side-effects. */
7946 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7947 return error_mark_node
;
7949 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7950 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7952 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7953 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7955 TREE_OPERAND (lhs
, 0),
7956 TREE_OPERAND (lhs
, 1)),
7957 TREE_OPERAND (lhs
, 0),
7958 TREE_OPERAND (lhs
, 1));
7961 /* Handle (a ? b : c) used as an "lvalue". */
7964 /* Produce (a ? (b = rhs) : (c = rhs))
7965 except that the RHS goes through a save-expr
7966 so the code to compute it is only emitted once. */
7969 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7971 if (complain
& tf_error
)
7972 error ("void value not ignored as it ought to be");
7973 return error_mark_node
;
7976 rhs
= stabilize_expr (rhs
, &preeval
);
7978 /* Check this here to avoid odd errors when trying to convert
7979 a throw to the type of the COND_EXPR. */
7980 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7981 return error_mark_node
;
7983 cond
= build_conditional_expr
7984 (input_location
, TREE_OPERAND (lhs
, 0),
7985 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7986 modifycode
, rhs
, complain
),
7987 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7988 modifycode
, rhs
, complain
),
7991 if (cond
== error_mark_node
)
7993 /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
7994 and looked through the COMPOUND_EXPRs, readd them now around
7995 the resulting cond before adding the preevaluated rhs. */
7996 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7998 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7999 TREE_OPERAND (olhs
, 0), cond
);
8000 tree
*ptr
= &TREE_OPERAND (cond
, 1);
8001 for (olhs
= TREE_OPERAND (olhs
, 1);
8002 TREE_CODE (olhs
) == COMPOUND_EXPR
;
8003 olhs
= TREE_OPERAND (olhs
, 1))
8005 *ptr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
8006 TREE_OPERAND (olhs
, 0), *ptr
);
8007 ptr
= &TREE_OPERAND (*ptr
, 1);
8010 /* Make sure the code to compute the rhs comes out
8011 before the split. */
8021 if (modifycode
== INIT_EXPR
)
8023 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
8024 /* Do the default thing. */;
8025 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
8027 /* Compound literal. */
8028 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
8029 /* Call convert to generate an error; see PR 11063. */
8030 rhs
= convert (lhstype
, rhs
);
8031 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
8032 TREE_SIDE_EFFECTS (result
) = 1;
8035 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
8036 /* Do the default thing. */;
8039 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
8040 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
8041 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
8043 release_tree_vector (rhs_vec
);
8044 if (result
== NULL_TREE
)
8045 return error_mark_node
;
8051 lhs
= require_complete_type_sfinae (lhs
, complain
);
8052 if (lhs
== error_mark_node
)
8053 return error_mark_node
;
8055 if (modifycode
== NOP_EXPR
)
8057 if (c_dialect_objc ())
8059 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
8064 /* `operator=' is not an inheritable operator. */
8065 if (! MAYBE_CLASS_TYPE_P (lhstype
))
8066 /* Do the default thing. */;
8069 result
= build_new_op (input_location
, MODIFY_EXPR
,
8070 LOOKUP_NORMAL
, lhs
, rhs
,
8071 make_node (NOP_EXPR
), /*overload=*/NULL
,
8073 if (result
== NULL_TREE
)
8074 return error_mark_node
;
8081 tree init
= NULL_TREE
;
8083 /* A binary op has been requested. Combine the old LHS
8084 value with the RHS producing the value we should actually
8085 store into the LHS. */
8086 gcc_assert (!((TYPE_REF_P (lhstype
)
8087 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
8088 || MAYBE_CLASS_TYPE_P (lhstype
)));
8090 /* Preevaluate the RHS to make sure its evaluation is complete
8091 before the lvalue-to-rvalue conversion of the LHS:
8093 [expr.ass] With respect to an indeterminately-sequenced
8094 function call, the operation of a compound assignment is a
8095 single evaluation. [ Note: Therefore, a function call shall
8096 not intervene between the lvalue-to-rvalue conversion and the
8097 side effect associated with any single compound assignment
8098 operator. -- end note ] */
8099 lhs
= cp_stabilize_reference (lhs
);
8100 rhs
= decay_conversion (rhs
, complain
);
8101 if (rhs
== error_mark_node
)
8102 return error_mark_node
;
8103 rhs
= stabilize_expr (rhs
, &init
);
8104 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
8105 if (newrhs
== error_mark_node
)
8107 if (complain
& tf_error
)
8108 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
8109 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
8110 return error_mark_node
;
8114 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
8116 /* Now it looks like a plain assignment. */
8117 modifycode
= NOP_EXPR
;
8118 if (c_dialect_objc ())
8120 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
8125 gcc_assert (!TYPE_REF_P (lhstype
));
8126 gcc_assert (!TYPE_REF_P (TREE_TYPE (newrhs
)));
8129 /* The left-hand side must be an lvalue. */
8130 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
8131 return error_mark_node
;
8133 /* Warn about modifying something that is `const'. Don't warn if
8134 this is initialization. */
8135 if (modifycode
!= INIT_EXPR
8136 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
8137 /* Functions are not modifiable, even though they are
8139 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
8140 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
8141 /* If it's an aggregate and any field is const, then it is
8142 effectively const. */
8143 || (CLASS_TYPE_P (lhstype
)
8144 && C_TYPE_FIELDS_READONLY (lhstype
))))
8146 if (complain
& tf_error
)
8147 cxx_readonly_error (lhs
, lv_assign
);
8148 return error_mark_node
;
8151 /* If storing into a structure or union member, it may have been given a
8152 lowered bitfield type. We need to convert to the declared type first,
8153 so retrieve it now. */
8155 olhstype
= unlowered_expr_type (lhs
);
8157 /* Convert new value to destination type. */
8159 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
8163 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
8165 if (modifycode
!= INIT_EXPR
)
8167 if (complain
& tf_error
)
8168 error ("assigning to an array from an initializer list");
8169 return error_mark_node
;
8171 if (check_array_initializer (lhs
, lhstype
, newrhs
))
8172 return error_mark_node
;
8173 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8174 if (newrhs
== error_mark_node
)
8175 return error_mark_node
;
8178 /* C++11 8.5/17: "If the destination type is an array of characters,
8179 an array of char16_t, an array of char32_t, or an array of wchar_t,
8180 and the initializer is a string literal...". */
8181 else if (TREE_CODE (newrhs
) == STRING_CST
8182 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
8183 && modifycode
== INIT_EXPR
)
8185 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8186 if (newrhs
== error_mark_node
)
8187 return error_mark_node
;
8190 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
8191 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
8193 if (complain
& tf_error
)
8194 error ("incompatible types in assignment of %qT to %qT",
8195 TREE_TYPE (rhs
), lhstype
);
8196 return error_mark_node
;
8199 /* Allow array assignment in compiler-generated code. */
8200 else if (!current_function_decl
8201 || !DECL_DEFAULTED_FN (current_function_decl
))
8203 /* This routine is used for both initialization and assignment.
8204 Make sure the diagnostic message differentiates the context. */
8205 if (complain
& tf_error
)
8207 if (modifycode
== INIT_EXPR
)
8208 error ("array used as initializer");
8210 error ("invalid array assignment");
8212 return error_mark_node
;
8215 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
8216 ? 1 + (modifycode
!= INIT_EXPR
): 0;
8217 result
= build_vec_init (lhs
, NULL_TREE
, newrhs
,
8218 /*explicit_value_init_p=*/false,
8219 from_array
, complain
);
8223 if (modifycode
== INIT_EXPR
)
8224 /* Calls with INIT_EXPR are all direct-initialization, so don't set
8225 LOOKUP_ONLYCONVERTING. */
8226 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
8227 ICR_INIT
, NULL_TREE
, 0,
8230 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
8231 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
8233 if (!same_type_p (lhstype
, olhstype
))
8234 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
8236 if (modifycode
!= INIT_EXPR
)
8238 if (TREE_CODE (newrhs
) == CALL_EXPR
8239 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
8240 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
8242 /* Can't initialize directly from a TARGET_EXPR, since that would
8243 cause the lhs to be constructed twice, and possibly result in
8244 accidental self-initialization. So we force the TARGET_EXPR to be
8245 expanded without a target. */
8246 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
8247 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
8248 TREE_OPERAND (newrhs
, 0));
8251 if (newrhs
== error_mark_node
)
8252 return error_mark_node
;
8254 if (c_dialect_objc () && flag_objc_gc
)
8256 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
8262 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
8263 lhstype
, lhs
, newrhs
);
8265 TREE_SIDE_EFFECTS (result
) = 1;
8267 TREE_NO_WARNING (result
) = 1;
8271 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), preeval
, result
);
8276 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
8277 tree rhs
, tsubst_flags_t complain
)
8279 tree orig_lhs
= lhs
;
8280 tree orig_rhs
= rhs
;
8281 tree overload
= NULL_TREE
;
8282 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
8284 if (processing_template_decl
)
8286 if (modifycode
== NOP_EXPR
8287 || type_dependent_expression_p (lhs
)
8288 || type_dependent_expression_p (rhs
))
8289 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
8290 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
8293 lhs
= build_non_dependent_expr (lhs
);
8294 rhs
= build_non_dependent_expr (rhs
);
8297 if (modifycode
!= NOP_EXPR
)
8299 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
8300 lhs
, rhs
, op
, &overload
, complain
);
8303 if (rval
== error_mark_node
)
8305 TREE_NO_WARNING (rval
) = 1;
8306 if (processing_template_decl
)
8308 if (overload
!= NULL_TREE
)
8309 return (build_min_non_dep_op_overload
8310 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
8312 return (build_min_non_dep
8313 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
8318 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
8321 /* Helper function for get_delta_difference which assumes FROM is a base
8322 class of TO. Returns a delta for the conversion of pointer-to-member
8323 of FROM to pointer-to-member of TO. If the conversion is invalid and
8324 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
8325 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
8326 If C_CAST_P is true, this conversion is taking place as part of a
8330 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
8331 tsubst_flags_t complain
)
8336 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
8339 if (binfo
== error_mark_node
)
8341 if (!(complain
& tf_error
))
8342 return error_mark_node
;
8344 error (" in pointer to member function conversion");
8345 return size_zero_node
;
8349 if (kind
!= bk_via_virtual
)
8350 return BINFO_OFFSET (binfo
);
8352 /* FROM is a virtual base class of TO. Issue an error or warning
8353 depending on whether or not this is a reinterpret cast. */
8355 if (!(complain
& tf_error
))
8356 return error_mark_node
;
8358 error ("pointer to member conversion via virtual base %qT",
8359 BINFO_TYPE (binfo_from_vbase (binfo
)));
8361 return size_zero_node
;
8368 /* Get difference in deltas for different pointer to member function
8369 types. If the conversion is invalid and tf_error is not set in
8370 COMPLAIN, returns error_mark_node, otherwise returns an integer
8371 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
8372 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
8373 conversions as well. If C_CAST_P is true this conversion is taking
8374 place as part of a C-style cast.
8376 Note that the naming of FROM and TO is kind of backwards; the return
8377 value is what we add to a TO in order to get a FROM. They are named
8378 this way because we call this function to find out how to convert from
8379 a pointer to member of FROM to a pointer to member of TO. */
8382 get_delta_difference (tree from
, tree to
,
8383 bool allow_inverse_p
,
8384 bool c_cast_p
, tsubst_flags_t complain
)
8388 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
8389 /* Pointer to member of incomplete class is permitted*/
8390 result
= size_zero_node
;
8392 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
8394 if (result
== error_mark_node
)
8395 return error_mark_node
;
8399 if (!allow_inverse_p
)
8401 if (!(complain
& tf_error
))
8402 return error_mark_node
;
8404 error_not_base_type (from
, to
);
8405 error (" in pointer to member conversion");
8406 result
= size_zero_node
;
8410 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
8412 if (result
== error_mark_node
)
8413 return error_mark_node
;
8416 result
= size_diffop_loc (input_location
,
8417 size_zero_node
, result
);
8420 if (!(complain
& tf_error
))
8421 return error_mark_node
;
8423 error_not_base_type (from
, to
);
8424 error (" in pointer to member conversion");
8425 result
= size_zero_node
;
8430 return convert_to_integer (ptrdiff_type_node
, result
);
8433 /* Return a constructor for the pointer-to-member-function TYPE using
8434 the other components as specified. */
8437 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8442 vec
<constructor_elt
, va_gc
> *v
;
8444 /* Pull the FIELD_DECLs out of the type. */
8445 pfn_field
= TYPE_FIELDS (type
);
8446 delta_field
= DECL_CHAIN (pfn_field
);
8448 /* Make sure DELTA has the type we want. */
8449 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8451 /* Convert to the correct target type if necessary. */
8452 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8454 /* Finish creating the initializer. */
8456 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8457 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8458 u
= build_constructor (type
, v
);
8459 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8460 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8461 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8463 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8468 /* Build a constructor for a pointer to member function. It can be
8469 used to initialize global variables, local variable, or used
8470 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8473 If FORCE is nonzero, then force this conversion, even if
8474 we would rather not do it. Usually set when using an explicit
8475 cast. A C-style cast is being processed iff C_CAST_P is true.
8477 Return error_mark_node, if something goes wrong. */
8480 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8481 tsubst_flags_t complain
)
8487 if (error_operand_p (pfn
))
8488 return error_mark_node
;
8490 pfn_type
= TREE_TYPE (pfn
);
8491 to_type
= build_ptrmemfunc_type (type
);
8493 /* Handle multiple conversions of pointer to member functions. */
8494 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8496 tree delta
= NULL_TREE
;
8497 tree npfn
= NULL_TREE
;
8501 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8502 LOOKUP_NORMAL
, complain
))
8504 if (complain
& tf_error
)
8505 error ("invalid conversion to type %qT from type %qT",
8508 return error_mark_node
;
8511 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8512 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8514 c_cast_p
, complain
);
8515 if (n
== error_mark_node
)
8516 return error_mark_node
;
8518 /* We don't have to do any conversion to convert a
8519 pointer-to-member to its own type. But, we don't want to
8520 just return a PTRMEM_CST if there's an explicit cast; that
8521 cast should make the expression an invalid template argument. */
8522 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8524 if (same_type_p (to_type
, pfn_type
))
8526 else if (integer_zerop (n
) && TREE_CODE (pfn
) != CONSTRUCTOR
)
8527 return build_reinterpret_cast (to_type
, pfn
,
8531 if (TREE_SIDE_EFFECTS (pfn
))
8532 pfn
= save_expr (pfn
);
8534 /* Obtain the function pointer and the current DELTA. */
8535 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8536 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8539 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8540 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8543 /* Just adjust the DELTA field. */
8544 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8545 (TREE_TYPE (delta
), ptrdiff_type_node
));
8546 if (!integer_zerop (n
))
8548 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8549 n
= cp_build_binary_op (input_location
,
8550 LSHIFT_EXPR
, n
, integer_one_node
,
8552 delta
= cp_build_binary_op (input_location
,
8553 PLUS_EXPR
, delta
, n
, complain
);
8555 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8558 /* Handle null pointer to member function conversions. */
8559 if (null_ptr_cst_p (pfn
))
8561 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8562 return build_ptrmemfunc1 (to_type
,
8567 if (type_unknown_p (pfn
))
8568 return instantiate_type (type
, pfn
, complain
);
8570 fn
= TREE_OPERAND (pfn
, 0);
8571 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8572 /* In a template, we will have preserved the
8574 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8575 return make_ptrmem_cst (to_type
, fn
);
8578 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8581 ??? There is no consistency as to the types returned for the above
8582 values. Some code acts as if it were a sizetype and some as if it were
8583 integer_type_node. */
8586 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8588 tree type
= TREE_TYPE (cst
);
8589 tree fn
= PTRMEM_CST_MEMBER (cst
);
8590 tree ptr_class
, fn_class
;
8592 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8594 /* The class that the function belongs to. */
8595 fn_class
= DECL_CONTEXT (fn
);
8597 /* The class that we're creating a pointer to member of. */
8598 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8600 /* First, calculate the adjustment to the function's class. */
8601 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8602 /*c_cast_p=*/0, tf_warning_or_error
);
8604 if (!DECL_VIRTUAL_P (fn
))
8605 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8606 build_addr_func (fn
, tf_warning_or_error
));
8609 /* If we're dealing with a virtual function, we have to adjust 'this'
8610 again, to point to the base which provides the vtable entry for
8611 fn; the call will do the opposite adjustment. */
8612 tree orig_class
= DECL_CONTEXT (fn
);
8613 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8614 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8615 *delta
, BINFO_OFFSET (binfo
));
8617 /* We set PFN to the vtable offset at which the function can be
8618 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8619 case delta is shifted left, and then incremented). */
8620 *pfn
= DECL_VINDEX (fn
);
8621 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8622 TYPE_SIZE_UNIT (vtable_entry_type
));
8624 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8626 case ptrmemfunc_vbit_in_pfn
:
8627 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8631 case ptrmemfunc_vbit_in_delta
:
8632 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8633 *delta
, integer_one_node
);
8634 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8635 *delta
, integer_one_node
);
8642 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8646 /* Return an expression for PFN from the pointer-to-member function
8650 pfn_from_ptrmemfunc (tree t
)
8652 if (TREE_CODE (t
) == PTRMEM_CST
)
8657 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8662 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8665 /* Return an expression for DELTA from the pointer-to-member function
8669 delta_from_ptrmemfunc (tree t
)
8671 if (TREE_CODE (t
) == PTRMEM_CST
)
8676 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8681 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8684 /* Convert value RHS to type TYPE as preparation for an assignment to
8685 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8686 implicit conversion is. If FNDECL is non-NULL, we are doing the
8687 conversion in order to pass the PARMNUMth argument of FNDECL.
8688 If FNDECL is NULL, we are doing the conversion in function pointer
8689 argument passing, conversion in initialization, etc. */
8692 convert_for_assignment (tree type
, tree rhs
,
8693 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8694 tsubst_flags_t complain
, int flags
)
8697 enum tree_code coder
;
8699 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8700 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8701 rhs
= TREE_OPERAND (rhs
, 0);
8703 /* Handle [dcl.init.list] direct-list-initialization from
8704 single element of enumeration with a fixed underlying type. */
8705 if (is_direct_enum_init (type
, rhs
))
8707 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
8708 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
8710 warning_sentinel
w (warn_useless_cast
);
8711 warning_sentinel
w2 (warn_ignored_qualifiers
);
8712 rhs
= cp_build_c_cast (type
, elt
, complain
);
8715 rhs
= error_mark_node
;
8718 rhstype
= TREE_TYPE (rhs
);
8719 coder
= TREE_CODE (rhstype
);
8721 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8722 && vector_types_convertible_p (type
, rhstype
, true))
8724 rhs
= mark_rvalue_use (rhs
);
8725 return convert (type
, rhs
);
8728 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8729 return error_mark_node
;
8730 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8731 return error_mark_node
;
8733 /* The RHS of an assignment cannot have void type. */
8734 if (coder
== VOID_TYPE
)
8736 if (complain
& tf_error
)
8737 error ("void value not ignored as it ought to be");
8738 return error_mark_node
;
8741 if (c_dialect_objc ())
8745 tree rname
= fndecl
;
8756 selector
= objc_message_selector ();
8758 if (selector
&& parmno
> 1)
8765 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8767 rhs
= mark_rvalue_use (rhs
);
8768 return convert (type
, rhs
);
8774 The expression is implicitly converted (clause _conv_) to the
8775 cv-unqualified type of the left operand.
8777 We allow bad conversions here because by the time we get to this point
8778 we are committed to doing the conversion. If we end up doing a bad
8779 conversion, convert_like will complain. */
8780 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8782 /* When -Wno-pmf-conversions is use, we just silently allow
8783 conversions from pointers-to-members to plain pointers. If
8784 the conversion doesn't work, cp_convert will complain. */
8786 && TYPE_PTR_P (type
)
8787 && TYPE_PTRMEMFUNC_P (rhstype
))
8788 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8791 if (complain
& tf_error
)
8793 /* If the right-hand side has unknown type, then it is an
8794 overloaded function. Call instantiate_type to get error
8796 if (rhstype
== unknown_type_node
)
8798 tree r
= instantiate_type (type
, rhs
, tf_warning_or_error
);
8799 /* -fpermissive might allow this; recurse. */
8801 return convert_for_assignment (type
, r
, errtype
, fndecl
,
8802 parmnum
, complain
, flags
);
8806 error_at (cp_expr_loc_or_loc (rhs
, input_location
),
8807 "cannot convert %qH to %qI",
8809 inform (get_fndecl_argument_location (fndecl
, parmnum
),
8810 " initializing argument %P of %qD", parmnum
, fndecl
);
8815 case ICR_DEFAULT_ARGUMENT
:
8816 error ("cannot convert %qH to %qI in default argument",
8820 error ("cannot convert %qH to %qI in argument passing",
8823 case ICR_CONVERTING
:
8824 error ("cannot convert %qH to %qI",
8828 error ("cannot convert %qH to %qI in initialization",
8832 error ("cannot convert %qH to %qI in return",
8836 error ("cannot convert %qH to %qI in assignment",
8842 if (TYPE_PTR_P (rhstype
)
8843 && TYPE_PTR_P (type
)
8844 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8845 && CLASS_TYPE_P (TREE_TYPE (type
))
8846 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8847 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8848 (TREE_TYPE (rhstype
))),
8849 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8851 return error_mark_node
;
8854 if (warn_suggest_attribute_format
)
8856 const enum tree_code codel
= TREE_CODE (type
);
8857 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8859 && check_missing_format_attribute (type
, rhstype
)
8860 && (complain
& tf_warning
))
8864 case ICR_DEFAULT_ARGUMENT
:
8866 warning (OPT_Wsuggest_attribute_format
,
8867 "parameter %qP of %qD might be a candidate "
8868 "for a format attribute", parmnum
, fndecl
);
8870 warning (OPT_Wsuggest_attribute_format
,
8871 "parameter might be a candidate "
8872 "for a format attribute");
8874 case ICR_CONVERTING
:
8875 warning (OPT_Wsuggest_attribute_format
,
8876 "target of conversion might be a candidate "
8877 "for a format attribute");
8880 warning (OPT_Wsuggest_attribute_format
,
8881 "target of initialization might be a candidate "
8882 "for a format attribute");
8885 warning (OPT_Wsuggest_attribute_format
,
8886 "return type might be a candidate "
8887 "for a format attribute");
8890 warning (OPT_Wsuggest_attribute_format
,
8891 "left-hand side of assignment might be a candidate "
8892 "for a format attribute");
8899 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8901 if (warn_parentheses
8902 && TREE_CODE (type
) == BOOLEAN_TYPE
8903 && TREE_CODE (rhs
) == MODIFY_EXPR
8904 && !TREE_NO_WARNING (rhs
)
8905 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8906 && (complain
& tf_warning
))
8908 location_t loc
= cp_expr_loc_or_loc (rhs
, input_location
);
8910 warning_at (loc
, OPT_Wparentheses
,
8911 "suggest parentheses around assignment used as truth value");
8912 TREE_NO_WARNING (rhs
) = 1;
8915 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8919 /* Convert RHS to be of type TYPE.
8920 If EXP is nonzero, it is the target of the initialization.
8921 ERRTYPE indicates what kind of error the implicit conversion is.
8923 Two major differences between the behavior of
8924 `convert_for_assignment' and `convert_for_initialization'
8925 are that references are bashed in the former, while
8926 copied in the latter, and aggregates are assigned in
8927 the former (operator=) while initialized in the
8930 If using constructor make sure no conversion operator exists, if one does
8931 exist, an ambiguity exists. */
8934 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8935 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8936 tsubst_flags_t complain
)
8938 enum tree_code codel
= TREE_CODE (type
);
8940 enum tree_code coder
;
8942 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8943 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8944 if (TREE_CODE (rhs
) == NOP_EXPR
8945 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8946 && codel
!= REFERENCE_TYPE
)
8947 rhs
= TREE_OPERAND (rhs
, 0);
8949 if (type
== error_mark_node
8950 || rhs
== error_mark_node
8951 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8952 return error_mark_node
;
8954 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8956 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8957 && TREE_CODE (type
) != ARRAY_TYPE
8958 && (!TYPE_REF_P (type
)
8959 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8960 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8961 && !TYPE_REFFN_P (type
))
8962 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8963 rhs
= decay_conversion (rhs
, complain
);
8965 rhstype
= TREE_TYPE (rhs
);
8966 coder
= TREE_CODE (rhstype
);
8968 if (coder
== ERROR_MARK
)
8969 return error_mark_node
;
8971 /* We accept references to incomplete types, so we can
8972 return here before checking if RHS is of complete type. */
8974 if (codel
== REFERENCE_TYPE
)
8976 /* This should eventually happen in convert_arguments. */
8977 int savew
= 0, savee
= 0;
8980 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8981 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8984 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8985 inform (DECL_SOURCE_LOCATION (fndecl
),
8986 "in passing argument %P of %qD", parmnum
, fndecl
);
8992 exp
= require_complete_type_sfinae (exp
, complain
);
8993 if (exp
== error_mark_node
)
8994 return error_mark_node
;
8996 rhstype
= non_reference (rhstype
);
8998 type
= complete_type (type
);
9000 if (DIRECT_INIT_EXPR_P (type
, rhs
))
9001 /* Don't try to do copy-initialization if we already have
9002 direct-initialization. */
9005 if (MAYBE_CLASS_TYPE_P (type
))
9006 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
9008 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
9012 /* If RETVAL is the address of, or a reference to, a local variable or
9013 temporary give an appropriate warning and return true. */
9016 maybe_warn_about_returning_address_of_local (tree retval
)
9018 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
9019 tree whats_returned
= fold_for_warn (retval
);
9020 location_t loc
= cp_expr_loc_or_loc (retval
, input_location
);
9024 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
9025 whats_returned
= TREE_OPERAND (whats_returned
, 1);
9026 else if (CONVERT_EXPR_P (whats_returned
)
9027 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
9028 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9033 if (TREE_CODE (whats_returned
) == TARGET_EXPR
9034 && is_std_init_list (TREE_TYPE (whats_returned
)))
9036 tree init
= TARGET_EXPR_INITIAL (whats_returned
);
9037 if (TREE_CODE (init
) == CONSTRUCTOR
)
9038 /* Pull out the array address. */
9039 whats_returned
= CONSTRUCTOR_ELT (init
, 0)->value
;
9040 else if (TREE_CODE (init
) == INDIRECT_REF
)
9041 /* The source of a trivial copy looks like *(T*)&var. */
9042 whats_returned
= TREE_OPERAND (init
, 0);
9045 STRIP_NOPS (whats_returned
);
9048 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
9050 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9052 while (TREE_CODE (whats_returned
) == COMPONENT_REF
9053 || TREE_CODE (whats_returned
) == ARRAY_REF
)
9054 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9056 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
9057 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
9059 if (TYPE_REF_P (valtype
))
9060 warning_at (loc
, OPT_Wreturn_local_addr
,
9061 "returning reference to temporary");
9062 else if (is_std_init_list (valtype
))
9063 warning_at (loc
, OPT_Winit_list_lifetime
,
9064 "returning temporary initializer_list does not extend "
9065 "the lifetime of the underlying array");
9069 if (DECL_P (whats_returned
)
9070 && DECL_NAME (whats_returned
)
9071 && DECL_FUNCTION_SCOPE_P (whats_returned
)
9072 && !is_capture_proxy (whats_returned
)
9073 && !(TREE_STATIC (whats_returned
)
9074 || TREE_PUBLIC (whats_returned
)))
9077 if (TYPE_REF_P (valtype
))
9078 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
9079 "reference to local variable %qD returned",
9081 else if (is_std_init_list (valtype
))
9082 w
= warning_at (loc
, OPT_Winit_list_lifetime
,
9083 "returning local initializer_list variable %qD "
9084 "does not extend the lifetime of the underlying array",
9086 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
9087 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
9088 "address of label %qD returned",
9091 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
9092 "address of local variable %qD returned",
9095 inform (DECL_SOURCE_LOCATION (whats_returned
),
9103 /* Check that returning RETVAL from the current function is valid.
9104 Return an expression explicitly showing all conversions required to
9105 change RETVAL into the function return type, and to assign it to
9106 the DECL_RESULT for the function. Set *NO_WARNING to true if
9107 code reaches end of non-void function warning shouldn't be issued
9108 on this RETURN_EXPR. */
9111 check_return_expr (tree retval
, bool *no_warning
)
9114 /* The type actually returned by the function. */
9116 /* The type the function is declared to return, or void if
9117 the declared type is incomplete. */
9119 int fn_returns_value_p
;
9120 bool named_return_value_okay_p
;
9122 *no_warning
= false;
9124 /* A `volatile' function is one that isn't supposed to return, ever.
9125 (This is a G++ extension, used to get better code for functions
9126 that call the `volatile' function.) */
9127 if (TREE_THIS_VOLATILE (current_function_decl
))
9128 warning (0, "function declared %<noreturn%> has a %<return%> statement");
9130 /* Check for various simple errors. */
9131 if (DECL_DESTRUCTOR_P (current_function_decl
))
9134 error ("returning a value from a destructor");
9137 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
9139 if (in_function_try_handler
)
9140 /* If a return statement appears in a handler of the
9141 function-try-block of a constructor, the program is ill-formed. */
9142 error ("cannot return from a handler of a function-try-block of a constructor");
9144 /* You can't return a value from a constructor. */
9145 error ("returning a value from a constructor");
9149 const tree saved_retval
= retval
;
9151 if (processing_template_decl
)
9153 current_function_returns_value
= 1;
9155 if (check_for_bare_parameter_packs (retval
))
9156 return error_mark_node
;
9158 /* If one of the types might be void, we can't tell whether we're
9159 returning a value. */
9160 if ((WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
9161 && !current_function_auto_return_pattern
)
9162 || (retval
!= NULL_TREE
9163 && (TREE_TYPE (retval
) == NULL_TREE
9164 || WILDCARD_TYPE_P (TREE_TYPE (retval
)))))
9168 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
9170 /* Deduce auto return type from a return statement. */
9171 if (current_function_auto_return_pattern
)
9176 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
9178 /* Give a helpful error message. */
9179 error ("return-statement with no value, in function returning %qT",
9180 current_function_auto_return_pattern
);
9181 inform (input_location
, "only plain %<auto%> return type can be "
9182 "deduced to %<void%>");
9183 type
= error_mark_node
;
9185 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
9187 error ("returning initializer list");
9188 type
= error_mark_node
;
9194 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
9195 type
= do_auto_deduction (current_function_auto_return_pattern
,
9199 if (type
== error_mark_node
)
9201 else if (functype
== current_function_auto_return_pattern
)
9202 apply_deduced_return_type (current_function_decl
, type
);
9203 else if (!same_type_p (type
, functype
))
9205 if (LAMBDA_FUNCTION_P (current_function_decl
))
9206 error ("inconsistent types %qT and %qT deduced for "
9207 "lambda return type", functype
, type
);
9209 error ("inconsistent deduction for auto return type: "
9210 "%qT and then %qT", functype
, type
);
9215 result
= DECL_RESULT (current_function_decl
);
9216 valtype
= TREE_TYPE (result
);
9217 gcc_assert (valtype
!= NULL_TREE
);
9218 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
9220 /* Check for a return statement with no return value in a function
9221 that's supposed to return a value. */
9222 if (!retval
&& fn_returns_value_p
)
9224 if (functype
!= error_mark_node
)
9225 permerror (input_location
, "return-statement with no value, in "
9226 "function returning %qT", valtype
);
9227 /* Remember that this function did return. */
9228 current_function_returns_value
= 1;
9229 /* And signal caller that TREE_NO_WARNING should be set on the
9230 RETURN_EXPR to avoid control reaches end of non-void function
9231 warnings in tree-cfg.c. */
9234 /* Check for a return statement with a value in a function that
9235 isn't supposed to return a value. */
9236 else if (retval
&& !fn_returns_value_p
)
9238 if (VOID_TYPE_P (TREE_TYPE (retval
)))
9239 /* You can return a `void' value from a function of `void'
9240 type. In that case, we have to evaluate the expression for
9241 its side-effects. */
9242 finish_expr_stmt (retval
);
9244 permerror (input_location
,
9245 "return-statement with a value, in function "
9246 "returning %qT", valtype
);
9247 current_function_returns_null
= 1;
9249 /* There's really no value to return, after all. */
9253 /* Remember that this function can sometimes return without a
9255 current_function_returns_null
= 1;
9257 /* Remember that this function did return a value. */
9258 current_function_returns_value
= 1;
9260 /* Check for erroneous operands -- but after giving ourselves a
9261 chance to provide an error about returning a value from a void
9263 if (error_operand_p (retval
))
9265 current_function_return_value
= error_mark_node
;
9266 return error_mark_node
;
9269 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
9270 if (IDENTIFIER_NEW_OP_P (DECL_NAME (current_function_decl
))
9271 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
9273 && retval
&& null_ptr_cst_p (retval
))
9274 warning (0, "%<operator new%> must not return NULL unless it is "
9275 "declared %<throw()%> (or -fcheck-new is in effect)");
9277 /* Effective C++ rule 15. See also start_function. */
9279 && DECL_NAME (current_function_decl
) == assign_op_identifier
9280 && !type_dependent_expression_p (retval
))
9284 /* The function return type must be a reference to the current
9286 if (TYPE_REF_P (valtype
)
9287 && same_type_ignoring_top_level_qualifiers_p
9288 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
9290 /* Returning '*this' is obviously OK. */
9291 if (retval
== current_class_ref
)
9293 /* If we are calling a function whose return type is the same of
9294 the current class reference, it is ok. */
9295 else if (INDIRECT_REF_P (retval
)
9296 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
9301 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
9304 if (dependent_type_p (functype
)
9305 || type_dependent_expression_p (retval
))
9308 /* We should not have changed the return value. */
9309 gcc_assert (retval
== saved_retval
);
9313 /* The fabled Named Return Value optimization, as per [class.copy]/15:
9315 [...] For a function with a class return type, if the expression
9316 in the return statement is the name of a local object, and the cv-
9317 unqualified type of the local object is the same as the function
9318 return type, an implementation is permitted to omit creating the tem-
9319 porary object to hold the function return value [...]
9321 So, if this is a value-returning function that always returns the same
9322 local variable, remember it.
9324 It might be nice to be more flexible, and choose the first suitable
9325 variable even if the function sometimes returns something else, but
9326 then we run the risk of clobbering the variable we chose if the other
9327 returned expression uses the chosen variable somehow. And people expect
9328 this restriction, anyway. (jason 2000-11-19)
9330 See finish_function and finalize_nrv for the rest of this optimization. */
9332 named_return_value_okay_p
=
9333 (retval
!= NULL_TREE
9334 && !processing_template_decl
9335 /* Must be a local, automatic variable. */
9337 && DECL_CONTEXT (retval
) == current_function_decl
9338 && ! TREE_STATIC (retval
)
9339 /* And not a lambda or anonymous union proxy. */
9340 && !DECL_HAS_VALUE_EXPR_P (retval
)
9341 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
9342 /* The cv-unqualified type of the returned value must be the
9343 same as the cv-unqualified return type of the
9345 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
9346 (TYPE_MAIN_VARIANT (functype
)))
9347 /* And the returned value must be non-volatile. */
9348 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
9350 if (fn_returns_value_p
&& flag_elide_constructors
)
9352 if (named_return_value_okay_p
9353 && (current_function_return_value
== NULL_TREE
9354 || current_function_return_value
== retval
))
9355 current_function_return_value
= retval
;
9357 current_function_return_value
= error_mark_node
;
9360 /* We don't need to do any conversions when there's nothing being
9365 /* Do any required conversions. */
9366 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
9367 /* No conversions are required. */
9371 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
9373 /* The functype's return type will have been set to void, if it
9374 was an incomplete type. Just treat this as 'return;' */
9375 if (VOID_TYPE_P (functype
))
9376 return error_mark_node
;
9378 /* If we had an id-expression obfuscated by force_paren_expr, we need
9379 to undo it so we can try to treat it as an rvalue below. */
9380 retval
= maybe_undo_parenthesized_ref (retval
);
9382 if (processing_template_decl
)
9383 retval
= build_non_dependent_expr (retval
);
9385 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
9386 treated as an rvalue for the purposes of overload resolution to
9387 favor move constructors over copy constructors.
9389 Note that these conditions are similar to, but not as strict as,
9390 the conditions for the named return value optimization. */
9391 bool converted
= false;
9392 if ((cxx_dialect
!= cxx98
)
9393 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
9394 || TREE_CODE (retval
) == PARM_DECL
)
9395 && DECL_CONTEXT (retval
) == current_function_decl
9396 && !TREE_STATIC (retval
)
9397 /* This is only interesting for class type. */
9398 && CLASS_TYPE_P (functype
))
9400 tree moved
= move (retval
);
9401 moved
= convert_for_initialization
9402 (NULL_TREE
, functype
, moved
, flags
|LOOKUP_PREFER_RVALUE
,
9403 ICR_RETURN
, NULL_TREE
, 0, tf_none
);
9404 if (moved
!= error_mark_node
)
9411 /* First convert the value to the function's return type, then
9412 to the type of return value's location to handle the
9413 case that functype is smaller than the valtype. */
9415 retval
= convert_for_initialization
9416 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
9417 tf_warning_or_error
);
9418 retval
= convert (valtype
, retval
);
9420 /* If the conversion failed, treat this just like `return;'. */
9421 if (retval
== error_mark_node
)
9423 /* We can't initialize a register from a AGGR_INIT_EXPR. */
9424 else if (! cfun
->returns_struct
9425 && TREE_CODE (retval
) == TARGET_EXPR
9426 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
9427 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9428 TREE_OPERAND (retval
, 0));
9429 else if (!processing_template_decl
9430 && maybe_warn_about_returning_address_of_local (retval
)
9431 && INDIRECT_TYPE_P (valtype
))
9432 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9433 build_zero_cst (TREE_TYPE (retval
)));
9436 if (processing_template_decl
)
9437 return saved_retval
;
9439 /* Actually copy the value returned into the appropriate location. */
9440 if (retval
&& retval
!= result
)
9441 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
9447 /* Returns nonzero if the pointer-type FROM can be converted to the
9448 pointer-type TO via a qualification conversion. If CONSTP is -1,
9449 then we return nonzero if the pointers are similar, and the
9450 cv-qualification signature of FROM is a proper subset of that of TO.
9452 If CONSTP is positive, then all outer pointers have been
9456 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
9458 bool to_more_cv_qualified
= false;
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 /* Const and volatile mean something different for function types,
9472 so the usual checks are not appropriate. */
9473 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
9475 if (!at_least_as_qualified_p (to
, from
))
9478 if (!at_least_as_qualified_p (from
, to
))
9482 to_more_cv_qualified
= true;
9486 constp
&= TYPE_READONLY (to
);
9489 if (VECTOR_TYPE_P (to
))
9490 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9492 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9493 return ((constp
>= 0 || to_more_cv_qualified
)
9494 && (is_opaque_pointer
9495 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9499 /* When comparing, say, char ** to char const **, this function takes
9500 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9501 types to this function. */
9504 comp_ptr_ttypes (tree to
, tree from
)
9506 return comp_ptr_ttypes_real (to
, from
, 1);
9509 /* Returns true iff FNTYPE is a non-class type that involves
9510 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9511 if a parameter type is ill-formed. */
9514 error_type_p (const_tree type
)
9518 switch (TREE_CODE (type
))
9524 case REFERENCE_TYPE
:
9526 return error_type_p (TREE_TYPE (type
));
9530 if (error_type_p (TREE_TYPE (type
)))
9532 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9533 if (error_type_p (TREE_VALUE (t
)))
9538 if (TYPE_PTRMEMFUNC_P (type
))
9539 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9547 /* Returns true if to and from are (possibly multi-level) pointers to the same
9548 type or inheritance-related types, regardless of cv-quals. */
9551 ptr_reasonably_similar (const_tree to
, const_tree from
)
9553 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9555 /* Any target type is similar enough to void. */
9556 if (VOID_TYPE_P (to
))
9557 return !error_type_p (from
);
9558 if (VOID_TYPE_P (from
))
9559 return !error_type_p (to
);
9561 if (TREE_CODE (to
) != TREE_CODE (from
))
9564 if (TREE_CODE (from
) == OFFSET_TYPE
9565 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9566 TYPE_OFFSET_BASETYPE (from
),
9567 COMPARE_BASE
| COMPARE_DERIVED
))
9570 if (VECTOR_TYPE_P (to
)
9571 && vector_types_convertible_p (to
, from
, false))
9574 if (TREE_CODE (to
) == INTEGER_TYPE
9575 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9578 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9579 return !error_type_p (to
) && !error_type_p (from
);
9581 if (!TYPE_PTR_P (to
))
9583 /* When either type is incomplete avoid DERIVED_FROM_P,
9584 which may call complete_type (c++/57942). */
9585 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9587 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9588 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9593 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9594 pointer-to-member types) are the same, ignoring cv-qualification at
9598 comp_ptr_ttypes_const (tree to
, tree from
)
9600 bool is_opaque_pointer
= false;
9602 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9604 if (TREE_CODE (to
) != TREE_CODE (from
))
9607 if (TREE_CODE (from
) == OFFSET_TYPE
9608 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9609 TYPE_OFFSET_BASETYPE (to
)))
9612 if (VECTOR_TYPE_P (to
))
9613 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9615 if (!TYPE_PTR_P (to
))
9616 return (is_opaque_pointer
9617 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9621 /* Returns the type qualifiers for this type, including the qualifiers on the
9622 elements for an array type. */
9625 cp_type_quals (const_tree type
)
9628 /* This CONST_CAST is okay because strip_array_types returns its
9629 argument unmodified and we assign it to a const_tree. */
9630 type
= strip_array_types (CONST_CAST_TREE (type
));
9631 if (type
== error_mark_node
9632 /* Quals on a FUNCTION_TYPE are memfn quals. */
9633 || TREE_CODE (type
) == FUNCTION_TYPE
)
9634 return TYPE_UNQUALIFIED
;
9635 quals
= TYPE_QUALS (type
);
9636 /* METHOD and REFERENCE_TYPEs should never have quals. */
9637 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9638 && !TYPE_REF_P (type
))
9639 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9640 == TYPE_UNQUALIFIED
));
9644 /* Returns the function-ref-qualifier for TYPE */
9647 type_memfn_rqual (const_tree type
)
9649 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9650 || TREE_CODE (type
) == METHOD_TYPE
);
9652 if (!FUNCTION_REF_QUALIFIED (type
))
9653 return REF_QUAL_NONE
;
9654 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9655 return REF_QUAL_RVALUE
;
9657 return REF_QUAL_LVALUE
;
9660 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9664 type_memfn_quals (const_tree type
)
9666 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9667 return TYPE_QUALS (type
);
9668 else if (TREE_CODE (type
) == METHOD_TYPE
)
9669 return cp_type_quals (class_of_this_parm (type
));
9674 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9675 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9678 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9680 /* Could handle METHOD_TYPE here if necessary. */
9681 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9682 if (TYPE_QUALS (type
) == memfn_quals
9683 && type_memfn_rqual (type
) == rqual
)
9686 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9688 tree result
= build_qualified_type (type
, memfn_quals
);
9689 return build_ref_qualified_type (result
, rqual
);
9692 /* Returns nonzero if TYPE is const or volatile. */
9695 cv_qualified_p (const_tree type
)
9697 int quals
= cp_type_quals (type
);
9698 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9701 /* Returns nonzero if the TYPE contains a mutable member. */
9704 cp_has_mutable_p (const_tree type
)
9706 /* This CONST_CAST is okay because strip_array_types returns its
9707 argument unmodified and we assign it to a const_tree. */
9708 type
= strip_array_types (CONST_CAST_TREE(type
));
9710 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9713 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9714 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9715 approximation. In particular, consider:
9718 struct S { int i; };
9719 const S s = { f(); }
9721 Here, we will make "s" as TREE_READONLY (because it is declared
9722 "const") -- only to reverse ourselves upon seeing that the
9723 initializer is non-constant. */
9726 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9728 tree type
= TREE_TYPE (decl
);
9730 if (type
== error_mark_node
)
9733 if (TREE_CODE (decl
) == TYPE_DECL
)
9736 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9737 && type_quals
!= TYPE_UNQUALIFIED
));
9739 /* Avoid setting TREE_READONLY incorrectly. */
9740 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9741 constructor can produce constant init, so rely on cp_finish_decl to
9742 clear TREE_READONLY if the variable has non-constant init. */
9744 /* If the type has (or might have) a mutable component, that component
9745 might be modified. */
9746 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9747 type_quals
&= ~TYPE_QUAL_CONST
;
9749 c_apply_type_quals_to_decl (type_quals
, decl
);
9752 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9753 exemplar types such that casting T1 to T2 is casting away constness
9754 if and only if there is no implicit conversion from T1 to T2. */
9757 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9762 /* [expr.const.cast]
9764 For multi-level pointer to members and multi-level mixed pointers
9765 and pointers to members (conv.qual), the "member" aspect of a
9766 pointer to member level is ignored when determining if a const
9767 cv-qualifier has been cast away. */
9768 /* [expr.const.cast]
9770 For two pointer types:
9772 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9773 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9776 casting from X1 to X2 casts away constness if, for a non-pointer
9777 type T there does not exist an implicit conversion (clause
9780 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9784 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9785 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9786 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9788 *t1
= cp_build_qualified_type (void_type_node
,
9789 cp_type_quals (*t1
));
9790 *t2
= cp_build_qualified_type (void_type_node
,
9791 cp_type_quals (*t2
));
9795 quals1
= cp_type_quals (*t1
);
9796 quals2
= cp_type_quals (*t2
);
9798 if (TYPE_PTRDATAMEM_P (*t1
))
9799 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9801 *t1
= TREE_TYPE (*t1
);
9802 if (TYPE_PTRDATAMEM_P (*t2
))
9803 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9805 *t2
= TREE_TYPE (*t2
);
9807 casts_away_constness_r (t1
, t2
, complain
);
9808 *t1
= build_pointer_type (*t1
);
9809 *t2
= build_pointer_type (*t2
);
9810 *t1
= cp_build_qualified_type (*t1
, quals1
);
9811 *t2
= cp_build_qualified_type (*t2
, quals2
);
9814 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9817 ??? This function returns non-zero if casting away qualifiers not
9818 just const. We would like to return to the caller exactly which
9819 qualifiers are casted away to give more accurate diagnostics.
9823 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9825 if (TYPE_REF_P (t2
))
9827 /* [expr.const.cast]
9829 Casting from an lvalue of type T1 to an lvalue of type T2
9830 using a reference cast casts away constness if a cast from an
9831 rvalue of type "pointer to T1" to the type "pointer to T2"
9832 casts away constness. */
9833 t1
= (TYPE_REF_P (t1
) ? TREE_TYPE (t1
) : t1
);
9834 return casts_away_constness (build_pointer_type (t1
),
9835 build_pointer_type (TREE_TYPE (t2
)),
9839 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9840 /* [expr.const.cast]
9842 Casting from an rvalue of type "pointer to data member of X
9843 of type T1" to the type "pointer to data member of Y of type
9844 T2" casts away constness if a cast from an rvalue of type
9845 "pointer to T1" to the type "pointer to T2" casts away
9847 return casts_away_constness
9848 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9849 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9852 /* Casting away constness is only something that makes sense for
9853 pointer or reference types. */
9854 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9857 /* Top-level qualifiers don't matter. */
9858 t1
= TYPE_MAIN_VARIANT (t1
);
9859 t2
= TYPE_MAIN_VARIANT (t2
);
9860 casts_away_constness_r (&t1
, &t2
, complain
);
9861 if (!can_convert (t2
, t1
, complain
))
9867 /* If T is a REFERENCE_TYPE return the type to which T refers.
9868 Otherwise, return T itself. */
9871 non_reference (tree t
)
9873 if (t
&& TYPE_REF_P (t
))
9879 /* Return nonzero if REF is an lvalue valid for this language;
9880 otherwise, print an error message and return zero. USE says
9881 how the lvalue is being used and so selects the error message. */
9884 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9886 cp_lvalue_kind kind
= lvalue_kind (ref
);
9888 if (kind
== clk_none
)
9890 if (complain
& tf_error
)
9891 lvalue_error (input_location
, use
);
9894 else if (kind
& (clk_rvalueref
|clk_class
))
9896 if (!(complain
& tf_error
))
9898 /* Make this a permerror because we used to accept it. */
9899 permerror (input_location
, "using rvalue as lvalue");
9904 /* Return true if a user-defined literal operator is a raw operator. */
9907 check_raw_literal_operator (const_tree decl
)
9909 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9912 bool maybe_raw_p
= false;
9914 /* Count the number and type of arguments and check for ellipsis. */
9915 for (argtype
= argtypes
, arity
= 0;
9916 argtype
&& argtype
!= void_list_node
;
9917 ++arity
, argtype
= TREE_CHAIN (argtype
))
9919 tree t
= TREE_VALUE (argtype
);
9921 if (same_type_p (t
, const_string_type_node
))
9925 return false; /* Found ellipsis. */
9927 if (!maybe_raw_p
|| arity
!= 1)
9934 /* Return true if a user-defined literal operator has one of the allowed
9938 check_literal_operator_args (const_tree decl
,
9939 bool *long_long_unsigned_p
, bool *long_double_p
)
9941 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9943 *long_long_unsigned_p
= false;
9944 *long_double_p
= false;
9945 if (processing_template_decl
|| processing_specialization
)
9946 return argtypes
== void_list_node
;
9953 /* Count the number and type of arguments and check for ellipsis. */
9954 for (argtype
= argtypes
, arity
= 0;
9955 argtype
&& argtype
!= void_list_node
;
9956 argtype
= TREE_CHAIN (argtype
))
9958 tree t
= TREE_VALUE (argtype
);
9963 bool maybe_raw_p
= false;
9965 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9967 t
= TYPE_MAIN_VARIANT (t
);
9968 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9969 || same_type_p (t
, wchar_type_node
)
9970 || same_type_p (t
, char16_type_node
)
9971 || same_type_p (t
, char32_type_node
))
9973 argtype
= TREE_CHAIN (argtype
);
9976 t
= TREE_VALUE (argtype
);
9977 if (maybe_raw_p
&& argtype
== void_list_node
)
9979 else if (same_type_p (t
, size_type_node
))
9988 else if (same_type_p (t
, long_long_unsigned_type_node
))
9991 *long_long_unsigned_p
= true;
9993 else if (same_type_p (t
, long_double_type_node
))
9996 *long_double_p
= true;
9998 else if (same_type_p (t
, char_type_node
))
10000 else if (same_type_p (t
, wchar_type_node
))
10002 else if (same_type_p (t
, char16_type_node
))
10004 else if (same_type_p (t
, char32_type_node
))
10010 return false; /* Found ellipsis. */
10012 if (arity
!= max_arity
)
10019 /* Always returns false since unlike C90, C++ has no concept of implicit
10020 function declarations. */
10023 c_decl_implicit (const_tree
)