1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 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"
46 static tree convert_for_assignment (tree, tree, const char *, tree, int);
47 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
48 static tree rationalize_conditional_expr (enum tree_code, tree);
49 static int comp_ptr_ttypes_real (tree, tree, int);
50 static int comp_ptr_ttypes_const (tree, tree);
51 static bool comp_except_types (tree, tree, bool);
52 static bool comp_array_types (tree, tree, bool);
53 static tree common_base_type (tree, tree);
54 static tree pointer_diff (tree, tree, tree);
55 static tree get_delta_difference (tree, tree, bool, bool);
56 static void casts_away_constness_r (tree *, tree *);
57 static bool casts_away_constness (tree, tree);
58 static void maybe_warn_about_returning_address_of_local (tree);
59 static tree lookup_destructor (tree, tree, tree);
60 static tree convert_arguments (tree, tree, tree, int);
62 /* Return the target type of TYPE, which means return T for:
63 T*, T&, T[], T (...), and otherwise, just T. */
66 target_type (tree type)
68 type = non_reference (type);
69 while (TREE_CODE (type) == POINTER_TYPE
70 || TREE_CODE (type) == ARRAY_TYPE
71 || TREE_CODE (type) == FUNCTION_TYPE
72 || TREE_CODE (type) == METHOD_TYPE
73 || TYPE_PTRMEM_P (type))
74 type = TREE_TYPE (type);
78 /* Do `exp = require_complete_type (exp);' to make sure exp
79 does not have an incomplete type. (That includes void types.)
80 Returns the error_mark_node if the VALUE does not have
81 complete type when this function returns. */
84 require_complete_type (tree value)
88 if (processing_template_decl || value == error_mark_node)
91 if (TREE_CODE (value) == OVERLOAD)
92 type = unknown_type_node;
94 type = TREE_TYPE (value);
96 if (type == error_mark_node)
97 return error_mark_node;
99 /* First, detect a valid value with a complete type. */
100 if (COMPLETE_TYPE_P (type))
103 if (complete_type_or_else (type, value))
106 return error_mark_node;
109 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
110 a template instantiation, do the instantiation. Returns TYPE,
111 whether or not it could be completed, unless something goes
112 horribly wrong, in which case the error_mark_node is returned. */
115 complete_type (tree type)
117 if (type == NULL_TREE)
118 /* Rather than crash, we return something sure to cause an error
120 return error_mark_node;
122 if (type == error_mark_node || COMPLETE_TYPE_P (type))
124 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
126 tree t = complete_type (TREE_TYPE (type));
127 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
129 TYPE_NEEDS_CONSTRUCTING (type)
130 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
131 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
132 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
134 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
135 instantiate_class_template (TYPE_MAIN_VARIANT (type));
140 /* Like complete_type, but issue an error if the TYPE cannot be completed.
141 VALUE is used for informative diagnostics.
142 Returns NULL_TREE if the type cannot be made complete. */
145 complete_type_or_else (tree type, tree value)
147 type = complete_type (type);
148 if (type == error_mark_node)
149 /* We already issued an error. */
151 else if (!COMPLETE_TYPE_P (type))
153 cxx_incomplete_type_diagnostic (value, type, 0);
160 /* Return truthvalue of whether type of EXP is instantiated. */
163 type_unknown_p (tree exp)
165 return (TREE_CODE (exp) == TREE_LIST
166 || TREE_TYPE (exp) == unknown_type_node);
170 /* Return the common type of two parameter lists.
171 We assume that comptypes has already been done and returned 1;
172 if that isn't so, this may crash.
174 As an optimization, free the space we allocate if the parameter
175 lists are already common. */
178 commonparms (tree p1, tree p2)
180 tree oldargs = p1, newargs, n;
184 len = list_length (p1);
185 newargs = tree_last (p1);
187 if (newargs == void_list_node)
196 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
201 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
203 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
205 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
208 else if (! TREE_PURPOSE (p1))
210 if (TREE_PURPOSE (p2))
212 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
218 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
220 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
222 if (TREE_VALUE (p1) != TREE_VALUE (p2))
225 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
228 TREE_VALUE (n) = TREE_VALUE (p1);
236 /* Given a type, perhaps copied for a typedef,
237 find the "original" version of it. */
239 original_type (tree t)
241 while (TYPE_NAME (t) != NULL_TREE)
243 tree x = TYPE_NAME (t);
244 if (TREE_CODE (x) != TYPE_DECL)
246 x = DECL_ORIGINAL_TYPE (x);
254 /* T1 and T2 are arithmetic or enumeration types. Return the type
255 that will result from the "usual arithmetic conversions" on T1 and
256 T2 as described in [expr]. */
259 type_after_usual_arithmetic_conversions (tree t1, tree t2)
261 enum tree_code code1 = TREE_CODE (t1);
262 enum tree_code code2 = TREE_CODE (t2);
265 /* FIXME: Attributes. */
266 gcc_assert (ARITHMETIC_TYPE_P (t1)
267 || TREE_CODE (t1) == COMPLEX_TYPE
268 || TREE_CODE (t1) == ENUMERAL_TYPE);
269 gcc_assert (ARITHMETIC_TYPE_P (t2)
270 || TREE_CODE (t2) == COMPLEX_TYPE
271 || TREE_CODE (t2) == ENUMERAL_TYPE);
273 /* In what follows, we slightly generalize the rules given in [expr] so
274 as to deal with `long long' and `complex'. First, merge the
276 attributes = (*targetm.merge_type_attributes) (t1, t2);
278 /* If one type is complex, form the common type of the non-complex
279 components, then make that complex. Use T1 or T2 if it is the
281 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
283 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
284 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
286 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
288 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
289 return build_type_attribute_variant (t1, attributes);
290 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
291 return build_type_attribute_variant (t2, attributes);
293 return build_type_attribute_variant (build_complex_type (subtype),
297 /* If only one is real, use it as the result. */
298 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
299 return build_type_attribute_variant (t1, attributes);
300 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
301 return build_type_attribute_variant (t2, attributes);
303 /* Perform the integral promotions. */
304 if (code1 != REAL_TYPE)
306 t1 = type_promotes_to (t1);
307 t2 = type_promotes_to (t2);
310 /* Both real or both integers; use the one with greater precision. */
311 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
312 return build_type_attribute_variant (t1, attributes);
313 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
314 return build_type_attribute_variant (t2, attributes);
316 /* The types are the same; no need to do anything fancy. */
317 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
318 return build_type_attribute_variant (t1, attributes);
320 if (code1 != REAL_TYPE)
322 /* If one is a sizetype, use it so size_binop doesn't blow up. */
323 if (TYPE_IS_SIZETYPE (t1) > TYPE_IS_SIZETYPE (t2))
324 return build_type_attribute_variant (t1, attributes);
325 if (TYPE_IS_SIZETYPE (t2) > TYPE_IS_SIZETYPE (t1))
326 return build_type_attribute_variant (t2, attributes);
328 /* If one is unsigned long long, then convert the other to unsigned
330 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
331 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
332 return build_type_attribute_variant (long_long_unsigned_type_node,
334 /* If one is a long long, and the other is an unsigned long, and
335 long long can represent all the values of an unsigned long, then
336 convert to a long long. Otherwise, convert to an unsigned long
337 long. Otherwise, if either operand is long long, convert the
340 Since we're here, we know the TYPE_PRECISION is the same;
341 therefore converting to long long cannot represent all the values
342 of an unsigned long, so we choose unsigned long long in that
344 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
345 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
347 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
348 ? long_long_unsigned_type_node
349 : long_long_integer_type_node);
350 return build_type_attribute_variant (t, attributes);
353 /* Go through the same procedure, but for longs. */
354 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
355 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
356 return build_type_attribute_variant (long_unsigned_type_node,
358 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
359 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
361 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
362 ? long_unsigned_type_node : long_integer_type_node);
363 return build_type_attribute_variant (t, attributes);
365 /* Otherwise prefer the unsigned one. */
366 if (TYPE_UNSIGNED (t1))
367 return build_type_attribute_variant (t1, attributes);
369 return build_type_attribute_variant (t2, attributes);
373 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
374 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
375 return build_type_attribute_variant (long_double_type_node,
377 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
378 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
379 return build_type_attribute_variant (double_type_node,
381 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
382 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
383 return build_type_attribute_variant (float_type_node,
386 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
387 the standard C++ floating-point types. Logic earlier in this
388 function has already eliminated the possibility that
389 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
390 compelling reason to choose one or the other. */
391 return build_type_attribute_variant (t1, attributes);
395 /* Subroutine of composite_pointer_type to implement the recursive
396 case. See that function for documentation fo the parameters. */
399 composite_pointer_type_r (tree t1, tree t2, const char* location)
406 /* Determine the types pointed to by T1 and T2. */
407 if (TREE_CODE (t1) == POINTER_TYPE)
409 pointee1 = TREE_TYPE (t1);
410 pointee2 = TREE_TYPE (t2);
414 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
415 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
420 Otherwise, the composite pointer type is a pointer type
421 similar (_conv.qual_) to the type of one of the operands,
422 with a cv-qualification signature (_conv.qual_) that is the
423 union of the cv-qualification signatures of the operand
425 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
426 result_type = pointee1;
427 else if ((TREE_CODE (pointee1) == POINTER_TYPE
428 && TREE_CODE (pointee2) == POINTER_TYPE)
429 || (TYPE_PTR_TO_MEMBER_P (pointee1)
430 && TYPE_PTR_TO_MEMBER_P (pointee2)))
431 result_type = composite_pointer_type_r (pointee1, pointee2, location);
434 pedwarn ("%s between distinct pointer types %qT and %qT "
437 result_type = void_type_node;
439 result_type = cp_build_qualified_type (result_type,
440 (cp_type_quals (pointee1)
441 | cp_type_quals (pointee2)));
442 /* If the original types were pointers to members, so is the
444 if (TYPE_PTR_TO_MEMBER_P (t1))
446 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
447 TYPE_PTRMEM_CLASS_TYPE (t2)))
448 pedwarn ("%s between distinct pointer types %qT and %qT "
451 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
455 result_type = build_pointer_type (result_type);
457 /* Merge the attributes. */
458 attributes = (*targetm.merge_type_attributes) (t1, t2);
459 return build_type_attribute_variant (result_type, attributes);
462 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
463 ARG1 and ARG2 are the values with those types. The LOCATION is a
464 string describing the current location, in case an error occurs.
466 This routine also implements the computation of a common type for
467 pointers-to-members as per [expr.eq]. */
470 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
471 const char* location)
478 If one operand is a null pointer constant, the composite pointer
479 type is the type of the other operand. */
480 if (null_ptr_cst_p (arg1))
482 if (null_ptr_cst_p (arg2))
489 If one of the operands has type "pointer to cv1 void*", then
490 the other has type "pointer to cv2T", and the composite pointer
491 type is "pointer to cv12 void", where cv12 is the union of cv1
494 If either type is a pointer to void, make sure it is T1. */
495 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
503 /* Now, if T1 is a pointer to void, merge the qualifiers. */
504 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
509 if (pedantic && TYPE_PTRFN_P (t2))
510 pedwarn ("ISO C++ forbids %s between pointer of type %<void *%> "
511 "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 %qT and %qT "
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 %qT and %qT "
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 (PUBLICLY_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)
929 /* Suppress errors caused by previously reported errors. */
930 if (t1 == error_mark_node || t2 == error_mark_node)
933 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
935 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
936 current instantiation. */
937 if (TREE_CODE (t1) == TYPENAME_TYPE)
939 tree resolved = resolve_typename_type (t1, /*only_current_p=*/true);
941 if (resolved != error_mark_node)
945 if (TREE_CODE (t2) == TYPENAME_TYPE)
947 tree resolved = resolve_typename_type (t2, /*only_current_p=*/true);
949 if (resolved != error_mark_node)
953 /* If either type is the internal version of sizetype, use the
955 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
956 && TYPE_ORIG_SIZE_TYPE (t1))
957 t1 = TYPE_ORIG_SIZE_TYPE (t1);
959 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
960 && TYPE_ORIG_SIZE_TYPE (t2))
961 t2 = TYPE_ORIG_SIZE_TYPE (t2);
963 if (TYPE_PTRMEMFUNC_P (t1))
964 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
965 if (TYPE_PTRMEMFUNC_P (t2))
966 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
968 /* Different classes of types can't be compatible. */
969 if (TREE_CODE (t1) != TREE_CODE (t2))
972 /* Qualifiers must match. For array types, we will check when we
973 recur on the array element types. */
974 if (TREE_CODE (t1) != ARRAY_TYPE
975 && TYPE_QUALS (t1) != TYPE_QUALS (t2))
977 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
980 /* Allow for two different type nodes which have essentially the same
981 definition. Note that we already checked for equality of the type
982 qualifiers (just above). */
984 if (TREE_CODE (t1) != ARRAY_TYPE
985 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
988 if (!(*targetm.comp_type_attributes) (t1, t2))
991 switch (TREE_CODE (t1))
993 case TEMPLATE_TEMPLATE_PARM:
994 case BOUND_TEMPLATE_TEMPLATE_PARM:
995 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
996 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2))
998 if (!comp_template_parms
999 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1000 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1002 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1004 /* Don't check inheritance. */
1005 strict = COMPARE_STRICT;
1010 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1011 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1012 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1013 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1016 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1018 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1021 /* We may be dealing with Objective-C instances... */
1022 if (TREE_CODE (t1) == RECORD_TYPE
1023 && ((retval = objc_comptypes (t1, t2, 0)) >= 0))
1025 /* ...but fall through if we are not. */
1030 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1031 strict & ~COMPARE_REDECLARATION))
1033 return same_type_p (TREE_TYPE (t1), TREE_TYPE (t2));
1036 case REFERENCE_TYPE:
1037 return TYPE_MODE (t1) == TYPE_MODE (t2)
1038 && TYPE_REF_CAN_ALIAS_ALL (t1) == TYPE_REF_CAN_ALIAS_ALL (t2)
1039 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2));
1043 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1045 return compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2));
1048 /* Target types must match incl. qualifiers. */
1049 return comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION));
1051 case TEMPLATE_TYPE_PARM:
1052 return (TEMPLATE_TYPE_IDX (t1) == TEMPLATE_TYPE_IDX (t2)
1053 && TEMPLATE_TYPE_LEVEL (t1) == TEMPLATE_TYPE_LEVEL (t2));
1056 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1057 TYPENAME_TYPE_FULLNAME (t2)))
1059 return same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2));
1061 case UNBOUND_CLASS_TEMPLATE:
1062 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1064 return same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2));
1067 return same_type_p (TREE_TYPE (t1), TREE_TYPE (t2));
1070 return TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1071 && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2));
1080 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1083 at_least_as_qualified_p (tree type1, tree type2)
1085 int q1 = cp_type_quals (type1);
1086 int q2 = cp_type_quals (type2);
1088 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1089 return (q1 & q2) == q2;
1092 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1093 more cv-qualified that TYPE1, and 0 otherwise. */
1096 comp_cv_qualification (tree type1, tree type2)
1098 int q1 = cp_type_quals (type1);
1099 int q2 = cp_type_quals (type2);
1104 if ((q1 & q2) == q2)
1106 else if ((q1 & q2) == q1)
1112 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1113 subset of the cv-qualification signature of TYPE2, and the types
1114 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1117 comp_cv_qual_signature (tree type1, tree type2)
1119 if (comp_ptr_ttypes_real (type2, type1, -1))
1121 else if (comp_ptr_ttypes_real (type1, type2, -1))
1127 /* If two types share a common base type, return that basetype.
1128 If there is not a unique most-derived base type, this function
1129 returns ERROR_MARK_NODE. */
1132 common_base_type (tree tt1, tree tt2)
1134 tree best = NULL_TREE;
1137 /* If one is a baseclass of another, that's good enough. */
1138 if (UNIQUELY_DERIVED_FROM_P (tt1, tt2))
1140 if (UNIQUELY_DERIVED_FROM_P (tt2, tt1))
1143 /* Otherwise, try to find a unique baseclass of TT1
1144 that is shared by TT2, and follow that down. */
1145 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (tt1))-1; i >= 0; i--)
1147 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt1), i));
1148 tree trial = common_base_type (basetype, tt2);
1152 if (trial == error_mark_node)
1154 if (best == NULL_TREE)
1156 else if (best != trial)
1157 return error_mark_node;
1162 for (i = BINFO_N_BASE_BINFOS (TYPE_BINFO (tt2))-1; i >= 0; i--)
1164 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (tt2), i));
1165 tree trial = common_base_type (tt1, basetype);
1169 if (trial == error_mark_node)
1171 if (best == NULL_TREE)
1173 else if (best != trial)
1174 return error_mark_node;
1180 /* Subroutines of `comptypes'. */
1182 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1183 equivalent in the sense that functions with those parameter types
1184 can have equivalent types. The two lists must be equivalent,
1185 element by element. */
1188 compparms (tree parms1, tree parms2)
1192 /* An unspecified parmlist matches any specified parmlist
1193 whose argument types don't need default promotions. */
1195 for (t1 = parms1, t2 = parms2;
1197 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1199 /* If one parmlist is shorter than the other,
1200 they fail to match. */
1203 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1210 /* Process a sizeof or alignof expression where the operand is a
1214 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1216 enum tree_code type_code;
1218 const char *op_name;
1220 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1221 if (type == error_mark_node)
1222 return error_mark_node;
1224 if (processing_template_decl)
1226 value = build_min (op, size_type_node, type);
1227 TREE_READONLY (value) = 1;
1231 op_name = operator_name_info[(int) op].name;
1233 type = non_reference (type);
1234 type_code = TREE_CODE (type);
1236 if (type_code == METHOD_TYPE)
1238 if (complain && (pedantic || warn_pointer_arith))
1239 pedwarn ("invalid application of %qs to a member function", op_name);
1240 value = size_one_node;
1243 value = c_sizeof_or_alignof_type (complete_type (type), op, complain);
1248 /* Process a sizeof or alignof expression where the operand is an
1252 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op)
1254 const char *op_name = operator_name_info[(int) op].name;
1256 if (e == error_mark_node)
1257 return error_mark_node;
1259 if (processing_template_decl)
1261 e = build_min (op, size_type_node, e);
1262 TREE_SIDE_EFFECTS (e) = 0;
1263 TREE_READONLY (e) = 1;
1268 if (TREE_CODE (e) == COMPONENT_REF
1269 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1270 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1272 error ("invalid application of %qs to a bit-field", op_name);
1275 else if (is_overloaded_fn (e))
1277 pedwarn ("ISO C++ forbids applying %qs to an expression of "
1278 "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 (type == error_mark_node)
1336 return error_mark_node;
1338 if (type_unknown_p (exp))
1340 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1341 return error_mark_node;
1344 exp = integral_constant_value (exp);
1346 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1347 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1349 if (code == VOID_TYPE)
1351 error ("void value not ignored as it ought to be");
1352 return error_mark_node;
1354 if (invalid_nonstatic_memfn_p (exp))
1355 return error_mark_node;
1356 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1357 return build_unary_op (ADDR_EXPR, exp, 0);
1358 if (code == ARRAY_TYPE)
1363 if (TREE_CODE (exp) == INDIRECT_REF)
1364 return build_nop (build_pointer_type (TREE_TYPE (type)),
1365 TREE_OPERAND (exp, 0));
1367 if (TREE_CODE (exp) == COMPOUND_EXPR)
1369 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1370 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1371 TREE_OPERAND (exp, 0), op1);
1375 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1377 error ("invalid use of non-lvalue array");
1378 return error_mark_node;
1381 ptrtype = build_pointer_type (TREE_TYPE (type));
1383 if (TREE_CODE (exp) == VAR_DECL)
1385 if (!cxx_mark_addressable (exp))
1386 return error_mark_node;
1387 adr = build_nop (ptrtype, build_address (exp));
1390 /* This way is better for a COMPONENT_REF since it can
1391 simplify the offset for a component. */
1392 adr = build_unary_op (ADDR_EXPR, exp, 1);
1393 return cp_convert (ptrtype, adr);
1396 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1397 rvalues always have cv-unqualified types. */
1398 if (! CLASS_TYPE_P (type))
1399 exp = cp_convert (TYPE_MAIN_VARIANT (type), exp);
1405 default_conversion (tree exp)
1407 exp = decay_conversion (exp);
1409 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1410 exp = perform_integral_promotions (exp);
1415 /* EXPR is an expression with an integral or enumeration type.
1416 Perform the integral promotions in [conv.prom], and return the
1420 perform_integral_promotions (tree expr)
1425 type = TREE_TYPE (expr);
1426 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1427 promoted_type = type_promotes_to (type);
1428 if (type != promoted_type)
1429 expr = cp_convert (promoted_type, expr);
1433 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1437 inline_conversion (tree exp)
1439 if (TREE_CODE (exp) == FUNCTION_DECL)
1440 exp = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (exp)), exp);
1445 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1446 decay_conversion to one. */
1449 string_conv_p (tree totype, tree exp, int warn)
1453 if (! flag_const_strings || TREE_CODE (totype) != POINTER_TYPE)
1456 t = TREE_TYPE (totype);
1457 if (!same_type_p (t, char_type_node)
1458 && !same_type_p (t, wchar_type_node))
1461 if (TREE_CODE (exp) == STRING_CST)
1463 /* Make sure that we don't try to convert between char and wchar_t. */
1464 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1469 /* Is this a string constant which has decayed to 'const char *'? */
1470 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1471 if (!same_type_p (TREE_TYPE (exp), t))
1474 if (TREE_CODE (exp) != ADDR_EXPR
1475 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1479 /* This warning is not very useful, as it complains about printf. */
1480 if (warn && warn_write_strings)
1481 warning ("deprecated conversion from string constant to %qT'", totype);
1486 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1487 can, for example, use as an lvalue. This code used to be in
1488 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1489 expressions, where we're dealing with aggregates. But now it's again only
1490 called from unary_complex_lvalue. The case (in particular) that led to
1491 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1495 rationalize_conditional_expr (enum tree_code code, tree t)
1497 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1498 the first operand is always the one to be used if both operands
1499 are equal, so we know what conditional expression this used to be. */
1500 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1502 /* The following code is incorrect if either operand side-effects. */
1503 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (t, 0))
1504 && !TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)));
1506 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1507 ? LE_EXPR : GE_EXPR),
1508 TREE_OPERAND (t, 0),
1509 TREE_OPERAND (t, 1),
1510 /*overloaded_p=*/NULL),
1511 build_unary_op (code, TREE_OPERAND (t, 0), 0),
1512 build_unary_op (code, TREE_OPERAND (t, 1), 0));
1516 build_conditional_expr (TREE_OPERAND (t, 0),
1517 build_unary_op (code, TREE_OPERAND (t, 1), 0),
1518 build_unary_op (code, TREE_OPERAND (t, 2), 0));
1521 /* Given the TYPE of an anonymous union field inside T, return the
1522 FIELD_DECL for the field. If not found return NULL_TREE. Because
1523 anonymous unions can nest, we must also search all anonymous unions
1524 that are directly reachable. */
1527 lookup_anon_field (tree t, tree type)
1531 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1533 if (TREE_STATIC (field))
1535 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1538 /* If we find it directly, return the field. */
1539 if (DECL_NAME (field) == NULL_TREE
1540 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
1545 /* Otherwise, it could be nested, search harder. */
1546 if (DECL_NAME (field) == NULL_TREE
1547 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1549 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1557 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1558 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1559 non-NULL, it indicates the path to the base used to name MEMBER.
1560 If PRESERVE_REFERENCE is true, the expression returned will have
1561 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1562 returned will have the type referred to by the reference.
1564 This function does not perform access control; that is either done
1565 earlier by the parser when the name of MEMBER is resolved to MEMBER
1566 itself, or later when overload resolution selects one of the
1567 functions indicated by MEMBER. */
1570 build_class_member_access_expr (tree object, tree member,
1571 tree access_path, bool preserve_reference)
1575 tree result = NULL_TREE;
1577 if (object == error_mark_node || member == error_mark_node)
1578 return error_mark_node;
1580 gcc_assert (DECL_P (member) || BASELINK_P (member));
1584 The type of the first expression shall be "class object" (of a
1586 object_type = TREE_TYPE (object);
1587 if (!currently_open_class (object_type)
1588 && !complete_type_or_else (object_type, object))
1589 return error_mark_node;
1590 if (!CLASS_TYPE_P (object_type))
1592 error ("request for member %qD in %qE, which is of non-class type %qT",
1593 member, object, object_type);
1594 return error_mark_node;
1597 /* The standard does not seem to actually say that MEMBER must be a
1598 member of OBJECT_TYPE. However, that is clearly what is
1600 if (DECL_P (member))
1602 member_scope = DECL_CLASS_CONTEXT (member);
1604 if (TREE_DEPRECATED (member))
1605 warn_deprecated_use (member);
1608 member_scope = BINFO_TYPE (BASELINK_BINFO (member));
1609 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1610 presently be the anonymous union. Go outwards until we find a
1611 type related to OBJECT_TYPE. */
1612 while (ANON_AGGR_TYPE_P (member_scope)
1613 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
1615 member_scope = TYPE_CONTEXT (member_scope);
1616 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
1618 if (TREE_CODE (member) == FIELD_DECL)
1619 error ("invalid use of nonstatic data member %qE", member);
1621 error ("%qD is not a member of %qT", member, object_type);
1622 return error_mark_node;
1625 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1626 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1627 in the frontend; only _DECLs and _REFs are lvalues in the backend. */
1629 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
1631 object = build_indirect_ref (temp, NULL);
1634 /* In [expr.ref], there is an explicit list of the valid choices for
1635 MEMBER. We check for each of those cases here. */
1636 if (TREE_CODE (member) == VAR_DECL)
1638 /* A static data member. */
1640 /* If OBJECT has side-effects, they are supposed to occur. */
1641 if (TREE_SIDE_EFFECTS (object))
1642 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
1644 else if (TREE_CODE (member) == FIELD_DECL)
1646 /* A non-static data member. */
1651 null_object_p = (TREE_CODE (object) == INDIRECT_REF
1652 && integer_zerop (TREE_OPERAND (object, 0)));
1654 /* Convert OBJECT to the type of MEMBER. */
1655 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
1656 TYPE_MAIN_VARIANT (member_scope)))
1661 binfo = lookup_base (access_path ? access_path : object_type,
1662 member_scope, ba_unique, &kind);
1663 if (binfo == error_mark_node)
1664 return error_mark_node;
1666 /* It is invalid to try to get to a virtual base of a
1667 NULL object. The most common cause is invalid use of
1669 if (null_object_p && kind == bk_via_virtual)
1671 error ("invalid access to non-static data member %qD of "
1674 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1675 return error_mark_node;
1678 /* Convert to the base. */
1679 object = build_base_path (PLUS_EXPR, object, binfo,
1681 /* If we found the base successfully then we should be able
1682 to convert to it successfully. */
1683 gcc_assert (object != error_mark_node);
1686 /* Complain about other invalid uses of offsetof, even though they will
1687 give the right answer. Note that we complain whether or not they
1688 actually used the offsetof macro, since there's no way to know at this
1689 point. So we just give a warning, instead of a pedwarn. */
1690 /* Do not produce this warning for base class field references, because
1691 we know for a fact that didn't come from offsetof. This does occur
1692 in various testsuite cases where a null object is passed where a
1693 vtable access is required. */
1694 if (null_object_p && warn_invalid_offsetof
1695 && CLASSTYPE_NON_POD_P (object_type)
1696 && !DECL_FIELD_IS_BASE (member)
1697 && !skip_evaluation)
1699 warning ("invalid access to non-static data member %qD of NULL object",
1701 warning ("(perhaps the %<offsetof%> macro was used incorrectly)");
1704 /* If MEMBER is from an anonymous aggregate, we have converted
1705 OBJECT so that it refers to the class containing the
1706 anonymous union. Generate a reference to the anonymous union
1707 itself, and recur to find MEMBER. */
1708 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
1709 /* When this code is called from build_field_call, the
1710 object already has the type of the anonymous union.
1711 That is because the COMPONENT_REF was already
1712 constructed, and was then disassembled before calling
1713 build_field_call. After the function-call code is
1714 cleaned up, this waste can be eliminated. */
1715 && (!same_type_ignoring_top_level_qualifiers_p
1716 (TREE_TYPE (object), DECL_CONTEXT (member))))
1718 tree anonymous_union;
1720 anonymous_union = lookup_anon_field (TREE_TYPE (object),
1721 DECL_CONTEXT (member));
1722 object = build_class_member_access_expr (object,
1724 /*access_path=*/NULL_TREE,
1725 preserve_reference);
1728 /* Compute the type of the field, as described in [expr.ref]. */
1729 type_quals = TYPE_UNQUALIFIED;
1730 member_type = TREE_TYPE (member);
1731 if (TREE_CODE (member_type) != REFERENCE_TYPE)
1733 type_quals = (cp_type_quals (member_type)
1734 | cp_type_quals (object_type));
1736 /* A field is const (volatile) if the enclosing object, or the
1737 field itself, is const (volatile). But, a mutable field is
1738 not const, even within a const object. */
1739 if (DECL_MUTABLE_P (member))
1740 type_quals &= ~TYPE_QUAL_CONST;
1741 member_type = cp_build_qualified_type (member_type, type_quals);
1744 result = build3 (COMPONENT_REF, member_type, object, member,
1746 result = fold_if_not_in_template (result);
1748 /* Mark the expression const or volatile, as appropriate. Even
1749 though we've dealt with the type above, we still have to mark the
1750 expression itself. */
1751 if (type_quals & TYPE_QUAL_CONST)
1752 TREE_READONLY (result) = 1;
1753 if (type_quals & TYPE_QUAL_VOLATILE)
1754 TREE_THIS_VOLATILE (result) = 1;
1756 else if (BASELINK_P (member))
1758 /* The member is a (possibly overloaded) member function. */
1762 /* If the MEMBER is exactly one static member function, then we
1763 know the type of the expression. Otherwise, we must wait
1764 until overload resolution has been performed. */
1765 functions = BASELINK_FUNCTIONS (member);
1766 if (TREE_CODE (functions) == FUNCTION_DECL
1767 && DECL_STATIC_FUNCTION_P (functions))
1768 type = TREE_TYPE (functions);
1770 type = unknown_type_node;
1771 /* Note that we do not convert OBJECT to the BASELINK_BINFO
1772 base. That will happen when the function is called. */
1773 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
1775 else if (TREE_CODE (member) == CONST_DECL)
1777 /* The member is an enumerator. */
1779 /* If OBJECT has side-effects, they are supposed to occur. */
1780 if (TREE_SIDE_EFFECTS (object))
1781 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
1786 error ("invalid use of %qD", member);
1787 return error_mark_node;
1790 if (!preserve_reference)
1793 If E2 is declared to have type "reference to T", then ... the
1794 type of E1.E2 is T. */
1795 result = convert_from_reference (result);
1800 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
1801 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
1804 lookup_destructor (tree object, tree scope, tree dtor_name)
1806 tree object_type = TREE_TYPE (object);
1807 tree dtor_type = TREE_OPERAND (dtor_name, 0);
1810 if (scope && !check_dtor_name (scope, dtor_name))
1812 error ("qualified type %qT does not match destructor name ~%qT",
1814 return error_mark_node;
1816 if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
1818 error ("the type being destroyed is %qT, but the destructor refers to %qT",
1819 TYPE_MAIN_VARIANT (object_type), dtor_type);
1820 return error_mark_node;
1822 expr = lookup_member (dtor_type, complete_dtor_identifier,
1823 /*protect=*/1, /*want_type=*/false);
1824 expr = (adjust_result_of_qualified_name_lookup
1825 (expr, dtor_type, object_type));
1829 /* This function is called by the parser to process a class member
1830 access expression of the form OBJECT.NAME. NAME is a node used by
1831 the parser to represent a name; it is not yet a DECL. It may,
1832 however, be a BASELINK where the BASELINK_FUNCTIONS is a
1833 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
1834 there is no reason to do the lookup twice, so the parser keeps the
1838 finish_class_member_access_expr (tree object, tree name)
1843 tree access_path = NULL_TREE;
1844 tree orig_object = object;
1845 tree orig_name = name;
1847 if (object == error_mark_node || name == error_mark_node)
1848 return error_mark_node;
1850 object_type = TREE_TYPE (object);
1852 if (processing_template_decl)
1854 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
1855 dependent_type_p (object_type)
1856 /* If NAME is just an IDENTIFIER_NODE, then the expression
1858 || TREE_CODE (object) == IDENTIFIER_NODE
1859 /* If NAME is "f<args>", where either 'f' or 'args' is
1860 dependent, then the expression is dependent. */
1861 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
1862 && dependent_template_id_p (TREE_OPERAND (name, 0),
1863 TREE_OPERAND (name, 1)))
1864 /* If NAME is "T::X" where "T" is dependent, then the
1865 expression is dependent. */
1866 || (TREE_CODE (name) == SCOPE_REF
1867 && TYPE_P (TREE_OPERAND (name, 0))
1868 && dependent_type_p (TREE_OPERAND (name, 0))))
1869 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
1870 object = build_non_dependent_expr (object);
1875 The type of the first expression shall be "class object" (of a
1877 if (!currently_open_class (object_type)
1878 && !complete_type_or_else (object_type, object))
1879 return error_mark_node;
1880 if (!CLASS_TYPE_P (object_type))
1882 error ("request for member %qD in %qE, which is of non-class type %qT",
1883 name, object, object_type);
1884 return error_mark_node;
1887 if (BASELINK_P (name))
1889 /* A member function that has already been looked up. */
1890 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name)) == TEMPLATE_ID_EXPR);
1895 bool is_template_id = false;
1896 tree template_args = NULL_TREE;
1899 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1901 is_template_id = true;
1902 template_args = TREE_OPERAND (name, 1);
1903 name = TREE_OPERAND (name, 0);
1905 if (TREE_CODE (name) == OVERLOAD)
1906 name = DECL_NAME (get_first_fn (name));
1907 else if (DECL_P (name))
1908 name = DECL_NAME (name);
1911 if (TREE_CODE (name) == SCOPE_REF)
1913 /* A qualified name. The qualifying class or namespace `S' has
1914 already been looked up; it is either a TYPE or a
1915 NAMESPACE_DECL. The member name is either an IDENTIFIER_NODE
1916 or a BIT_NOT_EXPR. */
1917 scope = TREE_OPERAND (name, 0);
1918 name = TREE_OPERAND (name, 1);
1919 gcc_assert (CLASS_TYPE_P (scope)
1920 || TREE_CODE (scope) == NAMESPACE_DECL);
1921 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
1922 || TREE_CODE (name) == BIT_NOT_EXPR);
1924 /* If SCOPE is a namespace, then the qualified name does not
1925 name a member of OBJECT_TYPE. */
1926 if (TREE_CODE (scope) == NAMESPACE_DECL)
1928 error ("%<%D::%D%> is not a member of %qT",
1929 scope, name, object_type);
1930 return error_mark_node;
1933 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
1934 access_path = lookup_base (object_type, scope, ba_check, NULL);
1935 if (access_path == error_mark_node)
1936 return error_mark_node;
1939 error ("%qT is not a base of %qT", scope, object_type);
1940 return error_mark_node;
1946 access_path = object_type;
1949 if (TREE_CODE (name) == BIT_NOT_EXPR)
1950 member = lookup_destructor (object, scope, name);
1953 /* Look up the member. */
1954 member = lookup_member (access_path, name, /*protect=*/1,
1955 /*want_type=*/false);
1956 if (member == NULL_TREE)
1958 error ("%qD has no member named %qE", object_type, name);
1959 return error_mark_node;
1961 if (member == error_mark_node)
1962 return error_mark_node;
1967 tree template = member;
1969 if (BASELINK_P (template))
1970 template = lookup_template_function (template, template_args);
1973 error ("%qD is not a member template function", name);
1974 return error_mark_node;
1979 if (TREE_DEPRECATED (member))
1980 warn_deprecated_use (member);
1982 expr = build_class_member_access_expr (object, member, access_path,
1983 /*preserve_reference=*/false);
1984 if (processing_template_decl && expr != error_mark_node)
1985 return build_min_non_dep (COMPONENT_REF, expr,
1986 orig_object, orig_name, NULL_TREE);
1990 /* Return an expression for the MEMBER_NAME field in the internal
1991 representation of PTRMEM, a pointer-to-member function. (Each
1992 pointer-to-member function type gets its own RECORD_TYPE so it is
1993 more convenient to access the fields by name than by FIELD_DECL.)
1994 This routine converts the NAME to a FIELD_DECL and then creates the
1995 node for the complete expression. */
1998 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2004 /* This code is a stripped down version of
2005 build_class_member_access_expr. It does not work to use that
2006 routine directly because it expects the object to be of class
2008 ptrmem_type = TREE_TYPE (ptrmem);
2009 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2010 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2011 /*want_type=*/false);
2012 member_type = cp_build_qualified_type (TREE_TYPE (member),
2013 cp_type_quals (ptrmem_type));
2014 return fold (build3 (COMPONENT_REF, member_type,
2015 ptrmem, member, NULL_TREE));
2018 /* Given an expression PTR for a pointer, return an expression
2019 for the value pointed to.
2020 ERRORSTRING is the name of the operator to appear in error messages.
2022 This function may need to overload OPERATOR_FNNAME.
2023 Must also handle REFERENCE_TYPEs for C++. */
2026 build_x_indirect_ref (tree expr, const char *errorstring)
2028 tree orig_expr = expr;
2031 if (processing_template_decl)
2033 if (type_dependent_expression_p (expr))
2034 return build_min_nt (INDIRECT_REF, expr);
2035 expr = build_non_dependent_expr (expr);
2038 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2039 NULL_TREE, /*overloaded_p=*/NULL);
2041 rval = build_indirect_ref (expr, errorstring);
2043 if (processing_template_decl && rval != error_mark_node)
2044 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2050 build_indirect_ref (tree ptr, const char *errorstring)
2054 if (ptr == error_mark_node)
2055 return error_mark_node;
2057 if (ptr == current_class_ptr)
2058 return current_class_ref;
2060 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2061 ? ptr : decay_conversion (ptr));
2062 type = TREE_TYPE (pointer);
2064 if (POINTER_TYPE_P (type))
2068 If the type of the expression is "pointer to T," the type
2069 of the result is "T."
2071 We must use the canonical variant because certain parts of
2072 the back end, like fold, do pointer comparisons between
2074 tree t = canonical_type_variant (TREE_TYPE (type));
2076 if (VOID_TYPE_P (t))
2078 /* A pointer to incomplete type (other than cv void) can be
2079 dereferenced [expr.unary.op]/1 */
2080 error ("%qT is not a pointer-to-object type", type);
2081 return error_mark_node;
2083 else if (TREE_CODE (pointer) == ADDR_EXPR
2084 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2085 /* The POINTER was something like `&x'. We simplify `*&x' to
2087 return TREE_OPERAND (pointer, 0);
2090 tree ref = build1 (INDIRECT_REF, t, pointer);
2092 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2093 so that we get the proper error message if the result is used
2094 to assign to. Also, &* is supposed to be a no-op. */
2095 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2096 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2097 TREE_SIDE_EFFECTS (ref)
2098 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2102 /* `pointer' won't be an error_mark_node if we were given a
2103 pointer to member, so it's cool to check for this here. */
2104 else if (TYPE_PTR_TO_MEMBER_P (type))
2105 error ("invalid use of %qs on pointer to member", errorstring);
2106 else if (pointer != error_mark_node)
2109 error ("invalid type argument of %qs", errorstring);
2111 error ("invalid type argument");
2113 return error_mark_node;
2116 /* This handles expressions of the form "a[i]", which denotes
2119 This is logically equivalent in C to *(a+i), but we may do it differently.
2120 If A is a variable or a member, we generate a primitive ARRAY_REF.
2121 This avoids forcing the array out of registers, and can work on
2122 arrays that are not lvalues (for example, members of structures returned
2125 If INDEX is of some user-defined type, it must be converted to
2126 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2127 will inherit the type of the array, which will be some pointer type. */
2130 build_array_ref (tree array, tree idx)
2134 error ("subscript missing in array reference");
2135 return error_mark_node;
2138 if (TREE_TYPE (array) == error_mark_node
2139 || TREE_TYPE (idx) == error_mark_node)
2140 return error_mark_node;
2142 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2144 switch (TREE_CODE (array))
2148 tree value = build_array_ref (TREE_OPERAND (array, 1), idx);
2149 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2150 TREE_OPERAND (array, 0), value);
2154 return build_conditional_expr
2155 (TREE_OPERAND (array, 0),
2156 build_array_ref (TREE_OPERAND (array, 1), idx),
2157 build_array_ref (TREE_OPERAND (array, 2), idx));
2163 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2167 /* Subscripting with type char is likely to lose
2168 on a machine where chars are signed.
2169 So warn on any machine, but optionally.
2170 Don't warn for unsigned char since that type is safe.
2171 Don't warn for signed char because anyone who uses that
2172 must have done so deliberately. */
2173 if (warn_char_subscripts
2174 && TYPE_MAIN_VARIANT (TREE_TYPE (idx)) == char_type_node)
2175 warning ("array subscript has type %<char%>");
2177 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2179 error ("array subscript is not an integer");
2180 return error_mark_node;
2183 /* Apply integral promotions *after* noticing character types.
2184 (It is unclear why we do these promotions -- the standard
2185 does not say that we should. In fact, the natural thing would
2186 seem to be to convert IDX to ptrdiff_t; we're performing
2187 pointer arithmetic.) */
2188 idx = perform_integral_promotions (idx);
2190 /* An array that is indexed by a non-constant
2191 cannot be stored in a register; we must be able to do
2192 address arithmetic on its address.
2193 Likewise an array of elements of variable size. */
2194 if (TREE_CODE (idx) != INTEGER_CST
2195 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2196 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2199 if (!cxx_mark_addressable (array))
2200 return error_mark_node;
2203 /* An array that is indexed by a constant value which is not within
2204 the array bounds cannot be stored in a register either; because we
2205 would get a crash in store_bit_field/extract_bit_field when trying
2206 to access a non-existent part of the register. */
2207 if (TREE_CODE (idx) == INTEGER_CST
2208 && TYPE_DOMAIN (TREE_TYPE (array))
2209 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2211 if (!cxx_mark_addressable (array))
2212 return error_mark_node;
2215 if (pedantic && !lvalue_p (array))
2216 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2218 /* Note in C++ it is valid to subscript a `register' array, since
2219 it is valid to take the address of something with that
2220 storage specification. */
2224 while (TREE_CODE (foo) == COMPONENT_REF)
2225 foo = TREE_OPERAND (foo, 0);
2226 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2227 warning ("subscripting array declared %<register%>");
2230 type = TREE_TYPE (TREE_TYPE (array));
2231 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2232 /* Array ref is const/volatile if the array elements are
2233 or if the array is.. */
2234 TREE_READONLY (rval)
2235 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2236 TREE_SIDE_EFFECTS (rval)
2237 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2238 TREE_THIS_VOLATILE (rval)
2239 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2240 return require_complete_type (fold_if_not_in_template (rval));
2244 tree ar = default_conversion (array);
2245 tree ind = default_conversion (idx);
2247 /* Put the integer in IND to simplify error checking. */
2248 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2255 if (ar == error_mark_node)
2258 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2260 error ("subscripted value is neither array nor pointer");
2261 return error_mark_node;
2263 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2265 error ("array subscript is not an integer");
2266 return error_mark_node;
2269 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR, ar, ind),
2274 /* Resolve a pointer to member function. INSTANCE is the object
2275 instance to use, if the member points to a virtual member.
2277 This used to avoid checking for virtual functions if basetype
2278 has no virtual functions, according to an earlier ANSI draft.
2279 With the final ISO C++ rules, such an optimization is
2280 incorrect: A pointer to a derived member can be static_cast
2281 to pointer-to-base-member, as long as the dynamic object
2282 later has the right member. */
2285 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2287 if (TREE_CODE (function) == OFFSET_REF)
2288 function = TREE_OPERAND (function, 1);
2290 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2292 tree idx, delta, e1, e2, e3, vtbl, basetype;
2293 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2295 tree instance_ptr = *instance_ptrptr;
2296 tree instance_save_expr = 0;
2297 if (instance_ptr == error_mark_node)
2299 if (TREE_CODE (function) == PTRMEM_CST)
2301 /* Extracting the function address from a pmf is only
2302 allowed with -Wno-pmf-conversions. It only works for
2304 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2305 e1 = convert (fntype, e1);
2310 error ("object missing in use of %qE", function);
2311 return error_mark_node;
2315 if (TREE_SIDE_EFFECTS (instance_ptr))
2316 instance_ptr = instance_save_expr = save_expr (instance_ptr);
2318 if (TREE_SIDE_EFFECTS (function))
2319 function = save_expr (function);
2321 /* Start by extracting all the information from the PMF itself. */
2322 e3 = pfn_from_ptrmemfunc (function);
2323 delta = build_ptrmemfunc_access_expr (function, delta_identifier);
2324 idx = build1 (NOP_EXPR, vtable_index_type, e3);
2325 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
2327 case ptrmemfunc_vbit_in_pfn:
2328 e1 = cp_build_binary_op (BIT_AND_EXPR, idx, integer_one_node);
2329 idx = cp_build_binary_op (MINUS_EXPR, idx, integer_one_node);
2332 case ptrmemfunc_vbit_in_delta:
2333 e1 = cp_build_binary_op (BIT_AND_EXPR, delta, integer_one_node);
2334 delta = cp_build_binary_op (RSHIFT_EXPR, delta, integer_one_node);
2341 /* Convert down to the right base before using the instance. First
2343 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2344 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
2345 basetype, ba_check, NULL);
2346 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype, 1);
2347 if (instance_ptr == error_mark_node)
2348 return error_mark_node;
2349 /* ...and then the delta in the PMF. */
2350 instance_ptr = build2 (PLUS_EXPR, TREE_TYPE (instance_ptr),
2351 instance_ptr, delta);
2353 /* Hand back the adjusted 'this' argument to our caller. */
2354 *instance_ptrptr = instance_ptr;
2356 /* Next extract the vtable pointer from the object. */
2357 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
2359 vtbl = build_indirect_ref (vtbl, NULL);
2361 /* Finally, extract the function pointer from the vtable. */
2362 e2 = fold (build2 (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, idx));
2363 e2 = build_indirect_ref (e2, NULL);
2364 TREE_CONSTANT (e2) = 1;
2365 TREE_INVARIANT (e2) = 1;
2367 /* When using function descriptors, the address of the
2368 vtable entry is treated as a function pointer. */
2369 if (TARGET_VTABLE_USES_DESCRIPTORS)
2370 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
2371 build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1));
2373 TREE_TYPE (e2) = TREE_TYPE (e3);
2374 e1 = build_conditional_expr (e1, e2, e3);
2376 /* Make sure this doesn't get evaluated first inside one of the
2377 branches of the COND_EXPR. */
2378 if (instance_save_expr)
2379 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
2380 instance_save_expr, e1);
2388 build_function_call (tree function, tree params)
2390 tree fntype, fndecl;
2391 tree coerced_params;
2392 tree name = NULL_TREE;
2394 tree original = function;
2396 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2397 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2398 if (TREE_CODE (function) == NOP_EXPR
2399 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2400 function = TREE_OPERAND (function, 0);
2402 if (TREE_CODE (function) == FUNCTION_DECL)
2404 name = DECL_NAME (function);
2406 mark_used (function);
2409 /* Convert anything with function type to a pointer-to-function. */
2410 if (pedantic && DECL_MAIN_P (function))
2411 pedwarn ("ISO C++ forbids calling %<::main%> from within program");
2413 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2414 (because calling an inline function does not mean the function
2415 needs to be separately compiled). */
2417 if (DECL_INLINE (function))
2418 function = inline_conversion (function);
2420 function = build_addr_func (function);
2426 function = build_addr_func (function);
2429 if (function == error_mark_node)
2430 return error_mark_node;
2432 fntype = TREE_TYPE (function);
2434 if (TYPE_PTRMEMFUNC_P (fntype))
2436 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2437 "function in %<%E (...)%>",
2439 return error_mark_node;
2442 is_method = (TREE_CODE (fntype) == POINTER_TYPE
2443 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
2445 if (!((TREE_CODE (fntype) == POINTER_TYPE
2446 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
2448 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
2450 error ("%qE cannot be used as a function", original);
2451 return error_mark_node;
2454 /* fntype now gets the type of function pointed to. */
2455 fntype = TREE_TYPE (fntype);
2457 /* Convert the parameters to the types declared in the
2458 function prototype, or apply default promotions. */
2460 coerced_params = convert_arguments (TYPE_ARG_TYPES (fntype),
2461 params, fndecl, LOOKUP_NORMAL);
2462 if (coerced_params == error_mark_node)
2463 return error_mark_node;
2465 /* Check for errors in format strings and inappropriately
2468 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params);
2470 return build_cxx_call (function, coerced_params);
2473 /* Convert the actual parameter expressions in the list VALUES
2474 to the types in the list TYPELIST.
2475 If parmdecls is exhausted, or when an element has NULL as its type,
2476 perform the default conversions.
2478 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2480 This is also where warnings about wrong number of args are generated.
2482 Return a list of expressions for the parameters as converted.
2484 Both VALUES and the returned value are chains of TREE_LIST nodes
2485 with the elements of the list in the TREE_VALUE slots of those nodes.
2487 In C++, unspecified trailing parameters can be filled in with their
2488 default arguments, if such were specified. Do so here. */
2491 convert_arguments (tree typelist, tree values, tree fndecl, int flags)
2493 tree typetail, valtail;
2494 tree result = NULL_TREE;
2495 const char *called_thing = 0;
2498 /* Argument passing is always copy-initialization. */
2499 flags |= LOOKUP_ONLYCONVERTING;
2503 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
2505 if (DECL_NAME (fndecl) == NULL_TREE
2506 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
2507 called_thing = "constructor";
2509 called_thing = "member function";
2512 called_thing = "function";
2515 for (valtail = values, typetail = typelist;
2517 valtail = TREE_CHAIN (valtail), i++)
2519 tree type = typetail ? TREE_VALUE (typetail) : 0;
2520 tree val = TREE_VALUE (valtail);
2522 if (val == error_mark_node)
2523 return error_mark_node;
2525 if (type == void_type_node)
2529 cp_error_at ("too many arguments to %s %q+#D", called_thing,
2531 error ("at this point in file");
2534 error ("too many arguments to function");
2535 /* In case anybody wants to know if this argument
2538 TREE_TYPE (tree_last (result)) = error_mark_node;
2542 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2543 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2544 if (TREE_CODE (val) == NOP_EXPR
2545 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
2546 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
2547 val = TREE_OPERAND (val, 0);
2549 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
2551 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
2552 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
2553 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
2554 val = decay_conversion (val);
2557 if (val == error_mark_node)
2558 return error_mark_node;
2562 /* Formal parm type is specified by a function prototype. */
2565 if (!COMPLETE_TYPE_P (complete_type (type)))
2568 error ("parameter %P of %qD has incomplete type %qT",
2571 error ("parameter %P has incomplete type %qT", i, type);
2572 parmval = error_mark_node;
2576 parmval = convert_for_initialization
2577 (NULL_TREE, type, val, flags,
2578 "argument passing", fndecl, i);
2579 parmval = convert_for_arg_passing (type, parmval);
2582 if (parmval == error_mark_node)
2583 return error_mark_node;
2585 result = tree_cons (NULL_TREE, parmval, result);
2589 if (fndecl && DECL_BUILT_IN (fndecl)
2590 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
2591 /* Don't do ellipsis conversion for __built_in_constant_p
2592 as this will result in spurious warnings for non-POD
2594 val = require_complete_type (val);
2596 val = convert_arg_to_ellipsis (val);
2598 result = tree_cons (NULL_TREE, val, result);
2602 typetail = TREE_CHAIN (typetail);
2605 if (typetail != 0 && typetail != void_list_node)
2607 /* See if there are default arguments that can be used. */
2608 if (TREE_PURPOSE (typetail)
2609 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
2611 for (; typetail != void_list_node; ++i)
2614 = convert_default_arg (TREE_VALUE (typetail),
2615 TREE_PURPOSE (typetail),
2618 if (parmval == error_mark_node)
2619 return error_mark_node;
2621 result = tree_cons (0, parmval, result);
2622 typetail = TREE_CHAIN (typetail);
2623 /* ends with `...'. */
2624 if (typetail == NULL_TREE)
2632 cp_error_at ("too few arguments to %s %q+#D",
2633 called_thing, fndecl);
2634 error ("at this point in file");
2637 error ("too few arguments to function");
2638 return error_mark_list;
2642 return nreverse (result);
2645 /* Build a binary-operation expression, after performing default
2646 conversions on the operands. CODE is the kind of expression to build. */
2649 build_x_binary_op (enum tree_code code, tree arg1, tree arg2,
2659 if (processing_template_decl)
2661 if (type_dependent_expression_p (arg1)
2662 || type_dependent_expression_p (arg2))
2663 return build_min_nt (code, arg1, arg2);
2664 arg1 = build_non_dependent_expr (arg1);
2665 arg2 = build_non_dependent_expr (arg2);
2668 if (code == DOTSTAR_EXPR)
2669 expr = build_m_component_ref (arg1, arg2);
2671 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
2674 if (processing_template_decl && expr != error_mark_node)
2675 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
2680 /* Build a binary-operation expression without default conversions.
2681 CODE is the kind of expression to build.
2682 This function differs from `build' in several ways:
2683 the data type of the result is computed and recorded in it,
2684 warnings are generated if arg data types are invalid,
2685 special handling for addition and subtraction of pointers is known,
2686 and some optimization is done (operations on narrow ints
2687 are done in the narrower type when that gives the same result).
2688 Constant folding is also done before the result is returned.
2690 Note that the operands will never have enumeral types
2691 because either they have just had the default conversions performed
2692 or they have both just been converted to some other type in which
2693 the arithmetic is to be done.
2695 C++: must do special pointer arithmetic when implementing
2696 multiple inheritance, and deal with pointer to member functions. */
2699 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
2700 int convert_p ATTRIBUTE_UNUSED)
2703 enum tree_code code0, code1;
2706 /* Expression code to give to the expression when it is built.
2707 Normally this is CODE, which is what the caller asked for,
2708 but in some special cases we change it. */
2709 enum tree_code resultcode = code;
2711 /* Data type in which the computation is to be performed.
2712 In the simplest cases this is the common type of the arguments. */
2713 tree result_type = NULL;
2715 /* Nonzero means operands have already been type-converted
2716 in whatever way is necessary.
2717 Zero means they need to be converted to RESULT_TYPE. */
2720 /* Nonzero means create the expression with this type, rather than
2722 tree build_type = 0;
2724 /* Nonzero means after finally constructing the expression
2725 convert it to this type. */
2726 tree final_type = 0;
2730 /* Nonzero if this is an operation like MIN or MAX which can
2731 safely be computed in short if both args are promoted shorts.
2732 Also implies COMMON.
2733 -1 indicates a bitwise operation; this makes a difference
2734 in the exact conditions for when it is safe to do the operation
2735 in a narrower mode. */
2738 /* Nonzero if this is a comparison operation;
2739 if both args are promoted shorts, compare the original shorts.
2740 Also implies COMMON. */
2741 int short_compare = 0;
2743 /* Nonzero if this is a right-shift operation, which can be computed on the
2744 original short and then promoted if the operand is a promoted short. */
2745 int short_shift = 0;
2747 /* Nonzero means set RESULT_TYPE to the common type of the args. */
2750 /* True if both operands have arithmetic type. */
2751 bool arithmetic_types_p;
2753 /* Apply default conversions. */
2757 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
2758 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
2759 || code == TRUTH_XOR_EXPR)
2761 if (!really_overloaded_fn (op0))
2762 op0 = decay_conversion (op0);
2763 if (!really_overloaded_fn (op1))
2764 op1 = decay_conversion (op1);
2768 if (!really_overloaded_fn (op0))
2769 op0 = default_conversion (op0);
2770 if (!really_overloaded_fn (op1))
2771 op1 = default_conversion (op1);
2774 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2775 STRIP_TYPE_NOPS (op0);
2776 STRIP_TYPE_NOPS (op1);
2778 /* DTRT if one side is an overloaded function, but complain about it. */
2779 if (type_unknown_p (op0))
2781 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
2782 if (t != error_mark_node)
2784 pedwarn ("assuming cast to type %qT from overloaded function",
2789 if (type_unknown_p (op1))
2791 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
2792 if (t != error_mark_node)
2794 pedwarn ("assuming cast to type %qT from overloaded function",
2800 type0 = TREE_TYPE (op0);
2801 type1 = TREE_TYPE (op1);
2803 /* The expression codes of the data types of the arguments tell us
2804 whether the arguments are integers, floating, pointers, etc. */
2805 code0 = TREE_CODE (type0);
2806 code1 = TREE_CODE (type1);
2808 /* If an error was already reported for one of the arguments,
2809 avoid reporting another error. */
2811 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
2812 return error_mark_node;
2817 /* Handle the pointer + int case. */
2818 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2819 return cp_pointer_int_sum (PLUS_EXPR, op0, op1);
2820 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
2821 return cp_pointer_int_sum (PLUS_EXPR, op1, op0);
2827 /* Subtraction of two similar pointers.
2828 We must subtract them as integers, then divide by object size. */
2829 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
2830 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
2832 return pointer_diff (op0, op1, common_type (type0, type1));
2833 /* Handle pointer minus int. Just like pointer plus int. */
2834 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
2835 return cp_pointer_int_sum (MINUS_EXPR, op0, op1);
2844 case TRUNC_DIV_EXPR:
2846 case FLOOR_DIV_EXPR:
2847 case ROUND_DIV_EXPR:
2848 case EXACT_DIV_EXPR:
2849 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2850 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
2851 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2852 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
2854 if (TREE_CODE (op1) == INTEGER_CST && integer_zerop (op1))
2855 warning ("division by zero in %<%E / 0%>", op0);
2856 else if (TREE_CODE (op1) == REAL_CST && real_zerop (op1))
2857 warning ("division by zero in %<%E / 0.%>", op0);
2859 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
2860 code0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
2861 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
2862 code1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
2864 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
2865 resultcode = RDIV_EXPR;
2867 /* When dividing two signed integers, we have to promote to int.
2868 unless we divide by a constant != -1. Note that default
2869 conversion will have been performed on the operands at this
2870 point, so we have to dig out the original type to find out if
2872 shorten = ((TREE_CODE (op0) == NOP_EXPR
2873 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2874 || (TREE_CODE (op1) == INTEGER_CST
2875 && ! integer_all_onesp (op1)));
2884 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2888 case TRUNC_MOD_EXPR:
2889 case FLOOR_MOD_EXPR:
2890 if (code1 == INTEGER_TYPE && integer_zerop (op1))
2891 warning ("division by zero in %<%E %% 0%>", op0);
2892 else if (code1 == REAL_TYPE && real_zerop (op1))
2893 warning ("division by zero in %<%E %% 0.%>", op0);
2895 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2897 /* Although it would be tempting to shorten always here, that loses
2898 on some targets, since the modulo instruction is undefined if the
2899 quotient can't be represented in the computation mode. We shorten
2900 only if unsigned or if dividing by something we know != -1. */
2901 shorten = ((TREE_CODE (op0) == NOP_EXPR
2902 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
2903 || (TREE_CODE (op1) == INTEGER_CST
2904 && ! integer_all_onesp (op1)));
2909 case TRUTH_ANDIF_EXPR:
2910 case TRUTH_ORIF_EXPR:
2911 case TRUTH_AND_EXPR:
2913 result_type = boolean_type_node;
2916 /* Shift operations: result has same type as first operand;
2917 always convert second operand to int.
2918 Also set SHORT_SHIFT if shifting rightward. */
2921 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2923 result_type = type0;
2924 if (TREE_CODE (op1) == INTEGER_CST)
2926 if (tree_int_cst_lt (op1, integer_zero_node))
2927 warning ("right shift count is negative");
2930 if (! integer_zerop (op1))
2932 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2933 warning ("right shift count >= width of type");
2936 /* Convert the shift-count to an integer, regardless of
2937 size of value being shifted. */
2938 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2939 op1 = cp_convert (integer_type_node, op1);
2940 /* Avoid converting op1 to result_type later. */
2946 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2948 result_type = type0;
2949 if (TREE_CODE (op1) == INTEGER_CST)
2951 if (tree_int_cst_lt (op1, integer_zero_node))
2952 warning ("left shift count is negative");
2953 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2954 warning ("left shift count >= width of type");
2956 /* Convert the shift-count to an integer, regardless of
2957 size of value being shifted. */
2958 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
2959 op1 = cp_convert (integer_type_node, op1);
2960 /* Avoid converting op1 to result_type later. */
2967 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
2969 result_type = type0;
2970 if (TREE_CODE (op1) == INTEGER_CST)
2972 if (tree_int_cst_lt (op1, integer_zero_node))
2973 warning ("%s rotate count is negative",
2974 (code == LROTATE_EXPR) ? "left" : "right");
2975 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
2976 warning ("%s rotate count >= width of type",
2977 (code == LROTATE_EXPR) ? "left" : "right");
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);
2988 if (warn_float_equal && (code0 == REAL_TYPE || code1 == REAL_TYPE))
2989 warning ("comparing floating point with == or != is unsafe");
2991 build_type = boolean_type_node;
2992 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
2993 || code0 == COMPLEX_TYPE)
2994 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
2995 || code1 == COMPLEX_TYPE))
2997 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
2998 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
2999 result_type = composite_pointer_type (type0, type1, op0, op1,
3001 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3002 && null_ptr_cst_p (op1))
3003 result_type = type0;
3004 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3005 && null_ptr_cst_p (op0))
3006 result_type = type1;
3007 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3009 result_type = type0;
3010 error ("ISO C++ forbids comparison between pointer and integer");
3012 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3014 result_type = type1;
3015 error ("ISO C++ forbids comparison between pointer and integer");
3017 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3019 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
3020 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3021 result_type = TREE_TYPE (op0);
3023 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3024 return cp_build_binary_op (code, op1, op0);
3025 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1)
3026 && same_type_p (type0, type1))
3028 /* E will be the final comparison. */
3030 /* E1 and E2 are for scratch. */
3038 if (TREE_SIDE_EFFECTS (op0))
3039 op0 = save_expr (op0);
3040 if (TREE_SIDE_EFFECTS (op1))
3041 op1 = save_expr (op1);
3046 && (!op0.pfn || op0.delta == op1.delta))
3048 The reason for the `!op0.pfn' bit is that a NULL
3049 pointer-to-member is any member with a zero PFN; the
3050 DELTA field is unspecified. */
3051 pfn0 = pfn_from_ptrmemfunc (op0);
3052 pfn1 = pfn_from_ptrmemfunc (op1);
3053 delta0 = build_ptrmemfunc_access_expr (op0,
3055 delta1 = build_ptrmemfunc_access_expr (op1,
3057 e1 = cp_build_binary_op (EQ_EXPR, delta0, delta1);
3058 e2 = cp_build_binary_op (EQ_EXPR,
3060 cp_convert (TREE_TYPE (pfn0),
3061 integer_zero_node));
3062 e1 = cp_build_binary_op (TRUTH_ORIF_EXPR, e1, e2);
3063 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3064 e = cp_build_binary_op (TRUTH_ANDIF_EXPR, e2, e1);
3065 if (code == EQ_EXPR)
3067 return cp_build_binary_op (EQ_EXPR, e, integer_zero_node);
3071 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
3072 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
3074 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
3075 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
3083 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3084 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3086 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3087 result_type = composite_pointer_type (type0, type1, op0, op1,
3095 build_type = boolean_type_node;
3096 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3097 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3099 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3100 result_type = composite_pointer_type (type0, type1, op0, op1,
3102 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3103 && integer_zerop (op1))
3104 result_type = type0;
3105 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3106 && integer_zerop (op0))
3107 result_type = type1;
3108 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3110 result_type = type0;
3111 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3113 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3115 result_type = type1;
3116 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3120 case UNORDERED_EXPR:
3127 build_type = integer_type_node;
3128 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
3130 error ("unordered comparison on non-floating point argument");
3131 return error_mark_node;
3140 arithmetic_types_p =
3141 ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
3142 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3143 || code1 == COMPLEX_TYPE));
3144 /* Determine the RESULT_TYPE, if it is not already known. */
3146 && arithmetic_types_p
3147 && (shorten || common || short_compare))
3148 result_type = common_type (type0, type1);
3152 error ("invalid operands of types %qT and %qT to binary %qO",
3153 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
3154 return error_mark_node;
3157 /* If we're in a template, the only thing we need to know is the
3159 if (processing_template_decl)
3160 return build2 (resultcode,
3161 build_type ? build_type : result_type,
3164 if (arithmetic_types_p)
3166 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
3168 /* For certain operations (which identify themselves by shorten != 0)
3169 if both args were extended from the same smaller type,
3170 do the arithmetic in that type and then extend.
3172 shorten !=0 and !=1 indicates a bitwise operation.
3173 For them, this optimization is safe only if
3174 both args are zero-extended or both are sign-extended.
3175 Otherwise, we might change the result.
3176 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3177 but calculated in (unsigned short) it would be (unsigned short)-1. */
3179 if (shorten && none_complex)
3181 int unsigned0, unsigned1;
3182 tree arg0 = get_narrower (op0, &unsigned0);
3183 tree arg1 = get_narrower (op1, &unsigned1);
3184 /* UNS is 1 if the operation to be done is an unsigned one. */
3185 int uns = TYPE_UNSIGNED (result_type);
3188 final_type = result_type;
3190 /* Handle the case that OP0 does not *contain* a conversion
3191 but it *requires* conversion to FINAL_TYPE. */
3193 if (op0 == arg0 && TREE_TYPE (op0) != final_type)
3194 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
3195 if (op1 == arg1 && TREE_TYPE (op1) != final_type)
3196 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
3198 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3200 /* For bitwise operations, signedness of nominal type
3201 does not matter. Consider only how operands were extended. */
3205 /* Note that in all three cases below we refrain from optimizing
3206 an unsigned operation on sign-extended args.
3207 That would not be valid. */
3209 /* Both args variable: if both extended in same way
3210 from same width, do it in that width.
3211 Do it unsigned if args were zero-extended. */
3212 if ((TYPE_PRECISION (TREE_TYPE (arg0))
3213 < TYPE_PRECISION (result_type))
3214 && (TYPE_PRECISION (TREE_TYPE (arg1))
3215 == TYPE_PRECISION (TREE_TYPE (arg0)))
3216 && unsigned0 == unsigned1
3217 && (unsigned0 || !uns))
3218 result_type = c_common_signed_or_unsigned_type
3219 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
3220 else if (TREE_CODE (arg0) == INTEGER_CST
3221 && (unsigned1 || !uns)
3222 && (TYPE_PRECISION (TREE_TYPE (arg1))
3223 < TYPE_PRECISION (result_type))
3224 && (type = c_common_signed_or_unsigned_type
3225 (unsigned1, TREE_TYPE (arg1)),
3226 int_fits_type_p (arg0, type)))
3228 else if (TREE_CODE (arg1) == INTEGER_CST
3229 && (unsigned0 || !uns)
3230 && (TYPE_PRECISION (TREE_TYPE (arg0))
3231 < TYPE_PRECISION (result_type))
3232 && (type = c_common_signed_or_unsigned_type
3233 (unsigned0, TREE_TYPE (arg0)),
3234 int_fits_type_p (arg1, type)))
3238 /* Shifts can be shortened if shifting right. */
3243 tree arg0 = get_narrower (op0, &unsigned_arg);
3245 final_type = result_type;
3247 if (arg0 == op0 && final_type == TREE_TYPE (op0))
3248 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
3250 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
3251 /* We can shorten only if the shift count is less than the
3252 number of bits in the smaller type size. */
3253 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
3254 /* If arg is sign-extended and then unsigned-shifted,
3255 we can simulate this with a signed shift in arg's type
3256 only if the extended result is at least twice as wide
3257 as the arg. Otherwise, the shift could use up all the
3258 ones made by sign-extension and bring in zeros.
3259 We can't optimize that case at all, but in most machines
3260 it never happens because available widths are 2**N. */
3261 && (!TYPE_UNSIGNED (final_type)
3263 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0)))
3264 <= TYPE_PRECISION (result_type))))
3266 /* Do an unsigned shift if the operand was zero-extended. */
3268 = c_common_signed_or_unsigned_type (unsigned_arg,
3270 /* Convert value-to-be-shifted to that type. */
3271 if (TREE_TYPE (op0) != result_type)
3272 op0 = cp_convert (result_type, op0);
3277 /* Comparison operations are shortened too but differently.
3278 They identify themselves by setting short_compare = 1. */
3282 /* Don't write &op0, etc., because that would prevent op0
3283 from being kept in a register.
3284 Instead, make copies of the our local variables and
3285 pass the copies by reference, then copy them back afterward. */
3286 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3287 enum tree_code xresultcode = resultcode;
3289 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3291 return cp_convert (boolean_type_node, val);
3292 op0 = xop0, op1 = xop1;
3294 resultcode = xresultcode;
3297 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
3298 && warn_sign_compare
3299 /* Do not warn until the template is instantiated; we cannot
3300 bound the ranges of the arguments until that point. */
3301 && !processing_template_decl)
3303 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
3304 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3306 int unsignedp0, unsignedp1;
3307 tree primop0 = get_narrower (op0, &unsignedp0);
3308 tree primop1 = get_narrower (op1, &unsignedp1);
3310 /* Check for comparison of different enum types. */
3311 if (TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
3312 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
3313 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
3314 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
3316 warning ("comparison between types %q#T and %q#T",
3317 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
3320 /* Give warnings for comparisons between signed and unsigned
3321 quantities that may fail. */
3322 /* Do the checking based on the original operand trees, so that
3323 casts will be considered, but default promotions won't be. */
3325 /* Do not warn if the comparison is being done in a signed type,
3326 since the signed type will only be chosen if it can represent
3327 all the values of the unsigned type. */
3328 if (!TYPE_UNSIGNED (result_type))
3330 /* Do not warn if both operands are unsigned. */
3331 else if (op0_signed == op1_signed)
3333 /* Do not warn if the signed quantity is an unsuffixed
3334 integer literal (or some static constant expression
3335 involving such literals or a conditional expression
3336 involving such literals) and it is non-negative. */
3337 else if ((op0_signed && tree_expr_nonnegative_p (orig_op0))
3338 || (op1_signed && tree_expr_nonnegative_p (orig_op1)))
3340 /* Do not warn if the comparison is an equality operation,
3341 the unsigned quantity is an integral constant and it does
3342 not use the most significant bit of result_type. */
3343 else if ((resultcode == EQ_EXPR || resultcode == NE_EXPR)
3344 && ((op0_signed && TREE_CODE (orig_op1) == INTEGER_CST
3345 && int_fits_type_p (orig_op1, c_common_signed_type
3347 || (op1_signed && TREE_CODE (orig_op0) == INTEGER_CST
3348 && int_fits_type_p (orig_op0, c_common_signed_type
3352 warning ("comparison between signed and unsigned integer expressions");
3354 /* Warn if two unsigned values are being compared in a size
3355 larger than their original size, and one (and only one) is the
3356 result of a `~' operator. This comparison will always fail.
3358 Also warn if one operand is a constant, and the constant does not
3359 have all bits set that are set in the ~ operand when it is
3362 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
3363 ^ (TREE_CODE (primop1) == BIT_NOT_EXPR))
3365 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
3366 primop0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
3367 if (TREE_CODE (primop1) == BIT_NOT_EXPR)
3368 primop1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
3370 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
3373 HOST_WIDE_INT constant, mask;
3377 if (host_integerp (primop0, 0))
3380 unsignedp = unsignedp1;
3381 constant = tree_low_cst (primop0, 0);
3386 unsignedp = unsignedp0;
3387 constant = tree_low_cst (primop1, 0);
3390 bits = TYPE_PRECISION (TREE_TYPE (primop));
3391 if (bits < TYPE_PRECISION (result_type)
3392 && bits < HOST_BITS_PER_LONG && unsignedp)
3394 mask = (~ (HOST_WIDE_INT) 0) << bits;
3395 if ((mask & constant) != mask)
3396 warning ("comparison of promoted ~unsigned with constant");
3399 else if (unsignedp0 && unsignedp1
3400 && (TYPE_PRECISION (TREE_TYPE (primop0))
3401 < TYPE_PRECISION (result_type))
3402 && (TYPE_PRECISION (TREE_TYPE (primop1))
3403 < TYPE_PRECISION (result_type)))
3404 warning ("comparison of promoted ~unsigned with unsigned");
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. */
3414 /* Issue warnings about peculiar, but valid, uses of NULL. */
3415 if (/* It's reasonable to use pointer values as operands of &&
3416 and ||, so NULL is no exception. */
3417 !(code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
3418 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
3419 (orig_op0 == null_node
3420 && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE)
3421 /* Or vice versa. */
3422 || (orig_op1 == null_node
3423 && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE)
3424 /* Or, both are NULL and the operation was not a comparison. */
3425 || (orig_op0 == null_node && orig_op1 == null_node
3426 && code != EQ_EXPR && code != NE_EXPR)))
3427 /* Some sort of arithmetic operation involving NULL was
3428 performed. Note that pointer-difference and pointer-addition
3429 have already been handled above, and so we don't end up here in
3431 warning ("NULL used in arithmetic");
3435 if (TREE_TYPE (op0) != result_type)
3436 op0 = cp_convert (result_type, op0);
3437 if (TREE_TYPE (op1) != result_type)
3438 op1 = cp_convert (result_type, op1);
3440 if (op0 == error_mark_node || op1 == error_mark_node)
3441 return error_mark_node;
3444 if (build_type == NULL_TREE)
3445 build_type = result_type;
3447 result = build2 (resultcode, build_type, op0, op1);
3448 result = fold_if_not_in_template (result);
3449 if (final_type != 0)
3450 result = cp_convert (final_type, result);
3454 /* Return a tree for the sum or difference (RESULTCODE says which)
3455 of pointer PTROP and integer INTOP. */
3458 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
3460 tree res_type = TREE_TYPE (ptrop);
3462 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3463 in certain circumstance (when it's valid to do so). So we need
3464 to make sure it's complete. We don't need to check here, if we
3465 can actually complete it at all, as those checks will be done in
3466 pointer_int_sum() anyway. */
3467 complete_type (TREE_TYPE (res_type));
3469 return pointer_int_sum (resultcode, ptrop,
3470 fold_if_not_in_template (intop));
3473 /* Return a tree for the difference of pointers OP0 and OP1.
3474 The resulting tree has type int. */
3477 pointer_diff (tree op0, tree op1, tree ptrtype)
3480 tree restype = ptrdiff_type_node;
3481 tree target_type = TREE_TYPE (ptrtype);
3483 if (!complete_type_or_else (target_type, NULL_TREE))
3484 return error_mark_node;
3486 if (pedantic || warn_pointer_arith)
3488 if (TREE_CODE (target_type) == VOID_TYPE)
3489 pedwarn ("ISO C++ forbids using pointer of type %<void *%> in subtraction");
3490 if (TREE_CODE (target_type) == FUNCTION_TYPE)
3491 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3492 if (TREE_CODE (target_type) == METHOD_TYPE)
3493 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3496 /* First do the subtraction as integers;
3497 then drop through to build the divide operator. */
3499 op0 = cp_build_binary_op (MINUS_EXPR,
3500 cp_convert (restype, op0),
3501 cp_convert (restype, op1));
3503 /* This generates an error if op1 is a pointer to an incomplete type. */
3504 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
3505 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3507 op1 = (TYPE_PTROB_P (ptrtype)
3508 ? size_in_bytes (target_type)
3509 : integer_one_node);
3511 /* Do the division. */
3513 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
3514 return fold_if_not_in_template (result);
3517 /* Construct and perhaps optimize a tree representation
3518 for a unary operation. CODE, a tree_code, specifies the operation
3519 and XARG is the operand. */
3522 build_x_unary_op (enum tree_code code, tree xarg)
3524 tree orig_expr = xarg;
3528 if (processing_template_decl)
3530 if (type_dependent_expression_p (xarg))
3531 return build_min_nt (code, xarg, NULL_TREE);
3533 /* For non-dependent pointer-to-member, the SCOPE_REF will be
3534 processed during template substitution. Just compute the
3535 right type here and build an ADDR_EXPR around it for
3537 if (code == ADDR_EXPR && TREE_CODE (xarg) == SCOPE_REF)
3540 if (TREE_TYPE (xarg) == unknown_type_node)
3541 type = unknown_type_node;
3542 else if (TREE_CODE (TREE_TYPE (xarg)) == FUNCTION_TYPE)
3543 type = build_pointer_type (TREE_TYPE (xarg));
3545 type = build_ptrmem_type (TREE_OPERAND (xarg, 0),
3547 return build_min (code, type, xarg, NULL_TREE);
3550 xarg = build_non_dependent_expr (xarg);
3555 /* [expr.unary.op] says:
3557 The address of an object of incomplete type can be taken.
3559 (And is just the ordinary address operator, not an overloaded
3560 "operator &".) However, if the type is a template
3561 specialization, we must complete the type at this point so that
3562 an overloaded "operator &" will be available if required. */
3563 if (code == ADDR_EXPR
3564 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
3565 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
3566 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
3567 || (TREE_CODE (xarg) == OFFSET_REF)))
3568 /* Don't look for a function. */;
3570 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
3571 /*overloaded_p=*/NULL);
3572 if (!exp && code == ADDR_EXPR)
3574 /* A pointer to member-function can be formed only by saying
3576 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
3577 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
3579 if (TREE_CODE (xarg) != OFFSET_REF)
3581 error ("invalid use of %qE to form a pointer-to-member-function."
3582 " Use a qualified-id.",
3584 return error_mark_node;
3588 error ("parenthesis around %qE cannot be used to form a"
3589 " pointer-to-member-function",
3591 PTRMEM_OK_P (xarg) = 1;
3595 if (TREE_CODE (xarg) == OFFSET_REF)
3597 ptrmem = PTRMEM_OK_P (xarg);
3599 if (!ptrmem && !flag_ms_extensions
3600 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
3602 /* A single non-static member, make sure we don't allow a
3603 pointer-to-member. */
3604 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
3605 TREE_OPERAND (xarg, 0),
3606 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
3607 PTRMEM_OK_P (xarg) = ptrmem;
3610 else if (TREE_CODE (xarg) == TARGET_EXPR)
3611 warning ("taking address of temporary");
3612 exp = build_unary_op (ADDR_EXPR, xarg, 0);
3613 if (TREE_CODE (exp) == ADDR_EXPR)
3614 PTRMEM_OK_P (exp) = ptrmem;
3617 if (processing_template_decl && exp != error_mark_node)
3618 return build_min_non_dep (code, exp, orig_expr,
3619 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
3623 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
3624 constants, where a null value is represented by an INTEGER_CST of
3628 cp_truthvalue_conversion (tree expr)
3630 tree type = TREE_TYPE (expr);
3631 if (TYPE_PTRMEM_P (type))
3632 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
3634 return c_common_truthvalue_conversion (expr);
3637 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
3640 condition_conversion (tree expr)
3643 if (processing_template_decl)
3645 t = perform_implicit_conversion (boolean_type_node, expr);
3646 t = fold_build_cleanup_point_expr (boolean_type_node, t);
3650 /* Return an ADDR_EXPR giving the address of T. This function
3651 attempts no optimizations or simplifications; it is a low-level
3655 build_address (tree t)
3659 if (error_operand_p (t) || !cxx_mark_addressable (t))
3660 return error_mark_node;
3662 addr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (t)), t);
3667 /* Return a NOP_EXPR converting EXPR to TYPE. */
3670 build_nop (tree type, tree expr)
3672 if (type == error_mark_node || error_operand_p (expr))
3674 return build1 (NOP_EXPR, type, expr);
3677 /* C++: Must handle pointers to members.
3679 Perhaps type instantiation should be extended to handle conversion
3680 from aggregates to types we don't yet know we want? (Or are those
3681 cases typically errors which should be reported?)
3683 NOCONVERT nonzero suppresses the default promotions
3684 (such as from short to int). */
3687 build_unary_op (enum tree_code code, tree xarg, int noconvert)
3689 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3692 const char *errstring = NULL;
3695 if (arg == error_mark_node)
3696 return error_mark_node;
3700 /* CONVERT_EXPR stands for unary plus in this context. */
3704 int flags = WANT_ARITH | WANT_ENUM;
3705 /* Unary plus (but not unary minus) is allowed on pointers. */
3706 if (code == CONVERT_EXPR)
3707 flags |= WANT_POINTER;
3708 arg = build_expr_type_conversion (flags, arg, true);
3710 errstring = (code == NEGATE_EXPR
3711 ? "wrong type argument to unary minus"
3712 : "wrong type argument to unary plus");
3715 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
3716 arg = perform_integral_promotions (arg);
3718 /* Make sure the result is not a lvalue: a unary plus or minus
3719 expression is always a rvalue. */
3720 if (real_lvalue_p (arg))
3721 arg = build1 (NON_LVALUE_EXPR, TREE_TYPE (arg), arg);
3727 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3731 arg = default_conversion (arg);
3733 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM,
3735 errstring = "wrong type argument to bit-complement";
3736 else if (!noconvert)
3737 arg = perform_integral_promotions (arg);
3741 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
3742 errstring = "wrong type argument to abs";
3743 else if (!noconvert)
3744 arg = default_conversion (arg);
3748 /* Conjugating a real value is a no-op, but allow it anyway. */
3749 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
3750 errstring = "wrong type argument to conjugation";
3751 else if (!noconvert)
3752 arg = default_conversion (arg);
3755 case TRUTH_NOT_EXPR:
3756 arg = perform_implicit_conversion (boolean_type_node, arg);
3757 val = invert_truthvalue (arg);
3758 if (arg != error_mark_node)
3760 errstring = "in argument to unary !";
3767 if (TREE_CODE (arg) == COMPLEX_CST)
3768 return TREE_REALPART (arg);
3769 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3771 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3772 return fold_if_not_in_template (arg);
3778 if (TREE_CODE (arg) == COMPLEX_CST)
3779 return TREE_IMAGPART (arg);
3780 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3782 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3783 return fold_if_not_in_template (arg);
3786 return cp_convert (TREE_TYPE (arg), integer_zero_node);
3788 case PREINCREMENT_EXPR:
3789 case POSTINCREMENT_EXPR:
3790 case PREDECREMENT_EXPR:
3791 case POSTDECREMENT_EXPR:
3792 /* Handle complex lvalues (when permitted)
3793 by reduction to simpler cases. */
3795 val = unary_complex_lvalue (code, arg);
3799 /* Increment or decrement the real part of the value,
3800 and don't change the imaginary part. */
3801 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3805 arg = stabilize_reference (arg);
3806 real = build_unary_op (REALPART_EXPR, arg, 1);
3807 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
3808 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3809 build_unary_op (code, real, 1), imag);
3812 /* Report invalid types. */
3814 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
3817 if (code == PREINCREMENT_EXPR)
3818 errstring ="no pre-increment operator for type";
3819 else if (code == POSTINCREMENT_EXPR)
3820 errstring ="no post-increment operator for type";
3821 else if (code == PREDECREMENT_EXPR)
3822 errstring ="no pre-decrement operator for type";
3824 errstring ="no post-decrement operator for type";
3828 /* Report something read-only. */
3830 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
3831 || TREE_READONLY (arg))
3832 readonly_error (arg, ((code == PREINCREMENT_EXPR
3833 || code == POSTINCREMENT_EXPR)
3834 ? "increment" : "decrement"),
3839 tree result_type = TREE_TYPE (arg);
3841 arg = get_unwidened (arg, 0);
3842 argtype = TREE_TYPE (arg);
3844 /* ARM $5.2.5 last annotation says this should be forbidden. */
3845 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
3846 pedwarn ("ISO C++ forbids %sing an enum",
3847 (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3848 ? "increment" : "decrement");
3850 /* Compute the increment. */
3852 if (TREE_CODE (argtype) == POINTER_TYPE)
3854 tree type = complete_type (TREE_TYPE (argtype));
3856 if (!COMPLETE_OR_VOID_TYPE_P (type))
3857 error ("cannot %s a pointer to incomplete type %qT",
3858 ((code == PREINCREMENT_EXPR
3859 || code == POSTINCREMENT_EXPR)
3860 ? "increment" : "decrement"), TREE_TYPE (argtype));
3861 else if ((pedantic || warn_pointer_arith)
3862 && !TYPE_PTROB_P (argtype))
3863 pedwarn ("ISO C++ forbids %sing a pointer of type %qT",
3864 ((code == PREINCREMENT_EXPR
3865 || code == POSTINCREMENT_EXPR)
3866 ? "increment" : "decrement"), argtype);
3867 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
3870 inc = integer_one_node;
3872 inc = cp_convert (argtype, inc);
3874 /* Handle incrementing a cast-expression. */
3876 switch (TREE_CODE (arg))
3881 case FIX_TRUNC_EXPR:
3882 case FIX_FLOOR_EXPR:
3883 case FIX_ROUND_EXPR:
3886 tree incremented, modify, value, compound;
3887 if (! lvalue_p (arg) && pedantic)
3888 pedwarn ("cast to non-reference type used as lvalue");
3889 arg = stabilize_reference (arg);
3890 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
3893 value = save_expr (arg);
3894 incremented = build2 (((code == PREINCREMENT_EXPR
3895 || code == POSTINCREMENT_EXPR)
3896 ? PLUS_EXPR : MINUS_EXPR),
3897 argtype, value, inc);
3899 modify = build_modify_expr (arg, NOP_EXPR, incremented);
3900 compound = build2 (COMPOUND_EXPR, TREE_TYPE (arg),
3903 /* Eliminate warning about unused result of + or -. */
3904 TREE_NO_WARNING (compound) = 1;
3912 /* Complain about anything else that is not a true lvalue. */
3913 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3914 || code == POSTINCREMENT_EXPR)
3915 ? lv_increment : lv_decrement)))
3916 return error_mark_node;
3918 /* Forbid using -- on `bool'. */
3919 if (TREE_TYPE (arg) == boolean_type_node)
3921 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
3923 error ("invalid use of %<--%> on bool variable %qD", arg);
3924 return error_mark_node;
3926 val = boolean_increment (code, arg);
3929 val = build2 (code, TREE_TYPE (arg), arg, inc);
3931 TREE_SIDE_EFFECTS (val) = 1;
3932 return cp_convert (result_type, val);
3936 /* Note that this operation never does default_conversion
3937 regardless of NOCONVERT. */
3939 argtype = lvalue_type (arg);
3941 if (TREE_CODE (arg) == OFFSET_REF)
3944 if (TREE_CODE (argtype) == REFERENCE_TYPE)
3946 tree type = build_pointer_type (TREE_TYPE (argtype));
3947 arg = build1 (CONVERT_EXPR, type, arg);
3950 else if (pedantic && DECL_MAIN_P (arg))
3952 pedwarn ("ISO C++ forbids taking address of function %<::main%>");
3954 /* Let &* cancel out to simplify resulting code. */
3955 if (TREE_CODE (arg) == INDIRECT_REF)
3957 /* We don't need to have `current_class_ptr' wrapped in a
3958 NON_LVALUE_EXPR node. */
3959 if (arg == current_class_ref)
3960 return current_class_ptr;
3962 arg = TREE_OPERAND (arg, 0);
3963 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
3965 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
3966 arg = build1 (CONVERT_EXPR, type, arg);
3968 else if (lvalue_p (arg))
3969 /* Don't let this be an lvalue. */
3970 return non_lvalue (arg);
3974 /* Uninstantiated types are all functions. Taking the
3975 address of a function is a no-op, so just return the
3978 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
3979 || !IDENTIFIER_OPNAME_P (arg));
3981 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
3982 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
3984 /* They're trying to take the address of a unique non-static
3985 member function. This is ill-formed (except in MS-land),
3986 but let's try to DTRT.
3987 Note: We only handle unique functions here because we don't
3988 want to complain if there's a static overload; non-unique
3989 cases will be handled by instantiate_type. But we need to
3990 handle this case here to allow casts on the resulting PMF.
3991 We could defer this in non-MS mode, but it's easier to give
3992 a useful error here. */
3994 /* Inside constant member functions, the `this' pointer
3995 contains an extra const qualifier. TYPE_MAIN_VARIANT
3996 is used here to remove this const from the diagnostics
3997 and the created OFFSET_REF. */
3998 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
3999 tree name = DECL_NAME (get_first_fn (TREE_OPERAND (arg, 1)));
4001 if (! flag_ms_extensions)
4003 if (current_class_type
4004 && TREE_OPERAND (arg, 0) == current_class_ref)
4005 /* An expression like &memfn. */
4006 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4007 " or parenthesized non-static member function to form"
4008 " a pointer to member function. Say %<&%T::%D%>",
4011 pedwarn ("ISO C++ forbids taking the address of a bound member"
4012 " function to form a pointer to member function."
4016 arg = build_offset_ref (base, name, /*address_p=*/true);