1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 88, 89, 92, 93, 94, 95, 1996 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file is part of the C++ front end.
24 It contains routines to build C++ expressions given their operands,
25 including computing the types of the result, C and C++ specific error
26 checks, and some optimization.
28 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
29 and to process initializations in declarations (since they work
30 like a strange sort of assignment). */
33 extern void warning ();
43 int mark_addressable PROTO((tree));
44 static tree convert_for_assignment PROTO((tree, tree, char*, tree, int));
45 /* static */ tree convert_for_initialization PROTO((tree, tree, tree, int, char*, tree, int));
46 extern tree shorten_compare ();
47 static tree pointer_int_sum PROTO((enum tree_code, register tree, register tree));
48 static tree pointer_diff PROTO((register tree, register tree));
49 static int comp_target_parms PROTO((tree, tree, int));
50 static int comp_ptr_ttypes_const PROTO((tree, tree));
51 static int comp_ptr_ttypes_reinterpret PROTO((tree, tree));
53 static tree convert_sequence ();
55 /* static */ tree unary_complex_lvalue PROTO((enum tree_code, tree));
56 static tree get_delta_difference PROTO((tree, tree, int));
58 /* Return the target type of TYPE, which meas return T for:
59 T*, T&, T[], T (...), and otherwise, just T. */
65 if (TREE_CODE (type) == REFERENCE_TYPE)
66 type = TREE_TYPE (type);
67 while (TREE_CODE (type) == POINTER_TYPE
68 || TREE_CODE (type) == ARRAY_TYPE
69 || TREE_CODE (type) == FUNCTION_TYPE
70 || TREE_CODE (type) == METHOD_TYPE
71 || TREE_CODE (type) == OFFSET_TYPE)
72 type = TREE_TYPE (type);
76 /* Do `exp = require_complete_type (exp);' to make sure exp
77 does not have an incomplete type. (That includes void types.) */
80 require_complete_type (value)
85 if (processing_template_decl)
88 type = TREE_TYPE (value);
90 /* First, detect a valid value with a complete type. */
91 if (TYPE_SIZE (type) != 0
92 && type != void_type_node
93 && ! (TYPE_LANG_SPECIFIC (type)
94 && (IS_SIGNATURE_POINTER (type) || IS_SIGNATURE_REFERENCE (type))
95 && TYPE_SIZE (SIGNATURE_TYPE (type)) == 0))
98 /* If we see X::Y, we build an OFFSET_TYPE which has
99 not been laid out. Try to avoid an error by interpreting
100 it as this->X::Y, if reasonable. */
101 if (TREE_CODE (value) == OFFSET_REF
102 && current_class_ref != 0
103 && TREE_OPERAND (value, 0) == current_class_ref)
105 tree base, member = TREE_OPERAND (value, 1);
106 tree basetype = TYPE_OFFSET_BASETYPE (type);
107 my_friendly_assert (TREE_CODE (member) == FIELD_DECL, 305);
108 base = convert_pointer_to (basetype, current_class_ptr);
109 value = build (COMPONENT_REF, TREE_TYPE (member),
110 build_indirect_ref (base, NULL_PTR), member);
111 return require_complete_type (value);
114 if (IS_AGGR_TYPE (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
116 instantiate_class_template (TYPE_MAIN_VARIANT (type));
117 if (TYPE_SIZE (type) != 0)
121 incomplete_type_error (value, type);
122 return error_mark_node;
129 if (type == error_mark_node || TYPE_SIZE (type) != NULL_TREE)
131 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
133 tree t = complete_type (TREE_TYPE (type));
134 if (TYPE_SIZE (t) != NULL_TREE && ! processing_template_decl)
136 TYPE_NEEDS_CONSTRUCTING (type)
137 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
138 TYPE_NEEDS_DESTRUCTOR (type)
139 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
141 else if (IS_AGGR_TYPE (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
142 instantiate_class_template (TYPE_MAIN_VARIANT (type));
147 /* Return truthvalue of whether type of EXP is instantiated. */
153 return (TREE_CODE (exp) == TREE_LIST
154 || TREE_TYPE (exp) == unknown_type_node
155 || (TREE_CODE (TREE_TYPE (exp)) == OFFSET_TYPE
156 && TREE_TYPE (TREE_TYPE (exp)) == unknown_type_node));
159 /* Return truthvalue of whether T is function (or pfn) type. */
165 return (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE
166 || (TREE_CODE (t) == POINTER_TYPE
167 && (TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE
168 || TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE)));
171 /* Do `exp = require_instantiated_type (type, exp);' to make sure EXP
172 does not have an uninstantiated type.
173 TYPE is type to instantiate with, if uninstantiated. */
176 require_instantiated_type (type, exp, errval)
177 tree type, exp, errval;
179 if (TREE_TYPE (exp) == NULL_TREE)
181 error ("argument list may not have an initializer list");
185 if (TREE_TYPE (exp) == unknown_type_node
186 || (TREE_CODE (TREE_TYPE (exp)) == OFFSET_TYPE
187 && TREE_TYPE (TREE_TYPE (exp)) == unknown_type_node))
189 exp = instantiate_type (type, exp, 1);
190 if (TREE_TYPE (exp) == error_mark_node)
196 /* Return a variant of TYPE which has all the type qualifiers of LIKE
197 as well as those of TYPE. */
200 qualify_type (type, like)
203 int constflag = TYPE_READONLY (type) || TYPE_READONLY (like);
204 int volflag = TYPE_VOLATILE (type) || TYPE_VOLATILE (like);
205 /* @@ Must do member pointers here. */
206 return cp_build_type_variant (type, constflag, volflag);
209 /* Return the common type of two parameter lists.
210 We assume that comptypes has already been done and returned 1;
211 if that isn't so, this may crash.
213 As an optimization, free the space we allocate if the parameter
214 lists are already common. */
220 tree oldargs = p1, newargs, n;
223 char *first_obj = (char *) oballoc (0);
225 len = list_length (p1);
226 newargs = tree_last (p1);
228 if (newargs == void_list_node)
237 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
242 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
244 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
246 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
249 else if (! TREE_PURPOSE (p1))
251 if (TREE_PURPOSE (p2))
253 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
259 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
261 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
263 if (TREE_VALUE (p1) != TREE_VALUE (p2))
266 TREE_VALUE (n) = common_type (TREE_VALUE (p1), TREE_VALUE (p2));
269 TREE_VALUE (n) = TREE_VALUE (p1);
280 /* Return the common type of two types.
281 We assume that comptypes has already been done and returned 1;
282 if that isn't so, this may crash.
284 This is the type for the result of most arithmetic operations
285 if the operands have the given two types.
287 We do not deal with enumeral types here because they have already been
288 converted to integer types. */
294 register enum tree_code code1;
295 register enum tree_code code2;
298 /* Save time if the two types are the same. */
300 if (t1 == t2) return t1;
302 /* If one type is nonsense, use the other. */
303 if (t1 == error_mark_node)
305 if (t2 == error_mark_node)
308 /* Merge the attributes */
310 { register tree a1, a2;
311 a1 = TYPE_ATTRIBUTES (t1);
312 a2 = TYPE_ATTRIBUTES (t2);
314 /* Either one unset? Take the set one. */
316 if (!(attributes = a1))
319 /* One that completely contains the other? Take it. */
321 else if (a2 && !attribute_list_contained (a1, a2))
322 if (attribute_list_contained (a2, a1))
326 /* Pick the longest list, and hang on the other list. */
327 /* ??? For the moment we punt on the issue of attrs with args. */
329 if (list_length (a1) < list_length (a2))
330 attributes = a2, a2 = a1;
332 for (; a2; a2 = TREE_CHAIN (a2))
333 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
334 attributes) == NULL_TREE)
337 TREE_CHAIN (a1) = attributes;
343 /* Treat an enum type as the unsigned integer type of the same width. */
345 if (TREE_CODE (t1) == ENUMERAL_TYPE)
346 t1 = type_for_size (TYPE_PRECISION (t1), 1);
347 if (TREE_CODE (t2) == ENUMERAL_TYPE)
348 t2 = type_for_size (TYPE_PRECISION (t2), 1);
350 if (TYPE_PTRMEMFUNC_P (t1))
351 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
352 if (TYPE_PTRMEMFUNC_P (t2))
353 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
355 code1 = TREE_CODE (t1);
356 code2 = TREE_CODE (t2);
362 /* If only one is real, use it as the result. */
364 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
365 return build_type_attribute_variant (t1, attributes);
367 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
368 return build_type_attribute_variant (t2, attributes);
370 /* Both real or both integers; use the one with greater precision. */
372 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
373 return build_type_attribute_variant (t1, attributes);
374 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
375 return build_type_attribute_variant (t2, attributes);
377 /* Same precision. Prefer longs to ints even when same size. */
379 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
380 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
381 return build_type_attribute_variant (long_unsigned_type_node,
384 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
385 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
387 /* But preserve unsignedness from the other type,
388 since long cannot hold all the values of an unsigned int. */
389 if (TREE_UNSIGNED (t1) || TREE_UNSIGNED (t2))
390 t1 = long_unsigned_type_node;
392 t1 = long_integer_type_node;
393 return build_type_attribute_variant (t1, attributes);
396 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
397 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
398 return build_type_attribute_variant (long_double_type_node,
401 /* Otherwise prefer the unsigned one. */
403 if (TREE_UNSIGNED (t1))
404 return build_type_attribute_variant (t1, attributes);
406 return build_type_attribute_variant (t2, attributes);
410 /* For two pointers, do this recursively on the target type,
411 and combine the qualifiers of the two types' targets. */
412 /* This code was turned off; I don't know why.
413 But ANSI C++ specifies doing this with the qualifiers.
414 So I turned it on again. */
416 tree tt1 = TYPE_MAIN_VARIANT (TREE_TYPE (t1));
417 tree tt2 = TYPE_MAIN_VARIANT (TREE_TYPE (t2));
419 = TYPE_READONLY (TREE_TYPE (t1)) || TYPE_READONLY (TREE_TYPE (t2));
421 = TYPE_VOLATILE (TREE_TYPE (t1)) || TYPE_VOLATILE (TREE_TYPE (t2));
426 else if (tt1 == void_type_node || tt2 == void_type_node)
427 target = void_type_node;
429 target = common_type (tt1, tt2);
431 target = cp_build_type_variant (target, constp, volatilep);
432 if (code1 == POINTER_TYPE)
433 t1 = build_pointer_type (target);
435 t1 = build_reference_type (target);
436 t1 = build_type_attribute_variant (t1, attributes);
438 if (TREE_CODE (target) == METHOD_TYPE)
439 t1 = build_ptrmemfunc_type (t1);
446 tree elt = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
447 /* Save space: see if the result is identical to one of the args. */
448 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
449 return build_type_attribute_variant (t1, attributes);
450 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
451 return build_type_attribute_variant (t2, attributes);
452 /* Merge the element types, and have a size if either arg has one. */
453 t1 = build_cplus_array_type
454 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
455 return build_type_attribute_variant (t1, attributes);
459 /* Function types: prefer the one that specified arg types.
460 If both do, merge the arg types. Also merge the return types. */
462 tree valtype = common_type (TREE_TYPE (t1), TREE_TYPE (t2));
463 tree p1 = TYPE_ARG_TYPES (t1);
464 tree p2 = TYPE_ARG_TYPES (t2);
467 /* Save space: see if the result is identical to one of the args. */
468 if (valtype == TREE_TYPE (t1) && ! p2)
469 return build_type_attribute_variant (t1, attributes);
470 if (valtype == TREE_TYPE (t2) && ! p1)
471 return build_type_attribute_variant (t2, attributes);
473 /* Simple way if one arg fails to specify argument types. */
474 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
476 rval = build_function_type (valtype, p2);
477 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
478 rval = build_exception_variant (rval, raises);
479 return build_type_attribute_variant (rval, attributes);
481 raises = TYPE_RAISES_EXCEPTIONS (t1);
482 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
484 rval = build_function_type (valtype, p1);
486 rval = build_exception_variant (rval, raises);
487 return build_type_attribute_variant (rval, attributes);
490 rval = build_function_type (valtype, commonparms (p1, p2));
491 rval = build_exception_variant (rval, raises);
492 return build_type_attribute_variant (rval, attributes);
497 my_friendly_assert (TYPE_MAIN_VARIANT (t1) == t1
498 && TYPE_MAIN_VARIANT (t2) == t2, 306);
500 if (DERIVED_FROM_P (t1, t2) && binfo_or_else (t1, t2))
501 return build_type_attribute_variant (t1, attributes);
502 else if (binfo_or_else (t2, t1))
503 return build_type_attribute_variant (t2, attributes);
505 compiler_error ("common_type called with uncommon aggregate types");
508 if (TREE_CODE (TREE_TYPE (t1)) == TREE_CODE (TREE_TYPE (t2)))
510 /* Get this value the long way, since TYPE_METHOD_BASETYPE
511 is just the main variant of this. */
515 tree b1 = TYPE_OFFSET_BASETYPE (t1);
516 tree b2 = TYPE_OFFSET_BASETYPE (t2);
518 if (comptypes (b1, b2, 1)
519 || (DERIVED_FROM_P (b1, b2) && binfo_or_else (b1, b2)))
520 basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
523 if (binfo_or_else (b2, b1) == NULL_TREE)
524 compiler_error ("common_type called with uncommon method types");
525 basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t1)));
528 raises = TYPE_RAISES_EXCEPTIONS (t1);
530 /* If this was a member function type, get back to the
531 original type of type member function (i.e., without
532 the class instance variable up front. */
533 t1 = build_function_type (TREE_TYPE (t1), TREE_CHAIN (TYPE_ARG_TYPES (t1)));
534 t2 = build_function_type (TREE_TYPE (t2), TREE_CHAIN (TYPE_ARG_TYPES (t2)));
535 t3 = common_type (t1, t2);
536 t3 = build_cplus_method_type (basetype, TREE_TYPE (t3), TYPE_ARG_TYPES (t3));
537 t1 = build_exception_variant (t3, raises);
540 compiler_error ("common_type called with uncommon method types");
542 return build_type_attribute_variant (t1, attributes);
545 if (TREE_TYPE (t1) == TREE_TYPE (t2))
547 tree b1 = TYPE_OFFSET_BASETYPE (t1);
548 tree b2 = TYPE_OFFSET_BASETYPE (t2);
550 if (comptypes (b1, b2, 1)
551 || (DERIVED_FROM_P (b1, b2) && binfo_or_else (b1, b2)))
552 return build_type_attribute_variant (t2, attributes);
553 else if (binfo_or_else (b2, b1))
554 return build_type_attribute_variant (t1, attributes);
556 compiler_error ("common_type called with uncommon member types");
559 return build_type_attribute_variant (t1, attributes);
563 /* Return 1 if TYPE1 and TYPE2 raise the same exceptions. */
566 compexcepttypes (t1, t2)
569 return TYPE_RAISES_EXCEPTIONS (t1) == TYPE_RAISES_EXCEPTIONS (t2);
573 comp_array_types (cmp, t1, t2, strict)
574 register int (*cmp)();
578 tree d1 = TYPE_DOMAIN (t1);
579 tree d2 = TYPE_DOMAIN (t2);
581 /* Target types must match incl. qualifiers. */
582 if (!(TREE_TYPE (t1) == TREE_TYPE (t2)
583 || (*cmp) (TREE_TYPE (t1), TREE_TYPE (t2), strict)))
586 /* Sizes must match unless one is missing or variable. */
587 if (d1 == 0 || d2 == 0 || d1 == d2
588 || TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
589 || TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
590 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST
591 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST)
594 return ((TREE_INT_CST_LOW (TYPE_MIN_VALUE (d1))
595 == TREE_INT_CST_LOW (TYPE_MIN_VALUE (d2)))
596 && (TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d1))
597 == TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d2)))
598 && (TREE_INT_CST_LOW (TYPE_MAX_VALUE (d1))
599 == TREE_INT_CST_LOW (TYPE_MAX_VALUE (d2)))
600 && (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d1))
601 == TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d2))));
604 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
605 or various other operations. This is what ANSI C++ speaks of as
608 For C++: argument STRICT says we should be strict about this
611 2 : strict, except that if one type is a reference and
612 the other is not, compare the target type of the
613 reference to the type that's not a reference (ARM, p308).
614 This is used for checking for invalid overloading.
615 1 : strict (compared according to ANSI C)
616 This is used for checking whether two function decls match.
617 0 : <= (compared according to C++)
618 -1: <= or >= (relaxed)
620 Otherwise, pointers involving base classes and derived classes
621 can be mixed as valid: i.e. a pointer to a base class may be assigned
622 to a pointer to one of its derived classes, as per C++. A pointer to
623 a derived class may be passed as a parameter to a function expecting a
624 pointer to a base classes. These allowances do not commute. In this
625 case, TYPE1 is assumed to be the base class, and TYPE2 is assumed to
626 be the derived class. */
629 comptypes (type1, type2, strict)
633 register tree t1 = type1;
634 register tree t2 = type2;
637 /* Suppress errors caused by previously reported errors */
642 /* This should never happen. */
643 my_friendly_assert (t1 != error_mark_node, 307);
645 if (t2 == error_mark_node)
650 /* Treat an enum type as the unsigned integer type of the same width. */
652 if (TREE_CODE (t1) == ENUMERAL_TYPE)
653 t1 = type_for_size (TYPE_PRECISION (t1), 1);
654 if (TREE_CODE (t2) == ENUMERAL_TYPE)
655 t2 = type_for_size (TYPE_PRECISION (t2), 1);
661 if (TYPE_PTRMEMFUNC_P (t1))
662 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
663 if (TYPE_PTRMEMFUNC_P (t2))
664 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
666 /* Different classes of types can't be compatible. */
668 if (TREE_CODE (t1) != TREE_CODE (t2))
671 && ((TREE_CODE (t1) == REFERENCE_TYPE)
672 ^ (TREE_CODE (t2) == REFERENCE_TYPE)))
674 if (TREE_CODE (t1) == REFERENCE_TYPE)
675 return comptypes (TREE_TYPE (t1), t2, 1);
676 return comptypes (t1, TREE_TYPE (t2), 1);
684 /* Qualifiers must match. */
686 if (TYPE_READONLY (t1) != TYPE_READONLY (t2))
688 if (TYPE_VOLATILE (t1) != TYPE_VOLATILE (t2))
691 /* Allow for two different type nodes which have essentially the same
692 definition. Note that we already checked for equality of the type
693 type qualifiers (just above). */
695 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
698 /* ??? COMP_TYPE_ATTRIBUTES is currently useless for variables as each
699 attribute is its own main variant (`val' will remain 0). */
700 #ifndef COMP_TYPE_ATTRIBUTES
701 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
704 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
705 if (! (attrval = COMP_TYPE_ATTRIBUTES (t1, t2)))
708 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
711 switch (TREE_CODE (t1))
715 if (CLASSTYPE_TEMPLATE_INFO (t1) && CLASSTYPE_TEMPLATE_INFO (t2)
716 && CLASSTYPE_TI_TEMPLATE (t1) == CLASSTYPE_TI_TEMPLATE (t2))
718 int i = TREE_VEC_LENGTH (CLASSTYPE_TI_ARGS (t1));
719 tree *p1 = &TREE_VEC_ELT (CLASSTYPE_TI_ARGS (t1), 0);
720 tree *p2 = &TREE_VEC_ELT (CLASSTYPE_TI_ARGS (t2), 0);
724 if (TREE_CODE_CLASS (TREE_CODE (p1[i])) == 't')
726 if (! comptypes (p1[i], p2[i], 1))
731 if (simple_cst_equal (p1[i], p2[i]) <= 0)
742 val = (comptypes (build_pointer_type (TYPE_OFFSET_BASETYPE (t1)),
743 build_pointer_type (TYPE_OFFSET_BASETYPE (t2)), strict)
744 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict));
748 if (! compexcepttypes (t1, t2))
751 /* This case is anti-symmetrical!
752 One can pass a base member (or member function)
753 to something expecting a derived member (or member function),
754 but not vice-versa! */
756 val = (comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict)
757 && compparms (TYPE_ARG_TYPES (t1),
758 TYPE_ARG_TYPES (t2), strict));
772 if (TREE_CODE (t1) == RECORD_TYPE && TREE_CODE (t2) == RECORD_TYPE)
776 rval = t1 == t2 || DERIVED_FROM_P (t1, t2);
785 val = DERIVED_FROM_P (t2, t1);
792 val = comptypes (t1, t2, strict);
796 if (! compexcepttypes (t1, t2))
799 val = ((TREE_TYPE (t1) == TREE_TYPE (t2)
800 || comptypes (TREE_TYPE (t1), TREE_TYPE (t2), strict))
801 && compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2), strict));
805 /* Target types must match incl. qualifiers. */
806 val = comp_array_types (comptypes, t1, t2, strict);
809 case TEMPLATE_TYPE_PARM:
810 return TEMPLATE_TYPE_IDX (t1) == TEMPLATE_TYPE_IDX (t2);
813 if (TYPE_IDENTIFIER (t1) != TYPE_IDENTIFIER (t2))
815 return comptypes (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2), 1);
817 return attrval == 2 && val == 1 ? 2 : val;
820 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
821 ignoring their qualifiers.
823 NPTRS is the number of pointers we can strip off and keep cool.
824 This is used to permit (for aggr A, aggr B) A, B* to convert to A*,
825 but to not permit B** to convert to A**. */
828 comp_target_types (ttl, ttr, nptrs)
832 ttl = TYPE_MAIN_VARIANT (ttl);
833 ttr = TYPE_MAIN_VARIANT (ttr);
837 if (TREE_CODE (ttr) != TREE_CODE (ttl))
840 if (TREE_CODE (ttr) == POINTER_TYPE)
842 ttl = TREE_TYPE (ttl);
843 ttr = TREE_TYPE (ttr);
847 if (TREE_CODE (ttl) == VOID_TYPE
848 && TREE_CODE (ttr) != FUNCTION_TYPE
849 && TREE_CODE (ttr) != METHOD_TYPE
850 && TREE_CODE (ttr) != OFFSET_TYPE)
852 else if (TREE_CODE (ttr) == VOID_TYPE
853 && TREE_CODE (ttl) != FUNCTION_TYPE
854 && TREE_CODE (ttl) != METHOD_TYPE
855 && TREE_CODE (ttl) != OFFSET_TYPE)
857 else if (TREE_CODE (ttl) == POINTER_TYPE
858 || TREE_CODE (ttl) == ARRAY_TYPE)
860 if (comp_ptr_ttypes (ttl, ttr))
862 else if (comp_ptr_ttypes (ttr, ttl))
868 /* Const and volatile mean something different for function types,
869 so the usual checks are not appropriate. */
870 if (TREE_CODE (ttl) == FUNCTION_TYPE || TREE_CODE (ttl) == METHOD_TYPE)
871 return comp_target_types (ttl, ttr, nptrs - 1);
873 /* Make sure that the cv-quals change only in the same direction as
877 int c = TYPE_READONLY (ttl) - TYPE_READONLY (ttr);
878 int v = TYPE_VOLATILE (ttl) - TYPE_VOLATILE (ttr);
880 if ((c > 0 && v < 0) || (c < 0 && v > 0))
883 if (TYPE_MAIN_VARIANT (ttl) == TYPE_MAIN_VARIANT (ttr))
884 return (c + v < 0) ? -1 : 1;
886 t = comp_target_types (ttl, ttr, nptrs - 1);
887 if ((t == 1 && c + v >= 0) || (t == -1 && c + v <= 0))
894 if (TREE_CODE (ttr) == REFERENCE_TYPE)
895 return comp_target_types (TREE_TYPE (ttl), TREE_TYPE (ttr), nptrs);
896 if (TREE_CODE (ttr) == ARRAY_TYPE)
897 return comp_array_types (comp_target_types, ttl, ttr, 0);
898 else if (TREE_CODE (ttr) == FUNCTION_TYPE || TREE_CODE (ttr) == METHOD_TYPE)
899 if (comp_target_types (TREE_TYPE (ttl), TREE_TYPE (ttr), nptrs))
900 switch (comp_target_parms (TYPE_ARG_TYPES (ttl), TYPE_ARG_TYPES (ttr), 1))
909 my_friendly_abort (112);
915 else if (TREE_CODE (ttr) == OFFSET_TYPE)
917 /* Contravariance: we can assign a pointer to base member to a pointer
918 to derived member. Note difference from simple pointer case, where
919 we can pass a pointer to derived to a pointer to base. */
920 if (comptypes (TYPE_OFFSET_BASETYPE (ttr), TYPE_OFFSET_BASETYPE (ttl), 0))
921 return comp_target_types (TREE_TYPE (ttl), TREE_TYPE (ttr), nptrs);
922 else if (comptypes (TYPE_OFFSET_BASETYPE (ttl), TYPE_OFFSET_BASETYPE (ttr), 0)
923 && comp_target_types (TREE_TYPE (ttl), TREE_TYPE (ttr), nptrs))
926 else if (IS_AGGR_TYPE (ttl))
930 if (comptypes (build_pointer_type (ttl), build_pointer_type (ttr), 0))
932 if (comptypes (build_pointer_type (ttr), build_pointer_type (ttl), 0))
940 /* If two types share a common base type, return that basetype.
941 If there is not a unique most-derived base type, this function
942 returns ERROR_MARK_NODE. */
945 common_base_type (tt1, tt2)
948 tree best = NULL_TREE;
951 /* If one is a baseclass of another, that's good enough. */
952 if (UNIQUELY_DERIVED_FROM_P (tt1, tt2))
954 if (UNIQUELY_DERIVED_FROM_P (tt2, tt1))
957 /* Otherwise, try to find a unique baseclass of TT1
958 that is shared by TT2, and follow that down. */
959 for (i = CLASSTYPE_N_BASECLASSES (tt1)-1; i >= 0; i--)
961 tree basetype = TYPE_BINFO_BASETYPE (tt1, i);
962 tree trial = common_base_type (basetype, tt2);
965 if (trial == error_mark_node)
967 if (best == NULL_TREE)
969 else if (best != trial)
970 return error_mark_node;
975 for (i = CLASSTYPE_N_BASECLASSES (tt2)-1; i >= 0; i--)
977 tree basetype = TYPE_BINFO_BASETYPE (tt2, i);
978 tree trial = common_base_type (tt1, basetype);
981 if (trial == error_mark_node)
983 if (best == NULL_TREE)
985 else if (best != trial)
986 return error_mark_node;
992 /* Subroutines of `comptypes'. */
994 /* Return 1 if two parameter type lists PARMS1 and PARMS2
995 are equivalent in the sense that functions with those parameter types
996 can have equivalent types.
997 If either list is empty, we win.
998 Otherwise, the two lists must be equivalent, element by element.
1000 C++: See comment above about TYPE1, TYPE2, STRICT.
1001 If STRICT == 3, it means checking is strict, but do not compare
1002 default parameter values. */
1005 compparms (parms1, parms2, strict)
1006 tree parms1, parms2;
1009 register tree t1 = parms1, t2 = parms2;
1011 /* An unspecified parmlist matches any specified parmlist
1012 whose argument types don't need default promotions. */
1014 if (strict <= 0 && t1 == 0)
1015 return self_promoting_args_p (t2);
1016 if (strict < 0 && t2 == 0)
1017 return self_promoting_args_p (t1);
1021 if (t1 == 0 && t2 == 0)
1023 /* If one parmlist is shorter than the other,
1024 they fail to match, unless STRICT is <= 0. */
1025 if (t1 == 0 || t2 == 0)
1032 return t1 && TREE_PURPOSE (t1);
1034 if (! comptypes (TREE_VALUE (t2), TREE_VALUE (t1), strict))
1039 return t2 == void_list_node && TREE_PURPOSE (t1);
1040 return TREE_PURPOSE (t1) || TREE_PURPOSE (t2);
1043 t1 = TREE_CHAIN (t1);
1044 t2 = TREE_CHAIN (t2);
1048 /* This really wants return whether or not parameter type lists
1049 would make their owning functions assignment compatible or not. */
1052 comp_target_parms (parms1, parms2, strict)
1053 tree parms1, parms2;
1056 register tree t1 = parms1, t2 = parms2;
1057 int warn_contravariance = 0;
1059 /* An unspecified parmlist matches any specified parmlist
1060 whose argument types don't need default promotions.
1061 @@@ see 13.3.3 for a counterexample... */
1063 if (t1 == 0 && t2 != 0)
1065 cp_pedwarn ("ANSI C++ prohibits conversion from `(%#T)' to `(...)'",
1067 return self_promoting_args_p (t2);
1070 return self_promoting_args_p (t1);
1072 for (; t1 || t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1076 /* If one parmlist is shorter than the other,
1077 they fail to match, unless STRICT is <= 0. */
1078 if (t1 == 0 || t2 == 0)
1083 return 1 + warn_contravariance;
1084 return ((t1 && TREE_PURPOSE (t1)) + warn_contravariance);
1086 p1 = TREE_VALUE (t1);
1087 p2 = TREE_VALUE (t2);
1091 if ((TREE_CODE (p1) == POINTER_TYPE && TREE_CODE (p2) == POINTER_TYPE)
1092 || (TREE_CODE (p1) == REFERENCE_TYPE && TREE_CODE (p2) == REFERENCE_TYPE))
1095 && (TYPE_MAIN_VARIANT (TREE_TYPE (p1))
1096 == TYPE_MAIN_VARIANT (TREE_TYPE (p2))))
1099 /* The following is wrong for contravariance,
1100 but many programs depend on it. */
1101 if (TREE_TYPE (p1) == void_type_node)
1103 if (TREE_TYPE (p2) == void_type_node)
1105 warn_contravariance = 1;
1108 if (IS_AGGR_TYPE (TREE_TYPE (p1)))
1110 if (comptypes (p2, p1, 0) == 0)
1112 if (comptypes (p1, p2, 0) != 0)
1113 warn_contravariance = 1;
1120 /* Note backwards order due to contravariance. */
1121 if (comp_target_types (p2, p1, 1) == 0)
1123 if (comp_target_types (p1, p2, 1))
1125 warn_contravariance = 1;
1131 /* Target types are compatible--just make sure that if
1132 we use parameter lists, that they are ok as well. */
1133 if (TREE_CODE (p1) == FUNCTION_TYPE || TREE_CODE (p1) == METHOD_TYPE)
1134 switch (comp_target_parms (TYPE_ARG_TYPES (p1),
1135 TYPE_ARG_TYPES (p2),
1143 warn_contravariance = 1;
1146 if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
1148 int cmp = simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2));
1150 my_friendly_abort (114);
1155 return 1 + warn_contravariance;
1158 /* Return 1 if PARMS specifies a fixed number of parameters
1159 and none of their types is affected by default promotions. */
1162 self_promoting_args_p (parms)
1166 for (t = parms; t; t = TREE_CHAIN (t))
1168 register tree type = TREE_VALUE (t);
1170 if (TREE_CHAIN (t) == 0 && type != void_type_node)
1176 if (TYPE_MAIN_VARIANT (type) == float_type_node)
1179 if (C_PROMOTING_INTEGER_TYPE_P (type))
1185 /* Return an unsigned type the same as TYPE in other respects.
1187 C++: must make these work for type variants as well. */
1190 unsigned_type (type)
1193 tree type1 = TYPE_MAIN_VARIANT (type);
1194 if (type1 == signed_char_type_node || type1 == char_type_node)
1195 return unsigned_char_type_node;
1196 if (type1 == integer_type_node)
1197 return unsigned_type_node;
1198 if (type1 == short_integer_type_node)
1199 return short_unsigned_type_node;
1200 if (type1 == long_integer_type_node)
1201 return long_unsigned_type_node;
1202 if (type1 == long_long_integer_type_node)
1203 return long_long_unsigned_type_node;
1204 if (type1 == intDI_type_node)
1205 return unsigned_intDI_type_node;
1206 if (type1 == intSI_type_node)
1207 return unsigned_intSI_type_node;
1208 if (type1 == intHI_type_node)
1209 return unsigned_intHI_type_node;
1210 if (type1 == intQI_type_node)
1211 return unsigned_intQI_type_node;
1213 return signed_or_unsigned_type (1, type);
1216 /* Return a signed type the same as TYPE in other respects. */
1222 tree type1 = TYPE_MAIN_VARIANT (type);
1223 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1224 return signed_char_type_node;
1225 if (type1 == unsigned_type_node)
1226 return integer_type_node;
1227 if (type1 == short_unsigned_type_node)
1228 return short_integer_type_node;
1229 if (type1 == long_unsigned_type_node)
1230 return long_integer_type_node;
1231 if (type1 == long_long_unsigned_type_node)
1232 return long_long_integer_type_node;
1233 if (type1 == unsigned_intDI_type_node)
1234 return intDI_type_node;
1235 if (type1 == unsigned_intSI_type_node)
1236 return intSI_type_node;
1237 if (type1 == unsigned_intHI_type_node)
1238 return intHI_type_node;
1239 if (type1 == unsigned_intQI_type_node)
1240 return intQI_type_node;
1242 return signed_or_unsigned_type (0, type);
1245 /* Return a type the same as TYPE except unsigned or
1246 signed according to UNSIGNEDP. */
1249 signed_or_unsigned_type (unsignedp, type)
1253 if (! INTEGRAL_TYPE_P (type)
1254 || TREE_UNSIGNED (type) == unsignedp)
1257 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1258 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1259 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1260 return unsignedp ? unsigned_type_node : integer_type_node;
1261 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1262 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1263 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1264 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1265 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1266 return (unsignedp ? long_long_unsigned_type_node
1267 : long_long_integer_type_node);
1271 /* Compute the value of the `sizeof' operator. */
1277 enum tree_code code = TREE_CODE (type);
1280 if (processing_template_decl)
1281 return build_min (SIZEOF_EXPR, sizetype, type);
1283 if (code == FUNCTION_TYPE)
1285 if (pedantic || warn_pointer_arith)
1286 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1287 return size_int (1);
1289 if (code == METHOD_TYPE)
1291 if (pedantic || warn_pointer_arith)
1292 pedwarn ("ANSI C++ forbids taking the sizeof a method type");
1293 return size_int (1);
1295 if (code == VOID_TYPE)
1297 if (pedantic || warn_pointer_arith)
1298 pedwarn ("ANSI C++ forbids taking the sizeof a void type");
1299 return size_int (1);
1301 if (code == ERROR_MARK)
1302 return size_int (1);
1304 /* ARM $5.3.2: ``When applied to a reference, the result is the size of the
1305 referenced object.'' */
1306 if (code == REFERENCE_TYPE)
1307 type = TREE_TYPE (type);
1309 /* We couldn't find anything in the ARM or the draft standard that says,
1310 one way or the other, if doing sizeof on something that doesn't have
1311 an object associated with it is correct or incorrect. For example, if
1312 you declare `struct S { char str[16]; };', and in your program do
1313 a `sizeof (S::str)', should we flag that as an error or should we give
1314 the size of it? Since it seems like a reasonable thing to do, we'll go
1315 with giving the value. */
1316 if (code == OFFSET_TYPE)
1317 type = TREE_TYPE (type);
1319 /* @@ This also produces an error for a signature ref.
1320 In that case we should be able to do better. */
1321 if (IS_SIGNATURE (type))
1323 error ("`sizeof' applied to a signature type");
1324 return size_int (0);
1327 if (TYPE_SIZE (complete_type (type)) == 0)
1329 cp_error ("`sizeof' applied to incomplete type `%T'", type);
1330 return size_int (0);
1333 /* Convert in case a char is more than one unit. */
1334 t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type),
1335 size_int (TYPE_PRECISION (char_type_node)));
1336 /* size_binop does not put the constant in range, so do it now. */
1337 if (TREE_CODE (t) == INTEGER_CST && force_fit_type (t, 0))
1338 TREE_CONSTANT_OVERFLOW (t) = TREE_OVERFLOW (t) = 1;
1346 if (processing_template_decl)
1347 return build_min (SIZEOF_EXPR, sizetype, e);
1349 if (TREE_CODE (e) == COMPONENT_REF
1350 && DECL_BIT_FIELD (TREE_OPERAND (e, 1)))
1351 error ("sizeof applied to a bit-field");
1352 /* ANSI says arrays and functions are converted inside comma.
1353 But we can't really convert them in build_compound_expr
1354 because that would break commas in lvalues.
1355 So do the conversion here if operand was a comma. */
1356 if (TREE_CODE (e) == COMPOUND_EXPR
1357 && (TREE_CODE (TREE_TYPE (e)) == ARRAY_TYPE
1358 || TREE_CODE (TREE_TYPE (e)) == FUNCTION_TYPE))
1359 e = default_conversion (e);
1360 else if (TREE_CODE (e) == TREE_LIST)
1362 tree t = TREE_VALUE (e);
1365 && TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE)
1366 || is_overloaded_fn (t)))
1367 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1369 return c_sizeof (TREE_TYPE (e));
1373 c_sizeof_nowarn (type)
1376 enum tree_code code = TREE_CODE (type);
1379 if (code == FUNCTION_TYPE
1380 || code == METHOD_TYPE
1381 || code == VOID_TYPE
1382 || code == ERROR_MARK)
1383 return size_int (1);
1384 if (code == REFERENCE_TYPE)
1385 type = TREE_TYPE (type);
1387 if (TYPE_SIZE (type) == 0)
1388 return size_int (0);
1390 /* Convert in case a char is more than one unit. */
1391 t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type),
1392 size_int (TYPE_PRECISION (char_type_node)));
1393 force_fit_type (t, 0);
1397 /* Implement the __alignof keyword: Return the minimum required
1398 alignment of TYPE, measured in bytes. */
1404 enum tree_code code = TREE_CODE (type);
1407 if (code == FUNCTION_TYPE || code == METHOD_TYPE)
1408 return size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1410 if (code == VOID_TYPE || code == ERROR_MARK)
1411 return size_int (1);
1413 /* C++: this is really correct! */
1414 if (code == REFERENCE_TYPE)
1415 type = TREE_TYPE (type);
1417 /* @@ This also produces an error for a signature ref.
1418 In that case we should be able to do better. */
1419 if (IS_SIGNATURE (type))
1421 error ("`__alignof' applied to a signature type");
1422 return size_int (1);
1425 t = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
1426 force_fit_type (t, 0);
1430 /* Perform default promotions for C data used in expressions.
1431 Arrays and functions are converted to pointers;
1432 enumeral types or short or char, to int.
1433 In addition, manifest constants symbols are replaced by their values.
1435 C++: this will automatically bash references to their target type. */
1438 decay_conversion (exp)
1441 register tree type = TREE_TYPE (exp);
1442 register enum tree_code code = TREE_CODE (type);
1444 if (code == OFFSET_TYPE)
1446 if (TREE_CODE (exp) == OFFSET_REF)
1447 return decay_conversion (resolve_offset_ref (exp));
1449 type = TREE_TYPE (type);
1450 code = TREE_CODE (type);
1452 if (type == unknown_type_node)
1454 cp_pedwarn ("assuming & on overloaded member function");
1455 return build_unary_op (ADDR_EXPR, exp, 0);
1459 if (code == REFERENCE_TYPE)
1461 exp = convert_from_reference (exp);
1462 type = TREE_TYPE (exp);
1463 code = TREE_CODE (type);
1466 /* Constants can be used directly unless they're not loadable. */
1467 if (TREE_CODE (exp) == CONST_DECL)
1468 exp = DECL_INITIAL (exp);
1469 /* Replace a nonvolatile const static variable with its value. */
1470 else if (TREE_READONLY_DECL_P (exp))
1472 exp = decl_constant_value (exp);
1473 type = TREE_TYPE (exp);
1476 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1477 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1479 if (code == VOID_TYPE)
1481 error ("void value not ignored as it ought to be");
1482 return error_mark_node;
1484 if (code == FUNCTION_TYPE)
1486 return build_unary_op (ADDR_EXPR, exp, 0);
1488 if (code == METHOD_TYPE)
1490 cp_pedwarn ("assuming & on `%E'", exp);
1491 return build_unary_op (ADDR_EXPR, exp, 0);
1493 if (code == ARRAY_TYPE)
1498 int constp, volatilep;
1500 if (TREE_CODE (exp) == INDIRECT_REF)
1502 /* Stripping away the INDIRECT_REF is not the right
1503 thing to do for references... */
1504 tree inner = TREE_OPERAND (exp, 0);
1505 if (TREE_CODE (TREE_TYPE (inner)) == REFERENCE_TYPE)
1507 inner = build1 (CONVERT_EXPR,
1508 build_pointer_type (TREE_TYPE (TREE_TYPE (inner))),
1510 TREE_CONSTANT (inner) = TREE_CONSTANT (TREE_OPERAND (inner, 0));
1512 return convert (build_pointer_type (TREE_TYPE (type)), inner);
1515 if (TREE_CODE (exp) == COMPOUND_EXPR)
1517 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1518 return build (COMPOUND_EXPR, TREE_TYPE (op1),
1519 TREE_OPERAND (exp, 0), op1);
1523 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1525 error ("invalid use of non-lvalue array");
1526 return error_mark_node;
1529 constp = volatilep = 0;
1530 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'r'
1531 || TREE_CODE_CLASS (TREE_CODE (exp)) == 'd')
1533 constp = TREE_READONLY (exp);
1534 volatilep = TREE_THIS_VOLATILE (exp);
1537 restype = TREE_TYPE (type);
1538 if (TYPE_READONLY (type) || TYPE_VOLATILE (type)
1539 || constp || volatilep)
1540 restype = cp_build_type_variant (restype,
1541 TYPE_READONLY (type) || constp,
1542 TYPE_VOLATILE (type) || volatilep);
1543 ptrtype = build_pointer_type (restype);
1545 if (TREE_CODE (exp) == VAR_DECL)
1547 /* ??? This is not really quite correct
1548 in that the type of the operand of ADDR_EXPR
1549 is not the target type of the type of the ADDR_EXPR itself.
1550 Question is, can this lossage be avoided? */
1551 adr = build1 (ADDR_EXPR, ptrtype, exp);
1552 if (mark_addressable (exp) == 0)
1553 return error_mark_node;
1554 TREE_CONSTANT (adr) = staticp (exp);
1555 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1558 /* This way is better for a COMPONENT_REF since it can
1559 simplify the offset for a component. */
1560 adr = build_unary_op (ADDR_EXPR, exp, 1);
1561 return convert (ptrtype, adr);
1568 default_conversion (exp)
1572 enum tree_code code;
1574 exp = decay_conversion (exp);
1576 type = TREE_TYPE (exp);
1577 code = TREE_CODE (type);
1579 if (INTEGRAL_CODE_P (code))
1581 tree t = type_promotes_to (type);
1583 return convert (t, exp);
1589 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1593 inline_conversion (exp)
1596 if (TREE_CODE (exp) == FUNCTION_DECL)
1598 tree type = build_type_variant
1599 (TREE_TYPE (exp), TREE_READONLY (exp), TREE_THIS_VOLATILE (exp));
1600 exp = build1 (ADDR_EXPR, build_pointer_type (type), exp);
1606 build_object_ref (datum, basetype, field)
1607 tree datum, basetype, field;
1610 if (datum == error_mark_node)
1611 return error_mark_node;
1613 dtype = TREE_TYPE (datum);
1614 if (TREE_CODE (dtype) == REFERENCE_TYPE)
1615 dtype = TREE_TYPE (dtype);
1616 if (! IS_AGGR_TYPE_CODE (TREE_CODE (dtype)))
1618 cp_error ("request for member `%T::%D' in expression of non-aggregate type `%T'",
1619 basetype, field, dtype);
1620 return error_mark_node;
1622 else if (IS_SIGNATURE (basetype))
1624 warning ("signature name in scope resolution ignored");
1625 return build_component_ref (datum, field, NULL_TREE, 1);
1627 else if (is_aggr_type (basetype, 1))
1629 tree binfo = binfo_or_else (basetype, dtype);
1631 return build_x_component_ref (build_scoped_ref (datum, basetype),
1634 return error_mark_node;
1637 /* Like `build_component_ref, but uses an already found field.
1638 Must compute access for current_class_ref. Otherwise, ok. */
1641 build_component_ref_1 (datum, field, protect)
1645 return build_component_ref (datum, field, NULL_TREE, protect);
1648 /* Given a COND_EXPR in T, return it in a form that we can, for
1649 example, use as an lvalue. This code used to be in unary_complex_lvalue,
1650 but we needed it to deal with `a = (d == c) ? b : c' expressions, where
1651 we're dealing with aggregates. So, we now call this in unary_complex_lvalue,
1652 and in build_modify_expr. The case (in particular) that led to this was
1653 with CODE == ADDR_EXPR, since it's not an lvalue when we'd get it there. */
1656 rationalize_conditional_expr (code, t)
1657 enum tree_code code;
1661 build_conditional_expr (TREE_OPERAND (t, 0),
1662 build_unary_op (code, TREE_OPERAND (t, 1), 0),
1663 build_unary_op (code, TREE_OPERAND (t, 2), 0));
1666 /* Given the TYPE of an anonymous union field inside T, return the
1667 FIELD_DECL for the field. If not found return NULL_TREE. Because
1668 anonymous unions can nest, we must also search all anonymous unions
1669 that are directly reachable. */
1672 lookup_anon_field (t, type)
1677 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1679 if (TREE_STATIC (field))
1681 if (TREE_CODE (field) != FIELD_DECL)
1684 /* If we find it directly, return the field. */
1685 if (DECL_NAME (field) == NULL_TREE
1686 && type == TREE_TYPE (field))
1691 /* Otherwise, it could be nested, search harder. */
1692 if (DECL_NAME (field) == NULL_TREE
1693 && TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1695 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1703 /* Build a COMPONENT_REF for a given DATUM, and it's member COMPONENT.
1704 COMPONENT can be an IDENTIFIER_NODE that is the name of the member
1705 that we are interested in, or it can be a FIELD_DECL. */
1708 build_component_ref (datum, component, basetype_path, protect)
1709 tree datum, component, basetype_path;
1712 register tree basetype = TREE_TYPE (datum);
1713 register enum tree_code code;
1714 register tree field = NULL;
1717 if (processing_template_decl)
1718 return build_min_nt (COMPONENT_REF, datum, component);
1720 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference
1722 switch (TREE_CODE (datum))
1726 tree value = build_component_ref (TREE_OPERAND (datum, 1), component,
1727 basetype_path, protect);
1728 return build (COMPOUND_EXPR, TREE_TYPE (value),
1729 TREE_OPERAND (datum, 0), value);
1732 return build_conditional_expr
1733 (TREE_OPERAND (datum, 0),
1734 build_component_ref (TREE_OPERAND (datum, 1), component,
1735 basetype_path, protect),
1736 build_component_ref (TREE_OPERAND (datum, 2), component,
1737 basetype_path, protect));
1740 code = TREE_CODE (basetype);
1742 if (code == REFERENCE_TYPE)
1744 datum = convert_from_reference (datum);
1745 basetype = TREE_TYPE (datum);
1746 code = TREE_CODE (basetype);
1748 if (TREE_CODE (datum) == OFFSET_REF)
1750 datum = resolve_offset_ref (datum);
1751 basetype = TREE_TYPE (datum);
1752 code = TREE_CODE (basetype);
1755 /* First, see if there is a field or component with name COMPONENT. */
1756 if (TREE_CODE (component) == TREE_LIST)
1758 my_friendly_assert (!(TREE_CHAIN (component) == NULL_TREE
1759 && DECL_CHAIN (TREE_VALUE (component)) == NULL_TREE), 309);
1760 return build (COMPONENT_REF, TREE_TYPE (component), datum, component);
1763 if (! IS_AGGR_TYPE_CODE (code))
1765 if (code != ERROR_MARK)
1766 cp_error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
1767 component, datum, basetype);
1768 return error_mark_node;
1771 if (TYPE_SIZE (complete_type (basetype)) == 0)
1773 incomplete_type_error (0, basetype);
1774 return error_mark_node;
1777 if (TREE_CODE (component) == BIT_NOT_EXPR)
1779 if (TYPE_IDENTIFIER (basetype) != TREE_OPERAND (component, 0))
1781 cp_error ("destructor specifier `%T::~%T' must have matching names",
1782 basetype, TREE_OPERAND (component, 0));
1783 return error_mark_node;
1785 if (! TYPE_HAS_DESTRUCTOR (basetype))
1787 cp_error ("type `%T' has no destructor", basetype);
1788 return error_mark_node;
1790 return TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype), 1);
1793 /* Look up component name in the structure type definition. */
1794 if (CLASSTYPE_VFIELD (basetype)
1795 && DECL_NAME (CLASSTYPE_VFIELD (basetype)) == component)
1796 /* Special-case this because if we use normal lookups in an ambiguous
1797 hierarchy, the compiler will abort (because vptr lookups are
1798 not supposed to be ambiguous. */
1799 field = CLASSTYPE_VFIELD (basetype);
1800 else if (TREE_CODE (component) == FIELD_DECL
1801 || TREE_CODE (component) == TYPE_DECL)
1807 tree name = component;
1808 if (TREE_CODE (component) == VAR_DECL)
1809 name = DECL_NAME (component);
1810 if (basetype_path == NULL_TREE)
1811 basetype_path = TYPE_BINFO (basetype);
1812 field = lookup_field (basetype_path, name,
1813 protect && !VFIELD_NAME_P (name), 0);
1814 if (field == error_mark_node)
1815 return error_mark_node;
1817 if (field == NULL_TREE)
1819 /* Not found as a data field, look for it as a method. If found,
1820 then if this is the only possible one, return it, else
1821 report ambiguity error. */
1822 tree fndecls = lookup_fnfields (basetype_path, name, 1);
1823 if (fndecls == error_mark_node)
1824 return error_mark_node;
1827 if (TREE_CHAIN (fndecls) == NULL_TREE
1828 && DECL_CHAIN (TREE_VALUE (fndecls)) == NULL_TREE)
1830 tree access, fndecl;
1832 /* Unique, so use this one now. */
1833 basetype = TREE_PURPOSE (fndecls);
1834 fndecl = TREE_VALUE (fndecls);
1835 access = compute_access (TREE_PURPOSE (fndecls), fndecl);
1836 if (access == access_public_node)
1838 if (DECL_VINDEX (fndecl)
1839 && ! resolves_to_fixed_type_p (datum, 0))
1841 tree addr = build_unary_op (ADDR_EXPR, datum, 0);
1842 tree fntype = TREE_TYPE (fndecl);
1844 addr = convert_pointer_to (DECL_CONTEXT (fndecl), addr);
1845 datum = build_indirect_ref (addr, NULL_PTR);
1846 my_friendly_assert (datum != error_mark_node, 310);
1847 fndecl = build_vfn_ref (&addr, datum, DECL_VINDEX (fndecl));
1848 TREE_TYPE (fndecl) = build_pointer_type (fntype);
1851 return build (OFFSET_REF, TREE_TYPE (fndecl), datum, fndecl);
1853 if (access == access_protected_node)
1854 cp_error ("member function `%D' is protected", fndecl);
1856 cp_error ("member function `%D' is private", fndecl);
1857 return error_mark_node;
1861 /* Just act like build_offset_ref, since the object does
1862 not matter unless we're actually calling the function. */
1865 t = build_tree_list (error_mark_node, fndecls);
1866 TREE_TYPE (t) = build_offset_type (basetype,
1872 cp_error ("`%#T' has no member named `%D'", basetype, name);
1873 return error_mark_node;
1875 else if (TREE_TYPE (field) == error_mark_node)
1876 return error_mark_node;
1878 if (TREE_CODE (field) != FIELD_DECL)
1880 if (TREE_CODE (field) == TYPE_DECL)
1882 cp_error ("invalid use of type decl `%#D' as expression", field);
1883 return error_mark_node;
1885 else if (DECL_RTL (field) != 0)
1888 TREE_USED (field) = 1;
1893 /* See if we have to do any conversions so that we pick up the field from the
1895 if (DECL_FIELD_CONTEXT (field) != basetype)
1897 tree context = DECL_FIELD_CONTEXT (field);
1898 tree base = context;
1899 while (base != basetype && TYPE_NAME (base)
1900 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (base)))
1902 base = TYPE_CONTEXT (base);
1905 /* Handle base classes here... */
1906 if (base != basetype && TYPE_USES_COMPLEX_INHERITANCE (basetype))
1908 tree addr = build_unary_op (ADDR_EXPR, datum, 0);
1909 if (integer_zerop (addr))
1911 error ("invalid reference to NULL ptr, use ptr-to-member instead");
1912 return error_mark_node;
1914 if (VBASE_NAME_P (DECL_NAME (field)))
1916 /* It doesn't matter which vbase pointer we grab, just
1917 find one of them. */
1918 tree binfo = get_binfo (base,
1919 TREE_TYPE (TREE_TYPE (addr)), 0);
1920 addr = convert_pointer_to_real (binfo, addr);
1923 addr = convert_pointer_to (base, addr);
1924 datum = build_indirect_ref (addr, NULL_PTR);
1925 my_friendly_assert (datum != error_mark_node, 311);
1929 /* Handle things from anon unions here... */
1930 if (TYPE_NAME (context) && ANON_AGGRNAME_P (TYPE_IDENTIFIER (context)))
1932 tree subfield = lookup_anon_field (basetype, context);
1933 tree subdatum = build_component_ref (datum, subfield,
1934 basetype_path, protect);
1935 return build_component_ref (subdatum, field, basetype_path, protect);
1939 ref = fold (build (COMPONENT_REF, TREE_TYPE (field),
1940 break_out_cleanups (datum), field));
1942 if (TREE_READONLY (datum) || TREE_READONLY (field))
1943 TREE_READONLY (ref) = 1;
1944 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (field))
1945 TREE_THIS_VOLATILE (ref) = 1;
1946 if (DECL_MUTABLE_P (field))
1947 TREE_READONLY (ref) = 0;
1952 /* Variant of build_component_ref for use in expressions, which should
1953 never have REFERENCE_TYPE. */
1956 build_x_component_ref (datum, component, basetype_path, protect)
1957 tree datum, component, basetype_path;
1960 tree t = build_component_ref (datum, component, basetype_path, protect);
1962 if (! processing_template_decl)
1963 t = convert_from_reference (t);
1968 /* Given an expression PTR for a pointer, return an expression
1969 for the value pointed to.
1970 ERRORSTRING is the name of the operator to appear in error messages.
1972 This function may need to overload OPERATOR_FNNAME.
1973 Must also handle REFERENCE_TYPEs for C++. */
1976 build_x_indirect_ref (ptr, errorstring)
1982 if (processing_template_decl)
1983 return build_min_nt (INDIRECT_REF, ptr);
1985 rval = build_opfncall (INDIRECT_REF, LOOKUP_NORMAL, ptr, NULL_TREE, NULL_TREE);
1988 return build_indirect_ref (ptr, errorstring);
1992 build_indirect_ref (ptr, errorstring)
1996 register tree pointer, type;
1998 if (ptr == error_mark_node)
1999 return error_mark_node;
2001 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2002 ? ptr : default_conversion (ptr));
2003 type = TREE_TYPE (pointer);
2005 if (ptr == current_class_ptr)
2006 return current_class_ref;
2008 if (IS_AGGR_TYPE (type))
2010 ptr = build_expr_type_conversion (WANT_POINTER, pointer, 1);
2015 type = TREE_TYPE (pointer);
2019 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
2021 if (TREE_CODE (pointer) == ADDR_EXPR
2022 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (pointer, 0)))
2023 == TYPE_MAIN_VARIANT (TREE_TYPE (type)))
2024 && (TREE_READONLY (TREE_OPERAND (pointer, 0))
2025 == TYPE_READONLY (TREE_TYPE (type)))
2026 && (TREE_THIS_VOLATILE (TREE_OPERAND (pointer, 0))
2027 == TYPE_VOLATILE (TREE_TYPE (type))))
2028 return TREE_OPERAND (pointer, 0);
2031 tree t = TREE_TYPE (type);
2032 register tree ref = build1 (INDIRECT_REF,
2033 TYPE_MAIN_VARIANT (t), pointer);
2035 TREE_READONLY (ref) = TYPE_READONLY (t);
2036 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2037 TREE_SIDE_EFFECTS (ref)
2038 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2042 /* `pointer' won't be an error_mark_node if we were given a
2043 pointer to member, so it's cool to check for this here. */
2044 else if (TYPE_PTRMEMFUNC_P (type))
2045 error ("invalid use of `%s' on pointer to member function", errorstring);
2046 else if (TREE_CODE (type) == RECORD_TYPE
2047 && (IS_SIGNATURE_POINTER (type) || IS_SIGNATURE_REFERENCE (type)))
2048 error ("cannot dereference signature pointer/reference");
2049 else if (pointer != error_mark_node)
2052 error ("invalid type argument of `%s'", errorstring);
2054 error ("invalid type argument");
2056 return error_mark_node;
2059 /* This handles expressions of the form "a[i]", which denotes
2062 This is logically equivalent in C to *(a+i), but we may do it differently.
2063 If A is a variable or a member, we generate a primitive ARRAY_REF.
2064 This avoids forcing the array out of registers, and can work on
2065 arrays that are not lvalues (for example, members of structures returned
2068 If INDEX is of some user-defined type, it must be converted to
2069 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2070 will inherit the type of the array, which will be some pointer type. */
2073 build_array_ref (array, idx)
2078 error ("subscript missing in array reference");
2079 return error_mark_node;
2082 if (TREE_TYPE (array) == error_mark_node
2083 || TREE_TYPE (idx) == error_mark_node)
2084 return error_mark_node;
2086 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE
2087 && TREE_CODE (array) != INDIRECT_REF)
2091 /* Subscripting with type char is likely to lose
2092 on a machine where chars are signed.
2093 So warn on any machine, but optionally.
2094 Don't warn for unsigned char since that type is safe.
2095 Don't warn for signed char because anyone who uses that
2096 must have done so deliberately. */
2097 if (warn_char_subscripts
2098 && TYPE_MAIN_VARIANT (TREE_TYPE (idx)) == char_type_node)
2099 warning ("array subscript has type `char'");
2101 /* Apply default promotions *after* noticing character types. */
2102 idx = default_conversion (idx);
2104 if (TREE_CODE (TREE_TYPE (idx)) != INTEGER_TYPE)
2106 error ("array subscript is not an integer");
2107 return error_mark_node;
2110 /* An array that is indexed by a non-constant
2111 cannot be stored in a register; we must be able to do
2112 address arithmetic on its address.
2113 Likewise an array of elements of variable size. */
2114 if (TREE_CODE (idx) != INTEGER_CST
2115 || (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))) != 0
2116 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2118 if (mark_addressable (array) == 0)
2119 return error_mark_node;
2121 /* An array that is indexed by a constant value which is not within
2122 the array bounds cannot be stored in a register either; because we
2123 would get a crash in store_bit_field/extract_bit_field when trying
2124 to access a non-existent part of the register. */
2125 if (TREE_CODE (idx) == INTEGER_CST
2126 && TYPE_VALUES (TREE_TYPE (array))
2127 && ! int_fits_type_p (idx, TYPE_VALUES (TREE_TYPE (array))))
2129 if (mark_addressable (array) == 0)
2130 return error_mark_node;
2133 if (pedantic && !lvalue_p (array))
2134 pedwarn ("ANSI C++ forbids subscripting non-lvalue array");
2136 /* Note in C++ it is valid to subscript a `register' array, since
2137 it is valid to take the address of something with that
2138 storage specification. */
2142 while (TREE_CODE (foo) == COMPONENT_REF)
2143 foo = TREE_OPERAND (foo, 0);
2144 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2145 warning ("subscripting array declared `register'");
2148 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array)));
2149 rval = build (ARRAY_REF, type, array, idx);
2150 /* Array ref is const/volatile if the array elements are
2151 or if the array is.. */
2152 TREE_READONLY (rval)
2153 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2154 | TREE_READONLY (array));
2155 TREE_SIDE_EFFECTS (rval)
2156 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2157 | TREE_SIDE_EFFECTS (array));
2158 TREE_THIS_VOLATILE (rval)
2159 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2160 /* This was added by rms on 16 Nov 91.
2161 It fixes vol struct foo *a; a->elts[1]
2162 in an inline function.
2163 Hope it doesn't break something else. */
2164 | TREE_THIS_VOLATILE (array));
2165 return require_complete_type (fold (rval));
2169 tree ar = default_conversion (array);
2170 tree ind = default_conversion (idx);
2172 /* Put the integer in IND to simplify error checking. */
2173 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2180 if (ar == error_mark_node)
2183 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2185 error ("subscripted value is neither array nor pointer");
2186 return error_mark_node;
2188 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2190 error ("array subscript is not an integer");
2191 return error_mark_node;
2194 return build_indirect_ref (build_binary_op_nodefault (PLUS_EXPR, ar, ind, PLUS_EXPR),
2199 /* Build a function call to function FUNCTION with parameters PARAMS.
2200 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2201 TREE_VALUE of each node is a parameter-expression. The PARAMS do
2202 not include any object pointer that may be required. FUNCTION's
2203 data type may be a function type or a pointer-to-function.
2205 For C++: If FUNCTION's data type is a TREE_LIST, then the tree list
2206 is the list of possible methods that FUNCTION could conceivably
2207 be. If the list of methods comes from a class, then it will be
2208 a list of lists (where each element is associated with the class
2209 that produced it), otherwise it will be a simple list (for
2210 functions overloaded in global scope).
2212 In the first case, TREE_VALUE (function) is the head of one of those
2213 lists, and TREE_PURPOSE is the name of the function.
2215 In the second case, TREE_PURPOSE (function) is the function's
2218 DECL is the class instance variable, usually CURRENT_CLASS_REF.
2220 When calling a TEMPLATE_DECL, we don't require a complete return
2224 build_x_function_call (function, params, decl)
2225 tree function, params, decl;
2230 if (function == error_mark_node)
2231 return error_mark_node;
2233 if (processing_template_decl)
2234 return build_min_nt (CALL_EXPR, function, params, NULL_TREE);
2236 type = TREE_TYPE (function);
2238 if (TREE_CODE (type) == OFFSET_TYPE
2239 && TREE_TYPE (type) == unknown_type_node
2240 && TREE_CODE (function) == TREE_LIST
2241 && TREE_CHAIN (function) == NULL_TREE)
2243 /* Undo (Foo:bar)()... */
2244 type = TYPE_OFFSET_BASETYPE (type);
2245 function = TREE_VALUE (function);
2246 my_friendly_assert (TREE_CODE (function) == TREE_LIST, 999);
2247 my_friendly_assert (TREE_CHAIN (function) == NULL_TREE, 999);
2248 function = TREE_VALUE (function);
2249 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 999);
2250 function = DECL_NAME (function);
2251 return build_method_call (decl, function, params, TYPE_BINFO (type), LOOKUP_NORMAL);
2254 is_method = ((TREE_CODE (function) == TREE_LIST
2255 && current_class_type != NULL_TREE
2256 && IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (function)) == function)
2257 || TREE_CODE (function) == IDENTIFIER_NODE
2258 || TREE_CODE (type) == METHOD_TYPE
2259 || TYPE_PTRMEMFUNC_P (type));
2261 if (TREE_CODE (function) == FUNCTION_DECL
2262 && DECL_STATIC_FUNCTION_P (function))
2263 return build_member_call
2264 (DECL_CONTEXT (function), DECL_NAME (function), params);
2266 /* Handle methods, friends, and overloaded functions, respectively. */
2269 tree basetype = NULL_TREE;
2271 if (TREE_CODE (function) == FUNCTION_DECL)
2273 basetype = DECL_CLASS_CONTEXT (function);
2275 if (DECL_NAME (function))
2276 function = DECL_NAME (function);
2278 function = TYPE_IDENTIFIER (DECL_CLASS_CONTEXT (function));
2280 else if (TREE_CODE (function) == TREE_LIST)
2282 my_friendly_assert (TREE_CODE (TREE_VALUE (function)) == FUNCTION_DECL, 312);
2283 basetype = DECL_CLASS_CONTEXT (TREE_VALUE (function));
2284 function = TREE_PURPOSE (function);
2286 else if (TREE_CODE (function) != IDENTIFIER_NODE)
2288 if (TREE_CODE (function) == OFFSET_REF)
2290 if (TREE_OPERAND (function, 0))
2291 decl = TREE_OPERAND (function, 0);
2293 /* Call via a pointer to member function. */
2294 if (decl == NULL_TREE)
2296 error ("pointer to member function called, but not in class scope");
2297 return error_mark_node;
2299 /* What other type of POINTER_TYPE could this be? */
2300 if (TREE_CODE (TREE_TYPE (function)) != POINTER_TYPE
2301 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (function))
2302 && TREE_CODE (function) != OFFSET_REF)
2303 function = build (OFFSET_REF, TREE_TYPE (type), NULL_TREE, function);
2307 /* this is an abbreviated method call.
2308 must go through here in case it is a virtual function.
2309 @@ Perhaps this could be optimized. */
2311 if (basetype && (! current_class_type
2312 || ! DERIVED_FROM_P (basetype, current_class_type)))
2313 return build_member_call (basetype, function, params);
2315 if (decl == NULL_TREE)
2317 if (current_class_type == NULL_TREE)
2319 error ("object missing in call to method `%s'",
2320 IDENTIFIER_POINTER (function));
2321 return error_mark_node;
2323 /* Yow: call from a static member function. */
2324 decl = build1 (NOP_EXPR, build_pointer_type (current_class_type),
2326 decl = build_indirect_ref (decl, NULL_PTR);
2329 return build_method_call (decl, function, params,
2330 NULL_TREE, LOOKUP_NORMAL);
2332 else if (TREE_CODE (function) == COMPONENT_REF
2333 && type == unknown_type_node)
2335 /* Should we undo what was done in build_component_ref? */
2336 if (TREE_CODE (TREE_PURPOSE (TREE_OPERAND (function, 1))) == TREE_VEC)
2337 /* Get the name that build_component_ref hid. */
2338 function = DECL_NAME (TREE_VALUE (TREE_OPERAND (function, 1)));
2340 function = TREE_PURPOSE (TREE_OPERAND (function, 1));
2341 return build_method_call (decl, function, params,
2342 NULL_TREE, LOOKUP_NORMAL);
2344 else if (TREE_CODE (function) == TREE_LIST)
2346 if (TREE_VALUE (function) == NULL_TREE)
2348 cp_error ("function `%D' declared overloaded, but no definitions appear with which to resolve it?!?",
2349 TREE_PURPOSE (function));
2350 return error_mark_node;
2354 tree val = TREE_VALUE (function);
2356 if (flag_ansi_overloading)
2357 return build_new_function_call (function, params, NULL_TREE);
2359 if (TREE_CODE (val) == TEMPLATE_DECL)
2360 return build_overload_call_real
2361 (function, params, LOOKUP_COMPLAIN, (struct candidate *)0, 0);
2362 else if (DECL_CHAIN (val) != NULL_TREE)
2363 return build_overload_call
2364 (function, params, LOOKUP_COMPLAIN);
2366 my_friendly_abort (360);
2371 if (TREE_CODE (function) == OFFSET_REF)
2373 /* If the component is a data element (or a virtual function), we play
2374 games here to make things work. */
2377 if (TREE_OPERAND (function, 0))
2378 decl = TREE_OPERAND (function, 0);
2380 decl = current_class_ref;
2382 decl_addr = build_unary_op (ADDR_EXPR, decl, 0);
2383 function = get_member_function_from_ptrfunc (&decl_addr,
2384 TREE_OPERAND (function, 1));
2385 params = tree_cons (NULL_TREE, decl_addr, params);
2386 return build_function_call (function, params);
2389 type = TREE_TYPE (function);
2390 if (type != error_mark_node)
2392 if (TREE_CODE (type) == REFERENCE_TYPE)
2393 type = TREE_TYPE (type);
2395 if (IS_AGGR_TYPE (type))
2396 return build_opfncall (CALL_EXPR, LOOKUP_NORMAL, function, params, NULL_TREE);
2401 tree fntype = TREE_TYPE (function);
2404 /* Explicitly named method? */
2405 if (TREE_CODE (function) == FUNCTION_DECL)
2406 ctypeptr = build_pointer_type (DECL_CLASS_CONTEXT (function));
2407 /* Expression with ptr-to-method type? It could either be a plain
2408 usage, or it might be a case where the ptr-to-method is being
2409 passed in as an argument. */
2410 else if (TYPE_PTRMEMFUNC_P (fntype))
2412 tree rec = TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (fntype)));
2413 ctypeptr = build_pointer_type (rec);
2415 /* Unexpected node type? */
2417 my_friendly_abort (116);
2418 if (decl == NULL_TREE)
2420 if (current_function_decl
2421 && DECL_STATIC_FUNCTION_P (current_function_decl))
2422 error ("invalid call to member function needing `this' in static member function scope");
2424 error ("pointer to member function called, but not in class scope");
2425 return error_mark_node;
2427 if (TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE
2428 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (decl)))
2430 decl = build_unary_op (ADDR_EXPR, decl, 0);
2431 decl = convert_pointer_to (TREE_TYPE (ctypeptr), decl);
2434 decl = build_c_cast (ctypeptr, decl);
2435 params = tree_cons (NULL_TREE, decl, params);
2438 return build_function_call (function, params);
2441 /* Resolve a pointer to member function. INSTANCE is the object
2442 instance to use, if the member points to a virtual member. */
2445 get_member_function_from_ptrfunc (instance_ptrptr, function)
2446 tree *instance_ptrptr;
2449 if (TREE_CODE (function) == OFFSET_REF)
2451 function = TREE_OPERAND (function, 1);
2454 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2456 tree fntype, idx, e1, delta, delta2, e2, e3, aref, vtbl;
2459 tree instance_ptr = *instance_ptrptr;
2461 if (TREE_SIDE_EFFECTS (instance_ptr))
2462 instance_ptr = save_expr (instance_ptr);
2464 if (TREE_SIDE_EFFECTS (function))
2465 function = save_expr (function);
2467 fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2468 idx = save_expr (build_component_ref (function,
2471 e1 = fold (build (GT_EXPR, boolean_type_node, idx,
2472 convert (delta_type_node, integer_zero_node)));
2473 delta = convert (ptrdiff_type_node,
2474 build_component_ref (function, delta_identifier, NULL_TREE, 0));
2475 delta2 = DELTA2_FROM_PTRMEMFUNC (function);
2477 /* convert down to the right base, before using the instance. */
2479 = convert_pointer_to_real (TYPE_METHOD_BASETYPE (TREE_TYPE (fntype)),
2481 if (instance == error_mark_node && instance_ptr != error_mark_node)
2484 vtbl = convert_pointer_to (ptr_type_node, instance);
2487 build_pointer_type (build_pointer_type (vtable_entry_type)),
2488 vtbl, convert (ptrdiff_type_node, delta2));
2489 vtbl = build_indirect_ref (vtbl, NULL_PTR);
2490 aref = build_array_ref (vtbl, build_binary_op (MINUS_EXPR,
2492 integer_one_node, 1));
2493 if (! flag_vtable_thunks)
2495 aref = save_expr (aref);
2497 delta = build_binary_op (PLUS_EXPR,
2498 build_conditional_expr (e1, build_component_ref (aref, delta_identifier, NULL_TREE, 0), integer_zero_node),
2502 *instance_ptrptr = build (PLUS_EXPR, TREE_TYPE (instance_ptr),
2503 instance_ptr, delta);
2504 if (flag_vtable_thunks)
2507 e2 = build_component_ref (aref, pfn_identifier, NULL_TREE, 0);
2509 e3 = PFN_FROM_PTRMEMFUNC (function);
2510 TREE_TYPE (e2) = TREE_TYPE (e3);
2511 e1 = build_conditional_expr (e1, e2, e3);
2513 if (instance_ptr == error_mark_node
2514 && TREE_CODE (e1) != ADDR_EXPR
2515 && TREE_CODE (TREE_OPERAND (e1, 0)) != FUNCTION_DECL)
2516 cp_error ("object missing in `%E'", function);
2520 /* Make sure this doesn't get evaluated first inside one of the
2521 branches of the COND_EXPR. */
2522 if (TREE_CODE (instance_ptr) == SAVE_EXPR)
2523 function = build (COMPOUND_EXPR, TREE_TYPE (function),
2524 instance_ptr, function);
2530 build_function_call_real (function, params, require_complete, flags)
2531 tree function, params;
2532 int require_complete, flags;
2534 register tree fntype, fndecl;
2535 register tree value_type;
2536 register tree coerced_params;
2537 tree name = NULL_TREE, assembler_name = NULL_TREE;
2540 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2541 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2542 if (TREE_CODE (function) == NOP_EXPR
2543 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2544 function = TREE_OPERAND (function, 0);
2546 if (TREE_CODE (function) == FUNCTION_DECL)
2548 name = DECL_NAME (function);
2549 assembler_name = DECL_ASSEMBLER_NAME (function);
2551 GNU_xref_call (current_function_decl,
2552 IDENTIFIER_POINTER (name ? name
2553 : TYPE_IDENTIFIER (DECL_CLASS_CONTEXT (function))));
2554 mark_used (function);
2557 /* Convert anything with function type to a pointer-to-function. */
2560 && IDENTIFIER_LENGTH (name) == 4
2561 && ! strcmp (IDENTIFIER_POINTER (name), "main")
2562 && DECL_CONTEXT (function) == NULL_TREE)
2564 pedwarn ("ANSI C++ forbids calling `main' from within program");
2567 if (pedantic && DECL_THIS_INLINE (function) && ! DECL_INITIAL (function)
2568 && ! DECL_ARTIFICIAL (function)
2569 && ! DECL_PENDING_INLINE_INFO (function))
2570 cp_pedwarn ("inline function `%#D' called before definition",
2573 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2574 (because calling an inline function does not mean the function
2575 needs to be separately compiled). */
2577 if (DECL_INLINE (function))
2578 function = inline_conversion (function);
2580 function = build_addr_func (function);
2586 function = build_addr_func (function);
2589 if (function == error_mark_node)
2590 return error_mark_node;
2592 fntype = TREE_TYPE (function);
2594 if (TYPE_PTRMEMFUNC_P (fntype))
2596 cp_error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
2598 return error_mark_node;
2601 is_method = (TREE_CODE (fntype) == POINTER_TYPE
2602 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
2604 if (!((TREE_CODE (fntype) == POINTER_TYPE
2605 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
2608 cp_error ("`%E' cannot be used as a function", function);
2609 return error_mark_node;
2612 /* fntype now gets the type of function pointed to. */
2613 fntype = TREE_TYPE (fntype);
2615 /* Convert the parameters to the types declared in the
2616 function prototype, or apply default promotions. */
2618 if (flags & LOOKUP_COMPLAIN)
2619 coerced_params = convert_arguments (NULL_TREE, TYPE_ARG_TYPES (fntype),
2620 params, fndecl, LOOKUP_NORMAL);
2622 coerced_params = convert_arguments (NULL_TREE, TYPE_ARG_TYPES (fntype),
2625 if (coerced_params == error_mark_node)
2626 if (flags & LOOKUP_SPECULATIVELY)
2629 return error_mark_node;
2631 /* Check for errors in format strings. */
2633 if (warn_format && (name || assembler_name))
2634 check_function_format (name, assembler_name, coerced_params);
2636 /* Recognize certain built-in functions so we can make tree-codes
2637 other than CALL_EXPR. We do this when it enables fold-const.c
2638 to do something useful. */
2640 if (TREE_CODE (function) == ADDR_EXPR
2641 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL
2642 && DECL_BUILT_IN (TREE_OPERAND (function, 0)))
2643 switch (DECL_FUNCTION_CODE (TREE_OPERAND (function, 0)))
2648 if (coerced_params == 0)
2649 return integer_zero_node;
2650 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
2654 value_type = TREE_TYPE (fntype) ? TREE_TYPE (fntype) : void_type_node;
2656 register tree result
2657 = build_call (function, value_type, coerced_params);
2659 if (require_complete)
2661 if (value_type == void_type_node)
2663 result = require_complete_type (result);
2665 if (IS_AGGR_TYPE (value_type))
2666 result = build_cplus_new (value_type, result);
2667 return convert_from_reference (result);
2672 build_function_call (function, params)
2673 tree function, params;
2675 return build_function_call_real (function, params, 1, LOOKUP_NORMAL);
2678 /* Convert the actual parameter expressions in the list VALUES
2679 to the types in the list TYPELIST.
2680 If parmdecls is exhausted, or when an element has NULL as its type,
2681 perform the default conversions.
2683 RETURN_LOC is the location of the return value, if known, NULL_TREE
2684 otherwise. This is useful in the case where we can avoid creating
2685 a temporary variable in the case where we can initialize the return
2686 value directly. If we are not eliding constructors, then we set this
2687 to NULL_TREE to avoid this avoidance.
2689 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2691 This is also where warnings about wrong number of args are generated.
2693 Return a list of expressions for the parameters as converted.
2695 Both VALUES and the returned value are chains of TREE_LIST nodes
2696 with the elements of the list in the TREE_VALUE slots of those nodes.
2698 In C++, unspecified trailing parameters can be filled in with their
2699 default arguments, if such were specified. Do so here. */
2702 convert_arguments (return_loc, typelist, values, fndecl, flags)
2703 tree return_loc, typelist, values, fndecl;
2706 register tree typetail, valtail;
2707 register tree result = NULL_TREE;
2711 if (! flag_elide_constructors)
2714 /* Argument passing is always copy-initialization. */
2715 flags |= LOOKUP_ONLYCONVERTING;
2719 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
2721 if (DECL_NAME (fndecl) == NULL_TREE
2722 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
2723 called_thing = "constructor";
2725 called_thing = "member function";
2728 called_thing = "function";
2731 for (valtail = values, typetail = typelist;
2733 valtail = TREE_CHAIN (valtail), i++)
2735 register tree type = typetail ? TREE_VALUE (typetail) : 0;
2736 register tree val = TREE_VALUE (valtail);
2738 if (val == error_mark_node)
2739 return error_mark_node;
2741 if (type == void_type_node)
2745 cp_error_at ("too many arguments to %s `%+D'", called_thing,
2747 error ("at this point in file");
2750 error ("too many arguments to function");
2751 /* In case anybody wants to know if this argument
2754 TREE_TYPE (tree_last (result)) = error_mark_node;
2758 /* The tree type of the parameter being passed may not yet be
2759 known. In this case, its type is TYPE_UNKNOWN, and will
2760 be instantiated by the type given by TYPE. If TYPE
2761 is also NULL, the tree type of VAL is ERROR_MARK_NODE. */
2762 if (type && type_unknown_p (val))
2763 val = require_instantiated_type (type, val, integer_zero_node);
2764 else if (type_unknown_p (val))
2766 /* Strip the `&' from an overloaded FUNCTION_DECL. */
2767 if (TREE_CODE (val) == ADDR_EXPR)
2768 val = TREE_OPERAND (val, 0);
2769 if (TREE_CODE (val) == TREE_LIST
2770 && TREE_CHAIN (val) == NULL_TREE
2771 && TREE_TYPE (TREE_VALUE (val)) != NULL_TREE
2772 && (TREE_TYPE (val) == unknown_type_node
2773 || DECL_CHAIN (TREE_VALUE (val)) == NULL_TREE))
2774 /* Instantiates automatically. */
2775 val = TREE_VALUE (val);
2778 error ("insufficient type information in parameter list");
2779 val = integer_zero_node;
2782 else if (TREE_CODE (val) == OFFSET_REF
2783 && TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
2785 /* This is unclean. Should be handled elsewhere. */
2786 val = build_unary_op (ADDR_EXPR, val, 0);
2788 else if (TREE_CODE (val) == OFFSET_REF)
2789 val = resolve_offset_ref (val);
2791 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2792 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2793 if (TREE_CODE (val) == NOP_EXPR
2794 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
2795 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
2796 val = TREE_OPERAND (val, 0);
2798 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
2800 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
2801 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
2802 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
2803 val = default_conversion (val);
2805 val = require_complete_type (val);
2808 if (val == error_mark_node)
2809 return error_mark_node;
2813 /* Formal parm type is specified by a function prototype. */
2816 if (TYPE_SIZE (complete_type (type)) == 0)
2818 error ("parameter type of called function is incomplete");
2823 parmval = convert_for_initialization
2824 (return_loc, type, val, flags,
2825 "argument passing", fndecl, i);
2826 #ifdef PROMOTE_PROTOTYPES
2827 if ((TREE_CODE (type) == INTEGER_TYPE
2828 || TREE_CODE (type) == ENUMERAL_TYPE)
2829 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2830 parmval = default_conversion (parmval);
2834 if (parmval == error_mark_node)
2835 return error_mark_node;
2837 result = tree_cons (NULL_TREE, parmval, result);
2841 if (TREE_CODE (TREE_TYPE (val)) == REFERENCE_TYPE)
2842 val = convert_from_reference (val);
2844 if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2845 && (TYPE_PRECISION (TREE_TYPE (val))
2846 < TYPE_PRECISION (double_type_node)))
2847 /* Convert `float' to `double'. */
2848 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2849 else if (TYPE_LANG_SPECIFIC (TREE_TYPE (val))
2850 && ! TYPE_HAS_TRIVIAL_INIT_REF (TREE_TYPE (val)))
2852 cp_warning ("cannot pass objects of type `%T' through `...'",
2854 result = tree_cons (NULL_TREE, val, result);
2857 /* Convert `short' and `char' to full-size `int'. */
2858 result = tree_cons (NULL_TREE, default_conversion (val), result);
2862 typetail = TREE_CHAIN (typetail);
2865 if (typetail != 0 && typetail != void_list_node)
2867 /* See if there are default arguments that can be used */
2868 if (TREE_PURPOSE (typetail))
2870 for (; typetail != void_list_node; ++i)
2872 tree type = TREE_VALUE (typetail);
2873 tree val = break_out_target_exprs (TREE_PURPOSE (typetail));
2876 if (val == NULL_TREE)
2877 parmval = error_mark_node;
2878 else if (TREE_CODE (val) == CONSTRUCTOR)
2880 parmval = digest_init (type, val, (tree *)0);
2881 parmval = convert_for_initialization (return_loc, type, parmval, flags,
2882 "default constructor", fndecl, i);
2886 /* This could get clobbered by the following call. */
2887 if (TREE_HAS_CONSTRUCTOR (val))
2888 val = copy_node (val);
2890 parmval = convert_for_initialization (return_loc, type, val, flags,
2891 "default argument", fndecl, i);
2892 #ifdef PROMOTE_PROTOTYPES
2893 if ((TREE_CODE (type) == INTEGER_TYPE
2894 || TREE_CODE (type) == ENUMERAL_TYPE)
2895 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2896 parmval = default_conversion (parmval);
2900 if (parmval == error_mark_node)
2901 return error_mark_node;
2903 result = tree_cons (0, parmval, result);
2904 typetail = TREE_CHAIN (typetail);
2905 /* ends with `...'. */
2906 if (typetail == NULL_TREE)
2914 char *buf = (char *)alloca (32 + strlen (called_thing));
2915 sprintf (buf, "too few arguments to %s `%%#D'", called_thing);
2916 cp_error_at (buf, fndecl);
2917 error ("at this point in file");
2920 error ("too few arguments to function");
2921 return error_mark_list;
2925 return nreverse (result);
2928 /* Build a binary-operation expression, after performing default
2929 conversions on the operands. CODE is the kind of expression to build. */
2932 build_x_binary_op (code, arg1, arg2)
2933 enum tree_code code;
2938 if (processing_template_decl)
2939 return build_min_nt (code, arg1, arg2);
2941 if (flag_ansi_overloading)
2942 return build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE);
2944 rval = build_opfncall (code, LOOKUP_SPECULATIVELY,
2945 arg1, arg2, NULL_TREE);
2947 return build_opfncall (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE);
2948 if (code == MEMBER_REF)
2949 return build_m_component_ref (build_indirect_ref (arg1, NULL_PTR),
2951 return build_binary_op (code, arg1, arg2, 1);
2955 build_binary_op (code, arg1, arg2, convert_p)
2956 enum tree_code code;
2968 args[0] = decay_conversion (args[0]);
2969 args[1] = decay_conversion (args[1]);
2971 if (args[0] == error_mark_node || args[1] == error_mark_node)
2972 return error_mark_node;
2974 type0 = TREE_TYPE (args[0]);
2975 type1 = TREE_TYPE (args[1]);
2977 if (type_unknown_p (args[0]))
2979 args[0] = instantiate_type (type1, args[0], 1);
2980 args[0] = decay_conversion (args[0]);
2982 else if (type_unknown_p (args[1]))
2984 args[1] = require_instantiated_type (type0, args[1],
2986 args[1] = decay_conversion (args[1]);
2989 if (IS_AGGR_TYPE (type0) || IS_AGGR_TYPE (type1))
2991 /* Try to convert this to something reasonable. */
2992 if (! build_default_binary_type_conversion(code, &args[0], &args[1]))
2994 cp_error ("no match for `%O(%#T, %#T)'", code,
2995 TREE_TYPE (arg1), TREE_TYPE (arg2));
2996 return error_mark_node;
3000 return build_binary_op_nodefault (code, args[0], args[1], code);
3003 /* Build a binary-operation expression without default conversions.
3004 CODE is the kind of expression to build.
3005 This function differs from `build' in several ways:
3006 the data type of the result is computed and recorded in it,
3007 warnings are generated if arg data types are invalid,
3008 special handling for addition and subtraction of pointers is known,
3009 and some optimization is done (operations on narrow ints
3010 are done in the narrower type when that gives the same result).
3011 Constant folding is also done before the result is returned.
3013 ERROR_CODE is the code that determines what to say in error messages.
3014 It is usually, but not always, the same as CODE.
3016 Note that the operands will never have enumeral types
3017 because either they have just had the default conversions performed
3018 or they have both just been converted to some other type in which
3019 the arithmetic is to be done.
3021 C++: must do special pointer arithmetic when implementing
3022 multiple inheritance, and deal with pointer to member functions. */
3025 build_binary_op_nodefault (code, orig_op0, orig_op1, error_code)
3026 enum tree_code code;
3027 tree orig_op0, orig_op1;
3028 enum tree_code error_code;
3031 register enum tree_code code0, code1;
3034 /* Expression code to give to the expression when it is built.
3035 Normally this is CODE, which is what the caller asked for,
3036 but in some special cases we change it. */
3037 register enum tree_code resultcode = code;
3039 /* Data type in which the computation is to be performed.
3040 In the simplest cases this is the common type of the arguments. */
3041 register tree result_type = NULL;
3043 /* Nonzero means operands have already been type-converted
3044 in whatever way is necessary.
3045 Zero means they need to be converted to RESULT_TYPE. */
3048 /* Nonzero means create the expression with this type, rather than
3050 tree build_type = 0;
3052 /* Nonzero means after finally constructing the expression
3053 convert it to this type. */
3054 tree final_type = 0;
3056 /* Nonzero if this is an operation like MIN or MAX which can
3057 safely be computed in short if both args are promoted shorts.
3058 Also implies COMMON.
3059 -1 indicates a bitwise operation; this makes a difference
3060 in the exact conditions for when it is safe to do the operation
3061 in a narrower mode. */
3064 /* Nonzero if this is a comparison operation;
3065 if both args are promoted shorts, compare the original shorts.
3066 Also implies COMMON. */
3067 int short_compare = 0;
3069 /* Nonzero if this is a right-shift operation, which can be computed on the
3070 original short and then promoted if the operand is a promoted short. */
3071 int short_shift = 0;
3073 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3076 /* Apply default conversions. */
3077 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3078 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3079 || code == TRUTH_XOR_EXPR)
3081 op0 = decay_conversion (orig_op0);
3082 op1 = decay_conversion (orig_op1);
3086 op0 = default_conversion (orig_op0);
3087 op1 = default_conversion (orig_op1);
3090 type0 = TREE_TYPE (op0);
3091 type1 = TREE_TYPE (op1);
3093 /* The expression codes of the data types of the arguments tell us
3094 whether the arguments are integers, floating, pointers, etc. */
3095 code0 = TREE_CODE (type0);
3096 code1 = TREE_CODE (type1);
3098 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3099 STRIP_TYPE_NOPS (op0);
3100 STRIP_TYPE_NOPS (op1);
3102 /* If an error was already reported for one of the arguments,
3103 avoid reporting another error. */
3105 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3106 return error_mark_node;
3111 /* Handle the pointer + int case. */
3112 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3113 return pointer_int_sum (PLUS_EXPR, op0, op1);
3114 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
3115 return pointer_int_sum (PLUS_EXPR, op1, op0);
3121 /* Subtraction of two similar pointers.
3122 We must subtract them as integers, then divide by object size. */
3123 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3124 && comp_target_types (type0, type1, 1))
3125 return pointer_diff (op0, op1);
3126 /* Handle pointer minus int. Just like pointer plus int. */
3127 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3128 return pointer_int_sum (MINUS_EXPR, op0, op1);
3137 case TRUNC_DIV_EXPR:
3139 case FLOOR_DIV_EXPR:
3140 case ROUND_DIV_EXPR:
3141 case EXACT_DIV_EXPR:
3142 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3143 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3145 if (TREE_CODE (op1) == INTEGER_CST && integer_zerop (op1))
3146 cp_warning ("division by zero in `%E / 0'", op0);
3147 else if (TREE_CODE (op1) == REAL_CST && real_zerop (op1))
3148 cp_warning ("division by zero in `%E / 0.'", op0);
3150 if (!(code0 == INTEGER_TYPE && code1 == INTEGER_TYPE))
3151 resultcode = RDIV_EXPR;
3153 /* When dividing two signed integers, we have to promote to int.
3154 unless we divide by a constant != -1. Note that default
3155 conversion will have been performed on the operands at this
3156 point, so we have to dig out the original type to find out if
3158 shorten = ((TREE_CODE (op0) == NOP_EXPR
3159 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3160 || (TREE_CODE (op1) == INTEGER_CST
3161 && (TREE_INT_CST_LOW (op1) != -1
3162 || TREE_INT_CST_HIGH (op1) != -1)));
3168 case BIT_ANDTC_EXPR:
3171 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3173 /* If one operand is a constant, and the other is a short type
3174 that has been converted to an int,
3175 really do the work in the short type and then convert the
3176 result to int. If we are lucky, the constant will be 0 or 1
3177 in the short type, making the entire operation go away. */
3178 if (TREE_CODE (op0) == INTEGER_CST
3179 && TREE_CODE (op1) == NOP_EXPR
3180 && TYPE_PRECISION (type1) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))
3181 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1, 0))))
3183 final_type = result_type;
3184 op1 = TREE_OPERAND (op1, 0);
3185 result_type = TREE_TYPE (op1);
3187 if (TREE_CODE (op1) == INTEGER_CST
3188 && TREE_CODE (op0) == NOP_EXPR
3189 && TYPE_PRECISION (type0) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))
3190 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3192 final_type = result_type;
3193 op0 = TREE_OPERAND (op0, 0);
3194 result_type = TREE_TYPE (op0);
3198 case TRUNC_MOD_EXPR:
3199 case FLOOR_MOD_EXPR:
3200 if (code1 == INTEGER_TYPE && integer_zerop (op1))
3201 cp_warning ("division by zero in `%E % 0'", op0);
3202 else if (code1 == REAL_TYPE && real_zerop (op1))
3203 cp_warning ("division by zero in `%E % 0.'", op0);
3205 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3207 /* Although it would be tempting to shorten always here, that loses
3208 on some targets, since the modulo instruction is undefined if the
3209 quotient can't be represented in the computation mode. We shorten
3210 only if unsigned or if dividing by something we know != -1. */
3211 shorten = ((TREE_CODE (op0) == NOP_EXPR
3212 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3213 || (TREE_CODE (op1) == INTEGER_CST
3214 && (TREE_INT_CST_LOW (op1) != -1
3215 || TREE_INT_CST_HIGH (op1) != -1)));
3220 case TRUTH_ANDIF_EXPR:
3221 case TRUTH_ORIF_EXPR:
3222 case TRUTH_AND_EXPR:
3224 result_type = boolean_type_node;
3227 /* Shift operations: result has same type as first operand;
3228 always convert second operand to int.
3229 Also set SHORT_SHIFT if shifting rightward. */
3232 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3234 result_type = type0;
3235 if (TREE_CODE (op1) == INTEGER_CST)
3237 if (tree_int_cst_lt (op1, integer_zero_node))
3238 warning ("right shift count is negative");
3241 if (TREE_INT_CST_LOW (op1) | TREE_INT_CST_HIGH (op1))
3243 if (TREE_INT_CST_HIGH (op1) != 0
3244 || ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (op1)
3245 >= TYPE_PRECISION (type0)))
3246 warning ("right shift count >= width of type");
3249 /* Convert the shift-count to an integer, regardless of
3250 size of value being shifted. */
3251 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3252 op1 = convert (integer_type_node, op1);
3253 /* Avoid converting op1 to result_type later. */
3259 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3261 result_type = type0;
3262 if (TREE_CODE (op1) == INTEGER_CST)
3264 if (tree_int_cst_lt (op1, integer_zero_node))
3265 warning ("left shift count is negative");
3266 else if (TREE_INT_CST_HIGH (op1) != 0
3267 || ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (op1)
3268 >= TYPE_PRECISION (type0)))
3269 warning ("left shift count >= width of type");
3271 /* Convert the shift-count to an integer, regardless of
3272 size of value being shifted. */
3273 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3274 op1 = convert (integer_type_node, op1);
3275 /* Avoid converting op1 to result_type later. */
3282 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3284 result_type = type0;
3285 if (TREE_CODE (op1) == INTEGER_CST)
3287 if (tree_int_cst_lt (op1, integer_zero_node))
3288 warning ("%s rotate count is negative",
3289 (code == LROTATE_EXPR) ? "left" : "right");
3290 else if (TREE_INT_CST_HIGH (op1) != 0
3291 || ((unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (op1)
3292 >= TYPE_PRECISION (type0)))
3293 warning ("%s rotate count >= width of type",
3294 (code == LROTATE_EXPR) ? "left" : "right");
3296 /* Convert the shift-count to an integer, regardless of
3297 size of value being shifted. */
3298 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3299 op1 = convert (integer_type_node, op1);
3305 build_type = boolean_type_node;
3306 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3307 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3309 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3311 register tree tt0 = TYPE_MAIN_VARIANT (TREE_TYPE (type0));
3312 register tree tt1 = TYPE_MAIN_VARIANT (TREE_TYPE (type1));
3314 if (comp_target_types (type0, type1, 1))
3315 result_type = common_type (type0, type1);
3316 else if (tt0 == void_type_node)
3318 if (pedantic && TREE_CODE (tt1) == FUNCTION_TYPE
3319 && tree_int_cst_lt (TYPE_SIZE (type0), TYPE_SIZE (type1)))
3320 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3321 else if (TREE_CODE (tt1) == OFFSET_TYPE)
3322 pedwarn ("ANSI C++ forbids conversion of a pointer to member to `void *'");
3324 else if (tt1 == void_type_node)
3326 if (pedantic && TREE_CODE (tt0) == FUNCTION_TYPE
3327 && tree_int_cst_lt (TYPE_SIZE (type1), TYPE_SIZE (type0)))
3328 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3331 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3334 if (result_type == NULL_TREE)
3335 result_type = ptr_type_node;
3337 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3338 && integer_zerop (op1))
3339 result_type = type0;
3340 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3341 && integer_zerop (op0))
3342 result_type = type1;
3343 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3345 result_type = type0;
3346 error ("ANSI C++ forbids comparison between pointer and integer");
3348 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3350 result_type = type1;
3351 error ("ANSI C++ forbids comparison between pointer and integer");
3353 else if (TYPE_PTRMEMFUNC_P (type0) && TREE_CODE (op1) == INTEGER_CST
3354 && integer_zerop (op1))
3356 op0 = build_component_ref (op0, index_identifier, NULL_TREE, 0);
3357 op1 = integer_zero_node;
3358 result_type = TREE_TYPE (op0);
3360 else if (TYPE_PTRMEMFUNC_P (type1) && TREE_CODE (op0) == INTEGER_CST
3361 && integer_zerop (op0))
3363 op0 = build_component_ref (op1, index_identifier, NULL_TREE, 0);
3364 op1 = integer_zero_node;
3365 result_type = TREE_TYPE (op0);
3367 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1)
3368 && (TYPE_PTRMEMFUNC_FN_TYPE (type0)
3369 == TYPE_PTRMEMFUNC_FN_TYPE (type1)))
3371 /* The code we generate for the test is:
3373 (op0.index == op1.index
3374 && ((op1.index != -1 && op0.delta2 == op1.delta2)
3375 || op0.pfn == op1.pfn)) */
3377 tree index0 = build_component_ref (op0, index_identifier, NULL_TREE, 0);
3378 tree index1 = save_expr (build_component_ref (op1, index_identifier, NULL_TREE, 0));
3379 tree pfn0 = PFN_FROM_PTRMEMFUNC (op0);
3380 tree pfn1 = PFN_FROM_PTRMEMFUNC (op1);
3381 tree delta20 = DELTA2_FROM_PTRMEMFUNC (op0);
3382 tree delta21 = DELTA2_FROM_PTRMEMFUNC (op1);
3384 tree integer_neg_one_node
3385 = build_binary_op (MINUS_EXPR, integer_zero_node, integer_one_node, 1);
3386 e1 = build_binary_op (EQ_EXPR, index0, index1, 1);
3387 e2 = build_binary_op (NE_EXPR, index1, integer_neg_one_node, 1);
3388 e2 = build_binary_op (TRUTH_ANDIF_EXPR, e2, build_binary_op (EQ_EXPR, delta20, delta21, 1), 1);
3389 e3 = build_binary_op (EQ_EXPR, pfn0, pfn1, 1);
3390 e2 = build_binary_op (TRUTH_ORIF_EXPR, e2, e3, 1);
3391 e2 = build_binary_op (TRUTH_ANDIF_EXPR, e1, e2, 1);
3392 if (code == EQ_EXPR)
3394 return build_binary_op (EQ_EXPR, e2, integer_zero_node, 1);
3396 else if (TYPE_PTRMEMFUNC_P (type0)
3397 && TYPE_PTRMEMFUNC_FN_TYPE (type0) == type1)
3399 tree index0 = build_component_ref (op0, index_identifier, NULL_TREE, 0);
3401 tree pfn0 = PFN_FROM_PTRMEMFUNC (op0);
3402 tree delta20 = DELTA2_FROM_PTRMEMFUNC (op0);
3403 tree delta21 = integer_zero_node;
3405 tree integer_neg_one_node
3406 = build_binary_op (MINUS_EXPR, integer_zero_node, integer_one_node, 1);
3407 if (TREE_CODE (TREE_OPERAND (op1, 0)) == FUNCTION_DECL
3408 && DECL_VINDEX (TREE_OPERAND (op1, 0)))
3410 /* Map everything down one to make room for the null pointer to member. */
3411 index1 = size_binop (PLUS_EXPR,
3412 DECL_VINDEX (TREE_OPERAND (op1, 0)),
3414 op1 = integer_zero_node;
3415 delta21 = CLASSTYPE_VFIELD (TYPE_METHOD_BASETYPE (TREE_TYPE (type1)));
3416 delta21 = DECL_FIELD_BITPOS (delta21);
3417 delta21 = size_binop (FLOOR_DIV_EXPR, delta21, size_int (BITS_PER_UNIT));
3420 index1 = integer_neg_one_node;
3422 tree nop1 = build1 (NOP_EXPR, TYPE_PTRMEMFUNC_FN_TYPE (type0), op1);
3423 TREE_CONSTANT (nop1) = TREE_CONSTANT (op1);
3426 e1 = build_binary_op (EQ_EXPR, index0, index1, 1);
3427 e2 = build_binary_op (NE_EXPR, index1, integer_neg_one_node, 1);
3428 e2 = build_binary_op (TRUTH_ANDIF_EXPR, e2, build_binary_op (EQ_EXPR, delta20, delta21, 1), 1);
3429 e3 = build_binary_op (EQ_EXPR, pfn0, op1, 1);
3430 e2 = build_binary_op (TRUTH_ORIF_EXPR, e2, e3, 1);
3431 e2 = build_binary_op (TRUTH_ANDIF_EXPR, e1, e2, 1);
3432 if (code == EQ_EXPR)
3434 return build_binary_op (EQ_EXPR, e2, integer_zero_node, 1);
3436 else if (TYPE_PTRMEMFUNC_P (type1)
3437 && TYPE_PTRMEMFUNC_FN_TYPE (type1) == type0)
3439 return build_binary_op (code, op1, op0, 1);
3445 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3446 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3448 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3450 if (comp_target_types (type0, type1, 1))
3451 result_type = common_type (type0, type1);
3454 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3456 result_type = ptr_type_node;
3465 build_type = boolean_type_node;
3466 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3467 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3469 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3471 if (comp_target_types (type0, type1, 1))
3472 result_type = common_type (type0, type1);
3475 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3477 result_type = ptr_type_node;
3480 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3481 && integer_zerop (op1))
3482 result_type = type0;
3483 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3484 && integer_zerop (op0))
3485 result_type = type1;
3486 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3488 result_type = type0;
3489 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3491 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3493 result_type = type1;
3494 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3499 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3500 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3502 if (shorten || common || short_compare)
3503 result_type = common_type (type0, type1);
3505 /* For certain operations (which identify themselves by shorten != 0)
3506 if both args were extended from the same smaller type,
3507 do the arithmetic in that type and then extend.
3509 shorten !=0 and !=1 indicates a bitwise operation.
3510 For them, this optimization is safe only if
3511 both args are zero-extended or both are sign-extended.
3512 Otherwise, we might change the result.
3513 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3514 but calculated in (unsigned short) it would be (unsigned short)-1. */
3518 int unsigned0, unsigned1;
3519 tree arg0 = get_narrower (op0, &unsigned0);
3520 tree arg1 = get_narrower (op1, &unsigned1);
3521 /* UNS is 1 if the operation to be done is an unsigned one. */
3522 int uns = TREE_UNSIGNED (result_type);
3525 final_type = result_type;
3527 /* Handle the case that OP0 does not *contain* a conversion
3528 but it *requires* conversion to FINAL_TYPE. */
3530 if (op0 == arg0 && TREE_TYPE (op0) != final_type)
3531 unsigned0 = TREE_UNSIGNED (TREE_TYPE (op0));
3532 if (op1 == arg1 && TREE_TYPE (op1) != final_type)
3533 unsigned1 = TREE_UNSIGNED (TREE_TYPE (op1));
3535 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3537 /* For bitwise operations, signedness of nominal type
3538 does not matter. Consider only how operands were extended. */
3542 /* Note that in all three cases below we refrain from optimizing
3543 an unsigned operation on sign-extended args.
3544 That would not be valid. */
3546 /* Both args variable: if both extended in same way
3547 from same width, do it in that width.
3548 Do it unsigned if args were zero-extended. */
3549 if ((TYPE_PRECISION (TREE_TYPE (arg0))
3550 < TYPE_PRECISION (result_type))
3551 && (TYPE_PRECISION (TREE_TYPE (arg1))
3552 == TYPE_PRECISION (TREE_TYPE (arg0)))
3553 && unsigned0 == unsigned1
3554 && (unsigned0 || !uns))
3556 = signed_or_unsigned_type (unsigned0,
3557 common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
3558 else if (TREE_CODE (arg0) == INTEGER_CST
3559 && (unsigned1 || !uns)
3560 && (TYPE_PRECISION (TREE_TYPE (arg1))
3561 < TYPE_PRECISION (result_type))
3562 && (type = signed_or_unsigned_type (unsigned1,
3564 int_fits_type_p (arg0, type)))
3566 else if (TREE_CODE (arg1) == INTEGER_CST
3567 && (unsigned0 || !uns)
3568 && (TYPE_PRECISION (TREE_TYPE (arg0))
3569 < TYPE_PRECISION (result_type))
3570 && (type = signed_or_unsigned_type (unsigned0,
3572 int_fits_type_p (arg1, type)))
3576 /* Shifts can be shortened if shifting right. */
3581 tree arg0 = get_narrower (op0, &unsigned_arg);
3583 final_type = result_type;
3585 if (arg0 == op0 && final_type == TREE_TYPE (op0))
3586 unsigned_arg = TREE_UNSIGNED (TREE_TYPE (op0));
3588 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
3589 /* We can shorten only if the shift count is less than the
3590 number of bits in the smaller type size. */
3591 && TREE_INT_CST_HIGH (op1) == 0
3592 && TYPE_PRECISION (TREE_TYPE (arg0)) > TREE_INT_CST_LOW (op1)
3593 /* If arg is sign-extended and then unsigned-shifted,
3594 we can simulate this with a signed shift in arg's type
3595 only if the extended result is at least twice as wide
3596 as the arg. Otherwise, the shift could use up all the
3597 ones made by sign-extension and bring in zeros.
3598 We can't optimize that case at all, but in most machines
3599 it never happens because available widths are 2**N. */
3600 && (!TREE_UNSIGNED (final_type)
3602 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0)))
3603 <= TYPE_PRECISION (result_type))))
3605 /* Do an unsigned shift if the operand was zero-extended. */
3607 = signed_or_unsigned_type (unsigned_arg,
3609 /* Convert value-to-be-shifted to that type. */
3610 if (TREE_TYPE (op0) != result_type)
3611 op0 = convert (result_type, op0);
3616 /* Comparison operations are shortened too but differently.
3617 They identify themselves by setting short_compare = 1. */
3621 /* Don't write &op0, etc., because that would prevent op0
3622 from being kept in a register.
3623 Instead, make copies of the our local variables and
3624 pass the copies by reference, then copy them back afterward. */
3625 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3626 enum tree_code xresultcode = resultcode;
3628 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3630 return convert (boolean_type_node, val);
3631 op0 = xop0, op1 = xop1;
3633 resultcode = xresultcode;
3636 if (short_compare && warn_sign_compare)
3638 int op0_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op0));
3639 int op1_signed = ! TREE_UNSIGNED (TREE_TYPE (orig_op1));
3641 int unsignedp0, unsignedp1;
3642 tree primop0 = get_narrower (op0, &unsignedp0);
3643 tree primop1 = get_narrower (op1, &unsignedp1);
3645 /* Check for comparison of different enum types. */
3646 if (flag_int_enum_equivalence == 0
3647 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
3648 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
3649 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
3650 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
3652 cp_warning ("comparison between `%#T' and `%#T'",
3653 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
3656 /* Give warnings for comparisons between signed and unsigned
3657 quantities that may fail. */
3658 /* Do the checking based on the original operand trees, so that
3659 casts will be considered, but default promotions won't be. */
3661 /* Do not warn if the comparison is being done in a signed type,
3662 since the signed type will only be chosen if it can represent
3663 all the values of the unsigned type. */
3664 if (! TREE_UNSIGNED (result_type))
3666 /* Do not warn if both operands are unsigned. */
3667 else if (op0_signed == op1_signed)
3669 /* Do not warn if the signed quantity is an unsuffixed
3670 integer literal (or some static constant expression
3671 involving such literals) and it is non-negative. */
3672 else if ((op0_signed && TREE_CODE (orig_op0) == INTEGER_CST
3673 && tree_int_cst_sgn (orig_op0) >= 0)
3674 || (op1_signed && TREE_CODE (orig_op1) == INTEGER_CST
3675 && tree_int_cst_sgn (orig_op1) >= 0))
3677 /* Do not warn if the comparison is an equality operation,
3678 the unsigned quantity is an integral constant and it does
3679 not use the most significant bit of result_type. */
3680 else if ((resultcode == EQ_EXPR || resultcode == NE_EXPR)
3681 && ((op0_signed && TREE_CODE (orig_op1) == INTEGER_CST
3682 && int_fits_type_p (orig_op1, signed_type (result_type))
3683 || (op1_signed && TREE_CODE (orig_op0) == INTEGER_CST
3684 && int_fits_type_p (orig_op0, signed_type (result_type))))))
3687 warning ("comparison between signed and unsigned");
3689 /* Warn if two unsigned values are being compared in a size
3690 larger than their original size, and one (and only one) is the
3691 result of a `~' operator. This comparison will always fail.
3693 Also warn if one operand is a constant, and the constant does not
3694 have all bits set that are set in the ~ operand when it is
3697 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
3698 ^ (TREE_CODE (primop1) == BIT_NOT_EXPR))
3700 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
3701 primop0 = get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
3702 if (TREE_CODE (primop1) == BIT_NOT_EXPR)
3703 primop1 = get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
3705 if (TREE_CODE (primop0) == INTEGER_CST
3706 || TREE_CODE (primop1) == INTEGER_CST)
3709 HOST_WIDE_INT constant, mask;
3713 if (TREE_CODE (primop0) == INTEGER_CST)
3716 unsignedp = unsignedp1;
3717 constant = TREE_INT_CST_LOW (primop0);
3722 unsignedp = unsignedp0;
3723 constant = TREE_INT_CST_LOW (primop1);
3726 bits = TYPE_PRECISION (TREE_TYPE (primop));
3727 if (bits < TYPE_PRECISION (result_type)
3728 && bits < HOST_BITS_PER_LONG && unsignedp)
3730 mask = (~ (HOST_WIDE_INT) 0) << bits;
3731 if ((mask & constant) != mask)
3732 warning ("comparison of promoted ~unsigned with constant");
3735 else if (unsignedp0 && unsignedp1
3736 && (TYPE_PRECISION (TREE_TYPE (primop0))
3737 < TYPE_PRECISION (result_type))
3738 && (TYPE_PRECISION (TREE_TYPE (primop1))
3739 < TYPE_PRECISION (result_type)))
3740 warning ("comparison of promoted ~unsigned with unsigned");
3745 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
3746 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3747 Then the expression will be built.
3748 It will be given type FINAL_TYPE if that is nonzero;
3749 otherwise, it will be given type RESULT_TYPE. */
3753 cp_error ("invalid operands `%T' and `%T' to binary `%O'",
3754 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), error_code);
3755 return error_mark_node;
3760 if (TREE_TYPE (op0) != result_type)
3761 op0 = convert (result_type, op0);
3762 if (TREE_TYPE (op1) != result_type)
3763 op1 = convert (result_type, op1);
3766 if (build_type == NULL_TREE)
3767 build_type = result_type;
3770 register tree result = build (resultcode, build_type, op0, op1);
3771 register tree folded;
3773 folded = fold (result);
3774 if (folded == result)
3775 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
3776 if (final_type != 0)
3777 return convert (final_type, folded);
3782 /* Return a tree for the sum or difference (RESULTCODE says which)
3783 of pointer PTROP and integer INTOP. */
3786 pointer_int_sum (resultcode, ptrop, intop)
3787 enum tree_code resultcode;
3788 register tree ptrop, intop;
3792 register tree result;
3793 register tree folded = fold (intop);
3795 /* The result is a pointer of the same type that is being added. */
3797 register tree result_type = TREE_TYPE (ptrop);
3799 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
3801 if (pedantic || warn_pointer_arith)
3802 pedwarn ("ANSI C++ forbids using pointer of type `void *' in arithmetic");
3803 size_exp = integer_one_node;
3805 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
3807 if (pedantic || warn_pointer_arith)
3808 pedwarn ("ANSI C++ forbids using pointer to a function in arithmetic");
3809 size_exp = integer_one_node;
3811 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
3813 if (pedantic || warn_pointer_arith)
3814 pedwarn ("ANSI C++ forbids using pointer to a method in arithmetic");
3815 size_exp = integer_one_node;
3817 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
3819 if (pedantic || warn_pointer_arith)
3820 pedwarn ("ANSI C++ forbids using pointer to a member in arithmetic");
3821 size_exp = integer_one_node;
3824 size_exp = size_in_bytes (complete_type (TREE_TYPE (result_type)));
3826 /* Needed to make OOPS V2R3 work. */
3828 if (TREE_CODE (intop) == INTEGER_CST
3829 && TREE_INT_CST_LOW (intop) == 0
3830 && TREE_INT_CST_HIGH (intop) == 0)
3833 /* If what we are about to multiply by the size of the elements
3834 contains a constant term, apply distributive law
3835 and multiply that constant term separately.
3836 This helps produce common subexpressions. */
3838 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
3839 && ! TREE_CONSTANT (intop)
3840 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
3841 && TREE_CONSTANT (size_exp))
3843 enum tree_code subcode = resultcode;
3844 if (TREE_CODE (intop) == MINUS_EXPR)
3845 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
3846 ptrop = build_binary_op (subcode, ptrop, TREE_OPERAND (intop, 1), 1);
3847 intop = TREE_OPERAND (intop, 0);
3850 /* Convert the integer argument to a type the same size as sizetype
3851 so the multiply won't overflow spuriously. */
3853 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype))
3854 intop = convert (type_for_size (TYPE_PRECISION (sizetype), 0), intop);
3856 /* Replace the integer argument with a suitable product by the object size.
3857 Do this multiplication as signed, then convert to the appropriate
3858 pointer type (actually unsigned integral). */
3860 intop = convert (result_type,
3861 build_binary_op (MULT_EXPR, intop,
3862 convert (TREE_TYPE (intop), size_exp), 1));
3864 /* Create the sum or difference. */
3866 result = build (resultcode, result_type, ptrop, intop);
3868 folded = fold (result);
3869 if (folded == result)
3870 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
3874 /* Return a tree for the difference of pointers OP0 and OP1.
3875 The resulting tree has type int. */
3878 pointer_diff (op0, op1)
3879 register tree op0, op1;
3881 register tree result, folded;
3882 tree restype = ptrdiff_type_node;
3883 tree target_type = TREE_TYPE (TREE_TYPE (op0));
3885 if (pedantic || warn_pointer_arith)
3887 if (TREE_CODE (target_type) == VOID_TYPE)
3888 pedwarn ("ANSI C++ forbids using pointer of type `void *' in subtraction");
3889 if (TREE_CODE (target_type) == FUNCTION_TYPE)
3890 pedwarn ("ANSI C++ forbids using pointer to a function in subtraction");
3891 if (TREE_CODE (target_type) == METHOD_TYPE)
3892 pedwarn ("ANSI C++ forbids using pointer to a method in subtraction");
3893 if (TREE_CODE (target_type) == OFFSET_TYPE)
3894 pedwarn ("ANSI C++ forbids using pointer to a member in subtraction");
3897 /* First do the subtraction as integers;
3898 then drop through to build the divide operator. */
3900 op0 = build_binary_op (MINUS_EXPR,
3901 convert (restype, op0), convert (restype, op1), 1);
3903 /* This generates an error if op1 is a pointer to an incomplete type. */
3904 if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (op1))) == 0)
3905 error ("arithmetic on pointer to an incomplete type");
3907 op1 = ((TREE_CODE (target_type) == VOID_TYPE
3908 || TREE_CODE (target_type) == FUNCTION_TYPE
3909 || TREE_CODE (target_type) == METHOD_TYPE
3910 || TREE_CODE (target_type) == OFFSET_TYPE)
3912 : size_in_bytes (target_type));
3914 /* Do the division. */
3916 result = build (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
3918 folded = fold (result);
3919 if (folded == result)
3920 TREE_CONSTANT (folded) = TREE_CONSTANT (op0) & TREE_CONSTANT (op1);
3924 /* Handle the case of taking the address of a COMPONENT_REF.
3925 Called by `build_unary_op' and `build_up_reference'.
3927 ARG is the COMPONENT_REF whose address we want.
3928 ARGTYPE is the pointer type that this address should have.
3929 MSG is an error message to print if this COMPONENT_REF is not
3930 addressable (such as a bitfield). */
3933 build_component_addr (arg, argtype, msg)
3937 tree field = TREE_OPERAND (arg, 1);
3938 tree basetype = decl_type_context (field);
3939 tree rval = build_unary_op (ADDR_EXPR, TREE_OPERAND (arg, 0), 0);
3941 if (DECL_BIT_FIELD (field))
3943 error (msg, IDENTIFIER_POINTER (DECL_NAME (field)));
3944 return error_mark_node;
3947 if (TREE_CODE (field) == FIELD_DECL
3948 && TYPE_USES_COMPLEX_INHERITANCE (basetype))
3950 /* Can't convert directly to ARGTYPE, since that
3951 may have the same pointer type as one of our
3953 rval = build1 (NOP_EXPR, argtype,
3954 convert_pointer_to (basetype, rval));
3955 TREE_CONSTANT (rval) = TREE_CONSTANT (TREE_OPERAND (rval, 0));
3958 /* This conversion is harmless. */
3959 rval = convert_force (argtype, rval, 0);
3961 if (! integer_zerop (DECL_FIELD_BITPOS (field)))
3963 tree offset = size_binop (EASY_DIV_EXPR, DECL_FIELD_BITPOS (field),
3964 size_int (BITS_PER_UNIT));
3965 int flag = TREE_CONSTANT (rval);
3966 rval = fold (build (PLUS_EXPR, argtype,
3967 rval, convert (argtype, offset)));
3968 TREE_CONSTANT (rval) = flag;
3973 /* Construct and perhaps optimize a tree representation
3974 for a unary operation. CODE, a tree_code, specifies the operation
3975 and XARG is the operand. */
3978 build_x_unary_op (code, xarg)
3979 enum tree_code code;
3982 if (processing_template_decl)
3983 return build_min_nt (code, xarg, NULL_TREE);
3985 /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an
3987 if (code == ADDR_EXPR
3988 && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg)))
3989 && TYPE_SIZE (TREE_TYPE (xarg)) == NULL_TREE)
3990 || (TREE_CODE (xarg) == OFFSET_REF)))
3991 /* don't look for a function */;
3996 if (flag_ansi_overloading)
3998 rval = build_new_op (code, LOOKUP_NORMAL, xarg,
3999 NULL_TREE, NULL_TREE);
4000 if (rval || code != ADDR_EXPR)
4005 rval = build_opfncall (code, LOOKUP_SPECULATIVELY, xarg,
4006 NULL_TREE, NULL_TREE);
4008 return build_opfncall (code, LOOKUP_NORMAL, xarg,
4009 NULL_TREE, NULL_TREE);
4013 if (code == ADDR_EXPR)
4015 if (TREE_CODE (xarg) == TARGET_EXPR)
4016 warning ("taking address of temporary");
4019 return build_unary_op (code, xarg, 0);
4022 /* Just like truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4025 condition_conversion (expr)
4029 if (processing_template_decl)
4031 t = convert (boolean_type_node, expr);
4032 t = fold (build1 (CLEANUP_POINT_EXPR, boolean_type_node, t));
4036 /* C++: Must handle pointers to members.
4038 Perhaps type instantiation should be extended to handle conversion
4039 from aggregates to types we don't yet know we want? (Or are those
4040 cases typically errors which should be reported?)
4042 NOCONVERT nonzero suppresses the default promotions
4043 (such as from short to int). */
4046 build_unary_op (code, xarg, noconvert)
4047 enum tree_code code;
4051 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4052 register tree arg = xarg;
4053 register tree argtype = 0;
4054 char *errstring = NULL;
4057 if (arg == error_mark_node)
4058 return error_mark_node;
4063 /* This is used for unary plus, because a CONVERT_EXPR
4064 is enough to prevent anybody from looking inside for
4065 associativity, but won't generate any code. */
4066 if (!(arg = build_expr_type_conversion
4067 (WANT_ARITH | WANT_ENUM | WANT_POINTER, arg, 1)))
4068 errstring = "wrong type argument to unary plus";
4072 arg = default_conversion (arg);
4073 arg = build1 (NON_LVALUE_EXPR, TREE_TYPE (arg), arg);
4078 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, 1)))
4079 errstring = "wrong type argument to unary minus";
4080 else if (!noconvert)
4081 arg = default_conversion (arg);
4085 if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM, arg, 1)))
4086 errstring = "wrong type argument to bit-complement";
4087 else if (!noconvert)
4088 arg = default_conversion (arg);
4092 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, 1)))
4093 errstring = "wrong type argument to abs";
4094 else if (!noconvert)
4095 arg = default_conversion (arg);
4098 case TRUTH_NOT_EXPR:
4099 arg = convert (boolean_type_node, arg);
4100 val = invert_truthvalue (arg);
4101 if (arg != error_mark_node)
4103 errstring = "in argument to unary !";
4109 case PREINCREMENT_EXPR:
4110 case POSTINCREMENT_EXPR:
4111 case PREDECREMENT_EXPR:
4112 case POSTDECREMENT_EXPR:
4113 /* Handle complex lvalues (when permitted)
4114 by reduction to simpler cases. */
4116 val = unary_complex_lvalue (code, arg);
4120 /* Report invalid types. */
4122 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4125 if (code == PREINCREMENT_EXPR)
4126 errstring ="no pre-increment operator for type";
4127 else if (code == POSTINCREMENT_EXPR)
4128 errstring ="no post-increment operator for type";
4129 else if (code == PREDECREMENT_EXPR)
4130 errstring ="no pre-decrement operator for type";
4132 errstring ="no post-decrement operator for type";
4136 /* Report something read-only. */
4138 if (TYPE_READONLY (TREE_TYPE (arg))
4139 || TREE_READONLY (arg))
4140 readonly_error (arg, ((code == PREINCREMENT_EXPR
4141 || code == POSTINCREMENT_EXPR)
4142 ? "increment" : "decrement"),
4147 tree result_type = TREE_TYPE (arg);
4149 arg = get_unwidened (arg, 0);
4150 argtype = TREE_TYPE (arg);
4152 /* ARM $5.2.5 last annotation says this should be forbidden. */
4153 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4154 pedwarn ("ANSI C++ forbids %sing an enum",
4155 (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4156 ? "increment" : "decrement");
4158 /* Compute the increment. */
4160 if (TREE_CODE (argtype) == POINTER_TYPE)
4162 enum tree_code tmp = TREE_CODE (TREE_TYPE (argtype));
4163 if (TYPE_SIZE (complete_type (TREE_TYPE (argtype))) == 0)
4164 cp_error ("cannot %s a pointer to incomplete type `%T'",
4165 ((code == PREINCREMENT_EXPR
4166 || code == POSTINCREMENT_EXPR)
4167 ? "increment" : "decrement"), TREE_TYPE (argtype));
4168 else if (tmp == FUNCTION_TYPE || tmp == METHOD_TYPE
4169 || tmp == VOID_TYPE || tmp == OFFSET_TYPE)
4170 cp_pedwarn ("ANSI C++ forbids %sing a pointer of type `%T'",
4171 ((code == PREINCREMENT_EXPR
4172 || code == POSTINCREMENT_EXPR)
4173 ? "increment" : "decrement"), argtype);
4174 inc = c_sizeof_nowarn (TREE_TYPE (argtype));
4177 inc = integer_one_node;
4179 inc = convert (argtype, inc);
4181 /* Handle incrementing a cast-expression. */
4183 switch (TREE_CODE (arg))
4188 case FIX_TRUNC_EXPR:
4189 case FIX_FLOOR_EXPR:
4190 case FIX_ROUND_EXPR:
4193 tree incremented, modify, value, compound;
4194 if (! lvalue_p (arg) && pedantic)
4195 pedwarn ("cast to non-reference type used as lvalue");
4196 arg = stabilize_reference (arg);
4197 if (code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR)
4200 value = save_expr (arg);
4201 incremented = build (((code == PREINCREMENT_EXPR
4202 || code == POSTINCREMENT_EXPR)
4203 ? PLUS_EXPR : MINUS_EXPR),
4204 argtype, value, inc);
4205 TREE_SIDE_EFFECTS (incremented) = 1;
4207 modify = build_modify_expr (arg, NOP_EXPR, incremented);
4208 compound = build (COMPOUND_EXPR, TREE_TYPE (arg), modify, value);
4210 /* Eliminate warning about unused result of + or -. */
4211 TREE_NO_UNUSED_WARNING (compound) = 1;
4216 /* Complain about anything else that is not a true lvalue. */
4217 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4218 || code == POSTINCREMENT_EXPR)
4219 ? "increment" : "decrement")))
4220 return error_mark_node;
4222 /* Forbid using -- on `bool'. */
4223 if (TREE_TYPE (arg) == boolean_type_node)
4225 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4227 cp_error ("invalid use of `--' on bool variable `%D'", arg);
4228 return error_mark_node;
4231 /* This will only work if someone can convince Kenner to accept
4232 my patch to expand_increment. (jason) */
4233 val = build (code, TREE_TYPE (arg), arg, inc);
4235 if (code == POSTINCREMENT_EXPR)
4237 arg = stabilize_reference (arg);
4238 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg,
4240 TREE_SIDE_EFFECTS (val) = 1;
4241 arg = save_expr (arg);
4242 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4243 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4246 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg,
4251 val = build (code, TREE_TYPE (arg), arg, inc);
4253 TREE_SIDE_EFFECTS (val) = 1;
4254 return convert (result_type, val);
4258 /* Note that this operation never does default_conversion
4259 regardless of NOCONVERT. */
4261 argtype = TREE_TYPE (arg);
4262 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4266 build_pointer_type (TREE_TYPE (TREE_TYPE (arg))), arg);
4267 TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0));
4271 && TREE_CODE (arg) == FUNCTION_DECL
4273 && DECL_CONTEXT (arg) == NULL_TREE
4274 && IDENTIFIER_LENGTH (DECL_NAME (arg)) == 4
4275 && IDENTIFIER_POINTER (DECL_NAME (arg))[0] == 'm'
4276 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (arg)), "main"))
4278 pedwarn ("taking address of function `main'");
4280 /* Let &* cancel out to simplify resulting code. */
4281 if (TREE_CODE (arg) == INDIRECT_REF)
4283 /* We don't need to have `current_class_ptr' wrapped in a
4284 NON_LVALUE_EXPR node. */
4285 if (arg == current_class_ref)
4286 return current_class_ptr;
4288 arg = TREE_OPERAND (arg, 0);
4289 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4293 build_pointer_type (TREE_TYPE (TREE_TYPE (arg))), arg);
4294 TREE_CONSTANT (arg) = TREE_CONSTANT (TREE_OPERAND (arg, 0));
4296 else if (lvalue_p (arg))
4297 /* Don't let this be an lvalue. */
4298 return non_lvalue (arg);
4302 /* For &x[y], return x+y */
4303 if (TREE_CODE (arg) == ARRAY_REF)
4305 if (mark_addressable (TREE_OPERAND (arg, 0)) == 0)
4306 return error_mark_node;
4307 return build_binary_op (PLUS_EXPR, TREE_OPERAND (arg, 0),
4308 TREE_OPERAND (arg, 1), 1);
4311 /* Uninstantiated types are all functions. Taking the
4312 address of a function is a no-op, so just return the
4315 if (TREE_CODE (arg) == IDENTIFIER_NODE
4316 && IDENTIFIER_OPNAME_P (arg))
4318 my_friendly_abort (117);
4319 /* We don't know the type yet, so just work around the problem.
4320 We know that this will resolve to an lvalue. */
4321 return build1 (ADDR_EXPR, unknown_type_node, arg);
4324 if (TREE_CODE (arg) == TREE_LIST)
4326 if (TREE_CODE (TREE_VALUE (arg)) == FUNCTION_DECL
4327 && DECL_CHAIN (TREE_VALUE (arg)) == NULL_TREE)
4328 /* Unique overloaded non-member function. */
4329 return build_unary_op (ADDR_EXPR, TREE_VALUE (arg), 0);
4330 if (TREE_CHAIN (arg) == NULL_TREE
4331 && TREE_CODE (TREE_VALUE (arg)) == TREE_LIST
4332 && DECL_CHAIN (TREE_VALUE (TREE_VALUE (arg))) == NULL_TREE)
4333 /* Unique overloaded member function. */
4334 return build_unary_op (ADDR_EXPR, TREE_VALUE (TREE_VALUE (arg)),
4336 return build1 (ADDR_EXPR, unknown_type_node, arg);
4339 /* Handle complex lvalues (when permitted)
4340 by reduction to simpler cases. */
4341 val = unary_complex_lvalue (code, arg);
4345 switch (TREE_CODE (arg))
4350 case FIX_TRUNC_EXPR:
4351 case FIX_FLOOR_EXPR:
4352 case FIX_ROUND_EXPR:
4354 if (! lvalue_p (arg) && pedantic)
4355 pedwarn ("taking the address of a cast to non-reference type");
4358 /* Allow the address of a constructor if all the elements
4360 if (TREE_CODE (arg) == CONSTRUCTOR && TREE_CONSTANT (arg))
4362 /* Anything not already handled and not a true memory reference
4364 else if (TREE_CODE (argtype) != FUNCTION_TYPE
4365 && TREE_CODE (argtype) != METHOD_TYPE
4366 && !lvalue_or_else (arg, "unary `&'"))
4367 return error_mark_node;
4369 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
4370 /* If the lvalue is const or volatile,
4371 merge that into the type that the address will point to. */
4372 if (TREE_CODE_CLASS (TREE_CODE (arg)) == 'd'
4373 || TREE_CODE_CLASS (TREE_CODE (arg)) == 'r')
4375 if (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg))
4376 argtype = cp_build_type_variant (argtype,
4377 TREE_READONLY (arg),
4378 TREE_THIS_VOLATILE (arg));
4381 argtype = build_pointer_type (argtype);
4383 if (mark_addressable (arg) == 0)
4384 return error_mark_node;
4389 if (TREE_CODE (arg) == COMPONENT_REF)
4390 addr = build_component_addr (arg, argtype,
4391 "attempt to take address of bit-field structure member `%s'");
4393 addr = build1 (code, argtype, arg);
4395 /* Address of a static or external variable or
4396 function counts as a constant */
4398 TREE_CONSTANT (addr) = 1;
4400 if (TREE_CODE (argtype) == POINTER_TYPE &&
4401 TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4403 build_ptrmemfunc_type (argtype);
4404 addr = build_ptrmemfunc (argtype, addr, 0);
4414 argtype = TREE_TYPE (arg);
4415 return fold (build1 (code, argtype, arg));
4419 return error_mark_node;
4423 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
4424 convert ARG with the same conversions in the same order
4425 and return the result. */
4428 convert_sequence (conversions, arg)
4432 switch (TREE_CODE (conversions))
4437 case FIX_TRUNC_EXPR:
4438 case FIX_FLOOR_EXPR:
4439 case FIX_ROUND_EXPR:
4441 return convert (TREE_TYPE (conversions),
4442 convert_sequence (TREE_OPERAND (conversions, 0),
4451 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4452 for certain kinds of expressions which are not really lvalues
4453 but which we can accept as lvalues.
4455 If ARG is not a kind of expression we can handle, return zero. */
4458 unary_complex_lvalue (code, arg)
4459 enum tree_code code;
4462 /* Handle (a, b) used as an "lvalue". */
4463 if (TREE_CODE (arg) == COMPOUND_EXPR)
4465 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 1), 0);
4466 return build (COMPOUND_EXPR, TREE_TYPE (real_result),
4467 TREE_OPERAND (arg, 0), real_result);
4470 /* Handle (a ? b : c) used as an "lvalue". */
4471 if (TREE_CODE (arg) == COND_EXPR)
4472 return rationalize_conditional_expr (code, arg);
4474 if (TREE_CODE (arg) == MODIFY_EXPR
4475 || TREE_CODE (arg) == PREINCREMENT_EXPR
4476 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4477 return unary_complex_lvalue
4478 (code, build (COMPOUND_EXPR, TREE_TYPE (TREE_OPERAND (arg, 0)),
4479 arg, TREE_OPERAND (arg, 0)));
4481 if (code != ADDR_EXPR)
4484 /* Handle (a = b) used as an "lvalue" for `&'. */
4485 if (TREE_CODE (arg) == MODIFY_EXPR
4486 || TREE_CODE (arg) == INIT_EXPR)
4488 tree real_result = build_unary_op (code, TREE_OPERAND (arg, 0), 0);
4489 arg = build (COMPOUND_EXPR, TREE_TYPE (real_result), arg, real_result);
4490 TREE_NO_UNUSED_WARNING (arg) = 1;
4494 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4495 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4496 || TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE)
4498 /* The representation of something of type OFFSET_TYPE
4499 is really the representation of a pointer to it.
4500 Here give the representation its true type. */
4503 my_friendly_assert (TREE_CODE (arg) != SCOPE_REF, 313);
4505 if (TREE_CODE (arg) != OFFSET_REF)
4508 t = TREE_OPERAND (arg, 1);
4510 if (TREE_CODE (t) == FUNCTION_DECL) /* Check all this code for right semantics. */
4511 return build_unary_op (ADDR_EXPR, t, 0);
4512 if (TREE_CODE (t) == VAR_DECL)
4513 return build_unary_op (ADDR_EXPR, t, 0);
4517 tree offset = integer_zero_node;
4519 if (TREE_OPERAND (arg, 0)
4520 && (TREE_CODE (TREE_OPERAND (arg, 0)) != NOP_EXPR
4521 || TREE_OPERAND (TREE_OPERAND (arg, 0), 0) != error_mark_node))
4522 if (TREE_CODE (t) != FIELD_DECL)
4524 /* Don't know if this should return address to just
4525 _DECL, or actual address resolved in this expression. */
4526 sorry ("address of bound pointer-to-member expression");
4527 return error_mark_node;
4530 type = TREE_TYPE (TREE_OPERAND (arg, 0));
4532 if (TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE)
4534 /* Add in the offset to the intermediate subobject, if any. */
4535 offset = get_delta_difference (TYPE_OFFSET_BASETYPE (TREE_TYPE (arg)),
4538 type = TYPE_OFFSET_BASETYPE (TREE_TYPE (arg));
4541 /* Now in the offset to the final subobject. */
4542 offset = size_binop (PLUS_EXPR,
4544 get_delta_difference (DECL_FIELD_CONTEXT (t),
4548 /* Add in the offset to the field. */
4549 offset = size_binop (PLUS_EXPR, offset,
4550 size_binop (EASY_DIV_EXPR,
4551 DECL_FIELD_BITPOS (t),
4552 size_int (BITS_PER_UNIT)));
4554 /* We offset all pointer to data memebers by 1 so that we can
4555 distinguish between a null pointer to data member and the first
4556 data member of a structure. */
4557 offset = size_binop (PLUS_EXPR, offset, size_int (1));
4559 return convert (build_pointer_type (TREE_TYPE (arg)), offset);
4564 /* We permit compiler to make function calls returning
4565 objects of aggregate type look like lvalues. */
4569 if (TREE_CODE (targ) == SAVE_EXPR)
4570 targ = TREE_OPERAND (targ, 0);
4572 if (TREE_CODE (targ) == CALL_EXPR && IS_AGGR_TYPE (TREE_TYPE (targ)))
4574 if (TREE_CODE (arg) == SAVE_EXPR)
4577 targ = build_cplus_new (TREE_TYPE (arg), arg);
4578 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
4581 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
4582 return build (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
4583 TREE_OPERAND (targ, 0), current_function_decl, NULL);
4586 /* Don't let anything else be handled specially. */
4590 /* Mark EXP saying that we need to be able to take the
4591 address of it; it should not be allocated in a register.
4592 Value is 1 if successful.
4594 C++: we do not allow `current_class_ptr' to be addressable. */
4597 mark_addressable (exp)
4600 register tree x = exp;
4602 if (TREE_ADDRESSABLE (x) == 1)
4606 switch (TREE_CODE (x))
4611 x = TREE_OPERAND (x, 0);
4615 if (x == current_class_ptr)
4617 if (! flag_this_is_variable)
4618 error ("address of `this' not available");
4619 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later */
4620 put_var_into_stack (x);
4624 if (TREE_STATIC (x) && TREE_READONLY (x)
4625 && DECL_RTL (x) != 0
4626 && ! DECL_IN_MEMORY_P (x))
4628 /* We thought this would make a good constant variable,
4629 but we were wrong. */
4630 push_obstacks_nochange ();
4631 end_temporary_allocation ();
4633 TREE_ASM_WRITTEN (x) = 0;
4635 rest_of_decl_compilation (x, 0, IDENTIFIER_LOCAL_VALUE (x) == 0, 0);
4636 TREE_ADDRESSABLE (x) = 1;
4642 /* Caller should not be trying to mark initialized
4643 constant fields addressable. */
4644 my_friendly_assert (DECL_LANG_SPECIFIC (x) == 0
4645 || DECL_IN_AGGR_P (x) == 0
4647 || DECL_EXTERNAL (x), 314);
4651 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
4652 && !DECL_ARTIFICIAL (x) && extra_warnings)
4653 cp_warning ("address requested for `%D', which is declared `register'",
4655 put_var_into_stack (x);
4656 TREE_ADDRESSABLE (x) = 1;
4660 /* We have to test both conditions here. The first may
4661 be non-zero in the case of processing a default function.
4662 The second may be non-zero in the case of a template function. */
4663 x = DECL_MAIN_VARIANT (x);
4664 if ((DECL_THIS_INLINE (x) || DECL_PENDING_INLINE_INFO (x))
4665 && (DECL_CONTEXT (x) == NULL_TREE
4666 || TREE_CODE_CLASS (TREE_CODE (DECL_CONTEXT (x))) != 't'
4667 || ! CLASSTYPE_INTERFACE_ONLY (DECL_CONTEXT (x))))
4669 mark_inline_for_output (x);
4670 if (x == current_function_decl)
4671 DECL_EXTERNAL (x) = 0;
4673 TREE_ADDRESSABLE (x) = 1;
4675 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
4679 TREE_ADDRESSABLE (x) = 1;
4683 TREE_ADDRESSABLE (x) = 1;
4684 mark_addressable (TREE_OPERAND (x, 0));
4692 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4695 build_x_conditional_expr (ifexp, op1, op2)
4696 tree ifexp, op1, op2;
4698 tree rval = NULL_TREE;
4700 if (processing_template_decl)
4701 return build_min_nt (COND_EXPR, ifexp, op1, op2);
4703 if (flag_ansi_overloading)
4704 return build_new_op (COND_EXPR, LOOKUP_NORMAL, ifexp, op1, op2);
4706 /* See comments in `build_x_binary_op'. */
4708 rval = build_opfncall (COND_EXPR, LOOKUP_SPECULATIVELY, ifexp, op1, op2);
4710 return build_opfncall (COND_EXPR, LOOKUP_NORMAL, ifexp, op1, op2);
4712 return build_conditional_expr (ifexp, op1, op2);
4716 build_conditional_expr (ifexp, op1, op2)
4717 tree ifexp, op1, op2;
4719 register tree type1;
4720 register tree type2;
4721 register enum tree_code code1;
4722 register enum tree_code code2;
4723 register tree result_type = NULL_TREE;
4725 /* If second operand is omitted, it is the same as the first one;
4726 make sure it is calculated only once. */
4730 pedwarn ("ANSI C++ forbids omitting the middle term of a ?: expression");
4731 ifexp = op1 = save_expr (ifexp);
4734 ifexp = convert (boolean_type_node, ifexp);
4736 if (TREE_CODE (ifexp) == ERROR_MARK)
4737 return error_mark_node;
4739 op1 = require_instantiated_type (TREE_TYPE (op2), op1, error_mark_node);
4740 if (op1 == error_mark_node)
4741 return error_mark_node;
4742 op2 = require_instantiated_type (TREE_TYPE (op1), op2, error_mark_node);
4743 if (op2 == error_mark_node)
4744 return error_mark_node;
4746 /* C++: REFERENCE_TYPES must be dereferenced. */
4747 type1 = TREE_TYPE (op1);
4748 code1 = TREE_CODE (type1);
4749 type2 = TREE_TYPE (op2);
4750 code2 = TREE_CODE (type2);
4752 if (code1 == REFERENCE_TYPE)
4754 op1 = convert_from_reference (op1);
4755 type1 = TREE_TYPE (op1);
4756 code1 = TREE_CODE (type1);
4758 if (code2 == REFERENCE_TYPE)
4760 op2 = convert_from_reference (op2);
4761 type2 = TREE_TYPE (op2);
4762 code2 = TREE_CODE (type2);
4765 /* Don't promote the operands separately if they promote
4766 the same way. Return the unpromoted type and let the combined
4767 value get promoted if necessary. */
4769 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2)
4770 && code2 != ARRAY_TYPE
4771 && code2 != FUNCTION_TYPE
4772 && code2 != METHOD_TYPE)
4776 if (TREE_CONSTANT (ifexp)
4777 && (TREE_CODE (ifexp) == INTEGER_CST
4778 || TREE_CODE (ifexp) == ADDR_EXPR))
4779 return (integer_zerop (ifexp) ? op2 : op1);
4781 if (TREE_CODE (op1) == CONST_DECL)
4782 op1 = DECL_INITIAL (op1);
4783 else if (TREE_READONLY_DECL_P (op1))
4784 op1 = decl_constant_value (op1);
4785 if (TREE_CODE (op2) == CONST_DECL)
4786 op2 = DECL_INITIAL (op2);
4787 else if (TREE_READONLY_DECL_P (op2))
4788 op2 = decl_constant_value (op2);
4790 type1 = cp_build_type_variant
4792 TREE_READONLY (op1) || TREE_READONLY (op2),
4793 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
4794 /* ??? This is a kludge to deal with the fact that
4795 we don't sort out integers and enums properly, yet. */
4796 result = fold (build (COND_EXPR, type1, ifexp, op1, op2));
4797 if (TREE_TYPE (result) != type1)
4798 result = build1 (NOP_EXPR, type1, result);
4799 /* Expand both sides into the same slot,
4800 hopefully the target of the ?: expression. */
4801 if (TREE_CODE (op1) == TARGET_EXPR && TREE_CODE (op2) == TARGET_EXPR)
4803 tree slot = build (VAR_DECL, TREE_TYPE (result));
4804 layout_decl (slot, 0);
4805 result = build (TARGET_EXPR, TREE_TYPE (result),
4806 slot, result, NULL_TREE, NULL_TREE);
4811 /* They don't match; promote them both and then try to reconcile them.
4812 But don't permit mismatching enum types. */
4813 if (code1 == ENUMERAL_TYPE)
4815 if (code2 == ENUMERAL_TYPE)
4817 cp_error ("enumeral mismatch in conditional expression: `%T' vs `%T'", type1, type2);
4818 return error_mark_node;
4820 else if (extra_warnings && ! IS_AGGR_TYPE_CODE (code2)
4821 && type2 != type_promotes_to (type1))
4822 warning ("enumeral and non-enumeral type in conditional expression");
4824 else if (extra_warnings
4825 && code2 == ENUMERAL_TYPE && ! IS_AGGR_TYPE_CODE (code1)
4826 && type1 != type_promotes_to (type2))
4827 warning ("enumeral and non-enumeral type in conditional expression");
4829 if (code1 != VOID_TYPE)
4831 op1 = default_conversion (op1);
4832 type1 = TREE_TYPE (op1);
4833 if (TYPE_PTRMEMFUNC_P (type1))
4834 type1 = TYPE_PTRMEMFUNC_FN_TYPE (type1);
4835 code1 = TREE_CODE (type1);
4837 if (code2 != VOID_TYPE)
4839 op2 = default_conversion (op2);
4840 type2 = TREE_TYPE (op2);
4841 if (TYPE_PTRMEMFUNC_P (type2))
4842 type2 = TYPE_PTRMEMFUNC_FN_TYPE (type2);
4843 code2 = TREE_CODE (type2);
4846 if (code1 == RECORD_TYPE && code2 == RECORD_TYPE
4847 && real_lvalue_p (op1) && real_lvalue_p (op2)
4848 && comptypes (type1, type2, -1))
4850 type1 = build_reference_type (type1);
4851 type2 = build_reference_type (type2);
4852 result_type = common_type (type1, type2);
4853 op1 = convert_to_reference (result_type, op1, CONV_IMPLICIT,
4854 LOOKUP_NORMAL, NULL_TREE);
4855 op2 = convert_to_reference (result_type, op2, CONV_IMPLICIT,
4856 LOOKUP_NORMAL, NULL_TREE);
4858 /* Quickly detect the usual case where op1 and op2 have the same type
4860 else if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
4863 result_type = type1;
4865 result_type = cp_build_type_variant
4867 TREE_READONLY (op1) || TREE_READONLY (op2),
4868 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
4870 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE)
4871 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE))
4873 result_type = common_type (type1, type2);
4875 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
4877 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
4878 pedwarn ("ANSI C++ forbids conditional expr with only one void side");
4879 result_type = void_type_node;
4881 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op2))
4882 result_type = qualify_type (type1, type2);
4883 else if (code2 == POINTER_TYPE && null_ptr_cst_p (op1))
4884 result_type = qualify_type (type2, type1);
4885 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
4887 if (comp_target_types (type1, type2, 1))
4888 result_type = common_type (type1, type2);
4889 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1)) == void_type_node)
4891 if (pedantic && TREE_CODE (type2) == FUNCTION_TYPE)
4892 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
4893 result_type = qualify_type (type1, type2);
4895 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2)) == void_type_node)
4897 if (pedantic && TREE_CODE (type1) == FUNCTION_TYPE)
4898 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
4899 result_type = qualify_type (type2, type1);
4902 else if (comptypes (type2, type1, 0))
4903 result_type = type2;
4904 else if (IS_AGGR_TYPE (TREE_TYPE (type1))
4905 && IS_AGGR_TYPE (TREE_TYPE (type2))
4906 && (result_type = common_base_type (TREE_TYPE (type1), TREE_TYPE (type2))))
4908 if (result_type == error_mark_node)
4910 cp_error ("common base type of types `%T' and `%T' is ambiguous",
4911 TREE_TYPE (type1), TREE_TYPE (type2));
4912 result_type = ptr_type_node;
4917 && result_type != TREE_TYPE (type1)
4918 && result_type != TREE_TYPE (type2))
4919 cp_pedwarn ("`%T' and `%T' converted to `%T *' in conditional expression",
4920 type1, type2, result_type);
4922 result_type = build_pointer_type (result_type);
4927 pedwarn ("pointer type mismatch in conditional expression");
4928 result_type = ptr_type_node;
4931 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
4933 pedwarn ("pointer/integer type mismatch in conditional expression");
4934 result_type = type1;
4936 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
4938 pedwarn ("pointer/integer type mismatch in conditional expression");
4939 result_type = type2;
4944 /* The match does not look good. If either is
4945 an aggregate value, try converting to a scalar type. */
4946 if (code1 == RECORD_TYPE && code2 == RECORD_TYPE)
4948 cp_error ("aggregate mismatch in conditional expression: `%T' vs `%T'", type1, type2);
4949 return error_mark_node;
4951 /* Warning: this code assumes that conversion between cv-variants of
4952 a type is done using NOP_EXPRs. */
4953 if (code1 == RECORD_TYPE && TYPE_HAS_CONVERSION (type1))
4955 /* There are other types besides pointers and records. */
4957 if (code2 == POINTER_TYPE)
4958 tmp = build_pointer_type
4959 (build_type_variant (TREE_TYPE (type2), 1, 1));
4962 tmp = build_type_conversion (CONVERT_EXPR, tmp, op1, 0);
4963 if (tmp == NULL_TREE)
4965 cp_error ("incompatible types `%T' and `%T' in `?:'",
4967 return error_mark_node;
4969 if (tmp == error_mark_node)
4970 error ("ambiguous pointer conversion");
4973 result_type = common_type (type2, TREE_TYPE (tmp));
4976 else if (code2 == RECORD_TYPE && TYPE_HAS_CONVERSION (type2))
4979 if (code1 == POINTER_TYPE)
4980 tmp = build_pointer_type
4981 (build_type_variant (TREE_TYPE (type1), 1, 1));
4985 tmp = build_type_conversion (CONVERT_EXPR, tmp, op2, 0);
4986 if (tmp == NULL_TREE)
4988 cp_error ("incompatible types `%T' and `%T' in `?:'",
4990 return error_mark_node;
4992 if (tmp == error_mark_node)
4993 error ("ambiguous pointer conversion");
4996 result_type = common_type (type1, TREE_TYPE (tmp));
4999 else if (flag_cond_mismatch)
5000 result_type = void_type_node;
5003 error ("type mismatch in conditional expression");
5004 return error_mark_node;
5008 if (TREE_CODE (result_type) == POINTER_TYPE
5009 && TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
5010 result_type = build_ptrmemfunc_type (result_type);
5012 if (result_type != TREE_TYPE (op1))
5013 op1 = convert_and_check (result_type, op1);
5014 if (result_type != TREE_TYPE (op2))
5015 op2 = convert_and_check (result_type, op2);
5017 if (TREE_CONSTANT (ifexp))
5018 return integer_zerop (ifexp) ? op2 : op1;
5020 return convert_from_reference
5021 (fold (build (COND_EXPR, result_type, ifexp, op1, op2)));
5024 /* Handle overloading of the ',' operator when needed. Otherwise,
5025 this function just builds an expression list. */
5028 build_x_compound_expr (list)
5031 tree rest = TREE_CHAIN (list);
5034 if (processing_template_decl)
5035 return build_min_nt (COMPOUND_EXPR, list, NULL_TREE);
5037 if (rest == NULL_TREE)
5038 return build_compound_expr (list);
5040 result = build_opfncall (COMPOUND_EXPR, LOOKUP_NORMAL,
5041 TREE_VALUE (list), TREE_VALUE (rest), NULL_TREE);
5043 return build_x_compound_expr (tree_cons (NULL_TREE, result, TREE_CHAIN (rest)));
5045 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)))
5047 /* the left-hand operand of a comma expression is like an expression
5048 statement: we should warn if it doesn't have any side-effects,
5049 unless it was explicitly cast to (void). */
5050 if ((extra_warnings || warn_unused)
5051 && !(TREE_CODE (TREE_VALUE(list)) == CONVERT_EXPR
5052 && TREE_TYPE (TREE_VALUE(list)) == void_type_node))
5053 warning("left-hand operand of comma expression has no effect");
5055 #if 0 /* this requires a gcc backend patch to export warn_if_unused_value */
5056 else if (warn_unused)
5057 warn_if_unused_value (TREE_VALUE(list));
5060 return build_compound_expr (tree_cons (NULL_TREE, TREE_VALUE (list),
5061 build_tree_list (NULL_TREE, build_x_compound_expr (rest))));
5064 /* Given a list of expressions, return a compound expression
5065 that performs them all and returns the value of the last of them. */
5068 build_compound_expr (list)
5073 if (TREE_READONLY_DECL_P (TREE_VALUE (list)))
5074 TREE_VALUE (list) = decl_constant_value (TREE_VALUE (list));
5076 if (TREE_CHAIN (list) == 0)
5078 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5079 Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
5080 if (TREE_CODE (list) == NOP_EXPR
5081 && TREE_TYPE (list) == TREE_TYPE (TREE_OPERAND (list, 0)))
5082 list = TREE_OPERAND (list, 0);
5084 /* Convert arrays to pointers. */
5085 if (TREE_CODE (TREE_TYPE (TREE_VALUE (list))) == ARRAY_TYPE)
5086 return default_conversion (TREE_VALUE (list));
5088 return TREE_VALUE (list);
5091 rest = build_compound_expr (TREE_CHAIN (list));
5093 /* When pedantic, a compound expression cannot be a constant expression. */
5094 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list)) && ! pedantic)
5097 return build (COMPOUND_EXPR, TREE_TYPE (rest),
5098 break_out_cleanups (TREE_VALUE (list)), rest);
5102 build_static_cast (type, expr)
5108 if (type == error_mark_node || expr == error_mark_node)
5109 return error_mark_node;
5111 if (TREE_CODE (expr) == OFFSET_REF)
5112 expr = resolve_offset_ref (expr);
5114 if (processing_template_decl)
5116 tree t = build_min (STATIC_CAST_EXPR, type, expr);
5120 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5121 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5122 if (TREE_CODE (type) != REFERENCE_TYPE
5123 && TREE_CODE (expr) == NOP_EXPR
5124 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5125 expr = TREE_OPERAND (expr, 0);
5127 if (TREE_CODE (type) == VOID_TYPE)
5128 return build1 (CONVERT_EXPR, type, expr);
5130 if (type_unknown_p (expr))
5132 expr = instantiate_type (type, expr, 1);
5133 if (expr == error_mark_node)
5134 return error_mark_node;
5137 if (TREE_CODE (type) == REFERENCE_TYPE)
5138 return (convert_from_reference
5139 (convert_to_reference (type, expr, CONV_STATIC|CONV_IMPLICIT,
5140 LOOKUP_COMPLAIN, NULL_TREE)));
5142 if (IS_AGGR_TYPE (type))
5143 return build_cplus_new
5144 (type, (build_method_call
5145 (NULL_TREE, ctor_identifier, build_tree_list (NULL_TREE, expr),
5146 TYPE_BINFO (type), LOOKUP_NORMAL)));
5148 expr = decay_conversion (expr);
5149 intype = TREE_TYPE (expr);
5151 /* FIXME handle casting to array type. */
5154 if (can_convert_arg (type, intype, expr))
5156 else if (TYPE_PTROB_P (type) && TYPE_PTROB_P (intype))
5159 if (IS_AGGR_TYPE (TREE_TYPE (type)) && IS_AGGR_TYPE (TREE_TYPE (intype))
5160 && (TYPE_READONLY (TREE_TYPE (type))
5161 >= TYPE_READONLY (TREE_TYPE (intype)))
5162 && (TYPE_VOLATILE (TREE_TYPE (type))
5163 >= TYPE_VOLATILE (TREE_TYPE (intype)))
5164 && (binfo = get_binfo (TREE_TYPE (intype), TREE_TYPE (type), 0))
5165 && ! TREE_VIA_VIRTUAL (binfo))
5168 else if (TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5170 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type))),
5171 TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (intype))), 1)
5172 && (TYPE_READONLY (TREE_TYPE (TREE_TYPE (type)))
5173 >= TYPE_READONLY (TREE_TYPE (TREE_TYPE (intype))))
5174 && (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (type)))
5175 >= TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (intype))))
5176 && (binfo = get_binfo (TYPE_OFFSET_BASETYPE (intype),
5177 TYPE_OFFSET_BASETYPE (type), 0))
5178 && ! TREE_VIA_VIRTUAL (binfo))
5181 else if (TREE_CODE (intype) != BOOLEAN_TYPE
5182 && TREE_CODE (type) != ARRAY_TYPE
5183 && TREE_CODE (type) != FUNCTION_TYPE
5184 && can_convert (intype, type))
5188 return build_c_cast (type, expr);
5190 cp_error ("static_cast from `%T' to `%T'", intype, type);
5191 return error_mark_node;
5195 build_reinterpret_cast (type, expr)
5200 if (type == error_mark_node || expr == error_mark_node)
5201 return error_mark_node;
5203 if (TREE_CODE (expr) == OFFSET_REF)
5204 expr = resolve_offset_ref (expr);
5206 if (processing_template_decl)
5208 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5212 if (TREE_CODE (type) != REFERENCE_TYPE)
5214 expr = decay_conversion (expr);
5216 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5217 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5218 if (TREE_CODE (expr) == NOP_EXPR
5219 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5220 expr = TREE_OPERAND (expr, 0);
5223 if (type_unknown_p (expr))
5225 expr = instantiate_type (type, expr, 1);
5226 if (expr == error_mark_node)
5227 return error_mark_node;
5230 intype = TREE_TYPE (expr);
5232 if (TREE_CODE (type) == REFERENCE_TYPE)
5234 if (! real_lvalue_p (expr))
5236 cp_error ("reinterpret_cast from `%T' rvalue to `%T'", intype, type);
5237 return error_mark_node;
5239 expr = build_unary_op (ADDR_EXPR, expr, 0);
5240 if (expr != error_mark_node)
5241 expr = build_reinterpret_cast
5242 (build_pointer_type (TREE_TYPE (type)), expr);
5243 if (expr != error_mark_node)
5244 expr = build_indirect_ref (expr, 0);
5247 else if (comptypes (TYPE_MAIN_VARIANT (intype), TYPE_MAIN_VARIANT (type), 1))
5248 return build_static_cast (type, expr);
5250 if (TYPE_PTR_P (type) && (TREE_CODE (intype) == INTEGER_TYPE
5251 || TREE_CODE (intype) == ENUMERAL_TYPE))
5253 else if (TREE_CODE (type) == INTEGER_TYPE && TYPE_PTR_P (intype))
5255 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5256 cp_pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
5259 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5260 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5262 if (TREE_READONLY_DECL_P (expr))
5263 expr = decl_constant_value (expr);
5264 return fold (build1 (NOP_EXPR, type, expr));
5266 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5267 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5269 if (! comp_ptr_ttypes_reinterpret (TREE_TYPE (type), TREE_TYPE (intype)))
5270 cp_pedwarn ("reinterpret_cast from `%T' to `%T' casts away const (or volatile)",
5273 if (TREE_READONLY_DECL_P (expr))
5274 expr = decl_constant_value (expr);
5275 return fold (build1 (NOP_EXPR, type, expr));
5279 cp_error ("reinterpret_cast from `%T' to `%T'", intype, type);
5280 return error_mark_node;
5283 return convert (type, expr);
5287 build_const_cast (type, expr)
5292 if (type == error_mark_node || expr == error_mark_node)
5293 return error_mark_node;
5295 if (TREE_CODE (expr) == OFFSET_REF)
5296 expr = resolve_offset_ref (expr);
5298 if (processing_template_decl)
5300 tree t = build_min (CONST_CAST_EXPR, type, expr);
5304 if (TREE_CODE (type) != REFERENCE_TYPE)
5306 expr = decay_conversion (expr);
5308 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5309 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5310 if (TREE_CODE (expr) == NOP_EXPR
5311 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5312 expr = TREE_OPERAND (expr, 0);
5315 if (type_unknown_p (expr))
5317 expr = instantiate_type (type, expr, 1);
5318 if (expr == error_mark_node)
5319 return error_mark_node;
5322 intype = TREE_TYPE (expr);
5324 if (comptypes (TYPE_MAIN_VARIANT (intype), TYPE_MAIN_VARIANT (type), 1))
5325 return build_static_cast (type, expr);
5326 else if (TREE_CODE (type) == REFERENCE_TYPE)
5328 if (! real_lvalue_p (expr))
5330 cp_error ("const_cast from `%T' rvalue to `%T'", intype, type);
5331 return error_mark_node;
5334 if (comp_ptr_ttypes_const (TREE_TYPE (type), intype))
5335 return (convert_from_reference
5336 (convert_to_reference (type, expr, CONV_CONST|CONV_IMPLICIT,
5337 LOOKUP_COMPLAIN, NULL_TREE)));
5339 else if (TREE_CODE (type) == POINTER_TYPE
5340 && TREE_CODE (intype) == POINTER_TYPE
5341 && comp_ptr_ttypes_const (TREE_TYPE (type), TREE_TYPE (intype)))
5342 return convert (type, expr);
5344 cp_error ("const_cast from `%T' to `%T'", intype, type);
5345 return error_mark_node;
5348 /* Build an expression representing a cast to type TYPE of expression EXPR.
5350 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
5351 when doing the cast. */
5354 build_c_cast (type, expr)
5357 register tree value = expr;
5359 if (type == error_mark_node || expr == error_mark_node)
5360 return error_mark_node;
5362 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5363 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5364 if (TREE_CODE (type) != REFERENCE_TYPE
5365 && TREE_CODE (value) == NOP_EXPR
5366 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
5367 value = TREE_OPERAND (value, 0);
5369 if (TREE_TYPE (expr)
5370 && TREE_CODE (TREE_TYPE (expr)) == OFFSET_TYPE
5371 && TREE_CODE (type) != OFFSET_TYPE)
5372 value = resolve_offset_ref (value);
5374 if (TREE_CODE (type) == ARRAY_TYPE)
5376 /* Allow casting from T1* to T2[] because Cfront allows it.
5377 NIHCL uses it. It is not valid ANSI C however, and hence, not
5379 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
5382 pedwarn ("ANSI C++ forbids casting to an array type");
5383 type = build_pointer_type (TREE_TYPE (type));
5387 error ("ANSI C++ forbids casting to an array type");
5388 return error_mark_node;
5392 if (TREE_CODE (type) == FUNCTION_TYPE
5393 || TREE_CODE (type) == METHOD_TYPE)
5395 cp_error ("casting to function type `%T'", type);
5396 return error_mark_node;
5399 if (IS_SIGNATURE (type))
5401 error ("cast specifies signature type");
5402 return error_mark_node;
5405 if (processing_template_decl)
5407 tree t = build_min (CAST_EXPR, type,
5408 min_tree_cons (NULL_TREE, value, NULL_TREE));
5412 if (TREE_CODE (type) == VOID_TYPE)
5413 value = build1 (CONVERT_EXPR, type, value);
5414 else if (TREE_TYPE (value) == NULL_TREE
5415 || type_unknown_p (value))
5417 value = instantiate_type (type, value, 1);
5419 if (value == error_mark_node)
5420 return error_mark_node;
5426 /* Convert functions and arrays to pointers and
5427 convert references to their expanded types,
5428 but don't convert any other types. */
5429 if (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE
5430 || (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE
5431 /* Don't do the default conversion if we want a
5432 pointer to a function. */
5433 && TREE_CODE (type) != POINTER_TYPE
5434 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5435 || TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
5436 || TREE_CODE (TREE_TYPE (value)) == REFERENCE_TYPE)
5437 value = default_conversion (value);
5438 otype = TREE_TYPE (value);
5440 /* Optionally warn about potentially worrisome casts. */
5443 && TREE_CODE (type) == POINTER_TYPE
5444 && TREE_CODE (otype) == POINTER_TYPE)
5446 /* For C++ we make these regular warnings, rather than
5447 softening them into pedwarns. */
5448 if (TYPE_VOLATILE (TREE_TYPE (otype))
5449 && ! TYPE_VOLATILE (TREE_TYPE (type)))
5450 warning ("cast discards `volatile' from pointer target type");
5451 if (TYPE_READONLY (TREE_TYPE (otype))
5452 && ! TYPE_READONLY (TREE_TYPE (type)))
5453 warning ("cast discards `const' from pointer target type");
5456 /* Warn about possible alignment problems. */
5457 if (STRICT_ALIGNMENT && warn_cast_align
5458 && TREE_CODE (type) == POINTER_TYPE
5459 && TREE_CODE (otype) == POINTER_TYPE
5460 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
5461 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
5462 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
5463 warning ("cast increases required alignment of target type");
5466 /* We should see about re-enabling these, they seem useful to
5468 if (TREE_CODE (type) == INTEGER_TYPE
5469 && TREE_CODE (otype) == POINTER_TYPE
5470 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
5471 warning ("cast from pointer to integer of different size");
5473 if (TREE_CODE (type) == POINTER_TYPE
5474 && TREE_CODE (otype) == INTEGER_TYPE
5475 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
5476 /* Don't warn about converting 0 to pointer,
5477 provided the 0 was explicit--not cast or made by folding. */
5478 && !(TREE_CODE (value) == INTEGER_CST && integer_zerop (value)))
5479 warning ("cast to pointer from integer of different size");
5482 if (TREE_CODE (type) == REFERENCE_TYPE)
5483 value = (convert_from_reference
5484 (convert_to_reference (type, value, CONV_C_CAST,
5485 LOOKUP_COMPLAIN, NULL_TREE)));
5490 if (TREE_READONLY_DECL_P (value))
5491 value = decl_constant_value (value);
5494 value = convert_force (type, value, CONV_C_CAST);
5496 /* Ignore any integer overflow caused by the cast. */
5497 if (TREE_CODE (value) == INTEGER_CST)
5499 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
5500 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
5505 /* Always produce some operator for an explicit cast,
5506 so we can tell (for -pedantic) that the cast is no lvalue. */
5507 if (TREE_CODE (type) != REFERENCE_TYPE && value == expr
5508 && real_lvalue_p (value))
5509 value = non_lvalue (value);
5515 expand_target_expr (t)
5518 extern int temp_slot_level;
5519 extern int target_temp_slot_level;
5520 int old_temp_level = target_temp_slot_level;
5522 tree xval = make_node (RTL_EXPR);
5525 /* Any TARGET_EXPR temps live only as long as the outer temp level.
5526 Since they are preserved in this new inner level, we know they
5527 will make it into the outer level. */
5529 target_temp_slot_level = temp_slot_level;
5531 do_pending_stack_adjust ();
5532 start_sequence_for_rtl_expr (xval);
5534 rtxval = expand_expr (t, NULL_RTX, VOIDmode, 0);
5535 do_pending_stack_adjust ();
5536 TREE_SIDE_EFFECTS (xval) = 1;
5537 RTL_EXPR_SEQUENCE (xval) = get_insns ();
5539 RTL_EXPR_RTL (xval) = rtxval;
5540 TREE_TYPE (xval) = TREE_TYPE (t);
5543 target_temp_slot_level = old_temp_level;
5548 /* Build an assignment expression of lvalue LHS from value RHS.
5549 MODIFYCODE is the code for a binary operator that we use
5550 to combine the old value of LHS with RHS to get the new value.
5551 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5553 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5556 build_modify_expr (lhs, modifycode, rhs)
5558 enum tree_code modifycode;
5561 register tree result;
5563 tree lhstype = TREE_TYPE (lhs);
5564 tree olhstype = lhstype;
5567 /* Avoid duplicate error messages from operands that had errors. */
5568 if (lhs == error_mark_node || rhs == error_mark_node)
5569 return error_mark_node;
5571 /* Types that aren't fully specified cannot be used in assignments. */
5572 lhs = require_complete_type (lhs);
5576 /* Handle assignment to signature pointers/refs. */
5578 if (TYPE_LANG_SPECIFIC (lhstype) &&
5579 (IS_SIGNATURE_POINTER (lhstype) || IS_SIGNATURE_REFERENCE (lhstype)))
5581 return build_signature_pointer_constructor (lhs, rhs);
5584 /* Handle control structure constructs used as "lvalues". */
5586 switch (TREE_CODE (lhs))
5588 /* Handle --foo = 5; as these are valid constructs in C++ */
5589 case PREDECREMENT_EXPR:
5590 case PREINCREMENT_EXPR:
5591 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5592 lhs = build (TREE_CODE (lhs), TREE_TYPE (lhs),
5593 stabilize_reference (TREE_OPERAND (lhs, 0)),
5594 TREE_OPERAND (lhs, 1));
5595 return build (COMPOUND_EXPR, lhstype,
5597 build_modify_expr (TREE_OPERAND (lhs, 0),
5600 /* Handle (a, b) used as an "lvalue". */
5602 newrhs = build_modify_expr (TREE_OPERAND (lhs, 1),
5604 if (newrhs == error_mark_node)
5605 return error_mark_node;
5606 return build (COMPOUND_EXPR, lhstype,
5607 TREE_OPERAND (lhs, 0), newrhs);
5610 newrhs = build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs);
5611 if (newrhs == error_mark_node)
5612 return error_mark_node;
5613 return build (COMPOUND_EXPR, lhstype, lhs, newrhs);
5615 /* Handle (a ? b : c) used as an "lvalue". */
5617 rhs = save_expr (rhs);
5619 /* Produce (a ? (b = rhs) : (c = rhs))
5620 except that the RHS goes through a save-expr
5621 so the code to compute it is only emitted once. */
5623 = build_conditional_expr (TREE_OPERAND (lhs, 0),
5624 build_modify_expr (convert (TREE_TYPE (lhs), TREE_OPERAND (lhs, 1)),
5626 build_modify_expr (convert (TREE_TYPE (lhs), TREE_OPERAND (lhs, 2)),
5628 if (cond == error_mark_node)
5630 /* Make sure the code to compute the rhs comes out
5631 before the split. */
5632 return build (COMPOUND_EXPR, TREE_TYPE (lhs),
5633 /* Case to void to suppress warning
5634 from warn_if_unused_value. */
5635 convert (void_type_node, rhs), cond);
5639 if (TREE_CODE (lhs) == OFFSET_REF)
5641 if (TREE_OPERAND (lhs, 0) == NULL_TREE)
5643 /* Static class member? */
5644 tree member = TREE_OPERAND (lhs, 1);
5645 if (TREE_CODE (member) == VAR_DECL)
5649 compiler_error ("invalid static class member");
5650 return error_mark_node;
5654 lhs = resolve_offset_ref (lhs);
5656 olhstype = lhstype = TREE_TYPE (lhs);
5659 if (TREE_CODE (lhstype) == REFERENCE_TYPE
5660 && modifycode != INIT_EXPR)
5662 lhs = convert_from_reference (lhs);
5663 olhstype = lhstype = TREE_TYPE (lhs);
5666 /* If a binary op has been requested, combine the old LHS value with the RHS
5667 producing the value we should actually store into the LHS. */
5669 if (modifycode == INIT_EXPR)
5671 if (! IS_AGGR_TYPE (lhstype))
5672 /* Do the default thing */;
5673 else if (! TYPE_HAS_CONSTRUCTOR (lhstype))
5675 cp_error ("`%T' has no constructors", lhstype);
5676 return error_mark_node;
5678 else if (TYPE_HAS_TRIVIAL_INIT_REF (lhstype)
5679 && TYPE_MAIN_VARIANT (lhstype) == TYPE_MAIN_VARIANT (TREE_TYPE (newrhs)))
5680 /* Do the default thing */;
5683 result = build_method_call (lhs, ctor_identifier,
5684 build_tree_list (NULL_TREE, rhs),
5685 TYPE_BINFO (lhstype), LOOKUP_NORMAL);
5686 if (result == NULL_TREE)
5687 return error_mark_node;
5691 else if (modifycode == NOP_EXPR)
5693 /* `operator=' is not an inheritable operator. */
5694 if (! IS_AGGR_TYPE (lhstype))
5695 /* Do the default thing */;
5696 else if (! TYPE_HAS_ASSIGNMENT (lhstype))
5698 cp_error ("`%T' does not define operator=", lhstype);
5699 return error_mark_node;
5701 else if (TYPE_HAS_TRIVIAL_ASSIGN_REF (lhstype)
5702 && TYPE_MAIN_VARIANT (lhstype) == TYPE_MAIN_VARIANT (TREE_TYPE (newrhs)))
5704 build_opfncall (MODIFY_EXPR, LOOKUP_NORMAL,
5705 lhs, rhs, make_node (NOP_EXPR));
5707 /* Do the default thing */;
5711 result = build_opfncall (MODIFY_EXPR, LOOKUP_NORMAL,
5712 lhs, rhs, make_node (NOP_EXPR));
5713 if (result == NULL_TREE)
5714 return error_mark_node;
5719 else if (PROMOTES_TO_AGGR_TYPE (lhstype, REFERENCE_TYPE))
5721 /* This case must convert to some sort of lvalue that
5722 can participate in an op= operation. */
5725 if (build_default_binary_type_conversion (modifycode, &lhs_tmp, &rhs_tmp))
5727 lhs = stabilize_reference (lhs_tmp);
5728 /* Forget it was ever anything else. */
5729 olhstype = lhstype = TREE_TYPE (lhs);
5730 newrhs = build_binary_op (modifycode, lhs, rhs_tmp, 1);
5734 cp_error ("no match for `%Q(%#T, %#T)'", modifycode,
5735 TREE_TYPE (lhs), TREE_TYPE (rhs));
5736 return error_mark_node;
5741 lhs = stabilize_reference (lhs);
5742 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
5743 if (newrhs == error_mark_node)
5745 cp_error (" in evaluation of `%Q(%#T, %#T)'", modifycode,
5746 TREE_TYPE (lhs), TREE_TYPE (rhs));
5747 return error_mark_node;
5751 /* Handle a cast used as an "lvalue".
5752 We have already performed any binary operator using the value as cast.
5753 Now convert the result to the cast type of the lhs,
5754 and then true type of the lhs and store it there;
5755 then convert result back to the cast type to be the value
5756 of the assignment. */
5758 switch (TREE_CODE (lhs))
5763 case FIX_TRUNC_EXPR:
5764 case FIX_FLOOR_EXPR:
5765 case FIX_ROUND_EXPR:
5767 if (TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
5768 || TREE_CODE (TREE_TYPE (newrhs)) == FUNCTION_TYPE
5769 || TREE_CODE (TREE_TYPE (newrhs)) == METHOD_TYPE
5770 || TREE_CODE (TREE_TYPE (newrhs)) == OFFSET_TYPE)
5771 newrhs = default_conversion (newrhs);
5773 tree inner_lhs = TREE_OPERAND (lhs, 0);
5776 /* WP 5.4.1: The result is an lvalue if T is a reference type,
5777 otherwise the result is an rvalue. */
5778 if (! lvalue_p (lhs))
5779 pedwarn ("ANSI C++ forbids cast to non-reference type used as lvalue");
5781 result = build_modify_expr (inner_lhs, NOP_EXPR,
5782 convert (TREE_TYPE (inner_lhs),
5783 convert (lhstype, newrhs)));
5784 if (result == error_mark_node)
5786 return convert (TREE_TYPE (lhs), result);
5790 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
5791 Reject anything strange now. */
5793 if (!lvalue_or_else (lhs, "assignment"))
5794 return error_mark_node;
5796 GNU_xref_assign (lhs);
5798 /* Warn about storing in something that is `const'. */
5799 /* For C++, don't warn if this is initialization. */
5800 if (modifycode != INIT_EXPR
5801 /* For assignment to `const' signature pointer/reference fields,
5802 don't warn either, we already printed a better message before. */
5803 && ! (TREE_CODE (lhs) == COMPONENT_REF
5804 && (IS_SIGNATURE_POINTER (TREE_TYPE (TREE_OPERAND (lhs, 0)))
5805 || IS_SIGNATURE_REFERENCE (TREE_TYPE (TREE_OPERAND (lhs, 0)))))
5806 && (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
5807 || ((TREE_CODE (lhstype) == RECORD_TYPE
5808 || TREE_CODE (lhstype) == UNION_TYPE)
5809 && C_TYPE_FIELDS_READONLY (lhstype))
5810 || (TREE_CODE (lhstype) == REFERENCE_TYPE
5811 && TYPE_READONLY (TREE_TYPE (lhstype)))))
5812 readonly_error (lhs, "assignment", 0);
5814 /* If storing into a structure or union member,
5815 it has probably been given type `int'.
5816 Compute the type that would go with
5817 the actual amount of storage the member occupies. */
5819 if (TREE_CODE (lhs) == COMPONENT_REF
5820 && (TREE_CODE (lhstype) == INTEGER_TYPE
5821 || TREE_CODE (lhstype) == REAL_TYPE
5822 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
5824 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
5826 /* If storing in a field that is in actuality a short or narrower
5827 than one, we must store in the field in its actual type. */
5829 if (lhstype != TREE_TYPE (lhs))
5831 lhs = copy_node (lhs);
5832 TREE_TYPE (lhs) = lhstype;
5836 /* check to see if there is an assignment to `this' */
5837 if (lhs == current_class_ptr)
5839 if (flag_this_is_variable > 0
5840 && DECL_NAME (current_function_decl) != NULL_TREE
5841 && (DECL_NAME (current_function_decl)
5842 != constructor_name (current_class_type)))
5843 warning ("assignment to `this' not in constructor or destructor");
5844 current_function_just_assigned_this = 1;
5847 /* The TREE_TYPE of RHS may be TYPE_UNKNOWN. This can happen
5848 when the type of RHS is not yet known, i.e. its type
5849 is inherited from LHS. */
5850 rhs = require_instantiated_type (lhstype, newrhs, error_mark_node);
5851 if (rhs == error_mark_node)
5852 return error_mark_node;
5855 if (modifycode != INIT_EXPR)
5857 /* Make modifycode now either a NOP_EXPR or an INIT_EXPR. */
5858 modifycode = NOP_EXPR;
5859 /* Reference-bashing */
5860 if (TREE_CODE (lhstype) == REFERENCE_TYPE)
5862 tree tmp = convert_from_reference (lhs);
5863 lhstype = TREE_TYPE (tmp);
5864 if (TYPE_SIZE (lhstype) == 0)
5866 incomplete_type_error (lhs, lhstype);
5867 return error_mark_node;
5872 if (TREE_CODE (TREE_TYPE (newrhs)) == REFERENCE_TYPE)
5874 tree tmp = convert_from_reference (newrhs);
5875 if (TYPE_SIZE (TREE_TYPE (tmp)) == 0)
5877 incomplete_type_error (newrhs, TREE_TYPE (tmp));
5878 return error_mark_node;
5884 if (TREE_SIDE_EFFECTS (lhs))
5885 lhs = stabilize_reference (lhs);
5886 if (TREE_SIDE_EFFECTS (newrhs))
5887 newrhs = stabilize_reference (newrhs);
5889 /* Convert new value to destination type. */
5891 if (TREE_CODE (lhstype) == ARRAY_TYPE)
5895 if (! comptypes (lhstype, TREE_TYPE (rhs), 0))
5897 cp_error ("incompatible types in assignment of `%T' to `%T'",
5898 TREE_TYPE (rhs), lhstype);
5899 return error_mark_node;
5902 /* Allow array assignment in compiler-generated code. */
5903 if (pedantic && ! DECL_ARTIFICIAL (current_function_decl))
5904 pedwarn ("ANSI C++ forbids assignment of arrays");
5906 /* Have to wrap this in RTL_EXPR for two cases:
5907 in base or member initialization and if we
5908 are a branch of a ?: operator. Since we
5909 can't easily know the latter, just do it always. */
5911 result = make_node (RTL_EXPR);
5913 TREE_TYPE (result) = void_type_node;
5914 do_pending_stack_adjust ();
5915 start_sequence_for_rtl_expr (result);
5917 /* As a matter of principle, `start_sequence' should do this. */
5920 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
5921 ? 1 + (modifycode != INIT_EXPR): 0;
5922 expand_vec_init (lhs, lhs, array_type_nelts (lhstype), newrhs,
5925 do_pending_stack_adjust ();
5927 TREE_SIDE_EFFECTS (result) = 1;
5928 RTL_EXPR_SEQUENCE (result) = get_insns ();
5929 RTL_EXPR_RTL (result) = const0_rtx;
5934 if (modifycode == INIT_EXPR)
5936 newrhs = convert_for_initialization (lhs, lhstype, newrhs, LOOKUP_NORMAL,
5937 "assignment", NULL_TREE, 0);
5938 if (lhs == DECL_RESULT (current_function_decl))
5940 if (DECL_INITIAL (lhs))
5941 warning ("return value from function receives multiple initializations");
5942 DECL_INITIAL (lhs) = newrhs;
5947 /* Avoid warnings on enum bit fields. */
5948 if (TREE_CODE (olhstype) == ENUMERAL_TYPE
5949 && TREE_CODE (lhstype) == INTEGER_TYPE)
5951 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
5953 newrhs = convert_force (lhstype, newrhs, 0);
5956 newrhs = convert_for_assignment (lhstype, newrhs, "assignment",
5958 if (TREE_CODE (newrhs) == CALL_EXPR
5959 && TYPE_NEEDS_CONSTRUCTING (lhstype))
5960 newrhs = build_cplus_new (lhstype, newrhs);
5962 /* Can't initialize directly from a TARGET_EXPR, since that would
5963 cause the lhs to be constructed twice, and possibly result in
5964 accidental self-initialization. So we force the TARGET_EXPR to be
5965 expanded without a target. */
5966 if (TREE_CODE (newrhs) == TARGET_EXPR)
5967 newrhs = build (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
5968 TREE_OPERAND (newrhs, 0));
5971 if (newrhs == error_mark_node)
5972 return error_mark_node;
5974 if (TREE_CODE (newrhs) == COND_EXPR)
5977 tree cond = TREE_OPERAND (newrhs, 0);
5979 if (TREE_SIDE_EFFECTS (lhs))
5980 cond = build_compound_expr (tree_cons
5982 build_tree_list (NULL_TREE, cond)));
5984 /* Cannot have two identical lhs on this one tree (result) as preexpand
5985 calls will rip them out and fill in RTL for them, but when the
5986 rtl is generated, the calls will only be in the first side of the
5987 condition, not on both, or before the conditional jump! (mrs) */
5988 lhs1 = break_out_calls (lhs);
5991 /* If there's no change, the COND_EXPR behaves like any other rhs. */
5992 result = build (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
5993 lhstype, lhs, newrhs);
5996 tree result_type = TREE_TYPE (newrhs);
5997 /* We have to convert each arm to the proper type because the
5998 types may have been munged by constant folding. */
6000 = build (COND_EXPR, result_type, cond,
6001 build_modify_expr (lhs, modifycode,
6002 convert (result_type,
6003 TREE_OPERAND (newrhs, 1))),
6004 build_modify_expr (lhs1, modifycode,
6005 convert (result_type,
6006 TREE_OPERAND (newrhs, 2))));
6010 result = build (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6011 lhstype, lhs, newrhs);
6013 TREE_SIDE_EFFECTS (result) = 1;
6015 /* If we got the LHS in a different type for storing in,
6016 convert the result back to the nominal type of LHS
6017 so that the value we return always has the same type
6018 as the LHS argument. */
6020 if (olhstype == TREE_TYPE (result))
6022 /* Avoid warnings converting integral types back into enums
6023 for enum bit fields. */
6024 if (TREE_CODE (TREE_TYPE (result)) == INTEGER_TYPE
6025 && TREE_CODE (olhstype) == ENUMERAL_TYPE)
6027 result = build (COMPOUND_EXPR, olhstype, result, olhs);
6028 TREE_NO_UNUSED_WARNING (result) = 1;
6031 return convert_for_assignment (olhstype, result, "assignment",
6036 build_x_modify_expr (lhs, modifycode, rhs)
6038 enum tree_code modifycode;
6041 if (processing_template_decl)
6042 return build_min_nt (MODOP_EXPR, lhs,
6043 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6045 if (modifycode != NOP_EXPR)
6047 tree rval = build_opfncall (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6048 make_node (modifycode));
6052 return build_modify_expr (lhs, modifycode, rhs);
6055 /* Return 0 if EXP is not a valid lvalue in this language
6056 even though `lvalue_or_else' would accept it. */
6059 language_lvalue_valid (exp)
6065 /* Get difference in deltas for different pointer to member function
6066 types. Return integer_zero_node, if FROM cannot be converted to a
6067 TO type. If FORCE is true, then allow reverse conversions as well. */
6070 get_delta_difference (from, to, force)
6074 tree delta = integer_zero_node;
6080 /* Should get_base_distance here, so we can check if any thing along the
6081 path is virtual, and we need to make sure we stay
6082 inside the real binfos when going through virtual bases.
6083 Maybe we should replace virtual bases with
6084 binfo_member (...CLASSTYPE_VBASECLASSES...)... (mrs) */
6085 binfo = get_binfo (from, to, 1);
6086 if (binfo == error_mark_node)
6088 error (" in pointer to member function conversiona");
6095 error_not_base_type (from, to);
6096 error (" in pointer to member conversion");
6099 binfo = get_binfo (to, from, 1);
6100 if (binfo == error_mark_node)
6103 error (" in pointer to member conversion");
6109 cp_error ("cannot convert pointer to member of type %T to unrelated pointer to member of type %T", from, to);
6112 if (TREE_VIA_VIRTUAL (binfo))
6114 binfo = binfo_member (BINFO_TYPE (binfo),
6115 CLASSTYPE_VBASECLASSES (from));
6116 warning ("pointer to member conversion to virtual base class will only work if you are very careful");
6118 delta = BINFO_OFFSET (binfo);
6119 delta = convert (ptrdiff_type_node, delta);
6121 return build_binary_op (MINUS_EXPR,
6125 if (TREE_VIA_VIRTUAL (binfo))
6127 warning ("pointer to member conversion from virtual base class will only work if you are very careful");
6129 return BINFO_OFFSET (binfo);
6133 build_ptrmemfunc1 (type, delta, idx, pfn, delta2)
6134 tree type, delta, idx, pfn, delta2;
6139 /* This is the old way we did it. We want to avoid calling
6140 digest_init, so that it can give an error if we use { } when
6141 initializing a pointer to member function. */
6145 u = build_nt (CONSTRUCTOR, NULL_TREE,
6146 tree_cons (pfn_identifier, pfn, NULL_TREE));
6150 u = build_nt (CONSTRUCTOR, NULL_TREE,
6151 tree_cons (delta2_identifier, delta2, NULL_TREE));
6154 u = build_nt (CONSTRUCTOR, NULL_TREE,
6155 tree_cons (NULL_TREE, delta,
6156 tree_cons (NULL_TREE, idx,
6157 tree_cons (NULL_TREE, u, NULL_TREE))));
6159 return digest_init (type, u, (tree*)0);
6161 tree delta_field, idx_field, pfn_or_delta2_field, pfn_field, delta2_field;
6163 int allconstant, allsimple;
6165 delta_field = TYPE_FIELDS (type);
6166 idx_field = TREE_CHAIN (delta_field);
6167 pfn_or_delta2_field = TREE_CHAIN (idx_field);
6168 subtype = TREE_TYPE (pfn_or_delta2_field);
6169 pfn_field = TYPE_FIELDS (subtype);
6170 delta2_field = TREE_CHAIN (pfn_field);
6174 allconstant = TREE_CONSTANT (pfn);
6175 allsimple = initializer_constant_valid_p (pfn, TREE_TYPE (pfn));
6176 u = tree_cons (pfn_field, pfn, NULL_TREE);
6180 delta2 = convert_and_check (delta_type_node, delta2);
6181 allconstant = TREE_CONSTANT (delta2);
6182 allsimple = initializer_constant_valid_p (delta2, TREE_TYPE (delta2));
6183 u = tree_cons (delta2_field, delta2, NULL_TREE);
6186 delta = convert_and_check (delta_type_node, delta);
6187 idx = convert_and_check (delta_type_node, idx);
6189 allconstant = allconstant && TREE_CONSTANT (delta) && TREE_CONSTANT (idx);
6190 allsimple = allsimple
6191 && initializer_constant_valid_p (delta, TREE_TYPE (delta))
6192 && initializer_constant_valid_p (idx, TREE_TYPE (idx));
6194 u = build (CONSTRUCTOR, subtype, NULL_TREE, u);
6195 u = tree_cons (delta_field, delta,
6196 tree_cons (idx_field, idx,
6197 tree_cons (pfn_or_delta2_field, u, NULL_TREE)));
6198 u = build (CONSTRUCTOR, type, NULL_TREE, u);
6199 TREE_CONSTANT (u) = allconstant;
6200 TREE_STATIC (u) = allconstant && allsimple;
6205 /* Build a constructor for a pointer to member function. It can be
6206 used to initialize global variables, local variable, or used
6207 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6210 If FORCE is non-zero, then force this conversion, even if
6211 we would rather not do it. Usually set when using an explicit
6214 Return error_mark_node, if something goes wrong. */
6217 build_ptrmemfunc (type, pfn, force)
6221 tree idx = integer_zero_node;
6222 tree delta = integer_zero_node;
6223 tree delta2 = integer_zero_node;
6225 tree npfn = NULL_TREE;
6227 /* Handle multiple conversions of pointer to member functions. */
6228 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (pfn)))
6230 tree ndelta, ndelta2;
6233 /* Is is already the right type? */
6234 if (type == TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn)))
6237 ndelta = convert (ptrdiff_type_node, build_component_ref (pfn, delta_identifier, NULL_TREE, 0));
6238 ndelta2 = convert (ptrdiff_type_node, DELTA2_FROM_PTRMEMFUNC (pfn));
6239 idx = build_component_ref (pfn, index_identifier, NULL_TREE, 0);
6241 n = get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn)))),
6242 TYPE_METHOD_BASETYPE (TREE_TYPE (type)),
6245 delta = build_binary_op (PLUS_EXPR, ndelta, n, 1);
6246 delta2 = build_binary_op (PLUS_EXPR, ndelta2, n, 1);
6247 e1 = fold (build (GT_EXPR, boolean_type_node, idx, integer_zero_node));
6249 e2 = build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type), delta, idx,
6252 pfn = PFN_FROM_PTRMEMFUNC (pfn);
6253 npfn = build1 (NOP_EXPR, type, pfn);
6254 TREE_CONSTANT (npfn) = TREE_CONSTANT (pfn);
6256 e3 = build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type), delta, idx, npfn,
6258 return build_conditional_expr (e1, e2, e3);
6261 /* Handle null pointer to member function conversions. */
6262 if (integer_zerop (pfn))
6264 pfn = build_c_cast (type, integer_zero_node);
6265 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type),
6266 integer_zero_node, integer_zero_node,
6270 if (TREE_CODE (pfn) == TREE_LIST
6271 || (TREE_CODE (pfn) == ADDR_EXPR
6272 && TREE_CODE (TREE_OPERAND (pfn, 0)) == TREE_LIST))
6273 return instantiate_type (type, pfn, 1);
6275 /* Allow pointer to member conversions here. */
6276 delta = get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (TREE_TYPE (pfn))),
6277 TYPE_METHOD_BASETYPE (TREE_TYPE (type)),
6279 delta2 = build_binary_op (PLUS_EXPR, delta2, delta, 1);
6282 /* We need to check the argument types to see if they are compatible
6283 (any const or volatile violations. */
6284 something like this:
6285 comptype (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (type))),
6286 TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (pfn)))), ?);
6289 if (TREE_CODE (TREE_OPERAND (pfn, 0)) != FUNCTION_DECL)
6290 warning ("assuming pointer to member function is non-virtual");
6292 if (TREE_CODE (TREE_OPERAND (pfn, 0)) == FUNCTION_DECL
6293 && DECL_VINDEX (TREE_OPERAND (pfn, 0)))
6295 /* Find the offset to the vfield pointer in the object. */
6296 vfield_offset = get_binfo (DECL_CONTEXT (TREE_OPERAND (pfn, 0)),
6297 DECL_CLASS_CONTEXT (TREE_OPERAND (pfn, 0)),
6299 vfield_offset = get_vfield_offset (vfield_offset);
6300 delta2 = size_binop (PLUS_EXPR, vfield_offset, delta2);
6302 /* Map everything down one to make room for the null pointer to member. */
6303 idx = size_binop (PLUS_EXPR,
6304 DECL_VINDEX (TREE_OPERAND (pfn, 0)),
6309 idx = size_binop (MINUS_EXPR, integer_zero_node, integer_one_node);
6311 if (type == TREE_TYPE (pfn))
6317 npfn = build1 (NOP_EXPR, type, pfn);
6318 TREE_CONSTANT (npfn) = TREE_CONSTANT (pfn);
6322 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type), delta, idx, npfn, delta2);
6325 /* Convert value RHS to type TYPE as preparation for an assignment
6326 to an lvalue of type TYPE.
6327 The real work of conversion is done by `convert'.
6328 The purpose of this function is to generate error messages
6329 for assignments that are not allowed in C.
6330 ERRTYPE is a string to use in error messages:
6331 "assignment", "return", etc.
6333 C++: attempts to allow `convert' to find conversions involving
6334 implicit type conversion between aggregate and scalar types
6335 as per 8.5.6 of C++ manual. Does not randomly dereference
6336 pointers to aggregates! */
6339 convert_for_assignment (type, rhs, errtype, fndecl, parmnum)
6345 register enum tree_code codel = TREE_CODE (type);
6346 register tree rhstype;
6347 register enum tree_code coder = TREE_CODE (TREE_TYPE (rhs));
6349 if (coder == UNKNOWN_TYPE)
6350 rhs = instantiate_type (type, rhs, 1);
6352 if (coder == ERROR_MARK)
6353 return error_mark_node;
6355 if (codel == OFFSET_TYPE)
6357 type = TREE_TYPE (type);
6358 codel = TREE_CODE (type);
6361 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6362 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6363 rhs = TREE_OPERAND (rhs, 0);
6365 if (rhs == error_mark_node)
6366 return error_mark_node;
6368 if (TREE_VALUE (rhs) == error_mark_node)
6369 return error_mark_node;
6371 if (TREE_CODE (TREE_TYPE (rhs)) == OFFSET_TYPE)
6373 rhs = resolve_offset_ref (rhs);
6374 if (rhs == error_mark_node)
6375 return error_mark_node;
6376 rhstype = TREE_TYPE (rhs);
6377 coder = TREE_CODE (rhstype);
6380 if (TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6381 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6382 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6383 rhs = default_conversion (rhs);
6384 else if (TREE_CODE (TREE_TYPE (rhs)) == REFERENCE_TYPE)
6385 rhs = convert_from_reference (rhs);
6387 rhstype = TREE_TYPE (rhs);
6388 coder = TREE_CODE (rhstype);
6390 /* This should no longer change types on us. */
6391 if (TREE_CODE (rhs) == CONST_DECL)
6392 rhs = DECL_INITIAL (rhs);
6393 else if (TREE_READONLY_DECL_P (rhs))
6394 rhs = decl_constant_value (rhs);
6396 if (type == rhstype)
6398 overflow_warning (rhs);
6402 if (coder == VOID_TYPE)
6404 error ("void value not ignored as it ought to be");
6405 return error_mark_node;
6407 /* Arithmetic types all interconvert. */
6408 if ((codel == INTEGER_TYPE || codel == REAL_TYPE || codel == BOOLEAN_TYPE)
6409 && (coder == INTEGER_TYPE || coder == REAL_TYPE || coder == BOOLEAN_TYPE))
6411 /* But we should warn if assigning REAL_TYPE to INTEGER_TYPE. */
6412 if (coder == REAL_TYPE && codel == INTEGER_TYPE)
6415 cp_warning ("`%T' used for argument %P of `%D'",
6416 rhstype, parmnum, fndecl);
6418 cp_warning ("%s to `%T' from `%T'", errtype, type, rhstype);
6420 /* And we should warn if assigning a negative value to
6421 an unsigned variable. */
6422 else if (TREE_UNSIGNED (type) && codel != BOOLEAN_TYPE)
6424 if (TREE_CODE (rhs) == INTEGER_CST
6425 && TREE_NEGATED_INT (rhs))
6428 cp_warning ("negative value `%E' passed as argument %P of `%D'",
6429 rhs, parmnum, fndecl);
6431 cp_warning ("%s of negative value `%E' to `%T'",
6432 errtype, rhs, type);
6434 overflow_warning (rhs);
6435 if (TREE_CONSTANT (rhs))
6439 return convert_and_check (type, rhs);
6441 /* Conversions involving enums. */
6442 else if ((codel == ENUMERAL_TYPE
6443 && (INTEGRAL_CODE_P (coder) || coder == REAL_TYPE))
6444 || (coder == ENUMERAL_TYPE
6445 && (INTEGRAL_CODE_P (codel) || codel == REAL_TYPE)))
6447 return cp_convert (type, rhs, CONV_IMPLICIT, LOOKUP_NORMAL);
6449 /* Conversions among pointers */
6450 else if (codel == POINTER_TYPE
6451 && (coder == POINTER_TYPE
6452 || (coder == RECORD_TYPE
6453 && (IS_SIGNATURE_POINTER (rhstype)
6454 || IS_SIGNATURE_REFERENCE (rhstype)))))
6456 register tree ttl = TREE_TYPE (type);
6460 if (coder == RECORD_TYPE)
6462 rhs = build_optr_ref (rhs);
6463 rhstype = TREE_TYPE (rhs);
6465 ttr = TREE_TYPE (rhstype);
6467 /* If both pointers are of aggregate type, then we
6468 can give better error messages, and save some work
6470 if (TREE_CODE (ttl) == RECORD_TYPE && TREE_CODE (ttr) == RECORD_TYPE)
6474 if (TYPE_MAIN_VARIANT (ttl) == TYPE_MAIN_VARIANT (ttr)
6475 || type == class_star_type_node
6476 || rhstype == class_star_type_node)
6477 binfo = TYPE_BINFO (ttl);
6479 binfo = get_binfo (ttl, ttr, 1);
6481 if (binfo == error_mark_node)
6482 return error_mark_node;
6484 return error_not_base_type (ttl, ttr);
6486 if (! TYPE_READONLY (ttl) && TYPE_READONLY (ttr))
6489 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6490 rhstype, parmnum, fndecl);
6492 cp_pedwarn ("%s to `%T' from `%T' discards const",
6493 errtype, type, rhstype);
6495 if (! TYPE_VOLATILE (ttl) && TYPE_VOLATILE (ttr))
6498 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6499 rhstype, parmnum, fndecl);
6501 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6502 errtype, type, rhstype);
6506 /* Any non-function converts to a [const][volatile] void *
6507 and vice versa; otherwise, targets must be the same.
6508 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
6509 else if (TYPE_MAIN_VARIANT (ttl) == void_type_node
6510 || TYPE_MAIN_VARIANT (ttr) == void_type_node
6511 || (ctt = comp_target_types (type, rhstype, 1))
6512 || (unsigned_type (TYPE_MAIN_VARIANT (ttl))
6513 == unsigned_type (TYPE_MAIN_VARIANT (ttr))))
6515 /* ARM $4.8, commentary on p39. */
6516 if (TYPE_MAIN_VARIANT (ttl) == void_type_node
6517 && TREE_CODE (ttr) == OFFSET_TYPE)
6519 cp_error ("no standard conversion from `%T' to `void *'", ttr);
6520 return error_mark_node;
6523 if (ctt < 0 && TYPE_MAIN_VARIANT (ttl) != TYPE_MAIN_VARIANT (ttr))
6524 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6527 if (TYPE_MAIN_VARIANT (ttl) != void_type_node
6528 && TYPE_MAIN_VARIANT (ttr) == void_type_node
6529 && ! null_ptr_cst_p (rhs))
6531 if (coder == RECORD_TYPE)
6532 cp_pedwarn ("implicit conversion of signature pointer to type `%T'",
6535 pedwarn ("ANSI C++ forbids implicit conversion from `void *' in %s",
6538 /* Const and volatile mean something different for function types,
6539 so the usual warnings are not appropriate. */
6540 else if ((TREE_CODE (ttr) != FUNCTION_TYPE && TREE_CODE (ttr) != METHOD_TYPE)
6541 || (TREE_CODE (ttl) != FUNCTION_TYPE && TREE_CODE (ttl) != METHOD_TYPE))
6543 if (TREE_CODE (ttl) == OFFSET_TYPE
6544 && binfo_member (TYPE_OFFSET_BASETYPE (ttr),
6545 CLASSTYPE_VBASECLASSES (TYPE_OFFSET_BASETYPE (ttl))))
6547 sorry ("%s between pointer to members converting across virtual baseclasses", errtype);
6548 return error_mark_node;
6550 else if (! TYPE_READONLY (ttl) && TYPE_READONLY (ttr))
6553 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6554 rhstype, parmnum, fndecl);
6556 cp_pedwarn ("%s to `%T' from `%T' discards const",
6557 errtype, type, rhstype);
6559 else if (! TYPE_VOLATILE (ttl) && TYPE_VOLATILE (ttr))
6562 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6563 rhstype, parmnum, fndecl);
6565 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6566 errtype, type, rhstype);
6568 else if (TREE_CODE (ttl) == TREE_CODE (ttr)
6569 && ! comp_target_types (type, rhstype, 1))
6572 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signedness",
6573 rhstype, parmnum, fndecl);
6575 cp_pedwarn ("%s to `%T' from `%T' changes signedness",
6576 errtype, type, rhstype);
6582 int add_quals = 0, const_parity = 0, volatile_parity = 0;
6584 int unsigned_parity;
6587 /* This code is basically a duplicate of comp_ptr_ttypes_real. */
6588 for (; ; ttl = TREE_TYPE (ttl), ttr = TREE_TYPE (ttr))
6591 const_parity |= (TYPE_READONLY (ttl) < TYPE_READONLY (ttr));
6592 volatile_parity |= (TYPE_VOLATILE (ttl) < TYPE_VOLATILE (ttr));
6595 && (TYPE_READONLY (ttl) > TYPE_READONLY (ttr)
6596 || TYPE_VOLATILE (ttl) > TYPE_VOLATILE (ttr)))
6598 left_const &= TYPE_READONLY (ttl);
6600 if (TREE_CODE (ttl) != POINTER_TYPE
6601 || TREE_CODE (ttr) != POINTER_TYPE)
6604 unsigned_parity = TREE_UNSIGNED (ttl) - TREE_UNSIGNED (ttr);
6605 if (unsigned_parity)
6607 if (TREE_UNSIGNED (ttl))
6608 ttr = unsigned_type (ttr);
6610 ttl = unsigned_type (ttl);
6613 if (comp_target_types (ttl, ttr, nptrs) > 0)
6618 cp_pedwarn ("passing `%T' as argument %P of `%D' adds cv-quals without intervening `const'",
6619 rhstype, parmnum, fndecl);
6621 cp_pedwarn ("%s to `%T' from `%T' adds cv-quals without intervening `const'",
6622 errtype, type, rhstype);
6627 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6628 rhstype, parmnum, fndecl);
6630 cp_pedwarn ("%s to `%T' from `%T' discards const",
6631 errtype, type, rhstype);
6633 if (volatile_parity)
6636 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6637 rhstype, parmnum, fndecl);
6639 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6640 errtype, type, rhstype);
6642 if (unsigned_parity > 0)
6645 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signed to unsigned",
6646 rhstype, parmnum, fndecl);
6648 cp_pedwarn ("%s to `%T' from `%T' changes signed to unsigned",
6649 errtype, type, rhstype);
6651 else if (unsigned_parity < 0)
6654 cp_pedwarn ("passing `%T' as argument %P of `%D' changes unsigned to signed",
6655 rhstype, parmnum, fndecl);
6657 cp_pedwarn ("%s to `%T' from `%T' changes unsigned to signed",
6658 errtype, type, rhstype);
6661 /* C++ is not so friendly about converting function and
6662 member function pointers as C. Emit warnings here. */
6663 if (TREE_CODE (ttl) == FUNCTION_TYPE
6664 || TREE_CODE (ttl) == METHOD_TYPE)
6665 if (! comptypes (ttl, ttr, 0))
6667 warning ("conflicting function types in %s:", errtype);
6668 cp_warning ("\t`%T' != `%T'", type, rhstype);
6674 cp_error ("passing `%T' as argument %P of `%D'",
6675 rhstype, parmnum, fndecl);
6677 cp_error ("%s to `%T' from `%T'", errtype, type, rhstype);
6678 return error_mark_node;
6681 return convert (type, rhs);
6683 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
6685 /* An explicit constant 0 can convert to a pointer,
6686 but not a 0 that results from casting or folding. */
6687 if (! (TREE_CODE (rhs) == INTEGER_CST && integer_zerop (rhs)))
6690 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6691 rhstype, parmnum, fndecl);
6693 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6694 errtype, type, rhstype);
6696 return convert (type, rhs);
6698 else if (codel == INTEGER_TYPE
6699 && (coder == POINTER_TYPE
6700 || (coder == RECORD_TYPE
6701 && (IS_SIGNATURE_POINTER (rhstype)
6702 || TYPE_PTRMEMFUNC_FLAG (rhstype)
6703 || IS_SIGNATURE_REFERENCE (rhstype)))))
6706 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6707 rhstype, parmnum, fndecl);
6709 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6710 errtype, type, rhstype);
6711 return convert (type, rhs);
6713 else if (codel == BOOLEAN_TYPE
6714 && (coder == POINTER_TYPE
6715 || (coder == RECORD_TYPE
6716 && (IS_SIGNATURE_POINTER (rhstype)
6717 || TYPE_PTRMEMFUNC_FLAG (rhstype)
6718 || IS_SIGNATURE_REFERENCE (rhstype)))))
6719 return convert (type, rhs);
6722 else if (((coder == POINTER_TYPE
6723 && TREE_CODE (TREE_TYPE (rhstype)) == METHOD_TYPE)
6724 || integer_zerop (rhs)
6725 || TYPE_PTRMEMFUNC_P (rhstype))
6726 && TYPE_PTRMEMFUNC_P (type))
6728 tree ttl = TYPE_PTRMEMFUNC_FN_TYPE (type);
6729 tree ttr = (TREE_CODE (rhstype) == POINTER_TYPE ? rhstype
6730 : TYPE_PTRMEMFUNC_FN_TYPE (type));
6731 int ctt = comp_target_types (ttl, ttr, 1);
6734 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6737 cp_error ("%s to `%T' from `%T'", errtype, ttl, ttr);
6739 /* compatible pointer to member functions. */
6740 return build_ptrmemfunc (ttl, rhs, 0);
6742 else if (codel == ERROR_MARK || coder == ERROR_MARK)
6743 return error_mark_node;
6745 /* This should no longer happen. References are initialized via
6746 `convert_for_initialization'. They should otherwise be
6747 bashed before coming here. */
6748 else if (codel == REFERENCE_TYPE)
6749 my_friendly_abort (317);
6750 else if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (TREE_TYPE (rhs)))
6752 tree nrhs = build1 (NOP_EXPR, type, rhs);
6753 TREE_CONSTANT (nrhs) = TREE_CONSTANT (rhs);
6756 else if (TYPE_HAS_CONSTRUCTOR (type) || IS_AGGR_TYPE (TREE_TYPE (rhs)))
6757 return convert (type, rhs);
6758 /* Handle anachronistic conversions from (::*)() to cv void* or (*)(). */
6759 else if (TREE_CODE (type) == POINTER_TYPE
6760 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6761 || TYPE_MAIN_VARIANT (TREE_TYPE (type)) == void_type_node)
6763 && TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
6764 return convert (type, rhs);
6766 cp_error ("%s to `%T' from `%T'", errtype, type, rhstype);
6767 return error_mark_node;
6770 /* Convert RHS to be of type TYPE. If EXP is non-zero,
6771 it is the target of the initialization.
6772 ERRTYPE is a string to use in error messages.
6774 Two major differences between the behavior of
6775 `convert_for_assignment' and `convert_for_initialization'
6776 are that references are bashed in the former, while
6777 copied in the latter, and aggregates are assigned in
6778 the former (operator=) while initialized in the
6781 If using constructor make sure no conversion operator exists, if one does
6782 exist, an ambiguity exists.
6784 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6787 convert_for_initialization (exp, type, rhs, flags, errtype, fndecl, parmnum)
6788 tree exp, type, rhs;
6794 register enum tree_code codel = TREE_CODE (type);
6795 register tree rhstype;
6796 register enum tree_code coder;
6798 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6799 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6800 if (TREE_CODE (rhs) == NOP_EXPR
6801 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6802 && codel != REFERENCE_TYPE)
6803 rhs = TREE_OPERAND (rhs, 0);
6805 if (rhs == error_mark_node
6806 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6807 return error_mark_node;
6809 if (TREE_CODE (TREE_TYPE (rhs)) == OFFSET_TYPE)
6811 rhs = resolve_offset_ref (rhs);
6812 if (rhs == error_mark_node)
6813 return error_mark_node;
6816 if (TREE_CODE (TREE_TYPE (rhs)) == REFERENCE_TYPE)
6817 rhs = convert_from_reference (rhs);
6819 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6820 && TREE_CODE (type) != ARRAY_TYPE
6821 && (TREE_CODE (type) != REFERENCE_TYPE
6822 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6823 || TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6824 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6825 rhs = default_conversion (rhs);
6827 rhstype = TREE_TYPE (rhs);
6828 coder = TREE_CODE (rhstype);
6830 if (coder == UNKNOWN_TYPE)
6832 rhs = instantiate_type (type, rhs, 1);
6833 rhstype = TREE_TYPE (rhs);
6834 coder = TREE_CODE (rhstype);
6837 if (coder == ERROR_MARK)
6838 return error_mark_node;
6840 /* We accept references to incomplete types, so we can
6841 return here before checking if RHS is of complete type. */
6843 if (codel == REFERENCE_TYPE)
6845 /* This should eventually happen in convert_arguments. */
6846 extern int warningcount, errorcount;
6850 savew = warningcount, savee = errorcount;
6851 rhs = convert_to_reference (type, rhs, CONV_IMPLICIT, flags,
6852 exp ? exp : error_mark_node);
6855 if (warningcount > savew)
6856 cp_warning_at ("in passing argument %P of `%+D'", parmnum, fndecl);
6857 else if (errorcount > savee)
6858 cp_error_at ("in passing argument %P of `%+D'", parmnum, fndecl);
6863 rhs = require_complete_type (rhs);
6864 if (rhs == error_mark_node)
6865 return error_mark_node;
6867 if (exp != 0) exp = require_complete_type (exp);
6868 if (exp == error_mark_node)
6869 return error_mark_node;
6871 if (TREE_CODE (rhstype) == REFERENCE_TYPE)
6872 rhstype = TREE_TYPE (rhstype);
6874 type = complete_type (type);
6876 if (TYPE_LANG_SPECIFIC (type)
6877 && (IS_SIGNATURE_POINTER (type) || IS_SIGNATURE_REFERENCE (type)))
6878 return build_signature_pointer_constructor (type, rhs);
6880 if (IS_AGGR_TYPE (type)
6881 && (TYPE_NEEDS_CONSTRUCTING (type) || TREE_HAS_CONSTRUCTOR (rhs)))
6883 if (flag_ansi_overloading)
6884 return cp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
6886 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
6888 /* This is sufficient to perform initialization. No need,
6889 apparently, to go through X(X&) to do first-cut
6890 initialization. Return through a TARGET_EXPR so that we get
6891 cleanups if it is used. */
6892 if (TREE_CODE (rhs) == CALL_EXPR)
6894 rhs = build_cplus_new (type, rhs);
6897 /* Handle the case of default parameter initialization and
6898 initialization of static variables. */
6899 else if (TREE_CODE (rhs) == TARGET_EXPR)
6901 else if (TREE_CODE (rhs) == INDIRECT_REF && TREE_HAS_CONSTRUCTOR (rhs))
6903 my_friendly_assert (TREE_CODE (TREE_OPERAND (rhs, 0)) == CALL_EXPR, 318);
6906 my_friendly_assert (TREE_VALUE (TREE_OPERAND (TREE_OPERAND (rhs, 0), 1)) == NULL_TREE, 316);
6907 TREE_VALUE (TREE_OPERAND (TREE_OPERAND (rhs, 0), 1))
6908 = build_unary_op (ADDR_EXPR, exp, 0);
6911 rhs = build_cplus_new (type, TREE_OPERAND (rhs, 0));
6914 else if (TYPE_HAS_TRIVIAL_INIT_REF (type))
6917 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype)
6918 || (IS_AGGR_TYPE (rhstype) && UNIQUELY_DERIVED_FROM_P (type, rhstype)))
6920 if (TYPE_HAS_INIT_REF (type))
6922 tree init = build_method_call (exp, ctor_identifier,
6923 build_tree_list (NULL_TREE, rhs),
6924 TYPE_BINFO (type), LOOKUP_NORMAL);
6926 if (init == error_mark_node)
6927 return error_mark_node;
6931 exp = build_cplus_new (type, init);
6935 return build (COMPOUND_EXPR, type, init, exp);
6938 /* ??? The following warnings are turned off because
6939 this is another place where the default X(X&) constructor
6941 if (TYPE_HAS_ASSIGNMENT (type))
6942 cp_warning ("bitwise copy: `%T' defines operator=", type);
6944 if (TREE_CODE (TREE_TYPE (rhs)) == REFERENCE_TYPE)
6945 rhs = convert_from_reference (rhs);
6946 if (type != rhstype)
6948 tree nrhs = build1 (NOP_EXPR, type, rhs);
6949 TREE_CONSTANT (nrhs) = TREE_CONSTANT (rhs);
6955 return cp_convert (type, rhs, CONV_OLD_CONVERT,
6956 flags | LOOKUP_NO_CONVERSION);
6959 if (type == TREE_TYPE (rhs))
6961 if (TREE_READONLY_DECL_P (rhs))
6962 rhs = decl_constant_value (rhs);
6966 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum);
6969 /* Expand an ASM statement with operands, handling output operands
6970 that are not variables or INDIRECT_REFS by transforming such
6971 cases into cases that expand_asm_operands can handle.
6973 Arguments are same as for expand_asm_operands.
6975 We don't do default conversions on all inputs, because it can screw
6976 up operands that are expected to be in memory. */
6979 c_expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line)
6980 tree string, outputs, inputs, clobbers;
6985 int noutputs = list_length (outputs);
6987 /* o[I] is the place that output number I should be written. */
6988 register tree *o = (tree *) alloca (noutputs * sizeof (tree));
6991 /* Record the contents of OUTPUTS before it is modified. */
6992 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
6993 o[i] = TREE_VALUE (tail);
6995 /* Generate the ASM_OPERANDS insn;
6996 store into the TREE_VALUEs of OUTPUTS some trees for
6997 where the values were actually stored. */
6998 expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line);
7000 /* Copy all the intermediate outputs into the specified outputs. */
7001 for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++)
7003 if (o[i] != TREE_VALUE (tail))
7005 expand_expr (build_modify_expr (o[i], NOP_EXPR, TREE_VALUE (tail)),
7006 const0_rtx, VOIDmode, 0);
7009 /* Detect modification of read-only values.
7010 (Otherwise done by build_modify_expr.) */
7013 tree type = TREE_TYPE (o[i]);
7014 if (TYPE_READONLY (type)
7015 || ((TREE_CODE (type) == RECORD_TYPE
7016 || TREE_CODE (type) == UNION_TYPE)
7017 && C_TYPE_FIELDS_READONLY (type)))
7018 readonly_error (o[i], "modification by `asm'", 1);
7022 /* Those MODIFY_EXPRs could do autoincrements. */
7026 /* Expand a C `return' statement.
7027 RETVAL is the expression for what to return,
7028 or a null pointer for `return;' with no value.
7030 C++: upon seeing a `return', we must call destructors on all
7031 variables in scope which had constructors called on them.
7032 This means that if in a destructor, the base class destructors
7033 must be called before returning.
7035 The RETURN statement in C++ has initialization semantics. */
7038 c_expand_return (retval)
7041 extern struct nesting *cond_stack, *loop_stack, *case_stack;
7042 extern tree dtor_label, ctor_label;
7043 tree result = DECL_RESULT (current_function_decl);
7044 tree valtype = TREE_TYPE (result);
7046 if (TREE_THIS_VOLATILE (current_function_decl))
7047 warning ("function declared `noreturn' has a `return' statement");
7049 if (retval == error_mark_node)
7051 current_function_returns_null = 1;
7055 if (processing_template_decl)
7057 add_tree (build_min_nt (RETURN_STMT, retval));
7061 if (retval == NULL_TREE)
7063 /* A non-named return value does not count. */
7065 /* Can't just return from a destructor. */
7068 expand_goto (dtor_label);
7072 if (DECL_CONSTRUCTOR_P (current_function_decl))
7073 retval = current_class_ptr;
7074 else if (DECL_NAME (result) != NULL_TREE
7075 && TREE_CODE (valtype) != VOID_TYPE)
7079 current_function_returns_null = 1;
7081 if (valtype != NULL_TREE && TREE_CODE (valtype) != VOID_TYPE)
7083 if (DECL_NAME (DECL_RESULT (current_function_decl)) == NULL_TREE)
7085 pedwarn ("`return' with no value, in function returning non-void");
7086 /* Clear this, so finish_function won't say that we
7087 reach the end of a non-void function (which we don't,
7088 we gave a return!). */
7089 current_function_returns_null = 0;
7093 expand_null_return ();
7097 else if (DECL_CONSTRUCTOR_P (current_function_decl)
7098 && retval != current_class_ptr)
7100 if (flag_this_is_variable)
7101 error ("return from a constructor: use `this = ...' instead");
7103 error ("return from a constructor");
7104 retval = current_class_ptr;
7107 /* Effective C++ rule 15. See also start_function. */
7109 && DECL_NAME (current_function_decl) == ansi_opname[(int) MODIFY_EXPR]
7110 && retval != current_class_ref)
7111 cp_warning ("`operator=' should return a reference to `*this'");
7113 if (valtype == NULL_TREE || TREE_CODE (valtype) == VOID_TYPE)
7115 current_function_returns_null = 1;
7116 if ((pedantic && ! DECL_ARTIFICIAL (current_function_decl))
7117 || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7118 pedwarn ("`return' with a value, in function returning void");
7119 expand_return (retval);
7122 /* Add some useful error checking for C++. */
7123 else if (TREE_CODE (valtype) == REFERENCE_TYPE)
7125 tree whats_returned;
7126 tree tmp_result = result;
7128 /* Don't initialize directly into a non-BLKmode retval, since that
7129 could lose when being inlined by another caller. (GCC can't
7130 read the function return register in an inline function when
7131 the return value is being ignored). */
7132 if (result && TYPE_MODE (TREE_TYPE (tmp_result)) != BLKmode)
7135 /* convert to reference now, so we can give error if we
7136 return an reference to a non-lvalue. */
7137 retval = convert_for_initialization
7138 (tmp_result, valtype, retval, LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING,
7139 "return", NULL_TREE, 0);
7141 /* Sort through common things to see what it is
7142 we are returning. */
7143 whats_returned = retval;
7144 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7146 whats_returned = TREE_OPERAND (whats_returned, 1);
7147 if (TREE_CODE (whats_returned) == ADDR_EXPR)
7148 whats_returned = TREE_OPERAND (whats_returned, 0);
7150 if (TREE_CODE (whats_returned) == CONVERT_EXPR)
7151 whats_returned = TREE_OPERAND (whats_returned, 0);
7152 if (TREE_CODE (whats_returned) == ADDR_EXPR)
7154 whats_returned = TREE_OPERAND (whats_returned, 0);
7155 while (TREE_CODE (whats_returned) == NEW_EXPR
7156 || TREE_CODE (whats_returned) == TARGET_EXPR)
7158 /* Get the target. */
7159 whats_returned = TREE_OPERAND (whats_returned, 0);
7160 warning ("returning reference to temporary");
7164 if (TREE_CODE (whats_returned) == VAR_DECL && DECL_NAME (whats_returned))
7166 if (TEMP_NAME_P (DECL_NAME (whats_returned)))
7167 warning ("reference to non-lvalue returned");
7168 else if (! TREE_STATIC (whats_returned)
7169 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned))
7170 && !TREE_PUBLIC (whats_returned))
7171 cp_warning_at ("reference to local variable `%D' returned", whats_returned);
7174 else if (TREE_CODE (retval) == ADDR_EXPR)
7176 tree whats_returned = TREE_OPERAND (retval, 0);
7178 if (TREE_CODE (whats_returned) == VAR_DECL
7179 && DECL_NAME (whats_returned)
7180 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned))
7181 && !TREE_STATIC (whats_returned)
7182 && !TREE_PUBLIC (whats_returned))
7183 cp_warning_at ("address of local variable `%D' returned", whats_returned);
7185 else if (TREE_CODE (retval) == VAR_DECL)
7187 if (TREE_CODE (TREE_TYPE (retval)) == ARRAY_TYPE
7188 && DECL_NAME (retval)
7189 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (retval))
7190 && !TREE_STATIC (retval)
7191 && !TREE_PUBLIC (retval))
7192 cp_warning_at ("address of local array `%D' returned", retval);
7195 /* Now deal with possible C++ hair:
7196 (1) Compute the return value.
7197 (2) If there are aggregate values with destructors which
7198 must be cleaned up, clean them (taking care
7199 not to clobber the return value).
7200 (3) If an X(X&) constructor is defined, the return
7201 value must be returned via that. */
7203 if (retval == result
7204 || DECL_CONSTRUCTOR_P (current_function_decl))
7205 /* It's already done for us. */;
7206 else if (TREE_TYPE (retval) == void_type_node)
7208 pedwarn ("return of void value in function returning non-void");
7209 expand_expr_stmt (retval);
7214 /* We already did this above for refs, don't do it again. */
7215 if (TREE_CODE (valtype) != REFERENCE_TYPE)
7216 retval = convert_for_initialization
7217 (NULL_TREE, valtype, retval, LOOKUP_NORMAL|LOOKUP_ONLYCONVERTING,
7218 "return", NULL_TREE, 0);
7220 /* We can't initialize a register from a NEW_EXPR. */
7221 if (! current_function_returns_struct
7222 && TREE_CODE (retval) == TARGET_EXPR
7223 && TREE_CODE (TREE_OPERAND (retval, 1)) == NEW_EXPR)
7224 retval = build (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7225 TREE_OPERAND (retval, 0));
7227 if (retval == error_mark_node)
7229 /* Avoid warning about control reaching end of function. */
7230 expand_null_return ();
7235 if (retval != NULL_TREE
7236 && TREE_CODE_CLASS (TREE_CODE (retval)) == 'd'
7237 && cond_stack == 0 && loop_stack == 0 && case_stack == 0)
7238 current_function_return_value = retval;
7240 if (ctor_label && TREE_CODE (ctor_label) != ERROR_MARK)
7242 /* Here RETVAL is CURRENT_CLASS_PTR, so there's nothing to do. */
7243 expand_goto (ctor_label);
7246 if (retval && retval != result)
7248 result = build (INIT_EXPR, TREE_TYPE (result), result, retval);
7249 TREE_SIDE_EFFECTS (result) = 1;
7251 expand_return (result);
7252 current_function_returns_value = 1;
7255 /* Start a C switch statement, testing expression EXP.
7256 Return EXP if it is valid, an error node otherwise. */
7259 c_expand_start_case (exp)
7263 register enum tree_code code;
7265 /* Convert from references, etc. */
7266 exp = default_conversion (exp);
7267 type = TREE_TYPE (exp);
7268 code = TREE_CODE (type);
7270 if (IS_AGGR_TYPE_CODE (code))
7271 exp = build_type_conversion (CONVERT_EXPR, integer_type_node, exp, 1);
7273 if (exp == NULL_TREE)
7275 error ("switch quantity not an integer");
7276 exp = error_mark_node;
7278 type = TREE_TYPE (exp);
7279 code = TREE_CODE (type);
7281 if (code != INTEGER_TYPE && code != ENUMERAL_TYPE && code != ERROR_MARK)
7283 error ("switch quantity not an integer");
7284 exp = error_mark_node;
7290 exp = default_conversion (exp);
7291 type = TREE_TYPE (exp);
7292 idx = get_unwidened (exp, 0);
7293 /* We can't strip a conversion from a signed type to an unsigned,
7294 because if we did, int_fits_type_p would do the wrong thing
7295 when checking case values for being in range,
7296 and it's too hard to do the right thing. */
7297 if (TREE_UNSIGNED (TREE_TYPE (exp))
7298 == TREE_UNSIGNED (TREE_TYPE (idx)))
7303 (1, fold (build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp)),
7304 type, "switch statement");
7309 /* CONSTP remembers whether or not all the intervening pointers in the `to'
7310 type have been const. */
7313 comp_ptr_ttypes_real (to, from, constp)
7317 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7319 if (TREE_CODE (to) != TREE_CODE (from))
7322 if (TREE_CODE (from) == OFFSET_TYPE
7323 && comptypes (TYPE_OFFSET_BASETYPE (from),
7324 TYPE_OFFSET_BASETYPE (to), 1))
7327 /* Const and volatile mean something different for function types,
7328 so the usual checks are not appropriate. */
7329 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7331 if (TYPE_READONLY (from) > TYPE_READONLY (to)
7332 || TYPE_VOLATILE (from) > TYPE_VOLATILE (to))
7336 && (TYPE_READONLY (to) > TYPE_READONLY (from)
7337 || TYPE_VOLATILE (to) > TYPE_READONLY (from)))
7339 constp &= TYPE_READONLY (to);
7342 if (TREE_CODE (to) != POINTER_TYPE)
7343 return comptypes (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from), 1);
7347 /* When comparing, say, char ** to char const **, this function takes the
7348 'char *' and 'char const *'. Do not pass non-pointer types to this
7352 comp_ptr_ttypes (to, from)
7355 return comp_ptr_ttypes_real (to, from, 1);
7358 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7359 type or inheritance-related types, regardless of cv-quals. */
7362 ptr_reasonably_similar (to, from)
7365 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7367 if (TREE_CODE (to) != TREE_CODE (from))
7370 if (TREE_CODE (from) == OFFSET_TYPE
7371 && comptypes (TYPE_OFFSET_BASETYPE (to),
7372 TYPE_OFFSET_BASETYPE (from), -1))
7375 if (TREE_CODE (to) != POINTER_TYPE)
7377 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from), -1);
7381 /* Like comp_ptr_ttypes, for const_cast. */
7384 comp_ptr_ttypes_const (to, from)
7387 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7389 if (TREE_CODE (to) != TREE_CODE (from))
7392 if (TREE_CODE (from) == OFFSET_TYPE
7393 && comptypes (TYPE_OFFSET_BASETYPE (from),
7394 TYPE_OFFSET_BASETYPE (to), 1))
7397 if (TREE_CODE (to) != POINTER_TYPE)
7398 return comptypes (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from), 1);
7402 /* Like comp_ptr_ttypes, for reinterpret_cast. */
7405 comp_ptr_ttypes_reinterpret (to, from)
7410 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7412 if (TREE_CODE (from) == OFFSET_TYPE)
7413 from = TREE_TYPE (from);
7414 if (TREE_CODE (to) == OFFSET_TYPE)
7415 to = TREE_TYPE (to);
7417 if (TREE_CODE (to) != TREE_CODE (from))
7420 /* Const and volatile mean something different for function types,
7421 so the usual checks are not appropriate. */
7422 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7424 if (TYPE_READONLY (from) > TYPE_READONLY (to)
7425 || TYPE_VOLATILE (from) > TYPE_VOLATILE (to))
7429 && (TYPE_READONLY (to) > TYPE_READONLY (from)
7430 || TYPE_VOLATILE (to) > TYPE_READONLY (from)))
7432 constp &= TYPE_READONLY (to);
7435 if (TREE_CODE (to) != POINTER_TYPE)