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"
40 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
41 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
42 static tree
pfn_from_ptrmemfunc (tree
);
43 static tree
delta_from_ptrmemfunc (tree
);
44 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
46 static tree
cp_pointer_int_sum (location_t
, enum tree_code
, tree
, tree
,
48 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
50 static int comp_ptr_ttypes_real (tree
, tree
, int);
51 static bool comp_except_types (tree
, tree
, bool);
52 static bool comp_array_types (const_tree
, const_tree
, bool);
53 static tree
pointer_diff (location_t
, tree
, tree
, tree
, tsubst_flags_t
);
54 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
55 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
56 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
57 static bool maybe_warn_about_returning_address_of_local (tree
);
58 static tree
lookup_destructor (tree
, tree
, tree
, tsubst_flags_t
);
59 static void error_args_num (location_t
, tree
, bool);
60 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
63 /* Do `exp = require_complete_type (exp);' to make sure exp
64 does not have an incomplete type. (That includes void types.)
65 Returns error_mark_node if the VALUE does not have
66 complete type when this function returns. */
69 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
73 if (processing_template_decl
|| value
== error_mark_node
)
76 if (TREE_CODE (value
) == OVERLOAD
)
77 type
= unknown_type_node
;
79 type
= TREE_TYPE (value
);
81 if (type
== error_mark_node
)
82 return error_mark_node
;
84 /* First, detect a valid value with a complete type. */
85 if (COMPLETE_TYPE_P (type
))
88 if (complete_type_or_maybe_complain (type
, value
, complain
))
91 return error_mark_node
;
95 require_complete_type (tree value
)
97 return require_complete_type_sfinae (value
, tf_warning_or_error
);
100 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
101 a template instantiation, do the instantiation. Returns TYPE,
102 whether or not it could be completed, unless something goes
103 horribly wrong, in which case the error_mark_node is returned. */
106 complete_type (tree type
)
108 if (type
== NULL_TREE
)
109 /* Rather than crash, we return something sure to cause an error
111 return error_mark_node
;
113 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
115 else if (TREE_CODE (type
) == ARRAY_TYPE
)
117 tree t
= complete_type (TREE_TYPE (type
));
118 unsigned int needs_constructing
, has_nontrivial_dtor
;
119 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
122 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
124 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
125 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
127 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
128 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
131 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
132 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
137 /* Like complete_type, but issue an error if the TYPE cannot be completed.
138 VALUE is used for informative diagnostics.
139 Returns NULL_TREE if the type cannot be made complete. */
142 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
144 type
= complete_type (type
);
145 if (type
== error_mark_node
)
146 /* We already issued an error. */
148 else if (!COMPLETE_TYPE_P (type
))
150 if (complain
& tf_error
)
151 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
159 complete_type_or_else (tree type
, tree value
)
161 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
164 /* Return truthvalue of whether type of EXP is instantiated. */
167 type_unknown_p (const_tree exp
)
169 return (TREE_CODE (exp
) == TREE_LIST
170 || TREE_TYPE (exp
) == unknown_type_node
);
174 /* Return the common type of two parameter lists.
175 We assume that comptypes has already been done and returned 1;
176 if that isn't so, this may crash.
178 As an optimization, free the space we allocate if the parameter
179 lists are already common. */
182 commonparms (tree p1
, tree p2
)
184 tree oldargs
= p1
, newargs
, n
;
188 len
= list_length (p1
);
189 newargs
= tree_last (p1
);
191 if (newargs
== void_list_node
)
200 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
205 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
207 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
209 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
212 else if (! TREE_PURPOSE (p1
))
214 if (TREE_PURPOSE (p2
))
216 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
222 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
224 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
226 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
229 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
232 TREE_VALUE (n
) = TREE_VALUE (p1
);
240 /* Given a type, perhaps copied for a typedef,
241 find the "original" version of it. */
243 original_type (tree t
)
245 int quals
= cp_type_quals (t
);
246 while (t
!= error_mark_node
247 && TYPE_NAME (t
) != NULL_TREE
)
249 tree x
= TYPE_NAME (t
);
250 if (TREE_CODE (x
) != TYPE_DECL
)
252 x
= DECL_ORIGINAL_TYPE (x
);
257 return cp_build_qualified_type (t
, quals
);
260 /* Return the common type for two arithmetic types T1 and T2 under the
261 usual arithmetic conversions. The default conversions have already
262 been applied, and enumerated types converted to their compatible
266 cp_common_type (tree t1
, tree t2
)
268 enum tree_code code1
= TREE_CODE (t1
);
269 enum tree_code code2
= TREE_CODE (t2
);
274 /* In what follows, we slightly generalize the rules given in [expr] so
275 as to deal with `long long' and `complex'. First, merge the
277 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
279 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
281 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
282 return build_type_attribute_variant (t1
, attributes
);
287 /* FIXME: Attributes. */
288 gcc_assert (ARITHMETIC_TYPE_P (t1
)
289 || VECTOR_TYPE_P (t1
)
290 || UNSCOPED_ENUM_P (t1
));
291 gcc_assert (ARITHMETIC_TYPE_P (t2
)
292 || VECTOR_TYPE_P (t2
)
293 || UNSCOPED_ENUM_P (t2
));
295 /* If one type is complex, form the common type of the non-complex
296 components, then make that complex. Use T1 or T2 if it is the
298 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
300 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
301 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
303 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
305 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
306 return build_type_attribute_variant (t1
, attributes
);
307 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
308 return build_type_attribute_variant (t2
, attributes
);
310 return build_type_attribute_variant (build_complex_type (subtype
),
314 if (code1
== VECTOR_TYPE
)
316 /* When we get here we should have two vectors of the same size.
317 Just prefer the unsigned one if present. */
318 if (TYPE_UNSIGNED (t1
))
319 return build_type_attribute_variant (t1
, attributes
);
321 return build_type_attribute_variant (t2
, attributes
);
324 /* If only one is real, use it as the result. */
325 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
326 return build_type_attribute_variant (t1
, attributes
);
327 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
328 return build_type_attribute_variant (t2
, attributes
);
330 /* Both real or both integers; use the one with greater precision. */
331 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
332 return build_type_attribute_variant (t1
, attributes
);
333 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
334 return build_type_attribute_variant (t2
, attributes
);
336 /* The types are the same; no need to do anything fancy. */
337 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
338 return build_type_attribute_variant (t1
, attributes
);
340 if (code1
!= REAL_TYPE
)
342 /* If one is unsigned long long, then convert the other to unsigned
344 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
345 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
346 return build_type_attribute_variant (long_long_unsigned_type_node
,
348 /* If one is a long long, and the other is an unsigned long, and
349 long long can represent all the values of an unsigned long, then
350 convert to a long long. Otherwise, convert to an unsigned long
351 long. Otherwise, if either operand is long long, convert the
354 Since we're here, we know the TYPE_PRECISION is the same;
355 therefore converting to long long cannot represent all the values
356 of an unsigned long, so we choose unsigned long long in that
358 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
359 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
361 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
362 ? long_long_unsigned_type_node
363 : long_long_integer_type_node
);
364 return build_type_attribute_variant (t
, attributes
);
367 /* Go through the same procedure, but for longs. */
368 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
369 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
370 return build_type_attribute_variant (long_unsigned_type_node
,
372 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
373 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
375 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
376 ? long_unsigned_type_node
: long_integer_type_node
);
377 return build_type_attribute_variant (t
, attributes
);
380 /* For __intN types, either the type is __int128 (and is lower
381 priority than the types checked above, but higher than other
382 128-bit types) or it's known to not be the same size as other
383 types (enforced in toplev.c). Prefer the unsigned type. */
384 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
386 if (int_n_enabled_p
[i
]
387 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
388 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
389 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
390 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
392 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
393 ? int_n_trees
[i
].unsigned_type
394 : int_n_trees
[i
].signed_type
);
395 return build_type_attribute_variant (t
, attributes
);
399 /* Otherwise prefer the unsigned one. */
400 if (TYPE_UNSIGNED (t1
))
401 return build_type_attribute_variant (t1
, attributes
);
403 return build_type_attribute_variant (t2
, attributes
);
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
409 return build_type_attribute_variant (long_double_type_node
,
411 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
412 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
413 return build_type_attribute_variant (double_type_node
,
415 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
416 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
417 return build_type_attribute_variant (float_type_node
,
420 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
421 the standard C++ floating-point types. Logic earlier in this
422 function has already eliminated the possibility that
423 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
424 compelling reason to choose one or the other. */
425 return build_type_attribute_variant (t1
, attributes
);
429 /* T1 and T2 are arithmetic or enumeration types. Return the type
430 that will result from the "usual arithmetic conversions" on T1 and
431 T2 as described in [expr]. */
434 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
436 gcc_assert (ARITHMETIC_TYPE_P (t1
)
437 || VECTOR_TYPE_P (t1
)
438 || UNSCOPED_ENUM_P (t1
));
439 gcc_assert (ARITHMETIC_TYPE_P (t2
)
440 || VECTOR_TYPE_P (t2
)
441 || UNSCOPED_ENUM_P (t2
));
443 /* Perform the integral promotions. We do not promote real types here. */
444 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
445 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
447 t1
= type_promotes_to (t1
);
448 t2
= type_promotes_to (t2
);
451 return cp_common_type (t1
, t2
);
455 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
456 composite_pointer_operation operation
)
461 emit_diagnostic (kind
, input_location
, 0,
462 "comparison between "
463 "distinct pointer types %qT and %qT lacks a cast",
467 emit_diagnostic (kind
, input_location
, 0,
468 "conversion between "
469 "distinct pointer types %qT and %qT lacks a cast",
472 case CPO_CONDITIONAL_EXPR
:
473 emit_diagnostic (kind
, input_location
, 0,
474 "conditional expression between "
475 "distinct pointer types %qT and %qT lacks a cast",
483 /* Subroutine of composite_pointer_type to implement the recursive
484 case. See that function for documentation of the parameters. */
487 composite_pointer_type_r (tree t1
, tree t2
,
488 composite_pointer_operation operation
,
489 tsubst_flags_t complain
)
496 /* Determine the types pointed to by T1 and T2. */
499 pointee1
= TREE_TYPE (t1
);
500 pointee2
= TREE_TYPE (t2
);
504 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
505 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
510 Otherwise, the composite pointer type is a pointer type
511 similar (_conv.qual_) to the type of one of the operands,
512 with a cv-qualification signature (_conv.qual_) that is the
513 union of the cv-qualification signatures of the operand
515 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
516 result_type
= pointee1
;
517 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
518 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
520 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
522 if (result_type
== error_mark_node
)
523 return error_mark_node
;
527 if (complain
& tf_error
)
528 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
530 return error_mark_node
;
531 result_type
= void_type_node
;
533 result_type
= cp_build_qualified_type (result_type
,
534 (cp_type_quals (pointee1
)
535 | cp_type_quals (pointee2
)));
536 /* If the original types were pointers to members, so is the
538 if (TYPE_PTRMEM_P (t1
))
540 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
541 TYPE_PTRMEM_CLASS_TYPE (t2
)))
543 if (complain
& tf_error
)
544 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
546 return error_mark_node
;
548 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
552 result_type
= build_pointer_type (result_type
);
554 /* Merge the attributes. */
555 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
556 return build_type_attribute_variant (result_type
, attributes
);
559 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
560 ARG1 and ARG2 are the values with those types. The OPERATION is to
561 describe the operation between the pointer types,
562 in case an error occurs.
564 This routine also implements the computation of a common type for
565 pointers-to-members as per [expr.eq]. */
568 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
569 composite_pointer_operation operation
,
570 tsubst_flags_t complain
)
577 If one operand is a null pointer constant, the composite pointer
578 type is the type of the other operand. */
579 if (null_ptr_cst_p (arg1
))
581 if (null_ptr_cst_p (arg2
))
588 If one of the operands has type "pointer to cv1 void*", then
589 the other has type "pointer to cv2T", and the composite pointer
590 type is "pointer to cv12 void", where cv12 is the union of cv1
593 If either type is a pointer to void, make sure it is T1. */
594 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
597 /* Now, if T1 is a pointer to void, merge the qualifiers. */
598 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
603 if (TYPE_PTRFN_P (t2
))
605 if (complain
& tf_error
)
610 pedwarn (input_location
, OPT_Wpedantic
,
611 "ISO C++ forbids comparison between pointer "
612 "of type %<void *%> and pointer-to-function");
615 pedwarn (input_location
, OPT_Wpedantic
,
616 "ISO C++ forbids conversion between pointer "
617 "of type %<void *%> and pointer-to-function");
619 case CPO_CONDITIONAL_EXPR
:
620 pedwarn (input_location
, OPT_Wpedantic
,
621 "ISO C++ forbids conditional expression between "
622 "pointer of type %<void *%> and "
623 "pointer-to-function");
630 return error_mark_node
;
633 = cp_build_qualified_type (void_type_node
,
634 (cp_type_quals (TREE_TYPE (t1
))
635 | cp_type_quals (TREE_TYPE (t2
))));
636 result_type
= build_pointer_type (result_type
);
637 /* Merge the attributes. */
638 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
639 return build_type_attribute_variant (result_type
, attributes
);
642 if (c_dialect_objc () && TYPE_PTR_P (t1
)
645 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
646 return objc_common_type (t1
, t2
);
649 /* [expr.eq] permits the application of a pointer conversion to
650 bring the pointers to a common type. */
651 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
652 && CLASS_TYPE_P (TREE_TYPE (t1
))
653 && CLASS_TYPE_P (TREE_TYPE (t2
))
654 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
657 class1
= TREE_TYPE (t1
);
658 class2
= TREE_TYPE (t2
);
660 if (DERIVED_FROM_P (class1
, class2
))
661 t2
= (build_pointer_type
662 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
663 else if (DERIVED_FROM_P (class2
, class1
))
664 t1
= (build_pointer_type
665 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
668 if (complain
& tf_error
)
669 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
670 return error_mark_node
;
673 /* [expr.eq] permits the application of a pointer-to-member
674 conversion to change the class type of one of the types. */
675 else if (TYPE_PTRMEM_P (t1
)
676 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
677 TYPE_PTRMEM_CLASS_TYPE (t2
)))
679 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
680 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
682 if (DERIVED_FROM_P (class1
, class2
))
683 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
684 else if (DERIVED_FROM_P (class2
, class1
))
685 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
688 if (complain
& tf_error
)
692 error ("comparison between distinct "
693 "pointer-to-member types %qT and %qT lacks a cast",
697 error ("conversion between distinct "
698 "pointer-to-member types %qT and %qT lacks a cast",
701 case CPO_CONDITIONAL_EXPR
:
702 error ("conditional expression between distinct "
703 "pointer-to-member types %qT and %qT lacks a cast",
709 return error_mark_node
;
712 else if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
713 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (t1
))
714 && TREE_CODE (TREE_TYPE (t2
)) == TREE_CODE (TREE_TYPE (t1
)))
716 /* ...if T1 is "pointer to transaction_safe function" and T2 is "pointer
717 to function", where the function types are otherwise the same, T2, and
719 tree f1
= TREE_TYPE (t1
);
720 tree f2
= TREE_TYPE (t2
);
721 bool safe1
= tx_safe_fn_type_p (f1
);
722 bool safe2
= tx_safe_fn_type_p (f2
);
724 t1
= build_pointer_type (tx_unsafe_fn_variant (f1
));
725 else if (safe2
&& !safe1
)
726 t2
= build_pointer_type (tx_unsafe_fn_variant (f2
));
729 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
732 /* Return the merged type of two types.
733 We assume that comptypes has already been done and returned 1;
734 if that isn't so, this may crash.
736 This just combines attributes and default arguments; any other
737 differences would cause the two types to compare unalike. */
740 merge_types (tree t1
, tree t2
)
742 enum tree_code code1
;
743 enum tree_code code2
;
746 /* Save time if the two types are the same. */
749 if (original_type (t1
) == original_type (t2
))
752 /* If one type is nonsense, use the other. */
753 if (t1
== error_mark_node
)
755 if (t2
== error_mark_node
)
758 /* Handle merging an auto redeclaration with a previous deduced
763 /* Merge the attributes. */
764 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
766 if (TYPE_PTRMEMFUNC_P (t1
))
767 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
768 if (TYPE_PTRMEMFUNC_P (t2
))
769 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
771 code1
= TREE_CODE (t1
);
772 code2
= TREE_CODE (t2
);
775 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
776 if (code1
== TYPENAME_TYPE
)
778 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
779 code1
= TREE_CODE (t1
);
783 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
784 code2
= TREE_CODE (t2
);
792 /* For two pointers, do this recursively on the target type. */
794 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
795 int quals
= cp_type_quals (t1
);
797 if (code1
== POINTER_TYPE
)
799 t1
= build_pointer_type (target
);
800 if (TREE_CODE (target
) == METHOD_TYPE
)
801 t1
= build_ptrmemfunc_type (t1
);
804 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
805 t1
= build_type_attribute_variant (t1
, attributes
);
806 t1
= cp_build_qualified_type (t1
, quals
);
815 quals
= cp_type_quals (t1
);
816 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
817 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
818 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
820 t1
= cp_build_qualified_type (t1
, quals
);
826 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
827 /* Save space: see if the result is identical to one of the args. */
828 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
829 return build_type_attribute_variant (t1
, attributes
);
830 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
831 return build_type_attribute_variant (t2
, attributes
);
832 /* Merge the element types, and have a size if either arg has one. */
833 t1
= build_cplus_array_type
834 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
839 /* Function types: prefer the one that specified arg types.
840 If both do, merge the arg types. Also merge the return types. */
842 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
843 tree p1
= TYPE_ARG_TYPES (t1
);
844 tree p2
= TYPE_ARG_TYPES (t2
);
847 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
849 /* Save space: see if the result is identical to one of the args. */
850 if (valtype
== TREE_TYPE (t1
) && ! p2
)
851 return cp_build_type_attribute_variant (t1
, attributes
);
852 if (valtype
== TREE_TYPE (t2
) && ! p1
)
853 return cp_build_type_attribute_variant (t2
, attributes
);
855 /* Simple way if one arg fails to specify argument types. */
856 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
858 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
861 parms
= commonparms (p1
, p2
);
863 rval
= build_function_type (valtype
, parms
);
864 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
865 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
866 rval
= apply_memfn_quals (rval
,
867 type_memfn_quals (t1
),
868 type_memfn_rqual (t1
));
869 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
870 TYPE_RAISES_EXCEPTIONS (t2
));
871 t1
= build_exception_variant (rval
, raises
);
872 if (late_return_type_p
)
873 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
879 /* Get this value the long way, since TYPE_METHOD_BASETYPE
880 is just the main variant of this. */
881 tree basetype
= class_of_this_parm (t2
);
882 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
883 TYPE_RAISES_EXCEPTIONS (t2
));
884 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
886 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
887 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
889 /* If this was a member function type, get back to the
890 original type of type member function (i.e., without
891 the class instance variable up front. */
892 t1
= build_function_type (TREE_TYPE (t1
),
893 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
894 t2
= build_function_type (TREE_TYPE (t2
),
895 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
896 t3
= merge_types (t1
, t2
);
897 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
898 TYPE_ARG_TYPES (t3
));
899 t1
= build_exception_variant (t3
, raises
);
900 t1
= build_ref_qualified_type (t1
, rqual
);
901 if (late_return_type_1_p
)
902 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
903 if (late_return_type_2_p
)
904 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
909 /* There is no need to merge attributes into a TYPENAME_TYPE.
910 When the type is instantiated it will have whatever
911 attributes result from the instantiation. */
917 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
919 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
922 return cp_build_type_attribute_variant (t1
, attributes
);
925 /* Return the ARRAY_TYPE type without its domain. */
928 strip_array_domain (tree type
)
931 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
932 if (TYPE_DOMAIN (type
) == NULL_TREE
)
934 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
935 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
938 /* Wrapper around cp_common_type that is used by c-common.c and other
939 front end optimizations that remove promotions.
941 Return the common type for two arithmetic types T1 and T2 under the
942 usual arithmetic conversions. The default conversions have already
943 been applied, and enumerated types converted to their compatible
947 common_type (tree t1
, tree t2
)
949 /* If one type is nonsense, use the other */
950 if (t1
== error_mark_node
)
952 if (t2
== error_mark_node
)
955 return cp_common_type (t1
, t2
);
958 /* Return the common type of two pointer types T1 and T2. This is the
959 type for the result of most arithmetic operations if the operands
960 have the given two types.
962 We assume that comp_target_types has already been done and returned
963 nonzero; if that isn't so, this may crash. */
966 common_pointer_type (tree t1
, tree t2
)
968 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
969 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
970 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
972 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
973 CPO_CONVERSION
, tf_warning_or_error
);
976 /* Compare two exception specifier types for exactness or subsetness, if
977 allowed. Returns false for mismatch, true for match (same, or
980 [except.spec] "If a class X ... objects of class X or any class publicly
981 and unambiguously derived from X. Similarly, if a pointer type Y * ...
982 exceptions of type Y * or that are pointers to any type publicly and
983 unambiguously derived from Y. Otherwise a function only allows exceptions
984 that have the same type ..."
985 This does not mention cv qualifiers and is different to what throw
986 [except.throw] and catch [except.catch] will do. They will ignore the
987 top level cv qualifiers, and allow qualifiers in the pointer to class
990 We implement the letter of the standard. */
993 comp_except_types (tree a
, tree b
, bool exact
)
995 if (same_type_p (a
, b
))
999 if (cp_type_quals (a
) || cp_type_quals (b
))
1002 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
1006 if (cp_type_quals (a
) || cp_type_quals (b
))
1010 if (TREE_CODE (a
) != RECORD_TYPE
1011 || TREE_CODE (b
) != RECORD_TYPE
)
1014 if (publicly_uniquely_derived_p (a
, b
))
1020 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1021 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1022 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1023 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1024 are unordered, but we've already filtered out duplicates. Most lists will
1025 be in order, we should try to make use of that. */
1028 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1037 /* First handle noexcept. */
1038 if (exact
< ce_exact
)
1040 /* noexcept(false) is compatible with no exception-specification,
1041 and stricter than any spec. */
1042 if (t1
== noexcept_false_spec
)
1043 return t2
== NULL_TREE
|| exact
== ce_derived
;
1044 /* Even a derived noexcept(false) is compatible with no
1045 exception-specification. */
1046 if (t2
== noexcept_false_spec
)
1047 return t1
== NULL_TREE
;
1049 /* Otherwise, if we aren't looking for an exact match, noexcept is
1050 equivalent to throw(). */
1051 if (t1
== noexcept_true_spec
)
1052 t1
= empty_except_spec
;
1053 if (t2
== noexcept_true_spec
)
1054 t2
= empty_except_spec
;
1057 /* If any noexcept is left, it is only comparable to itself;
1058 either we're looking for an exact match or we're redeclaring a
1059 template with dependent noexcept. */
1060 if ((t1
&& TREE_PURPOSE (t1
))
1061 || (t2
&& TREE_PURPOSE (t2
)))
1063 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1065 if (t1
== NULL_TREE
) /* T1 is ... */
1066 return t2
== NULL_TREE
|| exact
== ce_derived
;
1067 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1068 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1069 if (t2
== NULL_TREE
) /* T2 is ... */
1071 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1072 return exact
== ce_derived
;
1074 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1075 Count how many we find, to determine exactness. For exact matching and
1076 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1078 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1080 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1082 tree a
= TREE_VALUE (probe
);
1083 tree b
= TREE_VALUE (t2
);
1085 if (comp_except_types (a
, b
, exact
))
1087 if (probe
== base
&& exact
> ce_derived
)
1088 base
= TREE_CHAIN (probe
);
1093 if (probe
== NULL_TREE
)
1096 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1099 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1100 [] can match [size]. */
1103 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1112 /* The type of the array elements must be the same. */
1113 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1116 d1
= TYPE_DOMAIN (t1
);
1117 d2
= TYPE_DOMAIN (t2
);
1122 /* If one of the arrays is dimensionless, and the other has a
1123 dimension, they are of different types. However, it is valid to
1131 declarations for an array object can specify
1132 array types that differ by the presence or absence of a major
1133 array bound (_dcl.array_). */
1135 return allow_redeclaration
;
1137 /* Check that the dimensions are the same. */
1139 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1141 max1
= TYPE_MAX_VALUE (d1
);
1142 max2
= TYPE_MAX_VALUE (d2
);
1144 if (!cp_tree_equal (max1
, max2
))
1150 /* Compare the relative position of T1 and T2 into their respective
1151 template parameter list.
1152 T1 and T2 must be template parameter types.
1153 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1156 comp_template_parms_position (tree t1
, tree t2
)
1158 tree index1
, index2
;
1159 gcc_assert (t1
&& t2
1160 && TREE_CODE (t1
) == TREE_CODE (t2
)
1161 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1162 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1163 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1165 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1166 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1168 /* Then compare their relative position. */
1169 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1170 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1171 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1172 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1175 /* In C++14 we can end up comparing 'auto' to a normal template
1176 parameter. Don't confuse them. */
1177 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1178 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1183 /* Subroutine in comptypes. */
1186 structural_comptypes (tree t1
, tree t2
, int strict
)
1191 /* Suppress errors caused by previously reported errors. */
1192 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1195 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1197 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1198 current instantiation. */
1199 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1200 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1202 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1203 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1205 if (TYPE_PTRMEMFUNC_P (t1
))
1206 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1207 if (TYPE_PTRMEMFUNC_P (t2
))
1208 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1210 /* Different classes of types can't be compatible. */
1211 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1214 /* Qualifiers must match. For array types, we will check when we
1215 recur on the array element types. */
1216 if (TREE_CODE (t1
) != ARRAY_TYPE
1217 && cp_type_quals (t1
) != cp_type_quals (t2
))
1219 if (TREE_CODE (t1
) == FUNCTION_TYPE
1220 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1222 /* Need to check this before TYPE_MAIN_VARIANT.
1223 FIXME function qualifiers should really change the main variant. */
1224 if ((TREE_CODE (t1
) == FUNCTION_TYPE
1225 || TREE_CODE (t1
) == METHOD_TYPE
)
1226 && type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1228 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1231 /* Allow for two different type nodes which have essentially the same
1232 definition. Note that we already checked for equality of the type
1233 qualifiers (just above). */
1235 if (TREE_CODE (t1
) != ARRAY_TYPE
1236 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1240 /* Compare the types. Break out if they could be the same. */
1241 switch (TREE_CODE (t1
))
1245 /* All void and bool types are the same. */
1249 case FIXED_POINT_TYPE
:
1251 /* With these nodes, we can't determine type equivalence by
1252 looking at what is stored in the nodes themselves, because
1253 two nodes might have different TYPE_MAIN_VARIANTs but still
1254 represent the same type. For example, wchar_t and int could
1255 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1256 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1257 and are distinct types. On the other hand, int and the
1260 typedef int INT __attribute((may_alias));
1262 have identical properties, different TYPE_MAIN_VARIANTs, but
1263 represent the same type. The canonical type system keeps
1264 track of equivalence in this case, so we fall back on it. */
1265 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1267 case TEMPLATE_TEMPLATE_PARM
:
1268 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1269 if (!comp_template_parms_position (t1
, t2
))
1271 if (!comp_template_parms
1272 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1273 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1275 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1277 /* Don't check inheritance. */
1278 strict
= COMPARE_STRICT
;
1283 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1284 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1285 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1286 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1289 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1291 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1297 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1298 strict
& ~COMPARE_REDECLARATION
))
1300 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1304 case REFERENCE_TYPE
:
1305 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1307 /* fall through to checks for pointer types */
1310 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1311 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1317 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1319 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1324 /* Target types must match incl. qualifiers. */
1325 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1329 case TEMPLATE_TYPE_PARM
:
1330 /* If T1 and T2 don't have the same relative position in their
1331 template parameters set, they can't be equal. */
1332 if (!comp_template_parms_position (t1
, t2
))
1334 /* Constrained 'auto's are distinct from parms that don't have the same
1336 if (!equivalent_placeholder_constraints (t1
, t2
))
1341 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1342 TYPENAME_TYPE_FULLNAME (t2
)))
1344 /* Qualifiers don't matter on scopes. */
1345 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1350 case UNBOUND_CLASS_TEMPLATE
:
1351 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1353 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1358 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1363 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1364 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1368 case TYPE_PACK_EXPANSION
:
1369 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1370 PACK_EXPANSION_PATTERN (t2
))
1371 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1372 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1375 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1376 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1377 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1378 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1379 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1380 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1381 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1382 DECLTYPE_TYPE_EXPR (t2
)))
1386 case UNDERLYING_TYPE
:
1387 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1388 UNDERLYING_TYPE_TYPE (t2
));
1394 /* If we get here, we know that from a target independent POV the
1395 types are the same. Make sure the target attributes are also
1397 return comp_type_attributes (t1
, t2
);
1400 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1401 is a bitwise-or of the COMPARE_* flags. */
1404 comptypes (tree t1
, tree t2
, int strict
)
1406 if (strict
== COMPARE_STRICT
)
1411 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1414 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1415 /* At least one of the types requires structural equality, so
1416 perform a deep check. */
1417 return structural_comptypes (t1
, t2
, strict
);
1419 if (flag_checking
&& USE_CANONICAL_TYPES
)
1421 bool result
= structural_comptypes (t1
, t2
, strict
);
1423 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1424 /* The two types are structurally equivalent, but their
1425 canonical types were different. This is a failure of the
1426 canonical type propagation code.*/
1428 ("canonical types differ for identical types %T and %T",
1430 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1431 /* Two types are structurally different, but the canonical
1432 types are the same. This means we were over-eager in
1433 assigning canonical types. */
1435 ("same canonical type node for different types %T and %T",
1440 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1441 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1443 return structural_comptypes (t1
, t2
, strict
);
1445 else if (strict
== COMPARE_STRUCTURAL
)
1446 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1448 return structural_comptypes (t1
, t2
, strict
);
1451 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1452 top-level qualifiers. */
1455 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1457 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1460 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1463 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1466 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1468 int q1
= cp_type_quals (type1
);
1469 int q2
= cp_type_quals (type2
);
1471 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1472 return (q1
& q2
) == q2
;
1475 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1476 more cv-qualified that TYPE1, and 0 otherwise. */
1479 comp_cv_qualification (int q1
, int q2
)
1484 if ((q1
& q2
) == q2
)
1486 else if ((q1
& q2
) == q1
)
1493 comp_cv_qualification (const_tree type1
, const_tree type2
)
1495 int q1
= cp_type_quals (type1
);
1496 int q2
= cp_type_quals (type2
);
1497 return comp_cv_qualification (q1
, q2
);
1500 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1501 subset of the cv-qualification signature of TYPE2, and the types
1502 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1505 comp_cv_qual_signature (tree type1
, tree type2
)
1507 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1509 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1515 /* Subroutines of `comptypes'. */
1517 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1518 equivalent in the sense that functions with those parameter types
1519 can have equivalent types. The two lists must be equivalent,
1520 element by element. */
1523 compparms (const_tree parms1
, const_tree parms2
)
1527 /* An unspecified parmlist matches any specified parmlist
1528 whose argument types don't need default promotions. */
1530 for (t1
= parms1
, t2
= parms2
;
1532 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1534 /* If one parmlist is shorter than the other,
1535 they fail to match. */
1538 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1545 /* Process a sizeof or alignof expression where the operand is a
1549 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1554 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1555 if (type
== error_mark_node
)
1556 return error_mark_node
;
1558 type
= non_reference (type
);
1559 if (TREE_CODE (type
) == METHOD_TYPE
)
1562 pedwarn (input_location
, OPT_Wpointer_arith
,
1563 "invalid application of %qs to a member function",
1564 operator_name_info
[(int) op
].name
);
1566 return error_mark_node
;
1567 value
= size_one_node
;
1570 dependent_p
= dependent_type_p (type
);
1572 complete_type (type
);
1574 /* VLA types will have a non-constant size. In the body of an
1575 uninstantiated template, we don't need to try to compute the
1576 value, because the sizeof expression is not an integral
1577 constant expression in that case. And, if we do try to
1578 compute the value, we'll likely end up with SAVE_EXPRs, which
1579 the template substitution machinery does not expect to see. */
1580 || (processing_template_decl
1581 && COMPLETE_TYPE_P (type
)
1582 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1584 value
= build_min (op
, size_type_node
, type
);
1585 TREE_READONLY (value
) = 1;
1589 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1590 op
== SIZEOF_EXPR
, false,
1594 /* Return the size of the type, without producing any warnings for
1595 types whose size cannot be taken. This routine should be used only
1596 in some other routine that has already produced a diagnostic about
1597 using the size of such a type. */
1599 cxx_sizeof_nowarn (tree type
)
1601 if (TREE_CODE (type
) == FUNCTION_TYPE
1602 || VOID_TYPE_P (type
)
1603 || TREE_CODE (type
) == ERROR_MARK
)
1604 return size_one_node
;
1605 else if (!COMPLETE_TYPE_P (type
))
1606 return size_zero_node
;
1608 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1611 /* Process a sizeof expression where the operand is an expression. */
1614 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1616 if (e
== error_mark_node
)
1617 return error_mark_node
;
1619 if (processing_template_decl
)
1621 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1622 TREE_SIDE_EFFECTS (e
) = 0;
1623 TREE_READONLY (e
) = 1;
1628 /* To get the size of a static data member declared as an array of
1629 unknown bound, we need to instantiate it. */
1631 && VAR_HAD_UNKNOWN_BOUND (e
)
1632 && DECL_TEMPLATE_INSTANTIATION (e
))
1633 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1635 if (TREE_CODE (e
) == PARM_DECL
1636 && DECL_ARRAY_PARAMETER_P (e
)
1637 && (complain
& tf_warning
))
1639 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1640 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1641 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1644 e
= mark_type_use (e
);
1646 if (TREE_CODE (e
) == COMPONENT_REF
1647 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1648 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1650 if (complain
& tf_error
)
1651 error ("invalid application of %<sizeof%> to a bit-field");
1653 return error_mark_node
;
1656 else if (is_overloaded_fn (e
))
1658 if (complain
& tf_error
)
1659 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1662 return error_mark_node
;
1665 else if (type_unknown_p (e
))
1667 if (complain
& tf_error
)
1668 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1670 return error_mark_node
;
1676 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1679 /* Implement the __alignof keyword: Return the minimum required
1680 alignment of E, measured in bytes. For VAR_DECL's and
1681 FIELD_DECL's return DECL_ALIGN (which can be set from an
1682 "aligned" __attribute__ specification). */
1685 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1689 if (e
== error_mark_node
)
1690 return error_mark_node
;
1692 if (processing_template_decl
)
1694 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1695 TREE_SIDE_EFFECTS (e
) = 0;
1696 TREE_READONLY (e
) = 1;
1701 e
= mark_type_use (e
);
1704 t
= size_int (DECL_ALIGN_UNIT (e
));
1705 else if (TREE_CODE (e
) == COMPONENT_REF
1706 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1707 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1709 if (complain
& tf_error
)
1710 error ("invalid application of %<__alignof%> to a bit-field");
1712 return error_mark_node
;
1715 else if (TREE_CODE (e
) == COMPONENT_REF
1716 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1717 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1718 else if (is_overloaded_fn (e
))
1720 if (complain
& tf_error
)
1721 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1724 return error_mark_node
;
1725 if (TREE_CODE (e
) == FUNCTION_DECL
)
1726 t
= size_int (DECL_ALIGN_UNIT (e
));
1730 else if (type_unknown_p (e
))
1732 if (complain
& tf_error
)
1733 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1735 return error_mark_node
;
1739 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1740 complain
& tf_error
);
1742 return fold_convert (size_type_node
, t
);
1745 /* Process a sizeof or alignof expression E with code OP where the operand
1746 is an expression. */
1749 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1751 if (op
== SIZEOF_EXPR
)
1752 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1754 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1757 /* Build a representation of an expression 'alignas(E).' Return the
1758 folded integer value of E if it is an integral constant expression
1759 that resolves to a valid alignment. If E depends on a template
1760 parameter, return a syntactic representation tree of kind
1761 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1762 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1765 cxx_alignas_expr (tree e
)
1767 if (e
== NULL_TREE
|| e
== error_mark_node
1768 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1774 When the alignment-specifier is of the form
1775 alignas(type-id ), it shall have the same effect as
1776 alignas(alignof(type-id )). */
1778 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1780 /* If we reach this point, it means the alignas expression if of
1781 the form "alignas(assignment-expression)", so we should follow
1782 what is stated by [dcl.align]/2. */
1784 if (value_dependent_expression_p (e
))
1785 /* Leave value-dependent expression alone for now. */
1788 e
= instantiate_non_dependent_expr (e
);
1789 e
= mark_rvalue_use (e
);
1791 /* [dcl.align]/2 says:
1793 the assignment-expression shall be an integral constant
1796 return cxx_constant_value (e
);
1800 /* EXPR is being used in a context that is not a function call.
1805 The expression can be used only as the left-hand operand of a
1806 member function call.
1808 [expr.mptr.operator]
1810 If the result of .* or ->* is a function, then that result can be
1811 used only as the operand for the function call operator ().
1813 by issuing an error message if appropriate. Returns true iff EXPR
1814 violates these rules. */
1817 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1819 if (expr
== NULL_TREE
)
1821 /* Don't enforce this in MS mode. */
1822 if (flag_ms_extensions
)
1824 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1825 expr
= get_first_fn (expr
);
1826 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1828 if (complain
& tf_error
)
1832 error_at (loc
, "invalid use of non-static member function %qD",
1834 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1837 error_at (loc
, "invalid use of non-static member function of "
1838 "type %qT", TREE_TYPE (expr
));
1845 /* If EXP is a reference to a bitfield, and the type of EXP does not
1846 match the declared type of the bitfield, return the declared type
1847 of the bitfield. Otherwise, return NULL_TREE. */
1850 is_bitfield_expr_with_lowered_type (const_tree exp
)
1852 switch (TREE_CODE (exp
))
1855 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1856 ? TREE_OPERAND (exp
, 1)
1857 : TREE_OPERAND (exp
, 0)))
1859 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1862 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1866 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1872 field
= TREE_OPERAND (exp
, 1);
1873 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1875 if (same_type_ignoring_top_level_qualifiers_p
1876 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1878 return DECL_BIT_FIELD_TYPE (field
);
1882 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1883 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1884 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1892 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1893 bitfield with a lowered type, the type of EXP is returned, rather
1897 unlowered_expr_type (const_tree exp
)
1900 tree etype
= TREE_TYPE (exp
);
1902 type
= is_bitfield_expr_with_lowered_type (exp
);
1904 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1911 /* Perform the conversions in [expr] that apply when an lvalue appears
1912 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1913 function-to-pointer conversions. In addition, bitfield references are
1914 converted to their declared types. Note that this function does not perform
1915 the lvalue-to-rvalue conversion for class types. If you need that conversion
1916 for class types, then you probably need to use force_rvalue.
1918 Although the returned value is being used as an rvalue, this
1919 function does not wrap the returned expression in a
1920 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1921 that the return value is no longer an lvalue. */
1924 decay_conversion (tree exp
,
1925 tsubst_flags_t complain
,
1926 bool reject_builtin
/* = true */)
1929 enum tree_code code
;
1930 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1932 type
= TREE_TYPE (exp
);
1933 if (type
== error_mark_node
)
1934 return error_mark_node
;
1936 exp
= resolve_nondeduced_context (exp
, complain
);
1937 if (type_unknown_p (exp
))
1939 if (complain
& tf_error
)
1940 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1941 return error_mark_node
;
1944 code
= TREE_CODE (type
);
1946 if (error_operand_p (exp
))
1947 return error_mark_node
;
1949 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
1950 return nullptr_node
;
1952 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1953 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1954 if (code
== VOID_TYPE
)
1956 if (complain
& tf_error
)
1957 error_at (loc
, "void value not ignored as it ought to be");
1958 return error_mark_node
;
1960 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
1961 return error_mark_node
;
1962 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1964 exp
= mark_lvalue_use (exp
);
1965 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
1966 return error_mark_node
;
1967 return cp_build_addr_expr (exp
, complain
);
1969 if (code
== ARRAY_TYPE
)
1974 exp
= mark_lvalue_use (exp
);
1976 if (INDIRECT_REF_P (exp
))
1977 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1978 TREE_OPERAND (exp
, 0));
1980 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1982 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
1983 if (op1
== error_mark_node
)
1984 return error_mark_node
;
1985 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1986 TREE_OPERAND (exp
, 0), op1
);
1990 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1992 if (complain
& tf_error
)
1993 error_at (loc
, "invalid use of non-lvalue array");
1994 return error_mark_node
;
1997 /* Don't let an array compound literal decay to a pointer. It can
1998 still be used to initialize an array or bind to a reference. */
1999 if (TREE_CODE (exp
) == TARGET_EXPR
)
2001 if (complain
& tf_error
)
2002 error_at (loc
, "taking address of temporary array");
2003 return error_mark_node
;
2006 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2010 if (!cxx_mark_addressable (exp
))
2011 return error_mark_node
;
2012 adr
= build_nop (ptrtype
, build_address (exp
));
2015 /* This way is better for a COMPONENT_REF since it can
2016 simplify the offset for a component. */
2017 adr
= cp_build_addr_expr (exp
, complain
);
2018 return cp_convert (ptrtype
, adr
, complain
);
2021 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2022 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2024 /* If a bitfield is used in a context where integral promotion
2025 applies, then the caller is expected to have used
2026 default_conversion. That function promotes bitfields correctly
2027 before calling this function. At this point, if we have a
2028 bitfield referenced, we may assume that is not subject to
2029 promotion, and that, therefore, the type of the resulting rvalue
2030 is the declared type of the bitfield. */
2031 exp
= convert_bitfield_to_declared_type (exp
);
2033 /* We do not call rvalue() here because we do not want to wrap EXP
2034 in a NON_LVALUE_EXPR. */
2038 Non-class rvalues always have cv-unqualified types. */
2039 type
= TREE_TYPE (exp
);
2040 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2041 exp
= build_nop (cv_unqualified (type
), exp
);
2043 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2044 return error_mark_node
;
2049 /* Perform preparatory conversions, as part of the "usual arithmetic
2050 conversions". In particular, as per [expr]:
2052 Whenever an lvalue expression appears as an operand of an
2053 operator that expects the rvalue for that operand, the
2054 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2055 standard conversions are applied to convert the expression to an
2058 In addition, we perform integral promotions here, as those are
2059 applied to both operands to a binary operator before determining
2060 what additional conversions should apply. */
2063 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2065 /* Check for target-specific promotions. */
2066 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2068 exp
= cp_convert (promoted_type
, exp
, complain
);
2069 /* Perform the integral promotions first so that bitfield
2070 expressions (which may promote to "int", even if the bitfield is
2071 declared "unsigned") are promoted correctly. */
2072 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2073 exp
= cp_perform_integral_promotions (exp
, complain
);
2074 /* Perform the other conversions. */
2075 exp
= decay_conversion (exp
, complain
);
2083 default_conversion (tree exp
)
2085 return cp_default_conversion (exp
, tf_warning_or_error
);
2088 /* EXPR is an expression with an integral or enumeration type.
2089 Perform the integral promotions in [conv.prom], and return the
2093 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2098 expr
= mark_rvalue_use (expr
);
2102 If the bitfield has an enumerated type, it is treated as any
2103 other value of that type for promotion purposes. */
2104 type
= is_bitfield_expr_with_lowered_type (expr
);
2105 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2106 type
= TREE_TYPE (expr
);
2107 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2108 /* Scoped enums don't promote. */
2109 if (SCOPED_ENUM_P (type
))
2111 promoted_type
= type_promotes_to (type
);
2112 if (type
!= promoted_type
)
2113 expr
= cp_convert (promoted_type
, expr
, complain
);
2120 perform_integral_promotions (tree expr
)
2122 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2125 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2126 decay_conversion to one. */
2129 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2133 if (!TYPE_PTR_P (totype
))
2136 t
= TREE_TYPE (totype
);
2137 if (!same_type_p (t
, char_type_node
)
2138 && !same_type_p (t
, char16_type_node
)
2139 && !same_type_p (t
, char32_type_node
)
2140 && !same_type_p (t
, wchar_type_node
))
2143 if (TREE_CODE (exp
) == STRING_CST
)
2145 /* Make sure that we don't try to convert between char and wide chars. */
2146 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2151 /* Is this a string constant which has decayed to 'const char *'? */
2152 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2153 if (!same_type_p (TREE_TYPE (exp
), t
))
2156 if (TREE_CODE (exp
) != ADDR_EXPR
2157 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2162 if (cxx_dialect
>= cxx11
)
2163 pedwarn (input_location
,
2164 pedantic
? OPT_Wpedantic
: OPT_Wwrite_strings
,
2165 "ISO C++ forbids converting a string constant to %qT",
2168 warning (OPT_Wwrite_strings
,
2169 "deprecated conversion from string constant to %qT",
2176 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2177 can, for example, use as an lvalue. This code used to be in
2178 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2179 expressions, where we're dealing with aggregates. But now it's again only
2180 called from unary_complex_lvalue. The case (in particular) that led to
2181 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2185 rationalize_conditional_expr (enum tree_code code
, tree t
,
2186 tsubst_flags_t complain
)
2188 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2190 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2191 the first operand is always the one to be used if both operands
2192 are equal, so we know what conditional expression this used to be. */
2193 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2195 tree op0
= TREE_OPERAND (t
, 0);
2196 tree op1
= TREE_OPERAND (t
, 1);
2198 /* The following code is incorrect if either operand side-effects. */
2199 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2200 && !TREE_SIDE_EFFECTS (op1
));
2202 build_conditional_expr (loc
,
2203 build_x_binary_op (loc
,
2204 (TREE_CODE (t
) == MIN_EXPR
2205 ? LE_EXPR
: GE_EXPR
),
2206 op0
, TREE_CODE (op0
),
2207 op1
, TREE_CODE (op1
),
2210 cp_build_unary_op (code
, op0
, 0, complain
),
2211 cp_build_unary_op (code
, op1
, 0, complain
),
2216 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2217 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2219 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2224 /* Given the TYPE of an anonymous union field inside T, return the
2225 FIELD_DECL for the field. If not found return NULL_TREE. Because
2226 anonymous unions can nest, we must also search all anonymous unions
2227 that are directly reachable. */
2230 lookup_anon_field (tree t
, tree type
)
2234 t
= TYPE_MAIN_VARIANT (t
);
2236 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2238 if (TREE_STATIC (field
))
2240 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2243 /* If we find it directly, return the field. */
2244 if (DECL_NAME (field
) == NULL_TREE
2245 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2250 /* Otherwise, it could be nested, search harder. */
2251 if (DECL_NAME (field
) == NULL_TREE
2252 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2254 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2262 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2263 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2264 non-NULL, it indicates the path to the base used to name MEMBER.
2265 If PRESERVE_REFERENCE is true, the expression returned will have
2266 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2267 returned will have the type referred to by the reference.
2269 This function does not perform access control; that is either done
2270 earlier by the parser when the name of MEMBER is resolved to MEMBER
2271 itself, or later when overload resolution selects one of the
2272 functions indicated by MEMBER. */
2275 build_class_member_access_expr (cp_expr object
, tree member
,
2276 tree access_path
, bool preserve_reference
,
2277 tsubst_flags_t complain
)
2281 tree result
= NULL_TREE
;
2282 tree using_decl
= NULL_TREE
;
2284 if (error_operand_p (object
) || error_operand_p (member
))
2285 return error_mark_node
;
2287 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2291 The type of the first expression shall be "class object" (of a
2293 object_type
= TREE_TYPE (object
);
2294 if (!currently_open_class (object_type
)
2295 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2296 return error_mark_node
;
2297 if (!CLASS_TYPE_P (object_type
))
2299 if (complain
& tf_error
)
2301 if (POINTER_TYPE_P (object_type
)
2302 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2303 error ("request for member %qD in %qE, which is of pointer "
2304 "type %qT (maybe you meant to use %<->%> ?)",
2305 member
, object
.get_value (), object_type
);
2307 error ("request for member %qD in %qE, which is of non-class "
2308 "type %qT", member
, object
.get_value (), object_type
);
2310 return error_mark_node
;
2313 /* The standard does not seem to actually say that MEMBER must be a
2314 member of OBJECT_TYPE. However, that is clearly what is
2316 if (DECL_P (member
))
2318 member_scope
= DECL_CLASS_CONTEXT (member
);
2319 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2320 return error_mark_node
;
2321 if (TREE_DEPRECATED (member
))
2322 warn_deprecated_use (member
, NULL_TREE
);
2325 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2326 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2327 presently be the anonymous union. Go outwards until we find a
2328 type related to OBJECT_TYPE. */
2329 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2330 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2332 member_scope
= TYPE_CONTEXT (member_scope
);
2333 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2335 if (complain
& tf_error
)
2337 if (TREE_CODE (member
) == FIELD_DECL
)
2338 error ("invalid use of nonstatic data member %qE", member
);
2340 error ("%qD is not a member of %qT", member
, object_type
);
2342 return error_mark_node
;
2345 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2346 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2347 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2349 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2351 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2354 /* In [expr.ref], there is an explicit list of the valid choices for
2355 MEMBER. We check for each of those cases here. */
2358 /* A static data member. */
2360 mark_exp_read (object
);
2361 /* If OBJECT has side-effects, they are supposed to occur. */
2362 if (TREE_SIDE_EFFECTS (object
))
2363 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2365 else if (TREE_CODE (member
) == FIELD_DECL
)
2367 /* A non-static data member. */
2372 if (INDIRECT_REF_P (object
))
2374 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2376 null_object_p
= false;
2378 /* Convert OBJECT to the type of MEMBER. */
2379 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2380 TYPE_MAIN_VARIANT (member_scope
)))
2385 binfo
= lookup_base (access_path
? access_path
: object_type
,
2386 member_scope
, ba_unique
, &kind
, complain
);
2387 if (binfo
== error_mark_node
)
2388 return error_mark_node
;
2390 /* It is invalid to try to get to a virtual base of a
2391 NULL object. The most common cause is invalid use of
2393 if (null_object_p
&& kind
== bk_via_virtual
)
2395 if (complain
& tf_error
)
2397 error ("invalid access to non-static data member %qD in "
2398 "virtual base of NULL object", member
);
2400 return error_mark_node
;
2403 /* Convert to the base. */
2404 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2405 /*nonnull=*/1, complain
);
2406 /* If we found the base successfully then we should be able
2407 to convert to it successfully. */
2408 gcc_assert (object
!= error_mark_node
);
2411 /* If MEMBER is from an anonymous aggregate, we have converted
2412 OBJECT so that it refers to the class containing the
2413 anonymous union. Generate a reference to the anonymous union
2414 itself, and recur to find MEMBER. */
2415 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2416 /* When this code is called from build_field_call, the
2417 object already has the type of the anonymous union.
2418 That is because the COMPONENT_REF was already
2419 constructed, and was then disassembled before calling
2420 build_field_call. After the function-call code is
2421 cleaned up, this waste can be eliminated. */
2422 && (!same_type_ignoring_top_level_qualifiers_p
2423 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2425 tree anonymous_union
;
2427 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2428 DECL_CONTEXT (member
));
2429 object
= build_class_member_access_expr (object
,
2431 /*access_path=*/NULL_TREE
,
2436 /* Compute the type of the field, as described in [expr.ref]. */
2437 type_quals
= TYPE_UNQUALIFIED
;
2438 member_type
= TREE_TYPE (member
);
2439 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2441 type_quals
= (cp_type_quals (member_type
)
2442 | cp_type_quals (object_type
));
2444 /* A field is const (volatile) if the enclosing object, or the
2445 field itself, is const (volatile). But, a mutable field is
2446 not const, even within a const object. */
2447 if (DECL_MUTABLE_P (member
))
2448 type_quals
&= ~TYPE_QUAL_CONST
;
2449 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2452 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2453 object
, member
, NULL_TREE
);
2455 /* Mark the expression const or volatile, as appropriate. Even
2456 though we've dealt with the type above, we still have to mark the
2457 expression itself. */
2458 if (type_quals
& TYPE_QUAL_CONST
)
2459 TREE_READONLY (result
) = 1;
2460 if (type_quals
& TYPE_QUAL_VOLATILE
)
2461 TREE_THIS_VOLATILE (result
) = 1;
2463 else if (BASELINK_P (member
))
2465 /* The member is a (possibly overloaded) member function. */
2469 /* If the MEMBER is exactly one static member function, then we
2470 know the type of the expression. Otherwise, we must wait
2471 until overload resolution has been performed. */
2472 functions
= BASELINK_FUNCTIONS (member
);
2473 if (TREE_CODE (functions
) == FUNCTION_DECL
2474 && DECL_STATIC_FUNCTION_P (functions
))
2475 type
= TREE_TYPE (functions
);
2477 type
= unknown_type_node
;
2478 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2479 base. That will happen when the function is called. */
2480 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2482 else if (TREE_CODE (member
) == CONST_DECL
)
2484 /* The member is an enumerator. */
2486 /* If OBJECT has side-effects, they are supposed to occur. */
2487 if (TREE_SIDE_EFFECTS (object
))
2488 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2491 else if ((using_decl
= strip_using_decl (member
)) != member
)
2492 result
= build_class_member_access_expr (object
,
2494 access_path
, preserve_reference
,
2498 if (complain
& tf_error
)
2499 error ("invalid use of %qD", member
);
2500 return error_mark_node
;
2503 if (!preserve_reference
)
2506 If E2 is declared to have type "reference to T", then ... the
2507 type of E1.E2 is T. */
2508 result
= convert_from_reference (result
);
2513 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2514 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2517 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2518 tsubst_flags_t complain
)
2520 tree object_type
= TREE_TYPE (object
);
2521 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2524 /* We've already complained about this destructor. */
2525 if (dtor_type
== error_mark_node
)
2526 return error_mark_node
;
2528 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2530 if (complain
& tf_error
)
2531 error ("qualified type %qT does not match destructor name ~%qT",
2533 return error_mark_node
;
2535 if (is_auto (dtor_type
))
2536 dtor_type
= object_type
;
2537 else if (identifier_p (dtor_type
))
2539 /* In a template, names we can't find a match for are still accepted
2540 destructor names, and we check them here. */
2541 if (check_dtor_name (object_type
, dtor_type
))
2542 dtor_type
= object_type
;
2545 if (complain
& tf_error
)
2546 error ("object type %qT does not match destructor name ~%qT",
2547 object_type
, dtor_type
);
2548 return error_mark_node
;
2552 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2554 if (complain
& tf_error
)
2555 error ("the type being destroyed is %qT, but the destructor "
2556 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2557 return error_mark_node
;
2559 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2560 /*protect=*/1, /*want_type=*/false,
2561 tf_warning_or_error
);
2564 if (complain
& tf_error
)
2565 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2566 return error_mark_node
;
2568 expr
= (adjust_result_of_qualified_name_lookup
2569 (expr
, dtor_type
, object_type
));
2570 if (scope
== NULL_TREE
)
2571 /* We need to call adjust_result_of_qualified_name_lookup in case the
2572 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2573 that we still get virtual function binding. */
2574 BASELINK_QUALIFIED_P (expr
) = false;
2578 /* An expression of the form "A::template B" has been resolved to
2579 DECL. Issue a diagnostic if B is not a template or template
2583 check_template_keyword (tree decl
)
2585 /* The standard says:
2589 If a name prefixed by the keyword template is not a member
2590 template, the program is ill-formed.
2592 DR 228 removed the restriction that the template be a member
2595 DR 96, if accepted would add the further restriction that explicit
2596 template arguments must be provided if the template keyword is
2597 used, but, as of 2005-10-16, that DR is still in "drafting". If
2598 this DR is accepted, then the semantic checks here can be
2599 simplified, as the entity named must in fact be a template
2600 specialization, rather than, as at present, a set of overloaded
2601 functions containing at least one template function. */
2602 if (TREE_CODE (decl
) != TEMPLATE_DECL
2603 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2607 if (DECL_USE_TEMPLATE (decl
)
2608 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2611 permerror (input_location
, "%qD is not a template", decl
);
2613 else if (!is_overloaded_fn (decl
))
2614 permerror (input_location
, "%qD is not a template", decl
);
2619 if (BASELINK_P (fns
))
2620 fns
= BASELINK_FUNCTIONS (fns
);
2623 tree fn
= OVL_CURRENT (fns
);
2624 if (TREE_CODE (fn
) == TEMPLATE_DECL
2625 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2627 if (TREE_CODE (fn
) == FUNCTION_DECL
2628 && DECL_USE_TEMPLATE (fn
)
2629 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2631 fns
= OVL_NEXT (fns
);
2634 permerror (input_location
, "%qD is not a template", decl
);
2639 /* This function is called by the parser to process a class member
2640 access expression of the form OBJECT.NAME. NAME is a node used by
2641 the parser to represent a name; it is not yet a DECL. It may,
2642 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2643 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2644 there is no reason to do the lookup twice, so the parser keeps the
2645 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2646 be a template via the use of the "A::template B" syntax. */
2649 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2650 tsubst_flags_t complain
)
2655 tree access_path
= NULL_TREE
;
2656 tree orig_object
= object
;
2657 tree orig_name
= name
;
2659 if (object
== error_mark_node
|| name
== error_mark_node
)
2660 return error_mark_node
;
2662 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2663 if (!objc_is_public (object
, name
))
2664 return error_mark_node
;
2666 object_type
= TREE_TYPE (object
);
2668 if (processing_template_decl
)
2670 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2671 type_dependent_object_expression_p (object
)
2672 /* If NAME is "f<args>", where either 'f' or 'args' is
2673 dependent, then the expression is dependent. */
2674 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2675 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2676 TREE_OPERAND (name
, 1)))
2677 /* If NAME is "T::X" where "T" is dependent, then the
2678 expression is dependent. */
2679 || (TREE_CODE (name
) == SCOPE_REF
2680 && TYPE_P (TREE_OPERAND (name
, 0))
2681 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2684 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2685 orig_object
, name
, NULL_TREE
);
2687 object
= build_non_dependent_expr (object
);
2689 else if (c_dialect_objc ()
2690 && identifier_p (name
)
2691 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2696 The type of the first expression shall be "class object" (of a
2698 if (!currently_open_class (object_type
)
2699 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2700 return error_mark_node
;
2701 if (!CLASS_TYPE_P (object_type
))
2703 if (complain
& tf_error
)
2705 if (POINTER_TYPE_P (object_type
)
2706 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2707 error ("request for member %qD in %qE, which is of pointer "
2708 "type %qT (maybe you meant to use %<->%> ?)",
2709 name
, object
.get_value (), object_type
);
2711 error ("request for member %qD in %qE, which is of non-class "
2712 "type %qT", name
, object
.get_value (), object_type
);
2714 return error_mark_node
;
2717 if (BASELINK_P (name
))
2718 /* A member function that has already been looked up. */
2722 bool is_template_id
= false;
2723 tree template_args
= NULL_TREE
;
2726 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2728 is_template_id
= true;
2729 template_args
= TREE_OPERAND (name
, 1);
2730 name
= TREE_OPERAND (name
, 0);
2732 if (TREE_CODE (name
) == OVERLOAD
)
2733 name
= DECL_NAME (get_first_fn (name
));
2734 else if (DECL_P (name
))
2735 name
= DECL_NAME (name
);
2738 if (TREE_CODE (name
) == SCOPE_REF
)
2740 /* A qualified name. The qualifying class or namespace `S'
2741 has already been looked up; it is either a TYPE or a
2743 scope
= TREE_OPERAND (name
, 0);
2744 name
= TREE_OPERAND (name
, 1);
2746 /* If SCOPE is a namespace, then the qualified name does not
2747 name a member of OBJECT_TYPE. */
2748 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2750 if (complain
& tf_error
)
2751 error ("%<%D::%D%> is not a member of %qT",
2752 scope
, name
, object_type
);
2753 return error_mark_node
;
2756 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2758 /* Looking up a member enumerator (c++/56793). */
2759 if (!TYPE_CLASS_SCOPE_P (scope
)
2760 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2762 if (complain
& tf_error
)
2763 error ("%<%D::%D%> is not a member of %qT",
2764 scope
, name
, object_type
);
2765 return error_mark_node
;
2767 tree val
= lookup_enumerator (scope
, name
);
2770 if (complain
& tf_error
)
2771 error ("%qD is not a member of %qD",
2773 return error_mark_node
;
2776 if (TREE_SIDE_EFFECTS (object
))
2777 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2781 gcc_assert (CLASS_TYPE_P (scope
));
2782 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2784 if (constructor_name_p (name
, scope
))
2786 if (complain
& tf_error
)
2787 error ("cannot call constructor %<%T::%D%> directly",
2789 return error_mark_node
;
2792 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2793 access_path
= lookup_base (object_type
, scope
, ba_check
,
2795 if (access_path
== error_mark_node
)
2796 return error_mark_node
;
2799 if (complain
& tf_error
)
2800 error ("%qT is not a base of %qT", scope
, object_type
);
2801 return error_mark_node
;
2807 access_path
= object_type
;
2810 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2812 if (dependent_type_p (object_type
))
2813 /* The destructor isn't declared yet. */
2815 member
= lookup_destructor (object
, scope
, name
, complain
);
2819 /* Look up the member. */
2820 member
= lookup_member (access_path
, name
, /*protect=*/1,
2821 /*want_type=*/false, complain
);
2822 if (member
== NULL_TREE
)
2824 if (dependent_type_p (object_type
))
2825 /* Try again at instantiation time. */
2827 if (complain
& tf_error
)
2829 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2830 /*want_type=*/false);
2833 location_t bogus_component_loc
= input_location
;
2834 rich_location
rich_loc (line_table
, bogus_component_loc
);
2835 source_range bogus_component_range
=
2836 get_range_from_loc (line_table
, bogus_component_loc
);
2837 rich_loc
.add_fixit_replace
2838 (bogus_component_range
,
2839 IDENTIFIER_POINTER (guessed_id
));
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
;
2856 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2862 tree templ
= member
;
2864 if (BASELINK_P (templ
))
2865 templ
= lookup_template_function (templ
, template_args
);
2868 if (complain
& tf_error
)
2869 error ("%qD is not a member template function", name
);
2870 return error_mark_node
;
2875 if (TREE_DEPRECATED (member
))
2876 warn_deprecated_use (member
, NULL_TREE
);
2879 check_template_keyword (member
);
2881 expr
= build_class_member_access_expr (object
, member
, access_path
,
2882 /*preserve_reference=*/false,
2884 if (processing_template_decl
&& expr
!= error_mark_node
)
2886 if (BASELINK_P (member
))
2888 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2889 BASELINK_QUALIFIED_P (member
) = 1;
2892 return build_min_non_dep (COMPONENT_REF
, expr
,
2893 orig_object
, orig_name
,
2900 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2904 build_simple_component_ref (tree object
, tree member
)
2906 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
2907 cp_type_quals (TREE_TYPE (object
)));
2908 return build3_loc (input_location
,
2909 COMPONENT_REF
, type
,
2910 object
, member
, NULL_TREE
);
2913 /* Return an expression for the MEMBER_NAME field in the internal
2914 representation of PTRMEM, a pointer-to-member function. (Each
2915 pointer-to-member function type gets its own RECORD_TYPE so it is
2916 more convenient to access the fields by name than by FIELD_DECL.)
2917 This routine converts the NAME to a FIELD_DECL and then creates the
2918 node for the complete expression. */
2921 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2926 /* This code is a stripped down version of
2927 build_class_member_access_expr. It does not work to use that
2928 routine directly because it expects the object to be of class
2930 ptrmem_type
= TREE_TYPE (ptrmem
);
2931 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2932 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
2933 member
= DECL_CHAIN (member
))
2934 if (DECL_NAME (member
) == member_name
)
2936 return build_simple_component_ref (ptrmem
, member
);
2939 /* Given an expression PTR for a pointer, return an expression
2940 for the value pointed to.
2941 ERRORSTRING is the name of the operator to appear in error messages.
2943 This function may need to overload OPERATOR_FNNAME.
2944 Must also handle REFERENCE_TYPEs for C++. */
2947 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
2948 tsubst_flags_t complain
)
2950 tree orig_expr
= expr
;
2952 tree overload
= NULL_TREE
;
2954 if (processing_template_decl
)
2956 /* Retain the type if we know the operand is a pointer. */
2957 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2958 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2959 if (type_dependent_expression_p (expr
))
2960 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
2961 expr
= build_non_dependent_expr (expr
);
2964 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
2965 NULL_TREE
, NULL_TREE
, &overload
, complain
);
2967 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2969 if (processing_template_decl
&& rval
!= error_mark_node
)
2971 if (overload
!= NULL_TREE
)
2972 return (build_min_non_dep_op_overload
2973 (INDIRECT_REF
, rval
, overload
, orig_expr
));
2975 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2981 /* Helper function called from c-common. */
2983 build_indirect_ref (location_t
/*loc*/,
2984 tree ptr
, ref_operator errorstring
)
2986 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2990 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2991 tsubst_flags_t complain
)
2995 if (ptr
== current_class_ptr
2996 || (TREE_CODE (ptr
) == NOP_EXPR
2997 && TREE_OPERAND (ptr
, 0) == current_class_ptr
2998 && (same_type_ignoring_top_level_qualifiers_p
2999 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3000 return current_class_ref
;
3002 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
3003 ? ptr
: decay_conversion (ptr
, complain
));
3004 if (pointer
== error_mark_node
)
3005 return error_mark_node
;
3007 type
= TREE_TYPE (pointer
);
3009 if (POINTER_TYPE_P (type
))
3013 If the type of the expression is "pointer to T," the type
3014 of the result is "T." */
3015 tree t
= TREE_TYPE (type
);
3017 if ((CONVERT_EXPR_P (ptr
)
3018 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3019 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3021 /* If a warning is issued, mark it to avoid duplicates from
3022 the backend. This only needs to be done at
3023 warn_strict_aliasing > 2. */
3024 if (warn_strict_aliasing
> 2)
3025 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
3026 type
, TREE_OPERAND (ptr
, 0)))
3027 TREE_NO_WARNING (ptr
) = 1;
3030 if (VOID_TYPE_P (t
))
3032 /* A pointer to incomplete type (other than cv void) can be
3033 dereferenced [expr.unary.op]/1 */
3034 if (complain
& tf_error
)
3035 error ("%qT is not a pointer-to-object type", type
);
3036 return error_mark_node
;
3038 else if (TREE_CODE (pointer
) == ADDR_EXPR
3039 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3040 /* The POINTER was something like `&x'. We simplify `*&x' to
3042 return TREE_OPERAND (pointer
, 0);
3045 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3047 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3048 so that we get the proper error message if the result is used
3049 to assign to. Also, &* is supposed to be a no-op. */
3050 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3051 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3052 TREE_SIDE_EFFECTS (ref
)
3053 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3057 else if (!(complain
& tf_error
))
3058 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3060 /* `pointer' won't be an error_mark_node if we were given a
3061 pointer to member, so it's cool to check for this here. */
3062 else if (TYPE_PTRMEM_P (type
))
3063 switch (errorstring
)
3065 case RO_ARRAY_INDEXING
:
3066 error ("invalid use of array indexing on pointer to member");
3069 error ("invalid use of unary %<*%> on pointer to member");
3071 case RO_IMPLICIT_CONVERSION
:
3072 error ("invalid use of implicit conversion on pointer to member");
3075 error ("left hand operand of %<->*%> must be a pointer to class, "
3076 "but is a pointer to member of type %qT", type
);
3081 else if (pointer
!= error_mark_node
)
3082 invalid_indirection_error (input_location
, type
, errorstring
);
3084 return error_mark_node
;
3087 /* This handles expressions of the form "a[i]", which denotes
3090 This is logically equivalent in C to *(a+i), but we may do it differently.
3091 If A is a variable or a member, we generate a primitive ARRAY_REF.
3092 This avoids forcing the array out of registers, and can work on
3093 arrays that are not lvalues (for example, members of structures returned
3096 If INDEX is of some user-defined type, it must be converted to
3097 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3098 will inherit the type of the array, which will be some pointer type.
3100 LOC is the location to use in building the array reference. */
3103 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3104 tsubst_flags_t complain
)
3110 if (complain
& tf_error
)
3111 error_at (loc
, "subscript missing in array reference");
3112 return error_mark_node
;
3115 /* If an array's index is an array notation, then its rank cannot be
3116 greater than one. */
3117 if (flag_cilkplus
&& contains_array_notation_expr (idx
))
3121 /* If find_rank returns false, then it should have reported an error,
3122 thus it is unnecessary for repetition. */
3123 if (!find_rank (loc
, idx
, idx
, true, &rank
))
3124 return error_mark_node
;
3127 error_at (loc
, "rank of the array%'s index is greater than 1");
3128 return error_mark_node
;
3131 if (TREE_TYPE (array
) == error_mark_node
3132 || TREE_TYPE (idx
) == error_mark_node
)
3133 return error_mark_node
;
3135 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3137 switch (TREE_CODE (array
))
3141 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3143 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3144 TREE_OPERAND (array
, 0), value
);
3145 SET_EXPR_LOCATION (ret
, loc
);
3150 ret
= build_conditional_expr
3151 (loc
, TREE_OPERAND (array
, 0),
3152 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3154 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3157 protected_set_expr_location (ret
, loc
);
3164 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3166 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3170 warn_array_subscript_with_type_char (loc
, idx
);
3172 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3174 if (complain
& tf_error
)
3175 error_at (loc
, "array subscript is not an integer");
3176 return error_mark_node
;
3179 /* Apply integral promotions *after* noticing character types.
3180 (It is unclear why we do these promotions -- the standard
3181 does not say that we should. In fact, the natural thing would
3182 seem to be to convert IDX to ptrdiff_t; we're performing
3183 pointer arithmetic.) */
3184 idx
= cp_perform_integral_promotions (idx
, complain
);
3186 /* An array that is indexed by a non-constant
3187 cannot be stored in a register; we must be able to do
3188 address arithmetic on its address.
3189 Likewise an array of elements of variable size. */
3190 if (TREE_CODE (idx
) != INTEGER_CST
3191 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3192 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3195 if (!cxx_mark_addressable (array
))
3196 return error_mark_node
;
3199 /* An array that is indexed by a constant value which is not within
3200 the array bounds cannot be stored in a register either; because we
3201 would get a crash in store_bit_field/extract_bit_field when trying
3202 to access a non-existent part of the register. */
3203 if (TREE_CODE (idx
) == INTEGER_CST
3204 && TYPE_DOMAIN (TREE_TYPE (array
))
3205 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3207 if (!cxx_mark_addressable (array
))
3208 return error_mark_node
;
3211 /* Note in C++ it is valid to subscript a `register' array, since
3212 it is valid to take the address of something with that
3213 storage specification. */
3217 while (TREE_CODE (foo
) == COMPONENT_REF
)
3218 foo
= TREE_OPERAND (foo
, 0);
3219 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3220 && (complain
& tf_warning
))
3221 warning_at (loc
, OPT_Wextra
,
3222 "subscripting array declared %<register%>");
3225 type
= TREE_TYPE (TREE_TYPE (array
));
3226 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3227 /* Array ref is const/volatile if the array elements are
3228 or if the array is.. */
3229 TREE_READONLY (rval
)
3230 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3231 TREE_SIDE_EFFECTS (rval
)
3232 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3233 TREE_THIS_VOLATILE (rval
)
3234 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3235 ret
= require_complete_type_sfinae (rval
, complain
);
3236 protected_set_expr_location (ret
, loc
);
3238 ret
= non_lvalue_loc (loc
, ret
);
3243 tree ar
= cp_default_conversion (array
, complain
);
3244 tree ind
= cp_default_conversion (idx
, complain
);
3246 /* Put the integer in IND to simplify error checking. */
3247 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3248 std::swap (ar
, ind
);
3250 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3251 return error_mark_node
;
3253 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3255 if (complain
& tf_error
)
3256 error_at (loc
, "subscripted value is neither array nor pointer");
3257 return error_mark_node
;
3259 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3261 if (complain
& tf_error
)
3262 error_at (loc
, "array subscript is not an integer");
3263 return error_mark_node
;
3266 warn_array_subscript_with_type_char (loc
, idx
);
3268 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3273 protected_set_expr_location (ret
, loc
);
3275 ret
= non_lvalue_loc (loc
, ret
);
3280 /* Entry point for Obj-C++. */
3283 build_array_ref (location_t loc
, tree array
, tree idx
)
3285 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3288 /* Resolve a pointer to member function. INSTANCE is the object
3289 instance to use, if the member points to a virtual member.
3291 This used to avoid checking for virtual functions if basetype
3292 has no virtual functions, according to an earlier ANSI draft.
3293 With the final ISO C++ rules, such an optimization is
3294 incorrect: A pointer to a derived member can be static_cast
3295 to pointer-to-base-member, as long as the dynamic object
3296 later has the right member. So now we only do this optimization
3297 when we know the dynamic type of the object. */
3300 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3301 tsubst_flags_t complain
)
3303 if (TREE_CODE (function
) == OFFSET_REF
)
3304 function
= TREE_OPERAND (function
, 1);
3306 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3308 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3310 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3311 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3313 tree instance_ptr
= *instance_ptrptr
;
3314 tree instance_save_expr
= 0;
3315 if (instance_ptr
== error_mark_node
)
3317 if (TREE_CODE (function
) == PTRMEM_CST
)
3319 /* Extracting the function address from a pmf is only
3320 allowed with -Wno-pmf-conversions. It only works for
3322 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3323 e1
= convert (fntype
, e1
);
3328 if (complain
& tf_error
)
3329 error ("object missing in use of %qE", function
);
3330 return error_mark_node
;
3334 /* True if we know that the dynamic type of the object doesn't have
3335 virtual functions, so we can assume the PFN field is a pointer. */
3336 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3337 && !TYPE_POLYMORPHIC_P (basetype
)
3338 && resolves_to_fixed_type_p (instance_ptr
, 0));
3340 /* If we don't really have an object (i.e. in an ill-formed
3341 conversion from PMF to pointer), we can't resolve virtual
3342 functions anyway. */
3343 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3346 if (TREE_SIDE_EFFECTS (instance_ptr
))
3347 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3349 if (TREE_SIDE_EFFECTS (function
))
3350 function
= save_expr (function
);
3352 /* Start by extracting all the information from the PMF itself. */
3353 e3
= pfn_from_ptrmemfunc (function
);
3354 delta
= delta_from_ptrmemfunc (function
);
3355 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3356 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3358 int flag_sanitize_save
;
3359 case ptrmemfunc_vbit_in_pfn
:
3360 e1
= cp_build_binary_op (input_location
,
3361 BIT_AND_EXPR
, idx
, integer_one_node
,
3363 idx
= cp_build_binary_op (input_location
,
3364 MINUS_EXPR
, idx
, integer_one_node
,
3366 if (idx
== error_mark_node
)
3367 return error_mark_node
;
3370 case ptrmemfunc_vbit_in_delta
:
3371 e1
= cp_build_binary_op (input_location
,
3372 BIT_AND_EXPR
, delta
, integer_one_node
,
3374 /* Don't instrument the RSHIFT_EXPR we're about to create because
3375 we're going to use DELTA number of times, and that wouldn't play
3376 well with SAVE_EXPRs therein. */
3377 flag_sanitize_save
= flag_sanitize
;
3379 delta
= cp_build_binary_op (input_location
,
3380 RSHIFT_EXPR
, delta
, integer_one_node
,
3382 flag_sanitize
= flag_sanitize_save
;
3383 if (delta
== error_mark_node
)
3384 return error_mark_node
;
3391 if (e1
== error_mark_node
)
3392 return error_mark_node
;
3394 /* Convert down to the right base before using the instance. A
3395 special case is that in a pointer to member of class C, C may
3396 be incomplete. In that case, the function will of course be
3397 a member of C, and no conversion is required. In fact,
3398 lookup_base will fail in that case, because incomplete
3399 classes do not have BINFOs. */
3400 if (!same_type_ignoring_top_level_qualifiers_p
3401 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3403 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3404 basetype
, ba_check
, NULL
, complain
);
3405 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3407 if (instance_ptr
== error_mark_node
)
3408 return error_mark_node
;
3410 /* ...and then the delta in the PMF. */
3411 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3413 /* Hand back the adjusted 'this' argument to our caller. */
3414 *instance_ptrptr
= instance_ptr
;
3417 /* Now just return the pointer. */
3420 /* Next extract the vtable pointer from the object. */
3421 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3423 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, complain
);
3424 if (vtbl
== error_mark_node
)
3425 return error_mark_node
;
3427 /* Finally, extract the function pointer from the vtable. */
3428 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3429 e2
= cp_build_indirect_ref (e2
, RO_NULL
, complain
);
3430 if (e2
== error_mark_node
)
3431 return error_mark_node
;
3432 TREE_CONSTANT (e2
) = 1;
3434 /* When using function descriptors, the address of the
3435 vtable entry is treated as a function pointer. */
3436 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3437 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3438 cp_build_addr_expr (e2
, complain
));
3440 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3441 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3442 if (e1
== error_mark_node
)
3443 return error_mark_node
;
3445 /* Make sure this doesn't get evaluated first inside one of the
3446 branches of the COND_EXPR. */
3447 if (instance_save_expr
)
3448 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3449 instance_save_expr
, e1
);
3456 /* Used by the C-common bits. */
3458 build_function_call (location_t
/*loc*/,
3459 tree function
, tree params
)
3461 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3464 /* Used by the C-common bits. */
3466 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3467 tree function
, vec
<tree
, va_gc
> *params
,
3468 vec
<tree
, va_gc
> * /*origtypes*/)
3470 vec
<tree
, va_gc
> *orig_params
= params
;
3471 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3472 tf_warning_or_error
);
3474 /* cp_build_function_call_vec can reallocate PARAMS by adding
3475 default arguments. That should never happen here. Verify
3477 gcc_assert (params
== orig_params
);
3482 /* Build a function call using a tree list of arguments. */
3485 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3487 vec
<tree
, va_gc
> *vec
;
3490 vec
= make_tree_vector ();
3491 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3492 vec_safe_push (vec
, TREE_VALUE (params
));
3493 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3494 release_tree_vector (vec
);
3498 /* Build a function call using varargs. */
3501 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3503 vec
<tree
, va_gc
> *vec
;
3507 vec
= make_tree_vector ();
3508 va_start (args
, complain
);
3509 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3510 vec_safe_push (vec
, t
);
3512 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3513 release_tree_vector (vec
);
3517 /* Build a function call using a vector of arguments. PARAMS may be
3518 NULL if there are no parameters. This changes the contents of
3522 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3523 tsubst_flags_t complain
)
3525 tree fntype
, fndecl
;
3527 tree original
= function
;
3531 vec
<tree
, va_gc
> *allocated
= NULL
;
3534 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3535 expressions, like those used for ObjC messenger dispatches. */
3536 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3537 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3539 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3540 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3541 if (TREE_CODE (function
) == NOP_EXPR
3542 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3543 function
= TREE_OPERAND (function
, 0);
3545 if (TREE_CODE (function
) == FUNCTION_DECL
)
3547 /* If the function is a non-template member function
3548 or a non-template friend, then we need to check the
3551 Note that if overload resolution failed with a single
3552 candidate this function will be used to explicitly diagnose
3553 the failure for the single call expression. The check is
3554 technically redundant since we also would have failed in
3555 add_function_candidate. */
3557 && (complain
& tf_error
)
3558 && !constraints_satisfied_p (function
))
3560 error ("cannot call function %qD", function
);
3561 location_t loc
= DECL_SOURCE_LOCATION (function
);
3562 diagnose_constraints (loc
, function
, NULL_TREE
);
3563 return error_mark_node
;
3566 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3567 return error_mark_node
;
3570 /* Convert anything with function type to a pointer-to-function. */
3571 if (DECL_MAIN_P (function
))
3573 if (complain
& tf_error
)
3574 pedwarn (input_location
, OPT_Wpedantic
,
3575 "ISO C++ forbids calling %<::main%> from within program");
3577 return error_mark_node
;
3579 function
= build_addr_func (function
, complain
);
3585 function
= build_addr_func (function
, complain
);
3588 if (function
== error_mark_node
)
3589 return error_mark_node
;
3591 fntype
= TREE_TYPE (function
);
3593 if (TYPE_PTRMEMFUNC_P (fntype
))
3595 if (complain
& tf_error
)
3596 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3597 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3598 original
, original
);
3599 return error_mark_node
;
3602 is_method
= (TYPE_PTR_P (fntype
)
3603 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3605 if (!(TYPE_PTRFN_P (fntype
)
3607 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3609 if (complain
& tf_error
)
3611 if (!flag_diagnostics_show_caret
)
3612 error_at (input_location
,
3613 "%qE cannot be used as a function", original
);
3614 else if (DECL_P (original
))
3615 error_at (input_location
,
3616 "%qD cannot be used as a function", original
);
3618 error_at (input_location
,
3619 "expression cannot be used as a function");
3622 return error_mark_node
;
3625 /* fntype now gets the type of function pointed to. */
3626 fntype
= TREE_TYPE (fntype
);
3627 parm_types
= TYPE_ARG_TYPES (fntype
);
3631 allocated
= make_tree_vector ();
3632 params
= &allocated
;
3635 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3638 return error_mark_node
;
3640 argarray
= (*params
)->address ();
3642 /* Check for errors in format strings and inappropriately
3644 check_function_arguments (input_location
, fntype
, nargs
, argarray
);
3646 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3648 if (allocated
!= NULL
)
3649 release_tree_vector (allocated
);
3654 /* Subroutine of convert_arguments.
3655 Print an error message about a wrong number of arguments. */
3658 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3662 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3664 if (DECL_NAME (fndecl
) == NULL_TREE
3665 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3668 ? G_("too many arguments to constructor %q#D")
3669 : G_("too few arguments to constructor %q#D"),
3674 ? G_("too many arguments to member function %q#D")
3675 : G_("too few arguments to member function %q#D"),
3681 ? G_("too many arguments to function %q#D")
3682 : G_("too few arguments to function %q#D"),
3684 if (!DECL_IS_BUILTIN (fndecl
))
3685 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3689 if (c_dialect_objc () && objc_message_selector ())
3692 ? G_("too many arguments to method %q#D")
3693 : G_("too few arguments to method %q#D"),
3694 objc_message_selector ());
3696 error_at (loc
, too_many_p
? G_("too many arguments to function")
3697 : G_("too few arguments to function"));
3701 /* Convert the actual parameter expressions in the list VALUES to the
3702 types in the list TYPELIST. The converted expressions are stored
3703 back in the VALUES vector.
3704 If parmdecls is exhausted, or when an element has NULL as its type,
3705 perform the default conversions.
3707 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3709 This is also where warnings about wrong number of args are generated.
3711 Returns the actual number of arguments processed (which might be less
3712 than the length of the vector), or -1 on error.
3714 In C++, unspecified trailing parameters can be filled in with their
3715 default arguments, if such were specified. Do so here. */
3718 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3719 int flags
, tsubst_flags_t complain
)
3724 /* Argument passing is always copy-initialization. */
3725 flags
|= LOOKUP_ONLYCONVERTING
;
3727 for (i
= 0, typetail
= typelist
;
3728 i
< vec_safe_length (*values
);
3731 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3732 tree val
= (**values
)[i
];
3734 if (val
== error_mark_node
|| type
== error_mark_node
)
3737 if (type
== void_type_node
)
3739 if (complain
& tf_error
)
3741 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3748 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3749 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3750 if (TREE_CODE (val
) == NOP_EXPR
3751 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3752 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3753 val
= TREE_OPERAND (val
, 0);
3755 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3757 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3758 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3759 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3760 val
= decay_conversion (val
, complain
);
3763 if (val
== error_mark_node
)
3768 /* Formal parm type is specified by a function prototype. */
3771 if (!COMPLETE_TYPE_P (complete_type (type
)))
3773 if (complain
& tf_error
)
3776 error ("parameter %P of %qD has incomplete type %qT",
3779 error ("parameter %P has incomplete type %qT", i
, type
);
3781 parmval
= error_mark_node
;
3785 parmval
= convert_for_initialization
3786 (NULL_TREE
, type
, val
, flags
,
3787 ICR_ARGPASS
, fndecl
, i
, complain
);
3788 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3791 if (parmval
== error_mark_node
)
3794 (**values
)[i
] = parmval
;
3798 if (fndecl
&& magic_varargs_p (fndecl
))
3799 /* Don't do ellipsis conversion for __built_in_constant_p
3800 as this will result in spurious errors for non-trivial
3802 val
= require_complete_type_sfinae (val
, complain
);
3804 val
= convert_arg_to_ellipsis (val
, complain
);
3806 (**values
)[i
] = val
;
3810 typetail
= TREE_CHAIN (typetail
);
3813 if (typetail
!= 0 && typetail
!= void_list_node
)
3815 /* See if there are default arguments that can be used. Because
3816 we hold default arguments in the FUNCTION_TYPE (which is so
3817 wrong), we can see default parameters here from deduced
3818 contexts (and via typeof) for indirect function calls.
3819 Fortunately we know whether we have a function decl to
3820 provide default arguments in a language conformant
3822 if (fndecl
&& TREE_PURPOSE (typetail
)
3823 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3825 for (; typetail
!= void_list_node
; ++i
)
3828 = convert_default_arg (TREE_VALUE (typetail
),
3829 TREE_PURPOSE (typetail
),
3830 fndecl
, i
, complain
);
3832 if (parmval
== error_mark_node
)
3835 vec_safe_push (*values
, parmval
);
3836 typetail
= TREE_CHAIN (typetail
);
3837 /* ends with `...'. */
3838 if (typetail
== NULL_TREE
)
3844 if (complain
& tf_error
)
3845 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3853 /* Build a binary-operation expression, after performing default
3854 conversions on the operands. CODE is the kind of expression to
3855 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3856 are the tree codes which correspond to ARG1 and ARG2 when issuing
3857 warnings about possibly misplaced parentheses. They may differ
3858 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3859 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3860 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3861 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3862 ARG2_CODE as ERROR_MARK. */
3865 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
3866 enum tree_code arg1_code
, tree arg2
,
3867 enum tree_code arg2_code
, tree
*overload_p
,
3868 tsubst_flags_t complain
)
3873 tree overload
= NULL_TREE
;
3878 if (processing_template_decl
)
3880 if (type_dependent_expression_p (arg1
)
3881 || type_dependent_expression_p (arg2
))
3882 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
3883 arg1
= build_non_dependent_expr (arg1
);
3884 arg2
= build_non_dependent_expr (arg2
);
3887 if (code
== DOTSTAR_EXPR
)
3888 expr
= build_m_component_ref (arg1
, arg2
, complain
);
3890 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3891 &overload
, complain
);
3893 if (overload_p
!= NULL
)
3894 *overload_p
= overload
;
3896 /* Check for cases such as x+y<<z which users are likely to
3897 misinterpret. But don't warn about obj << x + y, since that is a
3898 common idiom for I/O. */
3899 if (warn_parentheses
3900 && (complain
& tf_warning
)
3901 && !processing_template_decl
3902 && !error_operand_p (arg1
)
3903 && !error_operand_p (arg2
)
3904 && (code
!= LSHIFT_EXPR
3905 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3906 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
3907 arg2_code
, orig_arg2
);
3909 if (processing_template_decl
&& expr
!= error_mark_node
)
3911 if (overload
!= NULL_TREE
)
3912 return (build_min_non_dep_op_overload
3913 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
3915 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3921 /* Build and return an ARRAY_REF expression. */
3924 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
3925 tsubst_flags_t complain
)
3927 tree orig_arg1
= arg1
;
3928 tree orig_arg2
= arg2
;
3930 tree overload
= NULL_TREE
;
3932 if (processing_template_decl
)
3934 if (type_dependent_expression_p (arg1
)
3935 || type_dependent_expression_p (arg2
))
3936 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
3937 NULL_TREE
, NULL_TREE
);
3938 arg1
= build_non_dependent_expr (arg1
);
3939 arg2
= build_non_dependent_expr (arg2
);
3942 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
3943 NULL_TREE
, &overload
, complain
);
3945 if (processing_template_decl
&& expr
!= error_mark_node
)
3947 if (overload
!= NULL_TREE
)
3948 return (build_min_non_dep_op_overload
3949 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
3951 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3952 NULL_TREE
, NULL_TREE
);
3957 /* Return whether OP is an expression of enum type cast to integer
3958 type. In C++ even unsigned enum types are cast to signed integer
3959 types. We do not want to issue warnings about comparisons between
3960 signed and unsigned types when one of the types is an enum type.
3961 Those warnings are always false positives in practice. */
3964 enum_cast_to_int (tree op
)
3966 if (CONVERT_EXPR_P (op
)
3967 && TREE_TYPE (op
) == integer_type_node
3968 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
3969 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
3972 /* The cast may have been pushed into a COND_EXPR. */
3973 if (TREE_CODE (op
) == COND_EXPR
)
3974 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
3975 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
3980 /* For the c-common bits. */
3982 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3985 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3988 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
3989 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
3992 build_vec_cmp (tree_code code
, tree type
,
3993 tree arg0
, tree arg1
)
3995 tree zero_vec
= build_zero_cst (type
);
3996 tree minus_one_vec
= build_minus_one_cst (type
);
3997 tree cmp_type
= build_same_sized_truth_vector_type(type
);
3998 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
3999 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4002 /* Possibly warn about an address never being NULL. */
4005 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4008 || (complain
& tf_warning
) == 0
4009 || c_inhibit_evaluation_warnings
!= 0
4010 || TREE_NO_WARNING (op
))
4013 tree cop
= fold_non_dependent_expr (op
);
4015 if (TREE_CODE (cop
) == ADDR_EXPR
4016 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4017 && !TREE_NO_WARNING (cop
))
4018 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4019 "be NULL", TREE_OPERAND (cop
, 0));
4021 if (CONVERT_EXPR_P (op
)
4022 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == REFERENCE_TYPE
)
4025 STRIP_NOPS (inner_op
);
4027 if (DECL_P (inner_op
))
4028 warning_at (location
, OPT_Waddress
,
4029 "the compiler can assume that the address of "
4030 "%qD will never be NULL", inner_op
);
4034 /* Build a binary-operation expression without default conversions.
4035 CODE is the kind of expression to build.
4036 LOCATION is the location_t of the operator in the source code.
4037 This function differs from `build' in several ways:
4038 the data type of the result is computed and recorded in it,
4039 warnings are generated if arg data types are invalid,
4040 special handling for addition and subtraction of pointers is known,
4041 and some optimization is done (operations on narrow ints
4042 are done in the narrower type when that gives the same result).
4043 Constant folding is also done before the result is returned.
4045 Note that the operands will never have enumeral types
4046 because either they have just had the default conversions performed
4047 or they have both just been converted to some other type in which
4048 the arithmetic is to be done.
4050 C++: must do special pointer arithmetic when implementing
4051 multiple inheritance, and deal with pointer to member functions. */
4054 cp_build_binary_op (location_t location
,
4055 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4056 tsubst_flags_t complain
)
4059 enum tree_code code0
, code1
;
4061 const char *invalid_op_diag
;
4063 /* Expression code to give to the expression when it is built.
4064 Normally this is CODE, which is what the caller asked for,
4065 but in some special cases we change it. */
4066 enum tree_code resultcode
= code
;
4068 /* Data type in which the computation is to be performed.
4069 In the simplest cases this is the common type of the arguments. */
4070 tree result_type
= NULL
;
4072 /* Nonzero means operands have already been type-converted
4073 in whatever way is necessary.
4074 Zero means they need to be converted to RESULT_TYPE. */
4077 /* Nonzero means create the expression with this type, rather than
4079 tree build_type
= 0;
4081 /* Nonzero means after finally constructing the expression
4082 convert it to this type. */
4083 tree final_type
= 0;
4085 tree result
, result_ovl
;
4086 tree orig_type
= NULL
;
4088 /* Nonzero if this is an operation like MIN or MAX which can
4089 safely be computed in short if both args are promoted shorts.
4090 Also implies COMMON.
4091 -1 indicates a bitwise operation; this makes a difference
4092 in the exact conditions for when it is safe to do the operation
4093 in a narrower mode. */
4096 /* Nonzero if this is a comparison operation;
4097 if both args are promoted shorts, compare the original shorts.
4098 Also implies COMMON. */
4099 int short_compare
= 0;
4101 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4104 /* True if both operands have arithmetic type. */
4105 bool arithmetic_types_p
;
4107 /* Apply default conversions. */
4111 /* Remember whether we're doing / or %. */
4112 bool doing_div_or_mod
= false;
4114 /* Remember whether we're doing << or >>. */
4115 bool doing_shift
= false;
4117 /* Tree holding instrumentation expression. */
4118 tree instrument_expr
= NULL
;
4120 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4121 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4122 || code
== TRUTH_XOR_EXPR
)
4124 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4125 op0
= decay_conversion (op0
, complain
);
4126 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4127 op1
= decay_conversion (op1
, complain
);
4131 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4132 op0
= cp_default_conversion (op0
, complain
);
4133 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4134 op1
= cp_default_conversion (op1
, complain
);
4137 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4138 STRIP_TYPE_NOPS (op0
);
4139 STRIP_TYPE_NOPS (op1
);
4141 /* DTRT if one side is an overloaded function, but complain about it. */
4142 if (type_unknown_p (op0
))
4144 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4145 if (t
!= error_mark_node
)
4147 if (complain
& tf_error
)
4148 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4153 if (type_unknown_p (op1
))
4155 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4156 if (t
!= error_mark_node
)
4158 if (complain
& tf_error
)
4159 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4165 type0
= TREE_TYPE (op0
);
4166 type1
= TREE_TYPE (op1
);
4168 /* The expression codes of the data types of the arguments tell us
4169 whether the arguments are integers, floating, pointers, etc. */
4170 code0
= TREE_CODE (type0
);
4171 code1
= TREE_CODE (type1
);
4173 /* If an error was already reported for one of the arguments,
4174 avoid reporting another error. */
4175 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4176 return error_mark_node
;
4178 if ((invalid_op_diag
4179 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4181 if (complain
& tf_error
)
4182 error (invalid_op_diag
);
4183 return error_mark_node
;
4186 /* Issue warnings about peculiar, but valid, uses of NULL. */
4187 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
4188 /* It's reasonable to use pointer values as operands of &&
4189 and ||, so NULL is no exception. */
4190 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4191 && ( /* Both are NULL (or 0) and the operation was not a
4192 comparison or a pointer subtraction. */
4193 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4194 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4195 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4196 || (!null_ptr_cst_p (orig_op0
)
4197 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4198 || (!null_ptr_cst_p (orig_op1
)
4199 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4200 && (complain
& tf_warning
))
4202 source_location loc
=
4203 expansion_point_location_if_in_system_header (input_location
);
4205 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4208 /* In case when one of the operands of the binary operation is
4209 a vector and another is a scalar -- convert scalar to vector. */
4210 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4212 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4213 complain
& tf_error
);
4215 switch (convert_flag
)
4218 return error_mark_node
;
4221 op0
= convert (TREE_TYPE (type1
), op0
);
4222 op0
= save_expr (op0
);
4223 op0
= build_vector_from_val (type1
, op0
);
4224 type0
= TREE_TYPE (op0
);
4225 code0
= TREE_CODE (type0
);
4231 op1
= convert (TREE_TYPE (type0
), op1
);
4232 op1
= save_expr (op1
);
4233 op1
= build_vector_from_val (type0
, op1
);
4234 type1
= TREE_TYPE (op1
);
4235 code1
= TREE_CODE (type1
);
4247 /* Subtraction of two similar pointers.
4248 We must subtract them as integers, then divide by object size. */
4249 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4250 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4252 return pointer_diff (location
, op0
, op1
,
4253 common_pointer_type (type0
, type1
), complain
);
4254 /* In all other cases except pointer - int, the usual arithmetic
4256 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4261 /* The pointer - int case is just like pointer + int; fall
4264 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4265 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4269 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4270 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4271 if (processing_template_decl
)
4273 result_type
= TREE_TYPE (ptr_operand
);
4276 return cp_pointer_int_sum (location
, code
,
4288 case TRUNC_DIV_EXPR
:
4290 case FLOOR_DIV_EXPR
:
4291 case ROUND_DIV_EXPR
:
4292 case EXACT_DIV_EXPR
:
4293 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4294 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4295 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4296 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4298 enum tree_code tcode0
= code0
, tcode1
= code1
;
4299 tree cop1
= fold_non_dependent_expr (op1
);
4300 doing_div_or_mod
= true;
4301 warn_for_div_by_zero (location
, cop1
);
4303 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4304 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4305 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4306 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4308 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4309 resultcode
= RDIV_EXPR
;
4311 /* When dividing two signed integers, we have to promote to int.
4312 unless we divide by a constant != -1. Note that default
4313 conversion will have been performed on the operands at this
4314 point, so we have to dig out the original type to find out if
4316 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4317 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4318 || (TREE_CODE (op1
) == INTEGER_CST
4319 && ! integer_all_onesp (op1
)));
4328 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4329 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4330 && !VECTOR_FLOAT_TYPE_P (type0
)
4331 && !VECTOR_FLOAT_TYPE_P (type1
)))
4335 case TRUNC_MOD_EXPR
:
4336 case FLOOR_MOD_EXPR
:
4338 tree cop1
= fold_non_dependent_expr (op1
);
4339 doing_div_or_mod
= true;
4340 warn_for_div_by_zero (location
, cop1
);
4343 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4344 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4345 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4347 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4349 /* Although it would be tempting to shorten always here, that loses
4350 on some targets, since the modulo instruction is undefined if the
4351 quotient can't be represented in the computation mode. We shorten
4352 only if unsigned or if dividing by something we know != -1. */
4353 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4354 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4355 || (TREE_CODE (op1
) == INTEGER_CST
4356 && ! integer_all_onesp (op1
)));
4361 case TRUTH_ANDIF_EXPR
:
4362 case TRUTH_ORIF_EXPR
:
4363 case TRUTH_AND_EXPR
:
4365 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4367 if (!COMPARISON_CLASS_P (op1
))
4368 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4369 build_zero_cst (type1
), complain
);
4370 if (code
== TRUTH_ANDIF_EXPR
)
4372 tree z
= build_zero_cst (TREE_TYPE (op1
));
4373 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4375 else if (code
== TRUTH_ORIF_EXPR
)
4377 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4378 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4383 if (VECTOR_TYPE_P (type0
))
4385 if (!COMPARISON_CLASS_P (op0
))
4386 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4387 build_zero_cst (type0
), complain
);
4388 if (!VECTOR_TYPE_P (type1
))
4390 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4391 tree z
= build_zero_cst (TREE_TYPE (op0
));
4392 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4394 else if (!COMPARISON_CLASS_P (op1
))
4395 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4396 build_zero_cst (type1
), complain
);
4398 if (code
== TRUTH_ANDIF_EXPR
)
4399 code
= BIT_AND_EXPR
;
4400 else if (code
== TRUTH_ORIF_EXPR
)
4401 code
= BIT_IOR_EXPR
;
4405 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4408 result_type
= boolean_type_node
;
4411 /* Shift operations: result has same type as first operand;
4412 always convert second operand to int.
4413 Also set SHORT_SHIFT if shifting rightward. */
4416 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4417 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4419 result_type
= type0
;
4422 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4423 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4424 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4425 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4427 result_type
= type0
;
4430 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4432 tree const_op1
= fold_non_dependent_expr (op1
);
4433 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4435 result_type
= type0
;
4437 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4439 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4441 if ((complain
& tf_warning
)
4442 && c_inhibit_evaluation_warnings
== 0)
4443 warning (OPT_Wshift_count_negative
,
4444 "right shift count is negative");
4448 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4449 && (complain
& tf_warning
)
4450 && c_inhibit_evaluation_warnings
== 0)
4451 warning (OPT_Wshift_count_overflow
,
4452 "right shift count >= width of type");
4455 /* Avoid converting op1 to result_type later. */
4461 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4462 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4464 result_type
= type0
;
4467 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4468 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4469 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4470 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4472 result_type
= type0
;
4475 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4477 tree const_op0
= fold_non_dependent_expr (op0
);
4478 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4480 tree const_op1
= fold_non_dependent_expr (op1
);
4481 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4483 result_type
= type0
;
4485 if (TREE_CODE (const_op0
) == INTEGER_CST
4486 && tree_int_cst_sgn (const_op0
) < 0
4487 && (complain
& tf_warning
)
4488 && c_inhibit_evaluation_warnings
== 0)
4489 warning (OPT_Wshift_negative_value
,
4490 "left shift of negative value");
4491 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4493 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4495 if ((complain
& tf_warning
)
4496 && c_inhibit_evaluation_warnings
== 0)
4497 warning (OPT_Wshift_count_negative
,
4498 "left shift count is negative");
4500 else if (compare_tree_int (const_op1
,
4501 TYPE_PRECISION (type0
)) >= 0)
4503 if ((complain
& tf_warning
)
4504 && c_inhibit_evaluation_warnings
== 0)
4505 warning (OPT_Wshift_count_overflow
,
4506 "left shift count >= width of type");
4508 else if (TREE_CODE (const_op0
) == INTEGER_CST
4509 && (complain
& tf_warning
))
4510 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4512 /* Avoid converting op1 to result_type later. */
4519 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4521 result_type
= type0
;
4522 if (TREE_CODE (op1
) == INTEGER_CST
)
4524 if (tree_int_cst_lt (op1
, integer_zero_node
))
4526 if (complain
& tf_warning
)
4527 warning (0, (code
== LROTATE_EXPR
)
4528 ? G_("left rotate count is negative")
4529 : G_("right rotate count is negative"));
4531 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4533 if (complain
& tf_warning
)
4534 warning (0, (code
== LROTATE_EXPR
)
4535 ? G_("left rotate count >= width of type")
4536 : G_("right rotate count >= width of type"));
4539 /* Convert the shift-count to an integer, regardless of
4540 size of value being shifted. */
4541 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4542 op1
= cp_convert (integer_type_node
, op1
, complain
);
4548 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4549 goto vector_compare
;
4550 if ((complain
& tf_warning
)
4551 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4552 warning (OPT_Wfloat_equal
,
4553 "comparing floating point with == or != is unsafe");
4554 if ((complain
& tf_warning
)
4555 && ((TREE_CODE (orig_op0
) == STRING_CST
4556 && !integer_zerop (cp_fully_fold (op1
)))
4557 || (TREE_CODE (orig_op1
) == STRING_CST
4558 && !integer_zerop (cp_fully_fold (op0
)))))
4559 warning (OPT_Waddress
, "comparison with string literal results "
4560 "in unspecified behavior");
4562 build_type
= boolean_type_node
;
4563 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4564 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4565 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4566 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4568 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4569 && null_ptr_cst_p (op1
))
4570 /* Handle, eg, (void*)0 (c++/43906), and more. */
4571 || (code0
== POINTER_TYPE
4572 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4574 if (TYPE_PTR_P (type1
))
4575 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4576 CPO_COMPARISON
, complain
);
4578 result_type
= type0
;
4580 warn_for_null_address (location
, op0
, complain
);
4582 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4583 && null_ptr_cst_p (op0
))
4584 /* Handle, eg, (void*)0 (c++/43906), and more. */
4585 || (code1
== POINTER_TYPE
4586 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4588 if (TYPE_PTR_P (type0
))
4589 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4590 CPO_COMPARISON
, complain
);
4592 result_type
= type1
;
4594 warn_for_null_address (location
, op1
, complain
);
4596 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4597 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4598 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4599 CPO_COMPARISON
, complain
);
4600 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4601 /* One of the operands must be of nullptr_t type. */
4602 result_type
= TREE_TYPE (nullptr_node
);
4603 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4605 result_type
= type0
;
4606 if (complain
& tf_error
)
4607 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4609 return error_mark_node
;
4611 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4613 result_type
= type1
;
4614 if (complain
& tf_error
)
4615 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4617 return error_mark_node
;
4619 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4621 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4622 == ptrmemfunc_vbit_in_delta
)
4624 tree pfn0
, delta0
, e1
, e2
;
4626 if (TREE_SIDE_EFFECTS (op0
))
4627 op0
= save_expr (op0
);
4629 pfn0
= pfn_from_ptrmemfunc (op0
);
4630 delta0
= delta_from_ptrmemfunc (op0
);
4631 e1
= cp_build_binary_op (location
,
4634 build_zero_cst (TREE_TYPE (pfn0
)),
4636 e2
= cp_build_binary_op (location
,
4642 if (complain
& tf_warning
)
4643 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4645 e2
= cp_build_binary_op (location
,
4646 EQ_EXPR
, e2
, integer_zero_node
,
4648 op0
= cp_build_binary_op (location
,
4649 TRUTH_ANDIF_EXPR
, e1
, e2
,
4651 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4655 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4656 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4658 result_type
= TREE_TYPE (op0
);
4660 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4661 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4662 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4665 /* E will be the final comparison. */
4667 /* E1 and E2 are for scratch. */
4675 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4676 CPO_COMPARISON
, complain
);
4678 if (!same_type_p (TREE_TYPE (op0
), type
))
4679 op0
= cp_convert_and_check (type
, op0
, complain
);
4680 if (!same_type_p (TREE_TYPE (op1
), type
))
4681 op1
= cp_convert_and_check (type
, op1
, complain
);
4683 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4684 return error_mark_node
;
4686 if (TREE_SIDE_EFFECTS (op0
))
4687 op0
= save_expr (op0
);
4688 if (TREE_SIDE_EFFECTS (op1
))
4689 op1
= save_expr (op1
);
4691 pfn0
= pfn_from_ptrmemfunc (op0
);
4692 pfn0
= cp_fully_fold (pfn0
);
4693 /* Avoid -Waddress warnings (c++/64877). */
4694 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4695 TREE_NO_WARNING (pfn0
) = 1;
4696 pfn1
= pfn_from_ptrmemfunc (op1
);
4697 pfn1
= cp_fully_fold (pfn1
);
4698 delta0
= delta_from_ptrmemfunc (op0
);
4699 delta1
= delta_from_ptrmemfunc (op1
);
4700 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4701 == ptrmemfunc_vbit_in_delta
)
4706 && ((op0.delta == op1.delta)
4707 || (!op0.pfn && op0.delta & 1 == 0
4708 && op1.delta & 1 == 0))
4710 The reason for the `!op0.pfn' bit is that a NULL
4711 pointer-to-member is any member with a zero PFN and
4712 LSB of the DELTA field is 0. */
4714 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4718 e1
= cp_build_binary_op (location
,
4719 EQ_EXPR
, e1
, integer_zero_node
,
4721 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4725 e2
= cp_build_binary_op (location
,
4726 EQ_EXPR
, e2
, integer_zero_node
,
4728 e1
= cp_build_binary_op (location
,
4729 TRUTH_ANDIF_EXPR
, e2
, e1
,
4731 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4733 build_zero_cst (TREE_TYPE (pfn0
)),
4735 e2
= cp_build_binary_op (location
,
4736 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4737 e1
= cp_build_binary_op (location
,
4738 EQ_EXPR
, delta0
, delta1
, complain
);
4739 e1
= cp_build_binary_op (location
,
4740 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4747 && (!op0.pfn || op0.delta == op1.delta))
4749 The reason for the `!op0.pfn' bit is that a NULL
4750 pointer-to-member is any member with a zero PFN; the
4751 DELTA field is unspecified. */
4753 e1
= cp_build_binary_op (location
,
4754 EQ_EXPR
, delta0
, delta1
, complain
);
4755 e2
= cp_build_binary_op (location
,
4758 build_zero_cst (TREE_TYPE (pfn0
)),
4760 e1
= cp_build_binary_op (location
,
4761 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4763 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4764 e
= cp_build_binary_op (location
,
4765 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4766 if (code
== EQ_EXPR
)
4768 return cp_build_binary_op (location
,
4769 EQ_EXPR
, e
, integer_zero_node
, complain
);
4773 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4774 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4776 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4777 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4785 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4786 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4788 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4789 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4790 CPO_COMPARISON
, complain
);
4797 if (TREE_CODE (orig_op0
) == STRING_CST
4798 || TREE_CODE (orig_op1
) == STRING_CST
)
4800 if (complain
& tf_warning
)
4801 warning (OPT_Waddress
, "comparison with string literal results "
4802 "in unspecified behavior");
4805 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4809 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4811 && !vector_types_compatible_elements_p (type0
, type1
))
4813 if (complain
& tf_error
)
4815 error_at (location
, "comparing vectors with different "
4817 inform (location
, "operand types are %qT and %qT",
4820 return error_mark_node
;
4823 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
4825 if (complain
& tf_error
)
4827 error_at (location
, "comparing vectors with different "
4828 "number of elements");
4829 inform (location
, "operand types are %qT and %qT",
4832 return error_mark_node
;
4835 /* It's not precisely specified how the usual arithmetic
4836 conversions apply to the vector types. Here, we use
4837 the unsigned type if one of the operands is signed and
4838 the other one is unsigned. */
4839 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
4841 if (!TYPE_UNSIGNED (type0
))
4842 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
4844 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
4845 warning_at (location
, OPT_Wsign_compare
, "comparison between "
4846 "types %qT and %qT", type0
, type1
);
4849 /* Always construct signed integer vector type. */
4850 intt
= c_common_type_for_size (GET_MODE_BITSIZE
4851 (TYPE_MODE (TREE_TYPE (type0
))), 0);
4854 if (complain
& tf_error
)
4855 error_at (location
, "could not find an integer type "
4856 "of the same size as %qT", TREE_TYPE (type0
));
4857 return error_mark_node
;
4859 result_type
= build_opaque_vector_type (intt
,
4860 TYPE_VECTOR_SUBPARTS (type0
));
4862 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
4864 build_type
= boolean_type_node
;
4865 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4866 || code0
== ENUMERAL_TYPE
)
4867 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4868 || code1
== ENUMERAL_TYPE
))
4870 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4871 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4872 CPO_COMPARISON
, complain
);
4873 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4875 result_type
= type0
;
4876 if (extra_warnings
&& (complain
& tf_warning
))
4877 warning (OPT_Wextra
,
4878 "ordered comparison of pointer with integer zero");
4880 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4882 result_type
= type1
;
4883 if (extra_warnings
&& (complain
& tf_warning
))
4884 warning (OPT_Wextra
,
4885 "ordered comparison of pointer with integer zero");
4887 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4888 /* One of the operands must be of nullptr_t type. */
4889 result_type
= TREE_TYPE (nullptr_node
);
4890 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4892 result_type
= type0
;
4893 if (complain
& tf_error
)
4894 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4896 return error_mark_node
;
4898 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4900 result_type
= type1
;
4901 if (complain
& tf_error
)
4902 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4904 return error_mark_node
;
4908 case UNORDERED_EXPR
:
4915 build_type
= integer_type_node
;
4916 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4918 if (complain
& tf_error
)
4919 error ("unordered comparison on non-floating point argument");
4920 return error_mark_node
;
4929 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4930 || code0
== ENUMERAL_TYPE
)
4931 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4932 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4933 arithmetic_types_p
= 1;
4936 arithmetic_types_p
= 0;
4937 /* Vector arithmetic is only allowed when both sides are vectors. */
4938 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4940 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4941 || !vector_types_compatible_elements_p (type0
, type1
))
4943 if (complain
& tf_error
)
4945 /* "location" already embeds the locations of the
4946 operands, so we don't need to add them separately
4948 rich_location
richloc (line_table
, location
);
4949 binary_op_error (&richloc
, code
, type0
, type1
);
4951 return error_mark_node
;
4953 arithmetic_types_p
= 1;
4956 /* Determine the RESULT_TYPE, if it is not already known. */
4958 && arithmetic_types_p
4959 && (shorten
|| common
|| short_compare
))
4961 result_type
= cp_common_type (type0
, type1
);
4962 if (complain
& tf_warning
)
4963 do_warn_double_promotion (result_type
, type0
, type1
,
4964 "implicit conversion from %qT to %qT "
4965 "to match other operand of binary "
4972 if (complain
& tf_error
)
4974 "invalid operands of types %qT and %qT to binary %qO",
4975 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4976 return error_mark_node
;
4979 /* If we're in a template, the only thing we need to know is the
4981 if (processing_template_decl
)
4983 /* Since the middle-end checks the type when doing a build2, we
4984 need to build the tree in pieces. This built tree will never
4985 get out of the front-end as we replace it when instantiating
4987 tree tmp
= build2 (resultcode
,
4988 build_type
? build_type
: result_type
,
4990 TREE_OPERAND (tmp
, 0) = op0
;
4994 if (arithmetic_types_p
)
4996 bool first_complex
= (code0
== COMPLEX_TYPE
);
4997 bool second_complex
= (code1
== COMPLEX_TYPE
);
4998 int none_complex
= (!first_complex
&& !second_complex
);
5000 /* Adapted from patch for c/24581. */
5001 if (first_complex
!= second_complex
5002 && (code
== PLUS_EXPR
5003 || code
== MINUS_EXPR
5004 || code
== MULT_EXPR
5005 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5006 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5007 && flag_signed_zeros
)
5009 /* An operation on mixed real/complex operands must be
5010 handled specially, but the language-independent code can
5011 more easily optimize the plain complex arithmetic if
5012 -fno-signed-zeros. */
5013 tree real_type
= TREE_TYPE (result_type
);
5017 if (TREE_TYPE (op0
) != result_type
)
5018 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5019 if (TREE_TYPE (op1
) != real_type
)
5020 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5024 if (TREE_TYPE (op0
) != real_type
)
5025 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5026 if (TREE_TYPE (op1
) != result_type
)
5027 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5029 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5030 return error_mark_node
;
5033 op0
= save_expr (op0
);
5034 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
5035 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
5039 case TRUNC_DIV_EXPR
:
5040 op1
= save_expr (op1
);
5041 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5045 real
= build2 (resultcode
, real_type
, real
, op1
);
5053 op1
= save_expr (op1
);
5054 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
5055 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
5059 op0
= save_expr (op0
);
5060 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5063 real
= build2 (resultcode
, real_type
, op0
, real
);
5066 real
= build2 (resultcode
, real_type
, op0
, real
);
5067 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5073 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5077 /* For certain operations (which identify themselves by shorten != 0)
5078 if both args were extended from the same smaller type,
5079 do the arithmetic in that type and then extend.
5081 shorten !=0 and !=1 indicates a bitwise operation.
5082 For them, this optimization is safe only if
5083 both args are zero-extended or both are sign-extended.
5084 Otherwise, we might change the result.
5085 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5086 but calculated in (unsigned short) it would be (unsigned short)-1. */
5088 if (shorten
&& none_complex
)
5090 orig_type
= result_type
;
5091 final_type
= result_type
;
5092 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5096 /* Comparison operations are shortened too but differently.
5097 They identify themselves by setting short_compare = 1. */
5101 /* We call shorten_compare only for diagnostic-reason. */
5102 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5103 xresult_type
= result_type
;
5104 enum tree_code xresultcode
= resultcode
;
5105 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5109 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5110 && warn_sign_compare
5111 /* Do not warn until the template is instantiated; we cannot
5112 bound the ranges of the arguments until that point. */
5113 && !processing_template_decl
5114 && (complain
& tf_warning
)
5115 && c_inhibit_evaluation_warnings
== 0
5116 /* Even unsigned enum types promote to signed int. We don't
5117 want to issue -Wsign-compare warnings for this case. */
5118 && !enum_cast_to_int (orig_op0
)
5119 && !enum_cast_to_int (orig_op1
))
5121 tree oop0
= maybe_constant_value (orig_op0
);
5122 tree oop1
= maybe_constant_value (orig_op1
);
5124 if (TREE_CODE (oop0
) != INTEGER_CST
)
5125 oop0
= cp_fully_fold (orig_op0
);
5126 if (TREE_CODE (oop1
) != INTEGER_CST
)
5127 oop1
= cp_fully_fold (orig_op1
);
5128 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5129 result_type
, resultcode
);
5133 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5134 Then the expression will be built.
5135 It will be given type FINAL_TYPE if that is nonzero;
5136 otherwise, it will be given type RESULT_TYPE. */
5139 if (TREE_TYPE (op0
) != result_type
)
5140 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5141 if (TREE_TYPE (op1
) != result_type
)
5142 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5144 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5145 return error_mark_node
;
5148 if (build_type
== NULL_TREE
)
5149 build_type
= result_type
;
5151 if ((flag_sanitize
& (SANITIZE_SHIFT
| SANITIZE_DIVIDE
5152 | SANITIZE_FLOAT_DIVIDE
))
5153 && !processing_template_decl
5154 && do_ubsan_in_current_function ()
5155 && (doing_div_or_mod
|| doing_shift
))
5157 /* OP0 and/or OP1 might have side-effects. */
5158 op0
= cp_save_expr (op0
);
5159 op1
= cp_save_expr (op1
);
5160 op0
= fold_non_dependent_expr (op0
);
5161 op1
= fold_non_dependent_expr (op1
);
5162 if (doing_div_or_mod
&& (flag_sanitize
& (SANITIZE_DIVIDE
5163 | SANITIZE_FLOAT_DIVIDE
)))
5165 /* For diagnostics we want to use the promoted types without
5166 shorten_binary_op. So convert the arguments to the
5167 original result_type. */
5170 if (orig_type
!= NULL
&& result_type
!= orig_type
)
5172 cop0
= cp_convert (orig_type
, op0
, complain
);
5173 cop1
= cp_convert (orig_type
, op1
, complain
);
5175 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5177 else if (doing_shift
&& (flag_sanitize
& SANITIZE_SHIFT
))
5178 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5181 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5182 if (final_type
!= 0)
5183 result
= cp_convert (final_type
, result
, complain
);
5185 if (instrument_expr
!= NULL
)
5186 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5187 instrument_expr
, result
);
5189 if (!processing_template_decl
)
5191 op0
= cp_fully_fold (op0
);
5192 /* Only consider the second argument if the first isn't overflowed. */
5193 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5195 op1
= cp_fully_fold (op1
);
5196 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5199 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5200 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5203 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5204 if (TREE_OVERFLOW_P (result_ovl
))
5205 overflow_warning (location
, result_ovl
);
5210 /* Build a VEC_PERM_EXPR.
5211 This is a simple wrapper for c_build_vec_perm_expr. */
5213 build_x_vec_perm_expr (location_t loc
,
5214 tree arg0
, tree arg1
, tree arg2
,
5215 tsubst_flags_t complain
)
5217 tree orig_arg0
= arg0
;
5218 tree orig_arg1
= arg1
;
5219 tree orig_arg2
= arg2
;
5220 if (processing_template_decl
)
5222 if (type_dependent_expression_p (arg0
)
5223 || type_dependent_expression_p (arg1
)
5224 || type_dependent_expression_p (arg2
))
5225 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5226 arg0
= build_non_dependent_expr (arg0
);
5228 arg1
= build_non_dependent_expr (arg1
);
5229 arg2
= build_non_dependent_expr (arg2
);
5231 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5232 if (processing_template_decl
&& exp
!= error_mark_node
)
5233 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5234 orig_arg1
, orig_arg2
);
5238 /* Return a tree for the sum or difference (RESULTCODE says which)
5239 of pointer PTROP and integer INTOP. */
5242 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5243 tree intop
, tsubst_flags_t complain
)
5245 tree res_type
= TREE_TYPE (ptrop
);
5247 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5248 in certain circumstance (when it's valid to do so). So we need
5249 to make sure it's complete. We don't need to check here, if we
5250 can actually complete it at all, as those checks will be done in
5251 pointer_int_sum() anyway. */
5252 complete_type (TREE_TYPE (res_type
));
5254 return pointer_int_sum (loc
, resultcode
, ptrop
,
5255 intop
, complain
& tf_warning_or_error
);
5258 /* Return a tree for the difference of pointers OP0 and OP1.
5259 The resulting tree has type int. */
5262 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5263 tsubst_flags_t complain
)
5266 tree restype
= ptrdiff_type_node
;
5267 tree target_type
= TREE_TYPE (ptrtype
);
5269 if (!complete_type_or_else (target_type
, NULL_TREE
))
5270 return error_mark_node
;
5272 if (VOID_TYPE_P (target_type
))
5274 if (complain
& tf_error
)
5275 permerror (loc
, "ISO C++ forbids using pointer of "
5276 "type %<void *%> in subtraction");
5278 return error_mark_node
;
5280 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5282 if (complain
& tf_error
)
5283 permerror (loc
, "ISO C++ forbids using pointer to "
5284 "a function in subtraction");
5286 return error_mark_node
;
5288 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5290 if (complain
& tf_error
)
5291 permerror (loc
, "ISO C++ forbids using pointer to "
5292 "a method in subtraction");
5294 return error_mark_node
;
5297 /* First do the subtraction as integers;
5298 then drop through to build the divide operator. */
5300 op0
= cp_build_binary_op (loc
,
5302 cp_convert (restype
, op0
, complain
),
5303 cp_convert (restype
, op1
, complain
),
5306 /* This generates an error if op1 is a pointer to an incomplete type. */
5307 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5309 if (complain
& tf_error
)
5310 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5311 "pointer arithmetic");
5313 return error_mark_node
;
5316 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5318 if (complain
& tf_error
)
5319 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5321 return error_mark_node
;
5324 op1
= (TYPE_PTROB_P (ptrtype
)
5325 ? size_in_bytes_loc (loc
, target_type
)
5326 : integer_one_node
);
5328 /* Do the division. */
5330 result
= build2_loc (loc
, EXACT_DIV_EXPR
, restype
, op0
,
5331 cp_convert (restype
, op1
, complain
));
5335 /* Construct and perhaps optimize a tree representation
5336 for a unary operation. CODE, a tree_code, specifies the operation
5337 and XARG is the operand. */
5340 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5341 tsubst_flags_t complain
)
5343 tree orig_expr
= xarg
;
5346 tree overload
= NULL_TREE
;
5348 if (processing_template_decl
)
5350 if (type_dependent_expression_p (xarg
))
5351 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5353 xarg
= build_non_dependent_expr (xarg
);
5358 /* [expr.unary.op] says:
5360 The address of an object of incomplete type can be taken.
5362 (And is just the ordinary address operator, not an overloaded
5363 "operator &".) However, if the type is a template
5364 specialization, we must complete the type at this point so that
5365 an overloaded "operator &" will be available if required. */
5366 if (code
== ADDR_EXPR
5367 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5368 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5369 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5370 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5371 /* Don't look for a function. */;
5373 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5374 NULL_TREE
, &overload
, complain
);
5376 if (!exp
&& code
== ADDR_EXPR
)
5378 if (is_overloaded_fn (xarg
))
5380 tree fn
= get_first_fn (xarg
);
5381 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5383 if (complain
& tf_error
)
5384 error (DECL_CONSTRUCTOR_P (fn
)
5385 ? G_("taking address of constructor %qE")
5386 : G_("taking address of destructor %qE"),
5388 return error_mark_node
;
5392 /* A pointer to member-function can be formed only by saying
5394 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5395 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5397 if (TREE_CODE (xarg
) != OFFSET_REF
5398 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5400 if (complain
& tf_error
)
5402 error ("invalid use of %qE to form a "
5403 "pointer-to-member-function", xarg
.get_value ());
5404 if (TREE_CODE (xarg
) != OFFSET_REF
)
5405 inform (input_location
, " a qualified-id is required");
5407 return error_mark_node
;
5411 if (complain
& tf_error
)
5412 error ("parentheses around %qE cannot be used to form a"
5413 " pointer-to-member-function",
5416 return error_mark_node
;
5417 PTRMEM_OK_P (xarg
) = 1;
5421 if (TREE_CODE (xarg
) == OFFSET_REF
)
5423 ptrmem
= PTRMEM_OK_P (xarg
);
5425 if (!ptrmem
&& !flag_ms_extensions
5426 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5428 /* A single non-static member, make sure we don't allow a
5429 pointer-to-member. */
5430 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5431 TREE_OPERAND (xarg
, 0),
5432 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
5433 PTRMEM_OK_P (xarg
) = ptrmem
;
5437 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5440 if (processing_template_decl
&& exp
!= error_mark_node
)
5442 if (overload
!= NULL_TREE
)
5443 return (build_min_non_dep_op_overload
5444 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5446 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5447 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5449 if (TREE_CODE (exp
) == ADDR_EXPR
)
5450 PTRMEM_OK_P (exp
) = ptrmem
;
5454 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5455 constants, where a null value is represented by an INTEGER_CST of
5459 cp_truthvalue_conversion (tree expr
)
5461 tree type
= TREE_TYPE (expr
);
5462 if (TYPE_PTRDATAMEM_P (type
)
5463 /* Avoid ICE on invalid use of non-static member function. */
5464 || TREE_CODE (expr
) == FUNCTION_DECL
)
5465 return build_binary_op (EXPR_LOCATION (expr
),
5466 NE_EXPR
, expr
, nullptr_node
, 1);
5467 else if (TYPE_PTR_P (type
) || TYPE_PTRMEMFUNC_P (type
))
5469 /* With -Wzero-as-null-pointer-constant do not warn for an
5470 'if (p)' or a 'while (!p)', where p is a pointer. */
5472 ++c_inhibit_evaluation_warnings
;
5473 ret
= c_common_truthvalue_conversion (input_location
, expr
);
5474 --c_inhibit_evaluation_warnings
;
5478 return c_common_truthvalue_conversion (input_location
, expr
);
5481 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5484 condition_conversion (tree expr
)
5487 if (processing_template_decl
)
5489 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5490 tf_warning_or_error
, LOOKUP_NORMAL
);
5491 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5495 /* Returns the address of T. This function will fold away
5496 ADDR_EXPR of INDIRECT_REF. */
5499 build_address (tree t
)
5501 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5502 return error_mark_node
;
5503 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
);
5504 t
= build_fold_addr_expr (t
);
5505 if (TREE_CODE (t
) != ADDR_EXPR
)
5510 /* Return a NOP_EXPR converting EXPR to TYPE. */
5513 build_nop (tree type
, tree expr
)
5515 if (type
== error_mark_node
|| error_operand_p (expr
))
5517 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5520 /* Take the address of ARG, whatever that means under C++ semantics.
5521 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5522 and class rvalues as well.
5524 Nothing should call this function directly; instead, callers should use
5525 cp_build_addr_expr or cp_build_addr_expr_strict. */
5528 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5533 if (!arg
|| error_operand_p (arg
))
5534 return error_mark_node
;
5536 arg
= mark_lvalue_use (arg
);
5537 argtype
= lvalue_type (arg
);
5539 gcc_assert (!identifier_p (arg
) || !IDENTIFIER_OPNAME_P (arg
));
5541 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5542 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5544 /* They're trying to take the address of a unique non-static
5545 member function. This is ill-formed (except in MS-land),
5546 but let's try to DTRT.
5547 Note: We only handle unique functions here because we don't
5548 want to complain if there's a static overload; non-unique
5549 cases will be handled by instantiate_type. But we need to
5550 handle this case here to allow casts on the resulting PMF.
5551 We could defer this in non-MS mode, but it's easier to give
5552 a useful error here. */
5554 /* Inside constant member functions, the `this' pointer
5555 contains an extra const qualifier. TYPE_MAIN_VARIANT
5556 is used here to remove this const from the diagnostics
5557 and the created OFFSET_REF. */
5558 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5559 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5560 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5561 return error_mark_node
;
5563 if (! flag_ms_extensions
)
5565 tree name
= DECL_NAME (fn
);
5566 if (!(complain
& tf_error
))
5567 return error_mark_node
;
5568 else if (current_class_type
5569 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5570 /* An expression like &memfn. */
5571 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5572 " or parenthesized non-static member function to form"
5573 " a pointer to member function. Say %<&%T::%D%>",
5576 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5577 " function to form a pointer to member function."
5581 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5584 /* Uninstantiated types are all functions. Taking the
5585 address of a function is a no-op, so just return the
5587 if (type_unknown_p (arg
))
5588 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5590 if (TREE_CODE (arg
) == OFFSET_REF
)
5591 /* We want a pointer to member; bypass all the code for actually taking
5592 the address of something. */
5595 /* Anything not already handled and not a true memory reference
5597 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5598 && TREE_CODE (argtype
) != METHOD_TYPE
)
5600 cp_lvalue_kind kind
= lvalue_kind (arg
);
5601 if (kind
== clk_none
)
5603 if (complain
& tf_error
)
5604 lvalue_error (input_location
, lv_addressof
);
5605 return error_mark_node
;
5607 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5609 if (!(complain
& tf_error
))
5610 return error_mark_node
;
5611 if (kind
& clk_class
)
5612 /* Make this a permerror because we used to accept it. */
5613 permerror (input_location
, "taking address of temporary");
5615 error ("taking address of xvalue (rvalue reference)");
5619 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5621 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5622 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5625 else if (pedantic
&& DECL_MAIN_P (arg
))
5628 /* Apparently a lot of autoconf scripts for C++ packages do this,
5629 so only complain if -Wpedantic. */
5630 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5631 pedwarn (input_location
, OPT_Wpedantic
,
5632 "ISO C++ forbids taking address of function %<::main%>");
5633 else if (flag_pedantic_errors
)
5634 return error_mark_node
;
5637 /* Let &* cancel out to simplify resulting code. */
5638 if (INDIRECT_REF_P (arg
))
5640 /* We don't need to have `current_class_ptr' wrapped in a
5641 NON_LVALUE_EXPR node. */
5642 if (arg
== current_class_ref
)
5643 return current_class_ptr
;
5645 arg
= TREE_OPERAND (arg
, 0);
5646 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5648 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5649 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5652 /* Don't let this be an lvalue. */
5657 /* ??? Cope with user tricks that amount to offsetof. */
5658 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5659 && TREE_CODE (argtype
) != METHOD_TYPE
5660 && argtype
!= unknown_type_node
5661 && (val
= get_base_address (arg
))
5662 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5663 && INDIRECT_REF_P (val
)
5664 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5666 tree type
= build_pointer_type (argtype
);
5667 return fold_convert (type
, fold_offsetof_1 (arg
));
5670 /* Handle complex lvalues (when permitted)
5671 by reduction to simpler cases. */
5672 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5676 switch (TREE_CODE (arg
))
5680 case FIX_TRUNC_EXPR
:
5681 /* Even if we're not being pedantic, we cannot allow this
5682 extension when we're instantiating in a SFINAE
5684 if (! lvalue_p (arg
) && complain
== tf_none
)
5686 if (complain
& tf_error
)
5687 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5689 return error_mark_node
;
5694 arg
= BASELINK_FUNCTIONS (arg
);
5698 arg
= OVL_CURRENT (arg
);
5703 /* Turn a reference to a non-static data member into a
5704 pointer-to-member. */
5709 gcc_assert (PTRMEM_OK_P (arg
));
5711 t
= TREE_OPERAND (arg
, 1);
5712 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5714 if (complain
& tf_error
)
5715 error ("cannot create pointer to reference member %qD", t
);
5716 return error_mark_node
;
5719 type
= build_ptrmem_type (context_for_name_lookup (t
),
5721 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5729 if (argtype
!= error_mark_node
)
5730 argtype
= build_pointer_type (argtype
);
5732 /* In a template, we are processing a non-dependent expression
5733 so we can just form an ADDR_EXPR with the correct type. */
5734 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5736 val
= build_address (arg
);
5737 if (TREE_CODE (arg
) == OFFSET_REF
)
5738 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5740 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5742 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5744 /* We can only get here with a single static member
5746 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5747 && DECL_STATIC_FUNCTION_P (fn
));
5748 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5749 return error_mark_node
;
5750 val
= build_address (fn
);
5751 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5752 /* Do not lose object's side effects. */
5753 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5754 TREE_OPERAND (arg
, 0), val
);
5756 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5758 if (complain
& tf_error
)
5759 error ("attempt to take address of bit-field structure member %qD",
5760 TREE_OPERAND (arg
, 1));
5761 return error_mark_node
;
5765 tree object
= TREE_OPERAND (arg
, 0);
5766 tree field
= TREE_OPERAND (arg
, 1);
5767 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5768 (TREE_TYPE (object
), decl_type_context (field
)));
5769 val
= build_address (arg
);
5772 if (TYPE_PTR_P (argtype
)
5773 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5775 build_ptrmemfunc_type (argtype
);
5776 val
= build_ptrmemfunc (argtype
, val
, 0,
5784 /* Take the address of ARG if it has one, even if it's an rvalue. */
5787 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5789 return cp_build_addr_expr_1 (arg
, 0, complain
);
5792 /* Take the address of ARG, but only if it's an lvalue. */
5795 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5797 return cp_build_addr_expr_1 (arg
, 1, complain
);
5800 /* C++: Must handle pointers to members.
5802 Perhaps type instantiation should be extended to handle conversion
5803 from aggregates to types we don't yet know we want? (Or are those
5804 cases typically errors which should be reported?)
5806 NOCONVERT nonzero suppresses the default promotions
5807 (such as from short to int). */
5810 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5811 tsubst_flags_t complain
)
5813 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5816 const char *errstring
= NULL
;
5818 const char *invalid_op_diag
;
5820 if (!arg
|| error_operand_p (arg
))
5821 return error_mark_node
;
5823 if ((invalid_op_diag
5824 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5829 if (complain
& tf_error
)
5830 error (invalid_op_diag
);
5831 return error_mark_node
;
5836 case UNARY_PLUS_EXPR
:
5839 int flags
= WANT_ARITH
| WANT_ENUM
;
5840 /* Unary plus (but not unary minus) is allowed on pointers. */
5841 if (code
== UNARY_PLUS_EXPR
)
5842 flags
|= WANT_POINTER
;
5843 arg
= build_expr_type_conversion (flags
, arg
, true);
5845 errstring
= (code
== NEGATE_EXPR
5846 ? _("wrong type argument to unary minus")
5847 : _("wrong type argument to unary plus"));
5850 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5851 arg
= cp_perform_integral_promotions (arg
, complain
);
5853 /* Make sure the result is not an lvalue: a unary plus or minus
5854 expression is always a rvalue. */
5861 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5866 arg
= cp_default_conversion (arg
, complain
);
5867 if (arg
== error_mark_node
)
5868 return error_mark_node
;
5871 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5872 | WANT_VECTOR_OR_COMPLEX
,
5874 errstring
= _("wrong type argument to bit-complement");
5875 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5876 arg
= cp_perform_integral_promotions (arg
, complain
);
5880 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5881 errstring
= _("wrong type argument to abs");
5882 else if (!noconvert
)
5884 arg
= cp_default_conversion (arg
, complain
);
5885 if (arg
== error_mark_node
)
5886 return error_mark_node
;
5891 /* Conjugating a real value is a no-op, but allow it anyway. */
5892 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5893 errstring
= _("wrong type argument to conjugation");
5894 else if (!noconvert
)
5896 arg
= cp_default_conversion (arg
, complain
);
5897 if (arg
== error_mark_node
)
5898 return error_mark_node
;
5902 case TRUTH_NOT_EXPR
:
5903 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
5904 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
5905 build_zero_cst (TREE_TYPE (arg
)), complain
);
5906 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5908 val
= invert_truthvalue_loc (input_location
, arg
);
5909 if (arg
!= error_mark_node
)
5911 errstring
= _("in argument to unary !");
5919 arg
= build_real_imag_expr (input_location
, code
, arg
);
5922 case PREINCREMENT_EXPR
:
5923 case POSTINCREMENT_EXPR
:
5924 case PREDECREMENT_EXPR
:
5925 case POSTDECREMENT_EXPR
:
5926 /* Handle complex lvalues (when permitted)
5927 by reduction to simpler cases. */
5929 val
= unary_complex_lvalue (code
, arg
);
5933 arg
= mark_lvalue_use (arg
);
5935 /* Increment or decrement the real part of the value,
5936 and don't change the imaginary part. */
5937 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5941 arg
= cp_stabilize_reference (arg
);
5942 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5943 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5944 real
= cp_build_unary_op (code
, real
, 1, complain
);
5945 if (real
== error_mark_node
|| imag
== error_mark_node
)
5946 return error_mark_node
;
5947 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5951 /* Report invalid types. */
5953 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5956 if (code
== PREINCREMENT_EXPR
)
5957 errstring
= _("no pre-increment operator for type");
5958 else if (code
== POSTINCREMENT_EXPR
)
5959 errstring
= _("no post-increment operator for type");
5960 else if (code
== PREDECREMENT_EXPR
)
5961 errstring
= _("no pre-decrement operator for type");
5963 errstring
= _("no post-decrement operator for type");
5966 else if (arg
== error_mark_node
)
5967 return error_mark_node
;
5969 /* Report something read-only. */
5971 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5972 || TREE_READONLY (arg
))
5974 if (complain
& tf_error
)
5975 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5976 || code
== POSTINCREMENT_EXPR
)
5977 ? lv_increment
: lv_decrement
));
5979 return error_mark_node
;
5984 tree declared_type
= unlowered_expr_type (arg
);
5986 argtype
= TREE_TYPE (arg
);
5988 /* ARM $5.2.5 last annotation says this should be forbidden. */
5989 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5991 if (complain
& tf_error
)
5992 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5993 ? G_("ISO C++ forbids incrementing an enum")
5994 : G_("ISO C++ forbids decrementing an enum"));
5996 return error_mark_node
;
5999 /* Compute the increment. */
6001 if (TYPE_PTR_P (argtype
))
6003 tree type
= complete_type (TREE_TYPE (argtype
));
6005 if (!COMPLETE_OR_VOID_TYPE_P (type
))
6007 if (complain
& tf_error
)
6008 error (((code
== PREINCREMENT_EXPR
6009 || code
== POSTINCREMENT_EXPR
))
6010 ? G_("cannot increment a pointer to incomplete type %qT")
6011 : G_("cannot decrement a pointer to incomplete type %qT"),
6012 TREE_TYPE (argtype
));
6014 return error_mark_node
;
6016 else if (!TYPE_PTROB_P (argtype
))
6018 if (complain
& tf_error
)
6019 pedwarn (input_location
, OPT_Wpointer_arith
,
6020 (code
== PREINCREMENT_EXPR
6021 || code
== POSTINCREMENT_EXPR
)
6022 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6023 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6026 return error_mark_node
;
6029 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6032 inc
= VECTOR_TYPE_P (argtype
)
6033 ? build_one_cst (argtype
)
6036 inc
= cp_convert (argtype
, inc
, complain
);
6038 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6039 need to ask Objective-C to build the increment or decrement
6040 expression for it. */
6041 if (objc_is_property_ref (arg
))
6042 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6045 /* Complain about anything else that is not a true lvalue. */
6046 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6047 || code
== POSTINCREMENT_EXPR
)
6048 ? lv_increment
: lv_decrement
),
6050 return error_mark_node
;
6052 /* Forbid using -- on `bool'. */
6053 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6055 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6057 if (complain
& tf_error
)
6058 error ("invalid use of Boolean expression as operand "
6059 "to %<operator--%>");
6060 return error_mark_node
;
6062 val
= boolean_increment (code
, arg
);
6064 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6065 /* An rvalue has no cv-qualifiers. */
6066 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6068 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6070 TREE_SIDE_EFFECTS (val
) = 1;
6075 /* Note that this operation never does default_conversion
6076 regardless of NOCONVERT. */
6077 return cp_build_addr_expr (arg
, complain
);
6086 argtype
= TREE_TYPE (arg
);
6087 return build1 (code
, argtype
, arg
);
6090 if (complain
& tf_error
)
6091 error ("%s", errstring
);
6092 return error_mark_node
;
6095 /* Hook for the c-common bits that build a unary op. */
6097 build_unary_op (location_t
/*location*/,
6098 enum tree_code code
, tree xarg
, int noconvert
)
6100 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6103 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6104 for certain kinds of expressions which are not really lvalues
6105 but which we can accept as lvalues.
6107 If ARG is not a kind of expression we can handle, return
6111 unary_complex_lvalue (enum tree_code code
, tree arg
)
6113 /* Inside a template, making these kinds of adjustments is
6114 pointless; we are only concerned with the type of the
6116 if (processing_template_decl
)
6119 /* Handle (a, b) used as an "lvalue". */
6120 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6122 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
6123 tf_warning_or_error
);
6124 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6125 TREE_OPERAND (arg
, 0), real_result
);
6128 /* Handle (a ? b : c) used as an "lvalue". */
6129 if (TREE_CODE (arg
) == COND_EXPR
6130 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6131 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6133 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6134 if (TREE_CODE (arg
) == MODIFY_EXPR
6135 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6136 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6138 tree lvalue
= TREE_OPERAND (arg
, 0);
6139 if (TREE_SIDE_EFFECTS (lvalue
))
6141 lvalue
= cp_stabilize_reference (lvalue
);
6142 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6143 lvalue
, TREE_OPERAND (arg
, 1));
6145 return unary_complex_lvalue
6146 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6149 if (code
!= ADDR_EXPR
)
6152 /* Handle (a = b) used as an "lvalue" for `&'. */
6153 if (TREE_CODE (arg
) == MODIFY_EXPR
6154 || TREE_CODE (arg
) == INIT_EXPR
)
6156 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
6157 tf_warning_or_error
);
6158 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6160 TREE_NO_WARNING (arg
) = 1;
6164 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6165 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6166 || TREE_CODE (arg
) == OFFSET_REF
)
6169 /* We permit compiler to make function calls returning
6170 objects of aggregate type look like lvalues. */
6174 if (TREE_CODE (targ
) == SAVE_EXPR
)
6175 targ
= TREE_OPERAND (targ
, 0);
6177 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6179 if (TREE_CODE (arg
) == SAVE_EXPR
)
6182 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6183 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6186 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6187 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6188 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6191 /* Don't let anything else be handled specially. */
6195 /* Mark EXP saying that we need to be able to take the
6196 address of it; it should not be allocated in a register.
6197 Value is true if successful.
6199 C++: we do not allow `current_class_ptr' to be addressable. */
6202 cxx_mark_addressable (tree exp
)
6207 switch (TREE_CODE (x
))
6214 x
= TREE_OPERAND (x
, 0);
6218 if (x
== current_class_ptr
)
6220 error ("cannot take the address of %<this%>, which is an rvalue expression");
6221 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6227 /* Caller should not be trying to mark initialized
6228 constant fields addressable. */
6229 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6230 || DECL_IN_AGGR_P (x
) == 0
6232 || DECL_EXTERNAL (x
));
6236 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6237 && !DECL_ARTIFICIAL (x
))
6239 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6242 ("address of explicit register variable %qD requested", x
);
6245 else if (extra_warnings
)
6247 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6249 TREE_ADDRESSABLE (x
) = 1;
6254 TREE_ADDRESSABLE (x
) = 1;
6258 TREE_ADDRESSABLE (x
) = 1;
6262 TREE_ADDRESSABLE (x
) = 1;
6263 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6271 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6274 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6275 tsubst_flags_t complain
)
6277 tree orig_ifexp
= ifexp
;
6278 tree orig_op1
= op1
;
6279 tree orig_op2
= op2
;
6282 if (processing_template_decl
)
6284 /* The standard says that the expression is type-dependent if
6285 IFEXP is type-dependent, even though the eventual type of the
6286 expression doesn't dependent on IFEXP. */
6287 if (type_dependent_expression_p (ifexp
)
6288 /* As a GNU extension, the middle operand may be omitted. */
6289 || (op1
&& type_dependent_expression_p (op1
))
6290 || type_dependent_expression_p (op2
))
6291 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6292 ifexp
= build_non_dependent_expr (ifexp
);
6294 op1
= build_non_dependent_expr (op1
);
6295 op2
= build_non_dependent_expr (op2
);
6298 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6299 if (processing_template_decl
&& expr
!= error_mark_node
6300 && TREE_CODE (expr
) != VEC_COND_EXPR
)
6302 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6303 orig_ifexp
, orig_op1
, orig_op2
);
6304 /* Remember that the result is an lvalue or xvalue. */
6305 if (lvalue_or_rvalue_with_address_p (expr
)
6306 && !lvalue_or_rvalue_with_address_p (min
))
6307 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6308 !real_lvalue_p (expr
));
6309 expr
= convert_from_reference (min
);
6314 /* Given a list of expressions, return a compound expression
6315 that performs them all and returns the value of the last of them. */
6318 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6319 tsubst_flags_t complain
)
6321 tree expr
= TREE_VALUE (list
);
6323 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6324 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6326 if (complain
& tf_error
)
6327 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6328 "list-initializer for non-class type must not "
6329 "be parenthesized");
6331 return error_mark_node
;
6334 if (TREE_CHAIN (list
))
6336 if (complain
& tf_error
)
6340 permerror (input_location
, "expression list treated as compound "
6341 "expression in initializer");
6344 permerror (input_location
, "expression list treated as compound "
6345 "expression in mem-initializer");
6348 permerror (input_location
, "expression list treated as compound "
6349 "expression in functional cast");
6355 return error_mark_node
;
6357 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6358 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6359 expr
, TREE_VALUE (list
), complain
);
6365 /* Like build_x_compound_expr_from_list, but using a VEC. */
6368 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6369 tsubst_flags_t complain
)
6371 if (vec_safe_is_empty (vec
))
6373 else if (vec
->length () == 1)
6383 if (complain
& tf_error
)
6384 permerror (input_location
,
6385 "%s expression list treated as compound expression",
6388 return error_mark_node
;
6392 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6393 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6400 /* Handle overloading of the ',' operator when needed. */
6403 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6404 tsubst_flags_t complain
)
6407 tree orig_op1
= op1
;
6408 tree orig_op2
= op2
;
6409 tree overload
= NULL_TREE
;
6411 if (processing_template_decl
)
6413 if (type_dependent_expression_p (op1
)
6414 || type_dependent_expression_p (op2
))
6415 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6416 op1
= build_non_dependent_expr (op1
);
6417 op2
= build_non_dependent_expr (op2
);
6420 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6421 NULL_TREE
, &overload
, complain
);
6423 result
= cp_build_compound_expr (op1
, op2
, complain
);
6425 if (processing_template_decl
&& result
!= error_mark_node
)
6427 if (overload
!= NULL_TREE
)
6428 return (build_min_non_dep_op_overload
6429 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6431 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6437 /* Like cp_build_compound_expr, but for the c-common bits. */
6440 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6442 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6445 /* Build a compound expression. */
6448 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6450 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6452 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6453 return error_mark_node
;
6456 && (TREE_CODE (lhs
) == CILK_SPAWN_STMT
6457 || TREE_CODE (rhs
) == CILK_SPAWN_STMT
))
6459 location_t loc
= (EXPR_HAS_LOCATION (lhs
) ? EXPR_LOCATION (lhs
)
6460 : EXPR_LOCATION (rhs
));
6462 "spawned function call cannot be part of a comma expression");
6463 return error_mark_node
;
6466 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6468 /* If the rhs is a TARGET_EXPR, then build the compound
6469 expression inside the target_expr's initializer. This
6470 helps the compiler to eliminate unnecessary temporaries. */
6471 tree init
= TREE_OPERAND (rhs
, 1);
6473 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6474 TREE_OPERAND (rhs
, 1) = init
;
6479 if (type_unknown_p (rhs
))
6481 if (complain
& tf_error
)
6482 error ("no context to resolve type of %qE", rhs
);
6483 return error_mark_node
;
6486 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6489 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6490 casts away constness. CAST gives the type of cast. Returns true
6491 if the cast is ill-formed, false if it is well-formed.
6493 ??? This function warns for casting away any qualifier not just
6494 const. We would like to specify exactly what qualifiers are casted
6499 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6500 enum tree_code cast
, tsubst_flags_t complain
)
6502 /* C-style casts are allowed to cast away constness. With
6503 WARN_CAST_QUAL, we still want to issue a warning. */
6504 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6507 if (!casts_away_constness (src_type
, dest_type
, complain
))
6513 if (complain
& tf_warning
)
6514 warning (OPT_Wcast_qual
,
6515 "cast from type %qT to type %qT casts away qualifiers",
6516 src_type
, dest_type
);
6519 case STATIC_CAST_EXPR
:
6520 if (complain
& tf_error
)
6521 error ("static_cast from type %qT to type %qT casts away qualifiers",
6522 src_type
, dest_type
);
6525 case REINTERPRET_CAST_EXPR
:
6526 if (complain
& tf_error
)
6527 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6528 src_type
, dest_type
);
6537 Warns if the cast from expression EXPR to type TYPE is useless.
6540 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6542 if (warn_useless_cast
6543 && complain
& tf_warning
)
6545 if ((TREE_CODE (type
) == REFERENCE_TYPE
6546 && (TYPE_REF_IS_RVALUE (type
)
6547 ? xvalue_p (expr
) : real_lvalue_p (expr
))
6548 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6549 || same_type_p (TREE_TYPE (expr
), type
))
6550 warning (OPT_Wuseless_cast
, "useless cast to type %qT", type
);
6554 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6555 (another pointer-to-member type in the same hierarchy) and return
6556 the converted expression. If ALLOW_INVERSE_P is permitted, a
6557 pointer-to-derived may be converted to pointer-to-base; otherwise,
6558 only the other direction is permitted. If C_CAST_P is true, this
6559 conversion is taking place as part of a C-style cast. */
6562 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6563 bool c_cast_p
, tsubst_flags_t complain
)
6565 if (TYPE_PTRDATAMEM_P (type
))
6569 if (TREE_CODE (expr
) == PTRMEM_CST
)
6570 expr
= cplus_expand_constant (expr
);
6571 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6572 TYPE_PTRMEM_CLASS_TYPE (type
),
6574 c_cast_p
, complain
);
6575 if (delta
== error_mark_node
)
6576 return error_mark_node
;
6578 if (!integer_zerop (delta
))
6580 tree cond
, op1
, op2
;
6582 cond
= cp_build_binary_op (input_location
,
6585 build_int_cst (TREE_TYPE (expr
), -1),
6587 op1
= build_nop (ptrdiff_type_node
, expr
);
6588 op2
= cp_build_binary_op (input_location
,
6589 PLUS_EXPR
, op1
, delta
,
6592 expr
= fold_build3_loc (input_location
,
6593 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6597 return build_nop (type
, expr
);
6600 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6601 allow_inverse_p
, c_cast_p
, complain
);
6604 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6605 this static_cast is being attempted as one of the possible casts
6606 allowed by a C-style cast. (In that case, accessibility of base
6607 classes is not considered, and it is OK to cast away
6608 constness.) Return the result of the cast. *VALID_P is set to
6609 indicate whether or not the cast was valid. */
6612 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6613 bool *valid_p
, tsubst_flags_t complain
)
6619 /* Assume the cast is valid. */
6622 intype
= unlowered_expr_type (expr
);
6624 /* Save casted types in the function's used types hash table. */
6625 used_types_insert (type
);
6627 /* [expr.static.cast]
6629 An lvalue of type "cv1 B", where B is a class type, can be cast
6630 to type "reference to cv2 D", where D is a class derived (clause
6631 _class.derived_) from B, if a valid standard conversion from
6632 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6633 same cv-qualification as, or greater cv-qualification than, cv1,
6634 and B is not a virtual base class of D. */
6635 /* We check this case before checking the validity of "TYPE t =
6636 EXPR;" below because for this case:
6639 struct D : public B { D(const B&); };
6641 void f() { static_cast<const D&>(b); }
6643 we want to avoid constructing a new D. The standard is not
6644 completely clear about this issue, but our interpretation is
6645 consistent with other compilers. */
6646 if (TREE_CODE (type
) == REFERENCE_TYPE
6647 && CLASS_TYPE_P (TREE_TYPE (type
))
6648 && CLASS_TYPE_P (intype
)
6649 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
6650 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6651 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6652 build_pointer_type (TYPE_MAIN_VARIANT
6653 (TREE_TYPE (type
))),
6656 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6660 /* There is a standard conversion from "D*" to "B*" even if "B"
6661 is ambiguous or inaccessible. If this is really a
6662 static_cast, then we check both for inaccessibility and
6663 ambiguity. However, if this is a static_cast being performed
6664 because the user wrote a C-style cast, then accessibility is
6666 base
= lookup_base (TREE_TYPE (type
), intype
,
6667 c_cast_p
? ba_unique
: ba_check
,
6669 expr
= build_address (expr
);
6671 if (flag_sanitize
& SANITIZE_VPTR
)
6674 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6680 /* Convert from "B*" to "D*". This function will check that "B"
6681 is not a virtual base of "D". */
6682 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6685 /* Convert the pointer to a reference -- but then remember that
6686 there are no expressions with reference type in C++.
6688 We call rvalue so that there's an actual tree code
6689 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6690 is a variable with the same type, the conversion would get folded
6691 away, leaving just the variable and causing lvalue_kind to give
6692 the wrong answer. */
6693 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
6696 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6697 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6698 if (TREE_CODE (type
) == REFERENCE_TYPE
6699 && TYPE_REF_IS_RVALUE (type
)
6700 && (clk
= real_lvalue_p (expr
))
6701 && reference_related_p (TREE_TYPE (type
), intype
)
6702 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6704 if (clk
== clk_ordinary
)
6706 /* Handle the (non-bit-field) lvalue case here by casting to
6707 lvalue reference and then changing it to an rvalue reference.
6708 Casting an xvalue to rvalue reference will be handled by the
6710 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
6711 result
= (perform_direct_initialization_if_possible
6712 (lref
, expr
, c_cast_p
, complain
));
6713 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
6714 return convert_from_reference (result
);
6717 /* For a bit-field or packed field, bind to a temporary. */
6718 expr
= rvalue (expr
);
6721 /* Resolve overloaded address here rather than once in
6722 implicit_conversion and again in the inverse code below. */
6723 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
6725 expr
= instantiate_type (type
, expr
, complain
);
6726 intype
= TREE_TYPE (expr
);
6729 /* [expr.static.cast]
6731 Any expression can be explicitly converted to type cv void. */
6732 if (VOID_TYPE_P (type
))
6733 return convert_to_void (expr
, ICV_CAST
, complain
);
6736 An abstract class shall not be used ... as the type of an explicit
6738 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
6739 return error_mark_node
;
6741 /* [expr.static.cast]
6743 An expression e can be explicitly converted to a type T using a
6744 static_cast of the form static_cast<T>(e) if the declaration T
6745 t(e);" is well-formed, for some invented temporary variable
6747 result
= perform_direct_initialization_if_possible (type
, expr
,
6748 c_cast_p
, complain
);
6751 result
= convert_from_reference (result
);
6753 /* [expr.static.cast]
6755 If T is a reference type, the result is an lvalue; otherwise,
6756 the result is an rvalue. */
6757 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6759 result
= rvalue (result
);
6761 if (result
== expr
&& SCALAR_TYPE_P (type
))
6762 /* Leave some record of the cast. */
6763 result
= build_nop (type
, expr
);
6768 /* [expr.static.cast]
6770 The inverse of any standard conversion sequence (clause _conv_),
6771 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6772 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6773 (_conv.bool_) conversions, can be performed explicitly using
6774 static_cast subject to the restriction that the explicit
6775 conversion does not cast away constness (_expr.const.cast_), and
6776 the following additional rules for specific cases: */
6777 /* For reference, the conversions not excluded are: integral
6778 promotions, floating point promotion, integral conversions,
6779 floating point conversions, floating-integral conversions,
6780 pointer conversions, and pointer to member conversions. */
6783 A value of integral _or enumeration_ type can be explicitly
6784 converted to an enumeration type. */
6785 /* The effect of all that is that any conversion between any two
6786 types which are integral, floating, or enumeration types can be
6788 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6789 || SCALAR_FLOAT_TYPE_P (type
))
6790 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
6791 || SCALAR_FLOAT_TYPE_P (intype
)))
6792 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
6794 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
6795 && CLASS_TYPE_P (TREE_TYPE (type
))
6796 && CLASS_TYPE_P (TREE_TYPE (intype
))
6797 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6798 (TREE_TYPE (intype
))),
6799 build_pointer_type (TYPE_MAIN_VARIANT
6800 (TREE_TYPE (type
))),
6806 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6808 return error_mark_node
;
6809 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6810 c_cast_p
? ba_unique
: ba_check
,
6812 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6815 if (flag_sanitize
& SANITIZE_VPTR
)
6818 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6824 return cp_fold_convert (type
, expr
);
6827 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
6828 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6835 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6836 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6838 if (TYPE_PTRDATAMEM_P (type
))
6840 t1
= (build_ptrmem_type
6842 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6843 t2
= (build_ptrmem_type
6845 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
6852 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
6855 && check_for_casting_away_constness (intype
, type
,
6858 return error_mark_node
;
6859 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
6860 c_cast_p
, complain
);
6864 /* [expr.static.cast]
6866 An rvalue of type "pointer to cv void" can be explicitly
6867 converted to a pointer to object type. A value of type pointer
6868 to object converted to "pointer to cv void" and back to the
6869 original pointer type will have its original value. */
6870 if (TYPE_PTR_P (intype
)
6871 && VOID_TYPE_P (TREE_TYPE (intype
))
6872 && TYPE_PTROB_P (type
))
6875 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6877 return error_mark_node
;
6878 return build_nop (type
, expr
);
6882 return error_mark_node
;
6885 /* Return an expression representing static_cast<TYPE>(EXPR). */
6888 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6893 if (type
== error_mark_node
|| expr
== error_mark_node
)
6894 return error_mark_node
;
6896 if (processing_template_decl
)
6898 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6899 /* We don't know if it will or will not have side effects. */
6900 TREE_SIDE_EFFECTS (expr
) = 1;
6901 return convert_from_reference (expr
);
6904 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6905 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6906 if (TREE_CODE (type
) != REFERENCE_TYPE
6907 && TREE_CODE (expr
) == NOP_EXPR
6908 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6909 expr
= TREE_OPERAND (expr
, 0);
6911 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6915 if (result
!= error_mark_node
)
6916 maybe_warn_about_useless_cast (type
, expr
, complain
);
6920 if (complain
& tf_error
)
6921 error ("invalid static_cast from type %qT to type %qT",
6922 TREE_TYPE (expr
), type
);
6923 return error_mark_node
;
6926 /* EXPR is an expression with member function or pointer-to-member
6927 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6928 not permitted by ISO C++, but we accept it in some modes. If we
6929 are not in one of those modes, issue a diagnostic. Return the
6930 converted expression. */
6933 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
6938 intype
= TREE_TYPE (expr
);
6939 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6940 || TREE_CODE (intype
) == METHOD_TYPE
);
6942 if (!(complain
& tf_warning_or_error
))
6943 return error_mark_node
;
6945 if (pedantic
|| warn_pmf2ptr
)
6946 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
6947 "converting from %qT to %qT", intype
, type
);
6949 if (TREE_CODE (intype
) == METHOD_TYPE
)
6950 expr
= build_addr_func (expr
, complain
);
6951 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6952 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6955 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6956 decl
= build_address (decl
);
6957 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
6960 if (expr
== error_mark_node
)
6961 return error_mark_node
;
6963 return build_nop (type
, expr
);
6966 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6967 If C_CAST_P is true, this reinterpret cast is being done as part of
6968 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6969 indicate whether or not reinterpret_cast was valid. */
6972 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6973 bool *valid_p
, tsubst_flags_t complain
)
6977 /* Assume the cast is invalid. */
6981 if (type
== error_mark_node
|| error_operand_p (expr
))
6982 return error_mark_node
;
6984 intype
= TREE_TYPE (expr
);
6986 /* Save casted types in the function's used types hash table. */
6987 used_types_insert (type
);
6989 /* [expr.reinterpret.cast]
6990 An lvalue expression of type T1 can be cast to the type
6991 "reference to T2" if an expression of type "pointer to T1" can be
6992 explicitly converted to the type "pointer to T2" using a
6993 reinterpret_cast. */
6994 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6996 if (! real_lvalue_p (expr
))
6998 if (complain
& tf_error
)
6999 error ("invalid cast of an rvalue expression of type "
7002 return error_mark_node
;
7005 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7006 "B" are related class types; the reinterpret_cast does not
7007 adjust the pointer. */
7008 if (TYPE_PTR_P (intype
)
7009 && (complain
& tf_warning
)
7010 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7011 COMPARE_BASE
| COMPARE_DERIVED
)))
7012 warning (0, "casting %qT to %qT does not dereference pointer",
7015 expr
= cp_build_addr_expr (expr
, complain
);
7017 if (warn_strict_aliasing
> 2)
7018 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
7020 if (expr
!= error_mark_node
)
7021 expr
= build_reinterpret_cast_1
7022 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7024 if (expr
!= error_mark_node
)
7025 /* cp_build_indirect_ref isn't right for rvalue refs. */
7026 expr
= convert_from_reference (fold_convert (type
, expr
));
7030 /* As a G++ extension, we consider conversions from member
7031 functions, and pointers to member functions to
7032 pointer-to-function and pointer-to-void types. If
7033 -Wno-pmf-conversions has not been specified,
7034 convert_member_func_to_ptr will issue an error message. */
7035 if ((TYPE_PTRMEMFUNC_P (intype
)
7036 || TREE_CODE (intype
) == METHOD_TYPE
)
7037 && TYPE_PTR_P (type
)
7038 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7039 || VOID_TYPE_P (TREE_TYPE (type
))))
7040 return convert_member_func_to_ptr (type
, expr
, complain
);
7042 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7043 array-to-pointer, and function-to-pointer conversions are
7045 expr
= decay_conversion (expr
, complain
);
7047 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7048 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7049 if (TREE_CODE (expr
) == NOP_EXPR
7050 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7051 expr
= TREE_OPERAND (expr
, 0);
7053 if (error_operand_p (expr
))
7054 return error_mark_node
;
7056 intype
= TREE_TYPE (expr
);
7058 /* [expr.reinterpret.cast]
7059 A pointer can be converted to any integral type large enough to
7060 hold it. ... A value of type std::nullptr_t can be converted to
7061 an integral type; the conversion has the same meaning and
7062 validity as a conversion of (void*)0 to the integral type. */
7063 if (CP_INTEGRAL_TYPE_P (type
)
7064 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7066 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7068 if (complain
& tf_error
)
7069 permerror (input_location
, "cast from %qT to %qT loses precision",
7072 return error_mark_node
;
7074 if (NULLPTR_TYPE_P (intype
))
7075 return build_int_cst (type
, 0);
7077 /* [expr.reinterpret.cast]
7078 A value of integral or enumeration type can be explicitly
7079 converted to a pointer. */
7080 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7083 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7084 || TYPE_PTR_OR_PTRMEM_P (type
))
7085 && same_type_p (type
, intype
))
7087 return rvalue (expr
);
7088 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7089 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7090 return build_nop (type
, expr
);
7091 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7092 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7097 && check_for_casting_away_constness (intype
, type
,
7098 REINTERPRET_CAST_EXPR
,
7100 return error_mark_node
;
7101 /* Warn about possible alignment problems. */
7102 if (STRICT_ALIGNMENT
&& warn_cast_align
7103 && (complain
& tf_warning
)
7104 && !VOID_TYPE_P (type
)
7105 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7106 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7107 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7108 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
7109 warning (OPT_Wcast_align
, "cast from %qT to %qT "
7110 "increases required alignment of target type", intype
, type
);
7112 /* We need to strip nops here, because the front end likes to
7113 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
7115 if (warn_strict_aliasing
<= 2)
7116 strict_aliasing_warning (intype
, type
, sexpr
);
7118 return build_nop (type
, expr
);
7120 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7121 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7123 if (complain
& tf_warning
)
7124 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7125 object pointer type or vice versa is conditionally-supported." */
7126 warning (OPT_Wconditionally_supported
,
7127 "casting between pointer-to-function and pointer-to-object "
7128 "is conditionally-supported");
7129 return build_nop (type
, expr
);
7131 else if (VECTOR_TYPE_P (type
))
7132 return convert_to_vector (type
, expr
);
7133 else if (VECTOR_TYPE_P (intype
)
7134 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7135 return convert_to_integer_nofold (type
, expr
);
7140 if (complain
& tf_error
)
7141 error ("invalid cast from type %qT to type %qT", intype
, type
);
7142 return error_mark_node
;
7145 return cp_convert (type
, expr
, complain
);
7149 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7153 if (type
== error_mark_node
|| expr
== error_mark_node
)
7154 return error_mark_node
;
7156 if (processing_template_decl
)
7158 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7160 if (!TREE_SIDE_EFFECTS (t
)
7161 && type_dependent_expression_p (expr
))
7162 /* There might turn out to be side effects inside expr. */
7163 TREE_SIDE_EFFECTS (t
) = 1;
7164 return convert_from_reference (t
);
7167 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7168 /*valid_p=*/NULL
, complain
);
7169 if (r
!= error_mark_node
)
7170 maybe_warn_about_useless_cast (type
, expr
, complain
);
7174 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7175 return an appropriate expression. Otherwise, return
7176 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7177 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7178 performing a C-style cast, its value upon return will indicate
7179 whether or not the conversion succeeded. */
7182 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7186 tree reference_type
;
7188 /* Callers are responsible for handling error_mark_node as a
7189 destination type. */
7190 gcc_assert (dst_type
!= error_mark_node
);
7191 /* In a template, callers should be building syntactic
7192 representations of casts, not using this machinery. */
7193 gcc_assert (!processing_template_decl
);
7195 /* Assume the conversion is invalid. */
7199 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7201 if (complain
& tf_error
)
7202 error ("invalid use of const_cast with type %qT, "
7203 "which is not a pointer, "
7204 "reference, nor a pointer-to-data-member type", dst_type
);
7205 return error_mark_node
;
7208 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7210 if (complain
& tf_error
)
7211 error ("invalid use of const_cast with type %qT, which is a pointer "
7212 "or reference to a function type", dst_type
);
7213 return error_mark_node
;
7216 /* Save casted types in the function's used types hash table. */
7217 used_types_insert (dst_type
);
7219 src_type
= TREE_TYPE (expr
);
7220 /* Expressions do not really have reference types. */
7221 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7222 src_type
= TREE_TYPE (src_type
);
7224 /* [expr.const.cast]
7226 For two object types T1 and T2, if a pointer to T1 can be explicitly
7227 converted to the type "pointer to T2" using a const_cast, then the
7228 following conversions can also be made:
7230 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7231 type T2 using the cast const_cast<T2&>;
7233 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7234 type T2 using the cast const_cast<T2&&>; and
7236 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7237 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7239 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7241 reference_type
= dst_type
;
7242 if (!TYPE_REF_IS_RVALUE (dst_type
)
7243 ? real_lvalue_p (expr
)
7244 : (CLASS_TYPE_P (TREE_TYPE (dst_type
))
7246 : lvalue_or_rvalue_with_address_p (expr
)))
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". */
7519 switch (TREE_CODE (lhs
))
7521 /* Handle --foo = 5; as these are valid constructs in C++. */
7522 case PREDECREMENT_EXPR
:
7523 case PREINCREMENT_EXPR
:
7524 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7525 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7526 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7527 TREE_OPERAND (lhs
, 1));
7528 newrhs
= cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 0),
7529 modifycode
, rhs
, complain
);
7530 if (newrhs
== error_mark_node
)
7531 return error_mark_node
;
7532 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
7534 /* Handle (a, b) used as an "lvalue". */
7536 newrhs
= cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7537 modifycode
, rhs
, complain
);
7538 if (newrhs
== error_mark_node
)
7539 return error_mark_node
;
7540 return build2 (COMPOUND_EXPR
, lhstype
,
7541 TREE_OPERAND (lhs
, 0), newrhs
);
7544 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7545 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7546 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7547 TREE_OPERAND (lhs
, 1));
7548 newrhs
= cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 0), modifycode
,
7550 if (newrhs
== error_mark_node
)
7551 return error_mark_node
;
7552 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
7556 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7557 when neither operand has side-effects. */
7558 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7559 return error_mark_node
;
7561 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7562 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7564 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7565 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7567 TREE_OPERAND (lhs
, 0),
7568 TREE_OPERAND (lhs
, 1)),
7569 TREE_OPERAND (lhs
, 0),
7570 TREE_OPERAND (lhs
, 1));
7573 /* Handle (a ? b : c) used as an "lvalue". */
7576 /* Produce (a ? (b = rhs) : (c = rhs))
7577 except that the RHS goes through a save-expr
7578 so the code to compute it is only emitted once. */
7580 tree preeval
= NULL_TREE
;
7582 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7584 if (complain
& tf_error
)
7585 error ("void value not ignored as it ought to be");
7586 return error_mark_node
;
7589 rhs
= stabilize_expr (rhs
, &preeval
);
7591 /* Check this here to avoid odd errors when trying to convert
7592 a throw to the type of the COND_EXPR. */
7593 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7594 return error_mark_node
;
7596 cond
= build_conditional_expr
7597 (input_location
, TREE_OPERAND (lhs
, 0),
7598 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7599 modifycode
, rhs
, complain
),
7600 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7601 modifycode
, rhs
, complain
),
7604 if (cond
== error_mark_node
)
7606 /* Make sure the code to compute the rhs comes out
7607 before the split. */
7609 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
7617 if (modifycode
== INIT_EXPR
)
7619 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7620 /* Do the default thing. */;
7621 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
7623 /* Compound literal. */
7624 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
7625 /* Call convert to generate an error; see PR 11063. */
7626 rhs
= convert (lhstype
, rhs
);
7627 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
7628 TREE_SIDE_EFFECTS (result
) = 1;
7631 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
7632 /* Do the default thing. */;
7635 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
7636 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
7637 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
7639 release_tree_vector (rhs_vec
);
7640 if (result
== NULL_TREE
)
7641 return error_mark_node
;
7647 lhs
= require_complete_type_sfinae (lhs
, complain
);
7648 if (lhs
== error_mark_node
)
7649 return error_mark_node
;
7651 if (modifycode
== NOP_EXPR
)
7653 if (c_dialect_objc ())
7655 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
7660 /* `operator=' is not an inheritable operator. */
7661 if (! MAYBE_CLASS_TYPE_P (lhstype
))
7662 /* Do the default thing. */;
7665 result
= build_new_op (input_location
, MODIFY_EXPR
,
7666 LOOKUP_NORMAL
, lhs
, rhs
,
7667 make_node (NOP_EXPR
), /*overload=*/NULL
,
7669 if (result
== NULL_TREE
)
7670 return error_mark_node
;
7677 tree init
= NULL_TREE
;
7679 /* A binary op has been requested. Combine the old LHS
7680 value with the RHS producing the value we should actually
7681 store into the LHS. */
7682 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
7683 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
7684 || MAYBE_CLASS_TYPE_P (lhstype
)));
7686 /* Preevaluate the RHS to make sure its evaluation is complete
7687 before the lvalue-to-rvalue conversion of the LHS:
7689 [expr.ass] With respect to an indeterminately-sequenced
7690 function call, the operation of a compound assignment is a
7691 single evaluation. [ Note: Therefore, a function call shall
7692 not intervene between the lvalue-to-rvalue conversion and the
7693 side effect associated with any single compound assignment
7694 operator. -- end note ] */
7695 lhs
= cp_stabilize_reference (lhs
);
7697 rhs
= stabilize_expr (rhs
, &init
);
7698 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
7699 if (newrhs
== error_mark_node
)
7701 if (complain
& tf_error
)
7702 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
7703 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
7704 return error_mark_node
;
7708 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
7710 /* Now it looks like a plain assignment. */
7711 modifycode
= NOP_EXPR
;
7712 if (c_dialect_objc ())
7714 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
7719 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
7720 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
7723 /* The left-hand side must be an lvalue. */
7724 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7725 return error_mark_node
;
7727 /* Warn about modifying something that is `const'. Don't warn if
7728 this is initialization. */
7729 if (modifycode
!= INIT_EXPR
7730 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
7731 /* Functions are not modifiable, even though they are
7733 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
7734 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
7735 /* If it's an aggregate and any field is const, then it is
7736 effectively const. */
7737 || (CLASS_TYPE_P (lhstype
)
7738 && C_TYPE_FIELDS_READONLY (lhstype
))))
7740 if (complain
& tf_error
)
7741 cxx_readonly_error (lhs
, lv_assign
);
7743 return error_mark_node
;
7746 /* If storing into a structure or union member, it may have been given a
7747 lowered bitfield type. We need to convert to the declared type first,
7748 so retrieve it now. */
7750 olhstype
= unlowered_expr_type (lhs
);
7752 /* Convert new value to destination type. */
7754 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
7758 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
7760 if (modifycode
!= INIT_EXPR
)
7762 if (complain
& tf_error
)
7763 error ("assigning to an array from an initializer list");
7764 return error_mark_node
;
7766 if (check_array_initializer (lhs
, lhstype
, newrhs
))
7767 return error_mark_node
;
7768 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7769 if (newrhs
== error_mark_node
)
7770 return error_mark_node
;
7773 /* C++11 8.5/17: "If the destination type is an array of characters,
7774 an array of char16_t, an array of char32_t, or an array of wchar_t,
7775 and the initializer is a string literal...". */
7776 else if (TREE_CODE (newrhs
) == STRING_CST
7777 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
7778 && modifycode
== INIT_EXPR
)
7780 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7781 if (newrhs
== error_mark_node
)
7782 return error_mark_node
;
7785 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
7786 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
7788 if (complain
& tf_error
)
7789 error ("incompatible types in assignment of %qT to %qT",
7790 TREE_TYPE (rhs
), lhstype
);
7791 return error_mark_node
;
7794 /* Allow array assignment in compiler-generated code. */
7795 else if (!current_function_decl
7796 || !DECL_DEFAULTED_FN (current_function_decl
))
7798 /* This routine is used for both initialization and assignment.
7799 Make sure the diagnostic message differentiates the context. */
7800 if (complain
& tf_error
)
7802 if (modifycode
== INIT_EXPR
)
7803 error ("array used as initializer");
7805 error ("invalid array assignment");
7807 return error_mark_node
;
7810 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
7811 ? 1 + (modifycode
!= INIT_EXPR
): 0;
7812 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
7813 /*explicit_value_init_p=*/false,
7814 from_array
, complain
);
7817 if (modifycode
== INIT_EXPR
)
7818 /* Calls with INIT_EXPR are all direct-initialization, so don't set
7819 LOOKUP_ONLYCONVERTING. */
7820 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
7821 ICR_INIT
, NULL_TREE
, 0,
7824 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
7825 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
7827 if (!same_type_p (lhstype
, olhstype
))
7828 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
7830 if (modifycode
!= INIT_EXPR
)
7832 if (TREE_CODE (newrhs
) == CALL_EXPR
7833 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
7834 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
7836 /* Can't initialize directly from a TARGET_EXPR, since that would
7837 cause the lhs to be constructed twice, and possibly result in
7838 accidental self-initialization. So we force the TARGET_EXPR to be
7839 expanded without a target. */
7840 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
7841 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
7842 TREE_OPERAND (newrhs
, 0));
7845 if (newrhs
== error_mark_node
)
7846 return error_mark_node
;
7848 if (c_dialect_objc () && flag_objc_gc
)
7850 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
7856 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
7857 lhstype
, lhs
, newrhs
);
7859 TREE_SIDE_EFFECTS (result
) = 1;
7861 TREE_NO_WARNING (result
) = 1;
7867 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7868 tree rhs
, tsubst_flags_t complain
)
7870 tree orig_lhs
= lhs
;
7871 tree orig_rhs
= rhs
;
7872 tree overload
= NULL_TREE
;
7873 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
7875 if (processing_template_decl
)
7877 if (modifycode
== NOP_EXPR
7878 || type_dependent_expression_p (lhs
)
7879 || type_dependent_expression_p (rhs
))
7880 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
7881 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
7884 lhs
= build_non_dependent_expr (lhs
);
7885 rhs
= build_non_dependent_expr (rhs
);
7888 if (modifycode
!= NOP_EXPR
)
7890 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
7891 lhs
, rhs
, op
, &overload
, complain
);
7894 if (rval
== error_mark_node
)
7896 TREE_NO_WARNING (rval
) = 1;
7897 if (processing_template_decl
)
7899 if (overload
!= NULL_TREE
)
7900 return (build_min_non_dep_op_overload
7901 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
7903 return (build_min_non_dep
7904 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
7909 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
7912 /* Helper function for get_delta_difference which assumes FROM is a base
7913 class of TO. Returns a delta for the conversion of pointer-to-member
7914 of FROM to pointer-to-member of TO. If the conversion is invalid and
7915 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
7916 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
7917 If C_CAST_P is true, this conversion is taking place as part of a
7921 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
7922 tsubst_flags_t complain
)
7927 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
7930 if (binfo
== error_mark_node
)
7932 if (!(complain
& tf_error
))
7933 return error_mark_node
;
7935 error (" in pointer to member function conversion");
7936 return size_zero_node
;
7940 if (kind
!= bk_via_virtual
)
7941 return BINFO_OFFSET (binfo
);
7943 /* FROM is a virtual base class of TO. Issue an error or warning
7944 depending on whether or not this is a reinterpret cast. */
7946 if (!(complain
& tf_error
))
7947 return error_mark_node
;
7949 error ("pointer to member conversion via virtual base %qT",
7950 BINFO_TYPE (binfo_from_vbase (binfo
)));
7952 return size_zero_node
;
7959 /* Get difference in deltas for different pointer to member function
7960 types. If the conversion is invalid and tf_error is not set in
7961 COMPLAIN, returns error_mark_node, otherwise returns an integer
7962 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7963 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7964 conversions as well. If C_CAST_P is true this conversion is taking
7965 place as part of a C-style cast.
7967 Note that the naming of FROM and TO is kind of backwards; the return
7968 value is what we add to a TO in order to get a FROM. They are named
7969 this way because we call this function to find out how to convert from
7970 a pointer to member of FROM to a pointer to member of TO. */
7973 get_delta_difference (tree from
, tree to
,
7974 bool allow_inverse_p
,
7975 bool c_cast_p
, tsubst_flags_t complain
)
7979 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
7980 /* Pointer to member of incomplete class is permitted*/
7981 result
= size_zero_node
;
7983 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
7985 if (result
== error_mark_node
)
7986 return error_mark_node
;
7990 if (!allow_inverse_p
)
7992 if (!(complain
& tf_error
))
7993 return error_mark_node
;
7995 error_not_base_type (from
, to
);
7996 error (" in pointer to member conversion");
7997 result
= size_zero_node
;
8001 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
8003 if (result
== error_mark_node
)
8004 return error_mark_node
;
8007 result
= size_diffop_loc (input_location
,
8008 size_zero_node
, result
);
8011 if (!(complain
& tf_error
))
8012 return error_mark_node
;
8014 error_not_base_type (from
, to
);
8015 error (" in pointer to member conversion");
8016 result
= size_zero_node
;
8021 return convert_to_integer (ptrdiff_type_node
, result
);
8024 /* Return a constructor for the pointer-to-member-function TYPE using
8025 the other components as specified. */
8028 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8033 vec
<constructor_elt
, va_gc
> *v
;
8035 /* Pull the FIELD_DECLs out of the type. */
8036 pfn_field
= TYPE_FIELDS (type
);
8037 delta_field
= DECL_CHAIN (pfn_field
);
8039 /* Make sure DELTA has the type we want. */
8040 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8042 /* Convert to the correct target type if necessary. */
8043 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8045 /* Finish creating the initializer. */
8047 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8048 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8049 u
= build_constructor (type
, v
);
8050 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8051 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8052 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8054 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8059 /* Build a constructor for a pointer to member function. It can be
8060 used to initialize global variables, local variable, or used
8061 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8064 If FORCE is nonzero, then force this conversion, even if
8065 we would rather not do it. Usually set when using an explicit
8066 cast. A C-style cast is being processed iff C_CAST_P is true.
8068 Return error_mark_node, if something goes wrong. */
8071 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8072 tsubst_flags_t complain
)
8078 if (error_operand_p (pfn
))
8079 return error_mark_node
;
8081 pfn_type
= TREE_TYPE (pfn
);
8082 to_type
= build_ptrmemfunc_type (type
);
8084 /* Handle multiple conversions of pointer to member functions. */
8085 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8087 tree delta
= NULL_TREE
;
8088 tree npfn
= NULL_TREE
;
8092 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8093 LOOKUP_NORMAL
, complain
))
8095 if (complain
& tf_error
)
8096 error ("invalid conversion to type %qT from type %qT",
8099 return error_mark_node
;
8102 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8103 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8105 c_cast_p
, complain
);
8106 if (n
== error_mark_node
)
8107 return error_mark_node
;
8109 /* We don't have to do any conversion to convert a
8110 pointer-to-member to its own type. But, we don't want to
8111 just return a PTRMEM_CST if there's an explicit cast; that
8112 cast should make the expression an invalid template argument. */
8113 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8115 if (same_type_p (to_type
, pfn_type
))
8117 else if (integer_zerop (n
))
8118 return build_reinterpret_cast (to_type
, pfn
,
8122 if (TREE_SIDE_EFFECTS (pfn
))
8123 pfn
= save_expr (pfn
);
8125 /* Obtain the function pointer and the current DELTA. */
8126 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8127 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8130 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8131 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8134 /* Just adjust the DELTA field. */
8135 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8136 (TREE_TYPE (delta
), ptrdiff_type_node
));
8137 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8138 n
= cp_build_binary_op (input_location
,
8139 LSHIFT_EXPR
, n
, integer_one_node
,
8141 delta
= cp_build_binary_op (input_location
,
8142 PLUS_EXPR
, delta
, n
, complain
);
8143 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8146 /* Handle null pointer to member function conversions. */
8147 if (null_ptr_cst_p (pfn
))
8149 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8150 return build_ptrmemfunc1 (to_type
,
8155 if (type_unknown_p (pfn
))
8156 return instantiate_type (type
, pfn
, complain
);
8158 fn
= TREE_OPERAND (pfn
, 0);
8159 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8160 /* In a template, we will have preserved the
8162 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8163 return make_ptrmem_cst (to_type
, fn
);
8166 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8169 ??? There is no consistency as to the types returned for the above
8170 values. Some code acts as if it were a sizetype and some as if it were
8171 integer_type_node. */
8174 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8176 tree type
= TREE_TYPE (cst
);
8177 tree fn
= PTRMEM_CST_MEMBER (cst
);
8178 tree ptr_class
, fn_class
;
8180 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8182 /* The class that the function belongs to. */
8183 fn_class
= DECL_CONTEXT (fn
);
8185 /* The class that we're creating a pointer to member of. */
8186 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8188 /* First, calculate the adjustment to the function's class. */
8189 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8190 /*c_cast_p=*/0, tf_warning_or_error
);
8192 if (!DECL_VIRTUAL_P (fn
))
8193 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8194 build_addr_func (fn
, tf_warning_or_error
));
8197 /* If we're dealing with a virtual function, we have to adjust 'this'
8198 again, to point to the base which provides the vtable entry for
8199 fn; the call will do the opposite adjustment. */
8200 tree orig_class
= DECL_CONTEXT (fn
);
8201 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8202 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8203 *delta
, BINFO_OFFSET (binfo
));
8205 /* We set PFN to the vtable offset at which the function can be
8206 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8207 case delta is shifted left, and then incremented). */
8208 *pfn
= DECL_VINDEX (fn
);
8209 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8210 TYPE_SIZE_UNIT (vtable_entry_type
));
8212 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8214 case ptrmemfunc_vbit_in_pfn
:
8215 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8219 case ptrmemfunc_vbit_in_delta
:
8220 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8221 *delta
, integer_one_node
);
8222 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8223 *delta
, integer_one_node
);
8230 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8234 /* Return an expression for PFN from the pointer-to-member function
8238 pfn_from_ptrmemfunc (tree t
)
8240 if (TREE_CODE (t
) == PTRMEM_CST
)
8245 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8250 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8253 /* Return an expression for DELTA from the pointer-to-member function
8257 delta_from_ptrmemfunc (tree t
)
8259 if (TREE_CODE (t
) == PTRMEM_CST
)
8264 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8269 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8272 /* Convert value RHS to type TYPE as preparation for an assignment to
8273 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8274 implicit conversion is. If FNDECL is non-NULL, we are doing the
8275 conversion in order to pass the PARMNUMth argument of FNDECL.
8276 If FNDECL is NULL, we are doing the conversion in function pointer
8277 argument passing, conversion in initialization, etc. */
8280 convert_for_assignment (tree type
, tree rhs
,
8281 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8282 tsubst_flags_t complain
, int flags
)
8285 enum tree_code coder
;
8287 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8288 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8289 rhs
= TREE_OPERAND (rhs
, 0);
8291 rhstype
= TREE_TYPE (rhs
);
8292 coder
= TREE_CODE (rhstype
);
8294 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8295 && vector_types_convertible_p (type
, rhstype
, true))
8297 rhs
= mark_rvalue_use (rhs
);
8298 return convert (type
, rhs
);
8301 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8302 return error_mark_node
;
8303 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8304 return error_mark_node
;
8306 /* The RHS of an assignment cannot have void type. */
8307 if (coder
== VOID_TYPE
)
8309 if (complain
& tf_error
)
8310 error ("void value not ignored as it ought to be");
8311 return error_mark_node
;
8314 if (c_dialect_objc ())
8318 tree rname
= fndecl
;
8329 selector
= objc_message_selector ();
8331 if (selector
&& parmno
> 1)
8338 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8340 rhs
= mark_rvalue_use (rhs
);
8341 return convert (type
, rhs
);
8347 The expression is implicitly converted (clause _conv_) to the
8348 cv-unqualified type of the left operand.
8350 We allow bad conversions here because by the time we get to this point
8351 we are committed to doing the conversion. If we end up doing a bad
8352 conversion, convert_like will complain. */
8353 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8355 /* When -Wno-pmf-conversions is use, we just silently allow
8356 conversions from pointers-to-members to plain pointers. If
8357 the conversion doesn't work, cp_convert will complain. */
8359 && TYPE_PTR_P (type
)
8360 && TYPE_PTRMEMFUNC_P (rhstype
))
8361 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8364 if (complain
& tf_error
)
8366 /* If the right-hand side has unknown type, then it is an
8367 overloaded function. Call instantiate_type to get error
8369 if (rhstype
== unknown_type_node
)
8370 instantiate_type (type
, rhs
, tf_warning_or_error
);
8372 error ("cannot convert %qT to %qT for argument %qP to %qD",
8373 rhstype
, type
, parmnum
, fndecl
);
8377 case ICR_DEFAULT_ARGUMENT
:
8378 error ("cannot convert %qT to %qT in default argument",
8382 error ("cannot convert %qT to %qT in argument passing",
8385 case ICR_CONVERTING
:
8386 error ("cannot convert %qT to %qT",
8390 error ("cannot convert %qT to %qT in initialization",
8394 error ("cannot convert %qT to %qT in return",
8398 error ("cannot convert %qT to %qT in assignment",
8404 if (TYPE_PTR_P (rhstype
)
8405 && TYPE_PTR_P (type
)
8406 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8407 && CLASS_TYPE_P (TREE_TYPE (type
))
8408 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8409 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8410 (TREE_TYPE (rhstype
))),
8411 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8413 return error_mark_node
;
8416 if (warn_suggest_attribute_format
)
8418 const enum tree_code codel
= TREE_CODE (type
);
8419 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8421 && check_missing_format_attribute (type
, rhstype
)
8422 && (complain
& tf_warning
))
8426 case ICR_DEFAULT_ARGUMENT
:
8428 warning (OPT_Wsuggest_attribute_format
,
8429 "parameter %qP of %qD might be a candidate "
8430 "for a format attribute", parmnum
, fndecl
);
8432 warning (OPT_Wsuggest_attribute_format
,
8433 "parameter might be a candidate "
8434 "for a format attribute");
8436 case ICR_CONVERTING
:
8437 warning (OPT_Wsuggest_attribute_format
,
8438 "target of conversion might be a candidate "
8439 "for a format attribute");
8442 warning (OPT_Wsuggest_attribute_format
,
8443 "target of initialization might be a candidate "
8444 "for a format attribute");
8447 warning (OPT_Wsuggest_attribute_format
,
8448 "return type might be a candidate "
8449 "for a format attribute");
8452 warning (OPT_Wsuggest_attribute_format
,
8453 "left-hand side of assignment might be a candidate "
8454 "for a format attribute");
8461 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8463 if (warn_parentheses
8464 && TREE_CODE (type
) == BOOLEAN_TYPE
8465 && TREE_CODE (rhs
) == MODIFY_EXPR
8466 && !TREE_NO_WARNING (rhs
)
8467 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8468 && (complain
& tf_warning
))
8470 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8472 warning_at (loc
, OPT_Wparentheses
,
8473 "suggest parentheses around assignment used as truth value");
8474 TREE_NO_WARNING (rhs
) = 1;
8477 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8481 /* Convert RHS to be of type TYPE.
8482 If EXP is nonzero, it is the target of the initialization.
8483 ERRTYPE indicates what kind of error the implicit conversion is.
8485 Two major differences between the behavior of
8486 `convert_for_assignment' and `convert_for_initialization'
8487 are that references are bashed in the former, while
8488 copied in the latter, and aggregates are assigned in
8489 the former (operator=) while initialized in the
8492 If using constructor make sure no conversion operator exists, if one does
8493 exist, an ambiguity exists. */
8496 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8497 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8498 tsubst_flags_t complain
)
8500 enum tree_code codel
= TREE_CODE (type
);
8502 enum tree_code coder
;
8504 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8505 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8506 if (TREE_CODE (rhs
) == NOP_EXPR
8507 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8508 && codel
!= REFERENCE_TYPE
)
8509 rhs
= TREE_OPERAND (rhs
, 0);
8511 if (type
== error_mark_node
8512 || rhs
== error_mark_node
8513 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8514 return error_mark_node
;
8516 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8518 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8519 && TREE_CODE (type
) != ARRAY_TYPE
8520 && (TREE_CODE (type
) != REFERENCE_TYPE
8521 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8522 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8523 && !TYPE_REFFN_P (type
))
8524 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8525 rhs
= decay_conversion (rhs
, complain
);
8527 rhstype
= TREE_TYPE (rhs
);
8528 coder
= TREE_CODE (rhstype
);
8530 if (coder
== ERROR_MARK
)
8531 return error_mark_node
;
8533 /* We accept references to incomplete types, so we can
8534 return here before checking if RHS is of complete type. */
8536 if (codel
== REFERENCE_TYPE
)
8538 /* This should eventually happen in convert_arguments. */
8539 int savew
= 0, savee
= 0;
8542 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8543 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8546 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8547 inform (DECL_SOURCE_LOCATION (fndecl
),
8548 "in passing argument %P of %qD", parmnum
, fndecl
);
8554 exp
= require_complete_type_sfinae (exp
, complain
);
8555 if (exp
== error_mark_node
)
8556 return error_mark_node
;
8558 rhstype
= non_reference (rhstype
);
8560 type
= complete_type (type
);
8562 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8563 /* Don't try to do copy-initialization if we already have
8564 direct-initialization. */
8567 if (MAYBE_CLASS_TYPE_P (type
))
8568 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8570 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8574 /* If RETVAL is the address of, or a reference to, a local variable or
8575 temporary give an appropriate warning and return true. */
8578 maybe_warn_about_returning_address_of_local (tree retval
)
8580 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8581 tree whats_returned
= retval
;
8585 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
8586 whats_returned
= TREE_OPERAND (whats_returned
, 1);
8587 else if (CONVERT_EXPR_P (whats_returned
)
8588 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
8589 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8594 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
8596 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8598 while (TREE_CODE (whats_returned
) == COMPONENT_REF
8599 || TREE_CODE (whats_returned
) == ARRAY_REF
)
8600 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8602 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8604 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
8605 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
8607 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
8610 if (VAR_P (whats_returned
)
8611 && DECL_NAME (whats_returned
)
8612 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
8614 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
8619 if (DECL_P (whats_returned
)
8620 && DECL_NAME (whats_returned
)
8621 && DECL_FUNCTION_SCOPE_P (whats_returned
)
8622 && !is_capture_proxy (whats_returned
)
8623 && !(TREE_STATIC (whats_returned
)
8624 || TREE_PUBLIC (whats_returned
)))
8626 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8627 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8628 OPT_Wreturn_local_addr
,
8629 "reference to local variable %qD returned",
8631 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
8632 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8633 OPT_Wreturn_local_addr
, "address of label %qD returned",
8636 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8637 OPT_Wreturn_local_addr
, "address of local variable %qD "
8638 "returned", whats_returned
);
8645 /* Check that returning RETVAL from the current function is valid.
8646 Return an expression explicitly showing all conversions required to
8647 change RETVAL into the function return type, and to assign it to
8648 the DECL_RESULT for the function. Set *NO_WARNING to true if
8649 code reaches end of non-void function warning shouldn't be issued
8650 on this RETURN_EXPR. */
8653 check_return_expr (tree retval
, bool *no_warning
)
8656 /* The type actually returned by the function. */
8658 /* The type the function is declared to return, or void if
8659 the declared type is incomplete. */
8661 int fn_returns_value_p
;
8662 bool named_return_value_okay_p
;
8664 *no_warning
= false;
8666 if (flag_cilkplus
&& retval
&& contains_cilk_spawn_stmt (retval
))
8668 error_at (EXPR_LOCATION (retval
), "use of %<_Cilk_spawn%> in a return "
8669 "statement is not allowed");
8673 /* A `volatile' function is one that isn't supposed to return, ever.
8674 (This is a G++ extension, used to get better code for functions
8675 that call the `volatile' function.) */
8676 if (TREE_THIS_VOLATILE (current_function_decl
))
8677 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8679 /* Check for various simple errors. */
8680 if (DECL_DESTRUCTOR_P (current_function_decl
))
8683 error ("returning a value from a destructor");
8686 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
8688 if (in_function_try_handler
)
8689 /* If a return statement appears in a handler of the
8690 function-try-block of a constructor, the program is ill-formed. */
8691 error ("cannot return from a handler of a function-try-block of a constructor");
8693 /* You can't return a value from a constructor. */
8694 error ("returning a value from a constructor");
8698 const tree saved_retval
= retval
;
8700 if (processing_template_decl
)
8702 current_function_returns_value
= 1;
8704 if (check_for_bare_parameter_packs (retval
))
8705 return error_mark_node
;
8707 if (WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
8708 || (retval
!= NULL_TREE
8709 && type_dependent_expression_p (retval
)))
8713 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
8715 /* Deduce auto return type from a return statement. */
8716 if (current_function_auto_return_pattern
)
8721 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
8723 /* Give a helpful error message. */
8724 error ("return-statement with no value, in function returning %qT",
8725 current_function_auto_return_pattern
);
8726 inform (input_location
, "only plain %<auto%> return type can be "
8727 "deduced to %<void%>");
8728 type
= error_mark_node
;
8730 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
8732 error ("returning initializer list");
8733 type
= error_mark_node
;
8739 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
8740 type
= do_auto_deduction (current_function_auto_return_pattern
,
8744 if (type
== error_mark_node
)
8746 else if (functype
== current_function_auto_return_pattern
)
8747 apply_deduced_return_type (current_function_decl
, type
);
8748 else if (!same_type_p (type
, functype
))
8750 if (LAMBDA_FUNCTION_P (current_function_decl
))
8751 error ("inconsistent types %qT and %qT deduced for "
8752 "lambda return type", functype
, type
);
8754 error ("inconsistent deduction for auto return type: "
8755 "%qT and then %qT", functype
, type
);
8760 result
= DECL_RESULT (current_function_decl
);
8761 valtype
= TREE_TYPE (result
);
8762 gcc_assert (valtype
!= NULL_TREE
);
8763 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
8765 /* Check for a return statement with no return value in a function
8766 that's supposed to return a value. */
8767 if (!retval
&& fn_returns_value_p
)
8769 if (functype
!= error_mark_node
)
8770 permerror (input_location
, "return-statement with no value, in "
8771 "function returning %qT", valtype
);
8772 /* Remember that this function did return. */
8773 current_function_returns_value
= 1;
8774 /* And signal caller that TREE_NO_WARNING should be set on the
8775 RETURN_EXPR to avoid control reaches end of non-void function
8776 warnings in tree-cfg.c. */
8779 /* Check for a return statement with a value in a function that
8780 isn't supposed to return a value. */
8781 else if (retval
&& !fn_returns_value_p
)
8783 if (VOID_TYPE_P (TREE_TYPE (retval
)))
8784 /* You can return a `void' value from a function of `void'
8785 type. In that case, we have to evaluate the expression for
8786 its side-effects. */
8787 finish_expr_stmt (retval
);
8789 permerror (input_location
, "return-statement with a value, in function "
8790 "returning 'void'");
8791 current_function_returns_null
= 1;
8793 /* There's really no value to return, after all. */
8797 /* Remember that this function can sometimes return without a
8799 current_function_returns_null
= 1;
8801 /* Remember that this function did return a value. */
8802 current_function_returns_value
= 1;
8804 /* Check for erroneous operands -- but after giving ourselves a
8805 chance to provide an error about returning a value from a void
8807 if (error_operand_p (retval
))
8809 current_function_return_value
= error_mark_node
;
8810 return error_mark_node
;
8813 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
8814 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
8815 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
8816 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
8818 && retval
&& null_ptr_cst_p (retval
))
8819 warning (0, "%<operator new%> must not return NULL unless it is "
8820 "declared %<throw()%> (or -fcheck-new is in effect)");
8822 /* Effective C++ rule 15. See also start_function. */
8824 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
8828 /* The function return type must be a reference to the current
8830 if (TREE_CODE (valtype
) == REFERENCE_TYPE
8831 && same_type_ignoring_top_level_qualifiers_p
8832 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
8834 /* Returning '*this' is obviously OK. */
8835 if (retval
== current_class_ref
)
8837 /* If we are calling a function whose return type is the same of
8838 the current class reference, it is ok. */
8839 else if (INDIRECT_REF_P (retval
)
8840 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
8845 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
8848 if (processing_template_decl
)
8850 /* We should not have changed the return value. */
8851 gcc_assert (retval
== saved_retval
);
8855 /* The fabled Named Return Value optimization, as per [class.copy]/15:
8857 [...] For a function with a class return type, if the expression
8858 in the return statement is the name of a local object, and the cv-
8859 unqualified type of the local object is the same as the function
8860 return type, an implementation is permitted to omit creating the tem-
8861 porary object to hold the function return value [...]
8863 So, if this is a value-returning function that always returns the same
8864 local variable, remember it.
8866 It might be nice to be more flexible, and choose the first suitable
8867 variable even if the function sometimes returns something else, but
8868 then we run the risk of clobbering the variable we chose if the other
8869 returned expression uses the chosen variable somehow. And people expect
8870 this restriction, anyway. (jason 2000-11-19)
8872 See finish_function and finalize_nrv for the rest of this optimization. */
8874 named_return_value_okay_p
=
8875 (retval
!= NULL_TREE
8876 /* Must be a local, automatic variable. */
8878 && DECL_CONTEXT (retval
) == current_function_decl
8879 && ! TREE_STATIC (retval
)
8880 /* And not a lambda or anonymous union proxy. */
8881 && !DECL_HAS_VALUE_EXPR_P (retval
)
8882 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
8883 /* The cv-unqualified type of the returned value must be the
8884 same as the cv-unqualified return type of the
8886 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
8887 (TYPE_MAIN_VARIANT (functype
)))
8888 /* And the returned value must be non-volatile. */
8889 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
8891 if (fn_returns_value_p
&& flag_elide_constructors
)
8893 if (named_return_value_okay_p
8894 && (current_function_return_value
== NULL_TREE
8895 || current_function_return_value
== retval
))
8896 current_function_return_value
= retval
;
8898 current_function_return_value
= error_mark_node
;
8901 /* We don't need to do any conversions when there's nothing being
8906 /* Do any required conversions. */
8907 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
8908 /* No conversions are required. */
8912 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
8914 /* The functype's return type will have been set to void, if it
8915 was an incomplete type. Just treat this as 'return;' */
8916 if (VOID_TYPE_P (functype
))
8917 return error_mark_node
;
8919 /* If we had an id-expression obfuscated by force_paren_expr, we need
8920 to undo it so we can try to treat it as an rvalue below. */
8921 retval
= maybe_undo_parenthesized_ref (retval
);
8923 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
8924 treated as an rvalue for the purposes of overload resolution to
8925 favor move constructors over copy constructors.
8927 Note that these conditions are similar to, but not as strict as,
8928 the conditions for the named return value optimization. */
8929 if ((cxx_dialect
!= cxx98
)
8930 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
8931 || TREE_CODE (retval
) == PARM_DECL
)
8932 && DECL_CONTEXT (retval
) == current_function_decl
8933 && !TREE_STATIC (retval
)
8934 /* This is only interesting for class type. */
8935 && CLASS_TYPE_P (functype
))
8936 flags
= flags
| LOOKUP_PREFER_RVALUE
;
8938 /* First convert the value to the function's return type, then
8939 to the type of return value's location to handle the
8940 case that functype is smaller than the valtype. */
8941 retval
= convert_for_initialization
8942 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
8943 tf_warning_or_error
);
8944 retval
= convert (valtype
, retval
);
8946 /* If the conversion failed, treat this just like `return;'. */
8947 if (retval
== error_mark_node
)
8949 /* We can't initialize a register from a AGGR_INIT_EXPR. */
8950 else if (! cfun
->returns_struct
8951 && TREE_CODE (retval
) == TARGET_EXPR
8952 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
8953 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8954 TREE_OPERAND (retval
, 0));
8955 else if (maybe_warn_about_returning_address_of_local (retval
))
8956 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8957 build_zero_cst (TREE_TYPE (retval
)));
8960 /* Actually copy the value returned into the appropriate location. */
8961 if (retval
&& retval
!= result
)
8962 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
8968 /* Returns nonzero if the pointer-type FROM can be converted to the
8969 pointer-type TO via a qualification conversion. If CONSTP is -1,
8970 then we return nonzero if the pointers are similar, and the
8971 cv-qualification signature of FROM is a proper subset of that of TO.
8973 If CONSTP is positive, then all outer pointers have been
8977 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
8979 bool to_more_cv_qualified
= false;
8980 bool is_opaque_pointer
= false;
8982 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8984 if (TREE_CODE (to
) != TREE_CODE (from
))
8987 if (TREE_CODE (from
) == OFFSET_TYPE
8988 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
8989 TYPE_OFFSET_BASETYPE (to
)))
8992 /* Const and volatile mean something different for function types,
8993 so the usual checks are not appropriate. */
8994 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
8996 if (!at_least_as_qualified_p (to
, from
))
8999 if (!at_least_as_qualified_p (from
, to
))
9003 to_more_cv_qualified
= true;
9007 constp
&= TYPE_READONLY (to
);
9010 if (VECTOR_TYPE_P (to
))
9011 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9013 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9014 return ((constp
>= 0 || to_more_cv_qualified
)
9015 && (is_opaque_pointer
9016 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9020 /* When comparing, say, char ** to char const **, this function takes
9021 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9022 types to this function. */
9025 comp_ptr_ttypes (tree to
, tree from
)
9027 return comp_ptr_ttypes_real (to
, from
, 1);
9030 /* Returns true iff FNTYPE is a non-class type that involves
9031 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9032 if a parameter type is ill-formed. */
9035 error_type_p (const_tree type
)
9039 switch (TREE_CODE (type
))
9045 case REFERENCE_TYPE
:
9047 return error_type_p (TREE_TYPE (type
));
9051 if (error_type_p (TREE_TYPE (type
)))
9053 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9054 if (error_type_p (TREE_VALUE (t
)))
9059 if (TYPE_PTRMEMFUNC_P (type
))
9060 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9068 /* Returns true if to and from are (possibly multi-level) pointers to the same
9069 type or inheritance-related types, regardless of cv-quals. */
9072 ptr_reasonably_similar (const_tree to
, const_tree from
)
9074 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9076 /* Any target type is similar enough to void. */
9077 if (VOID_TYPE_P (to
))
9078 return !error_type_p (from
);
9079 if (VOID_TYPE_P (from
))
9080 return !error_type_p (to
);
9082 if (TREE_CODE (to
) != TREE_CODE (from
))
9085 if (TREE_CODE (from
) == OFFSET_TYPE
9086 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9087 TYPE_OFFSET_BASETYPE (from
),
9088 COMPARE_BASE
| COMPARE_DERIVED
))
9091 if (VECTOR_TYPE_P (to
)
9092 && vector_types_convertible_p (to
, from
, false))
9095 if (TREE_CODE (to
) == INTEGER_TYPE
9096 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9099 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9100 return !error_type_p (to
) && !error_type_p (from
);
9102 if (!TYPE_PTR_P (to
))
9104 /* When either type is incomplete avoid DERIVED_FROM_P,
9105 which may call complete_type (c++/57942). */
9106 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9108 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9109 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9114 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9115 pointer-to-member types) are the same, ignoring cv-qualification at
9119 comp_ptr_ttypes_const (tree to
, tree from
)
9121 bool is_opaque_pointer
= false;
9123 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9125 if (TREE_CODE (to
) != TREE_CODE (from
))
9128 if (TREE_CODE (from
) == OFFSET_TYPE
9129 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9130 TYPE_OFFSET_BASETYPE (to
)))
9133 if (VECTOR_TYPE_P (to
))
9134 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9136 if (!TYPE_PTR_P (to
))
9137 return (is_opaque_pointer
9138 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9142 /* Returns the type qualifiers for this type, including the qualifiers on the
9143 elements for an array type. */
9146 cp_type_quals (const_tree type
)
9149 /* This CONST_CAST is okay because strip_array_types returns its
9150 argument unmodified and we assign it to a const_tree. */
9151 type
= strip_array_types (CONST_CAST_TREE (type
));
9152 if (type
== error_mark_node
9153 /* Quals on a FUNCTION_TYPE are memfn quals. */
9154 || TREE_CODE (type
) == FUNCTION_TYPE
)
9155 return TYPE_UNQUALIFIED
;
9156 quals
= TYPE_QUALS (type
);
9157 /* METHOD and REFERENCE_TYPEs should never have quals. */
9158 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9159 && TREE_CODE (type
) != REFERENCE_TYPE
)
9160 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9161 == TYPE_UNQUALIFIED
));
9165 /* Returns the function-ref-qualifier for TYPE */
9168 type_memfn_rqual (const_tree type
)
9170 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9171 || TREE_CODE (type
) == METHOD_TYPE
);
9173 if (!FUNCTION_REF_QUALIFIED (type
))
9174 return REF_QUAL_NONE
;
9175 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9176 return REF_QUAL_RVALUE
;
9178 return REF_QUAL_LVALUE
;
9181 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9185 type_memfn_quals (const_tree type
)
9187 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9188 return TYPE_QUALS (type
);
9189 else if (TREE_CODE (type
) == METHOD_TYPE
)
9190 return cp_type_quals (class_of_this_parm (type
));
9195 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9196 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9199 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9201 /* Could handle METHOD_TYPE here if necessary. */
9202 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9203 if (TYPE_QUALS (type
) == memfn_quals
9204 && type_memfn_rqual (type
) == rqual
)
9207 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9209 tree result
= build_qualified_type (type
, memfn_quals
);
9210 if (tree canon
= TYPE_CANONICAL (result
))
9211 if (canon
!= result
)
9212 /* check_qualified_type doesn't check the ref-qualifier, so make sure
9213 TYPE_CANONICAL is correct. */
9214 TYPE_CANONICAL (result
)
9215 = build_ref_qualified_type (canon
, type_memfn_rqual (result
));
9216 result
= build_exception_variant (result
, TYPE_RAISES_EXCEPTIONS (type
));
9217 return build_ref_qualified_type (result
, rqual
);
9220 /* Returns nonzero if TYPE is const or volatile. */
9223 cv_qualified_p (const_tree type
)
9225 int quals
= cp_type_quals (type
);
9226 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9229 /* Returns nonzero if the TYPE contains a mutable member. */
9232 cp_has_mutable_p (const_tree type
)
9234 /* This CONST_CAST is okay because strip_array_types returns its
9235 argument unmodified and we assign it to a const_tree. */
9236 type
= strip_array_types (CONST_CAST_TREE(type
));
9238 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9241 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9242 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9243 approximation. In particular, consider:
9246 struct S { int i; };
9247 const S s = { f(); }
9249 Here, we will make "s" as TREE_READONLY (because it is declared
9250 "const") -- only to reverse ourselves upon seeing that the
9251 initializer is non-constant. */
9254 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9256 tree type
= TREE_TYPE (decl
);
9258 if (type
== error_mark_node
)
9261 if (TREE_CODE (decl
) == TYPE_DECL
)
9264 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9265 && type_quals
!= TYPE_UNQUALIFIED
));
9267 /* Avoid setting TREE_READONLY incorrectly. */
9268 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9269 constructor can produce constant init, so rely on cp_finish_decl to
9270 clear TREE_READONLY if the variable has non-constant init. */
9272 /* If the type has (or might have) a mutable component, that component
9273 might be modified. */
9274 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9275 type_quals
&= ~TYPE_QUAL_CONST
;
9277 c_apply_type_quals_to_decl (type_quals
, decl
);
9280 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9281 exemplar types such that casting T1 to T2 is casting away constness
9282 if and only if there is no implicit conversion from T1 to T2. */
9285 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9290 /* [expr.const.cast]
9292 For multi-level pointer to members and multi-level mixed pointers
9293 and pointers to members (conv.qual), the "member" aspect of a
9294 pointer to member level is ignored when determining if a const
9295 cv-qualifier has been cast away. */
9296 /* [expr.const.cast]
9298 For two pointer types:
9300 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9301 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9304 casting from X1 to X2 casts away constness if, for a non-pointer
9305 type T there does not exist an implicit conversion (clause
9308 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9312 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9313 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9314 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9316 *t1
= cp_build_qualified_type (void_type_node
,
9317 cp_type_quals (*t1
));
9318 *t2
= cp_build_qualified_type (void_type_node
,
9319 cp_type_quals (*t2
));
9323 quals1
= cp_type_quals (*t1
);
9324 quals2
= cp_type_quals (*t2
);
9326 if (TYPE_PTRDATAMEM_P (*t1
))
9327 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9329 *t1
= TREE_TYPE (*t1
);
9330 if (TYPE_PTRDATAMEM_P (*t2
))
9331 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9333 *t2
= TREE_TYPE (*t2
);
9335 casts_away_constness_r (t1
, t2
, complain
);
9336 *t1
= build_pointer_type (*t1
);
9337 *t2
= build_pointer_type (*t2
);
9338 *t1
= cp_build_qualified_type (*t1
, quals1
);
9339 *t2
= cp_build_qualified_type (*t2
, quals2
);
9342 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9345 ??? This function returns non-zero if casting away qualifiers not
9346 just const. We would like to return to the caller exactly which
9347 qualifiers are casted away to give more accurate diagnostics.
9351 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9353 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9355 /* [expr.const.cast]
9357 Casting from an lvalue of type T1 to an lvalue of type T2
9358 using a reference cast casts away constness if a cast from an
9359 rvalue of type "pointer to T1" to the type "pointer to T2"
9360 casts away constness. */
9361 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9362 return casts_away_constness (build_pointer_type (t1
),
9363 build_pointer_type (TREE_TYPE (t2
)),
9367 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9368 /* [expr.const.cast]
9370 Casting from an rvalue of type "pointer to data member of X
9371 of type T1" to the type "pointer to data member of Y of type
9372 T2" casts away constness if a cast from an rvalue of type
9373 "pointer to T1" to the type "pointer to T2" casts away
9375 return casts_away_constness
9376 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9377 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9380 /* Casting away constness is only something that makes sense for
9381 pointer or reference types. */
9382 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9385 /* Top-level qualifiers don't matter. */
9386 t1
= TYPE_MAIN_VARIANT (t1
);
9387 t2
= TYPE_MAIN_VARIANT (t2
);
9388 casts_away_constness_r (&t1
, &t2
, complain
);
9389 if (!can_convert (t2
, t1
, complain
))
9395 /* If T is a REFERENCE_TYPE return the type to which T refers.
9396 Otherwise, return T itself. */
9399 non_reference (tree t
)
9401 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9407 /* Return nonzero if REF is an lvalue valid for this language;
9408 otherwise, print an error message and return zero. USE says
9409 how the lvalue is being used and so selects the error message. */
9412 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9414 cp_lvalue_kind kind
= lvalue_kind (ref
);
9416 if (kind
== clk_none
)
9418 if (complain
& tf_error
)
9419 lvalue_error (input_location
, use
);
9422 else if (kind
& (clk_rvalueref
|clk_class
))
9424 if (!(complain
& tf_error
))
9426 if (kind
& clk_class
)
9427 /* Make this a permerror because we used to accept it. */
9428 permerror (input_location
, "using temporary as lvalue");
9430 error ("using xvalue (rvalue reference) as lvalue");
9435 /* Return true if a user-defined literal operator is a raw operator. */
9438 check_raw_literal_operator (const_tree decl
)
9440 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9443 bool maybe_raw_p
= false;
9445 /* Count the number and type of arguments and check for ellipsis. */
9446 for (argtype
= argtypes
, arity
= 0;
9447 argtype
&& argtype
!= void_list_node
;
9448 ++arity
, argtype
= TREE_CHAIN (argtype
))
9450 tree t
= TREE_VALUE (argtype
);
9452 if (same_type_p (t
, const_string_type_node
))
9456 return false; /* Found ellipsis. */
9458 if (!maybe_raw_p
|| arity
!= 1)
9465 /* Return true if a user-defined literal operator has one of the allowed
9469 check_literal_operator_args (const_tree decl
,
9470 bool *long_long_unsigned_p
, bool *long_double_p
)
9472 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9474 *long_long_unsigned_p
= false;
9475 *long_double_p
= false;
9476 if (processing_template_decl
|| processing_specialization
)
9477 return argtypes
== void_list_node
;
9484 /* Count the number and type of arguments and check for ellipsis. */
9485 for (argtype
= argtypes
, arity
= 0;
9486 argtype
&& argtype
!= void_list_node
;
9487 argtype
= TREE_CHAIN (argtype
))
9489 tree t
= TREE_VALUE (argtype
);
9494 bool maybe_raw_p
= false;
9496 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9498 t
= TYPE_MAIN_VARIANT (t
);
9499 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9500 || same_type_p (t
, wchar_type_node
)
9501 || same_type_p (t
, char16_type_node
)
9502 || same_type_p (t
, char32_type_node
))
9504 argtype
= TREE_CHAIN (argtype
);
9507 t
= TREE_VALUE (argtype
);
9508 if (maybe_raw_p
&& argtype
== void_list_node
)
9510 else if (same_type_p (t
, size_type_node
))
9519 else if (same_type_p (t
, long_long_unsigned_type_node
))
9522 *long_long_unsigned_p
= true;
9524 else if (same_type_p (t
, long_double_type_node
))
9527 *long_double_p
= true;
9529 else if (same_type_p (t
, char_type_node
))
9531 else if (same_type_p (t
, wchar_type_node
))
9533 else if (same_type_p (t
, char16_type_node
))
9535 else if (same_type_p (t
, char32_type_node
))
9541 return false; /* Found ellipsis. */
9543 if (arity
!= max_arity
)
9550 /* Always returns false since unlike C90, C++ has no concept of implicit
9551 function declarations. */
9554 c_decl_implicit (const_tree
)