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
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"
41 #include "diagnostic.h"
48 static tree
pfn_from_ptrmemfunc (tree
);
49 static tree
delta_from_ptrmemfunc (tree
);
50 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
52 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
53 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
55 static int comp_ptr_ttypes_real (tree
, tree
, int);
56 static bool comp_except_types (tree
, tree
, bool);
57 static bool comp_array_types (const_tree
, const_tree
, bool);
58 static tree
pointer_diff (tree
, tree
, tree
);
59 static tree
get_delta_difference (tree
, tree
, bool, bool);
60 static void casts_away_constness_r (tree
*, tree
*);
61 static bool casts_away_constness (tree
, tree
);
62 static void maybe_warn_about_returning_address_of_local (tree
);
63 static tree
lookup_destructor (tree
, tree
, tree
);
64 static int convert_arguments (int, tree
*, tree
, tree
, tree
, int,
67 /* Do `exp = require_complete_type (exp);' to make sure exp
68 does not have an incomplete type. (That includes void types.)
69 Returns the error_mark_node if the VALUE does not have
70 complete type when this function returns. */
73 require_complete_type (tree value
)
77 if (processing_template_decl
|| value
== error_mark_node
)
80 if (TREE_CODE (value
) == OVERLOAD
)
81 type
= unknown_type_node
;
83 type
= TREE_TYPE (value
);
85 if (type
== error_mark_node
)
86 return error_mark_node
;
88 /* First, detect a valid value with a complete type. */
89 if (COMPLETE_TYPE_P (type
))
92 if (complete_type_or_else (type
, value
))
95 return error_mark_node
;
98 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
99 a template instantiation, do the instantiation. Returns TYPE,
100 whether or not it could be completed, unless something goes
101 horribly wrong, in which case the error_mark_node is returned. */
104 complete_type (tree type
)
106 if (type
== NULL_TREE
)
107 /* Rather than crash, we return something sure to cause an error
109 return error_mark_node
;
111 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
113 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
115 tree t
= complete_type (TREE_TYPE (type
));
116 unsigned int needs_constructing
, has_nontrivial_dtor
;
117 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
120 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
122 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
123 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
125 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
126 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
129 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
130 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
135 /* Like complete_type, but issue an error if the TYPE cannot be completed.
136 VALUE is used for informative diagnostics.
137 Returns NULL_TREE if the type cannot be made complete. */
140 complete_type_or_else (tree type
, tree value
)
142 type
= complete_type (type
);
143 if (type
== error_mark_node
)
144 /* We already issued an error. */
146 else if (!COMPLETE_TYPE_P (type
))
148 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
155 /* Return truthvalue of whether type of EXP is instantiated. */
158 type_unknown_p (const_tree exp
)
160 return (TREE_CODE (exp
) == TREE_LIST
161 || TREE_TYPE (exp
) == unknown_type_node
);
165 /* Return the common type of two parameter lists.
166 We assume that comptypes has already been done and returned 1;
167 if that isn't so, this may crash.
169 As an optimization, free the space we allocate if the parameter
170 lists are already common. */
173 commonparms (tree p1
, tree p2
)
175 tree oldargs
= p1
, newargs
, n
;
179 len
= list_length (p1
);
180 newargs
= tree_last (p1
);
182 if (newargs
== void_list_node
)
191 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
196 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
198 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
200 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
203 else if (! TREE_PURPOSE (p1
))
205 if (TREE_PURPOSE (p2
))
207 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
213 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
215 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
217 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
220 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
223 TREE_VALUE (n
) = TREE_VALUE (p1
);
231 /* Given a type, perhaps copied for a typedef,
232 find the "original" version of it. */
234 original_type (tree t
)
236 int quals
= cp_type_quals (t
);
237 while (t
!= error_mark_node
238 && TYPE_NAME (t
) != NULL_TREE
)
240 tree x
= TYPE_NAME (t
);
241 if (TREE_CODE (x
) != TYPE_DECL
)
243 x
= DECL_ORIGINAL_TYPE (x
);
248 return cp_build_qualified_type (t
, quals
);
251 /* Return the common type for two arithmetic types T1 and T2 under the
252 usual arithmetic conversions. The default conversions have already
253 been applied, and enumerated types converted to their compatible
257 cp_common_type (tree t1
, tree t2
)
259 enum tree_code code1
= TREE_CODE (t1
);
260 enum tree_code code2
= TREE_CODE (t2
);
263 /* FIXME: Attributes. */
264 gcc_assert (ARITHMETIC_TYPE_P (t1
)
265 || TREE_CODE (t1
) == VECTOR_TYPE
266 || UNSCOPED_ENUM_P (t1
));
267 gcc_assert (ARITHMETIC_TYPE_P (t2
)
268 || TREE_CODE (t2
) == VECTOR_TYPE
269 || UNSCOPED_ENUM_P (t2
));
271 /* In what follows, we slightly generalize the rules given in [expr] so
272 as to deal with `long long' and `complex'. First, merge the
274 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
276 /* If one type is complex, form the common type of the non-complex
277 components, then make that complex. Use T1 or T2 if it is the
279 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
281 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
282 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
284 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
286 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
287 return build_type_attribute_variant (t1
, attributes
);
288 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
289 return build_type_attribute_variant (t2
, attributes
);
291 return build_type_attribute_variant (build_complex_type (subtype
),
295 if (code1
== VECTOR_TYPE
)
297 /* When we get here we should have two vectors of the same size.
298 Just prefer the unsigned one if present. */
299 if (TYPE_UNSIGNED (t1
))
300 return build_type_attribute_variant (t1
, attributes
);
302 return build_type_attribute_variant (t2
, attributes
);
305 /* If only one is real, use it as the result. */
306 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
307 return build_type_attribute_variant (t1
, attributes
);
308 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
309 return build_type_attribute_variant (t2
, attributes
);
311 /* Both real or both integers; use the one with greater precision. */
312 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
313 return build_type_attribute_variant (t1
, attributes
);
314 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
315 return build_type_attribute_variant (t2
, attributes
);
317 /* The types are the same; no need to do anything fancy. */
318 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
319 return build_type_attribute_variant (t1
, attributes
);
321 if (code1
!= REAL_TYPE
)
323 /* If one is unsigned long long, then convert the other to unsigned
325 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
326 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
327 return build_type_attribute_variant (long_long_unsigned_type_node
,
329 /* If one is a long long, and the other is an unsigned long, and
330 long long can represent all the values of an unsigned long, then
331 convert to a long long. Otherwise, convert to an unsigned long
332 long. Otherwise, if either operand is long long, convert the
335 Since we're here, we know the TYPE_PRECISION is the same;
336 therefore converting to long long cannot represent all the values
337 of an unsigned long, so we choose unsigned long long in that
339 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
340 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
342 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
343 ? long_long_unsigned_type_node
344 : long_long_integer_type_node
);
345 return build_type_attribute_variant (t
, attributes
);
348 /* Go through the same procedure, but for longs. */
349 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
350 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
351 return build_type_attribute_variant (long_unsigned_type_node
,
353 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
354 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
356 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
357 ? long_unsigned_type_node
: long_integer_type_node
);
358 return build_type_attribute_variant (t
, attributes
);
360 /* Otherwise prefer the unsigned one. */
361 if (TYPE_UNSIGNED (t1
))
362 return build_type_attribute_variant (t1
, attributes
);
364 return build_type_attribute_variant (t2
, attributes
);
368 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
369 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
370 return build_type_attribute_variant (long_double_type_node
,
372 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
373 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
374 return build_type_attribute_variant (double_type_node
,
376 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
377 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
378 return build_type_attribute_variant (float_type_node
,
381 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
382 the standard C++ floating-point types. Logic earlier in this
383 function has already eliminated the possibility that
384 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
385 compelling reason to choose one or the other. */
386 return build_type_attribute_variant (t1
, attributes
);
390 /* T1 and T2 are arithmetic or enumeration types. Return the type
391 that will result from the "usual arithmetic conversions" on T1 and
392 T2 as described in [expr]. */
395 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
397 gcc_assert (ARITHMETIC_TYPE_P (t1
)
398 || TREE_CODE (t1
) == VECTOR_TYPE
399 || UNSCOPED_ENUM_P (t1
));
400 gcc_assert (ARITHMETIC_TYPE_P (t2
)
401 || TREE_CODE (t2
) == VECTOR_TYPE
402 || UNSCOPED_ENUM_P (t2
));
404 /* Perform the integral promotions. We do not promote real types here. */
405 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
406 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
408 t1
= type_promotes_to (t1
);
409 t2
= type_promotes_to (t2
);
412 return cp_common_type (t1
, t2
);
415 /* Subroutine of composite_pointer_type to implement the recursive
416 case. See that function for documentation fo the parameters. */
419 composite_pointer_type_r (tree t1
, tree t2
, const char* location
,
420 tsubst_flags_t complain
)
427 /* Determine the types pointed to by T1 and T2. */
428 if (TREE_CODE (t1
) == POINTER_TYPE
)
430 pointee1
= TREE_TYPE (t1
);
431 pointee2
= TREE_TYPE (t2
);
435 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
436 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
441 Otherwise, the composite pointer type is a pointer type
442 similar (_conv.qual_) to the type of one of the operands,
443 with a cv-qualification signature (_conv.qual_) that is the
444 union of the cv-qualification signatures of the operand
446 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
447 result_type
= pointee1
;
448 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
449 && TREE_CODE (pointee2
) == POINTER_TYPE
)
450 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
451 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
452 result_type
= composite_pointer_type_r (pointee1
, pointee2
, location
,
456 if (complain
& tf_error
)
457 permerror (input_location
, "%s between distinct pointer types %qT and %qT "
460 result_type
= void_type_node
;
462 result_type
= cp_build_qualified_type (result_type
,
463 (cp_type_quals (pointee1
)
464 | cp_type_quals (pointee2
)));
465 /* If the original types were pointers to members, so is the
467 if (TYPE_PTR_TO_MEMBER_P (t1
))
469 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
470 TYPE_PTRMEM_CLASS_TYPE (t2
))
471 && (complain
& tf_error
))
472 permerror (input_location
, "%s between distinct pointer types %qT and %qT "
475 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
479 result_type
= build_pointer_type (result_type
);
481 /* Merge the attributes. */
482 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
483 return build_type_attribute_variant (result_type
, attributes
);
486 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
487 ARG1 and ARG2 are the values with those types. The LOCATION is a
488 string describing the current location, in case an error occurs.
490 This routine also implements the computation of a common type for
491 pointers-to-members as per [expr.eq]. */
494 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
495 const char* location
, tsubst_flags_t complain
)
502 If one operand is a null pointer constant, the composite pointer
503 type is the type of the other operand. */
504 if (null_ptr_cst_p (arg1
))
506 if (null_ptr_cst_p (arg2
))
513 If one of the operands has type "pointer to cv1 void*", then
514 the other has type "pointer to cv2T", and the composite pointer
515 type is "pointer to cv12 void", where cv12 is the union of cv1
518 If either type is a pointer to void, make sure it is T1. */
519 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
527 /* Now, if T1 is a pointer to void, merge the qualifiers. */
528 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
533 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
534 pedwarn (input_location
, OPT_pedantic
, "ISO C++ forbids %s "
535 "between pointer of type %<void *%> and pointer-to-function",
538 = cp_build_qualified_type (void_type_node
,
539 (cp_type_quals (TREE_TYPE (t1
))
540 | cp_type_quals (TREE_TYPE (t2
))));
541 result_type
= build_pointer_type (result_type
);
542 /* Merge the attributes. */
543 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
544 return build_type_attribute_variant (result_type
, attributes
);
547 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
548 && TREE_CODE (t2
) == POINTER_TYPE
)
550 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
554 /* [expr.eq] permits the application of a pointer conversion to
555 bring the pointers to a common type. */
556 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
557 && CLASS_TYPE_P (TREE_TYPE (t1
))
558 && CLASS_TYPE_P (TREE_TYPE (t2
))
559 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
562 class1
= TREE_TYPE (t1
);
563 class2
= TREE_TYPE (t2
);
565 if (DERIVED_FROM_P (class1
, class2
))
566 t2
= (build_pointer_type
567 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
568 else if (DERIVED_FROM_P (class2
, class1
))
569 t1
= (build_pointer_type
570 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
573 if (complain
& tf_error
)
574 error ("%s between distinct pointer types %qT and %qT "
575 "lacks a cast", location
, t1
, t2
);
576 return error_mark_node
;
579 /* [expr.eq] permits the application of a pointer-to-member
580 conversion to change the class type of one of the types. */
581 else if (TYPE_PTR_TO_MEMBER_P (t1
)
582 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
583 TYPE_PTRMEM_CLASS_TYPE (t2
)))
585 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
586 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
588 if (DERIVED_FROM_P (class1
, class2
))
589 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
590 else if (DERIVED_FROM_P (class2
, class1
))
591 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
594 if (complain
& tf_error
)
595 error ("%s between distinct pointer-to-member types %qT and %qT "
596 "lacks a cast", location
, t1
, t2
);
597 return error_mark_node
;
601 return composite_pointer_type_r (t1
, t2
, location
, complain
);
604 /* Return the merged type of two types.
605 We assume that comptypes has already been done and returned 1;
606 if that isn't so, this may crash.
608 This just combines attributes and default arguments; any other
609 differences would cause the two types to compare unalike. */
612 merge_types (tree t1
, tree t2
)
614 enum tree_code code1
;
615 enum tree_code code2
;
618 /* Save time if the two types are the same. */
621 if (original_type (t1
) == original_type (t2
))
624 /* If one type is nonsense, use the other. */
625 if (t1
== error_mark_node
)
627 if (t2
== error_mark_node
)
630 /* Merge the attributes. */
631 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
633 if (TYPE_PTRMEMFUNC_P (t1
))
634 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
635 if (TYPE_PTRMEMFUNC_P (t2
))
636 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
638 code1
= TREE_CODE (t1
);
639 code2
= TREE_CODE (t2
);
645 /* For two pointers, do this recursively on the target type. */
647 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
648 int quals
= cp_type_quals (t1
);
650 if (code1
== POINTER_TYPE
)
651 t1
= build_pointer_type (target
);
653 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
654 t1
= build_type_attribute_variant (t1
, attributes
);
655 t1
= cp_build_qualified_type (t1
, quals
);
657 if (TREE_CODE (target
) == METHOD_TYPE
)
658 t1
= build_ptrmemfunc_type (t1
);
667 quals
= cp_type_quals (t1
);
668 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
669 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
670 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
672 t1
= cp_build_qualified_type (t1
, quals
);
678 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
679 /* Save space: see if the result is identical to one of the args. */
680 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
681 return build_type_attribute_variant (t1
, attributes
);
682 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
683 return build_type_attribute_variant (t2
, attributes
);
684 /* Merge the element types, and have a size if either arg has one. */
685 t1
= build_cplus_array_type
686 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
691 /* Function types: prefer the one that specified arg types.
692 If both do, merge the arg types. Also merge the return types. */
694 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
695 tree p1
= TYPE_ARG_TYPES (t1
);
696 tree p2
= TYPE_ARG_TYPES (t2
);
699 /* Save space: see if the result is identical to one of the args. */
700 if (valtype
== TREE_TYPE (t1
) && ! p2
)
701 return cp_build_type_attribute_variant (t1
, attributes
);
702 if (valtype
== TREE_TYPE (t2
) && ! p1
)
703 return cp_build_type_attribute_variant (t2
, attributes
);
705 /* Simple way if one arg fails to specify argument types. */
706 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
708 rval
= build_function_type (valtype
, p2
);
709 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
710 rval
= build_exception_variant (rval
, raises
);
711 return cp_build_type_attribute_variant (rval
, attributes
);
713 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
714 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
716 rval
= build_function_type (valtype
, p1
);
718 rval
= build_exception_variant (rval
, raises
);
719 return cp_build_type_attribute_variant (rval
, attributes
);
722 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
723 t1
= build_exception_variant (rval
, raises
);
729 /* Get this value the long way, since TYPE_METHOD_BASETYPE
730 is just the main variant of this. */
731 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
732 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
735 /* If this was a member function type, get back to the
736 original type of type member function (i.e., without
737 the class instance variable up front. */
738 t1
= build_function_type (TREE_TYPE (t1
),
739 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
740 t2
= build_function_type (TREE_TYPE (t2
),
741 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
742 t3
= merge_types (t1
, t2
);
743 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
744 TYPE_ARG_TYPES (t3
));
745 t1
= build_exception_variant (t3
, raises
);
750 /* There is no need to merge attributes into a TYPENAME_TYPE.
751 When the type is instantiated it will have whatever
752 attributes result from the instantiation. */
758 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
760 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
763 return cp_build_type_attribute_variant (t1
, attributes
);
766 /* Wrapper around cp_common_type that is used by c-common.c and other
767 front end optimizations that remove promotions.
769 Return the common type for two arithmetic types T1 and T2 under the
770 usual arithmetic conversions. The default conversions have already
771 been applied, and enumerated types converted to their compatible
775 common_type (tree t1
, tree t2
)
777 /* If one type is nonsense, use the other */
778 if (t1
== error_mark_node
)
780 if (t2
== error_mark_node
)
783 return cp_common_type (t1
, t2
);
786 /* Return the common type of two pointer types T1 and T2. This is the
787 type for the result of most arithmetic operations if the operands
788 have the given two types.
790 We assume that comp_target_types has already been done and returned
791 nonzero; if that isn't so, this may crash. */
794 common_pointer_type (tree t1
, tree t2
)
796 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
797 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
798 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
800 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
801 "conversion", tf_warning_or_error
);
804 /* Compare two exception specifier types for exactness or subsetness, if
805 allowed. Returns false for mismatch, true for match (same, or
808 [except.spec] "If a class X ... objects of class X or any class publicly
809 and unambiguously derived from X. Similarly, if a pointer type Y * ...
810 exceptions of type Y * or that are pointers to any type publicly and
811 unambiguously derived from Y. Otherwise a function only allows exceptions
812 that have the same type ..."
813 This does not mention cv qualifiers and is different to what throw
814 [except.throw] and catch [except.catch] will do. They will ignore the
815 top level cv qualifiers, and allow qualifiers in the pointer to class
818 We implement the letter of the standard. */
821 comp_except_types (tree a
, tree b
, bool exact
)
823 if (same_type_p (a
, b
))
827 if (cp_type_quals (a
) || cp_type_quals (b
))
830 if (TREE_CODE (a
) == POINTER_TYPE
831 && TREE_CODE (b
) == POINTER_TYPE
)
835 if (cp_type_quals (a
) || cp_type_quals (b
))
839 if (TREE_CODE (a
) != RECORD_TYPE
840 || TREE_CODE (b
) != RECORD_TYPE
)
843 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
849 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
850 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
851 otherwise it must be exact. Exception lists are unordered, but
852 we've already filtered out duplicates. Most lists will be in order,
853 we should try to make use of that. */
856 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
865 if (t1
== NULL_TREE
) /* T1 is ... */
866 return t2
== NULL_TREE
|| !exact
;
867 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
868 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
869 if (t2
== NULL_TREE
) /* T2 is ... */
871 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
874 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
875 Count how many we find, to determine exactness. For exact matching and
876 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
878 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
880 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
882 tree a
= TREE_VALUE (probe
);
883 tree b
= TREE_VALUE (t2
);
885 if (comp_except_types (a
, b
, exact
))
887 if (probe
== base
&& exact
)
888 base
= TREE_CHAIN (probe
);
893 if (probe
== NULL_TREE
)
896 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
899 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
900 [] can match [size]. */
903 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
912 /* The type of the array elements must be the same. */
913 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
916 d1
= TYPE_DOMAIN (t1
);
917 d2
= TYPE_DOMAIN (t2
);
922 /* If one of the arrays is dimensionless, and the other has a
923 dimension, they are of different types. However, it is valid to
931 declarations for an array object can specify
932 array types that differ by the presence or absence of a major
933 array bound (_dcl.array_). */
935 return allow_redeclaration
;
937 /* Check that the dimensions are the same. */
939 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
941 max1
= TYPE_MAX_VALUE (d1
);
942 max2
= TYPE_MAX_VALUE (d2
);
943 if (processing_template_decl
&& !abi_version_at_least (2)
944 && !value_dependent_expression_p (max1
)
945 && !value_dependent_expression_p (max2
))
947 /* With abi-1 we do not fold non-dependent array bounds, (and
948 consequently mangle them incorrectly). We must therefore
949 fold them here, to verify the domains have the same
955 if (!cp_tree_equal (max1
, max2
))
961 /* Subroutine in comptypes. */
964 structural_comptypes (tree t1
, tree t2
, int strict
)
969 /* Suppress errors caused by previously reported errors. */
970 if (t1
== error_mark_node
|| t2
== error_mark_node
)
973 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
975 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
976 current instantiation. */
977 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
978 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
980 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
981 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
983 if (TYPE_PTRMEMFUNC_P (t1
))
984 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
985 if (TYPE_PTRMEMFUNC_P (t2
))
986 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
988 /* Different classes of types can't be compatible. */
989 if (TREE_CODE (t1
) != TREE_CODE (t2
))
992 /* Qualifiers must match. For array types, we will check when we
993 recur on the array element types. */
994 if (TREE_CODE (t1
) != ARRAY_TYPE
995 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
997 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1000 /* Allow for two different type nodes which have essentially the same
1001 definition. Note that we already checked for equality of the type
1002 qualifiers (just above). */
1004 if (TREE_CODE (t1
) != ARRAY_TYPE
1005 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1008 /* Compare the types. Break out if they could be the same. */
1009 switch (TREE_CODE (t1
))
1013 /* All void and bool types are the same. */
1017 case FIXED_POINT_TYPE
:
1019 /* With these nodes, we can't determine type equivalence by
1020 looking at what is stored in the nodes themselves, because
1021 two nodes might have different TYPE_MAIN_VARIANTs but still
1022 represent the same type. For example, wchar_t and int could
1023 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1024 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1025 and are distinct types. On the other hand, int and the
1028 typedef int INT __attribute((may_alias));
1030 have identical properties, different TYPE_MAIN_VARIANTs, but
1031 represent the same type. The canonical type system keeps
1032 track of equivalence in this case, so we fall back on it. */
1033 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1035 case TEMPLATE_TEMPLATE_PARM
:
1036 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1037 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1038 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1039 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1040 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1042 if (!comp_template_parms
1043 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1044 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1046 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1048 /* Don't check inheritance. */
1049 strict
= COMPARE_STRICT
;
1054 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1055 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1056 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1057 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1060 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1062 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1068 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1069 strict
& ~COMPARE_REDECLARATION
))
1071 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1075 case REFERENCE_TYPE
:
1076 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1078 /* fall through to checks for pointer types */
1081 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1082 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1083 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1089 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1091 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1096 /* Target types must match incl. qualifiers. */
1097 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1101 case TEMPLATE_TYPE_PARM
:
1102 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1103 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1104 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1105 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1110 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1111 TYPENAME_TYPE_FULLNAME (t2
)))
1113 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1117 case UNBOUND_CLASS_TEMPLATE
:
1118 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1120 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1125 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1130 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1131 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1135 case TYPE_PACK_EXPANSION
:
1136 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1137 PACK_EXPANSION_PATTERN (t2
));
1140 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1141 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1142 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1143 DECLTYPE_TYPE_EXPR (t2
)))
1151 /* If we get here, we know that from a target independent POV the
1152 types are the same. Make sure the target attributes are also
1154 return targetm
.comp_type_attributes (t1
, t2
);
1157 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1158 is a bitwise-or of the COMPARE_* flags. */
1161 comptypes (tree t1
, tree t2
, int strict
)
1163 if (strict
== COMPARE_STRICT
)
1168 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1171 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1172 /* At least one of the types requires structural equality, so
1173 perform a deep check. */
1174 return structural_comptypes (t1
, t2
, strict
);
1176 #ifdef ENABLE_CHECKING
1177 if (USE_CANONICAL_TYPES
)
1179 bool result
= structural_comptypes (t1
, t2
, strict
);
1181 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1182 /* The two types are structurally equivalent, but their
1183 canonical types were different. This is a failure of the
1184 canonical type propagation code.*/
1186 ("canonical types differ for identical types %T and %T",
1188 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1189 /* Two types are structurally different, but the canonical
1190 types are the same. This means we were over-eager in
1191 assigning canonical types. */
1193 ("same canonical type node for different types %T and %T",
1199 if (USE_CANONICAL_TYPES
)
1200 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1203 return structural_comptypes (t1
, t2
, strict
);
1205 else if (strict
== COMPARE_STRUCTURAL
)
1206 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1208 return structural_comptypes (t1
, t2
, strict
);
1211 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1214 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1216 int q1
= cp_type_quals (type1
);
1217 int q2
= cp_type_quals (type2
);
1219 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1220 return (q1
& q2
) == q2
;
1223 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1224 more cv-qualified that TYPE1, and 0 otherwise. */
1227 comp_cv_qualification (const_tree type1
, const_tree type2
)
1229 int q1
= cp_type_quals (type1
);
1230 int q2
= cp_type_quals (type2
);
1235 if ((q1
& q2
) == q2
)
1237 else if ((q1
& q2
) == q1
)
1243 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1244 subset of the cv-qualification signature of TYPE2, and the types
1245 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1248 comp_cv_qual_signature (tree type1
, tree type2
)
1250 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1252 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1258 /* Subroutines of `comptypes'. */
1260 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1261 equivalent in the sense that functions with those parameter types
1262 can have equivalent types. The two lists must be equivalent,
1263 element by element. */
1266 compparms (const_tree parms1
, const_tree parms2
)
1270 /* An unspecified parmlist matches any specified parmlist
1271 whose argument types don't need default promotions. */
1273 for (t1
= parms1
, t2
= parms2
;
1275 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1277 /* If one parmlist is shorter than the other,
1278 they fail to match. */
1281 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1288 /* Process a sizeof or alignof expression where the operand is a
1292 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1297 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1298 if (type
== error_mark_node
)
1299 return error_mark_node
;
1301 type
= non_reference (type
);
1302 if (TREE_CODE (type
) == METHOD_TYPE
)
1305 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1306 "invalid application of %qs to a member function",
1307 operator_name_info
[(int) op
].name
);
1308 value
= size_one_node
;
1311 dependent_p
= dependent_type_p (type
);
1313 complete_type (type
);
1315 /* VLA types will have a non-constant size. In the body of an
1316 uninstantiated template, we don't need to try to compute the
1317 value, because the sizeof expression is not an integral
1318 constant expression in that case. And, if we do try to
1319 compute the value, we'll likely end up with SAVE_EXPRs, which
1320 the template substitution machinery does not expect to see. */
1321 || (processing_template_decl
1322 && COMPLETE_TYPE_P (type
)
1323 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1325 value
= build_min (op
, size_type_node
, type
);
1326 TREE_READONLY (value
) = 1;
1330 return c_sizeof_or_alignof_type (complete_type (type
),
1335 /* Return the size of the type, without producing any warnings for
1336 types whose size cannot be taken. This routine should be used only
1337 in some other routine that has already produced a diagnostic about
1338 using the size of such a type. */
1340 cxx_sizeof_nowarn (tree type
)
1342 if (TREE_CODE (type
) == FUNCTION_TYPE
1343 || TREE_CODE (type
) == VOID_TYPE
1344 || TREE_CODE (type
) == ERROR_MARK
)
1345 return size_one_node
;
1346 else if (!COMPLETE_TYPE_P (type
))
1347 return size_zero_node
;
1349 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1352 /* Process a sizeof expression where the operand is an expression. */
1355 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1357 if (e
== error_mark_node
)
1358 return error_mark_node
;
1360 if (processing_template_decl
)
1362 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1363 TREE_SIDE_EFFECTS (e
) = 0;
1364 TREE_READONLY (e
) = 1;
1369 if (TREE_CODE (e
) == COMPONENT_REF
1370 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1371 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1373 if (complain
& tf_error
)
1374 error ("invalid application of %<sizeof%> to a bit-field");
1376 return error_mark_node
;
1379 else if (is_overloaded_fn (e
))
1381 if (complain
& tf_error
)
1382 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1385 return error_mark_node
;
1388 else if (type_unknown_p (e
))
1390 if (complain
& tf_error
)
1391 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1393 return error_mark_node
;
1399 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1402 /* Implement the __alignof keyword: Return the minimum required
1403 alignment of E, measured in bytes. For VAR_DECL's and
1404 FIELD_DECL's return DECL_ALIGN (which can be set from an
1405 "aligned" __attribute__ specification). */
1408 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1412 if (e
== error_mark_node
)
1413 return error_mark_node
;
1415 if (processing_template_decl
)
1417 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1418 TREE_SIDE_EFFECTS (e
) = 0;
1419 TREE_READONLY (e
) = 1;
1424 if (TREE_CODE (e
) == VAR_DECL
)
1425 t
= size_int (DECL_ALIGN_UNIT (e
));
1426 else if (TREE_CODE (e
) == COMPONENT_REF
1427 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1428 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1430 if (complain
& tf_error
)
1431 error ("invalid application of %<__alignof%> to a bit-field");
1433 return error_mark_node
;
1436 else if (TREE_CODE (e
) == COMPONENT_REF
1437 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1438 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1439 else if (is_overloaded_fn (e
))
1441 if (complain
& tf_error
)
1442 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1445 return error_mark_node
;
1446 if (TREE_CODE (e
) == FUNCTION_DECL
)
1447 t
= size_int (DECL_ALIGN_UNIT (e
));
1451 else if (type_unknown_p (e
))
1453 if (complain
& tf_error
)
1454 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1456 return error_mark_node
;
1460 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1461 complain
& tf_error
);
1463 return fold_convert (size_type_node
, t
);
1466 /* Process a sizeof or alignof expression E with code OP where the operand
1467 is an expression. */
1470 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1472 if (op
== SIZEOF_EXPR
)
1473 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1475 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1478 /* EXPR is being used in a context that is not a function call.
1483 The expression can be used only as the left-hand operand of a
1484 member function call.
1486 [expr.mptr.operator]
1488 If the result of .* or ->* is a function, then that result can be
1489 used only as the operand for the function call operator ().
1491 by issuing an error message if appropriate. Returns true iff EXPR
1492 violates these rules. */
1495 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1497 if (TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
)
1499 if (complain
& tf_error
)
1500 error ("invalid use of non-static member function");
1506 /* If EXP is a reference to a bitfield, and the type of EXP does not
1507 match the declared type of the bitfield, return the declared type
1508 of the bitfield. Otherwise, return NULL_TREE. */
1511 is_bitfield_expr_with_lowered_type (const_tree exp
)
1513 switch (TREE_CODE (exp
))
1516 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1517 ? TREE_OPERAND (exp
, 1)
1518 : TREE_OPERAND (exp
, 0)))
1520 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1523 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1527 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1533 field
= TREE_OPERAND (exp
, 1);
1534 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1536 if (same_type_ignoring_top_level_qualifiers_p
1537 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1539 return DECL_BIT_FIELD_TYPE (field
);
1543 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1544 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1545 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1553 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1554 bitfield with a lowered type, the type of EXP is returned, rather
1558 unlowered_expr_type (const_tree exp
)
1562 type
= is_bitfield_expr_with_lowered_type (exp
);
1564 type
= TREE_TYPE (exp
);
1569 /* Perform the conversions in [expr] that apply when an lvalue appears
1570 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1571 function-to-pointer conversions. In addition, manifest constants
1572 are replaced by their values, and bitfield references are converted
1573 to their declared types.
1575 Although the returned value is being used as an rvalue, this
1576 function does not wrap the returned expression in a
1577 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1578 that the return value is no longer an lvalue. */
1581 decay_conversion (tree exp
)
1584 enum tree_code code
;
1586 type
= TREE_TYPE (exp
);
1587 if (type
== error_mark_node
)
1588 return error_mark_node
;
1590 if (type_unknown_p (exp
))
1592 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1593 return error_mark_node
;
1596 exp
= decl_constant_value (exp
);
1597 if (error_operand_p (exp
))
1598 return error_mark_node
;
1600 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1601 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1602 code
= TREE_CODE (type
);
1603 if (code
== VOID_TYPE
)
1605 error ("void value not ignored as it ought to be");
1606 return error_mark_node
;
1608 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1609 return error_mark_node
;
1610 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1611 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1612 if (code
== ARRAY_TYPE
)
1617 if (TREE_CODE (exp
) == INDIRECT_REF
)
1618 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1619 TREE_OPERAND (exp
, 0));
1621 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1623 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1624 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1625 TREE_OPERAND (exp
, 0), op1
);
1629 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1631 error ("invalid use of non-lvalue array");
1632 return error_mark_node
;
1635 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1637 if (TREE_CODE (exp
) == VAR_DECL
)
1639 if (!cxx_mark_addressable (exp
))
1640 return error_mark_node
;
1641 adr
= build_nop (ptrtype
, build_address (exp
));
1644 /* This way is better for a COMPONENT_REF since it can
1645 simplify the offset for a component. */
1646 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1647 return cp_convert (ptrtype
, adr
);
1650 /* If a bitfield is used in a context where integral promotion
1651 applies, then the caller is expected to have used
1652 default_conversion. That function promotes bitfields correctly
1653 before calling this function. At this point, if we have a
1654 bitfield referenced, we may assume that is not subject to
1655 promotion, and that, therefore, the type of the resulting rvalue
1656 is the declared type of the bitfield. */
1657 exp
= convert_bitfield_to_declared_type (exp
);
1659 /* We do not call rvalue() here because we do not want to wrap EXP
1660 in a NON_LVALUE_EXPR. */
1664 Non-class rvalues always have cv-unqualified types. */
1665 type
= TREE_TYPE (exp
);
1666 if (!CLASS_TYPE_P (type
) && cp_type_quals (type
))
1667 exp
= build_nop (TYPE_MAIN_VARIANT (type
), exp
);
1672 /* Perform preparatory conversions, as part of the "usual arithmetic
1673 conversions". In particular, as per [expr]:
1675 Whenever an lvalue expression appears as an operand of an
1676 operator that expects the rvalue for that operand, the
1677 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1678 standard conversions are applied to convert the expression to an
1681 In addition, we perform integral promotions here, as those are
1682 applied to both operands to a binary operator before determining
1683 what additional conversions should apply. */
1686 default_conversion (tree exp
)
1688 /* Perform the integral promotions first so that bitfield
1689 expressions (which may promote to "int", even if the bitfield is
1690 declared "unsigned") are promoted correctly. */
1691 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1692 exp
= perform_integral_promotions (exp
);
1693 /* Perform the other conversions. */
1694 exp
= decay_conversion (exp
);
1699 /* EXPR is an expression with an integral or enumeration type.
1700 Perform the integral promotions in [conv.prom], and return the
1704 perform_integral_promotions (tree expr
)
1711 If the bitfield has an enumerated type, it is treated as any
1712 other value of that type for promotion purposes. */
1713 type
= is_bitfield_expr_with_lowered_type (expr
);
1714 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1715 type
= TREE_TYPE (expr
);
1716 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1717 promoted_type
= type_promotes_to (type
);
1718 if (type
!= promoted_type
)
1719 expr
= cp_convert (promoted_type
, expr
);
1723 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1724 decay_conversion to one. */
1727 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1731 if (TREE_CODE (totype
) != POINTER_TYPE
)
1734 t
= TREE_TYPE (totype
);
1735 if (!same_type_p (t
, char_type_node
)
1736 && !same_type_p (t
, char16_type_node
)
1737 && !same_type_p (t
, char32_type_node
)
1738 && !same_type_p (t
, wchar_type_node
))
1741 if (TREE_CODE (exp
) == STRING_CST
)
1743 /* Make sure that we don't try to convert between char and wide chars. */
1744 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1749 /* Is this a string constant which has decayed to 'const char *'? */
1750 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1751 if (!same_type_p (TREE_TYPE (exp
), t
))
1754 if (TREE_CODE (exp
) != ADDR_EXPR
1755 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1759 /* This warning is not very useful, as it complains about printf. */
1761 warning (OPT_Wwrite_strings
,
1762 "deprecated conversion from string constant to %qT",
1768 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1769 can, for example, use as an lvalue. This code used to be in
1770 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1771 expressions, where we're dealing with aggregates. But now it's again only
1772 called from unary_complex_lvalue. The case (in particular) that led to
1773 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1777 rationalize_conditional_expr (enum tree_code code
, tree t
,
1778 tsubst_flags_t complain
)
1780 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1781 the first operand is always the one to be used if both operands
1782 are equal, so we know what conditional expression this used to be. */
1783 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1785 tree op0
= TREE_OPERAND (t
, 0);
1786 tree op1
= TREE_OPERAND (t
, 1);
1788 /* The following code is incorrect if either operand side-effects. */
1789 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
1790 && !TREE_SIDE_EFFECTS (op1
));
1792 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1793 ? LE_EXPR
: GE_EXPR
),
1794 op0
, TREE_CODE (op0
),
1795 op1
, TREE_CODE (op1
),
1796 /*overloaded_p=*/NULL
,
1798 cp_build_unary_op (code
, op0
, 0, complain
),
1799 cp_build_unary_op (code
, op1
, 0, complain
),
1804 build_conditional_expr (TREE_OPERAND (t
, 0),
1805 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
1807 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
1812 /* Given the TYPE of an anonymous union field inside T, return the
1813 FIELD_DECL for the field. If not found return NULL_TREE. Because
1814 anonymous unions can nest, we must also search all anonymous unions
1815 that are directly reachable. */
1818 lookup_anon_field (tree t
, tree type
)
1822 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1824 if (TREE_STATIC (field
))
1826 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
1829 /* If we find it directly, return the field. */
1830 if (DECL_NAME (field
) == NULL_TREE
1831 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
1836 /* Otherwise, it could be nested, search harder. */
1837 if (DECL_NAME (field
) == NULL_TREE
1838 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1840 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1848 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1849 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1850 non-NULL, it indicates the path to the base used to name MEMBER.
1851 If PRESERVE_REFERENCE is true, the expression returned will have
1852 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1853 returned will have the type referred to by the reference.
1855 This function does not perform access control; that is either done
1856 earlier by the parser when the name of MEMBER is resolved to MEMBER
1857 itself, or later when overload resolution selects one of the
1858 functions indicated by MEMBER. */
1861 build_class_member_access_expr (tree object
, tree member
,
1862 tree access_path
, bool preserve_reference
,
1863 tsubst_flags_t complain
)
1867 tree result
= NULL_TREE
;
1869 if (error_operand_p (object
) || error_operand_p (member
))
1870 return error_mark_node
;
1872 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
1876 The type of the first expression shall be "class object" (of a
1878 object_type
= TREE_TYPE (object
);
1879 if (!currently_open_class (object_type
)
1880 && !complete_type_or_else (object_type
, object
))
1881 return error_mark_node
;
1882 if (!CLASS_TYPE_P (object_type
))
1884 if (complain
& tf_error
)
1885 error ("request for member %qD in %qE, which is of non-class type %qT",
1886 member
, object
, object_type
);
1887 return error_mark_node
;
1890 /* The standard does not seem to actually say that MEMBER must be a
1891 member of OBJECT_TYPE. However, that is clearly what is
1893 if (DECL_P (member
))
1895 member_scope
= DECL_CLASS_CONTEXT (member
);
1897 if (TREE_DEPRECATED (member
))
1898 warn_deprecated_use (member
);
1901 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
1902 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1903 presently be the anonymous union. Go outwards until we find a
1904 type related to OBJECT_TYPE. */
1905 while (ANON_AGGR_TYPE_P (member_scope
)
1906 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
1908 member_scope
= TYPE_CONTEXT (member_scope
);
1909 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
1911 if (complain
& tf_error
)
1913 if (TREE_CODE (member
) == FIELD_DECL
)
1914 error ("invalid use of nonstatic data member %qE", member
);
1916 error ("%qD is not a member of %qT", member
, object_type
);
1918 return error_mark_node
;
1921 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1922 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1923 in the front end; only _DECLs and _REFs are lvalues in the back end. */
1925 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
1927 object
= cp_build_indirect_ref (temp
, NULL
, complain
);
1930 /* In [expr.ref], there is an explicit list of the valid choices for
1931 MEMBER. We check for each of those cases here. */
1932 if (TREE_CODE (member
) == VAR_DECL
)
1934 /* A static data member. */
1936 /* If OBJECT has side-effects, they are supposed to occur. */
1937 if (TREE_SIDE_EFFECTS (object
))
1938 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
1940 else if (TREE_CODE (member
) == FIELD_DECL
)
1942 /* A non-static data member. */
1947 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
1948 && integer_zerop (TREE_OPERAND (object
, 0)));
1950 /* Convert OBJECT to the type of MEMBER. */
1951 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
1952 TYPE_MAIN_VARIANT (member_scope
)))
1957 binfo
= lookup_base (access_path
? access_path
: object_type
,
1958 member_scope
, ba_unique
, &kind
);
1959 if (binfo
== error_mark_node
)
1960 return error_mark_node
;
1962 /* It is invalid to try to get to a virtual base of a
1963 NULL object. The most common cause is invalid use of
1965 if (null_object_p
&& kind
== bk_via_virtual
)
1967 if (complain
& tf_error
)
1969 error ("invalid access to non-static data member %qD of "
1972 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1974 return error_mark_node
;
1977 /* Convert to the base. */
1978 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
1980 /* If we found the base successfully then we should be able
1981 to convert to it successfully. */
1982 gcc_assert (object
!= error_mark_node
);
1985 /* Complain about other invalid uses of offsetof, even though they will
1986 give the right answer. Note that we complain whether or not they
1987 actually used the offsetof macro, since there's no way to know at this
1988 point. So we just give a warning, instead of a pedwarn. */
1989 /* Do not produce this warning for base class field references, because
1990 we know for a fact that didn't come from offsetof. This does occur
1991 in various testsuite cases where a null object is passed where a
1992 vtable access is required. */
1993 if (null_object_p
&& warn_invalid_offsetof
1994 && CLASSTYPE_NON_POD_P (object_type
)
1995 && !DECL_FIELD_IS_BASE (member
)
1997 && (complain
& tf_warning
))
1999 warning (OPT_Winvalid_offsetof
,
2000 "invalid access to non-static data member %qD "
2001 " of NULL object", member
);
2002 warning (OPT_Winvalid_offsetof
,
2003 "(perhaps the %<offsetof%> macro was used incorrectly)");
2006 /* If MEMBER is from an anonymous aggregate, we have converted
2007 OBJECT so that it refers to the class containing the
2008 anonymous union. Generate a reference to the anonymous union
2009 itself, and recur to find MEMBER. */
2010 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2011 /* When this code is called from build_field_call, the
2012 object already has the type of the anonymous union.
2013 That is because the COMPONENT_REF was already
2014 constructed, and was then disassembled before calling
2015 build_field_call. After the function-call code is
2016 cleaned up, this waste can be eliminated. */
2017 && (!same_type_ignoring_top_level_qualifiers_p
2018 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2020 tree anonymous_union
;
2022 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2023 DECL_CONTEXT (member
));
2024 object
= build_class_member_access_expr (object
,
2026 /*access_path=*/NULL_TREE
,
2031 /* Compute the type of the field, as described in [expr.ref]. */
2032 type_quals
= TYPE_UNQUALIFIED
;
2033 member_type
= TREE_TYPE (member
);
2034 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2036 type_quals
= (cp_type_quals (member_type
)
2037 | cp_type_quals (object_type
));
2039 /* A field is const (volatile) if the enclosing object, or the
2040 field itself, is const (volatile). But, a mutable field is
2041 not const, even within a const object. */
2042 if (DECL_MUTABLE_P (member
))
2043 type_quals
&= ~TYPE_QUAL_CONST
;
2044 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2047 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2049 result
= fold_if_not_in_template (result
);
2051 /* Mark the expression const or volatile, as appropriate. Even
2052 though we've dealt with the type above, we still have to mark the
2053 expression itself. */
2054 if (type_quals
& TYPE_QUAL_CONST
)
2055 TREE_READONLY (result
) = 1;
2056 if (type_quals
& TYPE_QUAL_VOLATILE
)
2057 TREE_THIS_VOLATILE (result
) = 1;
2059 else if (BASELINK_P (member
))
2061 /* The member is a (possibly overloaded) member function. */
2065 /* If the MEMBER is exactly one static member function, then we
2066 know the type of the expression. Otherwise, we must wait
2067 until overload resolution has been performed. */
2068 functions
= BASELINK_FUNCTIONS (member
);
2069 if (TREE_CODE (functions
) == FUNCTION_DECL
2070 && DECL_STATIC_FUNCTION_P (functions
))
2071 type
= TREE_TYPE (functions
);
2073 type
= unknown_type_node
;
2074 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2075 base. That will happen when the function is called. */
2076 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2078 else if (TREE_CODE (member
) == CONST_DECL
)
2080 /* The member is an enumerator. */
2082 /* If OBJECT has side-effects, they are supposed to occur. */
2083 if (TREE_SIDE_EFFECTS (object
))
2084 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2089 if (complain
& tf_error
)
2090 error ("invalid use of %qD", member
);
2091 return error_mark_node
;
2094 if (!preserve_reference
)
2097 If E2 is declared to have type "reference to T", then ... the
2098 type of E1.E2 is T. */
2099 result
= convert_from_reference (result
);
2104 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2105 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2108 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2110 tree object_type
= TREE_TYPE (object
);
2111 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2114 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2116 error ("qualified type %qT does not match destructor name ~%qT",
2118 return error_mark_node
;
2120 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2122 /* In a template, names we can't find a match for are still accepted
2123 destructor names, and we check them here. */
2124 if (check_dtor_name (object_type
, dtor_type
))
2125 dtor_type
= object_type
;
2128 error ("object type %qT does not match destructor name ~%qT",
2129 object_type
, dtor_type
);
2130 return error_mark_node
;
2134 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2136 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2137 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2138 return error_mark_node
;
2140 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2141 /*protect=*/1, /*want_type=*/false);
2142 expr
= (adjust_result_of_qualified_name_lookup
2143 (expr
, dtor_type
, object_type
));
2147 /* An expression of the form "A::template B" has been resolved to
2148 DECL. Issue a diagnostic if B is not a template or template
2152 check_template_keyword (tree decl
)
2154 /* The standard says:
2158 If a name prefixed by the keyword template is not a member
2159 template, the program is ill-formed.
2161 DR 228 removed the restriction that the template be a member
2164 DR 96, if accepted would add the further restriction that explicit
2165 template arguments must be provided if the template keyword is
2166 used, but, as of 2005-10-16, that DR is still in "drafting". If
2167 this DR is accepted, then the semantic checks here can be
2168 simplified, as the entity named must in fact be a template
2169 specialization, rather than, as at present, a set of overloaded
2170 functions containing at least one template function. */
2171 if (TREE_CODE (decl
) != TEMPLATE_DECL
2172 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2174 if (!is_overloaded_fn (decl
))
2175 permerror (input_location
, "%qD is not a template", decl
);
2180 if (BASELINK_P (fns
))
2181 fns
= BASELINK_FUNCTIONS (fns
);
2184 tree fn
= OVL_CURRENT (fns
);
2185 if (TREE_CODE (fn
) == TEMPLATE_DECL
2186 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2188 if (TREE_CODE (fn
) == FUNCTION_DECL
2189 && DECL_USE_TEMPLATE (fn
)
2190 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2192 fns
= OVL_NEXT (fns
);
2195 permerror (input_location
, "%qD is not a template", decl
);
2200 /* This function is called by the parser to process a class member
2201 access expression of the form OBJECT.NAME. NAME is a node used by
2202 the parser to represent a name; it is not yet a DECL. It may,
2203 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2204 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2205 there is no reason to do the lookup twice, so the parser keeps the
2206 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2207 be a template via the use of the "A::template B" syntax. */
2210 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2211 tsubst_flags_t complain
)
2216 tree access_path
= NULL_TREE
;
2217 tree orig_object
= object
;
2218 tree orig_name
= name
;
2220 if (object
== error_mark_node
|| name
== error_mark_node
)
2221 return error_mark_node
;
2223 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2224 if (!objc_is_public (object
, name
))
2225 return error_mark_node
;
2227 object_type
= TREE_TYPE (object
);
2229 if (processing_template_decl
)
2231 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2232 dependent_type_p (object_type
)
2233 /* If NAME is just an IDENTIFIER_NODE, then the expression
2235 || TREE_CODE (object
) == IDENTIFIER_NODE
2236 /* If NAME is "f<args>", where either 'f' or 'args' is
2237 dependent, then the expression is dependent. */
2238 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2239 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2240 TREE_OPERAND (name
, 1)))
2241 /* If NAME is "T::X" where "T" is dependent, then the
2242 expression is dependent. */
2243 || (TREE_CODE (name
) == SCOPE_REF
2244 && TYPE_P (TREE_OPERAND (name
, 0))
2245 && dependent_type_p (TREE_OPERAND (name
, 0))))
2246 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2247 object
= build_non_dependent_expr (object
);
2252 The type of the first expression shall be "class object" (of a
2254 if (!currently_open_class (object_type
)
2255 && !complete_type_or_else (object_type
, object
))
2256 return error_mark_node
;
2257 if (!CLASS_TYPE_P (object_type
))
2259 if (complain
& tf_error
)
2260 error ("request for member %qD in %qE, which is of non-class type %qT",
2261 name
, object
, object_type
);
2262 return error_mark_node
;
2265 if (BASELINK_P (name
))
2266 /* A member function that has already been looked up. */
2270 bool is_template_id
= false;
2271 tree template_args
= NULL_TREE
;
2274 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2276 is_template_id
= true;
2277 template_args
= TREE_OPERAND (name
, 1);
2278 name
= TREE_OPERAND (name
, 0);
2280 if (TREE_CODE (name
) == OVERLOAD
)
2281 name
= DECL_NAME (get_first_fn (name
));
2282 else if (DECL_P (name
))
2283 name
= DECL_NAME (name
);
2286 if (TREE_CODE (name
) == SCOPE_REF
)
2288 /* A qualified name. The qualifying class or namespace `S'
2289 has already been looked up; it is either a TYPE or a
2291 scope
= TREE_OPERAND (name
, 0);
2292 name
= TREE_OPERAND (name
, 1);
2294 /* If SCOPE is a namespace, then the qualified name does not
2295 name a member of OBJECT_TYPE. */
2296 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2298 if (complain
& tf_error
)
2299 error ("%<%D::%D%> is not a member of %qT",
2300 scope
, name
, object_type
);
2301 return error_mark_node
;
2304 gcc_assert (CLASS_TYPE_P (scope
));
2305 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2306 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2308 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2309 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2310 if (access_path
== error_mark_node
)
2311 return error_mark_node
;
2314 if (complain
& tf_error
)
2315 error ("%qT is not a base of %qT", scope
, object_type
);
2316 return error_mark_node
;
2322 access_path
= object_type
;
2325 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2326 member
= lookup_destructor (object
, scope
, name
);
2329 /* Look up the member. */
2330 member
= lookup_member (access_path
, name
, /*protect=*/1,
2331 /*want_type=*/false);
2332 if (member
== NULL_TREE
)
2334 if (complain
& tf_error
)
2335 error ("%qD has no member named %qE", object_type
, name
);
2336 return error_mark_node
;
2338 if (member
== error_mark_node
)
2339 return error_mark_node
;
2344 tree templ
= member
;
2346 if (BASELINK_P (templ
))
2347 templ
= lookup_template_function (templ
, template_args
);
2350 if (complain
& tf_error
)
2351 error ("%qD is not a member template function", name
);
2352 return error_mark_node
;
2357 if (TREE_DEPRECATED (member
))
2358 warn_deprecated_use (member
);
2361 check_template_keyword (member
);
2363 expr
= build_class_member_access_expr (object
, member
, access_path
,
2364 /*preserve_reference=*/false,
2366 if (processing_template_decl
&& expr
!= error_mark_node
)
2368 if (BASELINK_P (member
))
2370 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2371 BASELINK_QUALIFIED_P (member
) = 1;
2374 return build_min_non_dep (COMPONENT_REF
, expr
,
2375 orig_object
, orig_name
,
2382 /* Return an expression for the MEMBER_NAME field in the internal
2383 representation of PTRMEM, a pointer-to-member function. (Each
2384 pointer-to-member function type gets its own RECORD_TYPE so it is
2385 more convenient to access the fields by name than by FIELD_DECL.)
2386 This routine converts the NAME to a FIELD_DECL and then creates the
2387 node for the complete expression. */
2390 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2396 /* This code is a stripped down version of
2397 build_class_member_access_expr. It does not work to use that
2398 routine directly because it expects the object to be of class
2400 ptrmem_type
= TREE_TYPE (ptrmem
);
2401 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2402 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2403 /*want_type=*/false);
2404 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2405 cp_type_quals (ptrmem_type
));
2406 return fold_build3 (COMPONENT_REF
, member_type
,
2407 ptrmem
, member
, NULL_TREE
);
2410 /* Given an expression PTR for a pointer, return an expression
2411 for the value pointed to.
2412 ERRORSTRING is the name of the operator to appear in error messages.
2414 This function may need to overload OPERATOR_FNNAME.
2415 Must also handle REFERENCE_TYPEs for C++. */
2418 build_x_indirect_ref (tree expr
, const char *errorstring
,
2419 tsubst_flags_t complain
)
2421 tree orig_expr
= expr
;
2424 if (processing_template_decl
)
2426 if (type_dependent_expression_p (expr
))
2427 return build_min_nt (INDIRECT_REF
, expr
);
2428 expr
= build_non_dependent_expr (expr
);
2431 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2432 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2434 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2436 if (processing_template_decl
&& rval
!= error_mark_node
)
2437 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2442 /* Helper function called from c-common. */
2444 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2445 tree ptr
, const char *errorstring
)
2447 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2451 cp_build_indirect_ref (tree ptr
, const char *errorstring
,
2452 tsubst_flags_t complain
)
2456 if (ptr
== error_mark_node
)
2457 return error_mark_node
;
2459 if (ptr
== current_class_ptr
)
2460 return current_class_ref
;
2462 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2463 ? ptr
: decay_conversion (ptr
));
2464 type
= TREE_TYPE (pointer
);
2466 if (POINTER_TYPE_P (type
))
2470 If the type of the expression is "pointer to T," the type
2471 of the result is "T."
2473 We must use the canonical variant because certain parts of
2474 the back end, like fold, do pointer comparisons between
2476 tree t
= canonical_type_variant (TREE_TYPE (type
));
2478 if (CONVERT_EXPR_P (ptr
)
2479 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2481 /* If a warning is issued, mark it to avoid duplicates from
2482 the backend. This only needs to be done at
2483 warn_strict_aliasing > 2. */
2484 if (warn_strict_aliasing
> 2)
2485 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2486 type
, TREE_OPERAND (ptr
, 0)))
2487 TREE_NO_WARNING (ptr
) = 1;
2490 if (VOID_TYPE_P (t
))
2492 /* A pointer to incomplete type (other than cv void) can be
2493 dereferenced [expr.unary.op]/1 */
2494 if (complain
& tf_error
)
2495 error ("%qT is not a pointer-to-object type", type
);
2496 return error_mark_node
;
2498 else if (TREE_CODE (pointer
) == ADDR_EXPR
2499 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2500 /* The POINTER was something like `&x'. We simplify `*&x' to
2502 return TREE_OPERAND (pointer
, 0);
2505 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2507 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2508 so that we get the proper error message if the result is used
2509 to assign to. Also, &* is supposed to be a no-op. */
2510 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2511 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2512 TREE_SIDE_EFFECTS (ref
)
2513 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2517 else if (!(complain
& tf_error
))
2518 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2520 /* `pointer' won't be an error_mark_node if we were given a
2521 pointer to member, so it's cool to check for this here. */
2522 else if (TYPE_PTR_TO_MEMBER_P (type
))
2523 error ("invalid use of %qs on pointer to member", errorstring
);
2524 else if (pointer
!= error_mark_node
)
2527 error ("invalid type argument of %qs", errorstring
);
2529 error ("invalid type argument");
2531 return error_mark_node
;
2534 /* This handles expressions of the form "a[i]", which denotes
2537 This is logically equivalent in C to *(a+i), but we may do it differently.
2538 If A is a variable or a member, we generate a primitive ARRAY_REF.
2539 This avoids forcing the array out of registers, and can work on
2540 arrays that are not lvalues (for example, members of structures returned
2543 If INDEX is of some user-defined type, it must be converted to
2544 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2545 will inherit the type of the array, which will be some pointer type.
2547 LOC is the location to use in building the array reference. */
2550 build_array_ref (tree array
, tree idx
, location_t loc
)
2556 error_at (loc
, "subscript missing in array reference");
2557 return error_mark_node
;
2560 if (TREE_TYPE (array
) == error_mark_node
2561 || TREE_TYPE (idx
) == error_mark_node
)
2562 return error_mark_node
;
2564 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2566 switch (TREE_CODE (array
))
2570 tree value
= build_array_ref (TREE_OPERAND (array
, 1), idx
, loc
);
2571 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2572 TREE_OPERAND (array
, 0), value
);
2573 SET_EXPR_LOCATION (ret
, loc
);
2578 ret
= build_conditional_expr
2579 (TREE_OPERAND (array
, 0),
2580 build_array_ref (TREE_OPERAND (array
, 1), idx
, loc
),
2581 build_array_ref (TREE_OPERAND (array
, 2), idx
, loc
),
2582 tf_warning_or_error
);
2583 protected_set_expr_location (ret
, loc
);
2590 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2594 warn_array_subscript_with_type_char (idx
);
2596 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2598 error_at (loc
, "array subscript is not an integer");
2599 return error_mark_node
;
2602 /* Apply integral promotions *after* noticing character types.
2603 (It is unclear why we do these promotions -- the standard
2604 does not say that we should. In fact, the natural thing would
2605 seem to be to convert IDX to ptrdiff_t; we're performing
2606 pointer arithmetic.) */
2607 idx
= perform_integral_promotions (idx
);
2609 /* An array that is indexed by a non-constant
2610 cannot be stored in a register; we must be able to do
2611 address arithmetic on its address.
2612 Likewise an array of elements of variable size. */
2613 if (TREE_CODE (idx
) != INTEGER_CST
2614 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2615 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2618 if (!cxx_mark_addressable (array
))
2619 return error_mark_node
;
2622 /* An array that is indexed by a constant value which is not within
2623 the array bounds cannot be stored in a register either; because we
2624 would get a crash in store_bit_field/extract_bit_field when trying
2625 to access a non-existent part of the register. */
2626 if (TREE_CODE (idx
) == INTEGER_CST
2627 && TYPE_DOMAIN (TREE_TYPE (array
))
2628 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2630 if (!cxx_mark_addressable (array
))
2631 return error_mark_node
;
2634 if (!lvalue_p (array
))
2635 pedwarn (loc
, OPT_pedantic
,
2636 "ISO C++ forbids subscripting non-lvalue array");
2638 /* Note in C++ it is valid to subscript a `register' array, since
2639 it is valid to take the address of something with that
2640 storage specification. */
2644 while (TREE_CODE (foo
) == COMPONENT_REF
)
2645 foo
= TREE_OPERAND (foo
, 0);
2646 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2647 warning_at (loc
, OPT_Wextra
,
2648 "subscripting array declared %<register%>");
2651 type
= TREE_TYPE (TREE_TYPE (array
));
2652 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2653 /* Array ref is const/volatile if the array elements are
2654 or if the array is.. */
2655 TREE_READONLY (rval
)
2656 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2657 TREE_SIDE_EFFECTS (rval
)
2658 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2659 TREE_THIS_VOLATILE (rval
)
2660 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2661 ret
= require_complete_type (fold_if_not_in_template (rval
));
2662 protected_set_expr_location (ret
, loc
);
2667 tree ar
= default_conversion (array
);
2668 tree ind
= default_conversion (idx
);
2670 /* Put the integer in IND to simplify error checking. */
2671 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2678 if (ar
== error_mark_node
)
2681 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2683 error_at (loc
, "subscripted value is neither array nor pointer");
2684 return error_mark_node
;
2686 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2688 error_at (loc
, "array subscript is not an integer");
2689 return error_mark_node
;
2692 warn_array_subscript_with_type_char (idx
);
2694 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2696 tf_warning_or_error
),
2698 tf_warning_or_error
);
2699 protected_set_expr_location (ret
, loc
);
2704 /* Resolve a pointer to member function. INSTANCE is the object
2705 instance to use, if the member points to a virtual member.
2707 This used to avoid checking for virtual functions if basetype
2708 has no virtual functions, according to an earlier ANSI draft.
2709 With the final ISO C++ rules, such an optimization is
2710 incorrect: A pointer to a derived member can be static_cast
2711 to pointer-to-base-member, as long as the dynamic object
2712 later has the right member. */
2715 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2717 if (TREE_CODE (function
) == OFFSET_REF
)
2718 function
= TREE_OPERAND (function
, 1);
2720 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2722 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2723 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2725 tree instance_ptr
= *instance_ptrptr
;
2726 tree instance_save_expr
= 0;
2727 if (instance_ptr
== error_mark_node
)
2729 if (TREE_CODE (function
) == PTRMEM_CST
)
2731 /* Extracting the function address from a pmf is only
2732 allowed with -Wno-pmf-conversions. It only works for
2734 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
2735 e1
= convert (fntype
, e1
);
2740 error ("object missing in use of %qE", function
);
2741 return error_mark_node
;
2745 if (TREE_SIDE_EFFECTS (instance_ptr
))
2746 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
2748 if (TREE_SIDE_EFFECTS (function
))
2749 function
= save_expr (function
);
2751 /* Start by extracting all the information from the PMF itself. */
2752 e3
= pfn_from_ptrmemfunc (function
);
2753 delta
= delta_from_ptrmemfunc (function
);
2754 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
2755 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
2757 case ptrmemfunc_vbit_in_pfn
:
2758 e1
= cp_build_binary_op (input_location
,
2759 BIT_AND_EXPR
, idx
, integer_one_node
,
2760 tf_warning_or_error
);
2761 idx
= cp_build_binary_op (input_location
,
2762 MINUS_EXPR
, idx
, integer_one_node
,
2763 tf_warning_or_error
);
2766 case ptrmemfunc_vbit_in_delta
:
2767 e1
= cp_build_binary_op (input_location
,
2768 BIT_AND_EXPR
, delta
, integer_one_node
,
2769 tf_warning_or_error
);
2770 delta
= cp_build_binary_op (input_location
,
2771 RSHIFT_EXPR
, delta
, integer_one_node
,
2772 tf_warning_or_error
);
2779 /* Convert down to the right base before using the instance. A
2780 special case is that in a pointer to member of class C, C may
2781 be incomplete. In that case, the function will of course be
2782 a member of C, and no conversion is required. In fact,
2783 lookup_base will fail in that case, because incomplete
2784 classes do not have BINFOs. */
2785 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2786 if (!same_type_ignoring_top_level_qualifiers_p
2787 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
2789 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
2790 basetype
, ba_check
, NULL
);
2791 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
2793 if (instance_ptr
== error_mark_node
)
2794 return error_mark_node
;
2796 /* ...and then the delta in the PMF. */
2797 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2798 instance_ptr
, fold_convert (sizetype
, delta
));
2800 /* Hand back the adjusted 'this' argument to our caller. */
2801 *instance_ptrptr
= instance_ptr
;
2803 /* Next extract the vtable pointer from the object. */
2804 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
2806 vtbl
= cp_build_indirect_ref (vtbl
, NULL
, tf_warning_or_error
);
2807 /* If the object is not dynamic the access invokes undefined
2808 behavior. As it is not executed in this case silence the
2809 spurious warnings it may provoke. */
2810 TREE_NO_WARNING (vtbl
) = 1;
2812 /* Finally, extract the function pointer from the vtable. */
2813 e2
= fold_build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
2814 fold_convert (sizetype
, idx
));
2815 e2
= cp_build_indirect_ref (e2
, NULL
, tf_warning_or_error
);
2816 TREE_CONSTANT (e2
) = 1;
2818 /* When using function descriptors, the address of the
2819 vtable entry is treated as a function pointer. */
2820 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2821 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
2822 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
2823 tf_warning_or_error
));
2825 e2
= fold_convert (TREE_TYPE (e3
), e2
);
2826 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
2828 /* Make sure this doesn't get evaluated first inside one of the
2829 branches of the COND_EXPR. */
2830 if (instance_save_expr
)
2831 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
2832 instance_save_expr
, e1
);
2839 /* Used by the C-common bits. */
2841 build_function_call (tree function
, tree params
)
2843 return cp_build_function_call (function
, params
, tf_warning_or_error
);
2847 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
2849 tree fntype
, fndecl
;
2850 tree name
= NULL_TREE
;
2852 tree original
= function
;
2853 int nargs
, parm_types_len
;
2857 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2858 expressions, like those used for ObjC messenger dispatches. */
2859 function
= objc_rewrite_function_call (function
, params
);
2861 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2862 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2863 if (TREE_CODE (function
) == NOP_EXPR
2864 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2865 function
= TREE_OPERAND (function
, 0);
2867 if (TREE_CODE (function
) == FUNCTION_DECL
)
2869 name
= DECL_NAME (function
);
2871 mark_used (function
);
2874 /* Convert anything with function type to a pointer-to-function. */
2875 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
2876 pedwarn (input_location
, OPT_pedantic
,
2877 "ISO C++ forbids calling %<::main%> from within program");
2879 function
= build_addr_func (function
);
2885 function
= build_addr_func (function
);
2888 if (function
== error_mark_node
)
2889 return error_mark_node
;
2891 fntype
= TREE_TYPE (function
);
2893 if (TYPE_PTRMEMFUNC_P (fntype
))
2895 if (complain
& tf_error
)
2896 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2897 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
2898 original
, original
);
2899 return error_mark_node
;
2902 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2903 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2905 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2906 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2908 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2910 if (complain
& tf_error
)
2911 error ("%qE cannot be used as a function", original
);
2912 return error_mark_node
;
2915 /* fntype now gets the type of function pointed to. */
2916 fntype
= TREE_TYPE (fntype
);
2917 parm_types
= TYPE_ARG_TYPES (fntype
);
2919 /* Allocate storage for converted arguments. */
2920 parm_types_len
= list_length (parm_types
);
2921 nargs
= list_length (params
);
2922 if (parm_types_len
> nargs
)
2923 nargs
= parm_types_len
;
2924 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
2926 /* Convert the parameters to the types declared in the
2927 function prototype, or apply default promotions. */
2928 nargs
= convert_arguments (nargs
, argarray
, parm_types
,
2929 params
, fndecl
, LOOKUP_NORMAL
,
2932 return error_mark_node
;
2934 /* Check for errors in format strings and inappropriately
2936 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
2939 return build_cxx_call (function
, nargs
, argarray
);
2942 /* Convert the actual parameter expressions in the list VALUES
2943 to the types in the list TYPELIST.
2944 If parmdecls is exhausted, or when an element has NULL as its type,
2945 perform the default conversions.
2947 Store the converted arguments in ARGARRAY. NARGS is the size of this array.
2949 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2951 This is also where warnings about wrong number of args are generated.
2953 Returns the actual number of arguments processed (which might be less
2954 than NARGS), or -1 on error.
2956 VALUES is a chain of TREE_LIST nodes with the elements of the list
2957 in the TREE_VALUE slots of those nodes.
2959 In C++, unspecified trailing parameters can be filled in with their
2960 default arguments, if such were specified. Do so here. */
2963 convert_arguments (int nargs
, tree
*argarray
,
2964 tree typelist
, tree values
, tree fndecl
, int flags
,
2965 tsubst_flags_t complain
)
2967 tree typetail
, valtail
;
2968 const char *called_thing
= 0;
2971 /* Argument passing is always copy-initialization. */
2972 flags
|= LOOKUP_ONLYCONVERTING
;
2976 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2978 if (DECL_NAME (fndecl
) == NULL_TREE
2979 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2980 called_thing
= "constructor";
2982 called_thing
= "member function";
2985 called_thing
= "function";
2988 for (valtail
= values
, typetail
= typelist
;
2990 valtail
= TREE_CHAIN (valtail
), i
++)
2992 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2993 tree val
= TREE_VALUE (valtail
);
2995 if (val
== error_mark_node
|| type
== error_mark_node
)
2998 if (type
== void_type_node
)
3000 if (complain
& tf_error
)
3004 error ("too many arguments to %s %q+#D",
3005 called_thing
, fndecl
);
3006 error ("at this point in file");
3009 error ("too many arguments to function");
3016 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3017 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3018 if (TREE_CODE (val
) == NOP_EXPR
3019 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3020 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3021 val
= TREE_OPERAND (val
, 0);
3023 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3025 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3026 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3027 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3028 val
= decay_conversion (val
);
3031 if (val
== error_mark_node
)
3036 /* Formal parm type is specified by a function prototype. */
3039 if (!COMPLETE_TYPE_P (complete_type (type
)))
3041 if (complain
& tf_error
)
3044 error ("parameter %P of %qD has incomplete type %qT",
3047 error ("parameter %P has incomplete type %qT", i
, type
);
3049 parmval
= error_mark_node
;
3053 parmval
= convert_for_initialization
3054 (NULL_TREE
, type
, val
, flags
,
3055 "argument passing", fndecl
, i
, complain
);
3056 parmval
= convert_for_arg_passing (type
, parmval
);
3059 if (parmval
== error_mark_node
)
3062 argarray
[i
] = parmval
;
3066 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3067 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3068 /* Don't do ellipsis conversion for __built_in_constant_p
3069 as this will result in spurious warnings for non-POD
3071 val
= require_complete_type (val
);
3073 val
= convert_arg_to_ellipsis (val
);
3079 typetail
= TREE_CHAIN (typetail
);
3082 if (typetail
!= 0 && typetail
!= void_list_node
)
3084 /* See if there are default arguments that can be used. Because
3085 we hold default arguments in the FUNCTION_TYPE (which is so
3086 wrong), we can see default parameters here from deduced
3087 contexts (and via typeof) for indirect function calls.
3088 Fortunately we know whether we have a function decl to
3089 provide default arguments in a language conformant
3091 if (fndecl
&& TREE_PURPOSE (typetail
)
3092 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3094 for (; typetail
!= void_list_node
; ++i
)
3097 = convert_default_arg (TREE_VALUE (typetail
),
3098 TREE_PURPOSE (typetail
),
3101 if (parmval
== error_mark_node
)
3104 argarray
[i
] = parmval
;
3105 typetail
= TREE_CHAIN (typetail
);
3106 /* ends with `...'. */
3107 if (typetail
== NULL_TREE
)
3113 if (complain
& tf_error
)
3117 error ("too few arguments to %s %q+#D",
3118 called_thing
, fndecl
);
3119 error ("at this point in file");
3122 error ("too few arguments to function");
3128 gcc_assert (i
<= nargs
);
3132 /* Build a binary-operation expression, after performing default
3133 conversions on the operands. CODE is the kind of expression to
3134 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3135 are the tree codes which correspond to ARG1 and ARG2 when issuing
3136 warnings about possibly misplaced parentheses. They may differ
3137 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3138 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3139 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3140 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3141 ARG2_CODE as ERROR_MARK. */
3144 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3145 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3146 tsubst_flags_t complain
)
3155 if (processing_template_decl
)
3157 if (type_dependent_expression_p (arg1
)
3158 || type_dependent_expression_p (arg2
))
3159 return build_min_nt (code
, arg1
, arg2
);
3160 arg1
= build_non_dependent_expr (arg1
);
3161 arg2
= build_non_dependent_expr (arg2
);
3164 if (code
== DOTSTAR_EXPR
)
3165 expr
= build_m_component_ref (arg1
, arg2
);
3167 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3168 overloaded_p
, complain
);
3170 /* Check for cases such as x+y<<z which users are likely to
3171 misinterpret. But don't warn about obj << x + y, since that is a
3172 common idiom for I/O. */
3173 if (warn_parentheses
3174 && !processing_template_decl
3175 && !error_operand_p (arg1
)
3176 && !error_operand_p (arg2
)
3177 && (code
!= LSHIFT_EXPR
3178 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3179 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3181 if (processing_template_decl
&& expr
!= error_mark_node
)
3182 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3187 /* For the c-common bits. */
3189 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3190 int convert_p ATTRIBUTE_UNUSED
)
3192 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3196 /* Build a binary-operation expression without default conversions.
3197 CODE is the kind of expression to build.
3198 LOCATION is the location_t of the operator in the source code.
3199 This function differs from `build' in several ways:
3200 the data type of the result is computed and recorded in it,
3201 warnings are generated if arg data types are invalid,
3202 special handling for addition and subtraction of pointers is known,
3203 and some optimization is done (operations on narrow ints
3204 are done in the narrower type when that gives the same result).
3205 Constant folding is also done before the result is returned.
3207 Note that the operands will never have enumeral types
3208 because either they have just had the default conversions performed
3209 or they have both just been converted to some other type in which
3210 the arithmetic is to be done.
3212 C++: must do special pointer arithmetic when implementing
3213 multiple inheritance, and deal with pointer to member functions. */
3216 cp_build_binary_op (location_t location
,
3217 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3218 tsubst_flags_t complain
)
3221 enum tree_code code0
, code1
;
3223 const char *invalid_op_diag
;
3225 /* Expression code to give to the expression when it is built.
3226 Normally this is CODE, which is what the caller asked for,
3227 but in some special cases we change it. */
3228 enum tree_code resultcode
= code
;
3230 /* Data type in which the computation is to be performed.
3231 In the simplest cases this is the common type of the arguments. */
3232 tree result_type
= NULL
;
3234 /* Nonzero means operands have already been type-converted
3235 in whatever way is necessary.
3236 Zero means they need to be converted to RESULT_TYPE. */
3239 /* Nonzero means create the expression with this type, rather than
3241 tree build_type
= 0;
3243 /* Nonzero means after finally constructing the expression
3244 convert it to this type. */
3245 tree final_type
= 0;
3249 /* Nonzero if this is an operation like MIN or MAX which can
3250 safely be computed in short if both args are promoted shorts.
3251 Also implies COMMON.
3252 -1 indicates a bitwise operation; this makes a difference
3253 in the exact conditions for when it is safe to do the operation
3254 in a narrower mode. */
3257 /* Nonzero if this is a comparison operation;
3258 if both args are promoted shorts, compare the original shorts.
3259 Also implies COMMON. */
3260 int short_compare
= 0;
3262 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3265 /* True if both operands have arithmetic type. */
3266 bool arithmetic_types_p
;
3268 /* Apply default conversions. */
3272 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3273 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3274 || code
== TRUTH_XOR_EXPR
)
3276 if (!really_overloaded_fn (op0
))
3277 op0
= decay_conversion (op0
);
3278 if (!really_overloaded_fn (op1
))
3279 op1
= decay_conversion (op1
);
3283 if (!really_overloaded_fn (op0
))
3284 op0
= default_conversion (op0
);
3285 if (!really_overloaded_fn (op1
))
3286 op1
= default_conversion (op1
);
3289 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3290 STRIP_TYPE_NOPS (op0
);
3291 STRIP_TYPE_NOPS (op1
);
3293 /* DTRT if one side is an overloaded function, but complain about it. */
3294 if (type_unknown_p (op0
))
3296 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3297 if (t
!= error_mark_node
)
3299 if (complain
& tf_error
)
3300 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3305 if (type_unknown_p (op1
))
3307 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3308 if (t
!= error_mark_node
)
3310 if (complain
& tf_error
)
3311 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3317 type0
= TREE_TYPE (op0
);
3318 type1
= TREE_TYPE (op1
);
3320 /* The expression codes of the data types of the arguments tell us
3321 whether the arguments are integers, floating, pointers, etc. */
3322 code0
= TREE_CODE (type0
);
3323 code1
= TREE_CODE (type1
);
3325 /* If an error was already reported for one of the arguments,
3326 avoid reporting another error. */
3328 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3329 return error_mark_node
;
3331 if ((invalid_op_diag
3332 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3334 error (invalid_op_diag
);
3335 return error_mark_node
;
3341 /* Subtraction of two similar pointers.
3342 We must subtract them as integers, then divide by object size. */
3343 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3344 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3346 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3347 /* In all other cases except pointer - int, the usual arithmetic
3349 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3354 /* The pointer - int case is just like pointer + int; fall
3357 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3358 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3362 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3363 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3364 if (processing_template_decl
)
3366 result_type
= TREE_TYPE (ptr_operand
);
3369 return cp_pointer_int_sum (code
,
3380 case TRUNC_DIV_EXPR
:
3382 case FLOOR_DIV_EXPR
:
3383 case ROUND_DIV_EXPR
:
3384 case EXACT_DIV_EXPR
:
3385 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3386 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3387 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3388 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3390 enum tree_code tcode0
= code0
, tcode1
= code1
;
3392 warn_for_div_by_zero (location
, op1
);
3394 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3395 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3396 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3397 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3399 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3400 resultcode
= RDIV_EXPR
;
3402 /* When dividing two signed integers, we have to promote to int.
3403 unless we divide by a constant != -1. Note that default
3404 conversion will have been performed on the operands at this
3405 point, so we have to dig out the original type to find out if
3407 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3408 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3409 || (TREE_CODE (op1
) == INTEGER_CST
3410 && ! integer_all_onesp (op1
)));
3419 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3420 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3421 && !VECTOR_FLOAT_TYPE_P (type0
)
3422 && !VECTOR_FLOAT_TYPE_P (type1
)))
3426 case TRUNC_MOD_EXPR
:
3427 case FLOOR_MOD_EXPR
:
3428 warn_for_div_by_zero (location
, op1
);
3430 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3432 /* Although it would be tempting to shorten always here, that loses
3433 on some targets, since the modulo instruction is undefined if the
3434 quotient can't be represented in the computation mode. We shorten
3435 only if unsigned or if dividing by something we know != -1. */
3436 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3437 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3438 || (TREE_CODE (op1
) == INTEGER_CST
3439 && ! integer_all_onesp (op1
)));
3444 case TRUTH_ANDIF_EXPR
:
3445 case TRUTH_ORIF_EXPR
:
3446 case TRUTH_AND_EXPR
:
3448 result_type
= boolean_type_node
;
3451 /* Shift operations: result has same type as first operand;
3452 always convert second operand to int.
3453 Also set SHORT_SHIFT if shifting rightward. */
3456 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3458 result_type
= type0
;
3459 if (TREE_CODE (op1
) == INTEGER_CST
)
3461 if (tree_int_cst_lt (op1
, integer_zero_node
))
3463 if (complain
& tf_warning
)
3464 warning (0, "right shift count is negative");
3468 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3469 && (complain
& tf_warning
))
3470 warning (0, "right shift count >= width of type");
3473 /* Convert the shift-count to an integer, regardless of
3474 size of value being shifted. */
3475 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3476 op1
= cp_convert (integer_type_node
, op1
);
3477 /* Avoid converting op1 to result_type later. */
3483 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3485 result_type
= type0
;
3486 if (TREE_CODE (op1
) == INTEGER_CST
)
3488 if (tree_int_cst_lt (op1
, integer_zero_node
))
3490 if (complain
& tf_warning
)
3491 warning (0, "left shift count is negative");
3493 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3495 if (complain
& tf_warning
)
3496 warning (0, "left shift count >= width of type");
3499 /* Convert the shift-count to an integer, regardless of
3500 size of value being shifted. */
3501 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3502 op1
= cp_convert (integer_type_node
, op1
);
3503 /* Avoid converting op1 to result_type later. */
3510 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3512 result_type
= type0
;
3513 if (TREE_CODE (op1
) == INTEGER_CST
)
3515 if (tree_int_cst_lt (op1
, integer_zero_node
))
3517 if (complain
& tf_warning
)
3518 warning (0, (code
== LROTATE_EXPR
)
3519 ? G_("left rotate count is negative")
3520 : G_("right rotate count is negative"));
3522 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3524 if (complain
& tf_warning
)
3525 warning (0, (code
== LROTATE_EXPR
)
3526 ? G_("left rotate count >= width of type")
3527 : G_("right rotate count >= width of type"));
3530 /* Convert the shift-count to an integer, regardless of
3531 size of value being shifted. */
3532 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3533 op1
= cp_convert (integer_type_node
, op1
);
3539 if ((complain
& tf_warning
)
3540 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3541 warning (OPT_Wfloat_equal
,
3542 "comparing floating point with == or != is unsafe");
3543 if ((complain
& tf_warning
)
3544 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3545 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3546 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3548 build_type
= boolean_type_node
;
3549 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3550 || code0
== COMPLEX_TYPE
)
3551 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3552 || code1
== COMPLEX_TYPE
))
3554 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3555 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3556 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3557 "comparison", complain
);
3558 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3559 && null_ptr_cst_p (op1
))
3561 if (TREE_CODE (op0
) == ADDR_EXPR
3562 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3564 if (complain
& tf_warning
)
3565 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3566 TREE_OPERAND (op0
, 0));
3568 result_type
= type0
;
3570 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3571 && null_ptr_cst_p (op0
))
3573 if (TREE_CODE (op1
) == ADDR_EXPR
3574 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3576 if (complain
& tf_warning
)
3577 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3578 TREE_OPERAND (op1
, 0));
3580 result_type
= type1
;
3582 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3584 result_type
= type0
;
3585 if (complain
& tf_error
)
3586 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3588 return error_mark_node
;
3590 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3592 result_type
= type1
;
3593 if (complain
& tf_error
)
3594 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3596 return error_mark_node
;
3598 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3600 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3601 == ptrmemfunc_vbit_in_delta
)
3603 tree pfn0
= pfn_from_ptrmemfunc (op0
);
3604 tree delta0
= delta_from_ptrmemfunc (op0
);
3605 tree e1
= cp_build_binary_op (location
,
3608 fold_convert (TREE_TYPE (pfn0
),
3611 tree e2
= cp_build_binary_op (location
,
3616 e2
= cp_build_binary_op (location
,
3617 EQ_EXPR
, e2
, integer_zero_node
,
3619 op0
= cp_build_binary_op (location
,
3620 TRUTH_ANDIF_EXPR
, e1
, e2
,
3622 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
3626 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3627 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3629 result_type
= TREE_TYPE (op0
);
3631 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3632 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
3633 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
3636 /* E will be the final comparison. */
3638 /* E1 and E2 are for scratch. */
3646 type
= composite_pointer_type (type0
, type1
, op0
, op1
, "comparison",
3649 if (!same_type_p (TREE_TYPE (op0
), type
))
3650 op0
= cp_convert_and_check (type
, op0
);
3651 if (!same_type_p (TREE_TYPE (op1
), type
))
3652 op1
= cp_convert_and_check (type
, op1
);
3654 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3655 return error_mark_node
;
3657 if (TREE_SIDE_EFFECTS (op0
))
3658 op0
= save_expr (op0
);
3659 if (TREE_SIDE_EFFECTS (op1
))
3660 op1
= save_expr (op1
);
3662 pfn0
= pfn_from_ptrmemfunc (op0
);
3663 pfn1
= pfn_from_ptrmemfunc (op1
);
3664 delta0
= delta_from_ptrmemfunc (op0
);
3665 delta1
= delta_from_ptrmemfunc (op1
);
3666 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3667 == ptrmemfunc_vbit_in_delta
)
3672 && ((op0.delta == op1.delta)
3673 || (!op0.pfn && op0.delta & 1 == 0
3674 && op1.delta & 1 == 0))
3676 The reason for the `!op0.pfn' bit is that a NULL
3677 pointer-to-member is any member with a zero PFN and
3678 LSB of the DELTA field is 0. */
3680 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
3684 e1
= cp_build_binary_op (location
,
3685 EQ_EXPR
, e1
, integer_zero_node
,
3687 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
3691 e2
= cp_build_binary_op (location
,
3692 EQ_EXPR
, e2
, integer_zero_node
,
3694 e1
= cp_build_binary_op (location
,
3695 TRUTH_ANDIF_EXPR
, e2
, e1
,
3697 e2
= cp_build_binary_op (location
, EQ_EXPR
,
3699 fold_convert (TREE_TYPE (pfn0
),
3702 e2
= cp_build_binary_op (location
,
3703 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
3704 e1
= cp_build_binary_op (location
,
3705 EQ_EXPR
, delta0
, delta1
, complain
);
3706 e1
= cp_build_binary_op (location
,
3707 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
3714 && (!op0.pfn || op0.delta == op1.delta))
3716 The reason for the `!op0.pfn' bit is that a NULL
3717 pointer-to-member is any member with a zero PFN; the
3718 DELTA field is unspecified. */
3720 e1
= cp_build_binary_op (location
,
3721 EQ_EXPR
, delta0
, delta1
, complain
);
3722 e2
= cp_build_binary_op (location
,
3725 fold_convert (TREE_TYPE (pfn0
),
3728 e1
= cp_build_binary_op (location
,
3729 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
3731 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
3732 e
= cp_build_binary_op (location
,
3733 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
3734 if (code
== EQ_EXPR
)
3736 return cp_build_binary_op (location
,
3737 EQ_EXPR
, e
, integer_zero_node
, complain
);
3741 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
3742 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
3744 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
3745 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
3753 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3754 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3756 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3757 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3758 "comparison", complain
);
3765 if (TREE_CODE (orig_op0
) == STRING_CST
3766 || TREE_CODE (orig_op1
) == STRING_CST
)
3768 if (complain
& tf_warning
)
3769 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3772 build_type
= boolean_type_node
;
3773 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3774 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3776 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3777 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3778 "comparison", complain
);
3779 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3780 && integer_zerop (op1
))
3781 result_type
= type0
;
3782 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3783 && integer_zerop (op0
))
3784 result_type
= type1
;
3785 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3787 result_type
= type0
;
3788 if (complain
& tf_error
)
3789 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3791 return error_mark_node
;
3793 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3795 result_type
= type1
;
3796 if (complain
& tf_error
)
3797 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3799 return error_mark_node
;
3803 case UNORDERED_EXPR
:
3810 build_type
= integer_type_node
;
3811 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
3813 if (complain
& tf_error
)
3814 error ("unordered comparison on non-floating point argument");
3815 return error_mark_node
;
3824 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3825 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3826 || code1
== COMPLEX_TYPE
)))
3827 arithmetic_types_p
= 1;
3830 arithmetic_types_p
= 0;
3831 /* Vector arithmetic is only allowed when both sides are vectors. */
3832 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
3834 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
3835 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
3838 binary_op_error (location
, code
, type0
, type1
);
3839 return error_mark_node
;
3841 arithmetic_types_p
= 1;
3844 /* Determine the RESULT_TYPE, if it is not already known. */
3846 && arithmetic_types_p
3847 && (shorten
|| common
|| short_compare
))
3848 result_type
= cp_common_type (type0
, type1
);
3852 if (complain
& tf_error
)
3853 error ("invalid operands of types %qT and %qT to binary %qO",
3854 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
3855 return error_mark_node
;
3858 /* If we're in a template, the only thing we need to know is the
3860 if (processing_template_decl
)
3862 /* Since the middle-end checks the type when doing a build2, we
3863 need to build the tree in pieces. This built tree will never
3864 get out of the front-end as we replace it when instantiating
3866 tree tmp
= build2 (resultcode
,
3867 build_type
? build_type
: result_type
,
3869 TREE_OPERAND (tmp
, 0) = op0
;
3873 if (arithmetic_types_p
)
3875 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3877 /* For certain operations (which identify themselves by shorten != 0)
3878 if both args were extended from the same smaller type,
3879 do the arithmetic in that type and then extend.
3881 shorten !=0 and !=1 indicates a bitwise operation.
3882 For them, this optimization is safe only if
3883 both args are zero-extended or both are sign-extended.
3884 Otherwise, we might change the result.
3885 E.g., (short)-1 | (unsigned short)-1 is (int)-1
3886 but calculated in (unsigned short) it would be (unsigned short)-1. */
3888 if (shorten
&& none_complex
)
3890 final_type
= result_type
;
3891 result_type
= shorten_binary_op (result_type
, op0
, op1
,
3895 /* Comparison operations are shortened too but differently.
3896 They identify themselves by setting short_compare = 1. */
3900 /* Don't write &op0, etc., because that would prevent op0
3901 from being kept in a register.
3902 Instead, make copies of the our local variables and
3903 pass the copies by reference, then copy them back afterward. */
3904 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3905 enum tree_code xresultcode
= resultcode
;
3907 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3909 return cp_convert (boolean_type_node
, val
);
3910 op0
= xop0
, op1
= xop1
;
3912 resultcode
= xresultcode
;
3915 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
3916 && warn_sign_compare
3917 /* Do not warn until the template is instantiated; we cannot
3918 bound the ranges of the arguments until that point. */
3919 && !processing_template_decl
3920 && (complain
& tf_warning
))
3922 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
3923 result_type
, resultcode
);
3927 /* Issue warnings about peculiar, but valid, uses of NULL. */
3928 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3929 /* It's reasonable to use pointer values as operands of &&
3930 and ||, so NULL is no exception. */
3931 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3932 && ( /* Both are NULL (or 0) and the operation was not a comparison. */
3933 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3934 && code
!= EQ_EXPR
&& code
!= NE_EXPR
)
3935 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3936 || (!null_ptr_cst_p (orig_op0
) && TREE_CODE (TREE_TYPE (op0
)) != POINTER_TYPE
)
3937 || (!null_ptr_cst_p (orig_op1
) && TREE_CODE (TREE_TYPE (op1
)) != POINTER_TYPE
))
3938 && (complain
& tf_warning
))
3939 /* Some sort of arithmetic operation involving NULL was
3940 performed. Note that pointer-difference and pointer-addition
3941 have already been handled above, and so we don't end up here in
3943 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3946 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3947 Then the expression will be built.
3948 It will be given type FINAL_TYPE if that is nonzero;
3949 otherwise, it will be given type RESULT_TYPE. */
3952 if (TREE_TYPE (op0
) != result_type
)
3953 op0
= cp_convert_and_check (result_type
, op0
);
3954 if (TREE_TYPE (op1
) != result_type
)
3955 op1
= cp_convert_and_check (result_type
, op1
);
3957 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3958 return error_mark_node
;
3961 if (build_type
== NULL_TREE
)
3962 build_type
= result_type
;
3964 result
= build2 (resultcode
, build_type
, op0
, op1
);
3965 result
= fold_if_not_in_template (result
);
3966 if (final_type
!= 0)
3967 result
= cp_convert (final_type
, result
);
3969 if (TREE_OVERFLOW_P (result
)
3970 && !TREE_OVERFLOW_P (op0
)
3971 && !TREE_OVERFLOW_P (op1
))
3972 overflow_warning (result
);
3977 /* Return a tree for the sum or difference (RESULTCODE says which)
3978 of pointer PTROP and integer INTOP. */
3981 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3983 tree res_type
= TREE_TYPE (ptrop
);
3985 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3986 in certain circumstance (when it's valid to do so). So we need
3987 to make sure it's complete. We don't need to check here, if we
3988 can actually complete it at all, as those checks will be done in
3989 pointer_int_sum() anyway. */
3990 complete_type (TREE_TYPE (res_type
));
3992 return pointer_int_sum (resultcode
, ptrop
,
3993 fold_if_not_in_template (intop
));
3996 /* Return a tree for the difference of pointers OP0 and OP1.
3997 The resulting tree has type int. */
4000 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4003 tree restype
= ptrdiff_type_node
;
4004 tree target_type
= TREE_TYPE (ptrtype
);
4006 if (!complete_type_or_else (target_type
, NULL_TREE
))
4007 return error_mark_node
;
4009 if (TREE_CODE (target_type
) == VOID_TYPE
)
4010 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4011 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4012 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4013 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4014 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4016 /* First do the subtraction as integers;
4017 then drop through to build the divide operator. */
4019 op0
= cp_build_binary_op (input_location
,
4021 cp_convert (restype
, op0
),
4022 cp_convert (restype
, op1
),
4023 tf_warning_or_error
);
4025 /* This generates an error if op1 is a pointer to an incomplete type. */
4026 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4027 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4029 op1
= (TYPE_PTROB_P (ptrtype
)
4030 ? size_in_bytes (target_type
)
4031 : integer_one_node
);
4033 /* Do the division. */
4035 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4036 return fold_if_not_in_template (result
);
4039 /* Construct and perhaps optimize a tree representation
4040 for a unary operation. CODE, a tree_code, specifies the operation
4041 and XARG is the operand. */
4044 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4046 tree orig_expr
= xarg
;
4050 if (processing_template_decl
)
4052 if (type_dependent_expression_p (xarg
))
4053 return build_min_nt (code
, xarg
, NULL_TREE
);
4055 xarg
= build_non_dependent_expr (xarg
);
4060 /* [expr.unary.op] says:
4062 The address of an object of incomplete type can be taken.
4064 (And is just the ordinary address operator, not an overloaded
4065 "operator &".) However, if the type is a template
4066 specialization, we must complete the type at this point so that
4067 an overloaded "operator &" will be available if required. */
4068 if (code
== ADDR_EXPR
4069 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4070 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4071 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4072 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4073 /* Don't look for a function. */;
4075 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4076 /*overloaded_p=*/NULL
, complain
);
4077 if (!exp
&& code
== ADDR_EXPR
)
4079 /* A pointer to member-function can be formed only by saying
4081 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4082 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4084 if (TREE_CODE (xarg
) != OFFSET_REF
4085 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4087 error ("invalid use of %qE to form a pointer-to-member-function",
4089 if (TREE_CODE (xarg
) != OFFSET_REF
)
4090 inform (input_location
, " a qualified-id is required");
4091 return error_mark_node
;
4095 error ("parentheses around %qE cannot be used to form a"
4096 " pointer-to-member-function",
4098 PTRMEM_OK_P (xarg
) = 1;
4102 if (TREE_CODE (xarg
) == OFFSET_REF
)
4104 ptrmem
= PTRMEM_OK_P (xarg
);
4106 if (!ptrmem
&& !flag_ms_extensions
4107 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4109 /* A single non-static member, make sure we don't allow a
4110 pointer-to-member. */
4111 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4112 TREE_OPERAND (xarg
, 0),
4113 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4114 PTRMEM_OK_P (xarg
) = ptrmem
;
4117 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4118 warning (0, "taking address of temporary");
4119 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4122 if (processing_template_decl
&& exp
!= error_mark_node
)
4123 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4124 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4125 if (TREE_CODE (exp
) == ADDR_EXPR
)
4126 PTRMEM_OK_P (exp
) = ptrmem
;
4130 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4131 constants, where a null value is represented by an INTEGER_CST of
4135 cp_truthvalue_conversion (tree expr
)
4137 tree type
= TREE_TYPE (expr
);
4138 if (TYPE_PTRMEM_P (type
))
4139 return build_binary_op (EXPR_LOCATION (expr
),
4140 NE_EXPR
, expr
, integer_zero_node
, 1);
4142 return c_common_truthvalue_conversion (input_location
, expr
);
4145 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4148 condition_conversion (tree expr
)
4151 if (processing_template_decl
)
4153 t
= perform_implicit_conversion (boolean_type_node
, expr
,
4154 tf_warning_or_error
);
4155 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4159 /* Return an ADDR_EXPR giving the address of T. This function
4160 attempts no optimizations or simplifications; it is a low-level
4164 build_address (tree t
)
4168 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4169 return error_mark_node
;
4171 addr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (t
)), t
);
4176 /* Return a NOP_EXPR converting EXPR to TYPE. */
4179 build_nop (tree type
, tree expr
)
4181 if (type
== error_mark_node
|| error_operand_p (expr
))
4183 return build1 (NOP_EXPR
, type
, expr
);
4186 /* C++: Must handle pointers to members.
4188 Perhaps type instantiation should be extended to handle conversion
4189 from aggregates to types we don't yet know we want? (Or are those
4190 cases typically errors which should be reported?)
4192 NOCONVERT nonzero suppresses the default promotions
4193 (such as from short to int). */
4196 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4197 tsubst_flags_t complain
)
4199 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4202 const char *errstring
= NULL
;
4204 const char *invalid_op_diag
;
4206 if (error_operand_p (arg
))
4207 return error_mark_node
;
4209 if ((invalid_op_diag
4210 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4215 error (invalid_op_diag
);
4216 return error_mark_node
;
4221 case UNARY_PLUS_EXPR
:
4224 int flags
= WANT_ARITH
| WANT_ENUM
;
4225 /* Unary plus (but not unary minus) is allowed on pointers. */
4226 if (code
== UNARY_PLUS_EXPR
)
4227 flags
|= WANT_POINTER
;
4228 arg
= build_expr_type_conversion (flags
, arg
, true);
4230 errstring
= (code
== NEGATE_EXPR
4231 ? "wrong type argument to unary minus"
4232 : "wrong type argument to unary plus");
4235 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4236 arg
= perform_integral_promotions (arg
);
4238 /* Make sure the result is not an lvalue: a unary plus or minus
4239 expression is always a rvalue. */
4246 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4250 arg
= default_conversion (arg
);
4252 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4255 errstring
= "wrong type argument to bit-complement";
4256 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4257 arg
= perform_integral_promotions (arg
);
4261 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4262 errstring
= "wrong type argument to abs";
4263 else if (!noconvert
)
4264 arg
= default_conversion (arg
);
4268 /* Conjugating a real value is a no-op, but allow it anyway. */
4269 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4270 errstring
= "wrong type argument to conjugation";
4271 else if (!noconvert
)
4272 arg
= default_conversion (arg
);
4275 case TRUTH_NOT_EXPR
:
4276 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4278 val
= invert_truthvalue (arg
);
4279 if (arg
!= error_mark_node
)
4281 errstring
= "in argument to unary !";
4288 if (TREE_CODE (arg
) == COMPLEX_CST
)
4289 return TREE_REALPART (arg
);
4290 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4292 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4293 return fold_if_not_in_template (arg
);
4299 if (TREE_CODE (arg
) == COMPLEX_CST
)
4300 return TREE_IMAGPART (arg
);
4301 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4303 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4304 return fold_if_not_in_template (arg
);
4307 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4309 case PREINCREMENT_EXPR
:
4310 case POSTINCREMENT_EXPR
:
4311 case PREDECREMENT_EXPR
:
4312 case POSTDECREMENT_EXPR
:
4313 /* Handle complex lvalues (when permitted)
4314 by reduction to simpler cases. */
4316 val
= unary_complex_lvalue (code
, arg
);
4320 /* Increment or decrement the real part of the value,
4321 and don't change the imaginary part. */
4322 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4326 arg
= stabilize_reference (arg
);
4327 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4328 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4329 real
= cp_build_unary_op (code
, real
, 1, complain
);
4330 if (real
== error_mark_node
|| imag
== error_mark_node
)
4331 return error_mark_node
;
4332 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4336 /* Report invalid types. */
4338 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4341 if (code
== PREINCREMENT_EXPR
)
4342 errstring
="no pre-increment operator for type";
4343 else if (code
== POSTINCREMENT_EXPR
)
4344 errstring
="no post-increment operator for type";
4345 else if (code
== PREDECREMENT_EXPR
)
4346 errstring
="no pre-decrement operator for type";
4348 errstring
="no post-decrement operator for type";
4351 else if (arg
== error_mark_node
)
4352 return error_mark_node
;
4354 /* Report something read-only. */
4356 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4357 || TREE_READONLY (arg
))
4359 if (complain
& tf_error
)
4360 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4361 || code
== POSTINCREMENT_EXPR
)
4362 ? "increment" : "decrement"));
4364 return error_mark_node
;
4369 tree declared_type
= unlowered_expr_type (arg
);
4371 argtype
= TREE_TYPE (arg
);
4373 /* ARM $5.2.5 last annotation says this should be forbidden. */
4374 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4376 if (complain
& tf_error
)
4377 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4378 ? G_("ISO C++ forbids incrementing an enum")
4379 : G_("ISO C++ forbids decrementing an enum"));
4381 return error_mark_node
;
4384 /* Compute the increment. */
4386 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4388 tree type
= complete_type (TREE_TYPE (argtype
));
4390 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4392 if (complain
& tf_error
)
4393 error (((code
== PREINCREMENT_EXPR
4394 || code
== POSTINCREMENT_EXPR
))
4395 ? G_("cannot increment a pointer to incomplete type %qT")
4396 : G_("cannot decrement a pointer to incomplete type %qT"),
4397 TREE_TYPE (argtype
));
4399 return error_mark_node
;
4401 else if ((pedantic
|| warn_pointer_arith
)
4402 && !TYPE_PTROB_P (argtype
))
4404 if (complain
& tf_error
)
4405 permerror (input_location
, (code
== PREINCREMENT_EXPR
4406 || code
== POSTINCREMENT_EXPR
)
4407 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4408 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4411 return error_mark_node
;
4414 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4417 inc
= integer_one_node
;
4419 inc
= cp_convert (argtype
, inc
);
4421 /* Complain about anything else that is not a true lvalue. */
4422 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4423 || code
== POSTINCREMENT_EXPR
)
4424 ? lv_increment
: lv_decrement
),
4426 return error_mark_node
;
4428 /* Forbid using -- on `bool'. */
4429 if (same_type_p (declared_type
, boolean_type_node
))
4431 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4433 if (complain
& tf_error
)
4434 error ("invalid use of Boolean expression as operand "
4435 "to %<operator--%>");
4436 return error_mark_node
;
4438 val
= boolean_increment (code
, arg
);
4441 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4443 TREE_SIDE_EFFECTS (val
) = 1;
4448 /* Note that this operation never does default_conversion
4449 regardless of NOCONVERT. */
4451 argtype
= lvalue_type (arg
);
4453 if (TREE_CODE (arg
) == OFFSET_REF
)
4456 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4458 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4459 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4462 else if (DECL_MAIN_P (arg
))
4465 if (complain
& tf_error
)
4466 permerror (input_location
, "ISO C++ forbids taking address of function %<::main%>");
4468 return error_mark_node
;
4471 /* Let &* cancel out to simplify resulting code. */
4472 if (TREE_CODE (arg
) == INDIRECT_REF
)
4474 /* We don't need to have `current_class_ptr' wrapped in a
4475 NON_LVALUE_EXPR node. */
4476 if (arg
== current_class_ref
)
4477 return current_class_ptr
;
4479 arg
= TREE_OPERAND (arg
, 0);
4480 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4482 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4483 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4486 /* Don't let this be an lvalue. */
4491 /* Uninstantiated types are all functions. Taking the
4492 address of a function is a no-op, so just return the
4495 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4496 || !IDENTIFIER_OPNAME_P (arg
));
4498 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4499 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4501 /* They're trying to take the address of a unique non-static
4502 member function. This is ill-formed (except in MS-land),
4503 but let's try to DTRT.
4504 Note: We only handle unique functions here because we don't
4505 want to complain if there's a static overload; non-unique
4506 cases will be handled by instantiate_type. But we need to
4507 handle this case here to allow casts on the resulting PMF.
4508 We could defer this in non-MS mode, but it's easier to give
4509 a useful error here. */
4511 /* Inside constant member functions, the `this' pointer
4512 contains an extra const qualifier. TYPE_MAIN_VARIANT
4513 is used here to remove this const from the diagnostics
4514 and the created OFFSET_REF. */
4515 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4516 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4519 if (! flag_ms_extensions
)
4521 tree name
= DECL_NAME (fn
);
4522 if (!(complain
& tf_error
))
4523 return error_mark_node
;
4524 else if (current_class_type
4525 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4526 /* An expression like &memfn. */
4527 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
4528 " or parenthesized non-static member function to form"
4529 " a pointer to member function. Say %<&%T::%D%>",
4532 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
4533 " function to form a pointer to member function."
4537 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4541 if (type_unknown_p (arg
))
4542 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4544 /* Handle complex lvalues (when permitted)
4545 by reduction to simpler cases. */
4546 val
= unary_complex_lvalue (code
, arg
);
4550 switch (TREE_CODE (arg
))
4554 case FIX_TRUNC_EXPR
:
4555 /* Even if we're not being pedantic, we cannot allow this
4556 extension when we're instantiating in a SFINAE
4558 if (! lvalue_p (arg
) && complain
== tf_none
)
4560 if (complain
& tf_error
)
4561 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4563 return error_mark_node
;
4568 arg
= BASELINK_FUNCTIONS (arg
);
4572 arg
= OVL_CURRENT (arg
);
4576 /* Turn a reference to a non-static data member into a
4577 pointer-to-member. */
4582 if (!PTRMEM_OK_P (arg
))
4583 return cp_build_unary_op (code
, arg
, 0, complain
);
4585 t
= TREE_OPERAND (arg
, 1);
4586 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4588 if (complain
& tf_error
)
4589 error ("cannot create pointer to reference member %qD", t
);
4590 return error_mark_node
;
4593 type
= build_ptrmem_type (context_for_name_lookup (t
),
4595 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4603 /* Anything not already handled and not a true memory reference
4605 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4606 && TREE_CODE (argtype
) != METHOD_TYPE
4607 && TREE_CODE (arg
) != OFFSET_REF
4608 && !lvalue_or_else (arg
, lv_addressof
, complain
))
4609 return error_mark_node
;
4611 if (argtype
!= error_mark_node
)
4612 argtype
= build_pointer_type (argtype
);
4614 /* In a template, we are processing a non-dependent expression
4615 so we can just form an ADDR_EXPR with the correct type. */
4616 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
4618 val
= build_address (arg
);
4619 if (TREE_CODE (arg
) == OFFSET_REF
)
4620 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4622 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4624 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4626 /* We can only get here with a single static member
4628 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4629 && DECL_STATIC_FUNCTION_P (fn
));
4631 val
= build_address (fn
);
4632 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4633 /* Do not lose object's side effects. */
4634 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4635 TREE_OPERAND (arg
, 0), val
);
4637 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4639 if (complain
& tf_error
)
4640 error ("attempt to take address of bit-field structure member %qD",
4641 TREE_OPERAND (arg
, 1));
4642 return error_mark_node
;
4646 tree object
= TREE_OPERAND (arg
, 0);
4647 tree field
= TREE_OPERAND (arg
, 1);
4648 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4649 (TREE_TYPE (object
), decl_type_context (field
)));
4650 val
= build_address (arg
);
4653 if (TREE_CODE (argtype
) == POINTER_TYPE
4654 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4656 build_ptrmemfunc_type (argtype
);
4657 val
= build_ptrmemfunc (argtype
, val
, 0,
4658 /*c_cast_p=*/false);
4670 argtype
= TREE_TYPE (arg
);
4671 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
4674 if (complain
& tf_error
)
4675 error ("%s", errstring
);
4676 return error_mark_node
;
4679 /* Hook for the c-common bits that build a unary op. */
4681 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
4682 enum tree_code code
, tree xarg
, int noconvert
)
4684 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
4687 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4688 for certain kinds of expressions which are not really lvalues
4689 but which we can accept as lvalues.
4691 If ARG is not a kind of expression we can handle, return
4695 unary_complex_lvalue (enum tree_code code
, tree arg
)
4697 /* Inside a template, making these kinds of adjustments is
4698 pointless; we are only concerned with the type of the
4700 if (processing_template_decl
)
4703 /* Handle (a, b) used as an "lvalue". */
4704 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4706 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
4707 tf_warning_or_error
);
4708 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4709 TREE_OPERAND (arg
, 0), real_result
);
4712 /* Handle (a ? b : c) used as an "lvalue". */
4713 if (TREE_CODE (arg
) == COND_EXPR
4714 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4715 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
4717 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4718 if (TREE_CODE (arg
) == MODIFY_EXPR
4719 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4720 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4722 tree lvalue
= TREE_OPERAND (arg
, 0);
4723 if (TREE_SIDE_EFFECTS (lvalue
))
4725 lvalue
= stabilize_reference (lvalue
);
4726 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
4727 lvalue
, TREE_OPERAND (arg
, 1));
4729 return unary_complex_lvalue
4730 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
4733 if (code
!= ADDR_EXPR
)
4736 /* Handle (a = b) used as an "lvalue" for `&'. */
4737 if (TREE_CODE (arg
) == MODIFY_EXPR
4738 || TREE_CODE (arg
) == INIT_EXPR
)
4740 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
4741 tf_warning_or_error
);
4742 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4744 TREE_NO_WARNING (arg
) = 1;
4748 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4749 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4750 || TREE_CODE (arg
) == OFFSET_REF
)
4753 /* We permit compiler to make function calls returning
4754 objects of aggregate type look like lvalues. */
4758 if (TREE_CODE (targ
) == SAVE_EXPR
)
4759 targ
= TREE_OPERAND (targ
, 0);
4761 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
4763 if (TREE_CODE (arg
) == SAVE_EXPR
)
4766 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4767 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4770 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4771 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4772 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4775 /* Don't let anything else be handled specially. */
4779 /* Mark EXP saying that we need to be able to take the
4780 address of it; it should not be allocated in a register.
4781 Value is true if successful.
4783 C++: we do not allow `current_class_ptr' to be addressable. */
4786 cxx_mark_addressable (tree exp
)
4791 switch (TREE_CODE (x
))
4798 x
= TREE_OPERAND (x
, 0);
4802 if (x
== current_class_ptr
)
4804 error ("cannot take the address of %<this%>, which is an rvalue expression");
4805 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
4811 /* Caller should not be trying to mark initialized
4812 constant fields addressable. */
4813 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
4814 || DECL_IN_AGGR_P (x
) == 0
4816 || DECL_EXTERNAL (x
));
4821 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4822 && !DECL_ARTIFICIAL (x
))
4824 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
4827 ("address of explicit register variable %qD requested", x
);
4830 else if (extra_warnings
)
4832 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
4834 TREE_ADDRESSABLE (x
) = 1;
4838 TREE_ADDRESSABLE (x
) = 1;
4842 TREE_ADDRESSABLE (x
) = 1;
4846 TREE_ADDRESSABLE (x
) = 1;
4847 cxx_mark_addressable (TREE_OPERAND (x
, 0));
4855 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4858 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
4859 tsubst_flags_t complain
)
4861 tree orig_ifexp
= ifexp
;
4862 tree orig_op1
= op1
;
4863 tree orig_op2
= op2
;
4866 if (processing_template_decl
)
4868 /* The standard says that the expression is type-dependent if
4869 IFEXP is type-dependent, even though the eventual type of the
4870 expression doesn't dependent on IFEXP. */
4871 if (type_dependent_expression_p (ifexp
)
4872 /* As a GNU extension, the middle operand may be omitted. */
4873 || (op1
&& type_dependent_expression_p (op1
))
4874 || type_dependent_expression_p (op2
))
4875 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4876 ifexp
= build_non_dependent_expr (ifexp
);
4878 op1
= build_non_dependent_expr (op1
);
4879 op2
= build_non_dependent_expr (op2
);
4882 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
4883 if (processing_template_decl
&& expr
!= error_mark_node
)
4884 return build_min_non_dep (COND_EXPR
, expr
,
4885 orig_ifexp
, orig_op1
, orig_op2
);
4889 /* Given a list of expressions, return a compound expression
4890 that performs them all and returns the value of the last of them. */
4892 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
4894 tree expr
= TREE_VALUE (list
);
4896 if (TREE_CHAIN (list
))
4899 permerror (input_location
, "%s expression list treated as compound expression", msg
);
4901 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
4902 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
4903 tf_warning_or_error
);
4909 /* Handle overloading of the ',' operator when needed. */
4912 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
4915 tree orig_op1
= op1
;
4916 tree orig_op2
= op2
;
4918 if (processing_template_decl
)
4920 if (type_dependent_expression_p (op1
)
4921 || type_dependent_expression_p (op2
))
4922 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
4923 op1
= build_non_dependent_expr (op1
);
4924 op2
= build_non_dependent_expr (op2
);
4927 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
4928 /*overloaded_p=*/NULL
, complain
);
4930 result
= cp_build_compound_expr (op1
, op2
, complain
);
4932 if (processing_template_decl
&& result
!= error_mark_node
)
4933 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
4938 /* Like cp_build_compound_expr, but for the c-common bits. */
4941 build_compound_expr (tree lhs
, tree rhs
)
4943 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
4946 /* Build a compound expression. */
4949 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
4951 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
4953 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
4954 return error_mark_node
;
4956 if (TREE_CODE (rhs
) == TARGET_EXPR
)
4958 /* If the rhs is a TARGET_EXPR, then build the compound
4959 expression inside the target_expr's initializer. This
4960 helps the compiler to eliminate unnecessary temporaries. */
4961 tree init
= TREE_OPERAND (rhs
, 1);
4963 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
4964 TREE_OPERAND (rhs
, 1) = init
;
4969 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
4972 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
4973 casts away constness. CAST gives the type of cast. */
4976 check_for_casting_away_constness (tree src_type
, tree dest_type
,
4977 enum tree_code cast
)
4979 /* C-style casts are allowed to cast away constness. With
4980 WARN_CAST_QUAL, we still want to issue a warning. */
4981 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
4984 if (casts_away_constness (src_type
, dest_type
))
4988 warning (OPT_Wcast_qual
,
4989 "cast from type %qT to type %qT casts away constness",
4990 src_type
, dest_type
);
4993 case STATIC_CAST_EXPR
:
4994 error ("static_cast from type %qT to type %qT casts away constness",
4995 src_type
, dest_type
);
4998 case REINTERPRET_CAST_EXPR
:
4999 error ("reinterpret_cast from type %qT to type %qT casts away constness",
5000 src_type
, dest_type
);
5007 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5008 (another pointer-to-member type in the same hierarchy) and return
5009 the converted expression. If ALLOW_INVERSE_P is permitted, a
5010 pointer-to-derived may be converted to pointer-to-base; otherwise,
5011 only the other direction is permitted. If C_CAST_P is true, this
5012 conversion is taking place as part of a C-style cast. */
5015 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5018 if (TYPE_PTRMEM_P (type
))
5022 if (TREE_CODE (expr
) == PTRMEM_CST
)
5023 expr
= cplus_expand_constant (expr
);
5024 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5025 TYPE_PTRMEM_CLASS_TYPE (type
),
5028 if (!integer_zerop (delta
))
5030 tree cond
, op1
, op2
;
5032 cond
= cp_build_binary_op (input_location
,
5035 build_int_cst (TREE_TYPE (expr
), -1),
5036 tf_warning_or_error
);
5037 op1
= build_nop (ptrdiff_type_node
, expr
);
5038 op2
= cp_build_binary_op (input_location
,
5039 PLUS_EXPR
, op1
, delta
,
5040 tf_warning_or_error
);
5042 expr
= fold_build3 (COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5046 return build_nop (type
, expr
);
5049 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5050 allow_inverse_p
, c_cast_p
);
5053 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5054 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5055 Otherwise, return EXPR unchanged. */
5058 ignore_overflows (tree expr
, tree orig
)
5060 if (TREE_CODE (expr
) == INTEGER_CST
5061 && CONSTANT_CLASS_P (orig
)
5062 && TREE_CODE (orig
) != STRING_CST
5063 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5065 if (!TREE_OVERFLOW (orig
))
5066 /* Ensure constant sharing. */
5067 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5068 TREE_INT_CST_LOW (expr
),
5069 TREE_INT_CST_HIGH (expr
));
5072 /* Avoid clobbering a shared constant. */
5073 expr
= copy_node (expr
);
5074 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5080 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5081 this static_cast is being attempted as one of the possible casts
5082 allowed by a C-style cast. (In that case, accessibility of base
5083 classes is not considered, and it is OK to cast away
5084 constness.) Return the result of the cast. *VALID_P is set to
5085 indicate whether or not the cast was valid. */
5088 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5089 bool *valid_p
, tsubst_flags_t complain
)
5095 /* Assume the cast is valid. */
5098 intype
= TREE_TYPE (expr
);
5100 /* Save casted types in the function's used types hash table. */
5101 used_types_insert (type
);
5103 /* [expr.static.cast]
5105 An lvalue of type "cv1 B", where B is a class type, can be cast
5106 to type "reference to cv2 D", where D is a class derived (clause
5107 _class.derived_) from B, if a valid standard conversion from
5108 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5109 same cv-qualification as, or greater cv-qualification than, cv1,
5110 and B is not a virtual base class of D. */
5111 /* We check this case before checking the validity of "TYPE t =
5112 EXPR;" below because for this case:
5115 struct D : public B { D(const B&); };
5117 void f() { static_cast<const D&>(b); }
5119 we want to avoid constructing a new D. The standard is not
5120 completely clear about this issue, but our interpretation is
5121 consistent with other compilers. */
5122 if (TREE_CODE (type
) == REFERENCE_TYPE
5123 && CLASS_TYPE_P (TREE_TYPE (type
))
5124 && CLASS_TYPE_P (intype
)
5125 && real_lvalue_p (expr
)
5126 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5127 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5128 build_pointer_type (TYPE_MAIN_VARIANT
5129 (TREE_TYPE (type
))))
5131 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5135 /* There is a standard conversion from "D*" to "B*" even if "B"
5136 is ambiguous or inaccessible. If this is really a
5137 static_cast, then we check both for inaccessibility and
5138 ambiguity. However, if this is a static_cast being performed
5139 because the user wrote a C-style cast, then accessibility is
5141 base
= lookup_base (TREE_TYPE (type
), intype
,
5142 c_cast_p
? ba_unique
: ba_check
,
5145 /* Convert from "B*" to "D*". This function will check that "B"
5146 is not a virtual base of "D". */
5147 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5148 base
, /*nonnull=*/false);
5149 /* Convert the pointer to a reference -- but then remember that
5150 there are no expressions with reference type in C++. */
5151 return convert_from_reference (build_nop (type
, expr
));
5156 /* [expr.static.cast]
5158 An expression e can be explicitly converted to a type T using a
5159 static_cast of the form static_cast<T>(e) if the declaration T
5160 t(e);" is well-formed, for some invented temporary variable
5162 result
= perform_direct_initialization_if_possible (type
, expr
,
5163 c_cast_p
, complain
);
5166 result
= convert_from_reference (result
);
5168 /* Ignore any integer overflow caused by the cast. */
5169 result
= ignore_overflows (result
, orig
);
5171 /* [expr.static.cast]
5173 If T is a reference type, the result is an lvalue; otherwise,
5174 the result is an rvalue. */
5175 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5176 result
= rvalue (result
);
5180 /* [expr.static.cast]
5182 Any expression can be explicitly converted to type cv void. */
5183 if (TREE_CODE (type
) == VOID_TYPE
)
5184 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5186 /* [expr.static.cast]
5188 The inverse of any standard conversion sequence (clause _conv_),
5189 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5190 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5191 (_conv.bool_) conversions, can be performed explicitly using
5192 static_cast subject to the restriction that the explicit
5193 conversion does not cast away constness (_expr.const.cast_), and
5194 the following additional rules for specific cases: */
5195 /* For reference, the conversions not excluded are: integral
5196 promotions, floating point promotion, integral conversions,
5197 floating point conversions, floating-integral conversions,
5198 pointer conversions, and pointer to member conversions. */
5201 A value of integral _or enumeration_ type can be explicitly
5202 converted to an enumeration type. */
5203 /* The effect of all that is that any conversion between any two
5204 types which are integral, floating, or enumeration types can be
5206 if ((INTEGRAL_TYPE_P (type
) || SCALAR_FLOAT_TYPE_P (type
))
5207 && (INTEGRAL_TYPE_P (intype
) || SCALAR_FLOAT_TYPE_P (intype
)))
5209 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5211 /* Ignore any integer overflow caused by the cast. */
5212 expr
= ignore_overflows (expr
, orig
);
5216 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5217 && CLASS_TYPE_P (TREE_TYPE (type
))
5218 && CLASS_TYPE_P (TREE_TYPE (intype
))
5219 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5220 (TREE_TYPE (intype
))),
5221 build_pointer_type (TYPE_MAIN_VARIANT
5222 (TREE_TYPE (type
)))))
5227 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5228 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5229 c_cast_p
? ba_unique
: ba_check
,
5231 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5234 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5235 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5242 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5243 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5245 if (TYPE_PTRMEM_P (type
))
5247 t1
= (build_ptrmem_type
5249 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5250 t2
= (build_ptrmem_type
5252 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5259 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5262 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5263 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5268 /* [expr.static.cast]
5270 An rvalue of type "pointer to cv void" can be explicitly
5271 converted to a pointer to object type. A value of type pointer
5272 to object converted to "pointer to cv void" and back to the
5273 original pointer type will have its original value. */
5274 if (TREE_CODE (intype
) == POINTER_TYPE
5275 && VOID_TYPE_P (TREE_TYPE (intype
))
5276 && TYPE_PTROB_P (type
))
5279 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5280 return build_nop (type
, expr
);
5284 return error_mark_node
;
5287 /* Return an expression representing static_cast<TYPE>(EXPR). */
5290 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5295 if (type
== error_mark_node
|| expr
== error_mark_node
)
5296 return error_mark_node
;
5298 if (processing_template_decl
)
5300 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5301 /* We don't know if it will or will not have side effects. */
5302 TREE_SIDE_EFFECTS (expr
) = 1;
5303 return convert_from_reference (expr
);
5306 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5307 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5308 if (TREE_CODE (type
) != REFERENCE_TYPE
5309 && TREE_CODE (expr
) == NOP_EXPR
5310 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5311 expr
= TREE_OPERAND (expr
, 0);
5313 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5318 if (complain
& tf_error
)
5319 error ("invalid static_cast from type %qT to type %qT",
5320 TREE_TYPE (expr
), type
);
5321 return error_mark_node
;
5324 /* EXPR is an expression with member function or pointer-to-member
5325 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5326 not permitted by ISO C++, but we accept it in some modes. If we
5327 are not in one of those modes, issue a diagnostic. Return the
5328 converted expression. */
5331 convert_member_func_to_ptr (tree type
, tree expr
)
5336 intype
= TREE_TYPE (expr
);
5337 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5338 || TREE_CODE (intype
) == METHOD_TYPE
);
5340 if (pedantic
|| warn_pmf2ptr
)
5341 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5342 "converting from %qT to %qT", intype
, type
);
5344 if (TREE_CODE (intype
) == METHOD_TYPE
)
5345 expr
= build_addr_func (expr
);
5346 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5347 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5350 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5351 decl
= build_address (decl
);
5352 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5355 return build_nop (type
, expr
);
5358 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5359 If C_CAST_P is true, this reinterpret cast is being done as part of
5360 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5361 indicate whether or not reinterpret_cast was valid. */
5364 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5365 bool *valid_p
, tsubst_flags_t complain
)
5369 /* Assume the cast is invalid. */
5373 if (type
== error_mark_node
|| error_operand_p (expr
))
5374 return error_mark_node
;
5376 intype
= TREE_TYPE (expr
);
5378 /* Save casted types in the function's used types hash table. */
5379 used_types_insert (type
);
5381 /* [expr.reinterpret.cast]
5382 An lvalue expression of type T1 can be cast to the type
5383 "reference to T2" if an expression of type "pointer to T1" can be
5384 explicitly converted to the type "pointer to T2" using a
5385 reinterpret_cast. */
5386 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5388 if (! real_lvalue_p (expr
))
5390 if (complain
& tf_error
)
5391 error ("invalid cast of an rvalue expression of type "
5394 return error_mark_node
;
5397 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5398 "B" are related class types; the reinterpret_cast does not
5399 adjust the pointer. */
5400 if (TYPE_PTR_P (intype
)
5401 && (complain
& tf_warning
)
5402 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
5403 COMPARE_BASE
| COMPARE_DERIVED
)))
5404 warning (0, "casting %qT to %qT does not dereference pointer",
5407 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5408 if (expr
!= error_mark_node
)
5409 expr
= build_reinterpret_cast_1
5410 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
5412 if (expr
!= error_mark_node
)
5413 expr
= cp_build_indirect_ref (expr
, 0, complain
);
5417 /* As a G++ extension, we consider conversions from member
5418 functions, and pointers to member functions to
5419 pointer-to-function and pointer-to-void types. If
5420 -Wno-pmf-conversions has not been specified,
5421 convert_member_func_to_ptr will issue an error message. */
5422 if ((TYPE_PTRMEMFUNC_P (intype
)
5423 || TREE_CODE (intype
) == METHOD_TYPE
)
5424 && TYPE_PTR_P (type
)
5425 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
5426 || VOID_TYPE_P (TREE_TYPE (type
))))
5427 return convert_member_func_to_ptr (type
, expr
);
5429 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5430 array-to-pointer, and function-to-pointer conversions are
5432 expr
= decay_conversion (expr
);
5434 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5435 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5436 if (TREE_CODE (expr
) == NOP_EXPR
5437 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5438 expr
= TREE_OPERAND (expr
, 0);
5440 if (error_operand_p (expr
))
5441 return error_mark_node
;
5443 intype
= TREE_TYPE (expr
);
5445 /* [expr.reinterpret.cast]
5446 A pointer can be converted to any integral type large enough to
5448 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
5450 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5452 if (complain
& tf_error
)
5453 permerror (input_location
, "cast from %qT to %qT loses precision",
5456 return error_mark_node
;
5459 /* [expr.reinterpret.cast]
5460 A value of integral or enumeration type can be explicitly
5461 converted to a pointer. */
5462 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
5465 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5466 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5467 return fold_if_not_in_template (build_nop (type
, expr
));
5468 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5469 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5474 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
5475 /* Warn about possible alignment problems. */
5476 if (STRICT_ALIGNMENT
&& warn_cast_align
5477 && (complain
& tf_warning
)
5478 && !VOID_TYPE_P (type
)
5479 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
5480 && COMPLETE_TYPE_P (TREE_TYPE (type
))
5481 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
5482 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
5483 warning (OPT_Wcast_align
, "cast from %qT to %qT "
5484 "increases required alignment of target type", intype
, type
);
5486 /* We need to strip nops here, because the front end likes to
5487 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5489 if (warn_strict_aliasing
<= 2)
5490 strict_aliasing_warning (intype
, type
, sexpr
);
5492 return fold_if_not_in_template (build_nop (type
, expr
));
5494 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
5495 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
5497 if (pedantic
&& (complain
& tf_warning
))
5498 /* Only issue a warning, as we have always supported this
5499 where possible, and it is necessary in some cases. DR 195
5500 addresses this issue, but as of 2004/10/26 is still in
5502 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5503 return fold_if_not_in_template (build_nop (type
, expr
));
5505 else if (TREE_CODE (type
) == VECTOR_TYPE
)
5506 return fold_if_not_in_template (convert_to_vector (type
, expr
));
5507 else if (TREE_CODE (intype
) == VECTOR_TYPE
&& INTEGRAL_TYPE_P (type
))
5508 return fold_if_not_in_template (convert_to_integer (type
, expr
));
5513 if (complain
& tf_error
)
5514 error ("invalid cast from type %qT to type %qT", intype
, type
);
5515 return error_mark_node
;
5518 return cp_convert (type
, expr
);
5522 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5524 if (type
== error_mark_node
|| expr
== error_mark_node
)
5525 return error_mark_node
;
5527 if (processing_template_decl
)
5529 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
5531 if (!TREE_SIDE_EFFECTS (t
)
5532 && type_dependent_expression_p (expr
))
5533 /* There might turn out to be side effects inside expr. */
5534 TREE_SIDE_EFFECTS (t
) = 1;
5535 return convert_from_reference (t
);
5538 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
5539 /*valid_p=*/NULL
, complain
);
5542 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5543 return an appropriate expression. Otherwise, return
5544 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5545 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5546 performing a C-style cast, its value upon return will indicate
5547 whether or not the conversion succeeded. */
5550 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
5554 tree reference_type
;
5556 /* Callers are responsible for handling error_mark_node as a
5557 destination type. */
5558 gcc_assert (dst_type
!= error_mark_node
);
5559 /* In a template, callers should be building syntactic
5560 representations of casts, not using this machinery. */
5561 gcc_assert (!processing_template_decl
);
5563 /* Assume the conversion is invalid. */
5567 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
5570 error ("invalid use of const_cast with type %qT, "
5571 "which is not a pointer, "
5572 "reference, nor a pointer-to-data-member type", dst_type
);
5573 return error_mark_node
;
5576 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
5579 error ("invalid use of const_cast with type %qT, which is a pointer "
5580 "or reference to a function type", dst_type
);
5581 return error_mark_node
;
5584 /* Save casted types in the function's used types hash table. */
5585 used_types_insert (dst_type
);
5587 src_type
= TREE_TYPE (expr
);
5588 /* Expressions do not really have reference types. */
5589 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
5590 src_type
= TREE_TYPE (src_type
);
5592 /* [expr.const.cast]
5594 An lvalue of type T1 can be explicitly converted to an lvalue of
5595 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5596 types) if a pointer to T1 can be explicitly converted to the type
5597 pointer to T2 using a const_cast. */
5598 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
5600 reference_type
= dst_type
;
5601 if (! real_lvalue_p (expr
))
5604 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5605 src_type
, dst_type
);
5606 return error_mark_node
;
5608 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
5609 src_type
= build_pointer_type (src_type
);
5613 reference_type
= NULL_TREE
;
5614 /* If the destination type is not a reference type, the
5615 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5616 conversions are performed. */
5617 src_type
= type_decays_to (src_type
);
5618 if (src_type
== error_mark_node
)
5619 return error_mark_node
;
5622 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
5623 && comp_ptr_ttypes_const (dst_type
, src_type
))
5628 /* This cast is actually a C-style cast. Issue a warning if
5629 the user is making a potentially unsafe cast. */
5630 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
5634 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
5635 complain
? tf_warning_or_error
: tf_none
);
5636 expr
= build_nop (reference_type
, expr
);
5637 return convert_from_reference (expr
);
5641 expr
= decay_conversion (expr
);
5642 /* build_c_cast puts on a NOP_EXPR to make the result not an
5643 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5644 non-lvalue context. */
5645 if (TREE_CODE (expr
) == NOP_EXPR
5646 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5647 expr
= TREE_OPERAND (expr
, 0);
5648 return build_nop (dst_type
, expr
);
5653 error ("invalid const_cast from type %qT to type %qT",
5654 src_type
, dst_type
);
5655 return error_mark_node
;
5659 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5661 if (type
== error_mark_node
|| error_operand_p (expr
))
5662 return error_mark_node
;
5664 if (processing_template_decl
)
5666 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
5668 if (!TREE_SIDE_EFFECTS (t
)
5669 && type_dependent_expression_p (expr
))
5670 /* There might turn out to be side effects inside expr. */
5671 TREE_SIDE_EFFECTS (t
) = 1;
5672 return convert_from_reference (t
);
5675 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
5679 /* Like cp_build_c_cast, but for the c-common bits. */
5682 build_c_cast (tree type
, tree expr
)
5684 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
5687 /* Build an expression representing an explicit C-style cast to type
5688 TYPE of expression EXPR. */
5691 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5697 if (type
== error_mark_node
|| error_operand_p (expr
))
5698 return error_mark_node
;
5700 if (processing_template_decl
)
5702 tree t
= build_min (CAST_EXPR
, type
,
5703 tree_cons (NULL_TREE
, value
, NULL_TREE
));
5704 /* We don't know if it will or will not have side effects. */
5705 TREE_SIDE_EFFECTS (t
) = 1;
5706 return convert_from_reference (t
);
5709 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5710 'Class') should always be retained, because this information aids
5711 in method lookup. */
5712 if (objc_is_object_ptr (type
)
5713 && objc_is_object_ptr (TREE_TYPE (expr
)))
5714 return build_nop (type
, expr
);
5716 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5717 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5718 if (TREE_CODE (type
) != REFERENCE_TYPE
5719 && TREE_CODE (value
) == NOP_EXPR
5720 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5721 value
= TREE_OPERAND (value
, 0);
5723 if (TREE_CODE (type
) == ARRAY_TYPE
)
5725 /* Allow casting from T1* to T2[] because Cfront allows it.
5726 NIHCL uses it. It is not valid ISO C++ however. */
5727 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5729 if (complain
& tf_error
)
5730 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
5732 return error_mark_node
;
5733 type
= build_pointer_type (TREE_TYPE (type
));
5737 if (complain
& tf_error
)
5738 error ("ISO C++ forbids casting to an array type %qT", type
);
5739 return error_mark_node
;
5743 if (TREE_CODE (type
) == FUNCTION_TYPE
5744 || TREE_CODE (type
) == METHOD_TYPE
)
5746 if (complain
& tf_error
)
5747 error ("invalid cast to function type %qT", type
);
5748 return error_mark_node
;
5751 /* A C-style cast can be a const_cast. */
5752 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
5757 /* Or a static cast. */
5758 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
5759 &valid_p
, complain
);
5760 /* Or a reinterpret_cast. */
5762 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
5763 &valid_p
, complain
);
5764 /* The static_cast or reinterpret_cast may be followed by a
5767 /* A valid cast may result in errors if, for example, a
5768 conversion to am ambiguous base class is required. */
5769 && !error_operand_p (result
))
5773 /* Non-class rvalues always have cv-unqualified type. */
5774 if (!CLASS_TYPE_P (type
))
5775 type
= TYPE_MAIN_VARIANT (type
);
5776 result_type
= TREE_TYPE (result
);
5777 if (!CLASS_TYPE_P (result_type
))
5778 result_type
= TYPE_MAIN_VARIANT (result_type
);
5779 /* If the type of RESULT does not match TYPE, perform a
5780 const_cast to make it match. If the static_cast or
5781 reinterpret_cast succeeded, we will differ by at most
5782 cv-qualification, so the follow-on const_cast is guaranteed
5784 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
5786 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
5787 gcc_assert (valid_p
);
5792 return error_mark_node
;
5795 /* For use from the C common bits. */
5797 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
5798 tree lhs
, enum tree_code modifycode
, tree rhs
)
5800 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
5803 /* Build an assignment expression of lvalue LHS from value RHS.
5804 MODIFYCODE is the code for a binary operator that we use
5805 to combine the old value of LHS with RHS to get the new value.
5806 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5808 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5811 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
5812 tsubst_flags_t complain
)
5816 tree lhstype
= TREE_TYPE (lhs
);
5817 tree olhstype
= lhstype
;
5818 bool plain_assign
= (modifycode
== NOP_EXPR
);
5820 /* Avoid duplicate error messages from operands that had errors. */
5821 if (error_operand_p (lhs
) || error_operand_p (rhs
))
5822 return error_mark_node
;
5824 /* Handle control structure constructs used as "lvalues". */
5825 switch (TREE_CODE (lhs
))
5827 /* Handle --foo = 5; as these are valid constructs in C++. */
5828 case PREDECREMENT_EXPR
:
5829 case PREINCREMENT_EXPR
:
5830 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5831 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5832 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5833 TREE_OPERAND (lhs
, 1));
5834 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
5835 modifycode
, rhs
, complain
);
5836 if (newrhs
== error_mark_node
)
5837 return error_mark_node
;
5838 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5840 /* Handle (a, b) used as an "lvalue". */
5842 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
5843 modifycode
, rhs
, complain
);
5844 if (newrhs
== error_mark_node
)
5845 return error_mark_node
;
5846 return build2 (COMPOUND_EXPR
, lhstype
,
5847 TREE_OPERAND (lhs
, 0), newrhs
);
5850 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5851 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5852 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5853 TREE_OPERAND (lhs
, 1));
5854 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
5856 if (newrhs
== error_mark_node
)
5857 return error_mark_node
;
5858 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5862 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5863 when neither operand has side-effects. */
5864 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
5865 return error_mark_node
;
5867 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
5868 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
5870 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
5871 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
5873 TREE_OPERAND (lhs
, 0),
5874 TREE_OPERAND (lhs
, 1)),
5875 TREE_OPERAND (lhs
, 0),
5876 TREE_OPERAND (lhs
, 1));
5879 /* Handle (a ? b : c) used as an "lvalue". */
5882 /* Produce (a ? (b = rhs) : (c = rhs))
5883 except that the RHS goes through a save-expr
5884 so the code to compute it is only emitted once. */
5886 tree preeval
= NULL_TREE
;
5888 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
5890 if (complain
& tf_error
)
5891 error ("void value not ignored as it ought to be");
5892 return error_mark_node
;
5895 rhs
= stabilize_expr (rhs
, &preeval
);
5897 /* Check this here to avoid odd errors when trying to convert
5898 a throw to the type of the COND_EXPR. */
5899 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
5900 return error_mark_node
;
5902 cond
= build_conditional_expr
5903 (TREE_OPERAND (lhs
, 0),
5904 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
5905 modifycode
, rhs
, complain
),
5906 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
5907 modifycode
, rhs
, complain
),
5910 if (cond
== error_mark_node
)
5912 /* Make sure the code to compute the rhs comes out
5913 before the split. */
5915 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
5923 if (modifycode
== INIT_EXPR
)
5925 if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5927 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
5928 /* Call convert to generate an error; see PR 11063. */
5929 rhs
= convert (lhstype
, rhs
);
5930 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
5931 TREE_SIDE_EFFECTS (result
) = 1;
5934 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
5935 /* Do the default thing. */;
5938 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
5939 build_tree_list (NULL_TREE
, rhs
),
5940 lhstype
, LOOKUP_NORMAL
,
5942 if (result
== NULL_TREE
)
5943 return error_mark_node
;
5949 lhs
= require_complete_type (lhs
);
5950 if (lhs
== error_mark_node
)
5951 return error_mark_node
;
5953 if (modifycode
== NOP_EXPR
)
5955 /* `operator=' is not an inheritable operator. */
5956 if (! MAYBE_CLASS_TYPE_P (lhstype
))
5957 /* Do the default thing. */;
5960 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
5961 lhs
, rhs
, make_node (NOP_EXPR
),
5962 /*overloaded_p=*/NULL
,
5964 if (result
== NULL_TREE
)
5965 return error_mark_node
;
5972 /* A binary op has been requested. Combine the old LHS
5973 value with the RHS producing the value we should actually
5974 store into the LHS. */
5975 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
5976 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
5977 || MAYBE_CLASS_TYPE_P (lhstype
)));
5979 lhs
= stabilize_reference (lhs
);
5980 newrhs
= cp_build_binary_op (input_location
,
5981 modifycode
, lhs
, rhs
,
5983 if (newrhs
== error_mark_node
)
5985 if (complain
& tf_error
)
5986 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
5987 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5988 return error_mark_node
;
5991 /* Now it looks like a plain assignment. */
5992 modifycode
= NOP_EXPR
;
5994 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
5995 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
5998 /* The left-hand side must be an lvalue. */
5999 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6000 return error_mark_node
;
6002 /* Warn about modifying something that is `const'. Don't warn if
6003 this is initialization. */
6004 if (modifycode
!= INIT_EXPR
6005 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6006 /* Functions are not modifiable, even though they are
6008 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6009 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6010 /* If it's an aggregate and any field is const, then it is
6011 effectively const. */
6012 || (CLASS_TYPE_P (lhstype
)
6013 && C_TYPE_FIELDS_READONLY (lhstype
))))
6015 if (complain
& tf_error
)
6016 readonly_error (lhs
, "assignment");
6018 return error_mark_node
;
6021 /* If storing into a structure or union member, it may have been given a
6022 lowered bitfield type. We need to convert to the declared type first,
6023 so retrieve it now. */
6025 olhstype
= unlowered_expr_type (lhs
);
6027 /* Convert new value to destination type. */
6029 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6033 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6034 TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))))
6036 if (complain
& tf_error
)
6037 error ("incompatible types in assignment of %qT to %qT",
6038 TREE_TYPE (rhs
), lhstype
);
6039 return error_mark_node
;
6042 /* Allow array assignment in compiler-generated code. */
6043 if (!current_function_decl
|| !DECL_ARTIFICIAL (current_function_decl
))
6045 /* This routine is used for both initialization and assignment.
6046 Make sure the diagnostic message differentiates the context. */
6047 if (complain
& tf_error
)
6049 if (modifycode
== INIT_EXPR
)
6050 error ("array used as initializer");
6052 error ("invalid array assignment");
6054 return error_mark_node
;
6057 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6058 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6059 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6060 /*explicit_value_init_p=*/false,
6061 from_array
, complain
);
6064 if (modifycode
== INIT_EXPR
)
6065 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6066 "initialization", NULL_TREE
, 0,
6069 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6070 NULL_TREE
, 0, complain
);
6072 if (!same_type_p (lhstype
, olhstype
))
6073 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6075 if (modifycode
!= INIT_EXPR
)
6077 if (TREE_CODE (newrhs
) == CALL_EXPR
6078 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6079 newrhs
= build_cplus_new (lhstype
, newrhs
);
6081 /* Can't initialize directly from a TARGET_EXPR, since that would
6082 cause the lhs to be constructed twice, and possibly result in
6083 accidental self-initialization. So we force the TARGET_EXPR to be
6084 expanded without a target. */
6085 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6086 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6087 TREE_OPERAND (newrhs
, 0));
6090 if (newrhs
== error_mark_node
)
6091 return error_mark_node
;
6093 if (c_dialect_objc () && flag_objc_gc
)
6095 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6101 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6102 lhstype
, lhs
, newrhs
);
6104 TREE_SIDE_EFFECTS (result
) = 1;
6106 TREE_NO_WARNING (result
) = 1;
6112 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6113 tsubst_flags_t complain
)
6115 if (processing_template_decl
)
6116 return build_min_nt (MODOP_EXPR
, lhs
,
6117 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6119 if (modifycode
!= NOP_EXPR
)
6121 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6122 make_node (modifycode
),
6123 /*overloaded_p=*/NULL
,
6127 TREE_NO_WARNING (rval
) = 1;
6131 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6134 /* Helper function for get_delta_difference which assumes FROM is a base
6135 class of TO. Returns a delta for the conversion of pointer-to-member
6136 of FROM to pointer-to-member of TO. If the conversion is invalid,
6137 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6138 If C_CAST_P is true, this conversion is taking place as part of a C-style
6142 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6147 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6148 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6150 error (" in pointer to member function conversion");
6151 return size_zero_node
;
6155 if (kind
!= bk_via_virtual
)
6156 return BINFO_OFFSET (binfo
);
6158 /* FROM is a virtual base class of TO. Issue an error or warning
6159 depending on whether or not this is a reinterpret cast. */
6161 error ("pointer to member conversion via virtual base %qT",
6162 BINFO_TYPE (binfo_from_vbase (binfo
)));
6164 return size_zero_node
;
6171 /* Get difference in deltas for different pointer to member function
6172 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6173 the conversion is invalid, the constant is zero. If
6174 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6175 If C_CAST_P is true this conversion is taking place as part of a
6178 Note that the naming of FROM and TO is kind of backwards; the return
6179 value is what we add to a TO in order to get a FROM. They are named
6180 this way because we call this function to find out how to convert from
6181 a pointer to member of FROM to a pointer to member of TO. */
6184 get_delta_difference (tree from
, tree to
,
6185 bool allow_inverse_p
,
6190 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6191 /* Pointer to member of incomplete class is permitted*/
6192 result
= size_zero_node
;
6194 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6198 if (!allow_inverse_p
)
6200 error_not_base_type (from
, to
);
6201 error (" in pointer to member conversion");
6202 result
= size_zero_node
;
6206 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6209 result
= size_diffop (size_zero_node
, result
);
6212 error_not_base_type (from
, to
);
6213 error (" in pointer to member conversion");
6214 result
= size_zero_node
;
6219 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6223 /* Return a constructor for the pointer-to-member-function TYPE using
6224 the other components as specified. */
6227 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6232 VEC(constructor_elt
, gc
) *v
;
6234 /* Pull the FIELD_DECLs out of the type. */
6235 pfn_field
= TYPE_FIELDS (type
);
6236 delta_field
= TREE_CHAIN (pfn_field
);
6238 /* Make sure DELTA has the type we want. */
6239 delta
= convert_and_check (delta_type_node
, delta
);
6241 /* Convert to the correct target type if necessary. */
6242 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6244 /* Finish creating the initializer. */
6245 v
= VEC_alloc(constructor_elt
, gc
, 2);
6246 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6247 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6248 u
= build_constructor (type
, v
);
6249 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6250 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6251 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6253 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6258 /* Build a constructor for a pointer to member function. It can be
6259 used to initialize global variables, local variable, or used
6260 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6263 If FORCE is nonzero, then force this conversion, even if
6264 we would rather not do it. Usually set when using an explicit
6265 cast. A C-style cast is being processed iff C_CAST_P is true.
6267 Return error_mark_node, if something goes wrong. */
6270 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6276 if (error_operand_p (pfn
))
6277 return error_mark_node
;
6279 pfn_type
= TREE_TYPE (pfn
);
6280 to_type
= build_ptrmemfunc_type (type
);
6282 /* Handle multiple conversions of pointer to member functions. */
6283 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6285 tree delta
= NULL_TREE
;
6286 tree npfn
= NULL_TREE
;
6290 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6291 error ("invalid conversion to type %qT from type %qT",
6294 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6295 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6299 /* We don't have to do any conversion to convert a
6300 pointer-to-member to its own type. But, we don't want to
6301 just return a PTRMEM_CST if there's an explicit cast; that
6302 cast should make the expression an invalid template argument. */
6303 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6305 if (same_type_p (to_type
, pfn_type
))
6307 else if (integer_zerop (n
))
6308 return build_reinterpret_cast (to_type
, pfn
,
6309 tf_warning_or_error
);
6312 if (TREE_SIDE_EFFECTS (pfn
))
6313 pfn
= save_expr (pfn
);
6315 /* Obtain the function pointer and the current DELTA. */
6316 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6317 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6320 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6321 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6324 /* Just adjust the DELTA field. */
6325 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6326 (TREE_TYPE (delta
), ptrdiff_type_node
));
6327 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6328 n
= cp_build_binary_op (input_location
,
6329 LSHIFT_EXPR
, n
, integer_one_node
,
6330 tf_warning_or_error
);
6331 delta
= cp_build_binary_op (input_location
,
6332 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6333 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6336 /* Handle null pointer to member function conversions. */
6337 if (integer_zerop (pfn
))
6339 pfn
= build_c_cast (type
, integer_zero_node
);
6340 return build_ptrmemfunc1 (to_type
,
6345 if (type_unknown_p (pfn
))
6346 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6348 fn
= TREE_OPERAND (pfn
, 0);
6349 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6350 /* In a template, we will have preserved the
6352 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6353 return make_ptrmem_cst (to_type
, fn
);
6356 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6359 ??? There is no consistency as to the types returned for the above
6360 values. Some code acts as if it were a sizetype and some as if it were
6361 integer_type_node. */
6364 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
6366 tree type
= TREE_TYPE (cst
);
6367 tree fn
= PTRMEM_CST_MEMBER (cst
);
6368 tree ptr_class
, fn_class
;
6370 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6372 /* The class that the function belongs to. */
6373 fn_class
= DECL_CONTEXT (fn
);
6375 /* The class that we're creating a pointer to member of. */
6376 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
6378 /* First, calculate the adjustment to the function's class. */
6379 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
6382 if (!DECL_VIRTUAL_P (fn
))
6383 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
6386 /* If we're dealing with a virtual function, we have to adjust 'this'
6387 again, to point to the base which provides the vtable entry for
6388 fn; the call will do the opposite adjustment. */
6389 tree orig_class
= DECL_CONTEXT (fn
);
6390 tree binfo
= binfo_or_else (orig_class
, fn_class
);
6391 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6392 *delta
, BINFO_OFFSET (binfo
));
6393 *delta
= fold_if_not_in_template (*delta
);
6395 /* We set PFN to the vtable offset at which the function can be
6396 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6397 case delta is shifted left, and then incremented). */
6398 *pfn
= DECL_VINDEX (fn
);
6399 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
6400 TYPE_SIZE_UNIT (vtable_entry_type
));
6401 *pfn
= fold_if_not_in_template (*pfn
);
6403 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
6405 case ptrmemfunc_vbit_in_pfn
:
6406 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
6408 *pfn
= fold_if_not_in_template (*pfn
);
6411 case ptrmemfunc_vbit_in_delta
:
6412 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
6413 *delta
, integer_one_node
);
6414 *delta
= fold_if_not_in_template (*delta
);
6415 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6416 *delta
, integer_one_node
);
6417 *delta
= fold_if_not_in_template (*delta
);
6424 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
6425 *pfn
= fold_if_not_in_template (*pfn
);
6429 /* Return an expression for PFN from the pointer-to-member function
6433 pfn_from_ptrmemfunc (tree t
)
6435 if (TREE_CODE (t
) == PTRMEM_CST
)
6440 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
6445 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
6448 /* Return an expression for DELTA from the pointer-to-member function
6452 delta_from_ptrmemfunc (tree t
)
6454 if (TREE_CODE (t
) == PTRMEM_CST
)
6459 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
6464 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
6467 /* Convert value RHS to type TYPE as preparation for an assignment to
6468 an lvalue of type TYPE. ERRTYPE is a string to use in error
6469 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6470 are doing the conversion in order to pass the PARMNUMth argument of
6474 convert_for_assignment (tree type
, tree rhs
,
6475 const char *errtype
, tree fndecl
, int parmnum
,
6476 tsubst_flags_t complain
)
6479 enum tree_code coder
;
6481 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6482 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
6483 rhs
= TREE_OPERAND (rhs
, 0);
6485 rhstype
= TREE_TYPE (rhs
);
6486 coder
= TREE_CODE (rhstype
);
6488 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
6489 && vector_types_convertible_p (type
, rhstype
, true))
6490 return convert (type
, rhs
);
6492 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
6493 return error_mark_node
;
6494 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
6495 return error_mark_node
;
6497 /* The RHS of an assignment cannot have void type. */
6498 if (coder
== VOID_TYPE
)
6500 if (complain
& tf_error
)
6501 error ("void value not ignored as it ought to be");
6502 return error_mark_node
;
6505 /* Simplify the RHS if possible. */
6506 if (TREE_CODE (rhs
) == CONST_DECL
)
6507 rhs
= DECL_INITIAL (rhs
);
6509 if (c_dialect_objc ())
6512 tree rname
= fndecl
;
6514 if (!strcmp (errtype
, "assignment"))
6516 else if (!strcmp (errtype
, "initialization"))
6520 tree selector
= objc_message_selector ();
6524 if (selector
&& parmno
> 1)
6531 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
6532 return convert (type
, rhs
);
6537 The expression is implicitly converted (clause _conv_) to the
6538 cv-unqualified type of the left operand.
6540 We allow bad conversions here because by the time we get to this point
6541 we are committed to doing the conversion. If we end up doing a bad
6542 conversion, convert_like will complain. */
6543 if (!can_convert_arg_bad (type
, rhstype
, rhs
))
6545 /* When -Wno-pmf-conversions is use, we just silently allow
6546 conversions from pointers-to-members to plain pointers. If
6547 the conversion doesn't work, cp_convert will complain. */
6549 && TYPE_PTR_P (type
)
6550 && TYPE_PTRMEMFUNC_P (rhstype
))
6551 rhs
= cp_convert (strip_top_quals (type
), rhs
);
6554 if (complain
& tf_error
)
6556 /* If the right-hand side has unknown type, then it is an
6557 overloaded function. Call instantiate_type to get error
6559 if (rhstype
== unknown_type_node
)
6560 instantiate_type (type
, rhs
, tf_warning_or_error
);
6562 error ("cannot convert %qT to %qT for argument %qP to %qD",
6563 rhstype
, type
, parmnum
, fndecl
);
6565 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
6568 return error_mark_node
;
6571 if (warn_missing_format_attribute
)
6573 const enum tree_code codel
= TREE_CODE (type
);
6574 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6576 && check_missing_format_attribute (type
, rhstype
)
6577 && (complain
& tf_warning
))
6578 warning (OPT_Wmissing_format_attribute
,
6579 "%s might be a candidate for a format attribute",
6583 /* If -Wparentheses, warn about a = b = c when a has type bool and b
6585 if (warn_parentheses
6586 && type
== boolean_type_node
6587 && TREE_CODE (rhs
) == MODIFY_EXPR
6588 && !TREE_NO_WARNING (rhs
)
6589 && TREE_TYPE (rhs
) != boolean_type_node
6590 && (complain
& tf_warning
))
6592 warning (OPT_Wparentheses
,
6593 "suggest parentheses around assignment used as truth value");
6594 TREE_NO_WARNING (rhs
) = 1;
6597 return perform_implicit_conversion (strip_top_quals (type
), rhs
, complain
);
6600 /* Convert RHS to be of type TYPE.
6601 If EXP is nonzero, it is the target of the initialization.
6602 ERRTYPE is a string to use in error messages.
6604 Two major differences between the behavior of
6605 `convert_for_assignment' and `convert_for_initialization'
6606 are that references are bashed in the former, while
6607 copied in the latter, and aggregates are assigned in
6608 the former (operator=) while initialized in the
6611 If using constructor make sure no conversion operator exists, if one does
6612 exist, an ambiguity exists.
6614 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6617 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
6618 const char *errtype
, tree fndecl
, int parmnum
,
6619 tsubst_flags_t complain
)
6621 enum tree_code codel
= TREE_CODE (type
);
6623 enum tree_code coder
;
6625 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6626 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6627 if (TREE_CODE (rhs
) == NOP_EXPR
6628 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
6629 && codel
!= REFERENCE_TYPE
)
6630 rhs
= TREE_OPERAND (rhs
, 0);
6632 if (type
== error_mark_node
6633 || rhs
== error_mark_node
6634 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
6635 return error_mark_node
;
6637 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6638 && TREE_CODE (type
) != ARRAY_TYPE
6639 && (TREE_CODE (type
) != REFERENCE_TYPE
6640 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
6641 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6642 && (TREE_CODE (type
) != REFERENCE_TYPE
6643 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
6644 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6645 rhs
= decay_conversion (rhs
);
6647 rhstype
= TREE_TYPE (rhs
);
6648 coder
= TREE_CODE (rhstype
);
6650 if (coder
== ERROR_MARK
)
6651 return error_mark_node
;
6653 /* We accept references to incomplete types, so we can
6654 return here before checking if RHS is of complete type. */
6656 if (codel
== REFERENCE_TYPE
)
6658 /* This should eventually happen in convert_arguments. */
6659 int savew
= 0, savee
= 0;
6662 savew
= warningcount
, savee
= errorcount
;
6663 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
6667 if (warningcount
> savew
)
6668 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
6669 else if (errorcount
> savee
)
6670 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
6676 exp
= require_complete_type (exp
);
6677 if (exp
== error_mark_node
)
6678 return error_mark_node
;
6680 rhstype
= non_reference (rhstype
);
6682 type
= complete_type (type
);
6684 if (MAYBE_CLASS_TYPE_P (type
))
6685 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
6687 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
6691 /* If RETVAL is the address of, or a reference to, a local variable or
6692 temporary give an appropriate warning. */
6695 maybe_warn_about_returning_address_of_local (tree retval
)
6697 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6698 tree whats_returned
= retval
;
6702 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
6703 whats_returned
= TREE_OPERAND (whats_returned
, 1);
6704 else if (CONVERT_EXPR_P (whats_returned
)
6705 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
6706 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6711 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
6713 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6715 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6717 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
6718 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
6720 warning (0, "returning reference to temporary");
6723 if (TREE_CODE (whats_returned
) == VAR_DECL
6724 && DECL_NAME (whats_returned
)
6725 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
6727 warning (0, "reference to non-lvalue returned");
6732 while (TREE_CODE (whats_returned
) == COMPONENT_REF
6733 || TREE_CODE (whats_returned
) == ARRAY_REF
)
6734 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6736 if (DECL_P (whats_returned
)
6737 && DECL_NAME (whats_returned
)
6738 && DECL_FUNCTION_SCOPE_P (whats_returned
)
6739 && !(TREE_STATIC (whats_returned
)
6740 || TREE_PUBLIC (whats_returned
)))
6742 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6743 warning (0, "reference to local variable %q+D returned",
6746 warning (0, "address of local variable %q+D returned",
6752 /* Check that returning RETVAL from the current function is valid.
6753 Return an expression explicitly showing all conversions required to
6754 change RETVAL into the function return type, and to assign it to
6755 the DECL_RESULT for the function. Set *NO_WARNING to true if
6756 code reaches end of non-void function warning shouldn't be issued
6757 on this RETURN_EXPR. */
6760 check_return_expr (tree retval
, bool *no_warning
)
6763 /* The type actually returned by the function, after any
6766 int fn_returns_value_p
;
6767 bool named_return_value_okay_p
;
6769 *no_warning
= false;
6771 /* A `volatile' function is one that isn't supposed to return, ever.
6772 (This is a G++ extension, used to get better code for functions
6773 that call the `volatile' function.) */
6774 if (TREE_THIS_VOLATILE (current_function_decl
))
6775 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6777 /* Check for various simple errors. */
6778 if (DECL_DESTRUCTOR_P (current_function_decl
))
6781 error ("returning a value from a destructor");
6784 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
6786 if (in_function_try_handler
)
6787 /* If a return statement appears in a handler of the
6788 function-try-block of a constructor, the program is ill-formed. */
6789 error ("cannot return from a handler of a function-try-block of a constructor");
6791 /* You can't return a value from a constructor. */
6792 error ("returning a value from a constructor");
6796 if (processing_template_decl
)
6798 current_function_returns_value
= 1;
6799 if (check_for_bare_parameter_packs (retval
))
6800 retval
= error_mark_node
;
6804 /* When no explicit return-value is given in a function with a named
6805 return value, the named return value is used. */
6806 result
= DECL_RESULT (current_function_decl
);
6807 valtype
= TREE_TYPE (result
);
6808 gcc_assert (valtype
!= NULL_TREE
);
6809 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
6810 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
6813 /* Check for a return statement with no return value in a function
6814 that's supposed to return a value. */
6815 if (!retval
&& fn_returns_value_p
)
6817 permerror (input_location
, "return-statement with no value, in function returning %qT",
6819 /* Clear this, so finish_function won't say that we reach the
6820 end of a non-void function (which we don't, we gave a
6822 current_function_returns_null
= 0;
6823 /* And signal caller that TREE_NO_WARNING should be set on the
6824 RETURN_EXPR to avoid control reaches end of non-void function
6825 warnings in tree-cfg.c. */
6828 /* Check for a return statement with a value in a function that
6829 isn't supposed to return a value. */
6830 else if (retval
&& !fn_returns_value_p
)
6832 if (VOID_TYPE_P (TREE_TYPE (retval
)))
6833 /* You can return a `void' value from a function of `void'
6834 type. In that case, we have to evaluate the expression for
6835 its side-effects. */
6836 finish_expr_stmt (retval
);
6838 permerror (input_location
, "return-statement with a value, in function "
6839 "returning 'void'");
6840 current_function_returns_null
= 1;
6842 /* There's really no value to return, after all. */
6846 /* Remember that this function can sometimes return without a
6848 current_function_returns_null
= 1;
6850 /* Remember that this function did return a value. */
6851 current_function_returns_value
= 1;
6853 /* Check for erroneous operands -- but after giving ourselves a
6854 chance to provide an error about returning a value from a void
6856 if (error_operand_p (retval
))
6858 current_function_return_value
= error_mark_node
;
6859 return error_mark_node
;
6862 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6863 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
6864 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
6865 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
6867 && retval
&& null_ptr_cst_p (retval
))
6868 warning (0, "%<operator new%> must not return NULL unless it is "
6869 "declared %<throw()%> (or -fcheck-new is in effect)");
6871 /* Effective C++ rule 15. See also start_function. */
6873 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
6877 /* The function return type must be a reference to the current
6879 if (TREE_CODE (valtype
) == REFERENCE_TYPE
6880 && same_type_ignoring_top_level_qualifiers_p
6881 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
6883 /* Returning '*this' is obviously OK. */
6884 if (retval
== current_class_ref
)
6886 /* If we are calling a function whose return type is the same of
6887 the current class reference, it is ok. */
6888 else if (TREE_CODE (retval
) == INDIRECT_REF
6889 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
6894 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
6897 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6899 [...] For a function with a class return type, if the expression
6900 in the return statement is the name of a local object, and the cv-
6901 unqualified type of the local object is the same as the function
6902 return type, an implementation is permitted to omit creating the tem-
6903 porary object to hold the function return value [...]
6905 So, if this is a value-returning function that always returns the same
6906 local variable, remember it.
6908 It might be nice to be more flexible, and choose the first suitable
6909 variable even if the function sometimes returns something else, but
6910 then we run the risk of clobbering the variable we chose if the other
6911 returned expression uses the chosen variable somehow. And people expect
6912 this restriction, anyway. (jason 2000-11-19)
6914 See finish_function and finalize_nrv for the rest of this optimization. */
6916 named_return_value_okay_p
=
6917 (retval
!= NULL_TREE
6918 /* Must be a local, automatic variable. */
6919 && TREE_CODE (retval
) == VAR_DECL
6920 && DECL_CONTEXT (retval
) == current_function_decl
6921 && ! TREE_STATIC (retval
)
6922 && ! DECL_ANON_UNION_VAR_P (retval
)
6923 && (DECL_ALIGN (retval
)
6924 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
6925 /* The cv-unqualified type of the returned value must be the
6926 same as the cv-unqualified return type of the
6928 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
6930 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
6931 /* And the returned value must be non-volatile. */
6932 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
6934 if (fn_returns_value_p
&& flag_elide_constructors
)
6936 if (named_return_value_okay_p
6937 && (current_function_return_value
== NULL_TREE
6938 || current_function_return_value
== retval
))
6939 current_function_return_value
= retval
;
6941 current_function_return_value
= error_mark_node
;
6944 /* We don't need to do any conversions when there's nothing being
6949 /* Do any required conversions. */
6950 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
6951 /* No conversions are required. */
6955 /* The type the function is declared to return. */
6956 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6957 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
6959 /* The functype's return type will have been set to void, if it
6960 was an incomplete type. Just treat this as 'return;' */
6961 if (VOID_TYPE_P (functype
))
6962 return error_mark_node
;
6964 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
6965 treated as an rvalue for the purposes of overload resolution to
6966 favor move constructors over copy constructors. */
6967 if ((cxx_dialect
!= cxx98
)
6968 && named_return_value_okay_p
6969 /* The variable must not have the `volatile' qualifier. */
6970 && !(cp_type_quals (TREE_TYPE (retval
)) & TYPE_QUAL_VOLATILE
)
6971 /* The return type must be a class type. */
6972 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
6973 flags
= flags
| LOOKUP_PREFER_RVALUE
;
6975 /* First convert the value to the function's return type, then
6976 to the type of return value's location to handle the
6977 case that functype is smaller than the valtype. */
6978 retval
= convert_for_initialization
6979 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
6980 tf_warning_or_error
);
6981 retval
= convert (valtype
, retval
);
6983 /* If the conversion failed, treat this just like `return;'. */
6984 if (retval
== error_mark_node
)
6986 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6987 else if (! cfun
->returns_struct
6988 && TREE_CODE (retval
) == TARGET_EXPR
6989 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
6990 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
6991 TREE_OPERAND (retval
, 0));
6993 maybe_warn_about_returning_address_of_local (retval
);
6996 /* Actually copy the value returned into the appropriate location. */
6997 if (retval
&& retval
!= result
)
6998 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7004 /* Returns nonzero if the pointer-type FROM can be converted to the
7005 pointer-type TO via a qualification conversion. If CONSTP is -1,
7006 then we return nonzero if the pointers are similar, and the
7007 cv-qualification signature of FROM is a proper subset of that of TO.
7009 If CONSTP is positive, then all outer pointers have been
7013 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7015 bool to_more_cv_qualified
= false;
7016 bool is_opaque_pointer
= false;
7018 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7020 if (TREE_CODE (to
) != TREE_CODE (from
))
7023 if (TREE_CODE (from
) == OFFSET_TYPE
7024 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7025 TYPE_OFFSET_BASETYPE (to
)))
7028 /* Const and volatile mean something different for function types,
7029 so the usual checks are not appropriate. */
7030 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7032 /* In Objective-C++, some types may have been 'volatilized' by
7033 the compiler for EH; when comparing them here, the volatile
7034 qualification must be ignored. */
7035 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7037 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7040 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7044 to_more_cv_qualified
= true;
7048 constp
&= TYPE_READONLY (to
);
7051 if (TREE_CODE (to
) == VECTOR_TYPE
)
7052 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7054 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7055 return ((constp
>= 0 || to_more_cv_qualified
)
7056 && (is_opaque_pointer
7057 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7061 /* When comparing, say, char ** to char const **, this function takes
7062 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7063 types to this function. */
7066 comp_ptr_ttypes (tree to
, tree from
)
7068 return comp_ptr_ttypes_real (to
, from
, 1);
7071 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7072 type or inheritance-related types, regardless of cv-quals. */
7075 ptr_reasonably_similar (const_tree to
, const_tree from
)
7077 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7079 /* Any target type is similar enough to void. */
7080 if (TREE_CODE (to
) == VOID_TYPE
7081 || TREE_CODE (from
) == VOID_TYPE
)
7084 if (TREE_CODE (to
) != TREE_CODE (from
))
7087 if (TREE_CODE (from
) == OFFSET_TYPE
7088 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7089 TYPE_OFFSET_BASETYPE (from
),
7090 COMPARE_BASE
| COMPARE_DERIVED
))
7093 if (TREE_CODE (to
) == VECTOR_TYPE
7094 && vector_types_convertible_p (to
, from
, false))
7097 if (TREE_CODE (to
) == INTEGER_TYPE
7098 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7101 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7104 if (TREE_CODE (to
) != POINTER_TYPE
)
7106 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7107 COMPARE_BASE
| COMPARE_DERIVED
);
7111 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7112 pointer-to-member types) are the same, ignoring cv-qualification at
7116 comp_ptr_ttypes_const (tree to
, tree from
)
7118 bool is_opaque_pointer
= false;
7120 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7122 if (TREE_CODE (to
) != TREE_CODE (from
))
7125 if (TREE_CODE (from
) == OFFSET_TYPE
7126 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7127 TYPE_OFFSET_BASETYPE (to
)))
7130 if (TREE_CODE (to
) == VECTOR_TYPE
)
7131 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7133 if (TREE_CODE (to
) != POINTER_TYPE
)
7134 return (is_opaque_pointer
7135 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7139 /* Returns the type qualifiers for this type, including the qualifiers on the
7140 elements for an array type. */
7143 cp_type_quals (const_tree type
)
7145 /* This CONST_CAST is okay because strip_array_types returns its
7146 argument unmodified and we assign it to a const_tree. */
7147 type
= strip_array_types (CONST_CAST_TREE(type
));
7148 if (type
== error_mark_node
)
7149 return TYPE_UNQUALIFIED
;
7150 return TYPE_QUALS (type
);
7153 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7157 cp_type_readonly (const_tree type
)
7159 /* This CONST_CAST is okay because strip_array_types returns its
7160 argument unmodified and we assign it to a const_tree. */
7161 type
= strip_array_types (CONST_CAST_TREE(type
));
7162 return TYPE_READONLY (type
);
7165 /* Returns nonzero if the TYPE contains a mutable member. */
7168 cp_has_mutable_p (const_tree type
)
7170 /* This CONST_CAST is okay because strip_array_types returns its
7171 argument unmodified and we assign it to a const_tree. */
7172 type
= strip_array_types (CONST_CAST_TREE(type
));
7174 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7177 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7178 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7179 approximation. In particular, consider:
7182 struct S { int i; };
7183 const S s = { f(); }
7185 Here, we will make "s" as TREE_READONLY (because it is declared
7186 "const") -- only to reverse ourselves upon seeing that the
7187 initializer is non-constant. */
7190 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7192 tree type
= TREE_TYPE (decl
);
7194 if (type
== error_mark_node
)
7197 if (TREE_CODE (type
) == FUNCTION_TYPE
7198 && type_quals
!= TYPE_UNQUALIFIED
)
7200 /* This was an error in C++98 (cv-qualifiers cannot be added to
7201 a function type), but DR 295 makes the code well-formed by
7202 dropping the extra qualifiers. */
7205 tree bad_type
= build_qualified_type (type
, type_quals
);
7206 pedwarn (input_location
, OPT_pedantic
,
7207 "ignoring %qV qualifiers added to function type %qT",
7211 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
7215 /* Avoid setting TREE_READONLY incorrectly. */
7216 if (/* If the object has a constructor, the constructor may modify
7218 TYPE_NEEDS_CONSTRUCTING (type
)
7219 /* If the type isn't complete, we don't know yet if it will need
7221 || !COMPLETE_TYPE_P (type
)
7222 /* If the type has a mutable component, that component might be
7224 || TYPE_HAS_MUTABLE_P (type
))
7225 type_quals
&= ~TYPE_QUAL_CONST
;
7227 c_apply_type_quals_to_decl (type_quals
, decl
);
7230 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7231 exemplar types such that casting T1 to T2 is casting away constness
7232 if and only if there is no implicit conversion from T1 to T2. */
7235 casts_away_constness_r (tree
*t1
, tree
*t2
)
7240 /* [expr.const.cast]
7242 For multi-level pointer to members and multi-level mixed pointers
7243 and pointers to members (conv.qual), the "member" aspect of a
7244 pointer to member level is ignored when determining if a const
7245 cv-qualifier has been cast away. */
7246 /* [expr.const.cast]
7248 For two pointer types:
7250 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7251 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7254 casting from X1 to X2 casts away constness if, for a non-pointer
7255 type T there does not exist an implicit conversion (clause
7258 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7262 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7263 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
7264 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
7266 *t1
= cp_build_qualified_type (void_type_node
,
7267 cp_type_quals (*t1
));
7268 *t2
= cp_build_qualified_type (void_type_node
,
7269 cp_type_quals (*t2
));
7273 quals1
= cp_type_quals (*t1
);
7274 quals2
= cp_type_quals (*t2
);
7276 if (TYPE_PTRMEM_P (*t1
))
7277 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
7279 *t1
= TREE_TYPE (*t1
);
7280 if (TYPE_PTRMEM_P (*t2
))
7281 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
7283 *t2
= TREE_TYPE (*t2
);
7285 casts_away_constness_r (t1
, t2
);
7286 *t1
= build_pointer_type (*t1
);
7287 *t2
= build_pointer_type (*t2
);
7288 *t1
= cp_build_qualified_type (*t1
, quals1
);
7289 *t2
= cp_build_qualified_type (*t2
, quals2
);
7292 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7296 casts_away_constness (tree t1
, tree t2
)
7298 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
7300 /* [expr.const.cast]
7302 Casting from an lvalue of type T1 to an lvalue of type T2
7303 using a reference cast casts away constness if a cast from an
7304 rvalue of type "pointer to T1" to the type "pointer to T2"
7305 casts away constness. */
7306 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
7307 return casts_away_constness (build_pointer_type (t1
),
7308 build_pointer_type (TREE_TYPE (t2
)));
7311 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
7312 /* [expr.const.cast]
7314 Casting from an rvalue of type "pointer to data member of X
7315 of type T1" to the type "pointer to data member of Y of type
7316 T2" casts away constness if a cast from an rvalue of type
7317 "pointer to T1" to the type "pointer to T2" casts away
7319 return casts_away_constness
7320 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
7321 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
7323 /* Casting away constness is only something that makes sense for
7324 pointer or reference types. */
7325 if (TREE_CODE (t1
) != POINTER_TYPE
7326 || TREE_CODE (t2
) != POINTER_TYPE
)
7329 /* Top-level qualifiers don't matter. */
7330 t1
= TYPE_MAIN_VARIANT (t1
);
7331 t2
= TYPE_MAIN_VARIANT (t2
);
7332 casts_away_constness_r (&t1
, &t2
);
7333 if (!can_convert (t2
, t1
))
7339 /* If T is a REFERENCE_TYPE return the type to which T refers.
7340 Otherwise, return T itself. */
7343 non_reference (tree t
)
7345 if (TREE_CODE (t
) == REFERENCE_TYPE
)
7351 /* Return nonzero if REF is an lvalue valid for this language;
7352 otherwise, print an error message and return zero. USE says
7353 how the lvalue is being used and so selects the error message. */
7356 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
7358 int win
= lvalue_p (ref
);
7360 if (!win
&& (complain
& tf_error
))