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 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
836 /* Save space: see if the result is identical to one of the args. */
837 if (valtype
== TREE_TYPE (t1
) && ! p2
)
838 return cp_build_type_attribute_variant (t1
, attributes
);
839 if (valtype
== TREE_TYPE (t2
) && ! p1
)
840 return cp_build_type_attribute_variant (t2
, attributes
);
842 /* Simple way if one arg fails to specify argument types. */
843 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
845 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
848 parms
= commonparms (p1
, p2
);
850 rval
= build_function_type (valtype
, parms
);
851 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
852 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
853 rval
= apply_memfn_quals (rval
,
854 type_memfn_quals (t1
),
855 type_memfn_rqual (t1
));
856 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
857 TYPE_RAISES_EXCEPTIONS (t2
));
858 t1
= build_exception_variant (rval
, raises
);
859 if (late_return_type_p
)
860 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
866 /* Get this value the long way, since TYPE_METHOD_BASETYPE
867 is just the main variant of this. */
868 tree basetype
= class_of_this_parm (t2
);
869 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
870 TYPE_RAISES_EXCEPTIONS (t2
));
871 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
873 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
874 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
876 /* If this was a member function type, get back to the
877 original type of type member function (i.e., without
878 the class instance variable up front. */
879 t1
= build_function_type (TREE_TYPE (t1
),
880 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
881 t2
= build_function_type (TREE_TYPE (t2
),
882 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
883 t3
= merge_types (t1
, t2
);
884 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
885 TYPE_ARG_TYPES (t3
));
886 t1
= build_exception_variant (t3
, raises
);
887 t1
= build_ref_qualified_type (t1
, rqual
);
888 if (late_return_type_1_p
)
889 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
890 if (late_return_type_2_p
)
891 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
896 /* There is no need to merge attributes into a TYPENAME_TYPE.
897 When the type is instantiated it will have whatever
898 attributes result from the instantiation. */
904 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
906 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
909 return cp_build_type_attribute_variant (t1
, attributes
);
912 /* Return the ARRAY_TYPE type without its domain. */
915 strip_array_domain (tree type
)
918 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
919 if (TYPE_DOMAIN (type
) == NULL_TREE
)
921 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
922 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
925 /* Wrapper around cp_common_type that is used by c-common.c and other
926 front end optimizations that remove promotions.
928 Return the common type for two arithmetic types T1 and T2 under the
929 usual arithmetic conversions. The default conversions have already
930 been applied, and enumerated types converted to their compatible
934 common_type (tree t1
, tree t2
)
936 /* If one type is nonsense, use the other */
937 if (t1
== error_mark_node
)
939 if (t2
== error_mark_node
)
942 return cp_common_type (t1
, t2
);
945 /* Return the common type of two pointer types T1 and T2. This is the
946 type for the result of most arithmetic operations if the operands
947 have the given two types.
949 We assume that comp_target_types has already been done and returned
950 nonzero; if that isn't so, this may crash. */
953 common_pointer_type (tree t1
, tree t2
)
955 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
956 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
957 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
959 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
960 CPO_CONVERSION
, tf_warning_or_error
);
963 /* Compare two exception specifier types for exactness or subsetness, if
964 allowed. Returns false for mismatch, true for match (same, or
967 [except.spec] "If a class X ... objects of class X or any class publicly
968 and unambiguously derived from X. Similarly, if a pointer type Y * ...
969 exceptions of type Y * or that are pointers to any type publicly and
970 unambiguously derived from Y. Otherwise a function only allows exceptions
971 that have the same type ..."
972 This does not mention cv qualifiers and is different to what throw
973 [except.throw] and catch [except.catch] will do. They will ignore the
974 top level cv qualifiers, and allow qualifiers in the pointer to class
977 We implement the letter of the standard. */
980 comp_except_types (tree a
, tree b
, bool exact
)
982 if (same_type_p (a
, b
))
986 if (cp_type_quals (a
) || cp_type_quals (b
))
989 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
993 if (cp_type_quals (a
) || cp_type_quals (b
))
997 if (TREE_CODE (a
) != RECORD_TYPE
998 || TREE_CODE (b
) != RECORD_TYPE
)
1001 if (publicly_uniquely_derived_p (a
, b
))
1007 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1008 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1009 If EXACT is ce_type, the C++17 type compatibility rules apply.
1010 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1011 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1012 are unordered, but we've already filtered out duplicates. Most lists will
1013 be in order, we should try to make use of that. */
1016 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1025 /* First handle noexcept. */
1026 if (exact
< ce_exact
)
1028 if (exact
== ce_type
1029 && (canonical_eh_spec (CONST_CAST_TREE (t1
))
1030 == canonical_eh_spec (CONST_CAST_TREE (t2
))))
1033 /* noexcept(false) is compatible with no exception-specification,
1034 and less strict than any spec. */
1035 if (t1
== noexcept_false_spec
)
1036 return t2
== NULL_TREE
|| exact
== ce_derived
;
1037 /* Even a derived noexcept(false) is compatible with no
1038 exception-specification. */
1039 if (t2
== noexcept_false_spec
)
1040 return t1
== NULL_TREE
;
1042 /* Otherwise, if we aren't looking for an exact match, noexcept is
1043 equivalent to throw(). */
1044 if (t1
== noexcept_true_spec
)
1045 t1
= empty_except_spec
;
1046 if (t2
== noexcept_true_spec
)
1047 t2
= empty_except_spec
;
1050 /* If any noexcept is left, it is only comparable to itself;
1051 either we're looking for an exact match or we're redeclaring a
1052 template with dependent noexcept. */
1053 if ((t1
&& TREE_PURPOSE (t1
))
1054 || (t2
&& TREE_PURPOSE (t2
)))
1056 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1058 if (t1
== NULL_TREE
) /* T1 is ... */
1059 return t2
== NULL_TREE
|| exact
== ce_derived
;
1060 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1061 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1062 if (t2
== NULL_TREE
) /* T2 is ... */
1064 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1065 return exact
== ce_derived
;
1067 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1068 Count how many we find, to determine exactness. For exact matching and
1069 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1071 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1073 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1075 tree a
= TREE_VALUE (probe
);
1076 tree b
= TREE_VALUE (t2
);
1078 if (comp_except_types (a
, b
, exact
))
1080 if (probe
== base
&& exact
> ce_derived
)
1081 base
= TREE_CHAIN (probe
);
1086 if (probe
== NULL_TREE
)
1089 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1092 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1093 [] can match [size]. */
1096 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1105 /* The type of the array elements must be the same. */
1106 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1109 d1
= TYPE_DOMAIN (t1
);
1110 d2
= TYPE_DOMAIN (t2
);
1115 /* If one of the arrays is dimensionless, and the other has a
1116 dimension, they are of different types. However, it is valid to
1124 declarations for an array object can specify
1125 array types that differ by the presence or absence of a major
1126 array bound (_dcl.array_). */
1128 return allow_redeclaration
;
1130 /* Check that the dimensions are the same. */
1132 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1134 max1
= TYPE_MAX_VALUE (d1
);
1135 max2
= TYPE_MAX_VALUE (d2
);
1137 if (!cp_tree_equal (max1
, max2
))
1143 /* Compare the relative position of T1 and T2 into their respective
1144 template parameter list.
1145 T1 and T2 must be template parameter types.
1146 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1149 comp_template_parms_position (tree t1
, tree t2
)
1151 tree index1
, index2
;
1152 gcc_assert (t1
&& t2
1153 && TREE_CODE (t1
) == TREE_CODE (t2
)
1154 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1155 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1156 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1158 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1159 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1161 /* Then compare their relative position. */
1162 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1163 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1164 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1165 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1168 /* In C++14 we can end up comparing 'auto' to a normal template
1169 parameter. Don't confuse them. */
1170 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1171 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1176 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
1179 cxx_safe_arg_type_equiv_p (tree t1
, tree t2
)
1181 t1
= TYPE_MAIN_VARIANT (t1
);
1182 t2
= TYPE_MAIN_VARIANT (t2
);
1184 if (TREE_CODE (t1
) == POINTER_TYPE
1185 && TREE_CODE (t2
) == POINTER_TYPE
)
1188 /* The signedness of the parameter matters only when an integral
1189 type smaller than int is promoted to int, otherwise only the
1190 precision of the parameter matters.
1191 This check should make sure that the callee does not see
1192 undefined values in argument registers. */
1193 if (INTEGRAL_TYPE_P (t1
)
1194 && INTEGRAL_TYPE_P (t2
)
1195 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
)
1196 && (TYPE_UNSIGNED (t1
) == TYPE_UNSIGNED (t2
)
1197 || !targetm
.calls
.promote_prototypes (NULL_TREE
)
1198 || TYPE_PRECISION (t1
) >= TYPE_PRECISION (integer_type_node
)))
1201 return same_type_p (t1
, t2
);
1204 /* Check if a type cast between two function types can be considered safe. */
1207 cxx_safe_function_type_cast_p (tree t1
, tree t2
)
1209 if (TREE_TYPE (t1
) == void_type_node
&&
1210 TYPE_ARG_TYPES (t1
) == void_list_node
)
1213 if (TREE_TYPE (t2
) == void_type_node
&&
1214 TYPE_ARG_TYPES (t2
) == void_list_node
)
1217 if (!cxx_safe_arg_type_equiv_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1220 for (t1
= TYPE_ARG_TYPES (t1
), t2
= TYPE_ARG_TYPES (t2
);
1222 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1223 if (!cxx_safe_arg_type_equiv_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1229 /* Subroutine in comptypes. */
1232 structural_comptypes (tree t1
, tree t2
, int strict
)
1237 /* Suppress errors caused by previously reported errors. */
1238 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1241 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1243 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1244 current instantiation. */
1245 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1246 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1248 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1249 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1251 if (TYPE_PTRMEMFUNC_P (t1
))
1252 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1253 if (TYPE_PTRMEMFUNC_P (t2
))
1254 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1256 /* Different classes of types can't be compatible. */
1257 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1260 /* Qualifiers must match. For array types, we will check when we
1261 recur on the array element types. */
1262 if (TREE_CODE (t1
) != ARRAY_TYPE
1263 && cp_type_quals (t1
) != cp_type_quals (t2
))
1265 if (TREE_CODE (t1
) == FUNCTION_TYPE
1266 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1268 /* Need to check this before TYPE_MAIN_VARIANT.
1269 FIXME function qualifiers should really change the main variant. */
1270 if (TREE_CODE (t1
) == FUNCTION_TYPE
1271 || TREE_CODE (t1
) == METHOD_TYPE
)
1273 if (type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1275 if (flag_noexcept_type
1276 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1
),
1277 TYPE_RAISES_EXCEPTIONS (t2
),
1282 /* Allow for two different type nodes which have essentially the same
1283 definition. Note that we already checked for equality of the type
1284 qualifiers (just above). */
1286 if (TREE_CODE (t1
) != ARRAY_TYPE
1287 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1291 /* Compare the types. Break out if they could be the same. */
1292 switch (TREE_CODE (t1
))
1296 /* All void and bool types are the same. */
1300 case FIXED_POINT_TYPE
:
1302 /* With these nodes, we can't determine type equivalence by
1303 looking at what is stored in the nodes themselves, because
1304 two nodes might have different TYPE_MAIN_VARIANTs but still
1305 represent the same type. For example, wchar_t and int could
1306 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1307 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1308 and are distinct types. On the other hand, int and the
1311 typedef int INT __attribute((may_alias));
1313 have identical properties, different TYPE_MAIN_VARIANTs, but
1314 represent the same type. The canonical type system keeps
1315 track of equivalence in this case, so we fall back on it. */
1316 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1318 case TEMPLATE_TEMPLATE_PARM
:
1319 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1320 if (!comp_template_parms_position (t1
, t2
))
1322 if (!comp_template_parms
1323 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1324 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1326 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1328 /* Don't check inheritance. */
1329 strict
= COMPARE_STRICT
;
1334 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1335 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1336 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1337 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1340 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1342 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1348 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1349 strict
& ~COMPARE_REDECLARATION
))
1351 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1355 case REFERENCE_TYPE
:
1356 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1358 /* fall through to checks for pointer types */
1362 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1363 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1369 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1371 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1376 /* Target types must match incl. qualifiers. */
1377 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1381 case TEMPLATE_TYPE_PARM
:
1382 /* If T1 and T2 don't have the same relative position in their
1383 template parameters set, they can't be equal. */
1384 if (!comp_template_parms_position (t1
, t2
))
1386 /* Constrained 'auto's are distinct from parms that don't have the same
1388 if (!equivalent_placeholder_constraints (t1
, t2
))
1393 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1394 TYPENAME_TYPE_FULLNAME (t2
)))
1396 /* Qualifiers don't matter on scopes. */
1397 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1402 case UNBOUND_CLASS_TEMPLATE
:
1403 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1405 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1410 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1415 if (maybe_ne (TYPE_VECTOR_SUBPARTS (t1
), TYPE_VECTOR_SUBPARTS (t2
))
1416 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1420 case TYPE_PACK_EXPANSION
:
1421 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1422 PACK_EXPANSION_PATTERN (t2
))
1423 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1424 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1427 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1428 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1429 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1430 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1431 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1432 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1433 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1434 DECLTYPE_TYPE_EXPR (t2
)))
1438 case UNDERLYING_TYPE
:
1439 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1440 UNDERLYING_TYPE_TYPE (t2
));
1446 /* If we get here, we know that from a target independent POV the
1447 types are the same. Make sure the target attributes are also
1449 return comp_type_attributes (t1
, t2
);
1452 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1453 is a bitwise-or of the COMPARE_* flags. */
1456 comptypes (tree t1
, tree t2
, int strict
)
1458 if (strict
== COMPARE_STRICT
)
1463 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1466 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1467 /* At least one of the types requires structural equality, so
1468 perform a deep check. */
1469 return structural_comptypes (t1
, t2
, strict
);
1471 if (flag_checking
&& USE_CANONICAL_TYPES
)
1473 bool result
= structural_comptypes (t1
, t2
, strict
);
1475 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1476 /* The two types are structurally equivalent, but their
1477 canonical types were different. This is a failure of the
1478 canonical type propagation code.*/
1480 ("canonical types differ for identical types %qT and %qT",
1482 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1483 /* Two types are structurally different, but the canonical
1484 types are the same. This means we were over-eager in
1485 assigning canonical types. */
1487 ("same canonical type node for different types %qT and %qT",
1492 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1493 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1495 return structural_comptypes (t1
, t2
, strict
);
1497 else if (strict
== COMPARE_STRUCTURAL
)
1498 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1500 return structural_comptypes (t1
, t2
, strict
);
1503 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1504 top-level qualifiers. */
1507 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1509 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1512 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1513 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1514 return same_type_p (type1
, type2
);
1517 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1520 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1522 int q1
= cp_type_quals (type1
);
1523 int q2
= cp_type_quals (type2
);
1525 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1526 return (q1
& q2
) == q2
;
1529 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1530 more cv-qualified that TYPE1, and 0 otherwise. */
1533 comp_cv_qualification (int q1
, int q2
)
1538 if ((q1
& q2
) == q2
)
1540 else if ((q1
& q2
) == q1
)
1547 comp_cv_qualification (const_tree type1
, const_tree type2
)
1549 int q1
= cp_type_quals (type1
);
1550 int q2
= cp_type_quals (type2
);
1551 return comp_cv_qualification (q1
, q2
);
1554 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1555 subset of the cv-qualification signature of TYPE2, and the types
1556 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1559 comp_cv_qual_signature (tree type1
, tree type2
)
1561 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1563 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1569 /* Subroutines of `comptypes'. */
1571 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1572 equivalent in the sense that functions with those parameter types
1573 can have equivalent types. The two lists must be equivalent,
1574 element by element. */
1577 compparms (const_tree parms1
, const_tree parms2
)
1581 /* An unspecified parmlist matches any specified parmlist
1582 whose argument types don't need default promotions. */
1584 for (t1
= parms1
, t2
= parms2
;
1586 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1588 /* If one parmlist is shorter than the other,
1589 they fail to match. */
1592 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1599 /* Process a sizeof or alignof expression where the operand is a
1603 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1608 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1609 if (type
== error_mark_node
)
1610 return error_mark_node
;
1612 type
= non_reference (type
);
1613 if (TREE_CODE (type
) == METHOD_TYPE
)
1616 pedwarn (input_location
, OPT_Wpointer_arith
,
1617 "invalid application of %qs to a member function",
1618 OVL_OP_INFO (false, op
)->name
);
1620 return error_mark_node
;
1621 value
= size_one_node
;
1624 dependent_p
= dependent_type_p (type
);
1626 complete_type (type
);
1628 /* VLA types will have a non-constant size. In the body of an
1629 uninstantiated template, we don't need to try to compute the
1630 value, because the sizeof expression is not an integral
1631 constant expression in that case. And, if we do try to
1632 compute the value, we'll likely end up with SAVE_EXPRs, which
1633 the template substitution machinery does not expect to see. */
1634 || (processing_template_decl
1635 && COMPLETE_TYPE_P (type
)
1636 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1638 value
= build_min (op
, size_type_node
, type
);
1639 TREE_READONLY (value
) = 1;
1643 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1644 op
== SIZEOF_EXPR
, false,
1648 /* Return the size of the type, without producing any warnings for
1649 types whose size cannot be taken. This routine should be used only
1650 in some other routine that has already produced a diagnostic about
1651 using the size of such a type. */
1653 cxx_sizeof_nowarn (tree type
)
1655 if (TREE_CODE (type
) == FUNCTION_TYPE
1656 || VOID_TYPE_P (type
)
1657 || TREE_CODE (type
) == ERROR_MARK
)
1658 return size_one_node
;
1659 else if (!COMPLETE_TYPE_P (type
))
1660 return size_zero_node
;
1662 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1665 /* Process a sizeof expression where the operand is an expression. */
1668 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1670 if (e
== error_mark_node
)
1671 return error_mark_node
;
1673 if (processing_template_decl
)
1675 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1676 TREE_SIDE_EFFECTS (e
) = 0;
1677 TREE_READONLY (e
) = 1;
1682 /* To get the size of a static data member declared as an array of
1683 unknown bound, we need to instantiate it. */
1685 && VAR_HAD_UNKNOWN_BOUND (e
)
1686 && DECL_TEMPLATE_INSTANTIATION (e
))
1687 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1689 if (TREE_CODE (e
) == PARM_DECL
1690 && DECL_ARRAY_PARAMETER_P (e
)
1691 && (complain
& tf_warning
))
1693 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1694 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1695 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1698 e
= mark_type_use (e
);
1702 if (complain
& tf_error
)
1703 error ("invalid application of %<sizeof%> to a bit-field");
1705 return error_mark_node
;
1708 else if (is_overloaded_fn (e
))
1710 if (complain
& tf_error
)
1711 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1714 return error_mark_node
;
1717 else if (type_unknown_p (e
))
1719 if (complain
& tf_error
)
1720 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1722 return error_mark_node
;
1728 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1731 /* Implement the __alignof keyword: Return the minimum required
1732 alignment of E, measured in bytes. For VAR_DECL's and
1733 FIELD_DECL's return DECL_ALIGN (which can be set from an
1734 "aligned" __attribute__ specification). */
1737 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1741 if (e
== error_mark_node
)
1742 return error_mark_node
;
1744 if (processing_template_decl
)
1746 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1747 TREE_SIDE_EFFECTS (e
) = 0;
1748 TREE_READONLY (e
) = 1;
1753 e
= mark_type_use (e
);
1756 t
= size_int (DECL_ALIGN_UNIT (e
));
1757 else if (bitfield_p (e
))
1759 if (complain
& tf_error
)
1760 error ("invalid application of %<__alignof%> to a bit-field");
1762 return error_mark_node
;
1765 else if (TREE_CODE (e
) == COMPONENT_REF
1766 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1767 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1768 else if (is_overloaded_fn (e
))
1770 if (complain
& tf_error
)
1771 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1774 return error_mark_node
;
1775 if (TREE_CODE (e
) == FUNCTION_DECL
)
1776 t
= size_int (DECL_ALIGN_UNIT (e
));
1780 else if (type_unknown_p (e
))
1782 if (complain
& tf_error
)
1783 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1785 return error_mark_node
;
1789 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1790 complain
& tf_error
);
1792 return fold_convert (size_type_node
, t
);
1795 /* Process a sizeof or alignof expression E with code OP where the operand
1796 is an expression. */
1799 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1801 if (op
== SIZEOF_EXPR
)
1802 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1804 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1807 /* Build a representation of an expression 'alignas(E).' Return the
1808 folded integer value of E if it is an integral constant expression
1809 that resolves to a valid alignment. If E depends on a template
1810 parameter, return a syntactic representation tree of kind
1811 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1812 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1815 cxx_alignas_expr (tree e
)
1817 if (e
== NULL_TREE
|| e
== error_mark_node
1818 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1824 When the alignment-specifier is of the form
1825 alignas(type-id ), it shall have the same effect as
1826 alignas(alignof(type-id )). */
1828 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1830 /* If we reach this point, it means the alignas expression if of
1831 the form "alignas(assignment-expression)", so we should follow
1832 what is stated by [dcl.align]/2. */
1834 if (value_dependent_expression_p (e
))
1835 /* Leave value-dependent expression alone for now. */
1838 e
= instantiate_non_dependent_expr (e
);
1839 e
= mark_rvalue_use (e
);
1841 /* [dcl.align]/2 says:
1843 the assignment-expression shall be an integral constant
1846 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e
)))
1848 error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e
));
1849 return error_mark_node
;
1852 return cxx_constant_value (e
);
1856 /* EXPR is being used in a context that is not a function call.
1861 The expression can be used only as the left-hand operand of a
1862 member function call.
1864 [expr.mptr.operator]
1866 If the result of .* or ->* is a function, then that result can be
1867 used only as the operand for the function call operator ().
1869 by issuing an error message if appropriate. Returns true iff EXPR
1870 violates these rules. */
1873 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1875 if (expr
== NULL_TREE
)
1877 /* Don't enforce this in MS mode. */
1878 if (flag_ms_extensions
)
1880 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1881 expr
= get_first_fn (expr
);
1882 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1884 if (complain
& tf_error
)
1888 error_at (loc
, "invalid use of non-static member function %qD",
1890 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1893 error_at (loc
, "invalid use of non-static member function of "
1894 "type %qT", TREE_TYPE (expr
));
1901 /* If EXP is a reference to a bitfield, and the type of EXP does not
1902 match the declared type of the bitfield, return the declared type
1903 of the bitfield. Otherwise, return NULL_TREE. */
1906 is_bitfield_expr_with_lowered_type (const_tree exp
)
1908 switch (TREE_CODE (exp
))
1911 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1912 ? TREE_OPERAND (exp
, 1)
1913 : TREE_OPERAND (exp
, 0)))
1915 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1918 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1922 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1928 field
= TREE_OPERAND (exp
, 1);
1929 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1931 if (same_type_ignoring_top_level_qualifiers_p
1932 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1934 return DECL_BIT_FIELD_TYPE (field
);
1938 if (DECL_HAS_VALUE_EXPR_P (exp
))
1939 return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
1940 (CONST_CAST_TREE (exp
)));
1944 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1945 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1946 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1954 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1955 bitfield with a lowered type, the type of EXP is returned, rather
1959 unlowered_expr_type (const_tree exp
)
1962 tree etype
= TREE_TYPE (exp
);
1964 type
= is_bitfield_expr_with_lowered_type (exp
);
1966 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1973 /* Perform the conversions in [expr] that apply when an lvalue appears
1974 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1975 function-to-pointer conversions. In addition, bitfield references are
1976 converted to their declared types. Note that this function does not perform
1977 the lvalue-to-rvalue conversion for class types. If you need that conversion
1978 for class types, then you probably need to use force_rvalue.
1980 Although the returned value is being used as an rvalue, this
1981 function does not wrap the returned expression in a
1982 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1983 that the return value is no longer an lvalue. */
1986 decay_conversion (tree exp
,
1987 tsubst_flags_t complain
,
1988 bool reject_builtin
/* = true */)
1991 enum tree_code code
;
1992 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1994 type
= TREE_TYPE (exp
);
1995 if (type
== error_mark_node
)
1996 return error_mark_node
;
1998 exp
= resolve_nondeduced_context (exp
, complain
);
1999 if (type_unknown_p (exp
))
2001 if (complain
& tf_error
)
2002 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
2003 return error_mark_node
;
2006 code
= TREE_CODE (type
);
2008 if (error_operand_p (exp
))
2009 return error_mark_node
;
2011 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
2013 mark_rvalue_use (exp
, loc
, reject_builtin
);
2014 return nullptr_node
;
2017 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2018 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
2019 if (code
== VOID_TYPE
)
2021 if (complain
& tf_error
)
2022 error_at (loc
, "void value not ignored as it ought to be");
2023 return error_mark_node
;
2025 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
2026 return error_mark_node
;
2027 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
2029 exp
= mark_lvalue_use (exp
);
2030 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
2031 return error_mark_node
;
2032 return cp_build_addr_expr (exp
, complain
);
2034 if (code
== ARRAY_TYPE
)
2039 exp
= mark_lvalue_use (exp
);
2041 if (INDIRECT_REF_P (exp
))
2042 return build_nop (build_pointer_type (TREE_TYPE (type
)),
2043 TREE_OPERAND (exp
, 0));
2045 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
2047 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
2048 if (op1
== error_mark_node
)
2049 return error_mark_node
;
2050 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
2051 TREE_OPERAND (exp
, 0), op1
);
2054 if (!obvalue_p (exp
)
2055 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
2057 if (complain
& tf_error
)
2058 error_at (loc
, "invalid use of non-lvalue array");
2059 return error_mark_node
;
2062 /* Don't let an array compound literal decay to a pointer. It can
2063 still be used to initialize an array or bind to a reference. */
2064 if (TREE_CODE (exp
) == TARGET_EXPR
)
2066 if (complain
& tf_error
)
2067 error_at (loc
, "taking address of temporary array");
2068 return error_mark_node
;
2071 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2075 if (!cxx_mark_addressable (exp
))
2076 return error_mark_node
;
2077 adr
= build_nop (ptrtype
, build_address (exp
));
2080 /* This way is better for a COMPONENT_REF since it can
2081 simplify the offset for a component. */
2082 adr
= cp_build_addr_expr (exp
, complain
);
2083 return cp_convert (ptrtype
, adr
, complain
);
2086 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2087 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2089 /* If a bitfield is used in a context where integral promotion
2090 applies, then the caller is expected to have used
2091 default_conversion. That function promotes bitfields correctly
2092 before calling this function. At this point, if we have a
2093 bitfield referenced, we may assume that is not subject to
2094 promotion, and that, therefore, the type of the resulting rvalue
2095 is the declared type of the bitfield. */
2096 exp
= convert_bitfield_to_declared_type (exp
);
2098 /* We do not call rvalue() here because we do not want to wrap EXP
2099 in a NON_LVALUE_EXPR. */
2103 Non-class rvalues always have cv-unqualified types. */
2104 type
= TREE_TYPE (exp
);
2105 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2106 exp
= build_nop (cv_unqualified (type
), exp
);
2108 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2109 return error_mark_node
;
2114 /* Perform preparatory conversions, as part of the "usual arithmetic
2115 conversions". In particular, as per [expr]:
2117 Whenever an lvalue expression appears as an operand of an
2118 operator that expects the rvalue for that operand, the
2119 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2120 standard conversions are applied to convert the expression to an
2123 In addition, we perform integral promotions here, as those are
2124 applied to both operands to a binary operator before determining
2125 what additional conversions should apply. */
2128 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2130 /* Check for target-specific promotions. */
2131 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2133 exp
= cp_convert (promoted_type
, exp
, complain
);
2134 /* Perform the integral promotions first so that bitfield
2135 expressions (which may promote to "int", even if the bitfield is
2136 declared "unsigned") are promoted correctly. */
2137 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2138 exp
= cp_perform_integral_promotions (exp
, complain
);
2139 /* Perform the other conversions. */
2140 exp
= decay_conversion (exp
, complain
);
2148 default_conversion (tree exp
)
2150 return cp_default_conversion (exp
, tf_warning_or_error
);
2153 /* EXPR is an expression with an integral or enumeration type.
2154 Perform the integral promotions in [conv.prom], and return the
2158 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2163 expr
= mark_rvalue_use (expr
);
2167 If the bitfield has an enumerated type, it is treated as any
2168 other value of that type for promotion purposes. */
2169 type
= is_bitfield_expr_with_lowered_type (expr
);
2170 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2171 type
= TREE_TYPE (expr
);
2172 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2173 /* Scoped enums don't promote. */
2174 if (SCOPED_ENUM_P (type
))
2176 promoted_type
= type_promotes_to (type
);
2177 if (type
!= promoted_type
)
2178 expr
= cp_convert (promoted_type
, expr
, complain
);
2185 perform_integral_promotions (tree expr
)
2187 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2190 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2191 decay_conversion to one. */
2194 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2198 if (!TYPE_PTR_P (totype
))
2201 t
= TREE_TYPE (totype
);
2202 if (!same_type_p (t
, char_type_node
)
2203 && !same_type_p (t
, char16_type_node
)
2204 && !same_type_p (t
, char32_type_node
)
2205 && !same_type_p (t
, wchar_type_node
))
2208 STRIP_ANY_LOCATION_WRAPPER (exp
);
2210 if (TREE_CODE (exp
) == STRING_CST
)
2212 /* Make sure that we don't try to convert between char and wide chars. */
2213 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2218 /* Is this a string constant which has decayed to 'const char *'? */
2219 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2220 if (!same_type_p (TREE_TYPE (exp
), t
))
2223 if (TREE_CODE (exp
) != ADDR_EXPR
2224 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2229 if (cxx_dialect
>= cxx11
)
2230 pedwarn (input_location
, OPT_Wwrite_strings
,
2231 "ISO C++ forbids converting a string constant to %qT",
2234 warning (OPT_Wwrite_strings
,
2235 "deprecated conversion from string constant to %qT",
2242 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2243 can, for example, use as an lvalue. This code used to be in
2244 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2245 expressions, where we're dealing with aggregates. But now it's again only
2246 called from unary_complex_lvalue. The case (in particular) that led to
2247 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2251 rationalize_conditional_expr (enum tree_code code
, tree t
,
2252 tsubst_flags_t complain
)
2254 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2256 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2257 the first operand is always the one to be used if both operands
2258 are equal, so we know what conditional expression this used to be. */
2259 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2261 tree op0
= TREE_OPERAND (t
, 0);
2262 tree op1
= TREE_OPERAND (t
, 1);
2264 /* The following code is incorrect if either operand side-effects. */
2265 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2266 && !TREE_SIDE_EFFECTS (op1
));
2268 build_conditional_expr (loc
,
2269 build_x_binary_op (loc
,
2270 (TREE_CODE (t
) == MIN_EXPR
2271 ? LE_EXPR
: GE_EXPR
),
2272 op0
, TREE_CODE (op0
),
2273 op1
, TREE_CODE (op1
),
2276 cp_build_unary_op (code
, op0
, false, complain
),
2277 cp_build_unary_op (code
, op1
, false, complain
),
2282 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2283 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), false,
2285 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), false,
2290 /* Given the TYPE of an anonymous union field inside T, return the
2291 FIELD_DECL for the field. If not found return NULL_TREE. Because
2292 anonymous unions can nest, we must also search all anonymous unions
2293 that are directly reachable. */
2296 lookup_anon_field (tree t
, tree type
)
2300 t
= TYPE_MAIN_VARIANT (t
);
2302 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2304 if (TREE_STATIC (field
))
2306 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2309 /* If we find it directly, return the field. */
2310 if (DECL_NAME (field
) == NULL_TREE
2311 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2316 /* Otherwise, it could be nested, search harder. */
2317 if (DECL_NAME (field
) == NULL_TREE
2318 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2320 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2328 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2329 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2330 non-NULL, it indicates the path to the base used to name MEMBER.
2331 If PRESERVE_REFERENCE is true, the expression returned will have
2332 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2333 returned will have the type referred to by the reference.
2335 This function does not perform access control; that is either done
2336 earlier by the parser when the name of MEMBER is resolved to MEMBER
2337 itself, or later when overload resolution selects one of the
2338 functions indicated by MEMBER. */
2341 build_class_member_access_expr (cp_expr object
, tree member
,
2342 tree access_path
, bool preserve_reference
,
2343 tsubst_flags_t complain
)
2347 tree result
= NULL_TREE
;
2348 tree using_decl
= NULL_TREE
;
2350 if (error_operand_p (object
) || error_operand_p (member
))
2351 return error_mark_node
;
2353 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2357 The type of the first expression shall be "class object" (of a
2359 object_type
= TREE_TYPE (object
);
2360 if (!currently_open_class (object_type
)
2361 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2362 return error_mark_node
;
2363 if (!CLASS_TYPE_P (object_type
))
2365 if (complain
& tf_error
)
2367 if (POINTER_TYPE_P (object_type
)
2368 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2369 error ("request for member %qD in %qE, which is of pointer "
2370 "type %qT (maybe you meant to use %<->%> ?)",
2371 member
, object
.get_value (), object_type
);
2373 error ("request for member %qD in %qE, which is of non-class "
2374 "type %qT", member
, object
.get_value (), object_type
);
2376 return error_mark_node
;
2379 /* The standard does not seem to actually say that MEMBER must be a
2380 member of OBJECT_TYPE. However, that is clearly what is
2382 if (DECL_P (member
))
2384 member_scope
= DECL_CLASS_CONTEXT (member
);
2385 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2386 return error_mark_node
;
2387 if (TREE_DEPRECATED (member
))
2388 warn_deprecated_use (member
, NULL_TREE
);
2391 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2392 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2393 presently be the anonymous union. Go outwards until we find a
2394 type related to OBJECT_TYPE. */
2395 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2396 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2398 member_scope
= TYPE_CONTEXT (member_scope
);
2399 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2401 if (complain
& tf_error
)
2403 if (TREE_CODE (member
) == FIELD_DECL
)
2404 error ("invalid use of nonstatic data member %qE", member
);
2406 error ("%qD is not a member of %qT", member
, object_type
);
2408 return error_mark_node
;
2411 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2412 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2413 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2415 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2417 object
= cp_build_fold_indirect_ref (temp
);
2420 /* In [expr.ref], there is an explicit list of the valid choices for
2421 MEMBER. We check for each of those cases here. */
2424 /* A static data member. */
2426 mark_exp_read (object
);
2427 /* If OBJECT has side-effects, they are supposed to occur. */
2428 if (TREE_SIDE_EFFECTS (object
))
2429 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2431 else if (TREE_CODE (member
) == FIELD_DECL
)
2433 /* A non-static data member. */
2438 if (INDIRECT_REF_P (object
))
2440 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2442 null_object_p
= false;
2444 /* Convert OBJECT to the type of MEMBER. */
2445 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2446 TYPE_MAIN_VARIANT (member_scope
)))
2451 binfo
= lookup_base (access_path
? access_path
: object_type
,
2452 member_scope
, ba_unique
, &kind
, complain
);
2453 if (binfo
== error_mark_node
)
2454 return error_mark_node
;
2456 /* It is invalid to try to get to a virtual base of a
2457 NULL object. The most common cause is invalid use of
2459 if (null_object_p
&& kind
== bk_via_virtual
)
2461 if (complain
& tf_error
)
2463 error ("invalid access to non-static data member %qD in "
2464 "virtual base of NULL object", member
);
2466 return error_mark_node
;
2469 /* Convert to the base. */
2470 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2471 /*nonnull=*/1, complain
);
2472 /* If we found the base successfully then we should be able
2473 to convert to it successfully. */
2474 gcc_assert (object
!= error_mark_node
);
2477 /* If MEMBER is from an anonymous aggregate, we have converted
2478 OBJECT so that it refers to the class containing the
2479 anonymous union. Generate a reference to the anonymous union
2480 itself, and recur to find MEMBER. */
2481 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2482 /* When this code is called from build_field_call, the
2483 object already has the type of the anonymous union.
2484 That is because the COMPONENT_REF was already
2485 constructed, and was then disassembled before calling
2486 build_field_call. After the function-call code is
2487 cleaned up, this waste can be eliminated. */
2488 && (!same_type_ignoring_top_level_qualifiers_p
2489 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2491 tree anonymous_union
;
2493 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2494 DECL_CONTEXT (member
));
2495 object
= build_class_member_access_expr (object
,
2497 /*access_path=*/NULL_TREE
,
2502 /* Compute the type of the field, as described in [expr.ref]. */
2503 type_quals
= TYPE_UNQUALIFIED
;
2504 member_type
= TREE_TYPE (member
);
2505 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2507 type_quals
= (cp_type_quals (member_type
)
2508 | cp_type_quals (object_type
));
2510 /* A field is const (volatile) if the enclosing object, or the
2511 field itself, is const (volatile). But, a mutable field is
2512 not const, even within a const object. */
2513 if (DECL_MUTABLE_P (member
))
2514 type_quals
&= ~TYPE_QUAL_CONST
;
2515 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2518 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2519 object
, member
, NULL_TREE
);
2521 /* Mark the expression const or volatile, as appropriate. Even
2522 though we've dealt with the type above, we still have to mark the
2523 expression itself. */
2524 if (type_quals
& TYPE_QUAL_CONST
)
2525 TREE_READONLY (result
) = 1;
2526 if (type_quals
& TYPE_QUAL_VOLATILE
)
2527 TREE_THIS_VOLATILE (result
) = 1;
2529 else if (BASELINK_P (member
))
2531 /* The member is a (possibly overloaded) member function. */
2535 /* If the MEMBER is exactly one static member function, then we
2536 know the type of the expression. Otherwise, we must wait
2537 until overload resolution has been performed. */
2538 functions
= BASELINK_FUNCTIONS (member
);
2539 if (TREE_CODE (functions
) == FUNCTION_DECL
2540 && DECL_STATIC_FUNCTION_P (functions
))
2541 type
= TREE_TYPE (functions
);
2543 type
= unknown_type_node
;
2544 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2545 base. That will happen when the function is called. */
2546 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2548 else if (TREE_CODE (member
) == CONST_DECL
)
2550 /* The member is an enumerator. */
2552 /* If OBJECT has side-effects, they are supposed to occur. */
2553 if (TREE_SIDE_EFFECTS (object
))
2554 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2557 else if ((using_decl
= strip_using_decl (member
)) != member
)
2558 result
= build_class_member_access_expr (object
,
2560 access_path
, preserve_reference
,
2564 if (complain
& tf_error
)
2565 error ("invalid use of %qD", member
);
2566 return error_mark_node
;
2569 if (!preserve_reference
)
2572 If E2 is declared to have type "reference to T", then ... the
2573 type of E1.E2 is T. */
2574 result
= convert_from_reference (result
);
2579 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2580 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2583 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2584 tsubst_flags_t complain
)
2586 tree object_type
= TREE_TYPE (object
);
2587 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2590 /* We've already complained about this destructor. */
2591 if (dtor_type
== error_mark_node
)
2592 return error_mark_node
;
2594 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2596 if (complain
& tf_error
)
2597 error ("qualified type %qT does not match destructor name ~%qT",
2599 return error_mark_node
;
2601 if (is_auto (dtor_type
))
2602 dtor_type
= object_type
;
2603 else if (identifier_p (dtor_type
))
2605 /* In a template, names we can't find a match for are still accepted
2606 destructor names, and we check them here. */
2607 if (check_dtor_name (object_type
, dtor_type
))
2608 dtor_type
= object_type
;
2611 if (complain
& tf_error
)
2612 error ("object type %qT does not match destructor name ~%qT",
2613 object_type
, dtor_type
);
2614 return error_mark_node
;
2618 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2620 if (complain
& tf_error
)
2621 error ("the type being destroyed is %qT, but the destructor "
2622 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2623 return error_mark_node
;
2625 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2626 /*protect=*/1, /*want_type=*/false,
2627 tf_warning_or_error
);
2630 if (complain
& tf_error
)
2631 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2632 return error_mark_node
;
2634 expr
= (adjust_result_of_qualified_name_lookup
2635 (expr
, dtor_type
, object_type
));
2636 if (scope
== NULL_TREE
)
2637 /* We need to call adjust_result_of_qualified_name_lookup in case the
2638 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2639 that we still get virtual function binding. */
2640 BASELINK_QUALIFIED_P (expr
) = false;
2644 /* An expression of the form "A::template B" has been resolved to
2645 DECL. Issue a diagnostic if B is not a template or template
2649 check_template_keyword (tree decl
)
2651 /* The standard says:
2655 If a name prefixed by the keyword template is not a member
2656 template, the program is ill-formed.
2658 DR 228 removed the restriction that the template be a member
2661 DR 96, if accepted would add the further restriction that explicit
2662 template arguments must be provided if the template keyword is
2663 used, but, as of 2005-10-16, that DR is still in "drafting". If
2664 this DR is accepted, then the semantic checks here can be
2665 simplified, as the entity named must in fact be a template
2666 specialization, rather than, as at present, a set of overloaded
2667 functions containing at least one template function. */
2668 if (TREE_CODE (decl
) != TEMPLATE_DECL
2669 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2673 if (DECL_USE_TEMPLATE (decl
)
2674 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2677 permerror (input_location
, "%qD is not a template", decl
);
2679 else if (!is_overloaded_fn (decl
))
2680 permerror (input_location
, "%qD is not a template", decl
);
2685 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
2686 !found
&& iter
; ++iter
)
2689 if (TREE_CODE (fn
) == TEMPLATE_DECL
2690 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
2691 || (TREE_CODE (fn
) == FUNCTION_DECL
2692 && DECL_USE_TEMPLATE (fn
)
2693 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
))))
2697 permerror (input_location
, "%qD is not a template", decl
);
2702 /* Record that an access failure occurred on BASETYPE_PATH attempting
2703 to access FIELD_DECL. */
2706 access_failure_info::record_access_failure (tree basetype_path
,
2709 m_was_inaccessible
= true;
2710 m_basetype_path
= basetype_path
;
2711 m_field_decl
= field_decl
;
2714 /* If an access failure was recorded, then attempt to locate an
2715 accessor function for the pertinent field, and if one is
2716 available, add a note and fix-it hint suggesting using it. */
2719 access_failure_info::maybe_suggest_accessor (bool const_p
) const
2721 if (!m_was_inaccessible
)
2725 = locate_field_accessor (m_basetype_path
, m_field_decl
, const_p
);
2729 /* The accessor must itself be accessible for it to be a reasonable
2731 if (!accessible_p (m_basetype_path
, accessor
, true))
2734 rich_location
richloc (line_table
, input_location
);
2736 pp_printf (&pp
, "%s()", IDENTIFIER_POINTER (DECL_NAME (accessor
)));
2737 richloc
.add_fixit_replace (pp_formatted_text (&pp
));
2738 inform (&richloc
, "field %q#D can be accessed via %q#D",
2739 m_field_decl
, accessor
);
2742 /* This function is called by the parser to process a class member
2743 access expression of the form OBJECT.NAME. NAME is a node used by
2744 the parser to represent a name; it is not yet a DECL. It may,
2745 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2746 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2747 there is no reason to do the lookup twice, so the parser keeps the
2748 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2749 be a template via the use of the "A::template B" syntax. */
2752 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2753 tsubst_flags_t complain
)
2758 tree access_path
= NULL_TREE
;
2759 tree orig_object
= object
;
2760 tree orig_name
= name
;
2762 if (object
== error_mark_node
|| name
== error_mark_node
)
2763 return error_mark_node
;
2765 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2766 if (!objc_is_public (object
, name
))
2767 return error_mark_node
;
2769 object_type
= TREE_TYPE (object
);
2771 if (processing_template_decl
)
2773 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2774 type_dependent_object_expression_p (object
)
2775 /* If NAME is "f<args>", where either 'f' or 'args' is
2776 dependent, then the expression is dependent. */
2777 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2778 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2779 TREE_OPERAND (name
, 1)))
2780 /* If NAME is "T::X" where "T" is dependent, then the
2781 expression is dependent. */
2782 || (TREE_CODE (name
) == SCOPE_REF
2783 && TYPE_P (TREE_OPERAND (name
, 0))
2784 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2787 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2788 orig_object
, orig_name
, NULL_TREE
);
2790 object
= build_non_dependent_expr (object
);
2792 else if (c_dialect_objc ()
2793 && identifier_p (name
)
2794 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2799 The type of the first expression shall be "class object" (of a
2801 if (!currently_open_class (object_type
)
2802 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2803 return error_mark_node
;
2804 if (!CLASS_TYPE_P (object_type
))
2806 if (complain
& tf_error
)
2808 if (POINTER_TYPE_P (object_type
)
2809 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2810 error ("request for member %qD in %qE, which is of pointer "
2811 "type %qT (maybe you meant to use %<->%> ?)",
2812 name
, object
.get_value (), object_type
);
2814 error ("request for member %qD in %qE, which is of non-class "
2815 "type %qT", name
, object
.get_value (), object_type
);
2817 return error_mark_node
;
2820 if (BASELINK_P (name
))
2821 /* A member function that has already been looked up. */
2825 bool is_template_id
= false;
2826 tree template_args
= NULL_TREE
;
2827 tree scope
= NULL_TREE
;
2829 access_path
= object_type
;
2831 if (TREE_CODE (name
) == SCOPE_REF
)
2833 /* A qualified name. The qualifying class or namespace `S'
2834 has already been looked up; it is either a TYPE or a
2836 scope
= TREE_OPERAND (name
, 0);
2837 name
= TREE_OPERAND (name
, 1);
2839 /* If SCOPE is a namespace, then the qualified name does not
2840 name a member of OBJECT_TYPE. */
2841 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2843 if (complain
& tf_error
)
2844 error ("%<%D::%D%> is not a member of %qT",
2845 scope
, name
, object_type
);
2846 return error_mark_node
;
2850 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2852 is_template_id
= true;
2853 template_args
= TREE_OPERAND (name
, 1);
2854 name
= TREE_OPERAND (name
, 0);
2856 if (!identifier_p (name
))
2857 name
= OVL_NAME (name
);
2862 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2864 gcc_assert (!is_template_id
);
2865 /* Looking up a member enumerator (c++/56793). */
2866 if (!TYPE_CLASS_SCOPE_P (scope
)
2867 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2869 if (complain
& tf_error
)
2870 error ("%<%D::%D%> is not a member of %qT",
2871 scope
, name
, object_type
);
2872 return error_mark_node
;
2874 tree val
= lookup_enumerator (scope
, name
);
2877 if (complain
& tf_error
)
2878 error ("%qD is not a member of %qD",
2880 return error_mark_node
;
2883 if (TREE_SIDE_EFFECTS (object
))
2884 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2888 gcc_assert (CLASS_TYPE_P (scope
));
2889 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2891 if (constructor_name_p (name
, scope
))
2893 if (complain
& tf_error
)
2894 error ("cannot call constructor %<%T::%D%> directly",
2896 return error_mark_node
;
2899 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2900 access_path
= lookup_base (object_type
, scope
, ba_check
,
2902 if (access_path
== error_mark_node
)
2903 return error_mark_node
;
2906 if (any_dependent_bases_p (object_type
))
2908 if (complain
& tf_error
)
2909 error ("%qT is not a base of %qT", scope
, object_type
);
2910 return error_mark_node
;
2914 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2916 if (dependent_type_p (object_type
))
2917 /* The destructor isn't declared yet. */
2919 member
= lookup_destructor (object
, scope
, name
, complain
);
2923 /* Look up the member. */
2924 access_failure_info afi
;
2925 member
= lookup_member (access_path
, name
, /*protect=*/1,
2926 /*want_type=*/false, complain
,
2928 afi
.maybe_suggest_accessor (TYPE_READONLY (object_type
));
2929 if (member
== NULL_TREE
)
2931 if (dependent_type_p (object_type
))
2932 /* Try again at instantiation time. */
2934 if (complain
& tf_error
)
2936 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2937 /*want_type=*/false);
2940 location_t bogus_component_loc
= input_location
;
2941 gcc_rich_location
rich_loc (bogus_component_loc
);
2942 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
2944 error_at (&rich_loc
,
2945 "%q#T has no member named %qE;"
2946 " did you mean %qE?",
2947 TREE_CODE (access_path
) == TREE_BINFO
2948 ? TREE_TYPE (access_path
) : object_type
,
2952 error ("%q#T has no member named %qE",
2953 TREE_CODE (access_path
) == TREE_BINFO
2954 ? TREE_TYPE (access_path
) : object_type
, name
);
2956 return error_mark_node
;
2958 if (member
== error_mark_node
)
2959 return error_mark_node
;
2961 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
2962 /* Dependent type attributes on the decl mean that the TREE_TYPE is
2963 wrong, so don't use it. */
2965 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2971 tree templ
= member
;
2973 if (BASELINK_P (templ
))
2974 member
= lookup_template_function (templ
, template_args
);
2975 else if (variable_template_p (templ
))
2976 member
= (lookup_and_finish_template_variable
2977 (templ
, template_args
, complain
));
2980 if (complain
& tf_error
)
2981 error ("%qD is not a member template function", name
);
2982 return error_mark_node
;
2987 if (TREE_DEPRECATED (member
))
2988 warn_deprecated_use (member
, NULL_TREE
);
2991 check_template_keyword (member
);
2993 expr
= build_class_member_access_expr (object
, member
, access_path
,
2994 /*preserve_reference=*/false,
2996 if (processing_template_decl
&& expr
!= error_mark_node
)
2998 if (BASELINK_P (member
))
3000 if (TREE_CODE (orig_name
) == SCOPE_REF
)
3001 BASELINK_QUALIFIED_P (member
) = 1;
3004 return build_min_non_dep (COMPONENT_REF
, expr
,
3005 orig_object
, orig_name
,
3012 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
3016 build_simple_component_ref (tree object
, tree member
)
3018 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
3019 cp_type_quals (TREE_TYPE (object
)));
3020 return build3_loc (input_location
,
3021 COMPONENT_REF
, type
,
3022 object
, member
, NULL_TREE
);
3025 /* Return an expression for the MEMBER_NAME field in the internal
3026 representation of PTRMEM, a pointer-to-member function. (Each
3027 pointer-to-member function type gets its own RECORD_TYPE so it is
3028 more convenient to access the fields by name than by FIELD_DECL.)
3029 This routine converts the NAME to a FIELD_DECL and then creates the
3030 node for the complete expression. */
3033 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
3038 /* This code is a stripped down version of
3039 build_class_member_access_expr. It does not work to use that
3040 routine directly because it expects the object to be of class
3042 ptrmem_type
= TREE_TYPE (ptrmem
);
3043 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
3044 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
3045 member
= DECL_CHAIN (member
))
3046 if (DECL_NAME (member
) == member_name
)
3048 tree res
= build_simple_component_ref (ptrmem
, member
);
3050 TREE_NO_WARNING (res
) = 1;
3054 /* Given an expression PTR for a pointer, return an expression
3055 for the value pointed to.
3056 ERRORSTRING is the name of the operator to appear in error messages.
3058 This function may need to overload OPERATOR_FNNAME.
3059 Must also handle REFERENCE_TYPEs for C++. */
3062 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
3063 tsubst_flags_t complain
)
3065 tree orig_expr
= expr
;
3067 tree overload
= NULL_TREE
;
3069 if (processing_template_decl
)
3071 /* Retain the type if we know the operand is a pointer. */
3072 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
3073 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
3074 if (type_dependent_expression_p (expr
))
3075 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
3076 expr
= build_non_dependent_expr (expr
);
3079 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
3080 NULL_TREE
, NULL_TREE
, &overload
, complain
);
3082 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
3084 if (processing_template_decl
&& rval
!= error_mark_node
)
3086 if (overload
!= NULL_TREE
)
3087 return (build_min_non_dep_op_overload
3088 (INDIRECT_REF
, rval
, overload
, orig_expr
));
3090 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
3096 /* The implementation of the above, and of indirection implied by other
3097 constructs. If DO_FOLD is true, fold away INDIRECT_REF of ADDR_EXPR. */
3100 cp_build_indirect_ref_1 (tree ptr
, ref_operator errorstring
,
3101 tsubst_flags_t complain
, bool do_fold
)
3105 /* RO_NULL should only be used with the folding entry points below, not
3106 cp_build_indirect_ref. */
3107 gcc_checking_assert (errorstring
!= RO_NULL
|| do_fold
);
3109 if (ptr
== current_class_ptr
3110 || (TREE_CODE (ptr
) == NOP_EXPR
3111 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3112 && (same_type_ignoring_top_level_qualifiers_p
3113 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3114 return current_class_ref
;
3116 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
3117 ? ptr
: decay_conversion (ptr
, complain
));
3118 if (pointer
== error_mark_node
)
3119 return error_mark_node
;
3121 type
= TREE_TYPE (pointer
);
3123 if (POINTER_TYPE_P (type
))
3127 If the type of the expression is "pointer to T," the type
3128 of the result is "T." */
3129 tree t
= TREE_TYPE (type
);
3131 if ((CONVERT_EXPR_P (ptr
)
3132 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3133 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3135 /* If a warning is issued, mark it to avoid duplicates from
3136 the backend. This only needs to be done at
3137 warn_strict_aliasing > 2. */
3138 if (warn_strict_aliasing
> 2)
3139 if (strict_aliasing_warning (EXPR_LOCATION (ptr
),
3140 type
, TREE_OPERAND (ptr
, 0)))
3141 TREE_NO_WARNING (ptr
) = 1;
3144 if (VOID_TYPE_P (t
))
3146 /* A pointer to incomplete type (other than cv void) can be
3147 dereferenced [expr.unary.op]/1 */
3148 if (complain
& tf_error
)
3149 error ("%qT is not a pointer-to-object type", type
);
3150 return error_mark_node
;
3152 else if (do_fold
&& TREE_CODE (pointer
) == ADDR_EXPR
3153 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3154 /* The POINTER was something like `&x'. We simplify `*&x' to
3156 return TREE_OPERAND (pointer
, 0);
3159 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3161 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3162 so that we get the proper error message if the result is used
3163 to assign to. Also, &* is supposed to be a no-op. */
3164 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3165 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3166 TREE_SIDE_EFFECTS (ref
)
3167 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3171 else if (!(complain
& tf_error
))
3172 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3174 /* `pointer' won't be an error_mark_node if we were given a
3175 pointer to member, so it's cool to check for this here. */
3176 else if (TYPE_PTRMEM_P (type
))
3177 switch (errorstring
)
3179 case RO_ARRAY_INDEXING
:
3180 error ("invalid use of array indexing on pointer to member");
3183 error ("invalid use of unary %<*%> on pointer to member");
3185 case RO_IMPLICIT_CONVERSION
:
3186 error ("invalid use of implicit conversion on pointer to member");
3189 error ("left hand operand of %<->*%> must be a pointer to class, "
3190 "but is a pointer to member of type %qT", type
);
3195 else if (pointer
!= error_mark_node
)
3196 invalid_indirection_error (input_location
, type
, errorstring
);
3198 return error_mark_node
;
3201 /* Entry point used by c-common, which expects folding. */
3204 build_indirect_ref (location_t
/*loc*/,
3205 tree ptr
, ref_operator errorstring
)
3207 return cp_build_indirect_ref_1 (ptr
, errorstring
, tf_warning_or_error
, true);
3210 /* Entry point used by internal indirection needs that don't correspond to any
3211 syntactic construct. */
3214 cp_build_fold_indirect_ref (tree pointer
)
3216 return cp_build_indirect_ref_1 (pointer
, RO_NULL
, tf_warning_or_error
, true);
3219 /* Entry point used by indirection needs that correspond to some syntactic
3223 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
3224 tsubst_flags_t complain
)
3226 return cp_build_indirect_ref_1 (ptr
, errorstring
, complain
, false);
3229 /* This handles expressions of the form "a[i]", which denotes
3232 This is logically equivalent in C to *(a+i), but we may do it differently.
3233 If A is a variable or a member, we generate a primitive ARRAY_REF.
3234 This avoids forcing the array out of registers, and can work on
3235 arrays that are not lvalues (for example, members of structures returned
3238 If INDEX is of some user-defined type, it must be converted to
3239 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3240 will inherit the type of the array, which will be some pointer type.
3242 LOC is the location to use in building the array reference. */
3245 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3246 tsubst_flags_t complain
)
3252 if (complain
& tf_error
)
3253 error_at (loc
, "subscript missing in array reference");
3254 return error_mark_node
;
3257 if (TREE_TYPE (array
) == error_mark_node
3258 || TREE_TYPE (idx
) == error_mark_node
)
3259 return error_mark_node
;
3261 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3263 switch (TREE_CODE (array
))
3267 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3269 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3270 TREE_OPERAND (array
, 0), value
);
3271 SET_EXPR_LOCATION (ret
, loc
);
3276 ret
= build_conditional_expr
3277 (loc
, TREE_OPERAND (array
, 0),
3278 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3280 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3283 protected_set_expr_location (ret
, loc
);
3290 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3292 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3296 warn_array_subscript_with_type_char (loc
, idx
);
3298 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3300 if (complain
& tf_error
)
3301 error_at (loc
, "array subscript is not an integer");
3302 return error_mark_node
;
3305 /* Apply integral promotions *after* noticing character types.
3306 (It is unclear why we do these promotions -- the standard
3307 does not say that we should. In fact, the natural thing would
3308 seem to be to convert IDX to ptrdiff_t; we're performing
3309 pointer arithmetic.) */
3310 idx
= cp_perform_integral_promotions (idx
, complain
);
3312 /* An array that is indexed by a non-constant
3313 cannot be stored in a register; we must be able to do
3314 address arithmetic on its address.
3315 Likewise an array of elements of variable size. */
3316 if (TREE_CODE (idx
) != INTEGER_CST
3317 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3318 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3321 if (!cxx_mark_addressable (array
, true))
3322 return error_mark_node
;
3325 /* An array that is indexed by a constant value which is not within
3326 the array bounds cannot be stored in a register either; because we
3327 would get a crash in store_bit_field/extract_bit_field when trying
3328 to access a non-existent part of the register. */
3329 if (TREE_CODE (idx
) == INTEGER_CST
3330 && TYPE_DOMAIN (TREE_TYPE (array
))
3331 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3333 if (!cxx_mark_addressable (array
))
3334 return error_mark_node
;
3337 /* Note in C++ it is valid to subscript a `register' array, since
3338 it is valid to take the address of something with that
3339 storage specification. */
3343 while (TREE_CODE (foo
) == COMPONENT_REF
)
3344 foo
= TREE_OPERAND (foo
, 0);
3345 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3346 && (complain
& tf_warning
))
3347 warning_at (loc
, OPT_Wextra
,
3348 "subscripting array declared %<register%>");
3351 type
= TREE_TYPE (TREE_TYPE (array
));
3352 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3353 /* Array ref is const/volatile if the array elements are
3354 or if the array is.. */
3355 TREE_READONLY (rval
)
3356 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3357 TREE_SIDE_EFFECTS (rval
)
3358 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3359 TREE_THIS_VOLATILE (rval
)
3360 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3361 ret
= require_complete_type_sfinae (rval
, complain
);
3362 protected_set_expr_location (ret
, loc
);
3364 ret
= non_lvalue_loc (loc
, ret
);
3369 tree ar
= cp_default_conversion (array
, complain
);
3370 tree ind
= cp_default_conversion (idx
, complain
);
3372 /* Put the integer in IND to simplify error checking. */
3373 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3374 std::swap (ar
, ind
);
3376 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3377 return error_mark_node
;
3379 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3381 if (complain
& tf_error
)
3382 error_at (loc
, "subscripted value is neither array nor pointer");
3383 return error_mark_node
;
3385 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3387 if (complain
& tf_error
)
3388 error_at (loc
, "array subscript is not an integer");
3389 return error_mark_node
;
3392 warn_array_subscript_with_type_char (loc
, idx
);
3394 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3399 protected_set_expr_location (ret
, loc
);
3401 ret
= non_lvalue_loc (loc
, ret
);
3406 /* Entry point for Obj-C++. */
3409 build_array_ref (location_t loc
, tree array
, tree idx
)
3411 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3414 /* Resolve a pointer to member function. INSTANCE is the object
3415 instance to use, if the member points to a virtual member.
3417 This used to avoid checking for virtual functions if basetype
3418 has no virtual functions, according to an earlier ANSI draft.
3419 With the final ISO C++ rules, such an optimization is
3420 incorrect: A pointer to a derived member can be static_cast
3421 to pointer-to-base-member, as long as the dynamic object
3422 later has the right member. So now we only do this optimization
3423 when we know the dynamic type of the object. */
3426 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3427 tsubst_flags_t complain
)
3429 if (TREE_CODE (function
) == OFFSET_REF
)
3430 function
= TREE_OPERAND (function
, 1);
3432 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3434 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3436 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3437 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3439 tree instance_ptr
= *instance_ptrptr
;
3440 tree instance_save_expr
= 0;
3441 if (instance_ptr
== error_mark_node
)
3443 if (TREE_CODE (function
) == PTRMEM_CST
)
3445 /* Extracting the function address from a pmf is only
3446 allowed with -Wno-pmf-conversions. It only works for
3448 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3449 e1
= convert (fntype
, e1
);
3454 if (complain
& tf_error
)
3455 error ("object missing in use of %qE", function
);
3456 return error_mark_node
;
3460 /* True if we know that the dynamic type of the object doesn't have
3461 virtual functions, so we can assume the PFN field is a pointer. */
3462 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3463 && !TYPE_POLYMORPHIC_P (basetype
)
3464 && resolves_to_fixed_type_p (instance_ptr
, 0));
3466 /* If we don't really have an object (i.e. in an ill-formed
3467 conversion from PMF to pointer), we can't resolve virtual
3468 functions anyway. */
3469 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3472 if (TREE_SIDE_EFFECTS (instance_ptr
))
3473 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3475 if (TREE_SIDE_EFFECTS (function
))
3476 function
= save_expr (function
);
3478 /* Start by extracting all the information from the PMF itself. */
3479 e3
= pfn_from_ptrmemfunc (function
);
3480 delta
= delta_from_ptrmemfunc (function
);
3481 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3482 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3484 int flag_sanitize_save
;
3485 case ptrmemfunc_vbit_in_pfn
:
3486 e1
= cp_build_binary_op (input_location
,
3487 BIT_AND_EXPR
, idx
, integer_one_node
,
3489 idx
= cp_build_binary_op (input_location
,
3490 MINUS_EXPR
, idx
, integer_one_node
,
3492 if (idx
== error_mark_node
)
3493 return error_mark_node
;
3496 case ptrmemfunc_vbit_in_delta
:
3497 e1
= cp_build_binary_op (input_location
,
3498 BIT_AND_EXPR
, delta
, integer_one_node
,
3500 /* Don't instrument the RSHIFT_EXPR we're about to create because
3501 we're going to use DELTA number of times, and that wouldn't play
3502 well with SAVE_EXPRs therein. */
3503 flag_sanitize_save
= flag_sanitize
;
3505 delta
= cp_build_binary_op (input_location
,
3506 RSHIFT_EXPR
, delta
, integer_one_node
,
3508 flag_sanitize
= flag_sanitize_save
;
3509 if (delta
== error_mark_node
)
3510 return error_mark_node
;
3517 if (e1
== error_mark_node
)
3518 return error_mark_node
;
3520 /* Convert down to the right base before using the instance. A
3521 special case is that in a pointer to member of class C, C may
3522 be incomplete. In that case, the function will of course be
3523 a member of C, and no conversion is required. In fact,
3524 lookup_base will fail in that case, because incomplete
3525 classes do not have BINFOs. */
3526 if (!same_type_ignoring_top_level_qualifiers_p
3527 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3529 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3530 basetype
, ba_check
, NULL
, complain
);
3531 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3533 if (instance_ptr
== error_mark_node
)
3534 return error_mark_node
;
3536 /* ...and then the delta in the PMF. */
3537 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3539 /* Hand back the adjusted 'this' argument to our caller. */
3540 *instance_ptrptr
= instance_ptr
;
3543 /* Now just return the pointer. */
3546 /* Next extract the vtable pointer from the object. */
3547 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3549 vtbl
= cp_build_fold_indirect_ref (vtbl
);
3550 if (vtbl
== error_mark_node
)
3551 return error_mark_node
;
3553 /* Finally, extract the function pointer from the vtable. */
3554 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3555 e2
= cp_build_fold_indirect_ref (e2
);
3556 if (e2
== error_mark_node
)
3557 return error_mark_node
;
3558 TREE_CONSTANT (e2
) = 1;
3560 /* When using function descriptors, the address of the
3561 vtable entry is treated as a function pointer. */
3562 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3563 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3564 cp_build_addr_expr (e2
, complain
));
3566 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3567 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3568 if (e1
== error_mark_node
)
3569 return error_mark_node
;
3571 /* Make sure this doesn't get evaluated first inside one of the
3572 branches of the COND_EXPR. */
3573 if (instance_save_expr
)
3574 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3575 instance_save_expr
, e1
);
3582 /* Used by the C-common bits. */
3584 build_function_call (location_t
/*loc*/,
3585 tree function
, tree params
)
3587 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3590 /* Used by the C-common bits. */
3592 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3593 tree function
, vec
<tree
, va_gc
> *params
,
3594 vec
<tree
, va_gc
> * /*origtypes*/)
3596 vec
<tree
, va_gc
> *orig_params
= params
;
3597 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3598 tf_warning_or_error
);
3600 /* cp_build_function_call_vec can reallocate PARAMS by adding
3601 default arguments. That should never happen here. Verify
3603 gcc_assert (params
== orig_params
);
3608 /* Build a function call using a tree list of arguments. */
3611 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3613 vec
<tree
, va_gc
> *vec
;
3616 vec
= make_tree_vector ();
3617 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3618 vec_safe_push (vec
, TREE_VALUE (params
));
3619 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3620 release_tree_vector (vec
);
3624 /* Build a function call using varargs. */
3627 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3629 vec
<tree
, va_gc
> *vec
;
3633 vec
= make_tree_vector ();
3634 va_start (args
, complain
);
3635 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3636 vec_safe_push (vec
, t
);
3638 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3639 release_tree_vector (vec
);
3643 /* Build a function call using a vector of arguments. PARAMS may be
3644 NULL if there are no parameters. This changes the contents of
3648 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3649 tsubst_flags_t complain
)
3651 tree fntype
, fndecl
;
3653 tree original
= function
;
3657 vec
<tree
, va_gc
> *allocated
= NULL
;
3660 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3661 expressions, like those used for ObjC messenger dispatches. */
3662 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3663 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3665 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3666 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3667 if (TREE_CODE (function
) == NOP_EXPR
3668 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3669 function
= TREE_OPERAND (function
, 0);
3671 if (TREE_CODE (function
) == FUNCTION_DECL
)
3673 /* If the function is a non-template member function
3674 or a non-template friend, then we need to check the
3677 Note that if overload resolution failed with a single
3678 candidate this function will be used to explicitly diagnose
3679 the failure for the single call expression. The check is
3680 technically redundant since we also would have failed in
3681 add_function_candidate. */
3683 && (complain
& tf_error
)
3684 && !constraints_satisfied_p (function
))
3686 error ("cannot call function %qD", function
);
3687 location_t loc
= DECL_SOURCE_LOCATION (function
);
3688 diagnose_constraints (loc
, function
, NULL_TREE
);
3689 return error_mark_node
;
3692 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3693 return error_mark_node
;
3696 /* Convert anything with function type to a pointer-to-function. */
3697 if (DECL_MAIN_P (function
))
3699 if (complain
& tf_error
)
3700 pedwarn (input_location
, OPT_Wpedantic
,
3701 "ISO C++ forbids calling %<::main%> from within program");
3703 return error_mark_node
;
3705 function
= build_addr_func (function
, complain
);
3711 function
= build_addr_func (function
, complain
);
3714 if (function
== error_mark_node
)
3715 return error_mark_node
;
3717 fntype
= TREE_TYPE (function
);
3719 if (TYPE_PTRMEMFUNC_P (fntype
))
3721 if (complain
& tf_error
)
3722 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3723 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3724 original
, original
);
3725 return error_mark_node
;
3728 is_method
= (TYPE_PTR_P (fntype
)
3729 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3731 if (!(TYPE_PTRFN_P (fntype
)
3733 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3735 if (complain
& tf_error
)
3737 if (!flag_diagnostics_show_caret
)
3738 error_at (input_location
,
3739 "%qE cannot be used as a function", original
);
3740 else if (DECL_P (original
))
3741 error_at (input_location
,
3742 "%qD cannot be used as a function", original
);
3744 error_at (input_location
,
3745 "expression cannot be used as a function");
3748 return error_mark_node
;
3751 /* fntype now gets the type of function pointed to. */
3752 fntype
= TREE_TYPE (fntype
);
3753 parm_types
= TYPE_ARG_TYPES (fntype
);
3757 allocated
= make_tree_vector ();
3758 params
= &allocated
;
3761 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3764 return error_mark_node
;
3766 argarray
= (*params
)->address ();
3768 /* Check for errors in format strings and inappropriately
3770 bool warned_p
= check_function_arguments (input_location
, fndecl
, fntype
,
3771 nargs
, argarray
, NULL
);
3773 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3777 tree c
= extract_call_expr (ret
);
3778 if (TREE_CODE (c
) == CALL_EXPR
)
3779 TREE_NO_WARNING (c
) = 1;
3782 if (allocated
!= NULL
)
3783 release_tree_vector (allocated
);
3788 /* Subroutine of convert_arguments.
3789 Print an error message about a wrong number of arguments. */
3792 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3796 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3798 if (DECL_NAME (fndecl
) == NULL_TREE
3799 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3802 ? G_("too many arguments to constructor %q#D")
3803 : G_("too few arguments to constructor %q#D"),
3808 ? G_("too many arguments to member function %q#D")
3809 : G_("too few arguments to member function %q#D"),
3815 ? G_("too many arguments to function %q#D")
3816 : G_("too few arguments to function %q#D"),
3818 if (!DECL_IS_BUILTIN (fndecl
))
3819 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3823 if (c_dialect_objc () && objc_message_selector ())
3826 ? G_("too many arguments to method %q#D")
3827 : G_("too few arguments to method %q#D"),
3828 objc_message_selector ());
3830 error_at (loc
, too_many_p
? G_("too many arguments to function")
3831 : G_("too few arguments to function"));
3835 /* Convert the actual parameter expressions in the list VALUES to the
3836 types in the list TYPELIST. The converted expressions are stored
3837 back in the VALUES vector.
3838 If parmdecls is exhausted, or when an element has NULL as its type,
3839 perform the default conversions.
3841 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3843 This is also where warnings about wrong number of args are generated.
3845 Returns the actual number of arguments processed (which might be less
3846 than the length of the vector), or -1 on error.
3848 In C++, unspecified trailing parameters can be filled in with their
3849 default arguments, if such were specified. Do so here. */
3852 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3853 int flags
, tsubst_flags_t complain
)
3858 /* Argument passing is always copy-initialization. */
3859 flags
|= LOOKUP_ONLYCONVERTING
;
3861 for (i
= 0, typetail
= typelist
;
3862 i
< vec_safe_length (*values
);
3865 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3866 tree val
= (**values
)[i
];
3868 if (val
== error_mark_node
|| type
== error_mark_node
)
3871 if (type
== void_type_node
)
3873 if (complain
& tf_error
)
3875 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3882 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3883 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3884 if (TREE_CODE (val
) == NOP_EXPR
3885 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3886 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3887 val
= TREE_OPERAND (val
, 0);
3889 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3891 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3892 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3893 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3894 val
= decay_conversion (val
, complain
);
3897 if (val
== error_mark_node
)
3902 /* Formal parm type is specified by a function prototype. */
3905 if (!COMPLETE_TYPE_P (complete_type (type
)))
3907 if (complain
& tf_error
)
3910 error ("parameter %P of %qD has incomplete type %qT",
3913 error ("parameter %P has incomplete type %qT", i
, type
);
3915 parmval
= error_mark_node
;
3919 parmval
= convert_for_initialization
3920 (NULL_TREE
, type
, val
, flags
,
3921 ICR_ARGPASS
, fndecl
, i
, complain
);
3922 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3925 if (parmval
== error_mark_node
)
3928 (**values
)[i
] = parmval
;
3932 if (fndecl
&& magic_varargs_p (fndecl
))
3933 /* Don't do ellipsis conversion for __built_in_constant_p
3934 as this will result in spurious errors for non-trivial
3936 val
= require_complete_type_sfinae (val
, complain
);
3938 val
= convert_arg_to_ellipsis (val
, complain
);
3940 (**values
)[i
] = val
;
3944 typetail
= TREE_CHAIN (typetail
);
3947 if (typetail
!= 0 && typetail
!= void_list_node
)
3949 /* See if there are default arguments that can be used. Because
3950 we hold default arguments in the FUNCTION_TYPE (which is so
3951 wrong), we can see default parameters here from deduced
3952 contexts (and via typeof) for indirect function calls.
3953 Fortunately we know whether we have a function decl to
3954 provide default arguments in a language conformant
3956 if (fndecl
&& TREE_PURPOSE (typetail
)
3957 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3959 for (; typetail
!= void_list_node
; ++i
)
3961 /* After DR777, with explicit template args we can end up with a
3962 default argument followed by no default argument. */
3963 if (!TREE_PURPOSE (typetail
))
3966 = convert_default_arg (TREE_VALUE (typetail
),
3967 TREE_PURPOSE (typetail
),
3968 fndecl
, i
, complain
);
3970 if (parmval
== error_mark_node
)
3973 vec_safe_push (*values
, parmval
);
3974 typetail
= TREE_CHAIN (typetail
);
3975 /* ends with `...'. */
3976 if (typetail
== NULL_TREE
)
3981 if (typetail
&& typetail
!= void_list_node
)
3983 if (complain
& tf_error
)
3984 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3992 /* Build a binary-operation expression, after performing default
3993 conversions on the operands. CODE is the kind of expression to
3994 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3995 are the tree codes which correspond to ARG1 and ARG2 when issuing
3996 warnings about possibly misplaced parentheses. They may differ
3997 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3998 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3999 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
4000 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
4001 ARG2_CODE as ERROR_MARK. */
4004 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
4005 enum tree_code arg1_code
, tree arg2
,
4006 enum tree_code arg2_code
, tree
*overload_p
,
4007 tsubst_flags_t complain
)
4012 tree overload
= NULL_TREE
;
4017 if (processing_template_decl
)
4019 if (type_dependent_expression_p (arg1
)
4020 || type_dependent_expression_p (arg2
))
4021 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
4022 arg1
= build_non_dependent_expr (arg1
);
4023 arg2
= build_non_dependent_expr (arg2
);
4026 if (code
== DOTSTAR_EXPR
)
4027 expr
= build_m_component_ref (arg1
, arg2
, complain
);
4029 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
4030 &overload
, complain
);
4032 if (overload_p
!= NULL
)
4033 *overload_p
= overload
;
4035 /* Check for cases such as x+y<<z which users are likely to
4036 misinterpret. But don't warn about obj << x + y, since that is a
4037 common idiom for I/O. */
4038 if (warn_parentheses
4039 && (complain
& tf_warning
)
4040 && !processing_template_decl
4041 && !error_operand_p (arg1
)
4042 && !error_operand_p (arg2
)
4043 && (code
!= LSHIFT_EXPR
4044 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
4045 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
4046 arg2_code
, orig_arg2
);
4048 if (processing_template_decl
&& expr
!= error_mark_node
)
4050 if (overload
!= NULL_TREE
)
4051 return (build_min_non_dep_op_overload
4052 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
4054 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
4060 /* Build and return an ARRAY_REF expression. */
4063 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
4064 tsubst_flags_t complain
)
4066 tree orig_arg1
= arg1
;
4067 tree orig_arg2
= arg2
;
4069 tree overload
= NULL_TREE
;
4071 if (processing_template_decl
)
4073 if (type_dependent_expression_p (arg1
)
4074 || type_dependent_expression_p (arg2
))
4075 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
4076 NULL_TREE
, NULL_TREE
);
4077 arg1
= build_non_dependent_expr (arg1
);
4078 arg2
= build_non_dependent_expr (arg2
);
4081 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
4082 NULL_TREE
, &overload
, complain
);
4084 if (processing_template_decl
&& expr
!= error_mark_node
)
4086 if (overload
!= NULL_TREE
)
4087 return (build_min_non_dep_op_overload
4088 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
4090 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
4091 NULL_TREE
, NULL_TREE
);
4096 /* Return whether OP is an expression of enum type cast to integer
4097 type. In C++ even unsigned enum types are cast to signed integer
4098 types. We do not want to issue warnings about comparisons between
4099 signed and unsigned types when one of the types is an enum type.
4100 Those warnings are always false positives in practice. */
4103 enum_cast_to_int (tree op
)
4105 if (CONVERT_EXPR_P (op
)
4106 && TREE_TYPE (op
) == integer_type_node
4107 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
4108 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
4111 /* The cast may have been pushed into a COND_EXPR. */
4112 if (TREE_CODE (op
) == COND_EXPR
)
4113 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
4114 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
4119 /* For the c-common bits. */
4121 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
4124 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
4127 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4128 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4131 build_vec_cmp (tree_code code
, tree type
,
4132 tree arg0
, tree arg1
)
4134 tree zero_vec
= build_zero_cst (type
);
4135 tree minus_one_vec
= build_minus_one_cst (type
);
4136 tree cmp_type
= build_same_sized_truth_vector_type(type
);
4137 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4138 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4141 /* Possibly warn about an address never being NULL. */
4144 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4147 || (complain
& tf_warning
) == 0
4148 || c_inhibit_evaluation_warnings
!= 0
4149 || TREE_NO_WARNING (op
))
4152 tree cop
= fold_non_dependent_expr (op
);
4154 if (TREE_CODE (cop
) == ADDR_EXPR
4155 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4156 && !TREE_NO_WARNING (cop
))
4157 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4158 "be NULL", TREE_OPERAND (cop
, 0));
4160 if (CONVERT_EXPR_P (op
)
4161 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == REFERENCE_TYPE
)
4164 STRIP_NOPS (inner_op
);
4166 if (DECL_P (inner_op
))
4167 warning_at (location
, OPT_Waddress
,
4168 "the compiler can assume that the address of "
4169 "%qD will never be NULL", inner_op
);
4173 /* Build a binary-operation expression without default conversions.
4174 CODE is the kind of expression to build.
4175 LOCATION is the location_t of the operator in the source code.
4176 This function differs from `build' in several ways:
4177 the data type of the result is computed and recorded in it,
4178 warnings are generated if arg data types are invalid,
4179 special handling for addition and subtraction of pointers is known,
4180 and some optimization is done (operations on narrow ints
4181 are done in the narrower type when that gives the same result).
4182 Constant folding is also done before the result is returned.
4184 Note that the operands will never have enumeral types
4185 because either they have just had the default conversions performed
4186 or they have both just been converted to some other type in which
4187 the arithmetic is to be done.
4189 C++: must do special pointer arithmetic when implementing
4190 multiple inheritance, and deal with pointer to member functions. */
4193 cp_build_binary_op (location_t location
,
4194 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4195 tsubst_flags_t complain
)
4198 enum tree_code code0
, code1
;
4200 const char *invalid_op_diag
;
4202 /* Expression code to give to the expression when it is built.
4203 Normally this is CODE, which is what the caller asked for,
4204 but in some special cases we change it. */
4205 enum tree_code resultcode
= code
;
4207 /* Data type in which the computation is to be performed.
4208 In the simplest cases this is the common type of the arguments. */
4209 tree result_type
= NULL_TREE
;
4211 /* Nonzero means operands have already been type-converted
4212 in whatever way is necessary.
4213 Zero means they need to be converted to RESULT_TYPE. */
4216 /* Nonzero means create the expression with this type, rather than
4218 tree build_type
= 0;
4220 /* Nonzero means after finally constructing the expression
4221 convert it to this type. */
4222 tree final_type
= 0;
4224 tree result
, result_ovl
;
4226 /* Nonzero if this is an operation like MIN or MAX which can
4227 safely be computed in short if both args are promoted shorts.
4228 Also implies COMMON.
4229 -1 indicates a bitwise operation; this makes a difference
4230 in the exact conditions for when it is safe to do the operation
4231 in a narrower mode. */
4234 /* Nonzero if this is a comparison operation;
4235 if both args are promoted shorts, compare the original shorts.
4236 Also implies COMMON. */
4237 int short_compare
= 0;
4239 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4242 /* True if both operands have arithmetic type. */
4243 bool arithmetic_types_p
;
4245 /* Apply default conversions. */
4249 /* Remember whether we're doing / or %. */
4250 bool doing_div_or_mod
= false;
4252 /* Remember whether we're doing << or >>. */
4253 bool doing_shift
= false;
4255 /* Tree holding instrumentation expression. */
4256 tree instrument_expr
= NULL_TREE
;
4258 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4259 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4260 || code
== TRUTH_XOR_EXPR
)
4262 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4263 op0
= decay_conversion (op0
, complain
);
4264 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4265 op1
= decay_conversion (op1
, complain
);
4269 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4270 op0
= cp_default_conversion (op0
, complain
);
4271 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4272 op1
= cp_default_conversion (op1
, complain
);
4275 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4276 STRIP_TYPE_NOPS (op0
);
4277 STRIP_TYPE_NOPS (op1
);
4279 /* DTRT if one side is an overloaded function, but complain about it. */
4280 if (type_unknown_p (op0
))
4282 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4283 if (t
!= error_mark_node
)
4285 if (complain
& tf_error
)
4286 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4291 if (type_unknown_p (op1
))
4293 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4294 if (t
!= error_mark_node
)
4296 if (complain
& tf_error
)
4297 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4303 type0
= TREE_TYPE (op0
);
4304 type1
= TREE_TYPE (op1
);
4306 /* The expression codes of the data types of the arguments tell us
4307 whether the arguments are integers, floating, pointers, etc. */
4308 code0
= TREE_CODE (type0
);
4309 code1
= TREE_CODE (type1
);
4311 /* If an error was already reported for one of the arguments,
4312 avoid reporting another error. */
4313 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4314 return error_mark_node
;
4316 if ((invalid_op_diag
4317 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4319 if (complain
& tf_error
)
4320 error (invalid_op_diag
);
4321 return error_mark_node
;
4324 /* Issue warnings about peculiar, but valid, uses of NULL. */
4325 if ((null_node_p (orig_op0
) || null_node_p (orig_op1
))
4326 /* It's reasonable to use pointer values as operands of &&
4327 and ||, so NULL is no exception. */
4328 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4329 && ( /* Both are NULL (or 0) and the operation was not a
4330 comparison or a pointer subtraction. */
4331 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4332 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4333 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4334 || (!null_ptr_cst_p (orig_op0
)
4335 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4336 || (!null_ptr_cst_p (orig_op1
)
4337 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4338 && (complain
& tf_warning
))
4340 source_location loc
=
4341 expansion_point_location_if_in_system_header (input_location
);
4343 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4346 /* In case when one of the operands of the binary operation is
4347 a vector and another is a scalar -- convert scalar to vector. */
4348 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4350 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4351 complain
& tf_error
);
4353 switch (convert_flag
)
4356 return error_mark_node
;
4359 op0
= convert (TREE_TYPE (type1
), op0
);
4360 op0
= save_expr (op0
);
4361 op0
= build_vector_from_val (type1
, op0
);
4362 type0
= TREE_TYPE (op0
);
4363 code0
= TREE_CODE (type0
);
4369 op1
= convert (TREE_TYPE (type0
), op1
);
4370 op1
= save_expr (op1
);
4371 op1
= build_vector_from_val (type0
, op1
);
4372 type1
= TREE_TYPE (op1
);
4373 code1
= TREE_CODE (type1
);
4385 /* Subtraction of two similar pointers.
4386 We must subtract them as integers, then divide by object size. */
4387 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4388 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4391 result
= pointer_diff (location
, op0
, op1
,
4392 common_pointer_type (type0
, type1
), complain
,
4394 if (instrument_expr
!= NULL
)
4395 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
4396 instrument_expr
, result
);
4400 /* In all other cases except pointer - int, the usual arithmetic
4402 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4407 /* The pointer - int case is just like pointer + int; fall
4411 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4412 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4416 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4417 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4418 if (processing_template_decl
)
4420 result_type
= TREE_TYPE (ptr_operand
);
4423 return cp_pointer_int_sum (location
, code
,
4435 case TRUNC_DIV_EXPR
:
4437 case FLOOR_DIV_EXPR
:
4438 case ROUND_DIV_EXPR
:
4439 case EXACT_DIV_EXPR
:
4440 if (TREE_CODE (op0
) == SIZEOF_EXPR
&& TREE_CODE (op1
) == SIZEOF_EXPR
)
4442 tree type0
= TREE_OPERAND (op0
, 0);
4443 tree type1
= TREE_OPERAND (op1
, 0);
4444 tree first_arg
= type0
;
4445 if (!TYPE_P (type0
))
4446 type0
= TREE_TYPE (type0
);
4447 if (!TYPE_P (type1
))
4448 type1
= TREE_TYPE (type1
);
4449 if (POINTER_TYPE_P (type0
) && same_type_p (TREE_TYPE (type0
), type1
)
4450 && !(TREE_CODE (first_arg
) == PARM_DECL
4451 && DECL_ARRAY_PARAMETER_P (first_arg
)
4452 && warn_sizeof_array_argument
)
4453 && (complain
& tf_warning
))
4454 if (warning_at (location
, OPT_Wsizeof_pointer_div
,
4455 "division %<sizeof (%T) / sizeof (%T)%> does "
4456 "not compute the number of array elements",
4458 if (DECL_P (first_arg
))
4459 inform (DECL_SOURCE_LOCATION (first_arg
),
4460 "first %<sizeof%> operand was declared here");
4463 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4464 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4465 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4466 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4468 enum tree_code tcode0
= code0
, tcode1
= code1
;
4469 tree cop1
= fold_non_dependent_expr (op1
);
4470 doing_div_or_mod
= true;
4471 warn_for_div_by_zero (location
, cop1
);
4473 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4474 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4475 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4476 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4478 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4479 resultcode
= RDIV_EXPR
;
4481 /* When dividing two signed integers, we have to promote to int.
4482 unless we divide by a constant != -1. Note that default
4483 conversion will have been performed on the operands at this
4484 point, so we have to dig out the original type to find out if
4486 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4487 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4488 || (TREE_CODE (op1
) == INTEGER_CST
4489 && ! integer_all_onesp (op1
)));
4498 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4499 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4500 && !VECTOR_FLOAT_TYPE_P (type0
)
4501 && !VECTOR_FLOAT_TYPE_P (type1
)))
4505 case TRUNC_MOD_EXPR
:
4506 case FLOOR_MOD_EXPR
:
4508 tree cop1
= fold_non_dependent_expr (op1
);
4509 doing_div_or_mod
= true;
4510 warn_for_div_by_zero (location
, cop1
);
4513 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4514 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4515 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4517 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4519 /* Although it would be tempting to shorten always here, that loses
4520 on some targets, since the modulo instruction is undefined if the
4521 quotient can't be represented in the computation mode. We shorten
4522 only if unsigned or if dividing by something we know != -1. */
4523 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4524 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4525 || (TREE_CODE (op1
) == INTEGER_CST
4526 && ! integer_all_onesp (op1
)));
4531 case TRUTH_ANDIF_EXPR
:
4532 case TRUTH_ORIF_EXPR
:
4533 case TRUTH_AND_EXPR
:
4535 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4537 if (!COMPARISON_CLASS_P (op1
))
4538 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4539 build_zero_cst (type1
), complain
);
4540 if (code
== TRUTH_ANDIF_EXPR
)
4542 tree z
= build_zero_cst (TREE_TYPE (op1
));
4543 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4545 else if (code
== TRUTH_ORIF_EXPR
)
4547 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4548 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4553 if (VECTOR_TYPE_P (type0
))
4555 if (!COMPARISON_CLASS_P (op0
))
4556 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4557 build_zero_cst (type0
), complain
);
4558 if (!VECTOR_TYPE_P (type1
))
4560 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4561 tree z
= build_zero_cst (TREE_TYPE (op0
));
4562 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4564 else if (!COMPARISON_CLASS_P (op1
))
4565 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4566 build_zero_cst (type1
), complain
);
4568 if (code
== TRUTH_ANDIF_EXPR
)
4569 code
= BIT_AND_EXPR
;
4570 else if (code
== TRUTH_ORIF_EXPR
)
4571 code
= BIT_IOR_EXPR
;
4575 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4578 result_type
= boolean_type_node
;
4581 /* Shift operations: result has same type as first operand;
4582 always convert second operand to int.
4583 Also set SHORT_SHIFT if shifting rightward. */
4586 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4587 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4589 result_type
= type0
;
4592 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4593 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4594 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4595 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
4596 TYPE_VECTOR_SUBPARTS (type1
)))
4598 result_type
= type0
;
4601 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4603 tree const_op1
= fold_non_dependent_expr (op1
);
4604 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4606 result_type
= type0
;
4608 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4610 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4612 if ((complain
& tf_warning
)
4613 && c_inhibit_evaluation_warnings
== 0)
4614 warning (OPT_Wshift_count_negative
,
4615 "right shift count is negative");
4619 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4620 && (complain
& tf_warning
)
4621 && c_inhibit_evaluation_warnings
== 0)
4622 warning (OPT_Wshift_count_overflow
,
4623 "right shift count >= width of type");
4626 /* Avoid converting op1 to result_type later. */
4632 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4633 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4635 result_type
= type0
;
4638 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4639 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4640 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4641 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
4642 TYPE_VECTOR_SUBPARTS (type1
)))
4644 result_type
= type0
;
4647 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4649 tree const_op0
= fold_non_dependent_expr (op0
);
4650 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4652 tree const_op1
= fold_non_dependent_expr (op1
);
4653 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4655 result_type
= type0
;
4657 if (TREE_CODE (const_op0
) == INTEGER_CST
4658 && tree_int_cst_sgn (const_op0
) < 0
4659 && (complain
& tf_warning
)
4660 && c_inhibit_evaluation_warnings
== 0)
4661 warning (OPT_Wshift_negative_value
,
4662 "left shift of negative value");
4663 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4665 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4667 if ((complain
& tf_warning
)
4668 && c_inhibit_evaluation_warnings
== 0)
4669 warning (OPT_Wshift_count_negative
,
4670 "left shift count is negative");
4672 else if (compare_tree_int (const_op1
,
4673 TYPE_PRECISION (type0
)) >= 0)
4675 if ((complain
& tf_warning
)
4676 && c_inhibit_evaluation_warnings
== 0)
4677 warning (OPT_Wshift_count_overflow
,
4678 "left shift count >= width of type");
4680 else if (TREE_CODE (const_op0
) == INTEGER_CST
4681 && (complain
& tf_warning
))
4682 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4684 /* Avoid converting op1 to result_type later. */
4691 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4693 result_type
= type0
;
4694 if (TREE_CODE (op1
) == INTEGER_CST
)
4696 if (tree_int_cst_lt (op1
, integer_zero_node
))
4698 if (complain
& tf_warning
)
4699 warning (0, (code
== LROTATE_EXPR
)
4700 ? G_("left rotate count is negative")
4701 : G_("right rotate count is negative"));
4703 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4705 if (complain
& tf_warning
)
4706 warning (0, (code
== LROTATE_EXPR
)
4707 ? G_("left rotate count >= width of type")
4708 : G_("right rotate count >= width of type"));
4711 /* Convert the shift-count to an integer, regardless of
4712 size of value being shifted. */
4713 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4714 op1
= cp_convert (integer_type_node
, op1
, complain
);
4720 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4721 goto vector_compare
;
4722 if ((complain
& tf_warning
)
4723 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4724 warning (OPT_Wfloat_equal
,
4725 "comparing floating point with == or != is unsafe");
4726 if ((complain
& tf_warning
)
4727 && ((TREE_CODE (orig_op0
) == STRING_CST
4728 && !integer_zerop (cp_fully_fold (op1
)))
4729 || (TREE_CODE (orig_op1
) == STRING_CST
4730 && !integer_zerop (cp_fully_fold (op0
)))))
4731 warning (OPT_Waddress
, "comparison with string literal results "
4732 "in unspecified behavior");
4734 build_type
= boolean_type_node
;
4735 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4736 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4737 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4738 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4740 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4741 && null_ptr_cst_p (orig_op1
))
4742 /* Handle, eg, (void*)0 (c++/43906), and more. */
4743 || (code0
== POINTER_TYPE
4744 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4746 if (TYPE_PTR_P (type1
))
4747 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4748 CPO_COMPARISON
, complain
);
4750 result_type
= type0
;
4752 if (char_type_p (TREE_TYPE (orig_op1
))
4753 && warning (OPT_Wpointer_compare
,
4754 "comparison between pointer and zero character "
4756 inform (input_location
,
4757 "did you mean to dereference the pointer?");
4758 warn_for_null_address (location
, op0
, complain
);
4760 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4761 && null_ptr_cst_p (orig_op0
))
4762 /* Handle, eg, (void*)0 (c++/43906), and more. */
4763 || (code1
== POINTER_TYPE
4764 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4766 if (TYPE_PTR_P (type0
))
4767 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4768 CPO_COMPARISON
, complain
);
4770 result_type
= type1
;
4772 if (char_type_p (TREE_TYPE (orig_op0
))
4773 && warning (OPT_Wpointer_compare
,
4774 "comparison between pointer and zero character "
4776 inform (input_location
,
4777 "did you mean to dereference the pointer?");
4778 warn_for_null_address (location
, op1
, complain
);
4780 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4781 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4782 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4783 CPO_COMPARISON
, complain
);
4784 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
4785 /* One of the operands must be of nullptr_t type. */
4786 result_type
= TREE_TYPE (nullptr_node
);
4787 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4789 result_type
= type0
;
4790 if (complain
& tf_error
)
4791 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4793 return error_mark_node
;
4795 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4797 result_type
= type1
;
4798 if (complain
& tf_error
)
4799 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4801 return error_mark_node
;
4803 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (orig_op1
))
4805 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4806 == ptrmemfunc_vbit_in_delta
)
4808 tree pfn0
, delta0
, e1
, e2
;
4810 if (TREE_SIDE_EFFECTS (op0
))
4811 op0
= save_expr (op0
);
4813 pfn0
= pfn_from_ptrmemfunc (op0
);
4814 delta0
= delta_from_ptrmemfunc (op0
);
4815 e1
= cp_build_binary_op (location
,
4818 build_zero_cst (TREE_TYPE (pfn0
)),
4820 e2
= cp_build_binary_op (location
,
4826 if (complain
& tf_warning
)
4827 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4829 e2
= cp_build_binary_op (location
,
4830 EQ_EXPR
, e2
, integer_zero_node
,
4832 op0
= cp_build_binary_op (location
,
4833 TRUTH_ANDIF_EXPR
, e1
, e2
,
4835 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4839 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4840 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4842 result_type
= TREE_TYPE (op0
);
4844 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (orig_op0
))
4845 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4846 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4849 /* E will be the final comparison. */
4851 /* E1 and E2 are for scratch. */
4859 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4860 CPO_COMPARISON
, complain
);
4862 if (!same_type_p (TREE_TYPE (op0
), type
))
4863 op0
= cp_convert_and_check (type
, op0
, complain
);
4864 if (!same_type_p (TREE_TYPE (op1
), type
))
4865 op1
= cp_convert_and_check (type
, op1
, complain
);
4867 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4868 return error_mark_node
;
4870 if (TREE_SIDE_EFFECTS (op0
))
4871 op0
= save_expr (op0
);
4872 if (TREE_SIDE_EFFECTS (op1
))
4873 op1
= save_expr (op1
);
4875 pfn0
= pfn_from_ptrmemfunc (op0
);
4876 pfn0
= cp_fully_fold (pfn0
);
4877 /* Avoid -Waddress warnings (c++/64877). */
4878 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4879 TREE_NO_WARNING (pfn0
) = 1;
4880 pfn1
= pfn_from_ptrmemfunc (op1
);
4881 pfn1
= cp_fully_fold (pfn1
);
4882 delta0
= delta_from_ptrmemfunc (op0
);
4883 delta1
= delta_from_ptrmemfunc (op1
);
4884 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4885 == ptrmemfunc_vbit_in_delta
)
4890 && ((op0.delta == op1.delta)
4891 || (!op0.pfn && op0.delta & 1 == 0
4892 && op1.delta & 1 == 0))
4894 The reason for the `!op0.pfn' bit is that a NULL
4895 pointer-to-member is any member with a zero PFN and
4896 LSB of the DELTA field is 0. */
4898 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4902 e1
= cp_build_binary_op (location
,
4903 EQ_EXPR
, e1
, integer_zero_node
,
4905 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4909 e2
= cp_build_binary_op (location
,
4910 EQ_EXPR
, e2
, integer_zero_node
,
4912 e1
= cp_build_binary_op (location
,
4913 TRUTH_ANDIF_EXPR
, e2
, e1
,
4915 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4917 build_zero_cst (TREE_TYPE (pfn0
)),
4919 e2
= cp_build_binary_op (location
,
4920 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4921 e1
= cp_build_binary_op (location
,
4922 EQ_EXPR
, delta0
, delta1
, complain
);
4923 e1
= cp_build_binary_op (location
,
4924 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4931 && (!op0.pfn || op0.delta == op1.delta))
4933 The reason for the `!op0.pfn' bit is that a NULL
4934 pointer-to-member is any member with a zero PFN; the
4935 DELTA field is unspecified. */
4937 e1
= cp_build_binary_op (location
,
4938 EQ_EXPR
, delta0
, delta1
, complain
);
4939 e2
= cp_build_binary_op (location
,
4942 build_zero_cst (TREE_TYPE (pfn0
)),
4944 e1
= cp_build_binary_op (location
,
4945 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4947 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4948 e
= cp_build_binary_op (location
,
4949 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4950 if (code
== EQ_EXPR
)
4952 return cp_build_binary_op (location
,
4953 EQ_EXPR
, e
, integer_zero_node
, complain
);
4957 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4958 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4960 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4961 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4969 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4970 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4972 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4973 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4974 CPO_COMPARISON
, complain
);
4981 if (TREE_CODE (orig_op0
) == STRING_CST
4982 || TREE_CODE (orig_op1
) == STRING_CST
)
4984 if (complain
& tf_warning
)
4985 warning (OPT_Waddress
, "comparison with string literal results "
4986 "in unspecified behavior");
4989 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4993 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4995 && !vector_types_compatible_elements_p (type0
, type1
))
4997 if (complain
& tf_error
)
4999 error_at (location
, "comparing vectors with different "
5001 inform (location
, "operand types are %qT and %qT",
5004 return error_mark_node
;
5007 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type0
),
5008 TYPE_VECTOR_SUBPARTS (type1
)))
5010 if (complain
& tf_error
)
5012 error_at (location
, "comparing vectors with different "
5013 "number of elements");
5014 inform (location
, "operand types are %qT and %qT",
5017 return error_mark_node
;
5020 /* It's not precisely specified how the usual arithmetic
5021 conversions apply to the vector types. Here, we use
5022 the unsigned type if one of the operands is signed and
5023 the other one is unsigned. */
5024 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
5026 if (!TYPE_UNSIGNED (type0
))
5027 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
5029 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
5030 warning_at (location
, OPT_Wsign_compare
, "comparison between "
5031 "types %qT and %qT", type0
, type1
);
5034 /* Always construct signed integer vector type. */
5035 intt
= c_common_type_for_size
5036 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (type0
))), 0);
5039 if (complain
& tf_error
)
5040 error_at (location
, "could not find an integer type "
5041 "of the same size as %qT", TREE_TYPE (type0
));
5042 return error_mark_node
;
5044 result_type
= build_opaque_vector_type (intt
,
5045 TYPE_VECTOR_SUBPARTS (type0
));
5047 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
5049 build_type
= boolean_type_node
;
5050 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
5051 || code0
== ENUMERAL_TYPE
)
5052 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5053 || code1
== ENUMERAL_TYPE
))
5055 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
5056 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
5057 CPO_COMPARISON
, complain
);
5058 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (orig_op1
))
5060 result_type
= type0
;
5061 if (extra_warnings
&& (complain
& tf_warning
))
5062 warning (OPT_Wextra
,
5063 "ordered comparison of pointer with integer zero");
5065 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (orig_op0
))
5067 result_type
= type1
;
5068 if (extra_warnings
&& (complain
& tf_warning
))
5069 warning (OPT_Wextra
,
5070 "ordered comparison of pointer with integer zero");
5072 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
5073 /* One of the operands must be of nullptr_t type. */
5074 result_type
= TREE_TYPE (nullptr_node
);
5075 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5077 result_type
= type0
;
5078 if (complain
& tf_error
)
5079 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5081 return error_mark_node
;
5083 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
5085 result_type
= type1
;
5086 if (complain
& tf_error
)
5087 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5089 return error_mark_node
;
5092 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
5093 && sanitize_flags_p (SANITIZE_POINTER_COMPARE
))
5095 op0
= save_expr (op0
);
5096 op1
= save_expr (op1
);
5098 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_COMPARE
);
5099 instrument_expr
= build_call_expr_loc (location
, tt
, 2, op0
, op1
);
5104 case UNORDERED_EXPR
:
5111 build_type
= integer_type_node
;
5112 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
5114 if (complain
& tf_error
)
5115 error ("unordered comparison on non-floating point argument");
5116 return error_mark_node
;
5125 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
5126 || code0
== ENUMERAL_TYPE
)
5127 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5128 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
5129 arithmetic_types_p
= 1;
5132 arithmetic_types_p
= 0;
5133 /* Vector arithmetic is only allowed when both sides are vectors. */
5134 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
5136 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
5137 || !vector_types_compatible_elements_p (type0
, type1
))
5139 if (complain
& tf_error
)
5141 /* "location" already embeds the locations of the
5142 operands, so we don't need to add them separately
5144 rich_location
richloc (line_table
, location
);
5145 binary_op_error (&richloc
, code
, type0
, type1
);
5147 return error_mark_node
;
5149 arithmetic_types_p
= 1;
5152 /* Determine the RESULT_TYPE, if it is not already known. */
5154 && arithmetic_types_p
5155 && (shorten
|| common
|| short_compare
))
5157 result_type
= cp_common_type (type0
, type1
);
5158 if (complain
& tf_warning
)
5159 do_warn_double_promotion (result_type
, type0
, type1
,
5160 "implicit conversion from %qH to %qI "
5161 "to match other operand of binary "
5168 if (complain
& tf_error
)
5170 "invalid operands of types %qT and %qT to binary %qO",
5171 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
5172 return error_mark_node
;
5175 /* If we're in a template, the only thing we need to know is the
5177 if (processing_template_decl
)
5179 /* Since the middle-end checks the type when doing a build2, we
5180 need to build the tree in pieces. This built tree will never
5181 get out of the front-end as we replace it when instantiating
5183 tree tmp
= build2 (resultcode
,
5184 build_type
? build_type
: result_type
,
5186 TREE_OPERAND (tmp
, 0) = op0
;
5190 /* Remember the original type; RESULT_TYPE might be changed later on
5191 by shorten_binary_op. */
5192 tree orig_type
= result_type
;
5194 if (arithmetic_types_p
)
5196 bool first_complex
= (code0
== COMPLEX_TYPE
);
5197 bool second_complex
= (code1
== COMPLEX_TYPE
);
5198 int none_complex
= (!first_complex
&& !second_complex
);
5200 /* Adapted from patch for c/24581. */
5201 if (first_complex
!= second_complex
5202 && (code
== PLUS_EXPR
5203 || code
== MINUS_EXPR
5204 || code
== MULT_EXPR
5205 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5206 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5207 && flag_signed_zeros
)
5209 /* An operation on mixed real/complex operands must be
5210 handled specially, but the language-independent code can
5211 more easily optimize the plain complex arithmetic if
5212 -fno-signed-zeros. */
5213 tree real_type
= TREE_TYPE (result_type
);
5217 if (TREE_TYPE (op0
) != result_type
)
5218 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5219 if (TREE_TYPE (op1
) != real_type
)
5220 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5224 if (TREE_TYPE (op0
) != real_type
)
5225 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5226 if (TREE_TYPE (op1
) != result_type
)
5227 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5229 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5230 return error_mark_node
;
5233 op0
= save_expr (op0
);
5234 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
5235 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
5239 case TRUNC_DIV_EXPR
:
5240 op1
= save_expr (op1
);
5241 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5245 real
= build2 (resultcode
, real_type
, real
, op1
);
5253 op1
= save_expr (op1
);
5254 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
5255 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
5259 op0
= save_expr (op0
);
5260 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5263 real
= build2 (resultcode
, real_type
, op0
, real
);
5266 real
= build2 (resultcode
, real_type
, op0
, real
);
5267 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5273 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5277 /* For certain operations (which identify themselves by shorten != 0)
5278 if both args were extended from the same smaller type,
5279 do the arithmetic in that type and then extend.
5281 shorten !=0 and !=1 indicates a bitwise operation.
5282 For them, this optimization is safe only if
5283 both args are zero-extended or both are sign-extended.
5284 Otherwise, we might change the result.
5285 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5286 but calculated in (unsigned short) it would be (unsigned short)-1. */
5288 if (shorten
&& none_complex
)
5290 final_type
= result_type
;
5291 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5295 /* Comparison operations are shortened too but differently.
5296 They identify themselves by setting short_compare = 1. */
5300 /* We call shorten_compare only for diagnostic-reason. */
5301 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5302 xresult_type
= result_type
;
5303 enum tree_code xresultcode
= resultcode
;
5304 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5308 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5309 && warn_sign_compare
5310 /* Do not warn until the template is instantiated; we cannot
5311 bound the ranges of the arguments until that point. */
5312 && !processing_template_decl
5313 && (complain
& tf_warning
)
5314 && c_inhibit_evaluation_warnings
== 0
5315 /* Even unsigned enum types promote to signed int. We don't
5316 want to issue -Wsign-compare warnings for this case. */
5317 && !enum_cast_to_int (orig_op0
)
5318 && !enum_cast_to_int (orig_op1
))
5320 tree oop0
= maybe_constant_value (orig_op0
);
5321 tree oop1
= maybe_constant_value (orig_op1
);
5323 if (TREE_CODE (oop0
) != INTEGER_CST
)
5324 oop0
= cp_fully_fold (orig_op0
);
5325 if (TREE_CODE (oop1
) != INTEGER_CST
)
5326 oop1
= cp_fully_fold (orig_op1
);
5327 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5328 result_type
, resultcode
);
5332 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5333 Then the expression will be built.
5334 It will be given type FINAL_TYPE if that is nonzero;
5335 otherwise, it will be given type RESULT_TYPE. */
5338 if (TREE_TYPE (op0
) != result_type
)
5339 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5340 if (TREE_TYPE (op1
) != result_type
)
5341 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5343 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5344 return error_mark_node
;
5347 if (build_type
== NULL_TREE
)
5348 build_type
= result_type
;
5350 if (sanitize_flags_p ((SANITIZE_SHIFT
5351 | SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5352 && current_function_decl
!= NULL_TREE
5353 && !processing_template_decl
5354 && (doing_div_or_mod
|| doing_shift
))
5356 /* OP0 and/or OP1 might have side-effects. */
5357 op0
= cp_save_expr (op0
);
5358 op1
= cp_save_expr (op1
);
5359 op0
= fold_non_dependent_expr (op0
);
5360 op1
= fold_non_dependent_expr (op1
);
5361 if (doing_div_or_mod
5362 && sanitize_flags_p (SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5364 /* For diagnostics we want to use the promoted types without
5365 shorten_binary_op. So convert the arguments to the
5366 original result_type. */
5369 if (TREE_TYPE (cop0
) != orig_type
)
5370 cop0
= cp_convert (orig_type
, op0
, complain
);
5371 if (TREE_TYPE (cop1
) != orig_type
)
5372 cop1
= cp_convert (orig_type
, op1
, complain
);
5373 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5375 else if (doing_shift
&& sanitize_flags_p (SANITIZE_SHIFT
))
5376 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5379 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5380 if (final_type
!= 0)
5381 result
= cp_convert (final_type
, result
, complain
);
5383 if (instrument_expr
!= NULL
)
5384 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5385 instrument_expr
, result
);
5387 if (!processing_template_decl
)
5389 op0
= cp_fully_fold (op0
);
5390 /* Only consider the second argument if the first isn't overflowed. */
5391 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5393 op1
= cp_fully_fold (op1
);
5394 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5397 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5398 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5401 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5402 if (TREE_OVERFLOW_P (result_ovl
))
5403 overflow_warning (location
, result_ovl
);
5408 /* Build a VEC_PERM_EXPR.
5409 This is a simple wrapper for c_build_vec_perm_expr. */
5411 build_x_vec_perm_expr (location_t loc
,
5412 tree arg0
, tree arg1
, tree arg2
,
5413 tsubst_flags_t complain
)
5415 tree orig_arg0
= arg0
;
5416 tree orig_arg1
= arg1
;
5417 tree orig_arg2
= arg2
;
5418 if (processing_template_decl
)
5420 if (type_dependent_expression_p (arg0
)
5421 || type_dependent_expression_p (arg1
)
5422 || type_dependent_expression_p (arg2
))
5423 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5424 arg0
= build_non_dependent_expr (arg0
);
5426 arg1
= build_non_dependent_expr (arg1
);
5427 arg2
= build_non_dependent_expr (arg2
);
5429 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5430 if (processing_template_decl
&& exp
!= error_mark_node
)
5431 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5432 orig_arg1
, orig_arg2
);
5436 /* Return a tree for the sum or difference (RESULTCODE says which)
5437 of pointer PTROP and integer INTOP. */
5440 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5441 tree intop
, tsubst_flags_t complain
)
5443 tree res_type
= TREE_TYPE (ptrop
);
5445 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5446 in certain circumstance (when it's valid to do so). So we need
5447 to make sure it's complete. We don't need to check here, if we
5448 can actually complete it at all, as those checks will be done in
5449 pointer_int_sum() anyway. */
5450 complete_type (TREE_TYPE (res_type
));
5452 return pointer_int_sum (loc
, resultcode
, ptrop
,
5453 intop
, complain
& tf_warning_or_error
);
5456 /* Return a tree for the difference of pointers OP0 and OP1.
5457 The resulting tree has type int. If POINTER_SUBTRACT sanitization is
5458 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
5461 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5462 tsubst_flags_t complain
, tree
*instrument_expr
)
5464 tree result
, inttype
;
5465 tree restype
= ptrdiff_type_node
;
5466 tree target_type
= TREE_TYPE (ptrtype
);
5468 if (!complete_type_or_else (target_type
, NULL_TREE
))
5469 return error_mark_node
;
5471 if (VOID_TYPE_P (target_type
))
5473 if (complain
& tf_error
)
5474 permerror (loc
, "ISO C++ forbids using pointer of "
5475 "type %<void *%> in subtraction");
5477 return error_mark_node
;
5479 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5481 if (complain
& tf_error
)
5482 permerror (loc
, "ISO C++ forbids using pointer to "
5483 "a function in subtraction");
5485 return error_mark_node
;
5487 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5489 if (complain
& tf_error
)
5490 permerror (loc
, "ISO C++ forbids using pointer to "
5491 "a method in subtraction");
5493 return error_mark_node
;
5496 /* Determine integer type result of the subtraction. This will usually
5497 be the same as the result type (ptrdiff_t), but may need to be a wider
5498 type if pointers for the address space are wider than ptrdiff_t. */
5499 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
5500 inttype
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
5504 if (sanitize_flags_p (SANITIZE_POINTER_SUBTRACT
))
5506 op0
= save_expr (op0
);
5507 op1
= save_expr (op1
);
5509 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_SUBTRACT
);
5510 *instrument_expr
= build_call_expr_loc (loc
, tt
, 2, op0
, op1
);
5513 /* First do the subtraction, then build the divide operator
5514 and only convert at the very end.
5515 Do not do default conversions in case restype is a short type. */
5517 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
5518 pointers. If some platform cannot provide that, or has a larger
5519 ptrdiff_type to support differences larger than half the address
5520 space, cast the pointers to some larger integer type and do the
5521 computations in that type. */
5522 if (TYPE_PRECISION (inttype
) > TYPE_PRECISION (TREE_TYPE (op0
)))
5523 op0
= cp_build_binary_op (loc
,
5525 cp_convert (inttype
, op0
, complain
),
5526 cp_convert (inttype
, op1
, complain
),
5529 op0
= build2_loc (loc
, POINTER_DIFF_EXPR
, inttype
, op0
, op1
);
5531 /* This generates an error if op1 is a pointer to an incomplete type. */
5532 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5534 if (complain
& tf_error
)
5535 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5536 "pointer arithmetic");
5538 return error_mark_node
;
5541 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5543 if (complain
& tf_error
)
5544 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5546 return error_mark_node
;
5549 op1
= (TYPE_PTROB_P (ptrtype
)
5550 ? size_in_bytes_loc (loc
, target_type
)
5551 : integer_one_node
);
5553 /* Do the division. */
5555 result
= build2_loc (loc
, EXACT_DIV_EXPR
, inttype
, op0
,
5556 cp_convert (inttype
, op1
, complain
));
5557 return cp_convert (restype
, result
, complain
);
5560 /* Construct and perhaps optimize a tree representation
5561 for a unary operation. CODE, a tree_code, specifies the operation
5562 and XARG is the operand. */
5565 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5566 tsubst_flags_t complain
)
5568 tree orig_expr
= xarg
;
5571 tree overload
= NULL_TREE
;
5573 if (processing_template_decl
)
5575 if (type_dependent_expression_p (xarg
))
5576 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5578 xarg
= build_non_dependent_expr (xarg
);
5583 /* [expr.unary.op] says:
5585 The address of an object of incomplete type can be taken.
5587 (And is just the ordinary address operator, not an overloaded
5588 "operator &".) However, if the type is a template
5589 specialization, we must complete the type at this point so that
5590 an overloaded "operator &" will be available if required. */
5591 if (code
== ADDR_EXPR
5592 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5593 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5594 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5595 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5596 /* Don't look for a function. */;
5598 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5599 NULL_TREE
, &overload
, complain
);
5601 if (!exp
&& code
== ADDR_EXPR
)
5603 if (is_overloaded_fn (xarg
))
5605 tree fn
= get_first_fn (xarg
);
5606 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5608 if (complain
& tf_error
)
5609 error (DECL_CONSTRUCTOR_P (fn
)
5610 ? G_("taking address of constructor %qD")
5611 : G_("taking address of destructor %qD"),
5613 return error_mark_node
;
5617 /* A pointer to member-function can be formed only by saying
5619 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5620 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5622 if (TREE_CODE (xarg
) != OFFSET_REF
5623 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5625 if (complain
& tf_error
)
5627 error ("invalid use of %qE to form a "
5628 "pointer-to-member-function", xarg
.get_value ());
5629 if (TREE_CODE (xarg
) != OFFSET_REF
)
5630 inform (input_location
, " a qualified-id is required");
5632 return error_mark_node
;
5636 if (complain
& tf_error
)
5637 error ("parentheses around %qE cannot be used to form a"
5638 " pointer-to-member-function",
5641 return error_mark_node
;
5642 PTRMEM_OK_P (xarg
) = 1;
5646 if (TREE_CODE (xarg
) == OFFSET_REF
)
5648 ptrmem
= PTRMEM_OK_P (xarg
);
5650 if (!ptrmem
&& !flag_ms_extensions
5651 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5653 /* A single non-static member, make sure we don't allow a
5654 pointer-to-member. */
5655 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5656 TREE_OPERAND (xarg
, 0),
5657 ovl_make (TREE_OPERAND (xarg
, 1)));
5658 PTRMEM_OK_P (xarg
) = ptrmem
;
5662 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5665 if (processing_template_decl
&& exp
!= error_mark_node
)
5667 if (overload
!= NULL_TREE
)
5668 return (build_min_non_dep_op_overload
5669 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5671 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5672 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5674 if (TREE_CODE (exp
) == ADDR_EXPR
)
5675 PTRMEM_OK_P (exp
) = ptrmem
;
5679 /* Construct and perhaps optimize a tree representation
5680 for __builtin_addressof operation. ARG specifies the operand. */
5683 cp_build_addressof (location_t loc
, tree arg
, tsubst_flags_t complain
)
5685 tree orig_expr
= arg
;
5687 if (processing_template_decl
)
5689 if (type_dependent_expression_p (arg
))
5690 return build_min_nt_loc (loc
, ADDRESSOF_EXPR
, arg
, NULL_TREE
);
5692 arg
= build_non_dependent_expr (arg
);
5695 tree exp
= cp_build_addr_expr_strict (arg
, complain
);
5697 if (processing_template_decl
&& exp
!= error_mark_node
)
5698 exp
= build_min_non_dep (ADDRESSOF_EXPR
, exp
, orig_expr
, NULL_TREE
);
5702 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5703 constants, where a null value is represented by an INTEGER_CST of
5707 cp_truthvalue_conversion (tree expr
)
5709 tree type
= TREE_TYPE (expr
);
5710 if (TYPE_PTR_OR_PTRMEM_P (type
)
5711 /* Avoid ICE on invalid use of non-static member function. */
5712 || TREE_CODE (expr
) == FUNCTION_DECL
)
5713 return build_binary_op (input_location
, NE_EXPR
, expr
, nullptr_node
, true);
5715 return c_common_truthvalue_conversion (input_location
, expr
);
5718 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5721 condition_conversion (tree expr
)
5724 /* Anything that might happen in a template should go through
5725 maybe_convert_cond. */
5726 gcc_assert (!processing_template_decl
);
5727 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5728 tf_warning_or_error
, LOOKUP_NORMAL
);
5729 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5733 /* Returns the address of T. This function will fold away
5734 ADDR_EXPR of INDIRECT_REF. */
5737 build_address (tree t
)
5739 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5740 return error_mark_node
;
5741 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
5742 || processing_template_decl
);
5743 t
= build_fold_addr_expr_loc (EXPR_LOCATION (t
), t
);
5744 if (TREE_CODE (t
) != ADDR_EXPR
)
5749 /* Return a NOP_EXPR converting EXPR to TYPE. */
5752 build_nop (tree type
, tree expr
)
5754 if (type
== error_mark_node
|| error_operand_p (expr
))
5756 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5759 /* Take the address of ARG, whatever that means under C++ semantics.
5760 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5761 and class rvalues as well.
5763 Nothing should call this function directly; instead, callers should use
5764 cp_build_addr_expr or cp_build_addr_expr_strict. */
5767 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5772 if (!arg
|| error_operand_p (arg
))
5773 return error_mark_node
;
5775 arg
= mark_lvalue_use (arg
);
5776 if (error_operand_p (arg
))
5777 return error_mark_node
;
5779 argtype
= lvalue_type (arg
);
5781 gcc_assert (!(identifier_p (arg
) && IDENTIFIER_ANY_OP_P (arg
)));
5783 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5784 && !really_overloaded_fn (arg
))
5786 /* They're trying to take the address of a unique non-static
5787 member function. This is ill-formed (except in MS-land),
5788 but let's try to DTRT.
5789 Note: We only handle unique functions here because we don't
5790 want to complain if there's a static overload; non-unique
5791 cases will be handled by instantiate_type. But we need to
5792 handle this case here to allow casts on the resulting PMF.
5793 We could defer this in non-MS mode, but it's easier to give
5794 a useful error here. */
5796 /* Inside constant member functions, the `this' pointer
5797 contains an extra const qualifier. TYPE_MAIN_VARIANT
5798 is used here to remove this const from the diagnostics
5799 and the created OFFSET_REF. */
5800 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5801 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5802 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5803 return error_mark_node
;
5805 if (! flag_ms_extensions
)
5807 tree name
= DECL_NAME (fn
);
5808 if (!(complain
& tf_error
))
5809 return error_mark_node
;
5810 else if (current_class_type
5811 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5812 /* An expression like &memfn. */
5813 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5814 " or parenthesized non-static member function to form"
5815 " a pointer to member function. Say %<&%T::%D%>",
5818 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5819 " function to form a pointer to member function."
5823 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5826 /* Uninstantiated types are all functions. Taking the
5827 address of a function is a no-op, so just return the
5829 if (type_unknown_p (arg
))
5830 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5832 if (TREE_CODE (arg
) == OFFSET_REF
)
5833 /* We want a pointer to member; bypass all the code for actually taking
5834 the address of something. */
5837 /* Anything not already handled and not a true memory reference
5839 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5840 && TREE_CODE (argtype
) != METHOD_TYPE
)
5842 cp_lvalue_kind kind
= lvalue_kind (arg
);
5843 if (kind
== clk_none
)
5845 if (complain
& tf_error
)
5846 lvalue_error (input_location
, lv_addressof
);
5847 return error_mark_node
;
5849 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5851 if (!(complain
& tf_error
))
5852 return error_mark_node
;
5853 if (kind
& clk_class
)
5854 /* Make this a permerror because we used to accept it. */
5855 permerror (input_location
, "taking address of temporary");
5857 error ("taking address of xvalue (rvalue reference)");
5861 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5863 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5864 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5867 else if (pedantic
&& DECL_MAIN_P (arg
))
5870 /* Apparently a lot of autoconf scripts for C++ packages do this,
5871 so only complain if -Wpedantic. */
5872 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5873 pedwarn (input_location
, OPT_Wpedantic
,
5874 "ISO C++ forbids taking address of function %<::main%>");
5875 else if (flag_pedantic_errors
)
5876 return error_mark_node
;
5879 /* Let &* cancel out to simplify resulting code. */
5880 if (INDIRECT_REF_P (arg
))
5882 arg
= TREE_OPERAND (arg
, 0);
5883 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5885 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5886 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5889 /* Don't let this be an lvalue. */
5894 /* ??? Cope with user tricks that amount to offsetof. */
5895 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5896 && TREE_CODE (argtype
) != METHOD_TYPE
5897 && argtype
!= unknown_type_node
5898 && (val
= get_base_address (arg
))
5899 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5900 && INDIRECT_REF_P (val
)
5901 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5903 tree type
= build_pointer_type (argtype
);
5904 return fold_convert (type
, fold_offsetof_1 (arg
));
5907 /* Handle complex lvalues (when permitted)
5908 by reduction to simpler cases. */
5909 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5913 switch (TREE_CODE (arg
))
5917 case FIX_TRUNC_EXPR
:
5918 /* We should have handled this above in the lvalue_kind check. */
5923 arg
= BASELINK_FUNCTIONS (arg
);
5927 arg
= OVL_FIRST (arg
);
5932 /* Turn a reference to a non-static data member into a
5933 pointer-to-member. */
5938 gcc_assert (PTRMEM_OK_P (arg
));
5940 t
= TREE_OPERAND (arg
, 1);
5941 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5943 if (complain
& tf_error
)
5944 error ("cannot create pointer to reference member %qD", t
);
5945 return error_mark_node
;
5948 type
= build_ptrmem_type (context_for_name_lookup (t
),
5950 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5958 if (argtype
!= error_mark_node
)
5959 argtype
= build_pointer_type (argtype
);
5961 if (bitfield_p (arg
))
5963 if (complain
& tf_error
)
5964 error ("attempt to take address of bit-field");
5965 return error_mark_node
;
5968 /* In a template, we are processing a non-dependent expression
5969 so we can just form an ADDR_EXPR with the correct type. */
5970 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5972 val
= build_address (arg
);
5973 if (TREE_CODE (arg
) == OFFSET_REF
)
5974 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5976 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5978 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5980 /* We can only get here with a single static member
5982 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5983 && DECL_STATIC_FUNCTION_P (fn
));
5984 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5985 return error_mark_node
;
5986 val
= build_address (fn
);
5987 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5988 /* Do not lose object's side effects. */
5989 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5990 TREE_OPERAND (arg
, 0), val
);
5994 tree object
= TREE_OPERAND (arg
, 0);
5995 tree field
= TREE_OPERAND (arg
, 1);
5996 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5997 (TREE_TYPE (object
), decl_type_context (field
)));
5998 val
= build_address (arg
);
6001 if (TYPE_PTR_P (argtype
)
6002 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
6004 build_ptrmemfunc_type (argtype
);
6005 val
= build_ptrmemfunc (argtype
, val
, 0,
6013 /* Take the address of ARG if it has one, even if it's an rvalue. */
6016 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
6018 return cp_build_addr_expr_1 (arg
, 0, complain
);
6021 /* Take the address of ARG, but only if it's an lvalue. */
6024 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
6026 return cp_build_addr_expr_1 (arg
, 1, complain
);
6029 /* C++: Must handle pointers to members.
6031 Perhaps type instantiation should be extended to handle conversion
6032 from aggregates to types we don't yet know we want? (Or are those
6033 cases typically errors which should be reported?)
6035 NOCONVERT suppresses the default promotions (such as from short to int). */
6038 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
6039 tsubst_flags_t complain
)
6041 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
6043 location_t location
= EXPR_LOC_OR_LOC (arg
, input_location
);
6045 const char *errstring
= NULL
;
6047 const char *invalid_op_diag
;
6049 if (!arg
|| error_operand_p (arg
))
6050 return error_mark_node
;
6052 if ((invalid_op_diag
6053 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
6058 if (complain
& tf_error
)
6059 error (invalid_op_diag
);
6060 return error_mark_node
;
6065 case UNARY_PLUS_EXPR
:
6068 int flags
= WANT_ARITH
| WANT_ENUM
;
6069 /* Unary plus (but not unary minus) is allowed on pointers. */
6070 if (code
== UNARY_PLUS_EXPR
)
6071 flags
|= WANT_POINTER
;
6072 arg
= build_expr_type_conversion (flags
, arg
, true);
6074 errstring
= (code
== NEGATE_EXPR
6075 ? _("wrong type argument to unary minus")
6076 : _("wrong type argument to unary plus"));
6079 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6080 arg
= cp_perform_integral_promotions (arg
, complain
);
6082 /* Make sure the result is not an lvalue: a unary plus or minus
6083 expression is always a rvalue. */
6090 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6095 arg
= cp_default_conversion (arg
, complain
);
6096 if (arg
== error_mark_node
)
6097 return error_mark_node
;
6100 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
6101 | WANT_VECTOR_OR_COMPLEX
,
6103 errstring
= _("wrong type argument to bit-complement");
6104 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6106 /* Warn if the expression has boolean value. */
6107 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
6108 && (complain
& tf_warning
)
6109 && warning_at (location
, OPT_Wbool_operation
,
6110 "%<~%> on an expression of type bool"))
6111 inform (location
, "did you mean to use logical not (%<!%>)?");
6112 arg
= cp_perform_integral_promotions (arg
, complain
);
6114 else if (!noconvert
&& VECTOR_TYPE_P (TREE_TYPE (arg
)))
6115 arg
= mark_rvalue_use (arg
);
6119 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6120 errstring
= _("wrong type argument to abs");
6121 else if (!noconvert
)
6123 arg
= cp_default_conversion (arg
, complain
);
6124 if (arg
== error_mark_node
)
6125 return error_mark_node
;
6130 /* Conjugating a real value is a no-op, but allow it anyway. */
6131 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6132 errstring
= _("wrong type argument to conjugation");
6133 else if (!noconvert
)
6135 arg
= cp_default_conversion (arg
, complain
);
6136 if (arg
== error_mark_node
)
6137 return error_mark_node
;
6141 case TRUTH_NOT_EXPR
:
6142 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
6143 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
6144 build_zero_cst (TREE_TYPE (arg
)), complain
);
6145 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
6147 val
= invert_truthvalue_loc (input_location
, arg
);
6148 if (arg
!= error_mark_node
)
6150 errstring
= _("in argument to unary !");
6158 arg
= build_real_imag_expr (input_location
, code
, arg
);
6161 case PREINCREMENT_EXPR
:
6162 case POSTINCREMENT_EXPR
:
6163 case PREDECREMENT_EXPR
:
6164 case POSTDECREMENT_EXPR
:
6165 /* Handle complex lvalues (when permitted)
6166 by reduction to simpler cases. */
6168 val
= unary_complex_lvalue (code
, arg
);
6172 arg
= mark_lvalue_use (arg
);
6174 /* Increment or decrement the real part of the value,
6175 and don't change the imaginary part. */
6176 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6180 arg
= cp_stabilize_reference (arg
);
6181 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
6182 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
6183 real
= cp_build_unary_op (code
, real
, true, complain
);
6184 if (real
== error_mark_node
|| imag
== error_mark_node
)
6185 return error_mark_node
;
6186 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
6190 /* Report invalid types. */
6192 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
6195 if (code
== PREINCREMENT_EXPR
)
6196 errstring
= _("no pre-increment operator for type");
6197 else if (code
== POSTINCREMENT_EXPR
)
6198 errstring
= _("no post-increment operator for type");
6199 else if (code
== PREDECREMENT_EXPR
)
6200 errstring
= _("no pre-decrement operator for type");
6202 errstring
= _("no post-decrement operator for type");
6205 else if (arg
== error_mark_node
)
6206 return error_mark_node
;
6208 /* Report something read-only. */
6210 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
6211 || TREE_READONLY (arg
))
6213 if (complain
& tf_error
)
6214 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
6215 || code
== POSTINCREMENT_EXPR
)
6216 ? lv_increment
: lv_decrement
));
6218 return error_mark_node
;
6223 tree declared_type
= unlowered_expr_type (arg
);
6225 argtype
= TREE_TYPE (arg
);
6227 /* ARM $5.2.5 last annotation says this should be forbidden. */
6228 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
6230 if (complain
& tf_error
)
6231 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
6232 ? G_("ISO C++ forbids incrementing an enum")
6233 : G_("ISO C++ forbids decrementing an enum"));
6235 return error_mark_node
;
6238 /* Compute the increment. */
6240 if (TYPE_PTR_P (argtype
))
6242 tree type
= complete_type (TREE_TYPE (argtype
));
6244 if (!COMPLETE_OR_VOID_TYPE_P (type
))
6246 if (complain
& tf_error
)
6247 error (((code
== PREINCREMENT_EXPR
6248 || code
== POSTINCREMENT_EXPR
))
6249 ? G_("cannot increment a pointer to incomplete type %qT")
6250 : G_("cannot decrement a pointer to incomplete type %qT"),
6251 TREE_TYPE (argtype
));
6253 return error_mark_node
;
6255 else if (!TYPE_PTROB_P (argtype
))
6257 if (complain
& tf_error
)
6258 pedwarn (input_location
, OPT_Wpointer_arith
,
6259 (code
== PREINCREMENT_EXPR
6260 || code
== POSTINCREMENT_EXPR
)
6261 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6262 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6265 return error_mark_node
;
6268 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6271 inc
= VECTOR_TYPE_P (argtype
)
6272 ? build_one_cst (argtype
)
6275 inc
= cp_convert (argtype
, inc
, complain
);
6277 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6278 need to ask Objective-C to build the increment or decrement
6279 expression for it. */
6280 if (objc_is_property_ref (arg
))
6281 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6284 /* Complain about anything else that is not a true lvalue. */
6285 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6286 || code
== POSTINCREMENT_EXPR
)
6287 ? lv_increment
: lv_decrement
),
6289 return error_mark_node
;
6291 /* Forbid using -- or ++ in C++17 on `bool'. */
6292 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6294 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6296 if (complain
& tf_error
)
6297 error ("use of an operand of type %qT in %<operator--%> "
6298 "is forbidden", boolean_type_node
);
6299 return error_mark_node
;
6303 if (cxx_dialect
>= cxx17
)
6305 if (complain
& tf_error
)
6306 error ("use of an operand of type %qT in "
6307 "%<operator++%> is forbidden in C++17",
6309 return error_mark_node
;
6311 /* Otherwise, [depr.incr.bool] says this is deprecated. */
6312 else if (!in_system_header_at (input_location
))
6313 warning (OPT_Wdeprecated
, "use of an operand of type %qT "
6314 "in %<operator++%> is deprecated",
6317 val
= boolean_increment (code
, arg
);
6319 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6320 /* An rvalue has no cv-qualifiers. */
6321 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6323 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6325 TREE_SIDE_EFFECTS (val
) = 1;
6330 /* Note that this operation never does default_conversion
6331 regardless of NOCONVERT. */
6332 return cp_build_addr_expr (arg
, complain
);
6341 argtype
= TREE_TYPE (arg
);
6342 return build1 (code
, argtype
, arg
);
6345 if (complain
& tf_error
)
6346 error ("%s", errstring
);
6347 return error_mark_node
;
6350 /* Hook for the c-common bits that build a unary op. */
6352 build_unary_op (location_t
/*location*/,
6353 enum tree_code code
, tree xarg
, bool noconvert
)
6355 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6358 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6359 for certain kinds of expressions which are not really lvalues
6360 but which we can accept as lvalues.
6362 If ARG is not a kind of expression we can handle, return
6366 unary_complex_lvalue (enum tree_code code
, tree arg
)
6368 /* Inside a template, making these kinds of adjustments is
6369 pointless; we are only concerned with the type of the
6371 if (processing_template_decl
)
6374 /* Handle (a, b) used as an "lvalue". */
6375 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6377 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
6378 tf_warning_or_error
);
6379 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6380 TREE_OPERAND (arg
, 0), real_result
);
6383 /* Handle (a ? b : c) used as an "lvalue". */
6384 if (TREE_CODE (arg
) == COND_EXPR
6385 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6386 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6388 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6389 if (TREE_CODE (arg
) == MODIFY_EXPR
6390 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6391 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6393 tree lvalue
= TREE_OPERAND (arg
, 0);
6394 if (TREE_SIDE_EFFECTS (lvalue
))
6396 lvalue
= cp_stabilize_reference (lvalue
);
6397 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6398 lvalue
, TREE_OPERAND (arg
, 1));
6400 return unary_complex_lvalue
6401 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6404 if (code
!= ADDR_EXPR
)
6407 /* Handle (a = b) used as an "lvalue" for `&'. */
6408 if (TREE_CODE (arg
) == MODIFY_EXPR
6409 || TREE_CODE (arg
) == INIT_EXPR
)
6411 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
6412 tf_warning_or_error
);
6413 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6415 TREE_NO_WARNING (arg
) = 1;
6419 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6420 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6421 || TREE_CODE (arg
) == OFFSET_REF
)
6424 /* We permit compiler to make function calls returning
6425 objects of aggregate type look like lvalues. */
6429 if (TREE_CODE (targ
) == SAVE_EXPR
)
6430 targ
= TREE_OPERAND (targ
, 0);
6432 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6434 if (TREE_CODE (arg
) == SAVE_EXPR
)
6437 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6438 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6441 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6442 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6443 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6446 /* Don't let anything else be handled specially. */
6450 /* Mark EXP saying that we need to be able to take the
6451 address of it; it should not be allocated in a register.
6452 Value is true if successful. ARRAY_REF_P is true if this
6453 is for ARRAY_REF construction - in that case we don't want
6454 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
6455 it is fine to use ARRAY_REFs for vector subscripts on vector
6458 C++: we do not allow `current_class_ptr' to be addressable. */
6461 cxx_mark_addressable (tree exp
, bool array_ref_p
)
6466 switch (TREE_CODE (x
))
6468 case VIEW_CONVERT_EXPR
:
6470 && TREE_CODE (TREE_TYPE (x
)) == ARRAY_TYPE
6471 && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x
, 0))))
6479 x
= TREE_OPERAND (x
, 0);
6483 if (x
== current_class_ptr
)
6485 error ("cannot take the address of %<this%>, which is an rvalue expression");
6486 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6492 /* Caller should not be trying to mark initialized
6493 constant fields addressable. */
6494 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6495 || DECL_IN_AGGR_P (x
) == 0
6497 || DECL_EXTERNAL (x
));
6501 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6502 && !DECL_ARTIFICIAL (x
))
6504 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6507 ("address of explicit register variable %qD requested", x
);
6510 else if (extra_warnings
)
6512 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6514 TREE_ADDRESSABLE (x
) = 1;
6519 TREE_ADDRESSABLE (x
) = 1;
6523 TREE_ADDRESSABLE (x
) = 1;
6527 TREE_ADDRESSABLE (x
) = 1;
6528 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6536 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6539 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6540 tsubst_flags_t complain
)
6542 tree orig_ifexp
= ifexp
;
6543 tree orig_op1
= op1
;
6544 tree orig_op2
= op2
;
6547 if (processing_template_decl
)
6549 /* The standard says that the expression is type-dependent if
6550 IFEXP is type-dependent, even though the eventual type of the
6551 expression doesn't dependent on IFEXP. */
6552 if (type_dependent_expression_p (ifexp
)
6553 /* As a GNU extension, the middle operand may be omitted. */
6554 || (op1
&& type_dependent_expression_p (op1
))
6555 || type_dependent_expression_p (op2
))
6556 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6557 ifexp
= build_non_dependent_expr (ifexp
);
6559 op1
= build_non_dependent_expr (op1
);
6560 op2
= build_non_dependent_expr (op2
);
6563 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6564 if (processing_template_decl
&& expr
!= error_mark_node
)
6566 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6567 orig_ifexp
, orig_op1
, orig_op2
);
6568 /* Remember that the result is an lvalue or xvalue. */
6569 if (glvalue_p (expr
) && !glvalue_p (min
))
6570 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6572 expr
= convert_from_reference (min
);
6577 /* Given a list of expressions, return a compound expression
6578 that performs them all and returns the value of the last of them. */
6581 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6582 tsubst_flags_t complain
)
6584 tree expr
= TREE_VALUE (list
);
6586 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6587 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6589 if (complain
& tf_error
)
6590 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6591 "list-initializer for non-class type must not "
6592 "be parenthesized");
6594 return error_mark_node
;
6597 if (TREE_CHAIN (list
))
6599 if (complain
& tf_error
)
6603 permerror (input_location
, "expression list treated as compound "
6604 "expression in initializer");
6607 permerror (input_location
, "expression list treated as compound "
6608 "expression in mem-initializer");
6611 permerror (input_location
, "expression list treated as compound "
6612 "expression in functional cast");
6618 return error_mark_node
;
6620 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6621 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6622 expr
, TREE_VALUE (list
), complain
);
6628 /* Like build_x_compound_expr_from_list, but using a VEC. */
6631 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6632 tsubst_flags_t complain
)
6634 if (vec_safe_is_empty (vec
))
6636 else if (vec
->length () == 1)
6646 if (complain
& tf_error
)
6647 permerror (input_location
,
6648 "%s expression list treated as compound expression",
6651 return error_mark_node
;
6655 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6656 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6663 /* Handle overloading of the ',' operator when needed. */
6666 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6667 tsubst_flags_t complain
)
6670 tree orig_op1
= op1
;
6671 tree orig_op2
= op2
;
6672 tree overload
= NULL_TREE
;
6674 if (processing_template_decl
)
6676 if (type_dependent_expression_p (op1
)
6677 || type_dependent_expression_p (op2
))
6678 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6679 op1
= build_non_dependent_expr (op1
);
6680 op2
= build_non_dependent_expr (op2
);
6683 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6684 NULL_TREE
, &overload
, complain
);
6686 result
= cp_build_compound_expr (op1
, op2
, complain
);
6688 if (processing_template_decl
&& result
!= error_mark_node
)
6690 if (overload
!= NULL_TREE
)
6691 return (build_min_non_dep_op_overload
6692 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6694 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6700 /* Like cp_build_compound_expr, but for the c-common bits. */
6703 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6705 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6708 /* Build a compound expression. */
6711 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6713 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6715 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6716 return error_mark_node
;
6718 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6720 /* If the rhs is a TARGET_EXPR, then build the compound
6721 expression inside the target_expr's initializer. This
6722 helps the compiler to eliminate unnecessary temporaries. */
6723 tree init
= TREE_OPERAND (rhs
, 1);
6725 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6726 TREE_OPERAND (rhs
, 1) = init
;
6731 if (type_unknown_p (rhs
))
6733 if (complain
& tf_error
)
6734 error ("no context to resolve type of %qE", rhs
);
6735 return error_mark_node
;
6738 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6741 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6742 casts away constness. CAST gives the type of cast. Returns true
6743 if the cast is ill-formed, false if it is well-formed.
6745 ??? This function warns for casting away any qualifier not just
6746 const. We would like to specify exactly what qualifiers are casted
6751 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6752 enum tree_code cast
, tsubst_flags_t complain
)
6754 /* C-style casts are allowed to cast away constness. With
6755 WARN_CAST_QUAL, we still want to issue a warning. */
6756 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6759 if (!casts_away_constness (src_type
, dest_type
, complain
))
6765 if (complain
& tf_warning
)
6766 warning (OPT_Wcast_qual
,
6767 "cast from type %qT to type %qT casts away qualifiers",
6768 src_type
, dest_type
);
6771 case STATIC_CAST_EXPR
:
6772 if (complain
& tf_error
)
6773 error ("static_cast from type %qT to type %qT casts away qualifiers",
6774 src_type
, dest_type
);
6777 case REINTERPRET_CAST_EXPR
:
6778 if (complain
& tf_error
)
6779 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6780 src_type
, dest_type
);
6788 /* Warns if the cast from expression EXPR to type TYPE is useless. */
6790 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6792 if (warn_useless_cast
6793 && complain
& tf_warning
)
6795 if ((TREE_CODE (type
) == REFERENCE_TYPE
6796 && (TYPE_REF_IS_RVALUE (type
)
6797 ? xvalue_p (expr
) : lvalue_p (expr
))
6798 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6799 || same_type_p (TREE_TYPE (expr
), type
))
6800 warning (OPT_Wuseless_cast
, "useless cast to type %q#T", type
);
6804 /* Warns if the cast ignores cv-qualifiers on TYPE. */
6806 maybe_warn_about_cast_ignoring_quals (tree type
, tsubst_flags_t complain
)
6808 if (warn_ignored_qualifiers
6809 && complain
& tf_warning
6810 && !CLASS_TYPE_P (type
)
6811 && (cp_type_quals (type
) & (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)))
6813 warning (OPT_Wignored_qualifiers
, "type qualifiers ignored on cast "
6818 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6819 (another pointer-to-member type in the same hierarchy) and return
6820 the converted expression. If ALLOW_INVERSE_P is permitted, a
6821 pointer-to-derived may be converted to pointer-to-base; otherwise,
6822 only the other direction is permitted. If C_CAST_P is true, this
6823 conversion is taking place as part of a C-style cast. */
6826 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6827 bool c_cast_p
, tsubst_flags_t complain
)
6829 if (same_type_p (type
, TREE_TYPE (expr
)))
6832 if (TYPE_PTRDATAMEM_P (type
))
6836 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6837 TYPE_PTRMEM_CLASS_TYPE (type
),
6839 c_cast_p
, complain
);
6840 if (delta
== error_mark_node
)
6841 return error_mark_node
;
6843 if (!integer_zerop (delta
))
6845 tree cond
, op1
, op2
;
6847 if (TREE_CODE (expr
) == PTRMEM_CST
)
6848 expr
= cplus_expand_constant (expr
);
6849 cond
= cp_build_binary_op (input_location
,
6852 build_int_cst (TREE_TYPE (expr
), -1),
6854 op1
= build_nop (ptrdiff_type_node
, expr
);
6855 op2
= cp_build_binary_op (input_location
,
6856 PLUS_EXPR
, op1
, delta
,
6859 expr
= fold_build3_loc (input_location
,
6860 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6864 return build_nop (type
, expr
);
6867 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6868 allow_inverse_p
, c_cast_p
, complain
);
6871 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6872 this static_cast is being attempted as one of the possible casts
6873 allowed by a C-style cast. (In that case, accessibility of base
6874 classes is not considered, and it is OK to cast away
6875 constness.) Return the result of the cast. *VALID_P is set to
6876 indicate whether or not the cast was valid. */
6879 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6880 bool *valid_p
, tsubst_flags_t complain
)
6886 /* Assume the cast is valid. */
6889 intype
= unlowered_expr_type (expr
);
6891 /* Save casted types in the function's used types hash table. */
6892 used_types_insert (type
);
6894 /* A prvalue of non-class type is cv-unqualified. */
6895 if (!CLASS_TYPE_P (type
))
6896 type
= cv_unqualified (type
);
6898 /* [expr.static.cast]
6900 An lvalue of type "cv1 B", where B is a class type, can be cast
6901 to type "reference to cv2 D", where D is a class derived (clause
6902 _class.derived_) from B, if a valid standard conversion from
6903 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6904 same cv-qualification as, or greater cv-qualification than, cv1,
6905 and B is not a virtual base class of D. */
6906 /* We check this case before checking the validity of "TYPE t =
6907 EXPR;" below because for this case:
6910 struct D : public B { D(const B&); };
6912 void f() { static_cast<const D&>(b); }
6914 we want to avoid constructing a new D. The standard is not
6915 completely clear about this issue, but our interpretation is
6916 consistent with other compilers. */
6917 if (TREE_CODE (type
) == REFERENCE_TYPE
6918 && CLASS_TYPE_P (TREE_TYPE (type
))
6919 && CLASS_TYPE_P (intype
)
6920 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
6921 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6922 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6923 build_pointer_type (TYPE_MAIN_VARIANT
6924 (TREE_TYPE (type
))),
6927 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6931 if (processing_template_decl
)
6934 /* There is a standard conversion from "D*" to "B*" even if "B"
6935 is ambiguous or inaccessible. If this is really a
6936 static_cast, then we check both for inaccessibility and
6937 ambiguity. However, if this is a static_cast being performed
6938 because the user wrote a C-style cast, then accessibility is
6940 base
= lookup_base (TREE_TYPE (type
), intype
,
6941 c_cast_p
? ba_unique
: ba_check
,
6943 expr
= build_address (expr
);
6945 if (sanitize_flags_p (SANITIZE_VPTR
))
6948 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6954 /* Convert from "B*" to "D*". This function will check that "B"
6955 is not a virtual base of "D". Even if we don't have a guarantee
6956 that expr is NULL, if the static_cast is to a reference type,
6957 it is UB if it would be NULL, so omit the non-NULL check. */
6958 expr
= build_base_path (MINUS_EXPR
, expr
, base
,
6959 /*nonnull=*/flag_delete_null_pointer_checks
,
6962 /* Convert the pointer to a reference -- but then remember that
6963 there are no expressions with reference type in C++.
6965 We call rvalue so that there's an actual tree code
6966 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6967 is a variable with the same type, the conversion would get folded
6968 away, leaving just the variable and causing lvalue_kind to give
6969 the wrong answer. */
6970 expr
= cp_fold_convert (type
, expr
);
6972 /* When -fsanitize=null, make sure to diagnose reference binding to
6973 NULL even when the reference is converted to pointer later on. */
6974 if (sanitize_flags_p (SANITIZE_NULL
)
6975 && TREE_CODE (expr
) == COND_EXPR
6976 && TREE_OPERAND (expr
, 2)
6977 && TREE_CODE (TREE_OPERAND (expr
, 2)) == INTEGER_CST
6978 && TREE_TYPE (TREE_OPERAND (expr
, 2)) == type
)
6979 ubsan_maybe_instrument_reference (&TREE_OPERAND (expr
, 2));
6981 return convert_from_reference (rvalue (expr
));
6984 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6985 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6986 if (TREE_CODE (type
) == REFERENCE_TYPE
6987 && TYPE_REF_IS_RVALUE (type
)
6988 && (clk
= real_lvalue_p (expr
))
6989 && reference_related_p (TREE_TYPE (type
), intype
)
6990 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6992 if (processing_template_decl
)
6994 if (clk
== clk_ordinary
)
6996 /* Handle the (non-bit-field) lvalue case here by casting to
6997 lvalue reference and then changing it to an rvalue reference.
6998 Casting an xvalue to rvalue reference will be handled by the
7000 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
7001 result
= (perform_direct_initialization_if_possible
7002 (lref
, expr
, c_cast_p
, complain
));
7003 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
7004 return convert_from_reference (result
);
7007 /* For a bit-field or packed field, bind to a temporary. */
7008 expr
= rvalue (expr
);
7011 /* Resolve overloaded address here rather than once in
7012 implicit_conversion and again in the inverse code below. */
7013 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
7015 expr
= instantiate_type (type
, expr
, complain
);
7016 intype
= TREE_TYPE (expr
);
7019 /* [expr.static.cast]
7021 Any expression can be explicitly converted to type cv void. */
7022 if (VOID_TYPE_P (type
))
7023 return convert_to_void (expr
, ICV_CAST
, complain
);
7026 An abstract class shall not be used ... as the type of an explicit
7028 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
7029 return error_mark_node
;
7031 /* [expr.static.cast]
7033 An expression e can be explicitly converted to a type T using a
7034 static_cast of the form static_cast<T>(e) if the declaration T
7035 t(e);" is well-formed, for some invented temporary variable
7037 result
= perform_direct_initialization_if_possible (type
, expr
,
7038 c_cast_p
, complain
);
7041 if (processing_template_decl
)
7044 result
= convert_from_reference (result
);
7046 /* [expr.static.cast]
7048 If T is a reference type, the result is an lvalue; otherwise,
7049 the result is an rvalue. */
7050 if (TREE_CODE (type
) != REFERENCE_TYPE
)
7052 result
= rvalue (result
);
7054 if (result
== expr
&& SCALAR_TYPE_P (type
))
7055 /* Leave some record of the cast. */
7056 result
= build_nop (type
, expr
);
7061 /* [expr.static.cast]
7063 The inverse of any standard conversion sequence (clause _conv_),
7064 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
7065 (_conv.array_), function-to-pointer (_conv.func_), and boolean
7066 (_conv.bool_) conversions, can be performed explicitly using
7067 static_cast subject to the restriction that the explicit
7068 conversion does not cast away constness (_expr.const.cast_), and
7069 the following additional rules for specific cases: */
7070 /* For reference, the conversions not excluded are: integral
7071 promotions, floating point promotion, integral conversions,
7072 floating point conversions, floating-integral conversions,
7073 pointer conversions, and pointer to member conversions. */
7076 A value of integral _or enumeration_ type can be explicitly
7077 converted to an enumeration type. */
7078 /* The effect of all that is that any conversion between any two
7079 types which are integral, floating, or enumeration types can be
7081 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7082 || SCALAR_FLOAT_TYPE_P (type
))
7083 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
7084 || SCALAR_FLOAT_TYPE_P (intype
)))
7086 if (processing_template_decl
)
7088 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
7091 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
7092 && CLASS_TYPE_P (TREE_TYPE (type
))
7093 && CLASS_TYPE_P (TREE_TYPE (intype
))
7094 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
7095 (TREE_TYPE (intype
))),
7096 build_pointer_type (TYPE_MAIN_VARIANT
7097 (TREE_TYPE (type
))),
7102 if (processing_template_decl
)
7106 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7108 return error_mark_node
;
7109 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
7110 c_cast_p
? ba_unique
: ba_check
,
7112 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
7115 if (sanitize_flags_p (SANITIZE_VPTR
))
7118 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
7124 return cp_fold_convert (type
, expr
);
7127 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7128 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7135 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
7136 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
7138 if (TYPE_PTRDATAMEM_P (type
))
7140 t1
= (build_ptrmem_type
7142 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
7143 t2
= (build_ptrmem_type
7145 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
7152 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
7155 && check_for_casting_away_constness (intype
, type
,
7158 return error_mark_node
;
7159 if (processing_template_decl
)
7161 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
7162 c_cast_p
, complain
);
7166 /* [expr.static.cast]
7168 An rvalue of type "pointer to cv void" can be explicitly
7169 converted to a pointer to object type. A value of type pointer
7170 to object converted to "pointer to cv void" and back to the
7171 original pointer type will have its original value. */
7172 if (TYPE_PTR_P (intype
)
7173 && VOID_TYPE_P (TREE_TYPE (intype
))
7174 && TYPE_PTROB_P (type
))
7177 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7179 return error_mark_node
;
7180 if (processing_template_decl
)
7182 return build_nop (type
, expr
);
7186 return error_mark_node
;
7189 /* Return an expression representing static_cast<TYPE>(EXPR). */
7192 build_static_cast (tree type
, tree oexpr
, tsubst_flags_t complain
)
7198 if (type
== error_mark_node
|| expr
== error_mark_node
)
7199 return error_mark_node
;
7201 bool dependent
= (dependent_type_p (type
)
7202 || type_dependent_expression_p (expr
));
7206 expr
= build_min (STATIC_CAST_EXPR
, type
, oexpr
);
7207 /* We don't know if it will or will not have side effects. */
7208 TREE_SIDE_EFFECTS (expr
) = 1;
7209 return convert_from_reference (expr
);
7211 else if (processing_template_decl
)
7212 expr
= build_non_dependent_expr (expr
);
7214 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7215 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7216 if (TREE_CODE (type
) != REFERENCE_TYPE
7217 && TREE_CODE (expr
) == NOP_EXPR
7218 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7219 expr
= TREE_OPERAND (expr
, 0);
7221 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
7225 if (result
!= error_mark_node
)
7227 maybe_warn_about_useless_cast (type
, expr
, complain
);
7228 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7230 if (processing_template_decl
)
7235 if (complain
& tf_error
)
7236 error ("invalid static_cast from type %qT to type %qT",
7237 TREE_TYPE (expr
), type
);
7238 return error_mark_node
;
7241 /* EXPR is an expression with member function or pointer-to-member
7242 function type. TYPE is a pointer type. Converting EXPR to TYPE is
7243 not permitted by ISO C++, but we accept it in some modes. If we
7244 are not in one of those modes, issue a diagnostic. Return the
7245 converted expression. */
7248 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
7253 intype
= TREE_TYPE (expr
);
7254 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
7255 || TREE_CODE (intype
) == METHOD_TYPE
);
7257 if (!(complain
& tf_warning_or_error
))
7258 return error_mark_node
;
7260 if (pedantic
|| warn_pmf2ptr
)
7261 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
7262 "converting from %qH to %qI", intype
, type
);
7264 if (TREE_CODE (intype
) == METHOD_TYPE
)
7265 expr
= build_addr_func (expr
, complain
);
7266 else if (TREE_CODE (expr
) == PTRMEM_CST
)
7267 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
7270 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
7271 decl
= build_address (decl
);
7272 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
7275 if (expr
== error_mark_node
)
7276 return error_mark_node
;
7278 return build_nop (type
, expr
);
7281 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
7282 If C_CAST_P is true, this reinterpret cast is being done as part of
7283 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
7284 indicate whether or not reinterpret_cast was valid. */
7287 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
7288 bool *valid_p
, tsubst_flags_t complain
)
7292 /* Assume the cast is invalid. */
7296 if (type
== error_mark_node
|| error_operand_p (expr
))
7297 return error_mark_node
;
7299 intype
= TREE_TYPE (expr
);
7301 /* Save casted types in the function's used types hash table. */
7302 used_types_insert (type
);
7304 /* A prvalue of non-class type is cv-unqualified. */
7305 if (!CLASS_TYPE_P (type
))
7306 type
= cv_unqualified (type
);
7308 /* [expr.reinterpret.cast]
7309 An lvalue expression of type T1 can be cast to the type
7310 "reference to T2" if an expression of type "pointer to T1" can be
7311 explicitly converted to the type "pointer to T2" using a
7312 reinterpret_cast. */
7313 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7315 if (! lvalue_p (expr
))
7317 if (complain
& tf_error
)
7318 error ("invalid cast of an rvalue expression of type "
7321 return error_mark_node
;
7324 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7325 "B" are related class types; the reinterpret_cast does not
7326 adjust the pointer. */
7327 if (TYPE_PTR_P (intype
)
7328 && (complain
& tf_warning
)
7329 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7330 COMPARE_BASE
| COMPARE_DERIVED
)))
7331 warning (0, "casting %qT to %qT does not dereference pointer",
7334 expr
= cp_build_addr_expr (expr
, complain
);
7336 if (warn_strict_aliasing
> 2)
7337 strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
7339 if (expr
!= error_mark_node
)
7340 expr
= build_reinterpret_cast_1
7341 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7343 if (expr
!= error_mark_node
)
7344 /* cp_build_indirect_ref isn't right for rvalue refs. */
7345 expr
= convert_from_reference (fold_convert (type
, expr
));
7349 /* As a G++ extension, we consider conversions from member
7350 functions, and pointers to member functions to
7351 pointer-to-function and pointer-to-void types. If
7352 -Wno-pmf-conversions has not been specified,
7353 convert_member_func_to_ptr will issue an error message. */
7354 if ((TYPE_PTRMEMFUNC_P (intype
)
7355 || TREE_CODE (intype
) == METHOD_TYPE
)
7356 && TYPE_PTR_P (type
)
7357 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7358 || VOID_TYPE_P (TREE_TYPE (type
))))
7359 return convert_member_func_to_ptr (type
, expr
, complain
);
7361 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7362 array-to-pointer, and function-to-pointer conversions are
7364 expr
= decay_conversion (expr
, complain
);
7366 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7367 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7368 if (TREE_CODE (expr
) == NOP_EXPR
7369 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7370 expr
= TREE_OPERAND (expr
, 0);
7372 if (error_operand_p (expr
))
7373 return error_mark_node
;
7375 intype
= TREE_TYPE (expr
);
7377 /* [expr.reinterpret.cast]
7378 A pointer can be converted to any integral type large enough to
7379 hold it. ... A value of type std::nullptr_t can be converted to
7380 an integral type; the conversion has the same meaning and
7381 validity as a conversion of (void*)0 to the integral type. */
7382 if (CP_INTEGRAL_TYPE_P (type
)
7383 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7385 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7387 if (complain
& tf_error
)
7388 permerror (input_location
, "cast from %qH to %qI loses precision",
7391 return error_mark_node
;
7393 if (NULLPTR_TYPE_P (intype
))
7394 return build_int_cst (type
, 0);
7396 /* [expr.reinterpret.cast]
7397 A value of integral or enumeration type can be explicitly
7398 converted to a pointer. */
7399 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7402 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7403 || TYPE_PTR_OR_PTRMEM_P (type
))
7404 && same_type_p (type
, intype
))
7406 return rvalue (expr
);
7407 else if (TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7409 if ((complain
& tf_warning
)
7410 && !cxx_safe_function_type_cast_p (TREE_TYPE (type
),
7411 TREE_TYPE (intype
)))
7412 warning (OPT_Wcast_function_type
,
7413 "cast between incompatible function types"
7414 " from %qH to %qI", intype
, type
);
7415 return build_nop (type
, expr
);
7417 else if (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
))
7419 if ((complain
& tf_warning
)
7420 && !cxx_safe_function_type_cast_p
7421 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (type
)),
7422 TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (intype
))))
7423 warning (OPT_Wcast_function_type
,
7424 "cast between incompatible pointer to member types"
7425 " from %qH to %qI", intype
, type
);
7426 return build_nop (type
, expr
);
7428 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7429 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7432 && check_for_casting_away_constness (intype
, type
,
7433 REINTERPRET_CAST_EXPR
,
7435 return error_mark_node
;
7436 /* Warn about possible alignment problems. */
7437 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7438 && (complain
& tf_warning
)
7439 && !VOID_TYPE_P (type
)
7440 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7441 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7442 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7443 && min_align_of_type (TREE_TYPE (type
))
7444 > min_align_of_type (TREE_TYPE (intype
)))
7445 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7446 "increases required alignment of target type", intype
, type
);
7448 if (warn_strict_aliasing
<= 2)
7449 /* strict_aliasing_warning STRIP_NOPs its expr. */
7450 strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
7452 return build_nop (type
, expr
);
7454 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7455 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7457 if (complain
& tf_warning
)
7458 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7459 object pointer type or vice versa is conditionally-supported." */
7460 warning (OPT_Wconditionally_supported
,
7461 "casting between pointer-to-function and pointer-to-object "
7462 "is conditionally-supported");
7463 return build_nop (type
, expr
);
7465 else if (VECTOR_TYPE_P (type
))
7466 return convert_to_vector (type
, expr
);
7467 else if (VECTOR_TYPE_P (intype
)
7468 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7469 return convert_to_integer_nofold (type
, expr
);
7474 if (complain
& tf_error
)
7475 error ("invalid cast from type %qT to type %qT", intype
, type
);
7476 return error_mark_node
;
7479 return cp_convert (type
, expr
, complain
);
7483 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7487 if (type
== error_mark_node
|| expr
== error_mark_node
)
7488 return error_mark_node
;
7490 if (processing_template_decl
)
7492 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7494 if (!TREE_SIDE_EFFECTS (t
)
7495 && type_dependent_expression_p (expr
))
7496 /* There might turn out to be side effects inside expr. */
7497 TREE_SIDE_EFFECTS (t
) = 1;
7498 return convert_from_reference (t
);
7501 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7502 /*valid_p=*/NULL
, complain
);
7503 if (r
!= error_mark_node
)
7505 maybe_warn_about_useless_cast (type
, expr
, complain
);
7506 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7511 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7512 return an appropriate expression. Otherwise, return
7513 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7514 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7515 performing a C-style cast, its value upon return will indicate
7516 whether or not the conversion succeeded. */
7519 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7523 tree reference_type
;
7525 /* Callers are responsible for handling error_mark_node as a
7526 destination type. */
7527 gcc_assert (dst_type
!= error_mark_node
);
7528 /* In a template, callers should be building syntactic
7529 representations of casts, not using this machinery. */
7530 gcc_assert (!processing_template_decl
);
7532 /* Assume the conversion is invalid. */
7536 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7538 if (complain
& tf_error
)
7539 error ("invalid use of const_cast with type %qT, "
7540 "which is not a pointer, "
7541 "reference, nor a pointer-to-data-member type", dst_type
);
7542 return error_mark_node
;
7545 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7547 if (complain
& tf_error
)
7548 error ("invalid use of const_cast with type %qT, which is a pointer "
7549 "or reference to a function type", dst_type
);
7550 return error_mark_node
;
7553 /* A prvalue of non-class type is cv-unqualified. */
7554 dst_type
= cv_unqualified (dst_type
);
7556 /* Save casted types in the function's used types hash table. */
7557 used_types_insert (dst_type
);
7559 src_type
= TREE_TYPE (expr
);
7560 /* Expressions do not really have reference types. */
7561 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7562 src_type
= TREE_TYPE (src_type
);
7564 /* [expr.const.cast]
7566 For two object types T1 and T2, if a pointer to T1 can be explicitly
7567 converted to the type "pointer to T2" using a const_cast, then the
7568 following conversions can also be made:
7570 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7571 type T2 using the cast const_cast<T2&>;
7573 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7574 type T2 using the cast const_cast<T2&&>; and
7576 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7577 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7579 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7581 reference_type
= dst_type
;
7582 if (!TYPE_REF_IS_RVALUE (dst_type
)
7588 if (complain
& tf_error
)
7589 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7590 src_type
, dst_type
);
7591 return error_mark_node
;
7593 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7594 src_type
= build_pointer_type (src_type
);
7598 reference_type
= NULL_TREE
;
7599 /* If the destination type is not a reference type, the
7600 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7601 conversions are performed. */
7602 src_type
= type_decays_to (src_type
);
7603 if (src_type
== error_mark_node
)
7604 return error_mark_node
;
7607 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7609 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7614 /* This cast is actually a C-style cast. Issue a warning if
7615 the user is making a potentially unsafe cast. */
7616 check_for_casting_away_constness (src_type
, dst_type
,
7617 CAST_EXPR
, complain
);
7618 /* ??? comp_ptr_ttypes_const ignores TYPE_ALIGN. */
7619 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
7620 && (complain
& tf_warning
)
7621 && min_align_of_type (TREE_TYPE (dst_type
))
7622 > min_align_of_type (TREE_TYPE (src_type
)))
7623 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7624 "increases required alignment of target type",
7625 src_type
, dst_type
);
7629 expr
= cp_build_addr_expr (expr
, complain
);
7630 if (expr
== error_mark_node
)
7631 return error_mark_node
;
7632 expr
= build_nop (reference_type
, expr
);
7633 return convert_from_reference (expr
);
7637 expr
= decay_conversion (expr
, complain
);
7638 if (expr
== error_mark_node
)
7639 return error_mark_node
;
7641 /* build_c_cast puts on a NOP_EXPR to make the result not an
7642 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7643 non-lvalue context. */
7644 if (TREE_CODE (expr
) == NOP_EXPR
7645 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7646 expr
= TREE_OPERAND (expr
, 0);
7647 return build_nop (dst_type
, expr
);
7651 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7652 TREE_TYPE (src_type
)))
7653 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7657 if (complain
& tf_error
)
7658 error ("invalid const_cast from type %qT to type %qT",
7659 src_type
, dst_type
);
7660 return error_mark_node
;
7664 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7668 if (type
== error_mark_node
|| error_operand_p (expr
))
7669 return error_mark_node
;
7671 if (processing_template_decl
)
7673 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7675 if (!TREE_SIDE_EFFECTS (t
)
7676 && type_dependent_expression_p (expr
))
7677 /* There might turn out to be side effects inside expr. */
7678 TREE_SIDE_EFFECTS (t
) = 1;
7679 return convert_from_reference (t
);
7682 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7683 if (r
!= error_mark_node
)
7685 maybe_warn_about_useless_cast (type
, expr
, complain
);
7686 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7691 /* Like cp_build_c_cast, but for the c-common bits. */
7694 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7696 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7699 /* Like the "build_c_cast" used for c-common, but using cp_expr to
7700 preserve location information even for tree nodes that don't
7704 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
7706 cp_expr result
= cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7707 result
.set_location (loc
);
7711 /* Build an expression representing an explicit C-style cast to type
7712 TYPE of expression EXPR. */
7715 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7721 if (type
== error_mark_node
|| error_operand_p (expr
))
7722 return error_mark_node
;
7724 if (processing_template_decl
)
7726 tree t
= build_min (CAST_EXPR
, type
,
7727 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7728 /* We don't know if it will or will not have side effects. */
7729 TREE_SIDE_EFFECTS (t
) = 1;
7730 return convert_from_reference (t
);
7733 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7734 'Class') should always be retained, because this information aids
7735 in method lookup. */
7736 if (objc_is_object_ptr (type
)
7737 && objc_is_object_ptr (TREE_TYPE (expr
)))
7738 return build_nop (type
, expr
);
7740 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7741 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7742 if (TREE_CODE (type
) != REFERENCE_TYPE
7743 && TREE_CODE (value
) == NOP_EXPR
7744 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7745 value
= TREE_OPERAND (value
, 0);
7747 if (TREE_CODE (type
) == ARRAY_TYPE
)
7749 /* Allow casting from T1* to T2[] because Cfront allows it.
7750 NIHCL uses it. It is not valid ISO C++ however. */
7751 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7753 if (complain
& tf_error
)
7754 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7756 return error_mark_node
;
7757 type
= build_pointer_type (TREE_TYPE (type
));
7761 if (complain
& tf_error
)
7762 error ("ISO C++ forbids casting to an array type %qT", type
);
7763 return error_mark_node
;
7767 if (TREE_CODE (type
) == FUNCTION_TYPE
7768 || TREE_CODE (type
) == METHOD_TYPE
)
7770 if (complain
& tf_error
)
7771 error ("invalid cast to function type %qT", type
);
7772 return error_mark_node
;
7775 if (TYPE_PTR_P (type
)
7776 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7777 /* Casting to an integer of smaller size is an error detected elsewhere. */
7778 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7779 /* Don't warn about converting any constant. */
7780 && !TREE_CONSTANT (value
))
7781 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7782 "cast to pointer from integer of different size");
7784 /* A C-style cast can be a const_cast. */
7785 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7789 if (result
!= error_mark_node
)
7791 maybe_warn_about_useless_cast (type
, value
, complain
);
7792 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7797 /* Or a static cast. */
7798 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7799 &valid_p
, complain
);
7800 /* Or a reinterpret_cast. */
7802 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7803 &valid_p
, complain
);
7804 /* The static_cast or reinterpret_cast may be followed by a
7807 /* A valid cast may result in errors if, for example, a
7808 conversion to an ambiguous base class is required. */
7809 && !error_operand_p (result
))
7813 maybe_warn_about_useless_cast (type
, value
, complain
);
7814 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7816 /* Non-class rvalues always have cv-unqualified type. */
7817 if (!CLASS_TYPE_P (type
))
7818 type
= TYPE_MAIN_VARIANT (type
);
7819 result_type
= TREE_TYPE (result
);
7820 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
7821 result_type
= TYPE_MAIN_VARIANT (result_type
);
7822 /* If the type of RESULT does not match TYPE, perform a
7823 const_cast to make it match. If the static_cast or
7824 reinterpret_cast succeeded, we will differ by at most
7825 cv-qualification, so the follow-on const_cast is guaranteed
7827 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7829 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7830 gcc_assert (valid_p
);
7835 return error_mark_node
;
7838 /* For use from the C common bits. */
7840 build_modify_expr (location_t location
,
7841 tree lhs
, tree
/*lhs_origtype*/,
7842 enum tree_code modifycode
,
7843 location_t
/*rhs_location*/, tree rhs
,
7844 tree
/*rhs_origtype*/)
7846 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
7847 tf_warning_or_error
);
7850 /* Build an assignment expression of lvalue LHS from value RHS.
7851 MODIFYCODE is the code for a binary operator that we use
7852 to combine the old value of LHS with RHS to get the new value.
7853 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7855 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7858 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7859 tree rhs
, tsubst_flags_t complain
)
7861 lhs
= mark_lvalue_use_nonread (lhs
);
7863 tree result
= NULL_TREE
;
7865 tree lhstype
= TREE_TYPE (lhs
);
7867 tree olhstype
= lhstype
;
7868 bool plain_assign
= (modifycode
== NOP_EXPR
);
7869 bool compound_side_effects_p
= false;
7870 tree preeval
= NULL_TREE
;
7872 /* Avoid duplicate error messages from operands that had errors. */
7873 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7874 return error_mark_node
;
7876 while (TREE_CODE (lhs
) == COMPOUND_EXPR
)
7878 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7879 compound_side_effects_p
= true;
7880 lhs
= TREE_OPERAND (lhs
, 1);
7883 /* Handle control structure constructs used as "lvalues". Note that we
7884 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
7885 switch (TREE_CODE (lhs
))
7887 /* Handle --foo = 5; as these are valid constructs in C++. */
7888 case PREDECREMENT_EXPR
:
7889 case PREINCREMENT_EXPR
:
7890 if (compound_side_effects_p
)
7891 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7892 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7893 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7894 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7895 TREE_OPERAND (lhs
, 1));
7896 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7898 /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
7899 and looked through the COMPOUND_EXPRs, readd them now around
7900 the resulting lhs. */
7901 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7903 lhs
= build2 (COMPOUND_EXPR
, lhstype
, TREE_OPERAND (olhs
, 0), lhs
);
7904 tree
*ptr
= &TREE_OPERAND (lhs
, 1);
7905 for (olhs
= TREE_OPERAND (olhs
, 1);
7906 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7907 olhs
= TREE_OPERAND (olhs
, 1))
7909 *ptr
= build2 (COMPOUND_EXPR
, lhstype
,
7910 TREE_OPERAND (olhs
, 0), *ptr
);
7911 ptr
= &TREE_OPERAND (*ptr
, 1);
7917 if (compound_side_effects_p
)
7918 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7919 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7920 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7921 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7922 TREE_OPERAND (lhs
, 1));
7923 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7924 goto maybe_add_compound
;
7928 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7929 when neither operand has side-effects. */
7930 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7931 return error_mark_node
;
7933 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7934 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7936 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7937 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7939 TREE_OPERAND (lhs
, 0),
7940 TREE_OPERAND (lhs
, 1)),
7941 TREE_OPERAND (lhs
, 0),
7942 TREE_OPERAND (lhs
, 1));
7945 /* Handle (a ? b : c) used as an "lvalue". */
7948 /* Produce (a ? (b = rhs) : (c = rhs))
7949 except that the RHS goes through a save-expr
7950 so the code to compute it is only emitted once. */
7953 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7955 if (complain
& tf_error
)
7956 error ("void value not ignored as it ought to be");
7957 return error_mark_node
;
7960 rhs
= stabilize_expr (rhs
, &preeval
);
7962 /* Check this here to avoid odd errors when trying to convert
7963 a throw to the type of the COND_EXPR. */
7964 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7965 return error_mark_node
;
7967 cond
= build_conditional_expr
7968 (input_location
, TREE_OPERAND (lhs
, 0),
7969 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7970 modifycode
, rhs
, complain
),
7971 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7972 modifycode
, rhs
, complain
),
7975 if (cond
== error_mark_node
)
7977 /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
7978 and looked through the COMPOUND_EXPRs, readd them now around
7979 the resulting cond before adding the preevaluated rhs. */
7980 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7982 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7983 TREE_OPERAND (olhs
, 0), cond
);
7984 tree
*ptr
= &TREE_OPERAND (cond
, 1);
7985 for (olhs
= TREE_OPERAND (olhs
, 1);
7986 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7987 olhs
= TREE_OPERAND (olhs
, 1))
7989 *ptr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7990 TREE_OPERAND (olhs
, 0), *ptr
);
7991 ptr
= &TREE_OPERAND (*ptr
, 1);
7994 /* Make sure the code to compute the rhs comes out
7995 before the split. */
8005 if (modifycode
== INIT_EXPR
)
8007 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
8008 /* Do the default thing. */;
8009 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
8011 /* Compound literal. */
8012 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
8013 /* Call convert to generate an error; see PR 11063. */
8014 rhs
= convert (lhstype
, rhs
);
8015 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
8016 TREE_SIDE_EFFECTS (result
) = 1;
8019 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
8020 /* Do the default thing. */;
8023 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
8024 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
8025 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
8027 release_tree_vector (rhs_vec
);
8028 if (result
== NULL_TREE
)
8029 return error_mark_node
;
8035 lhs
= require_complete_type_sfinae (lhs
, complain
);
8036 if (lhs
== error_mark_node
)
8037 return error_mark_node
;
8039 if (modifycode
== NOP_EXPR
)
8041 if (c_dialect_objc ())
8043 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
8048 /* `operator=' is not an inheritable operator. */
8049 if (! MAYBE_CLASS_TYPE_P (lhstype
))
8050 /* Do the default thing. */;
8053 result
= build_new_op (input_location
, MODIFY_EXPR
,
8054 LOOKUP_NORMAL
, lhs
, rhs
,
8055 make_node (NOP_EXPR
), /*overload=*/NULL
,
8057 if (result
== NULL_TREE
)
8058 return error_mark_node
;
8065 tree init
= NULL_TREE
;
8067 /* A binary op has been requested. Combine the old LHS
8068 value with the RHS producing the value we should actually
8069 store into the LHS. */
8070 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
8071 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
8072 || MAYBE_CLASS_TYPE_P (lhstype
)));
8074 /* Preevaluate the RHS to make sure its evaluation is complete
8075 before the lvalue-to-rvalue conversion of the LHS:
8077 [expr.ass] With respect to an indeterminately-sequenced
8078 function call, the operation of a compound assignment is a
8079 single evaluation. [ Note: Therefore, a function call shall
8080 not intervene between the lvalue-to-rvalue conversion and the
8081 side effect associated with any single compound assignment
8082 operator. -- end note ] */
8083 lhs
= cp_stabilize_reference (lhs
);
8085 if (rhs
== error_mark_node
)
8086 return error_mark_node
;
8087 rhs
= stabilize_expr (rhs
, &init
);
8088 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
8089 if (newrhs
== error_mark_node
)
8091 if (complain
& tf_error
)
8092 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
8093 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
8094 return error_mark_node
;
8098 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
8100 /* Now it looks like a plain assignment. */
8101 modifycode
= NOP_EXPR
;
8102 if (c_dialect_objc ())
8104 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
8109 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
8110 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
8113 /* The left-hand side must be an lvalue. */
8114 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
8115 return error_mark_node
;
8117 /* Warn about modifying something that is `const'. Don't warn if
8118 this is initialization. */
8119 if (modifycode
!= INIT_EXPR
8120 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
8121 /* Functions are not modifiable, even though they are
8123 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
8124 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
8125 /* If it's an aggregate and any field is const, then it is
8126 effectively const. */
8127 || (CLASS_TYPE_P (lhstype
)
8128 && C_TYPE_FIELDS_READONLY (lhstype
))))
8130 if (complain
& tf_error
)
8131 cxx_readonly_error (lhs
, lv_assign
);
8132 return error_mark_node
;
8135 /* If storing into a structure or union member, it may have been given a
8136 lowered bitfield type. We need to convert to the declared type first,
8137 so retrieve it now. */
8139 olhstype
= unlowered_expr_type (lhs
);
8141 /* Convert new value to destination type. */
8143 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
8147 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
8149 if (modifycode
!= INIT_EXPR
)
8151 if (complain
& tf_error
)
8152 error ("assigning to an array from an initializer list");
8153 return error_mark_node
;
8155 if (check_array_initializer (lhs
, lhstype
, newrhs
))
8156 return error_mark_node
;
8157 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8158 if (newrhs
== error_mark_node
)
8159 return error_mark_node
;
8162 /* C++11 8.5/17: "If the destination type is an array of characters,
8163 an array of char16_t, an array of char32_t, or an array of wchar_t,
8164 and the initializer is a string literal...". */
8165 else if (TREE_CODE (newrhs
) == STRING_CST
8166 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
8167 && modifycode
== INIT_EXPR
)
8169 newrhs
= digest_init (lhstype
, newrhs
, complain
);
8170 if (newrhs
== error_mark_node
)
8171 return error_mark_node
;
8174 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
8175 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
8177 if (complain
& tf_error
)
8178 error ("incompatible types in assignment of %qT to %qT",
8179 TREE_TYPE (rhs
), lhstype
);
8180 return error_mark_node
;
8183 /* Allow array assignment in compiler-generated code. */
8184 else if (!current_function_decl
8185 || !DECL_DEFAULTED_FN (current_function_decl
))
8187 /* This routine is used for both initialization and assignment.
8188 Make sure the diagnostic message differentiates the context. */
8189 if (complain
& tf_error
)
8191 if (modifycode
== INIT_EXPR
)
8192 error ("array used as initializer");
8194 error ("invalid array assignment");
8196 return error_mark_node
;
8199 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
8200 ? 1 + (modifycode
!= INIT_EXPR
): 0;
8201 result
= build_vec_init (lhs
, NULL_TREE
, newrhs
,
8202 /*explicit_value_init_p=*/false,
8203 from_array
, complain
);
8207 if (modifycode
== INIT_EXPR
)
8208 /* Calls with INIT_EXPR are all direct-initialization, so don't set
8209 LOOKUP_ONLYCONVERTING. */
8210 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
8211 ICR_INIT
, NULL_TREE
, 0,
8214 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
8215 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
8217 if (!same_type_p (lhstype
, olhstype
))
8218 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
8220 if (modifycode
!= INIT_EXPR
)
8222 if (TREE_CODE (newrhs
) == CALL_EXPR
8223 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
8224 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
8226 /* Can't initialize directly from a TARGET_EXPR, since that would
8227 cause the lhs to be constructed twice, and possibly result in
8228 accidental self-initialization. So we force the TARGET_EXPR to be
8229 expanded without a target. */
8230 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
8231 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
8232 TREE_OPERAND (newrhs
, 0));
8235 if (newrhs
== error_mark_node
)
8236 return error_mark_node
;
8238 if (c_dialect_objc () && flag_objc_gc
)
8240 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
8246 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
8247 lhstype
, lhs
, newrhs
);
8249 TREE_SIDE_EFFECTS (result
) = 1;
8251 TREE_NO_WARNING (result
) = 1;
8255 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), preeval
, result
);
8260 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
8261 tree rhs
, tsubst_flags_t complain
)
8263 tree orig_lhs
= lhs
;
8264 tree orig_rhs
= rhs
;
8265 tree overload
= NULL_TREE
;
8266 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
8268 if (processing_template_decl
)
8270 if (modifycode
== NOP_EXPR
8271 || type_dependent_expression_p (lhs
)
8272 || type_dependent_expression_p (rhs
))
8273 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
8274 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
8277 lhs
= build_non_dependent_expr (lhs
);
8278 rhs
= build_non_dependent_expr (rhs
);
8281 if (modifycode
!= NOP_EXPR
)
8283 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
8284 lhs
, rhs
, op
, &overload
, complain
);
8287 if (rval
== error_mark_node
)
8289 TREE_NO_WARNING (rval
) = 1;
8290 if (processing_template_decl
)
8292 if (overload
!= NULL_TREE
)
8293 return (build_min_non_dep_op_overload
8294 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
8296 return (build_min_non_dep
8297 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
8302 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
8305 /* Helper function for get_delta_difference which assumes FROM is a base
8306 class of TO. Returns a delta for the conversion of pointer-to-member
8307 of FROM to pointer-to-member of TO. If the conversion is invalid and
8308 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
8309 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
8310 If C_CAST_P is true, this conversion is taking place as part of a
8314 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
8315 tsubst_flags_t complain
)
8320 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
8323 if (binfo
== error_mark_node
)
8325 if (!(complain
& tf_error
))
8326 return error_mark_node
;
8328 error (" in pointer to member function conversion");
8329 return size_zero_node
;
8333 if (kind
!= bk_via_virtual
)
8334 return BINFO_OFFSET (binfo
);
8336 /* FROM is a virtual base class of TO. Issue an error or warning
8337 depending on whether or not this is a reinterpret cast. */
8339 if (!(complain
& tf_error
))
8340 return error_mark_node
;
8342 error ("pointer to member conversion via virtual base %qT",
8343 BINFO_TYPE (binfo_from_vbase (binfo
)));
8345 return size_zero_node
;
8352 /* Get difference in deltas for different pointer to member function
8353 types. If the conversion is invalid and tf_error is not set in
8354 COMPLAIN, returns error_mark_node, otherwise returns an integer
8355 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
8356 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
8357 conversions as well. If C_CAST_P is true this conversion is taking
8358 place as part of a C-style cast.
8360 Note that the naming of FROM and TO is kind of backwards; the return
8361 value is what we add to a TO in order to get a FROM. They are named
8362 this way because we call this function to find out how to convert from
8363 a pointer to member of FROM to a pointer to member of TO. */
8366 get_delta_difference (tree from
, tree to
,
8367 bool allow_inverse_p
,
8368 bool c_cast_p
, tsubst_flags_t complain
)
8372 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
8373 /* Pointer to member of incomplete class is permitted*/
8374 result
= size_zero_node
;
8376 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
8378 if (result
== error_mark_node
)
8379 return error_mark_node
;
8383 if (!allow_inverse_p
)
8385 if (!(complain
& tf_error
))
8386 return error_mark_node
;
8388 error_not_base_type (from
, to
);
8389 error (" in pointer to member conversion");
8390 result
= size_zero_node
;
8394 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
8396 if (result
== error_mark_node
)
8397 return error_mark_node
;
8400 result
= size_diffop_loc (input_location
,
8401 size_zero_node
, result
);
8404 if (!(complain
& tf_error
))
8405 return error_mark_node
;
8407 error_not_base_type (from
, to
);
8408 error (" in pointer to member conversion");
8409 result
= size_zero_node
;
8414 return convert_to_integer (ptrdiff_type_node
, result
);
8417 /* Return a constructor for the pointer-to-member-function TYPE using
8418 the other components as specified. */
8421 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8426 vec
<constructor_elt
, va_gc
> *v
;
8428 /* Pull the FIELD_DECLs out of the type. */
8429 pfn_field
= TYPE_FIELDS (type
);
8430 delta_field
= DECL_CHAIN (pfn_field
);
8432 /* Make sure DELTA has the type we want. */
8433 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8435 /* Convert to the correct target type if necessary. */
8436 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8438 /* Finish creating the initializer. */
8440 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8441 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8442 u
= build_constructor (type
, v
);
8443 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8444 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8445 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8447 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8452 /* Build a constructor for a pointer to member function. It can be
8453 used to initialize global variables, local variable, or used
8454 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8457 If FORCE is nonzero, then force this conversion, even if
8458 we would rather not do it. Usually set when using an explicit
8459 cast. A C-style cast is being processed iff C_CAST_P is true.
8461 Return error_mark_node, if something goes wrong. */
8464 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8465 tsubst_flags_t complain
)
8471 if (error_operand_p (pfn
))
8472 return error_mark_node
;
8474 pfn_type
= TREE_TYPE (pfn
);
8475 to_type
= build_ptrmemfunc_type (type
);
8477 /* Handle multiple conversions of pointer to member functions. */
8478 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8480 tree delta
= NULL_TREE
;
8481 tree npfn
= NULL_TREE
;
8485 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8486 LOOKUP_NORMAL
, complain
))
8488 if (complain
& tf_error
)
8489 error ("invalid conversion to type %qT from type %qT",
8492 return error_mark_node
;
8495 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8496 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8498 c_cast_p
, complain
);
8499 if (n
== error_mark_node
)
8500 return error_mark_node
;
8502 /* We don't have to do any conversion to convert a
8503 pointer-to-member to its own type. But, we don't want to
8504 just return a PTRMEM_CST if there's an explicit cast; that
8505 cast should make the expression an invalid template argument. */
8506 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8508 if (same_type_p (to_type
, pfn_type
))
8510 else if (integer_zerop (n
))
8511 return build_reinterpret_cast (to_type
, pfn
,
8515 if (TREE_SIDE_EFFECTS (pfn
))
8516 pfn
= save_expr (pfn
);
8518 /* Obtain the function pointer and the current DELTA. */
8519 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8520 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8523 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8524 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8527 /* Just adjust the DELTA field. */
8528 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8529 (TREE_TYPE (delta
), ptrdiff_type_node
));
8530 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8531 n
= cp_build_binary_op (input_location
,
8532 LSHIFT_EXPR
, n
, integer_one_node
,
8534 delta
= cp_build_binary_op (input_location
,
8535 PLUS_EXPR
, delta
, n
, complain
);
8536 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8539 /* Handle null pointer to member function conversions. */
8540 if (null_ptr_cst_p (pfn
))
8542 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8543 return build_ptrmemfunc1 (to_type
,
8548 if (type_unknown_p (pfn
))
8549 return instantiate_type (type
, pfn
, complain
);
8551 fn
= TREE_OPERAND (pfn
, 0);
8552 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8553 /* In a template, we will have preserved the
8555 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8556 return make_ptrmem_cst (to_type
, fn
);
8559 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8562 ??? There is no consistency as to the types returned for the above
8563 values. Some code acts as if it were a sizetype and some as if it were
8564 integer_type_node. */
8567 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8569 tree type
= TREE_TYPE (cst
);
8570 tree fn
= PTRMEM_CST_MEMBER (cst
);
8571 tree ptr_class
, fn_class
;
8573 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8575 /* The class that the function belongs to. */
8576 fn_class
= DECL_CONTEXT (fn
);
8578 /* The class that we're creating a pointer to member of. */
8579 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8581 /* First, calculate the adjustment to the function's class. */
8582 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8583 /*c_cast_p=*/0, tf_warning_or_error
);
8585 if (!DECL_VIRTUAL_P (fn
))
8586 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8587 build_addr_func (fn
, tf_warning_or_error
));
8590 /* If we're dealing with a virtual function, we have to adjust 'this'
8591 again, to point to the base which provides the vtable entry for
8592 fn; the call will do the opposite adjustment. */
8593 tree orig_class
= DECL_CONTEXT (fn
);
8594 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8595 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8596 *delta
, BINFO_OFFSET (binfo
));
8598 /* We set PFN to the vtable offset at which the function can be
8599 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8600 case delta is shifted left, and then incremented). */
8601 *pfn
= DECL_VINDEX (fn
);
8602 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8603 TYPE_SIZE_UNIT (vtable_entry_type
));
8605 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8607 case ptrmemfunc_vbit_in_pfn
:
8608 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8612 case ptrmemfunc_vbit_in_delta
:
8613 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8614 *delta
, integer_one_node
);
8615 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8616 *delta
, integer_one_node
);
8623 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8627 /* Return an expression for PFN from the pointer-to-member function
8631 pfn_from_ptrmemfunc (tree t
)
8633 if (TREE_CODE (t
) == PTRMEM_CST
)
8638 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8643 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8646 /* Return an expression for DELTA from the pointer-to-member function
8650 delta_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
, delta_identifier
);
8665 /* Convert value RHS to type TYPE as preparation for an assignment to
8666 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8667 implicit conversion is. If FNDECL is non-NULL, we are doing the
8668 conversion in order to pass the PARMNUMth argument of FNDECL.
8669 If FNDECL is NULL, we are doing the conversion in function pointer
8670 argument passing, conversion in initialization, etc. */
8673 convert_for_assignment (tree type
, tree rhs
,
8674 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8675 tsubst_flags_t complain
, int flags
)
8678 enum tree_code coder
;
8680 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8681 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8682 rhs
= TREE_OPERAND (rhs
, 0);
8684 /* Handle [dcl.init.list] direct-list-initialization from
8685 single element of enumeration with a fixed underlying type. */
8686 if (is_direct_enum_init (type
, rhs
))
8688 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
8689 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
8691 warning_sentinel
w (warn_useless_cast
);
8692 warning_sentinel
w2 (warn_ignored_qualifiers
);
8693 rhs
= cp_build_c_cast (type
, elt
, complain
);
8696 rhs
= error_mark_node
;
8699 rhstype
= TREE_TYPE (rhs
);
8700 coder
= TREE_CODE (rhstype
);
8702 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8703 && vector_types_convertible_p (type
, rhstype
, true))
8705 rhs
= mark_rvalue_use (rhs
);
8706 return convert (type
, rhs
);
8709 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8710 return error_mark_node
;
8711 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8712 return error_mark_node
;
8714 /* The RHS of an assignment cannot have void type. */
8715 if (coder
== VOID_TYPE
)
8717 if (complain
& tf_error
)
8718 error ("void value not ignored as it ought to be");
8719 return error_mark_node
;
8722 if (c_dialect_objc ())
8726 tree rname
= fndecl
;
8737 selector
= objc_message_selector ();
8739 if (selector
&& parmno
> 1)
8746 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8748 rhs
= mark_rvalue_use (rhs
);
8749 return convert (type
, rhs
);
8755 The expression is implicitly converted (clause _conv_) to the
8756 cv-unqualified type of the left operand.
8758 We allow bad conversions here because by the time we get to this point
8759 we are committed to doing the conversion. If we end up doing a bad
8760 conversion, convert_like will complain. */
8761 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8763 /* When -Wno-pmf-conversions is use, we just silently allow
8764 conversions from pointers-to-members to plain pointers. If
8765 the conversion doesn't work, cp_convert will complain. */
8767 && TYPE_PTR_P (type
)
8768 && TYPE_PTRMEMFUNC_P (rhstype
))
8769 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8772 if (complain
& tf_error
)
8774 /* If the right-hand side has unknown type, then it is an
8775 overloaded function. Call instantiate_type to get error
8777 if (rhstype
== unknown_type_node
)
8779 tree r
= instantiate_type (type
, rhs
, tf_warning_or_error
);
8780 /* -fpermissive might allow this; recurse. */
8782 return convert_for_assignment (type
, r
, errtype
, fndecl
,
8783 parmnum
, complain
, flags
);
8786 error ("cannot convert %qH to %qI for argument %qP to %qD",
8787 rhstype
, type
, parmnum
, fndecl
);
8791 case ICR_DEFAULT_ARGUMENT
:
8792 error ("cannot convert %qH to %qI in default argument",
8796 error ("cannot convert %qH to %qI in argument passing",
8799 case ICR_CONVERTING
:
8800 error ("cannot convert %qH to %qI",
8804 error ("cannot convert %qH to %qI in initialization",
8808 error ("cannot convert %qH to %qI in return",
8812 error ("cannot convert %qH to %qI in assignment",
8818 if (TYPE_PTR_P (rhstype
)
8819 && TYPE_PTR_P (type
)
8820 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8821 && CLASS_TYPE_P (TREE_TYPE (type
))
8822 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8823 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8824 (TREE_TYPE (rhstype
))),
8825 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8827 return error_mark_node
;
8830 if (warn_suggest_attribute_format
)
8832 const enum tree_code codel
= TREE_CODE (type
);
8833 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8835 && check_missing_format_attribute (type
, rhstype
)
8836 && (complain
& tf_warning
))
8840 case ICR_DEFAULT_ARGUMENT
:
8842 warning (OPT_Wsuggest_attribute_format
,
8843 "parameter %qP of %qD might be a candidate "
8844 "for a format attribute", parmnum
, fndecl
);
8846 warning (OPT_Wsuggest_attribute_format
,
8847 "parameter might be a candidate "
8848 "for a format attribute");
8850 case ICR_CONVERTING
:
8851 warning (OPT_Wsuggest_attribute_format
,
8852 "target of conversion might be a candidate "
8853 "for a format attribute");
8856 warning (OPT_Wsuggest_attribute_format
,
8857 "target of initialization might be a candidate "
8858 "for a format attribute");
8861 warning (OPT_Wsuggest_attribute_format
,
8862 "return type might be a candidate "
8863 "for a format attribute");
8866 warning (OPT_Wsuggest_attribute_format
,
8867 "left-hand side of assignment might be a candidate "
8868 "for a format attribute");
8875 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8877 if (warn_parentheses
8878 && TREE_CODE (type
) == BOOLEAN_TYPE
8879 && TREE_CODE (rhs
) == MODIFY_EXPR
8880 && !TREE_NO_WARNING (rhs
)
8881 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8882 && (complain
& tf_warning
))
8884 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8886 warning_at (loc
, OPT_Wparentheses
,
8887 "suggest parentheses around assignment used as truth value");
8888 TREE_NO_WARNING (rhs
) = 1;
8891 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8895 /* Convert RHS to be of type TYPE.
8896 If EXP is nonzero, it is the target of the initialization.
8897 ERRTYPE indicates what kind of error the implicit conversion is.
8899 Two major differences between the behavior of
8900 `convert_for_assignment' and `convert_for_initialization'
8901 are that references are bashed in the former, while
8902 copied in the latter, and aggregates are assigned in
8903 the former (operator=) while initialized in the
8906 If using constructor make sure no conversion operator exists, if one does
8907 exist, an ambiguity exists. */
8910 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8911 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8912 tsubst_flags_t complain
)
8914 enum tree_code codel
= TREE_CODE (type
);
8916 enum tree_code coder
;
8918 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8919 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8920 if (TREE_CODE (rhs
) == NOP_EXPR
8921 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8922 && codel
!= REFERENCE_TYPE
)
8923 rhs
= TREE_OPERAND (rhs
, 0);
8925 if (type
== error_mark_node
8926 || rhs
== error_mark_node
8927 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8928 return error_mark_node
;
8930 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8932 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8933 && TREE_CODE (type
) != ARRAY_TYPE
8934 && (TREE_CODE (type
) != REFERENCE_TYPE
8935 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8936 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8937 && !TYPE_REFFN_P (type
))
8938 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8939 rhs
= decay_conversion (rhs
, complain
);
8941 rhstype
= TREE_TYPE (rhs
);
8942 coder
= TREE_CODE (rhstype
);
8944 if (coder
== ERROR_MARK
)
8945 return error_mark_node
;
8947 /* We accept references to incomplete types, so we can
8948 return here before checking if RHS is of complete type. */
8950 if (codel
== REFERENCE_TYPE
)
8952 /* This should eventually happen in convert_arguments. */
8953 int savew
= 0, savee
= 0;
8956 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8957 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8960 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8961 inform (DECL_SOURCE_LOCATION (fndecl
),
8962 "in passing argument %P of %qD", parmnum
, fndecl
);
8968 exp
= require_complete_type_sfinae (exp
, complain
);
8969 if (exp
== error_mark_node
)
8970 return error_mark_node
;
8972 rhstype
= non_reference (rhstype
);
8974 type
= complete_type (type
);
8976 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8977 /* Don't try to do copy-initialization if we already have
8978 direct-initialization. */
8981 if (MAYBE_CLASS_TYPE_P (type
))
8982 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8984 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8988 /* If RETVAL is the address of, or a reference to, a local variable or
8989 temporary give an appropriate warning and return true. */
8992 maybe_warn_about_returning_address_of_local (tree retval
)
8994 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8995 tree whats_returned
= fold_for_warn (retval
);
8999 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
9000 whats_returned
= TREE_OPERAND (whats_returned
, 1);
9001 else if (CONVERT_EXPR_P (whats_returned
)
9002 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
9003 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9008 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
9010 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9012 while (TREE_CODE (whats_returned
) == COMPONENT_REF
9013 || TREE_CODE (whats_returned
) == ARRAY_REF
)
9014 whats_returned
= TREE_OPERAND (whats_returned
, 0);
9016 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
9018 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
9019 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
9021 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
9024 if (VAR_P (whats_returned
)
9025 && DECL_NAME (whats_returned
)
9026 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
9028 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
9033 if (DECL_P (whats_returned
)
9034 && DECL_NAME (whats_returned
)
9035 && DECL_FUNCTION_SCOPE_P (whats_returned
)
9036 && !is_capture_proxy (whats_returned
)
9037 && !(TREE_STATIC (whats_returned
)
9038 || TREE_PUBLIC (whats_returned
)))
9040 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
9041 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
9042 OPT_Wreturn_local_addr
,
9043 "reference to local variable %qD returned",
9045 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
9046 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
9047 OPT_Wreturn_local_addr
, "address of label %qD returned",
9050 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
9051 OPT_Wreturn_local_addr
, "address of local variable %qD "
9052 "returned", whats_returned
);
9059 /* Check that returning RETVAL from the current function is valid.
9060 Return an expression explicitly showing all conversions required to
9061 change RETVAL into the function return type, and to assign it to
9062 the DECL_RESULT for the function. Set *NO_WARNING to true if
9063 code reaches end of non-void function warning shouldn't be issued
9064 on this RETURN_EXPR. */
9067 check_return_expr (tree retval
, bool *no_warning
)
9070 /* The type actually returned by the function. */
9072 /* The type the function is declared to return, or void if
9073 the declared type is incomplete. */
9075 int fn_returns_value_p
;
9076 bool named_return_value_okay_p
;
9078 *no_warning
= false;
9080 /* A `volatile' function is one that isn't supposed to return, ever.
9081 (This is a G++ extension, used to get better code for functions
9082 that call the `volatile' function.) */
9083 if (TREE_THIS_VOLATILE (current_function_decl
))
9084 warning (0, "function declared %<noreturn%> has a %<return%> statement");
9086 /* Check for various simple errors. */
9087 if (DECL_DESTRUCTOR_P (current_function_decl
))
9090 error ("returning a value from a destructor");
9093 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
9095 if (in_function_try_handler
)
9096 /* If a return statement appears in a handler of the
9097 function-try-block of a constructor, the program is ill-formed. */
9098 error ("cannot return from a handler of a function-try-block of a constructor");
9100 /* You can't return a value from a constructor. */
9101 error ("returning a value from a constructor");
9105 const tree saved_retval
= retval
;
9107 if (processing_template_decl
)
9109 current_function_returns_value
= 1;
9111 if (check_for_bare_parameter_packs (retval
))
9112 return error_mark_node
;
9114 /* If one of the types might be void, we can't tell whether we're
9115 returning a value. */
9116 if ((WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
9117 && !current_function_auto_return_pattern
)
9118 || (retval
!= NULL_TREE
9119 && (TREE_TYPE (retval
) == NULL_TREE
9120 || WILDCARD_TYPE_P (TREE_TYPE (retval
)))))
9124 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
9126 /* Deduce auto return type from a return statement. */
9127 if (current_function_auto_return_pattern
)
9132 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
9134 /* Give a helpful error message. */
9135 error ("return-statement with no value, in function returning %qT",
9136 current_function_auto_return_pattern
);
9137 inform (input_location
, "only plain %<auto%> return type can be "
9138 "deduced to %<void%>");
9139 type
= error_mark_node
;
9141 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
9143 error ("returning initializer list");
9144 type
= error_mark_node
;
9150 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
9151 type
= do_auto_deduction (current_function_auto_return_pattern
,
9155 if (type
== error_mark_node
)
9157 else if (functype
== current_function_auto_return_pattern
)
9158 apply_deduced_return_type (current_function_decl
, type
);
9159 else if (!same_type_p (type
, functype
))
9161 if (LAMBDA_FUNCTION_P (current_function_decl
))
9162 error ("inconsistent types %qT and %qT deduced for "
9163 "lambda return type", functype
, type
);
9165 error ("inconsistent deduction for auto return type: "
9166 "%qT and then %qT", functype
, type
);
9171 result
= DECL_RESULT (current_function_decl
);
9172 valtype
= TREE_TYPE (result
);
9173 gcc_assert (valtype
!= NULL_TREE
);
9174 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
9176 /* Check for a return statement with no return value in a function
9177 that's supposed to return a value. */
9178 if (!retval
&& fn_returns_value_p
)
9180 if (functype
!= error_mark_node
)
9181 permerror (input_location
, "return-statement with no value, in "
9182 "function returning %qT", valtype
);
9183 /* Remember that this function did return. */
9184 current_function_returns_value
= 1;
9185 /* And signal caller that TREE_NO_WARNING should be set on the
9186 RETURN_EXPR to avoid control reaches end of non-void function
9187 warnings in tree-cfg.c. */
9190 /* Check for a return statement with a value in a function that
9191 isn't supposed to return a value. */
9192 else if (retval
&& !fn_returns_value_p
)
9194 if (VOID_TYPE_P (TREE_TYPE (retval
)))
9195 /* You can return a `void' value from a function of `void'
9196 type. In that case, we have to evaluate the expression for
9197 its side-effects. */
9198 finish_expr_stmt (retval
);
9200 permerror (input_location
,
9201 "return-statement with a value, in function "
9202 "returning %qT", valtype
);
9203 current_function_returns_null
= 1;
9205 /* There's really no value to return, after all. */
9209 /* Remember that this function can sometimes return without a
9211 current_function_returns_null
= 1;
9213 /* Remember that this function did return a value. */
9214 current_function_returns_value
= 1;
9216 /* Check for erroneous operands -- but after giving ourselves a
9217 chance to provide an error about returning a value from a void
9219 if (error_operand_p (retval
))
9221 current_function_return_value
= error_mark_node
;
9222 return error_mark_node
;
9225 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
9226 if (IDENTIFIER_NEW_OP_P (DECL_NAME (current_function_decl
))
9227 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
9229 && retval
&& null_ptr_cst_p (retval
))
9230 warning (0, "%<operator new%> must not return NULL unless it is "
9231 "declared %<throw()%> (or -fcheck-new is in effect)");
9233 /* Effective C++ rule 15. See also start_function. */
9235 && DECL_NAME (current_function_decl
) == assign_op_identifier
9236 && !type_dependent_expression_p (retval
))
9240 /* The function return type must be a reference to the current
9242 if (TREE_CODE (valtype
) == REFERENCE_TYPE
9243 && same_type_ignoring_top_level_qualifiers_p
9244 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
9246 /* Returning '*this' is obviously OK. */
9247 if (retval
== current_class_ref
)
9249 /* If we are calling a function whose return type is the same of
9250 the current class reference, it is ok. */
9251 else if (INDIRECT_REF_P (retval
)
9252 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
9257 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
9260 if (dependent_type_p (functype
)
9261 || type_dependent_expression_p (retval
))
9264 /* We should not have changed the return value. */
9265 gcc_assert (retval
== saved_retval
);
9269 /* The fabled Named Return Value optimization, as per [class.copy]/15:
9271 [...] For a function with a class return type, if the expression
9272 in the return statement is the name of a local object, and the cv-
9273 unqualified type of the local object is the same as the function
9274 return type, an implementation is permitted to omit creating the tem-
9275 porary object to hold the function return value [...]
9277 So, if this is a value-returning function that always returns the same
9278 local variable, remember it.
9280 It might be nice to be more flexible, and choose the first suitable
9281 variable even if the function sometimes returns something else, but
9282 then we run the risk of clobbering the variable we chose if the other
9283 returned expression uses the chosen variable somehow. And people expect
9284 this restriction, anyway. (jason 2000-11-19)
9286 See finish_function and finalize_nrv for the rest of this optimization. */
9288 named_return_value_okay_p
=
9289 (retval
!= NULL_TREE
9290 && !processing_template_decl
9291 /* Must be a local, automatic variable. */
9293 && DECL_CONTEXT (retval
) == current_function_decl
9294 && ! TREE_STATIC (retval
)
9295 /* And not a lambda or anonymous union proxy. */
9296 && !DECL_HAS_VALUE_EXPR_P (retval
)
9297 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
9298 /* The cv-unqualified type of the returned value must be the
9299 same as the cv-unqualified return type of the
9301 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
9302 (TYPE_MAIN_VARIANT (functype
)))
9303 /* And the returned value must be non-volatile. */
9304 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
9306 if (fn_returns_value_p
&& flag_elide_constructors
)
9308 if (named_return_value_okay_p
9309 && (current_function_return_value
== NULL_TREE
9310 || current_function_return_value
== retval
))
9311 current_function_return_value
= retval
;
9313 current_function_return_value
= error_mark_node
;
9316 /* We don't need to do any conversions when there's nothing being
9321 /* Do any required conversions. */
9322 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
9323 /* No conversions are required. */
9327 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
9329 /* The functype's return type will have been set to void, if it
9330 was an incomplete type. Just treat this as 'return;' */
9331 if (VOID_TYPE_P (functype
))
9332 return error_mark_node
;
9334 /* If we had an id-expression obfuscated by force_paren_expr, we need
9335 to undo it so we can try to treat it as an rvalue below. */
9336 retval
= maybe_undo_parenthesized_ref (retval
);
9338 if (processing_template_decl
)
9339 retval
= build_non_dependent_expr (retval
);
9341 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
9342 treated as an rvalue for the purposes of overload resolution to
9343 favor move constructors over copy constructors.
9345 Note that these conditions are similar to, but not as strict as,
9346 the conditions for the named return value optimization. */
9347 bool converted
= false;
9348 if ((cxx_dialect
!= cxx98
)
9349 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
9350 || TREE_CODE (retval
) == PARM_DECL
)
9351 && DECL_CONTEXT (retval
) == current_function_decl
9352 && !TREE_STATIC (retval
)
9353 /* This is only interesting for class type. */
9354 && CLASS_TYPE_P (functype
))
9356 tree moved
= move (retval
);
9357 moved
= convert_for_initialization
9358 (NULL_TREE
, functype
, moved
, flags
|LOOKUP_PREFER_RVALUE
,
9359 ICR_RETURN
, NULL_TREE
, 0, tf_none
);
9360 if (moved
!= error_mark_node
)
9367 /* First convert the value to the function's return type, then
9368 to the type of return value's location to handle the
9369 case that functype is smaller than the valtype. */
9371 retval
= convert_for_initialization
9372 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
9373 tf_warning_or_error
);
9374 retval
= convert (valtype
, retval
);
9376 /* If the conversion failed, treat this just like `return;'. */
9377 if (retval
== error_mark_node
)
9379 /* We can't initialize a register from a AGGR_INIT_EXPR. */
9380 else if (! cfun
->returns_struct
9381 && TREE_CODE (retval
) == TARGET_EXPR
9382 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
9383 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9384 TREE_OPERAND (retval
, 0));
9385 else if (!processing_template_decl
9386 && maybe_warn_about_returning_address_of_local (retval
))
9387 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9388 build_zero_cst (TREE_TYPE (retval
)));
9391 if (processing_template_decl
)
9392 return saved_retval
;
9394 /* Actually copy the value returned into the appropriate location. */
9395 if (retval
&& retval
!= result
)
9396 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
9402 /* Returns nonzero if the pointer-type FROM can be converted to the
9403 pointer-type TO via a qualification conversion. If CONSTP is -1,
9404 then we return nonzero if the pointers are similar, and the
9405 cv-qualification signature of FROM is a proper subset of that of TO.
9407 If CONSTP is positive, then all outer pointers have been
9411 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
9413 bool to_more_cv_qualified
= false;
9414 bool is_opaque_pointer
= false;
9416 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9418 if (TREE_CODE (to
) != TREE_CODE (from
))
9421 if (TREE_CODE (from
) == OFFSET_TYPE
9422 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
9423 TYPE_OFFSET_BASETYPE (to
)))
9426 /* Const and volatile mean something different for function types,
9427 so the usual checks are not appropriate. */
9428 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
9430 if (!at_least_as_qualified_p (to
, from
))
9433 if (!at_least_as_qualified_p (from
, to
))
9437 to_more_cv_qualified
= true;
9441 constp
&= TYPE_READONLY (to
);
9444 if (VECTOR_TYPE_P (to
))
9445 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9447 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9448 return ((constp
>= 0 || to_more_cv_qualified
)
9449 && (is_opaque_pointer
9450 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9454 /* When comparing, say, char ** to char const **, this function takes
9455 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9456 types to this function. */
9459 comp_ptr_ttypes (tree to
, tree from
)
9461 return comp_ptr_ttypes_real (to
, from
, 1);
9464 /* Returns true iff FNTYPE is a non-class type that involves
9465 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9466 if a parameter type is ill-formed. */
9469 error_type_p (const_tree type
)
9473 switch (TREE_CODE (type
))
9479 case REFERENCE_TYPE
:
9481 return error_type_p (TREE_TYPE (type
));
9485 if (error_type_p (TREE_TYPE (type
)))
9487 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9488 if (error_type_p (TREE_VALUE (t
)))
9493 if (TYPE_PTRMEMFUNC_P (type
))
9494 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9502 /* Returns true if to and from are (possibly multi-level) pointers to the same
9503 type or inheritance-related types, regardless of cv-quals. */
9506 ptr_reasonably_similar (const_tree to
, const_tree from
)
9508 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9510 /* Any target type is similar enough to void. */
9511 if (VOID_TYPE_P (to
))
9512 return !error_type_p (from
);
9513 if (VOID_TYPE_P (from
))
9514 return !error_type_p (to
);
9516 if (TREE_CODE (to
) != TREE_CODE (from
))
9519 if (TREE_CODE (from
) == OFFSET_TYPE
9520 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9521 TYPE_OFFSET_BASETYPE (from
),
9522 COMPARE_BASE
| COMPARE_DERIVED
))
9525 if (VECTOR_TYPE_P (to
)
9526 && vector_types_convertible_p (to
, from
, false))
9529 if (TREE_CODE (to
) == INTEGER_TYPE
9530 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9533 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9534 return !error_type_p (to
) && !error_type_p (from
);
9536 if (!TYPE_PTR_P (to
))
9538 /* When either type is incomplete avoid DERIVED_FROM_P,
9539 which may call complete_type (c++/57942). */
9540 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9542 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9543 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9548 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9549 pointer-to-member types) are the same, ignoring cv-qualification at
9553 comp_ptr_ttypes_const (tree to
, tree from
)
9555 bool is_opaque_pointer
= false;
9557 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9559 if (TREE_CODE (to
) != TREE_CODE (from
))
9562 if (TREE_CODE (from
) == OFFSET_TYPE
9563 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9564 TYPE_OFFSET_BASETYPE (to
)))
9567 if (VECTOR_TYPE_P (to
))
9568 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9570 if (!TYPE_PTR_P (to
))
9571 return (is_opaque_pointer
9572 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9576 /* Returns the type qualifiers for this type, including the qualifiers on the
9577 elements for an array type. */
9580 cp_type_quals (const_tree type
)
9583 /* This CONST_CAST is okay because strip_array_types returns its
9584 argument unmodified and we assign it to a const_tree. */
9585 type
= strip_array_types (CONST_CAST_TREE (type
));
9586 if (type
== error_mark_node
9587 /* Quals on a FUNCTION_TYPE are memfn quals. */
9588 || TREE_CODE (type
) == FUNCTION_TYPE
)
9589 return TYPE_UNQUALIFIED
;
9590 quals
= TYPE_QUALS (type
);
9591 /* METHOD and REFERENCE_TYPEs should never have quals. */
9592 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9593 && TREE_CODE (type
) != REFERENCE_TYPE
)
9594 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9595 == TYPE_UNQUALIFIED
));
9599 /* Returns the function-ref-qualifier for TYPE */
9602 type_memfn_rqual (const_tree type
)
9604 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9605 || TREE_CODE (type
) == METHOD_TYPE
);
9607 if (!FUNCTION_REF_QUALIFIED (type
))
9608 return REF_QUAL_NONE
;
9609 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9610 return REF_QUAL_RVALUE
;
9612 return REF_QUAL_LVALUE
;
9615 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9619 type_memfn_quals (const_tree type
)
9621 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9622 return TYPE_QUALS (type
);
9623 else if (TREE_CODE (type
) == METHOD_TYPE
)
9624 return cp_type_quals (class_of_this_parm (type
));
9629 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9630 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9633 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9635 /* Could handle METHOD_TYPE here if necessary. */
9636 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9637 if (TYPE_QUALS (type
) == memfn_quals
9638 && type_memfn_rqual (type
) == rqual
)
9641 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9643 tree result
= build_qualified_type (type
, memfn_quals
);
9644 return build_ref_qualified_type (result
, rqual
);
9647 /* Returns nonzero if TYPE is const or volatile. */
9650 cv_qualified_p (const_tree type
)
9652 int quals
= cp_type_quals (type
);
9653 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9656 /* Returns nonzero if the TYPE contains a mutable member. */
9659 cp_has_mutable_p (const_tree type
)
9661 /* This CONST_CAST is okay because strip_array_types returns its
9662 argument unmodified and we assign it to a const_tree. */
9663 type
= strip_array_types (CONST_CAST_TREE(type
));
9665 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9668 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9669 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9670 approximation. In particular, consider:
9673 struct S { int i; };
9674 const S s = { f(); }
9676 Here, we will make "s" as TREE_READONLY (because it is declared
9677 "const") -- only to reverse ourselves upon seeing that the
9678 initializer is non-constant. */
9681 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9683 tree type
= TREE_TYPE (decl
);
9685 if (type
== error_mark_node
)
9688 if (TREE_CODE (decl
) == TYPE_DECL
)
9691 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9692 && type_quals
!= TYPE_UNQUALIFIED
));
9694 /* Avoid setting TREE_READONLY incorrectly. */
9695 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9696 constructor can produce constant init, so rely on cp_finish_decl to
9697 clear TREE_READONLY if the variable has non-constant init. */
9699 /* If the type has (or might have) a mutable component, that component
9700 might be modified. */
9701 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9702 type_quals
&= ~TYPE_QUAL_CONST
;
9704 c_apply_type_quals_to_decl (type_quals
, decl
);
9707 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9708 exemplar types such that casting T1 to T2 is casting away constness
9709 if and only if there is no implicit conversion from T1 to T2. */
9712 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9717 /* [expr.const.cast]
9719 For multi-level pointer to members and multi-level mixed pointers
9720 and pointers to members (conv.qual), the "member" aspect of a
9721 pointer to member level is ignored when determining if a const
9722 cv-qualifier has been cast away. */
9723 /* [expr.const.cast]
9725 For two pointer types:
9727 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9728 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9731 casting from X1 to X2 casts away constness if, for a non-pointer
9732 type T there does not exist an implicit conversion (clause
9735 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9739 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9740 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9741 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9743 *t1
= cp_build_qualified_type (void_type_node
,
9744 cp_type_quals (*t1
));
9745 *t2
= cp_build_qualified_type (void_type_node
,
9746 cp_type_quals (*t2
));
9750 quals1
= cp_type_quals (*t1
);
9751 quals2
= cp_type_quals (*t2
);
9753 if (TYPE_PTRDATAMEM_P (*t1
))
9754 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9756 *t1
= TREE_TYPE (*t1
);
9757 if (TYPE_PTRDATAMEM_P (*t2
))
9758 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9760 *t2
= TREE_TYPE (*t2
);
9762 casts_away_constness_r (t1
, t2
, complain
);
9763 *t1
= build_pointer_type (*t1
);
9764 *t2
= build_pointer_type (*t2
);
9765 *t1
= cp_build_qualified_type (*t1
, quals1
);
9766 *t2
= cp_build_qualified_type (*t2
, quals2
);
9769 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9772 ??? This function returns non-zero if casting away qualifiers not
9773 just const. We would like to return to the caller exactly which
9774 qualifiers are casted away to give more accurate diagnostics.
9778 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9780 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9782 /* [expr.const.cast]
9784 Casting from an lvalue of type T1 to an lvalue of type T2
9785 using a reference cast casts away constness if a cast from an
9786 rvalue of type "pointer to T1" to the type "pointer to T2"
9787 casts away constness. */
9788 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9789 return casts_away_constness (build_pointer_type (t1
),
9790 build_pointer_type (TREE_TYPE (t2
)),
9794 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9795 /* [expr.const.cast]
9797 Casting from an rvalue of type "pointer to data member of X
9798 of type T1" to the type "pointer to data member of Y of type
9799 T2" casts away constness if a cast from an rvalue of type
9800 "pointer to T1" to the type "pointer to T2" casts away
9802 return casts_away_constness
9803 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9804 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9807 /* Casting away constness is only something that makes sense for
9808 pointer or reference types. */
9809 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9812 /* Top-level qualifiers don't matter. */
9813 t1
= TYPE_MAIN_VARIANT (t1
);
9814 t2
= TYPE_MAIN_VARIANT (t2
);
9815 casts_away_constness_r (&t1
, &t2
, complain
);
9816 if (!can_convert (t2
, t1
, complain
))
9822 /* If T is a REFERENCE_TYPE return the type to which T refers.
9823 Otherwise, return T itself. */
9826 non_reference (tree t
)
9828 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9834 /* Return nonzero if REF is an lvalue valid for this language;
9835 otherwise, print an error message and return zero. USE says
9836 how the lvalue is being used and so selects the error message. */
9839 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9841 cp_lvalue_kind kind
= lvalue_kind (ref
);
9843 if (kind
== clk_none
)
9845 if (complain
& tf_error
)
9846 lvalue_error (input_location
, use
);
9849 else if (kind
& (clk_rvalueref
|clk_class
))
9851 if (!(complain
& tf_error
))
9853 if (kind
& clk_class
)
9854 /* Make this a permerror because we used to accept it. */
9855 permerror (input_location
, "using temporary as lvalue");
9857 error ("using xvalue (rvalue reference) as lvalue");
9862 /* Return true if a user-defined literal operator is a raw operator. */
9865 check_raw_literal_operator (const_tree decl
)
9867 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9870 bool maybe_raw_p
= false;
9872 /* Count the number and type of arguments and check for ellipsis. */
9873 for (argtype
= argtypes
, arity
= 0;
9874 argtype
&& argtype
!= void_list_node
;
9875 ++arity
, argtype
= TREE_CHAIN (argtype
))
9877 tree t
= TREE_VALUE (argtype
);
9879 if (same_type_p (t
, const_string_type_node
))
9883 return false; /* Found ellipsis. */
9885 if (!maybe_raw_p
|| arity
!= 1)
9892 /* Return true if a user-defined literal operator has one of the allowed
9896 check_literal_operator_args (const_tree decl
,
9897 bool *long_long_unsigned_p
, bool *long_double_p
)
9899 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9901 *long_long_unsigned_p
= false;
9902 *long_double_p
= false;
9903 if (processing_template_decl
|| processing_specialization
)
9904 return argtypes
== void_list_node
;
9911 /* Count the number and type of arguments and check for ellipsis. */
9912 for (argtype
= argtypes
, arity
= 0;
9913 argtype
&& argtype
!= void_list_node
;
9914 argtype
= TREE_CHAIN (argtype
))
9916 tree t
= TREE_VALUE (argtype
);
9921 bool maybe_raw_p
= false;
9923 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9925 t
= TYPE_MAIN_VARIANT (t
);
9926 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9927 || same_type_p (t
, wchar_type_node
)
9928 || same_type_p (t
, char16_type_node
)
9929 || same_type_p (t
, char32_type_node
))
9931 argtype
= TREE_CHAIN (argtype
);
9934 t
= TREE_VALUE (argtype
);
9935 if (maybe_raw_p
&& argtype
== void_list_node
)
9937 else if (same_type_p (t
, size_type_node
))
9946 else if (same_type_p (t
, long_long_unsigned_type_node
))
9949 *long_long_unsigned_p
= true;
9951 else if (same_type_p (t
, long_double_type_node
))
9954 *long_double_p
= true;
9956 else if (same_type_p (t
, char_type_node
))
9958 else if (same_type_p (t
, wchar_type_node
))
9960 else if (same_type_p (t
, char16_type_node
))
9962 else if (same_type_p (t
, char32_type_node
))
9968 return false; /* Found ellipsis. */
9970 if (arity
!= max_arity
)
9977 /* Always returns false since unlike C90, C++ has no concept of implicit
9978 function declarations. */
9981 c_decl_implicit (const_tree
)