1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
38 #include "diagnostic.h"
45 static tree
pfn_from_ptrmemfunc (tree
);
46 static tree
delta_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
49 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (tree
, tree
, tree
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool);
57 static void casts_away_constness_r (tree
*, tree
*);
58 static bool casts_away_constness (tree
, tree
);
59 static void maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
);
61 static void warn_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_else (type
, value
))
93 return error_mark_node
;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type
)
104 if (type
== NULL_TREE
)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node
;
109 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
111 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
113 tree t
= complete_type (TREE_TYPE (type
));
114 unsigned int needs_constructing
, has_nontrivial_dtor
;
115 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
121 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
123 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
127 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_else (tree type
, tree value
)
140 type
= complete_type (type
);
141 if (type
== error_mark_node
)
142 /* We already issued an error. */
144 else if (!COMPLETE_TYPE_P (type
))
146 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
153 /* Return truthvalue of whether type of EXP is instantiated. */
156 type_unknown_p (const_tree exp
)
158 return (TREE_CODE (exp
) == TREE_LIST
159 || TREE_TYPE (exp
) == unknown_type_node
);
163 /* Return the common type of two parameter lists.
164 We assume that comptypes has already been done and returned 1;
165 if that isn't so, this may crash.
167 As an optimization, free the space we allocate if the parameter
168 lists are already common. */
171 commonparms (tree p1
, tree p2
)
173 tree oldargs
= p1
, newargs
, n
;
177 len
= list_length (p1
);
178 newargs
= tree_last (p1
);
180 if (newargs
== void_list_node
)
189 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
194 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
196 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
198 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
201 else if (! TREE_PURPOSE (p1
))
203 if (TREE_PURPOSE (p2
))
205 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
211 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
213 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
215 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
218 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
221 TREE_VALUE (n
) = TREE_VALUE (p1
);
229 /* Given a type, perhaps copied for a typedef,
230 find the "original" version of it. */
232 original_type (tree t
)
234 int quals
= cp_type_quals (t
);
235 while (t
!= error_mark_node
236 && TYPE_NAME (t
) != NULL_TREE
)
238 tree x
= TYPE_NAME (t
);
239 if (TREE_CODE (x
) != TYPE_DECL
)
241 x
= DECL_ORIGINAL_TYPE (x
);
246 return cp_build_qualified_type (t
, quals
);
249 /* Return the common type for two arithmetic types T1 and T2 under the
250 usual arithmetic conversions. The default conversions have already
251 been applied, and enumerated types converted to their compatible
255 cp_common_type (tree t1
, tree t2
)
257 enum tree_code code1
= TREE_CODE (t1
);
258 enum tree_code code2
= TREE_CODE (t2
);
261 /* In what follows, we slightly generalize the rules given in [expr] so
262 as to deal with `long long' and `complex'. First, merge the
264 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
266 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
268 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
269 return build_type_attribute_variant (t1
, attributes
);
274 /* FIXME: Attributes. */
275 gcc_assert (ARITHMETIC_TYPE_P (t1
)
276 || TREE_CODE (t1
) == VECTOR_TYPE
277 || UNSCOPED_ENUM_P (t1
));
278 gcc_assert (ARITHMETIC_TYPE_P (t2
)
279 || TREE_CODE (t2
) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t2
));
282 /* If one type is complex, form the common type of the non-complex
283 components, then make that complex. Use T1 or T2 if it is the
285 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
287 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
288 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
290 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
292 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
293 return build_type_attribute_variant (t1
, attributes
);
294 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
295 return build_type_attribute_variant (t2
, attributes
);
297 return build_type_attribute_variant (build_complex_type (subtype
),
301 if (code1
== VECTOR_TYPE
)
303 /* When we get here we should have two vectors of the same size.
304 Just prefer the unsigned one if present. */
305 if (TYPE_UNSIGNED (t1
))
306 return build_type_attribute_variant (t1
, attributes
);
308 return build_type_attribute_variant (t2
, attributes
);
311 /* If only one is real, use it as the result. */
312 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
313 return build_type_attribute_variant (t1
, attributes
);
314 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
315 return build_type_attribute_variant (t2
, attributes
);
317 /* Both real or both integers; use the one with greater precision. */
318 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
319 return build_type_attribute_variant (t1
, attributes
);
320 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
321 return build_type_attribute_variant (t2
, attributes
);
323 /* The types are the same; no need to do anything fancy. */
324 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
325 return build_type_attribute_variant (t1
, attributes
);
327 if (code1
!= REAL_TYPE
)
329 /* If one is unsigned long long, then convert the other to unsigned
331 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
332 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
333 return build_type_attribute_variant (long_long_unsigned_type_node
,
335 /* If one is a long long, and the other is an unsigned long, and
336 long long can represent all the values of an unsigned long, then
337 convert to a long long. Otherwise, convert to an unsigned long
338 long. Otherwise, if either operand is long long, convert the
341 Since we're here, we know the TYPE_PRECISION is the same;
342 therefore converting to long long cannot represent all the values
343 of an unsigned long, so we choose unsigned long long in that
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
348 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
349 ? long_long_unsigned_type_node
350 : long_long_integer_type_node
);
351 return build_type_attribute_variant (t
, attributes
);
353 if (int128_integer_type_node
!= NULL_TREE
354 && (same_type_p (TYPE_MAIN_VARIANT (t1
),
355 int128_integer_type_node
)
356 || same_type_p (TYPE_MAIN_VARIANT (t2
),
357 int128_integer_type_node
)))
359 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
360 ? int128_unsigned_type_node
361 : int128_integer_type_node
);
362 return build_type_attribute_variant (t
, attributes
);
365 /* Go through the same procedure, but for longs. */
366 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
367 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
368 return build_type_attribute_variant (long_unsigned_type_node
,
370 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
371 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
373 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
374 ? long_unsigned_type_node
: long_integer_type_node
);
375 return build_type_attribute_variant (t
, attributes
);
377 /* Otherwise prefer the unsigned one. */
378 if (TYPE_UNSIGNED (t1
))
379 return build_type_attribute_variant (t1
, attributes
);
381 return build_type_attribute_variant (t2
, attributes
);
385 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
386 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
387 return build_type_attribute_variant (long_double_type_node
,
389 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
390 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
391 return build_type_attribute_variant (double_type_node
,
393 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
394 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
395 return build_type_attribute_variant (float_type_node
,
398 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
399 the standard C++ floating-point types. Logic earlier in this
400 function has already eliminated the possibility that
401 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
402 compelling reason to choose one or the other. */
403 return build_type_attribute_variant (t1
, attributes
);
407 /* T1 and T2 are arithmetic or enumeration types. Return the type
408 that will result from the "usual arithmetic conversions" on T1 and
409 T2 as described in [expr]. */
412 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
414 gcc_assert (ARITHMETIC_TYPE_P (t1
)
415 || TREE_CODE (t1
) == VECTOR_TYPE
416 || UNSCOPED_ENUM_P (t1
));
417 gcc_assert (ARITHMETIC_TYPE_P (t2
)
418 || TREE_CODE (t2
) == VECTOR_TYPE
419 || UNSCOPED_ENUM_P (t2
));
421 /* Perform the integral promotions. We do not promote real types here. */
422 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
423 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
425 t1
= type_promotes_to (t1
);
426 t2
= type_promotes_to (t2
);
429 return cp_common_type (t1
, t2
);
432 /* Subroutine of composite_pointer_type to implement the recursive
433 case. See that function for documentation of the parameters. */
436 composite_pointer_type_r (tree t1
, tree t2
,
437 composite_pointer_operation operation
,
438 tsubst_flags_t complain
)
445 /* Determine the types pointed to by T1 and T2. */
446 if (TREE_CODE (t1
) == POINTER_TYPE
)
448 pointee1
= TREE_TYPE (t1
);
449 pointee2
= TREE_TYPE (t2
);
453 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
454 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
459 Otherwise, the composite pointer type is a pointer type
460 similar (_conv.qual_) to the type of one of the operands,
461 with a cv-qualification signature (_conv.qual_) that is the
462 union of the cv-qualification signatures of the operand
464 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
465 result_type
= pointee1
;
466 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
467 && TREE_CODE (pointee2
) == POINTER_TYPE
)
468 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
469 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
470 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
474 if (complain
& tf_error
)
479 permerror (input_location
, "comparison between "
480 "distinct pointer types %qT and %qT lacks a cast",
484 permerror (input_location
, "conversion between "
485 "distinct pointer types %qT and %qT lacks a cast",
488 case CPO_CONDITIONAL_EXPR
:
489 permerror (input_location
, "conditional expression between "
490 "distinct pointer types %qT and %qT lacks a cast",
497 result_type
= void_type_node
;
499 result_type
= cp_build_qualified_type (result_type
,
500 (cp_type_quals (pointee1
)
501 | cp_type_quals (pointee2
)));
502 /* If the original types were pointers to members, so is the
504 if (TYPE_PTR_TO_MEMBER_P (t1
))
506 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
507 TYPE_PTRMEM_CLASS_TYPE (t2
))
508 && (complain
& tf_error
))
513 permerror (input_location
, "comparison between "
514 "distinct pointer types %qT and %qT lacks a cast",
518 permerror (input_location
, "conversion between "
519 "distinct pointer types %qT and %qT lacks a cast",
522 case CPO_CONDITIONAL_EXPR
:
523 permerror (input_location
, "conditional expression between "
524 "distinct pointer types %qT and %qT lacks a cast",
531 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
535 result_type
= build_pointer_type (result_type
);
537 /* Merge the attributes. */
538 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
539 return build_type_attribute_variant (result_type
, attributes
);
542 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
543 ARG1 and ARG2 are the values with those types. The OPERATION is to
544 describe the operation between the pointer types,
545 in case an error occurs.
547 This routine also implements the computation of a common type for
548 pointers-to-members as per [expr.eq]. */
551 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
552 composite_pointer_operation operation
,
553 tsubst_flags_t complain
)
560 If one operand is a null pointer constant, the composite pointer
561 type is the type of the other operand. */
562 if (null_ptr_cst_p (arg1
))
564 if (null_ptr_cst_p (arg2
))
571 If one of the operands has type "pointer to cv1 void*", then
572 the other has type "pointer to cv2T", and the composite pointer
573 type is "pointer to cv12 void", where cv12 is the union of cv1
576 If either type is a pointer to void, make sure it is T1. */
577 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
585 /* Now, if T1 is a pointer to void, merge the qualifiers. */
586 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
591 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
596 pedwarn (input_location
, OPT_pedantic
,
597 "ISO C++ forbids comparison between "
598 "pointer of type %<void *%> and pointer-to-function");
601 pedwarn (input_location
, OPT_pedantic
,
602 "ISO C++ forbids conversion between "
603 "pointer of type %<void *%> and pointer-to-function");
605 case CPO_CONDITIONAL_EXPR
:
606 pedwarn (input_location
, OPT_pedantic
,
607 "ISO C++ forbids conditional expression between "
608 "pointer of type %<void *%> and pointer-to-function");
615 = cp_build_qualified_type (void_type_node
,
616 (cp_type_quals (TREE_TYPE (t1
))
617 | cp_type_quals (TREE_TYPE (t2
))));
618 result_type
= build_pointer_type (result_type
);
619 /* Merge the attributes. */
620 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
621 return build_type_attribute_variant (result_type
, attributes
);
624 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
625 && TREE_CODE (t2
) == POINTER_TYPE
)
627 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
631 /* [expr.eq] permits the application of a pointer conversion to
632 bring the pointers to a common type. */
633 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
634 && CLASS_TYPE_P (TREE_TYPE (t1
))
635 && CLASS_TYPE_P (TREE_TYPE (t2
))
636 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
639 class1
= TREE_TYPE (t1
);
640 class2
= TREE_TYPE (t2
);
642 if (DERIVED_FROM_P (class1
, class2
))
643 t2
= (build_pointer_type
644 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
645 else if (DERIVED_FROM_P (class2
, class1
))
646 t1
= (build_pointer_type
647 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
650 if (complain
& tf_error
)
654 error ("comparison between distinct "
655 "pointer types %qT and %qT lacks a cast", t1
, t2
);
658 error ("conversion between distinct "
659 "pointer types %qT and %qT lacks a cast", t1
, t2
);
661 case CPO_CONDITIONAL_EXPR
:
662 error ("conditional expression between distinct "
663 "pointer types %qT and %qT lacks a cast", t1
, t2
);
668 return error_mark_node
;
671 /* [expr.eq] permits the application of a pointer-to-member
672 conversion to change the class type of one of the types. */
673 else if (TYPE_PTR_TO_MEMBER_P (t1
)
674 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
675 TYPE_PTRMEM_CLASS_TYPE (t2
)))
677 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
678 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
680 if (DERIVED_FROM_P (class1
, class2
))
681 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
682 else if (DERIVED_FROM_P (class2
, class1
))
683 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
686 if (complain
& tf_error
)
690 error ("comparison between distinct "
691 "pointer-to-member types %qT and %qT lacks a cast",
695 error ("conversion between distinct "
696 "pointer-to-member types %qT and %qT lacks a cast",
699 case CPO_CONDITIONAL_EXPR
:
700 error ("conditional expression between distinct "
701 "pointer-to-member types %qT and %qT lacks a cast",
707 return error_mark_node
;
711 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
714 /* Return the merged type of two types.
715 We assume that comptypes has already been done and returned 1;
716 if that isn't so, this may crash.
718 This just combines attributes and default arguments; any other
719 differences would cause the two types to compare unalike. */
722 merge_types (tree t1
, tree t2
)
724 enum tree_code code1
;
725 enum tree_code code2
;
728 /* Save time if the two types are the same. */
731 if (original_type (t1
) == original_type (t2
))
734 /* If one type is nonsense, use the other. */
735 if (t1
== error_mark_node
)
737 if (t2
== error_mark_node
)
740 /* Merge the attributes. */
741 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
743 if (TYPE_PTRMEMFUNC_P (t1
))
744 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
745 if (TYPE_PTRMEMFUNC_P (t2
))
746 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
748 code1
= TREE_CODE (t1
);
749 code2
= TREE_CODE (t2
);
752 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
753 if (code1
== TYPENAME_TYPE
)
755 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
756 code1
= TREE_CODE (t1
);
760 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
761 code2
= TREE_CODE (t2
);
769 /* For two pointers, do this recursively on the target type. */
771 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
772 int quals
= cp_type_quals (t1
);
774 if (code1
== POINTER_TYPE
)
775 t1
= build_pointer_type (target
);
777 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
778 t1
= build_type_attribute_variant (t1
, attributes
);
779 t1
= cp_build_qualified_type (t1
, quals
);
781 if (TREE_CODE (target
) == METHOD_TYPE
)
782 t1
= build_ptrmemfunc_type (t1
);
791 quals
= cp_type_quals (t1
);
792 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
793 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
794 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
796 t1
= cp_build_qualified_type (t1
, quals
);
802 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
803 /* Save space: see if the result is identical to one of the args. */
804 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
805 return build_type_attribute_variant (t1
, attributes
);
806 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
807 return build_type_attribute_variant (t2
, attributes
);
808 /* Merge the element types, and have a size if either arg has one. */
809 t1
= build_cplus_array_type
810 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
815 /* Function types: prefer the one that specified arg types.
816 If both do, merge the arg types. Also merge the return types. */
818 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
819 tree p1
= TYPE_ARG_TYPES (t1
);
820 tree p2
= TYPE_ARG_TYPES (t2
);
824 /* Save space: see if the result is identical to one of the args. */
825 if (valtype
== TREE_TYPE (t1
) && ! p2
)
826 return cp_build_type_attribute_variant (t1
, attributes
);
827 if (valtype
== TREE_TYPE (t2
) && ! p1
)
828 return cp_build_type_attribute_variant (t2
, attributes
);
830 /* Simple way if one arg fails to specify argument types. */
831 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
834 raises
= TYPE_RAISES_EXCEPTIONS (t2
);
836 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
839 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
843 parms
= commonparms (p1
, p2
);
844 /* In cases where we're merging a real declaration with a
845 built-in declaration, t1 is the real one. */
846 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
849 rval
= build_function_type (valtype
, parms
);
850 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
851 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
852 t1
= build_exception_variant (rval
, raises
);
858 /* Get this value the long way, since TYPE_METHOD_BASETYPE
859 is just the main variant of this. */
860 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
861 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
864 /* If this was a member function type, get back to the
865 original type of type member function (i.e., without
866 the class instance variable up front. */
867 t1
= build_function_type (TREE_TYPE (t1
),
868 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
869 t2
= build_function_type (TREE_TYPE (t2
),
870 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
871 t3
= merge_types (t1
, t2
);
872 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
873 TYPE_ARG_TYPES (t3
));
874 t1
= build_exception_variant (t3
, raises
);
879 /* There is no need to merge attributes into a TYPENAME_TYPE.
880 When the type is instantiated it will have whatever
881 attributes result from the instantiation. */
887 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
889 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
892 return cp_build_type_attribute_variant (t1
, attributes
);
895 /* Return the ARRAY_TYPE type without its domain. */
898 strip_array_domain (tree type
)
901 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
902 if (TYPE_DOMAIN (type
) == NULL_TREE
)
904 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
905 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
908 /* Wrapper around cp_common_type that is used by c-common.c and other
909 front end optimizations that remove promotions.
911 Return the common type for two arithmetic types T1 and T2 under the
912 usual arithmetic conversions. The default conversions have already
913 been applied, and enumerated types converted to their compatible
917 common_type (tree t1
, tree t2
)
919 /* If one type is nonsense, use the other */
920 if (t1
== error_mark_node
)
922 if (t2
== error_mark_node
)
925 return cp_common_type (t1
, t2
);
928 /* Return the common type of two pointer types T1 and T2. This is the
929 type for the result of most arithmetic operations if the operands
930 have the given two types.
932 We assume that comp_target_types has already been done and returned
933 nonzero; if that isn't so, this may crash. */
936 common_pointer_type (tree t1
, tree t2
)
938 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
939 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
940 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
942 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
943 CPO_CONVERSION
, tf_warning_or_error
);
946 /* Compare two exception specifier types for exactness or subsetness, if
947 allowed. Returns false for mismatch, true for match (same, or
950 [except.spec] "If a class X ... objects of class X or any class publicly
951 and unambiguously derived from X. Similarly, if a pointer type Y * ...
952 exceptions of type Y * or that are pointers to any type publicly and
953 unambiguously derived from Y. Otherwise a function only allows exceptions
954 that have the same type ..."
955 This does not mention cv qualifiers and is different to what throw
956 [except.throw] and catch [except.catch] will do. They will ignore the
957 top level cv qualifiers, and allow qualifiers in the pointer to class
960 We implement the letter of the standard. */
963 comp_except_types (tree a
, tree b
, bool exact
)
965 if (same_type_p (a
, b
))
969 if (cp_type_quals (a
) || cp_type_quals (b
))
972 if (TREE_CODE (a
) == POINTER_TYPE
973 && TREE_CODE (b
) == POINTER_TYPE
)
977 if (cp_type_quals (a
) || cp_type_quals (b
))
981 if (TREE_CODE (a
) != RECORD_TYPE
982 || TREE_CODE (b
) != RECORD_TYPE
)
985 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
991 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
992 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
993 otherwise it must be exact. Exception lists are unordered, but
994 we've already filtered out duplicates. Most lists will be in order,
995 we should try to make use of that. */
998 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
1007 if (t1
== NULL_TREE
) /* T1 is ... */
1008 return t2
== NULL_TREE
|| !exact
;
1009 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1010 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1011 if (t2
== NULL_TREE
) /* T2 is ... */
1013 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1016 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1017 Count how many we find, to determine exactness. For exact matching and
1018 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1020 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1022 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1024 tree a
= TREE_VALUE (probe
);
1025 tree b
= TREE_VALUE (t2
);
1027 if (comp_except_types (a
, b
, exact
))
1029 if (probe
== base
&& exact
)
1030 base
= TREE_CHAIN (probe
);
1035 if (probe
== NULL_TREE
)
1038 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1041 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1042 [] can match [size]. */
1045 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1054 /* The type of the array elements must be the same. */
1055 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1058 d1
= TYPE_DOMAIN (t1
);
1059 d2
= TYPE_DOMAIN (t2
);
1064 /* If one of the arrays is dimensionless, and the other has a
1065 dimension, they are of different types. However, it is valid to
1073 declarations for an array object can specify
1074 array types that differ by the presence or absence of a major
1075 array bound (_dcl.array_). */
1077 return allow_redeclaration
;
1079 /* Check that the dimensions are the same. */
1081 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1083 max1
= TYPE_MAX_VALUE (d1
);
1084 max2
= TYPE_MAX_VALUE (d2
);
1085 if (processing_template_decl
&& !abi_version_at_least (2)
1086 && !value_dependent_expression_p (max1
)
1087 && !value_dependent_expression_p (max2
))
1089 /* With abi-1 we do not fold non-dependent array bounds, (and
1090 consequently mangle them incorrectly). We must therefore
1091 fold them here, to verify the domains have the same
1097 if (!cp_tree_equal (max1
, max2
))
1103 /* Compare the relative position of T1 and T2 into their respective
1104 template parameter list.
1105 T1 and T2 must be template parameter types.
1106 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1109 comp_template_parms_position (tree t1
, tree t2
)
1111 gcc_assert (t1
&& t2
1112 && TREE_CODE (t1
) == TREE_CODE (t2
)
1113 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1114 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1115 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1117 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1118 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1119 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1120 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1126 /* Subroutine of incompatible_dependent_types_p.
1127 Return the template parameter of the dependent type T.
1128 If T is a typedef, return the template parameters of
1129 the _decl_ of the typedef. T must be a dependent type. */
1132 get_template_parms_of_dependent_type (tree t
)
1134 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1136 /* First, try the obvious case of getting the
1137 template info from T itself. */
1138 if ((tinfo
= get_template_info (t
)))
1140 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1141 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1142 else if (typedef_variant_p (t
)
1143 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1144 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1145 /* If T is a TYPENAME_TYPE which context is a template type
1146 parameter, get the template parameters from that context. */
1147 else if (TYPE_CONTEXT (t
)
1148 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1149 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1150 else if (TYPE_CONTEXT (t
)
1151 && !NAMESPACE_SCOPE_P (t
))
1152 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1155 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1160 /* Subroutine of structural_comptypes.
1161 Compare the dependent types T1 and T2.
1162 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1163 The whole point of this function is to support cases where either T1 or
1164 T2 is a typedef. In those cases, we need to compare the template parameters
1165 of the _decl_ of the typedef. If those don't match then we know T1
1166 and T2 cannot be equal. */
1169 incompatible_dependent_types_p (tree t1
, tree t2
)
1171 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1172 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1174 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1177 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1179 /* If T1 and T2 don't have the same relative position in their
1180 template parameters set, they can't be equal. */
1181 if (!comp_template_parms_position (t1
, t2
))
1185 t1_typedef_variant_p
= typedef_variant_p (t1
);
1186 t2_typedef_variant_p
= typedef_variant_p (t2
);
1188 /* Either T1 or T2 must be a typedef. */
1189 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1192 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1193 /* Either T1 or T2 is not a typedef so we cannot compare the
1194 the template parms of the typedefs of T1 and T2.
1195 At this point, if the main variant type of T1 and T2 are equal
1196 it means the two types can't be incompatible, from the perspective
1197 of this function. */
1198 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1201 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1202 Let's compare their template parameters. */
1204 tparms1
= get_template_parms_of_dependent_type (t1
);
1205 tparms2
= get_template_parms_of_dependent_type (t2
);
1207 /* If T2 is a template type parm and if we could not get the template
1208 parms it belongs to, that means we have not finished parsing the
1209 full set of template parameters of the template declaration it
1210 belongs to yet. If we could get the template parms T1 belongs to,
1211 that mostly means T1 and T2 belongs to templates that are
1212 different and incompatible. */
1213 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1214 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1215 && tparms1
!= tparms2
)
1218 if (tparms1
== NULL_TREE
1219 || tparms2
== NULL_TREE
1220 || tparms1
== tparms2
)
1223 /* And now compare the mighty template parms! */
1224 return !comp_template_parms (tparms1
, tparms2
);
1227 /* Subroutine in comptypes. */
1230 structural_comptypes (tree t1
, tree t2
, int strict
)
1235 /* Suppress errors caused by previously reported errors. */
1236 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1239 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1241 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1242 current instantiation. */
1243 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1244 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1246 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1247 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1249 if (TYPE_PTRMEMFUNC_P (t1
))
1250 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1251 if (TYPE_PTRMEMFUNC_P (t2
))
1252 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1254 /* Different classes of types can't be compatible. */
1255 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1258 /* Qualifiers must match. For array types, we will check when we
1259 recur on the array element types. */
1260 if (TREE_CODE (t1
) != ARRAY_TYPE
1261 && cp_type_quals (t1
) != cp_type_quals (t2
))
1263 if (TREE_CODE (t1
) == FUNCTION_TYPE
1264 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1266 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1269 /* If T1 and T2 are dependent typedefs then check upfront that
1270 the template parameters of their typedef DECLs match before
1271 going down checking their subtypes. */
1272 if (incompatible_dependent_types_p (t1
, t2
))
1275 /* Allow for two different type nodes which have essentially the same
1276 definition. Note that we already checked for equality of the type
1277 qualifiers (just above). */
1279 if (TREE_CODE (t1
) != ARRAY_TYPE
1280 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1284 /* Compare the types. Break out if they could be the same. */
1285 switch (TREE_CODE (t1
))
1289 /* All void and bool types are the same. */
1293 case FIXED_POINT_TYPE
:
1295 /* With these nodes, we can't determine type equivalence by
1296 looking at what is stored in the nodes themselves, because
1297 two nodes might have different TYPE_MAIN_VARIANTs but still
1298 represent the same type. For example, wchar_t and int could
1299 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1300 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1301 and are distinct types. On the other hand, int and the
1304 typedef int INT __attribute((may_alias));
1306 have identical properties, different TYPE_MAIN_VARIANTs, but
1307 represent the same type. The canonical type system keeps
1308 track of equivalence in this case, so we fall back on it. */
1309 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1311 case TEMPLATE_TEMPLATE_PARM
:
1312 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1313 if (!comp_template_parms_position (t1
, t2
))
1315 if (!comp_template_parms
1316 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1317 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1319 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1321 /* Don't check inheritance. */
1322 strict
= COMPARE_STRICT
;
1327 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1328 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1329 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1330 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1333 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1335 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1341 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1342 strict
& ~COMPARE_REDECLARATION
))
1344 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1348 case REFERENCE_TYPE
:
1349 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1351 /* fall through to checks for pointer types */
1354 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1355 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1356 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1362 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1364 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1369 /* Target types must match incl. qualifiers. */
1370 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1374 case TEMPLATE_TYPE_PARM
:
1375 /* If incompatible_dependent_types_p called earlier didn't decide
1376 T1 and T2 were different, they might be equal. */
1380 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1381 TYPENAME_TYPE_FULLNAME (t2
)))
1383 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1387 case UNBOUND_CLASS_TEMPLATE
:
1388 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1390 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1395 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1400 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1401 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1405 case TYPE_PACK_EXPANSION
:
1406 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1407 PACK_EXPANSION_PATTERN (t2
));
1410 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1411 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1412 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1413 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1414 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1415 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1416 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1417 DECLTYPE_TYPE_EXPR (t2
)))
1425 /* If we get here, we know that from a target independent POV the
1426 types are the same. Make sure the target attributes are also
1428 return targetm
.comp_type_attributes (t1
, t2
);
1431 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1432 is a bitwise-or of the COMPARE_* flags. */
1435 comptypes (tree t1
, tree t2
, int strict
)
1437 if (strict
== COMPARE_STRICT
)
1442 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1445 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1446 /* At least one of the types requires structural equality, so
1447 perform a deep check. */
1448 return structural_comptypes (t1
, t2
, strict
);
1450 #ifdef ENABLE_CHECKING
1451 if (USE_CANONICAL_TYPES
)
1453 bool result
= structural_comptypes (t1
, t2
, strict
);
1455 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1456 /* The two types are structurally equivalent, but their
1457 canonical types were different. This is a failure of the
1458 canonical type propagation code.*/
1460 ("canonical types differ for identical types %T and %T",
1462 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1463 /* Two types are structurally different, but the canonical
1464 types are the same. This means we were over-eager in
1465 assigning canonical types. */
1467 ("same canonical type node for different types %T and %T",
1473 if (USE_CANONICAL_TYPES
)
1474 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1477 return structural_comptypes (t1
, t2
, strict
);
1479 else if (strict
== COMPARE_STRUCTURAL
)
1480 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1482 return structural_comptypes (t1
, t2
, strict
);
1485 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1488 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1490 int q1
= cp_type_quals (type1
);
1491 int q2
= cp_type_quals (type2
);
1493 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1494 return (q1
& q2
) == q2
;
1497 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1498 more cv-qualified that TYPE1, and 0 otherwise. */
1501 comp_cv_qualification (const_tree type1
, const_tree type2
)
1503 int q1
= cp_type_quals (type1
);
1504 int q2
= cp_type_quals (type2
);
1509 if ((q1
& q2
) == q2
)
1511 else if ((q1
& q2
) == q1
)
1517 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1518 subset of the cv-qualification signature of TYPE2, and the types
1519 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1522 comp_cv_qual_signature (tree type1
, tree type2
)
1524 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1526 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1532 /* Subroutines of `comptypes'. */
1534 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1535 equivalent in the sense that functions with those parameter types
1536 can have equivalent types. The two lists must be equivalent,
1537 element by element. */
1540 compparms (const_tree parms1
, const_tree parms2
)
1544 /* An unspecified parmlist matches any specified parmlist
1545 whose argument types don't need default promotions. */
1547 for (t1
= parms1
, t2
= parms2
;
1549 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1551 /* If one parmlist is shorter than the other,
1552 they fail to match. */
1555 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1562 /* Process a sizeof or alignof expression where the operand is a
1566 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1571 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1572 if (type
== error_mark_node
)
1573 return error_mark_node
;
1575 type
= non_reference (type
);
1576 if (TREE_CODE (type
) == METHOD_TYPE
)
1579 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1580 "invalid application of %qs to a member function",
1581 operator_name_info
[(int) op
].name
);
1582 value
= size_one_node
;
1585 dependent_p
= dependent_type_p (type
);
1587 complete_type (type
);
1589 /* VLA types will have a non-constant size. In the body of an
1590 uninstantiated template, we don't need to try to compute the
1591 value, because the sizeof expression is not an integral
1592 constant expression in that case. And, if we do try to
1593 compute the value, we'll likely end up with SAVE_EXPRs, which
1594 the template substitution machinery does not expect to see. */
1595 || (processing_template_decl
1596 && COMPLETE_TYPE_P (type
)
1597 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1599 value
= build_min (op
, size_type_node
, type
);
1600 TREE_READONLY (value
) = 1;
1604 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1609 /* Return the size of the type, without producing any warnings for
1610 types whose size cannot be taken. This routine should be used only
1611 in some other routine that has already produced a diagnostic about
1612 using the size of such a type. */
1614 cxx_sizeof_nowarn (tree type
)
1616 if (TREE_CODE (type
) == FUNCTION_TYPE
1617 || TREE_CODE (type
) == VOID_TYPE
1618 || TREE_CODE (type
) == ERROR_MARK
)
1619 return size_one_node
;
1620 else if (!COMPLETE_TYPE_P (type
))
1621 return size_zero_node
;
1623 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1626 /* Process a sizeof expression where the operand is an expression. */
1629 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1631 if (e
== error_mark_node
)
1632 return error_mark_node
;
1634 if (processing_template_decl
)
1636 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1637 TREE_SIDE_EFFECTS (e
) = 0;
1638 TREE_READONLY (e
) = 1;
1643 /* To get the size of a static data member declared as an array of
1644 unknown bound, we need to instantiate it. */
1645 if (TREE_CODE (e
) == VAR_DECL
1646 && VAR_HAD_UNKNOWN_BOUND (e
)
1647 && DECL_TEMPLATE_INSTANTIATION (e
))
1648 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1650 e
= mark_type_use (e
);
1652 if (TREE_CODE (e
) == COMPONENT_REF
1653 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1654 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1656 if (complain
& tf_error
)
1657 error ("invalid application of %<sizeof%> to a bit-field");
1659 return error_mark_node
;
1662 else if (is_overloaded_fn (e
))
1664 if (complain
& tf_error
)
1665 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1668 return error_mark_node
;
1671 else if (type_unknown_p (e
))
1673 if (complain
& tf_error
)
1674 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1676 return error_mark_node
;
1682 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1685 /* Implement the __alignof keyword: Return the minimum required
1686 alignment of E, measured in bytes. For VAR_DECL's and
1687 FIELD_DECL's return DECL_ALIGN (which can be set from an
1688 "aligned" __attribute__ specification). */
1691 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1695 if (e
== error_mark_node
)
1696 return error_mark_node
;
1698 if (processing_template_decl
)
1700 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1701 TREE_SIDE_EFFECTS (e
) = 0;
1702 TREE_READONLY (e
) = 1;
1707 e
= mark_type_use (e
);
1709 if (TREE_CODE (e
) == VAR_DECL
)
1710 t
= size_int (DECL_ALIGN_UNIT (e
));
1711 else if (TREE_CODE (e
) == COMPONENT_REF
1712 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1713 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1715 if (complain
& tf_error
)
1716 error ("invalid application of %<__alignof%> to a bit-field");
1718 return error_mark_node
;
1721 else if (TREE_CODE (e
) == COMPONENT_REF
1722 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1723 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1724 else if (is_overloaded_fn (e
))
1726 if (complain
& tf_error
)
1727 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1730 return error_mark_node
;
1731 if (TREE_CODE (e
) == FUNCTION_DECL
)
1732 t
= size_int (DECL_ALIGN_UNIT (e
));
1736 else if (type_unknown_p (e
))
1738 if (complain
& tf_error
)
1739 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1741 return error_mark_node
;
1745 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1746 complain
& tf_error
);
1748 return fold_convert (size_type_node
, t
);
1751 /* Process a sizeof or alignof expression E with code OP where the operand
1752 is an expression. */
1755 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1757 if (op
== SIZEOF_EXPR
)
1758 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1760 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1763 /* EXPR is being used in a context that is not a function call.
1768 The expression can be used only as the left-hand operand of a
1769 member function call.
1771 [expr.mptr.operator]
1773 If the result of .* or ->* is a function, then that result can be
1774 used only as the operand for the function call operator ().
1776 by issuing an error message if appropriate. Returns true iff EXPR
1777 violates these rules. */
1780 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1782 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1784 if (complain
& tf_error
)
1785 error ("invalid use of non-static member function");
1791 /* If EXP is a reference to a bitfield, and the type of EXP does not
1792 match the declared type of the bitfield, return the declared type
1793 of the bitfield. Otherwise, return NULL_TREE. */
1796 is_bitfield_expr_with_lowered_type (const_tree exp
)
1798 switch (TREE_CODE (exp
))
1801 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1802 ? TREE_OPERAND (exp
, 1)
1803 : TREE_OPERAND (exp
, 0)))
1805 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1808 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1812 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1818 field
= TREE_OPERAND (exp
, 1);
1819 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1821 if (same_type_ignoring_top_level_qualifiers_p
1822 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1824 return DECL_BIT_FIELD_TYPE (field
);
1828 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1829 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1830 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1838 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1839 bitfield with a lowered type, the type of EXP is returned, rather
1843 unlowered_expr_type (const_tree exp
)
1847 type
= is_bitfield_expr_with_lowered_type (exp
);
1849 type
= TREE_TYPE (exp
);
1854 /* Perform the conversions in [expr] that apply when an lvalue appears
1855 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1856 function-to-pointer conversions. In addition, manifest constants
1857 are replaced by their values, and bitfield references are converted
1858 to their declared types. Note that this function does not perform the
1859 lvalue-to-rvalue conversion for class types. If you need that conversion
1860 to for class types, then you probably need to use force_rvalue.
1862 Although the returned value is being used as an rvalue, this
1863 function does not wrap the returned expression in a
1864 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1865 that the return value is no longer an lvalue. */
1868 decay_conversion (tree exp
)
1871 enum tree_code code
;
1873 type
= TREE_TYPE (exp
);
1874 if (type
== error_mark_node
)
1875 return error_mark_node
;
1877 exp
= mark_rvalue_use (exp
);
1879 exp
= resolve_nondeduced_context (exp
);
1880 if (type_unknown_p (exp
))
1882 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1883 return error_mark_node
;
1886 exp
= decl_constant_value (exp
);
1887 if (error_operand_p (exp
))
1888 return error_mark_node
;
1890 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1891 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1892 code
= TREE_CODE (type
);
1893 if (code
== VOID_TYPE
)
1895 error ("void value not ignored as it ought to be");
1896 return error_mark_node
;
1898 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1899 return error_mark_node
;
1900 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1901 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1902 if (code
== ARRAY_TYPE
)
1907 if (TREE_CODE (exp
) == INDIRECT_REF
)
1908 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1909 TREE_OPERAND (exp
, 0));
1911 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1913 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1914 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1915 TREE_OPERAND (exp
, 0), op1
);
1919 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1921 error ("invalid use of non-lvalue array");
1922 return error_mark_node
;
1925 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1927 if (TREE_CODE (exp
) == VAR_DECL
)
1929 if (!cxx_mark_addressable (exp
))
1930 return error_mark_node
;
1931 adr
= build_nop (ptrtype
, build_address (exp
));
1934 /* This way is better for a COMPONENT_REF since it can
1935 simplify the offset for a component. */
1936 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1937 return cp_convert (ptrtype
, adr
);
1940 /* If a bitfield is used in a context where integral promotion
1941 applies, then the caller is expected to have used
1942 default_conversion. That function promotes bitfields correctly
1943 before calling this function. At this point, if we have a
1944 bitfield referenced, we may assume that is not subject to
1945 promotion, and that, therefore, the type of the resulting rvalue
1946 is the declared type of the bitfield. */
1947 exp
= convert_bitfield_to_declared_type (exp
);
1949 /* We do not call rvalue() here because we do not want to wrap EXP
1950 in a NON_LVALUE_EXPR. */
1954 Non-class rvalues always have cv-unqualified types. */
1955 type
= TREE_TYPE (exp
);
1956 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1957 exp
= build_nop (cv_unqualified (type
), exp
);
1962 /* Perform preparatory conversions, as part of the "usual arithmetic
1963 conversions". In particular, as per [expr]:
1965 Whenever an lvalue expression appears as an operand of an
1966 operator that expects the rvalue for that operand, the
1967 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1968 standard conversions are applied to convert the expression to an
1971 In addition, we perform integral promotions here, as those are
1972 applied to both operands to a binary operator before determining
1973 what additional conversions should apply. */
1976 default_conversion (tree exp
)
1978 /* Check for target-specific promotions. */
1979 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1981 exp
= cp_convert (promoted_type
, exp
);
1982 /* Perform the integral promotions first so that bitfield
1983 expressions (which may promote to "int", even if the bitfield is
1984 declared "unsigned") are promoted correctly. */
1985 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1986 exp
= perform_integral_promotions (exp
);
1987 /* Perform the other conversions. */
1988 exp
= decay_conversion (exp
);
1993 /* EXPR is an expression with an integral or enumeration type.
1994 Perform the integral promotions in [conv.prom], and return the
1998 perform_integral_promotions (tree expr
)
2003 expr
= mark_rvalue_use (expr
);
2007 If the bitfield has an enumerated type, it is treated as any
2008 other value of that type for promotion purposes. */
2009 type
= is_bitfield_expr_with_lowered_type (expr
);
2010 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2011 type
= TREE_TYPE (expr
);
2012 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2013 promoted_type
= type_promotes_to (type
);
2014 if (type
!= promoted_type
)
2015 expr
= cp_convert (promoted_type
, expr
);
2019 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2020 decay_conversion to one. */
2023 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2027 if (TREE_CODE (totype
) != POINTER_TYPE
)
2030 t
= TREE_TYPE (totype
);
2031 if (!same_type_p (t
, char_type_node
)
2032 && !same_type_p (t
, char16_type_node
)
2033 && !same_type_p (t
, char32_type_node
)
2034 && !same_type_p (t
, wchar_type_node
))
2037 if (TREE_CODE (exp
) == STRING_CST
)
2039 /* Make sure that we don't try to convert between char and wide chars. */
2040 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2045 /* Is this a string constant which has decayed to 'const char *'? */
2046 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2047 if (!same_type_p (TREE_TYPE (exp
), t
))
2050 if (TREE_CODE (exp
) != ADDR_EXPR
2051 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2055 /* This warning is not very useful, as it complains about printf. */
2057 warning (OPT_Wwrite_strings
,
2058 "deprecated conversion from string constant to %qT",
2064 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2065 can, for example, use as an lvalue. This code used to be in
2066 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2067 expressions, where we're dealing with aggregates. But now it's again only
2068 called from unary_complex_lvalue. The case (in particular) that led to
2069 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2073 rationalize_conditional_expr (enum tree_code code
, tree t
,
2074 tsubst_flags_t complain
)
2076 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2077 the first operand is always the one to be used if both operands
2078 are equal, so we know what conditional expression this used to be. */
2079 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2081 tree op0
= TREE_OPERAND (t
, 0);
2082 tree op1
= TREE_OPERAND (t
, 1);
2084 /* The following code is incorrect if either operand side-effects. */
2085 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2086 && !TREE_SIDE_EFFECTS (op1
));
2088 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2089 ? LE_EXPR
: GE_EXPR
),
2090 op0
, TREE_CODE (op0
),
2091 op1
, TREE_CODE (op1
),
2092 /*overloaded_p=*/NULL
,
2094 cp_build_unary_op (code
, op0
, 0, complain
),
2095 cp_build_unary_op (code
, op1
, 0, complain
),
2100 build_conditional_expr (TREE_OPERAND (t
, 0),
2101 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2103 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2108 /* Given the TYPE of an anonymous union field inside T, return the
2109 FIELD_DECL for the field. If not found return NULL_TREE. Because
2110 anonymous unions can nest, we must also search all anonymous unions
2111 that are directly reachable. */
2114 lookup_anon_field (tree t
, tree type
)
2118 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2120 if (TREE_STATIC (field
))
2122 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2125 /* If we find it directly, return the field. */
2126 if (DECL_NAME (field
) == NULL_TREE
2127 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2132 /* Otherwise, it could be nested, search harder. */
2133 if (DECL_NAME (field
) == NULL_TREE
2134 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2136 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2144 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2145 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2146 non-NULL, it indicates the path to the base used to name MEMBER.
2147 If PRESERVE_REFERENCE is true, the expression returned will have
2148 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2149 returned will have the type referred to by the reference.
2151 This function does not perform access control; that is either done
2152 earlier by the parser when the name of MEMBER is resolved to MEMBER
2153 itself, or later when overload resolution selects one of the
2154 functions indicated by MEMBER. */
2157 build_class_member_access_expr (tree object
, tree member
,
2158 tree access_path
, bool preserve_reference
,
2159 tsubst_flags_t complain
)
2163 tree result
= NULL_TREE
;
2165 if (error_operand_p (object
) || error_operand_p (member
))
2166 return error_mark_node
;
2168 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2172 The type of the first expression shall be "class object" (of a
2174 object_type
= TREE_TYPE (object
);
2175 if (!currently_open_class (object_type
)
2176 && !complete_type_or_else (object_type
, object
))
2177 return error_mark_node
;
2178 if (!CLASS_TYPE_P (object_type
))
2180 if (complain
& tf_error
)
2181 error ("request for member %qD in %qE, which is of non-class type %qT",
2182 member
, object
, object_type
);
2183 return error_mark_node
;
2186 /* The standard does not seem to actually say that MEMBER must be a
2187 member of OBJECT_TYPE. However, that is clearly what is
2189 if (DECL_P (member
))
2191 member_scope
= DECL_CLASS_CONTEXT (member
);
2193 if (TREE_DEPRECATED (member
))
2194 warn_deprecated_use (member
, NULL_TREE
);
2197 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2198 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2199 presently be the anonymous union. Go outwards until we find a
2200 type related to OBJECT_TYPE. */
2201 while (ANON_AGGR_TYPE_P (member_scope
)
2202 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2204 member_scope
= TYPE_CONTEXT (member_scope
);
2205 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2207 if (complain
& tf_error
)
2209 if (TREE_CODE (member
) == FIELD_DECL
)
2210 error ("invalid use of nonstatic data member %qE", member
);
2212 error ("%qD is not a member of %qT", member
, object_type
);
2214 return error_mark_node
;
2217 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2218 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2219 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2221 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2223 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2226 /* In [expr.ref], there is an explicit list of the valid choices for
2227 MEMBER. We check for each of those cases here. */
2228 if (TREE_CODE (member
) == VAR_DECL
)
2230 /* A static data member. */
2232 /* If OBJECT has side-effects, they are supposed to occur. */
2233 if (TREE_SIDE_EFFECTS (object
))
2234 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2236 else if (TREE_CODE (member
) == FIELD_DECL
)
2238 /* A non-static data member. */
2243 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2244 && integer_zerop (TREE_OPERAND (object
, 0)));
2246 /* Convert OBJECT to the type of MEMBER. */
2247 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2248 TYPE_MAIN_VARIANT (member_scope
)))
2253 binfo
= lookup_base (access_path
? access_path
: object_type
,
2254 member_scope
, ba_unique
, &kind
);
2255 if (binfo
== error_mark_node
)
2256 return error_mark_node
;
2258 /* It is invalid to try to get to a virtual base of a
2259 NULL object. The most common cause is invalid use of
2261 if (null_object_p
&& kind
== bk_via_virtual
)
2263 if (complain
& tf_error
)
2265 error ("invalid access to non-static data member %qD of "
2268 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2270 return error_mark_node
;
2273 /* Convert to the base. */
2274 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2276 /* If we found the base successfully then we should be able
2277 to convert to it successfully. */
2278 gcc_assert (object
!= error_mark_node
);
2281 /* Complain about other invalid uses of offsetof, even though they will
2282 give the right answer. Note that we complain whether or not they
2283 actually used the offsetof macro, since there's no way to know at this
2284 point. So we just give a warning, instead of a pedwarn. */
2285 /* Do not produce this warning for base class field references, because
2286 we know for a fact that didn't come from offsetof. This does occur
2287 in various testsuite cases where a null object is passed where a
2288 vtable access is required. */
2289 if (null_object_p
&& warn_invalid_offsetof
2290 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2291 && !DECL_FIELD_IS_BASE (member
)
2292 && cp_unevaluated_operand
== 0
2293 && (complain
& tf_warning
))
2295 warning (OPT_Winvalid_offsetof
,
2296 "invalid access to non-static data member %qD "
2297 " of NULL object", member
);
2298 warning (OPT_Winvalid_offsetof
,
2299 "(perhaps the %<offsetof%> macro was used incorrectly)");
2302 /* If MEMBER is from an anonymous aggregate, we have converted
2303 OBJECT so that it refers to the class containing the
2304 anonymous union. Generate a reference to the anonymous union
2305 itself, and recur to find MEMBER. */
2306 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2307 /* When this code is called from build_field_call, the
2308 object already has the type of the anonymous union.
2309 That is because the COMPONENT_REF was already
2310 constructed, and was then disassembled before calling
2311 build_field_call. After the function-call code is
2312 cleaned up, this waste can be eliminated. */
2313 && (!same_type_ignoring_top_level_qualifiers_p
2314 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2316 tree anonymous_union
;
2318 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2319 DECL_CONTEXT (member
));
2320 object
= build_class_member_access_expr (object
,
2322 /*access_path=*/NULL_TREE
,
2327 /* Compute the type of the field, as described in [expr.ref]. */
2328 type_quals
= TYPE_UNQUALIFIED
;
2329 member_type
= TREE_TYPE (member
);
2330 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2332 type_quals
= (cp_type_quals (member_type
)
2333 | cp_type_quals (object_type
));
2335 /* A field is const (volatile) if the enclosing object, or the
2336 field itself, is const (volatile). But, a mutable field is
2337 not const, even within a const object. */
2338 if (DECL_MUTABLE_P (member
))
2339 type_quals
&= ~TYPE_QUAL_CONST
;
2340 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2343 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2345 result
= fold_if_not_in_template (result
);
2347 /* Mark the expression const or volatile, as appropriate. Even
2348 though we've dealt with the type above, we still have to mark the
2349 expression itself. */
2350 if (type_quals
& TYPE_QUAL_CONST
)
2351 TREE_READONLY (result
) = 1;
2352 if (type_quals
& TYPE_QUAL_VOLATILE
)
2353 TREE_THIS_VOLATILE (result
) = 1;
2355 else if (BASELINK_P (member
))
2357 /* The member is a (possibly overloaded) member function. */
2361 /* If the MEMBER is exactly one static member function, then we
2362 know the type of the expression. Otherwise, we must wait
2363 until overload resolution has been performed. */
2364 functions
= BASELINK_FUNCTIONS (member
);
2365 if (TREE_CODE (functions
) == FUNCTION_DECL
2366 && DECL_STATIC_FUNCTION_P (functions
))
2367 type
= TREE_TYPE (functions
);
2369 type
= unknown_type_node
;
2370 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2371 base. That will happen when the function is called. */
2372 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2374 else if (TREE_CODE (member
) == CONST_DECL
)
2376 /* The member is an enumerator. */
2378 /* If OBJECT has side-effects, they are supposed to occur. */
2379 if (TREE_SIDE_EFFECTS (object
))
2380 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2385 if (complain
& tf_error
)
2386 error ("invalid use of %qD", member
);
2387 return error_mark_node
;
2390 if (!preserve_reference
)
2393 If E2 is declared to have type "reference to T", then ... the
2394 type of E1.E2 is T. */
2395 result
= convert_from_reference (result
);
2400 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2401 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2404 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2406 tree object_type
= TREE_TYPE (object
);
2407 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2410 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2412 error ("qualified type %qT does not match destructor name ~%qT",
2414 return error_mark_node
;
2416 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2418 /* In a template, names we can't find a match for are still accepted
2419 destructor names, and we check them here. */
2420 if (check_dtor_name (object_type
, dtor_type
))
2421 dtor_type
= object_type
;
2424 error ("object type %qT does not match destructor name ~%qT",
2425 object_type
, dtor_type
);
2426 return error_mark_node
;
2430 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2432 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2433 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2434 return error_mark_node
;
2436 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2437 /*protect=*/1, /*want_type=*/false);
2438 expr
= (adjust_result_of_qualified_name_lookup
2439 (expr
, dtor_type
, object_type
));
2443 /* An expression of the form "A::template B" has been resolved to
2444 DECL. Issue a diagnostic if B is not a template or template
2448 check_template_keyword (tree decl
)
2450 /* The standard says:
2454 If a name prefixed by the keyword template is not a member
2455 template, the program is ill-formed.
2457 DR 228 removed the restriction that the template be a member
2460 DR 96, if accepted would add the further restriction that explicit
2461 template arguments must be provided if the template keyword is
2462 used, but, as of 2005-10-16, that DR is still in "drafting". If
2463 this DR is accepted, then the semantic checks here can be
2464 simplified, as the entity named must in fact be a template
2465 specialization, rather than, as at present, a set of overloaded
2466 functions containing at least one template function. */
2467 if (TREE_CODE (decl
) != TEMPLATE_DECL
2468 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2470 if (!is_overloaded_fn (decl
))
2471 permerror (input_location
, "%qD is not a template", decl
);
2476 if (BASELINK_P (fns
))
2477 fns
= BASELINK_FUNCTIONS (fns
);
2480 tree fn
= OVL_CURRENT (fns
);
2481 if (TREE_CODE (fn
) == TEMPLATE_DECL
2482 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2484 if (TREE_CODE (fn
) == FUNCTION_DECL
2485 && DECL_USE_TEMPLATE (fn
)
2486 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2488 fns
= OVL_NEXT (fns
);
2491 permerror (input_location
, "%qD is not a template", decl
);
2496 /* This function is called by the parser to process a class member
2497 access expression of the form OBJECT.NAME. NAME is a node used by
2498 the parser to represent a name; it is not yet a DECL. It may,
2499 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2500 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2501 there is no reason to do the lookup twice, so the parser keeps the
2502 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2503 be a template via the use of the "A::template B" syntax. */
2506 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2507 tsubst_flags_t complain
)
2512 tree access_path
= NULL_TREE
;
2513 tree orig_object
= object
;
2514 tree orig_name
= name
;
2516 if (object
== error_mark_node
|| name
== error_mark_node
)
2517 return error_mark_node
;
2519 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2520 if (!objc_is_public (object
, name
))
2521 return error_mark_node
;
2523 object_type
= TREE_TYPE (object
);
2525 if (processing_template_decl
)
2527 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2528 dependent_type_p (object_type
)
2529 /* If NAME is just an IDENTIFIER_NODE, then the expression
2531 || TREE_CODE (object
) == IDENTIFIER_NODE
2532 /* If NAME is "f<args>", where either 'f' or 'args' is
2533 dependent, then the expression is dependent. */
2534 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2535 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2536 TREE_OPERAND (name
, 1)))
2537 /* If NAME is "T::X" where "T" is dependent, then the
2538 expression is dependent. */
2539 || (TREE_CODE (name
) == SCOPE_REF
2540 && TYPE_P (TREE_OPERAND (name
, 0))
2541 && dependent_type_p (TREE_OPERAND (name
, 0))))
2542 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2543 object
= build_non_dependent_expr (object
);
2548 The type of the first expression shall be "class object" (of a
2550 if (!currently_open_class (object_type
)
2551 && !complete_type_or_else (object_type
, object
))
2552 return error_mark_node
;
2553 if (!CLASS_TYPE_P (object_type
))
2555 if (complain
& tf_error
)
2556 error ("request for member %qD in %qE, which is of non-class type %qT",
2557 name
, object
, object_type
);
2558 return error_mark_node
;
2561 if (BASELINK_P (name
))
2562 /* A member function that has already been looked up. */
2566 bool is_template_id
= false;
2567 tree template_args
= NULL_TREE
;
2570 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2572 is_template_id
= true;
2573 template_args
= TREE_OPERAND (name
, 1);
2574 name
= TREE_OPERAND (name
, 0);
2576 if (TREE_CODE (name
) == OVERLOAD
)
2577 name
= DECL_NAME (get_first_fn (name
));
2578 else if (DECL_P (name
))
2579 name
= DECL_NAME (name
);
2582 if (TREE_CODE (name
) == SCOPE_REF
)
2584 /* A qualified name. The qualifying class or namespace `S'
2585 has already been looked up; it is either a TYPE or a
2587 scope
= TREE_OPERAND (name
, 0);
2588 name
= TREE_OPERAND (name
, 1);
2590 /* If SCOPE is a namespace, then the qualified name does not
2591 name a member of OBJECT_TYPE. */
2592 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2594 if (complain
& tf_error
)
2595 error ("%<%D::%D%> is not a member of %qT",
2596 scope
, name
, object_type
);
2597 return error_mark_node
;
2600 gcc_assert (CLASS_TYPE_P (scope
));
2601 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2602 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2604 if (constructor_name_p (name
, scope
))
2606 if (complain
& tf_error
)
2607 error ("cannot call constructor %<%T::%D%> directly",
2609 return error_mark_node
;
2612 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2613 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2614 if (access_path
== error_mark_node
)
2615 return error_mark_node
;
2618 if (complain
& tf_error
)
2619 error ("%qT is not a base of %qT", scope
, object_type
);
2620 return error_mark_node
;
2626 access_path
= object_type
;
2629 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2630 member
= lookup_destructor (object
, scope
, name
);
2633 /* Look up the member. */
2634 member
= lookup_member (access_path
, name
, /*protect=*/1,
2635 /*want_type=*/false);
2636 if (member
== NULL_TREE
)
2638 if (complain
& tf_error
)
2639 error ("%qD has no member named %qE", object_type
, name
);
2640 return error_mark_node
;
2642 if (member
== error_mark_node
)
2643 return error_mark_node
;
2648 tree templ
= member
;
2650 if (BASELINK_P (templ
))
2651 templ
= lookup_template_function (templ
, template_args
);
2654 if (complain
& tf_error
)
2655 error ("%qD is not a member template function", name
);
2656 return error_mark_node
;
2661 if (TREE_DEPRECATED (member
))
2662 warn_deprecated_use (member
, NULL_TREE
);
2665 check_template_keyword (member
);
2667 expr
= build_class_member_access_expr (object
, member
, access_path
,
2668 /*preserve_reference=*/false,
2670 if (processing_template_decl
&& expr
!= error_mark_node
)
2672 if (BASELINK_P (member
))
2674 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2675 BASELINK_QUALIFIED_P (member
) = 1;
2678 return build_min_non_dep (COMPONENT_REF
, expr
,
2679 orig_object
, orig_name
,
2686 /* Return an expression for the MEMBER_NAME field in the internal
2687 representation of PTRMEM, a pointer-to-member function. (Each
2688 pointer-to-member function type gets its own RECORD_TYPE so it is
2689 more convenient to access the fields by name than by FIELD_DECL.)
2690 This routine converts the NAME to a FIELD_DECL and then creates the
2691 node for the complete expression. */
2694 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2700 /* This code is a stripped down version of
2701 build_class_member_access_expr. It does not work to use that
2702 routine directly because it expects the object to be of class
2704 ptrmem_type
= TREE_TYPE (ptrmem
);
2705 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2706 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2707 /*want_type=*/false);
2708 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2709 cp_type_quals (ptrmem_type
));
2710 return fold_build3_loc (input_location
,
2711 COMPONENT_REF
, member_type
,
2712 ptrmem
, member
, NULL_TREE
);
2715 /* Given an expression PTR for a pointer, return an expression
2716 for the value pointed to.
2717 ERRORSTRING is the name of the operator to appear in error messages.
2719 This function may need to overload OPERATOR_FNNAME.
2720 Must also handle REFERENCE_TYPEs for C++. */
2723 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2724 tsubst_flags_t complain
)
2726 tree orig_expr
= expr
;
2729 if (processing_template_decl
)
2731 /* Retain the type if we know the operand is a pointer so that
2732 describable_type doesn't make auto deduction break. */
2733 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2734 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2735 if (type_dependent_expression_p (expr
))
2736 return build_min_nt (INDIRECT_REF
, expr
);
2737 expr
= build_non_dependent_expr (expr
);
2740 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2741 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2743 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2745 if (processing_template_decl
&& rval
!= error_mark_node
)
2746 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2751 /* Helper function called from c-common. */
2753 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2754 tree ptr
, ref_operator errorstring
)
2756 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2760 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2761 tsubst_flags_t complain
)
2765 if (ptr
== error_mark_node
)
2766 return error_mark_node
;
2768 if (ptr
== current_class_ptr
)
2769 return current_class_ref
;
2771 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2772 ? ptr
: decay_conversion (ptr
));
2773 type
= TREE_TYPE (pointer
);
2775 if (POINTER_TYPE_P (type
))
2779 If the type of the expression is "pointer to T," the type
2780 of the result is "T." */
2781 tree t
= TREE_TYPE (type
);
2783 if (CONVERT_EXPR_P (ptr
)
2784 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2786 /* If a warning is issued, mark it to avoid duplicates from
2787 the backend. This only needs to be done at
2788 warn_strict_aliasing > 2. */
2789 if (warn_strict_aliasing
> 2)
2790 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2791 type
, TREE_OPERAND (ptr
, 0)))
2792 TREE_NO_WARNING (ptr
) = 1;
2795 if (VOID_TYPE_P (t
))
2797 /* A pointer to incomplete type (other than cv void) can be
2798 dereferenced [expr.unary.op]/1 */
2799 if (complain
& tf_error
)
2800 error ("%qT is not a pointer-to-object type", type
);
2801 return error_mark_node
;
2803 else if (TREE_CODE (pointer
) == ADDR_EXPR
2804 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2805 /* The POINTER was something like `&x'. We simplify `*&x' to
2807 return TREE_OPERAND (pointer
, 0);
2810 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2812 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2813 so that we get the proper error message if the result is used
2814 to assign to. Also, &* is supposed to be a no-op. */
2815 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2816 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2817 TREE_SIDE_EFFECTS (ref
)
2818 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2822 else if (!(complain
& tf_error
))
2823 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2825 /* `pointer' won't be an error_mark_node if we were given a
2826 pointer to member, so it's cool to check for this here. */
2827 else if (TYPE_PTR_TO_MEMBER_P (type
))
2828 switch (errorstring
)
2830 case RO_ARRAY_INDEXING
:
2831 error ("invalid use of array indexing on pointer to member");
2834 error ("invalid use of unary %<*%> on pointer to member");
2836 case RO_IMPLICIT_CONVERSION
:
2837 error ("invalid use of implicit conversion on pointer to member");
2842 else if (pointer
!= error_mark_node
)
2843 switch (errorstring
)
2846 error ("invalid type argument");
2848 case RO_ARRAY_INDEXING
:
2849 error ("invalid type argument of array indexing");
2852 error ("invalid type argument of unary %<*%>");
2854 case RO_IMPLICIT_CONVERSION
:
2855 error ("invalid type argument of implicit conversion");
2860 return error_mark_node
;
2863 /* This handles expressions of the form "a[i]", which denotes
2866 This is logically equivalent in C to *(a+i), but we may do it differently.
2867 If A is a variable or a member, we generate a primitive ARRAY_REF.
2868 This avoids forcing the array out of registers, and can work on
2869 arrays that are not lvalues (for example, members of structures returned
2872 If INDEX is of some user-defined type, it must be converted to
2873 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2874 will inherit the type of the array, which will be some pointer type.
2876 LOC is the location to use in building the array reference. */
2879 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2880 tsubst_flags_t complain
)
2886 if (complain
& tf_error
)
2887 error_at (loc
, "subscript missing in array reference");
2888 return error_mark_node
;
2891 if (TREE_TYPE (array
) == error_mark_node
2892 || TREE_TYPE (idx
) == error_mark_node
)
2893 return error_mark_node
;
2895 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2897 switch (TREE_CODE (array
))
2901 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2903 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2904 TREE_OPERAND (array
, 0), value
);
2905 SET_EXPR_LOCATION (ret
, loc
);
2910 ret
= build_conditional_expr
2911 (TREE_OPERAND (array
, 0),
2912 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2914 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2916 tf_warning_or_error
);
2917 protected_set_expr_location (ret
, loc
);
2924 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2928 warn_array_subscript_with_type_char (idx
);
2930 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2932 if (complain
& tf_error
)
2933 error_at (loc
, "array subscript is not an integer");
2934 return error_mark_node
;
2937 /* Apply integral promotions *after* noticing character types.
2938 (It is unclear why we do these promotions -- the standard
2939 does not say that we should. In fact, the natural thing would
2940 seem to be to convert IDX to ptrdiff_t; we're performing
2941 pointer arithmetic.) */
2942 idx
= perform_integral_promotions (idx
);
2944 /* An array that is indexed by a non-constant
2945 cannot be stored in a register; we must be able to do
2946 address arithmetic on its address.
2947 Likewise an array of elements of variable size. */
2948 if (TREE_CODE (idx
) != INTEGER_CST
2949 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2950 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2953 if (!cxx_mark_addressable (array
))
2954 return error_mark_node
;
2957 /* An array that is indexed by a constant value which is not within
2958 the array bounds cannot be stored in a register either; because we
2959 would get a crash in store_bit_field/extract_bit_field when trying
2960 to access a non-existent part of the register. */
2961 if (TREE_CODE (idx
) == INTEGER_CST
2962 && TYPE_DOMAIN (TREE_TYPE (array
))
2963 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2965 if (!cxx_mark_addressable (array
))
2966 return error_mark_node
;
2969 if (!lvalue_p (array
) && (complain
& tf_error
))
2970 pedwarn (loc
, OPT_pedantic
,
2971 "ISO C++ forbids subscripting non-lvalue array");
2973 /* Note in C++ it is valid to subscript a `register' array, since
2974 it is valid to take the address of something with that
2975 storage specification. */
2979 while (TREE_CODE (foo
) == COMPONENT_REF
)
2980 foo
= TREE_OPERAND (foo
, 0);
2981 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2982 && (complain
& tf_warning
))
2983 warning_at (loc
, OPT_Wextra
,
2984 "subscripting array declared %<register%>");
2987 type
= TREE_TYPE (TREE_TYPE (array
));
2988 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2989 /* Array ref is const/volatile if the array elements are
2990 or if the array is.. */
2991 TREE_READONLY (rval
)
2992 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2993 TREE_SIDE_EFFECTS (rval
)
2994 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2995 TREE_THIS_VOLATILE (rval
)
2996 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2997 ret
= require_complete_type (fold_if_not_in_template (rval
));
2998 protected_set_expr_location (ret
, loc
);
3003 tree ar
= default_conversion (array
);
3004 tree ind
= default_conversion (idx
);
3006 /* Put the integer in IND to simplify error checking. */
3007 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3014 if (ar
== error_mark_node
)
3017 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3019 if (complain
& tf_error
)
3020 error_at (loc
, "subscripted value is neither array nor pointer");
3021 return error_mark_node
;
3023 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3025 if (complain
& tf_error
)
3026 error_at (loc
, "array subscript is not an integer");
3027 return error_mark_node
;
3030 warn_array_subscript_with_type_char (idx
);
3032 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3037 protected_set_expr_location (ret
, loc
);
3042 /* Entry point for Obj-C++. */
3045 build_array_ref (location_t loc
, tree array
, tree idx
)
3047 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3050 /* Resolve a pointer to member function. INSTANCE is the object
3051 instance to use, if the member points to a virtual member.
3053 This used to avoid checking for virtual functions if basetype
3054 has no virtual functions, according to an earlier ANSI draft.
3055 With the final ISO C++ rules, such an optimization is
3056 incorrect: A pointer to a derived member can be static_cast
3057 to pointer-to-base-member, as long as the dynamic object
3058 later has the right member. */
3061 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3063 if (TREE_CODE (function
) == OFFSET_REF
)
3064 function
= TREE_OPERAND (function
, 1);
3066 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3068 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3069 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3071 tree instance_ptr
= *instance_ptrptr
;
3072 tree instance_save_expr
= 0;
3073 if (instance_ptr
== error_mark_node
)
3075 if (TREE_CODE (function
) == PTRMEM_CST
)
3077 /* Extracting the function address from a pmf is only
3078 allowed with -Wno-pmf-conversions. It only works for
3080 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3081 e1
= convert (fntype
, e1
);
3086 error ("object missing in use of %qE", function
);
3087 return error_mark_node
;
3091 if (TREE_SIDE_EFFECTS (instance_ptr
))
3092 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3094 if (TREE_SIDE_EFFECTS (function
))
3095 function
= save_expr (function
);
3097 /* Start by extracting all the information from the PMF itself. */
3098 e3
= pfn_from_ptrmemfunc (function
);
3099 delta
= delta_from_ptrmemfunc (function
);
3100 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3101 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3103 case ptrmemfunc_vbit_in_pfn
:
3104 e1
= cp_build_binary_op (input_location
,
3105 BIT_AND_EXPR
, idx
, integer_one_node
,
3106 tf_warning_or_error
);
3107 idx
= cp_build_binary_op (input_location
,
3108 MINUS_EXPR
, idx
, integer_one_node
,
3109 tf_warning_or_error
);
3112 case ptrmemfunc_vbit_in_delta
:
3113 e1
= cp_build_binary_op (input_location
,
3114 BIT_AND_EXPR
, delta
, integer_one_node
,
3115 tf_warning_or_error
);
3116 delta
= cp_build_binary_op (input_location
,
3117 RSHIFT_EXPR
, delta
, integer_one_node
,
3118 tf_warning_or_error
);
3125 /* Convert down to the right base before using the instance. A
3126 special case is that in a pointer to member of class C, C may
3127 be incomplete. In that case, the function will of course be
3128 a member of C, and no conversion is required. In fact,
3129 lookup_base will fail in that case, because incomplete
3130 classes do not have BINFOs. */
3131 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3132 if (!same_type_ignoring_top_level_qualifiers_p
3133 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3135 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3136 basetype
, ba_check
, NULL
);
3137 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3139 if (instance_ptr
== error_mark_node
)
3140 return error_mark_node
;
3142 /* ...and then the delta in the PMF. */
3143 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3144 instance_ptr
, fold_convert (sizetype
, delta
));
3146 /* Hand back the adjusted 'this' argument to our caller. */
3147 *instance_ptrptr
= instance_ptr
;
3149 /* Next extract the vtable pointer from the object. */
3150 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3152 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3153 /* If the object is not dynamic the access invokes undefined
3154 behavior. As it is not executed in this case silence the
3155 spurious warnings it may provoke. */
3156 TREE_NO_WARNING (vtbl
) = 1;
3158 /* Finally, extract the function pointer from the vtable. */
3159 e2
= fold_build2_loc (input_location
,
3160 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3161 fold_convert (sizetype
, idx
));
3162 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3163 TREE_CONSTANT (e2
) = 1;
3165 /* When using function descriptors, the address of the
3166 vtable entry is treated as a function pointer. */
3167 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3168 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3169 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3170 tf_warning_or_error
));
3172 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3173 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3175 /* Make sure this doesn't get evaluated first inside one of the
3176 branches of the COND_EXPR. */
3177 if (instance_save_expr
)
3178 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3179 instance_save_expr
, e1
);
3186 /* Used by the C-common bits. */
3188 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3189 tree function
, tree params
)
3191 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3194 /* Used by the C-common bits. */
3196 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3197 tree function
, VEC(tree
,gc
) *params
,
3198 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3200 VEC(tree
,gc
) *orig_params
= params
;
3201 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3202 tf_warning_or_error
);
3204 /* cp_build_function_call_vec can reallocate PARAMS by adding
3205 default arguments. That should never happen here. Verify
3207 gcc_assert (params
== orig_params
);
3212 /* Build a function call using a tree list of arguments. */
3215 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3220 vec
= make_tree_vector ();
3221 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3222 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3223 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3224 release_tree_vector (vec
);
3228 /* Build a function call using a vector of arguments. PARAMS may be
3229 NULL if there are no parameters. This changes the contents of
3233 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3234 tsubst_flags_t complain
)
3236 tree fntype
, fndecl
;
3238 tree original
= function
;
3242 VEC(tree
,gc
) *allocated
= NULL
;
3245 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3246 expressions, like those used for ObjC messenger dispatches. */
3247 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3248 function
= objc_rewrite_function_call (function
,
3249 VEC_index (tree
, *params
, 0));
3251 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3252 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3253 if (TREE_CODE (function
) == NOP_EXPR
3254 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3255 function
= TREE_OPERAND (function
, 0);
3257 if (TREE_CODE (function
) == FUNCTION_DECL
)
3259 mark_used (function
);
3262 /* Convert anything with function type to a pointer-to-function. */
3263 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3264 pedwarn (input_location
, OPT_pedantic
,
3265 "ISO C++ forbids calling %<::main%> from within program");
3267 function
= build_addr_func (function
);
3273 function
= build_addr_func (function
);
3276 if (function
== error_mark_node
)
3277 return error_mark_node
;
3279 fntype
= TREE_TYPE (function
);
3281 if (TYPE_PTRMEMFUNC_P (fntype
))
3283 if (complain
& tf_error
)
3284 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3285 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3286 original
, original
);
3287 return error_mark_node
;
3290 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3291 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3293 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3294 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3296 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3298 if (complain
& tf_error
)
3299 error ("%qE cannot be used as a function", original
);
3300 return error_mark_node
;
3303 /* fntype now gets the type of function pointed to. */
3304 fntype
= TREE_TYPE (fntype
);
3305 parm_types
= TYPE_ARG_TYPES (fntype
);
3309 allocated
= make_tree_vector ();
3310 params
= &allocated
;
3313 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3316 return error_mark_node
;
3318 argarray
= VEC_address (tree
, *params
);
3320 /* Check for errors in format strings and inappropriately
3322 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3325 ret
= build_cxx_call (function
, nargs
, argarray
);
3327 if (allocated
!= NULL
)
3328 release_tree_vector (allocated
);
3333 /* Subroutine of convert_arguments.
3334 Warn about wrong number of args are genereted. */
3337 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3341 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3343 if (DECL_NAME (fndecl
) == NULL_TREE
3344 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3347 ? G_("too many arguments to constructor %q#D")
3348 : G_("too few arguments to constructor %q#D"),
3353 ? G_("too many arguments to member function %q#D")
3354 : G_("too few arguments to member function %q#D"),
3360 ? G_("too many arguments to function %q#D")
3361 : G_("too few arguments to function %q#D"),
3363 inform (DECL_SOURCE_LOCATION (fndecl
),
3367 error_at (loc
, too_many_p
? G_("too many arguments to function")
3368 : G_("too few arguments to function"));
3371 /* Convert the actual parameter expressions in the list VALUES to the
3372 types in the list TYPELIST. The converted expressions are stored
3373 back in the VALUES vector.
3374 If parmdecls is exhausted, or when an element has NULL as its type,
3375 perform the default conversions.
3377 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3379 This is also where warnings about wrong number of args are generated.
3381 Returns the actual number of arguments processed (which might be less
3382 than the length of the vector), or -1 on error.
3384 In C++, unspecified trailing parameters can be filled in with their
3385 default arguments, if such were specified. Do so here. */
3388 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3389 int flags
, tsubst_flags_t complain
)
3394 /* Argument passing is always copy-initialization. */
3395 flags
|= LOOKUP_ONLYCONVERTING
;
3397 for (i
= 0, typetail
= typelist
;
3398 i
< VEC_length (tree
, *values
);
3401 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3402 tree val
= VEC_index (tree
, *values
, i
);
3404 if (val
== error_mark_node
|| type
== error_mark_node
)
3407 if (type
== void_type_node
)
3409 if (complain
& tf_error
)
3411 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3418 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3419 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3420 if (TREE_CODE (val
) == NOP_EXPR
3421 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3422 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3423 val
= TREE_OPERAND (val
, 0);
3425 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3427 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3428 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3429 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3430 val
= decay_conversion (val
);
3433 if (val
== error_mark_node
)
3438 /* Formal parm type is specified by a function prototype. */
3441 if (!COMPLETE_TYPE_P (complete_type (type
)))
3443 if (complain
& tf_error
)
3446 error ("parameter %P of %qD has incomplete type %qT",
3449 error ("parameter %P has incomplete type %qT", i
, type
);
3451 parmval
= error_mark_node
;
3455 parmval
= convert_for_initialization
3456 (NULL_TREE
, type
, val
, flags
,
3457 "argument passing", fndecl
, i
, complain
);
3458 parmval
= convert_for_arg_passing (type
, parmval
);
3461 if (parmval
== error_mark_node
)
3464 VEC_replace (tree
, *values
, i
, parmval
);
3468 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3469 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3470 /* Don't do ellipsis conversion for __built_in_constant_p
3471 as this will result in spurious errors for non-trivial
3473 val
= require_complete_type (val
);
3475 val
= convert_arg_to_ellipsis (val
);
3477 VEC_replace (tree
, *values
, i
, val
);
3481 typetail
= TREE_CHAIN (typetail
);
3484 if (typetail
!= 0 && typetail
!= void_list_node
)
3486 /* See if there are default arguments that can be used. Because
3487 we hold default arguments in the FUNCTION_TYPE (which is so
3488 wrong), we can see default parameters here from deduced
3489 contexts (and via typeof) for indirect function calls.
3490 Fortunately we know whether we have a function decl to
3491 provide default arguments in a language conformant
3493 if (fndecl
&& TREE_PURPOSE (typetail
)
3494 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3496 for (; typetail
!= void_list_node
; ++i
)
3499 = convert_default_arg (TREE_VALUE (typetail
),
3500 TREE_PURPOSE (typetail
),
3503 if (parmval
== error_mark_node
)
3506 VEC_safe_push (tree
, gc
, *values
, parmval
);
3507 typetail
= TREE_CHAIN (typetail
);
3508 /* ends with `...'. */
3509 if (typetail
== NULL_TREE
)
3515 if (complain
& tf_error
)
3516 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3524 /* Build a binary-operation expression, after performing default
3525 conversions on the operands. CODE is the kind of expression to
3526 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3527 are the tree codes which correspond to ARG1 and ARG2 when issuing
3528 warnings about possibly misplaced parentheses. They may differ
3529 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3530 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3531 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3532 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3533 ARG2_CODE as ERROR_MARK. */
3536 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3537 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3538 tsubst_flags_t complain
)
3547 if (processing_template_decl
)
3549 if (type_dependent_expression_p (arg1
)
3550 || type_dependent_expression_p (arg2
))
3551 return build_min_nt (code
, arg1
, arg2
);
3552 arg1
= build_non_dependent_expr (arg1
);
3553 arg2
= build_non_dependent_expr (arg2
);
3556 if (code
== DOTSTAR_EXPR
)
3557 expr
= build_m_component_ref (arg1
, arg2
);
3559 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3560 overloaded_p
, complain
);
3562 /* Check for cases such as x+y<<z which users are likely to
3563 misinterpret. But don't warn about obj << x + y, since that is a
3564 common idiom for I/O. */
3565 if (warn_parentheses
3566 && (complain
& tf_warning
)
3567 && !processing_template_decl
3568 && !error_operand_p (arg1
)
3569 && !error_operand_p (arg2
)
3570 && (code
!= LSHIFT_EXPR
3571 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3572 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3574 if (processing_template_decl
&& expr
!= error_mark_node
)
3575 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3580 /* Build and return an ARRAY_REF expression. */
3583 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3585 tree orig_arg1
= arg1
;
3586 tree orig_arg2
= arg2
;
3589 if (processing_template_decl
)
3591 if (type_dependent_expression_p (arg1
)
3592 || type_dependent_expression_p (arg2
))
3593 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3594 NULL_TREE
, NULL_TREE
);
3595 arg1
= build_non_dependent_expr (arg1
);
3596 arg2
= build_non_dependent_expr (arg2
);
3599 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3600 /*overloaded_p=*/NULL
, complain
);
3602 if (processing_template_decl
&& expr
!= error_mark_node
)
3603 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3604 NULL_TREE
, NULL_TREE
);
3608 /* For the c-common bits. */
3610 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3611 int convert_p ATTRIBUTE_UNUSED
)
3613 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3617 /* Build a binary-operation expression without default conversions.
3618 CODE is the kind of expression to build.
3619 LOCATION is the location_t of the operator in the source code.
3620 This function differs from `build' in several ways:
3621 the data type of the result is computed and recorded in it,
3622 warnings are generated if arg data types are invalid,
3623 special handling for addition and subtraction of pointers is known,
3624 and some optimization is done (operations on narrow ints
3625 are done in the narrower type when that gives the same result).
3626 Constant folding is also done before the result is returned.
3628 Note that the operands will never have enumeral types
3629 because either they have just had the default conversions performed
3630 or they have both just been converted to some other type in which
3631 the arithmetic is to be done.
3633 C++: must do special pointer arithmetic when implementing
3634 multiple inheritance, and deal with pointer to member functions. */
3637 cp_build_binary_op (location_t location
,
3638 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3639 tsubst_flags_t complain
)
3642 enum tree_code code0
, code1
;
3644 const char *invalid_op_diag
;
3646 /* Expression code to give to the expression when it is built.
3647 Normally this is CODE, which is what the caller asked for,
3648 but in some special cases we change it. */
3649 enum tree_code resultcode
= code
;
3651 /* Data type in which the computation is to be performed.
3652 In the simplest cases this is the common type of the arguments. */
3653 tree result_type
= NULL
;
3655 /* Nonzero means operands have already been type-converted
3656 in whatever way is necessary.
3657 Zero means they need to be converted to RESULT_TYPE. */
3660 /* Nonzero means create the expression with this type, rather than
3662 tree build_type
= 0;
3664 /* Nonzero means after finally constructing the expression
3665 convert it to this type. */
3666 tree final_type
= 0;
3670 /* Nonzero if this is an operation like MIN or MAX which can
3671 safely be computed in short if both args are promoted shorts.
3672 Also implies COMMON.
3673 -1 indicates a bitwise operation; this makes a difference
3674 in the exact conditions for when it is safe to do the operation
3675 in a narrower mode. */
3678 /* Nonzero if this is a comparison operation;
3679 if both args are promoted shorts, compare the original shorts.
3680 Also implies COMMON. */
3681 int short_compare
= 0;
3683 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3686 /* True if both operands have arithmetic type. */
3687 bool arithmetic_types_p
;
3689 /* Apply default conversions. */
3693 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3694 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3695 || code
== TRUTH_XOR_EXPR
)
3697 if (!really_overloaded_fn (op0
))
3698 op0
= decay_conversion (op0
);
3699 if (!really_overloaded_fn (op1
))
3700 op1
= decay_conversion (op1
);
3704 if (!really_overloaded_fn (op0
))
3705 op0
= default_conversion (op0
);
3706 if (!really_overloaded_fn (op1
))
3707 op1
= default_conversion (op1
);
3710 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3711 STRIP_TYPE_NOPS (op0
);
3712 STRIP_TYPE_NOPS (op1
);
3714 /* DTRT if one side is an overloaded function, but complain about it. */
3715 if (type_unknown_p (op0
))
3717 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3718 if (t
!= error_mark_node
)
3720 if (complain
& tf_error
)
3721 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3726 if (type_unknown_p (op1
))
3728 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3729 if (t
!= error_mark_node
)
3731 if (complain
& tf_error
)
3732 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3738 type0
= TREE_TYPE (op0
);
3739 type1
= TREE_TYPE (op1
);
3741 /* The expression codes of the data types of the arguments tell us
3742 whether the arguments are integers, floating, pointers, etc. */
3743 code0
= TREE_CODE (type0
);
3744 code1
= TREE_CODE (type1
);
3746 /* If an error was already reported for one of the arguments,
3747 avoid reporting another error. */
3748 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3749 return error_mark_node
;
3751 if ((invalid_op_diag
3752 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3754 error (invalid_op_diag
);
3755 return error_mark_node
;
3758 /* Issue warnings about peculiar, but valid, uses of NULL. */
3759 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3760 /* It's reasonable to use pointer values as operands of &&
3761 and ||, so NULL is no exception. */
3762 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3763 && ( /* Both are NULL (or 0) and the operation was not a
3764 comparison or a pointer subtraction. */
3765 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3766 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3767 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3768 || (!null_ptr_cst_p (orig_op0
)
3769 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3770 || (!null_ptr_cst_p (orig_op1
)
3771 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3772 && (complain
& tf_warning
))
3773 /* Some sort of arithmetic operation involving NULL was
3775 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3780 /* Subtraction of two similar pointers.
3781 We must subtract them as integers, then divide by object size. */
3782 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3783 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3785 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3786 /* In all other cases except pointer - int, the usual arithmetic
3788 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3793 /* The pointer - int case is just like pointer + int; fall
3796 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3797 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3801 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3802 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3803 if (processing_template_decl
)
3805 result_type
= TREE_TYPE (ptr_operand
);
3808 return cp_pointer_int_sum (code
,
3819 case TRUNC_DIV_EXPR
:
3821 case FLOOR_DIV_EXPR
:
3822 case ROUND_DIV_EXPR
:
3823 case EXACT_DIV_EXPR
:
3824 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3825 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3826 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3827 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3829 enum tree_code tcode0
= code0
, tcode1
= code1
;
3831 warn_for_div_by_zero (location
, op1
);
3833 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3834 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3835 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3836 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3838 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3839 resultcode
= RDIV_EXPR
;
3841 /* When dividing two signed integers, we have to promote to int.
3842 unless we divide by a constant != -1. Note that default
3843 conversion will have been performed on the operands at this
3844 point, so we have to dig out the original type to find out if
3846 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3847 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3848 || (TREE_CODE (op1
) == INTEGER_CST
3849 && ! integer_all_onesp (op1
)));
3858 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3859 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3860 && !VECTOR_FLOAT_TYPE_P (type0
)
3861 && !VECTOR_FLOAT_TYPE_P (type1
)))
3865 case TRUNC_MOD_EXPR
:
3866 case FLOOR_MOD_EXPR
:
3867 warn_for_div_by_zero (location
, op1
);
3869 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3870 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3871 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3873 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3875 /* Although it would be tempting to shorten always here, that loses
3876 on some targets, since the modulo instruction is undefined if the
3877 quotient can't be represented in the computation mode. We shorten
3878 only if unsigned or if dividing by something we know != -1. */
3879 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3880 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3881 || (TREE_CODE (op1
) == INTEGER_CST
3882 && ! integer_all_onesp (op1
)));
3887 case TRUTH_ANDIF_EXPR
:
3888 case TRUTH_ORIF_EXPR
:
3889 case TRUTH_AND_EXPR
:
3891 result_type
= boolean_type_node
;
3894 /* Shift operations: result has same type as first operand;
3895 always convert second operand to int.
3896 Also set SHORT_SHIFT if shifting rightward. */
3899 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3901 result_type
= type0
;
3902 if (TREE_CODE (op1
) == INTEGER_CST
)
3904 if (tree_int_cst_lt (op1
, integer_zero_node
))
3906 if ((complain
& tf_warning
)
3907 && c_inhibit_evaluation_warnings
== 0)
3908 warning (0, "right shift count is negative");
3912 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3913 && (complain
& tf_warning
)
3914 && c_inhibit_evaluation_warnings
== 0)
3915 warning (0, "right shift count >= width of type");
3918 /* Convert the shift-count to an integer, regardless of
3919 size of value being shifted. */
3920 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3921 op1
= cp_convert (integer_type_node
, op1
);
3922 /* Avoid converting op1 to result_type later. */
3928 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3930 result_type
= type0
;
3931 if (TREE_CODE (op1
) == INTEGER_CST
)
3933 if (tree_int_cst_lt (op1
, integer_zero_node
))
3935 if ((complain
& tf_warning
)
3936 && c_inhibit_evaluation_warnings
== 0)
3937 warning (0, "left shift count is negative");
3939 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3941 if ((complain
& tf_warning
)
3942 && c_inhibit_evaluation_warnings
== 0)
3943 warning (0, "left shift count >= width of type");
3946 /* Convert the shift-count to an integer, regardless of
3947 size of value being shifted. */
3948 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3949 op1
= cp_convert (integer_type_node
, op1
);
3950 /* Avoid converting op1 to result_type later. */
3957 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3959 result_type
= type0
;
3960 if (TREE_CODE (op1
) == INTEGER_CST
)
3962 if (tree_int_cst_lt (op1
, integer_zero_node
))
3964 if (complain
& tf_warning
)
3965 warning (0, (code
== LROTATE_EXPR
)
3966 ? G_("left rotate count is negative")
3967 : G_("right rotate count is negative"));
3969 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3971 if (complain
& tf_warning
)
3972 warning (0, (code
== LROTATE_EXPR
)
3973 ? G_("left rotate count >= width of type")
3974 : G_("right rotate count >= width of type"));
3977 /* Convert the shift-count to an integer, regardless of
3978 size of value being shifted. */
3979 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3980 op1
= cp_convert (integer_type_node
, op1
);
3986 if ((complain
& tf_warning
)
3987 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3988 warning (OPT_Wfloat_equal
,
3989 "comparing floating point with == or != is unsafe");
3990 if ((complain
& tf_warning
)
3991 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3992 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3993 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3995 build_type
= boolean_type_node
;
3996 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3997 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3998 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3999 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4001 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4002 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
4003 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4004 CPO_COMPARISON
, complain
);
4005 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
4006 && null_ptr_cst_p (op1
))
4008 if (TREE_CODE (op0
) == ADDR_EXPR
4009 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4011 if (complain
& tf_warning
)
4012 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4013 TREE_OPERAND (op0
, 0));
4015 result_type
= type0
;
4017 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4018 && null_ptr_cst_p (op0
))
4020 if (TREE_CODE (op1
) == ADDR_EXPR
4021 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4023 if (complain
& tf_warning
)
4024 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4025 TREE_OPERAND (op1
, 0));
4027 result_type
= type1
;
4029 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4030 /* One of the operands must be of nullptr_t type. */
4031 result_type
= TREE_TYPE (nullptr_node
);
4032 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4034 result_type
= type0
;
4035 if (complain
& tf_error
)
4036 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4038 return error_mark_node
;
4040 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4042 result_type
= type1
;
4043 if (complain
& tf_error
)
4044 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4046 return error_mark_node
;
4048 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4050 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4051 == ptrmemfunc_vbit_in_delta
)
4053 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4054 tree delta0
= delta_from_ptrmemfunc (op0
);
4055 tree e1
= cp_build_binary_op (location
,
4058 fold_convert (TREE_TYPE (pfn0
),
4061 tree e2
= cp_build_binary_op (location
,
4066 e2
= cp_build_binary_op (location
,
4067 EQ_EXPR
, e2
, integer_zero_node
,
4069 op0
= cp_build_binary_op (location
,
4070 TRUTH_ANDIF_EXPR
, e1
, e2
,
4072 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4076 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4077 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4079 result_type
= TREE_TYPE (op0
);
4081 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4082 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4083 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4086 /* E will be the final comparison. */
4088 /* E1 and E2 are for scratch. */
4096 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4097 CPO_COMPARISON
, complain
);
4099 if (!same_type_p (TREE_TYPE (op0
), type
))
4100 op0
= cp_convert_and_check (type
, op0
);
4101 if (!same_type_p (TREE_TYPE (op1
), type
))
4102 op1
= cp_convert_and_check (type
, op1
);
4104 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4105 return error_mark_node
;
4107 if (TREE_SIDE_EFFECTS (op0
))
4108 op0
= save_expr (op0
);
4109 if (TREE_SIDE_EFFECTS (op1
))
4110 op1
= save_expr (op1
);
4112 pfn0
= pfn_from_ptrmemfunc (op0
);
4113 pfn1
= pfn_from_ptrmemfunc (op1
);
4114 delta0
= delta_from_ptrmemfunc (op0
);
4115 delta1
= delta_from_ptrmemfunc (op1
);
4116 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4117 == ptrmemfunc_vbit_in_delta
)
4122 && ((op0.delta == op1.delta)
4123 || (!op0.pfn && op0.delta & 1 == 0
4124 && op1.delta & 1 == 0))
4126 The reason for the `!op0.pfn' bit is that a NULL
4127 pointer-to-member is any member with a zero PFN and
4128 LSB of the DELTA field is 0. */
4130 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4134 e1
= cp_build_binary_op (location
,
4135 EQ_EXPR
, e1
, integer_zero_node
,
4137 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4141 e2
= cp_build_binary_op (location
,
4142 EQ_EXPR
, e2
, integer_zero_node
,
4144 e1
= cp_build_binary_op (location
,
4145 TRUTH_ANDIF_EXPR
, e2
, e1
,
4147 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4149 fold_convert (TREE_TYPE (pfn0
),
4152 e2
= cp_build_binary_op (location
,
4153 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4154 e1
= cp_build_binary_op (location
,
4155 EQ_EXPR
, delta0
, delta1
, complain
);
4156 e1
= cp_build_binary_op (location
,
4157 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4164 && (!op0.pfn || op0.delta == op1.delta))
4166 The reason for the `!op0.pfn' bit is that a NULL
4167 pointer-to-member is any member with a zero PFN; the
4168 DELTA field is unspecified. */
4170 e1
= cp_build_binary_op (location
,
4171 EQ_EXPR
, delta0
, delta1
, complain
);
4172 e2
= cp_build_binary_op (location
,
4175 fold_convert (TREE_TYPE (pfn0
),
4178 e1
= cp_build_binary_op (location
,
4179 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4181 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4182 e
= cp_build_binary_op (location
,
4183 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4184 if (code
== EQ_EXPR
)
4186 return cp_build_binary_op (location
,
4187 EQ_EXPR
, e
, integer_zero_node
, complain
);
4191 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4192 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4194 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4195 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4203 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4204 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4206 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4207 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4208 CPO_COMPARISON
, complain
);
4215 if (TREE_CODE (orig_op0
) == STRING_CST
4216 || TREE_CODE (orig_op1
) == STRING_CST
)
4218 if (complain
& tf_warning
)
4219 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4222 build_type
= boolean_type_node
;
4223 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4224 || code0
== ENUMERAL_TYPE
)
4225 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4226 || code1
== ENUMERAL_TYPE
))
4228 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4229 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4230 CPO_COMPARISON
, complain
);
4231 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4232 result_type
= type0
;
4233 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4234 result_type
= type1
;
4235 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4236 /* One of the operands must be of nullptr_t type. */
4237 result_type
= TREE_TYPE (nullptr_node
);
4238 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4240 result_type
= type0
;
4241 if (complain
& tf_error
)
4242 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4244 return error_mark_node
;
4246 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4248 result_type
= type1
;
4249 if (complain
& tf_error
)
4250 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4252 return error_mark_node
;
4256 case UNORDERED_EXPR
:
4263 build_type
= integer_type_node
;
4264 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4266 if (complain
& tf_error
)
4267 error ("unordered comparison on non-floating point argument");
4268 return error_mark_node
;
4277 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4278 || code0
== ENUMERAL_TYPE
)
4279 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4280 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4281 arithmetic_types_p
= 1;
4284 arithmetic_types_p
= 0;
4285 /* Vector arithmetic is only allowed when both sides are vectors. */
4286 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4288 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4289 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4292 binary_op_error (location
, code
, type0
, type1
);
4293 return error_mark_node
;
4295 arithmetic_types_p
= 1;
4298 /* Determine the RESULT_TYPE, if it is not already known. */
4300 && arithmetic_types_p
4301 && (shorten
|| common
|| short_compare
))
4302 result_type
= cp_common_type (type0
, type1
);
4306 if (complain
& tf_error
)
4307 error ("invalid operands of types %qT and %qT to binary %qO",
4308 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4309 return error_mark_node
;
4312 /* If we're in a template, the only thing we need to know is the
4314 if (processing_template_decl
)
4316 /* Since the middle-end checks the type when doing a build2, we
4317 need to build the tree in pieces. This built tree will never
4318 get out of the front-end as we replace it when instantiating
4320 tree tmp
= build2 (resultcode
,
4321 build_type
? build_type
: result_type
,
4323 TREE_OPERAND (tmp
, 0) = op0
;
4327 if (arithmetic_types_p
)
4329 bool first_complex
= (code0
== COMPLEX_TYPE
);
4330 bool second_complex
= (code1
== COMPLEX_TYPE
);
4331 int none_complex
= (!first_complex
&& !second_complex
);
4333 /* Adapted from patch for c/24581. */
4334 if (first_complex
!= second_complex
4335 && (code
== PLUS_EXPR
4336 || code
== MINUS_EXPR
4337 || code
== MULT_EXPR
4338 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4339 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4340 && flag_signed_zeros
)
4342 /* An operation on mixed real/complex operands must be
4343 handled specially, but the language-independent code can
4344 more easily optimize the plain complex arithmetic if
4345 -fno-signed-zeros. */
4346 tree real_type
= TREE_TYPE (result_type
);
4350 if (TREE_TYPE (op0
) != result_type
)
4351 op0
= cp_convert_and_check (result_type
, op0
);
4352 if (TREE_TYPE (op1
) != real_type
)
4353 op1
= cp_convert_and_check (real_type
, op1
);
4357 if (TREE_TYPE (op0
) != real_type
)
4358 op0
= cp_convert_and_check (real_type
, op0
);
4359 if (TREE_TYPE (op1
) != result_type
)
4360 op1
= cp_convert_and_check (result_type
, op1
);
4362 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4363 return error_mark_node
;
4366 op0
= save_expr (op0
);
4367 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4368 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4372 case TRUNC_DIV_EXPR
:
4373 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4377 real
= build2 (resultcode
, real_type
, real
, op1
);
4385 op1
= save_expr (op1
);
4386 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4387 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4391 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4394 real
= build2 (resultcode
, real_type
, op0
, real
);
4397 real
= build2 (resultcode
, real_type
, op0
, real
);
4398 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4404 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4407 /* For certain operations (which identify themselves by shorten != 0)
4408 if both args were extended from the same smaller type,
4409 do the arithmetic in that type and then extend.
4411 shorten !=0 and !=1 indicates a bitwise operation.
4412 For them, this optimization is safe only if
4413 both args are zero-extended or both are sign-extended.
4414 Otherwise, we might change the result.
4415 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4416 but calculated in (unsigned short) it would be (unsigned short)-1. */
4418 if (shorten
&& none_complex
)
4420 final_type
= result_type
;
4421 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4425 /* Comparison operations are shortened too but differently.
4426 They identify themselves by setting short_compare = 1. */
4430 /* Don't write &op0, etc., because that would prevent op0
4431 from being kept in a register.
4432 Instead, make copies of the our local variables and
4433 pass the copies by reference, then copy them back afterward. */
4434 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4435 enum tree_code xresultcode
= resultcode
;
4437 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4439 return cp_convert (boolean_type_node
, val
);
4440 op0
= xop0
, op1
= xop1
;
4442 resultcode
= xresultcode
;
4445 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4446 && warn_sign_compare
4447 && !TREE_NO_WARNING (orig_op0
)
4448 && !TREE_NO_WARNING (orig_op1
)
4449 /* Do not warn until the template is instantiated; we cannot
4450 bound the ranges of the arguments until that point. */
4451 && !processing_template_decl
4452 && (complain
& tf_warning
)
4453 && c_inhibit_evaluation_warnings
== 0)
4455 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4456 result_type
, resultcode
);
4460 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4461 Then the expression will be built.
4462 It will be given type FINAL_TYPE if that is nonzero;
4463 otherwise, it will be given type RESULT_TYPE. */
4466 if (TREE_TYPE (op0
) != result_type
)
4467 op0
= cp_convert_and_check (result_type
, op0
);
4468 if (TREE_TYPE (op1
) != result_type
)
4469 op1
= cp_convert_and_check (result_type
, op1
);
4471 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4472 return error_mark_node
;
4475 if (build_type
== NULL_TREE
)
4476 build_type
= result_type
;
4478 result
= build2 (resultcode
, build_type
, op0
, op1
);
4479 result
= fold_if_not_in_template (result
);
4480 if (final_type
!= 0)
4481 result
= cp_convert (final_type
, result
);
4483 if (TREE_OVERFLOW_P (result
)
4484 && !TREE_OVERFLOW_P (op0
)
4485 && !TREE_OVERFLOW_P (op1
))
4486 overflow_warning (location
, result
);
4491 /* Return a tree for the sum or difference (RESULTCODE says which)
4492 of pointer PTROP and integer INTOP. */
4495 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4497 tree res_type
= TREE_TYPE (ptrop
);
4499 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4500 in certain circumstance (when it's valid to do so). So we need
4501 to make sure it's complete. We don't need to check here, if we
4502 can actually complete it at all, as those checks will be done in
4503 pointer_int_sum() anyway. */
4504 complete_type (TREE_TYPE (res_type
));
4506 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4507 fold_if_not_in_template (intop
));
4510 /* Return a tree for the difference of pointers OP0 and OP1.
4511 The resulting tree has type int. */
4514 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4517 tree restype
= ptrdiff_type_node
;
4518 tree target_type
= TREE_TYPE (ptrtype
);
4520 if (!complete_type_or_else (target_type
, NULL_TREE
))
4521 return error_mark_node
;
4523 if (TREE_CODE (target_type
) == VOID_TYPE
)
4524 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4525 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4526 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4527 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4528 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4530 /* First do the subtraction as integers;
4531 then drop through to build the divide operator. */
4533 op0
= cp_build_binary_op (input_location
,
4535 cp_convert (restype
, op0
),
4536 cp_convert (restype
, op1
),
4537 tf_warning_or_error
);
4539 /* This generates an error if op1 is a pointer to an incomplete type. */
4540 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4541 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4543 op1
= (TYPE_PTROB_P (ptrtype
)
4544 ? size_in_bytes (target_type
)
4545 : integer_one_node
);
4547 /* Do the division. */
4549 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4550 return fold_if_not_in_template (result
);
4553 /* Construct and perhaps optimize a tree representation
4554 for a unary operation. CODE, a tree_code, specifies the operation
4555 and XARG is the operand. */
4558 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4560 tree orig_expr
= xarg
;
4564 if (processing_template_decl
)
4566 if (type_dependent_expression_p (xarg
))
4567 return build_min_nt (code
, xarg
, NULL_TREE
);
4569 xarg
= build_non_dependent_expr (xarg
);
4574 /* [expr.unary.op] says:
4576 The address of an object of incomplete type can be taken.
4578 (And is just the ordinary address operator, not an overloaded
4579 "operator &".) However, if the type is a template
4580 specialization, we must complete the type at this point so that
4581 an overloaded "operator &" will be available if required. */
4582 if (code
== ADDR_EXPR
4583 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4584 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4585 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4586 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4587 /* Don't look for a function. */;
4589 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4590 /*overloaded_p=*/NULL
, complain
);
4591 if (!exp
&& code
== ADDR_EXPR
)
4593 if (is_overloaded_fn (xarg
))
4595 tree fn
= get_first_fn (xarg
);
4596 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4598 error (DECL_CONSTRUCTOR_P (fn
)
4599 ? G_("taking address of constructor %qE")
4600 : G_("taking address of destructor %qE"),
4602 return error_mark_node
;
4606 /* A pointer to member-function can be formed only by saying
4608 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4609 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4611 if (TREE_CODE (xarg
) != OFFSET_REF
4612 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4614 error ("invalid use of %qE to form a pointer-to-member-function",
4616 if (TREE_CODE (xarg
) != OFFSET_REF
)
4617 inform (input_location
, " a qualified-id is required");
4618 return error_mark_node
;
4622 error ("parentheses around %qE cannot be used to form a"
4623 " pointer-to-member-function",
4625 PTRMEM_OK_P (xarg
) = 1;
4629 if (TREE_CODE (xarg
) == OFFSET_REF
)
4631 ptrmem
= PTRMEM_OK_P (xarg
);
4633 if (!ptrmem
&& !flag_ms_extensions
4634 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4636 /* A single non-static member, make sure we don't allow a
4637 pointer-to-member. */
4638 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4639 TREE_OPERAND (xarg
, 0),
4640 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4641 PTRMEM_OK_P (xarg
) = ptrmem
;
4644 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4645 warning (0, "taking address of temporary");
4646 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4649 if (processing_template_decl
&& exp
!= error_mark_node
)
4650 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4651 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4652 if (TREE_CODE (exp
) == ADDR_EXPR
)
4653 PTRMEM_OK_P (exp
) = ptrmem
;
4657 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4658 constants, where a null value is represented by an INTEGER_CST of
4662 cp_truthvalue_conversion (tree expr
)
4664 tree type
= TREE_TYPE (expr
);
4665 if (TYPE_PTRMEM_P (type
))
4666 return build_binary_op (EXPR_LOCATION (expr
),
4667 NE_EXPR
, expr
, integer_zero_node
, 1);
4669 return c_common_truthvalue_conversion (input_location
, expr
);
4672 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4675 condition_conversion (tree expr
)
4678 if (processing_template_decl
)
4680 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4681 tf_warning_or_error
, LOOKUP_NORMAL
);
4682 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4686 /* Returns the address of T. This function will fold away
4687 ADDR_EXPR of INDIRECT_REF. */
4690 build_address (tree t
)
4692 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4693 return error_mark_node
;
4694 t
= build_fold_addr_expr (t
);
4695 if (TREE_CODE (t
) != ADDR_EXPR
)
4700 /* Returns the address of T with type TYPE. */
4703 build_typed_address (tree t
, tree type
)
4705 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4706 return error_mark_node
;
4707 t
= build_fold_addr_expr_with_type (t
, type
);
4708 if (TREE_CODE (t
) != ADDR_EXPR
)
4713 /* Return a NOP_EXPR converting EXPR to TYPE. */
4716 build_nop (tree type
, tree expr
)
4718 if (type
== error_mark_node
|| error_operand_p (expr
))
4720 return build1 (NOP_EXPR
, type
, expr
);
4723 /* C++: Must handle pointers to members.
4725 Perhaps type instantiation should be extended to handle conversion
4726 from aggregates to types we don't yet know we want? (Or are those
4727 cases typically errors which should be reported?)
4729 NOCONVERT nonzero suppresses the default promotions
4730 (such as from short to int). */
4733 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4734 tsubst_flags_t complain
)
4736 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4739 const char *errstring
= NULL
;
4741 const char *invalid_op_diag
;
4743 if (error_operand_p (arg
))
4744 return error_mark_node
;
4746 if ((invalid_op_diag
4747 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4752 error (invalid_op_diag
);
4753 return error_mark_node
;
4758 case UNARY_PLUS_EXPR
:
4761 int flags
= WANT_ARITH
| WANT_ENUM
;
4762 /* Unary plus (but not unary minus) is allowed on pointers. */
4763 if (code
== UNARY_PLUS_EXPR
)
4764 flags
|= WANT_POINTER
;
4765 arg
= build_expr_type_conversion (flags
, arg
, true);
4767 errstring
= (code
== NEGATE_EXPR
4768 ? _("wrong type argument to unary minus")
4769 : _("wrong type argument to unary plus"));
4772 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4773 arg
= perform_integral_promotions (arg
);
4775 /* Make sure the result is not an lvalue: a unary plus or minus
4776 expression is always a rvalue. */
4783 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4787 arg
= default_conversion (arg
);
4789 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4790 | WANT_VECTOR_OR_COMPLEX
,
4792 errstring
= _("wrong type argument to bit-complement");
4793 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4794 arg
= perform_integral_promotions (arg
);
4798 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4799 errstring
= _("wrong type argument to abs");
4800 else if (!noconvert
)
4801 arg
= default_conversion (arg
);
4805 /* Conjugating a real value is a no-op, but allow it anyway. */
4806 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4807 errstring
= _("wrong type argument to conjugation");
4808 else if (!noconvert
)
4809 arg
= default_conversion (arg
);
4812 case TRUTH_NOT_EXPR
:
4813 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4815 val
= invert_truthvalue_loc (input_location
, arg
);
4816 if (arg
!= error_mark_node
)
4818 errstring
= _("in argument to unary !");
4825 if (TREE_CODE (arg
) == COMPLEX_CST
)
4826 return TREE_REALPART (arg
);
4827 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4829 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4830 return fold_if_not_in_template (arg
);
4836 if (TREE_CODE (arg
) == COMPLEX_CST
)
4837 return TREE_IMAGPART (arg
);
4838 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4840 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4841 return fold_if_not_in_template (arg
);
4844 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4846 case PREINCREMENT_EXPR
:
4847 case POSTINCREMENT_EXPR
:
4848 case PREDECREMENT_EXPR
:
4849 case POSTDECREMENT_EXPR
:
4850 /* Handle complex lvalues (when permitted)
4851 by reduction to simpler cases. */
4853 val
= unary_complex_lvalue (code
, arg
);
4857 arg
= mark_lvalue_use (arg
);
4859 /* Increment or decrement the real part of the value,
4860 and don't change the imaginary part. */
4861 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4865 arg
= stabilize_reference (arg
);
4866 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4867 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4868 real
= cp_build_unary_op (code
, real
, 1, complain
);
4869 if (real
== error_mark_node
|| imag
== error_mark_node
)
4870 return error_mark_node
;
4871 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4875 /* Report invalid types. */
4877 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4880 if (code
== PREINCREMENT_EXPR
)
4881 errstring
= _("no pre-increment operator for type");
4882 else if (code
== POSTINCREMENT_EXPR
)
4883 errstring
= _("no post-increment operator for type");
4884 else if (code
== PREDECREMENT_EXPR
)
4885 errstring
= _("no pre-decrement operator for type");
4887 errstring
= _("no post-decrement operator for type");
4890 else if (arg
== error_mark_node
)
4891 return error_mark_node
;
4893 /* Report something read-only. */
4895 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4896 || TREE_READONLY (arg
))
4898 if (complain
& tf_error
)
4899 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4900 || code
== POSTINCREMENT_EXPR
)
4901 ? REK_INCREMENT
: REK_DECREMENT
));
4903 return error_mark_node
;
4908 tree declared_type
= unlowered_expr_type (arg
);
4910 argtype
= TREE_TYPE (arg
);
4912 /* ARM $5.2.5 last annotation says this should be forbidden. */
4913 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4915 if (complain
& tf_error
)
4916 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4917 ? G_("ISO C++ forbids incrementing an enum")
4918 : G_("ISO C++ forbids decrementing an enum"));
4920 return error_mark_node
;
4923 /* Compute the increment. */
4925 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4927 tree type
= complete_type (TREE_TYPE (argtype
));
4929 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4931 if (complain
& tf_error
)
4932 error (((code
== PREINCREMENT_EXPR
4933 || code
== POSTINCREMENT_EXPR
))
4934 ? G_("cannot increment a pointer to incomplete type %qT")
4935 : G_("cannot decrement a pointer to incomplete type %qT"),
4936 TREE_TYPE (argtype
));
4938 return error_mark_node
;
4940 else if ((pedantic
|| warn_pointer_arith
)
4941 && !TYPE_PTROB_P (argtype
))
4943 if (complain
& tf_error
)
4944 permerror (input_location
, (code
== PREINCREMENT_EXPR
4945 || code
== POSTINCREMENT_EXPR
)
4946 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4947 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4950 return error_mark_node
;
4953 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4956 inc
= integer_one_node
;
4958 inc
= cp_convert (argtype
, inc
);
4960 /* Complain about anything else that is not a true lvalue. */
4961 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4962 || code
== POSTINCREMENT_EXPR
)
4963 ? lv_increment
: lv_decrement
),
4965 return error_mark_node
;
4967 /* Forbid using -- on `bool'. */
4968 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4970 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4972 if (complain
& tf_error
)
4973 error ("invalid use of Boolean expression as operand "
4974 "to %<operator--%>");
4975 return error_mark_node
;
4977 val
= boolean_increment (code
, arg
);
4980 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4982 TREE_SIDE_EFFECTS (val
) = 1;
4987 /* Note that this operation never does default_conversion
4988 regardless of NOCONVERT. */
4990 argtype
= lvalue_type (arg
);
4992 arg
= mark_lvalue_use (arg
);
4994 if (TREE_CODE (arg
) == OFFSET_REF
)
4997 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4999 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5000 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5003 else if (pedantic
&& DECL_MAIN_P (arg
))
5006 /* Apparently a lot of autoconf scripts for C++ packages do this,
5007 so only complain if -pedantic. */
5008 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5009 pedwarn (input_location
, OPT_pedantic
,
5010 "ISO C++ forbids taking address of function %<::main%>");
5011 else if (flag_pedantic_errors
)
5012 return error_mark_node
;
5015 /* Let &* cancel out to simplify resulting code. */
5016 if (TREE_CODE (arg
) == INDIRECT_REF
)
5018 /* We don't need to have `current_class_ptr' wrapped in a
5019 NON_LVALUE_EXPR node. */
5020 if (arg
== current_class_ref
)
5021 return current_class_ptr
;
5023 arg
= TREE_OPERAND (arg
, 0);
5024 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5026 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5027 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5030 /* Don't let this be an lvalue. */
5035 /* ??? Cope with user tricks that amount to offsetof. */
5036 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5037 && TREE_CODE (argtype
) != METHOD_TYPE
5038 && argtype
!= unknown_type_node
5039 && (val
= get_base_address (arg
))
5040 && TREE_CODE (val
) == INDIRECT_REF
5041 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5043 tree type
= build_pointer_type (argtype
);
5044 tree op0
= fold_convert (type
, TREE_OPERAND (val
, 0));
5045 tree op1
= fold_convert (sizetype
, fold_offsetof (arg
, val
));
5046 return fold_build2 (POINTER_PLUS_EXPR
, type
, op0
, op1
);
5049 /* Uninstantiated types are all functions. Taking the
5050 address of a function is a no-op, so just return the
5053 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5054 || !IDENTIFIER_OPNAME_P (arg
));
5056 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5057 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5059 /* They're trying to take the address of a unique non-static
5060 member function. This is ill-formed (except in MS-land),
5061 but let's try to DTRT.
5062 Note: We only handle unique functions here because we don't
5063 want to complain if there's a static overload; non-unique
5064 cases will be handled by instantiate_type. But we need to
5065 handle this case here to allow casts on the resulting PMF.
5066 We could defer this in non-MS mode, but it's easier to give
5067 a useful error here. */
5069 /* Inside constant member functions, the `this' pointer
5070 contains an extra const qualifier. TYPE_MAIN_VARIANT
5071 is used here to remove this const from the diagnostics
5072 and the created OFFSET_REF. */
5073 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5074 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5077 if (! flag_ms_extensions
)
5079 tree name
= DECL_NAME (fn
);
5080 if (!(complain
& tf_error
))
5081 return error_mark_node
;
5082 else if (current_class_type
5083 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5084 /* An expression like &memfn. */
5085 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5086 " or parenthesized non-static member function to form"
5087 " a pointer to member function. Say %<&%T::%D%>",
5090 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5091 " function to form a pointer to member function."
5095 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5099 if (type_unknown_p (arg
))
5100 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5102 /* Handle complex lvalues (when permitted)
5103 by reduction to simpler cases. */
5104 val
= unary_complex_lvalue (code
, arg
);
5108 switch (TREE_CODE (arg
))
5112 case FIX_TRUNC_EXPR
:
5113 /* Even if we're not being pedantic, we cannot allow this
5114 extension when we're instantiating in a SFINAE
5116 if (! lvalue_p (arg
) && complain
== tf_none
)
5118 if (complain
& tf_error
)
5119 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5121 return error_mark_node
;
5126 arg
= BASELINK_FUNCTIONS (arg
);
5130 arg
= OVL_CURRENT (arg
);
5134 /* Turn a reference to a non-static data member into a
5135 pointer-to-member. */
5140 if (!PTRMEM_OK_P (arg
))
5141 return cp_build_unary_op (code
, arg
, 0, complain
);
5143 t
= TREE_OPERAND (arg
, 1);
5144 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5146 if (complain
& tf_error
)
5147 error ("cannot create pointer to reference member %qD", t
);
5148 return error_mark_node
;
5151 type
= build_ptrmem_type (context_for_name_lookup (t
),
5153 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5161 /* Anything not already handled and not a true memory reference
5163 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5164 && TREE_CODE (argtype
) != METHOD_TYPE
5165 && TREE_CODE (arg
) != OFFSET_REF
5166 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5167 return error_mark_node
;
5169 if (argtype
!= error_mark_node
)
5170 argtype
= build_pointer_type (argtype
);
5172 /* In a template, we are processing a non-dependent expression
5173 so we can just form an ADDR_EXPR with the correct type. */
5174 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5176 val
= build_address (arg
);
5177 if (TREE_CODE (arg
) == OFFSET_REF
)
5178 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5180 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5182 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5184 /* We can only get here with a single static member
5186 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5187 && DECL_STATIC_FUNCTION_P (fn
));
5189 val
= build_address (fn
);
5190 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5191 /* Do not lose object's side effects. */
5192 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5193 TREE_OPERAND (arg
, 0), val
);
5195 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5197 if (complain
& tf_error
)
5198 error ("attempt to take address of bit-field structure member %qD",
5199 TREE_OPERAND (arg
, 1));
5200 return error_mark_node
;
5204 tree object
= TREE_OPERAND (arg
, 0);
5205 tree field
= TREE_OPERAND (arg
, 1);
5206 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5207 (TREE_TYPE (object
), decl_type_context (field
)));
5208 val
= build_address (arg
);
5211 if (TREE_CODE (argtype
) == POINTER_TYPE
5212 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5214 build_ptrmemfunc_type (argtype
);
5215 val
= build_ptrmemfunc (argtype
, val
, 0,
5216 /*c_cast_p=*/false);
5228 argtype
= TREE_TYPE (arg
);
5229 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5232 if (complain
& tf_error
)
5233 error ("%s", errstring
);
5234 return error_mark_node
;
5237 /* Hook for the c-common bits that build a unary op. */
5239 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5240 enum tree_code code
, tree xarg
, int noconvert
)
5242 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5245 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5246 for certain kinds of expressions which are not really lvalues
5247 but which we can accept as lvalues.
5249 If ARG is not a kind of expression we can handle, return
5253 unary_complex_lvalue (enum tree_code code
, tree arg
)
5255 /* Inside a template, making these kinds of adjustments is
5256 pointless; we are only concerned with the type of the
5258 if (processing_template_decl
)
5261 /* Handle (a, b) used as an "lvalue". */
5262 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5264 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5265 tf_warning_or_error
);
5266 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5267 TREE_OPERAND (arg
, 0), real_result
);
5270 /* Handle (a ? b : c) used as an "lvalue". */
5271 if (TREE_CODE (arg
) == COND_EXPR
5272 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5273 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5275 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5276 if (TREE_CODE (arg
) == MODIFY_EXPR
5277 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5278 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5280 tree lvalue
= TREE_OPERAND (arg
, 0);
5281 if (TREE_SIDE_EFFECTS (lvalue
))
5283 lvalue
= stabilize_reference (lvalue
);
5284 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5285 lvalue
, TREE_OPERAND (arg
, 1));
5287 return unary_complex_lvalue
5288 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5291 if (code
!= ADDR_EXPR
)
5294 /* Handle (a = b) used as an "lvalue" for `&'. */
5295 if (TREE_CODE (arg
) == MODIFY_EXPR
5296 || TREE_CODE (arg
) == INIT_EXPR
)
5298 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5299 tf_warning_or_error
);
5300 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5302 TREE_NO_WARNING (arg
) = 1;
5306 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5307 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5308 || TREE_CODE (arg
) == OFFSET_REF
)
5311 /* We permit compiler to make function calls returning
5312 objects of aggregate type look like lvalues. */
5316 if (TREE_CODE (targ
) == SAVE_EXPR
)
5317 targ
= TREE_OPERAND (targ
, 0);
5319 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5321 if (TREE_CODE (arg
) == SAVE_EXPR
)
5324 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5325 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5328 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5329 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5330 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5333 /* Don't let anything else be handled specially. */
5337 /* Mark EXP saying that we need to be able to take the
5338 address of it; it should not be allocated in a register.
5339 Value is true if successful.
5341 C++: we do not allow `current_class_ptr' to be addressable. */
5344 cxx_mark_addressable (tree exp
)
5349 switch (TREE_CODE (x
))
5356 x
= TREE_OPERAND (x
, 0);
5360 if (x
== current_class_ptr
)
5362 error ("cannot take the address of %<this%>, which is an rvalue expression");
5363 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5369 /* Caller should not be trying to mark initialized
5370 constant fields addressable. */
5371 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5372 || DECL_IN_AGGR_P (x
) == 0
5374 || DECL_EXTERNAL (x
));
5379 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5380 && !DECL_ARTIFICIAL (x
))
5382 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5385 ("address of explicit register variable %qD requested", x
);
5388 else if (extra_warnings
)
5390 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5392 TREE_ADDRESSABLE (x
) = 1;
5396 TREE_ADDRESSABLE (x
) = 1;
5400 TREE_ADDRESSABLE (x
) = 1;
5404 TREE_ADDRESSABLE (x
) = 1;
5405 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5413 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5416 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5417 tsubst_flags_t complain
)
5419 tree orig_ifexp
= ifexp
;
5420 tree orig_op1
= op1
;
5421 tree orig_op2
= op2
;
5424 if (processing_template_decl
)
5426 /* The standard says that the expression is type-dependent if
5427 IFEXP is type-dependent, even though the eventual type of the
5428 expression doesn't dependent on IFEXP. */
5429 if (type_dependent_expression_p (ifexp
)
5430 /* As a GNU extension, the middle operand may be omitted. */
5431 || (op1
&& type_dependent_expression_p (op1
))
5432 || type_dependent_expression_p (op2
))
5433 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5434 ifexp
= build_non_dependent_expr (ifexp
);
5436 op1
= build_non_dependent_expr (op1
);
5437 op2
= build_non_dependent_expr (op2
);
5440 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5441 if (processing_template_decl
&& expr
!= error_mark_node
)
5442 return build_min_non_dep (COND_EXPR
, expr
,
5443 orig_ifexp
, orig_op1
, orig_op2
);
5447 /* Given a list of expressions, return a compound expression
5448 that performs them all and returns the value of the last of them. */
5450 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5452 tree expr
= TREE_VALUE (list
);
5454 if (TREE_CHAIN (list
))
5457 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5459 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5460 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5461 tf_warning_or_error
);
5467 /* Like build_x_compound_expr_from_list, but using a VEC. */
5470 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5472 if (VEC_empty (tree
, vec
))
5474 else if (VEC_length (tree
, vec
) == 1)
5475 return VEC_index (tree
, vec
, 0);
5483 permerror (input_location
,
5484 "%s expression list treated as compound expression",
5487 expr
= VEC_index (tree
, vec
, 0);
5488 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5489 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5495 /* Handle overloading of the ',' operator when needed. */
5498 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5501 tree orig_op1
= op1
;
5502 tree orig_op2
= op2
;
5504 if (processing_template_decl
)
5506 if (type_dependent_expression_p (op1
)
5507 || type_dependent_expression_p (op2
))
5508 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5509 op1
= build_non_dependent_expr (op1
);
5510 op2
= build_non_dependent_expr (op2
);
5513 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5514 /*overloaded_p=*/NULL
, complain
);
5516 result
= cp_build_compound_expr (op1
, op2
, complain
);
5518 if (processing_template_decl
&& result
!= error_mark_node
)
5519 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5524 /* Like cp_build_compound_expr, but for the c-common bits. */
5527 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5529 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5532 /* Build a compound expression. */
5535 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5537 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5539 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5540 return error_mark_node
;
5542 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5544 /* If the rhs is a TARGET_EXPR, then build the compound
5545 expression inside the target_expr's initializer. This
5546 helps the compiler to eliminate unnecessary temporaries. */
5547 tree init
= TREE_OPERAND (rhs
, 1);
5549 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5550 TREE_OPERAND (rhs
, 1) = init
;
5555 if (type_unknown_p (rhs
))
5557 error ("no context to resolve type of %qE", rhs
);
5558 return error_mark_node
;
5561 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5564 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5565 casts away constness. CAST gives the type of cast.
5567 ??? This function warns for casting away any qualifier not just
5568 const. We would like to specify exactly what qualifiers are casted
5573 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5574 enum tree_code cast
)
5576 /* C-style casts are allowed to cast away constness. With
5577 WARN_CAST_QUAL, we still want to issue a warning. */
5578 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5581 if (!casts_away_constness (src_type
, dest_type
))
5587 warning (OPT_Wcast_qual
,
5588 "cast from type %qT to type %qT casts away qualifiers",
5589 src_type
, dest_type
);
5592 case STATIC_CAST_EXPR
:
5593 error ("static_cast from type %qT to type %qT casts away qualifiers",
5594 src_type
, dest_type
);
5597 case REINTERPRET_CAST_EXPR
:
5598 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5599 src_type
, dest_type
);
5606 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5607 (another pointer-to-member type in the same hierarchy) and return
5608 the converted expression. If ALLOW_INVERSE_P is permitted, a
5609 pointer-to-derived may be converted to pointer-to-base; otherwise,
5610 only the other direction is permitted. If C_CAST_P is true, this
5611 conversion is taking place as part of a C-style cast. */
5614 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5617 if (TYPE_PTRMEM_P (type
))
5621 if (TREE_CODE (expr
) == PTRMEM_CST
)
5622 expr
= cplus_expand_constant (expr
);
5623 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5624 TYPE_PTRMEM_CLASS_TYPE (type
),
5627 if (!integer_zerop (delta
))
5629 tree cond
, op1
, op2
;
5631 cond
= cp_build_binary_op (input_location
,
5634 build_int_cst (TREE_TYPE (expr
), -1),
5635 tf_warning_or_error
);
5636 op1
= build_nop (ptrdiff_type_node
, expr
);
5637 op2
= cp_build_binary_op (input_location
,
5638 PLUS_EXPR
, op1
, delta
,
5639 tf_warning_or_error
);
5641 expr
= fold_build3_loc (input_location
,
5642 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5646 return build_nop (type
, expr
);
5649 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5650 allow_inverse_p
, c_cast_p
);
5653 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5654 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5655 Otherwise, return EXPR unchanged. */
5658 ignore_overflows (tree expr
, tree orig
)
5660 if (TREE_CODE (expr
) == INTEGER_CST
5661 && CONSTANT_CLASS_P (orig
)
5662 && TREE_CODE (orig
) != STRING_CST
5663 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5665 if (!TREE_OVERFLOW (orig
))
5666 /* Ensure constant sharing. */
5667 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5668 TREE_INT_CST_LOW (expr
),
5669 TREE_INT_CST_HIGH (expr
));
5672 /* Avoid clobbering a shared constant. */
5673 expr
= copy_node (expr
);
5674 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5680 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5681 this static_cast is being attempted as one of the possible casts
5682 allowed by a C-style cast. (In that case, accessibility of base
5683 classes is not considered, and it is OK to cast away
5684 constness.) Return the result of the cast. *VALID_P is set to
5685 indicate whether or not the cast was valid. */
5688 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5689 bool *valid_p
, tsubst_flags_t complain
)
5695 /* Assume the cast is valid. */
5698 intype
= TREE_TYPE (expr
);
5700 /* Save casted types in the function's used types hash table. */
5701 used_types_insert (type
);
5703 /* [expr.static.cast]
5705 An lvalue of type "cv1 B", where B is a class type, can be cast
5706 to type "reference to cv2 D", where D is a class derived (clause
5707 _class.derived_) from B, if a valid standard conversion from
5708 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5709 same cv-qualification as, or greater cv-qualification than, cv1,
5710 and B is not a virtual base class of D. */
5711 /* We check this case before checking the validity of "TYPE t =
5712 EXPR;" below because for this case:
5715 struct D : public B { D(const B&); };
5717 void f() { static_cast<const D&>(b); }
5719 we want to avoid constructing a new D. The standard is not
5720 completely clear about this issue, but our interpretation is
5721 consistent with other compilers. */
5722 if (TREE_CODE (type
) == REFERENCE_TYPE
5723 && CLASS_TYPE_P (TREE_TYPE (type
))
5724 && CLASS_TYPE_P (intype
)
5725 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5726 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5727 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5728 build_pointer_type (TYPE_MAIN_VARIANT
5729 (TREE_TYPE (type
))))
5731 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5735 /* There is a standard conversion from "D*" to "B*" even if "B"
5736 is ambiguous or inaccessible. If this is really a
5737 static_cast, then we check both for inaccessibility and
5738 ambiguity. However, if this is a static_cast being performed
5739 because the user wrote a C-style cast, then accessibility is
5741 base
= lookup_base (TREE_TYPE (type
), intype
,
5742 c_cast_p
? ba_unique
: ba_check
,
5745 /* Convert from "B*" to "D*". This function will check that "B"
5746 is not a virtual base of "D". */
5747 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5748 base
, /*nonnull=*/false);
5749 /* Convert the pointer to a reference -- but then remember that
5750 there are no expressions with reference type in C++. */
5751 return convert_from_reference (cp_fold_convert (type
, expr
));
5754 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5755 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5756 if (TREE_CODE (type
) == REFERENCE_TYPE
5757 && TYPE_REF_IS_RVALUE (type
)
5758 && real_lvalue_p (expr
)
5759 && reference_related_p (TREE_TYPE (type
), intype
)
5760 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5762 expr
= build_typed_address (expr
, type
);
5763 return convert_from_reference (expr
);
5768 /* Resolve overloaded address here rather than once in
5769 implicit_conversion and again in the inverse code below. */
5770 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5772 expr
= instantiate_type (type
, expr
, complain
);
5773 intype
= TREE_TYPE (expr
);
5776 /* [expr.static.cast]
5778 An expression e can be explicitly converted to a type T using a
5779 static_cast of the form static_cast<T>(e) if the declaration T
5780 t(e);" is well-formed, for some invented temporary variable
5782 result
= perform_direct_initialization_if_possible (type
, expr
,
5783 c_cast_p
, complain
);
5786 result
= convert_from_reference (result
);
5788 /* Ignore any integer overflow caused by the cast. */
5789 result
= ignore_overflows (result
, orig
);
5791 /* [expr.static.cast]
5793 If T is a reference type, the result is an lvalue; otherwise,
5794 the result is an rvalue. */
5795 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5796 result
= rvalue (result
);
5800 /* [expr.static.cast]
5802 Any expression can be explicitly converted to type cv void. */
5803 if (TREE_CODE (type
) == VOID_TYPE
)
5804 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5806 /* [expr.static.cast]
5808 The inverse of any standard conversion sequence (clause _conv_),
5809 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5810 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5811 (_conv.bool_) conversions, can be performed explicitly using
5812 static_cast subject to the restriction that the explicit
5813 conversion does not cast away constness (_expr.const.cast_), and
5814 the following additional rules for specific cases: */
5815 /* For reference, the conversions not excluded are: integral
5816 promotions, floating point promotion, integral conversions,
5817 floating point conversions, floating-integral conversions,
5818 pointer conversions, and pointer to member conversions. */
5821 A value of integral _or enumeration_ type can be explicitly
5822 converted to an enumeration type. */
5823 /* The effect of all that is that any conversion between any two
5824 types which are integral, floating, or enumeration types can be
5826 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5827 || SCALAR_FLOAT_TYPE_P (type
))
5828 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5829 || SCALAR_FLOAT_TYPE_P (intype
)))
5831 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5833 /* Ignore any integer overflow caused by the cast. */
5834 expr
= ignore_overflows (expr
, orig
);
5838 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5839 && CLASS_TYPE_P (TREE_TYPE (type
))
5840 && CLASS_TYPE_P (TREE_TYPE (intype
))
5841 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5842 (TREE_TYPE (intype
))),
5843 build_pointer_type (TYPE_MAIN_VARIANT
5844 (TREE_TYPE (type
)))))
5849 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5850 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5851 c_cast_p
? ba_unique
: ba_check
,
5853 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5856 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5857 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5864 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5865 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5867 if (TYPE_PTRMEM_P (type
))
5869 t1
= (build_ptrmem_type
5871 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5872 t2
= (build_ptrmem_type
5874 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5881 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5884 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5885 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5890 /* [expr.static.cast]
5892 An rvalue of type "pointer to cv void" can be explicitly
5893 converted to a pointer to object type. A value of type pointer
5894 to object converted to "pointer to cv void" and back to the
5895 original pointer type will have its original value. */
5896 if (TREE_CODE (intype
) == POINTER_TYPE
5897 && VOID_TYPE_P (TREE_TYPE (intype
))
5898 && TYPE_PTROB_P (type
))
5901 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5902 return build_nop (type
, expr
);
5906 return error_mark_node
;
5909 /* Return an expression representing static_cast<TYPE>(EXPR). */
5912 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5917 if (type
== error_mark_node
|| expr
== error_mark_node
)
5918 return error_mark_node
;
5920 if (processing_template_decl
)
5922 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5923 /* We don't know if it will or will not have side effects. */
5924 TREE_SIDE_EFFECTS (expr
) = 1;
5925 return convert_from_reference (expr
);
5928 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5929 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5930 if (TREE_CODE (type
) != REFERENCE_TYPE
5931 && TREE_CODE (expr
) == NOP_EXPR
5932 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5933 expr
= TREE_OPERAND (expr
, 0);
5935 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5940 if (complain
& tf_error
)
5941 error ("invalid static_cast from type %qT to type %qT",
5942 TREE_TYPE (expr
), type
);
5943 return error_mark_node
;
5946 /* EXPR is an expression with member function or pointer-to-member
5947 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5948 not permitted by ISO C++, but we accept it in some modes. If we
5949 are not in one of those modes, issue a diagnostic. Return the
5950 converted expression. */
5953 convert_member_func_to_ptr (tree type
, tree expr
)
5958 intype
= TREE_TYPE (expr
);
5959 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5960 || TREE_CODE (intype
) == METHOD_TYPE
);
5962 if (pedantic
|| warn_pmf2ptr
)
5963 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5964 "converting from %qT to %qT", intype
, type
);
5966 if (TREE_CODE (intype
) == METHOD_TYPE
)
5967 expr
= build_addr_func (expr
);
5968 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5969 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5972 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5973 decl
= build_address (decl
);
5974 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5977 return build_nop (type
, expr
);
5980 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5981 If C_CAST_P is true, this reinterpret cast is being done as part of
5982 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5983 indicate whether or not reinterpret_cast was valid. */
5986 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5987 bool *valid_p
, tsubst_flags_t complain
)
5991 /* Assume the cast is invalid. */
5995 if (type
== error_mark_node
|| error_operand_p (expr
))
5996 return error_mark_node
;
5998 intype
= TREE_TYPE (expr
);
6000 /* Save casted types in the function's used types hash table. */
6001 used_types_insert (type
);
6003 /* [expr.reinterpret.cast]
6004 An lvalue expression of type T1 can be cast to the type
6005 "reference to T2" if an expression of type "pointer to T1" can be
6006 explicitly converted to the type "pointer to T2" using a
6007 reinterpret_cast. */
6008 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6010 if (! real_lvalue_p (expr
))
6012 if (complain
& tf_error
)
6013 error ("invalid cast of an rvalue expression of type "
6016 return error_mark_node
;
6019 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6020 "B" are related class types; the reinterpret_cast does not
6021 adjust the pointer. */
6022 if (TYPE_PTR_P (intype
)
6023 && (complain
& tf_warning
)
6024 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6025 COMPARE_BASE
| COMPARE_DERIVED
)))
6026 warning (0, "casting %qT to %qT does not dereference pointer",
6029 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6031 if (warn_strict_aliasing
> 2)
6032 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6034 if (expr
!= error_mark_node
)
6035 expr
= build_reinterpret_cast_1
6036 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6038 if (expr
!= error_mark_node
)
6039 /* cp_build_indirect_ref isn't right for rvalue refs. */
6040 expr
= convert_from_reference (fold_convert (type
, expr
));
6044 /* As a G++ extension, we consider conversions from member
6045 functions, and pointers to member functions to
6046 pointer-to-function and pointer-to-void types. If
6047 -Wno-pmf-conversions has not been specified,
6048 convert_member_func_to_ptr will issue an error message. */
6049 if ((TYPE_PTRMEMFUNC_P (intype
)
6050 || TREE_CODE (intype
) == METHOD_TYPE
)
6051 && TYPE_PTR_P (type
)
6052 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6053 || VOID_TYPE_P (TREE_TYPE (type
))))
6054 return convert_member_func_to_ptr (type
, expr
);
6056 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6057 array-to-pointer, and function-to-pointer conversions are
6059 expr
= decay_conversion (expr
);
6061 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6062 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6063 if (TREE_CODE (expr
) == NOP_EXPR
6064 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6065 expr
= TREE_OPERAND (expr
, 0);
6067 if (error_operand_p (expr
))
6068 return error_mark_node
;
6070 intype
= TREE_TYPE (expr
);
6072 /* [expr.reinterpret.cast]
6073 A pointer can be converted to any integral type large enough to
6074 hold it. ... A value of type std::nullptr_t can be converted to
6075 an integral type; the conversion has the same meaning and
6076 validity as a conversion of (void*)0 to the integral type. */
6077 if (CP_INTEGRAL_TYPE_P (type
)
6078 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6080 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6082 if (complain
& tf_error
)
6083 permerror (input_location
, "cast from %qT to %qT loses precision",
6086 return error_mark_node
;
6088 if (NULLPTR_TYPE_P (intype
))
6089 return build_int_cst (type
, 0);
6091 /* [expr.reinterpret.cast]
6092 A value of integral or enumeration type can be explicitly
6093 converted to a pointer. */
6094 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6097 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6098 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6099 return fold_if_not_in_template (build_nop (type
, expr
));
6100 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6101 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6106 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6107 /* Warn about possible alignment problems. */
6108 if (STRICT_ALIGNMENT
&& warn_cast_align
6109 && (complain
& tf_warning
)
6110 && !VOID_TYPE_P (type
)
6111 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6112 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6113 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6114 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6115 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6116 "increases required alignment of target type", intype
, type
);
6118 /* We need to strip nops here, because the front end likes to
6119 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6121 if (warn_strict_aliasing
<= 2)
6122 strict_aliasing_warning (intype
, type
, sexpr
);
6124 return fold_if_not_in_template (build_nop (type
, expr
));
6126 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6127 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6129 if (pedantic
&& (complain
& tf_warning
))
6130 /* Only issue a warning, as we have always supported this
6131 where possible, and it is necessary in some cases. DR 195
6132 addresses this issue, but as of 2004/10/26 is still in
6134 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6135 return fold_if_not_in_template (build_nop (type
, expr
));
6137 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6138 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6139 else if (TREE_CODE (intype
) == VECTOR_TYPE
6140 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6141 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6146 if (complain
& tf_error
)
6147 error ("invalid cast from type %qT to type %qT", intype
, type
);
6148 return error_mark_node
;
6151 return cp_convert (type
, expr
);
6155 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6157 if (type
== error_mark_node
|| expr
== error_mark_node
)
6158 return error_mark_node
;
6160 if (processing_template_decl
)
6162 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6164 if (!TREE_SIDE_EFFECTS (t
)
6165 && type_dependent_expression_p (expr
))
6166 /* There might turn out to be side effects inside expr. */
6167 TREE_SIDE_EFFECTS (t
) = 1;
6168 return convert_from_reference (t
);
6171 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6172 /*valid_p=*/NULL
, complain
);
6175 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6176 return an appropriate expression. Otherwise, return
6177 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6178 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6179 performing a C-style cast, its value upon return will indicate
6180 whether or not the conversion succeeded. */
6183 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6187 tree reference_type
;
6189 /* Callers are responsible for handling error_mark_node as a
6190 destination type. */
6191 gcc_assert (dst_type
!= error_mark_node
);
6192 /* In a template, callers should be building syntactic
6193 representations of casts, not using this machinery. */
6194 gcc_assert (!processing_template_decl
);
6196 /* Assume the conversion is invalid. */
6200 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6203 error ("invalid use of const_cast with type %qT, "
6204 "which is not a pointer, "
6205 "reference, nor a pointer-to-data-member type", dst_type
);
6206 return error_mark_node
;
6209 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6212 error ("invalid use of const_cast with type %qT, which is a pointer "
6213 "or reference to a function type", dst_type
);
6214 return error_mark_node
;
6217 /* Save casted types in the function's used types hash table. */
6218 used_types_insert (dst_type
);
6220 src_type
= TREE_TYPE (expr
);
6221 /* Expressions do not really have reference types. */
6222 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6223 src_type
= TREE_TYPE (src_type
);
6225 /* [expr.const.cast]
6227 An lvalue of type T1 can be explicitly converted to an lvalue of
6228 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6229 types) if a pointer to T1 can be explicitly converted to the type
6230 pointer to T2 using a const_cast. */
6231 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6233 reference_type
= dst_type
;
6234 if (! real_lvalue_p (expr
))
6237 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6238 src_type
, dst_type
);
6239 return error_mark_node
;
6241 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6242 src_type
= build_pointer_type (src_type
);
6246 reference_type
= NULL_TREE
;
6247 /* If the destination type is not a reference type, the
6248 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6249 conversions are performed. */
6250 src_type
= type_decays_to (src_type
);
6251 if (src_type
== error_mark_node
)
6252 return error_mark_node
;
6255 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6256 && comp_ptr_ttypes_const (dst_type
, src_type
))
6261 /* This cast is actually a C-style cast. Issue a warning if
6262 the user is making a potentially unsafe cast. */
6263 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6267 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6268 complain
? tf_warning_or_error
: tf_none
);
6269 expr
= build_nop (reference_type
, expr
);
6270 return convert_from_reference (expr
);
6274 expr
= decay_conversion (expr
);
6275 /* build_c_cast puts on a NOP_EXPR to make the result not an
6276 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6277 non-lvalue context. */
6278 if (TREE_CODE (expr
) == NOP_EXPR
6279 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6280 expr
= TREE_OPERAND (expr
, 0);
6281 return build_nop (dst_type
, expr
);
6286 error ("invalid const_cast from type %qT to type %qT",
6287 src_type
, dst_type
);
6288 return error_mark_node
;
6292 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6294 if (type
== error_mark_node
|| error_operand_p (expr
))
6295 return error_mark_node
;
6297 if (processing_template_decl
)
6299 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6301 if (!TREE_SIDE_EFFECTS (t
)
6302 && type_dependent_expression_p (expr
))
6303 /* There might turn out to be side effects inside expr. */
6304 TREE_SIDE_EFFECTS (t
) = 1;
6305 return convert_from_reference (t
);
6308 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6312 /* Like cp_build_c_cast, but for the c-common bits. */
6315 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6317 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6320 /* Build an expression representing an explicit C-style cast to type
6321 TYPE of expression EXPR. */
6324 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6330 if (type
== error_mark_node
|| error_operand_p (expr
))
6331 return error_mark_node
;
6333 if (processing_template_decl
)
6335 tree t
= build_min (CAST_EXPR
, type
,
6336 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6337 /* We don't know if it will or will not have side effects. */
6338 TREE_SIDE_EFFECTS (t
) = 1;
6339 return convert_from_reference (t
);
6342 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6343 'Class') should always be retained, because this information aids
6344 in method lookup. */
6345 if (objc_is_object_ptr (type
)
6346 && objc_is_object_ptr (TREE_TYPE (expr
)))
6347 return build_nop (type
, expr
);
6349 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6350 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6351 if (TREE_CODE (type
) != REFERENCE_TYPE
6352 && TREE_CODE (value
) == NOP_EXPR
6353 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6354 value
= TREE_OPERAND (value
, 0);
6356 if (TREE_CODE (type
) == ARRAY_TYPE
)
6358 /* Allow casting from T1* to T2[] because Cfront allows it.
6359 NIHCL uses it. It is not valid ISO C++ however. */
6360 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6362 if (complain
& tf_error
)
6363 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6365 return error_mark_node
;
6366 type
= build_pointer_type (TREE_TYPE (type
));
6370 if (complain
& tf_error
)
6371 error ("ISO C++ forbids casting to an array type %qT", type
);
6372 return error_mark_node
;
6376 if (TREE_CODE (type
) == FUNCTION_TYPE
6377 || TREE_CODE (type
) == METHOD_TYPE
)
6379 if (complain
& tf_error
)
6380 error ("invalid cast to function type %qT", type
);
6381 return error_mark_node
;
6384 if (TREE_CODE (type
) == POINTER_TYPE
6385 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6386 /* Casting to an integer of smaller size is an error detected elsewhere. */
6387 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6388 /* Don't warn about converting any constant. */
6389 && !TREE_CONSTANT (value
))
6390 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6391 "cast to pointer from integer of different size");
6393 /* A C-style cast can be a const_cast. */
6394 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6399 /* Or a static cast. */
6400 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6401 &valid_p
, complain
);
6402 /* Or a reinterpret_cast. */
6404 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6405 &valid_p
, complain
);
6406 /* The static_cast or reinterpret_cast may be followed by a
6409 /* A valid cast may result in errors if, for example, a
6410 conversion to am ambiguous base class is required. */
6411 && !error_operand_p (result
))
6415 /* Non-class rvalues always have cv-unqualified type. */
6416 if (!CLASS_TYPE_P (type
))
6417 type
= TYPE_MAIN_VARIANT (type
);
6418 result_type
= TREE_TYPE (result
);
6419 if (!CLASS_TYPE_P (result_type
))
6420 result_type
= TYPE_MAIN_VARIANT (result_type
);
6421 /* If the type of RESULT does not match TYPE, perform a
6422 const_cast to make it match. If the static_cast or
6423 reinterpret_cast succeeded, we will differ by at most
6424 cv-qualification, so the follow-on const_cast is guaranteed
6426 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6428 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6429 gcc_assert (valid_p
);
6434 return error_mark_node
;
6437 /* For use from the C common bits. */
6439 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6440 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6441 enum tree_code modifycode
,
6442 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6443 tree rhs_origtype ATTRIBUTE_UNUSED
)
6445 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6448 /* Build an assignment expression of lvalue LHS from value RHS.
6449 MODIFYCODE is the code for a binary operator that we use
6450 to combine the old value of LHS with RHS to get the new value.
6451 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6453 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6456 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6457 tsubst_flags_t complain
)
6461 tree lhstype
= TREE_TYPE (lhs
);
6462 tree olhstype
= lhstype
;
6463 bool plain_assign
= (modifycode
== NOP_EXPR
);
6465 /* Avoid duplicate error messages from operands that had errors. */
6466 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6467 return error_mark_node
;
6469 /* Handle control structure constructs used as "lvalues". */
6470 switch (TREE_CODE (lhs
))
6472 /* Handle --foo = 5; as these are valid constructs in C++. */
6473 case PREDECREMENT_EXPR
:
6474 case PREINCREMENT_EXPR
:
6475 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6476 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6477 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6478 TREE_OPERAND (lhs
, 1));
6479 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6480 modifycode
, rhs
, complain
);
6481 if (newrhs
== error_mark_node
)
6482 return error_mark_node
;
6483 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6485 /* Handle (a, b) used as an "lvalue". */
6487 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6488 modifycode
, rhs
, complain
);
6489 if (newrhs
== error_mark_node
)
6490 return error_mark_node
;
6491 return build2 (COMPOUND_EXPR
, lhstype
,
6492 TREE_OPERAND (lhs
, 0), newrhs
);
6495 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6496 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6497 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6498 TREE_OPERAND (lhs
, 1));
6499 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6501 if (newrhs
== error_mark_node
)
6502 return error_mark_node
;
6503 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6507 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6508 when neither operand has side-effects. */
6509 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6510 return error_mark_node
;
6512 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6513 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6515 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6516 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6518 TREE_OPERAND (lhs
, 0),
6519 TREE_OPERAND (lhs
, 1)),
6520 TREE_OPERAND (lhs
, 0),
6521 TREE_OPERAND (lhs
, 1));
6524 /* Handle (a ? b : c) used as an "lvalue". */
6527 /* Produce (a ? (b = rhs) : (c = rhs))
6528 except that the RHS goes through a save-expr
6529 so the code to compute it is only emitted once. */
6531 tree preeval
= NULL_TREE
;
6533 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6535 if (complain
& tf_error
)
6536 error ("void value not ignored as it ought to be");
6537 return error_mark_node
;
6540 rhs
= stabilize_expr (rhs
, &preeval
);
6542 /* Check this here to avoid odd errors when trying to convert
6543 a throw to the type of the COND_EXPR. */
6544 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6545 return error_mark_node
;
6547 cond
= build_conditional_expr
6548 (TREE_OPERAND (lhs
, 0),
6549 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6550 modifycode
, rhs
, complain
),
6551 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6552 modifycode
, rhs
, complain
),
6555 if (cond
== error_mark_node
)
6557 /* Make sure the code to compute the rhs comes out
6558 before the split. */
6560 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6568 if (modifycode
== INIT_EXPR
)
6570 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6571 /* Do the default thing. */;
6572 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6574 /* Compound literal. */
6575 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6576 /* Call convert to generate an error; see PR 11063. */
6577 rhs
= convert (lhstype
, rhs
);
6578 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6579 TREE_SIDE_EFFECTS (result
) = 1;
6582 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6583 /* Do the default thing. */;
6586 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6587 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6588 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6590 release_tree_vector (rhs_vec
);
6591 if (result
== NULL_TREE
)
6592 return error_mark_node
;
6598 lhs
= require_complete_type (lhs
);
6599 if (lhs
== error_mark_node
)
6600 return error_mark_node
;
6602 if (modifycode
== NOP_EXPR
)
6604 /* `operator=' is not an inheritable operator. */
6605 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6606 /* Do the default thing. */;
6609 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6610 lhs
, rhs
, make_node (NOP_EXPR
),
6611 /*overloaded_p=*/NULL
,
6613 if (result
== NULL_TREE
)
6614 return error_mark_node
;
6621 /* A binary op has been requested. Combine the old LHS
6622 value with the RHS producing the value we should actually
6623 store into the LHS. */
6624 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6625 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6626 || MAYBE_CLASS_TYPE_P (lhstype
)));
6628 lhs
= stabilize_reference (lhs
);
6629 newrhs
= cp_build_binary_op (input_location
,
6630 modifycode
, lhs
, rhs
,
6632 if (newrhs
== error_mark_node
)
6634 if (complain
& tf_error
)
6635 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6636 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6637 return error_mark_node
;
6640 /* Now it looks like a plain assignment. */
6641 modifycode
= NOP_EXPR
;
6643 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6644 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6647 /* The left-hand side must be an lvalue. */
6648 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6649 return error_mark_node
;
6651 /* Warn about modifying something that is `const'. Don't warn if
6652 this is initialization. */
6653 if (modifycode
!= INIT_EXPR
6654 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6655 /* Functions are not modifiable, even though they are
6657 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6658 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6659 /* If it's an aggregate and any field is const, then it is
6660 effectively const. */
6661 || (CLASS_TYPE_P (lhstype
)
6662 && C_TYPE_FIELDS_READONLY (lhstype
))))
6664 if (complain
& tf_error
)
6665 readonly_error (lhs
, REK_ASSIGNMENT
);
6667 return error_mark_node
;
6670 /* If storing into a structure or union member, it may have been given a
6671 lowered bitfield type. We need to convert to the declared type first,
6672 so retrieve it now. */
6674 olhstype
= unlowered_expr_type (lhs
);
6676 /* Convert new value to destination type. */
6678 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6682 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6684 if (modifycode
!= INIT_EXPR
)
6686 if (complain
& tf_error
)
6687 error ("assigning to an array from an initializer list");
6688 return error_mark_node
;
6690 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6691 return error_mark_node
;
6692 newrhs
= digest_init (lhstype
, newrhs
);
6695 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6696 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6698 if (complain
& tf_error
)
6699 error ("incompatible types in assignment of %qT to %qT",
6700 TREE_TYPE (rhs
), lhstype
);
6701 return error_mark_node
;
6704 /* Allow array assignment in compiler-generated code. */
6705 else if (!current_function_decl
6706 || !DECL_ARTIFICIAL (current_function_decl
))
6708 /* This routine is used for both initialization and assignment.
6709 Make sure the diagnostic message differentiates the context. */
6710 if (complain
& tf_error
)
6712 if (modifycode
== INIT_EXPR
)
6713 error ("array used as initializer");
6715 error ("invalid array assignment");
6717 return error_mark_node
;
6720 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6721 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6722 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6723 /*explicit_value_init_p=*/false,
6724 from_array
, complain
);
6727 if (modifycode
== INIT_EXPR
)
6728 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6729 LOOKUP_ONLYCONVERTING. */
6730 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6731 "initialization", NULL_TREE
, 0,
6734 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6735 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6737 if (!same_type_p (lhstype
, olhstype
))
6738 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6740 if (modifycode
!= INIT_EXPR
)
6742 if (TREE_CODE (newrhs
) == CALL_EXPR
6743 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6744 newrhs
= build_cplus_new (lhstype
, newrhs
);
6746 /* Can't initialize directly from a TARGET_EXPR, since that would
6747 cause the lhs to be constructed twice, and possibly result in
6748 accidental self-initialization. So we force the TARGET_EXPR to be
6749 expanded without a target. */
6750 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6751 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6752 TREE_OPERAND (newrhs
, 0));
6755 if (newrhs
== error_mark_node
)
6756 return error_mark_node
;
6758 if (c_dialect_objc () && flag_objc_gc
)
6760 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6766 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6767 lhstype
, lhs
, newrhs
);
6769 TREE_SIDE_EFFECTS (result
) = 1;
6771 TREE_NO_WARNING (result
) = 1;
6777 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6778 tsubst_flags_t complain
)
6780 if (processing_template_decl
)
6781 return build_min_nt (MODOP_EXPR
, lhs
,
6782 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6784 if (modifycode
!= NOP_EXPR
)
6786 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6787 make_node (modifycode
),
6788 /*overloaded_p=*/NULL
,
6792 TREE_NO_WARNING (rval
) = 1;
6796 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6799 /* Helper function for get_delta_difference which assumes FROM is a base
6800 class of TO. Returns a delta for the conversion of pointer-to-member
6801 of FROM to pointer-to-member of TO. If the conversion is invalid,
6802 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6803 If C_CAST_P is true, this conversion is taking place as part of a C-style
6807 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6812 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6813 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6815 error (" in pointer to member function conversion");
6816 return size_zero_node
;
6820 if (kind
!= bk_via_virtual
)
6821 return BINFO_OFFSET (binfo
);
6823 /* FROM is a virtual base class of TO. Issue an error or warning
6824 depending on whether or not this is a reinterpret cast. */
6826 error ("pointer to member conversion via virtual base %qT",
6827 BINFO_TYPE (binfo_from_vbase (binfo
)));
6829 return size_zero_node
;
6836 /* Get difference in deltas for different pointer to member function
6837 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6838 the conversion is invalid, the constant is zero. If
6839 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6840 If C_CAST_P is true this conversion is taking place as part of a
6843 Note that the naming of FROM and TO is kind of backwards; the return
6844 value is what we add to a TO in order to get a FROM. They are named
6845 this way because we call this function to find out how to convert from
6846 a pointer to member of FROM to a pointer to member of TO. */
6849 get_delta_difference (tree from
, tree to
,
6850 bool allow_inverse_p
,
6855 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6856 /* Pointer to member of incomplete class is permitted*/
6857 result
= size_zero_node
;
6859 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6863 if (!allow_inverse_p
)
6865 error_not_base_type (from
, to
);
6866 error (" in pointer to member conversion");
6867 result
= size_zero_node
;
6871 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6874 result
= size_diffop_loc (input_location
,
6875 size_zero_node
, result
);
6878 error_not_base_type (from
, to
);
6879 error (" in pointer to member conversion");
6880 result
= size_zero_node
;
6885 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6889 /* Return a constructor for the pointer-to-member-function TYPE using
6890 the other components as specified. */
6893 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6898 VEC(constructor_elt
, gc
) *v
;
6900 /* Pull the FIELD_DECLs out of the type. */
6901 pfn_field
= TYPE_FIELDS (type
);
6902 delta_field
= TREE_CHAIN (pfn_field
);
6904 /* Make sure DELTA has the type we want. */
6905 delta
= convert_and_check (delta_type_node
, delta
);
6907 /* Convert to the correct target type if necessary. */
6908 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6910 /* Finish creating the initializer. */
6911 v
= VEC_alloc(constructor_elt
, gc
, 2);
6912 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6913 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6914 u
= build_constructor (type
, v
);
6915 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6916 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6917 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6919 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6924 /* Build a constructor for a pointer to member function. It can be
6925 used to initialize global variables, local variable, or used
6926 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6929 If FORCE is nonzero, then force this conversion, even if
6930 we would rather not do it. Usually set when using an explicit
6931 cast. A C-style cast is being processed iff C_CAST_P is true.
6933 Return error_mark_node, if something goes wrong. */
6936 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6942 if (error_operand_p (pfn
))
6943 return error_mark_node
;
6945 pfn_type
= TREE_TYPE (pfn
);
6946 to_type
= build_ptrmemfunc_type (type
);
6948 /* Handle multiple conversions of pointer to member functions. */
6949 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6951 tree delta
= NULL_TREE
;
6952 tree npfn
= NULL_TREE
;
6956 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6957 error ("invalid conversion to type %qT from type %qT",
6960 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6961 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6965 /* We don't have to do any conversion to convert a
6966 pointer-to-member to its own type. But, we don't want to
6967 just return a PTRMEM_CST if there's an explicit cast; that
6968 cast should make the expression an invalid template argument. */
6969 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6971 if (same_type_p (to_type
, pfn_type
))
6973 else if (integer_zerop (n
))
6974 return build_reinterpret_cast (to_type
, pfn
,
6975 tf_warning_or_error
);
6978 if (TREE_SIDE_EFFECTS (pfn
))
6979 pfn
= save_expr (pfn
);
6981 /* Obtain the function pointer and the current DELTA. */
6982 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6983 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6986 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6987 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6990 /* Just adjust the DELTA field. */
6991 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6992 (TREE_TYPE (delta
), ptrdiff_type_node
));
6993 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6994 n
= cp_build_binary_op (input_location
,
6995 LSHIFT_EXPR
, n
, integer_one_node
,
6996 tf_warning_or_error
);
6997 delta
= cp_build_binary_op (input_location
,
6998 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6999 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7002 /* Handle null pointer to member function conversions. */
7003 if (integer_zerop (pfn
))
7005 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
7006 return build_ptrmemfunc1 (to_type
,
7011 if (type_unknown_p (pfn
))
7012 return instantiate_type (type
, pfn
, tf_warning_or_error
);
7014 fn
= TREE_OPERAND (pfn
, 0);
7015 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7016 /* In a template, we will have preserved the
7018 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
7019 return make_ptrmem_cst (to_type
, fn
);
7022 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7025 ??? There is no consistency as to the types returned for the above
7026 values. Some code acts as if it were a sizetype and some as if it were
7027 integer_type_node. */
7030 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7032 tree type
= TREE_TYPE (cst
);
7033 tree fn
= PTRMEM_CST_MEMBER (cst
);
7034 tree ptr_class
, fn_class
;
7036 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7038 /* The class that the function belongs to. */
7039 fn_class
= DECL_CONTEXT (fn
);
7041 /* The class that we're creating a pointer to member of. */
7042 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7044 /* First, calculate the adjustment to the function's class. */
7045 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7048 if (!DECL_VIRTUAL_P (fn
))
7049 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7052 /* If we're dealing with a virtual function, we have to adjust 'this'
7053 again, to point to the base which provides the vtable entry for
7054 fn; the call will do the opposite adjustment. */
7055 tree orig_class
= DECL_CONTEXT (fn
);
7056 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7057 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7058 *delta
, BINFO_OFFSET (binfo
));
7059 *delta
= fold_if_not_in_template (*delta
);
7061 /* We set PFN to the vtable offset at which the function can be
7062 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7063 case delta is shifted left, and then incremented). */
7064 *pfn
= DECL_VINDEX (fn
);
7065 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7066 TYPE_SIZE_UNIT (vtable_entry_type
));
7067 *pfn
= fold_if_not_in_template (*pfn
);
7069 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7071 case ptrmemfunc_vbit_in_pfn
:
7072 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7074 *pfn
= fold_if_not_in_template (*pfn
);
7077 case ptrmemfunc_vbit_in_delta
:
7078 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7079 *delta
, integer_one_node
);
7080 *delta
= fold_if_not_in_template (*delta
);
7081 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7082 *delta
, integer_one_node
);
7083 *delta
= fold_if_not_in_template (*delta
);
7090 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7091 *pfn
= fold_if_not_in_template (*pfn
);
7095 /* Return an expression for PFN from the pointer-to-member function
7099 pfn_from_ptrmemfunc (tree t
)
7101 if (TREE_CODE (t
) == PTRMEM_CST
)
7106 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7111 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7114 /* Return an expression for DELTA from the pointer-to-member function
7118 delta_from_ptrmemfunc (tree t
)
7120 if (TREE_CODE (t
) == PTRMEM_CST
)
7125 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7130 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7133 /* Convert value RHS to type TYPE as preparation for an assignment to
7134 an lvalue of type TYPE. ERRTYPE is a string to use in error
7135 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7136 are doing the conversion in order to pass the PARMNUMth argument of
7140 convert_for_assignment (tree type
, tree rhs
,
7141 const char *errtype
, tree fndecl
, int parmnum
,
7142 tsubst_flags_t complain
, int flags
)
7145 enum tree_code coder
;
7147 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7148 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7149 rhs
= TREE_OPERAND (rhs
, 0);
7151 rhstype
= TREE_TYPE (rhs
);
7152 coder
= TREE_CODE (rhstype
);
7154 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7155 && vector_types_convertible_p (type
, rhstype
, true))
7156 return convert (type
, rhs
);
7158 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7159 return error_mark_node
;
7160 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7161 return error_mark_node
;
7163 /* The RHS of an assignment cannot have void type. */
7164 if (coder
== VOID_TYPE
)
7166 if (complain
& tf_error
)
7167 error ("void value not ignored as it ought to be");
7168 return error_mark_node
;
7171 /* Simplify the RHS if possible. */
7172 if (TREE_CODE (rhs
) == CONST_DECL
)
7173 rhs
= DECL_INITIAL (rhs
);
7175 if (c_dialect_objc ())
7178 tree rname
= fndecl
;
7180 if (!strcmp (errtype
, "assignment"))
7182 else if (!strcmp (errtype
, "initialization"))
7186 tree selector
= objc_message_selector ();
7190 if (selector
&& parmno
> 1)
7197 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7198 return convert (type
, rhs
);
7203 The expression is implicitly converted (clause _conv_) to the
7204 cv-unqualified type of the left operand.
7206 We allow bad conversions here because by the time we get to this point
7207 we are committed to doing the conversion. If we end up doing a bad
7208 conversion, convert_like will complain. */
7209 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7211 /* When -Wno-pmf-conversions is use, we just silently allow
7212 conversions from pointers-to-members to plain pointers. If
7213 the conversion doesn't work, cp_convert will complain. */
7215 && TYPE_PTR_P (type
)
7216 && TYPE_PTRMEMFUNC_P (rhstype
))
7217 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7220 if (complain
& tf_error
)
7222 /* If the right-hand side has unknown type, then it is an
7223 overloaded function. Call instantiate_type to get error
7225 if (rhstype
== unknown_type_node
)
7226 instantiate_type (type
, rhs
, tf_warning_or_error
);
7228 error ("cannot convert %qT to %qT for argument %qP to %qD",
7229 rhstype
, type
, parmnum
, fndecl
);
7231 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7234 return error_mark_node
;
7237 if (warn_missing_format_attribute
)
7239 const enum tree_code codel
= TREE_CODE (type
);
7240 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7242 && check_missing_format_attribute (type
, rhstype
)
7243 && (complain
& tf_warning
))
7244 warning (OPT_Wmissing_format_attribute
,
7245 "%s might be a candidate for a format attribute",
7249 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7251 if (warn_parentheses
7252 && TREE_CODE (type
) == BOOLEAN_TYPE
7253 && TREE_CODE (rhs
) == MODIFY_EXPR
7254 && !TREE_NO_WARNING (rhs
)
7255 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7256 && (complain
& tf_warning
))
7258 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7259 ? EXPR_LOCATION (rhs
) : input_location
;
7261 warning_at (loc
, OPT_Wparentheses
,
7262 "suggest parentheses around assignment used as truth value");
7263 TREE_NO_WARNING (rhs
) = 1;
7266 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7270 /* Convert RHS to be of type TYPE.
7271 If EXP is nonzero, it is the target of the initialization.
7272 ERRTYPE is a string to use in error messages.
7274 Two major differences between the behavior of
7275 `convert_for_assignment' and `convert_for_initialization'
7276 are that references are bashed in the former, while
7277 copied in the latter, and aggregates are assigned in
7278 the former (operator=) while initialized in the
7281 If using constructor make sure no conversion operator exists, if one does
7282 exist, an ambiguity exists.
7284 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7287 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7288 const char *errtype
, tree fndecl
, int parmnum
,
7289 tsubst_flags_t complain
)
7291 enum tree_code codel
= TREE_CODE (type
);
7293 enum tree_code coder
;
7295 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7296 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7297 if (TREE_CODE (rhs
) == NOP_EXPR
7298 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7299 && codel
!= REFERENCE_TYPE
)
7300 rhs
= TREE_OPERAND (rhs
, 0);
7302 if (type
== error_mark_node
7303 || rhs
== error_mark_node
7304 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7305 return error_mark_node
;
7307 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7308 && TREE_CODE (type
) != ARRAY_TYPE
7309 && (TREE_CODE (type
) != REFERENCE_TYPE
7310 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7311 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7312 && (TREE_CODE (type
) != REFERENCE_TYPE
7313 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7314 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7315 rhs
= decay_conversion (rhs
);
7317 rhstype
= TREE_TYPE (rhs
);
7318 coder
= TREE_CODE (rhstype
);
7320 if (coder
== ERROR_MARK
)
7321 return error_mark_node
;
7323 /* We accept references to incomplete types, so we can
7324 return here before checking if RHS is of complete type. */
7326 if (codel
== REFERENCE_TYPE
)
7328 /* This should eventually happen in convert_arguments. */
7329 int savew
= 0, savee
= 0;
7332 savew
= warningcount
, savee
= errorcount
;
7333 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7334 /*cleanup=*/NULL
, complain
);
7337 if (warningcount
> savew
)
7338 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7339 else if (errorcount
> savee
)
7340 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7346 exp
= require_complete_type (exp
);
7347 if (exp
== error_mark_node
)
7348 return error_mark_node
;
7350 rhstype
= non_reference (rhstype
);
7352 type
= complete_type (type
);
7354 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7355 /* Don't try to do copy-initialization if we already have
7356 direct-initialization. */
7359 if (MAYBE_CLASS_TYPE_P (type
))
7360 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7362 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7366 /* If RETVAL is the address of, or a reference to, a local variable or
7367 temporary give an appropriate warning. */
7370 maybe_warn_about_returning_address_of_local (tree retval
)
7372 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7373 tree whats_returned
= retval
;
7377 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7378 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7379 else if (CONVERT_EXPR_P (whats_returned
)
7380 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7381 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7386 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7388 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7390 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7392 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7393 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7395 warning (0, "returning reference to temporary");
7398 if (TREE_CODE (whats_returned
) == VAR_DECL
7399 && DECL_NAME (whats_returned
)
7400 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7402 warning (0, "reference to non-lvalue returned");
7407 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7408 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7409 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7411 if (DECL_P (whats_returned
)
7412 && DECL_NAME (whats_returned
)
7413 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7414 && !(TREE_STATIC (whats_returned
)
7415 || TREE_PUBLIC (whats_returned
)))
7417 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7418 warning (0, "reference to local variable %q+D returned",
7421 warning (0, "address of local variable %q+D returned",
7427 /* Check that returning RETVAL from the current function is valid.
7428 Return an expression explicitly showing all conversions required to
7429 change RETVAL into the function return type, and to assign it to
7430 the DECL_RESULT for the function. Set *NO_WARNING to true if
7431 code reaches end of non-void function warning shouldn't be issued
7432 on this RETURN_EXPR. */
7435 check_return_expr (tree retval
, bool *no_warning
)
7438 /* The type actually returned by the function, after any
7441 int fn_returns_value_p
;
7442 bool named_return_value_okay_p
;
7444 *no_warning
= false;
7446 /* A `volatile' function is one that isn't supposed to return, ever.
7447 (This is a G++ extension, used to get better code for functions
7448 that call the `volatile' function.) */
7449 if (TREE_THIS_VOLATILE (current_function_decl
))
7450 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7452 /* Check for various simple errors. */
7453 if (DECL_DESTRUCTOR_P (current_function_decl
))
7456 error ("returning a value from a destructor");
7459 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7461 if (in_function_try_handler
)
7462 /* If a return statement appears in a handler of the
7463 function-try-block of a constructor, the program is ill-formed. */
7464 error ("cannot return from a handler of a function-try-block of a constructor");
7466 /* You can't return a value from a constructor. */
7467 error ("returning a value from a constructor");
7471 /* As an extension, deduce lambda return type from a return statement
7472 anywhere in the body. */
7473 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7475 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7476 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7478 tree type
= lambda_return_type (retval
);
7479 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7481 if (VOID_TYPE_P (type
))
7483 else if (oldtype
== NULL_TREE
)
7485 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7486 "can only be deduced when the return statement is "
7487 "the only statement in the function body");
7488 apply_lambda_return_type (lambda
, type
);
7490 else if (!same_type_p (type
, oldtype
))
7491 error ("inconsistent types %qT and %qT deduced for "
7492 "lambda return type", type
, oldtype
);
7496 if (processing_template_decl
)
7498 current_function_returns_value
= 1;
7499 if (check_for_bare_parameter_packs (retval
))
7500 retval
= error_mark_node
;
7504 /* When no explicit return-value is given in a function with a named
7505 return value, the named return value is used. */
7506 result
= DECL_RESULT (current_function_decl
);
7507 valtype
= TREE_TYPE (result
);
7508 gcc_assert (valtype
!= NULL_TREE
);
7509 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7510 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7513 /* Check for a return statement with no return value in a function
7514 that's supposed to return a value. */
7515 if (!retval
&& fn_returns_value_p
)
7517 permerror (input_location
, "return-statement with no value, in function returning %qT",
7519 /* Clear this, so finish_function won't say that we reach the
7520 end of a non-void function (which we don't, we gave a
7522 current_function_returns_null
= 0;
7523 /* And signal caller that TREE_NO_WARNING should be set on the
7524 RETURN_EXPR to avoid control reaches end of non-void function
7525 warnings in tree-cfg.c. */
7528 /* Check for a return statement with a value in a function that
7529 isn't supposed to return a value. */
7530 else if (retval
&& !fn_returns_value_p
)
7532 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7533 /* You can return a `void' value from a function of `void'
7534 type. In that case, we have to evaluate the expression for
7535 its side-effects. */
7536 finish_expr_stmt (retval
);
7538 permerror (input_location
, "return-statement with a value, in function "
7539 "returning 'void'");
7540 current_function_returns_null
= 1;
7542 /* There's really no value to return, after all. */
7546 /* Remember that this function can sometimes return without a
7548 current_function_returns_null
= 1;
7550 /* Remember that this function did return a value. */
7551 current_function_returns_value
= 1;
7553 /* Check for erroneous operands -- but after giving ourselves a
7554 chance to provide an error about returning a value from a void
7556 if (error_operand_p (retval
))
7558 current_function_return_value
= error_mark_node
;
7559 return error_mark_node
;
7562 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7563 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7564 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7565 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7567 && retval
&& null_ptr_cst_p (retval
))
7568 warning (0, "%<operator new%> must not return NULL unless it is "
7569 "declared %<throw()%> (or -fcheck-new is in effect)");
7571 /* Effective C++ rule 15. See also start_function. */
7573 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7577 /* The function return type must be a reference to the current
7579 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7580 && same_type_ignoring_top_level_qualifiers_p
7581 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7583 /* Returning '*this' is obviously OK. */
7584 if (retval
== current_class_ref
)
7586 /* If we are calling a function whose return type is the same of
7587 the current class reference, it is ok. */
7588 else if (TREE_CODE (retval
) == INDIRECT_REF
7589 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7594 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7597 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7599 [...] For a function with a class return type, if the expression
7600 in the return statement is the name of a local object, and the cv-
7601 unqualified type of the local object is the same as the function
7602 return type, an implementation is permitted to omit creating the tem-
7603 porary object to hold the function return value [...]
7605 So, if this is a value-returning function that always returns the same
7606 local variable, remember it.
7608 It might be nice to be more flexible, and choose the first suitable
7609 variable even if the function sometimes returns something else, but
7610 then we run the risk of clobbering the variable we chose if the other
7611 returned expression uses the chosen variable somehow. And people expect
7612 this restriction, anyway. (jason 2000-11-19)
7614 See finish_function and finalize_nrv for the rest of this optimization. */
7616 named_return_value_okay_p
=
7617 (retval
!= NULL_TREE
7618 /* Must be a local, automatic variable. */
7619 && TREE_CODE (retval
) == VAR_DECL
7620 && DECL_CONTEXT (retval
) == current_function_decl
7621 && ! TREE_STATIC (retval
)
7622 && ! DECL_ANON_UNION_VAR_P (retval
)
7623 && (DECL_ALIGN (retval
)
7624 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7625 /* The cv-unqualified type of the returned value must be the
7626 same as the cv-unqualified return type of the
7628 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7630 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7631 /* And the returned value must be non-volatile. */
7632 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7634 if (fn_returns_value_p
&& flag_elide_constructors
)
7636 if (named_return_value_okay_p
7637 && (current_function_return_value
== NULL_TREE
7638 || current_function_return_value
== retval
))
7639 current_function_return_value
= retval
;
7641 current_function_return_value
= error_mark_node
;
7644 /* We don't need to do any conversions when there's nothing being
7649 /* Do any required conversions. */
7650 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7651 /* No conversions are required. */
7655 /* The type the function is declared to return. */
7656 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7657 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7659 /* The functype's return type will have been set to void, if it
7660 was an incomplete type. Just treat this as 'return;' */
7661 if (VOID_TYPE_P (functype
))
7662 return error_mark_node
;
7664 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7665 treated as an rvalue for the purposes of overload resolution to
7666 favor move constructors over copy constructors. */
7667 if ((cxx_dialect
!= cxx98
)
7668 && named_return_value_okay_p
7669 /* The variable must not have the `volatile' qualifier. */
7670 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7671 /* The return type must be a class type. */
7672 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7673 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7675 /* First convert the value to the function's return type, then
7676 to the type of return value's location to handle the
7677 case that functype is smaller than the valtype. */
7678 retval
= convert_for_initialization
7679 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7680 tf_warning_or_error
);
7681 retval
= convert (valtype
, retval
);
7683 /* If the conversion failed, treat this just like `return;'. */
7684 if (retval
== error_mark_node
)
7686 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7687 else if (! cfun
->returns_struct
7688 && TREE_CODE (retval
) == TARGET_EXPR
7689 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7690 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7691 TREE_OPERAND (retval
, 0));
7693 maybe_warn_about_returning_address_of_local (retval
);
7696 /* Actually copy the value returned into the appropriate location. */
7697 if (retval
&& retval
!= result
)
7698 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7704 /* Returns nonzero if the pointer-type FROM can be converted to the
7705 pointer-type TO via a qualification conversion. If CONSTP is -1,
7706 then we return nonzero if the pointers are similar, and the
7707 cv-qualification signature of FROM is a proper subset of that of TO.
7709 If CONSTP is positive, then all outer pointers have been
7713 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7715 bool to_more_cv_qualified
= false;
7716 bool is_opaque_pointer
= false;
7718 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7720 if (TREE_CODE (to
) != TREE_CODE (from
))
7723 if (TREE_CODE (from
) == OFFSET_TYPE
7724 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7725 TYPE_OFFSET_BASETYPE (to
)))
7728 /* Const and volatile mean something different for function types,
7729 so the usual checks are not appropriate. */
7730 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7732 /* In Objective-C++, some types may have been 'volatilized' by
7733 the compiler for EH; when comparing them here, the volatile
7734 qualification must be ignored. */
7735 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7737 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7740 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7744 to_more_cv_qualified
= true;
7748 constp
&= TYPE_READONLY (to
);
7751 if (TREE_CODE (to
) == VECTOR_TYPE
)
7752 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7754 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7755 return ((constp
>= 0 || to_more_cv_qualified
)
7756 && (is_opaque_pointer
7757 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7761 /* When comparing, say, char ** to char const **, this function takes
7762 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7763 types to this function. */
7766 comp_ptr_ttypes (tree to
, tree from
)
7768 return comp_ptr_ttypes_real (to
, from
, 1);
7771 /* Returns true iff FNTYPE is a non-class type that involves
7772 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7773 if a parameter type is ill-formed. */
7776 error_type_p (const_tree type
)
7780 switch (TREE_CODE (type
))
7786 case REFERENCE_TYPE
:
7788 return error_type_p (TREE_TYPE (type
));
7792 if (error_type_p (TREE_TYPE (type
)))
7794 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7795 if (error_type_p (TREE_VALUE (t
)))
7800 if (TYPE_PTRMEMFUNC_P (type
))
7801 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7809 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7810 type or inheritance-related types, regardless of cv-quals. */
7813 ptr_reasonably_similar (const_tree to
, const_tree from
)
7815 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7817 /* Any target type is similar enough to void. */
7818 if (TREE_CODE (to
) == VOID_TYPE
)
7819 return !error_type_p (from
);
7820 if (TREE_CODE (from
) == VOID_TYPE
)
7821 return !error_type_p (to
);
7823 if (TREE_CODE (to
) != TREE_CODE (from
))
7826 if (TREE_CODE (from
) == OFFSET_TYPE
7827 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7828 TYPE_OFFSET_BASETYPE (from
),
7829 COMPARE_BASE
| COMPARE_DERIVED
))
7832 if (TREE_CODE (to
) == VECTOR_TYPE
7833 && vector_types_convertible_p (to
, from
, false))
7836 if (TREE_CODE (to
) == INTEGER_TYPE
7837 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7840 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7841 return !error_type_p (to
) && !error_type_p (from
);
7843 if (TREE_CODE (to
) != POINTER_TYPE
)
7845 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7846 COMPARE_BASE
| COMPARE_DERIVED
);
7850 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7851 pointer-to-member types) are the same, ignoring cv-qualification at
7855 comp_ptr_ttypes_const (tree to
, tree from
)
7857 bool is_opaque_pointer
= false;
7859 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7861 if (TREE_CODE (to
) != TREE_CODE (from
))
7864 if (TREE_CODE (from
) == OFFSET_TYPE
7865 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7866 TYPE_OFFSET_BASETYPE (to
)))
7869 if (TREE_CODE (to
) == VECTOR_TYPE
)
7870 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7872 if (TREE_CODE (to
) != POINTER_TYPE
)
7873 return (is_opaque_pointer
7874 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7878 /* Returns the type qualifiers for this type, including the qualifiers on the
7879 elements for an array type. */
7882 cp_type_quals (const_tree type
)
7885 /* This CONST_CAST is okay because strip_array_types returns its
7886 argument unmodified and we assign it to a const_tree. */
7887 type
= strip_array_types (CONST_CAST_TREE (type
));
7888 if (type
== error_mark_node
7889 /* Quals on a FUNCTION_TYPE are memfn quals. */
7890 || TREE_CODE (type
) == FUNCTION_TYPE
)
7891 return TYPE_UNQUALIFIED
;
7892 quals
= TYPE_QUALS (type
);
7893 /* METHOD and REFERENCE_TYPEs should never have quals. */
7894 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7895 && TREE_CODE (type
) != REFERENCE_TYPE
)
7896 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7897 == TYPE_UNQUALIFIED
));
7901 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7905 type_memfn_quals (const_tree type
)
7907 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7908 return TYPE_QUALS (type
);
7909 else if (TREE_CODE (type
) == METHOD_TYPE
)
7910 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
7915 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7919 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
7921 /* Could handle METHOD_TYPE here if necessary. */
7922 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7923 if (TYPE_QUALS (type
) == memfn_quals
)
7925 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7927 return build_qualified_type (type
, memfn_quals
);
7930 /* Returns nonzero if TYPE is const or volatile. */
7933 cv_qualified_p (const_tree type
)
7935 int quals
= cp_type_quals (type
);
7936 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7939 /* Returns nonzero if the TYPE contains a mutable member. */
7942 cp_has_mutable_p (const_tree type
)
7944 /* This CONST_CAST is okay because strip_array_types returns its
7945 argument unmodified and we assign it to a const_tree. */
7946 type
= strip_array_types (CONST_CAST_TREE(type
));
7948 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7951 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7952 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7953 approximation. In particular, consider:
7956 struct S { int i; };
7957 const S s = { f(); }
7959 Here, we will make "s" as TREE_READONLY (because it is declared
7960 "const") -- only to reverse ourselves upon seeing that the
7961 initializer is non-constant. */
7964 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7966 tree type
= TREE_TYPE (decl
);
7968 if (type
== error_mark_node
)
7971 if (TREE_CODE (decl
) == TYPE_DECL
)
7974 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
7975 && type_quals
!= TYPE_UNQUALIFIED
));
7977 /* Avoid setting TREE_READONLY incorrectly. */
7978 if (/* If the object has a constructor, the constructor may modify
7980 TYPE_NEEDS_CONSTRUCTING (type
)
7981 /* If the type isn't complete, we don't know yet if it will need
7983 || !COMPLETE_TYPE_P (type
)
7984 /* If the type has a mutable component, that component might be
7986 || TYPE_HAS_MUTABLE_P (type
))
7987 type_quals
&= ~TYPE_QUAL_CONST
;
7989 c_apply_type_quals_to_decl (type_quals
, decl
);
7992 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7993 exemplar types such that casting T1 to T2 is casting away constness
7994 if and only if there is no implicit conversion from T1 to T2. */
7997 casts_away_constness_r (tree
*t1
, tree
*t2
)
8002 /* [expr.const.cast]
8004 For multi-level pointer to members and multi-level mixed pointers
8005 and pointers to members (conv.qual), the "member" aspect of a
8006 pointer to member level is ignored when determining if a const
8007 cv-qualifier has been cast away. */
8008 /* [expr.const.cast]
8010 For two pointer types:
8012 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8013 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8016 casting from X1 to X2 casts away constness if, for a non-pointer
8017 type T there does not exist an implicit conversion (clause
8020 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8024 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8025 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8026 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8028 *t1
= cp_build_qualified_type (void_type_node
,
8029 cp_type_quals (*t1
));
8030 *t2
= cp_build_qualified_type (void_type_node
,
8031 cp_type_quals (*t2
));
8035 quals1
= cp_type_quals (*t1
);
8036 quals2
= cp_type_quals (*t2
);
8038 if (TYPE_PTRMEM_P (*t1
))
8039 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8041 *t1
= TREE_TYPE (*t1
);
8042 if (TYPE_PTRMEM_P (*t2
))
8043 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8045 *t2
= TREE_TYPE (*t2
);
8047 casts_away_constness_r (t1
, t2
);
8048 *t1
= build_pointer_type (*t1
);
8049 *t2
= build_pointer_type (*t2
);
8050 *t1
= cp_build_qualified_type (*t1
, quals1
);
8051 *t2
= cp_build_qualified_type (*t2
, quals2
);
8054 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8057 ??? This function returns non-zero if casting away qualifiers not
8058 just const. We would like to return to the caller exactly which
8059 qualifiers are casted away to give more accurate diagnostics.
8063 casts_away_constness (tree t1
, tree t2
)
8065 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8067 /* [expr.const.cast]
8069 Casting from an lvalue of type T1 to an lvalue of type T2
8070 using a reference cast casts away constness if a cast from an
8071 rvalue of type "pointer to T1" to the type "pointer to T2"
8072 casts away constness. */
8073 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8074 return casts_away_constness (build_pointer_type (t1
),
8075 build_pointer_type (TREE_TYPE (t2
)));
8078 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8079 /* [expr.const.cast]
8081 Casting from an rvalue of type "pointer to data member of X
8082 of type T1" to the type "pointer to data member of Y of type
8083 T2" casts away constness if a cast from an rvalue of type
8084 "pointer to T1" to the type "pointer to T2" casts away
8086 return casts_away_constness
8087 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8088 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8090 /* Casting away constness is only something that makes sense for
8091 pointer or reference types. */
8092 if (TREE_CODE (t1
) != POINTER_TYPE
8093 || TREE_CODE (t2
) != POINTER_TYPE
)
8096 /* Top-level qualifiers don't matter. */
8097 t1
= TYPE_MAIN_VARIANT (t1
);
8098 t2
= TYPE_MAIN_VARIANT (t2
);
8099 casts_away_constness_r (&t1
, &t2
);
8100 if (!can_convert (t2
, t1
))
8106 /* If T is a REFERENCE_TYPE return the type to which T refers.
8107 Otherwise, return T itself. */
8110 non_reference (tree t
)
8112 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8118 /* Return nonzero if REF is an lvalue valid for this language;
8119 otherwise, print an error message and return zero. USE says
8120 how the lvalue is being used and so selects the error message. */
8123 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8125 int win
= lvalue_p (ref
);
8127 if (!win
&& (complain
& tf_error
))