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
pfn_from_ptrmemfunc (tree
);
47 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int);
48 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
49 static tree
rationalize_conditional_expr (enum tree_code
, tree
);
50 static int comp_ptr_ttypes_real (tree
, tree
, int);
51 static bool comp_except_types (tree
, tree
, bool);
52 static bool comp_array_types (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 unsigned int needs_constructing
, has_nontrivial_dtor
;
112 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
115 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
117 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
118 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
120 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
121 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
124 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
125 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
130 /* Like complete_type, but issue an error if the TYPE cannot be completed.
131 VALUE is used for informative diagnostics.
132 Returns NULL_TREE if the type cannot be made complete. */
135 complete_type_or_else (tree type
, tree value
)
137 type
= complete_type (type
);
138 if (type
== error_mark_node
)
139 /* We already issued an error. */
141 else if (!COMPLETE_TYPE_P (type
))
143 cxx_incomplete_type_diagnostic (value
, type
, 0);
150 /* Return truthvalue of whether type of EXP is instantiated. */
153 type_unknown_p (tree exp
)
155 return (TREE_CODE (exp
) == TREE_LIST
156 || TREE_TYPE (exp
) == unknown_type_node
);
160 /* Return the common type of two parameter lists.
161 We assume that comptypes has already been done and returned 1;
162 if that isn't so, this may crash.
164 As an optimization, free the space we allocate if the parameter
165 lists are already common. */
168 commonparms (tree p1
, tree p2
)
170 tree oldargs
= p1
, newargs
, n
;
174 len
= list_length (p1
);
175 newargs
= tree_last (p1
);
177 if (newargs
== void_list_node
)
186 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
191 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
193 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
195 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
198 else if (! TREE_PURPOSE (p1
))
200 if (TREE_PURPOSE (p2
))
202 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
208 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
210 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
212 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
215 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
218 TREE_VALUE (n
) = TREE_VALUE (p1
);
226 /* Given a type, perhaps copied for a typedef,
227 find the "original" version of it. */
229 original_type (tree t
)
231 while (TYPE_NAME (t
) != NULL_TREE
)
233 tree x
= TYPE_NAME (t
);
234 if (TREE_CODE (x
) != TYPE_DECL
)
236 x
= DECL_ORIGINAL_TYPE (x
);
244 /* T1 and T2 are arithmetic or enumeration types. Return the type
245 that will result from the "usual arithmetic conversions" on T1 and
246 T2 as described in [expr]. */
249 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
251 enum tree_code code1
= TREE_CODE (t1
);
252 enum tree_code code2
= TREE_CODE (t2
);
255 /* FIXME: Attributes. */
256 gcc_assert (ARITHMETIC_TYPE_P (t1
)
257 || TREE_CODE (t1
) == COMPLEX_TYPE
258 || TREE_CODE (t1
) == VECTOR_TYPE
259 || TREE_CODE (t1
) == ENUMERAL_TYPE
);
260 gcc_assert (ARITHMETIC_TYPE_P (t2
)
261 || TREE_CODE (t2
) == COMPLEX_TYPE
262 || TREE_CODE (t1
) == VECTOR_TYPE
263 || TREE_CODE (t2
) == ENUMERAL_TYPE
);
265 /* In what follows, we slightly generalize the rules given in [expr] so
266 as to deal with `long long' and `complex'. First, merge the
268 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
270 /* If one type is complex, form the common type of the non-complex
271 components, then make that complex. Use T1 or T2 if it is the
273 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
275 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
276 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
278 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
280 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
281 return build_type_attribute_variant (t1
, attributes
);
282 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
283 return build_type_attribute_variant (t2
, attributes
);
285 return build_type_attribute_variant (build_complex_type (subtype
),
289 if (code1
== VECTOR_TYPE
)
291 /* When we get here we should have two vectors of the same size.
292 Just prefer the unsigned one if present. */
293 if (TYPE_UNSIGNED (t1
))
294 return build_type_attribute_variant (t1
, attributes
);
296 return build_type_attribute_variant (t2
, attributes
);
299 /* If only one is real, use it as the result. */
300 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
301 return build_type_attribute_variant (t1
, attributes
);
302 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
303 return build_type_attribute_variant (t2
, attributes
);
305 /* Perform the integral promotions. */
306 if (code1
!= REAL_TYPE
)
308 t1
= type_promotes_to (t1
);
309 t2
= type_promotes_to (t2
);
312 /* Both real or both integers; use the one with greater precision. */
313 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
314 return build_type_attribute_variant (t1
, attributes
);
315 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
316 return build_type_attribute_variant (t2
, attributes
);
318 /* The types are the same; no need to do anything fancy. */
319 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
320 return build_type_attribute_variant (t1
, attributes
);
322 if (code1
!= REAL_TYPE
)
324 /* If one is a sizetype, use it so size_binop doesn't blow up. */
325 if (TYPE_IS_SIZETYPE (t1
) > TYPE_IS_SIZETYPE (t2
))
326 return build_type_attribute_variant (t1
, attributes
);
327 if (TYPE_IS_SIZETYPE (t2
) > TYPE_IS_SIZETYPE (t1
))
328 return build_type_attribute_variant (t2
, attributes
);
330 /* If one is unsigned long long, then convert the other to unsigned
332 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
333 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
334 return build_type_attribute_variant (long_long_unsigned_type_node
,
336 /* If one is a long long, and the other is an unsigned long, and
337 long long can represent all the values of an unsigned long, then
338 convert to a long long. Otherwise, convert to an unsigned long
339 long. Otherwise, if either operand is long long, convert the
342 Since we're here, we know the TYPE_PRECISION is the same;
343 therefore converting to long long cannot represent all the values
344 of an unsigned long, so we choose unsigned long long in that
346 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
347 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
349 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
350 ? long_long_unsigned_type_node
351 : long_long_integer_type_node
);
352 return build_type_attribute_variant (t
, attributes
);
355 /* Go through the same procedure, but for longs. */
356 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
357 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
358 return build_type_attribute_variant (long_unsigned_type_node
,
360 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
361 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
363 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
364 ? long_unsigned_type_node
: long_integer_type_node
);
365 return build_type_attribute_variant (t
, attributes
);
367 /* Otherwise prefer the unsigned one. */
368 if (TYPE_UNSIGNED (t1
))
369 return build_type_attribute_variant (t1
, attributes
);
371 return build_type_attribute_variant (t2
, attributes
);
375 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
376 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
377 return build_type_attribute_variant (long_double_type_node
,
379 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
380 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
381 return build_type_attribute_variant (double_type_node
,
383 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
384 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
385 return build_type_attribute_variant (float_type_node
,
388 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
389 the standard C++ floating-point types. Logic earlier in this
390 function has already eliminated the possibility that
391 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
392 compelling reason to choose one or the other. */
393 return build_type_attribute_variant (t1
, attributes
);
397 /* Subroutine of composite_pointer_type to implement the recursive
398 case. See that function for documentation fo the parameters. */
401 composite_pointer_type_r (tree t1
, tree t2
, const char* location
)
408 /* Determine the types pointed to by T1 and T2. */
409 if (TREE_CODE (t1
) == POINTER_TYPE
)
411 pointee1
= TREE_TYPE (t1
);
412 pointee2
= TREE_TYPE (t2
);
416 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
417 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
422 Otherwise, the composite pointer type is a pointer type
423 similar (_conv.qual_) to the type of one of the operands,
424 with a cv-qualification signature (_conv.qual_) that is the
425 union of the cv-qualification signatures of the operand
427 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
428 result_type
= pointee1
;
429 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
430 && TREE_CODE (pointee2
) == POINTER_TYPE
)
431 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
432 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
433 result_type
= composite_pointer_type_r (pointee1
, pointee2
, location
);
436 pedwarn ("%s between distinct pointer types %qT and %qT "
439 result_type
= void_type_node
;
441 result_type
= cp_build_qualified_type (result_type
,
442 (cp_type_quals (pointee1
)
443 | cp_type_quals (pointee2
)));
444 /* If the original types were pointers to members, so is the
446 if (TYPE_PTR_TO_MEMBER_P (t1
))
448 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
449 TYPE_PTRMEM_CLASS_TYPE (t2
)))
450 pedwarn ("%s between distinct pointer types %qT and %qT "
453 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
457 result_type
= build_pointer_type (result_type
);
459 /* Merge the attributes. */
460 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
461 return build_type_attribute_variant (result_type
, attributes
);
464 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
465 ARG1 and ARG2 are the values with those types. The LOCATION is a
466 string describing the current location, in case an error occurs.
468 This routine also implements the computation of a common type for
469 pointers-to-members as per [expr.eq]. */
472 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
473 const char* location
)
480 If one operand is a null pointer constant, the composite pointer
481 type is the type of the other operand. */
482 if (null_ptr_cst_p (arg1
))
484 if (null_ptr_cst_p (arg2
))
491 If one of the operands has type "pointer to cv1 void*", then
492 the other has type "pointer to cv2T", and the composite pointer
493 type is "pointer to cv12 void", where cv12 is the union of cv1
496 If either type is a pointer to void, make sure it is T1. */
497 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
505 /* Now, if T1 is a pointer to void, merge the qualifiers. */
506 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
511 if (pedantic
&& TYPE_PTRFN_P (t2
))
512 pedwarn ("ISO C++ forbids %s between pointer of type %<void *%> "
513 "and pointer-to-function", location
);
515 = cp_build_qualified_type (void_type_node
,
516 (cp_type_quals (TREE_TYPE (t1
))
517 | cp_type_quals (TREE_TYPE (t2
))));
518 result_type
= build_pointer_type (result_type
);
519 /* Merge the attributes. */
520 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
521 return build_type_attribute_variant (result_type
, attributes
);
524 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
525 && TREE_CODE (t2
) == POINTER_TYPE
)
527 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
531 /* [expr.eq] permits the application of a pointer conversion to
532 bring the pointers to a common type. */
533 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
534 && CLASS_TYPE_P (TREE_TYPE (t1
))
535 && CLASS_TYPE_P (TREE_TYPE (t2
))
536 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
539 class1
= TREE_TYPE (t1
);
540 class2
= TREE_TYPE (t2
);
542 if (DERIVED_FROM_P (class1
, class2
))
543 t2
= (build_pointer_type
544 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
545 else if (DERIVED_FROM_P (class2
, class1
))
546 t1
= (build_pointer_type
547 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
550 error ("%s between distinct pointer types %qT and %qT "
551 "lacks a cast", location
, t1
, t2
);
552 return error_mark_node
;
555 /* [expr.eq] permits the application of a pointer-to-member
556 conversion to change the class type of one of the types. */
557 else if (TYPE_PTR_TO_MEMBER_P (t1
)
558 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
559 TYPE_PTRMEM_CLASS_TYPE (t2
)))
561 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
562 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
564 if (DERIVED_FROM_P (class1
, class2
))
565 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
566 else if (DERIVED_FROM_P (class2
, class1
))
567 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
570 error ("%s between distinct pointer-to-member types %qT and %qT "
571 "lacks a cast", location
, t1
, t2
);
572 return error_mark_node
;
576 return composite_pointer_type_r (t1
, t2
, location
);
579 /* Return the merged type of two types.
580 We assume that comptypes has already been done and returned 1;
581 if that isn't so, this may crash.
583 This just combines attributes and default arguments; any other
584 differences would cause the two types to compare unalike. */
587 merge_types (tree t1
, tree t2
)
589 enum tree_code code1
;
590 enum tree_code code2
;
593 /* Save time if the two types are the same. */
596 if (original_type (t1
) == original_type (t2
))
599 /* If one type is nonsense, use the other. */
600 if (t1
== error_mark_node
)
602 if (t2
== error_mark_node
)
605 /* Merge the attributes. */
606 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
608 if (TYPE_PTRMEMFUNC_P (t1
))
609 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
610 if (TYPE_PTRMEMFUNC_P (t2
))
611 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
613 code1
= TREE_CODE (t1
);
614 code2
= TREE_CODE (t2
);
620 /* For two pointers, do this recursively on the target type. */
622 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
623 int quals
= cp_type_quals (t1
);
625 if (code1
== POINTER_TYPE
)
626 t1
= build_pointer_type (target
);
628 t1
= build_reference_type (target
);
629 t1
= build_type_attribute_variant (t1
, attributes
);
630 t1
= cp_build_qualified_type (t1
, quals
);
632 if (TREE_CODE (target
) == METHOD_TYPE
)
633 t1
= build_ptrmemfunc_type (t1
);
642 quals
= cp_type_quals (t1
);
643 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
644 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
645 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
647 t1
= cp_build_qualified_type (t1
, quals
);
653 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
654 /* Save space: see if the result is identical to one of the args. */
655 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
656 return build_type_attribute_variant (t1
, attributes
);
657 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
658 return build_type_attribute_variant (t2
, attributes
);
659 /* Merge the element types, and have a size if either arg has one. */
660 t1
= build_cplus_array_type
661 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
666 /* Function types: prefer the one that specified arg types.
667 If both do, merge the arg types. Also merge the return types. */
669 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
670 tree p1
= TYPE_ARG_TYPES (t1
);
671 tree p2
= TYPE_ARG_TYPES (t2
);
674 /* Save space: see if the result is identical to one of the args. */
675 if (valtype
== TREE_TYPE (t1
) && ! p2
)
676 return cp_build_type_attribute_variant (t1
, attributes
);
677 if (valtype
== TREE_TYPE (t2
) && ! p1
)
678 return cp_build_type_attribute_variant (t2
, attributes
);
680 /* Simple way if one arg fails to specify argument types. */
681 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
683 rval
= build_function_type (valtype
, p2
);
684 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
685 rval
= build_exception_variant (rval
, raises
);
686 return cp_build_type_attribute_variant (rval
, attributes
);
688 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
689 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
691 rval
= build_function_type (valtype
, p1
);
693 rval
= build_exception_variant (rval
, raises
);
694 return cp_build_type_attribute_variant (rval
, attributes
);
697 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
698 t1
= build_exception_variant (rval
, raises
);
704 /* Get this value the long way, since TYPE_METHOD_BASETYPE
705 is just the main variant of this. */
706 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
707 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
710 /* If this was a member function type, get back to the
711 original type of type member function (i.e., without
712 the class instance variable up front. */
713 t1
= build_function_type (TREE_TYPE (t1
),
714 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
715 t2
= build_function_type (TREE_TYPE (t2
),
716 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
717 t3
= merge_types (t1
, t2
);
718 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
719 TYPE_ARG_TYPES (t3
));
720 t1
= build_exception_variant (t3
, raises
);
725 /* There is no need to merge attributes into a TYPENAME_TYPE.
726 When the type is instantiated it will have whatever
727 attributes result from the instantiation. */
732 return cp_build_type_attribute_variant (t1
, attributes
);
735 /* Return the common type of two types.
736 We assume that comptypes has already been done and returned 1;
737 if that isn't so, this may crash.
739 This is the type for the result of most arithmetic operations
740 if the operands have the given two types. */
743 common_type (tree t1
, tree t2
)
745 enum tree_code code1
;
746 enum tree_code code2
;
748 /* If one type is nonsense, bail. */
749 if (t1
== error_mark_node
|| t2
== error_mark_node
)
750 return error_mark_node
;
752 code1
= TREE_CODE (t1
);
753 code2
= TREE_CODE (t2
);
755 if ((ARITHMETIC_TYPE_P (t1
) || code1
== ENUMERAL_TYPE
756 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
757 && (ARITHMETIC_TYPE_P (t2
) || code2
== ENUMERAL_TYPE
758 || code2
== COMPLEX_TYPE
|| code2
== VECTOR_TYPE
))
759 return type_after_usual_arithmetic_conversions (t1
, t2
);
761 else if ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
762 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
763 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)))
764 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
770 /* Compare two exception specifier types for exactness or subsetness, if
771 allowed. Returns false for mismatch, true for match (same, or
774 [except.spec] "If a class X ... objects of class X or any class publicly
775 and unambiguously derived from X. Similarly, if a pointer type Y * ...
776 exceptions of type Y * or that are pointers to any type publicly and
777 unambiguously derived from Y. Otherwise a function only allows exceptions
778 that have the same type ..."
779 This does not mention cv qualifiers and is different to what throw
780 [except.throw] and catch [except.catch] will do. They will ignore the
781 top level cv qualifiers, and allow qualifiers in the pointer to class
784 We implement the letter of the standard. */
787 comp_except_types (tree a
, tree b
, bool exact
)
789 if (same_type_p (a
, b
))
793 if (cp_type_quals (a
) || cp_type_quals (b
))
796 if (TREE_CODE (a
) == POINTER_TYPE
797 && TREE_CODE (b
) == POINTER_TYPE
)
801 if (cp_type_quals (a
) || cp_type_quals (b
))
805 if (TREE_CODE (a
) != RECORD_TYPE
806 || TREE_CODE (b
) != RECORD_TYPE
)
809 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
815 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
816 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
817 otherwise it must be exact. Exception lists are unordered, but
818 we've already filtered out duplicates. Most lists will be in order,
819 we should try to make use of that. */
822 comp_except_specs (tree t1
, tree t2
, bool exact
)
831 if (t1
== NULL_TREE
) /* T1 is ... */
832 return t2
== NULL_TREE
|| !exact
;
833 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
834 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
835 if (t2
== NULL_TREE
) /* T2 is ... */
837 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
840 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
841 Count how many we find, to determine exactness. For exact matching and
842 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
844 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
846 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
848 tree a
= TREE_VALUE (probe
);
849 tree b
= TREE_VALUE (t2
);
851 if (comp_except_types (a
, b
, exact
))
853 if (probe
== base
&& exact
)
854 base
= TREE_CHAIN (probe
);
859 if (probe
== NULL_TREE
)
862 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
865 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
866 [] can match [size]. */
869 comp_array_types (tree t1
, tree t2
, bool allow_redeclaration
)
878 /* The type of the array elements must be the same. */
879 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
882 d1
= TYPE_DOMAIN (t1
);
883 d2
= TYPE_DOMAIN (t2
);
888 /* If one of the arrays is dimensionless, and the other has a
889 dimension, they are of different types. However, it is valid to
897 declarations for an array object can specify
898 array types that differ by the presence or absence of a major
899 array bound (_dcl.array_). */
901 return allow_redeclaration
;
903 /* Check that the dimensions are the same. */
905 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
907 max1
= TYPE_MAX_VALUE (d1
);
908 max2
= TYPE_MAX_VALUE (d2
);
909 if (processing_template_decl
&& !abi_version_at_least (2)
910 && !value_dependent_expression_p (max1
)
911 && !value_dependent_expression_p (max2
))
913 /* With abi-1 we do not fold non-dependent array bounds, (and
914 consequently mangle them incorrectly). We must therefore
915 fold them here, to verify the domains have the same
921 if (!cp_tree_equal (max1
, max2
))
927 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
928 is a bitwise-or of the COMPARE_* flags. */
931 comptypes (tree t1
, tree t2
, int strict
)
936 /* Suppress errors caused by previously reported errors. */
937 if (t1
== error_mark_node
|| t2
== error_mark_node
)
940 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
942 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
943 current instantiation. */
944 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
946 tree resolved
= resolve_typename_type (t1
, /*only_current_p=*/true);
948 if (resolved
!= error_mark_node
)
952 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
954 tree resolved
= resolve_typename_type (t2
, /*only_current_p=*/true);
956 if (resolved
!= error_mark_node
)
960 /* If either type is the internal version of sizetype, use the
962 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
963 && TYPE_ORIG_SIZE_TYPE (t1
))
964 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
966 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
967 && TYPE_ORIG_SIZE_TYPE (t2
))
968 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
970 if (TYPE_PTRMEMFUNC_P (t1
))
971 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
972 if (TYPE_PTRMEMFUNC_P (t2
))
973 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
975 /* Different classes of types can't be compatible. */
976 if (TREE_CODE (t1
) != TREE_CODE (t2
))
979 /* Qualifiers must match. For array types, we will check when we
980 recur on the array element types. */
981 if (TREE_CODE (t1
) != ARRAY_TYPE
982 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
984 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
987 /* Allow for two different type nodes which have essentially the same
988 definition. Note that we already checked for equality of the type
989 qualifiers (just above). */
991 if (TREE_CODE (t1
) != ARRAY_TYPE
992 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
995 /* Compare the types. Break out if they could be the same. */
996 switch (TREE_CODE (t1
))
998 case TEMPLATE_TEMPLATE_PARM
:
999 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1000 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1001 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
1003 if (!comp_template_parms
1004 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1005 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1007 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1009 /* Don't check inheritance. */
1010 strict
= COMPARE_STRICT
;
1015 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1016 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1017 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1018 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1021 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1023 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1029 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1030 strict
& ~COMPARE_REDECLARATION
))
1032 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1037 case REFERENCE_TYPE
:
1038 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1039 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1040 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1046 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1048 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1053 /* Target types must match incl. qualifiers. */
1054 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1058 case TEMPLATE_TYPE_PARM
:
1059 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1060 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
1065 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1066 TYPENAME_TYPE_FULLNAME (t2
)))
1068 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1072 case UNBOUND_CLASS_TEMPLATE
:
1073 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1075 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1080 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1085 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1086 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1094 /* If we get here, we know that from a target independent POV the
1095 types are the same. Make sure the target attributes are also
1097 return targetm
.comp_type_attributes (t1
, t2
);
1100 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1103 at_least_as_qualified_p (tree type1
, tree type2
)
1105 int q1
= cp_type_quals (type1
);
1106 int q2
= cp_type_quals (type2
);
1108 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1109 return (q1
& q2
) == q2
;
1112 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1113 more cv-qualified that TYPE1, and 0 otherwise. */
1116 comp_cv_qualification (tree type1
, tree type2
)
1118 int q1
= cp_type_quals (type1
);
1119 int q2
= cp_type_quals (type2
);
1124 if ((q1
& q2
) == q2
)
1126 else if ((q1
& q2
) == q1
)
1132 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1133 subset of the cv-qualification signature of TYPE2, and the types
1134 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1137 comp_cv_qual_signature (tree type1
, tree type2
)
1139 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1141 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1147 /* If two types share a common base type, return that basetype.
1148 If there is not a unique most-derived base type, this function
1149 returns ERROR_MARK_NODE. */
1152 common_base_type (tree tt1
, tree tt2
)
1154 tree best
= NULL_TREE
;
1157 /* If one is a baseclass of another, that's good enough. */
1158 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1160 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1163 /* Otherwise, try to find a unique baseclass of TT1
1164 that is shared by TT2, and follow that down. */
1165 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt1
))-1; i
>= 0; i
--)
1167 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt1
), i
));
1168 tree trial
= common_base_type (basetype
, tt2
);
1172 if (trial
== error_mark_node
)
1174 if (best
== NULL_TREE
)
1176 else if (best
!= trial
)
1177 return error_mark_node
;
1182 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt2
))-1; i
>= 0; i
--)
1184 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt2
), i
));
1185 tree trial
= common_base_type (tt1
, basetype
);
1189 if (trial
== error_mark_node
)
1191 if (best
== NULL_TREE
)
1193 else if (best
!= trial
)
1194 return error_mark_node
;
1200 /* Subroutines of `comptypes'. */
1202 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1203 equivalent in the sense that functions with those parameter types
1204 can have equivalent types. The two lists must be equivalent,
1205 element by element. */
1208 compparms (tree parms1
, tree parms2
)
1212 /* An unspecified parmlist matches any specified parmlist
1213 whose argument types don't need default promotions. */
1215 for (t1
= parms1
, t2
= parms2
;
1217 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1219 /* If one parmlist is shorter than the other,
1220 they fail to match. */
1223 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1230 /* Process a sizeof or alignof expression where the operand is a
1234 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1236 enum tree_code type_code
;
1238 const char *op_name
;
1240 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1241 if (type
== error_mark_node
)
1242 return error_mark_node
;
1244 if (dependent_type_p (type
))
1246 value
= build_min (op
, size_type_node
, type
);
1247 TREE_READONLY (value
) = 1;
1251 op_name
= operator_name_info
[(int) op
].name
;
1253 type
= non_reference (type
);
1254 type_code
= TREE_CODE (type
);
1256 if (type_code
== METHOD_TYPE
)
1258 if (complain
&& (pedantic
|| warn_pointer_arith
))
1259 pedwarn ("invalid application of %qs to a member function", op_name
);
1260 value
= size_one_node
;
1263 value
= c_sizeof_or_alignof_type (complete_type (type
),
1270 /* Process a sizeof expression where the operand is an expression. */
1273 cxx_sizeof_expr (tree e
)
1275 if (e
== error_mark_node
)
1276 return error_mark_node
;
1278 if (processing_template_decl
)
1280 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1281 TREE_SIDE_EFFECTS (e
) = 0;
1282 TREE_READONLY (e
) = 1;
1287 if (TREE_CODE (e
) == COMPONENT_REF
1288 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1289 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1291 error ("invalid application of %<sizeof%> to a bit-field");
1294 else if (is_overloaded_fn (e
))
1296 pedwarn ("ISO C++ forbids applying %<sizeof%> to an expression of "
1300 else if (type_unknown_p (e
))
1302 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1308 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, true);
1311 /* Implement the __alignof keyword: Return the minimum required
1312 alignment of E, measured in bytes. For VAR_DECL's and
1313 FIELD_DECL's return DECL_ALIGN (which can be set from an
1314 "aligned" __attribute__ specification). */
1317 cxx_alignof_expr (tree e
)
1321 if (e
== error_mark_node
)
1322 return error_mark_node
;
1324 if (processing_template_decl
)
1326 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1327 TREE_SIDE_EFFECTS (e
) = 0;
1328 TREE_READONLY (e
) = 1;
1333 if (TREE_CODE (e
) == VAR_DECL
)
1334 t
= size_int (DECL_ALIGN_UNIT (e
));
1335 else if (TREE_CODE (e
) == COMPONENT_REF
1336 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1337 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1339 error ("invalid application of %<__alignof%> to a bit-field");
1342 else if (TREE_CODE (e
) == COMPONENT_REF
1343 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1344 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1345 else if (is_overloaded_fn (e
))
1347 pedwarn ("ISO C++ forbids applying %<__alignof%> to an expression of "
1351 else if (type_unknown_p (e
))
1353 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1357 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
, true);
1359 return fold_convert (size_type_node
, t
);
1362 /* Process a sizeof or alignof expression E with code OP where the operand
1363 is an expression. */
1366 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
)
1368 if (op
== SIZEOF_EXPR
)
1369 return cxx_sizeof_expr (e
);
1371 return cxx_alignof_expr (e
);
1374 /* EXPR is being used in a context that is not a function call.
1379 The expression can be used only as the left-hand operand of a
1380 member function call.
1382 [expr.mptr.operator]
1384 If the result of .* or ->* is a function, then that result can be
1385 used only as the operand for the function call operator ().
1387 by issuing an error message if appropriate. Returns true iff EXPR
1388 violates these rules. */
1391 invalid_nonstatic_memfn_p (tree expr
)
1393 if (TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
)
1395 error ("invalid use of non-static member function");
1401 /* If EXP is a reference to a bitfield, and the type of EXP does not
1402 match the declared type of the bitfield, return the declared type
1403 of the bitfield. Otherwise, return NULL_TREE. */
1406 is_bitfield_expr_with_lowered_type (tree exp
)
1410 if (TREE_CODE (exp
) == COND_EXPR
)
1412 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)))
1414 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1416 if (TREE_CODE (exp
) != COMPONENT_REF
)
1418 field
= TREE_OPERAND (exp
, 1);
1419 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_C_BIT_FIELD (field
))
1421 if (same_type_ignoring_top_level_qualifiers_p
1422 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1424 return DECL_BIT_FIELD_TYPE (field
);
1427 /* Perform the conversions in [expr] that apply when an lvalue appears
1428 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1429 function-to-pointer conversions.
1431 In addition, manifest constants are replaced by their values, and
1432 bitfield references are converted to their declared types. */
1435 decay_conversion (tree exp
)
1439 enum tree_code code
;
1441 type
= TREE_TYPE (exp
);
1442 if (type
== error_mark_node
)
1443 return error_mark_node
;
1445 if (type_unknown_p (exp
))
1447 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1448 return error_mark_node
;
1451 bitfield_type
= is_bitfield_expr_with_lowered_type (exp
);
1453 exp
= build_nop (bitfield_type
, exp
);
1455 exp
= decl_constant_value (exp
);
1457 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1458 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1459 code
= TREE_CODE (type
);
1460 if (code
== VOID_TYPE
)
1462 error ("void value not ignored as it ought to be");
1463 return error_mark_node
;
1465 if (invalid_nonstatic_memfn_p (exp
))
1466 return error_mark_node
;
1467 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1468 return build_unary_op (ADDR_EXPR
, exp
, 0);
1469 if (code
== ARRAY_TYPE
)
1474 if (TREE_CODE (exp
) == INDIRECT_REF
)
1475 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1476 TREE_OPERAND (exp
, 0));
1478 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1480 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1481 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1482 TREE_OPERAND (exp
, 0), op1
);
1486 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1488 error ("invalid use of non-lvalue array");
1489 return error_mark_node
;
1492 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1494 if (TREE_CODE (exp
) == VAR_DECL
)
1496 if (!cxx_mark_addressable (exp
))
1497 return error_mark_node
;
1498 adr
= build_nop (ptrtype
, build_address (exp
));
1501 /* This way is better for a COMPONENT_REF since it can
1502 simplify the offset for a component. */
1503 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1504 return cp_convert (ptrtype
, adr
);
1507 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1508 rvalues always have cv-unqualified types. */
1509 if (! CLASS_TYPE_P (type
))
1510 exp
= cp_convert (TYPE_MAIN_VARIANT (type
), exp
);
1516 default_conversion (tree exp
)
1518 exp
= decay_conversion (exp
);
1520 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1521 exp
= perform_integral_promotions (exp
);
1526 /* EXPR is an expression with an integral or enumeration type.
1527 Perform the integral promotions in [conv.prom], and return the
1531 perform_integral_promotions (tree expr
)
1536 type
= TREE_TYPE (expr
);
1537 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1538 promoted_type
= type_promotes_to (type
);
1539 if (type
!= promoted_type
)
1540 expr
= cp_convert (promoted_type
, expr
);
1544 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1548 inline_conversion (tree exp
)
1550 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1551 exp
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (exp
)), exp
);
1556 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1557 decay_conversion to one. */
1560 string_conv_p (tree totype
, tree exp
, int warn
)
1564 if (TREE_CODE (totype
) != POINTER_TYPE
)
1567 t
= TREE_TYPE (totype
);
1568 if (!same_type_p (t
, char_type_node
)
1569 && !same_type_p (t
, wchar_type_node
))
1572 if (TREE_CODE (exp
) == STRING_CST
)
1574 /* Make sure that we don't try to convert between char and wchar_t. */
1575 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1580 /* Is this a string constant which has decayed to 'const char *'? */
1581 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1582 if (!same_type_p (TREE_TYPE (exp
), t
))
1585 if (TREE_CODE (exp
) != ADDR_EXPR
1586 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1590 /* This warning is not very useful, as it complains about printf. */
1592 warning (OPT_Wwrite_strings
, "deprecated conversion from string constant to %qT'", totype
);
1597 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1598 can, for example, use as an lvalue. This code used to be in
1599 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1600 expressions, where we're dealing with aggregates. But now it's again only
1601 called from unary_complex_lvalue. The case (in particular) that led to
1602 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1606 rationalize_conditional_expr (enum tree_code code
, tree t
)
1608 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1609 the first operand is always the one to be used if both operands
1610 are equal, so we know what conditional expression this used to be. */
1611 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1613 /* The following code is incorrect if either operand side-effects. */
1614 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 0))
1615 && !TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)));
1617 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1618 ? LE_EXPR
: GE_EXPR
),
1619 TREE_OPERAND (t
, 0),
1620 TREE_OPERAND (t
, 1),
1621 /*overloaded_p=*/NULL
),
1622 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1623 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1627 build_conditional_expr (TREE_OPERAND (t
, 0),
1628 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1629 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1632 /* Given the TYPE of an anonymous union field inside T, return the
1633 FIELD_DECL for the field. If not found return NULL_TREE. Because
1634 anonymous unions can nest, we must also search all anonymous unions
1635 that are directly reachable. */
1638 lookup_anon_field (tree t
, tree type
)
1642 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1644 if (TREE_STATIC (field
))
1646 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
1649 /* If we find it directly, return the field. */
1650 if (DECL_NAME (field
) == NULL_TREE
1651 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
1656 /* Otherwise, it could be nested, search harder. */
1657 if (DECL_NAME (field
) == NULL_TREE
1658 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1660 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1668 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1669 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1670 non-NULL, it indicates the path to the base used to name MEMBER.
1671 If PRESERVE_REFERENCE is true, the expression returned will have
1672 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1673 returned will have the type referred to by the reference.
1675 This function does not perform access control; that is either done
1676 earlier by the parser when the name of MEMBER is resolved to MEMBER
1677 itself, or later when overload resolution selects one of the
1678 functions indicated by MEMBER. */
1681 build_class_member_access_expr (tree object
, tree member
,
1682 tree access_path
, bool preserve_reference
)
1686 tree result
= NULL_TREE
;
1688 if (object
== error_mark_node
|| member
== error_mark_node
)
1689 return error_mark_node
;
1691 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
1695 The type of the first expression shall be "class object" (of a
1697 object_type
= TREE_TYPE (object
);
1698 if (!currently_open_class (object_type
)
1699 && !complete_type_or_else (object_type
, object
))
1700 return error_mark_node
;
1701 if (!CLASS_TYPE_P (object_type
))
1703 error ("request for member %qD in %qE, which is of non-class type %qT",
1704 member
, object
, object_type
);
1705 return error_mark_node
;
1708 /* The standard does not seem to actually say that MEMBER must be a
1709 member of OBJECT_TYPE. However, that is clearly what is
1711 if (DECL_P (member
))
1713 member_scope
= DECL_CLASS_CONTEXT (member
);
1715 if (TREE_DEPRECATED (member
))
1716 warn_deprecated_use (member
);
1719 member_scope
= BINFO_TYPE (BASELINK_BINFO (member
));
1720 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1721 presently be the anonymous union. Go outwards until we find a
1722 type related to OBJECT_TYPE. */
1723 while (ANON_AGGR_TYPE_P (member_scope
)
1724 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
1726 member_scope
= TYPE_CONTEXT (member_scope
);
1727 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
1729 if (TREE_CODE (member
) == FIELD_DECL
)
1730 error ("invalid use of nonstatic data member %qE", member
);
1732 error ("%qD is not a member of %qT", member
, object_type
);
1733 return error_mark_node
;
1736 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1737 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1738 in the frontend; only _DECLs and _REFs are lvalues in the backend. */
1740 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
1742 object
= build_indirect_ref (temp
, NULL
);
1745 /* In [expr.ref], there is an explicit list of the valid choices for
1746 MEMBER. We check for each of those cases here. */
1747 if (TREE_CODE (member
) == VAR_DECL
)
1749 /* A static data member. */
1751 /* If OBJECT has side-effects, they are supposed to occur. */
1752 if (TREE_SIDE_EFFECTS (object
))
1753 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
1755 else if (TREE_CODE (member
) == FIELD_DECL
)
1757 /* A non-static data member. */
1762 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
1763 && integer_zerop (TREE_OPERAND (object
, 0)));
1765 /* Convert OBJECT to the type of MEMBER. */
1766 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
1767 TYPE_MAIN_VARIANT (member_scope
)))
1772 binfo
= lookup_base (access_path
? access_path
: object_type
,
1773 member_scope
, ba_unique
, &kind
);
1774 if (binfo
== error_mark_node
)
1775 return error_mark_node
;
1777 /* It is invalid to try to get to a virtual base of a
1778 NULL object. The most common cause is invalid use of
1780 if (null_object_p
&& kind
== bk_via_virtual
)
1782 error ("invalid access to non-static data member %qD of "
1785 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1786 return error_mark_node
;
1789 /* Convert to the base. */
1790 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
1792 /* If we found the base successfully then we should be able
1793 to convert to it successfully. */
1794 gcc_assert (object
!= error_mark_node
);
1797 /* Complain about other invalid uses of offsetof, even though they will
1798 give the right answer. Note that we complain whether or not they
1799 actually used the offsetof macro, since there's no way to know at this
1800 point. So we just give a warning, instead of a pedwarn. */
1801 /* Do not produce this warning for base class field references, because
1802 we know for a fact that didn't come from offsetof. This does occur
1803 in various testsuite cases where a null object is passed where a
1804 vtable access is required. */
1805 if (null_object_p
&& warn_invalid_offsetof
1806 && CLASSTYPE_NON_POD_P (object_type
)
1807 && !DECL_FIELD_IS_BASE (member
)
1808 && !skip_evaluation
)
1810 warning (0, "invalid access to non-static data member %qD of NULL object",
1812 warning (0, "(perhaps the %<offsetof%> macro was used incorrectly)");
1815 /* If MEMBER is from an anonymous aggregate, we have converted
1816 OBJECT so that it refers to the class containing the
1817 anonymous union. Generate a reference to the anonymous union
1818 itself, and recur to find MEMBER. */
1819 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
1820 /* When this code is called from build_field_call, the
1821 object already has the type of the anonymous union.
1822 That is because the COMPONENT_REF was already
1823 constructed, and was then disassembled before calling
1824 build_field_call. After the function-call code is
1825 cleaned up, this waste can be eliminated. */
1826 && (!same_type_ignoring_top_level_qualifiers_p
1827 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
1829 tree anonymous_union
;
1831 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
1832 DECL_CONTEXT (member
));
1833 object
= build_class_member_access_expr (object
,
1835 /*access_path=*/NULL_TREE
,
1836 preserve_reference
);
1839 /* Compute the type of the field, as described in [expr.ref]. */
1840 type_quals
= TYPE_UNQUALIFIED
;
1841 member_type
= TREE_TYPE (member
);
1842 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
1844 type_quals
= (cp_type_quals (member_type
)
1845 | cp_type_quals (object_type
));
1847 /* A field is const (volatile) if the enclosing object, or the
1848 field itself, is const (volatile). But, a mutable field is
1849 not const, even within a const object. */
1850 if (DECL_MUTABLE_P (member
))
1851 type_quals
&= ~TYPE_QUAL_CONST
;
1852 member_type
= cp_build_qualified_type (member_type
, type_quals
);
1855 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
1857 result
= fold_if_not_in_template (result
);
1859 /* Mark the expression const or volatile, as appropriate. Even
1860 though we've dealt with the type above, we still have to mark the
1861 expression itself. */
1862 if (type_quals
& TYPE_QUAL_CONST
)
1863 TREE_READONLY (result
) = 1;
1864 if (type_quals
& TYPE_QUAL_VOLATILE
)
1865 TREE_THIS_VOLATILE (result
) = 1;
1867 else if (BASELINK_P (member
))
1869 /* The member is a (possibly overloaded) member function. */
1873 /* If the MEMBER is exactly one static member function, then we
1874 know the type of the expression. Otherwise, we must wait
1875 until overload resolution has been performed. */
1876 functions
= BASELINK_FUNCTIONS (member
);
1877 if (TREE_CODE (functions
) == FUNCTION_DECL
1878 && DECL_STATIC_FUNCTION_P (functions
))
1879 type
= TREE_TYPE (functions
);
1881 type
= unknown_type_node
;
1882 /* Note that we do not convert OBJECT to the BASELINK_BINFO
1883 base. That will happen when the function is called. */
1884 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
1886 else if (TREE_CODE (member
) == CONST_DECL
)
1888 /* The member is an enumerator. */
1890 /* If OBJECT has side-effects, they are supposed to occur. */
1891 if (TREE_SIDE_EFFECTS (object
))
1892 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
1897 error ("invalid use of %qD", member
);
1898 return error_mark_node
;
1901 if (!preserve_reference
)
1904 If E2 is declared to have type "reference to T", then ... the
1905 type of E1.E2 is T. */
1906 result
= convert_from_reference (result
);
1911 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
1912 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
1915 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
1917 tree object_type
= TREE_TYPE (object
);
1918 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
1921 if (scope
&& !check_dtor_name (scope
, dtor_type
))
1923 error ("qualified type %qT does not match destructor name ~%qT",
1925 return error_mark_node
;
1927 if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
1929 error ("the type being destroyed is %qT, but the destructor refers to %qT",
1930 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
1931 return error_mark_node
;
1933 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
1934 /*protect=*/1, /*want_type=*/false);
1935 expr
= (adjust_result_of_qualified_name_lookup
1936 (expr
, dtor_type
, object_type
));
1940 /* An expression of the form "A::template B" has been resolved to
1941 DECL. Issue a diagnostic if B is not a template or template
1945 check_template_keyword (tree decl
)
1947 /* The standard says:
1951 If a name prefixed by the keyword template is not a member
1952 template, the program is ill-formed.
1954 DR 228 removed the restriction that the template be a member
1957 DR 96, if accepted would add the further restriction that explicit
1958 template arguments must be provided if the template keyword is
1959 used, but, as of 2005-10-16, that DR is still in "drafting". If
1960 this DR is accepted, then the semantic checks here can be
1961 simplified, as the entity named must in fact be a template
1962 specialization, rather than, as at present, a set of overloaded
1963 functions containing at least one template function. */
1964 if (TREE_CODE (decl
) != TEMPLATE_DECL
1965 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
1967 if (!is_overloaded_fn (decl
))
1968 pedwarn ("%qD is not a template", decl
);
1973 if (BASELINK_P (fns
))
1974 fns
= BASELINK_FUNCTIONS (fns
);
1977 tree fn
= OVL_CURRENT (fns
);
1978 if (TREE_CODE (fn
) == TEMPLATE_DECL
1979 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1981 if (TREE_CODE (fn
) == FUNCTION_DECL
1982 && DECL_USE_TEMPLATE (fn
)
1983 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
1985 fns
= OVL_NEXT (fns
);
1988 pedwarn ("%qD is not a template", decl
);
1993 /* This function is called by the parser to process a class member
1994 access expression of the form OBJECT.NAME. NAME is a node used by
1995 the parser to represent a name; it is not yet a DECL. It may,
1996 however, be a BASELINK where the BASELINK_FUNCTIONS is a
1997 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
1998 there is no reason to do the lookup twice, so the parser keeps the
1999 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2000 be a template via the use of the "A::template B" syntax. */
2003 finish_class_member_access_expr (tree object
, tree name
, bool template_p
)
2008 tree access_path
= NULL_TREE
;
2009 tree orig_object
= object
;
2010 tree orig_name
= name
;
2012 if (object
== error_mark_node
|| name
== error_mark_node
)
2013 return error_mark_node
;
2015 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2016 if (!objc_is_public (object
, name
))
2017 return error_mark_node
;
2019 object_type
= TREE_TYPE (object
);
2021 if (processing_template_decl
)
2023 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2024 dependent_type_p (object_type
)
2025 /* If NAME is just an IDENTIFIER_NODE, then the expression
2027 || TREE_CODE (object
) == IDENTIFIER_NODE
2028 /* If NAME is "f<args>", where either 'f' or 'args' is
2029 dependent, then the expression is dependent. */
2030 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2031 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2032 TREE_OPERAND (name
, 1)))
2033 /* If NAME is "T::X" where "T" is dependent, then the
2034 expression is dependent. */
2035 || (TREE_CODE (name
) == SCOPE_REF
2036 && TYPE_P (TREE_OPERAND (name
, 0))
2037 && dependent_type_p (TREE_OPERAND (name
, 0))))
2038 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2039 object
= build_non_dependent_expr (object
);
2044 The type of the first expression shall be "class object" (of a
2046 if (!currently_open_class (object_type
)
2047 && !complete_type_or_else (object_type
, object
))
2048 return error_mark_node
;
2049 if (!CLASS_TYPE_P (object_type
))
2051 error ("request for member %qD in %qE, which is of non-class type %qT",
2052 name
, object
, object_type
);
2053 return error_mark_node
;
2056 if (BASELINK_P (name
))
2057 /* A member function that has already been looked up. */
2061 bool is_template_id
= false;
2062 tree template_args
= NULL_TREE
;
2065 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2067 is_template_id
= true;
2068 template_args
= TREE_OPERAND (name
, 1);
2069 name
= TREE_OPERAND (name
, 0);
2071 if (TREE_CODE (name
) == OVERLOAD
)
2072 name
= DECL_NAME (get_first_fn (name
));
2073 else if (DECL_P (name
))
2074 name
= DECL_NAME (name
);
2077 if (TREE_CODE (name
) == SCOPE_REF
)
2079 /* A qualified name. The qualifying class or namespace `S'
2080 has already been looked up; it is either a TYPE or a
2082 scope
= TREE_OPERAND (name
, 0);
2083 name
= TREE_OPERAND (name
, 1);
2085 /* If SCOPE is a namespace, then the qualified name does not
2086 name a member of OBJECT_TYPE. */
2087 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2089 error ("%<%D::%D%> is not a member of %qT",
2090 scope
, name
, object_type
);
2091 return error_mark_node
;
2094 gcc_assert (CLASS_TYPE_P (scope
));
2095 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2096 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2098 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2099 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2100 if (access_path
== error_mark_node
)
2101 return error_mark_node
;
2104 error ("%qT is not a base of %qT", scope
, object_type
);
2105 return error_mark_node
;
2111 access_path
= object_type
;
2114 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2115 member
= lookup_destructor (object
, scope
, name
);
2118 /* Look up the member. */
2119 member
= lookup_member (access_path
, name
, /*protect=*/1,
2120 /*want_type=*/false);
2121 if (member
== NULL_TREE
)
2123 error ("%qD has no member named %qE", object_type
, name
);
2124 return error_mark_node
;
2126 if (member
== error_mark_node
)
2127 return error_mark_node
;
2132 tree
template = member
;
2134 if (BASELINK_P (template))
2135 template = lookup_template_function (template, template_args
);
2138 error ("%qD is not a member template function", name
);
2139 return error_mark_node
;
2144 if (TREE_DEPRECATED (member
))
2145 warn_deprecated_use (member
);
2148 check_template_keyword (member
);
2150 expr
= build_class_member_access_expr (object
, member
, access_path
,
2151 /*preserve_reference=*/false);
2152 if (processing_template_decl
&& expr
!= error_mark_node
)
2154 if (BASELINK_P (member
))
2156 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2157 BASELINK_QUALIFIED_P (member
) = 1;
2160 return build_min_non_dep (COMPONENT_REF
, expr
,
2161 orig_object
, orig_name
,
2168 /* Return an expression for the MEMBER_NAME field in the internal
2169 representation of PTRMEM, a pointer-to-member function. (Each
2170 pointer-to-member function type gets its own RECORD_TYPE so it is
2171 more convenient to access the fields by name than by FIELD_DECL.)
2172 This routine converts the NAME to a FIELD_DECL and then creates the
2173 node for the complete expression. */
2176 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2182 /* This code is a stripped down version of
2183 build_class_member_access_expr. It does not work to use that
2184 routine directly because it expects the object to be of class
2186 ptrmem_type
= TREE_TYPE (ptrmem
);
2187 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2188 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2189 /*want_type=*/false);
2190 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2191 cp_type_quals (ptrmem_type
));
2192 return fold_build3 (COMPONENT_REF
, member_type
,
2193 ptrmem
, member
, NULL_TREE
);
2196 /* Given an expression PTR for a pointer, return an expression
2197 for the value pointed to.
2198 ERRORSTRING is the name of the operator to appear in error messages.
2200 This function may need to overload OPERATOR_FNNAME.
2201 Must also handle REFERENCE_TYPEs for C++. */
2204 build_x_indirect_ref (tree expr
, const char *errorstring
)
2206 tree orig_expr
= expr
;
2209 if (processing_template_decl
)
2211 if (type_dependent_expression_p (expr
))
2212 return build_min_nt (INDIRECT_REF
, expr
);
2213 expr
= build_non_dependent_expr (expr
);
2216 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2217 NULL_TREE
, /*overloaded_p=*/NULL
);
2219 rval
= build_indirect_ref (expr
, errorstring
);
2221 if (processing_template_decl
&& rval
!= error_mark_node
)
2222 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2228 build_indirect_ref (tree ptr
, const char *errorstring
)
2232 if (ptr
== error_mark_node
)
2233 return error_mark_node
;
2235 if (ptr
== current_class_ptr
)
2236 return current_class_ref
;
2238 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2239 ? ptr
: decay_conversion (ptr
));
2240 type
= TREE_TYPE (pointer
);
2242 if (POINTER_TYPE_P (type
))
2246 If the type of the expression is "pointer to T," the type
2247 of the result is "T."
2249 We must use the canonical variant because certain parts of
2250 the back end, like fold, do pointer comparisons between
2252 tree t
= canonical_type_variant (TREE_TYPE (type
));
2254 if (VOID_TYPE_P (t
))
2256 /* A pointer to incomplete type (other than cv void) can be
2257 dereferenced [expr.unary.op]/1 */
2258 error ("%qT is not a pointer-to-object type", type
);
2259 return error_mark_node
;
2261 else if (TREE_CODE (pointer
) == ADDR_EXPR
2262 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2263 /* The POINTER was something like `&x'. We simplify `*&x' to
2265 return TREE_OPERAND (pointer
, 0);
2268 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2270 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2271 so that we get the proper error message if the result is used
2272 to assign to. Also, &* is supposed to be a no-op. */
2273 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2274 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2275 TREE_SIDE_EFFECTS (ref
)
2276 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2280 /* `pointer' won't be an error_mark_node if we were given a
2281 pointer to member, so it's cool to check for this here. */
2282 else if (TYPE_PTR_TO_MEMBER_P (type
))
2283 error ("invalid use of %qs on pointer to member", errorstring
);
2284 else if (pointer
!= error_mark_node
)
2287 error ("invalid type argument of %qs", errorstring
);
2289 error ("invalid type argument");
2291 return error_mark_node
;
2294 /* This handles expressions of the form "a[i]", which denotes
2297 This is logically equivalent in C to *(a+i), but we may do it differently.
2298 If A is a variable or a member, we generate a primitive ARRAY_REF.
2299 This avoids forcing the array out of registers, and can work on
2300 arrays that are not lvalues (for example, members of structures returned
2303 If INDEX is of some user-defined type, it must be converted to
2304 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2305 will inherit the type of the array, which will be some pointer type. */
2308 build_array_ref (tree array
, tree idx
)
2312 error ("subscript missing in array reference");
2313 return error_mark_node
;
2316 if (TREE_TYPE (array
) == error_mark_node
2317 || TREE_TYPE (idx
) == error_mark_node
)
2318 return error_mark_node
;
2320 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2322 switch (TREE_CODE (array
))
2326 tree value
= build_array_ref (TREE_OPERAND (array
, 1), idx
);
2327 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2328 TREE_OPERAND (array
, 0), value
);
2332 return build_conditional_expr
2333 (TREE_OPERAND (array
, 0),
2334 build_array_ref (TREE_OPERAND (array
, 1), idx
),
2335 build_array_ref (TREE_OPERAND (array
, 2), idx
));
2341 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2345 warn_array_subscript_with_type_char (idx
);
2347 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2349 error ("array subscript is not an integer");
2350 return error_mark_node
;
2353 /* Apply integral promotions *after* noticing character types.
2354 (It is unclear why we do these promotions -- the standard
2355 does not say that we should. In fact, the natural thing would
2356 seem to be to convert IDX to ptrdiff_t; we're performing
2357 pointer arithmetic.) */
2358 idx
= perform_integral_promotions (idx
);
2360 /* An array that is indexed by a non-constant
2361 cannot be stored in a register; we must be able to do
2362 address arithmetic on its address.
2363 Likewise an array of elements of variable size. */
2364 if (TREE_CODE (idx
) != INTEGER_CST
2365 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2366 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2369 if (!cxx_mark_addressable (array
))
2370 return error_mark_node
;
2373 /* An array that is indexed by a constant value which is not within
2374 the array bounds cannot be stored in a register either; because we
2375 would get a crash in store_bit_field/extract_bit_field when trying
2376 to access a non-existent part of the register. */
2377 if (TREE_CODE (idx
) == INTEGER_CST
2378 && TYPE_DOMAIN (TREE_TYPE (array
))
2379 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2381 if (!cxx_mark_addressable (array
))
2382 return error_mark_node
;
2385 if (pedantic
&& !lvalue_p (array
))
2386 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2388 /* Note in C++ it is valid to subscript a `register' array, since
2389 it is valid to take the address of something with that
2390 storage specification. */
2394 while (TREE_CODE (foo
) == COMPONENT_REF
)
2395 foo
= TREE_OPERAND (foo
, 0);
2396 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2397 warning (OPT_Wextra
, "subscripting array declared %<register%>");
2400 type
= TREE_TYPE (TREE_TYPE (array
));
2401 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2402 /* Array ref is const/volatile if the array elements are
2403 or if the array is.. */
2404 TREE_READONLY (rval
)
2405 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2406 TREE_SIDE_EFFECTS (rval
)
2407 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2408 TREE_THIS_VOLATILE (rval
)
2409 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2410 return require_complete_type (fold_if_not_in_template (rval
));
2414 tree ar
= default_conversion (array
);
2415 tree ind
= default_conversion (idx
);
2417 /* Put the integer in IND to simplify error checking. */
2418 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2425 if (ar
== error_mark_node
)
2428 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2430 error ("subscripted value is neither array nor pointer");
2431 return error_mark_node
;
2433 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2435 error ("array subscript is not an integer");
2436 return error_mark_node
;
2439 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR
, ar
, ind
),
2444 /* Resolve a pointer to member function. INSTANCE is the object
2445 instance to use, if the member points to a virtual member.
2447 This used to avoid checking for virtual functions if basetype
2448 has no virtual functions, according to an earlier ANSI draft.
2449 With the final ISO C++ rules, such an optimization is
2450 incorrect: A pointer to a derived member can be static_cast
2451 to pointer-to-base-member, as long as the dynamic object
2452 later has the right member. */
2455 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2457 if (TREE_CODE (function
) == OFFSET_REF
)
2458 function
= TREE_OPERAND (function
, 1);
2460 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2462 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2463 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2465 tree instance_ptr
= *instance_ptrptr
;
2466 tree instance_save_expr
= 0;
2467 if (instance_ptr
== error_mark_node
)
2469 if (TREE_CODE (function
) == PTRMEM_CST
)
2471 /* Extracting the function address from a pmf is only
2472 allowed with -Wno-pmf-conversions. It only works for
2474 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
2475 e1
= convert (fntype
, e1
);
2480 error ("object missing in use of %qE", function
);
2481 return error_mark_node
;
2485 if (TREE_SIDE_EFFECTS (instance_ptr
))
2486 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
2488 if (TREE_SIDE_EFFECTS (function
))
2489 function
= save_expr (function
);
2491 /* Start by extracting all the information from the PMF itself. */
2492 e3
= pfn_from_ptrmemfunc (function
);
2493 delta
= build_ptrmemfunc_access_expr (function
, delta_identifier
);
2494 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
2495 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
2497 case ptrmemfunc_vbit_in_pfn
:
2498 e1
= cp_build_binary_op (BIT_AND_EXPR
, idx
, integer_one_node
);
2499 idx
= cp_build_binary_op (MINUS_EXPR
, idx
, integer_one_node
);
2502 case ptrmemfunc_vbit_in_delta
:
2503 e1
= cp_build_binary_op (BIT_AND_EXPR
, delta
, integer_one_node
);
2504 delta
= cp_build_binary_op (RSHIFT_EXPR
, delta
, integer_one_node
);
2511 /* Convert down to the right base before using the instance. A
2512 special case is that in a pointer to member of class C, C may
2513 be incomplete. In that case, the function will of course be
2514 a member of C, and no conversion is required. In fact,
2515 lookup_base will fail in that case, because incomplete
2516 classes do not have BINFOs. */
2517 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2518 if (!same_type_ignoring_top_level_qualifiers_p
2519 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
2521 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
2522 basetype
, ba_check
, NULL
);
2523 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
2525 if (instance_ptr
== error_mark_node
)
2526 return error_mark_node
;
2528 /* ...and then the delta in the PMF. */
2529 instance_ptr
= build2 (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2530 instance_ptr
, delta
);
2532 /* Hand back the adjusted 'this' argument to our caller. */
2533 *instance_ptrptr
= instance_ptr
;
2535 /* Next extract the vtable pointer from the object. */
2536 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
2538 vtbl
= build_indirect_ref (vtbl
, NULL
);
2540 /* Finally, extract the function pointer from the vtable. */
2541 e2
= fold_build2 (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, idx
);
2542 e2
= build_indirect_ref (e2
, NULL
);
2543 TREE_CONSTANT (e2
) = 1;
2544 TREE_INVARIANT (e2
) = 1;
2546 /* When using function descriptors, the address of the
2547 vtable entry is treated as a function pointer. */
2548 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2549 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
2550 build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1));
2552 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2553 e1
= build_conditional_expr (e1
, e2
, e3
);
2555 /* Make sure this doesn't get evaluated first inside one of the
2556 branches of the COND_EXPR. */
2557 if (instance_save_expr
)
2558 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
2559 instance_save_expr
, e1
);
2567 build_function_call (tree function
, tree params
)
2569 tree fntype
, fndecl
;
2570 tree coerced_params
;
2571 tree name
= NULL_TREE
;
2573 tree original
= function
;
2575 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2576 expressions, like those used for ObjC messenger dispatches. */
2577 function
= objc_rewrite_function_call (function
, params
);
2579 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2580 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2581 if (TREE_CODE (function
) == NOP_EXPR
2582 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2583 function
= TREE_OPERAND (function
, 0);
2585 if (TREE_CODE (function
) == FUNCTION_DECL
)
2587 name
= DECL_NAME (function
);
2589 mark_used (function
);
2592 /* Convert anything with function type to a pointer-to-function. */
2593 if (pedantic
&& DECL_MAIN_P (function
))
2594 pedwarn ("ISO C++ forbids calling %<::main%> from within program");
2596 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2597 (because calling an inline function does not mean the function
2598 needs to be separately compiled). */
2600 if (DECL_INLINE (function
))
2601 function
= inline_conversion (function
);
2603 function
= build_addr_func (function
);
2609 function
= build_addr_func (function
);
2612 if (function
== error_mark_node
)
2613 return error_mark_node
;
2615 fntype
= TREE_TYPE (function
);
2617 if (TYPE_PTRMEMFUNC_P (fntype
))
2619 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2620 "function in %<%E (...)%>",
2622 return error_mark_node
;
2625 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2626 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2628 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2629 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2631 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2633 error ("%qE cannot be used as a function", original
);
2634 return error_mark_node
;
2637 /* fntype now gets the type of function pointed to. */
2638 fntype
= TREE_TYPE (fntype
);
2640 /* Convert the parameters to the types declared in the
2641 function prototype, or apply default promotions. */
2643 coerced_params
= convert_arguments (TYPE_ARG_TYPES (fntype
),
2644 params
, fndecl
, LOOKUP_NORMAL
);
2645 if (coerced_params
== error_mark_node
)
2646 return error_mark_node
;
2648 /* Check for errors in format strings and inappropriately
2651 check_function_arguments (TYPE_ATTRIBUTES (fntype
), coerced_params
,
2652 TYPE_ARG_TYPES (fntype
));
2654 return build_cxx_call (function
, coerced_params
);
2657 /* Convert the actual parameter expressions in the list VALUES
2658 to the types in the list TYPELIST.
2659 If parmdecls is exhausted, or when an element has NULL as its type,
2660 perform the default conversions.
2662 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2664 This is also where warnings about wrong number of args are generated.
2666 Return a list of expressions for the parameters as converted.
2668 Both VALUES and the returned value are chains of TREE_LIST nodes
2669 with the elements of the list in the TREE_VALUE slots of those nodes.
2671 In C++, unspecified trailing parameters can be filled in with their
2672 default arguments, if such were specified. Do so here. */
2675 convert_arguments (tree typelist
, tree values
, tree fndecl
, int flags
)
2677 tree typetail
, valtail
;
2678 tree result
= NULL_TREE
;
2679 const char *called_thing
= 0;
2682 /* Argument passing is always copy-initialization. */
2683 flags
|= LOOKUP_ONLYCONVERTING
;
2687 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2689 if (DECL_NAME (fndecl
) == NULL_TREE
2690 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2691 called_thing
= "constructor";
2693 called_thing
= "member function";
2696 called_thing
= "function";
2699 for (valtail
= values
, typetail
= typelist
;
2701 valtail
= TREE_CHAIN (valtail
), i
++)
2703 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2704 tree val
= TREE_VALUE (valtail
);
2706 if (val
== error_mark_node
)
2707 return error_mark_node
;
2709 if (type
== void_type_node
)
2713 error ("too many arguments to %s %q+#D", called_thing
, fndecl
);
2714 error ("at this point in file");
2717 error ("too many arguments to function");
2718 /* In case anybody wants to know if this argument
2721 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2725 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2726 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2727 if (TREE_CODE (val
) == NOP_EXPR
2728 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
2729 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
2730 val
= TREE_OPERAND (val
, 0);
2732 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
2734 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
2735 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
2736 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2737 val
= decay_conversion (val
);
2740 if (val
== error_mark_node
)
2741 return error_mark_node
;
2745 /* Formal parm type is specified by a function prototype. */
2748 if (!COMPLETE_TYPE_P (complete_type (type
)))
2751 error ("parameter %P of %qD has incomplete type %qT",
2754 error ("parameter %P has incomplete type %qT", i
, type
);
2755 parmval
= error_mark_node
;
2759 parmval
= convert_for_initialization
2760 (NULL_TREE
, type
, val
, flags
,
2761 "argument passing", fndecl
, i
);
2762 parmval
= convert_for_arg_passing (type
, parmval
);
2765 if (parmval
== error_mark_node
)
2766 return error_mark_node
;
2768 result
= tree_cons (NULL_TREE
, parmval
, result
);
2772 if (fndecl
&& DECL_BUILT_IN (fndecl
)
2773 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
2774 /* Don't do ellipsis conversion for __built_in_constant_p
2775 as this will result in spurious warnings for non-POD
2777 val
= require_complete_type (val
);
2779 val
= convert_arg_to_ellipsis (val
);
2781 result
= tree_cons (NULL_TREE
, val
, result
);
2785 typetail
= TREE_CHAIN (typetail
);
2788 if (typetail
!= 0 && typetail
!= void_list_node
)
2790 /* See if there are default arguments that can be used. */
2791 if (TREE_PURPOSE (typetail
)
2792 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
2794 for (; typetail
!= void_list_node
; ++i
)
2797 = convert_default_arg (TREE_VALUE (typetail
),
2798 TREE_PURPOSE (typetail
),
2801 if (parmval
== error_mark_node
)
2802 return error_mark_node
;
2804 result
= tree_cons (0, parmval
, result
);
2805 typetail
= TREE_CHAIN (typetail
);
2806 /* ends with `...'. */
2807 if (typetail
== NULL_TREE
)
2815 error ("too few arguments to %s %q+#D", called_thing
, fndecl
);
2816 error ("at this point in file");
2819 error ("too few arguments to function");
2820 return error_mark_node
;
2824 return nreverse (result
);
2827 /* Build a binary-operation expression, after performing default
2828 conversions on the operands. CODE is the kind of expression to build. */
2831 build_x_binary_op (enum tree_code code
, tree arg1
, tree arg2
,
2841 if (processing_template_decl
)
2843 if (type_dependent_expression_p (arg1
)
2844 || type_dependent_expression_p (arg2
))
2845 return build_min_nt (code
, arg1
, arg2
);
2846 arg1
= build_non_dependent_expr (arg1
);
2847 arg2
= build_non_dependent_expr (arg2
);
2850 if (code
== DOTSTAR_EXPR
)
2851 expr
= build_m_component_ref (arg1
, arg2
);
2853 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
2856 if (processing_template_decl
&& expr
!= error_mark_node
)
2857 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
2862 /* Build a binary-operation expression without default conversions.
2863 CODE is the kind of expression to build.
2864 This function differs from `build' in several ways:
2865 the data type of the result is computed and recorded in it,
2866 warnings are generated if arg data types are invalid,
2867 special handling for addition and subtraction of pointers is known,
2868 and some optimization is done (operations on narrow ints
2869 are done in the narrower type when that gives the same result).
2870 Constant folding is also done before the result is returned.
2872 Note that the operands will never have enumeral types
2873 because either they have just had the default conversions performed
2874 or they have both just been converted to some other type in which
2875 the arithmetic is to be done.
2877 C++: must do special pointer arithmetic when implementing
2878 multiple inheritance, and deal with pointer to member functions. */
2881 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
2882 int convert_p ATTRIBUTE_UNUSED
)
2885 enum tree_code code0
, code1
;
2887 const char *invalid_op_diag
;
2889 /* Expression code to give to the expression when it is built.
2890 Normally this is CODE, which is what the caller asked for,
2891 but in some special cases we change it. */
2892 enum tree_code resultcode
= code
;
2894 /* Data type in which the computation is to be performed.
2895 In the simplest cases this is the common type of the arguments. */
2896 tree result_type
= NULL
;
2898 /* Nonzero means operands have already been type-converted
2899 in whatever way is necessary.
2900 Zero means they need to be converted to RESULT_TYPE. */
2903 /* Nonzero means create the expression with this type, rather than
2905 tree build_type
= 0;
2907 /* Nonzero means after finally constructing the expression
2908 convert it to this type. */
2909 tree final_type
= 0;
2913 /* Nonzero if this is an operation like MIN or MAX which can
2914 safely be computed in short if both args are promoted shorts.
2915 Also implies COMMON.
2916 -1 indicates a bitwise operation; this makes a difference
2917 in the exact conditions for when it is safe to do the operation
2918 in a narrower mode. */
2921 /* Nonzero if this is a comparison operation;
2922 if both args are promoted shorts, compare the original shorts.
2923 Also implies COMMON. */
2924 int short_compare
= 0;
2926 /* Nonzero if this is a right-shift operation, which can be computed on the
2927 original short and then promoted if the operand is a promoted short. */
2928 int short_shift
= 0;
2930 /* Nonzero means set RESULT_TYPE to the common type of the args. */
2933 /* True if both operands have arithmetic type. */
2934 bool arithmetic_types_p
;
2936 /* Apply default conversions. */
2940 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
2941 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
2942 || code
== TRUTH_XOR_EXPR
)
2944 if (!really_overloaded_fn (op0
))
2945 op0
= decay_conversion (op0
);
2946 if (!really_overloaded_fn (op1
))
2947 op1
= decay_conversion (op1
);
2951 if (!really_overloaded_fn (op0
))
2952 op0
= default_conversion (op0
);
2953 if (!really_overloaded_fn (op1
))
2954 op1
= default_conversion (op1
);
2957 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2958 STRIP_TYPE_NOPS (op0
);
2959 STRIP_TYPE_NOPS (op1
);
2961 /* DTRT if one side is an overloaded function, but complain about it. */
2962 if (type_unknown_p (op0
))
2964 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
2965 if (t
!= error_mark_node
)
2967 pedwarn ("assuming cast to type %qT from overloaded function",
2972 if (type_unknown_p (op1
))
2974 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
2975 if (t
!= error_mark_node
)
2977 pedwarn ("assuming cast to type %qT from overloaded function",
2983 type0
= TREE_TYPE (op0
);
2984 type1
= TREE_TYPE (op1
);
2986 /* The expression codes of the data types of the arguments tell us
2987 whether the arguments are integers, floating, pointers, etc. */
2988 code0
= TREE_CODE (type0
);
2989 code1
= TREE_CODE (type1
);
2991 /* If an error was already reported for one of the arguments,
2992 avoid reporting another error. */
2994 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
2995 return error_mark_node
;
2997 if ((invalid_op_diag
2998 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3000 error (invalid_op_diag
);
3001 return error_mark_node
;
3007 /* Handle the pointer + int case. */
3008 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3009 return cp_pointer_int_sum (PLUS_EXPR
, op0
, op1
);
3010 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
3011 return cp_pointer_int_sum (PLUS_EXPR
, op1
, op0
);
3017 /* Subtraction of two similar pointers.
3018 We must subtract them as integers, then divide by object size. */
3019 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3020 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3022 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
3023 /* Handle pointer minus int. Just like pointer plus int. */
3024 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3025 return cp_pointer_int_sum (MINUS_EXPR
, op0
, op1
);
3034 case TRUNC_DIV_EXPR
:
3036 case FLOOR_DIV_EXPR
:
3037 case ROUND_DIV_EXPR
:
3038 case EXACT_DIV_EXPR
:
3039 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3040 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3041 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3042 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3044 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
3045 warning (OPT_Wdiv_by_zero
, "division by zero in %<%E / 0%>", op0
);
3046 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
3047 warning (OPT_Wdiv_by_zero
, "division by zero in %<%E / 0.%>", op0
);
3049 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3050 code0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3051 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
3052 code1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3054 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
3055 resultcode
= RDIV_EXPR
;
3057 /* When dividing two signed integers, we have to promote to int.
3058 unless we divide by a constant != -1. Note that default
3059 conversion will have been performed on the operands at this
3060 point, so we have to dig out the original type to find out if
3062 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3063 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3064 || (TREE_CODE (op1
) == INTEGER_CST
3065 && ! integer_all_onesp (op1
)));
3074 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3075 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
))
3079 case TRUNC_MOD_EXPR
:
3080 case FLOOR_MOD_EXPR
:
3081 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
3082 warning (OPT_Wdiv_by_zero
, "division by zero in %<%E %% 0%>", op0
);
3083 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
3084 warning (OPT_Wdiv_by_zero
, "division by zero in %<%E %% 0.%>", op0
);
3086 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3088 /* Although it would be tempting to shorten always here, that loses
3089 on some targets, since the modulo instruction is undefined if the
3090 quotient can't be represented in the computation mode. We shorten
3091 only if unsigned or if dividing by something we know != -1. */
3092 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3093 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3094 || (TREE_CODE (op1
) == INTEGER_CST
3095 && ! integer_all_onesp (op1
)));
3100 case TRUTH_ANDIF_EXPR
:
3101 case TRUTH_ORIF_EXPR
:
3102 case TRUTH_AND_EXPR
:
3104 result_type
= boolean_type_node
;
3107 /* Shift operations: result has same type as first operand;
3108 always convert second operand to int.
3109 Also set SHORT_SHIFT if shifting rightward. */
3112 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3114 result_type
= type0
;
3115 if (TREE_CODE (op1
) == INTEGER_CST
)
3117 if (tree_int_cst_lt (op1
, integer_zero_node
))
3118 warning (0, "right shift count is negative");
3121 if (! integer_zerop (op1
))
3123 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3124 warning (0, "right shift count >= width of type");
3127 /* Convert the shift-count to an integer, regardless of
3128 size of value being shifted. */
3129 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3130 op1
= cp_convert (integer_type_node
, op1
);
3131 /* Avoid converting op1 to result_type later. */
3137 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3139 result_type
= type0
;
3140 if (TREE_CODE (op1
) == INTEGER_CST
)
3142 if (tree_int_cst_lt (op1
, integer_zero_node
))
3143 warning (0, "left shift count is negative");
3144 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3145 warning (0, "left shift count >= width of type");
3147 /* Convert the shift-count to an integer, regardless of
3148 size of value being shifted. */
3149 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3150 op1
= cp_convert (integer_type_node
, op1
);
3151 /* Avoid converting op1 to result_type later. */
3158 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3160 result_type
= type0
;
3161 if (TREE_CODE (op1
) == INTEGER_CST
)
3163 if (tree_int_cst_lt (op1
, integer_zero_node
))
3164 warning (0, "%s rotate count is negative",
3165 (code
== LROTATE_EXPR
) ? "left" : "right");
3166 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3167 warning (0, "%s rotate count >= width of type",
3168 (code
== LROTATE_EXPR
) ? "left" : "right");
3170 /* Convert the shift-count to an integer, regardless of
3171 size of value being shifted. */
3172 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3173 op1
= cp_convert (integer_type_node
, op1
);
3179 if (code0
== REAL_TYPE
|| code1
== REAL_TYPE
)
3180 warning (OPT_Wfloat_equal
,
3181 "comparing floating point with == or != is unsafe");
3182 if ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3183 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
)))
3184 warning (OPT_Wstring_literal_comparison
,
3185 "comparison with string literal");
3187 build_type
= boolean_type_node
;
3188 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3189 || code0
== COMPLEX_TYPE
)
3190 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3191 || code1
== COMPLEX_TYPE
))
3193 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3194 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3195 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3197 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3198 && null_ptr_cst_p (op1
))
3199 result_type
= type0
;
3200 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3201 && null_ptr_cst_p (op0
))
3202 result_type
= type1
;
3203 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3205 result_type
= type0
;
3206 error ("ISO C++ forbids comparison between pointer and integer");
3208 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3210 result_type
= type1
;
3211 error ("ISO C++ forbids comparison between pointer and integer");
3213 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3215 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3216 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3217 result_type
= TREE_TYPE (op0
);
3219 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3220 return cp_build_binary_op (code
, op1
, op0
);
3221 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3222 && same_type_p (type0
, type1
))
3224 /* E will be the final comparison. */
3226 /* E1 and E2 are for scratch. */
3234 if (TREE_SIDE_EFFECTS (op0
))
3235 op0
= save_expr (op0
);
3236 if (TREE_SIDE_EFFECTS (op1
))
3237 op1
= save_expr (op1
);
3242 && (!op0.pfn || op0.delta == op1.delta))
3244 The reason for the `!op0.pfn' bit is that a NULL
3245 pointer-to-member is any member with a zero PFN; the
3246 DELTA field is unspecified. */
3247 pfn0
= pfn_from_ptrmemfunc (op0
);
3248 pfn1
= pfn_from_ptrmemfunc (op1
);
3249 delta0
= build_ptrmemfunc_access_expr (op0
,
3251 delta1
= build_ptrmemfunc_access_expr (op1
,
3253 e1
= cp_build_binary_op (EQ_EXPR
, delta0
, delta1
);
3254 e2
= cp_build_binary_op (EQ_EXPR
,
3256 cp_convert (TREE_TYPE (pfn0
),
3257 integer_zero_node
));
3258 e1
= cp_build_binary_op (TRUTH_ORIF_EXPR
, e1
, e2
);
3259 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
3260 e
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, e2
, e1
);
3261 if (code
== EQ_EXPR
)
3263 return cp_build_binary_op (EQ_EXPR
, e
, integer_zero_node
);
3267 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
3268 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
3270 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
3271 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
3279 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3280 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3282 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3283 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3291 if (TREE_CODE (orig_op0
) == STRING_CST
3292 || TREE_CODE (orig_op1
) == STRING_CST
)
3293 warning (OPT_Wstring_literal_comparison
,
3294 "comparison with string literal");
3296 build_type
= boolean_type_node
;
3297 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3298 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3300 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3301 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3303 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3304 && integer_zerop (op1
))
3305 result_type
= type0
;
3306 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3307 && integer_zerop (op0
))
3308 result_type
= type1
;
3309 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3311 result_type
= type0
;
3312 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3314 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3316 result_type
= type1
;
3317 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3321 case UNORDERED_EXPR
:
3328 build_type
= integer_type_node
;
3329 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
3331 error ("unordered comparison on non-floating point argument");
3332 return error_mark_node
;
3341 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3342 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3343 || code1
== COMPLEX_TYPE
)))
3344 arithmetic_types_p
= 1;
3347 arithmetic_types_p
= 0;
3348 /* Vector arithmetic is only allowed when both sides are vectors. */
3349 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
3351 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
3352 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
3355 binary_op_error (code
);
3356 return error_mark_node
;
3358 arithmetic_types_p
= 1;
3361 /* Determine the RESULT_TYPE, if it is not already known. */
3363 && arithmetic_types_p
3364 && (shorten
|| common
|| short_compare
))
3365 result_type
= common_type (type0
, type1
);
3369 error ("invalid operands of types %qT and %qT to binary %qO",
3370 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
3371 return error_mark_node
;
3374 /* If we're in a template, the only thing we need to know is the
3376 if (processing_template_decl
)
3377 return build2 (resultcode
,
3378 build_type
? build_type
: result_type
,
3381 if (arithmetic_types_p
)
3383 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3385 /* For certain operations (which identify themselves by shorten != 0)
3386 if both args were extended from the same smaller type,
3387 do the arithmetic in that type and then extend.
3389 shorten !=0 and !=1 indicates a bitwise operation.
3390 For them, this optimization is safe only if
3391 both args are zero-extended or both are sign-extended.
3392 Otherwise, we might change the result.
3393 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3394 but calculated in (unsigned short) it would be (unsigned short)-1. */
3396 if (shorten
&& none_complex
)
3398 int unsigned0
, unsigned1
;
3399 tree arg0
= get_narrower (op0
, &unsigned0
);
3400 tree arg1
= get_narrower (op1
, &unsigned1
);
3401 /* UNS is 1 if the operation to be done is an unsigned one. */
3402 int uns
= TYPE_UNSIGNED (result_type
);
3405 final_type
= result_type
;
3407 /* Handle the case that OP0 does not *contain* a conversion
3408 but it *requires* conversion to FINAL_TYPE. */
3410 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3411 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3412 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3413 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3415 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3417 /* For bitwise operations, signedness of nominal type
3418 does not matter. Consider only how operands were extended. */
3422 /* Note that in all three cases below we refrain from optimizing
3423 an unsigned operation on sign-extended args.
3424 That would not be valid. */
3426 /* Both args variable: if both extended in same way
3427 from same width, do it in that width.
3428 Do it unsigned if args were zero-extended. */
3429 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3430 < TYPE_PRECISION (result_type
))
3431 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3432 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3433 && unsigned0
== unsigned1
3434 && (unsigned0
|| !uns
))
3435 result_type
= c_common_signed_or_unsigned_type
3436 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
3437 else if (TREE_CODE (arg0
) == INTEGER_CST
3438 && (unsigned1
|| !uns
)
3439 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3440 < TYPE_PRECISION (result_type
))
3441 && (type
= c_common_signed_or_unsigned_type
3442 (unsigned1
, TREE_TYPE (arg1
)),
3443 int_fits_type_p (arg0
, type
)))
3445 else if (TREE_CODE (arg1
) == INTEGER_CST
3446 && (unsigned0
|| !uns
)
3447 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3448 < TYPE_PRECISION (result_type
))
3449 && (type
= c_common_signed_or_unsigned_type
3450 (unsigned0
, TREE_TYPE (arg0
)),
3451 int_fits_type_p (arg1
, type
)))
3455 /* Shifts can be shortened if shifting right. */
3460 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3462 final_type
= result_type
;
3464 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3465 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3467 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3468 /* We can shorten only if the shift count is less than the
3469 number of bits in the smaller type size. */
3470 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
3471 /* If arg is sign-extended and then unsigned-shifted,
3472 we can simulate this with a signed shift in arg's type
3473 only if the extended result is at least twice as wide
3474 as the arg. Otherwise, the shift could use up all the
3475 ones made by sign-extension and bring in zeros.
3476 We can't optimize that case at all, but in most machines
3477 it never happens because available widths are 2**N. */
3478 && (!TYPE_UNSIGNED (final_type
)
3480 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3481 <= TYPE_PRECISION (result_type
))))
3483 /* Do an unsigned shift if the operand was zero-extended. */
3485 = c_common_signed_or_unsigned_type (unsigned_arg
,
3487 /* Convert value-to-be-shifted to that type. */
3488 if (TREE_TYPE (op0
) != result_type
)
3489 op0
= cp_convert (result_type
, op0
);
3494 /* Comparison operations are shortened too but differently.
3495 They identify themselves by setting short_compare = 1. */
3499 /* Don't write &op0, etc., because that would prevent op0
3500 from being kept in a register.
3501 Instead, make copies of the our local variables and
3502 pass the copies by reference, then copy them back afterward. */
3503 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3504 enum tree_code xresultcode
= resultcode
;
3506 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3508 return cp_convert (boolean_type_node
, val
);
3509 op0
= xop0
, op1
= xop1
;
3511 resultcode
= xresultcode
;
3514 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
3515 && warn_sign_compare
3516 /* Do not warn until the template is instantiated; we cannot
3517 bound the ranges of the arguments until that point. */
3518 && !processing_template_decl
)
3520 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
3521 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3523 int unsignedp0
, unsignedp1
;
3524 tree primop0
= get_narrower (op0
, &unsignedp0
);
3525 tree primop1
= get_narrower (op1
, &unsignedp1
);
3527 /* Check for comparison of different enum types. */
3528 if (TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3529 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3530 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3531 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3533 warning (0, "comparison between types %q#T and %q#T",
3534 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3537 /* Give warnings for comparisons between signed and unsigned
3538 quantities that may fail. */
3539 /* Do the checking based on the original operand trees, so that
3540 casts will be considered, but default promotions won't be. */
3542 /* Do not warn if the comparison is being done in a signed type,
3543 since the signed type will only be chosen if it can represent
3544 all the values of the unsigned type. */
3545 if (!TYPE_UNSIGNED (result_type
))
3547 /* Do not warn if both operands are unsigned. */
3548 else if (op0_signed
== op1_signed
)
3550 /* Do not warn if the signed quantity is an unsuffixed
3551 integer literal (or some static constant expression
3552 involving such literals or a conditional expression
3553 involving such literals) and it is non-negative. */
3554 else if ((op0_signed
&& tree_expr_nonnegative_p (orig_op0
))
3555 || (op1_signed
&& tree_expr_nonnegative_p (orig_op1
)))
3557 /* Do not warn if the comparison is an equality operation,
3558 the unsigned quantity is an integral constant and it does
3559 not use the most significant bit of result_type. */
3560 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3561 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3562 && int_fits_type_p (orig_op1
, c_common_signed_type
3564 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3565 && int_fits_type_p (orig_op0
, c_common_signed_type
3569 warning (0, "comparison between signed and unsigned integer expressions");
3571 /* Warn if two unsigned values are being compared in a size
3572 larger than their original size, and one (and only one) is the
3573 result of a `~' operator. This comparison will always fail.
3575 Also warn if one operand is a constant, and the constant does not
3576 have all bits set that are set in the ~ operand when it is
3579 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3580 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3582 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3583 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3584 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3585 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3587 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
3590 HOST_WIDE_INT constant
, mask
;
3594 if (host_integerp (primop0
, 0))
3597 unsignedp
= unsignedp1
;
3598 constant
= tree_low_cst (primop0
, 0);
3603 unsignedp
= unsignedp0
;
3604 constant
= tree_low_cst (primop1
, 0);
3607 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3608 if (bits
< TYPE_PRECISION (result_type
)
3609 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3611 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3612 if ((mask
& constant
) != mask
)
3613 warning (0, "comparison of promoted ~unsigned with constant");
3616 else if (unsignedp0
&& unsignedp1
3617 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3618 < TYPE_PRECISION (result_type
))
3619 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3620 < TYPE_PRECISION (result_type
)))
3621 warning (0, "comparison of promoted ~unsigned with unsigned");
3626 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3627 Then the expression will be built.
3628 It will be given type FINAL_TYPE if that is nonzero;
3629 otherwise, it will be given type RESULT_TYPE. */
3631 /* Issue warnings about peculiar, but valid, uses of NULL. */
3632 if (/* It's reasonable to use pointer values as operands of &&
3633 and ||, so NULL is no exception. */
3634 !(code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
3635 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
3636 (orig_op0
== null_node
3637 && TREE_CODE (TREE_TYPE (op1
)) != POINTER_TYPE
)
3638 /* Or vice versa. */
3639 || (orig_op1
== null_node
3640 && TREE_CODE (TREE_TYPE (op0
)) != POINTER_TYPE
)
3641 /* Or, both are NULL and the operation was not a comparison. */
3642 || (orig_op0
== null_node
&& orig_op1
== null_node
3643 && code
!= EQ_EXPR
&& code
!= NE_EXPR
)))
3644 /* Some sort of arithmetic operation involving NULL was
3645 performed. Note that pointer-difference and pointer-addition
3646 have already been handled above, and so we don't end up here in
3648 warning (0, "NULL used in arithmetic");
3652 if (TREE_TYPE (op0
) != result_type
)
3653 op0
= cp_convert (result_type
, op0
);
3654 if (TREE_TYPE (op1
) != result_type
)
3655 op1
= cp_convert (result_type
, op1
);
3657 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3658 return error_mark_node
;
3661 if (build_type
== NULL_TREE
)
3662 build_type
= result_type
;
3664 result
= build2 (resultcode
, build_type
, op0
, op1
);
3665 result
= fold_if_not_in_template (result
);
3666 if (final_type
!= 0)
3667 result
= cp_convert (final_type
, result
);
3671 /* Return a tree for the sum or difference (RESULTCODE says which)
3672 of pointer PTROP and integer INTOP. */
3675 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3677 tree res_type
= TREE_TYPE (ptrop
);
3679 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3680 in certain circumstance (when it's valid to do so). So we need
3681 to make sure it's complete. We don't need to check here, if we
3682 can actually complete it at all, as those checks will be done in
3683 pointer_int_sum() anyway. */
3684 complete_type (TREE_TYPE (res_type
));
3686 return pointer_int_sum (resultcode
, ptrop
,
3687 fold_if_not_in_template (intop
));
3690 /* Return a tree for the difference of pointers OP0 and OP1.
3691 The resulting tree has type int. */
3694 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
3697 tree restype
= ptrdiff_type_node
;
3698 tree target_type
= TREE_TYPE (ptrtype
);
3700 if (!complete_type_or_else (target_type
, NULL_TREE
))
3701 return error_mark_node
;
3703 if (pedantic
|| warn_pointer_arith
)
3705 if (TREE_CODE (target_type
) == VOID_TYPE
)
3706 pedwarn ("ISO C++ forbids using pointer of type %<void *%> in subtraction");
3707 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3708 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3709 if (TREE_CODE (target_type
) == METHOD_TYPE
)
3710 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3713 /* First do the subtraction as integers;
3714 then drop through to build the divide operator. */
3716 op0
= cp_build_binary_op (MINUS_EXPR
,
3717 cp_convert (restype
, op0
),
3718 cp_convert (restype
, op1
));
3720 /* This generates an error if op1 is a pointer to an incomplete type. */
3721 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
3722 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3724 op1
= (TYPE_PTROB_P (ptrtype
)
3725 ? size_in_bytes (target_type
)
3726 : integer_one_node
);
3728 /* Do the division. */
3730 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
3731 return fold_if_not_in_template (result
);
3734 /* Construct and perhaps optimize a tree representation
3735 for a unary operation. CODE, a tree_code, specifies the operation
3736 and XARG is the operand. */
3739 build_x_unary_op (enum tree_code code
, tree xarg
)
3741 tree orig_expr
= xarg
;
3745 if (processing_template_decl
)
3747 if (type_dependent_expression_p (xarg
))
3748 return build_min_nt (code
, xarg
, NULL_TREE
);
3750 xarg
= build_non_dependent_expr (xarg
);
3755 /* [expr.unary.op] says:
3757 The address of an object of incomplete type can be taken.
3759 (And is just the ordinary address operator, not an overloaded
3760 "operator &".) However, if the type is a template
3761 specialization, we must complete the type at this point so that
3762 an overloaded "operator &" will be available if required. */
3763 if (code
== ADDR_EXPR
3764 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
3765 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
3766 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
3767 || (TREE_CODE (xarg
) == OFFSET_REF
)))
3768 /* Don't look for a function. */;
3770 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
3771 /*overloaded_p=*/NULL
);
3772 if (!exp
&& code
== ADDR_EXPR
)
3774 /* A pointer to member-function can be formed only by saying
3776 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
3777 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
3779 if (TREE_CODE (xarg
) != OFFSET_REF
3780 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
3782 error ("invalid use of %qE to form a pointer-to-member-function",
3784 if (TREE_CODE (xarg
) != OFFSET_REF
)
3785 inform (" a qualified-id is required");
3786 return error_mark_node
;
3790 error ("parentheses around %qE cannot be used to form a"
3791 " pointer-to-member-function",
3793 PTRMEM_OK_P (xarg
) = 1;
3797 if (TREE_CODE (xarg
) == OFFSET_REF
)
3799 ptrmem
= PTRMEM_OK_P (xarg
);
3801 if (!ptrmem
&& !flag_ms_extensions
3802 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
3804 /* A single non-static member, make sure we don't allow a
3805 pointer-to-member. */
3806 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
3807 TREE_OPERAND (xarg
, 0),
3808 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
3809 PTRMEM_OK_P (xarg
) = ptrmem
;
3812 else if (TREE_CODE (xarg
) == TARGET_EXPR
)
3813 warning (0, "taking address of temporary");
3814 exp
= build_unary_op (ADDR_EXPR
, xarg
, 0);
3817 if (processing_template_decl
&& exp
!= error_mark_node
)
3818 exp
= build_min_non_dep (code
, exp
, orig_expr
,
3819 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
3820 if (TREE_CODE (exp
) == ADDR_EXPR
)
3821 PTRMEM_OK_P (exp
) = ptrmem
;
3825 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
3826 constants, where a null value is represented by an INTEGER_CST of
3830 cp_truthvalue_conversion (tree expr
)
3832 tree type
= TREE_TYPE (expr
);
3833 if (TYPE_PTRMEM_P (type
))
3834 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
3836 return c_common_truthvalue_conversion (expr
);
3839 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
3842 condition_conversion (tree expr
)
3845 if (processing_template_decl
)
3847 t
= perform_implicit_conversion (boolean_type_node
, expr
);
3848 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
3852 /* Return an ADDR_EXPR giving the address of T. This function
3853 attempts no optimizations or simplifications; it is a low-level
3857 build_address (tree t
)
3861 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
3862 return error_mark_node
;
3864 addr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (t
)), t
);
3869 /* Return a NOP_EXPR converting EXPR to TYPE. */
3872 build_nop (tree type
, tree expr
)
3874 if (type
== error_mark_node
|| error_operand_p (expr
))
3876 return build1 (NOP_EXPR
, type
, expr
);
3879 /* C++: Must handle pointers to members.
3881 Perhaps type instantiation should be extended to handle conversion
3882 from aggregates to types we don't yet know we want? (Or are those
3883 cases typically errors which should be reported?)
3885 NOCONVERT nonzero suppresses the default promotions
3886 (such as from short to int). */
3889 build_unary_op (enum tree_code code
, tree xarg
, int noconvert
)
3891 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3894 const char *errstring
= NULL
;
3896 const char *invalid_op_diag
;
3898 if (arg
== error_mark_node
)
3899 return error_mark_node
;
3901 if ((invalid_op_diag
3902 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
3907 error (invalid_op_diag
);
3908 return error_mark_node
;
3913 case UNARY_PLUS_EXPR
:
3916 int flags
= WANT_ARITH
| WANT_ENUM
;
3917 /* Unary plus (but not unary minus) is allowed on pointers. */
3918 if (code
== UNARY_PLUS_EXPR
)
3919 flags
|= WANT_POINTER
;
3920 arg
= build_expr_type_conversion (flags
, arg
, true);
3922 errstring
= (code
== NEGATE_EXPR
3923 ? "wrong type argument to unary minus"
3924 : "wrong type argument to unary plus");
3927 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
3928 arg
= perform_integral_promotions (arg
);
3930 /* Make sure the result is not an lvalue: a unary plus or minus
3931 expression is always a rvalue. */
3938 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3942 arg
= default_conversion (arg
);
3944 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
3946 errstring
= "wrong type argument to bit-complement";
3947 else if (!noconvert
)
3948 arg
= perform_integral_promotions (arg
);
3952 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3953 errstring
= "wrong type argument to abs";
3954 else if (!noconvert
)
3955 arg
= default_conversion (arg
);
3959 /* Conjugating a real value is a no-op, but allow it anyway. */
3960 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3961 errstring
= "wrong type argument to conjugation";
3962 else if (!noconvert
)
3963 arg
= default_conversion (arg
);
3966 case TRUTH_NOT_EXPR
:
3967 arg
= perform_implicit_conversion (boolean_type_node
, arg
);
3968 val
= invert_truthvalue (arg
);
3969 if (arg
!= error_mark_node
)
3971 errstring
= "in argument to unary !";
3978 if (TREE_CODE (arg
) == COMPLEX_CST
)
3979 return TREE_REALPART (arg
);
3980 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3982 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3983 return fold_if_not_in_template (arg
);
3989 if (TREE_CODE (arg
) == COMPLEX_CST
)
3990 return TREE_IMAGPART (arg
);
3991 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3993 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3994 return fold_if_not_in_template (arg
);
3997 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
3999 case PREINCREMENT_EXPR
:
4000 case POSTINCREMENT_EXPR
:
4001 case PREDECREMENT_EXPR
:
4002 case POSTDECREMENT_EXPR
:
4003 /* Handle complex lvalues (when permitted)
4004 by reduction to simpler cases. */
4006 val
= unary_complex_lvalue (code
, arg
);
4010 /* Increment or decrement the real part of the value,
4011 and don't change the imaginary part. */
4012 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4016 arg
= stabilize_reference (arg
);
4017 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
4018 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
4019 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4020 build_unary_op (code
, real
, 1), imag
);
4023 /* Report invalid types. */
4025 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4028 if (code
== PREINCREMENT_EXPR
)
4029 errstring
="no pre-increment operator for type";
4030 else if (code
== POSTINCREMENT_EXPR
)
4031 errstring
="no post-increment operator for type";
4032 else if (code
== PREDECREMENT_EXPR
)
4033 errstring
="no pre-decrement operator for type";
4035 errstring
="no post-decrement operator for type";
4039 /* Report something read-only. */
4041 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4042 || TREE_READONLY (arg
))
4043 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4044 || code
== POSTINCREMENT_EXPR
)
4045 ? "increment" : "decrement"),
4050 tree result_type
= TREE_TYPE (arg
);
4052 arg
= get_unwidened (arg
, 0);
4053 argtype
= TREE_TYPE (arg
);
4055 /* ARM $5.2.5 last annotation says this should be forbidden. */
4056 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4057 pedwarn ("ISO C++ forbids %sing an enum",
4058 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4059 ? "increment" : "decrement");
4061 /* Compute the increment. */
4063 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4065 tree type
= complete_type (TREE_TYPE (argtype
));
4067 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4068 error ("cannot %s a pointer to incomplete type %qT",
4069 ((code
== PREINCREMENT_EXPR
4070 || code
== POSTINCREMENT_EXPR
)
4071 ? "increment" : "decrement"), TREE_TYPE (argtype
));
4072 else if ((pedantic
|| warn_pointer_arith
)
4073 && !TYPE_PTROB_P (argtype
))
4074 pedwarn ("ISO C++ forbids %sing a pointer of type %qT",
4075 ((code
== PREINCREMENT_EXPR
4076 || code
== POSTINCREMENT_EXPR
)
4077 ? "increment" : "decrement"), argtype
);
4078 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4081 inc
= integer_one_node
;
4083 inc
= cp_convert (argtype
, inc
);
4085 /* Handle incrementing a cast-expression. */
4087 switch (TREE_CODE (arg
))
4092 case FIX_TRUNC_EXPR
:
4093 case FIX_FLOOR_EXPR
:
4094 case FIX_ROUND_EXPR
:
4097 tree incremented
, modify
, value
, compound
;
4098 if (! lvalue_p (arg
) && pedantic
)
4099 pedwarn ("cast to non-reference type used as lvalue");
4100 arg
= stabilize_reference (arg
);
4101 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4104 value
= save_expr (arg
);
4105 incremented
= build2 (((code
== PREINCREMENT_EXPR
4106 || code
== POSTINCREMENT_EXPR
)
4107 ? PLUS_EXPR
: MINUS_EXPR
),
4108 argtype
, value
, inc
);
4110 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
4111 compound
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
),
4114 /* Eliminate warning about unused result of + or -. */
4115 TREE_NO_WARNING (compound
) = 1;
4123 /* Complain about anything else that is not a true lvalue. */
4124 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4125 || code
== POSTINCREMENT_EXPR
)
4126 ? lv_increment
: lv_decrement
)))
4127 return error_mark_node
;
4129 /* Forbid using -- on `bool'. */
4130 if (TREE_TYPE (arg
) == boolean_type_node
)
4132 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4134 error ("invalid use of %<--%> on bool variable %qD", arg
);
4135 return error_mark_node
;
4137 val
= boolean_increment (code
, arg
);
4140 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4142 TREE_SIDE_EFFECTS (val
) = 1;
4143 return cp_convert (result_type
, val
);
4147 /* Note that this operation never does default_conversion
4148 regardless of NOCONVERT. */
4150 argtype
= lvalue_type (arg
);
4152 if (TREE_CODE (arg
) == OFFSET_REF
)
4155 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4157 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4158 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4161 else if (pedantic
&& DECL_MAIN_P (arg
))
4163 pedwarn ("ISO C++ forbids taking address of function %<::main%>");
4165 /* Let &* cancel out to simplify resulting code. */
4166 if (TREE_CODE (arg
) == INDIRECT_REF
)
4168 /* We don't need to have `current_class_ptr' wrapped in a
4169 NON_LVALUE_EXPR node. */
4170 if (arg
== current_class_ref
)
4171 return current_class_ptr
;
4173 arg
= TREE_OPERAND (arg
, 0);
4174 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4176 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4177 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4180 /* Don't let this be an lvalue. */
4185 /* Uninstantiated types are all functions. Taking the
4186 address of a function is a no-op, so just return the
4189 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4190 || !IDENTIFIER_OPNAME_P (arg
));
4192 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4193 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4195 /* They're trying to take the address of a unique non-static
4196 member function. This is ill-formed (except in MS-land),
4197 but let's try to DTRT.
4198 Note: We only handle unique functions here because we don't
4199 want to complain if there's a static overload; non-unique
4200 cases will be handled by instantiate_type. But we need to
4201 handle this case here to allow casts on the resulting PMF.
4202 We could defer this in non-MS mode, but it's easier to give
4203 a useful error here. */
4205 /* Inside constant member functions, the `this' pointer
4206 contains an extra const qualifier. TYPE_MAIN_VARIANT
4207 is used here to remove this const from the diagnostics
4208 and the created OFFSET_REF. */
4209 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4210 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4212 if (! flag_ms_extensions
)
4214 tree name
= DECL_NAME (fn
);
4215 if (current_class_type
4216 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4217 /* An expression like &memfn. */
4218 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4219 " or parenthesized non-static member function to form"
4220 " a pointer to member function. Say %<&%T::%D%>",
4223 pedwarn ("ISO C++ forbids taking the address of a bound member"
4224 " function to form a pointer to member function."
4228 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
4232 if (type_unknown_p (arg
))
4233 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4235 /* Handle complex lvalues (when permitted)
4236 by reduction to simpler cases. */
4237 val
= unary_complex_lvalue (code
, arg
);
4241 switch (TREE_CODE (arg
))
4246 case FIX_TRUNC_EXPR
:
4247 case FIX_FLOOR_EXPR
:
4248 case FIX_ROUND_EXPR
:
4250 if (! lvalue_p (arg
) && pedantic
)
4251 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4255 arg
= OVL_CURRENT (arg
);
4259 /* Turn a reference to a non-static data member into a
4260 pointer-to-member. */
4265 if (!PTRMEM_OK_P (arg
))
4266 return build_unary_op (code
, arg
, 0);
4268 t
= TREE_OPERAND (arg
, 1);
4269 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4271 error ("cannot create pointer to reference member %qD", t
);
4272 return error_mark_node
;
4275 type
= build_ptrmem_type (context_for_name_lookup (t
),
4277 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4285 /* Anything not already handled and not a true memory reference
4287 if (TREE_CODE (argtype
) != FUNCTION_TYPE
4288 && TREE_CODE (argtype
) != METHOD_TYPE
4289 && TREE_CODE (arg
) != OFFSET_REF
4290 /* Permit users to take the address of a compound-literal
4291 with sufficient simple elements. */
4292 && !(COMPOUND_LITERAL_P (arg
) && TREE_STATIC (arg
))
4293 && !lvalue_or_else (arg
, lv_addressof
))
4294 return error_mark_node
;
4296 if (argtype
!= error_mark_node
)
4297 argtype
= build_pointer_type (argtype
);
4299 /* In a template, we are processing a non-dependent expression
4300 so we can just form an ADDR_EXPR with the correct type. */
4301 if (processing_template_decl
)
4303 val
= build_address (arg
);
4304 if (TREE_CODE (arg
) == OFFSET_REF
)
4305 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4309 /* If the user has taken the address of the compound literal,
4310 create a variable to contain the value of the literal and
4311 then return the address of that variable. */
4312 if (COMPOUND_LITERAL_P (arg
))
4315 gcc_assert (TREE_STATIC (arg
));
4316 var
= create_temporary_var (TREE_TYPE (arg
));
4317 TREE_STATIC (var
) = 1;
4318 set_compound_literal_name (var
);
4319 initialize_artificial_var (var
, arg
);
4320 arg
= pushdecl (var
);
4321 /* Since each compound literal is unique, pushdecl should
4322 never find a pre-existing variable with the same
4324 gcc_assert (arg
== var
);
4327 if (TREE_CODE (arg
) != COMPONENT_REF
)
4329 val
= build_address (arg
);
4330 if (TREE_CODE (arg
) == OFFSET_REF
)
4331 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
4333 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4335 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4337 /* We can only get here with a single static member
4339 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4340 && DECL_STATIC_FUNCTION_P (fn
));
4342 val
= build_address (fn
);
4343 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4344 /* Do not lose object's side effects. */
4345 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
4346 TREE_OPERAND (arg
, 0), val
);
4348 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4350 error ("attempt to take address of bit-field structure member %qD",
4351 TREE_OPERAND (arg
, 1));
4352 return error_mark_node
;
4356 tree object
= TREE_OPERAND (arg
, 0);
4357 tree field
= TREE_OPERAND (arg
, 1);
4358 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4359 (TREE_TYPE (object
), decl_type_context (field
)));
4360 val
= build_address (arg
);
4363 if (TREE_CODE (argtype
) == POINTER_TYPE
4364 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4366 build_ptrmemfunc_type (argtype
);
4367 val
= build_ptrmemfunc (argtype
, val
, 0,
4368 /*c_cast_p=*/false);
4380 argtype
= TREE_TYPE (arg
);
4381 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
4384 error ("%s", errstring
);
4385 return error_mark_node
;
4388 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4389 for certain kinds of expressions which are not really lvalues
4390 but which we can accept as lvalues.
4392 If ARG is not a kind of expression we can handle, return
4396 unary_complex_lvalue (enum tree_code code
, tree arg
)
4398 /* Inside a template, making these kinds of adjustments is
4399 pointless; we are only concerned with the type of the
4401 if (processing_template_decl
)
4404 /* Handle (a, b) used as an "lvalue". */
4405 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4407 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4408 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4409 TREE_OPERAND (arg
, 0), real_result
);
4412 /* Handle (a ? b : c) used as an "lvalue". */
4413 if (TREE_CODE (arg
) == COND_EXPR
4414 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4415 return rationalize_conditional_expr (code
, arg
);
4417 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4418 if (TREE_CODE (arg
) == MODIFY_EXPR
4419 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4420 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4422 tree lvalue
= TREE_OPERAND (arg
, 0);
4423 if (TREE_SIDE_EFFECTS (lvalue
))
4425 lvalue
= stabilize_reference (lvalue
);
4426 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
4427 lvalue
, TREE_OPERAND (arg
, 1));
4429 return unary_complex_lvalue
4430 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
4433 if (code
!= ADDR_EXPR
)
4436 /* Handle (a = b) used as an "lvalue" for `&'. */
4437 if (TREE_CODE (arg
) == MODIFY_EXPR
4438 || TREE_CODE (arg
) == INIT_EXPR
)
4440 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4441 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4443 TREE_NO_WARNING (arg
) = 1;
4447 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4448 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4449 || TREE_CODE (arg
) == OFFSET_REF
)
4452 /* We permit compiler to make function calls returning
4453 objects of aggregate type look like lvalues. */
4457 if (TREE_CODE (targ
) == SAVE_EXPR
)
4458 targ
= TREE_OPERAND (targ
, 0);
4460 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4462 if (TREE_CODE (arg
) == SAVE_EXPR
)
4465 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4466 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4469 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4470 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4471 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4474 /* Don't let anything else be handled specially. */
4478 /* Mark EXP saying that we need to be able to take the
4479 address of it; it should not be allocated in a register.
4480 Value is true if successful.
4482 C++: we do not allow `current_class_ptr' to be addressable. */
4485 cxx_mark_addressable (tree exp
)
4490 switch (TREE_CODE (x
))
4497 x
= TREE_OPERAND (x
, 0);
4501 if (x
== current_class_ptr
)
4503 error ("cannot take the address of %<this%>, which is an rvalue expression");
4504 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
4510 /* Caller should not be trying to mark initialized
4511 constant fields addressable. */
4512 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
4513 || DECL_IN_AGGR_P (x
) == 0
4515 || DECL_EXTERNAL (x
));
4520 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4521 && !DECL_ARTIFICIAL (x
))
4523 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
4526 ("address of explicit register variable %qD requested", x
);
4529 else if (extra_warnings
)
4531 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
4533 TREE_ADDRESSABLE (x
) = 1;
4537 TREE_ADDRESSABLE (x
) = 1;
4541 TREE_ADDRESSABLE (x
) = 1;
4545 TREE_ADDRESSABLE (x
) = 1;
4546 cxx_mark_addressable (TREE_OPERAND (x
, 0));
4554 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4557 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
)
4559 tree orig_ifexp
= ifexp
;
4560 tree orig_op1
= op1
;
4561 tree orig_op2
= op2
;
4564 if (processing_template_decl
)
4566 /* The standard says that the expression is type-dependent if
4567 IFEXP is type-dependent, even though the eventual type of the
4568 expression doesn't dependent on IFEXP. */
4569 if (type_dependent_expression_p (ifexp
)
4570 /* As a GNU extension, the middle operand may be omitted. */
4571 || (op1
&& type_dependent_expression_p (op1
))
4572 || type_dependent_expression_p (op2
))
4573 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4574 ifexp
= build_non_dependent_expr (ifexp
);
4576 op1
= build_non_dependent_expr (op1
);
4577 op2
= build_non_dependent_expr (op2
);
4580 expr
= build_conditional_expr (ifexp
, op1
, op2
);
4581 if (processing_template_decl
&& expr
!= error_mark_node
)
4582 return build_min_non_dep (COND_EXPR
, expr
,
4583 orig_ifexp
, orig_op1
, orig_op2
);
4587 /* Given a list of expressions, return a compound expression
4588 that performs them all and returns the value of the last of them. */
4590 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
4592 tree expr
= TREE_VALUE (list
);
4594 if (TREE_CHAIN (list
))
4597 pedwarn ("%s expression list treated as compound expression", msg
);
4599 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
4600 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
));
4606 /* Handle overloading of the ',' operator when needed. */
4609 build_x_compound_expr (tree op1
, tree op2
)
4612 tree orig_op1
= op1
;
4613 tree orig_op2
= op2
;
4615 if (processing_template_decl
)
4617 if (type_dependent_expression_p (op1
)
4618 || type_dependent_expression_p (op2
))
4619 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
4620 op1
= build_non_dependent_expr (op1
);
4621 op2
= build_non_dependent_expr (op2
);
4624 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
4625 /*overloaded_p=*/NULL
);
4627 result
= build_compound_expr (op1
, op2
);
4629 if (processing_template_decl
&& result
!= error_mark_node
)
4630 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
4635 /* Build a compound expression. */
4638 build_compound_expr (tree lhs
, tree rhs
)
4640 lhs
= convert_to_void (lhs
, "left-hand operand of comma");
4642 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
4643 return error_mark_node
;
4645 if (TREE_CODE (rhs
) == TARGET_EXPR
)
4647 /* If the rhs is a TARGET_EXPR, then build the compound
4648 expression inside the target_expr's initializer. This
4649 helps the compiler to eliminate unnecessary temporaries. */
4650 tree init
= TREE_OPERAND (rhs
, 1);
4652 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
4653 TREE_OPERAND (rhs
, 1) = init
;
4658 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
4661 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
4662 casts away constness. DIAG_FN gives the function to call if we
4663 need to issue a diagnostic; if it is NULL, no diagnostic will be
4664 issued. DESCRIPTION explains what operation is taking place. */
4667 check_for_casting_away_constness (tree src_type
, tree dest_type
,
4668 void (*diag_fn
)(const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2),
4669 const char *description
)
4671 if (diag_fn
&& casts_away_constness (src_type
, dest_type
))
4672 diag_fn ("%s from type %qT to type %qT casts away constness",
4673 description
, src_type
, dest_type
);
4676 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
4677 (another pointer-to-member type in the same hierarchy) and return
4678 the converted expression. If ALLOW_INVERSE_P is permitted, a
4679 pointer-to-derived may be converted to pointer-to-base; otherwise,
4680 only the other direction is permitted. If C_CAST_P is true, this
4681 conversion is taking place as part of a C-style cast. */
4684 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
4687 if (TYPE_PTRMEM_P (type
))
4691 if (TREE_CODE (expr
) == PTRMEM_CST
)
4692 expr
= cplus_expand_constant (expr
);
4693 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
4694 TYPE_PTRMEM_CLASS_TYPE (type
),
4697 if (!integer_zerop (delta
))
4698 expr
= cp_build_binary_op (PLUS_EXPR
,
4699 build_nop (ptrdiff_type_node
, expr
),
4701 return build_nop (type
, expr
);
4704 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
4705 allow_inverse_p
, c_cast_p
);
4708 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
4709 a version of EXPR that has TREE_OVERFLOW and/or TREE_CONSTANT_OVERFLOW
4710 set iff they are set in ORIG. Otherwise, return EXPR unchanged. */
4713 ignore_overflows (tree expr
, tree orig
)
4715 if (TREE_CODE (expr
) == INTEGER_CST
4716 && CONSTANT_CLASS_P (orig
)
4717 && TREE_CODE (orig
) != STRING_CST
4718 && (TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
)
4719 || TREE_CONSTANT_OVERFLOW (expr
)
4720 != TREE_CONSTANT_OVERFLOW (orig
)))
4722 if (!TREE_OVERFLOW (orig
) && !TREE_CONSTANT_OVERFLOW (orig
))
4723 /* Ensure constant sharing. */
4724 expr
= build_int_cst_wide (TREE_TYPE (expr
),
4725 TREE_INT_CST_LOW (expr
),
4726 TREE_INT_CST_HIGH (expr
));
4729 /* Avoid clobbering a shared constant. */
4730 expr
= copy_node (expr
);
4731 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
4732 TREE_CONSTANT_OVERFLOW (expr
)
4733 = TREE_CONSTANT_OVERFLOW (orig
);
4739 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
4740 this static_cast is being attempted as one of the possible casts
4741 allowed by a C-style cast. (In that case, accessibility of base
4742 classes is not considered, and it is OK to cast away
4743 constness.) Return the result of the cast. *VALID_P is set to
4744 indicate whether or not the cast was valid. */
4747 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
4753 void (*diag_fn
)(const char*, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
4756 /* Assume the cast is valid. */
4759 intype
= TREE_TYPE (expr
);
4761 /* Determine what to do when casting away constness. */
4764 /* C-style casts are allowed to cast away constness. With
4765 WARN_CAST_QUAL, we still want to issue a warning. */
4766 diag_fn
= warn_cast_qual
? warning0
: NULL
;
4771 /* A static_cast may not cast away constness. */
4773 desc
= "static_cast";
4776 /* [expr.static.cast]
4778 An lvalue of type "cv1 B", where B is a class type, can be cast
4779 to type "reference to cv2 D", where D is a class derived (clause
4780 _class.derived_) from B, if a valid standard conversion from
4781 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
4782 same cv-qualification as, or greater cv-qualification than, cv1,
4783 and B is not a virtual base class of D. */
4784 /* We check this case before checking the validity of "TYPE t =
4785 EXPR;" below because for this case:
4788 struct D : public B { D(const B&); };
4790 void f() { static_cast<const D&>(b); }
4792 we want to avoid constructing a new D. The standard is not
4793 completely clear about this issue, but our interpretation is
4794 consistent with other compilers. */
4795 if (TREE_CODE (type
) == REFERENCE_TYPE
4796 && CLASS_TYPE_P (TREE_TYPE (type
))
4797 && CLASS_TYPE_P (intype
)
4798 && real_lvalue_p (expr
)
4799 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
4800 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
4801 build_pointer_type (TYPE_MAIN_VARIANT
4802 (TREE_TYPE (type
))))
4804 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
4808 /* There is a standard conversion from "D*" to "B*" even if "B"
4809 is ambiguous or inaccessible. If this is really a
4810 static_cast, then we check both for inaccessibility and
4811 ambiguity. However, if this is a static_cast being performed
4812 because the user wrote a C-style cast, then accessibility is
4814 base
= lookup_base (TREE_TYPE (type
), intype
,
4815 c_cast_p
? ba_unique
: ba_check
,
4818 /* Convert from "B*" to "D*". This function will check that "B"
4819 is not a virtual base of "D". */
4820 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
4821 base
, /*nonnull=*/false);
4822 /* Convert the pointer to a reference -- but then remember that
4823 there are no expressions with reference type in C++. */
4824 return convert_from_reference (build_nop (type
, expr
));
4829 /* [expr.static.cast]
4831 An expression e can be explicitly converted to a type T using a
4832 static_cast of the form static_cast<T>(e) if the declaration T
4833 t(e);" is well-formed, for some invented temporary variable
4835 result
= perform_direct_initialization_if_possible (type
, expr
,
4839 result
= convert_from_reference (result
);
4841 /* Ignore any integer overflow caused by the cast. */
4842 result
= ignore_overflows (result
, orig
);
4844 /* [expr.static.cast]
4846 If T is a reference type, the result is an lvalue; otherwise,
4847 the result is an rvalue. */
4848 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4849 result
= rvalue (result
);
4853 /* [expr.static.cast]
4855 Any expression can be explicitly converted to type cv void. */
4856 if (TREE_CODE (type
) == VOID_TYPE
)
4857 return convert_to_void (expr
, /*implicit=*/NULL
);
4859 /* [expr.static.cast]
4861 The inverse of any standard conversion sequence (clause _conv_),
4862 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
4863 (_conv.array_), function-to-pointer (_conv.func_), and boolean
4864 (_conv.bool_) conversions, can be performed explicitly using
4865 static_cast subject to the restriction that the explicit
4866 conversion does not cast away constness (_expr.const.cast_), and
4867 the following additional rules for specific cases: */
4868 /* For reference, the conversions not excluded are: integral
4869 promotions, floating point promotion, integral conversions,
4870 floating point conversions, floating-integral conversions,
4871 pointer conversions, and pointer to member conversions. */
4874 A value of integral _or enumeration_ type can be explicitly
4875 converted to an enumeration type. */
4876 /* The effect of all that is that any conversion between any two
4877 types which are integral, floating, or enumeration types can be
4879 if ((INTEGRAL_TYPE_P (type
) || SCALAR_FLOAT_TYPE_P (type
))
4880 && (INTEGRAL_TYPE_P (intype
) || SCALAR_FLOAT_TYPE_P (intype
)))
4882 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
4884 /* Ignore any integer overflow caused by the cast. */
4885 expr
= ignore_overflows (expr
, orig
);
4889 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
4890 && CLASS_TYPE_P (TREE_TYPE (type
))
4891 && CLASS_TYPE_P (TREE_TYPE (intype
))
4892 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
4893 (TREE_TYPE (intype
))),
4894 build_pointer_type (TYPE_MAIN_VARIANT
4895 (TREE_TYPE (type
)))))
4900 check_for_casting_away_constness (intype
, type
, diag_fn
, desc
);
4901 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
4902 c_cast_p
? ba_unique
: ba_check
,
4904 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
4907 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4908 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
4915 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
4916 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
4918 if (TYPE_PTRMEM_P (type
))
4920 t1
= (build_ptrmem_type
4922 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
4923 t2
= (build_ptrmem_type
4925 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
4932 if (can_convert (t1
, t2
))
4935 check_for_casting_away_constness (intype
, type
, diag_fn
,
4937 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
4942 /* [expr.static.cast]
4944 An rvalue of type "pointer to cv void" can be explicitly
4945 converted to a pointer to object type. A value of type pointer
4946 to object converted to "pointer to cv void" and back to the
4947 original pointer type will have its original value. */
4948 if (TREE_CODE (intype
) == POINTER_TYPE
4949 && VOID_TYPE_P (TREE_TYPE (intype
))
4950 && TYPE_PTROB_P (type
))
4953 check_for_casting_away_constness (intype
, type
, diag_fn
, desc
);
4954 return build_nop (type
, expr
);
4958 return error_mark_node
;
4961 /* Return an expression representing static_cast<TYPE>(EXPR). */
4964 build_static_cast (tree type
, tree expr
)
4969 if (type
== error_mark_node
|| expr
== error_mark_node
)
4970 return error_mark_node
;
4972 if (processing_template_decl
)
4974 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
4975 /* We don't know if it will or will not have side effects. */
4976 TREE_SIDE_EFFECTS (expr
) = 1;
4977 return convert_from_reference (expr
);
4980 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4981 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4982 if (TREE_CODE (type
) != REFERENCE_TYPE
4983 && TREE_CODE (expr
) == NOP_EXPR
4984 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4985 expr
= TREE_OPERAND (expr
, 0);
4987 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
);
4991 error ("invalid static_cast from type %qT to type %qT",
4992 TREE_TYPE (expr
), type
);
4993 return error_mark_node
;
4996 /* EXPR is an expression with member function or pointer-to-member
4997 function type. TYPE is a pointer type. Converting EXPR to TYPE is
4998 not permitted by ISO C++, but we accept it in some modes. If we
4999 are not in one of those modes, issue a diagnostic. Return the
5000 converted expression. */
5003 convert_member_func_to_ptr (tree type
, tree expr
)
5008 intype
= TREE_TYPE (expr
);
5009 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5010 || TREE_CODE (intype
) == METHOD_TYPE
);
5012 if (pedantic
|| warn_pmf2ptr
)
5013 pedwarn ("converting from %qT to %qT", intype
, type
);
5015 if (TREE_CODE (intype
) == METHOD_TYPE
)
5016 expr
= build_addr_func (expr
);
5017 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5018 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5021 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5022 decl
= build_address (decl
);
5023 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5026 return build_nop (type
, expr
);
5029 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5030 If C_CAST_P is true, this reinterpret cast is being done as part of
5031 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5032 indicate whether or not reinterpret_cast was valid. */
5035 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5040 /* Assume the cast is invalid. */
5044 if (type
== error_mark_node
|| error_operand_p (expr
))
5045 return error_mark_node
;
5047 intype
= TREE_TYPE (expr
);
5049 /* [expr.reinterpret.cast]
5050 An lvalue expression of type T1 can be cast to the type
5051 "reference to T2" if an expression of type "pointer to T1" can be
5052 explicitly converted to the type "pointer to T2" using a
5053 reinterpret_cast. */
5054 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5056 if (! real_lvalue_p (expr
))
5058 error ("invalid cast of an rvalue expression of type "
5061 return error_mark_node
;
5064 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5065 "B" are related class types; the reinterpret_cast does not
5066 adjust the pointer. */
5067 if (TYPE_PTR_P (intype
)
5068 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
5069 COMPARE_BASE
| COMPARE_DERIVED
)))
5070 warning (0, "casting %qT to %qT does not dereference pointer",
5073 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5074 if (expr
!= error_mark_node
)
5075 expr
= build_reinterpret_cast_1
5076 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
5078 if (expr
!= error_mark_node
)
5079 expr
= build_indirect_ref (expr
, 0);
5083 /* As a G++ extension, we consider conversions from member
5084 functions, and pointers to member functions to
5085 pointer-to-function and pointer-to-void types. If
5086 -Wno-pmf-conversions has not been specified,
5087 convert_member_func_to_ptr will issue an error message. */
5088 if ((TYPE_PTRMEMFUNC_P (intype
)
5089 || TREE_CODE (intype
) == METHOD_TYPE
)
5090 && TYPE_PTR_P (type
)
5091 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
5092 || VOID_TYPE_P (TREE_TYPE (type
))))
5093 return convert_member_func_to_ptr (type
, expr
);
5095 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5096 array-to-pointer, and function-to-pointer conversions are
5098 expr
= decay_conversion (expr
);
5100 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5101 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5102 if (TREE_CODE (expr
) == NOP_EXPR
5103 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5104 expr
= TREE_OPERAND (expr
, 0);
5106 if (error_operand_p (expr
))
5107 return error_mark_node
;
5109 intype
= TREE_TYPE (expr
);
5111 /* [expr.reinterpret.cast]
5112 A pointer can be converted to any integral type large enough to
5114 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
5116 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5117 pedwarn ("cast from %qT to %qT loses precision",
5120 /* [expr.reinterpret.cast]
5121 A value of integral or enumeration type can be explicitly
5122 converted to a pointer. */
5123 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
5126 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5127 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5128 return fold_if_not_in_template (build_nop (type
, expr
));
5129 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5130 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5135 check_for_casting_away_constness (intype
, type
, error
,
5136 "reinterpret_cast");
5137 /* Warn about possible alignment problems. */
5138 if (STRICT_ALIGNMENT
&& warn_cast_align
5139 && !VOID_TYPE_P (type
)
5140 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
5141 && COMPLETE_TYPE_P (TREE_TYPE (type
))
5142 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
5143 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
5144 warning (0, "cast from %qT to %qT increases required alignment of "
5148 /* We need to strip nops here, because the frontend likes to
5149 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5151 strict_aliasing_warning (intype
, type
, sexpr
);
5153 return fold_if_not_in_template (build_nop (type
, expr
));
5155 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
5156 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
5159 /* Only issue a warning, as we have always supported this
5160 where possible, and it is necessary in some cases. DR 195
5161 addresses this issue, but as of 2004/10/26 is still in
5163 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5164 return fold_if_not_in_template (build_nop (type
, expr
));
5166 else if (TREE_CODE (type
) == VECTOR_TYPE
)
5167 return fold_if_not_in_template (convert_to_vector (type
, expr
));
5168 else if (TREE_CODE (intype
) == VECTOR_TYPE
)
5169 return fold_if_not_in_template (convert_to_integer (type
, expr
));
5174 error ("invalid cast from type %qT to type %qT", intype
, type
);
5175 return error_mark_node
;
5178 return cp_convert (type
, expr
);
5182 build_reinterpret_cast (tree type
, tree expr
)
5184 if (type
== error_mark_node
|| expr
== error_mark_node
)
5185 return error_mark_node
;
5187 if (processing_template_decl
)
5189 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
5191 if (!TREE_SIDE_EFFECTS (t
)
5192 && type_dependent_expression_p (expr
))
5193 /* There might turn out to be side effects inside expr. */
5194 TREE_SIDE_EFFECTS (t
) = 1;
5195 return convert_from_reference (t
);
5198 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
5202 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5203 return an appropriate expression. Otherwise, return
5204 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5205 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5206 performing a C-style cast, its value upon return will indicate
5207 whether or not the conversion succeeded. */
5210 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
5214 tree reference_type
;
5216 /* Callers are responsible for handling error_mark_node as a
5217 destination type. */
5218 gcc_assert (dst_type
!= error_mark_node
);
5219 /* In a template, callers should be building syntactic
5220 representations of casts, not using this machinery. */
5221 gcc_assert (!processing_template_decl
);
5223 /* Assume the conversion is invalid. */
5227 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
5230 error ("invalid use of const_cast with type %qT, "
5231 "which is not a pointer, "
5232 "reference, nor a pointer-to-data-member type", dst_type
);
5233 return error_mark_node
;
5236 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
5239 error ("invalid use of const_cast with type %qT, which is a pointer "
5240 "or reference to a function type", dst_type
);
5241 return error_mark_node
;
5244 src_type
= TREE_TYPE (expr
);
5245 /* Expressions do not really have reference types. */
5246 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
5247 src_type
= TREE_TYPE (src_type
);
5249 /* [expr.const.cast]
5251 An lvalue of type T1 can be explicitly converted to an lvalue of
5252 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5253 types) if a pointer to T1 can be explicitly converted to the type
5254 pointer to T2 using a const_cast. */
5255 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
5257 reference_type
= dst_type
;
5258 if (! real_lvalue_p (expr
))
5261 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5262 src_type
, dst_type
);
5263 return error_mark_node
;
5265 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
5266 src_type
= build_pointer_type (src_type
);
5270 reference_type
= NULL_TREE
;
5271 /* If the destination type is not a reference type, the
5272 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5273 conversions are performed. */
5274 src_type
= type_decays_to (src_type
);
5275 if (src_type
== error_mark_node
)
5276 return error_mark_node
;
5279 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
5280 && comp_ptr_ttypes_const (dst_type
, src_type
))
5285 /* This cast is actually a C-style cast. Issue a warning if
5286 the user is making a potentially unsafe cast. */
5288 check_for_casting_away_constness (src_type
, dst_type
,
5294 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5295 expr
= build_nop (reference_type
, expr
);
5296 return convert_from_reference (expr
);
5300 expr
= decay_conversion (expr
);
5301 /* build_c_cast puts on a NOP_EXPR to make the result not an
5302 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5303 non-lvalue context. */
5304 if (TREE_CODE (expr
) == NOP_EXPR
5305 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5306 expr
= TREE_OPERAND (expr
, 0);
5307 return build_nop (dst_type
, expr
);
5312 error ("invalid const_cast from type %qT to type %qT",
5313 src_type
, dst_type
);
5314 return error_mark_node
;
5318 build_const_cast (tree type
, tree expr
)
5320 if (type
== error_mark_node
|| error_operand_p (expr
))
5321 return error_mark_node
;
5323 if (processing_template_decl
)
5325 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
5327 if (!TREE_SIDE_EFFECTS (t
)
5328 && type_dependent_expression_p (expr
))
5329 /* There might turn out to be side effects inside expr. */
5330 TREE_SIDE_EFFECTS (t
) = 1;
5331 return convert_from_reference (t
);
5334 return build_const_cast_1 (type
, expr
, /*complain=*/true,
5338 /* Build an expression representing an explicit C-style cast to type
5339 TYPE of expression EXPR. */
5342 build_c_cast (tree type
, tree expr
)
5348 if (type
== error_mark_node
|| error_operand_p (expr
))
5349 return error_mark_node
;
5351 if (processing_template_decl
)
5353 tree t
= build_min (CAST_EXPR
, type
,
5354 tree_cons (NULL_TREE
, value
, NULL_TREE
));
5355 /* We don't know if it will or will not have side effects. */
5356 TREE_SIDE_EFFECTS (t
) = 1;
5357 return convert_from_reference (t
);
5360 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5361 'Class') should always be retained, because this information aids
5362 in method lookup. */
5363 if (objc_is_object_ptr (type
)
5364 && objc_is_object_ptr (TREE_TYPE (expr
)))
5365 return build_nop (type
, expr
);
5367 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5368 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5369 if (TREE_CODE (type
) != REFERENCE_TYPE
5370 && TREE_CODE (value
) == NOP_EXPR
5371 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5372 value
= TREE_OPERAND (value
, 0);
5374 if (TREE_CODE (type
) == ARRAY_TYPE
)
5376 /* Allow casting from T1* to T2[] because Cfront allows it.
5377 NIHCL uses it. It is not valid ISO C++ however. */
5378 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5380 pedwarn ("ISO C++ forbids casting to an array type %qT", type
);
5381 type
= build_pointer_type (TREE_TYPE (type
));
5385 error ("ISO C++ forbids casting to an array type %qT", type
);
5386 return error_mark_node
;
5390 if (TREE_CODE (type
) == FUNCTION_TYPE
5391 || TREE_CODE (type
) == METHOD_TYPE
)
5393 error ("invalid cast to function type %qT", type
);
5394 return error_mark_node
;
5397 /* A C-style cast can be a const_cast. */
5398 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
5403 /* Or a static cast. */
5404 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
5406 /* Or a reinterpret_cast. */
5408 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
5410 /* The static_cast or reinterpret_cast may be followed by a
5413 /* A valid cast may result in errors if, for example, a
5414 conversion to am ambiguous base class is required. */
5415 && !error_operand_p (result
))
5419 /* Non-class rvalues always have cv-unqualified type. */
5420 if (!CLASS_TYPE_P (type
))
5421 type
= TYPE_MAIN_VARIANT (type
);
5422 result_type
= TREE_TYPE (result
);
5423 if (!CLASS_TYPE_P (result_type
))
5424 result_type
= TYPE_MAIN_VARIANT (result_type
);
5425 /* If the type of RESULT does not match TYPE, perform a
5426 const_cast to make it match. If the static_cast or
5427 reinterpret_cast succeeded, we will differ by at most
5428 cv-qualification, so the follow-on const_cast is guaranteed
5430 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
5432 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
5433 gcc_assert (valid_p
);
5438 return error_mark_node
;
5441 /* Build an assignment expression of lvalue LHS from value RHS.
5442 MODIFYCODE is the code for a binary operator that we use
5443 to combine the old value of LHS with RHS to get the new value.
5444 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5446 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5449 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5453 tree lhstype
= TREE_TYPE (lhs
);
5454 tree olhstype
= lhstype
;
5455 tree olhs
= NULL_TREE
;
5456 bool plain_assign
= (modifycode
== NOP_EXPR
);
5458 /* Avoid duplicate error messages from operands that had errors. */
5459 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5460 return error_mark_node
;
5462 /* Handle control structure constructs used as "lvalues". */
5463 switch (TREE_CODE (lhs
))
5465 /* Handle --foo = 5; as these are valid constructs in C++. */
5466 case PREDECREMENT_EXPR
:
5467 case PREINCREMENT_EXPR
:
5468 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5469 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5470 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5471 TREE_OPERAND (lhs
, 1));
5472 return build2 (COMPOUND_EXPR
, lhstype
,
5474 build_modify_expr (TREE_OPERAND (lhs
, 0),
5477 /* Handle (a, b) used as an "lvalue". */
5479 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5481 if (newrhs
== error_mark_node
)
5482 return error_mark_node
;
5483 return build2 (COMPOUND_EXPR
, lhstype
,
5484 TREE_OPERAND (lhs
, 0), newrhs
);
5487 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5488 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5489 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5490 TREE_OPERAND (lhs
, 1));
5491 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5492 if (newrhs
== error_mark_node
)
5493 return error_mark_node
;
5494 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5498 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5499 when neither operand has side-effects. */
5500 if (!lvalue_or_else (lhs
, lv_assign
))
5501 return error_mark_node
;
5503 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
5504 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
5506 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
5507 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
5509 TREE_OPERAND (lhs
, 0),
5510 TREE_OPERAND (lhs
, 1)),
5511 TREE_OPERAND (lhs
, 0),
5512 TREE_OPERAND (lhs
, 1));
5515 /* Handle (a ? b : c) used as an "lvalue". */
5518 /* Produce (a ? (b = rhs) : (c = rhs))
5519 except that the RHS goes through a save-expr
5520 so the code to compute it is only emitted once. */
5522 tree preeval
= NULL_TREE
;
5524 rhs
= stabilize_expr (rhs
, &preeval
);
5526 /* Check this here to avoid odd errors when trying to convert
5527 a throw to the type of the COND_EXPR. */
5528 if (!lvalue_or_else (lhs
, lv_assign
))
5529 return error_mark_node
;
5531 cond
= build_conditional_expr
5532 (TREE_OPERAND (lhs
, 0),
5533 build_modify_expr (TREE_OPERAND (lhs
, 1),
5535 build_modify_expr (TREE_OPERAND (lhs
, 2),
5538 if (cond
== error_mark_node
)
5540 /* Make sure the code to compute the rhs comes out
5541 before the split. */
5543 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
5551 if (modifycode
== INIT_EXPR
)
5553 if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5555 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
5556 /* Call convert to generate an error; see PR 11063. */
5557 rhs
= convert (lhstype
, rhs
);
5558 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
5559 TREE_SIDE_EFFECTS (result
) = 1;
5562 else if (! IS_AGGR_TYPE (lhstype
))
5563 /* Do the default thing. */;
5566 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
5567 build_tree_list (NULL_TREE
, rhs
),
5568 lhstype
, LOOKUP_NORMAL
);
5569 if (result
== NULL_TREE
)
5570 return error_mark_node
;
5576 lhs
= require_complete_type (lhs
);
5577 if (lhs
== error_mark_node
)
5578 return error_mark_node
;
5580 if (modifycode
== NOP_EXPR
)
5582 /* `operator=' is not an inheritable operator. */
5583 if (! IS_AGGR_TYPE (lhstype
))
5584 /* Do the default thing. */;
5587 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
5588 lhs
, rhs
, make_node (NOP_EXPR
),
5589 /*overloaded_p=*/NULL
);
5590 if (result
== NULL_TREE
)
5591 return error_mark_node
;
5598 /* A binary op has been requested. Combine the old LHS
5599 value with the RHS producing the value we should actually
5600 store into the LHS. */
5602 gcc_assert (!PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
));
5603 lhs
= stabilize_reference (lhs
);
5604 newrhs
= cp_build_binary_op (modifycode
, lhs
, rhs
);
5605 if (newrhs
== error_mark_node
)
5607 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
5608 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5609 return error_mark_node
;
5612 /* Now it looks like a plain assignment. */
5613 modifycode
= NOP_EXPR
;
5615 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
5616 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
5619 /* The left-hand side must be an lvalue. */
5620 if (!lvalue_or_else (lhs
, lv_assign
))
5621 return error_mark_node
;
5623 /* Warn about modifying something that is `const'. Don't warn if
5624 this is initialization. */
5625 if (modifycode
!= INIT_EXPR
5626 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
5627 /* Functions are not modifiable, even though they are
5629 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
5630 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
5631 /* If it's an aggregate and any field is const, then it is
5632 effectively const. */
5633 || (CLASS_TYPE_P (lhstype
)
5634 && C_TYPE_FIELDS_READONLY (lhstype
))))
5635 readonly_error (lhs
, "assignment", 0);
5637 /* If storing into a structure or union member, it has probably been
5638 given type `int'. Compute the type that would go with the actual
5639 amount of storage the member occupies. */
5641 if (TREE_CODE (lhs
) == COMPONENT_REF
5642 && (TREE_CODE (lhstype
) == INTEGER_TYPE
5643 || TREE_CODE (lhstype
) == REAL_TYPE
5644 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
5646 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
5648 /* If storing in a field that is in actuality a short or narrower
5649 than one, we must store in the field in its actual type. */
5651 if (lhstype
!= TREE_TYPE (lhs
))
5653 /* Avoid warnings converting integral types back into enums for
5655 if (TREE_CODE (lhstype
) == INTEGER_TYPE
5656 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
5658 if (TREE_SIDE_EFFECTS (lhs
))
5659 lhs
= stabilize_reference (lhs
);
5662 lhs
= copy_node (lhs
);
5663 TREE_TYPE (lhs
) = lhstype
;
5667 /* Convert new value to destination type. */
5669 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
5673 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
5674 TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))))
5676 error ("incompatible types in assignment of %qT to %qT",
5677 TREE_TYPE (rhs
), lhstype
);
5678 return error_mark_node
;
5681 /* Allow array assignment in compiler-generated code. */
5682 if (! DECL_ARTIFICIAL (current_function_decl
))
5683 pedwarn ("ISO C++ forbids assignment of arrays");
5685 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5686 ? 1 + (modifycode
!= INIT_EXPR
): 0;
5687 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
5688 /*explicit_default_init_p=*/false,
5692 if (modifycode
== INIT_EXPR
)
5693 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
5694 "initialization", NULL_TREE
, 0);
5697 /* Avoid warnings on enum bit fields. */
5698 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
5699 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
5701 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
5703 newrhs
= convert_force (lhstype
, newrhs
, 0);
5706 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
5708 if (TREE_CODE (newrhs
) == CALL_EXPR
5709 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
5710 newrhs
= build_cplus_new (lhstype
, newrhs
);
5712 /* Can't initialize directly from a TARGET_EXPR, since that would
5713 cause the lhs to be constructed twice, and possibly result in
5714 accidental self-initialization. So we force the TARGET_EXPR to be
5715 expanded without a target. */
5716 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
5717 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
5718 TREE_OPERAND (newrhs
, 0));
5721 if (newrhs
== error_mark_node
)
5722 return error_mark_node
;
5724 if (c_dialect_objc () && flag_objc_gc
)
5726 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
5732 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
5733 lhstype
, lhs
, newrhs
);
5735 TREE_SIDE_EFFECTS (result
) = 1;
5737 TREE_NO_WARNING (result
) = 1;
5739 /* If we got the LHS in a different type for storing in,
5740 convert the result back to the nominal type of LHS
5741 so that the value we return always has the same type
5742 as the LHS argument. */
5744 if (olhstype
== TREE_TYPE (result
))
5748 result
= build2 (COMPOUND_EXPR
, olhstype
, result
, olhs
);
5749 TREE_NO_WARNING (result
) = 1;
5752 return convert_for_assignment (olhstype
, result
, "assignment",
5757 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5759 if (processing_template_decl
)
5760 return build_min_nt (MODOP_EXPR
, lhs
,
5761 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
5763 if (modifycode
!= NOP_EXPR
)
5765 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
5766 make_node (modifycode
),
5767 /*overloaded_p=*/NULL
);
5770 TREE_NO_WARNING (rval
) = 1;
5774 return build_modify_expr (lhs
, modifycode
, rhs
);
5778 /* Get difference in deltas for different pointer to member function
5779 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
5780 the conversion is invalid, the constant is zero. If
5781 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
5782 If C_CAST_P is true this conversion is taking place as part of a
5785 Note that the naming of FROM and TO is kind of backwards; the return
5786 value is what we add to a TO in order to get a FROM. They are named
5787 this way because we call this function to find out how to convert from
5788 a pointer to member of FROM to a pointer to member of TO. */
5791 get_delta_difference (tree from
, tree to
,
5792 bool allow_inverse_p
,
5799 /* Assume no conversion is required. */
5800 result
= integer_zero_node
;
5801 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
5802 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
5803 error (" in pointer to member function conversion");
5806 if (kind
!= bk_via_virtual
)
5807 result
= BINFO_OFFSET (binfo
);
5810 tree virt_binfo
= binfo_from_vbase (binfo
);
5812 /* This is a reinterpret cast, we choose to do nothing. */
5813 if (allow_inverse_p
)
5814 warning (0, "pointer to member cast via virtual base %qT",
5815 BINFO_TYPE (virt_binfo
));
5817 error ("pointer to member conversion via virtual base %qT",
5818 BINFO_TYPE (virt_binfo
));
5821 else if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
5822 /* Pointer to member of incomplete class is permitted*/;
5823 else if (!allow_inverse_p
)
5825 error_not_base_type (from
, to
);
5826 error (" in pointer to member conversion");
5830 binfo
= lookup_base (from
, to
, c_cast_p
? ba_unique
: ba_check
, &kind
);
5833 if (kind
!= bk_via_virtual
)
5834 result
= size_diffop (size_zero_node
, BINFO_OFFSET (binfo
));
5837 /* This is a reinterpret cast, we choose to do nothing. */
5838 tree virt_binfo
= binfo_from_vbase (binfo
);
5840 warning (0, "pointer to member cast via virtual base %qT",
5841 BINFO_TYPE (virt_binfo
));
5846 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
5850 /* Return a constructor for the pointer-to-member-function TYPE using
5851 the other components as specified. */
5854 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
5859 VEC(constructor_elt
, gc
) *v
;
5861 /* Pull the FIELD_DECLs out of the type. */
5862 pfn_field
= TYPE_FIELDS (type
);
5863 delta_field
= TREE_CHAIN (pfn_field
);
5865 /* Make sure DELTA has the type we want. */
5866 delta
= convert_and_check (delta_type_node
, delta
);
5868 /* Finish creating the initializer. */
5869 v
= VEC_alloc(constructor_elt
, gc
, 2);
5870 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
5871 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
5872 u
= build_constructor (type
, v
);
5873 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
5874 TREE_INVARIANT (u
) = TREE_INVARIANT (pfn
) & TREE_INVARIANT (delta
);
5875 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
5876 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
5878 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
5883 /* Build a constructor for a pointer to member function. It can be
5884 used to initialize global variables, local variable, or used
5885 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
5888 If FORCE is nonzero, then force this conversion, even if
5889 we would rather not do it. Usually set when using an explicit
5890 cast. A C-style cast is being processed iff C_CAST_P is true.
5892 Return error_mark_node, if something goes wrong. */
5895 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
5901 if (error_operand_p (pfn
))
5902 return error_mark_node
;
5904 pfn_type
= TREE_TYPE (pfn
);
5905 to_type
= build_ptrmemfunc_type (type
);
5907 /* Handle multiple conversions of pointer to member functions. */
5908 if (TYPE_PTRMEMFUNC_P (pfn_type
))
5910 tree delta
= NULL_TREE
;
5911 tree npfn
= NULL_TREE
;
5915 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
5916 error ("invalid conversion to type %qT from type %qT",
5919 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
5920 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
5924 /* We don't have to do any conversion to convert a
5925 pointer-to-member to its own type. But, we don't want to
5926 just return a PTRMEM_CST if there's an explicit cast; that
5927 cast should make the expression an invalid template argument. */
5928 if (TREE_CODE (pfn
) != PTRMEM_CST
)
5930 if (same_type_p (to_type
, pfn_type
))
5932 else if (integer_zerop (n
))
5933 return build_reinterpret_cast (to_type
, pfn
);
5936 if (TREE_SIDE_EFFECTS (pfn
))
5937 pfn
= save_expr (pfn
);
5939 /* Obtain the function pointer and the current DELTA. */
5940 if (TREE_CODE (pfn
) == PTRMEM_CST
)
5941 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
5944 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
5945 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
5948 /* Just adjust the DELTA field. */
5949 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5950 (TREE_TYPE (delta
), ptrdiff_type_node
));
5951 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
5952 n
= cp_build_binary_op (LSHIFT_EXPR
, n
, integer_one_node
);
5953 delta
= cp_build_binary_op (PLUS_EXPR
, delta
, n
);
5954 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
5957 /* Handle null pointer to member function conversions. */
5958 if (integer_zerop (pfn
))
5960 pfn
= build_c_cast (type
, integer_zero_node
);
5961 return build_ptrmemfunc1 (to_type
,
5966 if (type_unknown_p (pfn
))
5967 return instantiate_type (type
, pfn
, tf_warning_or_error
);
5969 fn
= TREE_OPERAND (pfn
, 0);
5970 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5971 /* In a template, we will have preserved the
5973 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
5974 return make_ptrmem_cst (to_type
, fn
);
5977 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
5980 ??? There is no consistency as to the types returned for the above
5981 values. Some code acts as if it were a sizetype and some as if it were
5982 integer_type_node. */
5985 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
5987 tree type
= TREE_TYPE (cst
);
5988 tree fn
= PTRMEM_CST_MEMBER (cst
);
5989 tree ptr_class
, fn_class
;
5991 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
5993 /* The class that the function belongs to. */
5994 fn_class
= DECL_CONTEXT (fn
);
5996 /* The class that we're creating a pointer to member of. */
5997 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
5999 /* First, calculate the adjustment to the function's class. */
6000 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
6003 if (!DECL_VIRTUAL_P (fn
))
6004 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
6007 /* If we're dealing with a virtual function, we have to adjust 'this'
6008 again, to point to the base which provides the vtable entry for
6009 fn; the call will do the opposite adjustment. */
6010 tree orig_class
= DECL_CONTEXT (fn
);
6011 tree binfo
= binfo_or_else (orig_class
, fn_class
);
6012 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6013 *delta
, BINFO_OFFSET (binfo
));
6014 *delta
= fold_if_not_in_template (*delta
);
6016 /* We set PFN to the vtable offset at which the function can be
6017 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6018 case delta is shifted left, and then incremented). */
6019 *pfn
= DECL_VINDEX (fn
);
6020 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
6021 TYPE_SIZE_UNIT (vtable_entry_type
));
6022 *pfn
= fold_if_not_in_template (*pfn
);
6024 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
6026 case ptrmemfunc_vbit_in_pfn
:
6027 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
6029 *pfn
= fold_if_not_in_template (*pfn
);
6032 case ptrmemfunc_vbit_in_delta
:
6033 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
6034 *delta
, integer_one_node
);
6035 *delta
= fold_if_not_in_template (*delta
);
6036 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6037 *delta
, integer_one_node
);
6038 *delta
= fold_if_not_in_template (*delta
);
6045 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
6046 *pfn
= fold_if_not_in_template (*pfn
);
6050 /* Return an expression for PFN from the pointer-to-member function
6054 pfn_from_ptrmemfunc (tree t
)
6056 if (TREE_CODE (t
) == PTRMEM_CST
)
6061 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
6066 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
6069 /* Convert value RHS to type TYPE as preparation for an assignment to
6070 an lvalue of type TYPE. ERRTYPE is a string to use in error
6071 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6072 are doing the conversion in order to pass the PARMNUMth argument of
6076 convert_for_assignment (tree type
, tree rhs
,
6077 const char *errtype
, tree fndecl
, int parmnum
)
6080 enum tree_code coder
;
6082 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6083 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
6084 rhs
= TREE_OPERAND (rhs
, 0);
6086 rhstype
= TREE_TYPE (rhs
);
6087 coder
= TREE_CODE (rhstype
);
6089 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
6090 && vector_types_convertible_p (type
, rhstype
))
6091 return convert (type
, rhs
);
6093 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
6094 return error_mark_node
;
6095 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
6096 return error_mark_node
;
6098 /* The RHS of an assignment cannot have void type. */
6099 if (coder
== VOID_TYPE
)
6101 error ("void value not ignored as it ought to be");
6102 return error_mark_node
;
6105 /* Simplify the RHS if possible. */
6106 if (TREE_CODE (rhs
) == CONST_DECL
)
6107 rhs
= DECL_INITIAL (rhs
);
6109 if (c_dialect_objc ())
6112 tree rname
= fndecl
;
6114 if (!strcmp (errtype
, "assignment"))
6116 else if (!strcmp (errtype
, "initialization"))
6120 tree selector
= objc_message_selector ();
6124 if (selector
&& parmno
> 1)
6131 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
6132 return convert (type
, rhs
);
6137 The expression is implicitly converted (clause _conv_) to the
6138 cv-unqualified type of the left operand.
6140 We allow bad conversions here because by the time we get to this point
6141 we are committed to doing the conversion. If we end up doing a bad
6142 conversion, convert_like will complain. */
6143 if (!can_convert_arg_bad (type
, rhstype
, rhs
))
6145 /* When -Wno-pmf-conversions is use, we just silently allow
6146 conversions from pointers-to-members to plain pointers. If
6147 the conversion doesn't work, cp_convert will complain. */
6149 && TYPE_PTR_P (type
)
6150 && TYPE_PTRMEMFUNC_P (rhstype
))
6151 rhs
= cp_convert (strip_top_quals (type
), rhs
);
6154 /* If the right-hand side has unknown type, then it is an
6155 overloaded function. Call instantiate_type to get error
6157 if (rhstype
== unknown_type_node
)
6158 instantiate_type (type
, rhs
, tf_warning_or_error
);
6160 error ("cannot convert %qT to %qT for argument %qP to %qD",
6161 rhstype
, type
, parmnum
, fndecl
);
6163 error ("cannot convert %qT to %qT in %s", rhstype
, type
, errtype
);
6164 return error_mark_node
;
6167 if (warn_missing_format_attribute
)
6169 const enum tree_code codel
= TREE_CODE (type
);
6170 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
6172 && check_missing_format_attribute (type
, rhstype
))
6173 warning (OPT_Wmissing_format_attribute
,
6174 "%s might be a candidate for a format attribute",
6178 return perform_implicit_conversion (strip_top_quals (type
), rhs
);
6181 /* Convert RHS to be of type TYPE.
6182 If EXP is nonzero, it is the target of the initialization.
6183 ERRTYPE is a string to use in error messages.
6185 Two major differences between the behavior of
6186 `convert_for_assignment' and `convert_for_initialization'
6187 are that references are bashed in the former, while
6188 copied in the latter, and aggregates are assigned in
6189 the former (operator=) while initialized in the
6192 If using constructor make sure no conversion operator exists, if one does
6193 exist, an ambiguity exists.
6195 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6198 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
6199 const char *errtype
, tree fndecl
, int parmnum
)
6201 enum tree_code codel
= TREE_CODE (type
);
6203 enum tree_code coder
;
6205 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6206 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6207 if (TREE_CODE (rhs
) == NOP_EXPR
6208 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
6209 && codel
!= REFERENCE_TYPE
)
6210 rhs
= TREE_OPERAND (rhs
, 0);
6212 if (rhs
== error_mark_node
6213 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
6214 return error_mark_node
;
6216 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6217 && TREE_CODE (type
) != ARRAY_TYPE
6218 && (TREE_CODE (type
) != REFERENCE_TYPE
6219 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
6220 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6221 && (TREE_CODE (type
) != REFERENCE_TYPE
6222 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
6223 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6224 rhs
= decay_conversion (rhs
);
6226 rhstype
= TREE_TYPE (rhs
);
6227 coder
= TREE_CODE (rhstype
);
6229 if (coder
== ERROR_MARK
)
6230 return error_mark_node
;
6232 /* We accept references to incomplete types, so we can
6233 return here before checking if RHS is of complete type. */
6235 if (codel
== REFERENCE_TYPE
)
6237 /* This should eventually happen in convert_arguments. */
6238 int savew
= 0, savee
= 0;
6241 savew
= warningcount
, savee
= errorcount
;
6242 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
6246 if (warningcount
> savew
)
6247 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
6248 else if (errorcount
> savee
)
6249 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
6255 exp
= require_complete_type (exp
);
6256 if (exp
== error_mark_node
)
6257 return error_mark_node
;
6259 rhstype
= non_reference (rhstype
);
6261 type
= complete_type (type
);
6263 if (IS_AGGR_TYPE (type
))
6264 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
6266 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
6269 /* If RETVAL is the address of, or a reference to, a local variable or
6270 temporary give an appropriate warning. */
6273 maybe_warn_about_returning_address_of_local (tree retval
)
6275 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6276 tree whats_returned
= retval
;
6280 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
6281 whats_returned
= TREE_OPERAND (whats_returned
, 1);
6282 else if (TREE_CODE (whats_returned
) == CONVERT_EXPR
6283 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
6284 || TREE_CODE (whats_returned
) == NOP_EXPR
)
6285 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6290 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
6292 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6294 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6296 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
6297 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
6299 warning (0, "returning reference to temporary");
6302 if (TREE_CODE (whats_returned
) == VAR_DECL
6303 && DECL_NAME (whats_returned
)
6304 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
6306 warning (0, "reference to non-lvalue returned");
6311 if (DECL_P (whats_returned
)
6312 && DECL_NAME (whats_returned
)
6313 && DECL_FUNCTION_SCOPE_P (whats_returned
)
6314 && !(TREE_STATIC (whats_returned
)
6315 || TREE_PUBLIC (whats_returned
)))
6317 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6318 warning (0, "reference to local variable %q+D returned",
6321 warning (0, "address of local variable %q+D returned",
6327 /* Check that returning RETVAL from the current function is valid.
6328 Return an expression explicitly showing all conversions required to
6329 change RETVAL into the function return type, and to assign it to
6330 the DECL_RESULT for the function. Set *NO_WARNING to true if
6331 code reaches end of non-void function warning shouldn't be issued
6332 on this RETURN_EXPR. */
6335 check_return_expr (tree retval
, bool *no_warning
)
6338 /* The type actually returned by the function, after any
6341 int fn_returns_value_p
;
6343 *no_warning
= false;
6345 /* A `volatile' function is one that isn't supposed to return, ever.
6346 (This is a G++ extension, used to get better code for functions
6347 that call the `volatile' function.) */
6348 if (TREE_THIS_VOLATILE (current_function_decl
))
6349 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6351 /* Check for various simple errors. */
6352 if (DECL_DESTRUCTOR_P (current_function_decl
))
6355 error ("returning a value from a destructor");
6358 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
6360 if (in_function_try_handler
)
6361 /* If a return statement appears in a handler of the
6362 function-try-block of a constructor, the program is ill-formed. */
6363 error ("cannot return from a handler of a function-try-block of a constructor");
6365 /* You can't return a value from a constructor. */
6366 error ("returning a value from a constructor");
6370 if (processing_template_decl
)
6372 current_function_returns_value
= 1;
6376 /* When no explicit return-value is given in a function with a named
6377 return value, the named return value is used. */
6378 result
= DECL_RESULT (current_function_decl
);
6379 valtype
= TREE_TYPE (result
);
6380 gcc_assert (valtype
!= NULL_TREE
);
6381 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
6382 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
6385 /* Check for a return statement with no return value in a function
6386 that's supposed to return a value. */
6387 if (!retval
&& fn_returns_value_p
)
6389 pedwarn ("return-statement with no value, in function returning %qT",
6391 /* Clear this, so finish_function won't say that we reach the
6392 end of a non-void function (which we don't, we gave a
6394 current_function_returns_null
= 0;
6395 /* And signal caller that TREE_NO_WARNING should be set on the
6396 RETURN_EXPR to avoid control reaches end of non-void function
6397 warnings in tree-cfg.c. */
6400 /* Check for a return statement with a value in a function that
6401 isn't supposed to return a value. */
6402 else if (retval
&& !fn_returns_value_p
)
6404 if (VOID_TYPE_P (TREE_TYPE (retval
)))
6405 /* You can return a `void' value from a function of `void'
6406 type. In that case, we have to evaluate the expression for
6407 its side-effects. */
6408 finish_expr_stmt (retval
);
6410 pedwarn ("return-statement with a value, in function "
6411 "returning 'void'");
6413 current_function_returns_null
= 1;
6415 /* There's really no value to return, after all. */
6419 /* Remember that this function can sometimes return without a
6421 current_function_returns_null
= 1;
6423 /* Remember that this function did return a value. */
6424 current_function_returns_value
= 1;
6426 /* Check for erroneous operands -- but after giving ourselves a
6427 chance to provide an error about returning a value from a void
6429 if (error_operand_p (retval
))
6431 current_function_return_value
= error_mark_node
;
6432 return error_mark_node
;
6435 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6436 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
6437 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
6438 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
6440 && null_ptr_cst_p (retval
))
6441 warning (0, "%<operator new%> must not return NULL unless it is "
6442 "declared %<throw()%> (or -fcheck-new is in effect)");
6444 /* Effective C++ rule 15. See also start_function. */
6446 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
6450 /* The function return type must be a reference to the current
6452 if (TREE_CODE (valtype
) == REFERENCE_TYPE
6453 && same_type_ignoring_top_level_qualifiers_p
6454 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
6456 /* Returning '*this' is obviously OK. */
6457 if (retval
== current_class_ref
)
6459 /* If we are calling a function whose return type is the same of
6460 the current class reference, it is ok. */
6461 else if (TREE_CODE (retval
) == INDIRECT_REF
6462 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
6467 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
6470 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6472 [...] For a function with a class return type, if the expression
6473 in the return statement is the name of a local object, and the cv-
6474 unqualified type of the local object is the same as the function
6475 return type, an implementation is permitted to omit creating the tem-
6476 porary object to hold the function return value [...]
6478 So, if this is a value-returning function that always returns the same
6479 local variable, remember it.
6481 It might be nice to be more flexible, and choose the first suitable
6482 variable even if the function sometimes returns something else, but
6483 then we run the risk of clobbering the variable we chose if the other
6484 returned expression uses the chosen variable somehow. And people expect
6485 this restriction, anyway. (jason 2000-11-19)
6487 See finish_function and finalize_nrv for the rest of this optimization. */
6489 if (fn_returns_value_p
&& flag_elide_constructors
)
6491 if (retval
!= NULL_TREE
6492 && (current_function_return_value
== NULL_TREE
6493 || current_function_return_value
== retval
)
6494 && TREE_CODE (retval
) == VAR_DECL
6495 && DECL_CONTEXT (retval
) == current_function_decl
6496 && ! TREE_STATIC (retval
)
6497 && (DECL_ALIGN (retval
)
6498 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
6499 && same_type_p ((TYPE_MAIN_VARIANT
6500 (TREE_TYPE (retval
))),
6502 (TREE_TYPE (TREE_TYPE (current_function_decl
))))))
6503 current_function_return_value
= retval
;
6505 current_function_return_value
= error_mark_node
;
6508 /* We don't need to do any conversions when there's nothing being
6513 /* Do any required conversions. */
6514 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
6515 /* No conversions are required. */
6519 /* The type the function is declared to return. */
6520 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6522 /* The functype's return type will have been set to void, if it
6523 was an incomplete type. Just treat this as 'return;' */
6524 if (VOID_TYPE_P (functype
))
6525 return error_mark_node
;
6527 /* First convert the value to the function's return type, then
6528 to the type of return value's location to handle the
6529 case that functype is smaller than the valtype. */
6530 retval
= convert_for_initialization
6531 (NULL_TREE
, functype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
6532 "return", NULL_TREE
, 0);
6533 retval
= convert (valtype
, retval
);
6535 /* If the conversion failed, treat this just like `return;'. */
6536 if (retval
== error_mark_node
)
6538 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6539 else if (! current_function_returns_struct
6540 && TREE_CODE (retval
) == TARGET_EXPR
6541 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
6542 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
6543 TREE_OPERAND (retval
, 0));
6545 maybe_warn_about_returning_address_of_local (retval
);
6548 /* Actually copy the value returned into the appropriate location. */
6549 if (retval
&& retval
!= result
)
6550 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
6556 /* Returns nonzero if the pointer-type FROM can be converted to the
6557 pointer-type TO via a qualification conversion. If CONSTP is -1,
6558 then we return nonzero if the pointers are similar, and the
6559 cv-qualification signature of FROM is a proper subset of that of TO.
6561 If CONSTP is positive, then all outer pointers have been
6565 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
6567 bool to_more_cv_qualified
= false;
6569 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6571 if (TREE_CODE (to
) != TREE_CODE (from
))
6574 if (TREE_CODE (from
) == OFFSET_TYPE
6575 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
6576 TYPE_OFFSET_BASETYPE (to
)))
6579 /* Const and volatile mean something different for function types,
6580 so the usual checks are not appropriate. */
6581 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
6583 /* In Objective-C++, some types may have been 'volatilized' by
6584 the compiler for EH; when comparing them here, the volatile
6585 qualification must be ignored. */
6586 bool objc_quals_match
= objc_type_quals_match (to
, from
);
6588 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
6591 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
6595 to_more_cv_qualified
= true;
6599 constp
&= TYPE_READONLY (to
);
6602 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
6603 return ((constp
>= 0 || to_more_cv_qualified
)
6604 && same_type_ignoring_top_level_qualifiers_p (to
, from
));
6608 /* When comparing, say, char ** to char const **, this function takes
6609 the 'char *' and 'char const *'. Do not pass non-pointer/reference
6610 types to this function. */
6613 comp_ptr_ttypes (tree to
, tree from
)
6615 return comp_ptr_ttypes_real (to
, from
, 1);
6618 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6619 type or inheritance-related types, regardless of cv-quals. */
6622 ptr_reasonably_similar (tree to
, tree from
)
6624 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6626 /* Any target type is similar enough to void. */
6627 if (TREE_CODE (to
) == VOID_TYPE
6628 || TREE_CODE (from
) == VOID_TYPE
)
6631 if (TREE_CODE (to
) != TREE_CODE (from
))
6634 if (TREE_CODE (from
) == OFFSET_TYPE
6635 && comptypes (TYPE_OFFSET_BASETYPE (to
),
6636 TYPE_OFFSET_BASETYPE (from
),
6637 COMPARE_BASE
| COMPARE_DERIVED
))
6640 if (TREE_CODE (to
) == VECTOR_TYPE
6641 && vector_types_convertible_p (to
, from
))
6644 if (TREE_CODE (to
) == INTEGER_TYPE
6645 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
6648 if (TREE_CODE (to
) == FUNCTION_TYPE
)
6651 if (TREE_CODE (to
) != POINTER_TYPE
)
6653 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
6654 COMPARE_BASE
| COMPARE_DERIVED
);
6658 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
6659 pointer-to-member types) are the same, ignoring cv-qualification at
6663 comp_ptr_ttypes_const (tree to
, tree from
)
6665 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6667 if (TREE_CODE (to
) != TREE_CODE (from
))
6670 if (TREE_CODE (from
) == OFFSET_TYPE
6671 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
6672 TYPE_OFFSET_BASETYPE (to
)))
6675 if (TREE_CODE (to
) != POINTER_TYPE
)
6676 return same_type_ignoring_top_level_qualifiers_p (to
, from
);
6680 /* Returns the type qualifiers for this type, including the qualifiers on the
6681 elements for an array type. */
6684 cp_type_quals (tree type
)
6686 type
= strip_array_types (type
);
6687 if (type
== error_mark_node
)
6688 return TYPE_UNQUALIFIED
;
6689 return TYPE_QUALS (type
);
6692 /* Returns nonzero if the TYPE contains a mutable member. */
6695 cp_has_mutable_p (tree type
)
6697 type
= strip_array_types (type
);
6699 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
6702 /* Apply the TYPE_QUALS to the new DECL. */
6704 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
6706 tree type
= TREE_TYPE (decl
);
6708 if (type
== error_mark_node
)
6711 if (TREE_CODE (type
) == FUNCTION_TYPE
6712 && type_quals
!= TYPE_UNQUALIFIED
)
6714 /* This was an error in C++98 (cv-qualifiers cannot be added to
6715 a function type), but DR 295 makes the code well-formed by
6716 dropping the extra qualifiers. */
6719 tree bad_type
= build_qualified_type (type
, type_quals
);
6720 pedwarn ("ignoring %qV qualifiers added to function type %qT",
6724 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
6728 /* Avoid setting TREE_READONLY incorrectly. */
6729 if (/* If the object has a constructor, the constructor may modify
6731 TYPE_NEEDS_CONSTRUCTING (type
)
6732 /* If the type isn't complete, we don't know yet if it will need
6734 || !COMPLETE_TYPE_P (type
)
6735 /* If the type has a mutable component, that component might be
6737 || TYPE_HAS_MUTABLE_P (type
))
6738 type_quals
&= ~TYPE_QUAL_CONST
;
6740 c_apply_type_quals_to_decl (type_quals
, decl
);
6743 /* Subroutine of casts_away_constness. Make T1 and T2 point at
6744 exemplar types such that casting T1 to T2 is casting away constness
6745 if and only if there is no implicit conversion from T1 to T2. */
6748 casts_away_constness_r (tree
*t1
, tree
*t2
)
6753 /* [expr.const.cast]
6755 For multi-level pointer to members and multi-level mixed pointers
6756 and pointers to members (conv.qual), the "member" aspect of a
6757 pointer to member level is ignored when determining if a const
6758 cv-qualifier has been cast away. */
6759 /* [expr.const.cast]
6761 For two pointer types:
6763 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
6764 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
6767 casting from X1 to X2 casts away constness if, for a non-pointer
6768 type T there does not exist an implicit conversion (clause
6771 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
6775 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
6776 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
6777 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
6779 *t1
= cp_build_qualified_type (void_type_node
,
6780 cp_type_quals (*t1
));
6781 *t2
= cp_build_qualified_type (void_type_node
,
6782 cp_type_quals (*t2
));
6786 quals1
= cp_type_quals (*t1
);
6787 quals2
= cp_type_quals (*t2
);
6789 if (TYPE_PTRMEM_P (*t1
))
6790 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
6792 *t1
= TREE_TYPE (*t1
);
6793 if (TYPE_PTRMEM_P (*t2
))
6794 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
6796 *t2
= TREE_TYPE (*t2
);
6798 casts_away_constness_r (t1
, t2
);
6799 *t1
= build_pointer_type (*t1
);
6800 *t2
= build_pointer_type (*t2
);
6801 *t1
= cp_build_qualified_type (*t1
, quals1
);
6802 *t2
= cp_build_qualified_type (*t2
, quals2
);
6805 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
6809 casts_away_constness (tree t1
, tree t2
)
6811 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
6813 /* [expr.const.cast]
6815 Casting from an lvalue of type T1 to an lvalue of type T2
6816 using a reference cast casts away constness if a cast from an
6817 rvalue of type "pointer to T1" to the type "pointer to T2"
6818 casts away constness. */
6819 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
6820 return casts_away_constness (build_pointer_type (t1
),
6821 build_pointer_type (TREE_TYPE (t2
)));
6824 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
6825 /* [expr.const.cast]
6827 Casting from an rvalue of type "pointer to data member of X
6828 of type T1" to the type "pointer to data member of Y of type
6829 T2" casts away constness if a cast from an rvalue of type
6830 "pointer to T1" to the type "pointer to T2" casts away
6832 return casts_away_constness
6833 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
6834 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
6836 /* Casting away constness is only something that makes sense for
6837 pointer or reference types. */
6838 if (TREE_CODE (t1
) != POINTER_TYPE
6839 || TREE_CODE (t2
) != POINTER_TYPE
)
6842 /* Top-level qualifiers don't matter. */
6843 t1
= TYPE_MAIN_VARIANT (t1
);
6844 t2
= TYPE_MAIN_VARIANT (t2
);
6845 casts_away_constness_r (&t1
, &t2
);
6846 if (!can_convert (t2
, t1
))
6852 /* If T is a REFERENCE_TYPE return the type to which T refers.
6853 Otherwise, return T itself. */
6856 non_reference (tree t
)
6858 if (TREE_CODE (t
) == REFERENCE_TYPE
)
6864 /* Return nonzero if REF is an lvalue valid for this language;
6865 otherwise, print an error message and return zero. USE says
6866 how the lvalue is being used and so selects the error message. */
6869 lvalue_or_else (tree ref
, enum lvalue_use use
)
6871 int win
= lvalue_p (ref
);