1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2016 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"
41 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
42 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
43 static tree
pfn_from_ptrmemfunc (tree
);
44 static tree
delta_from_ptrmemfunc (tree
);
45 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
47 static tree
cp_pointer_int_sum (location_t
, enum tree_code
, tree
, tree
,
49 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
51 static int comp_ptr_ttypes_real (tree
, tree
, int);
52 static bool comp_except_types (tree
, tree
, bool);
53 static bool comp_array_types (const_tree
, const_tree
, bool);
54 static tree
pointer_diff (location_t
, tree
, tree
, tree
, tsubst_flags_t
);
55 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
56 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
57 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
58 static bool maybe_warn_about_returning_address_of_local (tree
);
59 static tree
lookup_destructor (tree
, tree
, tree
, tsubst_flags_t
);
60 static void error_args_num (location_t
, tree
, bool);
61 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
64 /* Do `exp = require_complete_type (exp);' to make sure exp
65 does not have an incomplete type. (That includes void types.)
66 Returns error_mark_node if the VALUE does not have
67 complete type when this function returns. */
70 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
74 if (processing_template_decl
|| value
== error_mark_node
)
77 if (TREE_CODE (value
) == OVERLOAD
)
78 type
= unknown_type_node
;
80 type
= TREE_TYPE (value
);
82 if (type
== error_mark_node
)
83 return error_mark_node
;
85 /* First, detect a valid value with a complete type. */
86 if (COMPLETE_TYPE_P (type
))
89 if (complete_type_or_maybe_complain (type
, value
, complain
))
92 return error_mark_node
;
96 require_complete_type (tree value
)
98 return require_complete_type_sfinae (value
, tf_warning_or_error
);
101 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
102 a template instantiation, do the instantiation. Returns TYPE,
103 whether or not it could be completed, unless something goes
104 horribly wrong, in which case the error_mark_node is returned. */
107 complete_type (tree type
)
109 if (type
== NULL_TREE
)
110 /* Rather than crash, we return something sure to cause an error
112 return error_mark_node
;
114 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
116 else if (TREE_CODE (type
) == ARRAY_TYPE
)
118 tree t
= complete_type (TREE_TYPE (type
));
119 unsigned int needs_constructing
, has_nontrivial_dtor
;
120 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
123 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
125 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
126 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
128 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
129 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
132 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
133 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
138 /* Like complete_type, but issue an error if the TYPE cannot be completed.
139 VALUE is used for informative diagnostics.
140 Returns NULL_TREE if the type cannot be made complete. */
143 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
145 type
= complete_type (type
);
146 if (type
== error_mark_node
)
147 /* We already issued an error. */
149 else if (!COMPLETE_TYPE_P (type
))
151 if (complain
& tf_error
)
152 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
160 complete_type_or_else (tree type
, tree value
)
162 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
165 /* Return truthvalue of whether type of EXP is instantiated. */
168 type_unknown_p (const_tree exp
)
170 return (TREE_CODE (exp
) == TREE_LIST
171 || TREE_TYPE (exp
) == unknown_type_node
);
175 /* Return the common type of two parameter lists.
176 We assume that comptypes has already been done and returned 1;
177 if that isn't so, this may crash.
179 As an optimization, free the space we allocate if the parameter
180 lists are already common. */
183 commonparms (tree p1
, tree p2
)
185 tree oldargs
= p1
, newargs
, n
;
189 len
= list_length (p1
);
190 newargs
= tree_last (p1
);
192 if (newargs
== void_list_node
)
201 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
206 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
208 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
210 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
213 else if (! TREE_PURPOSE (p1
))
215 if (TREE_PURPOSE (p2
))
217 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
223 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
225 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
227 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
230 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
233 TREE_VALUE (n
) = TREE_VALUE (p1
);
241 /* Given a type, perhaps copied for a typedef,
242 find the "original" version of it. */
244 original_type (tree t
)
246 int quals
= cp_type_quals (t
);
247 while (t
!= error_mark_node
248 && TYPE_NAME (t
) != NULL_TREE
)
250 tree x
= TYPE_NAME (t
);
251 if (TREE_CODE (x
) != TYPE_DECL
)
253 x
= DECL_ORIGINAL_TYPE (x
);
258 return cp_build_qualified_type (t
, quals
);
261 /* Return the common type for two arithmetic types T1 and T2 under the
262 usual arithmetic conversions. The default conversions have already
263 been applied, and enumerated types converted to their compatible
267 cp_common_type (tree t1
, tree t2
)
269 enum tree_code code1
= TREE_CODE (t1
);
270 enum tree_code code2
= TREE_CODE (t2
);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
280 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
282 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
283 return build_type_attribute_variant (t1
, attributes
);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1
)
290 || VECTOR_TYPE_P (t1
)
291 || UNSCOPED_ENUM_P (t1
));
292 gcc_assert (ARITHMETIC_TYPE_P (t2
)
293 || VECTOR_TYPE_P (t2
)
294 || UNSCOPED_ENUM_P (t2
));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
301 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
302 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
304 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
306 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
307 return build_type_attribute_variant (t1
, attributes
);
308 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
309 return build_type_attribute_variant (t2
, attributes
);
311 return build_type_attribute_variant (build_complex_type (subtype
),
315 if (code1
== VECTOR_TYPE
)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1
))
320 return build_type_attribute_variant (t1
, attributes
);
322 return build_type_attribute_variant (t2
, attributes
);
325 /* If only one is real, use it as the result. */
326 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
327 return build_type_attribute_variant (t1
, attributes
);
328 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
329 return build_type_attribute_variant (t2
, attributes
);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
333 return build_type_attribute_variant (t1
, attributes
);
334 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
335 return build_type_attribute_variant (t2
, attributes
);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
339 return build_type_attribute_variant (t1
, attributes
);
341 if (code1
!= REAL_TYPE
)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
347 return build_type_attribute_variant (long_long_unsigned_type_node
,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
368 /* Go through the same procedure, but for longs. */
369 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
371 return build_type_attribute_variant (long_unsigned_type_node
,
373 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
374 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
376 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
377 ? long_unsigned_type_node
: long_integer_type_node
);
378 return build_type_attribute_variant (t
, attributes
);
381 /* For __intN types, either the type is __int128 (and is lower
382 priority than the types checked above, but higher than other
383 128-bit types) or it's known to not be the same size as other
384 types (enforced in toplev.c). Prefer the unsigned type. */
385 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
387 if (int_n_enabled_p
[i
]
388 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
389 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
390 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
391 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
393 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
394 ? int_n_trees
[i
].unsigned_type
395 : int_n_trees
[i
].signed_type
);
396 return build_type_attribute_variant (t
, attributes
);
400 /* Otherwise prefer the unsigned one. */
401 if (TYPE_UNSIGNED (t1
))
402 return build_type_attribute_variant (t1
, attributes
);
404 return build_type_attribute_variant (t2
, attributes
);
408 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
409 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
410 return build_type_attribute_variant (long_double_type_node
,
412 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
413 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
414 return build_type_attribute_variant (double_type_node
,
416 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
417 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
418 return build_type_attribute_variant (float_type_node
,
421 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
422 the standard C++ floating-point types. Logic earlier in this
423 function has already eliminated the possibility that
424 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
425 compelling reason to choose one or the other. */
426 return build_type_attribute_variant (t1
, attributes
);
430 /* T1 and T2 are arithmetic or enumeration types. Return the type
431 that will result from the "usual arithmetic conversions" on T1 and
432 T2 as described in [expr]. */
435 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
437 gcc_assert (ARITHMETIC_TYPE_P (t1
)
438 || VECTOR_TYPE_P (t1
)
439 || UNSCOPED_ENUM_P (t1
));
440 gcc_assert (ARITHMETIC_TYPE_P (t2
)
441 || VECTOR_TYPE_P (t2
)
442 || UNSCOPED_ENUM_P (t2
));
444 /* Perform the integral promotions. We do not promote real types here. */
445 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
446 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
448 t1
= type_promotes_to (t1
);
449 t2
= type_promotes_to (t2
);
452 return cp_common_type (t1
, t2
);
456 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
457 composite_pointer_operation operation
)
462 emit_diagnostic (kind
, input_location
, 0,
463 "comparison between "
464 "distinct pointer types %qT and %qT lacks a cast",
468 emit_diagnostic (kind
, input_location
, 0,
469 "conversion between "
470 "distinct pointer types %qT and %qT lacks a cast",
473 case CPO_CONDITIONAL_EXPR
:
474 emit_diagnostic (kind
, input_location
, 0,
475 "conditional expression between "
476 "distinct pointer types %qT and %qT lacks a cast",
484 /* Subroutine of composite_pointer_type to implement the recursive
485 case. See that function for documentation of the parameters. */
488 composite_pointer_type_r (tree t1
, tree t2
,
489 composite_pointer_operation operation
,
490 tsubst_flags_t complain
)
497 /* Determine the types pointed to by T1 and T2. */
500 pointee1
= TREE_TYPE (t1
);
501 pointee2
= TREE_TYPE (t2
);
505 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
506 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
511 Otherwise, the composite pointer type is a pointer type
512 similar (_conv.qual_) to the type of one of the operands,
513 with a cv-qualification signature (_conv.qual_) that is the
514 union of the cv-qualification signatures of the operand
516 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
517 result_type
= pointee1
;
518 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
519 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
521 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
523 if (result_type
== error_mark_node
)
524 return error_mark_node
;
528 if (complain
& tf_error
)
529 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
531 return error_mark_node
;
532 result_type
= void_type_node
;
534 result_type
= cp_build_qualified_type (result_type
,
535 (cp_type_quals (pointee1
)
536 | cp_type_quals (pointee2
)));
537 /* If the original types were pointers to members, so is the
539 if (TYPE_PTRMEM_P (t1
))
541 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
542 TYPE_PTRMEM_CLASS_TYPE (t2
)))
544 if (complain
& tf_error
)
545 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
547 return error_mark_node
;
549 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
553 result_type
= build_pointer_type (result_type
);
555 /* Merge the attributes. */
556 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
557 return build_type_attribute_variant (result_type
, attributes
);
560 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
561 ARG1 and ARG2 are the values with those types. The OPERATION is to
562 describe the operation between the pointer types,
563 in case an error occurs.
565 This routine also implements the computation of a common type for
566 pointers-to-members as per [expr.eq]. */
569 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
570 composite_pointer_operation operation
,
571 tsubst_flags_t complain
)
578 If one operand is a null pointer constant, the composite pointer
579 type is the type of the other operand. */
580 if (null_ptr_cst_p (arg1
))
582 if (null_ptr_cst_p (arg2
))
589 If one of the operands has type "pointer to cv1 void*", then
590 the other has type "pointer to cv2T", and the composite pointer
591 type is "pointer to cv12 void", where cv12 is the union of cv1
594 If either type is a pointer to void, make sure it is T1. */
595 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
598 /* Now, if T1 is a pointer to void, merge the qualifiers. */
599 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
604 if (TYPE_PTRFN_P (t2
))
606 if (complain
& tf_error
)
611 pedwarn (input_location
, OPT_Wpedantic
,
612 "ISO C++ forbids comparison between pointer "
613 "of type %<void *%> and pointer-to-function");
616 pedwarn (input_location
, OPT_Wpedantic
,
617 "ISO C++ forbids conversion between pointer "
618 "of type %<void *%> and pointer-to-function");
620 case CPO_CONDITIONAL_EXPR
:
621 pedwarn (input_location
, OPT_Wpedantic
,
622 "ISO C++ forbids conditional expression between "
623 "pointer of type %<void *%> and "
624 "pointer-to-function");
631 return error_mark_node
;
634 = cp_build_qualified_type (void_type_node
,
635 (cp_type_quals (TREE_TYPE (t1
))
636 | cp_type_quals (TREE_TYPE (t2
))));
637 result_type
= build_pointer_type (result_type
);
638 /* Merge the attributes. */
639 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
640 return build_type_attribute_variant (result_type
, attributes
);
643 if (c_dialect_objc () && TYPE_PTR_P (t1
)
646 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
647 return objc_common_type (t1
, t2
);
650 /* [expr.eq] permits the application of a pointer conversion to
651 bring the pointers to a common type. */
652 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
653 && CLASS_TYPE_P (TREE_TYPE (t1
))
654 && CLASS_TYPE_P (TREE_TYPE (t2
))
655 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
658 class1
= TREE_TYPE (t1
);
659 class2
= TREE_TYPE (t2
);
661 if (DERIVED_FROM_P (class1
, class2
))
662 t2
= (build_pointer_type
663 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
664 else if (DERIVED_FROM_P (class2
, class1
))
665 t1
= (build_pointer_type
666 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
669 if (complain
& tf_error
)
670 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
671 return error_mark_node
;
674 /* [expr.eq] permits the application of a pointer-to-member
675 conversion to change the class type of one of the types. */
676 else if (TYPE_PTRMEM_P (t1
)
677 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
678 TYPE_PTRMEM_CLASS_TYPE (t2
)))
680 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
681 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
683 if (DERIVED_FROM_P (class1
, class2
))
684 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
685 else if (DERIVED_FROM_P (class2
, class1
))
686 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
689 if (complain
& tf_error
)
693 error ("comparison between distinct "
694 "pointer-to-member types %qT and %qT lacks a cast",
698 error ("conversion between distinct "
699 "pointer-to-member types %qT and %qT lacks a cast",
702 case CPO_CONDITIONAL_EXPR
:
703 error ("conditional expression between distinct "
704 "pointer-to-member types %qT and %qT lacks a cast",
710 return error_mark_node
;
713 else if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
714 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (t1
))
715 && TREE_CODE (TREE_TYPE (t2
)) == TREE_CODE (TREE_TYPE (t1
)))
717 /* ...if T1 is "pointer to transaction_safe function" and T2 is "pointer
718 to function", where the function types are otherwise the same, T2, and
720 tree f1
= TREE_TYPE (t1
);
721 tree f2
= TREE_TYPE (t2
);
722 bool safe1
= tx_safe_fn_type_p (f1
);
723 bool safe2
= tx_safe_fn_type_p (f2
);
725 t1
= build_pointer_type (tx_unsafe_fn_variant (f1
));
726 else if (safe2
&& !safe1
)
727 t2
= build_pointer_type (tx_unsafe_fn_variant (f2
));
730 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
733 /* Return the merged type of two types.
734 We assume that comptypes has already been done and returned 1;
735 if that isn't so, this may crash.
737 This just combines attributes and default arguments; any other
738 differences would cause the two types to compare unalike. */
741 merge_types (tree t1
, tree t2
)
743 enum tree_code code1
;
744 enum tree_code code2
;
747 /* Save time if the two types are the same. */
750 if (original_type (t1
) == original_type (t2
))
753 /* If one type is nonsense, use the other. */
754 if (t1
== error_mark_node
)
756 if (t2
== error_mark_node
)
759 /* Handle merging an auto redeclaration with a previous deduced
764 /* Merge the attributes. */
765 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
767 if (TYPE_PTRMEMFUNC_P (t1
))
768 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
769 if (TYPE_PTRMEMFUNC_P (t2
))
770 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
772 code1
= TREE_CODE (t1
);
773 code2
= TREE_CODE (t2
);
776 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
777 if (code1
== TYPENAME_TYPE
)
779 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
780 code1
= TREE_CODE (t1
);
784 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
785 code2
= TREE_CODE (t2
);
793 /* For two pointers, do this recursively on the target type. */
795 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
796 int quals
= cp_type_quals (t1
);
798 if (code1
== POINTER_TYPE
)
800 t1
= build_pointer_type (target
);
801 if (TREE_CODE (target
) == METHOD_TYPE
)
802 t1
= build_ptrmemfunc_type (t1
);
805 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
806 t1
= build_type_attribute_variant (t1
, attributes
);
807 t1
= cp_build_qualified_type (t1
, quals
);
816 quals
= cp_type_quals (t1
);
817 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
818 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
819 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
821 t1
= cp_build_qualified_type (t1
, quals
);
827 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
828 /* Save space: see if the result is identical to one of the args. */
829 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
830 return build_type_attribute_variant (t1
, attributes
);
831 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
832 return build_type_attribute_variant (t2
, attributes
);
833 /* Merge the element types, and have a size if either arg has one. */
834 t1
= build_cplus_array_type
835 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
840 /* Function types: prefer the one that specified arg types.
841 If both do, merge the arg types. Also merge the return types. */
843 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
844 tree p1
= TYPE_ARG_TYPES (t1
);
845 tree p2
= TYPE_ARG_TYPES (t2
);
848 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
850 /* Save space: see if the result is identical to one of the args. */
851 if (valtype
== TREE_TYPE (t1
) && ! p2
)
852 return cp_build_type_attribute_variant (t1
, attributes
);
853 if (valtype
== TREE_TYPE (t2
) && ! p1
)
854 return cp_build_type_attribute_variant (t2
, attributes
);
856 /* Simple way if one arg fails to specify argument types. */
857 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
859 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
862 parms
= commonparms (p1
, p2
);
864 rval
= build_function_type (valtype
, parms
);
865 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
866 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
867 rval
= apply_memfn_quals (rval
,
868 type_memfn_quals (t1
),
869 type_memfn_rqual (t1
));
870 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
871 TYPE_RAISES_EXCEPTIONS (t2
));
872 t1
= build_exception_variant (rval
, raises
);
873 if (late_return_type_p
)
874 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
880 /* Get this value the long way, since TYPE_METHOD_BASETYPE
881 is just the main variant of this. */
882 tree basetype
= class_of_this_parm (t2
);
883 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
884 TYPE_RAISES_EXCEPTIONS (t2
));
885 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
887 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
888 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
890 /* If this was a member function type, get back to the
891 original type of type member function (i.e., without
892 the class instance variable up front. */
893 t1
= build_function_type (TREE_TYPE (t1
),
894 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
895 t2
= build_function_type (TREE_TYPE (t2
),
896 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
897 t3
= merge_types (t1
, t2
);
898 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
899 TYPE_ARG_TYPES (t3
));
900 t1
= build_exception_variant (t3
, raises
);
901 t1
= build_ref_qualified_type (t1
, rqual
);
902 if (late_return_type_1_p
)
903 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
904 if (late_return_type_2_p
)
905 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
910 /* There is no need to merge attributes into a TYPENAME_TYPE.
911 When the type is instantiated it will have whatever
912 attributes result from the instantiation. */
918 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
920 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
923 return cp_build_type_attribute_variant (t1
, attributes
);
926 /* Return the ARRAY_TYPE type without its domain. */
929 strip_array_domain (tree type
)
932 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
933 if (TYPE_DOMAIN (type
) == NULL_TREE
)
935 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
936 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
939 /* Wrapper around cp_common_type that is used by c-common.c and other
940 front end optimizations that remove promotions.
942 Return the common type for two arithmetic types T1 and T2 under the
943 usual arithmetic conversions. The default conversions have already
944 been applied, and enumerated types converted to their compatible
948 common_type (tree t1
, tree t2
)
950 /* If one type is nonsense, use the other */
951 if (t1
== error_mark_node
)
953 if (t2
== error_mark_node
)
956 return cp_common_type (t1
, t2
);
959 /* Return the common type of two pointer types T1 and T2. This is the
960 type for the result of most arithmetic operations if the operands
961 have the given two types.
963 We assume that comp_target_types has already been done and returned
964 nonzero; if that isn't so, this may crash. */
967 common_pointer_type (tree t1
, tree t2
)
969 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
970 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
971 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
973 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
974 CPO_CONVERSION
, tf_warning_or_error
);
977 /* Compare two exception specifier types for exactness or subsetness, if
978 allowed. Returns false for mismatch, true for match (same, or
981 [except.spec] "If a class X ... objects of class X or any class publicly
982 and unambiguously derived from X. Similarly, if a pointer type Y * ...
983 exceptions of type Y * or that are pointers to any type publicly and
984 unambiguously derived from Y. Otherwise a function only allows exceptions
985 that have the same type ..."
986 This does not mention cv qualifiers and is different to what throw
987 [except.throw] and catch [except.catch] will do. They will ignore the
988 top level cv qualifiers, and allow qualifiers in the pointer to class
991 We implement the letter of the standard. */
994 comp_except_types (tree a
, tree b
, bool exact
)
996 if (same_type_p (a
, b
))
1000 if (cp_type_quals (a
) || cp_type_quals (b
))
1003 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
1007 if (cp_type_quals (a
) || cp_type_quals (b
))
1011 if (TREE_CODE (a
) != RECORD_TYPE
1012 || TREE_CODE (b
) != RECORD_TYPE
)
1015 if (publicly_uniquely_derived_p (a
, b
))
1021 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1022 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1023 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1024 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1025 are unordered, but we've already filtered out duplicates. Most lists will
1026 be in order, we should try to make use of that. */
1029 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1038 /* First handle noexcept. */
1039 if (exact
< ce_exact
)
1041 /* noexcept(false) is compatible with no exception-specification,
1042 and stricter than any spec. */
1043 if (t1
== noexcept_false_spec
)
1044 return t2
== NULL_TREE
|| exact
== ce_derived
;
1045 /* Even a derived noexcept(false) is compatible with no
1046 exception-specification. */
1047 if (t2
== noexcept_false_spec
)
1048 return t1
== NULL_TREE
;
1050 /* Otherwise, if we aren't looking for an exact match, noexcept is
1051 equivalent to throw(). */
1052 if (t1
== noexcept_true_spec
)
1053 t1
= empty_except_spec
;
1054 if (t2
== noexcept_true_spec
)
1055 t2
= empty_except_spec
;
1058 /* If any noexcept is left, it is only comparable to itself;
1059 either we're looking for an exact match or we're redeclaring a
1060 template with dependent noexcept. */
1061 if ((t1
&& TREE_PURPOSE (t1
))
1062 || (t2
&& TREE_PURPOSE (t2
)))
1064 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1066 if (t1
== NULL_TREE
) /* T1 is ... */
1067 return t2
== NULL_TREE
|| exact
== ce_derived
;
1068 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1069 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1070 if (t2
== NULL_TREE
) /* T2 is ... */
1072 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1073 return exact
== ce_derived
;
1075 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1076 Count how many we find, to determine exactness. For exact matching and
1077 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1079 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1081 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1083 tree a
= TREE_VALUE (probe
);
1084 tree b
= TREE_VALUE (t2
);
1086 if (comp_except_types (a
, b
, exact
))
1088 if (probe
== base
&& exact
> ce_derived
)
1089 base
= TREE_CHAIN (probe
);
1094 if (probe
== NULL_TREE
)
1097 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1100 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1101 [] can match [size]. */
1104 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1113 /* The type of the array elements must be the same. */
1114 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1117 d1
= TYPE_DOMAIN (t1
);
1118 d2
= TYPE_DOMAIN (t2
);
1123 /* If one of the arrays is dimensionless, and the other has a
1124 dimension, they are of different types. However, it is valid to
1132 declarations for an array object can specify
1133 array types that differ by the presence or absence of a major
1134 array bound (_dcl.array_). */
1136 return allow_redeclaration
;
1138 /* Check that the dimensions are the same. */
1140 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1142 max1
= TYPE_MAX_VALUE (d1
);
1143 max2
= TYPE_MAX_VALUE (d2
);
1145 if (!cp_tree_equal (max1
, max2
))
1151 /* Compare the relative position of T1 and T2 into their respective
1152 template parameter list.
1153 T1 and T2 must be template parameter types.
1154 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1157 comp_template_parms_position (tree t1
, tree t2
)
1159 tree index1
, index2
;
1160 gcc_assert (t1
&& t2
1161 && TREE_CODE (t1
) == TREE_CODE (t2
)
1162 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1163 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1164 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1166 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1167 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1169 /* Then compare their relative position. */
1170 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1171 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1172 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1173 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1176 /* In C++14 we can end up comparing 'auto' to a normal template
1177 parameter. Don't confuse them. */
1178 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1179 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1184 /* Subroutine in comptypes. */
1187 structural_comptypes (tree t1
, tree t2
, int strict
)
1192 /* Suppress errors caused by previously reported errors. */
1193 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1196 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1198 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1199 current instantiation. */
1200 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1201 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1203 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1204 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1206 if (TYPE_PTRMEMFUNC_P (t1
))
1207 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1208 if (TYPE_PTRMEMFUNC_P (t2
))
1209 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1211 /* Different classes of types can't be compatible. */
1212 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1215 /* Qualifiers must match. For array types, we will check when we
1216 recur on the array element types. */
1217 if (TREE_CODE (t1
) != ARRAY_TYPE
1218 && cp_type_quals (t1
) != cp_type_quals (t2
))
1220 if (TREE_CODE (t1
) == FUNCTION_TYPE
1221 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1223 /* Need to check this before TYPE_MAIN_VARIANT.
1224 FIXME function qualifiers should really change the main variant. */
1225 if ((TREE_CODE (t1
) == FUNCTION_TYPE
1226 || TREE_CODE (t1
) == METHOD_TYPE
)
1227 && type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1229 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1232 /* Allow for two different type nodes which have essentially the same
1233 definition. Note that we already checked for equality of the type
1234 qualifiers (just above). */
1236 if (TREE_CODE (t1
) != ARRAY_TYPE
1237 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1241 /* Compare the types. Break out if they could be the same. */
1242 switch (TREE_CODE (t1
))
1246 /* All void and bool types are the same. */
1250 case FIXED_POINT_TYPE
:
1252 /* With these nodes, we can't determine type equivalence by
1253 looking at what is stored in the nodes themselves, because
1254 two nodes might have different TYPE_MAIN_VARIANTs but still
1255 represent the same type. For example, wchar_t and int could
1256 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1257 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1258 and are distinct types. On the other hand, int and the
1261 typedef int INT __attribute((may_alias));
1263 have identical properties, different TYPE_MAIN_VARIANTs, but
1264 represent the same type. The canonical type system keeps
1265 track of equivalence in this case, so we fall back on it. */
1266 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1268 case TEMPLATE_TEMPLATE_PARM
:
1269 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1270 if (!comp_template_parms_position (t1
, t2
))
1272 if (!comp_template_parms
1273 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1274 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1276 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1278 /* Don't check inheritance. */
1279 strict
= COMPARE_STRICT
;
1284 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1285 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1286 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1287 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1290 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1292 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1298 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1299 strict
& ~COMPARE_REDECLARATION
))
1301 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1305 case REFERENCE_TYPE
:
1306 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1308 /* fall through to checks for pointer types */
1311 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1312 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1320 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1325 /* Target types must match incl. qualifiers. */
1326 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1330 case TEMPLATE_TYPE_PARM
:
1331 /* If T1 and T2 don't have the same relative position in their
1332 template parameters set, they can't be equal. */
1333 if (!comp_template_parms_position (t1
, t2
))
1335 /* Constrained 'auto's are distinct from parms that don't have the same
1337 if (!equivalent_placeholder_constraints (t1
, t2
))
1342 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1343 TYPENAME_TYPE_FULLNAME (t2
)))
1345 /* Qualifiers don't matter on scopes. */
1346 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1351 case UNBOUND_CLASS_TEMPLATE
:
1352 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1354 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1359 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1364 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1365 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1369 case TYPE_PACK_EXPANSION
:
1370 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1371 PACK_EXPANSION_PATTERN (t2
))
1372 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1373 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1376 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1377 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1378 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1379 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1380 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1381 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1382 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1383 DECLTYPE_TYPE_EXPR (t2
)))
1387 case UNDERLYING_TYPE
:
1388 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1389 UNDERLYING_TYPE_TYPE (t2
));
1395 /* If we get here, we know that from a target independent POV the
1396 types are the same. Make sure the target attributes are also
1398 return comp_type_attributes (t1
, t2
);
1401 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1402 is a bitwise-or of the COMPARE_* flags. */
1405 comptypes (tree t1
, tree t2
, int strict
)
1407 if (strict
== COMPARE_STRICT
)
1412 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1415 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1416 /* At least one of the types requires structural equality, so
1417 perform a deep check. */
1418 return structural_comptypes (t1
, t2
, strict
);
1420 if (flag_checking
&& USE_CANONICAL_TYPES
)
1422 bool result
= structural_comptypes (t1
, t2
, strict
);
1424 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1425 /* The two types are structurally equivalent, but their
1426 canonical types were different. This is a failure of the
1427 canonical type propagation code.*/
1429 ("canonical types differ for identical types %T and %T",
1431 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1432 /* Two types are structurally different, but the canonical
1433 types are the same. This means we were over-eager in
1434 assigning canonical types. */
1436 ("same canonical type node for different types %T and %T",
1441 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1442 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1444 return structural_comptypes (t1
, t2
, strict
);
1446 else if (strict
== COMPARE_STRUCTURAL
)
1447 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1449 return structural_comptypes (t1
, t2
, strict
);
1452 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1453 top-level qualifiers. */
1456 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1458 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1461 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1464 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1467 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1469 int q1
= cp_type_quals (type1
);
1470 int q2
= cp_type_quals (type2
);
1472 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1473 return (q1
& q2
) == q2
;
1476 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1477 more cv-qualified that TYPE1, and 0 otherwise. */
1480 comp_cv_qualification (int q1
, int q2
)
1485 if ((q1
& q2
) == q2
)
1487 else if ((q1
& q2
) == q1
)
1494 comp_cv_qualification (const_tree type1
, const_tree type2
)
1496 int q1
= cp_type_quals (type1
);
1497 int q2
= cp_type_quals (type2
);
1498 return comp_cv_qualification (q1
, q2
);
1501 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1502 subset of the cv-qualification signature of TYPE2, and the types
1503 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1506 comp_cv_qual_signature (tree type1
, tree type2
)
1508 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1510 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1516 /* Subroutines of `comptypes'. */
1518 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1519 equivalent in the sense that functions with those parameter types
1520 can have equivalent types. The two lists must be equivalent,
1521 element by element. */
1524 compparms (const_tree parms1
, const_tree parms2
)
1528 /* An unspecified parmlist matches any specified parmlist
1529 whose argument types don't need default promotions. */
1531 for (t1
= parms1
, t2
= parms2
;
1533 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1535 /* If one parmlist is shorter than the other,
1536 they fail to match. */
1539 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1546 /* Process a sizeof or alignof expression where the operand is a
1550 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1555 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1556 if (type
== error_mark_node
)
1557 return error_mark_node
;
1559 type
= non_reference (type
);
1560 if (TREE_CODE (type
) == METHOD_TYPE
)
1563 pedwarn (input_location
, OPT_Wpointer_arith
,
1564 "invalid application of %qs to a member function",
1565 operator_name_info
[(int) op
].name
);
1567 return error_mark_node
;
1568 value
= size_one_node
;
1571 dependent_p
= dependent_type_p (type
);
1573 complete_type (type
);
1575 /* VLA types will have a non-constant size. In the body of an
1576 uninstantiated template, we don't need to try to compute the
1577 value, because the sizeof expression is not an integral
1578 constant expression in that case. And, if we do try to
1579 compute the value, we'll likely end up with SAVE_EXPRs, which
1580 the template substitution machinery does not expect to see. */
1581 || (processing_template_decl
1582 && COMPLETE_TYPE_P (type
)
1583 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1585 value
= build_min (op
, size_type_node
, type
);
1586 TREE_READONLY (value
) = 1;
1590 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1591 op
== SIZEOF_EXPR
, false,
1595 /* Return the size of the type, without producing any warnings for
1596 types whose size cannot be taken. This routine should be used only
1597 in some other routine that has already produced a diagnostic about
1598 using the size of such a type. */
1600 cxx_sizeof_nowarn (tree type
)
1602 if (TREE_CODE (type
) == FUNCTION_TYPE
1603 || VOID_TYPE_P (type
)
1604 || TREE_CODE (type
) == ERROR_MARK
)
1605 return size_one_node
;
1606 else if (!COMPLETE_TYPE_P (type
))
1607 return size_zero_node
;
1609 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1612 /* Process a sizeof expression where the operand is an expression. */
1615 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1617 if (e
== error_mark_node
)
1618 return error_mark_node
;
1620 if (processing_template_decl
)
1622 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1623 TREE_SIDE_EFFECTS (e
) = 0;
1624 TREE_READONLY (e
) = 1;
1629 /* To get the size of a static data member declared as an array of
1630 unknown bound, we need to instantiate it. */
1632 && VAR_HAD_UNKNOWN_BOUND (e
)
1633 && DECL_TEMPLATE_INSTANTIATION (e
))
1634 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1636 if (TREE_CODE (e
) == PARM_DECL
1637 && DECL_ARRAY_PARAMETER_P (e
)
1638 && (complain
& tf_warning
))
1640 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1641 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1642 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1645 e
= mark_type_use (e
);
1647 if (TREE_CODE (e
) == COMPONENT_REF
1648 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1649 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1651 if (complain
& tf_error
)
1652 error ("invalid application of %<sizeof%> to a bit-field");
1654 return error_mark_node
;
1657 else if (is_overloaded_fn (e
))
1659 if (complain
& tf_error
)
1660 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1663 return error_mark_node
;
1666 else if (type_unknown_p (e
))
1668 if (complain
& tf_error
)
1669 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1671 return error_mark_node
;
1677 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1680 /* Implement the __alignof keyword: Return the minimum required
1681 alignment of E, measured in bytes. For VAR_DECL's and
1682 FIELD_DECL's return DECL_ALIGN (which can be set from an
1683 "aligned" __attribute__ specification). */
1686 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1690 if (e
== error_mark_node
)
1691 return error_mark_node
;
1693 if (processing_template_decl
)
1695 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1696 TREE_SIDE_EFFECTS (e
) = 0;
1697 TREE_READONLY (e
) = 1;
1702 e
= mark_type_use (e
);
1705 t
= size_int (DECL_ALIGN_UNIT (e
));
1706 else if (TREE_CODE (e
) == COMPONENT_REF
1707 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1708 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1710 if (complain
& tf_error
)
1711 error ("invalid application of %<__alignof%> to a bit-field");
1713 return error_mark_node
;
1716 else if (TREE_CODE (e
) == COMPONENT_REF
1717 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1718 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1719 else if (is_overloaded_fn (e
))
1721 if (complain
& tf_error
)
1722 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1725 return error_mark_node
;
1726 if (TREE_CODE (e
) == FUNCTION_DECL
)
1727 t
= size_int (DECL_ALIGN_UNIT (e
));
1731 else if (type_unknown_p (e
))
1733 if (complain
& tf_error
)
1734 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1736 return error_mark_node
;
1740 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1741 complain
& tf_error
);
1743 return fold_convert (size_type_node
, t
);
1746 /* Process a sizeof or alignof expression E with code OP where the operand
1747 is an expression. */
1750 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1752 if (op
== SIZEOF_EXPR
)
1753 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1755 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1758 /* Build a representation of an expression 'alignas(E).' Return the
1759 folded integer value of E if it is an integral constant expression
1760 that resolves to a valid alignment. If E depends on a template
1761 parameter, return a syntactic representation tree of kind
1762 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1763 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1766 cxx_alignas_expr (tree e
)
1768 if (e
== NULL_TREE
|| e
== error_mark_node
1769 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1775 When the alignment-specifier is of the form
1776 alignas(type-id ), it shall have the same effect as
1777 alignas(alignof(type-id )). */
1779 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1781 /* If we reach this point, it means the alignas expression if of
1782 the form "alignas(assignment-expression)", so we should follow
1783 what is stated by [dcl.align]/2. */
1785 if (value_dependent_expression_p (e
))
1786 /* Leave value-dependent expression alone for now. */
1789 e
= instantiate_non_dependent_expr (e
);
1790 e
= mark_rvalue_use (e
);
1792 /* [dcl.align]/2 says:
1794 the assignment-expression shall be an integral constant
1797 return cxx_constant_value (e
);
1801 /* EXPR is being used in a context that is not a function call.
1806 The expression can be used only as the left-hand operand of a
1807 member function call.
1809 [expr.mptr.operator]
1811 If the result of .* or ->* is a function, then that result can be
1812 used only as the operand for the function call operator ().
1814 by issuing an error message if appropriate. Returns true iff EXPR
1815 violates these rules. */
1818 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1820 if (expr
== NULL_TREE
)
1822 /* Don't enforce this in MS mode. */
1823 if (flag_ms_extensions
)
1825 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1826 expr
= get_first_fn (expr
);
1827 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1829 if (complain
& tf_error
)
1833 error_at (loc
, "invalid use of non-static member function %qD",
1835 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1838 error_at (loc
, "invalid use of non-static member function of "
1839 "type %qT", TREE_TYPE (expr
));
1846 /* If EXP is a reference to a bitfield, and the type of EXP does not
1847 match the declared type of the bitfield, return the declared type
1848 of the bitfield. Otherwise, return NULL_TREE. */
1851 is_bitfield_expr_with_lowered_type (const_tree exp
)
1853 switch (TREE_CODE (exp
))
1856 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1857 ? TREE_OPERAND (exp
, 1)
1858 : TREE_OPERAND (exp
, 0)))
1860 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1863 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1867 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1873 field
= TREE_OPERAND (exp
, 1);
1874 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1876 if (same_type_ignoring_top_level_qualifiers_p
1877 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1879 return DECL_BIT_FIELD_TYPE (field
);
1883 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1884 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1885 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1893 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1894 bitfield with a lowered type, the type of EXP is returned, rather
1898 unlowered_expr_type (const_tree exp
)
1901 tree etype
= TREE_TYPE (exp
);
1903 type
= is_bitfield_expr_with_lowered_type (exp
);
1905 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1912 /* Perform the conversions in [expr] that apply when an lvalue appears
1913 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1914 function-to-pointer conversions. In addition, bitfield references are
1915 converted to their declared types. Note that this function does not perform
1916 the lvalue-to-rvalue conversion for class types. If you need that conversion
1917 for class types, then you probably need to use force_rvalue.
1919 Although the returned value is being used as an rvalue, this
1920 function does not wrap the returned expression in a
1921 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1922 that the return value is no longer an lvalue. */
1925 decay_conversion (tree exp
,
1926 tsubst_flags_t complain
,
1927 bool reject_builtin
/* = true */)
1930 enum tree_code code
;
1931 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1933 type
= TREE_TYPE (exp
);
1934 if (type
== error_mark_node
)
1935 return error_mark_node
;
1937 exp
= resolve_nondeduced_context (exp
, complain
);
1938 if (type_unknown_p (exp
))
1940 if (complain
& tf_error
)
1941 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1942 return error_mark_node
;
1945 code
= TREE_CODE (type
);
1947 if (error_operand_p (exp
))
1948 return error_mark_node
;
1950 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
1951 return nullptr_node
;
1953 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1954 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1955 if (code
== VOID_TYPE
)
1957 if (complain
& tf_error
)
1958 error_at (loc
, "void value not ignored as it ought to be");
1959 return error_mark_node
;
1961 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
1962 return error_mark_node
;
1963 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1965 exp
= mark_lvalue_use (exp
);
1966 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
1967 return error_mark_node
;
1968 return cp_build_addr_expr (exp
, complain
);
1970 if (code
== ARRAY_TYPE
)
1975 exp
= mark_lvalue_use (exp
);
1977 if (INDIRECT_REF_P (exp
))
1978 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1979 TREE_OPERAND (exp
, 0));
1981 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1983 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
1984 if (op1
== error_mark_node
)
1985 return error_mark_node
;
1986 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1987 TREE_OPERAND (exp
, 0), op1
);
1990 if (!obvalue_p (exp
)
1991 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1993 if (complain
& tf_error
)
1994 error_at (loc
, "invalid use of non-lvalue array");
1995 return error_mark_node
;
1998 /* Don't let an array compound literal decay to a pointer. It can
1999 still be used to initialize an array or bind to a reference. */
2000 if (TREE_CODE (exp
) == TARGET_EXPR
)
2002 if (complain
& tf_error
)
2003 error_at (loc
, "taking address of temporary array");
2004 return error_mark_node
;
2007 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2011 if (!cxx_mark_addressable (exp
))
2012 return error_mark_node
;
2013 adr
= build_nop (ptrtype
, build_address (exp
));
2016 /* This way is better for a COMPONENT_REF since it can
2017 simplify the offset for a component. */
2018 adr
= cp_build_addr_expr (exp
, complain
);
2019 return cp_convert (ptrtype
, adr
, complain
);
2022 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2023 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2025 /* If a bitfield is used in a context where integral promotion
2026 applies, then the caller is expected to have used
2027 default_conversion. That function promotes bitfields correctly
2028 before calling this function. At this point, if we have a
2029 bitfield referenced, we may assume that is not subject to
2030 promotion, and that, therefore, the type of the resulting rvalue
2031 is the declared type of the bitfield. */
2032 exp
= convert_bitfield_to_declared_type (exp
);
2034 /* We do not call rvalue() here because we do not want to wrap EXP
2035 in a NON_LVALUE_EXPR. */
2039 Non-class rvalues always have cv-unqualified types. */
2040 type
= TREE_TYPE (exp
);
2041 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2042 exp
= build_nop (cv_unqualified (type
), exp
);
2044 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2045 return error_mark_node
;
2050 /* Perform preparatory conversions, as part of the "usual arithmetic
2051 conversions". In particular, as per [expr]:
2053 Whenever an lvalue expression appears as an operand of an
2054 operator that expects the rvalue for that operand, the
2055 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2056 standard conversions are applied to convert the expression to an
2059 In addition, we perform integral promotions here, as those are
2060 applied to both operands to a binary operator before determining
2061 what additional conversions should apply. */
2064 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2066 /* Check for target-specific promotions. */
2067 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2069 exp
= cp_convert (promoted_type
, exp
, complain
);
2070 /* Perform the integral promotions first so that bitfield
2071 expressions (which may promote to "int", even if the bitfield is
2072 declared "unsigned") are promoted correctly. */
2073 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2074 exp
= cp_perform_integral_promotions (exp
, complain
);
2075 /* Perform the other conversions. */
2076 exp
= decay_conversion (exp
, complain
);
2084 default_conversion (tree exp
)
2086 return cp_default_conversion (exp
, tf_warning_or_error
);
2089 /* EXPR is an expression with an integral or enumeration type.
2090 Perform the integral promotions in [conv.prom], and return the
2094 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2099 expr
= mark_rvalue_use (expr
);
2103 If the bitfield has an enumerated type, it is treated as any
2104 other value of that type for promotion purposes. */
2105 type
= is_bitfield_expr_with_lowered_type (expr
);
2106 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2107 type
= TREE_TYPE (expr
);
2108 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2109 /* Scoped enums don't promote. */
2110 if (SCOPED_ENUM_P (type
))
2112 promoted_type
= type_promotes_to (type
);
2113 if (type
!= promoted_type
)
2114 expr
= cp_convert (promoted_type
, expr
, complain
);
2121 perform_integral_promotions (tree expr
)
2123 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2126 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2127 decay_conversion to one. */
2130 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2134 if (!TYPE_PTR_P (totype
))
2137 t
= TREE_TYPE (totype
);
2138 if (!same_type_p (t
, char_type_node
)
2139 && !same_type_p (t
, char16_type_node
)
2140 && !same_type_p (t
, char32_type_node
)
2141 && !same_type_p (t
, wchar_type_node
))
2144 if (TREE_CODE (exp
) == STRING_CST
)
2146 /* Make sure that we don't try to convert between char and wide chars. */
2147 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2152 /* Is this a string constant which has decayed to 'const char *'? */
2153 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2154 if (!same_type_p (TREE_TYPE (exp
), t
))
2157 if (TREE_CODE (exp
) != ADDR_EXPR
2158 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2163 if (cxx_dialect
>= cxx11
)
2164 pedwarn (input_location
,
2165 pedantic
? OPT_Wpedantic
: OPT_Wwrite_strings
,
2166 "ISO C++ forbids converting a string constant to %qT",
2169 warning (OPT_Wwrite_strings
,
2170 "deprecated conversion from string constant to %qT",
2177 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2178 can, for example, use as an lvalue. This code used to be in
2179 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2180 expressions, where we're dealing with aggregates. But now it's again only
2181 called from unary_complex_lvalue. The case (in particular) that led to
2182 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2186 rationalize_conditional_expr (enum tree_code code
, tree t
,
2187 tsubst_flags_t complain
)
2189 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2191 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2192 the first operand is always the one to be used if both operands
2193 are equal, so we know what conditional expression this used to be. */
2194 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2196 tree op0
= TREE_OPERAND (t
, 0);
2197 tree op1
= TREE_OPERAND (t
, 1);
2199 /* The following code is incorrect if either operand side-effects. */
2200 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2201 && !TREE_SIDE_EFFECTS (op1
));
2203 build_conditional_expr (loc
,
2204 build_x_binary_op (loc
,
2205 (TREE_CODE (t
) == MIN_EXPR
2206 ? LE_EXPR
: GE_EXPR
),
2207 op0
, TREE_CODE (op0
),
2208 op1
, TREE_CODE (op1
),
2211 cp_build_unary_op (code
, op0
, false, complain
),
2212 cp_build_unary_op (code
, op1
, false, complain
),
2217 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2218 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), false,
2220 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), false,
2225 /* Given the TYPE of an anonymous union field inside T, return the
2226 FIELD_DECL for the field. If not found return NULL_TREE. Because
2227 anonymous unions can nest, we must also search all anonymous unions
2228 that are directly reachable. */
2231 lookup_anon_field (tree t
, tree type
)
2235 t
= TYPE_MAIN_VARIANT (t
);
2237 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2239 if (TREE_STATIC (field
))
2241 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2244 /* If we find it directly, return the field. */
2245 if (DECL_NAME (field
) == NULL_TREE
2246 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2251 /* Otherwise, it could be nested, search harder. */
2252 if (DECL_NAME (field
) == NULL_TREE
2253 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2255 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2263 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2264 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2265 non-NULL, it indicates the path to the base used to name MEMBER.
2266 If PRESERVE_REFERENCE is true, the expression returned will have
2267 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2268 returned will have the type referred to by the reference.
2270 This function does not perform access control; that is either done
2271 earlier by the parser when the name of MEMBER is resolved to MEMBER
2272 itself, or later when overload resolution selects one of the
2273 functions indicated by MEMBER. */
2276 build_class_member_access_expr (cp_expr object
, tree member
,
2277 tree access_path
, bool preserve_reference
,
2278 tsubst_flags_t complain
)
2282 tree result
= NULL_TREE
;
2283 tree using_decl
= NULL_TREE
;
2285 if (error_operand_p (object
) || error_operand_p (member
))
2286 return error_mark_node
;
2288 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2292 The type of the first expression shall be "class object" (of a
2294 object_type
= TREE_TYPE (object
);
2295 if (!currently_open_class (object_type
)
2296 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2297 return error_mark_node
;
2298 if (!CLASS_TYPE_P (object_type
))
2300 if (complain
& tf_error
)
2302 if (POINTER_TYPE_P (object_type
)
2303 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2304 error ("request for member %qD in %qE, which is of pointer "
2305 "type %qT (maybe you meant to use %<->%> ?)",
2306 member
, object
.get_value (), object_type
);
2308 error ("request for member %qD in %qE, which is of non-class "
2309 "type %qT", member
, object
.get_value (), object_type
);
2311 return error_mark_node
;
2314 /* The standard does not seem to actually say that MEMBER must be a
2315 member of OBJECT_TYPE. However, that is clearly what is
2317 if (DECL_P (member
))
2319 member_scope
= DECL_CLASS_CONTEXT (member
);
2320 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2321 return error_mark_node
;
2322 if (TREE_DEPRECATED (member
))
2323 warn_deprecated_use (member
, NULL_TREE
);
2326 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2327 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2328 presently be the anonymous union. Go outwards until we find a
2329 type related to OBJECT_TYPE. */
2330 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2331 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2333 member_scope
= TYPE_CONTEXT (member_scope
);
2334 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2336 if (complain
& tf_error
)
2338 if (TREE_CODE (member
) == FIELD_DECL
)
2339 error ("invalid use of nonstatic data member %qE", member
);
2341 error ("%qD is not a member of %qT", member
, object_type
);
2343 return error_mark_node
;
2346 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2347 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2348 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2350 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2352 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2355 /* In [expr.ref], there is an explicit list of the valid choices for
2356 MEMBER. We check for each of those cases here. */
2359 /* A static data member. */
2361 mark_exp_read (object
);
2362 /* If OBJECT has side-effects, they are supposed to occur. */
2363 if (TREE_SIDE_EFFECTS (object
))
2364 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2366 else if (TREE_CODE (member
) == FIELD_DECL
)
2368 /* A non-static data member. */
2373 if (INDIRECT_REF_P (object
))
2375 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2377 null_object_p
= false;
2379 /* Convert OBJECT to the type of MEMBER. */
2380 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2381 TYPE_MAIN_VARIANT (member_scope
)))
2386 binfo
= lookup_base (access_path
? access_path
: object_type
,
2387 member_scope
, ba_unique
, &kind
, complain
);
2388 if (binfo
== error_mark_node
)
2389 return error_mark_node
;
2391 /* It is invalid to try to get to a virtual base of a
2392 NULL object. The most common cause is invalid use of
2394 if (null_object_p
&& kind
== bk_via_virtual
)
2396 if (complain
& tf_error
)
2398 error ("invalid access to non-static data member %qD in "
2399 "virtual base of NULL object", member
);
2401 return error_mark_node
;
2404 /* Convert to the base. */
2405 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2406 /*nonnull=*/1, complain
);
2407 /* If we found the base successfully then we should be able
2408 to convert to it successfully. */
2409 gcc_assert (object
!= error_mark_node
);
2412 /* If MEMBER is from an anonymous aggregate, we have converted
2413 OBJECT so that it refers to the class containing the
2414 anonymous union. Generate a reference to the anonymous union
2415 itself, and recur to find MEMBER. */
2416 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2417 /* When this code is called from build_field_call, the
2418 object already has the type of the anonymous union.
2419 That is because the COMPONENT_REF was already
2420 constructed, and was then disassembled before calling
2421 build_field_call. After the function-call code is
2422 cleaned up, this waste can be eliminated. */
2423 && (!same_type_ignoring_top_level_qualifiers_p
2424 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2426 tree anonymous_union
;
2428 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2429 DECL_CONTEXT (member
));
2430 object
= build_class_member_access_expr (object
,
2432 /*access_path=*/NULL_TREE
,
2437 /* Compute the type of the field, as described in [expr.ref]. */
2438 type_quals
= TYPE_UNQUALIFIED
;
2439 member_type
= TREE_TYPE (member
);
2440 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2442 type_quals
= (cp_type_quals (member_type
)
2443 | cp_type_quals (object_type
));
2445 /* A field is const (volatile) if the enclosing object, or the
2446 field itself, is const (volatile). But, a mutable field is
2447 not const, even within a const object. */
2448 if (DECL_MUTABLE_P (member
))
2449 type_quals
&= ~TYPE_QUAL_CONST
;
2450 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2453 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2454 object
, member
, NULL_TREE
);
2456 /* Mark the expression const or volatile, as appropriate. Even
2457 though we've dealt with the type above, we still have to mark the
2458 expression itself. */
2459 if (type_quals
& TYPE_QUAL_CONST
)
2460 TREE_READONLY (result
) = 1;
2461 if (type_quals
& TYPE_QUAL_VOLATILE
)
2462 TREE_THIS_VOLATILE (result
) = 1;
2464 else if (BASELINK_P (member
))
2466 /* The member is a (possibly overloaded) member function. */
2470 /* If the MEMBER is exactly one static member function, then we
2471 know the type of the expression. Otherwise, we must wait
2472 until overload resolution has been performed. */
2473 functions
= BASELINK_FUNCTIONS (member
);
2474 if (TREE_CODE (functions
) == FUNCTION_DECL
2475 && DECL_STATIC_FUNCTION_P (functions
))
2476 type
= TREE_TYPE (functions
);
2478 type
= unknown_type_node
;
2479 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2480 base. That will happen when the function is called. */
2481 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2483 else if (TREE_CODE (member
) == CONST_DECL
)
2485 /* The member is an enumerator. */
2487 /* If OBJECT has side-effects, they are supposed to occur. */
2488 if (TREE_SIDE_EFFECTS (object
))
2489 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2492 else if ((using_decl
= strip_using_decl (member
)) != member
)
2493 result
= build_class_member_access_expr (object
,
2495 access_path
, preserve_reference
,
2499 if (complain
& tf_error
)
2500 error ("invalid use of %qD", member
);
2501 return error_mark_node
;
2504 if (!preserve_reference
)
2507 If E2 is declared to have type "reference to T", then ... the
2508 type of E1.E2 is T. */
2509 result
= convert_from_reference (result
);
2514 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2515 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2518 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2519 tsubst_flags_t complain
)
2521 tree object_type
= TREE_TYPE (object
);
2522 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2525 /* We've already complained about this destructor. */
2526 if (dtor_type
== error_mark_node
)
2527 return error_mark_node
;
2529 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2531 if (complain
& tf_error
)
2532 error ("qualified type %qT does not match destructor name ~%qT",
2534 return error_mark_node
;
2536 if (is_auto (dtor_type
))
2537 dtor_type
= object_type
;
2538 else if (identifier_p (dtor_type
))
2540 /* In a template, names we can't find a match for are still accepted
2541 destructor names, and we check them here. */
2542 if (check_dtor_name (object_type
, dtor_type
))
2543 dtor_type
= object_type
;
2546 if (complain
& tf_error
)
2547 error ("object type %qT does not match destructor name ~%qT",
2548 object_type
, dtor_type
);
2549 return error_mark_node
;
2553 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2555 if (complain
& tf_error
)
2556 error ("the type being destroyed is %qT, but the destructor "
2557 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2558 return error_mark_node
;
2560 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2561 /*protect=*/1, /*want_type=*/false,
2562 tf_warning_or_error
);
2565 if (complain
& tf_error
)
2566 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2567 return error_mark_node
;
2569 expr
= (adjust_result_of_qualified_name_lookup
2570 (expr
, dtor_type
, object_type
));
2571 if (scope
== NULL_TREE
)
2572 /* We need to call adjust_result_of_qualified_name_lookup in case the
2573 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2574 that we still get virtual function binding. */
2575 BASELINK_QUALIFIED_P (expr
) = false;
2579 /* An expression of the form "A::template B" has been resolved to
2580 DECL. Issue a diagnostic if B is not a template or template
2584 check_template_keyword (tree decl
)
2586 /* The standard says:
2590 If a name prefixed by the keyword template is not a member
2591 template, the program is ill-formed.
2593 DR 228 removed the restriction that the template be a member
2596 DR 96, if accepted would add the further restriction that explicit
2597 template arguments must be provided if the template keyword is
2598 used, but, as of 2005-10-16, that DR is still in "drafting". If
2599 this DR is accepted, then the semantic checks here can be
2600 simplified, as the entity named must in fact be a template
2601 specialization, rather than, as at present, a set of overloaded
2602 functions containing at least one template function. */
2603 if (TREE_CODE (decl
) != TEMPLATE_DECL
2604 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2608 if (DECL_USE_TEMPLATE (decl
)
2609 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2612 permerror (input_location
, "%qD is not a template", decl
);
2614 else if (!is_overloaded_fn (decl
))
2615 permerror (input_location
, "%qD is not a template", decl
);
2620 if (BASELINK_P (fns
))
2621 fns
= BASELINK_FUNCTIONS (fns
);
2624 tree fn
= OVL_CURRENT (fns
);
2625 if (TREE_CODE (fn
) == TEMPLATE_DECL
2626 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2628 if (TREE_CODE (fn
) == FUNCTION_DECL
2629 && DECL_USE_TEMPLATE (fn
)
2630 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2632 fns
= OVL_NEXT (fns
);
2635 permerror (input_location
, "%qD is not a template", decl
);
2640 /* This function is called by the parser to process a class member
2641 access expression of the form OBJECT.NAME. NAME is a node used by
2642 the parser to represent a name; it is not yet a DECL. It may,
2643 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2644 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2645 there is no reason to do the lookup twice, so the parser keeps the
2646 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2647 be a template via the use of the "A::template B" syntax. */
2650 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2651 tsubst_flags_t complain
)
2656 tree access_path
= NULL_TREE
;
2657 tree orig_object
= object
;
2658 tree orig_name
= name
;
2660 if (object
== error_mark_node
|| name
== error_mark_node
)
2661 return error_mark_node
;
2663 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2664 if (!objc_is_public (object
, name
))
2665 return error_mark_node
;
2667 object_type
= TREE_TYPE (object
);
2669 if (processing_template_decl
)
2671 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2672 type_dependent_object_expression_p (object
)
2673 /* If NAME is "f<args>", where either 'f' or 'args' is
2674 dependent, then the expression is dependent. */
2675 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2676 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2677 TREE_OPERAND (name
, 1)))
2678 /* If NAME is "T::X" where "T" is dependent, then the
2679 expression is dependent. */
2680 || (TREE_CODE (name
) == SCOPE_REF
2681 && TYPE_P (TREE_OPERAND (name
, 0))
2682 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2685 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2686 orig_object
, orig_name
, NULL_TREE
);
2688 object
= build_non_dependent_expr (object
);
2690 else if (c_dialect_objc ()
2691 && identifier_p (name
)
2692 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2697 The type of the first expression shall be "class object" (of a
2699 if (!currently_open_class (object_type
)
2700 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2701 return error_mark_node
;
2702 if (!CLASS_TYPE_P (object_type
))
2704 if (complain
& tf_error
)
2706 if (POINTER_TYPE_P (object_type
)
2707 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2708 error ("request for member %qD in %qE, which is of pointer "
2709 "type %qT (maybe you meant to use %<->%> ?)",
2710 name
, object
.get_value (), object_type
);
2712 error ("request for member %qD in %qE, which is of non-class "
2713 "type %qT", name
, object
.get_value (), object_type
);
2715 return error_mark_node
;
2718 if (BASELINK_P (name
))
2719 /* A member function that has already been looked up. */
2723 bool is_template_id
= false;
2724 tree template_args
= NULL_TREE
;
2727 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2729 is_template_id
= true;
2730 template_args
= TREE_OPERAND (name
, 1);
2731 name
= TREE_OPERAND (name
, 0);
2733 if (TREE_CODE (name
) == OVERLOAD
)
2734 name
= DECL_NAME (get_first_fn (name
));
2735 else if (DECL_P (name
))
2736 name
= DECL_NAME (name
);
2739 if (TREE_CODE (name
) == SCOPE_REF
)
2741 /* A qualified name. The qualifying class or namespace `S'
2742 has already been looked up; it is either a TYPE or a
2744 scope
= TREE_OPERAND (name
, 0);
2745 name
= TREE_OPERAND (name
, 1);
2747 /* If SCOPE is a namespace, then the qualified name does not
2748 name a member of OBJECT_TYPE. */
2749 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2751 if (complain
& tf_error
)
2752 error ("%<%D::%D%> is not a member of %qT",
2753 scope
, name
, object_type
);
2754 return error_mark_node
;
2757 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2759 /* Looking up a member enumerator (c++/56793). */
2760 if (!TYPE_CLASS_SCOPE_P (scope
)
2761 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2763 if (complain
& tf_error
)
2764 error ("%<%D::%D%> is not a member of %qT",
2765 scope
, name
, object_type
);
2766 return error_mark_node
;
2768 tree val
= lookup_enumerator (scope
, name
);
2771 if (complain
& tf_error
)
2772 error ("%qD is not a member of %qD",
2774 return error_mark_node
;
2777 if (TREE_SIDE_EFFECTS (object
))
2778 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2782 gcc_assert (CLASS_TYPE_P (scope
));
2783 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2785 if (constructor_name_p (name
, scope
))
2787 if (complain
& tf_error
)
2788 error ("cannot call constructor %<%T::%D%> directly",
2790 return error_mark_node
;
2793 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2794 access_path
= lookup_base (object_type
, scope
, ba_check
,
2796 if (access_path
== error_mark_node
)
2797 return error_mark_node
;
2800 if (any_dependent_bases_p (object_type
))
2802 if (complain
& tf_error
)
2803 error ("%qT is not a base of %qT", scope
, object_type
);
2804 return error_mark_node
;
2810 access_path
= object_type
;
2813 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2815 if (dependent_type_p (object_type
))
2816 /* The destructor isn't declared yet. */
2818 member
= lookup_destructor (object
, scope
, name
, complain
);
2822 /* Look up the member. */
2823 member
= lookup_member (access_path
, name
, /*protect=*/1,
2824 /*want_type=*/false, complain
);
2825 if (member
== NULL_TREE
)
2827 if (dependent_type_p (object_type
))
2828 /* Try again at instantiation time. */
2830 if (complain
& tf_error
)
2832 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2833 /*want_type=*/false);
2836 location_t bogus_component_loc
= input_location
;
2837 gcc_rich_location
rich_loc (bogus_component_loc
);
2838 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
2842 "%q#T has no member named %qE; did you mean %qE?",
2843 TREE_CODE (access_path
) == TREE_BINFO
2844 ? TREE_TYPE (access_path
) : object_type
, name
,
2848 error ("%q#T has no member named %qE",
2849 TREE_CODE (access_path
) == TREE_BINFO
2850 ? TREE_TYPE (access_path
) : object_type
, name
);
2852 return error_mark_node
;
2854 if (member
== error_mark_node
)
2855 return error_mark_node
;
2857 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
2858 /* Dependent type attributes on the decl mean that the TREE_TYPE is
2859 wrong, so don't use it. */
2861 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2867 tree templ
= member
;
2869 if (BASELINK_P (templ
))
2870 templ
= lookup_template_function (templ
, template_args
);
2873 if (complain
& tf_error
)
2874 error ("%qD is not a member template function", name
);
2875 return error_mark_node
;
2880 if (TREE_DEPRECATED (member
))
2881 warn_deprecated_use (member
, NULL_TREE
);
2884 check_template_keyword (member
);
2886 expr
= build_class_member_access_expr (object
, member
, access_path
,
2887 /*preserve_reference=*/false,
2889 if (processing_template_decl
&& expr
!= error_mark_node
)
2891 if (BASELINK_P (member
))
2893 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2894 BASELINK_QUALIFIED_P (member
) = 1;
2897 return build_min_non_dep (COMPONENT_REF
, expr
,
2898 orig_object
, orig_name
,
2905 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2909 build_simple_component_ref (tree object
, tree member
)
2911 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
2912 cp_type_quals (TREE_TYPE (object
)));
2913 return build3_loc (input_location
,
2914 COMPONENT_REF
, type
,
2915 object
, member
, NULL_TREE
);
2918 /* Return an expression for the MEMBER_NAME field in the internal
2919 representation of PTRMEM, a pointer-to-member function. (Each
2920 pointer-to-member function type gets its own RECORD_TYPE so it is
2921 more convenient to access the fields by name than by FIELD_DECL.)
2922 This routine converts the NAME to a FIELD_DECL and then creates the
2923 node for the complete expression. */
2926 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2931 /* This code is a stripped down version of
2932 build_class_member_access_expr. It does not work to use that
2933 routine directly because it expects the object to be of class
2935 ptrmem_type
= TREE_TYPE (ptrmem
);
2936 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2937 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
2938 member
= DECL_CHAIN (member
))
2939 if (DECL_NAME (member
) == member_name
)
2941 return build_simple_component_ref (ptrmem
, member
);
2944 /* Given an expression PTR for a pointer, return an expression
2945 for the value pointed to.
2946 ERRORSTRING is the name of the operator to appear in error messages.
2948 This function may need to overload OPERATOR_FNNAME.
2949 Must also handle REFERENCE_TYPEs for C++. */
2952 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
2953 tsubst_flags_t complain
)
2955 tree orig_expr
= expr
;
2957 tree overload
= NULL_TREE
;
2959 if (processing_template_decl
)
2961 /* Retain the type if we know the operand is a pointer. */
2962 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2963 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2964 if (type_dependent_expression_p (expr
))
2965 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
2966 expr
= build_non_dependent_expr (expr
);
2969 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
2970 NULL_TREE
, NULL_TREE
, &overload
, complain
);
2972 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2974 if (processing_template_decl
&& rval
!= error_mark_node
)
2976 if (overload
!= NULL_TREE
)
2977 return (build_min_non_dep_op_overload
2978 (INDIRECT_REF
, rval
, overload
, orig_expr
));
2980 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2986 /* Helper function called from c-common. */
2988 build_indirect_ref (location_t
/*loc*/,
2989 tree ptr
, ref_operator errorstring
)
2991 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2995 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2996 tsubst_flags_t complain
)
3000 if (ptr
== current_class_ptr
3001 || (TREE_CODE (ptr
) == NOP_EXPR
3002 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3003 && (same_type_ignoring_top_level_qualifiers_p
3004 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3005 return current_class_ref
;
3007 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
3008 ? ptr
: decay_conversion (ptr
, complain
));
3009 if (pointer
== error_mark_node
)
3010 return error_mark_node
;
3012 type
= TREE_TYPE (pointer
);
3014 if (POINTER_TYPE_P (type
))
3018 If the type of the expression is "pointer to T," the type
3019 of the result is "T." */
3020 tree t
= TREE_TYPE (type
);
3022 if ((CONVERT_EXPR_P (ptr
)
3023 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3024 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3026 /* If a warning is issued, mark it to avoid duplicates from
3027 the backend. This only needs to be done at
3028 warn_strict_aliasing > 2. */
3029 if (warn_strict_aliasing
> 2)
3030 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
3031 type
, TREE_OPERAND (ptr
, 0)))
3032 TREE_NO_WARNING (ptr
) = 1;
3035 if (VOID_TYPE_P (t
))
3037 /* A pointer to incomplete type (other than cv void) can be
3038 dereferenced [expr.unary.op]/1 */
3039 if (complain
& tf_error
)
3040 error ("%qT is not a pointer-to-object type", type
);
3041 return error_mark_node
;
3043 else if (TREE_CODE (pointer
) == ADDR_EXPR
3044 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3045 /* The POINTER was something like `&x'. We simplify `*&x' to
3047 return TREE_OPERAND (pointer
, 0);
3050 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3052 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3053 so that we get the proper error message if the result is used
3054 to assign to. Also, &* is supposed to be a no-op. */
3055 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3056 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3057 TREE_SIDE_EFFECTS (ref
)
3058 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3062 else if (!(complain
& tf_error
))
3063 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3065 /* `pointer' won't be an error_mark_node if we were given a
3066 pointer to member, so it's cool to check for this here. */
3067 else if (TYPE_PTRMEM_P (type
))
3068 switch (errorstring
)
3070 case RO_ARRAY_INDEXING
:
3071 error ("invalid use of array indexing on pointer to member");
3074 error ("invalid use of unary %<*%> on pointer to member");
3076 case RO_IMPLICIT_CONVERSION
:
3077 error ("invalid use of implicit conversion on pointer to member");
3080 error ("left hand operand of %<->*%> must be a pointer to class, "
3081 "but is a pointer to member of type %qT", type
);
3086 else if (pointer
!= error_mark_node
)
3087 invalid_indirection_error (input_location
, type
, errorstring
);
3089 return error_mark_node
;
3092 /* This handles expressions of the form "a[i]", which denotes
3095 This is logically equivalent in C to *(a+i), but we may do it differently.
3096 If A is a variable or a member, we generate a primitive ARRAY_REF.
3097 This avoids forcing the array out of registers, and can work on
3098 arrays that are not lvalues (for example, members of structures returned
3101 If INDEX is of some user-defined type, it must be converted to
3102 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3103 will inherit the type of the array, which will be some pointer type.
3105 LOC is the location to use in building the array reference. */
3108 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3109 tsubst_flags_t complain
)
3115 if (complain
& tf_error
)
3116 error_at (loc
, "subscript missing in array reference");
3117 return error_mark_node
;
3120 /* If an array's index is an array notation, then its rank cannot be
3121 greater than one. */
3122 if (flag_cilkplus
&& contains_array_notation_expr (idx
))
3126 /* If find_rank returns false, then it should have reported an error,
3127 thus it is unnecessary for repetition. */
3128 if (!find_rank (loc
, idx
, idx
, true, &rank
))
3129 return error_mark_node
;
3132 error_at (loc
, "rank of the array%'s index is greater than 1");
3133 return error_mark_node
;
3136 if (TREE_TYPE (array
) == error_mark_node
3137 || TREE_TYPE (idx
) == error_mark_node
)
3138 return error_mark_node
;
3140 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3142 switch (TREE_CODE (array
))
3146 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3148 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3149 TREE_OPERAND (array
, 0), value
);
3150 SET_EXPR_LOCATION (ret
, loc
);
3155 ret
= build_conditional_expr
3156 (loc
, TREE_OPERAND (array
, 0),
3157 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3159 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3162 protected_set_expr_location (ret
, loc
);
3169 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3171 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3175 warn_array_subscript_with_type_char (loc
, idx
);
3177 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3179 if (complain
& tf_error
)
3180 error_at (loc
, "array subscript is not an integer");
3181 return error_mark_node
;
3184 /* Apply integral promotions *after* noticing character types.
3185 (It is unclear why we do these promotions -- the standard
3186 does not say that we should. In fact, the natural thing would
3187 seem to be to convert IDX to ptrdiff_t; we're performing
3188 pointer arithmetic.) */
3189 idx
= cp_perform_integral_promotions (idx
, complain
);
3191 /* An array that is indexed by a non-constant
3192 cannot be stored in a register; we must be able to do
3193 address arithmetic on its address.
3194 Likewise an array of elements of variable size. */
3195 if (TREE_CODE (idx
) != INTEGER_CST
3196 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3197 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3200 if (!cxx_mark_addressable (array
))
3201 return error_mark_node
;
3204 /* An array that is indexed by a constant value which is not within
3205 the array bounds cannot be stored in a register either; because we
3206 would get a crash in store_bit_field/extract_bit_field when trying
3207 to access a non-existent part of the register. */
3208 if (TREE_CODE (idx
) == INTEGER_CST
3209 && TYPE_DOMAIN (TREE_TYPE (array
))
3210 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3212 if (!cxx_mark_addressable (array
))
3213 return error_mark_node
;
3216 /* Note in C++ it is valid to subscript a `register' array, since
3217 it is valid to take the address of something with that
3218 storage specification. */
3222 while (TREE_CODE (foo
) == COMPONENT_REF
)
3223 foo
= TREE_OPERAND (foo
, 0);
3224 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3225 && (complain
& tf_warning
))
3226 warning_at (loc
, OPT_Wextra
,
3227 "subscripting array declared %<register%>");
3230 type
= TREE_TYPE (TREE_TYPE (array
));
3231 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3232 /* Array ref is const/volatile if the array elements are
3233 or if the array is.. */
3234 TREE_READONLY (rval
)
3235 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3236 TREE_SIDE_EFFECTS (rval
)
3237 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3238 TREE_THIS_VOLATILE (rval
)
3239 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3240 ret
= require_complete_type_sfinae (rval
, complain
);
3241 protected_set_expr_location (ret
, loc
);
3243 ret
= non_lvalue_loc (loc
, ret
);
3248 tree ar
= cp_default_conversion (array
, complain
);
3249 tree ind
= cp_default_conversion (idx
, complain
);
3251 /* Put the integer in IND to simplify error checking. */
3252 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3253 std::swap (ar
, ind
);
3255 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3256 return error_mark_node
;
3258 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3260 if (complain
& tf_error
)
3261 error_at (loc
, "subscripted value is neither array nor pointer");
3262 return error_mark_node
;
3264 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3266 if (complain
& tf_error
)
3267 error_at (loc
, "array subscript is not an integer");
3268 return error_mark_node
;
3271 warn_array_subscript_with_type_char (loc
, idx
);
3273 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3278 protected_set_expr_location (ret
, loc
);
3280 ret
= non_lvalue_loc (loc
, ret
);
3285 /* Entry point for Obj-C++. */
3288 build_array_ref (location_t loc
, tree array
, tree idx
)
3290 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3293 /* Resolve a pointer to member function. INSTANCE is the object
3294 instance to use, if the member points to a virtual member.
3296 This used to avoid checking for virtual functions if basetype
3297 has no virtual functions, according to an earlier ANSI draft.
3298 With the final ISO C++ rules, such an optimization is
3299 incorrect: A pointer to a derived member can be static_cast
3300 to pointer-to-base-member, as long as the dynamic object
3301 later has the right member. So now we only do this optimization
3302 when we know the dynamic type of the object. */
3305 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3306 tsubst_flags_t complain
)
3308 if (TREE_CODE (function
) == OFFSET_REF
)
3309 function
= TREE_OPERAND (function
, 1);
3311 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3313 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3315 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3316 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3318 tree instance_ptr
= *instance_ptrptr
;
3319 tree instance_save_expr
= 0;
3320 if (instance_ptr
== error_mark_node
)
3322 if (TREE_CODE (function
) == PTRMEM_CST
)
3324 /* Extracting the function address from a pmf is only
3325 allowed with -Wno-pmf-conversions. It only works for
3327 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3328 e1
= convert (fntype
, e1
);
3333 if (complain
& tf_error
)
3334 error ("object missing in use of %qE", function
);
3335 return error_mark_node
;
3339 /* True if we know that the dynamic type of the object doesn't have
3340 virtual functions, so we can assume the PFN field is a pointer. */
3341 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3342 && !TYPE_POLYMORPHIC_P (basetype
)
3343 && resolves_to_fixed_type_p (instance_ptr
, 0));
3345 /* If we don't really have an object (i.e. in an ill-formed
3346 conversion from PMF to pointer), we can't resolve virtual
3347 functions anyway. */
3348 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3351 if (TREE_SIDE_EFFECTS (instance_ptr
))
3352 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3354 if (TREE_SIDE_EFFECTS (function
))
3355 function
= save_expr (function
);
3357 /* Start by extracting all the information from the PMF itself. */
3358 e3
= pfn_from_ptrmemfunc (function
);
3359 delta
= delta_from_ptrmemfunc (function
);
3360 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3361 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3363 int flag_sanitize_save
;
3364 case ptrmemfunc_vbit_in_pfn
:
3365 e1
= cp_build_binary_op (input_location
,
3366 BIT_AND_EXPR
, idx
, integer_one_node
,
3368 idx
= cp_build_binary_op (input_location
,
3369 MINUS_EXPR
, idx
, integer_one_node
,
3371 if (idx
== error_mark_node
)
3372 return error_mark_node
;
3375 case ptrmemfunc_vbit_in_delta
:
3376 e1
= cp_build_binary_op (input_location
,
3377 BIT_AND_EXPR
, delta
, integer_one_node
,
3379 /* Don't instrument the RSHIFT_EXPR we're about to create because
3380 we're going to use DELTA number of times, and that wouldn't play
3381 well with SAVE_EXPRs therein. */
3382 flag_sanitize_save
= flag_sanitize
;
3384 delta
= cp_build_binary_op (input_location
,
3385 RSHIFT_EXPR
, delta
, integer_one_node
,
3387 flag_sanitize
= flag_sanitize_save
;
3388 if (delta
== error_mark_node
)
3389 return error_mark_node
;
3396 if (e1
== error_mark_node
)
3397 return error_mark_node
;
3399 /* Convert down to the right base before using the instance. A
3400 special case is that in a pointer to member of class C, C may
3401 be incomplete. In that case, the function will of course be
3402 a member of C, and no conversion is required. In fact,
3403 lookup_base will fail in that case, because incomplete
3404 classes do not have BINFOs. */
3405 if (!same_type_ignoring_top_level_qualifiers_p
3406 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3408 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3409 basetype
, ba_check
, NULL
, complain
);
3410 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3412 if (instance_ptr
== error_mark_node
)
3413 return error_mark_node
;
3415 /* ...and then the delta in the PMF. */
3416 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3418 /* Hand back the adjusted 'this' argument to our caller. */
3419 *instance_ptrptr
= instance_ptr
;
3422 /* Now just return the pointer. */
3425 /* Next extract the vtable pointer from the object. */
3426 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3428 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, complain
);
3429 if (vtbl
== error_mark_node
)
3430 return error_mark_node
;
3432 /* Finally, extract the function pointer from the vtable. */
3433 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3434 e2
= cp_build_indirect_ref (e2
, RO_NULL
, complain
);
3435 if (e2
== error_mark_node
)
3436 return error_mark_node
;
3437 TREE_CONSTANT (e2
) = 1;
3439 /* When using function descriptors, the address of the
3440 vtable entry is treated as a function pointer. */
3441 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3442 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3443 cp_build_addr_expr (e2
, complain
));
3445 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3446 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3447 if (e1
== error_mark_node
)
3448 return error_mark_node
;
3450 /* Make sure this doesn't get evaluated first inside one of the
3451 branches of the COND_EXPR. */
3452 if (instance_save_expr
)
3453 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3454 instance_save_expr
, e1
);
3461 /* Used by the C-common bits. */
3463 build_function_call (location_t
/*loc*/,
3464 tree function
, tree params
)
3466 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3469 /* Used by the C-common bits. */
3471 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3472 tree function
, vec
<tree
, va_gc
> *params
,
3473 vec
<tree
, va_gc
> * /*origtypes*/)
3475 vec
<tree
, va_gc
> *orig_params
= params
;
3476 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3477 tf_warning_or_error
);
3479 /* cp_build_function_call_vec can reallocate PARAMS by adding
3480 default arguments. That should never happen here. Verify
3482 gcc_assert (params
== orig_params
);
3487 /* Build a function call using a tree list of arguments. */
3490 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3492 vec
<tree
, va_gc
> *vec
;
3495 vec
= make_tree_vector ();
3496 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3497 vec_safe_push (vec
, TREE_VALUE (params
));
3498 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3499 release_tree_vector (vec
);
3503 /* Build a function call using varargs. */
3506 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3508 vec
<tree
, va_gc
> *vec
;
3512 vec
= make_tree_vector ();
3513 va_start (args
, complain
);
3514 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3515 vec_safe_push (vec
, t
);
3517 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3518 release_tree_vector (vec
);
3522 /* Build a function call using a vector of arguments. PARAMS may be
3523 NULL if there are no parameters. This changes the contents of
3527 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3528 tsubst_flags_t complain
)
3530 tree fntype
, fndecl
;
3532 tree original
= function
;
3536 vec
<tree
, va_gc
> *allocated
= NULL
;
3539 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3540 expressions, like those used for ObjC messenger dispatches. */
3541 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3542 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3544 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3545 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3546 if (TREE_CODE (function
) == NOP_EXPR
3547 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3548 function
= TREE_OPERAND (function
, 0);
3550 if (TREE_CODE (function
) == FUNCTION_DECL
)
3552 /* If the function is a non-template member function
3553 or a non-template friend, then we need to check the
3556 Note that if overload resolution failed with a single
3557 candidate this function will be used to explicitly diagnose
3558 the failure for the single call expression. The check is
3559 technically redundant since we also would have failed in
3560 add_function_candidate. */
3562 && (complain
& tf_error
)
3563 && !constraints_satisfied_p (function
))
3565 error ("cannot call function %qD", function
);
3566 location_t loc
= DECL_SOURCE_LOCATION (function
);
3567 diagnose_constraints (loc
, function
, NULL_TREE
);
3568 return error_mark_node
;
3571 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3572 return error_mark_node
;
3575 /* Convert anything with function type to a pointer-to-function. */
3576 if (DECL_MAIN_P (function
))
3578 if (complain
& tf_error
)
3579 pedwarn (input_location
, OPT_Wpedantic
,
3580 "ISO C++ forbids calling %<::main%> from within program");
3582 return error_mark_node
;
3584 function
= build_addr_func (function
, complain
);
3590 function
= build_addr_func (function
, complain
);
3593 if (function
== error_mark_node
)
3594 return error_mark_node
;
3596 fntype
= TREE_TYPE (function
);
3598 if (TYPE_PTRMEMFUNC_P (fntype
))
3600 if (complain
& tf_error
)
3601 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3602 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3603 original
, original
);
3604 return error_mark_node
;
3607 is_method
= (TYPE_PTR_P (fntype
)
3608 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3610 if (!(TYPE_PTRFN_P (fntype
)
3612 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3614 if (complain
& tf_error
)
3616 if (!flag_diagnostics_show_caret
)
3617 error_at (input_location
,
3618 "%qE cannot be used as a function", original
);
3619 else if (DECL_P (original
))
3620 error_at (input_location
,
3621 "%qD cannot be used as a function", original
);
3623 error_at (input_location
,
3624 "expression cannot be used as a function");
3627 return error_mark_node
;
3630 /* fntype now gets the type of function pointed to. */
3631 fntype
= TREE_TYPE (fntype
);
3632 parm_types
= TYPE_ARG_TYPES (fntype
);
3636 allocated
= make_tree_vector ();
3637 params
= &allocated
;
3640 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3643 return error_mark_node
;
3645 argarray
= (*params
)->address ();
3647 /* Check for errors in format strings and inappropriately
3649 check_function_arguments (input_location
, fntype
, nargs
, argarray
);
3651 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3653 if (allocated
!= NULL
)
3654 release_tree_vector (allocated
);
3659 /* Subroutine of convert_arguments.
3660 Print an error message about a wrong number of arguments. */
3663 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3667 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3669 if (DECL_NAME (fndecl
) == NULL_TREE
3670 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3673 ? G_("too many arguments to constructor %q#D")
3674 : G_("too few arguments to constructor %q#D"),
3679 ? G_("too many arguments to member function %q#D")
3680 : G_("too few arguments to member function %q#D"),
3686 ? G_("too many arguments to function %q#D")
3687 : G_("too few arguments to function %q#D"),
3689 if (!DECL_IS_BUILTIN (fndecl
))
3690 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3694 if (c_dialect_objc () && objc_message_selector ())
3697 ? G_("too many arguments to method %q#D")
3698 : G_("too few arguments to method %q#D"),
3699 objc_message_selector ());
3701 error_at (loc
, too_many_p
? G_("too many arguments to function")
3702 : G_("too few arguments to function"));
3706 /* Convert the actual parameter expressions in the list VALUES to the
3707 types in the list TYPELIST. The converted expressions are stored
3708 back in the VALUES vector.
3709 If parmdecls is exhausted, or when an element has NULL as its type,
3710 perform the default conversions.
3712 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3714 This is also where warnings about wrong number of args are generated.
3716 Returns the actual number of arguments processed (which might be less
3717 than the length of the vector), or -1 on error.
3719 In C++, unspecified trailing parameters can be filled in with their
3720 default arguments, if such were specified. Do so here. */
3723 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3724 int flags
, tsubst_flags_t complain
)
3729 /* Argument passing is always copy-initialization. */
3730 flags
|= LOOKUP_ONLYCONVERTING
;
3732 for (i
= 0, typetail
= typelist
;
3733 i
< vec_safe_length (*values
);
3736 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3737 tree val
= (**values
)[i
];
3739 if (val
== error_mark_node
|| type
== error_mark_node
)
3742 if (type
== void_type_node
)
3744 if (complain
& tf_error
)
3746 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3753 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3754 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3755 if (TREE_CODE (val
) == NOP_EXPR
3756 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3757 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3758 val
= TREE_OPERAND (val
, 0);
3760 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3762 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3763 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3764 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3765 val
= decay_conversion (val
, complain
);
3768 if (val
== error_mark_node
)
3773 /* Formal parm type is specified by a function prototype. */
3776 if (!COMPLETE_TYPE_P (complete_type (type
)))
3778 if (complain
& tf_error
)
3781 error ("parameter %P of %qD has incomplete type %qT",
3784 error ("parameter %P has incomplete type %qT", i
, type
);
3786 parmval
= error_mark_node
;
3790 parmval
= convert_for_initialization
3791 (NULL_TREE
, type
, val
, flags
,
3792 ICR_ARGPASS
, fndecl
, i
, complain
);
3793 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3796 if (parmval
== error_mark_node
)
3799 (**values
)[i
] = parmval
;
3803 if (fndecl
&& magic_varargs_p (fndecl
))
3804 /* Don't do ellipsis conversion for __built_in_constant_p
3805 as this will result in spurious errors for non-trivial
3807 val
= require_complete_type_sfinae (val
, complain
);
3809 val
= convert_arg_to_ellipsis (val
, complain
);
3811 (**values
)[i
] = val
;
3815 typetail
= TREE_CHAIN (typetail
);
3818 if (typetail
!= 0 && typetail
!= void_list_node
)
3820 /* See if there are default arguments that can be used. Because
3821 we hold default arguments in the FUNCTION_TYPE (which is so
3822 wrong), we can see default parameters here from deduced
3823 contexts (and via typeof) for indirect function calls.
3824 Fortunately we know whether we have a function decl to
3825 provide default arguments in a language conformant
3827 if (fndecl
&& TREE_PURPOSE (typetail
)
3828 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3830 for (; typetail
!= void_list_node
; ++i
)
3833 = convert_default_arg (TREE_VALUE (typetail
),
3834 TREE_PURPOSE (typetail
),
3835 fndecl
, i
, complain
);
3837 if (parmval
== error_mark_node
)
3840 vec_safe_push (*values
, parmval
);
3841 typetail
= TREE_CHAIN (typetail
);
3842 /* ends with `...'. */
3843 if (typetail
== NULL_TREE
)
3849 if (complain
& tf_error
)
3850 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3858 /* Build a binary-operation expression, after performing default
3859 conversions on the operands. CODE is the kind of expression to
3860 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3861 are the tree codes which correspond to ARG1 and ARG2 when issuing
3862 warnings about possibly misplaced parentheses. They may differ
3863 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3864 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3865 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3866 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3867 ARG2_CODE as ERROR_MARK. */
3870 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
3871 enum tree_code arg1_code
, tree arg2
,
3872 enum tree_code arg2_code
, tree
*overload_p
,
3873 tsubst_flags_t complain
)
3878 tree overload
= NULL_TREE
;
3883 if (processing_template_decl
)
3885 if (type_dependent_expression_p (arg1
)
3886 || type_dependent_expression_p (arg2
))
3887 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
3888 arg1
= build_non_dependent_expr (arg1
);
3889 arg2
= build_non_dependent_expr (arg2
);
3892 if (code
== DOTSTAR_EXPR
)
3893 expr
= build_m_component_ref (arg1
, arg2
, complain
);
3895 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3896 &overload
, complain
);
3898 if (overload_p
!= NULL
)
3899 *overload_p
= overload
;
3901 /* Check for cases such as x+y<<z which users are likely to
3902 misinterpret. But don't warn about obj << x + y, since that is a
3903 common idiom for I/O. */
3904 if (warn_parentheses
3905 && (complain
& tf_warning
)
3906 && !processing_template_decl
3907 && !error_operand_p (arg1
)
3908 && !error_operand_p (arg2
)
3909 && (code
!= LSHIFT_EXPR
3910 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3911 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
3912 arg2_code
, orig_arg2
);
3914 if (processing_template_decl
&& expr
!= error_mark_node
)
3916 if (overload
!= NULL_TREE
)
3917 return (build_min_non_dep_op_overload
3918 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
3920 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3926 /* Build and return an ARRAY_REF expression. */
3929 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
3930 tsubst_flags_t complain
)
3932 tree orig_arg1
= arg1
;
3933 tree orig_arg2
= arg2
;
3935 tree overload
= NULL_TREE
;
3937 if (processing_template_decl
)
3939 if (type_dependent_expression_p (arg1
)
3940 || type_dependent_expression_p (arg2
))
3941 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
3942 NULL_TREE
, NULL_TREE
);
3943 arg1
= build_non_dependent_expr (arg1
);
3944 arg2
= build_non_dependent_expr (arg2
);
3947 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
3948 NULL_TREE
, &overload
, complain
);
3950 if (processing_template_decl
&& expr
!= error_mark_node
)
3952 if (overload
!= NULL_TREE
)
3953 return (build_min_non_dep_op_overload
3954 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
3956 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3957 NULL_TREE
, NULL_TREE
);
3962 /* Return whether OP is an expression of enum type cast to integer
3963 type. In C++ even unsigned enum types are cast to signed integer
3964 types. We do not want to issue warnings about comparisons between
3965 signed and unsigned types when one of the types is an enum type.
3966 Those warnings are always false positives in practice. */
3969 enum_cast_to_int (tree op
)
3971 if (CONVERT_EXPR_P (op
)
3972 && TREE_TYPE (op
) == integer_type_node
3973 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
3974 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
3977 /* The cast may have been pushed into a COND_EXPR. */
3978 if (TREE_CODE (op
) == COND_EXPR
)
3979 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
3980 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
3985 /* For the c-common bits. */
3987 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3990 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3993 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
3994 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
3997 build_vec_cmp (tree_code code
, tree type
,
3998 tree arg0
, tree arg1
)
4000 tree zero_vec
= build_zero_cst (type
);
4001 tree minus_one_vec
= build_minus_one_cst (type
);
4002 tree cmp_type
= build_same_sized_truth_vector_type(type
);
4003 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4004 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4007 /* Possibly warn about an address never being NULL. */
4010 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4013 || (complain
& tf_warning
) == 0
4014 || c_inhibit_evaluation_warnings
!= 0
4015 || TREE_NO_WARNING (op
))
4018 tree cop
= fold_non_dependent_expr (op
);
4020 if (TREE_CODE (cop
) == ADDR_EXPR
4021 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4022 && !TREE_NO_WARNING (cop
))
4023 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4024 "be NULL", TREE_OPERAND (cop
, 0));
4026 if (CONVERT_EXPR_P (op
)
4027 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == REFERENCE_TYPE
)
4030 STRIP_NOPS (inner_op
);
4032 if (DECL_P (inner_op
))
4033 warning_at (location
, OPT_Waddress
,
4034 "the compiler can assume that the address of "
4035 "%qD will never be NULL", inner_op
);
4039 /* Build a binary-operation expression without default conversions.
4040 CODE is the kind of expression to build.
4041 LOCATION is the location_t of the operator in the source code.
4042 This function differs from `build' in several ways:
4043 the data type of the result is computed and recorded in it,
4044 warnings are generated if arg data types are invalid,
4045 special handling for addition and subtraction of pointers is known,
4046 and some optimization is done (operations on narrow ints
4047 are done in the narrower type when that gives the same result).
4048 Constant folding is also done before the result is returned.
4050 Note that the operands will never have enumeral types
4051 because either they have just had the default conversions performed
4052 or they have both just been converted to some other type in which
4053 the arithmetic is to be done.
4055 C++: must do special pointer arithmetic when implementing
4056 multiple inheritance, and deal with pointer to member functions. */
4059 cp_build_binary_op (location_t location
,
4060 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4061 tsubst_flags_t complain
)
4064 enum tree_code code0
, code1
;
4066 const char *invalid_op_diag
;
4068 /* Expression code to give to the expression when it is built.
4069 Normally this is CODE, which is what the caller asked for,
4070 but in some special cases we change it. */
4071 enum tree_code resultcode
= code
;
4073 /* Data type in which the computation is to be performed.
4074 In the simplest cases this is the common type of the arguments. */
4075 tree result_type
= NULL
;
4077 /* Nonzero means operands have already been type-converted
4078 in whatever way is necessary.
4079 Zero means they need to be converted to RESULT_TYPE. */
4082 /* Nonzero means create the expression with this type, rather than
4084 tree build_type
= 0;
4086 /* Nonzero means after finally constructing the expression
4087 convert it to this type. */
4088 tree final_type
= 0;
4090 tree result
, result_ovl
;
4091 tree orig_type
= NULL
;
4093 /* Nonzero if this is an operation like MIN or MAX which can
4094 safely be computed in short if both args are promoted shorts.
4095 Also implies COMMON.
4096 -1 indicates a bitwise operation; this makes a difference
4097 in the exact conditions for when it is safe to do the operation
4098 in a narrower mode. */
4101 /* Nonzero if this is a comparison operation;
4102 if both args are promoted shorts, compare the original shorts.
4103 Also implies COMMON. */
4104 int short_compare
= 0;
4106 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4109 /* True if both operands have arithmetic type. */
4110 bool arithmetic_types_p
;
4112 /* Apply default conversions. */
4116 /* Remember whether we're doing / or %. */
4117 bool doing_div_or_mod
= false;
4119 /* Remember whether we're doing << or >>. */
4120 bool doing_shift
= false;
4122 /* Tree holding instrumentation expression. */
4123 tree instrument_expr
= NULL
;
4125 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4126 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4127 || code
== TRUTH_XOR_EXPR
)
4129 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4130 op0
= decay_conversion (op0
, complain
);
4131 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4132 op1
= decay_conversion (op1
, complain
);
4136 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4137 op0
= cp_default_conversion (op0
, complain
);
4138 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4139 op1
= cp_default_conversion (op1
, complain
);
4142 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4143 STRIP_TYPE_NOPS (op0
);
4144 STRIP_TYPE_NOPS (op1
);
4146 /* DTRT if one side is an overloaded function, but complain about it. */
4147 if (type_unknown_p (op0
))
4149 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4150 if (t
!= error_mark_node
)
4152 if (complain
& tf_error
)
4153 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4158 if (type_unknown_p (op1
))
4160 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4161 if (t
!= error_mark_node
)
4163 if (complain
& tf_error
)
4164 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4170 type0
= TREE_TYPE (op0
);
4171 type1
= TREE_TYPE (op1
);
4173 /* The expression codes of the data types of the arguments tell us
4174 whether the arguments are integers, floating, pointers, etc. */
4175 code0
= TREE_CODE (type0
);
4176 code1
= TREE_CODE (type1
);
4178 /* If an error was already reported for one of the arguments,
4179 avoid reporting another error. */
4180 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4181 return error_mark_node
;
4183 if ((invalid_op_diag
4184 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4186 if (complain
& tf_error
)
4187 error (invalid_op_diag
);
4188 return error_mark_node
;
4191 /* Issue warnings about peculiar, but valid, uses of NULL. */
4192 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
4193 /* It's reasonable to use pointer values as operands of &&
4194 and ||, so NULL is no exception. */
4195 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4196 && ( /* Both are NULL (or 0) and the operation was not a
4197 comparison or a pointer subtraction. */
4198 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4199 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4200 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4201 || (!null_ptr_cst_p (orig_op0
)
4202 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4203 || (!null_ptr_cst_p (orig_op1
)
4204 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4205 && (complain
& tf_warning
))
4207 source_location loc
=
4208 expansion_point_location_if_in_system_header (input_location
);
4210 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4213 /* In case when one of the operands of the binary operation is
4214 a vector and another is a scalar -- convert scalar to vector. */
4215 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4217 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4218 complain
& tf_error
);
4220 switch (convert_flag
)
4223 return error_mark_node
;
4226 op0
= convert (TREE_TYPE (type1
), op0
);
4227 op0
= save_expr (op0
);
4228 op0
= build_vector_from_val (type1
, op0
);
4229 type0
= TREE_TYPE (op0
);
4230 code0
= TREE_CODE (type0
);
4236 op1
= convert (TREE_TYPE (type0
), op1
);
4237 op1
= save_expr (op1
);
4238 op1
= build_vector_from_val (type0
, op1
);
4239 type1
= TREE_TYPE (op1
);
4240 code1
= TREE_CODE (type1
);
4252 /* Subtraction of two similar pointers.
4253 We must subtract them as integers, then divide by object size. */
4254 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4255 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4257 return pointer_diff (location
, op0
, op1
,
4258 common_pointer_type (type0
, type1
), complain
);
4259 /* In all other cases except pointer - int, the usual arithmetic
4261 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4266 /* The pointer - int case is just like pointer + int; fall
4269 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4270 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4274 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4275 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4276 if (processing_template_decl
)
4278 result_type
= TREE_TYPE (ptr_operand
);
4281 return cp_pointer_int_sum (location
, code
,
4293 case TRUNC_DIV_EXPR
:
4295 case FLOOR_DIV_EXPR
:
4296 case ROUND_DIV_EXPR
:
4297 case EXACT_DIV_EXPR
:
4298 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4299 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4300 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4301 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4303 enum tree_code tcode0
= code0
, tcode1
= code1
;
4304 tree cop1
= fold_non_dependent_expr (op1
);
4305 doing_div_or_mod
= true;
4306 warn_for_div_by_zero (location
, cop1
);
4308 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4309 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4310 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4311 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4313 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4314 resultcode
= RDIV_EXPR
;
4316 /* When dividing two signed integers, we have to promote to int.
4317 unless we divide by a constant != -1. Note that default
4318 conversion will have been performed on the operands at this
4319 point, so we have to dig out the original type to find out if
4321 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4322 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4323 || (TREE_CODE (op1
) == INTEGER_CST
4324 && ! integer_all_onesp (op1
)));
4333 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4334 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4335 && !VECTOR_FLOAT_TYPE_P (type0
)
4336 && !VECTOR_FLOAT_TYPE_P (type1
)))
4340 case TRUNC_MOD_EXPR
:
4341 case FLOOR_MOD_EXPR
:
4343 tree cop1
= fold_non_dependent_expr (op1
);
4344 doing_div_or_mod
= true;
4345 warn_for_div_by_zero (location
, cop1
);
4348 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4349 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4350 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4352 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4354 /* Although it would be tempting to shorten always here, that loses
4355 on some targets, since the modulo instruction is undefined if the
4356 quotient can't be represented in the computation mode. We shorten
4357 only if unsigned or if dividing by something we know != -1. */
4358 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4359 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4360 || (TREE_CODE (op1
) == INTEGER_CST
4361 && ! integer_all_onesp (op1
)));
4366 case TRUTH_ANDIF_EXPR
:
4367 case TRUTH_ORIF_EXPR
:
4368 case TRUTH_AND_EXPR
:
4370 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4372 if (!COMPARISON_CLASS_P (op1
))
4373 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4374 build_zero_cst (type1
), complain
);
4375 if (code
== TRUTH_ANDIF_EXPR
)
4377 tree z
= build_zero_cst (TREE_TYPE (op1
));
4378 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4380 else if (code
== TRUTH_ORIF_EXPR
)
4382 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4383 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4388 if (VECTOR_TYPE_P (type0
))
4390 if (!COMPARISON_CLASS_P (op0
))
4391 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4392 build_zero_cst (type0
), complain
);
4393 if (!VECTOR_TYPE_P (type1
))
4395 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4396 tree z
= build_zero_cst (TREE_TYPE (op0
));
4397 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4399 else if (!COMPARISON_CLASS_P (op1
))
4400 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4401 build_zero_cst (type1
), complain
);
4403 if (code
== TRUTH_ANDIF_EXPR
)
4404 code
= BIT_AND_EXPR
;
4405 else if (code
== TRUTH_ORIF_EXPR
)
4406 code
= BIT_IOR_EXPR
;
4410 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4413 result_type
= boolean_type_node
;
4416 /* Shift operations: result has same type as first operand;
4417 always convert second operand to int.
4418 Also set SHORT_SHIFT if shifting rightward. */
4421 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4422 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4424 result_type
= type0
;
4427 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4428 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4429 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4430 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4432 result_type
= type0
;
4435 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4437 tree const_op1
= fold_non_dependent_expr (op1
);
4438 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4440 result_type
= type0
;
4442 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4444 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4446 if ((complain
& tf_warning
)
4447 && c_inhibit_evaluation_warnings
== 0)
4448 warning (OPT_Wshift_count_negative
,
4449 "right shift count is negative");
4453 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4454 && (complain
& tf_warning
)
4455 && c_inhibit_evaluation_warnings
== 0)
4456 warning (OPT_Wshift_count_overflow
,
4457 "right shift count >= width of type");
4460 /* Avoid converting op1 to result_type later. */
4466 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4467 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4469 result_type
= type0
;
4472 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4473 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4474 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4475 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4477 result_type
= type0
;
4480 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4482 tree const_op0
= fold_non_dependent_expr (op0
);
4483 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4485 tree const_op1
= fold_non_dependent_expr (op1
);
4486 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4488 result_type
= type0
;
4490 if (TREE_CODE (const_op0
) == INTEGER_CST
4491 && tree_int_cst_sgn (const_op0
) < 0
4492 && (complain
& tf_warning
)
4493 && c_inhibit_evaluation_warnings
== 0)
4494 warning (OPT_Wshift_negative_value
,
4495 "left shift of negative value");
4496 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4498 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4500 if ((complain
& tf_warning
)
4501 && c_inhibit_evaluation_warnings
== 0)
4502 warning (OPT_Wshift_count_negative
,
4503 "left shift count is negative");
4505 else if (compare_tree_int (const_op1
,
4506 TYPE_PRECISION (type0
)) >= 0)
4508 if ((complain
& tf_warning
)
4509 && c_inhibit_evaluation_warnings
== 0)
4510 warning (OPT_Wshift_count_overflow
,
4511 "left shift count >= width of type");
4513 else if (TREE_CODE (const_op0
) == INTEGER_CST
4514 && (complain
& tf_warning
))
4515 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4517 /* Avoid converting op1 to result_type later. */
4524 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4526 result_type
= type0
;
4527 if (TREE_CODE (op1
) == INTEGER_CST
)
4529 if (tree_int_cst_lt (op1
, integer_zero_node
))
4531 if (complain
& tf_warning
)
4532 warning (0, (code
== LROTATE_EXPR
)
4533 ? G_("left rotate count is negative")
4534 : G_("right rotate count is negative"));
4536 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4538 if (complain
& tf_warning
)
4539 warning (0, (code
== LROTATE_EXPR
)
4540 ? G_("left rotate count >= width of type")
4541 : G_("right rotate count >= width of type"));
4544 /* Convert the shift-count to an integer, regardless of
4545 size of value being shifted. */
4546 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4547 op1
= cp_convert (integer_type_node
, op1
, complain
);
4553 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4554 goto vector_compare
;
4555 if ((complain
& tf_warning
)
4556 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4557 warning (OPT_Wfloat_equal
,
4558 "comparing floating point with == or != is unsafe");
4559 if ((complain
& tf_warning
)
4560 && ((TREE_CODE (orig_op0
) == STRING_CST
4561 && !integer_zerop (cp_fully_fold (op1
)))
4562 || (TREE_CODE (orig_op1
) == STRING_CST
4563 && !integer_zerop (cp_fully_fold (op0
)))))
4564 warning (OPT_Waddress
, "comparison with string literal results "
4565 "in unspecified behavior");
4567 build_type
= boolean_type_node
;
4568 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4569 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4570 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4571 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4573 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4574 && null_ptr_cst_p (op1
))
4575 /* Handle, eg, (void*)0 (c++/43906), and more. */
4576 || (code0
== POINTER_TYPE
4577 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4579 if (TYPE_PTR_P (type1
))
4580 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4581 CPO_COMPARISON
, complain
);
4583 result_type
= type0
;
4585 warn_for_null_address (location
, op0
, complain
);
4587 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4588 && null_ptr_cst_p (op0
))
4589 /* Handle, eg, (void*)0 (c++/43906), and more. */
4590 || (code1
== POINTER_TYPE
4591 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4593 if (TYPE_PTR_P (type0
))
4594 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4595 CPO_COMPARISON
, complain
);
4597 result_type
= type1
;
4599 warn_for_null_address (location
, op1
, complain
);
4601 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4602 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4603 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4604 CPO_COMPARISON
, complain
);
4605 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4606 /* One of the operands must be of nullptr_t type. */
4607 result_type
= TREE_TYPE (nullptr_node
);
4608 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4610 result_type
= type0
;
4611 if (complain
& tf_error
)
4612 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4614 return error_mark_node
;
4616 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4618 result_type
= type1
;
4619 if (complain
& tf_error
)
4620 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4622 return error_mark_node
;
4624 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4626 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4627 == ptrmemfunc_vbit_in_delta
)
4629 tree pfn0
, delta0
, e1
, e2
;
4631 if (TREE_SIDE_EFFECTS (op0
))
4632 op0
= save_expr (op0
);
4634 pfn0
= pfn_from_ptrmemfunc (op0
);
4635 delta0
= delta_from_ptrmemfunc (op0
);
4636 e1
= cp_build_binary_op (location
,
4639 build_zero_cst (TREE_TYPE (pfn0
)),
4641 e2
= cp_build_binary_op (location
,
4647 if (complain
& tf_warning
)
4648 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4650 e2
= cp_build_binary_op (location
,
4651 EQ_EXPR
, e2
, integer_zero_node
,
4653 op0
= cp_build_binary_op (location
,
4654 TRUTH_ANDIF_EXPR
, e1
, e2
,
4656 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4660 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4661 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4663 result_type
= TREE_TYPE (op0
);
4665 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4666 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4667 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4670 /* E will be the final comparison. */
4672 /* E1 and E2 are for scratch. */
4680 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4681 CPO_COMPARISON
, complain
);
4683 if (!same_type_p (TREE_TYPE (op0
), type
))
4684 op0
= cp_convert_and_check (type
, op0
, complain
);
4685 if (!same_type_p (TREE_TYPE (op1
), type
))
4686 op1
= cp_convert_and_check (type
, op1
, complain
);
4688 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4689 return error_mark_node
;
4691 if (TREE_SIDE_EFFECTS (op0
))
4692 op0
= save_expr (op0
);
4693 if (TREE_SIDE_EFFECTS (op1
))
4694 op1
= save_expr (op1
);
4696 pfn0
= pfn_from_ptrmemfunc (op0
);
4697 pfn0
= cp_fully_fold (pfn0
);
4698 /* Avoid -Waddress warnings (c++/64877). */
4699 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4700 TREE_NO_WARNING (pfn0
) = 1;
4701 pfn1
= pfn_from_ptrmemfunc (op1
);
4702 pfn1
= cp_fully_fold (pfn1
);
4703 delta0
= delta_from_ptrmemfunc (op0
);
4704 delta1
= delta_from_ptrmemfunc (op1
);
4705 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4706 == ptrmemfunc_vbit_in_delta
)
4711 && ((op0.delta == op1.delta)
4712 || (!op0.pfn && op0.delta & 1 == 0
4713 && op1.delta & 1 == 0))
4715 The reason for the `!op0.pfn' bit is that a NULL
4716 pointer-to-member is any member with a zero PFN and
4717 LSB of the DELTA field is 0. */
4719 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4723 e1
= cp_build_binary_op (location
,
4724 EQ_EXPR
, e1
, integer_zero_node
,
4726 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4730 e2
= cp_build_binary_op (location
,
4731 EQ_EXPR
, e2
, integer_zero_node
,
4733 e1
= cp_build_binary_op (location
,
4734 TRUTH_ANDIF_EXPR
, e2
, e1
,
4736 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4738 build_zero_cst (TREE_TYPE (pfn0
)),
4740 e2
= cp_build_binary_op (location
,
4741 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4742 e1
= cp_build_binary_op (location
,
4743 EQ_EXPR
, delta0
, delta1
, complain
);
4744 e1
= cp_build_binary_op (location
,
4745 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4752 && (!op0.pfn || op0.delta == op1.delta))
4754 The reason for the `!op0.pfn' bit is that a NULL
4755 pointer-to-member is any member with a zero PFN; the
4756 DELTA field is unspecified. */
4758 e1
= cp_build_binary_op (location
,
4759 EQ_EXPR
, delta0
, delta1
, complain
);
4760 e2
= cp_build_binary_op (location
,
4763 build_zero_cst (TREE_TYPE (pfn0
)),
4765 e1
= cp_build_binary_op (location
,
4766 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4768 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4769 e
= cp_build_binary_op (location
,
4770 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4771 if (code
== EQ_EXPR
)
4773 return cp_build_binary_op (location
,
4774 EQ_EXPR
, e
, integer_zero_node
, complain
);
4778 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4779 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4781 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4782 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4790 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4791 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4793 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4794 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4795 CPO_COMPARISON
, complain
);
4802 if (TREE_CODE (orig_op0
) == STRING_CST
4803 || TREE_CODE (orig_op1
) == STRING_CST
)
4805 if (complain
& tf_warning
)
4806 warning (OPT_Waddress
, "comparison with string literal results "
4807 "in unspecified behavior");
4810 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4814 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4816 && !vector_types_compatible_elements_p (type0
, type1
))
4818 if (complain
& tf_error
)
4820 error_at (location
, "comparing vectors with different "
4822 inform (location
, "operand types are %qT and %qT",
4825 return error_mark_node
;
4828 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
4830 if (complain
& tf_error
)
4832 error_at (location
, "comparing vectors with different "
4833 "number of elements");
4834 inform (location
, "operand types are %qT and %qT",
4837 return error_mark_node
;
4840 /* It's not precisely specified how the usual arithmetic
4841 conversions apply to the vector types. Here, we use
4842 the unsigned type if one of the operands is signed and
4843 the other one is unsigned. */
4844 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
4846 if (!TYPE_UNSIGNED (type0
))
4847 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
4849 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
4850 warning_at (location
, OPT_Wsign_compare
, "comparison between "
4851 "types %qT and %qT", type0
, type1
);
4854 /* Always construct signed integer vector type. */
4855 intt
= c_common_type_for_size (GET_MODE_BITSIZE
4856 (TYPE_MODE (TREE_TYPE (type0
))), 0);
4859 if (complain
& tf_error
)
4860 error_at (location
, "could not find an integer type "
4861 "of the same size as %qT", TREE_TYPE (type0
));
4862 return error_mark_node
;
4864 result_type
= build_opaque_vector_type (intt
,
4865 TYPE_VECTOR_SUBPARTS (type0
));
4867 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
4869 build_type
= boolean_type_node
;
4870 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4871 || code0
== ENUMERAL_TYPE
)
4872 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4873 || code1
== ENUMERAL_TYPE
))
4875 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4876 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4877 CPO_COMPARISON
, complain
);
4878 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4880 result_type
= type0
;
4881 if (extra_warnings
&& (complain
& tf_warning
))
4882 warning (OPT_Wextra
,
4883 "ordered comparison of pointer with integer zero");
4885 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4887 result_type
= type1
;
4888 if (extra_warnings
&& (complain
& tf_warning
))
4889 warning (OPT_Wextra
,
4890 "ordered comparison of pointer with integer zero");
4892 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4893 /* One of the operands must be of nullptr_t type. */
4894 result_type
= TREE_TYPE (nullptr_node
);
4895 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4897 result_type
= type0
;
4898 if (complain
& tf_error
)
4899 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4901 return error_mark_node
;
4903 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4905 result_type
= type1
;
4906 if (complain
& tf_error
)
4907 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4909 return error_mark_node
;
4913 case UNORDERED_EXPR
:
4920 build_type
= integer_type_node
;
4921 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4923 if (complain
& tf_error
)
4924 error ("unordered comparison on non-floating point argument");
4925 return error_mark_node
;
4934 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4935 || code0
== ENUMERAL_TYPE
)
4936 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4937 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4938 arithmetic_types_p
= 1;
4941 arithmetic_types_p
= 0;
4942 /* Vector arithmetic is only allowed when both sides are vectors. */
4943 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4945 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4946 || !vector_types_compatible_elements_p (type0
, type1
))
4948 if (complain
& tf_error
)
4950 /* "location" already embeds the locations of the
4951 operands, so we don't need to add them separately
4953 rich_location
richloc (line_table
, location
);
4954 binary_op_error (&richloc
, code
, type0
, type1
);
4956 return error_mark_node
;
4958 arithmetic_types_p
= 1;
4961 /* Determine the RESULT_TYPE, if it is not already known. */
4963 && arithmetic_types_p
4964 && (shorten
|| common
|| short_compare
))
4966 result_type
= cp_common_type (type0
, type1
);
4967 if (complain
& tf_warning
)
4968 do_warn_double_promotion (result_type
, type0
, type1
,
4969 "implicit conversion from %qT to %qT "
4970 "to match other operand of binary "
4977 if (complain
& tf_error
)
4979 "invalid operands of types %qT and %qT to binary %qO",
4980 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4981 return error_mark_node
;
4984 /* If we're in a template, the only thing we need to know is the
4986 if (processing_template_decl
)
4988 /* Since the middle-end checks the type when doing a build2, we
4989 need to build the tree in pieces. This built tree will never
4990 get out of the front-end as we replace it when instantiating
4992 tree tmp
= build2 (resultcode
,
4993 build_type
? build_type
: result_type
,
4995 TREE_OPERAND (tmp
, 0) = op0
;
4999 if (arithmetic_types_p
)
5001 bool first_complex
= (code0
== COMPLEX_TYPE
);
5002 bool second_complex
= (code1
== COMPLEX_TYPE
);
5003 int none_complex
= (!first_complex
&& !second_complex
);
5005 /* Adapted from patch for c/24581. */
5006 if (first_complex
!= second_complex
5007 && (code
== PLUS_EXPR
5008 || code
== MINUS_EXPR
5009 || code
== MULT_EXPR
5010 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5011 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5012 && flag_signed_zeros
)
5014 /* An operation on mixed real/complex operands must be
5015 handled specially, but the language-independent code can
5016 more easily optimize the plain complex arithmetic if
5017 -fno-signed-zeros. */
5018 tree real_type
= TREE_TYPE (result_type
);
5022 if (TREE_TYPE (op0
) != result_type
)
5023 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5024 if (TREE_TYPE (op1
) != real_type
)
5025 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5029 if (TREE_TYPE (op0
) != real_type
)
5030 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5031 if (TREE_TYPE (op1
) != result_type
)
5032 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5034 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5035 return error_mark_node
;
5038 op0
= save_expr (op0
);
5039 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
5040 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
5044 case TRUNC_DIV_EXPR
:
5045 op1
= save_expr (op1
);
5046 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5050 real
= build2 (resultcode
, real_type
, real
, op1
);
5058 op1
= save_expr (op1
);
5059 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
5060 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
5064 op0
= save_expr (op0
);
5065 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5068 real
= build2 (resultcode
, real_type
, op0
, real
);
5071 real
= build2 (resultcode
, real_type
, op0
, real
);
5072 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5078 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5082 /* For certain operations (which identify themselves by shorten != 0)
5083 if both args were extended from the same smaller type,
5084 do the arithmetic in that type and then extend.
5086 shorten !=0 and !=1 indicates a bitwise operation.
5087 For them, this optimization is safe only if
5088 both args are zero-extended or both are sign-extended.
5089 Otherwise, we might change the result.
5090 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5091 but calculated in (unsigned short) it would be (unsigned short)-1. */
5093 if (shorten
&& none_complex
)
5095 orig_type
= result_type
;
5096 final_type
= result_type
;
5097 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5101 /* Comparison operations are shortened too but differently.
5102 They identify themselves by setting short_compare = 1. */
5106 /* We call shorten_compare only for diagnostic-reason. */
5107 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5108 xresult_type
= result_type
;
5109 enum tree_code xresultcode
= resultcode
;
5110 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5114 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5115 && warn_sign_compare
5116 /* Do not warn until the template is instantiated; we cannot
5117 bound the ranges of the arguments until that point. */
5118 && !processing_template_decl
5119 && (complain
& tf_warning
)
5120 && c_inhibit_evaluation_warnings
== 0
5121 /* Even unsigned enum types promote to signed int. We don't
5122 want to issue -Wsign-compare warnings for this case. */
5123 && !enum_cast_to_int (orig_op0
)
5124 && !enum_cast_to_int (orig_op1
))
5126 tree oop0
= maybe_constant_value (orig_op0
);
5127 tree oop1
= maybe_constant_value (orig_op1
);
5129 if (TREE_CODE (oop0
) != INTEGER_CST
)
5130 oop0
= cp_fully_fold (orig_op0
);
5131 if (TREE_CODE (oop1
) != INTEGER_CST
)
5132 oop1
= cp_fully_fold (orig_op1
);
5133 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5134 result_type
, resultcode
);
5138 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5139 Then the expression will be built.
5140 It will be given type FINAL_TYPE if that is nonzero;
5141 otherwise, it will be given type RESULT_TYPE. */
5144 if (TREE_TYPE (op0
) != result_type
)
5145 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5146 if (TREE_TYPE (op1
) != result_type
)
5147 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5149 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5150 return error_mark_node
;
5153 if (build_type
== NULL_TREE
)
5154 build_type
= result_type
;
5156 if ((flag_sanitize
& (SANITIZE_SHIFT
| SANITIZE_DIVIDE
5157 | SANITIZE_FLOAT_DIVIDE
))
5158 && !processing_template_decl
5159 && do_ubsan_in_current_function ()
5160 && (doing_div_or_mod
|| doing_shift
))
5162 /* OP0 and/or OP1 might have side-effects. */
5163 op0
= cp_save_expr (op0
);
5164 op1
= cp_save_expr (op1
);
5165 op0
= fold_non_dependent_expr (op0
);
5166 op1
= fold_non_dependent_expr (op1
);
5167 if (doing_div_or_mod
&& (flag_sanitize
& (SANITIZE_DIVIDE
5168 | SANITIZE_FLOAT_DIVIDE
)))
5170 /* For diagnostics we want to use the promoted types without
5171 shorten_binary_op. So convert the arguments to the
5172 original result_type. */
5175 if (orig_type
!= NULL
&& result_type
!= orig_type
)
5177 cop0
= cp_convert (orig_type
, op0
, complain
);
5178 cop1
= cp_convert (orig_type
, op1
, complain
);
5180 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5182 else if (doing_shift
&& (flag_sanitize
& SANITIZE_SHIFT
))
5183 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5186 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5187 if (final_type
!= 0)
5188 result
= cp_convert (final_type
, result
, complain
);
5190 if (instrument_expr
!= NULL
)
5191 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5192 instrument_expr
, result
);
5194 if (!processing_template_decl
)
5196 op0
= cp_fully_fold (op0
);
5197 /* Only consider the second argument if the first isn't overflowed. */
5198 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5200 op1
= cp_fully_fold (op1
);
5201 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5204 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5205 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5208 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5209 if (TREE_OVERFLOW_P (result_ovl
))
5210 overflow_warning (location
, result_ovl
);
5215 /* Build a VEC_PERM_EXPR.
5216 This is a simple wrapper for c_build_vec_perm_expr. */
5218 build_x_vec_perm_expr (location_t loc
,
5219 tree arg0
, tree arg1
, tree arg2
,
5220 tsubst_flags_t complain
)
5222 tree orig_arg0
= arg0
;
5223 tree orig_arg1
= arg1
;
5224 tree orig_arg2
= arg2
;
5225 if (processing_template_decl
)
5227 if (type_dependent_expression_p (arg0
)
5228 || type_dependent_expression_p (arg1
)
5229 || type_dependent_expression_p (arg2
))
5230 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5231 arg0
= build_non_dependent_expr (arg0
);
5233 arg1
= build_non_dependent_expr (arg1
);
5234 arg2
= build_non_dependent_expr (arg2
);
5236 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5237 if (processing_template_decl
&& exp
!= error_mark_node
)
5238 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5239 orig_arg1
, orig_arg2
);
5243 /* Return a tree for the sum or difference (RESULTCODE says which)
5244 of pointer PTROP and integer INTOP. */
5247 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5248 tree intop
, tsubst_flags_t complain
)
5250 tree res_type
= TREE_TYPE (ptrop
);
5252 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5253 in certain circumstance (when it's valid to do so). So we need
5254 to make sure it's complete. We don't need to check here, if we
5255 can actually complete it at all, as those checks will be done in
5256 pointer_int_sum() anyway. */
5257 complete_type (TREE_TYPE (res_type
));
5259 return pointer_int_sum (loc
, resultcode
, ptrop
,
5260 intop
, complain
& tf_warning_or_error
);
5263 /* Return a tree for the difference of pointers OP0 and OP1.
5264 The resulting tree has type int. */
5267 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5268 tsubst_flags_t complain
)
5271 tree restype
= ptrdiff_type_node
;
5272 tree target_type
= TREE_TYPE (ptrtype
);
5274 if (!complete_type_or_else (target_type
, NULL_TREE
))
5275 return error_mark_node
;
5277 if (VOID_TYPE_P (target_type
))
5279 if (complain
& tf_error
)
5280 permerror (loc
, "ISO C++ forbids using pointer of "
5281 "type %<void *%> in subtraction");
5283 return error_mark_node
;
5285 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5287 if (complain
& tf_error
)
5288 permerror (loc
, "ISO C++ forbids using pointer to "
5289 "a function in subtraction");
5291 return error_mark_node
;
5293 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5295 if (complain
& tf_error
)
5296 permerror (loc
, "ISO C++ forbids using pointer to "
5297 "a method in subtraction");
5299 return error_mark_node
;
5302 /* First do the subtraction as integers;
5303 then drop through to build the divide operator. */
5305 op0
= cp_build_binary_op (loc
,
5307 cp_convert (restype
, op0
, complain
),
5308 cp_convert (restype
, op1
, complain
),
5311 /* This generates an error if op1 is a pointer to an incomplete type. */
5312 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5314 if (complain
& tf_error
)
5315 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5316 "pointer arithmetic");
5318 return error_mark_node
;
5321 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5323 if (complain
& tf_error
)
5324 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5326 return error_mark_node
;
5329 op1
= (TYPE_PTROB_P (ptrtype
)
5330 ? size_in_bytes_loc (loc
, target_type
)
5331 : integer_one_node
);
5333 /* Do the division. */
5335 result
= build2_loc (loc
, EXACT_DIV_EXPR
, restype
, op0
,
5336 cp_convert (restype
, op1
, complain
));
5340 /* Construct and perhaps optimize a tree representation
5341 for a unary operation. CODE, a tree_code, specifies the operation
5342 and XARG is the operand. */
5345 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5346 tsubst_flags_t complain
)
5348 tree orig_expr
= xarg
;
5351 tree overload
= NULL_TREE
;
5353 if (processing_template_decl
)
5355 if (type_dependent_expression_p (xarg
))
5356 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5358 xarg
= build_non_dependent_expr (xarg
);
5363 /* [expr.unary.op] says:
5365 The address of an object of incomplete type can be taken.
5367 (And is just the ordinary address operator, not an overloaded
5368 "operator &".) However, if the type is a template
5369 specialization, we must complete the type at this point so that
5370 an overloaded "operator &" will be available if required. */
5371 if (code
== ADDR_EXPR
5372 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5373 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5374 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5375 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5376 /* Don't look for a function. */;
5378 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5379 NULL_TREE
, &overload
, complain
);
5381 if (!exp
&& code
== ADDR_EXPR
)
5383 if (is_overloaded_fn (xarg
))
5385 tree fn
= get_first_fn (xarg
);
5386 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5388 if (complain
& tf_error
)
5389 error (DECL_CONSTRUCTOR_P (fn
)
5390 ? G_("taking address of constructor %qE")
5391 : G_("taking address of destructor %qE"),
5393 return error_mark_node
;
5397 /* A pointer to member-function can be formed only by saying
5399 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5400 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5402 if (TREE_CODE (xarg
) != OFFSET_REF
5403 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5405 if (complain
& tf_error
)
5407 error ("invalid use of %qE to form a "
5408 "pointer-to-member-function", xarg
.get_value ());
5409 if (TREE_CODE (xarg
) != OFFSET_REF
)
5410 inform (input_location
, " a qualified-id is required");
5412 return error_mark_node
;
5416 if (complain
& tf_error
)
5417 error ("parentheses around %qE cannot be used to form a"
5418 " pointer-to-member-function",
5421 return error_mark_node
;
5422 PTRMEM_OK_P (xarg
) = 1;
5426 if (TREE_CODE (xarg
) == OFFSET_REF
)
5428 ptrmem
= PTRMEM_OK_P (xarg
);
5430 if (!ptrmem
&& !flag_ms_extensions
5431 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5433 /* A single non-static member, make sure we don't allow a
5434 pointer-to-member. */
5435 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5436 TREE_OPERAND (xarg
, 0),
5437 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
5438 PTRMEM_OK_P (xarg
) = ptrmem
;
5442 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5445 if (processing_template_decl
&& exp
!= error_mark_node
)
5447 if (overload
!= NULL_TREE
)
5448 return (build_min_non_dep_op_overload
5449 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5451 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5452 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5454 if (TREE_CODE (exp
) == ADDR_EXPR
)
5455 PTRMEM_OK_P (exp
) = ptrmem
;
5459 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5460 constants, where a null value is represented by an INTEGER_CST of
5464 cp_truthvalue_conversion (tree expr
)
5466 tree type
= TREE_TYPE (expr
);
5467 if (TYPE_PTR_OR_PTRMEM_P (type
)
5468 /* Avoid ICE on invalid use of non-static member function. */
5469 || TREE_CODE (expr
) == FUNCTION_DECL
)
5470 return build_binary_op (input_location
, NE_EXPR
, expr
, nullptr_node
, 1);
5472 return c_common_truthvalue_conversion (input_location
, expr
);
5475 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5478 condition_conversion (tree expr
)
5481 if (processing_template_decl
)
5483 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5484 tf_warning_or_error
, LOOKUP_NORMAL
);
5485 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5489 /* Returns the address of T. This function will fold away
5490 ADDR_EXPR of INDIRECT_REF. */
5493 build_address (tree t
)
5495 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5496 return error_mark_node
;
5497 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
);
5498 t
= build_fold_addr_expr (t
);
5499 if (TREE_CODE (t
) != ADDR_EXPR
)
5504 /* Return a NOP_EXPR converting EXPR to TYPE. */
5507 build_nop (tree type
, tree expr
)
5509 if (type
== error_mark_node
|| error_operand_p (expr
))
5511 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5514 /* Take the address of ARG, whatever that means under C++ semantics.
5515 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5516 and class rvalues as well.
5518 Nothing should call this function directly; instead, callers should use
5519 cp_build_addr_expr or cp_build_addr_expr_strict. */
5522 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5527 if (!arg
|| error_operand_p (arg
))
5528 return error_mark_node
;
5530 arg
= mark_lvalue_use (arg
);
5531 argtype
= lvalue_type (arg
);
5533 gcc_assert (!identifier_p (arg
) || !IDENTIFIER_OPNAME_P (arg
));
5535 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5536 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5538 /* They're trying to take the address of a unique non-static
5539 member function. This is ill-formed (except in MS-land),
5540 but let's try to DTRT.
5541 Note: We only handle unique functions here because we don't
5542 want to complain if there's a static overload; non-unique
5543 cases will be handled by instantiate_type. But we need to
5544 handle this case here to allow casts on the resulting PMF.
5545 We could defer this in non-MS mode, but it's easier to give
5546 a useful error here. */
5548 /* Inside constant member functions, the `this' pointer
5549 contains an extra const qualifier. TYPE_MAIN_VARIANT
5550 is used here to remove this const from the diagnostics
5551 and the created OFFSET_REF. */
5552 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5553 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5554 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5555 return error_mark_node
;
5557 if (! flag_ms_extensions
)
5559 tree name
= DECL_NAME (fn
);
5560 if (!(complain
& tf_error
))
5561 return error_mark_node
;
5562 else if (current_class_type
5563 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5564 /* An expression like &memfn. */
5565 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5566 " or parenthesized non-static member function to form"
5567 " a pointer to member function. Say %<&%T::%D%>",
5570 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5571 " function to form a pointer to member function."
5575 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5578 /* Uninstantiated types are all functions. Taking the
5579 address of a function is a no-op, so just return the
5581 if (type_unknown_p (arg
))
5582 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5584 if (TREE_CODE (arg
) == OFFSET_REF
)
5585 /* We want a pointer to member; bypass all the code for actually taking
5586 the address of something. */
5589 /* Anything not already handled and not a true memory reference
5591 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5592 && TREE_CODE (argtype
) != METHOD_TYPE
)
5594 cp_lvalue_kind kind
= lvalue_kind (arg
);
5595 if (kind
== clk_none
)
5597 if (complain
& tf_error
)
5598 lvalue_error (input_location
, lv_addressof
);
5599 return error_mark_node
;
5601 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5603 if (!(complain
& tf_error
))
5604 return error_mark_node
;
5605 if (kind
& clk_class
)
5606 /* Make this a permerror because we used to accept it. */
5607 permerror (input_location
, "taking address of temporary");
5609 error ("taking address of xvalue (rvalue reference)");
5613 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5615 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5616 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5619 else if (pedantic
&& DECL_MAIN_P (arg
))
5622 /* Apparently a lot of autoconf scripts for C++ packages do this,
5623 so only complain if -Wpedantic. */
5624 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5625 pedwarn (input_location
, OPT_Wpedantic
,
5626 "ISO C++ forbids taking address of function %<::main%>");
5627 else if (flag_pedantic_errors
)
5628 return error_mark_node
;
5631 /* Let &* cancel out to simplify resulting code. */
5632 if (INDIRECT_REF_P (arg
))
5634 arg
= TREE_OPERAND (arg
, 0);
5635 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5637 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5638 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5641 /* Don't let this be an lvalue. */
5646 /* ??? Cope with user tricks that amount to offsetof. */
5647 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5648 && TREE_CODE (argtype
) != METHOD_TYPE
5649 && argtype
!= unknown_type_node
5650 && (val
= get_base_address (arg
))
5651 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5652 && INDIRECT_REF_P (val
)
5653 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5655 tree type
= build_pointer_type (argtype
);
5656 return fold_convert (type
, fold_offsetof_1 (arg
));
5659 /* Handle complex lvalues (when permitted)
5660 by reduction to simpler cases. */
5661 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5665 switch (TREE_CODE (arg
))
5669 case FIX_TRUNC_EXPR
:
5670 /* We should have handled this above in the lvalue_kind check. */
5675 arg
= BASELINK_FUNCTIONS (arg
);
5679 arg
= OVL_CURRENT (arg
);
5684 /* Turn a reference to a non-static data member into a
5685 pointer-to-member. */
5690 gcc_assert (PTRMEM_OK_P (arg
));
5692 t
= TREE_OPERAND (arg
, 1);
5693 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5695 if (complain
& tf_error
)
5696 error ("cannot create pointer to reference member %qD", t
);
5697 return error_mark_node
;
5700 type
= build_ptrmem_type (context_for_name_lookup (t
),
5702 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5710 if (argtype
!= error_mark_node
)
5711 argtype
= build_pointer_type (argtype
);
5713 /* In a template, we are processing a non-dependent expression
5714 so we can just form an ADDR_EXPR with the correct type. */
5715 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5717 val
= build_address (arg
);
5718 if (TREE_CODE (arg
) == OFFSET_REF
)
5719 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5721 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5723 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5725 /* We can only get here with a single static member
5727 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5728 && DECL_STATIC_FUNCTION_P (fn
));
5729 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5730 return error_mark_node
;
5731 val
= build_address (fn
);
5732 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5733 /* Do not lose object's side effects. */
5734 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5735 TREE_OPERAND (arg
, 0), val
);
5737 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5739 if (complain
& tf_error
)
5740 error ("attempt to take address of bit-field structure member %qD",
5741 TREE_OPERAND (arg
, 1));
5742 return error_mark_node
;
5746 tree object
= TREE_OPERAND (arg
, 0);
5747 tree field
= TREE_OPERAND (arg
, 1);
5748 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5749 (TREE_TYPE (object
), decl_type_context (field
)));
5750 val
= build_address (arg
);
5753 if (TYPE_PTR_P (argtype
)
5754 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5756 build_ptrmemfunc_type (argtype
);
5757 val
= build_ptrmemfunc (argtype
, val
, 0,
5765 /* Take the address of ARG if it has one, even if it's an rvalue. */
5768 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5770 return cp_build_addr_expr_1 (arg
, 0, complain
);
5773 /* Take the address of ARG, but only if it's an lvalue. */
5776 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5778 return cp_build_addr_expr_1 (arg
, 1, complain
);
5781 /* C++: Must handle pointers to members.
5783 Perhaps type instantiation should be extended to handle conversion
5784 from aggregates to types we don't yet know we want? (Or are those
5785 cases typically errors which should be reported?)
5787 NOCONVERT suppresses the default promotions (such as from short to int). */
5790 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
5791 tsubst_flags_t complain
)
5793 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5795 location_t location
= EXPR_LOC_OR_LOC (arg
, input_location
);
5797 const char *errstring
= NULL
;
5799 const char *invalid_op_diag
;
5801 if (!arg
|| error_operand_p (arg
))
5802 return error_mark_node
;
5804 if ((invalid_op_diag
5805 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5810 if (complain
& tf_error
)
5811 error (invalid_op_diag
);
5812 return error_mark_node
;
5817 case UNARY_PLUS_EXPR
:
5820 int flags
= WANT_ARITH
| WANT_ENUM
;
5821 /* Unary plus (but not unary minus) is allowed on pointers. */
5822 if (code
== UNARY_PLUS_EXPR
)
5823 flags
|= WANT_POINTER
;
5824 arg
= build_expr_type_conversion (flags
, arg
, true);
5826 errstring
= (code
== NEGATE_EXPR
5827 ? _("wrong type argument to unary minus")
5828 : _("wrong type argument to unary plus"));
5831 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5832 arg
= cp_perform_integral_promotions (arg
, complain
);
5834 /* Make sure the result is not an lvalue: a unary plus or minus
5835 expression is always a rvalue. */
5842 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5847 arg
= cp_default_conversion (arg
, complain
);
5848 if (arg
== error_mark_node
)
5849 return error_mark_node
;
5852 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5853 | WANT_VECTOR_OR_COMPLEX
,
5855 errstring
= _("wrong type argument to bit-complement");
5856 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5858 /* Warn if the expression has boolean value. */
5859 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
5860 && warning_at (location
, OPT_Wbool_operation
,
5861 "%<~%> on an expression of type bool"))
5862 inform (location
, "did you mean to use logical not (%<!%>)?");
5863 arg
= cp_perform_integral_promotions (arg
, complain
);
5868 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5869 errstring
= _("wrong type argument to abs");
5870 else if (!noconvert
)
5872 arg
= cp_default_conversion (arg
, complain
);
5873 if (arg
== error_mark_node
)
5874 return error_mark_node
;
5879 /* Conjugating a real value is a no-op, but allow it anyway. */
5880 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5881 errstring
= _("wrong type argument to conjugation");
5882 else if (!noconvert
)
5884 arg
= cp_default_conversion (arg
, complain
);
5885 if (arg
== error_mark_node
)
5886 return error_mark_node
;
5890 case TRUTH_NOT_EXPR
:
5891 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
5892 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
5893 build_zero_cst (TREE_TYPE (arg
)), complain
);
5894 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5896 val
= invert_truthvalue_loc (input_location
, arg
);
5897 if (arg
!= error_mark_node
)
5899 errstring
= _("in argument to unary !");
5907 arg
= build_real_imag_expr (input_location
, code
, arg
);
5910 case PREINCREMENT_EXPR
:
5911 case POSTINCREMENT_EXPR
:
5912 case PREDECREMENT_EXPR
:
5913 case POSTDECREMENT_EXPR
:
5914 /* Handle complex lvalues (when permitted)
5915 by reduction to simpler cases. */
5917 val
= unary_complex_lvalue (code
, arg
);
5921 arg
= mark_lvalue_use (arg
);
5923 /* Increment or decrement the real part of the value,
5924 and don't change the imaginary part. */
5925 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5929 arg
= cp_stabilize_reference (arg
);
5930 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
5931 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
5932 real
= cp_build_unary_op (code
, real
, true, complain
);
5933 if (real
== error_mark_node
|| imag
== error_mark_node
)
5934 return error_mark_node
;
5935 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5939 /* Report invalid types. */
5941 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5944 if (code
== PREINCREMENT_EXPR
)
5945 errstring
= _("no pre-increment operator for type");
5946 else if (code
== POSTINCREMENT_EXPR
)
5947 errstring
= _("no post-increment operator for type");
5948 else if (code
== PREDECREMENT_EXPR
)
5949 errstring
= _("no pre-decrement operator for type");
5951 errstring
= _("no post-decrement operator for type");
5954 else if (arg
== error_mark_node
)
5955 return error_mark_node
;
5957 /* Report something read-only. */
5959 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5960 || TREE_READONLY (arg
))
5962 if (complain
& tf_error
)
5963 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5964 || code
== POSTINCREMENT_EXPR
)
5965 ? lv_increment
: lv_decrement
));
5967 return error_mark_node
;
5972 tree declared_type
= unlowered_expr_type (arg
);
5974 argtype
= TREE_TYPE (arg
);
5976 /* ARM $5.2.5 last annotation says this should be forbidden. */
5977 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5979 if (complain
& tf_error
)
5980 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5981 ? G_("ISO C++ forbids incrementing an enum")
5982 : G_("ISO C++ forbids decrementing an enum"));
5984 return error_mark_node
;
5987 /* Compute the increment. */
5989 if (TYPE_PTR_P (argtype
))
5991 tree type
= complete_type (TREE_TYPE (argtype
));
5993 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5995 if (complain
& tf_error
)
5996 error (((code
== PREINCREMENT_EXPR
5997 || code
== POSTINCREMENT_EXPR
))
5998 ? G_("cannot increment a pointer to incomplete type %qT")
5999 : G_("cannot decrement a pointer to incomplete type %qT"),
6000 TREE_TYPE (argtype
));
6002 return error_mark_node
;
6004 else if (!TYPE_PTROB_P (argtype
))
6006 if (complain
& tf_error
)
6007 pedwarn (input_location
, OPT_Wpointer_arith
,
6008 (code
== PREINCREMENT_EXPR
6009 || code
== POSTINCREMENT_EXPR
)
6010 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6011 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6014 return error_mark_node
;
6017 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6020 inc
= VECTOR_TYPE_P (argtype
)
6021 ? build_one_cst (argtype
)
6024 inc
= cp_convert (argtype
, inc
, complain
);
6026 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6027 need to ask Objective-C to build the increment or decrement
6028 expression for it. */
6029 if (objc_is_property_ref (arg
))
6030 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6033 /* Complain about anything else that is not a true lvalue. */
6034 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6035 || code
== POSTINCREMENT_EXPR
)
6036 ? lv_increment
: lv_decrement
),
6038 return error_mark_node
;
6040 /* Forbid using -- or ++ in C++17 on `bool'. */
6041 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6043 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6045 if (complain
& tf_error
)
6046 error ("use of an operand of type %qT in %<operator--%> "
6047 "is forbidden", boolean_type_node
);
6048 return error_mark_node
;
6052 if (cxx_dialect
>= cxx1z
)
6054 if (complain
& tf_error
)
6055 error ("use of an operand of type %qT in "
6056 "%<operator++%> is forbidden in C++1z",
6058 return error_mark_node
;
6060 /* Otherwise, [depr.incr.bool] says this is deprecated. */
6061 else if (!in_system_header_at (input_location
))
6062 warning (OPT_Wdeprecated
, "use of an operand of type %qT "
6063 "in %<operator++%> is deprecated",
6066 val
= boolean_increment (code
, arg
);
6068 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6069 /* An rvalue has no cv-qualifiers. */
6070 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6072 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6074 TREE_SIDE_EFFECTS (val
) = 1;
6079 /* Note that this operation never does default_conversion
6080 regardless of NOCONVERT. */
6081 return cp_build_addr_expr (arg
, complain
);
6090 argtype
= TREE_TYPE (arg
);
6091 return build1 (code
, argtype
, arg
);
6094 if (complain
& tf_error
)
6095 error ("%s", errstring
);
6096 return error_mark_node
;
6099 /* Hook for the c-common bits that build a unary op. */
6101 build_unary_op (location_t
/*location*/,
6102 enum tree_code code
, tree xarg
, bool noconvert
)
6104 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6107 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6108 for certain kinds of expressions which are not really lvalues
6109 but which we can accept as lvalues.
6111 If ARG is not a kind of expression we can handle, return
6115 unary_complex_lvalue (enum tree_code code
, tree arg
)
6117 /* Inside a template, making these kinds of adjustments is
6118 pointless; we are only concerned with the type of the
6120 if (processing_template_decl
)
6123 /* Handle (a, b) used as an "lvalue". */
6124 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6126 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
6127 tf_warning_or_error
);
6128 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6129 TREE_OPERAND (arg
, 0), real_result
);
6132 /* Handle (a ? b : c) used as an "lvalue". */
6133 if (TREE_CODE (arg
) == COND_EXPR
6134 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6135 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6137 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6138 if (TREE_CODE (arg
) == MODIFY_EXPR
6139 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6140 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6142 tree lvalue
= TREE_OPERAND (arg
, 0);
6143 if (TREE_SIDE_EFFECTS (lvalue
))
6145 lvalue
= cp_stabilize_reference (lvalue
);
6146 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6147 lvalue
, TREE_OPERAND (arg
, 1));
6149 return unary_complex_lvalue
6150 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6153 if (code
!= ADDR_EXPR
)
6156 /* Handle (a = b) used as an "lvalue" for `&'. */
6157 if (TREE_CODE (arg
) == MODIFY_EXPR
6158 || TREE_CODE (arg
) == INIT_EXPR
)
6160 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
6161 tf_warning_or_error
);
6162 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6164 TREE_NO_WARNING (arg
) = 1;
6168 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6169 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6170 || TREE_CODE (arg
) == OFFSET_REF
)
6173 /* We permit compiler to make function calls returning
6174 objects of aggregate type look like lvalues. */
6178 if (TREE_CODE (targ
) == SAVE_EXPR
)
6179 targ
= TREE_OPERAND (targ
, 0);
6181 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6183 if (TREE_CODE (arg
) == SAVE_EXPR
)
6186 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6187 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6190 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6191 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6192 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6195 /* Don't let anything else be handled specially. */
6199 /* Mark EXP saying that we need to be able to take the
6200 address of it; it should not be allocated in a register.
6201 Value is true if successful.
6203 C++: we do not allow `current_class_ptr' to be addressable. */
6206 cxx_mark_addressable (tree exp
)
6211 switch (TREE_CODE (x
))
6218 x
= TREE_OPERAND (x
, 0);
6222 if (x
== current_class_ptr
)
6224 error ("cannot take the address of %<this%>, which is an rvalue expression");
6225 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6231 /* Caller should not be trying to mark initialized
6232 constant fields addressable. */
6233 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6234 || DECL_IN_AGGR_P (x
) == 0
6236 || DECL_EXTERNAL (x
));
6240 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6241 && !DECL_ARTIFICIAL (x
))
6243 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6246 ("address of explicit register variable %qD requested", x
);
6249 else if (extra_warnings
)
6251 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6253 TREE_ADDRESSABLE (x
) = 1;
6258 TREE_ADDRESSABLE (x
) = 1;
6262 TREE_ADDRESSABLE (x
) = 1;
6266 TREE_ADDRESSABLE (x
) = 1;
6267 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6275 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6278 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6279 tsubst_flags_t complain
)
6281 tree orig_ifexp
= ifexp
;
6282 tree orig_op1
= op1
;
6283 tree orig_op2
= op2
;
6286 if (processing_template_decl
)
6288 /* The standard says that the expression is type-dependent if
6289 IFEXP is type-dependent, even though the eventual type of the
6290 expression doesn't dependent on IFEXP. */
6291 if (type_dependent_expression_p (ifexp
)
6292 /* As a GNU extension, the middle operand may be omitted. */
6293 || (op1
&& type_dependent_expression_p (op1
))
6294 || type_dependent_expression_p (op2
))
6295 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6296 ifexp
= build_non_dependent_expr (ifexp
);
6298 op1
= build_non_dependent_expr (op1
);
6299 op2
= build_non_dependent_expr (op2
);
6302 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6303 if (processing_template_decl
&& expr
!= error_mark_node
)
6305 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6306 orig_ifexp
, orig_op1
, orig_op2
);
6307 /* Remember that the result is an lvalue or xvalue. */
6308 if (glvalue_p (expr
) && !glvalue_p (min
))
6309 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6311 expr
= convert_from_reference (min
);
6316 /* Given a list of expressions, return a compound expression
6317 that performs them all and returns the value of the last of them. */
6320 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6321 tsubst_flags_t complain
)
6323 tree expr
= TREE_VALUE (list
);
6325 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6326 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6328 if (complain
& tf_error
)
6329 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6330 "list-initializer for non-class type must not "
6331 "be parenthesized");
6333 return error_mark_node
;
6336 if (TREE_CHAIN (list
))
6338 if (complain
& tf_error
)
6342 permerror (input_location
, "expression list treated as compound "
6343 "expression in initializer");
6346 permerror (input_location
, "expression list treated as compound "
6347 "expression in mem-initializer");
6350 permerror (input_location
, "expression list treated as compound "
6351 "expression in functional cast");
6357 return error_mark_node
;
6359 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6360 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6361 expr
, TREE_VALUE (list
), complain
);
6367 /* Like build_x_compound_expr_from_list, but using a VEC. */
6370 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6371 tsubst_flags_t complain
)
6373 if (vec_safe_is_empty (vec
))
6375 else if (vec
->length () == 1)
6385 if (complain
& tf_error
)
6386 permerror (input_location
,
6387 "%s expression list treated as compound expression",
6390 return error_mark_node
;
6394 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6395 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6402 /* Handle overloading of the ',' operator when needed. */
6405 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6406 tsubst_flags_t complain
)
6409 tree orig_op1
= op1
;
6410 tree orig_op2
= op2
;
6411 tree overload
= NULL_TREE
;
6413 if (processing_template_decl
)
6415 if (type_dependent_expression_p (op1
)
6416 || type_dependent_expression_p (op2
))
6417 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6418 op1
= build_non_dependent_expr (op1
);
6419 op2
= build_non_dependent_expr (op2
);
6422 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6423 NULL_TREE
, &overload
, complain
);
6425 result
= cp_build_compound_expr (op1
, op2
, complain
);
6427 if (processing_template_decl
&& result
!= error_mark_node
)
6429 if (overload
!= NULL_TREE
)
6430 return (build_min_non_dep_op_overload
6431 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6433 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6439 /* Like cp_build_compound_expr, but for the c-common bits. */
6442 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6444 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6447 /* Build a compound expression. */
6450 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6452 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6454 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6455 return error_mark_node
;
6458 && (TREE_CODE (lhs
) == CILK_SPAWN_STMT
6459 || TREE_CODE (rhs
) == CILK_SPAWN_STMT
))
6461 location_t loc
= (EXPR_HAS_LOCATION (lhs
) ? EXPR_LOCATION (lhs
)
6462 : EXPR_LOCATION (rhs
));
6464 "spawned function call cannot be part of a comma expression");
6465 return error_mark_node
;
6468 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6470 /* If the rhs is a TARGET_EXPR, then build the compound
6471 expression inside the target_expr's initializer. This
6472 helps the compiler to eliminate unnecessary temporaries. */
6473 tree init
= TREE_OPERAND (rhs
, 1);
6475 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6476 TREE_OPERAND (rhs
, 1) = init
;
6481 if (type_unknown_p (rhs
))
6483 if (complain
& tf_error
)
6484 error ("no context to resolve type of %qE", rhs
);
6485 return error_mark_node
;
6488 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6491 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6492 casts away constness. CAST gives the type of cast. Returns true
6493 if the cast is ill-formed, false if it is well-formed.
6495 ??? This function warns for casting away any qualifier not just
6496 const. We would like to specify exactly what qualifiers are casted
6501 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6502 enum tree_code cast
, tsubst_flags_t complain
)
6504 /* C-style casts are allowed to cast away constness. With
6505 WARN_CAST_QUAL, we still want to issue a warning. */
6506 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6509 if (!casts_away_constness (src_type
, dest_type
, complain
))
6515 if (complain
& tf_warning
)
6516 warning (OPT_Wcast_qual
,
6517 "cast from type %qT to type %qT casts away qualifiers",
6518 src_type
, dest_type
);
6521 case STATIC_CAST_EXPR
:
6522 if (complain
& tf_error
)
6523 error ("static_cast from type %qT to type %qT casts away qualifiers",
6524 src_type
, dest_type
);
6527 case REINTERPRET_CAST_EXPR
:
6528 if (complain
& tf_error
)
6529 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6530 src_type
, dest_type
);
6539 Warns if the cast from expression EXPR to type TYPE is useless.
6542 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6544 if (warn_useless_cast
6545 && complain
& tf_warning
)
6547 if ((TREE_CODE (type
) == REFERENCE_TYPE
6548 && (TYPE_REF_IS_RVALUE (type
)
6549 ? xvalue_p (expr
) : lvalue_p (expr
))
6550 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6551 || same_type_p (TREE_TYPE (expr
), type
))
6552 warning (OPT_Wuseless_cast
, "useless cast to type %qT", type
);
6556 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6557 (another pointer-to-member type in the same hierarchy) and return
6558 the converted expression. If ALLOW_INVERSE_P is permitted, a
6559 pointer-to-derived may be converted to pointer-to-base; otherwise,
6560 only the other direction is permitted. If C_CAST_P is true, this
6561 conversion is taking place as part of a C-style cast. */
6564 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6565 bool c_cast_p
, tsubst_flags_t complain
)
6567 if (TYPE_PTRDATAMEM_P (type
))
6571 if (TREE_CODE (expr
) == PTRMEM_CST
)
6572 expr
= cplus_expand_constant (expr
);
6573 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6574 TYPE_PTRMEM_CLASS_TYPE (type
),
6576 c_cast_p
, complain
);
6577 if (delta
== error_mark_node
)
6578 return error_mark_node
;
6580 if (!integer_zerop (delta
))
6582 tree cond
, op1
, op2
;
6584 cond
= cp_build_binary_op (input_location
,
6587 build_int_cst (TREE_TYPE (expr
), -1),
6589 op1
= build_nop (ptrdiff_type_node
, expr
);
6590 op2
= cp_build_binary_op (input_location
,
6591 PLUS_EXPR
, op1
, delta
,
6594 expr
= fold_build3_loc (input_location
,
6595 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6599 return build_nop (type
, expr
);
6602 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6603 allow_inverse_p
, c_cast_p
, complain
);
6606 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6607 this static_cast is being attempted as one of the possible casts
6608 allowed by a C-style cast. (In that case, accessibility of base
6609 classes is not considered, and it is OK to cast away
6610 constness.) Return the result of the cast. *VALID_P is set to
6611 indicate whether or not the cast was valid. */
6614 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6615 bool *valid_p
, tsubst_flags_t complain
)
6621 /* Assume the cast is valid. */
6624 intype
= unlowered_expr_type (expr
);
6626 /* Save casted types in the function's used types hash table. */
6627 used_types_insert (type
);
6629 /* [expr.static.cast]
6631 An lvalue of type "cv1 B", where B is a class type, can be cast
6632 to type "reference to cv2 D", where D is a class derived (clause
6633 _class.derived_) from B, if a valid standard conversion from
6634 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6635 same cv-qualification as, or greater cv-qualification than, cv1,
6636 and B is not a virtual base class of D. */
6637 /* We check this case before checking the validity of "TYPE t =
6638 EXPR;" below because for this case:
6641 struct D : public B { D(const B&); };
6643 void f() { static_cast<const D&>(b); }
6645 we want to avoid constructing a new D. The standard is not
6646 completely clear about this issue, but our interpretation is
6647 consistent with other compilers. */
6648 if (TREE_CODE (type
) == REFERENCE_TYPE
6649 && CLASS_TYPE_P (TREE_TYPE (type
))
6650 && CLASS_TYPE_P (intype
)
6651 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
6652 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6653 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6654 build_pointer_type (TYPE_MAIN_VARIANT
6655 (TREE_TYPE (type
))),
6658 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6662 /* There is a standard conversion from "D*" to "B*" even if "B"
6663 is ambiguous or inaccessible. If this is really a
6664 static_cast, then we check both for inaccessibility and
6665 ambiguity. However, if this is a static_cast being performed
6666 because the user wrote a C-style cast, then accessibility is
6668 base
= lookup_base (TREE_TYPE (type
), intype
,
6669 c_cast_p
? ba_unique
: ba_check
,
6671 expr
= build_address (expr
);
6673 if (flag_sanitize
& SANITIZE_VPTR
)
6676 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6682 /* Convert from "B*" to "D*". This function will check that "B"
6683 is not a virtual base of "D". */
6684 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6687 /* Convert the pointer to a reference -- but then remember that
6688 there are no expressions with reference type in C++.
6690 We call rvalue so that there's an actual tree code
6691 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6692 is a variable with the same type, the conversion would get folded
6693 away, leaving just the variable and causing lvalue_kind to give
6694 the wrong answer. */
6695 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
6698 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6699 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6700 if (TREE_CODE (type
) == REFERENCE_TYPE
6701 && TYPE_REF_IS_RVALUE (type
)
6702 && (clk
= real_lvalue_p (expr
))
6703 && reference_related_p (TREE_TYPE (type
), intype
)
6704 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6706 if (clk
== clk_ordinary
)
6708 /* Handle the (non-bit-field) lvalue case here by casting to
6709 lvalue reference and then changing it to an rvalue reference.
6710 Casting an xvalue to rvalue reference will be handled by the
6712 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
6713 result
= (perform_direct_initialization_if_possible
6714 (lref
, expr
, c_cast_p
, complain
));
6715 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
6716 return convert_from_reference (result
);
6719 /* For a bit-field or packed field, bind to a temporary. */
6720 expr
= rvalue (expr
);
6723 /* Resolve overloaded address here rather than once in
6724 implicit_conversion and again in the inverse code below. */
6725 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
6727 expr
= instantiate_type (type
, expr
, complain
);
6728 intype
= TREE_TYPE (expr
);
6731 /* [expr.static.cast]
6733 Any expression can be explicitly converted to type cv void. */
6734 if (VOID_TYPE_P (type
))
6735 return convert_to_void (expr
, ICV_CAST
, complain
);
6738 An abstract class shall not be used ... as the type of an explicit
6740 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
6741 return error_mark_node
;
6743 /* [expr.static.cast]
6745 An expression e can be explicitly converted to a type T using a
6746 static_cast of the form static_cast<T>(e) if the declaration T
6747 t(e);" is well-formed, for some invented temporary variable
6749 result
= perform_direct_initialization_if_possible (type
, expr
,
6750 c_cast_p
, complain
);
6753 result
= convert_from_reference (result
);
6755 /* [expr.static.cast]
6757 If T is a reference type, the result is an lvalue; otherwise,
6758 the result is an rvalue. */
6759 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6761 result
= rvalue (result
);
6763 if (result
== expr
&& SCALAR_TYPE_P (type
))
6764 /* Leave some record of the cast. */
6765 result
= build_nop (type
, expr
);
6770 /* [expr.static.cast]
6772 The inverse of any standard conversion sequence (clause _conv_),
6773 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6774 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6775 (_conv.bool_) conversions, can be performed explicitly using
6776 static_cast subject to the restriction that the explicit
6777 conversion does not cast away constness (_expr.const.cast_), and
6778 the following additional rules for specific cases: */
6779 /* For reference, the conversions not excluded are: integral
6780 promotions, floating point promotion, integral conversions,
6781 floating point conversions, floating-integral conversions,
6782 pointer conversions, and pointer to member conversions. */
6785 A value of integral _or enumeration_ type can be explicitly
6786 converted to an enumeration type. */
6787 /* The effect of all that is that any conversion between any two
6788 types which are integral, floating, or enumeration types can be
6790 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6791 || SCALAR_FLOAT_TYPE_P (type
))
6792 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
6793 || SCALAR_FLOAT_TYPE_P (intype
)))
6794 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
6796 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
6797 && CLASS_TYPE_P (TREE_TYPE (type
))
6798 && CLASS_TYPE_P (TREE_TYPE (intype
))
6799 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6800 (TREE_TYPE (intype
))),
6801 build_pointer_type (TYPE_MAIN_VARIANT
6802 (TREE_TYPE (type
))),
6808 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6810 return error_mark_node
;
6811 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6812 c_cast_p
? ba_unique
: ba_check
,
6814 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6817 if (flag_sanitize
& SANITIZE_VPTR
)
6820 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6826 return cp_fold_convert (type
, expr
);
6829 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
6830 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6837 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6838 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6840 if (TYPE_PTRDATAMEM_P (type
))
6842 t1
= (build_ptrmem_type
6844 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6845 t2
= (build_ptrmem_type
6847 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
6854 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
6857 && check_for_casting_away_constness (intype
, type
,
6860 return error_mark_node
;
6861 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
6862 c_cast_p
, complain
);
6866 /* [expr.static.cast]
6868 An rvalue of type "pointer to cv void" can be explicitly
6869 converted to a pointer to object type. A value of type pointer
6870 to object converted to "pointer to cv void" and back to the
6871 original pointer type will have its original value. */
6872 if (TYPE_PTR_P (intype
)
6873 && VOID_TYPE_P (TREE_TYPE (intype
))
6874 && TYPE_PTROB_P (type
))
6877 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6879 return error_mark_node
;
6880 return build_nop (type
, expr
);
6884 return error_mark_node
;
6887 /* Return an expression representing static_cast<TYPE>(EXPR). */
6890 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6895 if (type
== error_mark_node
|| expr
== error_mark_node
)
6896 return error_mark_node
;
6898 if (processing_template_decl
)
6900 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6901 /* We don't know if it will or will not have side effects. */
6902 TREE_SIDE_EFFECTS (expr
) = 1;
6903 return convert_from_reference (expr
);
6906 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6907 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6908 if (TREE_CODE (type
) != REFERENCE_TYPE
6909 && TREE_CODE (expr
) == NOP_EXPR
6910 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6911 expr
= TREE_OPERAND (expr
, 0);
6913 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6917 if (result
!= error_mark_node
)
6918 maybe_warn_about_useless_cast (type
, expr
, complain
);
6922 if (complain
& tf_error
)
6923 error ("invalid static_cast from type %qT to type %qT",
6924 TREE_TYPE (expr
), type
);
6925 return error_mark_node
;
6928 /* EXPR is an expression with member function or pointer-to-member
6929 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6930 not permitted by ISO C++, but we accept it in some modes. If we
6931 are not in one of those modes, issue a diagnostic. Return the
6932 converted expression. */
6935 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
6940 intype
= TREE_TYPE (expr
);
6941 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6942 || TREE_CODE (intype
) == METHOD_TYPE
);
6944 if (!(complain
& tf_warning_or_error
))
6945 return error_mark_node
;
6947 if (pedantic
|| warn_pmf2ptr
)
6948 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
6949 "converting from %qT to %qT", intype
, type
);
6951 if (TREE_CODE (intype
) == METHOD_TYPE
)
6952 expr
= build_addr_func (expr
, complain
);
6953 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6954 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6957 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6958 decl
= build_address (decl
);
6959 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
6962 if (expr
== error_mark_node
)
6963 return error_mark_node
;
6965 return build_nop (type
, expr
);
6968 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6969 If C_CAST_P is true, this reinterpret cast is being done as part of
6970 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6971 indicate whether or not reinterpret_cast was valid. */
6974 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6975 bool *valid_p
, tsubst_flags_t complain
)
6979 /* Assume the cast is invalid. */
6983 if (type
== error_mark_node
|| error_operand_p (expr
))
6984 return error_mark_node
;
6986 intype
= TREE_TYPE (expr
);
6988 /* Save casted types in the function's used types hash table. */
6989 used_types_insert (type
);
6991 /* [expr.reinterpret.cast]
6992 An lvalue expression of type T1 can be cast to the type
6993 "reference to T2" if an expression of type "pointer to T1" can be
6994 explicitly converted to the type "pointer to T2" using a
6995 reinterpret_cast. */
6996 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6998 if (! lvalue_p (expr
))
7000 if (complain
& tf_error
)
7001 error ("invalid cast of an rvalue expression of type "
7004 return error_mark_node
;
7007 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7008 "B" are related class types; the reinterpret_cast does not
7009 adjust the pointer. */
7010 if (TYPE_PTR_P (intype
)
7011 && (complain
& tf_warning
)
7012 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7013 COMPARE_BASE
| COMPARE_DERIVED
)))
7014 warning (0, "casting %qT to %qT does not dereference pointer",
7017 expr
= cp_build_addr_expr (expr
, complain
);
7019 if (warn_strict_aliasing
> 2)
7020 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
7022 if (expr
!= error_mark_node
)
7023 expr
= build_reinterpret_cast_1
7024 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7026 if (expr
!= error_mark_node
)
7027 /* cp_build_indirect_ref isn't right for rvalue refs. */
7028 expr
= convert_from_reference (fold_convert (type
, expr
));
7032 /* As a G++ extension, we consider conversions from member
7033 functions, and pointers to member functions to
7034 pointer-to-function and pointer-to-void types. If
7035 -Wno-pmf-conversions has not been specified,
7036 convert_member_func_to_ptr will issue an error message. */
7037 if ((TYPE_PTRMEMFUNC_P (intype
)
7038 || TREE_CODE (intype
) == METHOD_TYPE
)
7039 && TYPE_PTR_P (type
)
7040 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7041 || VOID_TYPE_P (TREE_TYPE (type
))))
7042 return convert_member_func_to_ptr (type
, expr
, complain
);
7044 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7045 array-to-pointer, and function-to-pointer conversions are
7047 expr
= decay_conversion (expr
, complain
);
7049 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7050 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7051 if (TREE_CODE (expr
) == NOP_EXPR
7052 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7053 expr
= TREE_OPERAND (expr
, 0);
7055 if (error_operand_p (expr
))
7056 return error_mark_node
;
7058 intype
= TREE_TYPE (expr
);
7060 /* [expr.reinterpret.cast]
7061 A pointer can be converted to any integral type large enough to
7062 hold it. ... A value of type std::nullptr_t can be converted to
7063 an integral type; the conversion has the same meaning and
7064 validity as a conversion of (void*)0 to the integral type. */
7065 if (CP_INTEGRAL_TYPE_P (type
)
7066 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7068 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7070 if (complain
& tf_error
)
7071 permerror (input_location
, "cast from %qT to %qT loses precision",
7074 return error_mark_node
;
7076 if (NULLPTR_TYPE_P (intype
))
7077 return build_int_cst (type
, 0);
7079 /* [expr.reinterpret.cast]
7080 A value of integral or enumeration type can be explicitly
7081 converted to a pointer. */
7082 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7085 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7086 || TYPE_PTR_OR_PTRMEM_P (type
))
7087 && same_type_p (type
, intype
))
7089 return rvalue (expr
);
7090 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7091 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7092 return build_nop (type
, expr
);
7093 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7094 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7099 && check_for_casting_away_constness (intype
, type
,
7100 REINTERPRET_CAST_EXPR
,
7102 return error_mark_node
;
7103 /* Warn about possible alignment problems. */
7104 if (STRICT_ALIGNMENT
&& warn_cast_align
7105 && (complain
& tf_warning
)
7106 && !VOID_TYPE_P (type
)
7107 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7108 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7109 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7110 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
7111 warning (OPT_Wcast_align
, "cast from %qT to %qT "
7112 "increases required alignment of target type", intype
, type
);
7114 /* We need to strip nops here, because the front end likes to
7115 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
7117 if (warn_strict_aliasing
<= 2)
7118 strict_aliasing_warning (intype
, type
, sexpr
);
7120 return build_nop (type
, expr
);
7122 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7123 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7125 if (complain
& tf_warning
)
7126 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7127 object pointer type or vice versa is conditionally-supported." */
7128 warning (OPT_Wconditionally_supported
,
7129 "casting between pointer-to-function and pointer-to-object "
7130 "is conditionally-supported");
7131 return build_nop (type
, expr
);
7133 else if (VECTOR_TYPE_P (type
))
7134 return convert_to_vector (type
, expr
);
7135 else if (VECTOR_TYPE_P (intype
)
7136 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7137 return convert_to_integer_nofold (type
, expr
);
7142 if (complain
& tf_error
)
7143 error ("invalid cast from type %qT to type %qT", intype
, type
);
7144 return error_mark_node
;
7147 return cp_convert (type
, expr
, complain
);
7151 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7155 if (type
== error_mark_node
|| expr
== error_mark_node
)
7156 return error_mark_node
;
7158 if (processing_template_decl
)
7160 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7162 if (!TREE_SIDE_EFFECTS (t
)
7163 && type_dependent_expression_p (expr
))
7164 /* There might turn out to be side effects inside expr. */
7165 TREE_SIDE_EFFECTS (t
) = 1;
7166 return convert_from_reference (t
);
7169 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7170 /*valid_p=*/NULL
, complain
);
7171 if (r
!= error_mark_node
)
7172 maybe_warn_about_useless_cast (type
, expr
, complain
);
7176 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7177 return an appropriate expression. Otherwise, return
7178 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7179 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7180 performing a C-style cast, its value upon return will indicate
7181 whether or not the conversion succeeded. */
7184 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7188 tree reference_type
;
7190 /* Callers are responsible for handling error_mark_node as a
7191 destination type. */
7192 gcc_assert (dst_type
!= error_mark_node
);
7193 /* In a template, callers should be building syntactic
7194 representations of casts, not using this machinery. */
7195 gcc_assert (!processing_template_decl
);
7197 /* Assume the conversion is invalid. */
7201 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7203 if (complain
& tf_error
)
7204 error ("invalid use of const_cast with type %qT, "
7205 "which is not a pointer, "
7206 "reference, nor a pointer-to-data-member type", dst_type
);
7207 return error_mark_node
;
7210 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7212 if (complain
& tf_error
)
7213 error ("invalid use of const_cast with type %qT, which is a pointer "
7214 "or reference to a function type", dst_type
);
7215 return error_mark_node
;
7218 /* Save casted types in the function's used types hash table. */
7219 used_types_insert (dst_type
);
7221 src_type
= TREE_TYPE (expr
);
7222 /* Expressions do not really have reference types. */
7223 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7224 src_type
= TREE_TYPE (src_type
);
7226 /* [expr.const.cast]
7228 For two object types T1 and T2, if a pointer to T1 can be explicitly
7229 converted to the type "pointer to T2" using a const_cast, then the
7230 following conversions can also be made:
7232 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7233 type T2 using the cast const_cast<T2&>;
7235 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7236 type T2 using the cast const_cast<T2&&>; and
7238 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7239 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7241 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7243 reference_type
= dst_type
;
7244 if (!TYPE_REF_IS_RVALUE (dst_type
)
7250 if (complain
& tf_error
)
7251 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7252 src_type
, dst_type
);
7253 return error_mark_node
;
7255 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7256 src_type
= build_pointer_type (src_type
);
7260 reference_type
= NULL_TREE
;
7261 /* If the destination type is not a reference type, the
7262 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7263 conversions are performed. */
7264 src_type
= type_decays_to (src_type
);
7265 if (src_type
== error_mark_node
)
7266 return error_mark_node
;
7269 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7271 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7276 /* This cast is actually a C-style cast. Issue a warning if
7277 the user is making a potentially unsafe cast. */
7278 check_for_casting_away_constness (src_type
, dst_type
,
7279 CAST_EXPR
, complain
);
7283 expr
= cp_build_addr_expr (expr
, complain
);
7284 if (expr
== error_mark_node
)
7285 return error_mark_node
;
7286 expr
= build_nop (reference_type
, expr
);
7287 return convert_from_reference (expr
);
7291 expr
= decay_conversion (expr
, complain
);
7292 if (expr
== error_mark_node
)
7293 return error_mark_node
;
7295 /* build_c_cast puts on a NOP_EXPR to make the result not an
7296 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7297 non-lvalue context. */
7298 if (TREE_CODE (expr
) == NOP_EXPR
7299 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7300 expr
= TREE_OPERAND (expr
, 0);
7301 return build_nop (dst_type
, expr
);
7305 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7306 TREE_TYPE (src_type
)))
7307 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7311 if (complain
& tf_error
)
7312 error ("invalid const_cast from type %qT to type %qT",
7313 src_type
, dst_type
);
7314 return error_mark_node
;
7318 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7322 if (type
== error_mark_node
|| error_operand_p (expr
))
7323 return error_mark_node
;
7325 if (processing_template_decl
)
7327 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7329 if (!TREE_SIDE_EFFECTS (t
)
7330 && type_dependent_expression_p (expr
))
7331 /* There might turn out to be side effects inside expr. */
7332 TREE_SIDE_EFFECTS (t
) = 1;
7333 return convert_from_reference (t
);
7336 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7337 if (r
!= error_mark_node
)
7338 maybe_warn_about_useless_cast (type
, expr
, complain
);
7342 /* Like cp_build_c_cast, but for the c-common bits. */
7345 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7347 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7350 /* Like the "build_c_cast" used for c-common, but using cp_expr to
7351 preserve location information even for tree nodes that don't
7355 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
7357 cp_expr result
= cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7358 result
.set_location (loc
);
7362 /* Build an expression representing an explicit C-style cast to type
7363 TYPE of expression EXPR. */
7366 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7372 if (type
== error_mark_node
|| error_operand_p (expr
))
7373 return error_mark_node
;
7375 if (processing_template_decl
)
7377 tree t
= build_min (CAST_EXPR
, type
,
7378 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7379 /* We don't know if it will or will not have side effects. */
7380 TREE_SIDE_EFFECTS (t
) = 1;
7381 return convert_from_reference (t
);
7384 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7385 'Class') should always be retained, because this information aids
7386 in method lookup. */
7387 if (objc_is_object_ptr (type
)
7388 && objc_is_object_ptr (TREE_TYPE (expr
)))
7389 return build_nop (type
, expr
);
7391 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7392 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7393 if (TREE_CODE (type
) != REFERENCE_TYPE
7394 && TREE_CODE (value
) == NOP_EXPR
7395 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7396 value
= TREE_OPERAND (value
, 0);
7398 if (TREE_CODE (type
) == ARRAY_TYPE
)
7400 /* Allow casting from T1* to T2[] because Cfront allows it.
7401 NIHCL uses it. It is not valid ISO C++ however. */
7402 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7404 if (complain
& tf_error
)
7405 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7407 return error_mark_node
;
7408 type
= build_pointer_type (TREE_TYPE (type
));
7412 if (complain
& tf_error
)
7413 error ("ISO C++ forbids casting to an array type %qT", type
);
7414 return error_mark_node
;
7418 if (TREE_CODE (type
) == FUNCTION_TYPE
7419 || TREE_CODE (type
) == METHOD_TYPE
)
7421 if (complain
& tf_error
)
7422 error ("invalid cast to function type %qT", type
);
7423 return error_mark_node
;
7426 if (TYPE_PTR_P (type
)
7427 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7428 /* Casting to an integer of smaller size is an error detected elsewhere. */
7429 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7430 /* Don't warn about converting any constant. */
7431 && !TREE_CONSTANT (value
))
7432 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7433 "cast to pointer from integer of different size");
7435 /* A C-style cast can be a const_cast. */
7436 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7440 if (result
!= error_mark_node
)
7441 maybe_warn_about_useless_cast (type
, value
, complain
);
7445 /* Or a static cast. */
7446 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7447 &valid_p
, complain
);
7448 /* Or a reinterpret_cast. */
7450 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7451 &valid_p
, complain
);
7452 /* The static_cast or reinterpret_cast may be followed by a
7455 /* A valid cast may result in errors if, for example, a
7456 conversion to an ambiguous base class is required. */
7457 && !error_operand_p (result
))
7461 maybe_warn_about_useless_cast (type
, value
, complain
);
7463 /* Non-class rvalues always have cv-unqualified type. */
7464 if (!CLASS_TYPE_P (type
))
7465 type
= TYPE_MAIN_VARIANT (type
);
7466 result_type
= TREE_TYPE (result
);
7467 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
7468 result_type
= TYPE_MAIN_VARIANT (result_type
);
7469 /* If the type of RESULT does not match TYPE, perform a
7470 const_cast to make it match. If the static_cast or
7471 reinterpret_cast succeeded, we will differ by at most
7472 cv-qualification, so the follow-on const_cast is guaranteed
7474 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7476 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7477 gcc_assert (valid_p
);
7482 return error_mark_node
;
7485 /* For use from the C common bits. */
7487 build_modify_expr (location_t location
,
7488 tree lhs
, tree
/*lhs_origtype*/,
7489 enum tree_code modifycode
,
7490 location_t
/*rhs_location*/, tree rhs
,
7491 tree
/*rhs_origtype*/)
7493 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
7494 tf_warning_or_error
);
7497 /* Build an assignment expression of lvalue LHS from value RHS.
7498 MODIFYCODE is the code for a binary operator that we use
7499 to combine the old value of LHS with RHS to get the new value.
7500 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7502 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7505 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7506 tree rhs
, tsubst_flags_t complain
)
7510 tree lhstype
= TREE_TYPE (lhs
);
7511 tree olhstype
= lhstype
;
7512 bool plain_assign
= (modifycode
== NOP_EXPR
);
7514 /* Avoid duplicate error messages from operands that had errors. */
7515 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7516 return error_mark_node
;
7518 /* Handle control structure constructs used as "lvalues". Note that we
7519 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
7520 switch (TREE_CODE (lhs
))
7522 /* Handle --foo = 5; as these are valid constructs in C++. */
7523 case PREDECREMENT_EXPR
:
7524 case PREINCREMENT_EXPR
:
7525 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7526 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7527 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7528 TREE_OPERAND (lhs
, 1));
7529 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7533 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7534 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7535 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7536 TREE_OPERAND (lhs
, 1));
7537 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7542 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7543 when neither operand has side-effects. */
7544 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7545 return error_mark_node
;
7547 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7548 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7550 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7551 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7553 TREE_OPERAND (lhs
, 0),
7554 TREE_OPERAND (lhs
, 1)),
7555 TREE_OPERAND (lhs
, 0),
7556 TREE_OPERAND (lhs
, 1));
7559 /* Handle (a ? b : c) used as an "lvalue". */
7562 /* Produce (a ? (b = rhs) : (c = rhs))
7563 except that the RHS goes through a save-expr
7564 so the code to compute it is only emitted once. */
7566 tree preeval
= NULL_TREE
;
7568 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7570 if (complain
& tf_error
)
7571 error ("void value not ignored as it ought to be");
7572 return error_mark_node
;
7575 rhs
= stabilize_expr (rhs
, &preeval
);
7577 /* Check this here to avoid odd errors when trying to convert
7578 a throw to the type of the COND_EXPR. */
7579 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7580 return error_mark_node
;
7582 cond
= build_conditional_expr
7583 (input_location
, TREE_OPERAND (lhs
, 0),
7584 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7585 modifycode
, rhs
, complain
),
7586 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7587 modifycode
, rhs
, complain
),
7590 if (cond
== error_mark_node
)
7592 /* Make sure the code to compute the rhs comes out
7593 before the split. */
7595 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
7603 if (modifycode
== INIT_EXPR
)
7605 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7606 /* Do the default thing. */;
7607 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
7609 /* Compound literal. */
7610 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
7611 /* Call convert to generate an error; see PR 11063. */
7612 rhs
= convert (lhstype
, rhs
);
7613 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
7614 TREE_SIDE_EFFECTS (result
) = 1;
7617 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
7618 /* Do the default thing. */;
7621 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
7622 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
7623 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
7625 release_tree_vector (rhs_vec
);
7626 if (result
== NULL_TREE
)
7627 return error_mark_node
;
7633 lhs
= require_complete_type_sfinae (lhs
, complain
);
7634 if (lhs
== error_mark_node
)
7635 return error_mark_node
;
7637 if (modifycode
== NOP_EXPR
)
7639 if (c_dialect_objc ())
7641 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
7646 /* `operator=' is not an inheritable operator. */
7647 if (! MAYBE_CLASS_TYPE_P (lhstype
))
7648 /* Do the default thing. */;
7651 result
= build_new_op (input_location
, MODIFY_EXPR
,
7652 LOOKUP_NORMAL
, lhs
, rhs
,
7653 make_node (NOP_EXPR
), /*overload=*/NULL
,
7655 if (result
== NULL_TREE
)
7656 return error_mark_node
;
7663 tree init
= NULL_TREE
;
7665 /* A binary op has been requested. Combine the old LHS
7666 value with the RHS producing the value we should actually
7667 store into the LHS. */
7668 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
7669 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
7670 || MAYBE_CLASS_TYPE_P (lhstype
)));
7672 /* Preevaluate the RHS to make sure its evaluation is complete
7673 before the lvalue-to-rvalue conversion of the LHS:
7675 [expr.ass] With respect to an indeterminately-sequenced
7676 function call, the operation of a compound assignment is a
7677 single evaluation. [ Note: Therefore, a function call shall
7678 not intervene between the lvalue-to-rvalue conversion and the
7679 side effect associated with any single compound assignment
7680 operator. -- end note ] */
7681 lhs
= cp_stabilize_reference (lhs
);
7683 rhs
= stabilize_expr (rhs
, &init
);
7684 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
7685 if (newrhs
== error_mark_node
)
7687 if (complain
& tf_error
)
7688 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
7689 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
7690 return error_mark_node
;
7694 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
7696 /* Now it looks like a plain assignment. */
7697 modifycode
= NOP_EXPR
;
7698 if (c_dialect_objc ())
7700 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
7705 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
7706 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
7709 /* The left-hand side must be an lvalue. */
7710 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7711 return error_mark_node
;
7713 /* Warn about modifying something that is `const'. Don't warn if
7714 this is initialization. */
7715 if (modifycode
!= INIT_EXPR
7716 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
7717 /* Functions are not modifiable, even though they are
7719 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
7720 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
7721 /* If it's an aggregate and any field is const, then it is
7722 effectively const. */
7723 || (CLASS_TYPE_P (lhstype
)
7724 && C_TYPE_FIELDS_READONLY (lhstype
))))
7726 if (complain
& tf_error
)
7727 cxx_readonly_error (lhs
, lv_assign
);
7729 return error_mark_node
;
7732 /* If storing into a structure or union member, it may have been given a
7733 lowered bitfield type. We need to convert to the declared type first,
7734 so retrieve it now. */
7736 olhstype
= unlowered_expr_type (lhs
);
7738 /* Convert new value to destination type. */
7740 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
7744 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
7746 if (modifycode
!= INIT_EXPR
)
7748 if (complain
& tf_error
)
7749 error ("assigning to an array from an initializer list");
7750 return error_mark_node
;
7752 if (check_array_initializer (lhs
, lhstype
, newrhs
))
7753 return error_mark_node
;
7754 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7755 if (newrhs
== error_mark_node
)
7756 return error_mark_node
;
7759 /* C++11 8.5/17: "If the destination type is an array of characters,
7760 an array of char16_t, an array of char32_t, or an array of wchar_t,
7761 and the initializer is a string literal...". */
7762 else if (TREE_CODE (newrhs
) == STRING_CST
7763 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
7764 && modifycode
== INIT_EXPR
)
7766 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7767 if (newrhs
== error_mark_node
)
7768 return error_mark_node
;
7771 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
7772 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
7774 if (complain
& tf_error
)
7775 error ("incompatible types in assignment of %qT to %qT",
7776 TREE_TYPE (rhs
), lhstype
);
7777 return error_mark_node
;
7780 /* Allow array assignment in compiler-generated code. */
7781 else if (!current_function_decl
7782 || !DECL_DEFAULTED_FN (current_function_decl
))
7784 /* This routine is used for both initialization and assignment.
7785 Make sure the diagnostic message differentiates the context. */
7786 if (complain
& tf_error
)
7788 if (modifycode
== INIT_EXPR
)
7789 error ("array used as initializer");
7791 error ("invalid array assignment");
7793 return error_mark_node
;
7796 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
7797 ? 1 + (modifycode
!= INIT_EXPR
): 0;
7798 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
7799 /*explicit_value_init_p=*/false,
7800 from_array
, complain
);
7803 if (modifycode
== INIT_EXPR
)
7804 /* Calls with INIT_EXPR are all direct-initialization, so don't set
7805 LOOKUP_ONLYCONVERTING. */
7806 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
7807 ICR_INIT
, NULL_TREE
, 0,
7810 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
7811 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
7813 if (!same_type_p (lhstype
, olhstype
))
7814 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
7816 if (modifycode
!= INIT_EXPR
)
7818 if (TREE_CODE (newrhs
) == CALL_EXPR
7819 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
7820 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
7822 /* Can't initialize directly from a TARGET_EXPR, since that would
7823 cause the lhs to be constructed twice, and possibly result in
7824 accidental self-initialization. So we force the TARGET_EXPR to be
7825 expanded without a target. */
7826 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
7827 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
7828 TREE_OPERAND (newrhs
, 0));
7831 if (newrhs
== error_mark_node
)
7832 return error_mark_node
;
7834 if (c_dialect_objc () && flag_objc_gc
)
7836 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
7842 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
7843 lhstype
, lhs
, newrhs
);
7845 TREE_SIDE_EFFECTS (result
) = 1;
7847 TREE_NO_WARNING (result
) = 1;
7853 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7854 tree rhs
, tsubst_flags_t complain
)
7856 tree orig_lhs
= lhs
;
7857 tree orig_rhs
= rhs
;
7858 tree overload
= NULL_TREE
;
7859 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
7861 if (processing_template_decl
)
7863 if (modifycode
== NOP_EXPR
7864 || type_dependent_expression_p (lhs
)
7865 || type_dependent_expression_p (rhs
))
7866 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
7867 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
7870 lhs
= build_non_dependent_expr (lhs
);
7871 rhs
= build_non_dependent_expr (rhs
);
7874 if (modifycode
!= NOP_EXPR
)
7876 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
7877 lhs
, rhs
, op
, &overload
, complain
);
7880 if (rval
== error_mark_node
)
7882 TREE_NO_WARNING (rval
) = 1;
7883 if (processing_template_decl
)
7885 if (overload
!= NULL_TREE
)
7886 return (build_min_non_dep_op_overload
7887 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
7889 return (build_min_non_dep
7890 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
7895 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
7898 /* Helper function for get_delta_difference which assumes FROM is a base
7899 class of TO. Returns a delta for the conversion of pointer-to-member
7900 of FROM to pointer-to-member of TO. If the conversion is invalid and
7901 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
7902 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
7903 If C_CAST_P is true, this conversion is taking place as part of a
7907 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
7908 tsubst_flags_t complain
)
7913 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
7916 if (binfo
== error_mark_node
)
7918 if (!(complain
& tf_error
))
7919 return error_mark_node
;
7921 error (" in pointer to member function conversion");
7922 return size_zero_node
;
7926 if (kind
!= bk_via_virtual
)
7927 return BINFO_OFFSET (binfo
);
7929 /* FROM is a virtual base class of TO. Issue an error or warning
7930 depending on whether or not this is a reinterpret cast. */
7932 if (!(complain
& tf_error
))
7933 return error_mark_node
;
7935 error ("pointer to member conversion via virtual base %qT",
7936 BINFO_TYPE (binfo_from_vbase (binfo
)));
7938 return size_zero_node
;
7945 /* Get difference in deltas for different pointer to member function
7946 types. If the conversion is invalid and tf_error is not set in
7947 COMPLAIN, returns error_mark_node, otherwise returns an integer
7948 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7949 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7950 conversions as well. If C_CAST_P is true this conversion is taking
7951 place as part of a C-style cast.
7953 Note that the naming of FROM and TO is kind of backwards; the return
7954 value is what we add to a TO in order to get a FROM. They are named
7955 this way because we call this function to find out how to convert from
7956 a pointer to member of FROM to a pointer to member of TO. */
7959 get_delta_difference (tree from
, tree to
,
7960 bool allow_inverse_p
,
7961 bool c_cast_p
, tsubst_flags_t complain
)
7965 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
7966 /* Pointer to member of incomplete class is permitted*/
7967 result
= size_zero_node
;
7969 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
7971 if (result
== error_mark_node
)
7972 return error_mark_node
;
7976 if (!allow_inverse_p
)
7978 if (!(complain
& tf_error
))
7979 return error_mark_node
;
7981 error_not_base_type (from
, to
);
7982 error (" in pointer to member conversion");
7983 result
= size_zero_node
;
7987 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
7989 if (result
== error_mark_node
)
7990 return error_mark_node
;
7993 result
= size_diffop_loc (input_location
,
7994 size_zero_node
, result
);
7997 if (!(complain
& tf_error
))
7998 return error_mark_node
;
8000 error_not_base_type (from
, to
);
8001 error (" in pointer to member conversion");
8002 result
= size_zero_node
;
8007 return convert_to_integer (ptrdiff_type_node
, result
);
8010 /* Return a constructor for the pointer-to-member-function TYPE using
8011 the other components as specified. */
8014 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8019 vec
<constructor_elt
, va_gc
> *v
;
8021 /* Pull the FIELD_DECLs out of the type. */
8022 pfn_field
= TYPE_FIELDS (type
);
8023 delta_field
= DECL_CHAIN (pfn_field
);
8025 /* Make sure DELTA has the type we want. */
8026 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8028 /* Convert to the correct target type if necessary. */
8029 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8031 /* Finish creating the initializer. */
8033 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8034 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8035 u
= build_constructor (type
, v
);
8036 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8037 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8038 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8040 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8045 /* Build a constructor for a pointer to member function. It can be
8046 used to initialize global variables, local variable, or used
8047 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8050 If FORCE is nonzero, then force this conversion, even if
8051 we would rather not do it. Usually set when using an explicit
8052 cast. A C-style cast is being processed iff C_CAST_P is true.
8054 Return error_mark_node, if something goes wrong. */
8057 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8058 tsubst_flags_t complain
)
8064 if (error_operand_p (pfn
))
8065 return error_mark_node
;
8067 pfn_type
= TREE_TYPE (pfn
);
8068 to_type
= build_ptrmemfunc_type (type
);
8070 /* Handle multiple conversions of pointer to member functions. */
8071 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8073 tree delta
= NULL_TREE
;
8074 tree npfn
= NULL_TREE
;
8078 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8079 LOOKUP_NORMAL
, complain
))
8081 if (complain
& tf_error
)
8082 error ("invalid conversion to type %qT from type %qT",
8085 return error_mark_node
;
8088 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8089 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8091 c_cast_p
, complain
);
8092 if (n
== error_mark_node
)
8093 return error_mark_node
;
8095 /* We don't have to do any conversion to convert a
8096 pointer-to-member to its own type. But, we don't want to
8097 just return a PTRMEM_CST if there's an explicit cast; that
8098 cast should make the expression an invalid template argument. */
8099 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8101 if (same_type_p (to_type
, pfn_type
))
8103 else if (integer_zerop (n
))
8104 return build_reinterpret_cast (to_type
, pfn
,
8108 if (TREE_SIDE_EFFECTS (pfn
))
8109 pfn
= save_expr (pfn
);
8111 /* Obtain the function pointer and the current DELTA. */
8112 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8113 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8116 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8117 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8120 /* Just adjust the DELTA field. */
8121 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8122 (TREE_TYPE (delta
), ptrdiff_type_node
));
8123 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8124 n
= cp_build_binary_op (input_location
,
8125 LSHIFT_EXPR
, n
, integer_one_node
,
8127 delta
= cp_build_binary_op (input_location
,
8128 PLUS_EXPR
, delta
, n
, complain
);
8129 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8132 /* Handle null pointer to member function conversions. */
8133 if (null_ptr_cst_p (pfn
))
8135 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8136 return build_ptrmemfunc1 (to_type
,
8141 if (type_unknown_p (pfn
))
8142 return instantiate_type (type
, pfn
, complain
);
8144 fn
= TREE_OPERAND (pfn
, 0);
8145 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8146 /* In a template, we will have preserved the
8148 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8149 return make_ptrmem_cst (to_type
, fn
);
8152 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8155 ??? There is no consistency as to the types returned for the above
8156 values. Some code acts as if it were a sizetype and some as if it were
8157 integer_type_node. */
8160 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8162 tree type
= TREE_TYPE (cst
);
8163 tree fn
= PTRMEM_CST_MEMBER (cst
);
8164 tree ptr_class
, fn_class
;
8166 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8168 /* The class that the function belongs to. */
8169 fn_class
= DECL_CONTEXT (fn
);
8171 /* The class that we're creating a pointer to member of. */
8172 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8174 /* First, calculate the adjustment to the function's class. */
8175 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8176 /*c_cast_p=*/0, tf_warning_or_error
);
8178 if (!DECL_VIRTUAL_P (fn
))
8179 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8180 build_addr_func (fn
, tf_warning_or_error
));
8183 /* If we're dealing with a virtual function, we have to adjust 'this'
8184 again, to point to the base which provides the vtable entry for
8185 fn; the call will do the opposite adjustment. */
8186 tree orig_class
= DECL_CONTEXT (fn
);
8187 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8188 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8189 *delta
, BINFO_OFFSET (binfo
));
8191 /* We set PFN to the vtable offset at which the function can be
8192 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8193 case delta is shifted left, and then incremented). */
8194 *pfn
= DECL_VINDEX (fn
);
8195 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8196 TYPE_SIZE_UNIT (vtable_entry_type
));
8198 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8200 case ptrmemfunc_vbit_in_pfn
:
8201 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8205 case ptrmemfunc_vbit_in_delta
:
8206 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8207 *delta
, integer_one_node
);
8208 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8209 *delta
, integer_one_node
);
8216 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8220 /* Return an expression for PFN from the pointer-to-member function
8224 pfn_from_ptrmemfunc (tree t
)
8226 if (TREE_CODE (t
) == PTRMEM_CST
)
8231 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8236 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8239 /* Return an expression for DELTA from the pointer-to-member function
8243 delta_from_ptrmemfunc (tree t
)
8245 if (TREE_CODE (t
) == PTRMEM_CST
)
8250 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8255 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8258 /* Convert value RHS to type TYPE as preparation for an assignment to
8259 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8260 implicit conversion is. If FNDECL is non-NULL, we are doing the
8261 conversion in order to pass the PARMNUMth argument of FNDECL.
8262 If FNDECL is NULL, we are doing the conversion in function pointer
8263 argument passing, conversion in initialization, etc. */
8266 convert_for_assignment (tree type
, tree rhs
,
8267 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8268 tsubst_flags_t complain
, int flags
)
8271 enum tree_code coder
;
8273 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8274 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8275 rhs
= TREE_OPERAND (rhs
, 0);
8277 /* Handle [dcl.init.list] direct-list-initialization from
8278 single element of enumeration with a fixed underlying type. */
8279 if (is_direct_enum_init (type
, rhs
))
8281 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
8282 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
8283 rhs
= cp_build_c_cast (type
, elt
, complain
);
8285 rhs
= error_mark_node
;
8288 rhstype
= TREE_TYPE (rhs
);
8289 coder
= TREE_CODE (rhstype
);
8291 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8292 && vector_types_convertible_p (type
, rhstype
, true))
8294 rhs
= mark_rvalue_use (rhs
);
8295 return convert (type
, rhs
);
8298 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8299 return error_mark_node
;
8300 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8301 return error_mark_node
;
8303 /* The RHS of an assignment cannot have void type. */
8304 if (coder
== VOID_TYPE
)
8306 if (complain
& tf_error
)
8307 error ("void value not ignored as it ought to be");
8308 return error_mark_node
;
8311 if (c_dialect_objc ())
8315 tree rname
= fndecl
;
8326 selector
= objc_message_selector ();
8328 if (selector
&& parmno
> 1)
8335 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8337 rhs
= mark_rvalue_use (rhs
);
8338 return convert (type
, rhs
);
8344 The expression is implicitly converted (clause _conv_) to the
8345 cv-unqualified type of the left operand.
8347 We allow bad conversions here because by the time we get to this point
8348 we are committed to doing the conversion. If we end up doing a bad
8349 conversion, convert_like will complain. */
8350 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8352 /* When -Wno-pmf-conversions is use, we just silently allow
8353 conversions from pointers-to-members to plain pointers. If
8354 the conversion doesn't work, cp_convert will complain. */
8356 && TYPE_PTR_P (type
)
8357 && TYPE_PTRMEMFUNC_P (rhstype
))
8358 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8361 if (complain
& tf_error
)
8363 /* If the right-hand side has unknown type, then it is an
8364 overloaded function. Call instantiate_type to get error
8366 if (rhstype
== unknown_type_node
)
8367 instantiate_type (type
, rhs
, tf_warning_or_error
);
8369 error ("cannot convert %qT to %qT for argument %qP to %qD",
8370 rhstype
, type
, parmnum
, fndecl
);
8374 case ICR_DEFAULT_ARGUMENT
:
8375 error ("cannot convert %qT to %qT in default argument",
8379 error ("cannot convert %qT to %qT in argument passing",
8382 case ICR_CONVERTING
:
8383 error ("cannot convert %qT to %qT",
8387 error ("cannot convert %qT to %qT in initialization",
8391 error ("cannot convert %qT to %qT in return",
8395 error ("cannot convert %qT to %qT in assignment",
8401 if (TYPE_PTR_P (rhstype
)
8402 && TYPE_PTR_P (type
)
8403 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8404 && CLASS_TYPE_P (TREE_TYPE (type
))
8405 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8406 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8407 (TREE_TYPE (rhstype
))),
8408 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8410 return error_mark_node
;
8413 if (warn_suggest_attribute_format
)
8415 const enum tree_code codel
= TREE_CODE (type
);
8416 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8418 && check_missing_format_attribute (type
, rhstype
)
8419 && (complain
& tf_warning
))
8423 case ICR_DEFAULT_ARGUMENT
:
8425 warning (OPT_Wsuggest_attribute_format
,
8426 "parameter %qP of %qD might be a candidate "
8427 "for a format attribute", parmnum
, fndecl
);
8429 warning (OPT_Wsuggest_attribute_format
,
8430 "parameter might be a candidate "
8431 "for a format attribute");
8433 case ICR_CONVERTING
:
8434 warning (OPT_Wsuggest_attribute_format
,
8435 "target of conversion might be a candidate "
8436 "for a format attribute");
8439 warning (OPT_Wsuggest_attribute_format
,
8440 "target of initialization might be a candidate "
8441 "for a format attribute");
8444 warning (OPT_Wsuggest_attribute_format
,
8445 "return type might be a candidate "
8446 "for a format attribute");
8449 warning (OPT_Wsuggest_attribute_format
,
8450 "left-hand side of assignment might be a candidate "
8451 "for a format attribute");
8458 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8460 if (warn_parentheses
8461 && TREE_CODE (type
) == BOOLEAN_TYPE
8462 && TREE_CODE (rhs
) == MODIFY_EXPR
8463 && !TREE_NO_WARNING (rhs
)
8464 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8465 && (complain
& tf_warning
))
8467 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8469 warning_at (loc
, OPT_Wparentheses
,
8470 "suggest parentheses around assignment used as truth value");
8471 TREE_NO_WARNING (rhs
) = 1;
8474 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8478 /* Convert RHS to be of type TYPE.
8479 If EXP is nonzero, it is the target of the initialization.
8480 ERRTYPE indicates what kind of error the implicit conversion is.
8482 Two major differences between the behavior of
8483 `convert_for_assignment' and `convert_for_initialization'
8484 are that references are bashed in the former, while
8485 copied in the latter, and aggregates are assigned in
8486 the former (operator=) while initialized in the
8489 If using constructor make sure no conversion operator exists, if one does
8490 exist, an ambiguity exists. */
8493 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8494 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8495 tsubst_flags_t complain
)
8497 enum tree_code codel
= TREE_CODE (type
);
8499 enum tree_code coder
;
8501 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8502 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8503 if (TREE_CODE (rhs
) == NOP_EXPR
8504 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8505 && codel
!= REFERENCE_TYPE
)
8506 rhs
= TREE_OPERAND (rhs
, 0);
8508 if (type
== error_mark_node
8509 || rhs
== error_mark_node
8510 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8511 return error_mark_node
;
8513 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8515 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8516 && TREE_CODE (type
) != ARRAY_TYPE
8517 && (TREE_CODE (type
) != REFERENCE_TYPE
8518 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8519 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8520 && !TYPE_REFFN_P (type
))
8521 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8522 rhs
= decay_conversion (rhs
, complain
);
8524 rhstype
= TREE_TYPE (rhs
);
8525 coder
= TREE_CODE (rhstype
);
8527 if (coder
== ERROR_MARK
)
8528 return error_mark_node
;
8530 /* We accept references to incomplete types, so we can
8531 return here before checking if RHS is of complete type. */
8533 if (codel
== REFERENCE_TYPE
)
8535 /* This should eventually happen in convert_arguments. */
8536 int savew
= 0, savee
= 0;
8539 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8540 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8543 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8544 inform (DECL_SOURCE_LOCATION (fndecl
),
8545 "in passing argument %P of %qD", parmnum
, fndecl
);
8551 exp
= require_complete_type_sfinae (exp
, complain
);
8552 if (exp
== error_mark_node
)
8553 return error_mark_node
;
8555 rhstype
= non_reference (rhstype
);
8557 type
= complete_type (type
);
8559 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8560 /* Don't try to do copy-initialization if we already have
8561 direct-initialization. */
8564 if (MAYBE_CLASS_TYPE_P (type
))
8565 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8567 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8571 /* If RETVAL is the address of, or a reference to, a local variable or
8572 temporary give an appropriate warning and return true. */
8575 maybe_warn_about_returning_address_of_local (tree retval
)
8577 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8578 tree whats_returned
= retval
;
8582 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
8583 whats_returned
= TREE_OPERAND (whats_returned
, 1);
8584 else if (CONVERT_EXPR_P (whats_returned
)
8585 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
8586 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8591 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
8593 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8595 while (TREE_CODE (whats_returned
) == COMPONENT_REF
8596 || TREE_CODE (whats_returned
) == ARRAY_REF
)
8597 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8599 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8601 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
8602 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
8604 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
8607 if (VAR_P (whats_returned
)
8608 && DECL_NAME (whats_returned
)
8609 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
8611 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
8616 if (DECL_P (whats_returned
)
8617 && DECL_NAME (whats_returned
)
8618 && DECL_FUNCTION_SCOPE_P (whats_returned
)
8619 && !is_capture_proxy (whats_returned
)
8620 && !(TREE_STATIC (whats_returned
)
8621 || TREE_PUBLIC (whats_returned
)))
8623 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8624 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8625 OPT_Wreturn_local_addr
,
8626 "reference to local variable %qD returned",
8628 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
8629 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8630 OPT_Wreturn_local_addr
, "address of label %qD returned",
8633 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8634 OPT_Wreturn_local_addr
, "address of local variable %qD "
8635 "returned", whats_returned
);
8642 /* Check that returning RETVAL from the current function is valid.
8643 Return an expression explicitly showing all conversions required to
8644 change RETVAL into the function return type, and to assign it to
8645 the DECL_RESULT for the function. Set *NO_WARNING to true if
8646 code reaches end of non-void function warning shouldn't be issued
8647 on this RETURN_EXPR. */
8650 check_return_expr (tree retval
, bool *no_warning
)
8653 /* The type actually returned by the function. */
8655 /* The type the function is declared to return, or void if
8656 the declared type is incomplete. */
8658 int fn_returns_value_p
;
8659 bool named_return_value_okay_p
;
8661 *no_warning
= false;
8663 if (flag_cilkplus
&& retval
&& contains_cilk_spawn_stmt (retval
))
8665 error_at (EXPR_LOCATION (retval
), "use of %<_Cilk_spawn%> in a return "
8666 "statement is not allowed");
8670 /* A `volatile' function is one that isn't supposed to return, ever.
8671 (This is a G++ extension, used to get better code for functions
8672 that call the `volatile' function.) */
8673 if (TREE_THIS_VOLATILE (current_function_decl
))
8674 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8676 /* Check for various simple errors. */
8677 if (DECL_DESTRUCTOR_P (current_function_decl
))
8680 error ("returning a value from a destructor");
8683 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
8685 if (in_function_try_handler
)
8686 /* If a return statement appears in a handler of the
8687 function-try-block of a constructor, the program is ill-formed. */
8688 error ("cannot return from a handler of a function-try-block of a constructor");
8690 /* You can't return a value from a constructor. */
8691 error ("returning a value from a constructor");
8695 const tree saved_retval
= retval
;
8697 if (processing_template_decl
)
8699 current_function_returns_value
= 1;
8701 if (check_for_bare_parameter_packs (retval
))
8702 return error_mark_node
;
8704 if (WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
8705 || (retval
!= NULL_TREE
8706 && type_dependent_expression_p (retval
)))
8710 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
8712 /* Deduce auto return type from a return statement. */
8713 if (current_function_auto_return_pattern
)
8718 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
8720 /* Give a helpful error message. */
8721 error ("return-statement with no value, in function returning %qT",
8722 current_function_auto_return_pattern
);
8723 inform (input_location
, "only plain %<auto%> return type can be "
8724 "deduced to %<void%>");
8725 type
= error_mark_node
;
8727 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
8729 error ("returning initializer list");
8730 type
= error_mark_node
;
8736 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
8737 type
= do_auto_deduction (current_function_auto_return_pattern
,
8741 if (type
== error_mark_node
)
8743 else if (functype
== current_function_auto_return_pattern
)
8744 apply_deduced_return_type (current_function_decl
, type
);
8745 else if (!same_type_p (type
, functype
))
8747 if (LAMBDA_FUNCTION_P (current_function_decl
))
8748 error ("inconsistent types %qT and %qT deduced for "
8749 "lambda return type", functype
, type
);
8751 error ("inconsistent deduction for auto return type: "
8752 "%qT and then %qT", functype
, type
);
8757 result
= DECL_RESULT (current_function_decl
);
8758 valtype
= TREE_TYPE (result
);
8759 gcc_assert (valtype
!= NULL_TREE
);
8760 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
8762 /* Check for a return statement with no return value in a function
8763 that's supposed to return a value. */
8764 if (!retval
&& fn_returns_value_p
)
8766 if (functype
!= error_mark_node
)
8767 permerror (input_location
, "return-statement with no value, in "
8768 "function returning %qT", valtype
);
8769 /* Remember that this function did return. */
8770 current_function_returns_value
= 1;
8771 /* And signal caller that TREE_NO_WARNING should be set on the
8772 RETURN_EXPR to avoid control reaches end of non-void function
8773 warnings in tree-cfg.c. */
8776 /* Check for a return statement with a value in a function that
8777 isn't supposed to return a value. */
8778 else if (retval
&& !fn_returns_value_p
)
8780 if (VOID_TYPE_P (TREE_TYPE (retval
)))
8781 /* You can return a `void' value from a function of `void'
8782 type. In that case, we have to evaluate the expression for
8783 its side-effects. */
8784 finish_expr_stmt (retval
);
8786 permerror (input_location
, "return-statement with a value, in function "
8787 "returning 'void'");
8788 current_function_returns_null
= 1;
8790 /* There's really no value to return, after all. */
8794 /* Remember that this function can sometimes return without a
8796 current_function_returns_null
= 1;
8798 /* Remember that this function did return a value. */
8799 current_function_returns_value
= 1;
8801 /* Check for erroneous operands -- but after giving ourselves a
8802 chance to provide an error about returning a value from a void
8804 if (error_operand_p (retval
))
8806 current_function_return_value
= error_mark_node
;
8807 return error_mark_node
;
8810 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
8811 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
8812 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
8813 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
8815 && retval
&& null_ptr_cst_p (retval
))
8816 warning (0, "%<operator new%> must not return NULL unless it is "
8817 "declared %<throw()%> (or -fcheck-new is in effect)");
8819 /* Effective C++ rule 15. See also start_function. */
8821 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
8825 /* The function return type must be a reference to the current
8827 if (TREE_CODE (valtype
) == REFERENCE_TYPE
8828 && same_type_ignoring_top_level_qualifiers_p
8829 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
8831 /* Returning '*this' is obviously OK. */
8832 if (retval
== current_class_ref
)
8834 /* If we are calling a function whose return type is the same of
8835 the current class reference, it is ok. */
8836 else if (INDIRECT_REF_P (retval
)
8837 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
8842 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
8845 if (processing_template_decl
)
8847 /* We should not have changed the return value. */
8848 gcc_assert (retval
== saved_retval
);
8852 /* The fabled Named Return Value optimization, as per [class.copy]/15:
8854 [...] For a function with a class return type, if the expression
8855 in the return statement is the name of a local object, and the cv-
8856 unqualified type of the local object is the same as the function
8857 return type, an implementation is permitted to omit creating the tem-
8858 porary object to hold the function return value [...]
8860 So, if this is a value-returning function that always returns the same
8861 local variable, remember it.
8863 It might be nice to be more flexible, and choose the first suitable
8864 variable even if the function sometimes returns something else, but
8865 then we run the risk of clobbering the variable we chose if the other
8866 returned expression uses the chosen variable somehow. And people expect
8867 this restriction, anyway. (jason 2000-11-19)
8869 See finish_function and finalize_nrv for the rest of this optimization. */
8871 named_return_value_okay_p
=
8872 (retval
!= NULL_TREE
8873 /* Must be a local, automatic variable. */
8875 && DECL_CONTEXT (retval
) == current_function_decl
8876 && ! TREE_STATIC (retval
)
8877 /* And not a lambda or anonymous union proxy. */
8878 && !DECL_HAS_VALUE_EXPR_P (retval
)
8879 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
8880 /* The cv-unqualified type of the returned value must be the
8881 same as the cv-unqualified return type of the
8883 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
8884 (TYPE_MAIN_VARIANT (functype
)))
8885 /* And the returned value must be non-volatile. */
8886 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
8888 if (fn_returns_value_p
&& flag_elide_constructors
)
8890 if (named_return_value_okay_p
8891 && (current_function_return_value
== NULL_TREE
8892 || current_function_return_value
== retval
))
8893 current_function_return_value
= retval
;
8895 current_function_return_value
= error_mark_node
;
8898 /* We don't need to do any conversions when there's nothing being
8903 /* Do any required conversions. */
8904 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
8905 /* No conversions are required. */
8909 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
8911 /* The functype's return type will have been set to void, if it
8912 was an incomplete type. Just treat this as 'return;' */
8913 if (VOID_TYPE_P (functype
))
8914 return error_mark_node
;
8916 /* If we had an id-expression obfuscated by force_paren_expr, we need
8917 to undo it so we can try to treat it as an rvalue below. */
8918 retval
= maybe_undo_parenthesized_ref (retval
);
8920 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
8921 treated as an rvalue for the purposes of overload resolution to
8922 favor move constructors over copy constructors.
8924 Note that these conditions are similar to, but not as strict as,
8925 the conditions for the named return value optimization. */
8926 if ((cxx_dialect
!= cxx98
)
8927 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
8928 || TREE_CODE (retval
) == PARM_DECL
)
8929 && DECL_CONTEXT (retval
) == current_function_decl
8930 && !TREE_STATIC (retval
)
8931 /* This is only interesting for class type. */
8932 && CLASS_TYPE_P (functype
))
8933 flags
= flags
| LOOKUP_PREFER_RVALUE
;
8935 /* First convert the value to the function's return type, then
8936 to the type of return value's location to handle the
8937 case that functype is smaller than the valtype. */
8938 retval
= convert_for_initialization
8939 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
8940 tf_warning_or_error
);
8941 retval
= convert (valtype
, retval
);
8943 /* If the conversion failed, treat this just like `return;'. */
8944 if (retval
== error_mark_node
)
8946 /* We can't initialize a register from a AGGR_INIT_EXPR. */
8947 else if (! cfun
->returns_struct
8948 && TREE_CODE (retval
) == TARGET_EXPR
8949 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
8950 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8951 TREE_OPERAND (retval
, 0));
8952 else if (maybe_warn_about_returning_address_of_local (retval
))
8953 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8954 build_zero_cst (TREE_TYPE (retval
)));
8957 /* Actually copy the value returned into the appropriate location. */
8958 if (retval
&& retval
!= result
)
8959 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
8965 /* Returns nonzero if the pointer-type FROM can be converted to the
8966 pointer-type TO via a qualification conversion. If CONSTP is -1,
8967 then we return nonzero if the pointers are similar, and the
8968 cv-qualification signature of FROM is a proper subset of that of TO.
8970 If CONSTP is positive, then all outer pointers have been
8974 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
8976 bool to_more_cv_qualified
= false;
8977 bool is_opaque_pointer
= false;
8979 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8981 if (TREE_CODE (to
) != TREE_CODE (from
))
8984 if (TREE_CODE (from
) == OFFSET_TYPE
8985 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
8986 TYPE_OFFSET_BASETYPE (to
)))
8989 /* Const and volatile mean something different for function types,
8990 so the usual checks are not appropriate. */
8991 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
8993 if (!at_least_as_qualified_p (to
, from
))
8996 if (!at_least_as_qualified_p (from
, to
))
9000 to_more_cv_qualified
= true;
9004 constp
&= TYPE_READONLY (to
);
9007 if (VECTOR_TYPE_P (to
))
9008 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9010 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9011 return ((constp
>= 0 || to_more_cv_qualified
)
9012 && (is_opaque_pointer
9013 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9017 /* When comparing, say, char ** to char const **, this function takes
9018 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9019 types to this function. */
9022 comp_ptr_ttypes (tree to
, tree from
)
9024 return comp_ptr_ttypes_real (to
, from
, 1);
9027 /* Returns true iff FNTYPE is a non-class type that involves
9028 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9029 if a parameter type is ill-formed. */
9032 error_type_p (const_tree type
)
9036 switch (TREE_CODE (type
))
9042 case REFERENCE_TYPE
:
9044 return error_type_p (TREE_TYPE (type
));
9048 if (error_type_p (TREE_TYPE (type
)))
9050 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9051 if (error_type_p (TREE_VALUE (t
)))
9056 if (TYPE_PTRMEMFUNC_P (type
))
9057 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9065 /* Returns true if to and from are (possibly multi-level) pointers to the same
9066 type or inheritance-related types, regardless of cv-quals. */
9069 ptr_reasonably_similar (const_tree to
, const_tree from
)
9071 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9073 /* Any target type is similar enough to void. */
9074 if (VOID_TYPE_P (to
))
9075 return !error_type_p (from
);
9076 if (VOID_TYPE_P (from
))
9077 return !error_type_p (to
);
9079 if (TREE_CODE (to
) != TREE_CODE (from
))
9082 if (TREE_CODE (from
) == OFFSET_TYPE
9083 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9084 TYPE_OFFSET_BASETYPE (from
),
9085 COMPARE_BASE
| COMPARE_DERIVED
))
9088 if (VECTOR_TYPE_P (to
)
9089 && vector_types_convertible_p (to
, from
, false))
9092 if (TREE_CODE (to
) == INTEGER_TYPE
9093 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9096 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9097 return !error_type_p (to
) && !error_type_p (from
);
9099 if (!TYPE_PTR_P (to
))
9101 /* When either type is incomplete avoid DERIVED_FROM_P,
9102 which may call complete_type (c++/57942). */
9103 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9105 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9106 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9111 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9112 pointer-to-member types) are the same, ignoring cv-qualification at
9116 comp_ptr_ttypes_const (tree to
, tree from
)
9118 bool is_opaque_pointer
= false;
9120 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9122 if (TREE_CODE (to
) != TREE_CODE (from
))
9125 if (TREE_CODE (from
) == OFFSET_TYPE
9126 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9127 TYPE_OFFSET_BASETYPE (to
)))
9130 if (VECTOR_TYPE_P (to
))
9131 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9133 if (!TYPE_PTR_P (to
))
9134 return (is_opaque_pointer
9135 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9139 /* Returns the type qualifiers for this type, including the qualifiers on the
9140 elements for an array type. */
9143 cp_type_quals (const_tree type
)
9146 /* This CONST_CAST is okay because strip_array_types returns its
9147 argument unmodified and we assign it to a const_tree. */
9148 type
= strip_array_types (CONST_CAST_TREE (type
));
9149 if (type
== error_mark_node
9150 /* Quals on a FUNCTION_TYPE are memfn quals. */
9151 || TREE_CODE (type
) == FUNCTION_TYPE
)
9152 return TYPE_UNQUALIFIED
;
9153 quals
= TYPE_QUALS (type
);
9154 /* METHOD and REFERENCE_TYPEs should never have quals. */
9155 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9156 && TREE_CODE (type
) != REFERENCE_TYPE
)
9157 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9158 == TYPE_UNQUALIFIED
));
9162 /* Returns the function-ref-qualifier for TYPE */
9165 type_memfn_rqual (const_tree type
)
9167 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9168 || TREE_CODE (type
) == METHOD_TYPE
);
9170 if (!FUNCTION_REF_QUALIFIED (type
))
9171 return REF_QUAL_NONE
;
9172 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9173 return REF_QUAL_RVALUE
;
9175 return REF_QUAL_LVALUE
;
9178 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9182 type_memfn_quals (const_tree type
)
9184 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9185 return TYPE_QUALS (type
);
9186 else if (TREE_CODE (type
) == METHOD_TYPE
)
9187 return cp_type_quals (class_of_this_parm (type
));
9192 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9193 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9196 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9198 /* Could handle METHOD_TYPE here if necessary. */
9199 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9200 if (TYPE_QUALS (type
) == memfn_quals
9201 && type_memfn_rqual (type
) == rqual
)
9204 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9206 tree result
= build_qualified_type (type
, memfn_quals
);
9207 if (tree canon
= TYPE_CANONICAL (result
))
9208 if (canon
!= result
)
9209 /* check_qualified_type doesn't check the ref-qualifier, so make sure
9210 TYPE_CANONICAL is correct. */
9211 TYPE_CANONICAL (result
)
9212 = build_ref_qualified_type (canon
, type_memfn_rqual (result
));
9213 result
= build_exception_variant (result
, TYPE_RAISES_EXCEPTIONS (type
));
9214 return build_ref_qualified_type (result
, rqual
);
9217 /* Returns nonzero if TYPE is const or volatile. */
9220 cv_qualified_p (const_tree type
)
9222 int quals
= cp_type_quals (type
);
9223 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9226 /* Returns nonzero if the TYPE contains a mutable member. */
9229 cp_has_mutable_p (const_tree type
)
9231 /* This CONST_CAST is okay because strip_array_types returns its
9232 argument unmodified and we assign it to a const_tree. */
9233 type
= strip_array_types (CONST_CAST_TREE(type
));
9235 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9238 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9239 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9240 approximation. In particular, consider:
9243 struct S { int i; };
9244 const S s = { f(); }
9246 Here, we will make "s" as TREE_READONLY (because it is declared
9247 "const") -- only to reverse ourselves upon seeing that the
9248 initializer is non-constant. */
9251 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9253 tree type
= TREE_TYPE (decl
);
9255 if (type
== error_mark_node
)
9258 if (TREE_CODE (decl
) == TYPE_DECL
)
9261 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9262 && type_quals
!= TYPE_UNQUALIFIED
));
9264 /* Avoid setting TREE_READONLY incorrectly. */
9265 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9266 constructor can produce constant init, so rely on cp_finish_decl to
9267 clear TREE_READONLY if the variable has non-constant init. */
9269 /* If the type has (or might have) a mutable component, that component
9270 might be modified. */
9271 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9272 type_quals
&= ~TYPE_QUAL_CONST
;
9274 c_apply_type_quals_to_decl (type_quals
, decl
);
9277 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9278 exemplar types such that casting T1 to T2 is casting away constness
9279 if and only if there is no implicit conversion from T1 to T2. */
9282 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9287 /* [expr.const.cast]
9289 For multi-level pointer to members and multi-level mixed pointers
9290 and pointers to members (conv.qual), the "member" aspect of a
9291 pointer to member level is ignored when determining if a const
9292 cv-qualifier has been cast away. */
9293 /* [expr.const.cast]
9295 For two pointer types:
9297 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9298 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9301 casting from X1 to X2 casts away constness if, for a non-pointer
9302 type T there does not exist an implicit conversion (clause
9305 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9309 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9310 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9311 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9313 *t1
= cp_build_qualified_type (void_type_node
,
9314 cp_type_quals (*t1
));
9315 *t2
= cp_build_qualified_type (void_type_node
,
9316 cp_type_quals (*t2
));
9320 quals1
= cp_type_quals (*t1
);
9321 quals2
= cp_type_quals (*t2
);
9323 if (TYPE_PTRDATAMEM_P (*t1
))
9324 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9326 *t1
= TREE_TYPE (*t1
);
9327 if (TYPE_PTRDATAMEM_P (*t2
))
9328 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9330 *t2
= TREE_TYPE (*t2
);
9332 casts_away_constness_r (t1
, t2
, complain
);
9333 *t1
= build_pointer_type (*t1
);
9334 *t2
= build_pointer_type (*t2
);
9335 *t1
= cp_build_qualified_type (*t1
, quals1
);
9336 *t2
= cp_build_qualified_type (*t2
, quals2
);
9339 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9342 ??? This function returns non-zero if casting away qualifiers not
9343 just const. We would like to return to the caller exactly which
9344 qualifiers are casted away to give more accurate diagnostics.
9348 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9350 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9352 /* [expr.const.cast]
9354 Casting from an lvalue of type T1 to an lvalue of type T2
9355 using a reference cast casts away constness if a cast from an
9356 rvalue of type "pointer to T1" to the type "pointer to T2"
9357 casts away constness. */
9358 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9359 return casts_away_constness (build_pointer_type (t1
),
9360 build_pointer_type (TREE_TYPE (t2
)),
9364 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9365 /* [expr.const.cast]
9367 Casting from an rvalue of type "pointer to data member of X
9368 of type T1" to the type "pointer to data member of Y of type
9369 T2" casts away constness if a cast from an rvalue of type
9370 "pointer to T1" to the type "pointer to T2" casts away
9372 return casts_away_constness
9373 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9374 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9377 /* Casting away constness is only something that makes sense for
9378 pointer or reference types. */
9379 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9382 /* Top-level qualifiers don't matter. */
9383 t1
= TYPE_MAIN_VARIANT (t1
);
9384 t2
= TYPE_MAIN_VARIANT (t2
);
9385 casts_away_constness_r (&t1
, &t2
, complain
);
9386 if (!can_convert (t2
, t1
, complain
))
9392 /* If T is a REFERENCE_TYPE return the type to which T refers.
9393 Otherwise, return T itself. */
9396 non_reference (tree t
)
9398 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9404 /* Return nonzero if REF is an lvalue valid for this language;
9405 otherwise, print an error message and return zero. USE says
9406 how the lvalue is being used and so selects the error message. */
9409 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9411 cp_lvalue_kind kind
= lvalue_kind (ref
);
9413 if (kind
== clk_none
)
9415 if (complain
& tf_error
)
9416 lvalue_error (input_location
, use
);
9419 else if (kind
& (clk_rvalueref
|clk_class
))
9421 if (!(complain
& tf_error
))
9423 if (kind
& clk_class
)
9424 /* Make this a permerror because we used to accept it. */
9425 permerror (input_location
, "using temporary as lvalue");
9427 error ("using xvalue (rvalue reference) as lvalue");
9432 /* Return true if a user-defined literal operator is a raw operator. */
9435 check_raw_literal_operator (const_tree decl
)
9437 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9440 bool maybe_raw_p
= false;
9442 /* Count the number and type of arguments and check for ellipsis. */
9443 for (argtype
= argtypes
, arity
= 0;
9444 argtype
&& argtype
!= void_list_node
;
9445 ++arity
, argtype
= TREE_CHAIN (argtype
))
9447 tree t
= TREE_VALUE (argtype
);
9449 if (same_type_p (t
, const_string_type_node
))
9453 return false; /* Found ellipsis. */
9455 if (!maybe_raw_p
|| arity
!= 1)
9462 /* Return true if a user-defined literal operator has one of the allowed
9466 check_literal_operator_args (const_tree decl
,
9467 bool *long_long_unsigned_p
, bool *long_double_p
)
9469 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9471 *long_long_unsigned_p
= false;
9472 *long_double_p
= false;
9473 if (processing_template_decl
|| processing_specialization
)
9474 return argtypes
== void_list_node
;
9481 /* Count the number and type of arguments and check for ellipsis. */
9482 for (argtype
= argtypes
, arity
= 0;
9483 argtype
&& argtype
!= void_list_node
;
9484 argtype
= TREE_CHAIN (argtype
))
9486 tree t
= TREE_VALUE (argtype
);
9491 bool maybe_raw_p
= false;
9493 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9495 t
= TYPE_MAIN_VARIANT (t
);
9496 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9497 || same_type_p (t
, wchar_type_node
)
9498 || same_type_p (t
, char16_type_node
)
9499 || same_type_p (t
, char32_type_node
))
9501 argtype
= TREE_CHAIN (argtype
);
9504 t
= TREE_VALUE (argtype
);
9505 if (maybe_raw_p
&& argtype
== void_list_node
)
9507 else if (same_type_p (t
, size_type_node
))
9516 else if (same_type_p (t
, long_long_unsigned_type_node
))
9519 *long_long_unsigned_p
= true;
9521 else if (same_type_p (t
, long_double_type_node
))
9524 *long_double_p
= true;
9526 else if (same_type_p (t
, char_type_node
))
9528 else if (same_type_p (t
, wchar_type_node
))
9530 else if (same_type_p (t
, char16_type_node
))
9532 else if (same_type_p (t
, char32_type_node
))
9538 return false; /* Found ellipsis. */
9540 if (arity
!= max_arity
)
9547 /* Always returns false since unlike C90, C++ has no concept of implicit
9548 function declarations. */
9551 c_decl_implicit (const_tree
)