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 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, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, 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"
45 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int);
46 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
47 static tree
rationalize_conditional_expr (enum tree_code
, tree
);
48 static int comp_ptr_ttypes_real (tree
, tree
, int);
49 static int comp_ptr_ttypes_const (tree
, tree
);
50 static bool comp_except_types (tree
, tree
, bool);
51 static bool comp_array_types (tree
, tree
, bool);
52 static tree
common_base_type (tree
, tree
);
53 static tree
pointer_diff (tree
, tree
, tree
);
54 static tree
get_delta_difference (tree
, tree
, int);
55 static void casts_away_constness_r (tree
*, tree
*);
56 static bool casts_away_constness (tree
, tree
);
57 static void maybe_warn_about_returning_address_of_local (tree
);
58 static tree
lookup_destructor (tree
, tree
, tree
);
60 /* Return the target type of TYPE, which means return T for:
61 T*, T&, T[], T (...), and otherwise, just T. */
64 target_type (tree type
)
66 type
= non_reference (type
);
67 while (TREE_CODE (type
) == POINTER_TYPE
68 || TREE_CODE (type
) == ARRAY_TYPE
69 || TREE_CODE (type
) == FUNCTION_TYPE
70 || TREE_CODE (type
) == METHOD_TYPE
71 || TYPE_PTRMEM_P (type
))
72 type
= TREE_TYPE (type
);
76 /* Do `exp = require_complete_type (exp);' to make sure exp
77 does not have an incomplete type. (That includes void types.)
78 Returns the error_mark_node if the VALUE does not have
79 complete type when this function returns. */
82 require_complete_type (tree value
)
86 if (processing_template_decl
|| value
== error_mark_node
)
89 if (TREE_CODE (value
) == OVERLOAD
)
90 type
= unknown_type_node
;
92 type
= TREE_TYPE (value
);
94 if (type
== error_mark_node
)
95 return error_mark_node
;
97 /* First, detect a valid value with a complete type. */
98 if (COMPLETE_TYPE_P (type
))
101 if (complete_type_or_else (type
, value
))
104 return error_mark_node
;
107 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
108 a template instantiation, do the instantiation. Returns TYPE,
109 whether or not it could be completed, unless something goes
110 horribly wrong, in which case the error_mark_node is returned. */
113 complete_type (tree type
)
115 if (type
== NULL_TREE
)
116 /* Rather than crash, we return something sure to cause an error
118 return error_mark_node
;
120 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
122 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
124 tree t
= complete_type (TREE_TYPE (type
));
125 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
127 TYPE_NEEDS_CONSTRUCTING (type
)
128 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
129 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
130 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
132 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
133 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
138 /* Like complete_type, but issue an error if the TYPE cannot be completed.
139 VALUE is used for informative diagnostics. DIAG_TYPE indicates the type
140 of diagnostic: 0 for an error, 1 for a warning, 2 for a pedwarn.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_diagnostic (tree type
, tree value
, int diag_type
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 cxx_incomplete_type_diagnostic (value
, type
, diag_type
);
159 /* Return truthvalue of whether type of EXP is instantiated. */
162 type_unknown_p (tree exp
)
164 return (TREE_CODE (exp
) == TREE_LIST
165 || TREE_TYPE (exp
) == unknown_type_node
);
169 /* Return the common type of two parameter lists.
170 We assume that comptypes has already been done and returned 1;
171 if that isn't so, this may crash.
173 As an optimization, free the space we allocate if the parameter
174 lists are already common. */
177 commonparms (tree p1
, tree p2
)
179 tree oldargs
= p1
, newargs
, n
;
183 len
= list_length (p1
);
184 newargs
= tree_last (p1
);
186 if (newargs
== void_list_node
)
195 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
200 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
202 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
204 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
207 else if (! TREE_PURPOSE (p1
))
209 if (TREE_PURPOSE (p2
))
211 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
217 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
219 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
221 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
224 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
227 TREE_VALUE (n
) = TREE_VALUE (p1
);
235 /* Given a type, perhaps copied for a typedef,
236 find the "original" version of it. */
238 original_type (tree t
)
240 while (TYPE_NAME (t
) != NULL_TREE
)
242 tree x
= TYPE_NAME (t
);
243 if (TREE_CODE (x
) != TYPE_DECL
)
245 x
= DECL_ORIGINAL_TYPE (x
);
253 /* T1 and T2 are arithmetic or enumeration types. Return the type
254 that will result from the "usual arithmetic conversions" on T1 and
255 T2 as described in [expr]. */
258 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
260 enum tree_code code1
= TREE_CODE (t1
);
261 enum tree_code code2
= TREE_CODE (t2
);
264 /* FIXME: Attributes. */
265 my_friendly_assert (ARITHMETIC_TYPE_P (t1
)
266 || TREE_CODE (t1
) == COMPLEX_TYPE
267 || TREE_CODE (t1
) == ENUMERAL_TYPE
,
269 my_friendly_assert (ARITHMETIC_TYPE_P (t2
)
270 || TREE_CODE (t2
) == COMPLEX_TYPE
271 || TREE_CODE (t2
) == ENUMERAL_TYPE
,
274 /* In what follows, we slightly generalize the rules given in [expr] so
275 as to deal with `long long' and `complex'. First, merge the
277 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
279 /* If one type is complex, form the common type of the non-complex
280 components, then make that complex. Use T1 or T2 if it is the
282 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
284 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
285 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
287 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
289 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
290 return build_type_attribute_variant (t1
, attributes
);
291 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
292 return build_type_attribute_variant (t2
, attributes
);
294 return build_type_attribute_variant (build_complex_type (subtype
),
298 /* If only one is real, use it as the result. */
299 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
300 return build_type_attribute_variant (t1
, attributes
);
301 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
302 return build_type_attribute_variant (t2
, attributes
);
304 /* Perform the integral promotions. */
305 if (code1
!= REAL_TYPE
)
307 t1
= type_promotes_to (t1
);
308 t2
= type_promotes_to (t2
);
311 /* Both real or both integers; use the one with greater precision. */
312 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
313 return build_type_attribute_variant (t1
, attributes
);
314 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
315 return build_type_attribute_variant (t2
, attributes
);
317 /* The types are the same; no need to do anything fancy. */
318 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
319 return build_type_attribute_variant (t1
, attributes
);
321 if (code1
!= REAL_TYPE
)
323 /* If one is a sizetype, use it so size_binop doesn't blow up. */
324 if (TYPE_IS_SIZETYPE (t1
) > TYPE_IS_SIZETYPE (t2
))
325 return build_type_attribute_variant (t1
, attributes
);
326 if (TYPE_IS_SIZETYPE (t2
) > TYPE_IS_SIZETYPE (t1
))
327 return build_type_attribute_variant (t2
, attributes
);
329 /* If one is unsigned long long, then convert the other to unsigned
331 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
332 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
333 return build_type_attribute_variant (long_long_unsigned_type_node
,
335 /* If one is a long long, and the other is an unsigned long, and
336 long long can represent all the values of an unsigned long, then
337 convert to a long long. Otherwise, convert to an unsigned long
338 long. Otherwise, if either operand is long long, convert the
341 Since we're here, we know the TYPE_PRECISION is the same;
342 therefore converting to long long cannot represent all the values
343 of an unsigned long, so we choose unsigned long long in that
345 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
346 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
348 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
349 ? long_long_unsigned_type_node
350 : long_long_integer_type_node
);
351 return build_type_attribute_variant (t
, attributes
);
354 /* Go through the same procedure, but for longs. */
355 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
356 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
357 return build_type_attribute_variant (long_unsigned_type_node
,
359 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
360 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
362 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
363 ? long_unsigned_type_node
: long_integer_type_node
);
364 return build_type_attribute_variant (t
, attributes
);
366 /* Otherwise prefer the unsigned one. */
367 if (TYPE_UNSIGNED (t1
))
368 return build_type_attribute_variant (t1
, attributes
);
370 return build_type_attribute_variant (t2
, attributes
);
374 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
375 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
376 return build_type_attribute_variant (long_double_type_node
,
378 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
379 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
380 return build_type_attribute_variant (double_type_node
,
382 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
383 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
384 return build_type_attribute_variant (float_type_node
,
387 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
388 the standard C++ floating-point types. Logic earlier in this
389 function has already eliminated the possibility that
390 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
391 compelling reason to choose one or the other. */
392 return build_type_attribute_variant (t1
, attributes
);
396 /* Subroutine of composite_pointer_type to implement the recursive
397 case. See that function for documentation fo the parameters. */
400 composite_pointer_type_r (tree t1
, tree t2
, const char* location
)
407 /* Determine the types pointed to by T1 and T2. */
408 if (TREE_CODE (t1
) == POINTER_TYPE
)
410 pointee1
= TREE_TYPE (t1
);
411 pointee2
= TREE_TYPE (t2
);
415 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
416 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
421 Otherwise, the composite pointer type is a pointer type
422 similar (_conv.qual_) to the type of one of the operands,
423 with a cv-qualification signature (_conv.qual_) that is the
424 union of the cv-qualification signatures of the operand
426 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
427 result_type
= pointee1
;
428 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
429 && TREE_CODE (pointee2
) == POINTER_TYPE
)
430 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
431 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
432 result_type
= composite_pointer_type_r (pointee1
, pointee2
, location
);
435 pedwarn ("%s between distinct pointer types `%T' and `%T' "
438 result_type
= void_type_node
;
440 result_type
= cp_build_qualified_type (result_type
,
441 (cp_type_quals (pointee1
)
442 | cp_type_quals (pointee2
)));
443 /* If the original types were pointers to members, so is the
445 if (TYPE_PTR_TO_MEMBER_P (t1
))
447 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
448 TYPE_PTRMEM_CLASS_TYPE (t2
)))
449 pedwarn ("%s between distinct pointer types `%T' and `%T' "
452 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
456 result_type
= build_pointer_type (result_type
);
458 /* Merge the attributes. */
459 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
460 return build_type_attribute_variant (result_type
, attributes
);
463 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
464 ARG1 and ARG2 are the values with those types. The LOCATION is a
465 string describing the current location, in case an error occurs.
467 This routine also implements the computation of a common type for
468 pointers-to-members as per [expr.eq]. */
471 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
472 const char* location
)
479 If one operand is a null pointer constant, the composite pointer
480 type is the type of the other operand. */
481 if (null_ptr_cst_p (arg1
))
483 if (null_ptr_cst_p (arg2
))
490 If one of the operands has type "pointer to cv1 void*", then
491 the other has type "pointer to cv2T", and the composite pointer
492 type is "pointer to cv12 void", where cv12 is the union of cv1
495 If either type is a pointer to void, make sure it is T1. */
496 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
504 /* Now, if T1 is a pointer to void, merge the qualifiers. */
505 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
510 if (pedantic
&& TYPE_PTRFN_P (t2
))
511 pedwarn ("ISO C++ forbids %s between pointer of type `void *' and pointer-to-function", location
);
513 = cp_build_qualified_type (void_type_node
,
514 (cp_type_quals (TREE_TYPE (t1
))
515 | cp_type_quals (TREE_TYPE (t2
))));
516 result_type
= build_pointer_type (result_type
);
517 /* Merge the attributes. */
518 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
519 return build_type_attribute_variant (result_type
, attributes
);
522 /* [expr.eq] permits the application of a pointer conversion to
523 bring the pointers to a common type. */
524 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
525 && CLASS_TYPE_P (TREE_TYPE (t1
))
526 && CLASS_TYPE_P (TREE_TYPE (t2
))
527 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
530 class1
= TREE_TYPE (t1
);
531 class2
= TREE_TYPE (t2
);
533 if (DERIVED_FROM_P (class1
, class2
))
534 t2
= (build_pointer_type
535 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
536 else if (DERIVED_FROM_P (class2
, class1
))
537 t1
= (build_pointer_type
538 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
541 error ("%s between distinct pointer types `%T' and `%T' "
542 "lacks a cast", location
, t1
, t2
);
543 return error_mark_node
;
546 /* [expr.eq] permits the application of a pointer-to-member
547 conversion to change the class type of one of the types. */
548 else if (TYPE_PTR_TO_MEMBER_P (t1
)
549 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
550 TYPE_PTRMEM_CLASS_TYPE (t2
)))
552 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
553 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
555 if (DERIVED_FROM_P (class1
, class2
))
556 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
557 else if (DERIVED_FROM_P (class2
, class1
))
558 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
561 error ("%s between distinct pointer-to-member types `%T' and `%T' "
562 "lacks a cast", location
, t1
, t2
);
563 return error_mark_node
;
567 return composite_pointer_type_r (t1
, t2
, location
);
570 /* Return the merged type of two types.
571 We assume that comptypes has already been done and returned 1;
572 if that isn't so, this may crash.
574 This just combines attributes and default arguments; any other
575 differences would cause the two types to compare unalike. */
578 merge_types (tree t1
, tree t2
)
580 enum tree_code code1
;
581 enum tree_code code2
;
584 /* Save time if the two types are the same. */
587 if (original_type (t1
) == original_type (t2
))
590 /* If one type is nonsense, use the other. */
591 if (t1
== error_mark_node
)
593 if (t2
== error_mark_node
)
596 /* Merge the attributes. */
597 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
599 if (TYPE_PTRMEMFUNC_P (t1
))
600 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
601 if (TYPE_PTRMEMFUNC_P (t2
))
602 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
604 code1
= TREE_CODE (t1
);
605 code2
= TREE_CODE (t2
);
611 /* For two pointers, do this recursively on the target type. */
613 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
614 int quals
= cp_type_quals (t1
);
616 if (code1
== POINTER_TYPE
)
617 t1
= build_pointer_type (target
);
619 t1
= build_reference_type (target
);
620 t1
= build_type_attribute_variant (t1
, attributes
);
621 t1
= cp_build_qualified_type (t1
, quals
);
623 if (TREE_CODE (target
) == METHOD_TYPE
)
624 t1
= build_ptrmemfunc_type (t1
);
633 quals
= cp_type_quals (t1
);
634 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
635 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
636 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
638 t1
= cp_build_qualified_type (t1
, quals
);
644 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
645 /* Save space: see if the result is identical to one of the args. */
646 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
647 return build_type_attribute_variant (t1
, attributes
);
648 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
649 return build_type_attribute_variant (t2
, attributes
);
650 /* Merge the element types, and have a size if either arg has one. */
651 t1
= build_cplus_array_type
652 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
657 /* Function types: prefer the one that specified arg types.
658 If both do, merge the arg types. Also merge the return types. */
660 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
661 tree p1
= TYPE_ARG_TYPES (t1
);
662 tree p2
= TYPE_ARG_TYPES (t2
);
665 /* Save space: see if the result is identical to one of the args. */
666 if (valtype
== TREE_TYPE (t1
) && ! p2
)
667 return cp_build_type_attribute_variant (t1
, attributes
);
668 if (valtype
== TREE_TYPE (t2
) && ! p1
)
669 return cp_build_type_attribute_variant (t2
, attributes
);
671 /* Simple way if one arg fails to specify argument types. */
672 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
674 rval
= build_function_type (valtype
, p2
);
675 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
676 rval
= build_exception_variant (rval
, raises
);
677 return cp_build_type_attribute_variant (rval
, attributes
);
679 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
680 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
682 rval
= build_function_type (valtype
, p1
);
684 rval
= build_exception_variant (rval
, raises
);
685 return cp_build_type_attribute_variant (rval
, attributes
);
688 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
689 t1
= build_exception_variant (rval
, raises
);
695 /* Get this value the long way, since TYPE_METHOD_BASETYPE
696 is just the main variant of this. */
697 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
698 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
701 /* If this was a member function type, get back to the
702 original type of type member function (i.e., without
703 the class instance variable up front. */
704 t1
= build_function_type (TREE_TYPE (t1
),
705 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
706 t2
= build_function_type (TREE_TYPE (t2
),
707 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
708 t3
= merge_types (t1
, t2
);
709 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
710 TYPE_ARG_TYPES (t3
));
711 t1
= build_exception_variant (t3
, raises
);
716 /* There is no need to merge attributes into a TYPENAME_TYPE.
717 When the type is instantiated it will have whatever
718 attributes result from the instantiation. */
723 return cp_build_type_attribute_variant (t1
, attributes
);
726 /* Return the common type of two types.
727 We assume that comptypes has already been done and returned 1;
728 if that isn't so, this may crash.
730 This is the type for the result of most arithmetic operations
731 if the operands have the given two types. */
734 common_type (tree t1
, tree t2
)
736 enum tree_code code1
;
737 enum tree_code code2
;
739 /* If one type is nonsense, bail. */
740 if (t1
== error_mark_node
|| t2
== error_mark_node
)
741 return error_mark_node
;
743 code1
= TREE_CODE (t1
);
744 code2
= TREE_CODE (t2
);
746 if ((ARITHMETIC_TYPE_P (t1
) || code1
== ENUMERAL_TYPE
747 || code1
== COMPLEX_TYPE
)
748 && (ARITHMETIC_TYPE_P (t2
) || code2
== ENUMERAL_TYPE
749 || code2
== COMPLEX_TYPE
))
750 return type_after_usual_arithmetic_conversions (t1
, t2
);
752 else if ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
753 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
754 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)))
755 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
761 /* Compare two exception specifier types for exactness or subsetness, if
762 allowed. Returns false for mismatch, true for match (same, or
765 [except.spec] "If a class X ... objects of class X or any class publicly
766 and unambiguously derived from X. Similarly, if a pointer type Y * ...
767 exceptions of type Y * or that are pointers to any type publicly and
768 unambiguously derived from Y. Otherwise a function only allows exceptions
769 that have the same type ..."
770 This does not mention cv qualifiers and is different to what throw
771 [except.throw] and catch [except.catch] will do. They will ignore the
772 top level cv qualifiers, and allow qualifiers in the pointer to class
775 We implement the letter of the standard. */
778 comp_except_types (tree a
, tree b
, bool exact
)
780 if (same_type_p (a
, b
))
784 if (cp_type_quals (a
) || cp_type_quals (b
))
787 if (TREE_CODE (a
) == POINTER_TYPE
788 && TREE_CODE (b
) == POINTER_TYPE
)
792 if (cp_type_quals (a
) || cp_type_quals (b
))
796 if (TREE_CODE (a
) != RECORD_TYPE
797 || TREE_CODE (b
) != RECORD_TYPE
)
800 if (ACCESSIBLY_UNIQUELY_DERIVED_P (a
, b
))
806 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
807 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
808 otherwise it must be exact. Exception lists are unordered, but
809 we've already filtered out duplicates. Most lists will be in order,
810 we should try to make use of that. */
813 comp_except_specs (tree t1
, tree t2
, bool exact
)
822 if (t1
== NULL_TREE
) /* T1 is ... */
823 return t2
== NULL_TREE
|| !exact
;
824 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
825 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
826 if (t2
== NULL_TREE
) /* T2 is ... */
828 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
831 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
832 Count how many we find, to determine exactness. For exact matching and
833 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
835 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
837 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
839 tree a
= TREE_VALUE (probe
);
840 tree b
= TREE_VALUE (t2
);
842 if (comp_except_types (a
, b
, exact
))
844 if (probe
== base
&& exact
)
845 base
= TREE_CHAIN (probe
);
850 if (probe
== NULL_TREE
)
853 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
856 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
857 [] can match [size]. */
860 comp_array_types (tree t1
, tree t2
, bool allow_redeclaration
)
869 /* The type of the array elements must be the same. */
870 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
873 d1
= TYPE_DOMAIN (t1
);
874 d2
= TYPE_DOMAIN (t2
);
879 /* If one of the arrays is dimensionless, and the other has a
880 dimension, they are of different types. However, it is valid to
888 declarations for an array object can specify
889 array types that differ by the presence or absence of a major
890 array bound (_dcl.array_). */
892 return allow_redeclaration
;
894 /* Check that the dimensions are the same. */
896 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
898 max1
= TYPE_MAX_VALUE (d1
);
899 max2
= TYPE_MAX_VALUE (d2
);
900 if (processing_template_decl
&& !abi_version_at_least (2)
901 && !value_dependent_expression_p (max1
)
902 && !value_dependent_expression_p (max2
))
904 /* With abi-1 we do not fold non-dependent array bounds, (and
905 consequently mangle them incorrectly). We must therefore
906 fold them here, to verify the domains have the same
912 if (!cp_tree_equal (max1
, max2
))
918 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
919 is a bitwise-or of the COMPARE_* flags. */
922 comptypes (tree t1
, tree t2
, int strict
)
927 /* Suppress errors caused by previously reported errors. */
928 if (t1
== error_mark_node
|| t2
== error_mark_node
)
931 my_friendly_assert (TYPE_P (t1
) && TYPE_P (t2
), 20030623);
933 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
934 current instantiation. */
935 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
937 tree resolved
= resolve_typename_type (t1
, /*only_current_p=*/true);
939 if (resolved
!= error_mark_node
)
943 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
945 tree resolved
= resolve_typename_type (t2
, /*only_current_p=*/true);
947 if (resolved
!= error_mark_node
)
951 /* If either type is the internal version of sizetype, use the
953 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
954 && TYPE_ORIG_SIZE_TYPE (t1
))
955 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
957 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
958 && TYPE_ORIG_SIZE_TYPE (t2
))
959 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
961 if (TYPE_PTRMEMFUNC_P (t1
))
962 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
963 if (TYPE_PTRMEMFUNC_P (t2
))
964 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
966 /* Different classes of types can't be compatible. */
967 if (TREE_CODE (t1
) != TREE_CODE (t2
))
970 /* Qualifiers must match. For array types, we will check when we
971 recur on the array element types. */
972 if (TREE_CODE (t1
) != ARRAY_TYPE
973 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
975 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
978 /* Allow for two different type nodes which have essentially the same
979 definition. Note that we already checked for equality of the type
980 qualifiers (just above). */
982 if (TREE_CODE (t1
) != ARRAY_TYPE
983 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
986 if (!(*targetm
.comp_type_attributes
) (t1
, t2
))
989 switch (TREE_CODE (t1
))
991 case TEMPLATE_TEMPLATE_PARM
:
992 case BOUND_TEMPLATE_TEMPLATE_PARM
:
993 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
994 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
996 if (!comp_template_parms
997 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
998 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1000 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1002 /* Don't check inheritance. */
1003 strict
= COMPARE_STRICT
;
1008 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1009 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1010 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1011 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1014 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1016 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1022 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1023 strict
& ~COMPARE_REDECLARATION
))
1028 case REFERENCE_TYPE
:
1029 return same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
));
1033 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1035 return compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
));
1038 /* Target types must match incl. qualifiers. */
1039 return comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
));
1041 case TEMPLATE_TYPE_PARM
:
1042 return (TEMPLATE_TYPE_IDX (t1
) == TEMPLATE_TYPE_IDX (t2
)
1043 && TEMPLATE_TYPE_LEVEL (t1
) == TEMPLATE_TYPE_LEVEL (t2
));
1046 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1047 TYPENAME_TYPE_FULLNAME (t2
)))
1049 return same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
));
1051 case UNBOUND_CLASS_TEMPLATE
:
1052 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1054 return same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
));
1057 return same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
));
1060 return TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1061 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
));
1070 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1073 at_least_as_qualified_p (tree type1
, tree type2
)
1075 int q1
= cp_type_quals (type1
);
1076 int q2
= cp_type_quals (type2
);
1078 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1079 return (q1
& q2
) == q2
;
1082 /* Returns 1 if TYPE1 is more qualified than TYPE2. */
1085 more_qualified_p (tree type1
, tree type2
)
1087 int q1
= cp_type_quals (type1
);
1088 int q2
= cp_type_quals (type2
);
1090 return q1
!= q2
&& (q1
& q2
) == q2
;
1093 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1094 more cv-qualified that TYPE1, and 0 otherwise. */
1097 comp_cv_qualification (tree type1
, tree type2
)
1099 int q1
= cp_type_quals (type1
);
1100 int q2
= cp_type_quals (type2
);
1105 if ((q1
& q2
) == q2
)
1107 else if ((q1
& q2
) == q1
)
1113 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1114 subset of the cv-qualification signature of TYPE2, and the types
1115 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1118 comp_cv_qual_signature (tree type1
, tree type2
)
1120 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1122 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1128 /* If two types share a common base type, return that basetype.
1129 If there is not a unique most-derived base type, this function
1130 returns ERROR_MARK_NODE. */
1133 common_base_type (tree tt1
, tree tt2
)
1135 tree best
= NULL_TREE
;
1138 /* If one is a baseclass of another, that's good enough. */
1139 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1141 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1144 /* Otherwise, try to find a unique baseclass of TT1
1145 that is shared by TT2, and follow that down. */
1146 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt1
))-1; i
>= 0; i
--)
1148 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt1
), i
));
1149 tree trial
= common_base_type (basetype
, tt2
);
1153 if (trial
== error_mark_node
)
1155 if (best
== NULL_TREE
)
1157 else if (best
!= trial
)
1158 return error_mark_node
;
1163 for (i
= BINFO_N_BASE_BINFOS (TYPE_BINFO (tt2
))-1; i
>= 0; i
--)
1165 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt2
), i
));
1166 tree trial
= common_base_type (tt1
, basetype
);
1170 if (trial
== error_mark_node
)
1172 if (best
== NULL_TREE
)
1174 else if (best
!= trial
)
1175 return error_mark_node
;
1181 /* Subroutines of `comptypes'. */
1183 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1184 equivalent in the sense that functions with those parameter types
1185 can have equivalent types. The two lists must be equivalent,
1186 element by element. */
1189 compparms (tree parms1
, tree parms2
)
1193 /* An unspecified parmlist matches any specified parmlist
1194 whose argument types don't need default promotions. */
1196 for (t1
= parms1
, t2
= parms2
;
1198 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1200 /* If one parmlist is shorter than the other,
1201 they fail to match. */
1204 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1211 /* Process a sizeof or alignof expression where the operand is a
1215 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1217 enum tree_code type_code
;
1219 const char *op_name
;
1221 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
1222 if (type
== error_mark_node
)
1223 return error_mark_node
;
1225 if (processing_template_decl
)
1227 value
= build_min (op
, size_type_node
, type
);
1228 TREE_READONLY (value
) = 1;
1232 op_name
= operator_name_info
[(int) op
].name
;
1234 type
= non_reference (type
);
1235 type_code
= TREE_CODE (type
);
1237 if (type_code
== METHOD_TYPE
)
1239 if (complain
&& (pedantic
|| warn_pointer_arith
))
1240 pedwarn ("invalid application of `%s' to a member function", op_name
);
1241 value
= size_one_node
;
1244 value
= c_sizeof_or_alignof_type (complete_type (type
), op
, complain
);
1249 /* Process a sizeof or alignof expression where the operand is an
1253 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
)
1255 const char *op_name
= operator_name_info
[(int) op
].name
;
1257 if (e
== error_mark_node
)
1258 return error_mark_node
;
1260 if (processing_template_decl
)
1262 e
= build_min (op
, size_type_node
, e
);
1263 TREE_SIDE_EFFECTS (e
) = 0;
1264 TREE_READONLY (e
) = 1;
1269 if (TREE_CODE (e
) == COMPONENT_REF
1270 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1271 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1273 error ("invalid application of `%s' to a bit-field", op_name
);
1276 else if (is_overloaded_fn (e
))
1278 pedwarn ("ISO C++ forbids applying `%s' to an expression of function type", op_name
);
1281 else if (type_unknown_p (e
))
1283 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1289 return cxx_sizeof_or_alignof_type (e
, op
, true);
1293 /* EXPR is being used in a context that is not a function call.
1298 The expression can be used only as the left-hand operand of a
1299 member function call.
1301 [expr.mptr.operator]
1303 If the result of .* or ->* is a function, then that result can be
1304 used only as the operand for the function call operator ().
1306 by issuing an error message if appropriate. Returns true iff EXPR
1307 violates these rules. */
1310 invalid_nonstatic_memfn_p (tree expr
)
1312 if (TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
)
1314 error ("invalid use of non-static member function");
1320 /* Perform the conversions in [expr] that apply when an lvalue appears
1321 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1322 function-to-pointer conversions.
1324 In addition manifest constants are replaced by their values. */
1327 decay_conversion (tree exp
)
1330 enum tree_code code
;
1332 type
= TREE_TYPE (exp
);
1333 code
= TREE_CODE (type
);
1335 if (code
== REFERENCE_TYPE
)
1337 exp
= convert_from_reference (exp
);
1338 type
= TREE_TYPE (exp
);
1339 code
= TREE_CODE (type
);
1342 if (type
== error_mark_node
)
1343 return error_mark_node
;
1345 if (type_unknown_p (exp
))
1347 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1348 return error_mark_node
;
1351 /* Constants can be used directly unless they're not loadable. */
1352 if (TREE_CODE (exp
) == CONST_DECL
)
1353 exp
= DECL_INITIAL (exp
);
1354 /* Replace a nonvolatile const static variable with its value. We
1355 don't do this for arrays, though; we want the address of the
1356 first element of the array, not the address of the first element
1357 of its initializing constant. */
1358 else if (code
!= ARRAY_TYPE
)
1360 exp
= decl_constant_value (exp
);
1361 type
= TREE_TYPE (exp
);
1364 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1365 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1367 if (code
== VOID_TYPE
)
1369 error ("void value not ignored as it ought to be");
1370 return error_mark_node
;
1372 if (invalid_nonstatic_memfn_p (exp
))
1373 return error_mark_node
;
1374 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1375 return build_unary_op (ADDR_EXPR
, exp
, 0);
1376 if (code
== ARRAY_TYPE
)
1381 if (TREE_CODE (exp
) == INDIRECT_REF
)
1382 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1383 TREE_OPERAND (exp
, 0));
1385 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1387 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1388 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1389 TREE_OPERAND (exp
, 0), op1
);
1393 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1395 error ("invalid use of non-lvalue array");
1396 return error_mark_node
;
1399 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1401 if (TREE_CODE (exp
) == VAR_DECL
)
1403 if (!cxx_mark_addressable (exp
))
1404 return error_mark_node
;
1405 adr
= build_nop (ptrtype
, build_address (exp
));
1408 /* This way is better for a COMPONENT_REF since it can
1409 simplify the offset for a component. */
1410 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1411 return cp_convert (ptrtype
, adr
);
1414 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1415 rvalues always have cv-unqualified types. */
1416 if (! CLASS_TYPE_P (type
))
1417 exp
= cp_convert (TYPE_MAIN_VARIANT (type
), exp
);
1423 default_conversion (tree exp
)
1425 exp
= decay_conversion (exp
);
1427 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1428 exp
= perform_integral_promotions (exp
);
1433 /* EXPR is an expression with an integral or enumeration type.
1434 Perform the integral promotions in [conv.prom], and return the
1438 perform_integral_promotions (tree expr
)
1443 type
= TREE_TYPE (expr
);
1444 my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
), 20030703);
1445 promoted_type
= type_promotes_to (type
);
1446 if (type
!= promoted_type
)
1447 expr
= cp_convert (promoted_type
, expr
);
1451 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1455 inline_conversion (tree exp
)
1457 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1458 exp
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (exp
)), exp
);
1463 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1464 decay_conversion to one. */
1467 string_conv_p (tree totype
, tree exp
, int warn
)
1471 if (! flag_const_strings
|| TREE_CODE (totype
) != POINTER_TYPE
)
1474 t
= TREE_TYPE (totype
);
1475 if (!same_type_p (t
, char_type_node
)
1476 && !same_type_p (t
, wchar_type_node
))
1479 if (TREE_CODE (exp
) == STRING_CST
)
1481 /* Make sure that we don't try to convert between char and wchar_t. */
1482 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1487 /* Is this a string constant which has decayed to 'const char *'? */
1488 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1489 if (!same_type_p (TREE_TYPE (exp
), t
))
1492 if (TREE_CODE (exp
) != ADDR_EXPR
1493 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1497 /* This warning is not very useful, as it complains about printf. */
1498 if (warn
&& warn_write_strings
)
1499 warning ("deprecated conversion from string constant to `%T'", totype
);
1504 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1505 can, for example, use as an lvalue. This code used to be in
1506 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1507 expressions, where we're dealing with aggregates. But now it's again only
1508 called from unary_complex_lvalue. The case (in particular) that led to
1509 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1513 rationalize_conditional_expr (enum tree_code code
, tree t
)
1515 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1516 the first operand is always the one to be used if both operands
1517 are equal, so we know what conditional expression this used to be. */
1518 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1521 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1522 ? LE_EXPR
: GE_EXPR
),
1523 TREE_OPERAND (t
, 0),
1524 TREE_OPERAND (t
, 1),
1525 /*overloaded_p=*/NULL
),
1526 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1527 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1531 build_conditional_expr (TREE_OPERAND (t
, 0),
1532 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1533 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1536 /* Given the TYPE of an anonymous union field inside T, return the
1537 FIELD_DECL for the field. If not found return NULL_TREE. Because
1538 anonymous unions can nest, we must also search all anonymous unions
1539 that are directly reachable. */
1542 lookup_anon_field (tree t
, tree type
)
1546 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1548 if (TREE_STATIC (field
))
1550 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
1553 /* If we find it directly, return the field. */
1554 if (DECL_NAME (field
) == NULL_TREE
1555 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
1560 /* Otherwise, it could be nested, search harder. */
1561 if (DECL_NAME (field
) == NULL_TREE
1562 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1564 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1572 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1573 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1574 non-NULL, it indicates the path to the base used to name MEMBER.
1575 If PRESERVE_REFERENCE is true, the expression returned will have
1576 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1577 returned will have the type referred to by the reference.
1579 This function does not perform access control; that is either done
1580 earlier by the parser when the name of MEMBER is resolved to MEMBER
1581 itself, or later when overload resolution selects one of the
1582 functions indicated by MEMBER. */
1585 build_class_member_access_expr (tree object
, tree member
,
1586 tree access_path
, bool preserve_reference
)
1590 tree result
= NULL_TREE
;
1592 if (object
== error_mark_node
|| member
== error_mark_node
)
1593 return error_mark_node
;
1595 if (TREE_CODE (member
) == PSEUDO_DTOR_EXPR
)
1598 my_friendly_assert (DECL_P (member
) || BASELINK_P (member
),
1603 The type of the first expression shall be "class object" (of a
1605 object_type
= TREE_TYPE (object
);
1606 if (!currently_open_class (object_type
)
1607 && !complete_type_or_else (object_type
, object
))
1608 return error_mark_node
;
1609 if (!CLASS_TYPE_P (object_type
))
1611 error ("request for member `%D' in `%E', which is of non-class type `%T'",
1612 member
, object
, object_type
);
1613 return error_mark_node
;
1616 /* The standard does not seem to actually say that MEMBER must be a
1617 member of OBJECT_TYPE. However, that is clearly what is
1619 if (DECL_P (member
))
1621 member_scope
= DECL_CLASS_CONTEXT (member
);
1623 if (TREE_DEPRECATED (member
))
1624 warn_deprecated_use (member
);
1627 member_scope
= BINFO_TYPE (BASELINK_BINFO (member
));
1628 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1629 presently be the anonymous union. Go outwards until we find a
1630 type related to OBJECT_TYPE. */
1631 while (ANON_AGGR_TYPE_P (member_scope
)
1632 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
1634 member_scope
= TYPE_CONTEXT (member_scope
);
1635 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
1637 if (TREE_CODE (member
) == FIELD_DECL
)
1638 error ("invalid use of nonstatic data member '%E'", member
);
1640 error ("`%D' is not a member of `%T'", member
, object_type
);
1641 return error_mark_node
;
1644 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1645 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1646 in the frontend; only _DECLs and _REFs are lvalues in the backend. */
1648 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
1650 object
= build_indirect_ref (temp
, NULL
);
1653 /* In [expr.ref], there is an explicit list of the valid choices for
1654 MEMBER. We check for each of those cases here. */
1655 if (TREE_CODE (member
) == VAR_DECL
)
1657 /* A static data member. */
1659 /* If OBJECT has side-effects, they are supposed to occur. */
1660 if (TREE_SIDE_EFFECTS (object
))
1661 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
1663 else if (TREE_CODE (member
) == FIELD_DECL
)
1665 /* A non-static data member. */
1670 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
1671 && integer_zerop (TREE_OPERAND (object
, 0)));
1673 /* Convert OBJECT to the type of MEMBER. */
1674 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
1675 TYPE_MAIN_VARIANT (member_scope
)))
1680 binfo
= lookup_base (access_path
? access_path
: object_type
,
1681 member_scope
, ba_ignore
, &kind
);
1682 if (binfo
== error_mark_node
)
1683 return error_mark_node
;
1685 /* It is invalid to try to get to a virtual base of a
1686 NULL object. The most common cause is invalid use of
1688 if (null_object_p
&& kind
== bk_via_virtual
)
1690 error ("invalid access to non-static data member `%D' of NULL object",
1692 error ("(perhaps the `offsetof' macro was used incorrectly)");
1693 return error_mark_node
;
1696 /* Convert to the base. */
1697 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
1699 /* If we found the base successfully then we should be able
1700 to convert to it successfully. */
1701 my_friendly_assert (object
!= error_mark_node
,
1705 /* Complain about other invalid uses of offsetof, even though they will
1706 give the right answer. Note that we complain whether or not they
1707 actually used the offsetof macro, since there's no way to know at this
1708 point. So we just give a warning, instead of a pedwarn. */
1709 if (null_object_p
&& warn_invalid_offsetof
1710 && CLASSTYPE_NON_POD_P (object_type
)
1711 && ! skip_evaluation
)
1713 warning ("invalid access to non-static data member `%D' of NULL object",
1715 warning ("(perhaps the `offsetof' macro was used incorrectly)");
1718 /* If MEMBER is from an anonymous aggregate, we have converted
1719 OBJECT so that it refers to the class containing the
1720 anonymous union. Generate a reference to the anonymous union
1721 itself, and recur to find MEMBER. */
1722 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
1723 /* When this code is called from build_field_call, the
1724 object already has the type of the anonymous union.
1725 That is because the COMPONENT_REF was already
1726 constructed, and was then disassembled before calling
1727 build_field_call. After the function-call code is
1728 cleaned up, this waste can be eliminated. */
1729 && (!same_type_ignoring_top_level_qualifiers_p
1730 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
1732 tree anonymous_union
;
1734 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
1735 DECL_CONTEXT (member
));
1736 object
= build_class_member_access_expr (object
,
1738 /*access_path=*/NULL_TREE
,
1739 preserve_reference
);
1742 /* Compute the type of the field, as described in [expr.ref]. */
1743 type_quals
= TYPE_UNQUALIFIED
;
1744 member_type
= TREE_TYPE (member
);
1745 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
1747 type_quals
= (cp_type_quals (member_type
)
1748 | cp_type_quals (object_type
));
1750 /* A field is const (volatile) if the enclosing object, or the
1751 field itself, is const (volatile). But, a mutable field is
1752 not const, even within a const object. */
1753 if (DECL_MUTABLE_P (member
))
1754 type_quals
&= ~TYPE_QUAL_CONST
;
1755 member_type
= cp_build_qualified_type (member_type
, type_quals
);
1758 result
= fold (build3 (COMPONENT_REF
, member_type
, object
, member
,
1761 /* Mark the expression const or volatile, as appropriate. Even
1762 though we've dealt with the type above, we still have to mark the
1763 expression itself. */
1764 if (type_quals
& TYPE_QUAL_CONST
)
1765 TREE_READONLY (result
) = 1;
1766 else if (type_quals
& TYPE_QUAL_VOLATILE
)
1767 TREE_THIS_VOLATILE (result
) = 1;
1769 else if (BASELINK_P (member
))
1771 /* The member is a (possibly overloaded) member function. */
1775 /* If the MEMBER is exactly one static member function, then we
1776 know the type of the expression. Otherwise, we must wait
1777 until overload resolution has been performed. */
1778 functions
= BASELINK_FUNCTIONS (member
);
1779 if (TREE_CODE (functions
) == FUNCTION_DECL
1780 && DECL_STATIC_FUNCTION_P (functions
))
1781 type
= TREE_TYPE (functions
);
1783 type
= unknown_type_node
;
1784 /* Note that we do not convert OBJECT to the BASELINK_BINFO
1785 base. That will happen when the function is called. */
1786 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
1788 else if (TREE_CODE (member
) == CONST_DECL
)
1790 /* The member is an enumerator. */
1792 /* If OBJECT has side-effects, they are supposed to occur. */
1793 if (TREE_SIDE_EFFECTS (object
))
1794 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
1799 error ("invalid use of `%D'", member
);
1800 return error_mark_node
;
1803 if (!preserve_reference
)
1806 If E2 is declared to have type "reference to T", then ... the
1807 type of E1.E2 is T. */
1808 result
= convert_from_reference (result
);
1813 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
1814 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
1817 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
1819 tree object_type
= TREE_TYPE (object
);
1820 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
1823 if (scope
&& !check_dtor_name (scope
, dtor_name
))
1825 error ("qualified type `%T' does not match destructor name `~%T'",
1827 return error_mark_node
;
1829 if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
1831 error ("the type being destroyed is `%T', but the destructor refers to `%T'",
1832 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
1833 return error_mark_node
;
1835 if (!TYPE_HAS_DESTRUCTOR (dtor_type
))
1836 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
,
1838 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
1839 /*protect=*/1, /*want_type=*/false);
1840 expr
= (adjust_result_of_qualified_name_lookup
1841 (expr
, dtor_type
, object_type
));
1845 /* This function is called by the parser to process a class member
1846 access expression of the form OBJECT.NAME. NAME is a node used by
1847 the parser to represent a name; it is not yet a DECL. It may,
1848 however, be a BASELINK where the BASELINK_FUNCTIONS is a
1849 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
1850 there is no reason to do the lookup twice, so the parser keeps the
1854 finish_class_member_access_expr (tree object
, tree name
)
1859 tree access_path
= NULL_TREE
;
1860 tree orig_object
= object
;
1861 tree orig_name
= name
;
1863 if (object
== error_mark_node
|| name
== error_mark_node
)
1864 return error_mark_node
;
1866 object_type
= TREE_TYPE (object
);
1868 if (processing_template_decl
)
1870 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
1871 dependent_type_p (object_type
)
1872 /* If NAME is just an IDENTIFIER_NODE, then the expression
1874 || TREE_CODE (object
) == IDENTIFIER_NODE
1875 /* If NAME is "f<args>", where either 'f' or 'args' is
1876 dependent, then the expression is dependent. */
1877 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
1878 && dependent_template_id_p (TREE_OPERAND (name
, 0),
1879 TREE_OPERAND (name
, 1)))
1880 /* If NAME is "T::X" where "T" is dependent, then the
1881 expression is dependent. */
1882 || (TREE_CODE (name
) == SCOPE_REF
1883 && TYPE_P (TREE_OPERAND (name
, 0))
1884 && dependent_type_p (TREE_OPERAND (name
, 0))))
1885 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
1886 object
= build_non_dependent_expr (object
);
1889 if (TREE_CODE (object_type
) == REFERENCE_TYPE
)
1891 object
= convert_from_reference (object
);
1892 object_type
= TREE_TYPE (object
);
1897 The type of the first expression shall be "class object" (of a
1899 if (!currently_open_class (object_type
)
1900 && !complete_type_or_else (object_type
, object
))
1901 return error_mark_node
;
1902 if (!CLASS_TYPE_P (object_type
))
1904 error ("request for member `%D' in `%E', which is of non-class type `%T'",
1905 name
, object
, object_type
);
1906 return error_mark_node
;
1909 if (BASELINK_P (name
))
1911 /* A member function that has already been looked up. */
1912 my_friendly_assert ((TREE_CODE (BASELINK_FUNCTIONS (name
))
1913 == TEMPLATE_ID_EXPR
),
1919 bool is_template_id
= false;
1920 tree template_args
= NULL_TREE
;
1923 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
1925 is_template_id
= true;
1926 template_args
= TREE_OPERAND (name
, 1);
1927 name
= TREE_OPERAND (name
, 0);
1929 if (TREE_CODE (name
) == OVERLOAD
)
1930 name
= DECL_NAME (get_first_fn (name
));
1931 else if (DECL_P (name
))
1932 name
= DECL_NAME (name
);
1935 if (TREE_CODE (name
) == SCOPE_REF
)
1937 /* A qualified name. The qualifying class or namespace `S' has
1938 already been looked up; it is either a TYPE or a
1939 NAMESPACE_DECL. The member name is either an IDENTIFIER_NODE
1940 or a BIT_NOT_EXPR. */
1941 scope
= TREE_OPERAND (name
, 0);
1942 name
= TREE_OPERAND (name
, 1);
1943 my_friendly_assert ((CLASS_TYPE_P (scope
)
1944 || TREE_CODE (scope
) == NAMESPACE_DECL
),
1946 my_friendly_assert ((TREE_CODE (name
) == IDENTIFIER_NODE
1947 || TREE_CODE (name
) == BIT_NOT_EXPR
),
1950 /* If SCOPE is a namespace, then the qualified name does not
1951 name a member of OBJECT_TYPE. */
1952 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
1954 error ("`%D::%D' is not a member of `%T'",
1955 scope
, name
, object_type
);
1956 return error_mark_node
;
1959 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
1960 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
1961 if (access_path
== error_mark_node
)
1962 return error_mark_node
;
1965 error ("`%T' is not a base of `%T'", scope
, object_type
);
1966 return error_mark_node
;
1972 access_path
= object_type
;
1975 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
1976 member
= lookup_destructor (object
, scope
, name
);
1979 /* Look up the member. */
1980 member
= lookup_member (access_path
, name
, /*protect=*/1,
1981 /*want_type=*/false);
1982 if (member
== NULL_TREE
)
1984 error ("'%D' has no member named '%E'", object_type
, name
);
1985 return error_mark_node
;
1987 if (member
== error_mark_node
)
1988 return error_mark_node
;
1993 tree
template = member
;
1995 if (BASELINK_P (template))
1996 template = lookup_template_function (template, template_args
);
1999 error ("`%D' is not a member template function", name
);
2000 return error_mark_node
;
2005 if (TREE_DEPRECATED (member
))
2006 warn_deprecated_use (member
);
2008 expr
= build_class_member_access_expr (object
, member
, access_path
,
2009 /*preserve_reference=*/false);
2010 if (processing_template_decl
&& expr
!= error_mark_node
)
2011 return build_min_non_dep (COMPONENT_REF
, expr
,
2012 orig_object
, orig_name
, NULL_TREE
);
2016 /* Return an expression for the MEMBER_NAME field in the internal
2017 representation of PTRMEM, a pointer-to-member function. (Each
2018 pointer-to-member function type gets its own RECORD_TYPE so it is
2019 more convenient to access the fields by name than by FIELD_DECL.)
2020 This routine converts the NAME to a FIELD_DECL and then creates the
2021 node for the complete expression. */
2024 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2030 /* This code is a stripped down version of
2031 build_class_member_access_expr. It does not work to use that
2032 routine directly because it expects the object to be of class
2034 ptrmem_type
= TREE_TYPE (ptrmem
);
2035 my_friendly_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
), 20020804);
2036 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2037 /*want_type=*/false);
2038 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2039 cp_type_quals (ptrmem_type
));
2040 return fold (build3 (COMPONENT_REF
, member_type
,
2041 ptrmem
, member
, NULL_TREE
));
2044 /* Given an expression PTR for a pointer, return an expression
2045 for the value pointed to.
2046 ERRORSTRING is the name of the operator to appear in error messages.
2048 This function may need to overload OPERATOR_FNNAME.
2049 Must also handle REFERENCE_TYPEs for C++. */
2052 build_x_indirect_ref (tree expr
, const char *errorstring
)
2054 tree orig_expr
= expr
;
2057 if (processing_template_decl
)
2059 if (type_dependent_expression_p (expr
))
2060 return build_min_nt (INDIRECT_REF
, expr
);
2061 expr
= build_non_dependent_expr (expr
);
2064 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2065 NULL_TREE
, /*overloaded_p=*/NULL
);
2067 rval
= build_indirect_ref (expr
, errorstring
);
2069 if (processing_template_decl
&& rval
!= error_mark_node
)
2070 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2076 build_indirect_ref (tree ptr
, const char *errorstring
)
2080 if (ptr
== error_mark_node
)
2081 return error_mark_node
;
2083 if (ptr
== current_class_ptr
)
2084 return current_class_ref
;
2086 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2087 ? ptr
: decay_conversion (ptr
));
2088 type
= TREE_TYPE (pointer
);
2090 if (TYPE_PTR_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
2094 If the type of the expression is "pointer to T," the type
2095 of the result is "T."
2097 We must use the canonical variant because certain parts of
2098 the back end, like fold, do pointer comparisons between
2100 tree t
= canonical_type_variant (TREE_TYPE (type
));
2102 if (VOID_TYPE_P (t
))
2104 /* A pointer to incomplete type (other than cv void) can be
2105 dereferenced [expr.unary.op]/1 */
2106 error ("`%T' is not a pointer-to-object type", type
);
2107 return error_mark_node
;
2109 else if (TREE_CODE (pointer
) == ADDR_EXPR
2110 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2111 /* The POINTER was something like `&x'. We simplify `*&x' to
2113 return TREE_OPERAND (pointer
, 0);
2116 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2118 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2119 so that we get the proper error message if the result is used
2120 to assign to. Also, &* is supposed to be a no-op. */
2121 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2122 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2123 TREE_SIDE_EFFECTS (ref
)
2124 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2128 /* `pointer' won't be an error_mark_node if we were given a
2129 pointer to member, so it's cool to check for this here. */
2130 else if (TYPE_PTR_TO_MEMBER_P (type
))
2131 error ("invalid use of `%s' on pointer to member", errorstring
);
2132 else if (pointer
!= error_mark_node
)
2135 error ("invalid type argument of `%s'", errorstring
);
2137 error ("invalid type argument");
2139 return error_mark_node
;
2142 /* This handles expressions of the form "a[i]", which denotes
2145 This is logically equivalent in C to *(a+i), but we may do it differently.
2146 If A is a variable or a member, we generate a primitive ARRAY_REF.
2147 This avoids forcing the array out of registers, and can work on
2148 arrays that are not lvalues (for example, members of structures returned
2151 If INDEX is of some user-defined type, it must be converted to
2152 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2153 will inherit the type of the array, which will be some pointer type. */
2156 build_array_ref (tree array
, tree idx
)
2160 error ("subscript missing in array reference");
2161 return error_mark_node
;
2164 if (TREE_TYPE (array
) == error_mark_node
2165 || TREE_TYPE (idx
) == error_mark_node
)
2166 return error_mark_node
;
2168 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2170 switch (TREE_CODE (array
))
2174 tree value
= build_array_ref (TREE_OPERAND (array
, 1), idx
);
2175 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2176 TREE_OPERAND (array
, 0), value
);
2180 return build_conditional_expr
2181 (TREE_OPERAND (array
, 0),
2182 build_array_ref (TREE_OPERAND (array
, 1), idx
),
2183 build_array_ref (TREE_OPERAND (array
, 2), idx
));
2189 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2193 /* Subscripting with type char is likely to lose
2194 on a machine where chars are signed.
2195 So warn on any machine, but optionally.
2196 Don't warn for unsigned char since that type is safe.
2197 Don't warn for signed char because anyone who uses that
2198 must have done so deliberately. */
2199 if (warn_char_subscripts
2200 && TYPE_MAIN_VARIANT (TREE_TYPE (idx
)) == char_type_node
)
2201 warning ("array subscript has type `char'");
2203 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2205 error ("array subscript is not an integer");
2206 return error_mark_node
;
2209 /* Apply integral promotions *after* noticing character types.
2210 (It is unclear why we do these promotions -- the standard
2211 does not say that we should. In fact, the natual thing would
2212 seem to be to convert IDX to ptrdiff_t; we're performing
2213 pointer arithmetic.) */
2214 idx
= perform_integral_promotions (idx
);
2216 /* An array that is indexed by a non-constant
2217 cannot be stored in a register; we must be able to do
2218 address arithmetic on its address.
2219 Likewise an array of elements of variable size. */
2220 if (TREE_CODE (idx
) != INTEGER_CST
2221 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2222 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2225 if (!cxx_mark_addressable (array
))
2226 return error_mark_node
;
2229 /* An array that is indexed by a constant value which is not within
2230 the array bounds cannot be stored in a register either; because we
2231 would get a crash in store_bit_field/extract_bit_field when trying
2232 to access a non-existent part of the register. */
2233 if (TREE_CODE (idx
) == INTEGER_CST
2234 && TYPE_DOMAIN (TREE_TYPE (array
))
2235 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2237 if (!cxx_mark_addressable (array
))
2238 return error_mark_node
;
2241 if (pedantic
&& !lvalue_p (array
))
2242 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2244 /* Note in C++ it is valid to subscript a `register' array, since
2245 it is valid to take the address of something with that
2246 storage specification. */
2250 while (TREE_CODE (foo
) == COMPONENT_REF
)
2251 foo
= TREE_OPERAND (foo
, 0);
2252 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2253 warning ("subscripting array declared `register'");
2256 type
= TREE_TYPE (TREE_TYPE (array
));
2257 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2258 /* Array ref is const/volatile if the array elements are
2259 or if the array is.. */
2260 TREE_READONLY (rval
)
2261 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2262 TREE_SIDE_EFFECTS (rval
)
2263 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2264 TREE_THIS_VOLATILE (rval
)
2265 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2266 return require_complete_type (fold (rval
));
2270 tree ar
= default_conversion (array
);
2271 tree ind
= default_conversion (idx
);
2273 /* Put the integer in IND to simplify error checking. */
2274 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2281 if (ar
== error_mark_node
)
2284 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2286 error ("subscripted value is neither array nor pointer");
2287 return error_mark_node
;
2289 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2291 error ("array subscript is not an integer");
2292 return error_mark_node
;
2295 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR
, ar
, ind
),
2300 /* Resolve a pointer to member function. INSTANCE is the object
2301 instance to use, if the member points to a virtual member.
2303 This used to avoid checking for virtual functions if basetype
2304 has no virtual functions, according to an earlier ANSI draft.
2305 With the final ISO C++ rules, such an optimization is
2306 incorrect: A pointer to a derived member can be static_cast
2307 to pointer-to-base-member, as long as the dynamic object
2308 later has the right member. */
2311 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
2313 if (TREE_CODE (function
) == OFFSET_REF
)
2314 function
= TREE_OPERAND (function
, 1);
2316 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2318 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2319 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2321 tree instance_ptr
= *instance_ptrptr
;
2322 tree instance_save_expr
= 0;
2323 if (instance_ptr
== error_mark_node
)
2325 if (TREE_CODE (function
) == PTRMEM_CST
)
2327 /* Extracting the function address from a pmf is only
2328 allowed with -Wno-pmf-conversions. It only works for
2330 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
2331 e1
= convert (fntype
, e1
);
2336 error ("object missing in use of `%E'", function
);
2337 return error_mark_node
;
2341 if (TREE_SIDE_EFFECTS (instance_ptr
))
2342 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
2344 if (TREE_SIDE_EFFECTS (function
))
2345 function
= save_expr (function
);
2347 /* Start by extracting all the information from the PMF itself. */
2348 e3
= PFN_FROM_PTRMEMFUNC (function
);
2349 delta
= build_ptrmemfunc_access_expr (function
, delta_identifier
);
2350 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
2351 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
2353 case ptrmemfunc_vbit_in_pfn
:
2354 e1
= cp_build_binary_op (BIT_AND_EXPR
, idx
, integer_one_node
);
2355 idx
= cp_build_binary_op (MINUS_EXPR
, idx
, integer_one_node
);
2358 case ptrmemfunc_vbit_in_delta
:
2359 e1
= cp_build_binary_op (BIT_AND_EXPR
, delta
, integer_one_node
);
2360 delta
= cp_build_binary_op (RSHIFT_EXPR
, delta
, integer_one_node
);
2367 /* Convert down to the right base before using the instance. First
2369 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2370 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
2371 basetype
, ba_check
, NULL
);
2372 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
, 1);
2373 if (instance_ptr
== error_mark_node
)
2374 return error_mark_node
;
2375 /* ...and then the delta in the PMF. */
2376 instance_ptr
= build2 (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2377 instance_ptr
, delta
);
2379 /* Hand back the adjusted 'this' argument to our caller. */
2380 *instance_ptrptr
= instance_ptr
;
2382 /* Next extract the vtable pointer from the object. */
2383 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
2385 vtbl
= build_indirect_ref (vtbl
, NULL
);
2387 /* Finally, extract the function pointer from the vtable. */
2388 e2
= fold (build2 (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, idx
));
2389 e2
= build_indirect_ref (e2
, NULL
);
2390 TREE_CONSTANT (e2
) = 1;
2391 TREE_INVARIANT (e2
) = 1;
2393 /* When using function descriptors, the address of the
2394 vtable entry is treated as a function pointer. */
2395 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2396 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
2397 build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1));
2399 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2400 e1
= build_conditional_expr (e1
, e2
, e3
);
2402 /* Make sure this doesn't get evaluated first inside one of the
2403 branches of the COND_EXPR. */
2404 if (instance_save_expr
)
2405 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
2406 instance_save_expr
, e1
);
2414 build_function_call (tree function
, tree params
)
2416 tree fntype
, fndecl
;
2417 tree coerced_params
;
2418 tree name
= NULL_TREE
;
2420 tree original
= function
;
2422 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2423 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2424 if (TREE_CODE (function
) == NOP_EXPR
2425 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2426 function
= TREE_OPERAND (function
, 0);
2428 if (TREE_CODE (function
) == FUNCTION_DECL
)
2430 name
= DECL_NAME (function
);
2432 mark_used (function
);
2435 /* Convert anything with function type to a pointer-to-function. */
2436 if (pedantic
&& DECL_MAIN_P (function
))
2437 pedwarn ("ISO C++ forbids calling `::main' from within program");
2439 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2440 (because calling an inline function does not mean the function
2441 needs to be separately compiled). */
2443 if (DECL_INLINE (function
))
2444 function
= inline_conversion (function
);
2446 function
= build_addr_func (function
);
2452 function
= build_addr_func (function
);
2455 if (function
== error_mark_node
)
2456 return error_mark_node
;
2458 fntype
= TREE_TYPE (function
);
2460 if (TYPE_PTRMEMFUNC_P (fntype
))
2462 error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
2464 return error_mark_node
;
2467 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2468 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2470 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2471 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2473 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2475 error ("`%E' cannot be used as a function", original
);
2476 return error_mark_node
;
2479 /* fntype now gets the type of function pointed to. */
2480 fntype
= TREE_TYPE (fntype
);
2482 /* Convert the parameters to the types declared in the
2483 function prototype, or apply default promotions. */
2485 coerced_params
= convert_arguments (TYPE_ARG_TYPES (fntype
),
2486 params
, fndecl
, LOOKUP_NORMAL
);
2487 if (coerced_params
== error_mark_node
)
2488 return error_mark_node
;
2490 /* Check for errors in format strings and inappropriately
2493 check_function_arguments (TYPE_ATTRIBUTES (fntype
), coerced_params
);
2495 return build_cxx_call (function
, coerced_params
);
2498 /* Convert the actual parameter expressions in the list VALUES
2499 to the types in the list TYPELIST.
2500 If parmdecls is exhausted, or when an element has NULL as its type,
2501 perform the default conversions.
2503 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2505 This is also where warnings about wrong number of args are generated.
2507 Return a list of expressions for the parameters as converted.
2509 Both VALUES and the returned value are chains of TREE_LIST nodes
2510 with the elements of the list in the TREE_VALUE slots of those nodes.
2512 In C++, unspecified trailing parameters can be filled in with their
2513 default arguments, if such were specified. Do so here. */
2516 convert_arguments (tree typelist
, tree values
, tree fndecl
, int flags
)
2518 tree typetail
, valtail
;
2519 tree result
= NULL_TREE
;
2520 const char *called_thing
= 0;
2523 /* Argument passing is always copy-initialization. */
2524 flags
|= LOOKUP_ONLYCONVERTING
;
2528 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2530 if (DECL_NAME (fndecl
) == NULL_TREE
2531 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2532 called_thing
= "constructor";
2534 called_thing
= "member function";
2537 called_thing
= "function";
2540 for (valtail
= values
, typetail
= typelist
;
2542 valtail
= TREE_CHAIN (valtail
), i
++)
2544 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2545 tree val
= TREE_VALUE (valtail
);
2547 if (val
== error_mark_node
)
2548 return error_mark_node
;
2550 if (type
== void_type_node
)
2554 cp_error_at ("too many arguments to %s `%+#D'", called_thing
,
2556 error ("at this point in file");
2559 error ("too many arguments to function");
2560 /* In case anybody wants to know if this argument
2563 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2567 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2568 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2569 if (TREE_CODE (val
) == NOP_EXPR
2570 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
2571 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
2572 val
= TREE_OPERAND (val
, 0);
2574 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
2576 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
2577 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
2578 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2579 val
= decay_conversion (val
);
2582 if (val
== error_mark_node
)
2583 return error_mark_node
;
2587 /* Formal parm type is specified by a function prototype. */
2590 if (!COMPLETE_TYPE_P (complete_type (type
)))
2593 error ("parameter %P of `%D' has incomplete type `%T'",
2596 error ("parameter %P has incomplete type `%T'", i
, type
);
2597 parmval
= error_mark_node
;
2601 parmval
= convert_for_initialization
2602 (NULL_TREE
, type
, val
, flags
,
2603 "argument passing", fndecl
, i
);
2604 parmval
= convert_for_arg_passing (type
, parmval
);
2607 if (parmval
== error_mark_node
)
2608 return error_mark_node
;
2610 result
= tree_cons (NULL_TREE
, parmval
, result
);
2614 if (TREE_CODE (TREE_TYPE (val
)) == REFERENCE_TYPE
)
2615 val
= convert_from_reference (val
);
2617 if (fndecl
&& DECL_BUILT_IN (fndecl
)
2618 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
2619 /* Don't do ellipsis conversion for __built_in_constant_p
2620 as this will result in spurious warnings for non-POD
2622 val
= require_complete_type (val
);
2624 val
= convert_arg_to_ellipsis (val
);
2626 result
= tree_cons (NULL_TREE
, val
, result
);
2630 typetail
= TREE_CHAIN (typetail
);
2633 if (typetail
!= 0 && typetail
!= void_list_node
)
2635 /* See if there are default arguments that can be used. */
2636 if (TREE_PURPOSE (typetail
)
2637 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
2639 for (; typetail
!= void_list_node
; ++i
)
2642 = convert_default_arg (TREE_VALUE (typetail
),
2643 TREE_PURPOSE (typetail
),
2646 if (parmval
== error_mark_node
)
2647 return error_mark_node
;
2649 result
= tree_cons (0, parmval
, result
);
2650 typetail
= TREE_CHAIN (typetail
);
2651 /* ends with `...'. */
2652 if (typetail
== NULL_TREE
)
2660 cp_error_at ("too few arguments to %s `%+#D'",
2661 called_thing
, fndecl
);
2662 error ("at this point in file");
2665 error ("too few arguments to function");
2666 return error_mark_list
;
2670 return nreverse (result
);
2673 /* Build a binary-operation expression, after performing default
2674 conversions on the operands. CODE is the kind of expression to build. */
2677 build_x_binary_op (enum tree_code code
, tree arg1
, tree arg2
,
2687 if (processing_template_decl
)
2689 if (type_dependent_expression_p (arg1
)
2690 || type_dependent_expression_p (arg2
))
2691 return build_min_nt (code
, arg1
, arg2
);
2692 arg1
= build_non_dependent_expr (arg1
);
2693 arg2
= build_non_dependent_expr (arg2
);
2696 if (code
== DOTSTAR_EXPR
)
2697 expr
= build_m_component_ref (arg1
, arg2
);
2699 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
2702 if (processing_template_decl
&& expr
!= error_mark_node
)
2703 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
2708 /* Build a binary-operation expression without default conversions.
2709 CODE is the kind of expression to build.
2710 This function differs from `build' in several ways:
2711 the data type of the result is computed and recorded in it,
2712 warnings are generated if arg data types are invalid,
2713 special handling for addition and subtraction of pointers is known,
2714 and some optimization is done (operations on narrow ints
2715 are done in the narrower type when that gives the same result).
2716 Constant folding is also done before the result is returned.
2718 Note that the operands will never have enumeral types
2719 because either they have just had the default conversions performed
2720 or they have both just been converted to some other type in which
2721 the arithmetic is to be done.
2723 C++: must do special pointer arithmetic when implementing
2724 multiple inheritance, and deal with pointer to member functions. */
2727 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
2728 int convert_p ATTRIBUTE_UNUSED
)
2731 enum tree_code code0
, code1
;
2734 /* Expression code to give to the expression when it is built.
2735 Normally this is CODE, which is what the caller asked for,
2736 but in some special cases we change it. */
2737 enum tree_code resultcode
= code
;
2739 /* Data type in which the computation is to be performed.
2740 In the simplest cases this is the common type of the arguments. */
2741 tree result_type
= NULL
;
2743 /* Nonzero means operands have already been type-converted
2744 in whatever way is necessary.
2745 Zero means they need to be converted to RESULT_TYPE. */
2748 /* Nonzero means create the expression with this type, rather than
2750 tree build_type
= 0;
2752 /* Nonzero means after finally constructing the expression
2753 convert it to this type. */
2754 tree final_type
= 0;
2756 /* Nonzero if this is an operation like MIN or MAX which can
2757 safely be computed in short if both args are promoted shorts.
2758 Also implies COMMON.
2759 -1 indicates a bitwise operation; this makes a difference
2760 in the exact conditions for when it is safe to do the operation
2761 in a narrower mode. */
2764 /* Nonzero if this is a comparison operation;
2765 if both args are promoted shorts, compare the original shorts.
2766 Also implies COMMON. */
2767 int short_compare
= 0;
2769 /* Nonzero if this is a right-shift operation, which can be computed on the
2770 original short and then promoted if the operand is a promoted short. */
2771 int short_shift
= 0;
2773 /* Nonzero means set RESULT_TYPE to the common type of the args. */
2776 /* Apply default conversions. */
2780 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
2781 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
2782 || code
== TRUTH_XOR_EXPR
)
2784 if (!really_overloaded_fn (op0
))
2785 op0
= decay_conversion (op0
);
2786 if (!really_overloaded_fn (op1
))
2787 op1
= decay_conversion (op1
);
2791 if (!really_overloaded_fn (op0
))
2792 op0
= default_conversion (op0
);
2793 if (!really_overloaded_fn (op1
))
2794 op1
= default_conversion (op1
);
2797 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2798 STRIP_TYPE_NOPS (op0
);
2799 STRIP_TYPE_NOPS (op1
);
2801 /* DTRT if one side is an overloaded function, but complain about it. */
2802 if (type_unknown_p (op0
))
2804 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
2805 if (t
!= error_mark_node
)
2807 pedwarn ("assuming cast to type `%T' from overloaded function",
2812 if (type_unknown_p (op1
))
2814 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
2815 if (t
!= error_mark_node
)
2817 pedwarn ("assuming cast to type `%T' from overloaded function",
2823 type0
= TREE_TYPE (op0
);
2824 type1
= TREE_TYPE (op1
);
2826 /* The expression codes of the data types of the arguments tell us
2827 whether the arguments are integers, floating, pointers, etc. */
2828 code0
= TREE_CODE (type0
);
2829 code1
= TREE_CODE (type1
);
2831 /* If an error was already reported for one of the arguments,
2832 avoid reporting another error. */
2834 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
2835 return error_mark_node
;
2840 /* Handle the pointer + int case. */
2841 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2842 return cp_pointer_int_sum (PLUS_EXPR
, op0
, op1
);
2843 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
2844 return cp_pointer_int_sum (PLUS_EXPR
, op1
, op0
);
2850 /* Subtraction of two similar pointers.
2851 We must subtract them as integers, then divide by object size. */
2852 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
2853 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
2855 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
2856 /* Handle pointer minus int. Just like pointer plus int. */
2857 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2858 return cp_pointer_int_sum (MINUS_EXPR
, op0
, op1
);
2867 case TRUNC_DIV_EXPR
:
2869 case FLOOR_DIV_EXPR
:
2870 case ROUND_DIV_EXPR
:
2871 case EXACT_DIV_EXPR
:
2872 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
2873 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
2874 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2875 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
2877 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
2878 warning ("division by zero in `%E / 0'", op0
);
2879 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
2880 warning ("division by zero in `%E / 0.'", op0
);
2882 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
2883 code0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
2884 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
2885 code1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
2887 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
2888 resultcode
= RDIV_EXPR
;
2890 /* When dividing two signed integers, we have to promote to int.
2891 unless we divide by a constant != -1. Note that default
2892 conversion will have been performed on the operands at this
2893 point, so we have to dig out the original type to find out if
2895 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
2896 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
2897 || (TREE_CODE (op1
) == INTEGER_CST
2898 && ! integer_all_onesp (op1
)));
2907 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2911 case TRUNC_MOD_EXPR
:
2912 case FLOOR_MOD_EXPR
:
2913 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
2914 warning ("division by zero in `%E %% 0'", op0
);
2915 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
2916 warning ("division by zero in `%E %% 0.'", op0
);
2918 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2920 /* Although it would be tempting to shorten always here, that loses
2921 on some targets, since the modulo instruction is undefined if the
2922 quotient can't be represented in the computation mode. We shorten
2923 only if unsigned or if dividing by something we know != -1. */
2924 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
2925 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
2926 || (TREE_CODE (op1
) == INTEGER_CST
2927 && ! integer_all_onesp (op1
)));
2932 case TRUTH_ANDIF_EXPR
:
2933 case TRUTH_ORIF_EXPR
:
2934 case TRUTH_AND_EXPR
:
2936 result_type
= boolean_type_node
;
2939 /* Shift operations: result has same type as first operand;
2940 always convert second operand to int.
2941 Also set SHORT_SHIFT if shifting rightward. */
2944 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2946 result_type
= type0
;
2947 if (TREE_CODE (op1
) == INTEGER_CST
)
2949 if (tree_int_cst_lt (op1
, integer_zero_node
))
2950 warning ("right shift count is negative");
2953 if (! integer_zerop (op1
))
2955 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2956 warning ("right shift count >= width of type");
2959 /* Convert the shift-count to an integer, regardless of
2960 size of value being shifted. */
2961 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2962 op1
= cp_convert (integer_type_node
, op1
);
2963 /* Avoid converting op1 to result_type later. */
2969 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2971 result_type
= type0
;
2972 if (TREE_CODE (op1
) == INTEGER_CST
)
2974 if (tree_int_cst_lt (op1
, integer_zero_node
))
2975 warning ("left shift count is negative");
2976 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2977 warning ("left shift count >= width of type");
2979 /* Convert the shift-count to an integer, regardless of
2980 size of value being shifted. */
2981 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2982 op1
= cp_convert (integer_type_node
, op1
);
2983 /* Avoid converting op1 to result_type later. */
2990 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2992 result_type
= type0
;
2993 if (TREE_CODE (op1
) == INTEGER_CST
)
2995 if (tree_int_cst_lt (op1
, integer_zero_node
))
2996 warning ("%s rotate count is negative",
2997 (code
== LROTATE_EXPR
) ? "left" : "right");
2998 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2999 warning ("%s rotate count >= width of type",
3000 (code
== LROTATE_EXPR
) ? "left" : "right");
3002 /* Convert the shift-count to an integer, regardless of
3003 size of value being shifted. */
3004 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3005 op1
= cp_convert (integer_type_node
, op1
);
3011 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
3012 warning ("comparing floating point with == or != is unsafe");
3014 build_type
= boolean_type_node
;
3015 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3016 || code0
== COMPLEX_TYPE
)
3017 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3018 || code1
== COMPLEX_TYPE
))
3020 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3021 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3022 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3024 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3025 && null_ptr_cst_p (op1
))
3026 result_type
= type0
;
3027 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3028 && null_ptr_cst_p (op0
))
3029 result_type
= type1
;
3030 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3032 result_type
= type0
;
3033 error ("ISO C++ forbids comparison between pointer and integer");
3035 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3037 result_type
= type1
;
3038 error ("ISO C++ forbids comparison between pointer and integer");
3040 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3042 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3043 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3044 result_type
= TREE_TYPE (op0
);
3046 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3047 return cp_build_binary_op (code
, op1
, op0
);
3048 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3049 && same_type_p (type0
, type1
))
3051 /* E will be the final comparison. */
3053 /* E1 and E2 are for scratch. */
3061 if (TREE_SIDE_EFFECTS (op0
))
3062 op0
= save_expr (op0
);
3063 if (TREE_SIDE_EFFECTS (op1
))
3064 op1
= save_expr (op1
);
3069 && (!op0.pfn || op0.delta == op1.delta))
3071 The reason for the `!op0.pfn' bit is that a NULL
3072 pointer-to-member is any member with a zero PFN; the
3073 DELTA field is unspecified. */
3074 pfn0
= pfn_from_ptrmemfunc (op0
);
3075 pfn1
= pfn_from_ptrmemfunc (op1
);
3076 delta0
= build_ptrmemfunc_access_expr (op0
,
3078 delta1
= build_ptrmemfunc_access_expr (op1
,
3080 e1
= cp_build_binary_op (EQ_EXPR
, delta0
, delta1
);
3081 e2
= cp_build_binary_op (EQ_EXPR
,
3083 cp_convert (TREE_TYPE (pfn0
),
3084 integer_zero_node
));
3085 e1
= cp_build_binary_op (TRUTH_ORIF_EXPR
, e1
, e2
);
3086 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
3087 e
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, e2
, e1
);
3088 if (code
== EQ_EXPR
)
3090 return cp_build_binary_op (EQ_EXPR
, e
, integer_zero_node
);
3092 else if ((TYPE_PTRMEMFUNC_P (type0
)
3093 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
), type1
))
3094 || (TYPE_PTRMEMFUNC_P (type1
)
3095 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
), type0
)))
3101 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3102 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3104 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3105 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3113 build_type
= boolean_type_node
;
3114 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3115 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3117 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3118 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3120 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3121 && integer_zerop (op1
))
3122 result_type
= type0
;
3123 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3124 && integer_zerop (op0
))
3125 result_type
= type1
;
3126 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3128 result_type
= type0
;
3129 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3131 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3133 result_type
= type1
;
3134 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3138 case UNORDERED_EXPR
:
3145 build_type
= integer_type_node
;
3146 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
3148 error ("unordered comparison on non-floating point argument");
3149 return error_mark_node
;
3158 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3160 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
3162 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3164 if (shorten
|| common
|| short_compare
)
3165 result_type
= common_type (type0
, type1
);
3167 /* For certain operations (which identify themselves by shorten != 0)
3168 if both args were extended from the same smaller type,
3169 do the arithmetic in that type and then extend.
3171 shorten !=0 and !=1 indicates a bitwise operation.
3172 For them, this optimization is safe only if
3173 both args are zero-extended or both are sign-extended.
3174 Otherwise, we might change the result.
3175 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3176 but calculated in (unsigned short) it would be (unsigned short)-1. */
3178 if (shorten
&& none_complex
)
3180 int unsigned0
, unsigned1
;
3181 tree arg0
= get_narrower (op0
, &unsigned0
);
3182 tree arg1
= get_narrower (op1
, &unsigned1
);
3183 /* UNS is 1 if the operation to be done is an unsigned one. */
3184 int uns
= TYPE_UNSIGNED (result_type
);
3187 final_type
= result_type
;
3189 /* Handle the case that OP0 does not *contain* a conversion
3190 but it *requires* conversion to FINAL_TYPE. */
3192 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3193 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3194 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3195 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3197 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3199 /* For bitwise operations, signedness of nominal type
3200 does not matter. Consider only how operands were extended. */
3204 /* Note that in all three cases below we refrain from optimizing
3205 an unsigned operation on sign-extended args.
3206 That would not be valid. */
3208 /* Both args variable: if both extended in same way
3209 from same width, do it in that width.
3210 Do it unsigned if args were zero-extended. */
3211 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3212 < TYPE_PRECISION (result_type
))
3213 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3214 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3215 && unsigned0
== unsigned1
3216 && (unsigned0
|| !uns
))
3217 result_type
= c_common_signed_or_unsigned_type
3218 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
3219 else if (TREE_CODE (arg0
) == INTEGER_CST
3220 && (unsigned1
|| !uns
)
3221 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3222 < TYPE_PRECISION (result_type
))
3223 && (type
= c_common_signed_or_unsigned_type
3224 (unsigned1
, TREE_TYPE (arg1
)),
3225 int_fits_type_p (arg0
, type
)))
3227 else if (TREE_CODE (arg1
) == INTEGER_CST
3228 && (unsigned0
|| !uns
)
3229 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3230 < TYPE_PRECISION (result_type
))
3231 && (type
= c_common_signed_or_unsigned_type
3232 (unsigned0
, TREE_TYPE (arg0
)),
3233 int_fits_type_p (arg1
, type
)))
3237 /* Shifts can be shortened if shifting right. */
3242 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3244 final_type
= result_type
;
3246 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3247 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3249 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3250 /* We can shorten only if the shift count is less than the
3251 number of bits in the smaller type size. */
3252 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
3253 /* If arg is sign-extended and then unsigned-shifted,
3254 we can simulate this with a signed shift in arg's type
3255 only if the extended result is at least twice as wide
3256 as the arg. Otherwise, the shift could use up all the
3257 ones made by sign-extension and bring in zeros.
3258 We can't optimize that case at all, but in most machines
3259 it never happens because available widths are 2**N. */
3260 && (!TYPE_UNSIGNED (final_type
)
3262 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3263 <= TYPE_PRECISION (result_type
))))
3265 /* Do an unsigned shift if the operand was zero-extended. */
3267 = c_common_signed_or_unsigned_type (unsigned_arg
,
3269 /* Convert value-to-be-shifted to that type. */
3270 if (TREE_TYPE (op0
) != result_type
)
3271 op0
= cp_convert (result_type
, op0
);
3276 /* Comparison operations are shortened too but differently.
3277 They identify themselves by setting short_compare = 1. */
3281 /* Don't write &op0, etc., because that would prevent op0
3282 from being kept in a register.
3283 Instead, make copies of the our local variables and
3284 pass the copies by reference, then copy them back afterward. */
3285 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3286 enum tree_code xresultcode
= resultcode
;
3288 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3290 return cp_convert (boolean_type_node
, val
);
3291 op0
= xop0
, op1
= xop1
;
3293 resultcode
= xresultcode
;
3296 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
3297 && warn_sign_compare
3298 /* Do not warn until the template is instantiated; we cannot
3299 bound the ranges of the arguments until that point. */
3300 && !processing_template_decl
)
3302 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
3303 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3305 int unsignedp0
, unsignedp1
;
3306 tree primop0
= get_narrower (op0
, &unsignedp0
);
3307 tree primop1
= get_narrower (op1
, &unsignedp1
);
3309 /* Check for comparison of different enum types. */
3310 if (TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3311 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3312 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3313 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3315 warning ("comparison between types `%#T' and `%#T'",
3316 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3319 /* Give warnings for comparisons between signed and unsigned
3320 quantities that may fail. */
3321 /* Do the checking based on the original operand trees, so that
3322 casts will be considered, but default promotions won't be. */
3324 /* Do not warn if the comparison is being done in a signed type,
3325 since the signed type will only be chosen if it can represent
3326 all the values of the unsigned type. */
3327 if (!TYPE_UNSIGNED (result_type
))
3329 /* Do not warn if both operands are unsigned. */
3330 else if (op0_signed
== op1_signed
)
3332 /* Do not warn if the signed quantity is an unsuffixed
3333 integer literal (or some static constant expression
3334 involving such literals or a conditional expression
3335 involving such literals) and it is non-negative. */
3336 else if ((op0_signed
&& tree_expr_nonnegative_p (orig_op0
))
3337 || (op1_signed
&& tree_expr_nonnegative_p (orig_op1
)))
3339 /* Do not warn if the comparison is an equality operation,
3340 the unsigned quantity is an integral constant and it does
3341 not use the most significant bit of result_type. */
3342 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3343 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3344 && int_fits_type_p (orig_op1
, c_common_signed_type
3346 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3347 && int_fits_type_p (orig_op0
, c_common_signed_type
3351 warning ("comparison between signed and unsigned integer expressions");
3353 /* Warn if two unsigned values are being compared in a size
3354 larger than their original size, and one (and only one) is the
3355 result of a `~' operator. This comparison will always fail.
3357 Also warn if one operand is a constant, and the constant does not
3358 have all bits set that are set in the ~ operand when it is
3361 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3362 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3364 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3365 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3366 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3367 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3369 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
3372 HOST_WIDE_INT constant
, mask
;
3376 if (host_integerp (primop0
, 0))
3379 unsignedp
= unsignedp1
;
3380 constant
= tree_low_cst (primop0
, 0);
3385 unsignedp
= unsignedp0
;
3386 constant
= tree_low_cst (primop1
, 0);
3389 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3390 if (bits
< TYPE_PRECISION (result_type
)
3391 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3393 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3394 if ((mask
& constant
) != mask
)
3395 warning ("comparison of promoted ~unsigned with constant");
3398 else if (unsignedp0
&& unsignedp1
3399 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3400 < TYPE_PRECISION (result_type
))
3401 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3402 < TYPE_PRECISION (result_type
)))
3403 warning ("comparison of promoted ~unsigned with unsigned");
3408 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
3409 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3410 Then the expression will be built.
3411 It will be given type FINAL_TYPE if that is nonzero;
3412 otherwise, it will be given type RESULT_TYPE. */
3416 error ("invalid operands of types `%T' and `%T' to binary `%O'",
3417 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
3418 return error_mark_node
;
3421 /* Issue warnings about peculiar, but valid, uses of NULL. */
3422 if (/* It's reasonable to use pointer values as operands of &&
3423 and ||, so NULL is no exception. */
3424 !(code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
3425 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
3426 (orig_op0
== null_node
3427 && TREE_CODE (TREE_TYPE (op1
)) != POINTER_TYPE
)
3428 /* Or vice versa. */
3429 || (orig_op1
== null_node
3430 && TREE_CODE (TREE_TYPE (op0
)) != POINTER_TYPE
)
3431 /* Or, both are NULL and the operation was not a comparison. */
3432 || (orig_op0
== null_node
&& orig_op1
== null_node
3433 && code
!= EQ_EXPR
&& code
!= NE_EXPR
)))
3434 /* Some sort of arithmetic operation involving NULL was
3435 performed. Note that pointer-difference and pointer-addition
3436 have already been handled above, and so we don't end up here in
3438 warning ("NULL used in arithmetic");
3442 if (TREE_TYPE (op0
) != result_type
)
3443 op0
= cp_convert (result_type
, op0
);
3444 if (TREE_TYPE (op1
) != result_type
)
3445 op1
= cp_convert (result_type
, op1
);
3447 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3448 return error_mark_node
;
3451 if (build_type
== NULL_TREE
)
3452 build_type
= result_type
;
3455 tree result
= fold (build2 (resultcode
, build_type
, op0
, op1
));
3456 if (final_type
!= 0)
3457 result
= cp_convert (final_type
, result
);
3462 /* Return a tree for the sum or difference (RESULTCODE says which)
3463 of pointer PTROP and integer INTOP. */
3466 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3468 tree res_type
= TREE_TYPE (ptrop
);
3470 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3471 in certain circumstance (when it's valid to do so). So we need
3472 to make sure it's complete. We don't need to check here, if we
3473 can actually complete it at all, as those checks will be done in
3474 pointer_int_sum() anyway. */
3475 complete_type (TREE_TYPE (res_type
));
3477 return pointer_int_sum (resultcode
, ptrop
, fold (intop
));
3480 /* Return a tree for the difference of pointers OP0 and OP1.
3481 The resulting tree has type int. */
3484 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
3487 tree restype
= ptrdiff_type_node
;
3488 tree target_type
= TREE_TYPE (ptrtype
);
3490 if (!complete_type_or_else (target_type
, NULL_TREE
))
3491 return error_mark_node
;
3493 if (pedantic
|| warn_pointer_arith
)
3495 if (TREE_CODE (target_type
) == VOID_TYPE
)
3496 pedwarn ("ISO C++ forbids using pointer of type `void *' in subtraction");
3497 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3498 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3499 if (TREE_CODE (target_type
) == METHOD_TYPE
)
3500 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3503 /* First do the subtraction as integers;
3504 then drop through to build the divide operator. */
3506 op0
= cp_build_binary_op (MINUS_EXPR
,
3507 cp_convert (restype
, op0
),
3508 cp_convert (restype
, op1
));
3510 /* This generates an error if op1 is a pointer to an incomplete type. */
3511 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
3512 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3514 op1
= (TYPE_PTROB_P (ptrtype
)
3515 ? size_in_bytes (target_type
)
3516 : integer_one_node
);
3518 /* Do the division. */
3520 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
3521 return fold (result
);
3524 /* Construct and perhaps optimize a tree representation
3525 for a unary operation. CODE, a tree_code, specifies the operation
3526 and XARG is the operand. */
3529 build_x_unary_op (enum tree_code code
, tree xarg
)
3531 tree orig_expr
= xarg
;
3535 if (processing_template_decl
)
3537 if (type_dependent_expression_p (xarg
))
3538 return build_min_nt (code
, xarg
, NULL_TREE
);
3540 /* For non-dependent pointer-to-member, the SCOPE_REF will be
3541 processed during template substitution. Just compute the
3542 right type here and build an ADDR_EXPR around it for
3544 if (code
== ADDR_EXPR
&& TREE_CODE (xarg
) == SCOPE_REF
)
3547 if (TREE_TYPE (xarg
) == unknown_type_node
)
3548 type
= unknown_type_node
;
3549 else if (TREE_CODE (TREE_TYPE (xarg
)) == FUNCTION_TYPE
)
3550 type
= build_pointer_type (TREE_TYPE (xarg
));
3552 type
= build_ptrmem_type (TREE_OPERAND (xarg
, 0),
3554 return build_min (code
, type
, xarg
, NULL_TREE
);
3557 xarg
= build_non_dependent_expr (xarg
);
3562 /* [expr.unary.op] says:
3564 The address of an object of incomplete type can be taken.
3566 (And is just the ordinary address operator, not an overloaded
3567 "operator &".) However, if the type is a template
3568 specialization, we must complete the type at this point so that
3569 an overloaded "operator &" will be available if required. */
3570 if (code
== ADDR_EXPR
3571 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
3572 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
3573 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
3574 || (TREE_CODE (xarg
) == OFFSET_REF
)))
3575 /* Don't look for a function. */;
3577 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
3578 /*overloaded_p=*/NULL
);
3579 if (!exp
&& code
== ADDR_EXPR
)
3581 /* A pointer to member-function can be formed only by saying
3583 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
3584 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
3586 if (TREE_CODE (xarg
) != OFFSET_REF
)
3588 error ("invalid use of '%E' to form a pointer-to-member-function. Use a qualified-id.",
3590 return error_mark_node
;
3594 error ("parenthesis around '%E' cannot be used to form a pointer-to-member-function",
3596 PTRMEM_OK_P (xarg
) = 1;
3600 if (TREE_CODE (xarg
) == OFFSET_REF
)
3602 ptrmem
= PTRMEM_OK_P (xarg
);
3604 if (!ptrmem
&& !flag_ms_extensions
3605 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
3607 /* A single non-static member, make sure we don't allow a
3608 pointer-to-member. */
3609 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
3610 TREE_OPERAND (xarg
, 0),
3611 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
3612 PTRMEM_OK_P (xarg
) = ptrmem
;
3615 else if (TREE_CODE (xarg
) == TARGET_EXPR
)
3616 warning ("taking address of temporary");
3617 exp
= build_unary_op (ADDR_EXPR
, xarg
, 0);
3618 if (TREE_CODE (exp
) == ADDR_EXPR
)
3619 PTRMEM_OK_P (exp
) = ptrmem
;
3622 if (processing_template_decl
&& exp
!= error_mark_node
)
3623 return build_min_non_dep (code
, exp
, orig_expr
,
3624 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
3628 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
3629 constants, where a null value is represented by an INTEGER_CST of
3633 cp_truthvalue_conversion (tree expr
)
3635 tree type
= TREE_TYPE (expr
);
3636 if (TYPE_PTRMEM_P (type
))
3637 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
3639 return c_common_truthvalue_conversion (expr
);
3642 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
3645 condition_conversion (tree expr
)
3648 if (processing_template_decl
)
3650 t
= perform_implicit_conversion (boolean_type_node
, expr
);
3651 t
= fold (build1 (CLEANUP_POINT_EXPR
, boolean_type_node
, t
));
3655 /* Return an ADDR_EXPR giving the address of T. This function
3656 attempts no optimizations or simplifications; it is a low-level
3660 build_address (tree t
)
3664 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
3665 return error_mark_node
;
3667 addr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (t
)), t
);
3672 /* Return a NOP_EXPR converting EXPR to TYPE. */
3675 build_nop (tree type
, tree expr
)
3677 if (type
== error_mark_node
|| error_operand_p (expr
))
3679 return build1 (NOP_EXPR
, type
, expr
);
3682 /* C++: Must handle pointers to members.
3684 Perhaps type instantiation should be extended to handle conversion
3685 from aggregates to types we don't yet know we want? (Or are those
3686 cases typically errors which should be reported?)
3688 NOCONVERT nonzero suppresses the default promotions
3689 (such as from short to int). */
3692 build_unary_op (enum tree_code code
, tree xarg
, int noconvert
)
3694 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3697 const char *errstring
= NULL
;
3700 if (arg
== error_mark_node
)
3701 return error_mark_node
;
3706 /* This is used for unary plus, because a CONVERT_EXPR
3707 is enough to prevent anybody from looking inside for
3708 associativity, but won't generate any code. */
3709 if (!(arg
= build_expr_type_conversion
3710 (WANT_ARITH
| WANT_ENUM
| WANT_POINTER
, arg
, true)))
3711 errstring
= "wrong type argument to unary plus";
3715 arg
= default_conversion (arg
);
3716 arg
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (arg
), arg
);
3721 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3722 errstring
= "wrong type argument to unary minus";
3723 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
3724 arg
= perform_integral_promotions (arg
);
3728 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3732 arg
= default_conversion (arg
);
3734 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
3736 errstring
= "wrong type argument to bit-complement";
3737 else if (!noconvert
)
3738 arg
= perform_integral_promotions (arg
);
3742 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3743 errstring
= "wrong type argument to abs";
3744 else if (!noconvert
)
3745 arg
= default_conversion (arg
);
3749 /* Conjugating a real value is a no-op, but allow it anyway. */
3750 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
3751 errstring
= "wrong type argument to conjugation";
3752 else if (!noconvert
)
3753 arg
= default_conversion (arg
);
3756 case TRUTH_NOT_EXPR
:
3757 arg
= perform_implicit_conversion (boolean_type_node
, arg
);
3758 val
= invert_truthvalue (arg
);
3759 if (arg
!= error_mark_node
)
3761 errstring
= "in argument to unary !";
3768 if (TREE_CODE (arg
) == COMPLEX_CST
)
3769 return TREE_REALPART (arg
);
3770 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3771 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
3776 if (TREE_CODE (arg
) == COMPLEX_CST
)
3777 return TREE_IMAGPART (arg
);
3778 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3779 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
3781 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
3783 case PREINCREMENT_EXPR
:
3784 case POSTINCREMENT_EXPR
:
3785 case PREDECREMENT_EXPR
:
3786 case POSTDECREMENT_EXPR
:
3787 /* Handle complex lvalues (when permitted)
3788 by reduction to simpler cases. */
3790 val
= unary_complex_lvalue (code
, arg
);
3794 /* Increment or decrement the real part of the value,
3795 and don't change the imaginary part. */
3796 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3800 arg
= stabilize_reference (arg
);
3801 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
3802 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
3803 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
3804 build_unary_op (code
, real
, 1), imag
);
3807 /* Report invalid types. */
3809 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
3812 if (code
== PREINCREMENT_EXPR
)
3813 errstring
="no pre-increment operator for type";
3814 else if (code
== POSTINCREMENT_EXPR
)
3815 errstring
="no post-increment operator for type";
3816 else if (code
== PREDECREMENT_EXPR
)
3817 errstring
="no pre-decrement operator for type";
3819 errstring
="no post-decrement operator for type";
3823 /* Report something read-only. */
3825 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
3826 || TREE_READONLY (arg
))
3827 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
3828 || code
== POSTINCREMENT_EXPR
)
3829 ? "increment" : "decrement"),
3834 tree result_type
= TREE_TYPE (arg
);
3836 arg
= get_unwidened (arg
, 0);
3837 argtype
= TREE_TYPE (arg
);
3839 /* ARM $5.2.5 last annotation says this should be forbidden. */
3840 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
3841 pedwarn ("ISO C++ forbids %sing an enum",
3842 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3843 ? "increment" : "decrement");
3845 /* Compute the increment. */
3847 if (TREE_CODE (argtype
) == POINTER_TYPE
)
3849 tree type
= complete_type (TREE_TYPE (argtype
));
3851 if (!COMPLETE_OR_VOID_TYPE_P (type
))
3852 error ("cannot %s a pointer to incomplete type `%T'",
3853 ((code
== PREINCREMENT_EXPR
3854 || code
== POSTINCREMENT_EXPR
)
3855 ? "increment" : "decrement"), TREE_TYPE (argtype
));
3856 else if ((pedantic
|| warn_pointer_arith
)
3857 && !TYPE_PTROB_P (argtype
))
3858 pedwarn ("ISO C++ forbids %sing a pointer of type `%T'",
3859 ((code
== PREINCREMENT_EXPR
3860 || code
== POSTINCREMENT_EXPR
)
3861 ? "increment" : "decrement"), argtype
);
3862 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
3865 inc
= integer_one_node
;
3867 inc
= cp_convert (argtype
, inc
);
3869 /* Handle incrementing a cast-expression. */
3871 switch (TREE_CODE (arg
))
3876 case FIX_TRUNC_EXPR
:
3877 case FIX_FLOOR_EXPR
:
3878 case FIX_ROUND_EXPR
:
3881 tree incremented
, modify
, value
, compound
;
3882 if (! lvalue_p (arg
) && pedantic
)
3883 pedwarn ("cast to non-reference type used as lvalue");
3884 arg
= stabilize_reference (arg
);
3885 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
3888 value
= save_expr (arg
);
3889 incremented
= build2 (((code
== PREINCREMENT_EXPR
3890 || code
== POSTINCREMENT_EXPR
)
3891 ? PLUS_EXPR
: MINUS_EXPR
),
3892 argtype
, value
, inc
);
3894 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
3895 compound
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
),
3898 /* Eliminate warning about unused result of + or -. */
3899 TREE_NO_WARNING (compound
) = 1;
3907 /* Complain about anything else that is not a true lvalue. */
3908 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
3909 || code
== POSTINCREMENT_EXPR
)
3910 ? "increment" : "decrement")))
3911 return error_mark_node
;
3913 /* Forbid using -- on `bool'. */
3914 if (TREE_TYPE (arg
) == boolean_type_node
)
3916 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
3918 error ("invalid use of `--' on bool variable `%D'", arg
);
3919 return error_mark_node
;
3921 val
= boolean_increment (code
, arg
);
3924 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
3926 TREE_SIDE_EFFECTS (val
) = 1;
3927 return cp_convert (result_type
, val
);
3931 /* Note that this operation never does default_conversion
3932 regardless of NOCONVERT. */
3934 argtype
= lvalue_type (arg
);
3936 if (TREE_CODE (arg
) == OFFSET_REF
)
3939 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
3941 tree type
= build_pointer_type (TREE_TYPE (argtype
));
3942 arg
= build1 (CONVERT_EXPR
, type
, arg
);
3945 else if (pedantic
&& DECL_MAIN_P (arg
))
3947 pedwarn ("ISO C++ forbids taking address of function `::main'");
3949 /* Let &* cancel out to simplify resulting code. */
3950 if (TREE_CODE (arg
) == INDIRECT_REF
)
3952 /* We don't need to have `current_class_ptr' wrapped in a
3953 NON_LVALUE_EXPR node. */
3954 if (arg
== current_class_ref
)
3955 return current_class_ptr
;
3957 arg
= TREE_OPERAND (arg
, 0);
3958 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
3960 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
3961 arg
= build1 (CONVERT_EXPR
, type
, arg
);
3963 else if (lvalue_p (arg
))
3964 /* Don't let this be an lvalue. */
3965 return non_lvalue (arg
);
3969 /* For &x[y], return x+y. But, in a template, ARG may be an
3970 ARRAY_REF representing a non-dependent expression. In that
3971 case, there may be an overloaded "operator []" that will be
3972 chosen at instantiation time; we must not try to optimize
3974 if (TREE_CODE (arg
) == ARRAY_REF
&& !processing_template_decl
)
3976 if (!cxx_mark_addressable (TREE_OPERAND (arg
, 0)))
3977 return error_mark_node
;
3978 return cp_build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
3979 TREE_OPERAND (arg
, 1));
3982 /* Uninstantiated types are all functions. Taking the
3983 address of a function is a no-op, so just return the
3986 if (TREE_CODE (arg
) == IDENTIFIER_NODE
3987 && IDENTIFIER_OPNAME_P (arg
))
3990 /* We don't know the type yet, so just work around the problem.
3991 We know that this will resolve to an lvalue. */
3992 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
3995 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
3996 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
3998 /* They're trying to take the address of a unique non-static
3999 member function. This is ill-formed (except in MS-land),
4000 but let's try to DTRT.
4001 Note: We only handle unique functions here because we don't
4002 want to complain if there's a static overload; non-unique
4003 cases will be handled by instantiate_type. But we need to
4004 handle this case here to allow casts on the resulting PMF.
4005 We could defer this in non-MS mode, but it's easier to give
4006 a useful error here. */
4008 /* Inside constant member functions, the `this' pointer
4009 contains an extra const qualifier. TYPE_MAIN_VARIANT
4010 is used here to remove this const from the diagnostics
4011 and the created OFFSET_REF. */
4012 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4013 tree name
= DECL_NAME (get_first_fn (TREE_OPERAND (arg
, 1)));
4015 if (! flag_ms_extensions
)
4017 if (current_class_type
4018 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4019 /* An expression like &memfn. */
4020 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4021 " or parenthesized non-static member function to form"
4022 " a pointer to member function. Say `&%T::%D'",
4025 pedwarn ("ISO C++ forbids taking the address of a bound member"
4026 " function to form a pointer to member function."
4030 arg
= build_offset_ref (base
, name
, /*address_p=*/true);
4034 if (type_unknown_p (arg
))
4035 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4037 /* Handle complex lvalues (when permitted)
4038 by reduction to simpler cases. */
4039 val
= unary_complex_lvalue (code
, arg
);
4043 switch (TREE_CODE (arg
))
4048 case FIX_TRUNC_EXPR
:
4049 case FIX_FLOOR_EXPR
:
4050 case FIX_ROUND_EXPR
:
4052 if (! lvalue_p (arg
) && pedantic
)
4053 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4057 arg
= OVL_CURRENT (arg
);
4064 /* Allow the address of a constructor if all the elements
4066 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (arg
)
4067 && TREE_CONSTANT (arg
))
4069 /* Anything not already handled and not a true memory reference
4071 else if (TREE_CODE (argtype
) != FUNCTION_TYPE
4072 && TREE_CODE (argtype
) != METHOD_TYPE
4073 && !lvalue_or_else (arg
, "unary `&'"))
4074 return error_mark_node
;
4076 if (argtype
!= error_mark_node
)
4077 argtype
= build_pointer_type (argtype
);
4082 if (TREE_CODE (arg
) != COMPONENT_REF
4083 /* Inside a template, we are processing a non-dependent
4084 expression so we can just form an ADDR_EXPR with the
4086 || processing_template_decl
)
4087 addr
= build_address (arg
);
4088 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4090 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4092 /* We can only get here with a single static member
4094 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
4095 && DECL_STATIC_FUNCTION_P (fn
),
4098 addr
= build_address (fn
);
4099 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
4100 /* Do not lose object's side effects. */
4101 addr
= build2 (COMPOUND_EXPR
, TREE_TYPE (addr
),
4102 TREE_OPERAND (arg
, 0), addr
);
4104 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4106 error ("attempt to take address of bit-field structure member `%D'",
4107 TREE_OPERAND (arg
, 1));
4108 return error_mark_node
;
4112 /* Unfortunately we cannot just build an address
4113 expression here, because we would not handle
4114 address-constant-expressions or offsetof correctly. */
4115 tree field
= TREE_OPERAND (arg
, 1);
4116 tree rval
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
4117 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (rval
)),
4118 decl_type_context (field
),
4121 rval
= build_base_path (PLUS_EXPR
, rval
, binfo
, 1);
4122 rval
= build_nop (argtype
, rval
);
4123 addr
= fold (build2 (PLUS_EXPR
, argtype
, rval
,
4124 cp_convert (argtype
,
4125 byte_position (field
))));
4128 if (TREE_CODE (argtype
) == POINTER_TYPE
4129 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4131 build_ptrmemfunc_type (argtype
);
4132 addr
= build_ptrmemfunc (argtype
, addr
, 0);
4145 argtype
= TREE_TYPE (arg
);
4146 return fold (build1 (code
, argtype
, arg
));
4149 error ("%s", errstring
);
4150 return error_mark_node
;
4153 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4154 for certain kinds of expressions which are not really lvalues
4155 but which we can accept as lvalues.
4157 If ARG is not a kind of expression we can handle, return zero. */
4160 unary_complex_lvalue (enum tree_code code
, tree arg
)
4162 /* Handle (a, b) used as an "lvalue". */
4163 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4165 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4166 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4167 TREE_OPERAND (arg
, 0), real_result
);
4170 /* Handle (a ? b : c) used as an "lvalue". */
4171 if (TREE_CODE (arg
) == COND_EXPR
4172 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4173 return rationalize_conditional_expr (code
, arg
);
4175 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4176 if (TREE_CODE (arg
) == MODIFY_EXPR
4177 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4178 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4180 tree lvalue
= TREE_OPERAND (arg
, 0);
4181 if (TREE_SIDE_EFFECTS (lvalue
))
4183 lvalue
= stabilize_reference (lvalue
);
4184 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
4185 lvalue
, TREE_OPERAND (arg
, 1));
4187 return unary_complex_lvalue
4188 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
4191 if (code
!= ADDR_EXPR
)
4194 /* Handle (a = b) used as an "lvalue" for `&'. */
4195 if (TREE_CODE (arg
) == MODIFY_EXPR
4196 || TREE_CODE (arg
) == INIT_EXPR
)
4198 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4199 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4201 TREE_NO_WARNING (arg
) = 1;
4205 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4206 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4207 || TREE_CODE (arg
) == OFFSET_REF
)
4211 my_friendly_assert (TREE_CODE (arg
) != SCOPE_REF
, 313);
4213 if (TREE_CODE (arg
) != OFFSET_REF
)
4216 t
= TREE_OPERAND (arg
, 1);
4218 /* Check all this code for right semantics. */
4219 if (TREE_CODE (t
) == FUNCTION_DECL
)
4221 if (DECL_DESTRUCTOR_P (t
))
4222 error ("taking address of destructor");
4223 return build_unary_op (ADDR_EXPR
, t
, 0);
4225 if (TREE_CODE (t
) == VAR_DECL
)
4226 return build_unary_op (ADDR_EXPR
, t
, 0);
4231 if (TREE_OPERAND (arg
, 0)
4232 && ! is_dummy_object (TREE_OPERAND (arg
, 0))
4233 && TREE_CODE (t
) != FIELD_DECL
)
4235 error ("taking address of bound pointer-to-member expression");
4236 return error_mark_node
;
4238 if (!PTRMEM_OK_P (arg
))
4239 return build_unary_op (code
, arg
, 0);
4241 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4243 error ("cannot create pointer to reference member `%D'", t
);
4244 return error_mark_node
;
4247 type
= build_ptrmem_type (context_for_name_lookup (t
),
4249 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4255 /* We permit compiler to make function calls returning
4256 objects of aggregate type look like lvalues. */
4260 if (TREE_CODE (targ
) == SAVE_EXPR
)
4261 targ
= TREE_OPERAND (targ
, 0);
4263 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4265 if (TREE_CODE (arg
) == SAVE_EXPR
)
4268 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4269 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4272 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4273 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4274 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4277 /* Don't let anything else be handled specially. */
4281 /* Mark EXP saying that we need to be able to take the
4282 address of it; it should not be allocated in a register.
4283 Value is true if successful.
4285 C++: we do not allow `current_class_ptr' to be addressable. */
4288 cxx_mark_addressable (tree exp
)
4293 switch (TREE_CODE (x
))
4300 x
= TREE_OPERAND (x
, 0);
4304 if (x
== current_class_ptr
)
4306 error ("cannot take the address of `this', which is an rvalue expression");
4307 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
4313 /* Caller should not be trying to mark initialized
4314 constant fields addressable. */
4315 my_friendly_assert (DECL_LANG_SPECIFIC (x
) == 0
4316 || DECL_IN_AGGR_P (x
) == 0
4318 || DECL_EXTERNAL (x
), 314);
4323 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4324 && !DECL_ARTIFICIAL (x
) && extra_warnings
)
4325 warning ("address requested for `%D', which is declared `register'",
4327 TREE_ADDRESSABLE (x
) = 1;
4331 TREE_ADDRESSABLE (x
) = 1;
4335 TREE_ADDRESSABLE (x
) = 1;
4339 TREE_ADDRESSABLE (x
) = 1;
4340 cxx_mark_addressable (TREE_OPERAND (x
, 0));
4348 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4351 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
)
4353 tree orig_ifexp
= ifexp
;
4354 tree orig_op1
= op1
;
4355 tree orig_op2
= op2
;
4358 if (processing_template_decl
)
4360 /* The standard says that the expression is type-dependent if
4361 IFEXP is type-dependent, even though the eventual type of the
4362 expression doesn't dependent on IFEXP. */
4363 if (type_dependent_expression_p (ifexp
)
4364 /* As a GNU extension, the middle operand may be omitted. */
4365 || (op1
&& type_dependent_expression_p (op1
))
4366 || type_dependent_expression_p (op2
))
4367 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4368 ifexp
= build_non_dependent_expr (ifexp
);
4370 op1
= build_non_dependent_expr (op1
);
4371 op2
= build_non_dependent_expr (op2
);
4374 expr
= build_conditional_expr (ifexp
, op1
, op2
);
4375 if (processing_template_decl
&& expr
!= error_mark_node
)
4376 return build_min_non_dep (COND_EXPR
, expr
,
4377 orig_ifexp
, orig_op1
, orig_op2
);
4381 /* Given a list of expressions, return a compound expression
4382 that performs them all and returns the value of the last of them. */
4384 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
4386 tree expr
= TREE_VALUE (list
);
4388 if (TREE_CHAIN (list
))
4391 pedwarn ("%s expression list treated as compound expression", msg
);
4393 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
4394 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
));
4400 /* Handle overloading of the ',' operator when needed. */
4403 build_x_compound_expr (tree op1
, tree op2
)
4406 tree orig_op1
= op1
;
4407 tree orig_op2
= op2
;
4409 if (processing_template_decl
)
4411 if (type_dependent_expression_p (op1
)
4412 || type_dependent_expression_p (op2
))
4413 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
4414 op1
= build_non_dependent_expr (op1
);
4415 op2
= build_non_dependent_expr (op2
);
4418 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
4419 /*overloaded_p=*/NULL
);
4421 result
= build_compound_expr (op1
, op2
);
4423 if (processing_template_decl
&& result
!= error_mark_node
)
4424 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
4429 /* Build a compound expression. */
4432 build_compound_expr (tree lhs
, tree rhs
)
4434 lhs
= decl_constant_value (lhs
);
4435 lhs
= convert_to_void (lhs
, "left-hand operand of comma");
4437 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
4438 return error_mark_node
;
4440 if (TREE_CODE (rhs
) == TARGET_EXPR
)
4442 /* If the rhs is a TARGET_EXPR, then build the compound
4443 expression inside the target_expr's initializer. This
4444 helps the compiler to eliminate unnecessary temporaries. */
4445 tree init
= TREE_OPERAND (rhs
, 1);
4447 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
4448 TREE_OPERAND (rhs
, 1) = init
;
4453 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
4456 /* Issue an error message if casting from SRC_TYPE to DEST_TYPE casts
4457 away constness. DESCRIPTION explains what operation is taking
4461 check_for_casting_away_constness (tree src_type
, tree dest_type
,
4462 const char *description
)
4464 if (casts_away_constness (src_type
, dest_type
))
4465 error ("%s from type `%T' to type `%T' casts away constness",
4466 description
, src_type
, dest_type
);
4469 /* Return an expression representing static_cast<TYPE>(EXPR). */
4472 build_static_cast (tree type
, tree expr
)
4477 if (type
== error_mark_node
|| expr
== error_mark_node
)
4478 return error_mark_node
;
4480 if (processing_template_decl
)
4482 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
4483 /* We don't know if it will or will not have side effects. */
4484 TREE_SIDE_EFFECTS (expr
) = 1;
4488 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4489 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4490 if (TREE_CODE (type
) != REFERENCE_TYPE
4491 && TREE_CODE (expr
) == NOP_EXPR
4492 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4493 expr
= TREE_OPERAND (expr
, 0);
4495 intype
= TREE_TYPE (expr
);
4497 /* [expr.static.cast]
4499 An lvalue of type "cv1 B", where B is a class type, can be cast
4500 to type "reference to cv2 D", where D is a class derived (clause
4501 _class.derived_) from B, if a valid standard conversion from
4502 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
4503 same cv-qualification as, or greater cv-qualification than, cv1,
4504 and B is not a virtual base class of D. */
4505 /* We check this case before checking the validity of "TYPE t =
4506 EXPR;" below because for this case:
4509 struct D : public B { D(const B&); };
4511 void f() { static_cast<const D&>(b); }
4513 we want to avoid constructing a new D. The standard is not
4514 completely clear about this issue, but our interpretation is
4515 consistent with other compilers. */
4516 if (TREE_CODE (type
) == REFERENCE_TYPE
4517 && CLASS_TYPE_P (TREE_TYPE (type
))
4518 && CLASS_TYPE_P (intype
)
4519 && real_lvalue_p (expr
)
4520 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
4521 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
4522 build_pointer_type (TYPE_MAIN_VARIANT
4523 (TREE_TYPE (type
))))
4524 && at_least_as_qualified_p (TREE_TYPE (type
), intype
))
4526 /* There is a standard conversion from "D*" to "B*" even if "B"
4527 is ambiguous or inaccessible. Therefore, we ask lookup_base
4528 to check these conditions. */
4529 tree base
= lookup_base (TREE_TYPE (type
), intype
, ba_check
, NULL
);
4531 /* Convert from "B*" to "D*". This function will check that "B"
4532 is not a virtual base of "D". */
4533 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
4534 base
, /*nonnull=*/false);
4535 /* Convert the pointer to a reference -- but then remember that
4536 there are no expressions with reference type in C++. */
4537 return convert_from_reference (build_nop (type
, expr
));
4540 /* [expr.static.cast]
4542 An expression e can be explicitly converted to a type T using a
4543 static_cast of the form static_cast<T>(e) if the declaration T
4544 t(e);" is well-formed, for some invented temporary variable
4546 result
= perform_direct_initialization_if_possible (type
, expr
);
4549 result
= convert_from_reference (result
);
4550 /* [expr.static.cast]
4552 If T is a reference type, the result is an lvalue; otherwise,
4553 the result is an rvalue. */
4554 if (TREE_CODE (type
) != REFERENCE_TYPE
4555 && real_lvalue_p (result
))
4556 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
4560 /* [expr.static.cast]
4562 Any expression can be explicitly converted to type cv void. */
4563 if (TREE_CODE (type
) == VOID_TYPE
)
4564 return convert_to_void (expr
, /*implicit=*/NULL
);
4566 /* [expr.static.cast]
4568 The inverse of any standard conversion sequence (clause _conv_),
4569 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
4570 (_conv.array_), function-to-pointer (_conv.func_), and boolean
4571 (_conv.bool_) conversions, can be performed explicitly using
4572 static_cast subject to the restriction that the explicit
4573 conversion does not cast away constness (_expr.const.cast_), and
4574 the following additional rules for specific cases: */
4575 /* For reference, the conversions not excluded are: integral
4576 promotions, floating point promotion, integral conversions,
4577 floating point conversions, floating-integral conversions,
4578 pointer conversions, and pointer to member conversions. */
4579 if ((ARITHMETIC_TYPE_P (type
) && ARITHMETIC_TYPE_P (intype
))
4582 A value of integral _or enumeration_ type can be explicitly
4583 converted to an enumeration type. */
4584 || (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
4585 && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)))
4586 /* Really, build_c_cast should defer to this function rather
4587 than the other way around. */
4588 return build_c_cast (type
, expr
);
4590 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
4591 && CLASS_TYPE_P (TREE_TYPE (type
))
4592 && CLASS_TYPE_P (TREE_TYPE (intype
))
4593 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
4594 (TREE_TYPE (intype
))),
4595 build_pointer_type (TYPE_MAIN_VARIANT
4596 (TREE_TYPE (type
)))))
4600 check_for_casting_away_constness (intype
, type
, "static_cast");
4601 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
), ba_check
,
4603 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
4606 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4607 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
4614 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
4615 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
4617 if (TYPE_PTRMEM_P (type
))
4619 t1
= (build_ptrmem_type
4621 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
4622 t2
= (build_ptrmem_type
4624 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
4631 if (can_convert (t1
, t2
))
4633 check_for_casting_away_constness (intype
, type
, "static_cast");
4634 if (TYPE_PTRMEM_P (type
))
4638 if (TREE_CODE (expr
) == PTRMEM_CST
)
4639 expr
= cplus_expand_constant (expr
);
4640 delta
= get_delta_difference (c1
, c2
, /*force=*/1);
4641 if (!integer_zerop (delta
))
4642 expr
= cp_build_binary_op (PLUS_EXPR
,
4643 build_nop (ptrdiff_type_node
, expr
),
4645 return build_nop (type
, expr
);
4648 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
4653 /* [expr.static.cast]
4655 An rvalue of type "pointer to cv void" can be explicitly
4656 converted to a pointer to object type. A value of type pointer
4657 to object converted to "pointer to cv void" and back to the
4658 original pointer type will have its original value. */
4659 if (TREE_CODE (intype
) == POINTER_TYPE
4660 && VOID_TYPE_P (TREE_TYPE (intype
))
4661 && TYPE_PTROB_P (type
))
4663 check_for_casting_away_constness (intype
, type
, "static_cast");
4664 return build_nop (type
, expr
);
4667 error ("invalid static_cast from type `%T' to type `%T'", intype
, type
);
4668 return error_mark_node
;
4672 build_reinterpret_cast (tree type
, tree expr
)
4676 if (type
== error_mark_node
|| expr
== error_mark_node
)
4677 return error_mark_node
;
4679 if (processing_template_decl
)
4681 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
4683 if (!TREE_SIDE_EFFECTS (t
)
4684 && type_dependent_expression_p (expr
))
4685 /* There might turn out to be side effects inside expr. */
4686 TREE_SIDE_EFFECTS (t
) = 1;
4690 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4692 expr
= decay_conversion (expr
);
4694 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4695 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4696 if (TREE_CODE (expr
) == NOP_EXPR
4697 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4698 expr
= TREE_OPERAND (expr
, 0);
4701 intype
= TREE_TYPE (expr
);
4703 if (TREE_CODE (type
) == REFERENCE_TYPE
)
4705 if (! real_lvalue_p (expr
))
4707 error ("invalid reinterpret_cast of an rvalue expression of type `%T' to type `%T'", intype
, type
);
4708 return error_mark_node
;
4710 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
4711 if (expr
!= error_mark_node
)
4712 expr
= build_reinterpret_cast
4713 (build_pointer_type (TREE_TYPE (type
)), expr
);
4714 if (expr
!= error_mark_node
)
4715 expr
= build_indirect_ref (expr
, 0);
4718 else if (same_type_ignoring_top_level_qualifiers_p (intype
, type
))
4719 return build_static_cast (type
, expr
);
4721 if (TYPE_PTR_P (type
) && (TREE_CODE (intype
) == INTEGER_TYPE
4722 || TREE_CODE (intype
) == ENUMERAL_TYPE
))
4724 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_PTR_P (intype
))
4726 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
4727 pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
4730 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
4731 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
4733 expr
= decl_constant_value (expr
);
4734 return fold (build1 (NOP_EXPR
, type
, expr
));
4736 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4737 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
4739 check_for_casting_away_constness (intype
, type
, "reinterpret_cast");
4740 expr
= decl_constant_value (expr
);
4741 return fold (build1 (NOP_EXPR
, type
, expr
));
4743 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
4744 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
4746 pedwarn ("ISO C++ forbids casting between pointer-to-function and pointer-to-object");
4747 expr
= decl_constant_value (expr
);
4748 return fold (build1 (NOP_EXPR
, type
, expr
));
4752 error ("invalid reinterpret_cast from type `%T' to type `%T'",
4754 return error_mark_node
;
4757 return cp_convert (type
, expr
);
4761 build_const_cast (tree type
, tree expr
)
4765 if (type
== error_mark_node
|| expr
== error_mark_node
)
4766 return error_mark_node
;
4768 if (processing_template_decl
)
4770 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
4772 if (!TREE_SIDE_EFFECTS (t
)
4773 && type_dependent_expression_p (expr
))
4774 /* There might turn out to be side effects inside expr. */
4775 TREE_SIDE_EFFECTS (t
) = 1;
4779 if (!POINTER_TYPE_P (type
) && !TYPE_PTRMEM_P (type
))
4780 error ("invalid use of const_cast with type `%T', which is not a pointer, reference, nor a pointer-to-data-member type", type
);
4781 else if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4783 error ("invalid use of const_cast with type `%T', which is a pointer or reference to a function type", type
);
4784 return error_mark_node
;
4787 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4789 expr
= decay_conversion (expr
);
4791 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4792 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4793 if (TREE_CODE (expr
) == NOP_EXPR
4794 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4795 expr
= TREE_OPERAND (expr
, 0);
4798 intype
= TREE_TYPE (expr
);
4800 if (same_type_ignoring_top_level_qualifiers_p (intype
, type
))
4801 return build_static_cast (type
, expr
);
4802 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
4804 if (! real_lvalue_p (expr
))
4806 error ("invalid const_cast of an rvalue of type `%T' to type `%T'", intype
, type
);
4807 return error_mark_node
;
4810 if (comp_ptr_ttypes_const (TREE_TYPE (type
), intype
))
4812 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
4813 expr
= build1 (NOP_EXPR
, type
, expr
);
4814 return convert_from_reference (expr
);
4817 else if (((TREE_CODE (type
) == POINTER_TYPE
4818 && TREE_CODE (intype
) == POINTER_TYPE
)
4819 || (TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
)))
4820 && comp_ptr_ttypes_const (TREE_TYPE (type
), TREE_TYPE (intype
)))
4821 return cp_convert (type
, expr
);
4823 error ("invalid const_cast from type `%T' to type `%T'", intype
, type
);
4824 return error_mark_node
;
4827 /* Build an expression representing a cast to type TYPE of expression EXPR.
4829 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
4830 when doing the cast. */
4833 build_c_cast (tree type
, tree expr
)
4838 if (type
== error_mark_node
|| expr
== error_mark_node
)
4839 return error_mark_node
;
4841 if (processing_template_decl
)
4843 tree t
= build_min (CAST_EXPR
, type
,
4844 tree_cons (NULL_TREE
, value
, NULL_TREE
));
4845 /* We don't know if it will or will not have side effects. */
4846 TREE_SIDE_EFFECTS (t
) = 1;
4850 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4851 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4852 if (TREE_CODE (type
) != REFERENCE_TYPE
4853 && TREE_CODE (value
) == NOP_EXPR
4854 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
4855 value
= TREE_OPERAND (value
, 0);
4857 if (TREE_CODE (type
) == ARRAY_TYPE
)
4859 /* Allow casting from T1* to T2[] because Cfront allows it.
4860 NIHCL uses it. It is not valid ISO C++ however. */
4861 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
4863 pedwarn ("ISO C++ forbids casting to an array type `%T'", type
);
4864 type
= build_pointer_type (TREE_TYPE (type
));
4868 error ("ISO C++ forbids casting to an array type `%T'", type
);
4869 return error_mark_node
;
4873 if (TREE_CODE (type
) == FUNCTION_TYPE
4874 || TREE_CODE (type
) == METHOD_TYPE
)
4876 error ("invalid cast to function type `%T'", type
);
4877 return error_mark_node
;
4880 if (TREE_CODE (type
) == VOID_TYPE
)
4882 /* Conversion to void does not cause any of the normal function to
4883 * pointer, array to pointer and lvalue to rvalue decays. */
4885 value
= convert_to_void (value
, /*implicit=*/NULL
);
4889 if (!complete_type_or_else (type
, NULL_TREE
))
4890 return error_mark_node
;
4892 /* Convert functions and arrays to pointers and
4893 convert references to their expanded types,
4894 but don't convert any other types. If, however, we are
4895 casting to a class type, there's no reason to do this: the
4896 cast will only succeed if there is a converting constructor,
4897 and the default conversions will be done at that point. In
4898 fact, doing the default conversion here is actually harmful
4902 struct S { S(const A&); };
4904 since we don't want the array-to-pointer conversion done. */
4905 if (!IS_AGGR_TYPE (type
))
4907 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
4908 || (TREE_CODE (TREE_TYPE (value
)) == METHOD_TYPE
4909 /* Don't do the default conversion on a ->* expression. */
4910 && ! (TREE_CODE (type
) == POINTER_TYPE
4911 && bound_pmf_p (value
)))
4912 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
4913 || TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
4914 value
= decay_conversion (value
);
4916 else if (TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
4917 /* However, even for class types, we still need to strip away
4918 the reference type, since the call to convert_force below
4919 does not expect the input expression to be of reference
4921 value
= convert_from_reference (value
);
4923 otype
= TREE_TYPE (value
);
4925 /* Optionally warn about potentially worrisome casts. */
4928 && TREE_CODE (type
) == POINTER_TYPE
4929 && TREE_CODE (otype
) == POINTER_TYPE
4930 && !at_least_as_qualified_p (TREE_TYPE (type
),
4932 warning ("cast from `%T' to `%T' discards qualifiers from pointer target type",
4935 if (TREE_CODE (type
) == INTEGER_TYPE
4936 && TYPE_PTR_P (otype
)
4937 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
4938 warning ("cast from pointer to integer of different size");
4940 if (TYPE_PTR_P (type
)
4941 && TREE_CODE (otype
) == INTEGER_TYPE
4942 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
4943 /* Don't warn about converting any constant. */
4944 && !TREE_CONSTANT (value
))
4945 warning ("cast to pointer from integer of different size");
4947 if (TREE_CODE (type
) == REFERENCE_TYPE
)
4948 value
= (convert_from_reference
4949 (convert_to_reference (type
, value
, CONV_C_CAST
,
4950 LOOKUP_COMPLAIN
, NULL_TREE
)));
4955 value
= decl_constant_value (value
);
4958 value
= convert_force (type
, value
, CONV_C_CAST
);
4960 /* Ignore any integer overflow caused by the cast. */
4961 if (TREE_CODE (value
) == INTEGER_CST
)
4963 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
4965 if (TREE_CODE_CLASS (TREE_CODE (ovalue
)) == 'c')
4966 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
4970 /* Warn about possible alignment problems. Do this here when we will have
4971 instantiated any necessary template types. */
4972 if (STRICT_ALIGNMENT
&& warn_cast_align
4973 && TREE_CODE (type
) == POINTER_TYPE
4974 && TREE_CODE (otype
) == POINTER_TYPE
4975 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
4976 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
4977 && COMPLETE_TYPE_P (TREE_TYPE (otype
))
4978 && COMPLETE_TYPE_P (TREE_TYPE (type
))
4979 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
4980 warning ("cast from `%T' to `%T' increases required alignment of target type",
4983 /* Always produce some operator for an explicit cast,
4984 so we can tell (for -pedantic) that the cast is no lvalue. */
4985 if (TREE_CODE (type
) != REFERENCE_TYPE
&& value
== expr
4986 && real_lvalue_p (value
))
4987 value
= non_lvalue (value
);
4992 /* Build an assignment expression of lvalue LHS from value RHS.
4993 MODIFYCODE is the code for a binary operator that we use
4994 to combine the old value of LHS with RHS to get the new value.
4995 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4997 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5000 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5004 tree lhstype
= TREE_TYPE (lhs
);
5005 tree olhstype
= lhstype
;
5006 tree olhs
= NULL_TREE
;
5007 bool plain_assign
= (modifycode
== NOP_EXPR
);
5009 /* Avoid duplicate error messages from operands that had errors. */
5010 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5011 return error_mark_node
;
5013 /* Handle control structure constructs used as "lvalues". */
5014 switch (TREE_CODE (lhs
))
5016 /* Handle --foo = 5; as these are valid constructs in C++. */
5017 case PREDECREMENT_EXPR
:
5018 case PREINCREMENT_EXPR
:
5019 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5020 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5021 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5022 TREE_OPERAND (lhs
, 1));
5023 return build2 (COMPOUND_EXPR
, lhstype
,
5025 build_modify_expr (TREE_OPERAND (lhs
, 0),
5028 /* Handle (a, b) used as an "lvalue". */
5030 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5032 if (newrhs
== error_mark_node
)
5033 return error_mark_node
;
5034 return build2 (COMPOUND_EXPR
, lhstype
,
5035 TREE_OPERAND (lhs
, 0), newrhs
);
5038 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5039 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5040 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5041 TREE_OPERAND (lhs
, 1));
5042 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5043 if (newrhs
== error_mark_node
)
5044 return error_mark_node
;
5045 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5047 /* Handle (a ? b : c) used as an "lvalue". */
5050 /* Produce (a ? (b = rhs) : (c = rhs))
5051 except that the RHS goes through a save-expr
5052 so the code to compute it is only emitted once. */
5054 tree preeval
= NULL_TREE
;
5056 rhs
= stabilize_expr (rhs
, &preeval
);
5058 /* Check this here to avoid odd errors when trying to convert
5059 a throw to the type of the COND_EXPR. */
5060 if (!lvalue_or_else (lhs
, "assignment"))
5061 return error_mark_node
;
5063 cond
= build_conditional_expr
5064 (TREE_OPERAND (lhs
, 0),
5065 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5066 TREE_OPERAND (lhs
, 1)),
5068 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5069 TREE_OPERAND (lhs
, 2)),
5072 if (cond
== error_mark_node
)
5074 /* Make sure the code to compute the rhs comes out
5075 before the split. */
5077 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
5085 if (modifycode
== INIT_EXPR
)
5087 if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5089 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
5090 /* Call convert to generate an error; see PR 11063. */
5091 rhs
= convert (lhstype
, rhs
);
5092 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
5093 TREE_SIDE_EFFECTS (result
) = 1;
5096 else if (! IS_AGGR_TYPE (lhstype
))
5097 /* Do the default thing. */;
5100 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
5101 build_tree_list (NULL_TREE
, rhs
),
5102 lhstype
, LOOKUP_NORMAL
);
5103 if (result
== NULL_TREE
)
5104 return error_mark_node
;
5110 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
)
5112 lhs
= convert_from_reference (lhs
);
5113 olhstype
= lhstype
= TREE_TYPE (lhs
);
5115 lhs
= require_complete_type (lhs
);
5116 if (lhs
== error_mark_node
)
5117 return error_mark_node
;
5119 if (modifycode
== NOP_EXPR
)
5121 /* `operator=' is not an inheritable operator. */
5122 if (! IS_AGGR_TYPE (lhstype
))
5123 /* Do the default thing. */;
5126 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
5127 lhs
, rhs
, make_node (NOP_EXPR
),
5128 /*overloaded_p=*/NULL
);
5129 if (result
== NULL_TREE
)
5130 return error_mark_node
;
5137 /* A binary op has been requested. Combine the old LHS
5138 value with the RHS producing the value we should actually
5139 store into the LHS. */
5141 my_friendly_assert (!PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
),
5143 lhs
= stabilize_reference (lhs
);
5144 newrhs
= cp_build_binary_op (modifycode
, lhs
, rhs
);
5145 if (newrhs
== error_mark_node
)
5147 error (" in evaluation of `%Q(%#T, %#T)'", modifycode
,
5148 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5149 return error_mark_node
;
5152 /* Now it looks like a plain assignment. */
5153 modifycode
= NOP_EXPR
;
5155 my_friendly_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
, 20011220);
5156 my_friendly_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
,
5160 /* The left-hand side must be an lvalue. */
5161 if (!lvalue_or_else (lhs
, "assignment"))
5162 return error_mark_node
;
5164 /* Warn about modifying something that is `const'. Don't warn if
5165 this is initialization. */
5166 if (modifycode
!= INIT_EXPR
5167 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
5168 /* Functions are not modifiable, even though they are
5170 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
5171 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
5172 /* If it's an aggregate and any field is const, then it is
5173 effectively const. */
5174 || (CLASS_TYPE_P (lhstype
)
5175 && C_TYPE_FIELDS_READONLY (lhstype
))))
5176 readonly_error (lhs
, "assignment", 0);
5178 /* If storing into a structure or union member, it has probably been
5179 given type `int'. Compute the type that would go with the actual
5180 amount of storage the member occupies. */
5182 if (TREE_CODE (lhs
) == COMPONENT_REF
5183 && (TREE_CODE (lhstype
) == INTEGER_TYPE
5184 || TREE_CODE (lhstype
) == REAL_TYPE
5185 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
5187 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
5189 /* If storing in a field that is in actuality a short or narrower
5190 than one, we must store in the field in its actual type. */
5192 if (lhstype
!= TREE_TYPE (lhs
))
5194 /* Avoid warnings converting integral types back into enums for
5196 if (TREE_CODE (lhstype
) == INTEGER_TYPE
5197 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
5199 if (TREE_SIDE_EFFECTS (lhs
))
5200 lhs
= stabilize_reference (lhs
);
5203 lhs
= copy_node (lhs
);
5204 TREE_TYPE (lhs
) = lhstype
;
5208 /* Convert new value to destination type. */
5210 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
5214 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
5215 TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))))
5217 error ("incompatible types in assignment of `%T' to `%T'",
5218 TREE_TYPE (rhs
), lhstype
);
5219 return error_mark_node
;
5222 /* Allow array assignment in compiler-generated code. */
5223 if (! DECL_ARTIFICIAL (current_function_decl
))
5224 pedwarn ("ISO C++ forbids assignment of arrays");
5226 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5227 ? 1 + (modifycode
!= INIT_EXPR
): 0;
5228 return build_vec_init (lhs
, NULL_TREE
, newrhs
, from_array
);
5231 if (modifycode
== INIT_EXPR
)
5232 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
5233 "initialization", NULL_TREE
, 0);
5236 /* Avoid warnings on enum bit fields. */
5237 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
5238 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
5240 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
5242 newrhs
= convert_force (lhstype
, newrhs
, 0);
5245 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
5247 if (TREE_CODE (newrhs
) == CALL_EXPR
5248 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
5249 newrhs
= build_cplus_new (lhstype
, newrhs
);
5251 /* Can't initialize directly from a TARGET_EXPR, since that would
5252 cause the lhs to be constructed twice, and possibly result in
5253 accidental self-initialization. So we force the TARGET_EXPR to be
5254 expanded without a target. */
5255 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
5256 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
5257 TREE_OPERAND (newrhs
, 0));
5260 if (newrhs
== error_mark_node
)
5261 return error_mark_node
;
5263 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
5264 lhstype
, lhs
, newrhs
);
5266 TREE_SIDE_EFFECTS (result
) = 1;
5268 TREE_NO_WARNING (result
) = 1;
5270 /* If we got the LHS in a different type for storing in,
5271 convert the result back to the nominal type of LHS
5272 so that the value we return always has the same type
5273 as the LHS argument. */
5275 if (olhstype
== TREE_TYPE (result
))
5279 result
= build2 (COMPOUND_EXPR
, olhstype
, result
, olhs
);
5280 TREE_NO_WARNING (result
) = 1;
5283 return convert_for_assignment (olhstype
, result
, "assignment",
5288 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
5290 if (processing_template_decl
)
5291 return build_min_nt (MODOP_EXPR
, lhs
,
5292 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
5294 if (modifycode
!= NOP_EXPR
)
5296 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
5297 make_node (modifycode
),
5298 /*overloaded_p=*/NULL
);
5301 TREE_NO_WARNING (rval
) = 1;
5305 return build_modify_expr (lhs
, modifycode
, rhs
);
5309 /* Get difference in deltas for different pointer to member function
5310 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
5311 the conversion is invalid, the constant is zero. If FORCE is true,
5312 then allow reverse conversions as well.
5314 Note that the naming of FROM and TO is kind of backwards; the return
5315 value is what we add to a TO in order to get a FROM. They are named
5316 this way because we call this function to find out how to convert from
5317 a pointer to member of FROM to a pointer to member of TO. */
5320 get_delta_difference (tree from
, tree to
, int force
)
5327 /* Assume no conversion is required. */
5328 result
= integer_zero_node
;
5329 binfo
= lookup_base (to
, from
, ba_check
, &kind
);
5330 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
5331 error (" in pointer to member function conversion");
5336 error_not_base_type (from
, to
);
5337 error (" in pointer to member conversion");
5341 binfo
= lookup_base (from
, to
, ba_check
, &kind
);
5344 virt_binfo
= binfo_from_vbase (binfo
);
5346 /* This is a reinterpret cast, we choose to do nothing. */
5347 warning ("pointer to member cast via virtual base `%T'",
5348 BINFO_TYPE (virt_binfo
));
5350 result
= size_diffop (size_zero_node
, BINFO_OFFSET (binfo
));
5356 virt_binfo
= binfo_from_vbase (binfo
);
5358 result
= BINFO_OFFSET (binfo
);
5361 /* This is a reinterpret cast, we choose to do nothing. */
5363 warning ("pointer to member cast via virtual base `%T'",
5364 BINFO_TYPE (virt_binfo
));
5366 error ("pointer to member conversion via virtual base `%T'",
5367 BINFO_TYPE (virt_binfo
));
5371 return fold (convert_to_integer (ptrdiff_type_node
, result
));
5374 /* Return a constructor for the pointer-to-member-function TYPE using
5375 the other components as specified. */
5378 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
5384 /* Pull the FIELD_DECLs out of the type. */
5385 pfn_field
= TYPE_FIELDS (type
);
5386 delta_field
= TREE_CHAIN (pfn_field
);
5388 /* Make sure DELTA has the type we want. */
5389 delta
= convert_and_check (delta_type_node
, delta
);
5391 /* Finish creating the initializer. */
5392 u
= tree_cons (pfn_field
, pfn
,
5393 build_tree_list (delta_field
, delta
));
5394 u
= build_constructor (type
, u
);
5395 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
5396 TREE_INVARIANT (u
) = TREE_INVARIANT (pfn
) & TREE_INVARIANT (delta
);
5397 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
5398 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
5400 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
5405 /* Build a constructor for a pointer to member function. It can be
5406 used to initialize global variables, local variable, or used
5407 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
5410 If FORCE is nonzero, then force this conversion, even if
5411 we would rather not do it. Usually set when using an explicit
5414 Return error_mark_node, if something goes wrong. */
5417 build_ptrmemfunc (tree type
, tree pfn
, int force
)
5423 if (error_operand_p (pfn
))
5424 return error_mark_node
;
5426 pfn_type
= TREE_TYPE (pfn
);
5427 to_type
= build_ptrmemfunc_type (type
);
5429 /* Handle multiple conversions of pointer to member functions. */
5430 if (TYPE_PTRMEMFUNC_P (pfn_type
))
5432 tree delta
= NULL_TREE
;
5433 tree npfn
= NULL_TREE
;
5437 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
))
5438 error ("invalid conversion to type `%T' from type `%T'",
5441 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
5442 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
5445 /* We don't have to do any conversion to convert a
5446 pointer-to-member to its own type. But, we don't want to
5447 just return a PTRMEM_CST if there's an explicit cast; that
5448 cast should make the expression an invalid template argument. */
5449 if (TREE_CODE (pfn
) != PTRMEM_CST
)
5451 if (same_type_p (to_type
, pfn_type
))
5453 else if (integer_zerop (n
))
5454 return build_reinterpret_cast (to_type
, pfn
);
5457 if (TREE_SIDE_EFFECTS (pfn
))
5458 pfn
= save_expr (pfn
);
5460 /* Obtain the function pointer and the current DELTA. */
5461 if (TREE_CODE (pfn
) == PTRMEM_CST
)
5462 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
5465 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
5466 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
5469 /* Just adjust the DELTA field. */
5471 (same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (delta
),
5474 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
5475 n
= cp_build_binary_op (LSHIFT_EXPR
, n
, integer_one_node
);
5476 delta
= cp_build_binary_op (PLUS_EXPR
, delta
, n
);
5477 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
5480 /* Handle null pointer to member function conversions. */
5481 if (integer_zerop (pfn
))
5483 pfn
= build_c_cast (type
, integer_zero_node
);
5484 return build_ptrmemfunc1 (to_type
,
5489 if (type_unknown_p (pfn
))
5490 return instantiate_type (type
, pfn
, tf_error
| tf_warning
);
5492 fn
= TREE_OPERAND (pfn
, 0);
5493 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 0);
5494 return make_ptrmem_cst (to_type
, fn
);
5497 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
5500 ??? There is no consistency as to the types returned for the above
5501 values. Some code acts as if it were a sizetype and some as if it were
5502 integer_type_node. */
5505 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
5507 tree type
= TREE_TYPE (cst
);
5508 tree fn
= PTRMEM_CST_MEMBER (cst
);
5509 tree ptr_class
, fn_class
;
5511 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 0);
5513 /* The class that the function belongs to. */
5514 fn_class
= DECL_CONTEXT (fn
);
5516 /* The class that we're creating a pointer to member of. */
5517 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
5519 /* First, calculate the adjustment to the function's class. */
5520 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0);
5522 if (!DECL_VIRTUAL_P (fn
))
5523 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
5526 /* If we're dealing with a virtual function, we have to adjust 'this'
5527 again, to point to the base which provides the vtable entry for
5528 fn; the call will do the opposite adjustment. */
5529 tree orig_class
= DECL_CONTEXT (fn
);
5530 tree binfo
= binfo_or_else (orig_class
, fn_class
);
5531 *delta
= fold (build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
5532 *delta
, BINFO_OFFSET (binfo
)));
5534 /* We set PFN to the vtable offset at which the function can be
5535 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
5536 case delta is shifted left, and then incremented). */
5537 *pfn
= DECL_VINDEX (fn
);
5538 *pfn
= fold (build2 (MULT_EXPR
, integer_type_node
, *pfn
,
5539 TYPE_SIZE_UNIT (vtable_entry_type
)));
5541 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
5543 case ptrmemfunc_vbit_in_pfn
:
5544 *pfn
= fold (build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
5548 case ptrmemfunc_vbit_in_delta
:
5549 *delta
= fold (build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
5550 *delta
, integer_one_node
));
5551 *delta
= fold (build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
5552 *delta
, integer_one_node
));
5559 *pfn
= fold (build1 (NOP_EXPR
, TYPE_PTRMEMFUNC_FN_TYPE (type
),
5564 /* Return an expression for PFN from the pointer-to-member function
5568 pfn_from_ptrmemfunc (tree t
)
5570 if (TREE_CODE (t
) == PTRMEM_CST
)
5575 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
5580 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
5583 /* Expression EXPR is about to be implicitly converted to TYPE. Warn
5584 if this is a potentially dangerous thing to do. Returns a possibly
5588 dubious_conversion_warnings (tree type
, tree expr
,
5589 const char *errtype
, tree fndecl
, int parmnum
)
5591 type
= non_reference (type
);
5593 /* Issue warnings about peculiar, but valid, uses of NULL. */
5594 if (ARITHMETIC_TYPE_P (type
) && expr
== null_node
)
5597 warning ("passing NULL used for non-pointer %s %P of `%D'",
5598 errtype
, parmnum
, fndecl
);
5600 warning ("%s to non-pointer type `%T' from NULL", errtype
, type
);
5603 /* Warn about assigning a floating-point type to an integer type. */
5604 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
5605 && TREE_CODE (type
) == INTEGER_TYPE
)
5608 warning ("passing `%T' for %s %P of `%D'",
5609 TREE_TYPE (expr
), errtype
, parmnum
, fndecl
);
5611 warning ("%s to `%T' from `%T'", errtype
, type
, TREE_TYPE (expr
));
5613 /* And warn about assigning a negative value to an unsigned
5615 else if (TYPE_UNSIGNED (type
) && TREE_CODE (type
) != BOOLEAN_TYPE
)
5617 if (TREE_CODE (expr
) == INTEGER_CST
&& TREE_NEGATED_INT (expr
))
5620 warning ("passing negative value `%E' for %s %P of `%D'",
5621 expr
, errtype
, parmnum
, fndecl
);
5623 warning ("%s of negative value `%E' to `%T'",
5624 errtype
, expr
, type
);
5627 overflow_warning (expr
);
5629 if (TREE_CONSTANT (expr
))
5635 /* Convert value RHS to type TYPE as preparation for an assignment to
5636 an lvalue of type TYPE. ERRTYPE is a string to use in error
5637 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
5638 are doing the conversion in order to pass the PARMNUMth argument of
5642 convert_for_assignment (tree type
, tree rhs
,
5643 const char *errtype
, tree fndecl
, int parmnum
)
5646 enum tree_code coder
;
5648 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
5649 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
5650 rhs
= TREE_OPERAND (rhs
, 0);
5652 rhstype
= TREE_TYPE (rhs
);
5653 coder
= TREE_CODE (rhstype
);
5655 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
5656 && vector_types_convertible_p (type
, rhstype
))
5657 return convert (type
, rhs
);
5659 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
5660 return error_mark_node
;
5661 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
5662 return error_mark_node
;
5664 /* The RHS of an assignment cannot have void type. */
5665 if (coder
== VOID_TYPE
)
5667 error ("void value not ignored as it ought to be");
5668 return error_mark_node
;
5671 /* Simplify the RHS if possible. */
5672 if (TREE_CODE (rhs
) == CONST_DECL
)
5673 rhs
= DECL_INITIAL (rhs
);
5675 /* We do not use decl_constant_value here because of this case:
5677 const char* const s = "s";
5679 The conversion rules for a string literal are more lax than for a
5680 variable; in particular, a string literal can be converted to a
5681 "char *" but the variable "s" cannot be converted in the same
5682 way. If the conversion is allowed, the optimization should be
5683 performed while creating the converted expression. */
5687 The expression is implicitly converted (clause _conv_) to the
5688 cv-unqualified type of the left operand.
5690 We allow bad conversions here because by the time we get to this point
5691 we are committed to doing the conversion. If we end up doing a bad
5692 conversion, convert_like will complain. */
5693 if (!can_convert_arg_bad (type
, rhstype
, rhs
))
5695 /* When -Wno-pmf-conversions is use, we just silently allow
5696 conversions from pointers-to-members to plain pointers. If
5697 the conversion doesn't work, cp_convert will complain. */
5699 && TYPE_PTR_P (type
)
5700 && TYPE_PTRMEMFUNC_P (rhstype
))
5701 rhs
= cp_convert (strip_top_quals (type
), rhs
);
5704 /* If the right-hand side has unknown type, then it is an
5705 overloaded function. Call instantiate_type to get error
5707 if (rhstype
== unknown_type_node
)
5708 instantiate_type (type
, rhs
, tf_error
| tf_warning
);
5710 error ("cannot convert `%T' to `%T' for argument `%P' to `%D'",
5711 rhstype
, type
, parmnum
, fndecl
);
5713 error ("cannot convert `%T' to `%T' in %s", rhstype
, type
,
5715 return error_mark_node
;
5718 return perform_implicit_conversion (strip_top_quals (type
), rhs
);
5721 /* Convert RHS to be of type TYPE.
5722 If EXP is nonzero, it is the target of the initialization.
5723 ERRTYPE is a string to use in error messages.
5725 Two major differences between the behavior of
5726 `convert_for_assignment' and `convert_for_initialization'
5727 are that references are bashed in the former, while
5728 copied in the latter, and aggregates are assigned in
5729 the former (operator=) while initialized in the
5732 If using constructor make sure no conversion operator exists, if one does
5733 exist, an ambiguity exists.
5735 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
5738 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
5739 const char *errtype
, tree fndecl
, int parmnum
)
5741 enum tree_code codel
= TREE_CODE (type
);
5743 enum tree_code coder
;
5745 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5746 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
5747 if (TREE_CODE (rhs
) == NOP_EXPR
5748 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
5749 && codel
!= REFERENCE_TYPE
)
5750 rhs
= TREE_OPERAND (rhs
, 0);
5752 if (rhs
== error_mark_node
5753 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
5754 return error_mark_node
;
5756 if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
5757 rhs
= convert_from_reference (rhs
);
5759 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
5760 && TREE_CODE (type
) != ARRAY_TYPE
5761 && (TREE_CODE (type
) != REFERENCE_TYPE
5762 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
5763 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
5764 && (TREE_CODE (type
) != REFERENCE_TYPE
5765 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
5766 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
5767 rhs
= decay_conversion (rhs
);
5769 rhstype
= TREE_TYPE (rhs
);
5770 coder
= TREE_CODE (rhstype
);
5772 if (coder
== ERROR_MARK
)
5773 return error_mark_node
;
5775 /* We accept references to incomplete types, so we can
5776 return here before checking if RHS is of complete type. */
5778 if (codel
== REFERENCE_TYPE
)
5780 /* This should eventually happen in convert_arguments. */
5781 int savew
= 0, savee
= 0;
5784 savew
= warningcount
, savee
= errorcount
;
5785 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
5789 if (warningcount
> savew
)
5790 cp_warning_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
5791 else if (errorcount
> savee
)
5792 cp_error_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
5798 exp
= require_complete_type (exp
);
5799 if (exp
== error_mark_node
)
5800 return error_mark_node
;
5802 rhstype
= non_reference (rhstype
);
5804 type
= complete_type (type
);
5806 if (IS_AGGR_TYPE (type
))
5807 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
5809 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
5812 /* If RETVAL is the address of, or a reference to, a local variable or
5813 temporary give an appropriate warning. */
5816 maybe_warn_about_returning_address_of_local (tree retval
)
5818 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
5819 tree whats_returned
= retval
;
5823 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
5824 whats_returned
= TREE_OPERAND (whats_returned
, 1);
5825 else if (TREE_CODE (whats_returned
) == CONVERT_EXPR
5826 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
5827 || TREE_CODE (whats_returned
) == NOP_EXPR
)
5828 whats_returned
= TREE_OPERAND (whats_returned
, 0);
5833 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
5835 whats_returned
= TREE_OPERAND (whats_returned
, 0);
5837 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
5839 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
5840 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
5842 warning ("returning reference to temporary");
5845 if (TREE_CODE (whats_returned
) == VAR_DECL
5846 && DECL_NAME (whats_returned
)
5847 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
5849 warning ("reference to non-lvalue returned");
5854 if (DECL_P (whats_returned
)
5855 && DECL_NAME (whats_returned
)
5856 && DECL_FUNCTION_SCOPE_P (whats_returned
)
5857 && !(TREE_STATIC (whats_returned
)
5858 || TREE_PUBLIC (whats_returned
)))
5860 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
5861 cp_warning_at ("reference to local variable `%D' returned",
5864 cp_warning_at ("address of local variable `%D' returned",
5870 /* Check that returning RETVAL from the current function is valid.
5871 Return an expression explicitly showing all conversions required to
5872 change RETVAL into the function return type, and to assign it to
5873 the DECL_RESULT for the function. */
5876 check_return_expr (tree retval
)
5879 /* The type actually returned by the function, after any
5882 int fn_returns_value_p
;
5884 /* A `volatile' function is one that isn't supposed to return, ever.
5885 (This is a G++ extension, used to get better code for functions
5886 that call the `volatile' function.) */
5887 if (TREE_THIS_VOLATILE (current_function_decl
))
5888 warning ("function declared `noreturn' has a `return' statement");
5890 /* Check for various simple errors. */
5891 if (DECL_DESTRUCTOR_P (current_function_decl
))
5894 error ("returning a value from a destructor");
5897 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
5899 if (in_function_try_handler
)
5900 /* If a return statement appears in a handler of the
5901 function-try-block of a constructor, the program is ill-formed. */
5902 error ("cannot return from a handler of a function-try-block of a constructor");
5904 /* You can't return a value from a constructor. */
5905 error ("returning a value from a constructor");
5909 if (processing_template_decl
)
5911 current_function_returns_value
= 1;
5915 /* When no explicit return-value is given in a function with a named
5916 return value, the named return value is used. */
5917 result
= DECL_RESULT (current_function_decl
);
5918 valtype
= TREE_TYPE (result
);
5919 my_friendly_assert (valtype
!= NULL_TREE
, 19990924);
5920 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
5921 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
5924 /* Check for a return statement with no return value in a function
5925 that's supposed to return a value. */
5926 if (!retval
&& fn_returns_value_p
)
5928 pedwarn ("return-statement with no value, in function returning '%T'",
5930 /* Clear this, so finish_function won't say that we reach the
5931 end of a non-void function (which we don't, we gave a
5933 current_function_returns_null
= 0;
5935 /* Check for a return statement with a value in a function that
5936 isn't supposed to return a value. */
5937 else if (retval
&& !fn_returns_value_p
)
5939 if (VOID_TYPE_P (TREE_TYPE (retval
)))
5940 /* You can return a `void' value from a function of `void'
5941 type. In that case, we have to evaluate the expression for
5942 its side-effects. */
5943 finish_expr_stmt (retval
);
5945 pedwarn ("return-statement with a value, in function "
5946 "returning 'void'");
5948 current_function_returns_null
= 1;
5950 /* There's really no value to return, after all. */
5954 /* Remember that this function can sometimes return without a
5956 current_function_returns_null
= 1;
5958 /* Remember that this function did return a value. */
5959 current_function_returns_value
= 1;
5961 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
5962 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
5963 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
5964 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
5966 && null_ptr_cst_p (retval
))
5967 warning ("`operator new' must not return NULL unless it is declared `throw()' (or -fcheck-new is in effect)");
5969 /* Effective C++ rule 15. See also start_function. */
5971 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
5975 /* The function return type must be a reference to the current
5977 if (TREE_CODE (valtype
) == REFERENCE_TYPE
5978 && same_type_ignoring_top_level_qualifiers_p
5979 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
5981 /* Returning '*this' is obviously OK. */
5982 if (retval
== current_class_ref
)
5984 /* If we are calling a function whose return type is the same of
5985 the current class reference, it is ok. */
5986 else if (TREE_CODE (retval
) == INDIRECT_REF
5987 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
5992 warning ("`operator=' should return a reference to `*this'");
5995 /* The fabled Named Return Value optimization, as per [class.copy]/15:
5997 [...] For a function with a class return type, if the expression
5998 in the return statement is the name of a local object, and the cv-
5999 unqualified type of the local object is the same as the function
6000 return type, an implementation is permitted to omit creating the tem-
6001 porary object to hold the function return value [...]
6003 So, if this is a value-returning function that always returns the same
6004 local variable, remember it.
6006 It might be nice to be more flexible, and choose the first suitable
6007 variable even if the function sometimes returns something else, but
6008 then we run the risk of clobbering the variable we chose if the other
6009 returned expression uses the chosen variable somehow. And people expect
6010 this restriction, anyway. (jason 2000-11-19)
6012 See finish_function and finalize_nrv for the rest of this optimization. */
6014 if (fn_returns_value_p
&& flag_elide_constructors
)
6016 if (retval
!= NULL_TREE
6017 && (current_function_return_value
== NULL_TREE
6018 || current_function_return_value
== retval
)
6019 && TREE_CODE (retval
) == VAR_DECL
6020 && DECL_CONTEXT (retval
) == current_function_decl
6021 && ! TREE_STATIC (retval
)
6022 && (DECL_ALIGN (retval
)
6023 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
6024 && same_type_p ((TYPE_MAIN_VARIANT
6025 (TREE_TYPE (retval
))),
6027 (TREE_TYPE (TREE_TYPE (current_function_decl
))))))
6028 current_function_return_value
= retval
;
6030 current_function_return_value
= error_mark_node
;
6033 /* We don't need to do any conversions when there's nothing being
6035 if (!retval
|| retval
== error_mark_node
)
6038 /* Do any required conversions. */
6039 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
6040 /* No conversions are required. */
6044 /* The type the function is declared to return. */
6045 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6047 /* First convert the value to the function's return type, then
6048 to the type of return value's location to handle the
6049 case that functype is smaller than the valtype. */
6050 retval
= convert_for_initialization
6051 (NULL_TREE
, functype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
6052 "return", NULL_TREE
, 0);
6053 retval
= convert (valtype
, retval
);
6055 /* If the conversion failed, treat this just like `return;'. */
6056 if (retval
== error_mark_node
)
6058 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6059 else if (! current_function_returns_struct
6060 && TREE_CODE (retval
) == TARGET_EXPR
6061 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
6062 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
6063 TREE_OPERAND (retval
, 0));
6065 maybe_warn_about_returning_address_of_local (retval
);
6068 /* Actually copy the value returned into the appropriate location. */
6069 if (retval
&& retval
!= result
)
6070 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
6076 /* Returns nonzero if the pointer-type FROM can be converted to the
6077 pointer-type TO via a qualification conversion. If CONSTP is -1,
6078 then we return nonzero if the pointers are similar, and the
6079 cv-qualification signature of FROM is a proper subset of that of TO.
6081 If CONSTP is positive, then all outer pointers have been
6085 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
6087 bool to_more_cv_qualified
= false;
6089 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6091 if (TREE_CODE (to
) != TREE_CODE (from
))
6094 if (TREE_CODE (from
) == OFFSET_TYPE
6095 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
6096 TYPE_OFFSET_BASETYPE (to
)))
6099 /* Const and volatile mean something different for function types,
6100 so the usual checks are not appropriate. */
6101 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
6103 if (!at_least_as_qualified_p (to
, from
))
6106 if (!at_least_as_qualified_p (from
, to
))
6110 to_more_cv_qualified
= true;
6114 constp
&= TYPE_READONLY (to
);
6117 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
6118 return ((constp
>= 0 || to_more_cv_qualified
)
6119 && same_type_ignoring_top_level_qualifiers_p (to
, from
));
6123 /* When comparing, say, char ** to char const **, this function takes
6124 the 'char *' and 'char const *'. Do not pass non-pointer/reference
6125 types to this function. */
6128 comp_ptr_ttypes (tree to
, tree from
)
6130 return comp_ptr_ttypes_real (to
, from
, 1);
6133 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6134 type or inheritance-related types, regardless of cv-quals. */
6137 ptr_reasonably_similar (tree to
, tree from
)
6139 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6141 /* Any target type is similar enough to void. */
6142 if (TREE_CODE (to
) == VOID_TYPE
6143 || TREE_CODE (from
) == VOID_TYPE
)
6146 if (TREE_CODE (to
) != TREE_CODE (from
))
6149 if (TREE_CODE (from
) == OFFSET_TYPE
6150 && comptypes (TYPE_OFFSET_BASETYPE (to
),
6151 TYPE_OFFSET_BASETYPE (from
),
6152 COMPARE_BASE
| COMPARE_DERIVED
))
6155 if (TREE_CODE (to
) == INTEGER_TYPE
6156 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
6159 if (TREE_CODE (to
) == FUNCTION_TYPE
)
6162 if (TREE_CODE (to
) != POINTER_TYPE
)
6164 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
6165 COMPARE_BASE
| COMPARE_DERIVED
);
6169 /* Like comp_ptr_ttypes, for const_cast. */
6172 comp_ptr_ttypes_const (tree to
, tree from
)
6174 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6176 if (TREE_CODE (to
) != TREE_CODE (from
))
6179 if (TREE_CODE (from
) == OFFSET_TYPE
6180 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
6181 TYPE_OFFSET_BASETYPE (to
)))
6184 if (TREE_CODE (to
) != POINTER_TYPE
)
6185 return same_type_ignoring_top_level_qualifiers_p (to
, from
);
6189 /* Returns the type qualifiers for this type, including the qualifiers on the
6190 elements for an array type. */
6193 cp_type_quals (tree type
)
6195 type
= strip_array_types (type
);
6196 if (type
== error_mark_node
)
6197 return TYPE_UNQUALIFIED
;
6198 return TYPE_QUALS (type
);
6201 /* Returns nonzero if the TYPE contains a mutable member. */
6204 cp_has_mutable_p (tree type
)
6206 type
= strip_array_types (type
);
6208 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
6211 /* Subroutine of casts_away_constness. Make T1 and T2 point at
6212 exemplar types such that casting T1 to T2 is casting away castness
6213 if and only if there is no implicit conversion from T1 to T2. */
6216 casts_away_constness_r (tree
*t1
, tree
*t2
)
6221 /* [expr.const.cast]
6223 For multi-level pointer to members and multi-level mixed pointers
6224 and pointers to members (conv.qual), the "member" aspect of a
6225 pointer to member level is ignored when determining if a const
6226 cv-qualifier has been cast away. */
6227 if (TYPE_PTRMEM_P (*t1
))
6228 *t1
= build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (*t1
));
6229 if (TYPE_PTRMEM_P (*t2
))
6230 *t2
= build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (*t2
));
6232 /* [expr.const.cast]
6234 For two pointer types:
6236 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
6237 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
6240 casting from X1 to X2 casts away constness if, for a non-pointer
6241 type T there does not exist an implicit conversion (clause
6244 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
6248 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
6250 if (TREE_CODE (*t1
) != POINTER_TYPE
6251 || TREE_CODE (*t2
) != POINTER_TYPE
)
6253 *t1
= cp_build_qualified_type (void_type_node
,
6254 cp_type_quals (*t1
));
6255 *t2
= cp_build_qualified_type (void_type_node
,
6256 cp_type_quals (*t2
));
6260 quals1
= cp_type_quals (*t1
);
6261 quals2
= cp_type_quals (*t2
);
6262 *t1
= TREE_TYPE (*t1
);
6263 *t2
= TREE_TYPE (*t2
);
6264 casts_away_constness_r (t1
, t2
);
6265 *t1
= build_pointer_type (*t1
);
6266 *t2
= build_pointer_type (*t2
);
6267 *t1
= cp_build_qualified_type (*t1
, quals1
);
6268 *t2
= cp_build_qualified_type (*t2
, quals2
);
6271 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
6275 casts_away_constness (tree t1
, tree t2
)
6277 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
6279 /* [expr.const.cast]
6281 Casting from an lvalue of type T1 to an lvalue of type T2
6282 using a reference cast casts away constness if a cast from an
6283 rvalue of type "pointer to T1" to the type "pointer to T2"
6284 casts away constness. */
6285 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
6286 return casts_away_constness (build_pointer_type (t1
),
6287 build_pointer_type (TREE_TYPE (t2
)));
6290 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
6291 /* [expr.const.cast]
6293 Casting from an rvalue of type "pointer to data member of X
6294 of type T1" to the type "pointer to data member of Y of type
6295 T2" casts away constness if a cast from an rvalue of type
6296 "pointer to T1" to the type "pointer to T2" casts away
6298 return casts_away_constness
6299 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
6300 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
6302 /* Casting away constness is only something that makes sense for
6303 pointer or reference types. */
6304 if (TREE_CODE (t1
) != POINTER_TYPE
6305 || TREE_CODE (t2
) != POINTER_TYPE
)
6308 /* Top-level qualifiers don't matter. */
6309 t1
= TYPE_MAIN_VARIANT (t1
);
6310 t2
= TYPE_MAIN_VARIANT (t2
);
6311 casts_away_constness_r (&t1
, &t2
);
6312 if (!can_convert (t2
, t1
))
6318 /* If T is a REFERENCE_TYPE return the type to which T refers.
6319 Otherwise, return T itself. */
6322 non_reference (tree t
)
6324 if (TREE_CODE (t
) == REFERENCE_TYPE
)