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 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
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"
46 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int);
47 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
48 static tree
rationalize_conditional_expr (enum tree_code
, tree
);
49 static int comp_ptr_ttypes_real (tree
, tree
, int);
50 static int comp_ptr_ttypes_const (tree
, tree
);
51 static bool comp_except_types (tree
, tree
, bool);
52 static bool comp_array_types (tree
, tree
, bool);
53 static tree
common_base_type (tree
, tree
);
54 static tree
pointer_diff (tree
, tree
, tree
);
55 static tree
get_delta_difference (tree
, tree
, bool, bool);
56 static void casts_away_constness_r (tree
*, tree
*);
57 static bool casts_away_constness (tree
, tree
);
58 static void maybe_warn_about_returning_address_of_local (tree
);
59 static tree
lookup_destructor (tree
, tree
, tree
);
60 static tree
convert_arguments (tree
, tree
, tree
, int);
62 /* Do `exp = require_complete_type (exp);' to make sure exp
63 does not have an incomplete type. (That includes void types.)
64 Returns the error_mark_node if the VALUE does not have
65 complete type when this function returns. */
68 require_complete_type (tree value
)
72 if (processing_template_decl
|| value
== error_mark_node
)
75 if (TREE_CODE (value
) == OVERLOAD
)
76 type
= unknown_type_node
;
78 type
= TREE_TYPE (value
);
80 if (type
== error_mark_node
)
81 return error_mark_node
;
83 /* First, detect a valid value with a complete type. */
84 if (COMPLETE_TYPE_P (type
))
87 if (complete_type_or_else (type
, value
))
90 return error_mark_node
;
93 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
94 a template instantiation, do the instantiation. Returns TYPE,
95 whether or not it could be completed, unless something goes
96 horribly wrong, in which case the error_mark_node is returned. */
99 complete_type (tree type
)
101 if (type
== NULL_TREE
)
102 /* Rather than crash, we return something sure to cause an error
104 return error_mark_node
;
106 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
108 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
110 tree t
= complete_type (TREE_TYPE (type
));
111 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
113 TYPE_NEEDS_CONSTRUCTING (type
)
114 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
115 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
116 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
118 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
119 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
124 /* Like complete_type, but issue an error if the TYPE cannot be completed.
125 VALUE is used for informative diagnostics.
126 Returns NULL_TREE if the type cannot be made complete. */
129 complete_type_or_else (tree type
, tree value
)
131 type
= complete_type (type
);
132 if (type
== error_mark_node
)
133 /* We already issued an error. */
135 else if (!COMPLETE_TYPE_P (type
))
137 cxx_incomplete_type_diagnostic (value
, type
, 0);
144 /* Return truthvalue of whether type of EXP is instantiated. */
147 type_unknown_p (tree exp
)
149 return (TREE_CODE (exp
) == TREE_LIST
150 || TREE_TYPE (exp
) == unknown_type_node
);
154 /* Return the common type of two parameter lists.
155 We assume that comptypes has already been done and returned 1;
156 if that isn't so, this may crash.
158 As an optimization, free the space we allocate if the parameter
159 lists are already common. */
162 commonparms (tree p1
, tree p2
)
164 tree oldargs
= p1
, newargs
, n
;
168 len
= list_length (p1
);
169 newargs
= tree_last (p1
);
171 if (newargs
== void_list_node
)
180 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
185 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
187 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
189 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
192 else if (! TREE_PURPOSE (p1
))
194 if (TREE_PURPOSE (p2
))
196 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
202 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
204 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
206 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
209 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
212 TREE_VALUE (n
) = TREE_VALUE (p1
);
220 /* Given a type, perhaps copied for a typedef,
221 find the "original" version of it. */
223 original_type (tree t
)
225 while (TYPE_NAME (t
) != NULL_TREE
)
227 tree x
= TYPE_NAME (t
);
228 if (TREE_CODE (x
) != TYPE_DECL
)
230 x
= DECL_ORIGINAL_TYPE (x
);
238 /* T1 and T2 are arithmetic or enumeration types. Return the type
239 that will result from the "usual arithmetic conversions" on T1 and
240 T2 as described in [expr]. */
243 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
245 enum tree_code code1
= TREE_CODE (t1
);
246 enum tree_code code2
= TREE_CODE (t2
);
249 /* FIXME: Attributes. */
250 gcc_assert (ARITHMETIC_TYPE_P (t1
)
251 || TREE_CODE (t1
) == COMPLEX_TYPE
252 || TREE_CODE (t1
) == VECTOR_TYPE
253 || TREE_CODE (t1
) == ENUMERAL_TYPE
);
254 gcc_assert (ARITHMETIC_TYPE_P (t2
)
255 || TREE_CODE (t2
) == COMPLEX_TYPE
256 || TREE_CODE (t1
) == VECTOR_TYPE
257 || TREE_CODE (t2
) == ENUMERAL_TYPE
);
259 /* In what follows, we slightly generalize the rules given in [expr] so
260 as to deal with `long long' and `complex'. First, merge the
262 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
264 /* If one type is complex, form the common type of the non-complex
265 components, then make that complex. Use T1 or T2 if it is the
267 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
269 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
270 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
272 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
274 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
275 return build_type_attribute_variant (t1
, attributes
);
276 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
277 return build_type_attribute_variant (t2
, attributes
);
279 return build_type_attribute_variant (build_complex_type (subtype
),
283 if (code1
== VECTOR_TYPE
)
285 /* When we get here we should have two vectors of the same size.
286 Just prefer the unsigned one if present. */
287 if (TYPE_UNSIGNED (t1
))
288 return build_type_attribute_variant (t1
, attributes
);
290 return build_type_attribute_variant (t2
, attributes
);
293 /* If only one is real, use it as the result. */
294 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
295 return build_type_attribute_variant (t1
, attributes
);
296 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
297 return build_type_attribute_variant (t2
, attributes
);
299 /* Perform the integral promotions. */
300 if (code1
!= REAL_TYPE
)
302 t1
= type_promotes_to (t1
);
303 t2
= type_promotes_to (t2
);
306 /* Both real or both integers; use the one with greater precision. */
307 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
308 return build_type_attribute_variant (t1
, attributes
);
309 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
310 return build_type_attribute_variant (t2
, attributes
);
312 /* The types are the same; no need to do anything fancy. */
313 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
314 return build_type_attribute_variant (t1
, attributes
);
316 if (code1
!= REAL_TYPE
)
318 /* If one is a sizetype, use it so size_binop doesn't blow up. */
319 if (TYPE_IS_SIZETYPE (t1
) > TYPE_IS_SIZETYPE (t2
))
320 return build_type_attribute_variant (t1
, attributes
);
321 if (TYPE_IS_SIZETYPE (t2
) > TYPE_IS_SIZETYPE (t1
))
322 return build_type_attribute_variant (t2
, attributes
);
324 /* If one is unsigned long long, then convert the other to unsigned
326 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
327 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
328 return build_type_attribute_variant (long_long_unsigned_type_node
,
330 /* If one is a long long, and the other is an unsigned long, and
331 long long can represent all the values of an unsigned long, then
332 convert to a long long. Otherwise, convert to an unsigned long
333 long. Otherwise, if either operand is long long, convert the
336 Since we're here, we know the TYPE_PRECISION is the same;
337 therefore converting to long long cannot represent all the values
338 of an unsigned long, so we choose unsigned long long in that
340 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
341 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
343 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
344 ? long_long_unsigned_type_node
345 : long_long_integer_type_node
);
346 return build_type_attribute_variant (t
, attributes
);
349 /* Go through the same procedure, but for longs. */
350 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
351 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
352 return build_type_attribute_variant (long_unsigned_type_node
,
354 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
355 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
357 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
358 ? long_unsigned_type_node
: long_integer_type_node
);
359 return build_type_attribute_variant (t
, attributes
);
361 /* Otherwise prefer the unsigned one. */
362 if (TYPE_UNSIGNED (t1
))
363 return build_type_attribute_variant (t1
, attributes
);
365 return build_type_attribute_variant (t2
, attributes
);
369 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
370 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
371 return build_type_attribute_variant (long_double_type_node
,
373 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
374 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
375 return build_type_attribute_variant (double_type_node
,
377 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
378 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
379 return build_type_attribute_variant (float_type_node
,
382 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
383 the standard C++ floating-point types. Logic earlier in this
384 function has already eliminated the possibility that
385 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
386 compelling reason to choose one or the other. */
387 return build_type_attribute_variant (t1
, attributes
);
391 /* Subroutine of composite_pointer_type to implement the recursive
392 case. See that function for documentation fo the parameters. */
395 composite_pointer_type_r (tree t1
, tree t2
, const char* location
)
402 /* Determine the types pointed to by T1 and T2. */
403 if (TREE_CODE (t1
) == POINTER_TYPE
)
405 pointee1
= TREE_TYPE (t1
);
406 pointee2
= TREE_TYPE (t2
);
410 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
411 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
416 Otherwise, the composite pointer type is a pointer type
417 similar (_conv.qual_) to the type of one of the operands,
418 with a cv-qualification signature (_conv.qual_) that is the
419 union of the cv-qualification signatures of the operand
421 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
422 result_type
= pointee1
;
423 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
424 && TREE_CODE (pointee2
) == POINTER_TYPE
)
425 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
426 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
427 result_type
= composite_pointer_type_r (pointee1
, pointee2
, location
);
430 pedwarn ("%s between distinct pointer types %qT and %qT "
433 result_type
= void_type_node
;
435 result_type
= cp_build_qualified_type (result_type
,
436 (cp_type_quals (pointee1
)
437 | cp_type_quals (pointee2
)));
438 /* If the original types were pointers to members, so is the
440 if (TYPE_PTR_TO_MEMBER_P (t1
))
442 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
443 TYPE_PTRMEM_CLASS_TYPE (t2
)))
444 pedwarn ("%s between distinct pointer types %qT and %qT "
447 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
451 result_type
= build_pointer_type (result_type
);
453 /* Merge the attributes. */
454 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
455 return build_type_attribute_variant (result_type
, attributes
);
458 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
459 ARG1 and ARG2 are the values with those types. The LOCATION is a
460 string describing the current location, in case an error occurs.
462 This routine also implements the computation of a common type for
463 pointers-to-members as per [expr.eq]. */
466 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
467 const char* location
)
474 If one operand is a null pointer constant, the composite pointer
475 type is the type of the other operand. */
476 if (null_ptr_cst_p (arg1
))
478 if (null_ptr_cst_p (arg2
))
485 If one of the operands has type "pointer to cv1 void*", then
486 the other has type "pointer to cv2T", and the composite pointer
487 type is "pointer to cv12 void", where cv12 is the union of cv1
490 If either type is a pointer to void, make sure it is T1. */
491 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
499 /* Now, if T1 is a pointer to void, merge the qualifiers. */
500 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
505 if (pedantic
&& TYPE_PTRFN_P (t2
))
506 pedwarn ("ISO C++ forbids %s between pointer of type %<void *%> "
507 "and pointer-to-function", location
);
509 = cp_build_qualified_type (void_type_node
,
510 (cp_type_quals (TREE_TYPE (t1
))
511 | cp_type_quals (TREE_TYPE (t2
))));
512 result_type
= build_pointer_type (result_type
);
513 /* Merge the attributes. */
514 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
515 return build_type_attribute_variant (result_type
, attributes
);
518 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
519 && TREE_CODE (t2
) == POINTER_TYPE
)
521 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
525 /* [expr.eq] permits the application of a pointer conversion to
526 bring the pointers to a common type. */
527 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
528 && CLASS_TYPE_P (TREE_TYPE (t1
))
529 && CLASS_TYPE_P (TREE_TYPE (t2
))
530 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
533 class1
= TREE_TYPE (t1
);
534 class2
= TREE_TYPE (t2
);
536 if (DERIVED_FROM_P (class1
, class2
))
537 t2
= (build_pointer_type
538 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
539 else if (DERIVED_FROM_P (class2
, class1
))
540 t1
= (build_pointer_type
541 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
544 error ("%s between distinct pointer types %qT and %qT "
545 "lacks a cast", location
, t1
, t2
);
546 return error_mark_node
;
549 /* [expr.eq] permits the application of a pointer-to-member
550 conversion to change the class type of one of the types. */
551 else if (TYPE_PTR_TO_MEMBER_P (t1
)
552 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
553 TYPE_PTRMEM_CLASS_TYPE (t2
)))
555 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
556 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
558 if (DERIVED_FROM_P (class1
, class2
))
559 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
560 else if (DERIVED_FROM_P (class2
, class1
))
561 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
564 error ("%s between distinct pointer-to-member types %qT and %qT "
565 "lacks a cast", location
, t1
, t2
);
566 return error_mark_node
;
570 return composite_pointer_type_r (t1
, t2
, location
);
573 /* Return the merged type of two types.
574 We assume that comptypes has already been done and returned 1;
575 if that isn't so, this may crash.
577 This just combines attributes and default arguments; any other
578 differences would cause the two types to compare unalike. */
581 merge_types (tree t1
, tree t2
)
583 enum tree_code code1
;
584 enum tree_code code2
;
587 /* Save time if the two types are the same. */
590 if (original_type (t1
) == original_type (t2
))
593 /* If one type is nonsense, use the other. */
594 if (t1
== error_mark_node
)
596 if (t2
== error_mark_node
)
599 /* Merge the attributes. */
600 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
602 if (TYPE_PTRMEMFUNC_P (t1
))
603 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
604 if (TYPE_PTRMEMFUNC_P (t2
))
605 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
607 code1
= TREE_CODE (t1
);
608 code2
= TREE_CODE (t2
);
614 /* For two pointers, do this recursively on the target type. */
616 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
617 int quals
= cp_type_quals (t1
);
619 if (code1
== POINTER_TYPE
)
620 t1
= build_pointer_type (target
);
622 t1
= build_reference_type (target
);
623 t1
= build_type_attribute_variant (t1
, attributes
);
624 t1
= cp_build_qualified_type (t1
, quals
);
626 if (TREE_CODE (target
) == METHOD_TYPE
)
627 t1
= build_ptrmemfunc_type (t1
);
636 quals
= cp_type_quals (t1
);
637 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
638 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
639 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
641 t1
= cp_build_qualified_type (t1
, quals
);
647 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
648 /* Save space: see if the result is identical to one of the args. */
649 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
650 return build_type_attribute_variant (t1
, attributes
);
651 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
652 return build_type_attribute_variant (t2
, attributes
);
653 /* Merge the element types, and have a size if either arg has one. */
654 t1
= build_cplus_array_type
655 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
660 /* Function types: prefer the one that specified arg types.
661 If both do, merge the arg types. Also merge the return types. */
663 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
664 tree p1
= TYPE_ARG_TYPES (t1
);
665 tree p2
= TYPE_ARG_TYPES (t2
);
668 /* Save space: see if the result is identical to one of the args. */
669 if (valtype
== TREE_TYPE (t1
) && ! p2
)
670 return cp_build_type_attribute_variant (t1
, attributes
);
671 if (valtype
== TREE_TYPE (t2
) && ! p1
)
672 return cp_build_type_attribute_variant (t2
, attributes
);
674 /* Simple way if one arg fails to specify argument types. */
675 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
677 rval
= build_function_type (valtype
, p2
);
678 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
679 rval
= build_exception_variant (rval
, raises
);
680 return cp_build_type_attribute_variant (rval
, attributes
);
682 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
683 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
685 rval
= build_function_type (valtype
, p1
);
687 rval
= build_exception_variant (rval
, raises
);
688 return cp_build_type_attribute_variant (rval
, attributes
);
691 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
692 t1
= build_exception_variant (rval
, raises
);
698 /* Get this value the long way, since TYPE_METHOD_BASETYPE
699 is just the main variant of this. */
700 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
701 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
704 /* If this was a member function type, get back to the
705 original type of type member function (i.e., without
706 the class instance variable up front. */
707 t1
= build_function_type (TREE_TYPE (t1
),
708 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
709 t2
= build_function_type (TREE_TYPE (t2
),
710 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
711 t3
= merge_types (t1
, t2
);
712 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
713 TYPE_ARG_TYPES (t3
));
714 t1
= build_exception_variant (t3
, raises
);
719 /* There is no need to merge attributes into a TYPENAME_TYPE.
720 When the type is instantiated it will have whatever
721 attributes result from the instantiation. */
726 return cp_build_type_attribute_variant (t1
, attributes
);
729 /* Return the common type of two types.
730 We assume that comptypes has already been done and returned 1;
731 if that isn't so, this may crash.
733 This is the type for the result of most arithmetic operations
734 if the operands have the given two types. */
737 common_type (tree t1
, tree t2
)
739 enum tree_code code1
;
740 enum tree_code code2
;
742 /* If one type is nonsense, bail. */
743 if (t1
== error_mark_node
|| t2
== error_mark_node
)
744 return error_mark_node
;
746 code1
= TREE_CODE (t1
);
747 code2
= TREE_CODE (t2
);
749 if ((ARITHMETIC_TYPE_P (t1
) || code1
== ENUMERAL_TYPE
750 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
751 && (ARITHMETIC_TYPE_P (t2
) || code2
== ENUMERAL_TYPE
752 || code2
== COMPLEX_TYPE
|| code2
== VECTOR_TYPE
))
753 return type_after_usual_arithmetic_conversions (t1
, t2
);
755 else if ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
756 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
757 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)))
758 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
764 /* Compare two exception specifier types for exactness or subsetness, if
765 allowed. Returns false for mismatch, true for match (same, or
768 [except.spec] "If a class X ... objects of class X or any class publicly
769 and unambiguously derived from X. Similarly, if a pointer type Y * ...
770 exceptions of type Y * or that are pointers to any type publicly and
771 unambiguously derived from Y. Otherwise a function only allows exceptions
772 that have the same type ..."
773 This does not mention cv qualifiers and is different to what throw
774 [except.throw] and catch [except.catch] will do. They will ignore the
775 top level cv qualifiers, and allow qualifiers in the pointer to class
778 We implement the letter of the standard. */
781 comp_except_types (tree a
, tree b
, bool exact
)
783 if (same_type_p (a
, b
))
787 if (cp_type_quals (a
) || cp_type_quals (b
))
790 if (TREE_CODE (a
) == POINTER_TYPE
791 && TREE_CODE (b
) == POINTER_TYPE
)
795 if (cp_type_quals (a
) || cp_type_quals (b
))
799 if (TREE_CODE (a
) != RECORD_TYPE
800 || TREE_CODE (b
) != RECORD_TYPE
)
803 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
809 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
810 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
811 otherwise it must be exact. Exception lists are unordered, but
812 we've already filtered out duplicates. Most lists will be in order,
813 we should try to make use of that. */
816 comp_except_specs (tree t1
, tree t2
, bool exact
)
825 if (t1
== NULL_TREE
) /* T1 is ... */
826 return t2
== NULL_TREE
|| !exact
;
827 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
828 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
829 if (t2
== NULL_TREE
) /* T2 is ... */
831 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
834 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
835 Count how many we find, to determine exactness. For exact matching and
836 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
838 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
840 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
842 tree a
= TREE_VALUE (probe
);
843 tree b
= TREE_VALUE (t2
);
845 if (comp_except_types (a
, b
, exact
))
847 if (probe
== base
&& exact
)
848 base
= TREE_CHAIN (probe
);
853 if (probe
== NULL_TREE
)
856 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
859 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
860 [] can match [size]. */
863 comp_array_types (tree t1
, tree t2
, bool allow_redeclaration
)
872 /* The type of the array elements must be the same. */
873 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
876 d1
= TYPE_DOMAIN (t1
);
877 d2
= TYPE_DOMAIN (t2
);
882 /* If one of the arrays is dimensionless, and the other has a
883 dimension, they are of different types. However, it is valid to
891 declarations for an array object can specify
892 array types that differ by the presence or absence of a major
893 array bound (_dcl.array_). */
895 return allow_redeclaration
;
897 /* Check that the dimensions are the same. */
899 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
901 max1
= TYPE_MAX_VALUE (d1
);
902 max2
= TYPE_MAX_VALUE (d2
);
903 if (processing_template_decl
&& !abi_version_at_least (2)
904 && !value_dependent_expression_p (max1
)
905 && !value_dependent_expression_p (max2
))
907 /* With abi-1 we do not fold non-dependent array bounds, (and
908 consequently mangle them incorrectly). We must therefore
909 fold them here, to verify the domains have the same
915 if (!cp_tree_equal (max1
, max2
))
921 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
922 is a bitwise-or of the COMPARE_* flags. */
925 comptypes (tree t1
, tree t2
, int strict
)
930 /* Suppress errors caused by previously reported errors. */
931 if (t1
== error_mark_node
|| t2
== error_mark_node
)
934 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
936 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
937 current instantiation. */
938 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
940 tree resolved
= resolve_typename_type (t1
, /*only_current_p=*/true);
942 if (resolved
!= error_mark_node
)
946 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
948 tree resolved
= resolve_typename_type (t2
, /*only_current_p=*/true);
950 if (resolved
!= error_mark_node
)
954 /* If either type is the internal version of sizetype, use the
956 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
957 && TYPE_ORIG_SIZE_TYPE (t1
))
958 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
960 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
961 && TYPE_ORIG_SIZE_TYPE (t2
))
962 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
964 if (TYPE_PTRMEMFUNC_P (t1
))
965 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
966 if (TYPE_PTRMEMFUNC_P (t2
))
967 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
969 /* Different classes of types can't be compatible. */
970 if (TREE_CODE (t1
) != TREE_CODE (t2
))
973 /* Qualifiers must match. For array types, we will check when we
974 recur on the array element types. */
975 if (TREE_CODE (t1
) != ARRAY_TYPE
976 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
978 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
981 /* Allow for two different type nodes which have essentially the same
982 definition. Note that we already checked for equality of the type
983 qualifiers (just above). */
985 if (TREE_CODE (t1
) != ARRAY_TYPE
986 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
989 /* Compare the types. Break out if they could be the same. */
990 switch (TREE_CODE (t1
))
992 case TEMPLATE_TEMPLATE_PARM
:
993 case BOUND_TEMPLATE_TEMPLATE_PARM
:
994 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
995 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
997 if (!comp_template_parms
998 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
999 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1001 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1003 /* Don't check inheritance. */
1004 strict
= COMPARE_STRICT
;
1009 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1010 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1011 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1012 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1015 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1017 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1023 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1024 strict
& ~COMPARE_REDECLARATION
))
1026 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1031 case REFERENCE_TYPE
:
1032 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1033 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1034 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1040 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1042 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1047 /* Target types must match incl. qualifiers. */
1048 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1052 case TEMPLATE_TYPE_PARM
:
1053 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1054 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
1059 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1060 TYPENAME_TYPE_FULLNAME (t2
)))
1062 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1066 case UNBOUND_CLASS_TEMPLATE
:
1067 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1069 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1074 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1079 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1080 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1088 /* If we get here, we know that from a target independent POV the
1089 types are the same. Make sure the target attributes are also
1091 return targetm
.comp_type_attributes (t1
, t2
);
1094 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1097 at_least_as_qualified_p (tree type1
, tree type2
)
1099 int q1
= cp_type_quals (type1
);
1100 int q2
= cp_type_quals (type2
);
1102 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1103 return (q1
& q2
) == q2
;
1106 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1107 more cv-qualified that TYPE1, and 0 otherwise. */
1110 comp_cv_qualification (tree type1
, tree type2
)
1112 int q1
= cp_type_quals (type1
);
1113 int q2
= cp_type_quals (type2
);
1118 if ((q1
& q2
) == q2
)
1120 else if ((q1
& q2
) == q1
)
1126 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1127 subset of the cv-qualification signature of TYPE2, and the types
1128 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1131 comp_cv_qual_signature (tree type1
, tree type2
)
1133 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1135 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1141 /* If two types share a common base type, return that basetype.
1142 If there is not a unique most-derived base type, this function
1143 returns ERROR_MARK_NODE. */
1146 common_base_type (tree tt1
, tree tt2
)
1148 tree best
= NULL_TREE
;
1151 /* If one is a baseclass of another, that's good enough. */
1152 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1154 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1157 /* Otherwise, try to find a unique baseclass of TT1
1158 that is shared by TT2, and follow that down. */
1159 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt1
))-1; i
>= 0; i
--)
1161 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt1
), i
));
1162 tree trial
= common_base_type (basetype
, tt2
);
1166 if (trial
== error_mark_node
)
1168 if (best
== NULL_TREE
)
1170 else if (best
!= trial
)
1171 return error_mark_node
;
1176 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt2
))-1; i
>= 0; i
--)
1178 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt2
), i
));
1179 tree trial
= common_base_type (tt1
, basetype
);
1183 if (trial
== error_mark_node
)
1185 if (best
== NULL_TREE
)
1187 else if (best
!= trial
)
1188 return error_mark_node
;
1194 /* Subroutines of `comptypes'. */
1196 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1197 equivalent in the sense that functions with those parameter types
1198 can have equivalent types. The two lists must be equivalent,
1199 element by element. */
1202 compparms (tree parms1
, tree parms2
)
1206 /* An unspecified parmlist matches any specified parmlist
1207 whose argument types don't need default promotions. */
1209 for (t1
= parms1
, t2
= parms2
;
1211 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1213 /* If one parmlist is shorter than the other,
1214 they fail to match. */
1217 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1224 /* Process a sizeof or alignof expression where the operand is a
1228 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1230 enum tree_code type_code
;
1232 const char *op_name
;
1234 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1235 if (type
== error_mark_node
)
1236 return error_mark_node
;
1238 if (dependent_type_p (type
))
1240 value
= build_min (op
, size_type_node
, type
);
1241 TREE_READONLY (value
) = 1;
1245 op_name
= operator_name_info
[(int) op
].name
;
1247 type
= non_reference (type
);
1248 type_code
= TREE_CODE (type
);
1250 if (type_code
== METHOD_TYPE
)
1252 if (complain
&& (pedantic
|| warn_pointer_arith
))
1253 pedwarn ("invalid application of %qs to a member function", op_name
);
1254 value
= size_one_node
;
1257 value
= c_sizeof_or_alignof_type (complete_type (type
),
1264 /* Process a sizeof or alignof expression where the operand is an
1268 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
)
1270 const char *op_name
= operator_name_info
[(int) op
].name
;
1272 if (e
== error_mark_node
)
1273 return error_mark_node
;
1275 if (processing_template_decl
)
1277 e
= build_min (op
, size_type_node
, e
);
1278 TREE_SIDE_EFFECTS (e
) = 0;
1279 TREE_READONLY (e
) = 1;
1284 if (TREE_CODE (e
) == COMPONENT_REF
1285 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1286 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1288 error ("invalid application of %qs to a bit-field", op_name
);
1291 else if (is_overloaded_fn (e
))
1293 pedwarn ("ISO C++ forbids applying %qs to an expression of "
1294 "function type", op_name
);
1297 else if (type_unknown_p (e
))
1299 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1305 return cxx_sizeof_or_alignof_type (e
, op
, true);
1309 /* EXPR is being used in a context that is not a function call.
1314 The expression can be used only as the left-hand operand of a
1315 member function call.
1317 [expr.mptr.operator]
1319 If the result of .* or ->* is a function, then that result can be
1320 used only as the operand for the function call operator ().
1322 by issuing an error message if appropriate. Returns true iff EXPR
1323 violates these rules. */
1326 invalid_nonstatic_memfn_p (tree expr
)
1328 if (TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
)
1330 error ("invalid use of non-static member function");
1336 /* Perform the conversions in [expr] that apply when an lvalue appears
1337 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1338 function-to-pointer conversions.
1340 In addition manifest constants are replaced by their values. */
1343 decay_conversion (tree exp
)
1346 enum tree_code code
;
1348 type
= TREE_TYPE (exp
);
1349 code
= TREE_CODE (type
);
1351 if (type
== error_mark_node
)
1352 return error_mark_node
;
1354 if (type_unknown_p (exp
))
1356 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1357 return error_mark_node
;
1360 exp
= integral_constant_value (exp
);
1362 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1363 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1365 if (code
== VOID_TYPE
)
1367 error ("void value not ignored as it ought to be");
1368 return error_mark_node
;
1370 if (invalid_nonstatic_memfn_p (exp
))
1371 return error_mark_node
;
1372 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1373 return build_unary_op (ADDR_EXPR
, exp
, 0);
1374 if (code
== ARRAY_TYPE
)
1379 if (TREE_CODE (exp
) == INDIRECT_REF
)
1380 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1381 TREE_OPERAND (exp
, 0));
1383 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1385 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1386 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1387 TREE_OPERAND (exp
, 0), op1
);
1391 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1393 error ("invalid use of non-lvalue array");
1394 return error_mark_node
;
1397 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1399 if (TREE_CODE (exp
) == VAR_DECL
)
1401 if (!cxx_mark_addressable (exp
))
1402 return error_mark_node
;
1403 adr
= build_nop (ptrtype
, build_address (exp
));
1406 /* This way is better for a COMPONENT_REF since it can
1407 simplify the offset for a component. */
1408 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1409 return cp_convert (ptrtype
, adr
);
1412 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1413 rvalues always have cv-unqualified types. */
1414 if (! CLASS_TYPE_P (type
))
1415 exp
= cp_convert (TYPE_MAIN_VARIANT (type
), exp
);
1421 default_conversion (tree exp
)
1423 exp
= decay_conversion (exp
);
1425 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1426 exp
= perform_integral_promotions (exp
);
1431 /* EXPR is an expression with an integral or enumeration type.
1432 Perform the integral promotions in [conv.prom], and return the
1436 perform_integral_promotions (tree expr
)
1441 type
= TREE_TYPE (expr
);
1442 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1443 promoted_type
= type_promotes_to (type
);
1444 if (type
!= promoted_type
)
1445 expr
= cp_convert (promoted_type
, expr
);
1449 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1453 inline_conversion (tree exp
)
1455 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1456 exp
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (exp
)), exp
);
1461 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1462 decay_conversion to one. */
1465 string_conv_p (tree totype
, tree exp
, int warn
)
1469 if (! flag_const_strings
|| TREE_CODE (totype
) != POINTER_TYPE
)
1472 t
= TREE_TYPE (totype
);
1473 if (!same_type_p (t
, char_type_node
)
1474 && !same_type_p (t
, wchar_type_node
))
1477 if (TREE_CODE (exp
) == STRING_CST
)
1479 /* Make sure that we don't try to convert between char and wchar_t. */
1480 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1485 /* Is this a string constant which has decayed to 'const char *'? */
1486 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1487 if (!same_type_p (TREE_TYPE (exp
), t
))
1490 if (TREE_CODE (exp
) != ADDR_EXPR
1491 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1495 /* This warning is not very useful, as it complains about printf. */
1496 if (warn
&& warn_write_strings
)
1497 warning (0, "deprecated conversion from string constant to %qT'", totype
);
1502 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1503 can, for example, use as an lvalue. This code used to be in
1504 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1505 expressions, where we're dealing with aggregates. But now it's again only
1506 called from unary_complex_lvalue. The case (in particular) that led to
1507 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1511 rationalize_conditional_expr (enum tree_code code
, tree t
)
1513 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1514 the first operand is always the one to be used if both operands
1515 are equal, so we know what conditional expression this used to be. */
1516 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1518 /* The following code is incorrect if either operand side-effects. */
1519 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0))
1520 && !TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)));
1522 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1523 ? LE_EXPR
: GE_EXPR
),
1524 TREE_OPERAND (t
, 0),
1525 TREE_OPERAND (t
, 1),
1526 /*overloaded_p=*/NULL
),
1527 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1528 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1532 build_conditional_expr (TREE_OPERAND (t
, 0),
1533 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1534 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1537 /* Given the TYPE of an anonymous union field inside T, return the
1538 FIELD_DECL for the field. If not found return NULL_TREE. Because
1539 anonymous unions can nest, we must also search all anonymous unions
1540 that are directly reachable. */
1543 lookup_anon_field (tree t
, tree type
)
1547 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1549 if (TREE_STATIC (field
))
1551 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
1554 /* If we find it directly, return the field. */
1555 if (DECL_NAME (field
) == NULL_TREE
1556 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
1561 /* Otherwise, it could be nested, search harder. */
1562 if (DECL_NAME (field
) == NULL_TREE
1563 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1565 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1573 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1574 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1575 non-NULL, it indicates the path to the base used to name MEMBER.
1576 If PRESERVE_REFERENCE is true, the expression returned will have
1577 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1578 returned will have the type referred to by the reference.
1580 This function does not perform access control; that is either done
1581 earlier by the parser when the name of MEMBER is resolved to MEMBER
1582 itself, or later when overload resolution selects one of the
1583 functions indicated by MEMBER. */
1586 build_class_member_access_expr (tree object
, tree member
,
1587 tree access_path
, bool preserve_reference
)
1591 tree result
= NULL_TREE
;
1593 if (object
== error_mark_node
|| member
== error_mark_node
)
1594 return error_mark_node
;
1596 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
1600 The type of the first expression shall be "class object" (of a
1602 object_type
= TREE_TYPE (object
);
1603 if (!currently_open_class (object_type
)
1604 && !complete_type_or_else (object_type
, object
))
1605 return error_mark_node
;
1606 if (!CLASS_TYPE_P (object_type
))
1608 error ("request for member %qD in %qE, which is of non-class type %qT",
1609 member
, object
, object_type
);
1610 return error_mark_node
;
1613 /* The standard does not seem to actually say that MEMBER must be a
1614 member of OBJECT_TYPE. However, that is clearly what is
1616 if (DECL_P (member
))
1618 member_scope
= DECL_CLASS_CONTEXT (member
);
1620 if (TREE_DEPRECATED (member
))
1621 warn_deprecated_use (member
);
1624 member_scope
= BINFO_TYPE (BASELINK_BINFO (member
));
1625 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1626 presently be the anonymous union. Go outwards until we find a
1627 type related to OBJECT_TYPE. */
1628 while (ANON_AGGR_TYPE_P (member_scope
)
1629 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
1631 member_scope
= TYPE_CONTEXT (member_scope
);
1632 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
1634 if (TREE_CODE (member
) == FIELD_DECL
)
1635 error ("invalid use of nonstatic data member %qE", member
);
1637 error ("%qD is not a member of %qT", member
, object_type
);
1638 return error_mark_node
;
1641 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1642 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1643 in the frontend; only _DECLs and _REFs are lvalues in the backend. */
1645 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
1647 object
= build_indirect_ref (temp
, NULL
);
1650 /* In [expr.ref], there is an explicit list of the valid choices for
1651 MEMBER. We check for each of those cases here. */
1652 if (TREE_CODE (member
) == VAR_DECL
)
1654 /* A static data member. */
1656 /* If OBJECT has side-effects, they are supposed to occur. */
1657 if (TREE_SIDE_EFFECTS (object
))
1658 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
1660 else if (TREE_CODE (member
) == FIELD_DECL
)
1662 /* A non-static data member. */
1667 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
1668 && integer_zerop (TREE_OPERAND (object
, 0)));
1670 /* Convert OBJECT to the type of MEMBER. */
1671 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
1672 TYPE_MAIN_VARIANT (member_scope
)))
1677 binfo
= lookup_base (access_path
? access_path
: object_type
,
1678 member_scope
, ba_unique
, &kind
);
1679 if (binfo
== error_mark_node
)
1680 return error_mark_node
;
1682 /* It is invalid to try to get to a virtual base of a
1683 NULL object. The most common cause is invalid use of
1685 if (null_object_p
&& kind
== bk_via_virtual
)
1687 error ("invalid access to non-static data member %qD of "
1690 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1691 return error_mark_node
;
1694 /* Convert to the base. */
1695 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
1697 /* If we found the base successfully then we should be able
1698 to convert to it successfully. */
1699 gcc_assert (object
!= error_mark_node
);
1702 /* Complain about other invalid uses of offsetof, even though they will
1703 give the right answer. Note that we complain whether or not they
1704 actually used the offsetof macro, since there's no way to know at this
1705 point. So we just give a warning, instead of a pedwarn. */
1706 /* Do not produce this warning for base class field references, because
1707 we know for a fact that didn't come from offsetof. This does occur
1708 in various testsuite cases where a null object is passed where a
1709 vtable access is required. */
1710 if (null_object_p
&& warn_invalid_offsetof
1711 && CLASSTYPE_NON_POD_P (object_type
)
1712 && !DECL_FIELD_IS_BASE (member
)
1713 && !skip_evaluation
)
1715 warning (0, "invalid access to non-static data member %qD of NULL object",
1717 warning (0, "(perhaps the %<offsetof%> macro was used incorrectly)");
1720 /* If MEMBER is from an anonymous aggregate, we have converted
1721 OBJECT so that it refers to the class containing the
1722 anonymous union. Generate a reference to the anonymous union
1723 itself, and recur to find MEMBER. */
1724 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
1725 /* When this code is called from build_field_call, the
1726 object already has the type of the anonymous union.
1727 That is because the COMPONENT_REF was already
1728 constructed, and was then disassembled before calling
1729 build_field_call. After the function-call code is
1730 cleaned up, this waste can be eliminated. */
1731 && (!same_type_ignoring_top_level_qualifiers_p
1732 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
1734 tree anonymous_union
;
1736 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
1737 DECL_CONTEXT (member
));
1738 object
= build_class_member_access_expr (object
,
1740 /*access_path=*/NULL_TREE
,
1741 preserve_reference
);
1744 /* Compute the type of the field, as described in [expr.ref]. */
1745 type_quals
= TYPE_UNQUALIFIED
;
1746 member_type
= TREE_TYPE (member
);
1747 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
1749 type_quals
= (cp_type_quals (member_type
)
1750 | cp_type_quals (object_type
));
1752 /* A field is const (volatile) if the enclosing object, or the
1753 field itself, is const (volatile). But, a mutable field is
1754 not const, even within a const object. */
1755 if (DECL_MUTABLE_P (member
))
1756 type_quals
&= ~TYPE_QUAL_CONST
;
1757 member_type
= cp_build_qualified_type (member_type
, type_quals
);
1760 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
1762 result
= fold_if_not_in_template (result
);
1764 /* Mark the expression const or volatile, as appropriate. Even
1765 though we've dealt with the type above, we still have to mark the
1766 expression itself. */
1767 if (type_quals
& TYPE_QUAL_CONST
)
1768 TREE_READONLY (result
) = 1;
1769 if (type_quals
& TYPE_QUAL_VOLATILE
)
1770 TREE_THIS_VOLATILE (result
) = 1;
1772 else if (BASELINK_P (member
))
1774 /* The member is a (possibly overloaded) member function. */
1778 /* If the MEMBER is exactly one static member function, then we
1779 know the type of the expression. Otherwise, we must wait
1780 until overload resolution has been performed. */
1781 functions
= BASELINK_FUNCTIONS (member
);
1782 if (TREE_CODE (functions
) == FUNCTION_DECL
1783 && DECL_STATIC_FUNCTION_P (functions
))
1784 type
= TREE_TYPE (functions
);
1786 type
= unknown_type_node
;
1787 /* Note that we do not convert OBJECT to the BASELINK_BINFO
1788 base. That will happen when the function is called. */
1789 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
1791 else if (TREE_CODE (member
) == CONST_DECL
)
1793 /* The member is an enumerator. */
1795 /* If OBJECT has side-effects, they are supposed to occur. */
1796 if (TREE_SIDE_EFFECTS (object
))
1797 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
1802 error ("invalid use of %qD", member
);
1803 return error_mark_node
;
1806 if (!preserve_reference
)
1809 If E2 is declared to have type "reference to T", then ... the
1810 type of E1.E2 is T. */
1811 result
= convert_from_reference (result
);
1816 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
1817 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
1820 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
1822 tree object_type
= TREE_TYPE (object
);
1823 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
1826 if (scope
&& !check_dtor_name (scope
, dtor_name
))
1828 error ("qualified type %qT does not match destructor name ~%qT",
1830 return error_mark_node
;
1832 if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
1834 error ("the type being destroyed is %qT, but the destructor refers to %qT",
1835 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
1836 return error_mark_node
;
1838 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
1839 /*protect=*/1, /*want_type=*/false);
1840 expr
= (adjust_result_of_qualified_name_lookup
1841 (expr
, dtor_type
, object_type
));
1845 /* This function is called by the parser to process a class member
1846 access expression of the form OBJECT.NAME. NAME is a node used by
1847 the parser to represent a name; it is not yet a DECL. It may,
1848 however, be a BASELINK where the BASELINK_FUNCTIONS is a
1849 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
1850 there is no reason to do the lookup twice, so the parser keeps the
1854 finish_class_member_access_expr (tree object
, tree name
)
1859 tree access_path
= NULL_TREE
;
1860 tree orig_object
= object
;
1861 tree orig_name
= name
;
1863 if (object
== error_mark_node
|| name
== error_mark_node
)
1864 return error_mark_node
;
1866 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
1867 if (!objc_is_public (object
, name
))
1868 return error_mark_node
;
1870 object_type
= TREE_TYPE (object
);
1872 if (processing_template_decl
)
1874 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
1875 dependent_type_p (object_type
)
1876 /* If NAME is just an IDENTIFIER_NODE, then the expression
1878 || TREE_CODE (object
) == IDENTIFIER_NODE
1879 /* If NAME is "f<args>", where either 'f' or 'args' is
1880 dependent, then the expression is dependent. */
1881 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
1882 && dependent_template_id_p (TREE_OPERAND (name
, 0),
1883 TREE_OPERAND (name
, 1)))
1884 /* If NAME is "T::X" where "T" is dependent, then the
1885 expression is dependent. */
1886 || (TREE_CODE (name
) == SCOPE_REF
1887 && TYPE_P (TREE_OPERAND (name
, 0))
1888 && dependent_type_p (TREE_OPERAND (name
, 0))))
1889 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
1890 object
= build_non_dependent_expr (object
);
1895 The type of the first expression shall be "class object" (of a
1897 if (!currently_open_class (object_type
)
1898 && !complete_type_or_else (object_type
, object
))
1899 return error_mark_node
;
1900 if (!CLASS_TYPE_P (object_type
))
1902 error ("request for member %qD in %qE, which is of non-class type %qT",
1903 name
, object
, object_type
);
1904 return error_mark_node
;
1907 if (BASELINK_P (name
))
1909 /* A member function that has already been looked up. */
1910 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
)) == TEMPLATE_ID_EXPR
);
1915 bool is_template_id
= false;
1916 tree template_args
= NULL_TREE
;
1919 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1921 is_template_id
= true;
1922 template_args
= TREE_OPERAND (name
, 1);
1923 name
= TREE_OPERAND (name
, 0);
1925 if (TREE_CODE (name
) == OVERLOAD
)
1926 name
= DECL_NAME (get_first_fn (name
));
1927 else if (DECL_P (name
))
1928 name
= DECL_NAME (name
);
1931 if (TREE_CODE (name
) == SCOPE_REF
)
1933 /* A qualified name. The qualifying class or namespace `S' has
1934 already been looked up; it is either a TYPE or a
1935 NAMESPACE_DECL. The member name is either an IDENTIFIER_NODE
1936 or a BIT_NOT_EXPR. */
1937 scope
= TREE_OPERAND (name
, 0);
1938 name
= TREE_OPERAND (name
, 1);
1939 gcc_assert (CLASS_TYPE_P (scope
)
1940 || TREE_CODE (scope
) == NAMESPACE_DECL
);
1941 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
1942 || TREE_CODE (name
) == BIT_NOT_EXPR
);
1944 /* If SCOPE is a namespace, then the qualified name does not
1945 name a member of OBJECT_TYPE. */
1946 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
1948 error ("%<%D::%D%> is not a member of %qT",
1949 scope
, name
, object_type
);
1950 return error_mark_node
;
1953 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
1954 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
1955 if (access_path
== error_mark_node
)
1956 return error_mark_node
;
1959 error ("%qT is not a base of %qT", scope
, object_type
);
1960 return error_mark_node
;
1966 access_path
= object_type
;
1969 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1970 member
= lookup_destructor (object
, scope
, name
);
1973 /* Look up the member. */
1974 member
= lookup_member (access_path
, name
, /*protect=*/1,
1975 /*want_type=*/false);
1976 if (member
== NULL_TREE
)
1978 error ("%qD has no member named %qE", object_type
, name
);
1979 return error_mark_node
;
1981 if (member
== error_mark_node
)
1982 return error_mark_node
;
1987 tree
template = member
;
1989 if (BASELINK_P (template))
1990 template = lookup_template_function (template, template_args
);
1993 error ("%qD is not a member template function", name
);
1994 return error_mark_node
;
1999 if (TREE_DEPRECATED (member
))
2000 warn_deprecated_use (member
);
2002 expr
= build_class_member_access_expr (object
, member
, access_path
,
2003 /*preserve_reference=*/false);
2004 if (processing_template_decl
&& expr
!= error_mark_node
)
2005 return build_min_non_dep (COMPONENT_REF
, expr
,
2006 orig_object
, orig_name
, NULL_TREE
);
2010 /* Return an expression for the MEMBER_NAME field in the internal
2011 representation of PTRMEM, a pointer-to-member function. (Each
2012 pointer-to-member function type gets its own RECORD_TYPE so it is
2013 more convenient to access the fields by name than by FIELD_DECL.)
2014 This routine converts the NAME to a FIELD_DECL and then creates the
2015 node for the complete expression. */
2018 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2024 /* This code is a stripped down version of
2025 build_class_member_access_expr. It does not work to use that
2026 routine directly because it expects the object to be of class
2028 ptrmem_type
= TREE_TYPE (ptrmem
);
2029 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2030 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2031 /*want_type=*/false);
2032 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2033 cp_type_quals (ptrmem_type
));
2034 return fold_build3 (COMPONENT_REF
, member_type
,
2035 ptrmem
, member
, NULL_TREE
);
2038 /* Given an expression PTR for a pointer, return an expression
2039 for the value pointed to.
2040 ERRORSTRING is the name of the operator to appear in error messages.
2042 This function may need to overload OPERATOR_FNNAME.
2043 Must also handle REFERENCE_TYPEs for C++. */
2046 build_x_indirect_ref (tree expr
, const char *errorstring
)
2048 tree orig_expr
= expr
;
2051 if (processing_template_decl
)
2053 if (type_dependent_expression_p (expr
))
2054 return build_min_nt (INDIRECT_REF
, expr
);
2055 expr
= build_non_dependent_expr (expr
);
2058 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2059 NULL_TREE
, /*overloaded_p=*/NULL
);
2061 rval
= build_indirect_ref (expr
, errorstring
);
2063 if (processing_template_decl
&& rval
!= error_mark_node
)
2064 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2070 build_indirect_ref (tree ptr
, const char *errorstring
)
2074 if (ptr
== error_mark_node
)
2075 return error_mark_node
;
2077 if (ptr
== current_class_ptr
)
2078 return current_class_ref
;
2080 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2081 ? ptr
: decay_conversion (ptr
));
2082 type
= TREE_TYPE (pointer
);
2084 if (POINTER_TYPE_P (type
))
2088 If the type of the expression is "pointer to T," the type
2089 of the result is "T."
2091 We must use the canonical variant because certain parts of
2092 the back end, like fold, do pointer comparisons between
2094 tree t
= canonical_type_variant (TREE_TYPE (type
));
2096 if (VOID_TYPE_P (t
))
2098 /* A pointer to incomplete type (other than cv void) can be
2099 dereferenced [expr.unary.op]/1 */
2100 error ("%qT is not a pointer-to-object type", type
);
2101 return error_mark_node
;
2103 else if (TREE_CODE (pointer
) == ADDR_EXPR
2104 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2105 /* The POINTER was something like `&x'. We simplify `*&x' to
2107 return TREE_OPERAND (pointer
, 0);
2110 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2112 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2113 so that we get the proper error message if the result is used
2114 to assign to. Also, &* is supposed to be a no-op. */
2115 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2116 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2117 TREE_SIDE_EFFECTS (ref
)
2118 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2122 /* `pointer' won't be an error_mark_node if we were given a
2123 pointer to member, so it's cool to check for this here. */
2124 else if (TYPE_PTR_TO_MEMBER_P (type
))
2125 error ("invalid use of %qs on pointer to member", errorstring
);
2126 else if (pointer
!= error_mark_node
)
2129 error ("invalid type argument of %qs", errorstring
);
2131 error ("invalid type argument");
2133 return error_mark_node
;
2136 /* This handles expressions of the form "a[i]", which denotes
2139 This is logically equivalent in C to *(a+i), but we may do it differently.
2140 If A is a variable or a member, we generate a primitive ARRAY_REF.
2141 This avoids forcing the array out of registers, and can work on
2142 arrays that are not lvalues (for example, members of structures returned
2145 If INDEX is of some user-defined type, it must be converted to
2146 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2147 will inherit the type of the array, which will be some pointer type. */
2150 build_array_ref (tree array
, tree idx
)
2154 error ("subscript missing in array reference");
2155 return error_mark_node
;
2158 if (TREE_TYPE (array
) == error_mark_node
2159 || TREE_TYPE (idx
) == error_mark_node
)
2160 return error_mark_node
;
2162 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2164 switch (TREE_CODE (array
))
2168 tree value
= build_array_ref (TREE_OPERAND (array
, 1), idx
);
2169 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2170 TREE_OPERAND (array
, 0), value
);
2174 return build_conditional_expr
2175 (TREE_OPERAND (array
, 0),
2176 build_array_ref (TREE_OPERAND (array
, 1), idx
),
2177 build_array_ref (TREE_OPERAND (array
, 2), idx
));
2183 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2187 /* Subscripting with type char is likely to lose
2188 on a machine where chars are signed.
2189 So warn on any machine, but optionally.
2190 Don't warn for unsigned char since that type is safe.
2191 Don't warn for signed char because anyone who uses that
2192 must have done so deliberately. */
2193 if (warn_char_subscripts
2194 && TYPE_MAIN_VARIANT (TREE_TYPE (idx
)) == char_type_node
)
2195 warning (0, "array subscript has type %<char%>");
2197 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2199 error ("array subscript is not an integer");
2200 return error_mark_node
;
2203 /* Apply integral promotions *after* noticing character types.
2204 (It is unclear why we do these promotions -- the standard
2205 does not say that we should. In fact, the natural thing would
2206 seem to be to convert IDX to ptrdiff_t; we're performing
2207 pointer arithmetic.) */
2208 idx
= perform_integral_promotions (idx
);
2210 /* An array that is indexed by a non-constant
2211 cannot be stored in a register; we must be able to do
2212 address arithmetic on its address.
2213 Likewise an array of elements of variable size. */
2214 if (TREE_CODE (idx
) != INTEGER_CST
2215 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2216 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2219 if (!cxx_mark_addressable (array
))
2220 return error_mark_node
;
2223 /* An array that is indexed by a constant value which is not within
2224 the array bounds cannot be stored in a register either; because we
2225 would get a crash in store_bit_field/extract_bit_field when trying
2226 to access a non-existent part of the register. */
2227 if (TREE_CODE (idx
) == INTEGER_CST
2228 && TYPE_DOMAIN (TREE_TYPE (array
))
2229 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2231 if (!cxx_mark_addressable (array
))
2232 return error_mark_node
;
2235 if (pedantic
&& !lvalue_p (array
))
2236 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2238 /* Note in C++ it is valid to subscript a `register' array, since
2239 it is valid to take the address of something with that
2240 storage specification. */
2244 while (TREE_CODE (foo
) == COMPONENT_REF
)
2245 foo
= TREE_OPERAND (foo
, 0);
2246 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2247 warning (0, "subscripting array declared %<register%>");
2250 type
= TREE_TYPE (TREE_TYPE (array
));
2251 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2252 /* Array ref is const/volatile if the array elements are
2253 or if the array is.. */
2254 TREE_READONLY (rval
)
2255 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2256 TREE_SIDE_EFFECTS (rval
)
2257 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2258 TREE_THIS_VOLATILE (rval
)
2259 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2260 return require_complete_type (fold_if_not_in_template (rval
));
2264 tree ar
= default_conversion (array
);
2265 tree ind
= default_conversion (idx
);
2267 /* Put the integer in IND to simplify error checking. */
2268 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2275 if (ar
== error_mark_node
)
2278 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2280 error ("subscripted value is neither array nor pointer");
2281 return error_mark_node
;
2283 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2285 error ("array subscript is not an integer");
2286 return error_mark_node
;
2289 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR
, ar
, ind
),
2294 /* Resolve a pointer to member function. INSTANCE is the object
2295 instance to use, if the member points to a virtual member.
2297 This used to avoid checking for virtual functions if basetype
2298 has no virtual functions, according to an earlier ANSI draft.
2299 With the final ISO C++ rules, such an optimization is
2300 incorrect: A pointer to a derived member can be static_cast
2301 to pointer-to-base-member, as long as the dynamic object
2302 later has the right member. */
2305 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2307 if (TREE_CODE (function
) == OFFSET_REF
)
2308 function
= TREE_OPERAND (function
, 1);
2310 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2312 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2313 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2315 tree instance_ptr
= *instance_ptrptr
;
2316 tree instance_save_expr
= 0;
2317 if (instance_ptr
== error_mark_node
)
2319 if (TREE_CODE (function
) == PTRMEM_CST
)
2321 /* Extracting the function address from a pmf is only
2322 allowed with -Wno-pmf-conversions. It only works for
2324 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
2325 e1
= convert (fntype
, e1
);
2330 error ("object missing in use of %qE", function
);
2331 return error_mark_node
;
2335 if (TREE_SIDE_EFFECTS (instance_ptr
))
2336 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
2338 if (TREE_SIDE_EFFECTS (function
))
2339 function
= save_expr (function
);
2341 /* Start by extracting all the information from the PMF itself. */
2342 e3
= pfn_from_ptrmemfunc (function
);
2343 delta
= build_ptrmemfunc_access_expr (function
, delta_identifier
);
2344 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
2345 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
2347 case ptrmemfunc_vbit_in_pfn
:
2348 e1
= cp_build_binary_op (BIT_AND_EXPR
, idx
, integer_one_node
);
2349 idx
= cp_build_binary_op (MINUS_EXPR
, idx
, integer_one_node
);
2352 case ptrmemfunc_vbit_in_delta
:
2353 e1
= cp_build_binary_op (BIT_AND_EXPR
, delta
, integer_one_node
);
2354 delta
= cp_build_binary_op (RSHIFT_EXPR
, delta
, integer_one_node
);
2361 /* Convert down to the right base before using the instance. A
2362 special case is that in a pointer to member of class C, C may
2363 be incomplete. In that case, the function will of course be
2364 a member of C, and no conversion is required. In fact,
2365 lookup_base will fail in that case, because incomplete
2366 classes do not have BINFOs. */
2367 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2368 if (!same_type_ignoring_top_level_qualifiers_p
2369 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
2371 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
2372 basetype
, ba_check
, NULL
);
2373 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
2375 if (instance_ptr
== error_mark_node
)
2376 return error_mark_node
;
2378 /* ...and then the delta in the PMF. */
2379 instance_ptr
= build2 (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2380 instance_ptr
, delta
);
2382 /* Hand back the adjusted 'this' argument to our caller. */
2383 *instance_ptrptr
= instance_ptr
;
2385 /* Next extract the vtable pointer from the object. */
2386 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
2388 vtbl
= build_indirect_ref (vtbl
, NULL
);
2390 /* Finally, extract the function pointer from the vtable. */
2391 e2
= fold_build2 (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, idx
);
2392 e2
= build_indirect_ref (e2
, NULL
);
2393 TREE_CONSTANT (e2
) = 1;
2394 TREE_INVARIANT (e2
) = 1;
2396 /* When using function descriptors, the address of the
2397 vtable entry is treated as a function pointer. */
2398 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2399 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
2400 build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1));
2402 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2403 e1
= build_conditional_expr (e1
, e2
, e3
);
2405 /* Make sure this doesn't get evaluated first inside one of the
2406 branches of the COND_EXPR. */
2407 if (instance_save_expr
)
2408 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
2409 instance_save_expr
, e1
);
2417 build_function_call (tree function
, tree params
)
2419 tree fntype
, fndecl
;
2420 tree coerced_params
;
2421 tree name
= NULL_TREE
;
2423 tree original
= function
;
2425 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2426 expressions, like those used for ObjC messenger dispatches. */
2427 function
= objc_rewrite_function_call (function
, params
);
2429 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2430 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2431 if (TREE_CODE (function
) == NOP_EXPR
2432 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2433 function
= TREE_OPERAND (function
, 0);
2435 if (TREE_CODE (function
) == FUNCTION_DECL
)
2437 name
= DECL_NAME (function
);
2439 mark_used (function
);
2442 /* Convert anything with function type to a pointer-to-function. */
2443 if (pedantic
&& DECL_MAIN_P (function
))
2444 pedwarn ("ISO C++ forbids calling %<::main%> from within program");
2446 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2447 (because calling an inline function does not mean the function
2448 needs to be separately compiled). */
2450 if (DECL_INLINE (function
))
2451 function
= inline_conversion (function
);
2453 function
= build_addr_func (function
);
2459 function
= build_addr_func (function
);
2462 if (function
== error_mark_node
)
2463 return error_mark_node
;
2465 fntype
= TREE_TYPE (function
);
2467 if (TYPE_PTRMEMFUNC_P (fntype
))
2469 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2470 "function in %<%E (...)%>",
2472 return error_mark_node
;
2475 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2476 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2478 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2479 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2481 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2483 error ("%qE cannot be used as a function", original
);
2484 return error_mark_node
;
2487 /* fntype now gets the type of function pointed to. */
2488 fntype
= TREE_TYPE (fntype
);
2490 /* Convert the parameters to the types declared in the
2491 function prototype, or apply default promotions. */
2493 coerced_params
= convert_arguments (TYPE_ARG_TYPES (fntype
),
2494 params
, fndecl
, LOOKUP_NORMAL
);
2495 if (coerced_params
== error_mark_node
)
2496 return error_mark_node
;
2498 /* Check for errors in format strings and inappropriately
2501 check_function_arguments (TYPE_ATTRIBUTES (fntype
), coerced_params
,
2502 TYPE_ARG_TYPES (fntype
));
2504 return build_cxx_call (function
, coerced_params
);
2507 /* Convert the actual parameter expressions in the list VALUES
2508 to the types in the list TYPELIST.
2509 If parmdecls is exhausted, or when an element has NULL as its type,
2510 perform the default conversions.
2512 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2514 This is also where warnings about wrong number of args are generated.
2516 Return a list of expressions for the parameters as converted.
2518 Both VALUES and the returned value are chains of TREE_LIST nodes
2519 with the elements of the list in the TREE_VALUE slots of those nodes.
2521 In C++, unspecified trailing parameters can be filled in with their
2522 default arguments, if such were specified. Do so here. */
2525 convert_arguments (tree typelist
, tree values
, tree fndecl
, int flags
)
2527 tree typetail
, valtail
;
2528 tree result
= NULL_TREE
;
2529 const char *called_thing
= 0;
2532 /* Argument passing is always copy-initialization. */
2533 flags
|= LOOKUP_ONLYCONVERTING
;
2537 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2539 if (DECL_NAME (fndecl
) == NULL_TREE
2540 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2541 called_thing
= "constructor";
2543 called_thing
= "member function";
2546 called_thing
= "function";
2549 for (valtail
= values
, typetail
= typelist
;
2551 valtail
= TREE_CHAIN (valtail
), i
++)
2553 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2554 tree val
= TREE_VALUE (valtail
);
2556 if (val
== error_mark_node
)
2557 return error_mark_node
;
2559 if (type
== void_type_node
)
2563 error ("too many arguments to %s %q+#D", called_thing
, fndecl
);
2564 error ("at this point in file");
2567 error ("too many arguments to function");
2568 /* In case anybody wants to know if this argument
2571 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2575 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2576 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2577 if (TREE_CODE (val
) == NOP_EXPR
2578 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
2579 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
2580 val
= TREE_OPERAND (val
, 0);
2582 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
2584 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
2585 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
2586 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2587 val
= decay_conversion (val
);
2590 if (val
== error_mark_node
)
2591 return error_mark_node
;
2595 /* Formal parm type is specified by a function prototype. */
2598 if (!COMPLETE_TYPE_P (complete_type (type
)))
2601 error ("parameter %P of %qD has incomplete type %qT",
2604 error ("parameter %P has incomplete type %qT", i
, type
);
2605 parmval
= error_mark_node
;
2609 parmval
= convert_for_initialization
2610 (NULL_TREE
, type
, val
, flags
,
2611 "argument passing", fndecl
, i
);
2612 parmval
= convert_for_arg_passing (type
, parmval
);
2615 if (parmval
== error_mark_node
)
2616 return error_mark_node
;
2618 result
= tree_cons (NULL_TREE
, parmval
, result
);
2622 if (fndecl
&& DECL_BUILT_IN (fndecl
)
2623 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
2624 /* Don't do ellipsis conversion for __built_in_constant_p
2625 as this will result in spurious warnings for non-POD
2627 val
= require_complete_type (val
);
2629 val
= convert_arg_to_ellipsis (val
);
2631 result
= tree_cons (NULL_TREE
, val
, result
);
2635 typetail
= TREE_CHAIN (typetail
);
2638 if (typetail
!= 0 && typetail
!= void_list_node
)
2640 /* See if there are default arguments that can be used. */
2641 if (TREE_PURPOSE (typetail
)
2642 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
2644 for (; typetail
!= void_list_node
; ++i
)
2647 = convert_default_arg (TREE_VALUE (typetail
),
2648 TREE_PURPOSE (typetail
),
2651 if (parmval
== error_mark_node
)
2652 return error_mark_node
;
2654 result
= tree_cons (0, parmval
, result
);
2655 typetail
= TREE_CHAIN (typetail
);
2656 /* ends with `...'. */
2657 if (typetail
== NULL_TREE
)
2665 error ("too few arguments to %s %q+#D", called_thing
, fndecl
);
2666 error ("at this point in file");
2669 error ("too few arguments to function");
2670 return error_mark_list
;
2674 return nreverse (result
);
2677 /* Build a binary-operation expression, after performing default
2678 conversions on the operands. CODE is the kind of expression to build. */
2681 build_x_binary_op (enum tree_code code
, tree arg1
, tree arg2
,
2691 if (processing_template_decl
)
2693 if (type_dependent_expression_p (arg1
)
2694 || type_dependent_expression_p (arg2
))
2695 return build_min_nt (code
, arg1
, arg2
);
2696 arg1
= build_non_dependent_expr (arg1
);
2697 arg2
= build_non_dependent_expr (arg2
);
2700 if (code
== DOTSTAR_EXPR
)
2701 expr
= build_m_component_ref (arg1
, arg2
);
2703 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
2706 if (processing_template_decl
&& expr
!= error_mark_node
)
2707 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
2712 /* Build a binary-operation expression without default conversions.
2713 CODE is the kind of expression to build.
2714 This function differs from `build' in several ways:
2715 the data type of the result is computed and recorded in it,
2716 warnings are generated if arg data types are invalid,
2717 special handling for addition and subtraction of pointers is known,
2718 and some optimization is done (operations on narrow ints
2719 are done in the narrower type when that gives the same result).
2720 Constant folding is also done before the result is returned.
2722 Note that the operands will never have enumeral types
2723 because either they have just had the default conversions performed
2724 or they have both just been converted to some other type in which
2725 the arithmetic is to be done.
2727 C++: must do special pointer arithmetic when implementing
2728 multiple inheritance, and deal with pointer to member functions. */
2731 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
2732 int convert_p ATTRIBUTE_UNUSED
)
2735 enum tree_code code0
, code1
;
2737 const char *invalid_op_diag
;
2739 /* Expression code to give to the expression when it is built.
2740 Normally this is CODE, which is what the caller asked for,
2741 but in some special cases we change it. */
2742 enum tree_code resultcode
= code
;
2744 /* Data type in which the computation is to be performed.
2745 In the simplest cases this is the common type of the arguments. */
2746 tree result_type
= NULL
;
2748 /* Nonzero means operands have already been type-converted
2749 in whatever way is necessary.
2750 Zero means they need to be converted to RESULT_TYPE. */
2753 /* Nonzero means create the expression with this type, rather than
2755 tree build_type
= 0;
2757 /* Nonzero means after finally constructing the expression
2758 convert it to this type. */
2759 tree final_type
= 0;
2763 /* Nonzero if this is an operation like MIN or MAX which can
2764 safely be computed in short if both args are promoted shorts.
2765 Also implies COMMON.
2766 -1 indicates a bitwise operation; this makes a difference
2767 in the exact conditions for when it is safe to do the operation
2768 in a narrower mode. */
2771 /* Nonzero if this is a comparison operation;
2772 if both args are promoted shorts, compare the original shorts.
2773 Also implies COMMON. */
2774 int short_compare
= 0;
2776 /* Nonzero if this is a right-shift operation, which can be computed on the
2777 original short and then promoted if the operand is a promoted short. */
2778 int short_shift
= 0;
2780 /* Nonzero means set RESULT_TYPE to the common type of the args. */
2783 /* True if both operands have arithmetic type. */
2784 bool arithmetic_types_p
;
2786 /* Apply default conversions. */
2790 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
2791 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
2792 || code
== TRUTH_XOR_EXPR
)
2794 if (!really_overloaded_fn (op0
))
2795 op0
= decay_conversion (op0
);
2796 if (!really_overloaded_fn (op1
))
2797 op1
= decay_conversion (op1
);
2801 if (!really_overloaded_fn (op0
))
2802 op0
= default_conversion (op0
);
2803 if (!really_overloaded_fn (op1
))
2804 op1
= default_conversion (op1
);
2807 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2808 STRIP_TYPE_NOPS (op0
);
2809 STRIP_TYPE_NOPS (op1
);
2811 /* DTRT if one side is an overloaded function, but complain about it. */
2812 if (type_unknown_p (op0
))
2814 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
2815 if (t
!= error_mark_node
)
2817 pedwarn ("assuming cast to type %qT from overloaded function",
2822 if (type_unknown_p (op1
))
2824 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
2825 if (t
!= error_mark_node
)
2827 pedwarn ("assuming cast to type %qT from overloaded function",
2833 type0
= TREE_TYPE (op0
);
2834 type1
= TREE_TYPE (op1
);
2836 /* The expression codes of the data types of the arguments tell us
2837 whether the arguments are integers, floating, pointers, etc. */
2838 code0
= TREE_CODE (type0
);
2839 code1
= TREE_CODE (type1
);
2841 /* If an error was already reported for one of the arguments,
2842 avoid reporting another error. */
2844 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
2845 return error_mark_node
;
2847 if ((invalid_op_diag
2848 = targetm
.invalid_binary_op (code
, type0
, type1
)))
2850 error (invalid_op_diag
);
2851 return error_mark_node
;
2857 /* Handle the pointer + int case. */
2858 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2859 return cp_pointer_int_sum (PLUS_EXPR
, op0
, op1
);
2860 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
2861 return cp_pointer_int_sum (PLUS_EXPR
, op1
, op0
);
2867 /* Subtraction of two similar pointers.
2868 We must subtract them as integers, then divide by object size. */
2869 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
2870 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
2872 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
2873 /* Handle pointer minus int. Just like pointer plus int. */
2874 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2875 return cp_pointer_int_sum (MINUS_EXPR
, op0
, op1
);
2884 case TRUNC_DIV_EXPR
:
2886 case FLOOR_DIV_EXPR
:
2887 case ROUND_DIV_EXPR
:
2888 case EXACT_DIV_EXPR
:
2889 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
2890 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
2891 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2892 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
2894 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
2895 warning (0, "division by zero in %<%E / 0%>", op0
);
2896 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
2897 warning (0, "division by zero in %<%E / 0.%>", op0
);
2899 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
2900 code0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
2901 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
2902 code1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
2904 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
2905 resultcode
= RDIV_EXPR
;
2907 /* When dividing two signed integers, we have to promote to int.
2908 unless we divide by a constant != -1. Note that default
2909 conversion will have been performed on the operands at this
2910 point, so we have to dig out the original type to find out if
2912 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
2913 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
2914 || (TREE_CODE (op1
) == INTEGER_CST
2915 && ! integer_all_onesp (op1
)));
2924 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2925 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
))
2929 case TRUNC_MOD_EXPR
:
2930 case FLOOR_MOD_EXPR
:
2931 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
2932 warning (0, "division by zero in %<%E %% 0%>", op0
);
2933 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
2934 warning (0, "division by zero in %<%E %% 0.%>", op0
);
2936 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2938 /* Although it would be tempting to shorten always here, that loses
2939 on some targets, since the modulo instruction is undefined if the
2940 quotient can't be represented in the computation mode. We shorten
2941 only if unsigned or if dividing by something we know != -1. */
2942 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
2943 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
2944 || (TREE_CODE (op1
) == INTEGER_CST
2945 && ! integer_all_onesp (op1
)));
2950 case TRUTH_ANDIF_EXPR
:
2951 case TRUTH_ORIF_EXPR
:
2952 case TRUTH_AND_EXPR
:
2954 result_type
= boolean_type_node
;
2957 /* Shift operations: result has same type as first operand;
2958 always convert second operand to int.
2959 Also set SHORT_SHIFT if shifting rightward. */
2962 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2964 result_type
= type0
;
2965 if (TREE_CODE (op1
) == INTEGER_CST
)
2967 if (tree_int_cst_lt (op1
, integer_zero_node
))
2968 warning (0, "right shift count is negative");
2971 if (! integer_zerop (op1
))
2973 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2974 warning (0, "right shift count >= width of type");
2977 /* Convert the shift-count to an integer, regardless of
2978 size of value being shifted. */
2979 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2980 op1
= cp_convert (integer_type_node
, op1
);
2981 /* Avoid converting op1 to result_type later. */
2987 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2989 result_type
= type0
;
2990 if (TREE_CODE (op1
) == INTEGER_CST
)
2992 if (tree_int_cst_lt (op1
, integer_zero_node
))
2993 warning (0, "left shift count is negative");
2994 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2995 warning (0, "left shift count >= width of type");
2997 /* Convert the shift-count to an integer, regardless of
2998 size of value being shifted. */
2999 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3000 op1
= cp_convert (integer_type_node
, op1
);
3001 /* Avoid converting op1 to result_type later. */
3008 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3010 result_type
= type0
;
3011 if (TREE_CODE (op1
) == INTEGER_CST
)
3013 if (tree_int_cst_lt (op1
, integer_zero_node
))
3014 warning (0, "%s rotate count is negative",
3015 (code
== LROTATE_EXPR
) ? "left" : "right");
3016 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3017 warning (0, "%s rotate count >= width of type",
3018 (code
== LROTATE_EXPR
) ? "left" : "right");
3020 /* Convert the shift-count to an integer, regardless of
3021 size of value being shifted. */
3022 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3023 op1
= cp_convert (integer_type_node
, op1
);
3029 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
3030 warning (0, "comparing floating point with == or != is unsafe");
3032 build_type
= boolean_type_node
;
3033 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3034 || code0
== COMPLEX_TYPE
)
3035 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3036 || code1
== COMPLEX_TYPE
))
3038 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3039 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3040 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3042 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3043 && null_ptr_cst_p (op1
))
3044 result_type
= type0
;
3045 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3046 && null_ptr_cst_p (op0
))
3047 result_type
= type1
;
3048 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3050 result_type
= type0
;
3051 error ("ISO C++ forbids comparison between pointer and integer");
3053 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3055 result_type
= type1
;
3056 error ("ISO C++ forbids comparison between pointer and integer");
3058 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3060 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3061 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3062 result_type
= TREE_TYPE (op0
);
3064 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3065 return cp_build_binary_op (code
, op1
, op0
);
3066 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3067 && same_type_p (type0
, type1
))
3069 /* E will be the final comparison. */
3071 /* E1 and E2 are for scratch. */
3079 if (TREE_SIDE_EFFECTS (op0
))
3080 op0
= save_expr (op0
);
3081 if (TREE_SIDE_EFFECTS (op1
))
3082 op1
= save_expr (op1
);
3087 && (!op0.pfn || op0.delta == op1.delta))
3089 The reason for the `!op0.pfn' bit is that a NULL
3090 pointer-to-member is any member with a zero PFN; the
3091 DELTA field is unspecified. */
3092 pfn0
= pfn_from_ptrmemfunc (op0
);
3093 pfn1
= pfn_from_ptrmemfunc (op1
);
3094 delta0
= build_ptrmemfunc_access_expr (op0
,
3096 delta1
= build_ptrmemfunc_access_expr (op1
,
3098 e1
= cp_build_binary_op (EQ_EXPR
, delta0
, delta1
);
3099 e2
= cp_build_binary_op (EQ_EXPR
,
3101 cp_convert (TREE_TYPE (pfn0
),
3102 integer_zero_node
));
3103 e1
= cp_build_binary_op (TRUTH_ORIF_EXPR
, e1
, e2
);
3104 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
3105 e
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, e2
, e1
);
3106 if (code
== EQ_EXPR
)
3108 return cp_build_binary_op (EQ_EXPR
, e
, integer_zero_node
);
3112 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
3113 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
3115 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
3116 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
3124 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3125 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3127 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3128 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3136 build_type
= boolean_type_node
;
3137 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3138 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3140 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3141 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3143 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3144 && integer_zerop (op1
))
3145 result_type
= type0
;
3146 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3147 && integer_zerop (op0
))
3148 result_type
= type1
;
3149 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3151 result_type
= type0
;
3152 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3154 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3156 result_type
= type1
;
3157 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3161 case UNORDERED_EXPR
:
3168 build_type
= integer_type_node
;
3169 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
3171 error ("unordered comparison on non-floating point argument");
3172 return error_mark_node
;
3181 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3182 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3183 || code1
== COMPLEX_TYPE
)))
3184 arithmetic_types_p
= 1;
3187 arithmetic_types_p
= 0;
3188 /* Vector arithmetic is only allowed when both sides are vectors. */
3189 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
3191 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
3192 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
3195 binary_op_error (code
);
3196 return error_mark_node
;
3198 arithmetic_types_p
= 1;
3201 /* Determine the RESULT_TYPE, if it is not already known. */
3203 && arithmetic_types_p
3204 && (shorten
|| common
|| short_compare
))
3205 result_type
= common_type (type0
, type1
);
3209 error ("invalid operands of types %qT and %qT to binary %qO",
3210 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
3211 return error_mark_node
;
3214 /* If we're in a template, the only thing we need to know is the
3216 if (processing_template_decl
)
3217 return build2 (resultcode
,
3218 build_type
? build_type
: result_type
,
3221 if (arithmetic_types_p
)
3223 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3225 /* For certain operations (which identify themselves by shorten != 0)
3226 if both args were extended from the same smaller type,
3227 do the arithmetic in that type and then extend.
3229 shorten !=0 and !=1 indicates a bitwise operation.
3230 For them, this optimization is safe only if
3231 both args are zero-extended or both are sign-extended.
3232 Otherwise, we might change the result.
3233 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3234 but calculated in (unsigned short) it would be (unsigned short)-1. */
3236 if (shorten
&& none_complex
)
3238 int unsigned0
, unsigned1
;
3239 tree arg0
= get_narrower (op0
, &unsigned0
);
3240 tree arg1
= get_narrower (op1
, &unsigned1
);
3241 /* UNS is 1 if the operation to be done is an unsigned one. */
3242 int uns
= TYPE_UNSIGNED (result_type
);
3245 final_type
= result_type
;
3247 /* Handle the case that OP0 does not *contain* a conversion
3248 but it *requires* conversion to FINAL_TYPE. */
3250 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3251 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3252 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3253 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3255 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3257 /* For bitwise operations, signedness of nominal type
3258 does not matter. Consider only how operands were extended. */
3262 /* Note that in all three cases below we refrain from optimizing
3263 an unsigned operation on sign-extended args.
3264 That would not be valid. */
3266 /* Both args variable: if both extended in same way
3267 from same width, do it in that width.
3268 Do it unsigned if args were zero-extended. */
3269 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3270 < TYPE_PRECISION (result_type
))
3271 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3272 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3273 && unsigned0
== unsigned1
3274 && (unsigned0
|| !uns
))
3275 result_type
= c_common_signed_or_unsigned_type
3276 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
3277 else if (TREE_CODE (arg0
) == INTEGER_CST
3278 && (unsigned1
|| !uns
)
3279 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3280 < TYPE_PRECISION (result_type
))
3281 && (type
= c_common_signed_or_unsigned_type
3282 (unsigned1
, TREE_TYPE (arg1
)),
3283 int_fits_type_p (arg0
, type
)))
3285 else if (TREE_CODE (arg1
) == INTEGER_CST
3286 && (unsigned0
|| !uns
)
3287 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3288 < TYPE_PRECISION (result_type
))
3289 && (type
= c_common_signed_or_unsigned_type
3290 (unsigned0
, TREE_TYPE (arg0
)),
3291 int_fits_type_p (arg1
, type
)))
3295 /* Shifts can be shortened if shifting right. */
3300 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3302 final_type
= result_type
;
3304 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3305 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3307 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3308 /* We can shorten only if the shift count is less than the
3309 number of bits in the smaller type size. */
3310 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
3311 /* If arg is sign-extended and then unsigned-shifted,
3312 we can simulate this with a signed shift in arg's type
3313 only if the extended result is at least twice as wide
3314 as the arg. Otherwise, the shift could use up all the
3315 ones made by sign-extension and bring in zeros.
3316 We can't optimize that case at all, but in most machines
3317 it never happens because available widths are 2**N. */
3318 && (!TYPE_UNSIGNED (final_type
)
3320 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3321 <= TYPE_PRECISION (result_type
))))
3323 /* Do an unsigned shift if the operand was zero-extended. */
3325 = c_common_signed_or_unsigned_type (unsigned_arg
,
3327 /* Convert value-to-be-shifted to that type. */
3328 if (TREE_TYPE (op0
) != result_type
)
3329 op0
= cp_convert (result_type
, op0
);
3334 /* Comparison operations are shortened too but differently.
3335 They identify themselves by setting short_compare = 1. */
3339 /* Don't write &op0, etc., because that would prevent op0
3340 from being kept in a register.
3341 Instead, make copies of the our local variables and
3342 pass the copies by reference, then copy them back afterward. */
3343 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3344 enum tree_code xresultcode
= resultcode
;
3346 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3348 return cp_convert (boolean_type_node
, val
);
3349 op0
= xop0
, op1
= xop1
;
3351 resultcode
= xresultcode
;
3354 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
3355 && warn_sign_compare
3356 /* Do not warn until the template is instantiated; we cannot
3357 bound the ranges of the arguments until that point. */
3358 && !processing_template_decl
)
3360 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
3361 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3363 int unsignedp0
, unsignedp1
;
3364 tree primop0
= get_narrower (op0
, &unsignedp0
);
3365 tree primop1
= get_narrower (op1
, &unsignedp1
);
3367 /* Check for comparison of different enum types. */
3368 if (TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3369 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3370 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3371 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3373 warning (0, "comparison between types %q#T and %q#T",
3374 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3377 /* Give warnings for comparisons between signed and unsigned
3378 quantities that may fail. */
3379 /* Do the checking based on the original operand trees, so that
3380 casts will be considered, but default promotions won't be. */
3382 /* Do not warn if the comparison is being done in a signed type,
3383 since the signed type will only be chosen if it can represent
3384 all the values of the unsigned type. */
3385 if (!TYPE_UNSIGNED (result_type
))
3387 /* Do not warn if both operands are unsigned. */
3388 else if (op0_signed
== op1_signed
)
3390 /* Do not warn if the signed quantity is an unsuffixed
3391 integer literal (or some static constant expression
3392 involving such literals or a conditional expression
3393 involving such literals) and it is non-negative. */
3394 else if ((op0_signed
&& tree_expr_nonnegative_p (orig_op0
))
3395 || (op1_signed
&& tree_expr_nonnegative_p (orig_op1
)))
3397 /* Do not warn if the comparison is an equality operation,
3398 the unsigned quantity is an integral constant and it does
3399 not use the most significant bit of result_type. */
3400 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3401 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3402 && int_fits_type_p (orig_op1
, c_common_signed_type
3404 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3405 && int_fits_type_p (orig_op0
, c_common_signed_type
3409 warning (0, "comparison between signed and unsigned integer expressions");
3411 /* Warn if two unsigned values are being compared in a size
3412 larger than their original size, and one (and only one) is the
3413 result of a `~' operator. This comparison will always fail.
3415 Also warn if one operand is a constant, and the constant does not
3416 have all bits set that are set in the ~ operand when it is
3419 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3420 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3422 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3423 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3424 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3425 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3427 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
3430 HOST_WIDE_INT constant
, mask
;
3434 if (host_integerp (primop0
, 0))
3437 unsignedp
= unsignedp1
;
3438 constant
= tree_low_cst (primop0
, 0);
3443 unsignedp
= unsignedp0
;
3444 constant
= tree_low_cst (primop1
, 0);
3447 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3448 if (bits
< TYPE_PRECISION (result_type
)
3449 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3451 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3452 if ((mask
& constant
) != mask
)
3453 warning (0, "comparison of promoted ~unsigned with constant");
3456 else if (unsignedp0
&& unsignedp1
3457 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3458 < TYPE_PRECISION (result_type
))
3459 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3460 < TYPE_PRECISION (result_type
)))
3461 warning (0, "comparison of promoted ~unsigned with unsigned");
3466 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3467 Then the expression will be built.
3468 It will be given type FINAL_TYPE if that is nonzero;
3469 otherwise, it will be given type RESULT_TYPE. */
3471 /* Issue warnings about peculiar, but valid, uses of NULL. */
3472 if (/* It's reasonable to use pointer values as operands of &&
3473 and ||, so NULL is no exception. */
3474 !(code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
3475 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
3476 (orig_op0
== null_node
3477 && TREE_CODE (TREE_TYPE (op1
)) != POINTER_TYPE
)
3478 /* Or vice versa. */
3479 || (orig_op1
== null_node
3480 && TREE_CODE (TREE_TYPE (op0
)) != POINTER_TYPE
)
3481 /* Or, both are NULL and the operation was not a comparison. */
3482 || (orig_op0
== null_node
&& orig_op1
== null_node
3483 && code
!= EQ_EXPR
&& code
!= NE_EXPR
)))
3484 /* Some sort of arithmetic operation involving NULL was
3485 performed. Note that pointer-difference and pointer-addition
3486 have already been handled above, and so we don't end up here in
3488 warning (0, "NULL used in arithmetic");
3492 if (TREE_TYPE (op0
) != result_type
)
3493 op0
= cp_convert (result_type
, op0
);
3494 if (TREE_TYPE (op1
) != result_type
)
3495 op1
= cp_convert (result_type
, op1
);
3497 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3498 return error_mark_node
;
3501 if (build_type
== NULL_TREE
)
3502 build_type
= result_type
;
3504 result
= build2 (resultcode
, build_type
, op0
, op1
);
3505 result
= fold_if_not_in_template (result
);
3506 if (final_type
!= 0)
3507 result
= cp_convert (final_type
, result
);
3511 /* Return a tree for the sum or difference (RESULTCODE says which)
3512 of pointer PTROP and integer INTOP. */
3515 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3517 tree res_type
= TREE_TYPE (ptrop
);
3519 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3520 in certain circumstance (when it's valid to do so). So we need
3521 to make sure it's complete. We don't need to check here, if we
3522 can actually complete it at all, as those checks will be done in
3523 pointer_int_sum() anyway. */
3524 complete_type (TREE_TYPE (res_type
));
3526 return pointer_int_sum (resultcode
, ptrop
,
3527 fold_if_not_in_template (intop
));
3530 /* Return a tree for the difference of pointers OP0 and OP1.
3531 The resulting tree has type int. */
3534 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
3537 tree restype
= ptrdiff_type_node
;
3538 tree target_type
= TREE_TYPE (ptrtype
);
3540 if (!complete_type_or_else (target_type
, NULL_TREE
))
3541 return error_mark_node
;
3543 if (pedantic
|| warn_pointer_arith
)
3545 if (TREE_CODE (target_type
) == VOID_TYPE
)
3546 pedwarn ("ISO C++ forbids using pointer of type %<void *%> in subtraction");
3547 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3548 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3549 if (TREE_CODE (target_type
) == METHOD_TYPE
)
3550 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3553 /* First do the subtraction as integers;
3554 then drop through to build the divide operator. */
3556 op0
= cp_build_binary_op (MINUS_EXPR
,
3557 cp_convert (restype
, op0
),
3558 cp_convert (restype
, op1
));
3560 /* This generates an error if op1 is a pointer to an incomplete type. */
3561 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
3562 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3564 op1
= (TYPE_PTROB_P (ptrtype
)
3565 ? size_in_bytes (target_type
)
3566 : integer_one_node
);
3568 /* Do the division. */
3570 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
3571 return fold_if_not_in_template (result
);
3574 /* Construct and perhaps optimize a tree representation
3575 for a unary operation. CODE, a tree_code, specifies the operation
3576 and XARG is the operand. */
3579 build_x_unary_op (enum tree_code code
, tree xarg
)
3581 tree orig_expr
= xarg
;
3585 if (processing_template_decl
)
3587 if (type_dependent_expression_p (xarg
))
3588 return build_min_nt (code
, xarg
, NULL_TREE
);
3590 xarg
= build_non_dependent_expr (xarg
);
3595 /* [expr.unary.op] says:
3597 The address of an object of incomplete type can be taken.
3599 (And is just the ordinary address operator, not an overloaded
3600 "operator &".) However, if the type is a template
3601 specialization, we must complete the type at this point so that
3602 an overloaded "operator &" will be available if required. */
3603 if (code
== ADDR_EXPR
3604 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
3605 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
3606 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
3607 || (TREE_CODE (xarg
) == OFFSET_REF
)))
3608 /* Don't look for a function. */;
3610 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
3611 /*overloaded_p=*/NULL
);
3612 if (!exp
&& code
== ADDR_EXPR
)
3614 /* A pointer to member-function can be formed only by saying
3616 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
3617 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
3619 if (TREE_CODE (xarg
) != OFFSET_REF
)
3621 error ("invalid use of %qE to form a pointer-to-member-function."
3622 " Use a qualified-id.",
3624 return error_mark_node
;
3628 error ("parenthesis around %qE cannot be used to form a"
3629 " pointer-to-member-function",
3631 PTRMEM_OK_P (xarg
) = 1;
3635 if (TREE_CODE (xarg
) == OFFSET_REF
)
3637 ptrmem
= PTRMEM_OK_P (xarg
);
3639 if (!ptrmem
&& !flag_ms_extensions
3640 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
3642 /* A single non-static member, make sure we don't allow a
3643 pointer-to-member. */
3644 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
3645 TREE_OPERAND (xarg
, 0),
3646 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
3647 PTRMEM_OK_P (xarg
) = ptrmem
;
3650 else if (TREE_CODE (xarg
) == TARGET_EXPR
)
3651 warning (0, "taking address of temporary");
3652 exp
= build_unary_op (ADDR_EXPR
, xarg
, 0);
3655 if (processing_template_decl
&& exp
!= error_mark_node
)
3656 exp
= build_min_non_dep (code
, exp
, orig_expr
,
3657 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
3658 if (TREE_CODE (exp
) == ADDR_EXPR
)
3659 PTRMEM_OK_P (exp
) = ptrmem
;
3663 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
3664 constants, where a null value is represented by an INTEGER_CST of
3668 cp_truthvalue_conversion (tree expr
)
3670 tree type
= TREE_TYPE (expr
);
3671 if (TYPE_PTRMEM_P (type
))
3672 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
3674 return c_common_truthvalue_conversion (expr
);
3677 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
3680 condition_conversion (tree expr
)
3683 if (processing_template_decl
)
3685 t
= perform_implicit_conversion (boolean_type_node
, expr
);
3686 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
3690 /* Return an ADDR_EXPR giving the address of T. This function
3691 attempts no optimizations or simplifications; it is a low-level
3695 build_address (tree t
)
3699 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
3700 return error_mark_node
;
3702 addr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (t
)), t
);
3707 /* Return a NOP_EXPR converting EXPR to TYPE. */
3710 build_nop (tree type
, tree expr
)
3712 if (type
== error_mark_node
|| error_operand_p (expr
))
3714 return build1 (NOP_EXPR
, type
, expr
);
3717 /* C++: Must handle pointers to members.
3719 Perhaps type instantiation should be extended to handle conversion
3720 from aggregates to types we don't yet know we want? (Or are those
3721 cases typically errors which should be reported?)
3723 NOCONVERT nonzero suppresses the default promotions
3724 (such as from short to int). */
3727 build_unary_op (enum tree_code code
, tree xarg
, int noconvert
)
3729 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3732 const char *errstring
= NULL
;
3734 const char *invalid_op_diag
;
3736 if (arg
== error_mark_node
)
3737 return error_mark_node
;
3739 if ((invalid_op_diag
3740 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
3745 error (invalid_op_diag
);
3746 return error_mark_node
;
3751 case UNARY_PLUS_EXPR
:
3754 int flags
= WANT_ARITH
| WANT_ENUM
;
3755 /* Unary plus (but not unary minus) is allowed on pointers. */
3756 if (code
== UNARY_PLUS_EXPR
)
3757 flags
|= WANT_POINTER
;
3758 arg
= build_expr_type_conversion (flags
, arg
, true);
3760 errstring
= (code
== NEGATE_EXPR
3761 ? "wrong type argument to unary minus"
3762 : "wrong type argument to unary plus");
3765 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
3766 arg
= perform_integral_promotions (arg
);
3768 /* Make sure the result is not a lvalue: a unary plus or minus
3769 expression is always a rvalue. */
3770 if (real_lvalue_p (arg
))
3771 arg
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (arg
), arg
);
3777 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3781 arg
= default_conversion (arg
);
3783 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
3785 errstring
= "wrong type argument to bit-complement";
3786 else if (!noconvert
)
3787 arg
= perform_integral_promotions (arg
);
3791 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3792 errstring
= "wrong type argument to abs";
3793 else if (!noconvert
)
3794 arg
= default_conversion (arg
);
3798 /* Conjugating a real value is a no-op, but allow it anyway. */
3799 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3800 errstring
= "wrong type argument to conjugation";
3801 else if (!noconvert
)
3802 arg
= default_conversion (arg
);
3805 case TRUTH_NOT_EXPR
:
3806 arg
= perform_implicit_conversion (boolean_type_node
, arg
);
3807 val
= invert_truthvalue (arg
);
3808 if (arg
!= error_mark_node
)
3810 errstring
= "in argument to unary !";
3817 if (TREE_CODE (arg
) == COMPLEX_CST
)
3818 return TREE_REALPART (arg
);
3819 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3821 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3822 return fold_if_not_in_template (arg
);
3828 if (TREE_CODE (arg
) == COMPLEX_CST
)
3829 return TREE_IMAGPART (arg
);
3830 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3832 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3833 return fold_if_not_in_template (arg
);
3836 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
3838 case PREINCREMENT_EXPR
:
3839 case POSTINCREMENT_EXPR
:
3840 case PREDECREMENT_EXPR
:
3841 case POSTDECREMENT_EXPR
:
3842 /* Handle complex lvalues (when permitted)
3843 by reduction to simpler cases. */
3845 val
= unary_complex_lvalue (code
, arg
);
3849 /* Increment or decrement the real part of the value,
3850 and don't change the imaginary part. */
3851 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3855 arg
= stabilize_reference (arg
);
3856 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
3857 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
3858 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
3859 build_unary_op (code
, real
, 1), imag
);
3862 /* Report invalid types. */
3864 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
3867 if (code
== PREINCREMENT_EXPR
)
3868 errstring
="no pre-increment operator for type";
3869 else if (code
== POSTINCREMENT_EXPR
)
3870 errstring
="no post-increment operator for type";
3871 else if (code
== PREDECREMENT_EXPR
)
3872 errstring
="no pre-decrement operator for type";
3874 errstring
="no post-decrement operator for type";
3878 /* Report something read-only. */
3880 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
3881 || TREE_READONLY (arg
))
3882 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
3883 || code
== POSTINCREMENT_EXPR
)
3884 ? "increment" : "decrement"),
3889 tree result_type
= TREE_TYPE (arg
);
3891 arg
= get_unwidened (arg
, 0);
3892 argtype
= TREE_TYPE (arg
);
3894 /* ARM $5.2.5 last annotation says this should be forbidden. */
3895 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
3896 pedwarn ("ISO C++ forbids %sing an enum",
3897 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3898 ? "increment" : "decrement");
3900 /* Compute the increment. */
3902 if (TREE_CODE (argtype
) == POINTER_TYPE
)
3904 tree type
= complete_type (TREE_TYPE (argtype
));
3906 if (!COMPLETE_OR_VOID_TYPE_P (type
))
3907 error ("cannot %s a pointer to incomplete type %qT",
3908 ((code
== PREINCREMENT_EXPR
3909 || code
== POSTINCREMENT_EXPR
)
3910 ? "increment" : "decrement"), TREE_TYPE (argtype
));
3911 else if ((pedantic
|| warn_pointer_arith
)
3912 && !TYPE_PTROB_P (argtype
))
3913 pedwarn ("ISO C++ forbids %sing a pointer of type %qT",
3914 ((code
== PREINCREMENT_EXPR
3915 || code
== POSTINCREMENT_EXPR
)
3916 ? "increment" : "decrement"), argtype
);
3917 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
3920 inc
= integer_one_node
;
3922 inc
= cp_convert (argtype
, inc
);
3924 /* Handle incrementing a cast-expression. */
3926 switch (TREE_CODE (arg
))
3931 case FIX_TRUNC_EXPR
:
3932 case FIX_FLOOR_EXPR
:
3933 case FIX_ROUND_EXPR
:
3936 tree incremented
, modify
, value
, compound
;
3937 if (! lvalue_p (arg
) && pedantic
)
3938 pedwarn ("cast to non-reference type used as lvalue");
3939 arg
= stabilize_reference (arg
);
3940 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
3943 value
= save_expr (arg
);
3944 incremented
= build2 (((code
== PREINCREMENT_EXPR
3945 || code
== POSTINCREMENT_EXPR
)
3946 ? PLUS_EXPR
: MINUS_EXPR
),
3947 argtype
, value
, inc
);
3949 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
3950 compound
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
),
3953 /* Eliminate warning about unused result of + or -. */
3954 TREE_NO_WARNING (compound
) = 1;
3962 /* Complain about anything else that is not a true lvalue. */
3963 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
3964 || code
== POSTINCREMENT_EXPR
)
3965 ? lv_increment
: lv_decrement
)))
3966 return error_mark_node
;
3968 /* Forbid using -- on `bool'. */
3969 if (TREE_TYPE (arg
) == boolean_type_node
)
3971 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
3973 error ("invalid use of %<--%> on bool variable %qD", arg
);
3974 return error_mark_node
;
3976 val
= boolean_increment (code
, arg
);
3979 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
3981 TREE_SIDE_EFFECTS (val
) = 1;
3982 return cp_convert (result_type
, val
);
3986 /* Note that this operation never does default_conversion
3987 regardless of NOCONVERT. */
3989 argtype
= lvalue_type (arg
);
3991 if (TREE_CODE (arg
) == OFFSET_REF
)
3994 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
3996 tree type
= build_pointer_type (TREE_TYPE (argtype
));
3997 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4000 else if (pedantic
&& DECL_MAIN_P (arg
))
4002 pedwarn ("ISO C++ forbids taking address of function %<::main%>");
4004 /* Let &* cancel out to simplify resulting code. */
4005 if (TREE_CODE (arg
) == INDIRECT_REF
)
4007 /* We don't need to have `current_class_ptr' wrapped in a
4008 NON_LVALUE_EXPR node. */
4009 if (arg
== current_class_ref
)
4010 return current_class_ptr
;
4012 arg
= TREE_OPERAND (arg
, 0);
4013 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4015 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4016 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4018 else if (lvalue_p (arg
))
4019 /* Don't let this be an lvalue. */
4020 return non_lvalue (arg
);
4024 /* Uninstantiated types are all functions. Taking the
4025 address of a function is a no-op, so just return the
4028 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4029 || !IDENTIFIER_OPNAME_P (arg
));
4031 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4032 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4034 /* They're trying to take the address of a unique non-static
4035 member function. This is ill-formed (except in MS-land),
4036 but let's try to DTRT.
4037 Note: We only handle unique functions here because we don't
4038 want to complain if there's a static overload; non-unique
4039 cases will be handled by instantiate_type. But we need to
4040 handle this case here to allow casts on the resulting PMF.
4041 We could defer this in non-MS mode, but it's easier to give
4042 a useful error here. */
4044 /* Inside constant member functions, the `this' pointer
4045 contains an extra const qualifier. TYPE_MAIN_VARIANT
4046 is used here to remove this const from the diagnostics
4047 and the created OFFSET_REF. */
4048 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4049 tree name
= DECL_NAME (get_first_fn (TREE_OPERAND (arg
, 1)));
4051 if (! flag_ms_extensions
)
4053 if (current_class_type
4054 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4055 /* An expression like &memfn. */
4056 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4057 " or parenthesized non-static member function to form"
4058 " a pointer to member function. Say %<&%T::%D%>",
4061 pedwarn ("ISO C++ forbids taking the address of a bound member"
4062 " function to form a pointer to member function."
4066 arg
= build_offset_ref (base
, name
, /*address_p=*/true);
4070 if (type_unknown_p (arg
))
4071 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4073 /* Handle complex lvalues (when permitted)
4074 by reduction to simpler cases. */
4075 val
= unary_complex_lvalue (code
, arg
);
4079 switch (TREE_CODE (arg
))
4084 case FIX_TRUNC_EXPR
:
4085 case FIX_FLOOR_EXPR
:
4086 case FIX_ROUND_EXPR
:
4088 if (! lvalue_p (arg
) && pedantic
)
4089 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4093 arg
= OVL_CURRENT (arg
);
4097 /* Turn a reference to a non-static data member into a
4098 pointer-to-member. */
4103 if (!PTRMEM_OK_P (arg
))
4104 return build_unary_op (code
, arg
, 0);
4106 t
= TREE_OPERAND (arg
, 1);
4107 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4109 error ("cannot create pointer to reference member %qD", t
);
4110 return error_mark_node
;
4113 type
= build_ptrmem_type (context_for_name_lookup (t
),
4115 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4123 /* Allow the address of a constructor if all the elements
4125 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (arg
)
4126 && TREE_CONSTANT (arg
))
4128 /* Anything not already handled and not a true memory reference
4130 else if (TREE_CODE (argtype
) != FUNCTION_TYPE
4131 && TREE_CODE (argtype
) != METHOD_TYPE
4132 && TREE_CODE (arg
) != OFFSET_REF
4133 && !lvalue_or_else (arg
, lv_addressof
))
4134 return error_mark_node
;
4136 if (argtype
!= error_mark_node
)
4137 argtype
= build_pointer_type (argtype
);
4142 if (TREE_CODE (arg
) != COMPONENT_REF
4143 /* Inside a template, we are processing a non-dependent
4144 expression so we can just form an ADDR_EXPR with the
4146 || processing_template_decl
)
4148 addr
= build_address (arg
);
4149 if (TREE_CODE (arg
) == OFFSET_REF
)
4150 PTRMEM_OK_P (addr
) = PTRMEM_OK_P (arg
);
4152 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4154 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4156 /* We can only get here with a single static member
4158 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4159 && DECL_STATIC_FUNCTION_P (fn
));
4161 addr
= build_address (fn
);
4162 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4163 /* Do not lose object's side effects. */
4164 addr
= build2 (COMPOUND_EXPR
, TREE_TYPE (addr
),
4165 TREE_OPERAND (arg
, 0), addr
);
4167 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4169 error ("attempt to take address of bit-field structure member %qD",
4170 TREE_OPERAND (arg
, 1));
4171 return error_mark_node
;
4175 tree object
= TREE_OPERAND (arg
, 0);
4176 tree field
= TREE_OPERAND (arg
, 1);
4177 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4178 (TREE_TYPE (object
), decl_type_context (field
)));
4179 addr
= build_address (arg
);
4182 if (TREE_CODE (argtype
) == POINTER_TYPE
4183 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4185 build_ptrmemfunc_type (argtype
);
4186 addr
= build_ptrmemfunc (argtype
, addr
, 0,
4187 /*c_cast_p=*/false);
4200 argtype
= TREE_TYPE (arg
);
4201 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
4204 error ("%s", errstring
);
4205 return error_mark_node
;
4208 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4209 for certain kinds of expressions which are not really lvalues
4210 but which we can accept as lvalues.
4212 If ARG is not a kind of expression we can handle, return
4216 unary_complex_lvalue (enum tree_code code
, tree arg
)
4218 /* Inside a template, making these kinds of adjustments is
4219 pointless; we are only concerned with the type of the
4221 if (processing_template_decl
)
4224 /* Handle (a, b) used as an "lvalue". */
4225 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4227 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4228 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4229 TREE_OPERAND (arg
, 0), real_result
);
4232 /* Handle (a ? b : c) used as an "lvalue". */
4233 if (TREE_CODE (arg
) == COND_EXPR
4234 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4235 return rationalize_conditional_expr (code
, arg
);
4237 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4238 if (TREE_CODE (arg
) == MODIFY_EXPR
4239 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4240 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4242 tree lvalue
= TREE_OPERAND (arg
, 0);
4243 if (TREE_SIDE_EFFECTS (lvalue
))
4245 lvalue
= stabilize_reference (lvalue
);
4246 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
4247 lvalue
, TREE_OPERAND (arg
, 1));
4249 return unary_complex_lvalue
4250 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
4253 if (code
!= ADDR_EXPR
)
4256 /* Handle (a = b) used as an "lvalue" for `&'. */
4257 if (TREE_CODE (arg
) == MODIFY_EXPR
4258 || TREE_CODE (arg
) == INIT_EXPR
)
4260 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4261 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4263 TREE_NO_WARNING (arg
) = 1;
4267 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4268 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4269 || TREE_CODE (arg
) == OFFSET_REF
)
4272 /* We permit compiler to make function calls returning
4273 objects of aggregate type look like lvalues. */
4277 if (TREE_CODE (targ
) == SAVE_EXPR
)
4278 targ
= TREE_OPERAND (targ
, 0);
4280 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4282 if (TREE_CODE (arg
) == SAVE_EXPR
)
4285 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4286 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4289 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4290 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4291 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4294 /* Don't let anything else be handled specially. */
4298 /* Mark EXP saying that we need to be able to take the
4299 address of it; it should not be allocated in a register.
4300 Value is true if successful.
4302 C++: we do not allow `current_class_ptr' to be addressable. */
4305 cxx_mark_addressable (tree exp
)
4310 switch (TREE_CODE (x
))
4317 x
= TREE_OPERAND (x
, 0);
4321 if (x
== current_class_ptr
)
4323 error ("cannot take the address of %<this%>, which is an rvalue expression");
4324 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
4330 /* Caller should not be trying to mark initialized
4331 constant fields addressable. */
4332 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
4333 || DECL_IN_AGGR_P (x
) == 0
4335 || DECL_EXTERNAL (x
));
4340 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4341 && !DECL_ARTIFICIAL (x
))
4343 if (DECL_HARD_REGISTER (x
) != 0)
4346 ("address of explicit register variable %qD requested", x
);
4349 else if (extra_warnings
)
4351 (0, "address requested for %qD, which is declared %<register%>", x
);
4353 TREE_ADDRESSABLE (x
) = 1;
4357 TREE_ADDRESSABLE (x
) = 1;
4361 TREE_ADDRESSABLE (x
) = 1;
4365 TREE_ADDRESSABLE (x
) = 1;
4366 cxx_mark_addressable (TREE_OPERAND (x
, 0));
4374 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4377 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
)
4379 tree orig_ifexp
= ifexp
;
4380 tree orig_op1
= op1
;
4381 tree orig_op2
= op2
;
4384 if (processing_template_decl
)
4386 /* The standard says that the expression is type-dependent if
4387 IFEXP is type-dependent, even though the eventual type of the
4388 expression doesn't dependent on IFEXP. */
4389 if (type_dependent_expression_p (ifexp
)
4390 /* As a GNU extension, the middle operand may be omitted. */
4391 || (op1
&& type_dependent_expression_p (op1
))
4392 || type_dependent_expression_p (op2
))
4393 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4394 ifexp
= build_non_dependent_expr (ifexp
);
4396 op1
= build_non_dependent_expr (op1
);
4397 op2
= build_non_dependent_expr (op2
);
4400 expr
= build_conditional_expr (ifexp
, op1
, op2
);
4401 if (processing_template_decl
&& expr
!= error_mark_node
)
4402 return build_min_non_dep (COND_EXPR
, expr
,
4403 orig_ifexp
, orig_op1
, orig_op2
);
4407 /* Given a list of expressions, return a compound expression
4408 that performs them all and returns the value of the last of them. */
4410 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
4412 tree expr
= TREE_VALUE (list
);
4414 if (TREE_CHAIN (list
))
4417 pedwarn ("%s expression list treated as compound expression", msg
);
4419 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
4420 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
));
4426 /* Handle overloading of the ',' operator when needed. */
4429 build_x_compound_expr (tree op1
, tree op2
)
4432 tree orig_op1
= op1
;
4433 tree orig_op2
= op2
;
4435 if (processing_template_decl
)
4437 if (type_dependent_expression_p (op1
)
4438 || type_dependent_expression_p (op2
))
4439 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
4440 op1
= build_non_dependent_expr (op1
);
4441 op2
= build_non_dependent_expr (op2
);
4444 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
4445 /*overloaded_p=*/NULL
);
4447 result
= build_compound_expr (op1
, op2
);
4449 if (processing_template_decl
&& result
!= error_mark_node
)
4450 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
4455 /* Build a compound expression. */
4458 build_compound_expr (tree lhs
, tree rhs
)
4460 lhs
= convert_to_void (lhs
, "left-hand operand of comma");
4462 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
4463 return error_mark_node
;
4465 if (TREE_CODE (rhs
) == TARGET_EXPR
)
4467 /* If the rhs is a TARGET_EXPR, then build the compound
4468 expression inside the target_expr's initializer. This
4469 helps the compiler to eliminate unnecessary temporaries. */
4470 tree init
= TREE_OPERAND (rhs
, 1);
4472 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
4473 TREE_OPERAND (rhs
, 1) = init
;
4478 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
4481 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
4482 casts away constness. DIAG_FN gives the function to call if we
4483 need to issue a diagnostic; if it is NULL, no diagnostic will be
4484 issued. DESCRIPTION explains what operation is taking place. */
4487 check_for_casting_away_constness (tree src_type
, tree dest_type
,
4488 void (*diag_fn
)(const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2),
4489 const char *description
)
4491 if (diag_fn
&& casts_away_constness (src_type
, dest_type
))
4492 error ("%s from type %qT to type %qT casts away constness",
4493 description
, src_type
, dest_type
);
4496 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
4497 (another pointer-to-member type in the same hierarchy) and return
4498 the converted expression. If ALLOW_INVERSE_P is permitted, a
4499 pointer-to-derived may be converted to pointer-to-base; otherwise,
4500 only the other direction is permitted. If C_CAST_P is true, this
4501 conversion is taking place as part of a C-style cast. */
4504 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
4507 if (TYPE_PTRMEM_P (type
))
4511 if (TREE_CODE (expr
) == PTRMEM_CST
)
4512 expr
= cplus_expand_constant (expr
);
4513 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
4514 TYPE_PTRMEM_CLASS_TYPE (type
),
4517 if (!integer_zerop (delta
))
4518 expr
= cp_build_binary_op (PLUS_EXPR
,
4519 build_nop (ptrdiff_type_node
, expr
),
4521 return build_nop (type
, expr
);
4524 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
4525 allow_inverse_p
, c_cast_p
);
4528 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
4529 this static_cast is being attempted as one of the possible casts
4530 allowed by a C-style cast. (In that case, accessibility of base
4531 classes is not considered, and it is OK to cast away
4532 constness.) Return the result of the cast. *VALID_P is set to
4533 indicate whether or not the cast was valid. */
4536 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
4542 void (*diag_fn
)(const char*, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
4545 /* Assume the cast is valid. */
4548 intype
= TREE_TYPE (expr
);
4550 /* Determine what to do when casting away constness. */
4553 /* C-style casts are allowed to cast away constness. With
4554 WARN_CAST_QUAL, we still want to issue a warning. */
4555 diag_fn
= warn_cast_qual
? warning0
: NULL
;
4560 /* A static_cast may not cast away constness. */
4562 desc
= "static_cast";
4565 /* [expr.static.cast]
4567 An lvalue of type "cv1 B", where B is a class type, can be cast
4568 to type "reference to cv2 D", where D is a class derived (clause
4569 _class.derived_) from B, if a valid standard conversion from
4570 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
4571 same cv-qualification as, or greater cv-qualification than, cv1,
4572 and B is not a virtual base class of D. */
4573 /* We check this case before checking the validity of "TYPE t =
4574 EXPR;" below because for this case:
4577 struct D : public B { D(const B&); };
4579 void f() { static_cast<const D&>(b); }
4581 we want to avoid constructing a new D. The standard is not
4582 completely clear about this issue, but our interpretation is
4583 consistent with other compilers. */
4584 if (TREE_CODE (type
) == REFERENCE_TYPE
4585 && CLASS_TYPE_P (TREE_TYPE (type
))
4586 && CLASS_TYPE_P (intype
)
4587 && real_lvalue_p (expr
)
4588 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
4589 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
4590 build_pointer_type (TYPE_MAIN_VARIANT
4591 (TREE_TYPE (type
))))
4593 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
4597 /* There is a standard conversion from "D*" to "B*" even if "B"
4598 is ambiguous or inaccessible. If this is really a
4599 static_cast, then we check both for inaccessibility and
4600 ambiguity. However, if this is a static_cast being performed
4601 because the user wrote a C-style cast, then accessibility is
4603 base
= lookup_base (TREE_TYPE (type
), intype
,
4604 c_cast_p
? ba_unique
: ba_check
,
4607 /* Convert from "B*" to "D*". This function will check that "B"
4608 is not a virtual base of "D". */
4609 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
4610 base
, /*nonnull=*/false);
4611 /* Convert the pointer to a reference -- but then remember that
4612 there are no expressions with reference type in C++. */
4613 return convert_from_reference (build_nop (type
, expr
));
4618 /* [expr.static.cast]
4620 An expression e can be explicitly converted to a type T using a
4621 static_cast of the form static_cast<T>(e) if the declaration T
4622 t(e);" is well-formed, for some invented temporary variable
4624 result
= perform_direct_initialization_if_possible (type
, expr
,
4628 result
= convert_from_reference (result
);
4630 /* Ignore any integer overflow caused by the cast. */
4631 if (TREE_CODE (result
) == INTEGER_CST
4632 && CONSTANT_CLASS_P (orig
))
4634 TREE_OVERFLOW (result
) = TREE_OVERFLOW (orig
);
4635 TREE_CONSTANT_OVERFLOW (result
)
4636 = TREE_CONSTANT_OVERFLOW (orig
);
4638 /* [expr.static.cast]
4640 If T is a reference type, the result is an lvalue; otherwise,
4641 the result is an rvalue. */
4642 if (TREE_CODE (type
) != REFERENCE_TYPE
4643 && real_lvalue_p (result
))
4644 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
4648 /* [expr.static.cast]
4650 Any expression can be explicitly converted to type cv void. */
4651 if (TREE_CODE (type
) == VOID_TYPE
)
4652 return convert_to_void (expr
, /*implicit=*/NULL
);
4654 /* [expr.static.cast]
4656 The inverse of any standard conversion sequence (clause _conv_),
4657 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
4658 (_conv.array_), function-to-pointer (_conv.func_), and boolean
4659 (_conv.bool_) conversions, can be performed explicitly using
4660 static_cast subject to the restriction that the explicit
4661 conversion does not cast away constness (_expr.const.cast_), and
4662 the following additional rules for specific cases: */
4663 /* For reference, the conversions not excluded are: integral
4664 promotions, floating point promotion, integral conversions,
4665 floating point conversions, floating-integral conversions,
4666 pointer conversions, and pointer to member conversions. */
4669 A value of integral _or enumeration_ type can be explicitly
4670 converted to an enumeration type. */
4671 /* The effect of all that is that any conversion between any two
4672 types which are integral, floating, or enumeration types can be
4674 if ((INTEGRAL_TYPE_P (type
) || SCALAR_FLOAT_TYPE_P (type
))
4675 && (INTEGRAL_TYPE_P (intype
) || SCALAR_FLOAT_TYPE_P (intype
)))
4677 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
4679 /* Ignore any integer overflow caused by the cast. */
4680 if (TREE_CODE (expr
) == INTEGER_CST
4681 && CONSTANT_CLASS_P (orig
))
4683 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
4684 TREE_CONSTANT_OVERFLOW (expr
) = TREE_CONSTANT_OVERFLOW (orig
);
4689 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
4690 && CLASS_TYPE_P (TREE_TYPE (type
))
4691 && CLASS_TYPE_P (TREE_TYPE (intype
))
4692 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
4693 (TREE_TYPE (intype
))),
4694 build_pointer_type (TYPE_MAIN_VARIANT
4695 (TREE_TYPE (type
)))))
4700 check_for_casting_away_constness (intype
, type
, diag_fn
, desc
);
4701 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
4702 c_cast_p
? ba_unique
: ba_check
,
4704 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
4707 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4708 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
4715 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
4716 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
4718 if (TYPE_PTRMEM_P (type
))
4720 t1
= (build_ptrmem_type
4722 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
4723 t2
= (build_ptrmem_type
4725 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
4732 if (can_convert (t1
, t2
))
4735 check_for_casting_away_constness (intype
, type
, diag_fn
,
4737 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
4742 /* [expr.static.cast]
4744 An rvalue of type "pointer to cv void" can be explicitly
4745 converted to a pointer to object type. A value of type pointer
4746 to object converted to "pointer to cv void" and back to the
4747 original pointer type will have its original value. */
4748 if (TREE_CODE (intype
) == POINTER_TYPE
4749 && VOID_TYPE_P (TREE_TYPE (intype
))
4750 && TYPE_PTROB_P (type
))
4753 check_for_casting_away_constness (intype
, type
, diag_fn
, desc
);
4754 return build_nop (type
, expr
);
4758 return error_mark_node
;
4761 /* Return an expression representing static_cast<TYPE>(EXPR). */
4764 build_static_cast (tree type
, tree expr
)
4769 if (type
== error_mark_node
|| expr
== error_mark_node
)
4770 return error_mark_node
;
4772 if (processing_template_decl
)
4774 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
4775 /* We don't know if it will or will not have side effects. */
4776 TREE_SIDE_EFFECTS (expr
) = 1;
4777 return convert_from_reference (expr
);
4780 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4781 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4782 if (TREE_CODE (type
) != REFERENCE_TYPE
4783 && TREE_CODE (expr
) == NOP_EXPR
4784 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4785 expr
= TREE_OPERAND (expr
, 0);
4787 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
);
4791 error ("invalid static_cast from type %qT to type %qT",
4792 TREE_TYPE (expr
), type
);
4793 return error_mark_node
;
4796 /* EXPR is an expression with member function or pointer-to-member
4797 function type. TYPE is a pointer type. Converting EXPR to TYPE is
4798 not permitted by ISO C++, but we accept it in some modes. If we
4799 are not in one of those modes, issue a diagnostic. Return the
4800 converted expression. */
4803 convert_member_func_to_ptr (tree type
, tree expr
)
4808 intype
= TREE_TYPE (expr
);
4809 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
4810 || TREE_CODE (intype
) == METHOD_TYPE
);
4812 if (pedantic
|| warn_pmf2ptr
)
4813 pedwarn ("converting from %qT to %qT", intype
, type
);
4815 if (TREE_CODE (intype
) == METHOD_TYPE
)
4816 expr
= build_addr_func (expr
);
4817 else if (TREE_CODE (expr
) == PTRMEM_CST
)
4818 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
4821 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
4822 decl
= build_address (decl
);
4823 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
4826 return build_nop (type
, expr
);
4829 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
4830 If C_CAST_P is true, this reinterpret cast is being done as part of
4831 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
4832 indicate whether or not reinterpret_cast was valid. */
4835 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
4840 /* Assume the cast is invalid. */
4844 if (type
== error_mark_node
|| error_operand_p (expr
))
4845 return error_mark_node
;
4847 intype
= TREE_TYPE (expr
);
4849 /* [expr.reinterpret.cast]
4850 An lvalue expression of type T1 can be cast to the type
4851 "reference to T2" if an expression of type "pointer to T1" can be
4852 explicitly converted to the type "pointer to T2" using a
4853 reinterpret_cast. */
4854 if (TREE_CODE (type
) == REFERENCE_TYPE
)
4856 if (! real_lvalue_p (expr
))
4858 error ("invalid cast of an rvalue expression of type "
4861 return error_mark_node
;
4864 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
4865 "B" are related class types; the reinterpret_cast does not
4866 adjust the pointer. */
4867 if (TYPE_PTR_P (intype
)
4868 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
4869 COMPARE_BASE
| COMPARE_DERIVED
)))
4870 warning (0, "casting %qT to %qT does not dereference pointer",
4873 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
4874 if (expr
!= error_mark_node
)
4875 expr
= build_reinterpret_cast_1
4876 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
4878 if (expr
!= error_mark_node
)
4879 expr
= build_indirect_ref (expr
, 0);
4883 /* As a G++ extension, we consider conversions from member
4884 functions, and pointers to member functions to
4885 pointer-to-function and pointer-to-void types. If
4886 -Wno-pmf-conversions has not been specified,
4887 convert_member_func_to_ptr will issue an error message. */
4888 if ((TYPE_PTRMEMFUNC_P (intype
)
4889 || TREE_CODE (intype
) == METHOD_TYPE
)
4890 && TYPE_PTR_P (type
)
4891 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
4892 || VOID_TYPE_P (TREE_TYPE (type
))))
4893 return convert_member_func_to_ptr (type
, expr
);
4895 /* If the cast is not to a reference type, the lvalue-to-rvalue,
4896 array-to-pointer, and function-to-pointer conversions are
4898 expr
= decay_conversion (expr
);
4900 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4901 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4902 if (TREE_CODE (expr
) == NOP_EXPR
4903 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4904 expr
= TREE_OPERAND (expr
, 0);
4906 if (error_operand_p (expr
))
4907 return error_mark_node
;
4909 intype
= TREE_TYPE (expr
);
4911 /* [expr.reinterpret.cast]
4912 A pointer can be converted to any integral type large enough to
4914 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
4916 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
4917 pedwarn ("cast from %qT to %qT loses precision",
4920 /* [expr.reinterpret.cast]
4921 A value of integral or enumeration type can be explicitly
4922 converted to a pointer. */
4923 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
4926 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
4927 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
4928 return fold_if_not_in_template (build_nop (type
, expr
));
4929 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4930 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
4933 check_for_casting_away_constness (intype
, type
, error
,
4934 "reinterpret_cast");
4935 /* Warn about possible alignment problems. */
4936 if (STRICT_ALIGNMENT
&& warn_cast_align
4937 && !VOID_TYPE_P (type
)
4938 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
4939 && COMPLETE_TYPE_P (TREE_TYPE (type
))
4940 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
4941 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
4942 warning (0, "cast from %qT to %qT increases required alignment of "
4946 return fold_if_not_in_template (build_nop (type
, expr
));
4948 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
4949 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
4952 /* Only issue a warning, as we have always supported this
4953 where possible, and it is necessary in some cases. DR 195
4954 addresses this issue, but as of 2004/10/26 is still in
4956 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
4957 return fold_if_not_in_template (build_nop (type
, expr
));
4959 else if (TREE_CODE (type
) == VECTOR_TYPE
)
4960 return fold_if_not_in_template (convert_to_vector (type
, expr
));
4961 else if (TREE_CODE (intype
) == VECTOR_TYPE
)
4962 return fold_if_not_in_template (convert_to_integer (type
, expr
));
4967 error ("invalid cast from type %qT to type %qT", intype
, type
);
4968 return error_mark_node
;
4971 return cp_convert (type
, expr
);
4975 build_reinterpret_cast (tree type
, tree expr
)
4977 if (type
== error_mark_node
|| expr
== error_mark_node
)
4978 return error_mark_node
;
4980 if (processing_template_decl
)
4982 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
4984 if (!TREE_SIDE_EFFECTS (t
)
4985 && type_dependent_expression_p (expr
))
4986 /* There might turn out to be side effects inside expr. */
4987 TREE_SIDE_EFFECTS (t
) = 1;
4988 return convert_from_reference (t
);
4991 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
4995 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
4996 return an appropriate expression. Otherwise, return
4997 error_mark_node. If the cast is not valid, and COMPLAIN is true,
4998 then a diagnostic will be issued. If VALID_P is non-NULL, its
4999 value upon return will indicate whether or not the conversion
5003 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
5007 tree reference_type
;
5009 /* Callers are responsible for handling error_mark_node as a
5010 destination type. */
5011 gcc_assert (dst_type
!= error_mark_node
);
5012 /* In a template, callers should be building syntactic
5013 representations of casts, not using this machinery. */
5014 gcc_assert (!processing_template_decl
);
5016 /* Assume the conversion is invalid. */
5020 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
5023 error ("invalid use of const_cast with type %qT, "
5024 "which is not a pointer, "
5025 "reference, nor a pointer-to-data-member type", dst_type
);
5026 return error_mark_node
;
5029 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
5032 error ("invalid use of const_cast with type %qT, which is a pointer "
5033 "or reference to a function type", dst_type
);
5034 return error_mark_node
;
5037 src_type
= TREE_TYPE (expr
);
5038 /* Expressions do not really have reference types. */
5039 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
5040 src_type
= TREE_TYPE (src_type
);
5042 /* [expr.const.cast]
5044 An lvalue of type T1 can be explicitly converted to an lvalue of
5045 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5046 types) if a pointer to T1 can be explicitly converted to the type
5047 pointer to T2 using a const_cast. */
5048 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
5050 reference_type
= dst_type
;
5051 if (! real_lvalue_p (expr
))
5054 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5055 src_type
, dst_type
);
5056 return error_mark_node
;
5058 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
5059 src_type
= build_pointer_type (src_type
);
5063 reference_type
= NULL_TREE
;
5064 /* If the destination type is not a reference type, the
5065 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5066 conversions are performed. */
5067 src_type
= type_decays_to (src_type
);
5068 if (src_type
== error_mark_node
)
5069 return error_mark_node
;
5072 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
5073 && comp_ptr_ttypes_const (dst_type
, src_type
))
5079 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5080 expr
= build_nop (reference_type
, expr
);
5081 return convert_from_reference (expr
);
5085 expr
= decay_conversion (expr
);
5086 /* build_c_cast puts on a NOP_EXPR to make the result not an
5087 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5088 non-lvalue context. */
5089 if (TREE_CODE (expr
) == NOP_EXPR
5090 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5091 expr
= TREE_OPERAND (expr
, 0);
5092 return build_nop (dst_type
, expr
);
5097 error ("invalid const_cast from type %qT to type %qT",
5098 src_type
, dst_type
);
5099 return error_mark_node
;
5103 build_const_cast (tree type
, tree expr
)
5105 if (type
== error_mark_node
|| error_operand_p (expr
))
5106 return error_mark_node
;
5108 if (processing_template_decl
)
5110 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
5112 if (!TREE_SIDE_EFFECTS (t
)
5113 && type_dependent_expression_p (expr
))
5114 /* There might turn out to be side effects inside expr. */
5115 TREE_SIDE_EFFECTS (t
) = 1;
5116 return convert_from_reference (t
);
5119 return build_const_cast_1 (type
, expr
, /*complain=*/true,
5123 /* Build an expression representing an explicit C-style cast to type
5124 TYPE of expression EXPR. */
5127 build_c_cast (tree type
, tree expr
)
5133 if (type
== error_mark_node
|| error_operand_p (expr
))
5134 return error_mark_node
;
5136 if (processing_template_decl
)
5138 tree t
= build_min (CAST_EXPR
, type
,
5139 tree_cons (NULL_TREE
, value
, NULL_TREE
));
5140 /* We don't know if it will or will not have side effects. */
5141 TREE_SIDE_EFFECTS (t
) = 1;
5142 return convert_from_reference (t
);
5145 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5146 'Class') should always be retained, because this information aids
5147 in method lookup. */
5148 if (objc_is_object_ptr (type
)
5149 && objc_is_object_ptr (TREE_TYPE (expr
)))
5150 return build_nop (type
, expr
);
5152 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5153 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5154 if (TREE_CODE (type
) != REFERENCE_TYPE
5155 && TREE_CODE (value
) == NOP_EXPR
5156 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5157 value
= TREE_OPERAND (value
, 0);
5159 if (TREE_CODE (type
) == ARRAY_TYPE
)
5161 /* Allow casting from T1* to T2[] because Cfront allows it.
5162 NIHCL uses it. It is not valid ISO C++ however. */
5163 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5165 pedwarn ("ISO C++ forbids casting to an array type %qT", type
);
5166 type
= build_pointer_type (TREE_TYPE (type
));
5170 error ("ISO C++ forbids casting to an array type %qT", type
);
5171 return error_mark_node
;
5175 if (TREE_CODE (type
) == FUNCTION_TYPE
5176 || TREE_CODE (type
) == METHOD_TYPE
)
5178 error ("invalid cast to function type %qT", type
);
5179 return error_mark_node
;
5182 /* A C-style cast can be a const_cast. */
5183 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
5188 /* Or a static cast. */
5189 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
5191 /* Or a reinterpret_cast. */
5193 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
5195 /* The static_cast or reinterpret_cast may be followed by a
5198 /* A valid cast may result in errors if, for example, a
5199 conversion to am ambiguous base class is required. */
5200 && !error_operand_p (result
))
5204 /* Non-class rvalues always have cv-unqualified type. */
5205 if (!CLASS_TYPE_P (type
))
5206 type
= TYPE_MAIN_VARIANT (type
);
5207 result_type
= TREE_TYPE (result
);
5208 if (!CLASS_TYPE_P (result_type
))
5209 result_type
= TYPE_MAIN_VARIANT (result_type
);
5210 /* If the type of RESULT does not match TYPE, perform a
5211 const_cast to make it match. If the static_cast or
5212 reinterpret_cast succeeded, we will differ by at most
5213 cv-qualification, so the follow-on const_cast is guaranteed
5215 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
5217 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
5218 gcc_assert (valid_p
);
5223 return error_mark_node
;
5226 /* Build an assignment expression of lvalue LHS from value RHS.
5227 MODIFYCODE is the code for a binary operator that we use
5228 to combine the old value of LHS with RHS to get the new value.
5229 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5231 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5234 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5238 tree lhstype
= TREE_TYPE (lhs
);
5239 tree olhstype
= lhstype
;
5240 tree olhs
= NULL_TREE
;
5241 bool plain_assign
= (modifycode
== NOP_EXPR
);
5243 /* Avoid duplicate error messages from operands that had errors. */
5244 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5245 return error_mark_node
;
5247 /* Handle control structure constructs used as "lvalues". */
5248 switch (TREE_CODE (lhs
))
5250 /* Handle --foo = 5; as these are valid constructs in C++. */
5251 case PREDECREMENT_EXPR
:
5252 case PREINCREMENT_EXPR
:
5253 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5254 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5255 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5256 TREE_OPERAND (lhs
, 1));
5257 return build2 (COMPOUND_EXPR
, lhstype
,
5259 build_modify_expr (TREE_OPERAND (lhs
, 0),
5262 /* Handle (a, b) used as an "lvalue". */
5264 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5266 if (newrhs
== error_mark_node
)
5267 return error_mark_node
;
5268 return build2 (COMPOUND_EXPR
, lhstype
,
5269 TREE_OPERAND (lhs
, 0), newrhs
);
5272 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5273 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5274 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5275 TREE_OPERAND (lhs
, 1));
5276 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5277 if (newrhs
== error_mark_node
)
5278 return error_mark_node
;
5279 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5283 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5284 when neither operand has side-effects. */
5285 if (!lvalue_or_else (lhs
, lv_assign
))
5286 return error_mark_node
;
5288 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
5289 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
5291 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
5292 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
5294 TREE_OPERAND (lhs
, 0),
5295 TREE_OPERAND (lhs
, 1)),
5296 TREE_OPERAND (lhs
, 0),
5297 TREE_OPERAND (lhs
, 1));
5300 /* Handle (a ? b : c) used as an "lvalue". */
5303 /* Produce (a ? (b = rhs) : (c = rhs))
5304 except that the RHS goes through a save-expr
5305 so the code to compute it is only emitted once. */
5307 tree preeval
= NULL_TREE
;
5309 rhs
= stabilize_expr (rhs
, &preeval
);
5311 /* Check this here to avoid odd errors when trying to convert
5312 a throw to the type of the COND_EXPR. */
5313 if (!lvalue_or_else (lhs
, lv_assign
))
5314 return error_mark_node
;
5316 cond
= build_conditional_expr
5317 (TREE_OPERAND (lhs
, 0),
5318 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5319 TREE_OPERAND (lhs
, 1)),
5321 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5322 TREE_OPERAND (lhs
, 2)),
5325 if (cond
== error_mark_node
)
5327 /* Make sure the code to compute the rhs comes out
5328 before the split. */
5330 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
5338 if (modifycode
== INIT_EXPR
)
5340 if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5342 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
5343 /* Call convert to generate an error; see PR 11063. */
5344 rhs
= convert (lhstype
, rhs
);
5345 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
5346 TREE_SIDE_EFFECTS (result
) = 1;
5349 else if (! IS_AGGR_TYPE (lhstype
))
5350 /* Do the default thing. */;
5353 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
5354 build_tree_list (NULL_TREE
, rhs
),
5355 lhstype
, LOOKUP_NORMAL
);
5356 if (result
== NULL_TREE
)
5357 return error_mark_node
;
5363 lhs
= require_complete_type (lhs
);
5364 if (lhs
== error_mark_node
)
5365 return error_mark_node
;
5367 if (modifycode
== NOP_EXPR
)
5369 /* `operator=' is not an inheritable operator. */
5370 if (! IS_AGGR_TYPE (lhstype
))
5371 /* Do the default thing. */;
5374 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
5375 lhs
, rhs
, make_node (NOP_EXPR
),
5376 /*overloaded_p=*/NULL
);
5377 if (result
== NULL_TREE
)
5378 return error_mark_node
;
5385 /* A binary op has been requested. Combine the old LHS
5386 value with the RHS producing the value we should actually
5387 store into the LHS. */
5389 gcc_assert (!PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
));
5390 lhs
= stabilize_reference (lhs
);
5391 newrhs
= cp_build_binary_op (modifycode
, lhs
, rhs
);
5392 if (newrhs
== error_mark_node
)
5394 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
5395 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5396 return error_mark_node
;
5399 /* Now it looks like a plain assignment. */
5400 modifycode
= NOP_EXPR
;
5402 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
5403 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
5406 /* The left-hand side must be an lvalue. */
5407 if (!lvalue_or_else (lhs
, lv_assign
))
5408 return error_mark_node
;
5410 /* Warn about modifying something that is `const'. Don't warn if
5411 this is initialization. */
5412 if (modifycode
!= INIT_EXPR
5413 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
5414 /* Functions are not modifiable, even though they are
5416 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
5417 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
5418 /* If it's an aggregate and any field is const, then it is
5419 effectively const. */
5420 || (CLASS_TYPE_P (lhstype
)
5421 && C_TYPE_FIELDS_READONLY (lhstype
))))
5422 readonly_error (lhs
, "assignment", 0);
5424 /* If storing into a structure or union member, it has probably been
5425 given type `int'. Compute the type that would go with the actual
5426 amount of storage the member occupies. */
5428 if (TREE_CODE (lhs
) == COMPONENT_REF
5429 && (TREE_CODE (lhstype
) == INTEGER_TYPE
5430 || TREE_CODE (lhstype
) == REAL_TYPE
5431 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
5433 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
5435 /* If storing in a field that is in actuality a short or narrower
5436 than one, we must store in the field in its actual type. */
5438 if (lhstype
!= TREE_TYPE (lhs
))
5440 /* Avoid warnings converting integral types back into enums for
5442 if (TREE_CODE (lhstype
) == INTEGER_TYPE
5443 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
5445 if (TREE_SIDE_EFFECTS (lhs
))
5446 lhs
= stabilize_reference (lhs
);
5449 lhs
= copy_node (lhs
);
5450 TREE_TYPE (lhs
) = lhstype
;
5454 /* Convert new value to destination type. */
5456 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
5460 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
5461 TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))))
5463 error ("incompatible types in assignment of %qT to %qT",
5464 TREE_TYPE (rhs
), lhstype
);
5465 return error_mark_node
;
5468 /* Allow array assignment in compiler-generated code. */
5469 if (! DECL_ARTIFICIAL (current_function_decl
))
5470 pedwarn ("ISO C++ forbids assignment of arrays");
5472 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5473 ? 1 + (modifycode
!= INIT_EXPR
): 0;
5474 return build_vec_init (lhs
, NULL_TREE
, newrhs
, from_array
);
5477 if (modifycode
== INIT_EXPR
)
5478 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
5479 "initialization", NULL_TREE
, 0);
5482 /* Avoid warnings on enum bit fields. */
5483 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
5484 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
5486 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
5488 newrhs
= convert_force (lhstype
, newrhs
, 0);
5491 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
5493 if (TREE_CODE (newrhs
) == CALL_EXPR
5494 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
5495 newrhs
= build_cplus_new (lhstype
, newrhs
);
5497 /* Can't initialize directly from a TARGET_EXPR, since that would
5498 cause the lhs to be constructed twice, and possibly result in
5499 accidental self-initialization. So we force the TARGET_EXPR to be
5500 expanded without a target. */
5501 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
5502 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
5503 TREE_OPERAND (newrhs
, 0));
5506 if (newrhs
== error_mark_node
)
5507 return error_mark_node
;
5509 if (c_dialect_objc () && flag_objc_gc
)
5511 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
5517 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
5518 lhstype
, lhs
, newrhs
);
5520 TREE_SIDE_EFFECTS (result
) = 1;
5522 TREE_NO_WARNING (result
) = 1;
5524 /* If we got the LHS in a different type for storing in,
5525 convert the result back to the nominal type of LHS
5526 so that the value we return always has the same type
5527 as the LHS argument. */
5529 if (olhstype
== TREE_TYPE (result
))
5533 result
= build2 (COMPOUND_EXPR
, olhstype
, result
, olhs
);
5534 TREE_NO_WARNING (result
) = 1;
5537 return convert_for_assignment (olhstype
, result
, "assignment",
5542 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5544 if (processing_template_decl
)
5545 return build_min_nt (MODOP_EXPR
, lhs
,
5546 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
5548 if (modifycode
!= NOP_EXPR
)
5550 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
5551 make_node (modifycode
),
5552 /*overloaded_p=*/NULL
);
5555 TREE_NO_WARNING (rval
) = 1;
5559 return build_modify_expr (lhs
, modifycode
, rhs
);
5563 /* Get difference in deltas for different pointer to member function
5564 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
5565 the conversion is invalid, the constant is zero. If
5566 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
5567 If C_CAST_P is true this conversion is taking place as part of a
5570 Note that the naming of FROM and TO is kind of backwards; the return
5571 value is what we add to a TO in order to get a FROM. They are named
5572 this way because we call this function to find out how to convert from
5573 a pointer to member of FROM to a pointer to member of TO. */
5576 get_delta_difference (tree from
, tree to
,
5577 bool allow_inverse_p
,
5584 /* Assume no conversion is required. */
5585 result
= integer_zero_node
;
5586 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
5587 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
5588 error (" in pointer to member function conversion");
5591 if (kind
!= bk_via_virtual
)
5592 result
= BINFO_OFFSET (binfo
);
5595 tree virt_binfo
= binfo_from_vbase (binfo
);
5597 /* This is a reinterpret cast, we choose to do nothing. */
5598 if (allow_inverse_p
)
5599 warning (0, "pointer to member cast via virtual base %qT",
5600 BINFO_TYPE (virt_binfo
));
5602 error ("pointer to member conversion via virtual base %qT",
5603 BINFO_TYPE (virt_binfo
));
5606 else if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
5607 /* Pointer to member of incomplete class is permitted*/;
5608 else if (!allow_inverse_p
)
5610 error_not_base_type (from
, to
);
5611 error (" in pointer to member conversion");
5615 binfo
= lookup_base (from
, to
, c_cast_p
? ba_unique
: ba_check
, &kind
);
5618 if (kind
!= bk_via_virtual
)
5619 result
= size_diffop (size_zero_node
, BINFO_OFFSET (binfo
));
5622 /* This is a reinterpret cast, we choose to do nothing. */
5623 tree virt_binfo
= binfo_from_vbase (binfo
);
5625 warning (0, "pointer to member cast via virtual base %qT",
5626 BINFO_TYPE (virt_binfo
));
5631 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
5635 /* Return a constructor for the pointer-to-member-function TYPE using
5636 the other components as specified. */
5639 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
5645 /* Pull the FIELD_DECLs out of the type. */
5646 pfn_field
= TYPE_FIELDS (type
);
5647 delta_field
= TREE_CHAIN (pfn_field
);
5649 /* Make sure DELTA has the type we want. */
5650 delta
= convert_and_check (delta_type_node
, delta
);
5652 /* Finish creating the initializer. */
5653 u
= tree_cons (pfn_field
, pfn
,
5654 build_tree_list (delta_field
, delta
));
5655 u
= build_constructor (type
, u
);
5656 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
5657 TREE_INVARIANT (u
) = TREE_INVARIANT (pfn
) & TREE_INVARIANT (delta
);
5658 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
5659 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
5661 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
5666 /* Build a constructor for a pointer to member function. It can be
5667 used to initialize global variables, local variable, or used
5668 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
5671 If FORCE is nonzero, then force this conversion, even if
5672 we would rather not do it. Usually set when using an explicit
5673 cast. A C-style cast is being processed iff C_CAST_P is true.
5675 Return error_mark_node, if something goes wrong. */
5678 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
5684 if (error_operand_p (pfn
))
5685 return error_mark_node
;
5687 pfn_type
= TREE_TYPE (pfn
);
5688 to_type
= build_ptrmemfunc_type (type
);
5690 /* Handle multiple conversions of pointer to member functions. */
5691 if (TYPE_PTRMEMFUNC_P (pfn_type
))
5693 tree delta
= NULL_TREE
;
5694 tree npfn
= NULL_TREE
;
5698 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
))
5699 error ("invalid conversion to type %qT from type %qT",
5702 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
5703 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
5707 /* We don't have to do any conversion to convert a
5708 pointer-to-member to its own type. But, we don't want to
5709 just return a PTRMEM_CST if there's an explicit cast; that
5710 cast should make the expression an invalid template argument. */
5711 if (TREE_CODE (pfn
) != PTRMEM_CST
)
5713 if (same_type_p (to_type
, pfn_type
))
5715 else if (integer_zerop (n
))
5716 return build_reinterpret_cast (to_type
, pfn
);
5719 if (TREE_SIDE_EFFECTS (pfn
))
5720 pfn
= save_expr (pfn
);
5722 /* Obtain the function pointer and the current DELTA. */
5723 if (TREE_CODE (pfn
) == PTRMEM_CST
)
5724 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
5727 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
5728 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
5731 /* Just adjust the DELTA field. */
5732 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5733 (TREE_TYPE (delta
), ptrdiff_type_node
));
5734 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
5735 n
= cp_build_binary_op (LSHIFT_EXPR
, n
, integer_one_node
);
5736 delta
= cp_build_binary_op (PLUS_EXPR
, delta
, n
);
5737 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
5740 /* Handle null pointer to member function conversions. */
5741 if (integer_zerop (pfn
))
5743 pfn
= build_c_cast (type
, integer_zero_node
);
5744 return build_ptrmemfunc1 (to_type
,
5749 if (type_unknown_p (pfn
))
5750 return instantiate_type (type
, pfn
, tf_error
| tf_warning
);
5752 fn
= TREE_OPERAND (pfn
, 0);
5753 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5754 /* In a template, we will have preserved the
5756 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
5757 return make_ptrmem_cst (to_type
, fn
);
5760 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
5763 ??? There is no consistency as to the types returned for the above
5764 values. Some code acts as if it were a sizetype and some as if it were
5765 integer_type_node. */
5768 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
5770 tree type
= TREE_TYPE (cst
);
5771 tree fn
= PTRMEM_CST_MEMBER (cst
);
5772 tree ptr_class
, fn_class
;
5774 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5776 /* The class that the function belongs to. */
5777 fn_class
= DECL_CONTEXT (fn
);
5779 /* The class that we're creating a pointer to member of. */
5780 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
5782 /* First, calculate the adjustment to the function's class. */
5783 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
5786 if (!DECL_VIRTUAL_P (fn
))
5787 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
5790 /* If we're dealing with a virtual function, we have to adjust 'this'
5791 again, to point to the base which provides the vtable entry for
5792 fn; the call will do the opposite adjustment. */
5793 tree orig_class
= DECL_CONTEXT (fn
);
5794 tree binfo
= binfo_or_else (orig_class
, fn_class
);
5795 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
5796 *delta
, BINFO_OFFSET (binfo
));
5797 *delta
= fold_if_not_in_template (*delta
);
5799 /* We set PFN to the vtable offset at which the function can be
5800 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
5801 case delta is shifted left, and then incremented). */
5802 *pfn
= DECL_VINDEX (fn
);
5803 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
5804 TYPE_SIZE_UNIT (vtable_entry_type
));
5805 *pfn
= fold_if_not_in_template (*pfn
);
5807 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
5809 case ptrmemfunc_vbit_in_pfn
:
5810 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
5812 *pfn
= fold_if_not_in_template (*pfn
);
5815 case ptrmemfunc_vbit_in_delta
:
5816 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
5817 *delta
, integer_one_node
);
5818 *delta
= fold_if_not_in_template (*delta
);
5819 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
5820 *delta
, integer_one_node
);
5821 *delta
= fold_if_not_in_template (*delta
);
5828 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
5829 *pfn
= fold_if_not_in_template (*pfn
);
5833 /* Return an expression for PFN from the pointer-to-member function
5837 pfn_from_ptrmemfunc (tree t
)
5839 if (TREE_CODE (t
) == PTRMEM_CST
)
5844 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
5849 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
5852 /* Convert value RHS to type TYPE as preparation for an assignment to
5853 an lvalue of type TYPE. ERRTYPE is a string to use in error
5854 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
5855 are doing the conversion in order to pass the PARMNUMth argument of
5859 convert_for_assignment (tree type
, tree rhs
,
5860 const char *errtype
, tree fndecl
, int parmnum
)
5863 enum tree_code coder
;
5865 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
5866 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
5867 rhs
= TREE_OPERAND (rhs
, 0);
5869 rhstype
= TREE_TYPE (rhs
);
5870 coder
= TREE_CODE (rhstype
);
5872 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
5873 && vector_types_convertible_p (type
, rhstype
))
5874 return convert (type
, rhs
);
5876 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
5877 return error_mark_node
;
5878 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
5879 return error_mark_node
;
5881 /* The RHS of an assignment cannot have void type. */
5882 if (coder
== VOID_TYPE
)
5884 error ("void value not ignored as it ought to be");
5885 return error_mark_node
;
5888 /* Simplify the RHS if possible. */
5889 if (TREE_CODE (rhs
) == CONST_DECL
)
5890 rhs
= DECL_INITIAL (rhs
);
5892 if (c_dialect_objc ())
5895 tree rname
= fndecl
;
5897 if (!strcmp (errtype
, "assignment"))
5899 else if (!strcmp (errtype
, "initialization"))
5903 tree selector
= objc_message_selector ();
5907 if (selector
&& parmno
> 1)
5914 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
5915 return convert (type
, rhs
);
5920 The expression is implicitly converted (clause _conv_) to the
5921 cv-unqualified type of the left operand.
5923 We allow bad conversions here because by the time we get to this point
5924 we are committed to doing the conversion. If we end up doing a bad
5925 conversion, convert_like will complain. */
5926 if (!can_convert_arg_bad (type
, rhstype
, rhs
))
5928 /* When -Wno-pmf-conversions is use, we just silently allow
5929 conversions from pointers-to-members to plain pointers. If
5930 the conversion doesn't work, cp_convert will complain. */
5932 && TYPE_PTR_P (type
)
5933 && TYPE_PTRMEMFUNC_P (rhstype
))
5934 rhs
= cp_convert (strip_top_quals (type
), rhs
);
5937 /* If the right-hand side has unknown type, then it is an
5938 overloaded function. Call instantiate_type to get error
5940 if (rhstype
== unknown_type_node
)
5941 instantiate_type (type
, rhs
, tf_error
| tf_warning
);
5943 error ("cannot convert %qT to %qT for argument %qP to %qD",
5944 rhstype
, type
, parmnum
, fndecl
);
5946 error ("cannot convert %qT to %qT in %s", rhstype
, type
, errtype
);
5947 return error_mark_node
;
5950 return perform_implicit_conversion (strip_top_quals (type
), rhs
);
5953 /* Convert RHS to be of type TYPE.
5954 If EXP is nonzero, it is the target of the initialization.
5955 ERRTYPE is a string to use in error messages.
5957 Two major differences between the behavior of
5958 `convert_for_assignment' and `convert_for_initialization'
5959 are that references are bashed in the former, while
5960 copied in the latter, and aggregates are assigned in
5961 the former (operator=) while initialized in the
5964 If using constructor make sure no conversion operator exists, if one does
5965 exist, an ambiguity exists.
5967 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
5970 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
5971 const char *errtype
, tree fndecl
, int parmnum
)
5973 enum tree_code codel
= TREE_CODE (type
);
5975 enum tree_code coder
;
5977 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5978 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
5979 if (TREE_CODE (rhs
) == NOP_EXPR
5980 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
5981 && codel
!= REFERENCE_TYPE
)
5982 rhs
= TREE_OPERAND (rhs
, 0);
5984 if (rhs
== error_mark_node
5985 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
5986 return error_mark_node
;
5988 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
5989 && TREE_CODE (type
) != ARRAY_TYPE
5990 && (TREE_CODE (type
) != REFERENCE_TYPE
5991 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
5992 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
5993 && (TREE_CODE (type
) != REFERENCE_TYPE
5994 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
5995 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
5996 rhs
= decay_conversion (rhs
);
5998 rhstype
= TREE_TYPE (rhs
);
5999 coder
= TREE_CODE (rhstype
);
6001 if (coder
== ERROR_MARK
)
6002 return error_mark_node
;
6004 /* We accept references to incomplete types, so we can
6005 return here before checking if RHS is of complete type. */
6007 if (codel
== REFERENCE_TYPE
)
6009 /* This should eventually happen in convert_arguments. */
6010 int savew
= 0, savee
= 0;
6013 savew
= warningcount
, savee
= errorcount
;
6014 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
6018 if (warningcount
> savew
)
6019 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
6020 else if (errorcount
> savee
)
6021 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
6027 exp
= require_complete_type (exp
);
6028 if (exp
== error_mark_node
)
6029 return error_mark_node
;
6031 rhstype
= non_reference (rhstype
);
6033 type
= complete_type (type
);
6035 if (IS_AGGR_TYPE (type
))
6036 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
6038 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
6041 /* If RETVAL is the address of, or a reference to, a local variable or
6042 temporary give an appropriate warning. */
6045 maybe_warn_about_returning_address_of_local (tree retval
)
6047 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6048 tree whats_returned
= retval
;
6052 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
6053 whats_returned
= TREE_OPERAND (whats_returned
, 1);
6054 else if (TREE_CODE (whats_returned
) == CONVERT_EXPR
6055 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
6056 || TREE_CODE (whats_returned
) == NOP_EXPR
)
6057 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6062 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
6064 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6066 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6068 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
6069 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
6071 warning (0, "returning reference to temporary");
6074 if (TREE_CODE (whats_returned
) == VAR_DECL
6075 && DECL_NAME (whats_returned
)
6076 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
6078 warning (0, "reference to non-lvalue returned");
6083 if (DECL_P (whats_returned
)
6084 && DECL_NAME (whats_returned
)
6085 && DECL_FUNCTION_SCOPE_P (whats_returned
)
6086 && !(TREE_STATIC (whats_returned
)
6087 || TREE_PUBLIC (whats_returned
)))
6089 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6090 warning (0, "reference to local variable %q+D returned",
6093 warning (0, "address of local variable %q+D returned",
6099 /* Check that returning RETVAL from the current function is valid.
6100 Return an expression explicitly showing all conversions required to
6101 change RETVAL into the function return type, and to assign it to
6102 the DECL_RESULT for the function. */
6105 check_return_expr (tree retval
)
6108 /* The type actually returned by the function, after any
6111 int fn_returns_value_p
;
6113 /* A `volatile' function is one that isn't supposed to return, ever.
6114 (This is a G++ extension, used to get better code for functions
6115 that call the `volatile' function.) */
6116 if (TREE_THIS_VOLATILE (current_function_decl
))
6117 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6119 /* Check for various simple errors. */
6120 if (DECL_DESTRUCTOR_P (current_function_decl
))
6123 error ("returning a value from a destructor");
6126 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
6128 if (in_function_try_handler
)
6129 /* If a return statement appears in a handler of the
6130 function-try-block of a constructor, the program is ill-formed. */
6131 error ("cannot return from a handler of a function-try-block of a constructor");
6133 /* You can't return a value from a constructor. */
6134 error ("returning a value from a constructor");
6138 if (processing_template_decl
)
6140 current_function_returns_value
= 1;
6144 /* When no explicit return-value is given in a function with a named
6145 return value, the named return value is used. */
6146 result
= DECL_RESULT (current_function_decl
);
6147 valtype
= TREE_TYPE (result
);
6148 gcc_assert (valtype
!= NULL_TREE
);
6149 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
6150 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
6153 /* Check for a return statement with no return value in a function
6154 that's supposed to return a value. */
6155 if (!retval
&& fn_returns_value_p
)
6157 pedwarn ("return-statement with no value, in function returning %qT",
6159 /* Clear this, so finish_function won't say that we reach the
6160 end of a non-void function (which we don't, we gave a
6162 current_function_returns_null
= 0;
6164 /* Check for a return statement with a value in a function that
6165 isn't supposed to return a value. */
6166 else if (retval
&& !fn_returns_value_p
)
6168 if (VOID_TYPE_P (TREE_TYPE (retval
)))
6169 /* You can return a `void' value from a function of `void'
6170 type. In that case, we have to evaluate the expression for
6171 its side-effects. */
6172 finish_expr_stmt (retval
);
6174 pedwarn ("return-statement with a value, in function "
6175 "returning 'void'");
6177 current_function_returns_null
= 1;
6179 /* There's really no value to return, after all. */
6183 /* Remember that this function can sometimes return without a
6185 current_function_returns_null
= 1;
6187 /* Remember that this function did return a value. */
6188 current_function_returns_value
= 1;
6190 /* Check for erroneous operands -- but after giving ourselves a
6191 chance to provide an error about returning a value from a void
6193 if (error_operand_p (retval
))
6195 current_function_return_value
= error_mark_node
;
6196 return error_mark_node
;
6199 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6200 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
6201 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
6202 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
6204 && null_ptr_cst_p (retval
))
6205 warning (0, "%<operator new%> must not return NULL unless it is "
6206 "declared %<throw()%> (or -fcheck-new is in effect)");
6208 /* Effective C++ rule 15. See also start_function. */
6210 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
6214 /* The function return type must be a reference to the current
6216 if (TREE_CODE (valtype
) == REFERENCE_TYPE
6217 && same_type_ignoring_top_level_qualifiers_p
6218 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
6220 /* Returning '*this' is obviously OK. */
6221 if (retval
== current_class_ref
)
6223 /* If we are calling a function whose return type is the same of
6224 the current class reference, it is ok. */
6225 else if (TREE_CODE (retval
) == INDIRECT_REF
6226 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
6231 warning (0, "%<operator=%> should return a reference to %<*this%>");
6234 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6236 [...] For a function with a class return type, if the expression
6237 in the return statement is the name of a local object, and the cv-
6238 unqualified type of the local object is the same as the function
6239 return type, an implementation is permitted to omit creating the tem-
6240 porary object to hold the function return value [...]
6242 So, if this is a value-returning function that always returns the same
6243 local variable, remember it.
6245 It might be nice to be more flexible, and choose the first suitable
6246 variable even if the function sometimes returns something else, but
6247 then we run the risk of clobbering the variable we chose if the other
6248 returned expression uses the chosen variable somehow. And people expect
6249 this restriction, anyway. (jason 2000-11-19)
6251 See finish_function and finalize_nrv for the rest of this optimization. */
6253 if (fn_returns_value_p
&& flag_elide_constructors
)
6255 if (retval
!= NULL_TREE
6256 && (current_function_return_value
== NULL_TREE
6257 || current_function_return_value
== retval
)
6258 && TREE_CODE (retval
) == VAR_DECL
6259 && DECL_CONTEXT (retval
) == current_function_decl
6260 && ! TREE_STATIC (retval
)
6261 && (DECL_ALIGN (retval
)
6262 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
6263 && same_type_p ((TYPE_MAIN_VARIANT
6264 (TREE_TYPE (retval
))),
6266 (TREE_TYPE (TREE_TYPE (current_function_decl
))))))
6267 current_function_return_value
= retval
;
6269 current_function_return_value
= error_mark_node
;
6272 /* We don't need to do any conversions when there's nothing being
6277 /* Do any required conversions. */
6278 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
6279 /* No conversions are required. */
6283 /* The type the function is declared to return. */
6284 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6286 /* First convert the value to the function's return type, then
6287 to the type of return value's location to handle the
6288 case that functype is smaller than the valtype. */
6289 retval
= convert_for_initialization
6290 (NULL_TREE
, functype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
6291 "return", NULL_TREE
, 0);
6292 retval
= convert (valtype
, retval
);
6294 /* If the conversion failed, treat this just like `return;'. */
6295 if (retval
== error_mark_node
)
6297 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6298 else if (! current_function_returns_struct
6299 && TREE_CODE (retval
) == TARGET_EXPR
6300 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
6301 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
6302 TREE_OPERAND (retval
, 0));
6304 maybe_warn_about_returning_address_of_local (retval
);
6307 /* Actually copy the value returned into the appropriate location. */
6308 if (retval
&& retval
!= result
)
6309 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
6315 /* Returns nonzero if the pointer-type FROM can be converted to the
6316 pointer-type TO via a qualification conversion. If CONSTP is -1,
6317 then we return nonzero if the pointers are similar, and the
6318 cv-qualification signature of FROM is a proper subset of that of TO.
6320 If CONSTP is positive, then all outer pointers have been
6324 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
6326 bool to_more_cv_qualified
= false;
6328 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6330 if (TREE_CODE (to
) != TREE_CODE (from
))
6333 if (TREE_CODE (from
) == OFFSET_TYPE
6334 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
6335 TYPE_OFFSET_BASETYPE (to
)))
6338 /* Const and volatile mean something different for function types,
6339 so the usual checks are not appropriate. */
6340 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
6342 /* In Objective-C++, some types may have been 'volatilized' by
6343 the compiler for EH; when comparing them here, the volatile
6344 qualification must be ignored. */
6345 bool objc_quals_match
= objc_type_quals_match (to
, from
);
6347 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
6350 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
6354 to_more_cv_qualified
= true;
6358 constp
&= TYPE_READONLY (to
);
6361 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
6362 return ((constp
>= 0 || to_more_cv_qualified
)
6363 && same_type_ignoring_top_level_qualifiers_p (to
, from
));
6367 /* When comparing, say, char ** to char const **, this function takes
6368 the 'char *' and 'char const *'. Do not pass non-pointer/reference
6369 types to this function. */
6372 comp_ptr_ttypes (tree to
, tree from
)
6374 return comp_ptr_ttypes_real (to
, from
, 1);
6377 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6378 type or inheritance-related types, regardless of cv-quals. */
6381 ptr_reasonably_similar (tree to
, tree from
)
6383 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6385 /* Any target type is similar enough to void. */
6386 if (TREE_CODE (to
) == VOID_TYPE
6387 || TREE_CODE (from
) == VOID_TYPE
)
6390 if (TREE_CODE (to
) != TREE_CODE (from
))
6393 if (TREE_CODE (from
) == OFFSET_TYPE
6394 && comptypes (TYPE_OFFSET_BASETYPE (to
),
6395 TYPE_OFFSET_BASETYPE (from
),
6396 COMPARE_BASE
| COMPARE_DERIVED
))
6399 if (TREE_CODE (to
) == VECTOR_TYPE
6400 && vector_types_convertible_p (to
, from
))
6403 if (TREE_CODE (to
) == INTEGER_TYPE
6404 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
6407 if (TREE_CODE (to
) == FUNCTION_TYPE
)
6410 if (TREE_CODE (to
) != POINTER_TYPE
)
6412 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
6413 COMPARE_BASE
| COMPARE_DERIVED
);
6417 /* Like comp_ptr_ttypes, for const_cast. */
6420 comp_ptr_ttypes_const (tree to
, tree from
)
6422 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6424 if (TREE_CODE (to
) != TREE_CODE (from
))
6427 if (TREE_CODE (from
) == OFFSET_TYPE
6428 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
6429 TYPE_OFFSET_BASETYPE (to
)))
6432 if (TREE_CODE (to
) != POINTER_TYPE
)
6433 return same_type_ignoring_top_level_qualifiers_p (to
, from
);
6437 /* Returns the type qualifiers for this type, including the qualifiers on the
6438 elements for an array type. */
6441 cp_type_quals (tree type
)
6443 type
= strip_array_types (type
);
6444 if (type
== error_mark_node
)
6445 return TYPE_UNQUALIFIED
;
6446 return TYPE_QUALS (type
);
6449 /* Returns nonzero if the TYPE contains a mutable member. */
6452 cp_has_mutable_p (tree type
)
6454 type
= strip_array_types (type
);
6456 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
6459 /* Apply the TYPE_QUALS to the new DECL. */
6461 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
6463 tree type
= TREE_TYPE (decl
);
6465 if (type
== error_mark_node
)
6468 if (TREE_CODE (type
) == FUNCTION_TYPE
6469 && type_quals
!= TYPE_UNQUALIFIED
)
6471 /* This was an error in C++98 (cv-qualifiers cannot be added to
6472 a function type), but DR 295 makes the code well-formed by
6473 dropping the extra qualifiers. */
6476 tree bad_type
= build_qualified_type (type
, type_quals
);
6477 pedwarn ("ignoring %qV qualifiers added to function type %qT",
6481 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
6485 /* Avoid setting TREE_READONLY incorrectly. */
6486 if (/* If the object has a constructor, the constructor may modify
6488 TYPE_NEEDS_CONSTRUCTING (type
)
6489 /* If the type isn't complete, we don't know yet if it will need
6491 || !COMPLETE_TYPE_P (type
)
6492 /* If the type has a mutable component, that component might be
6494 || TYPE_HAS_MUTABLE_P (type
))
6495 type_quals
&= ~TYPE_QUAL_CONST
;
6497 c_apply_type_quals_to_decl (type_quals
, decl
);
6500 /* Subroutine of casts_away_constness. Make T1 and T2 point at
6501 exemplar types such that casting T1 to T2 is casting away constness
6502 if and only if there is no implicit conversion from T1 to T2. */
6505 casts_away_constness_r (tree
*t1
, tree
*t2
)
6510 /* [expr.const.cast]
6512 For multi-level pointer to members and multi-level mixed pointers
6513 and pointers to members (conv.qual), the "member" aspect of a
6514 pointer to member level is ignored when determining if a const
6515 cv-qualifier has been cast away. */
6516 /* [expr.const.cast]
6518 For two pointer types:
6520 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
6521 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
6524 casting from X1 to X2 casts away constness if, for a non-pointer
6525 type T there does not exist an implicit conversion (clause
6528 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
6532 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
6533 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
6534 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
6536 *t1
= cp_build_qualified_type (void_type_node
,
6537 cp_type_quals (*t1
));
6538 *t2
= cp_build_qualified_type (void_type_node
,
6539 cp_type_quals (*t2
));
6543 quals1
= cp_type_quals (*t1
);
6544 quals2
= cp_type_quals (*t2
);
6546 if (TYPE_PTRMEM_P (*t1
))
6547 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
6549 *t1
= TREE_TYPE (*t1
);
6550 if (TYPE_PTRMEM_P (*t2
))
6551 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
6553 *t2
= TREE_TYPE (*t2
);
6555 casts_away_constness_r (t1
, t2
);
6556 *t1
= build_pointer_type (*t1
);
6557 *t2
= build_pointer_type (*t2
);
6558 *t1
= cp_build_qualified_type (*t1
, quals1
);
6559 *t2
= cp_build_qualified_type (*t2
, quals2
);
6562 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
6566 casts_away_constness (tree t1
, tree t2
)
6568 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
6570 /* [expr.const.cast]
6572 Casting from an lvalue of type T1 to an lvalue of type T2
6573 using a reference cast casts away constness if a cast from an
6574 rvalue of type "pointer to T1" to the type "pointer to T2"
6575 casts away constness. */
6576 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
6577 return casts_away_constness (build_pointer_type (t1
),
6578 build_pointer_type (TREE_TYPE (t2
)));
6581 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
6582 /* [expr.const.cast]
6584 Casting from an rvalue of type "pointer to data member of X
6585 of type T1" to the type "pointer to data member of Y of type
6586 T2" casts away constness if a cast from an rvalue of type
6587 "pointer to T1" to the type "pointer to T2" casts away
6589 return casts_away_constness
6590 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
6591 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
6593 /* Casting away constness is only something that makes sense for
6594 pointer or reference types. */
6595 if (TREE_CODE (t1
) != POINTER_TYPE
6596 || TREE_CODE (t2
) != POINTER_TYPE
)
6599 /* Top-level qualifiers don't matter. */
6600 t1
= TYPE_MAIN_VARIANT (t1
);
6601 t2
= TYPE_MAIN_VARIANT (t2
);
6602 casts_away_constness_r (&t1
, &t2
);
6603 if (!can_convert (t2
, t1
))
6609 /* If T is a REFERENCE_TYPE return the type to which T refers.
6610 Otherwise, return T itself. */
6613 non_reference (tree t
)
6615 if (TREE_CODE (t
) == REFERENCE_TYPE
)
6621 /* Return nonzero if REF is an lvalue valid for this language;
6622 otherwise, print an error message and return zero. USE says
6623 how the lvalue is being used and so selects the error message. */
6626 lvalue_or_else (tree ref
, enum lvalue_use use
)
6628 int win
= lvalue_p (ref
);